TDMA scheduling algorithms for wireless sensor networks
Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In se...
Saved in:
| Published in: | Wireless networks Vol. 16; no. 4; pp. 985 - 997 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Boston
Springer US
01.05.2010
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1022-0038, 1572-8196 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflict-free assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NP-complete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or node-based scheduling, which is adapted from classical multi-hop scheduling algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or level-based scheduling, which is a novel scheduling algorithm for many-to-one communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10–70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network. |
|---|---|
| AbstractList | Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflict-free assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NP-complete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or node-based scheduling, which is adapted from classical multi-hop scheduling algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or level-based scheduling, which is a novel scheduling algorithm for many-to-one communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10-70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network. Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflict-free assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NP-complete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or node-based scheduling, which is adapted from classical multi-hop scheduling algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or level-based scheduling, which is a novel scheduling algorithm for many-to-one communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10-70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network.[PUBLICATION ABSTRACT] |
| Author | Ergen, Sinem Coleri Varaiya, Pravin |
| Author_xml | – sequence: 1 givenname: Sinem Coleri surname: Ergen fullname: Ergen, Sinem Coleri email: csinem@eecs.berkeley.edu organization: Wireless Sensor Networks Lab, sponsored by Pirelli and Telecom Italia – sequence: 2 givenname: Pravin surname: Varaiya fullname: Varaiya, Pravin organization: University of California |
| BookMark | eNp9kEtLAzEUhYMo2FZ_gLvBjavRm2ReWZb6hIqbug7pTNKmTpOaO0Px35syglDQ1X2d73A5Y3LqvNOEXFG4pQDlHVLKyiIFECnQiqdwQkY0L1laUVGcxh4Yi1denZMx4gYAKi7EiJSL-9dpgvVaN31r3SpR7coH2623mBgfkr0NutWICWqHcXa62_vwgRfkzKgW9eVPnZD3x4fF7Dmdvz29zKbztOYCulQ1NGdmyZmqQTAGWcMyU7JMURoXRVMZbVSWLfNqmdOsYKAL01SUG86FESLjE3Iz-O6C_-w1dnJrsdZtq5z2Pcoy42UBeSGi8vpIufF9cPE5yWi0q4Ae7MpBVAePGLSRte1UZ73rgrKtpCAPccohThnjlIc4JUSSHpG7YLcqfP3LsIHBqHUrHX5f-hv6BlLDh58 |
| CitedBy_id | crossref_primary_10_1007_s11276_015_1056_3 crossref_primary_10_1145_3689635 crossref_primary_10_1109_TWC_2014_2318036 crossref_primary_10_1155_2015_724628 crossref_primary_10_1109_TMC_2013_81 crossref_primary_10_3390_electronics9040683 crossref_primary_10_1007_s11276_012_0438_z crossref_primary_10_1016_j_adhoc_2023_103372 crossref_primary_10_1007_s11277_021_08620_y crossref_primary_10_1016_j_comnet_2025_111059 crossref_primary_10_1109_TCCN_2023_3326302 crossref_primary_10_1016_j_peva_2015_02_001 crossref_primary_10_1002_wcm_2524 crossref_primary_10_4028_www_scientific_net_AMR_989_994_4727 crossref_primary_10_1016_j_ejor_2018_05_047 crossref_primary_10_1109_TMC_2014_2338315 crossref_primary_10_1007_s11277_014_1865_1 crossref_primary_10_1109_ACCESS_2017_2758340 crossref_primary_10_1155_2023_3110383 crossref_primary_10_1016_j_comnet_2019_04_005 crossref_primary_10_1109_COMST_2017_2759725 crossref_primary_10_1109_JIOT_2021_3068525 crossref_primary_10_3390_s16122190 crossref_primary_10_3390_s18103338 crossref_primary_10_1587_transcom_2017ITP0011 crossref_primary_10_1109_JIOT_2018_2870289 crossref_primary_10_1007_s11276_013_0593_x crossref_primary_10_4018_IJITN_2019040102 crossref_primary_10_1145_3283451 crossref_primary_10_1109_TVT_2012_2183400 crossref_primary_10_1364_JOCN_9_000172 crossref_primary_10_3390_s150509703 crossref_primary_10_3390_s18041209 crossref_primary_10_1186_s42162_024_00412_5 crossref_primary_10_1109_TMC_2011_190 crossref_primary_10_1109_TWC_2024_3403150 crossref_primary_10_1155_2013_684503 crossref_primary_10_1155_2010_578370 crossref_primary_10_3390_s18124284 crossref_primary_10_1007_s13198_021_01346_x crossref_primary_10_1155_2015_234143 crossref_primary_10_1016_j_ifacol_2017_08_1847 crossref_primary_10_1109_ACCESS_2019_2932079 crossref_primary_10_1109_TII_2015_2404800 crossref_primary_10_1109_JIOT_2021_3050274 crossref_primary_10_1109_TPDS_2011_78 crossref_primary_10_1007_s11235_013_9712_3 crossref_primary_10_1016_j_jpdc_2015_05_004 crossref_primary_10_1109_TVT_2013_2288259 crossref_primary_10_4028_www_scientific_net_AMM_530_531_739 crossref_primary_10_1016_j_ejor_2015_05_026 crossref_primary_10_1109_TVT_2020_2963841 crossref_primary_10_1109_JSEN_2025_3568167 crossref_primary_10_1109_TII_2014_2382335 crossref_primary_10_1016_j_comnet_2023_109774 crossref_primary_10_4028_www_scientific_net_AMR_989_994_4253 crossref_primary_10_1155_2013_982713 crossref_primary_10_1109_TII_2016_2576964 crossref_primary_10_1109_TEVC_2012_2227973 crossref_primary_10_1016_j_comnet_2020_107659 crossref_primary_10_3390_s17020395 crossref_primary_10_3390_s18124315 crossref_primary_10_1007_s11277_020_07100_z crossref_primary_10_1016_j_ins_2014_02_006 crossref_primary_10_1155_2014_693212 crossref_primary_10_3390_s110302505 crossref_primary_10_1016_j_ifacol_2022_08_014 crossref_primary_10_1109_JIOT_2021_3115824 crossref_primary_10_1109_TII_2017_2725907 crossref_primary_10_1016_j_camwa_2012_03_083 crossref_primary_10_1002_itl2_102 crossref_primary_10_1155_2015_837074 crossref_primary_10_1109_COMST_2017_2780114 crossref_primary_10_1109_TVT_2018_2888622 crossref_primary_10_1016_j_jksuci_2019_11_014 crossref_primary_10_1109_TETC_2013_2273219 crossref_primary_10_1016_j_jnca_2013_02_017 crossref_primary_10_1016_j_eswa_2022_118627 crossref_primary_10_1109_JSEN_2017_2759327 crossref_primary_10_1016_j_comcom_2017_10_004 crossref_primary_10_1109_JSYST_2017_2751645 crossref_primary_10_3390_app11178174 crossref_primary_10_1145_3450350 crossref_primary_10_1109_TNET_2017_2754405 crossref_primary_10_1109_ACCESS_2021_3061943 crossref_primary_10_1155_2012_919815 crossref_primary_10_1007_s12083_019_00818_z crossref_primary_10_1016_j_adhoc_2012_07_004 crossref_primary_10_1109_TPDS_2014_2385692 crossref_primary_10_1007_s11277_019_06906_w crossref_primary_10_1155_2022_9332917 crossref_primary_10_1109_SURV_2012_022412_00068 crossref_primary_10_1016_j_amc_2014_03_024 crossref_primary_10_1109_TII_2020_2973754 crossref_primary_10_1109_ACCESS_2022_3146398 crossref_primary_10_1109_JSEN_2017_2722462 crossref_primary_10_1007_s00453_017_0373_6 crossref_primary_10_1155_2014_512687 crossref_primary_10_1145_3360722 crossref_primary_10_3233_HIS_230015 crossref_primary_10_1109_ACCESS_2021_3114967 crossref_primary_10_1155_2015_178368 crossref_primary_10_1007_s11276_015_0925_0 crossref_primary_10_3390_fi12050086 crossref_primary_10_1088_1742_6596_2833_1_012008 crossref_primary_10_1016_j_ifacol_2017_08_1484 crossref_primary_10_1109_TNSM_2018_2884445 crossref_primary_10_1109_JSEN_2014_2358253 crossref_primary_10_1109_TVT_2020_3047149 crossref_primary_10_3390_app10010272 crossref_primary_10_1109_TPDS_2011_165 crossref_primary_10_1007_s11276_012_0524_2 crossref_primary_10_1002_wcm_2190 crossref_primary_10_1007_s11277_013_1052_9 crossref_primary_10_1109_TNET_2012_2220155 crossref_primary_10_1109_TWC_2017_2688442 crossref_primary_10_1049_iet_net_2017_0090 crossref_primary_10_1109_ACCESS_2022_3211654 crossref_primary_10_1016_j_comcom_2012_06_008 crossref_primary_10_1155_2011_107062 crossref_primary_10_1145_3604567 crossref_primary_10_3390_a7010145 crossref_primary_10_3390_app9112379 crossref_primary_10_1016_j_iot_2021_100398 crossref_primary_10_1371_journal_pone_0188760 crossref_primary_10_1016_j_procs_2015_09_070 crossref_primary_10_1016_j_comnet_2021_108172 crossref_primary_10_1109_TIE_2012_2208439 crossref_primary_10_1145_3569471 crossref_primary_10_1109_TMC_2010_42 crossref_primary_10_3390_s17071582 crossref_primary_10_1016_j_watres_2024_122312 crossref_primary_10_1109_JIOT_2022_3175669 crossref_primary_10_1007_s11276_022_02941_x crossref_primary_10_1109_ACCESS_2021_3068515 crossref_primary_10_1155_2023_9366391 crossref_primary_10_1007_s11277_013_1573_2 crossref_primary_10_1186_s13638_020_01788_0 crossref_primary_10_1109_TIT_2022_3160398 crossref_primary_10_1109_ACCESS_2016_2622720 crossref_primary_10_5402_2012_864694 crossref_primary_10_1016_j_adhoc_2014_09_011 crossref_primary_10_1016_j_asoc_2020_106470 crossref_primary_10_1007_s11036_023_02109_7 crossref_primary_10_1002_wcm_2613 crossref_primary_10_1007_s42452_020_03923_4 |
| Cites_doi | 10.1109/LCOMM.2005.10007 10.1109/90.222924 10.1109/TMC.2006.100 10.1109/TCOMM.2003.816950 10.1109/GLOCOM.2001.965963 10.1109/IPDPS.2002.1016537 10.1109/MWC.2002.1043857 10.1016/j.comcom.2006.10.006 10.1016/j.comnet.2007.10.011 10.1109/26.52656 10.1109/JSAC.2004.826932 10.1109/WICOM.2007.685 10.1109/TPDS.2003.1206502 10.1109/TCOMM.2004.826234 10.1145/1161089.1161119 10.1109/TNET.2002.801419 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2009 Springer Science+Business Media, LLC 2010 |
| Copyright_xml | – notice: The Author(s) 2009 – notice: Springer Science+Business Media, LLC 2010 |
| DBID | C6C AAYXX CITATION 3V. 7SC 7SP 7WY 7WZ 7XB 87Z 88I 8AO 8FD 8FE 8FG 8FK 8FL ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ L.- L7M L~C L~D M0C M2P P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI Q9U |
| DOI | 10.1007/s11276-009-0183-0 |
| DatabaseName | Springer Nature OA Free Journals CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Electronics & Communications Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology collection ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global (OCUL) Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic |
| DatabaseTitle | CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Science Journals (Alumni Edition) ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest One Academic Eastern Edition Electronics & Communications Abstracts ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) Business Premium Collection (Alumni) |
| DatabaseTitleList | Technology Research Database ABI/INFORM Global (Corporate) |
| Database_xml | – sequence: 1 dbid: BENPR name: AUTh Library subscriptions: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1572-8196 |
| EndPage | 997 |
| ExternalDocumentID | 2030456101 10_1007_s11276_009_0183_0 |
| Genre | Feature |
| GroupedDBID | -59 -5G -BR -EM -ET -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 1SB 2.D 203 28- 29R 29~ 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 85S 88I 8AO 8FE 8FG 8FL 8FW 8TC 8UJ 8US 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAHTB AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABGDV ABHFT ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABPEJ ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACKNC ACM ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACSNA ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADL ADMLS ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWIH AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARAPS ARCEE ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GXS H13 HCIFZ HF~ HG5 HG6 HGAVV HMJXF HQYDN HRMNR HVGLF HZ~ I-F I07 I09 IHE IJ- IKXTQ ITG ITH ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6~ KDC KOV KOW KZ1 LAK LLZTM M0C M2P M4Y MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 Q2X QF4 QM1 QN7 QO4 QOK QOS R4E R89 R9I RHV RIG RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCO SCV SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TAE TEORI TN5 TSG TSK TSV TUC TUS U2A U5U UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 W7O WK8 YIN YLTOR Z45 Z7R Z7X Z7Z Z83 Z88 Z8M Z8R Z8T Z8W Z92 ZMTXR ZY4 _50 ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AETEA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7SP 7XB 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI Q9U |
| ID | FETCH-LOGICAL-c390t-ad152fb32ac092204d24f724a11c096d8fefa44b58b514620e6fd813f339f9943 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 238 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000277454200008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1022-0038 |
| IngestDate | Sun Nov 09 10:14:06 EST 2025 Tue Nov 04 16:26:52 EST 2025 Tue Nov 18 21:12:09 EST 2025 Sat Nov 29 04:44:12 EST 2025 Fri Feb 21 02:31:32 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | MAC protocol Scheduling algorithm Sensor network |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c390t-ad152fb32ac092204d24f724a11c096d8fefa44b58b514620e6fd813f339f9943 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| OpenAccessLink | https://link.springer.com/10.1007/s11276-009-0183-0 |
| PQID | 213398014 |
| PQPubID | 26318 |
| PageCount | 13 |
| ParticipantIDs | proquest_miscellaneous_743760569 proquest_journals_213398014 crossref_citationtrail_10_1007_s11276_009_0183_0 crossref_primary_10_1007_s11276_009_0183_0 springer_journals_10_1007_s11276_009_0183_0 |
| PublicationCentury | 2000 |
| PublicationDate | 20100500 2010-5-00 20100501 |
| PublicationDateYYYYMMDD | 2010-05-01 |
| PublicationDate_xml | – month: 5 year: 2010 text: 20100500 |
| PublicationDecade | 2010 |
| PublicationPlace | Boston |
| PublicationPlace_xml | – name: Boston – name: New York |
| PublicationSubtitle | The Journal of Mobile Communication, Computation and Information |
| PublicationTitle | Wireless networks |
| PublicationTitleAbbrev | Wireless Netw |
| PublicationYear | 2010 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Krishnamachari, B., Wicker, S. B., & Bejar, B. (2001). Phase transition phenomena in wireless Ad-Hoc networks. Symposium on Ad-Hoc wireless networks, GlobeCom2001, San Antonio, Texas, November. Hedetniemi, S. T., Jacobs, D.P., & Srimani, P. K. (2002). Fault tolerant distributed coloring algorithms that stabilize in linear time. International parallel and distributed processing symposium (IPDPS), April. FattahH.LeungC.An overview of scheduling algorithms in wireless multimedia networksIEEE Wireless Communications200295768310.1109/MWC.2002.1043857 RamanathanS.LloydE. L.Scheduling algorithms for multihop radio networksIEEE/ACM Transactions on Networking19931216617710.1109/90.222924 GandhamS.ZhangY.HuangQ.Distributed time-optimal scheduling for convergecast in wireless sensor networksComputer Networks20085236106291140.68342 ChakrabortyG.Genetic algorithm to solve optimum TDMA transmission schedule in broadcast packet radio NetworksIEEE Transactions on Communications200452576577710.1109/TCOMM.2004.826234 NgoC. Y.LiV. O. K.Centralized broadcast scheduling in packet radio networks via genetic-fix algorithmsIEEE Transactions on Communications20035191439144110.1109/TCOMM.2003.816950 MaoJ.WuZ.WuX.A TDMA scheduling scheme for many-to-one communications in wireless sensor networksComputer Communications200730486387210.1016/j.comcom.2006.10.006 GandhamS.DawandeM.PrakashR.Link scheduling in sensor networks: Distributed edge colering revisitedEEE INFOCOM2005424922762 LAN-MAN Standards Committee of the IEEE Computer Society. (1997). Wireless LAN medium access control (MAC) and physical layer(PHY) specification (1997 ed.). New York, NY, USA: IEEE, IEEE Std 802.11. TavliB.HeinzelmanW. B.MH-TRACE: Multihop time reservation using adaptive control for energy efficiencyIEEE Journal on Selected Areas in Communications200422594295310.1109/JSAC.2004.826932 RamaswamiR.ParhiK. K.Distributed scheduling of broadcasts in a radio networkINFOCOM19892497504 Wang, Y., & Henning, I. (2007). A deterministic distributed TDMA scheduling algorithm for wireless sensor networks. IEEE WiCom, 2759–2762. BansalS.KumarP.SinghK.An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systemsIEEE Transactions on Parallel and Distributed Systems200314653354410.1109/TPDS.2003.1206502 Uysal BiyikogluE.PrabhakarB.El GamalA.Energy-efficient packet transmission over a wireless linkIEEE/ACM Transactions on Networking2002101248749910.1109/TNET.2002.801419 Narayanaswamy, S., Kawadia, V., Sreenivas, R. S., & Kumar, P. R. (2002). Power control in Ad-Hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol. Proceedings of European wireless, Italy, February. Polastre, J., Szewczyk, R., Sharp, C., & Culler, D. (2004). The mote revolution: Low power wireless sensor network devices, hot chips 16: A symposium on high performance chips, August. Choi, H., Wang, J., & Hughes, E. A. (2005). Scheduling on sensor hybrid networks. IEEE ICCCN, 503–508. EphremidesA.TruongT. V.Scheduling broadcasts in multihop radio networksIEEE Transactions on Communications199038445646010.1109/26.52656 ErgenS. C.VaraiyaP.On multi-hop routing for energy efficiencyIEEE Communications Letters200591088088110.1109/LCOMM.2005.10007 Wang, W., Wang, Y., Li, X., Song, W., & Frieder, O. (2006). Efficient interference-aware TDMA link scheduling for static wireless networks. IEEE GLOBECOM, 262–273. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows, Prentice Hall, Inc. Wu, Z., & Raychaudhuri, D. (2004). D-LSMA: Distributed link scheduling multiple access protocol for QoS in Ad-hoc networks. IEEE GLOBECOM, 1670–1675. Cheung, S. Y., Coleri, S., Dundar, B., Ganesh, S., Tan, C.W., & Varaiya, P. (2006). Traffic measurement and vehicle classification with a single magnetic sensor. Journal of Transportation Research Board, 1917. ErgenS. C.VaraiyaP.PEDAMACS: Power efficient and delay aware medium access protocol for sensor networksIEEE Transactions on Mobile Computing20075792093010.1109/TMC.2006.100 S. Gandham (183_CR10) 2005; 4 S. Ramanathan (183_CR7) 1993; 1 183_CR2 S. Gandham (183_CR20) 2008; 52 G. Chakraborty (183_CR9) 2004; 52 B. Tavli (183_CR15) 2004; 22 183_CR17 183_CR19 183_CR1 S. C. Ergen (183_CR6) 2005; 9 H. Fattah (183_CR5) 2002; 9 183_CR11 183_CR12 J. Mao (183_CR18) 2007; 30 E. Uysal Biyikoglu (183_CR4) 2002; 10 183_CR16 S. C. Ergen (183_CR3) 2007; 5 R. Ramaswami (183_CR13) 1989; 2 A. Ephremides (183_CR14) 1990; 38 C. Y. Ngo (183_CR8) 2003; 51 S. Bansal (183_CR21) 2003; 14 183_CR22 183_CR23 183_CR24 183_CR25 |
| References_xml | – reference: ErgenS. C.VaraiyaP.On multi-hop routing for energy efficiencyIEEE Communications Letters200591088088110.1109/LCOMM.2005.10007 – reference: TavliB.HeinzelmanW. B.MH-TRACE: Multihop time reservation using adaptive control for energy efficiencyIEEE Journal on Selected Areas in Communications200422594295310.1109/JSAC.2004.826932 – reference: Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows, Prentice Hall, Inc. – reference: Wang, Y., & Henning, I. (2007). A deterministic distributed TDMA scheduling algorithm for wireless sensor networks. IEEE WiCom, 2759–2762. – reference: ChakrabortyG.Genetic algorithm to solve optimum TDMA transmission schedule in broadcast packet radio NetworksIEEE Transactions on Communications200452576577710.1109/TCOMM.2004.826234 – reference: FattahH.LeungC.An overview of scheduling algorithms in wireless multimedia networksIEEE Wireless Communications200295768310.1109/MWC.2002.1043857 – reference: Uysal BiyikogluE.PrabhakarB.El GamalA.Energy-efficient packet transmission over a wireless linkIEEE/ACM Transactions on Networking2002101248749910.1109/TNET.2002.801419 – reference: RamaswamiR.ParhiK. K.Distributed scheduling of broadcasts in a radio networkINFOCOM19892497504 – reference: LAN-MAN Standards Committee of the IEEE Computer Society. (1997). Wireless LAN medium access control (MAC) and physical layer(PHY) specification (1997 ed.). New York, NY, USA: IEEE, IEEE Std 802.11. – reference: GandhamS.DawandeM.PrakashR.Link scheduling in sensor networks: Distributed edge colering revisitedEEE INFOCOM2005424922762 – reference: BansalS.KumarP.SinghK.An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systemsIEEE Transactions on Parallel and Distributed Systems200314653354410.1109/TPDS.2003.1206502 – reference: MaoJ.WuZ.WuX.A TDMA scheduling scheme for many-to-one communications in wireless sensor networksComputer Communications200730486387210.1016/j.comcom.2006.10.006 – reference: NgoC. Y.LiV. O. K.Centralized broadcast scheduling in packet radio networks via genetic-fix algorithmsIEEE Transactions on Communications20035191439144110.1109/TCOMM.2003.816950 – reference: EphremidesA.TruongT. V.Scheduling broadcasts in multihop radio networksIEEE Transactions on Communications199038445646010.1109/26.52656 – reference: GandhamS.ZhangY.HuangQ.Distributed time-optimal scheduling for convergecast in wireless sensor networksComputer Networks20085236106291140.68342 – reference: Narayanaswamy, S., Kawadia, V., Sreenivas, R. S., & Kumar, P. R. (2002). Power control in Ad-Hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol. Proceedings of European wireless, Italy, February. – reference: Wang, W., Wang, Y., Li, X., Song, W., & Frieder, O. (2006). Efficient interference-aware TDMA link scheduling for static wireless networks. IEEE GLOBECOM, 262–273. – reference: Hedetniemi, S. T., Jacobs, D.P., & Srimani, P. K. (2002). Fault tolerant distributed coloring algorithms that stabilize in linear time. International parallel and distributed processing symposium (IPDPS), April. – reference: ErgenS. C.VaraiyaP.PEDAMACS: Power efficient and delay aware medium access protocol for sensor networksIEEE Transactions on Mobile Computing20075792093010.1109/TMC.2006.100 – reference: Cheung, S. Y., Coleri, S., Dundar, B., Ganesh, S., Tan, C.W., & Varaiya, P. (2006). Traffic measurement and vehicle classification with a single magnetic sensor. Journal of Transportation Research Board, 1917. – reference: RamanathanS.LloydE. L.Scheduling algorithms for multihop radio networksIEEE/ACM Transactions on Networking19931216617710.1109/90.222924 – reference: Wu, Z., & Raychaudhuri, D. (2004). D-LSMA: Distributed link scheduling multiple access protocol for QoS in Ad-hoc networks. IEEE GLOBECOM, 1670–1675. – reference: Polastre, J., Szewczyk, R., Sharp, C., & Culler, D. (2004). The mote revolution: Low power wireless sensor network devices, hot chips 16: A symposium on high performance chips, August. – reference: Choi, H., Wang, J., & Hughes, E. A. (2005). Scheduling on sensor hybrid networks. IEEE ICCCN, 503–508. – reference: Krishnamachari, B., Wicker, S. B., & Bejar, B. (2001). Phase transition phenomena in wireless Ad-Hoc networks. Symposium on Ad-Hoc wireless networks, GlobeCom2001, San Antonio, Texas, November. – ident: 183_CR2 – volume: 9 start-page: 880 issue: 10 year: 2005 ident: 183_CR6 publication-title: IEEE Communications Letters doi: 10.1109/LCOMM.2005.10007 – volume: 1 start-page: 166 issue: 2 year: 1993 ident: 183_CR7 publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/90.222924 – volume: 5 start-page: 920 issue: 7 year: 2007 ident: 183_CR3 publication-title: IEEE Transactions on Mobile Computing doi: 10.1109/TMC.2006.100 – volume: 51 start-page: 1439 issue: 9 year: 2003 ident: 183_CR8 publication-title: IEEE Transactions on Communications doi: 10.1109/TCOMM.2003.816950 – ident: 183_CR25 doi: 10.1109/GLOCOM.2001.965963 – ident: 183_CR16 – ident: 183_CR22 – ident: 183_CR24 – volume: 4 start-page: 2492 year: 2005 ident: 183_CR10 publication-title: EEE INFOCOM – ident: 183_CR23 doi: 10.1109/IPDPS.2002.1016537 – volume: 9 start-page: 76 issue: 5 year: 2002 ident: 183_CR5 publication-title: IEEE Wireless Communications doi: 10.1109/MWC.2002.1043857 – volume: 30 start-page: 863 issue: 4 year: 2007 ident: 183_CR18 publication-title: Computer Communications doi: 10.1016/j.comcom.2006.10.006 – ident: 183_CR1 – volume: 2 start-page: 497 year: 1989 ident: 183_CR13 publication-title: INFOCOM – volume: 52 start-page: 610 issue: 3 year: 2008 ident: 183_CR20 publication-title: Computer Networks doi: 10.1016/j.comnet.2007.10.011 – volume: 38 start-page: 456 issue: 4 year: 1990 ident: 183_CR14 publication-title: IEEE Transactions on Communications doi: 10.1109/26.52656 – volume: 22 start-page: 942 issue: 5 year: 2004 ident: 183_CR15 publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/JSAC.2004.826932 – ident: 183_CR11 doi: 10.1109/WICOM.2007.685 – ident: 183_CR17 – ident: 183_CR19 – volume: 14 start-page: 533 issue: 6 year: 2003 ident: 183_CR21 publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2003.1206502 – volume: 52 start-page: 765 issue: 5 year: 2004 ident: 183_CR9 publication-title: IEEE Transactions on Communications doi: 10.1109/TCOMM.2004.826234 – ident: 183_CR12 doi: 10.1145/1161089.1161119 – volume: 10 start-page: 487 issue: 12 year: 2002 ident: 183_CR4 publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/TNET.2002.801419 |
| SSID | ssj0008399 |
| Score | 2.4330113 |
| Snippet | Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 985 |
| SubjectTerms | Access control Communications Engineering Computer Communication Networks Electrical Engineering Energy consumption Engineering Genetic algorithms Heuristic IT in Business Networks Protocol Schedules Scheduling Scheduling algorithms Sensors Signal processing Studies Wireless communications Wireless networks |
| SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BYYCBN6K8lIEJZGE7xoknVB4VCxVCILFFcWwDUkkLKfx-zqnTAhIsjEn8SO7se-TO3wEcGOSkcVoSkxpJxAnTJBfaEpZqaY11aRGKTSS9XvrwoG5Cbk4V0iobmVgLajMo_D_yY47OlPJQJ6fDV-KLRvngaqigMQtzHqhMtGDu7LJ3czsRxaj9VR3uRI_Lx8CasGZ9do7xBJ3pOl0ojQn9rpim1uaPAGmtd7rL_3zjFVgKBmfUGa-QVZix5RosfoEhXIfk7uK6E6Gbi2rHn06P8v4jjjR6eqkitGkjD2fcR4kYVejz4nU5Th2vNuC-e3l3fkVCQQVSxIqOSG5QWzsd87yginMqDBcu4SJnDG9IkzrrciH0SarRjpKcWulMymKHH-KUEvEmtMpBabcgcsZoqjlz2EgY6bCPEtQ4qVjM0MhqA22omRUBbdwXvehnU5xkz4AMGZB5BmS0DYeTLsMx1MZfjXcaomdh11XZhOJtiCZPcbv4GEhe2sF7laHBlKAHJ1UbjhrGTgf4dbrtP6fbgYUmqYCyXWiN3t7tHswXH6Pn6m0_LMpP5ULmxg priority: 102 providerName: ProQuest |
| Title | TDMA scheduling algorithms for wireless sensor networks |
| URI | https://link.springer.com/article/10.1007/s11276-009-0183-0 https://www.proquest.com/docview/213398014 https://www.proquest.com/docview/743760569 |
| Volume | 16 |
| WOSCitedRecordID | wos000277454200008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1572-8196 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008399 issn: 1022-0038 databaseCode: 7WY dateStart: 19970301 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1572-8196 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008399 issn: 1022-0038 databaseCode: M0C dateStart: 19970301 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1572-8196 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008399 issn: 1022-0038 databaseCode: P5Z dateStart: 19970301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: AUTh Library subscriptions: ProQuest Central customDbUrl: eissn: 1572-8196 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008399 issn: 1022-0038 databaseCode: BENPR dateStart: 19970301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1572-8196 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008399 issn: 1022-0038 databaseCode: M2P dateStart: 19970301 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: Springer Standard Collection customDbUrl: eissn: 1572-8196 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008399 issn: 1022-0038 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwEB2xHeDAjihLlQMnUCTbcR37yCouVBU7XKI4tgGppKgpfD_jNGkBARJcLDmxnWjG9szTbAA7BjlpnBahkUaEvEV1mHJtQyq1sMY6mVXFJuJ2W97eqk4Vx13U3u61SbK8qcfBbpTFiH5L_x4ZhYjTp1HaSX8azy-uR9cvSnxVmjgRZXm7V23K_G6Jz8JorGF-MYqWsuZk4V9_uQjzlWoZ7A_3whJM2HwZ5j4kHFyB-PLobD9AQIsCxsehB2n3odd_Gjw-FwFqr4FPXNzFuy8oEN1iPx86iRercHVyfHl4GlalE8IsUmQQpgblstMRSzOiGCPcMO5ixlNK8YEw0lmXcq5bUqPGJBixwhlJIxdFyinFozWYynu5XYfAGaOJZtThIG6EwzmKE-OEohFFdaoBpKZhklV5xX15i24yzojsaZIgTRJPk4Q0YHc05WWYVOO3wZs1Y5LqfBUJQ2itfOKbBgSjt3gwvLUjzW3vtUhQNYoRqwnVgL2aVeMFfvzcxp9Gb8Js7U5A6BZMDfqvdhtmsrfBU9FvwmR8c9eE6YPjducce2fk0Lesg22ndd8sN-47a0bg9A |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4BrQQc-oKqWwr1oVxAFrZjnPhQVYiHQMCKwyJxc-PYbist2S1ZQPyo_seOs8luQYIbhx6T2LGVbzyeLzOeAfjiEEkXrKIuc4rKbW5pLq2nPLPKOx-yoik2kXa72cWFPpuBP-1ZmBhW2erEWlG7QRH_kW8JJFM6pjr5NvxNY9Go6FxtK2iMpeLY390iY6u-Hu0hvOtCHOz3dg9pU1SAFkjvRzR3uGMFm4i8YFoIJp2QIRUy5xxvKJcFH3Ip7XZm0ZZQgnkVXMaTgMMHrWWC752FF1LiaoiRgmx3ovjR1tC1cxX5XfS4tU7U-qQeFylS9zo4KUsou78NTm3bB-7Yepc7eP2ffZ838Koxp8nOWP7fwowv38HiP0kWlyDt7Z3uECTxuKnGs_ck7__AmY9-XlYELXYSkzX3Ud-TChk9XpfjwPhqGc6fZebvYa4clP4DkOCcZVbwgI2kUwH7aMlcUJonHE3IDrAWPVM0udRjSY--mWaBjoAbBNxEwA3rwMaky3CcSOSpxistyKbRKZWZINwBMnmKyiB6ePLSD64rg-ZgivxU6Q5stoI0fcGjw318crjPMH_YOz0xJ0fd4xVYaMMnGP8Ec6Ora78KL4ub0a_qaq1eDgS-P7d8_QW81UC8 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1BTxQxFH5BNEYOigpxAaEHvWga2k63Mz0QQ1g3EGCzB0iIlzqdtkqyziKzQPxp_jteZ2d2xURuHDzOTNtp5nvte9-81_cA3jlE0gWrqMucorLLLc2l9ZRnVnnnQ1Y0xSbSwSA7O9PDBfjdnoWJYZXtnlhv1G5cxH_k2wLJlI6pTrZDExUx7PU_XfyksYBUdLS21TSmEnLof90ge6t2DnoI9Xsh-p9P9vZpU2CAFkj1JzR3qL2CTUReMC0Ek07IkAqZc443lMuCD7mUtptZtCuUYF4Fl_Ek4FSC1jLBcR_B4xQpZlxcw-6XmRJAu0PXjlbketH71jpU61N7XKRI4-tApSyh7K5KnNu5f7lma43Xf_Eff6tleN6Y2WR3ui5ewoIvX8HSH8kXX0N60jveJUjuUdnGM_kkH33DmU--_6gIWvIkJnEeoR4gFTJ9vC6nAfPVCpw-yMxXYbEcl_4NkOCcZVbwgI2kUwH7aMlcUJonHE3LDrAWSVM0OdZjqY-RmWeHjuAbBN9E8A3rwIdZl4tpgpH7Gq-3gJtmr6nMDO0OkNlT3CSi5ycv_fiqMmgmpshble7Ax1ao5gP883Vr975uC56iWJmjg8HhOjxroyoY34DFyeWVfwtPiuvJeXW5Wa8MAl8fWrxuAUMbScw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=TDMA+scheduling+algorithms+for+wireless+sensor+networks&rft.jtitle=Wireless+networks&rft.au=Ergen%2C+Sinem+Coleri&rft.au=Varaiya%2C+Pravin&rft.date=2010-05-01&rft.pub=Springer+US&rft.issn=1022-0038&rft.eissn=1572-8196&rft.volume=16&rft.issue=4&rft.spage=985&rft.epage=997&rft_id=info:doi/10.1007%2Fs11276-009-0183-0&rft.externalDocID=10_1007_s11276_009_0183_0 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1022-0038&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1022-0038&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1022-0038&client=summon |