Approximation algorithms for broadcasting in duty cycled wireless sensor networks
Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has...
Uloženo v:
| Vydáno v: | Wireless networks Ročník 20; číslo 8; s. 2219 - 2236 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Boston
Springer US
01.11.2014
Springer Springer Nature B.V |
| Témata: | |
| ISSN: | 1022-0038, 1572-8196 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has been studied extensively in wireless ad-hoc networks whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast packet at the same time. Unfortunately, the problem remains NP-hard and multiple transmissions may be necessary due to different wake-up times. Henceforth, this paper considers MLBS in duty cycled WSNs and presents two approximation algorithms, BS-1 and BS-2, that produce a maximum latency of at most
(
Δ
-
1
)
T
H
and
13
T
H
respectively. Here,
Δ
is the maximum degree of nodes,
T
denotes the number of time slots in a scheduling period, and
H
is the broadcast latency lower bound obtained from the shortest path algorithm. We evaluated our algorithms under different network configurations and confirmed that the latencies achieved by our algorithms are much lower than existing schemes. In particular, compared to OTAB, the best broadcast scheduling algorithm to date, the broadcast latency and transmission times achieved by BS-1 is at least
1
17
and
2
5
that of OTAB respectively. |
|---|---|
| AbstractList | (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image) Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has been studied extensively in wireless ad-hoc networks whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast packet at the same time. Unfortunately, the problem remains NP-hard and multiple transmissions may be necessary due to different wake-up times. Henceforth, this paper considers MLBS in duty cycled WSNs and presents two approximation algorithms, BS-1 and BS-2, that produce a maximum latency of at most ... and ... respectively. Here, ... is the maximum degree of nodes, ... denotes the number of time slots in a scheduling period, and ... is the broadcast latency lower bound obtained from the shortest path algorithm. We evaluated our algorithms under different network configurations and confirmed that the latencies achieved by our algorithms are much lower than existing schemes. In particular, compared to OTAB, the best broadcast scheduling algorithm to date, the broadcast latency and transmission times achieved by BS-1 is at least ... and ... that of OTAB respectively.[PUBLICATION ABSTRACT] Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has been studied extensively in wireless ad-hoc networks whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast packet at the same time. Unfortunately, the problem remains NP-hard and multiple transmissions may be necessary due to different wake-up times. Henceforth, this paper considers MLBS in duty cycled WSNs and presents two approximation algorithms, BS-1 and BS-2, that produce a maximum latency of at most ( Δ - 1 ) T H and 13 T H respectively. Here, Δ is the maximum degree of nodes, T denotes the number of time slots in a scheduling period, and H is the broadcast latency lower bound obtained from the shortest path algorithm. We evaluated our algorithms under different network configurations and confirmed that the latencies achieved by our algorithms are much lower than existing schemes. In particular, compared to OTAB, the best broadcast scheduling algorithm to date, the broadcast latency and transmission times achieved by BS-1 is at least 1 17 and 2 5 that of OTAB respectively. (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has been studied extensively in wireless ad-hoc networks whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast packet at the same time. Unfortunately, the problem remains NP-hard and multiple transmissions may be necessary due to different wake-up times. Henceforth, this paper considers MLBS in duty cycled WSNs and presents two approximation algorithms, BS-1 and BS-2, that produce a maximum latency of at most ... and ... respectively. Here, ... is the maximum degree of nodes, ... denotes the number of time slots in a scheduling period, and ... is the broadcast latency lower bound obtained from the shortest path algorithm. We evaluated our algorithms under different network configurations and confirmed that the latencies achieved by our algorithms are much lower than existing schemes. In particular, compared to OTAB, the best broadcast scheduling algorithm to date, the broadcast latency and transmission times achieved by BS-1 is at least ... and ... that of OTAB respectively. |
| Author | Chin, Kwan-Wu Raad, Raad Zhao, Dianbo |
| Author_xml | – sequence: 1 givenname: Dianbo surname: Zhao fullname: Zhao, Dianbo organization: School of Electrical, Computer and Telecommunications Engineering, Uiversity of Wollongong – sequence: 2 givenname: Kwan-Wu surname: Chin fullname: Chin, Kwan-Wu email: kwanwu@uow.edu.au organization: School of Electrical, Computer and Telecommunications Engineering, Uiversity of Wollongong – sequence: 3 givenname: Raad surname: Raad fullname: Raad, Raad organization: School of Electrical, Computer and Telecommunications Engineering, Uiversity of Wollongong |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28892233$$DView record in Pascal Francis |
| BookMark | eNp9kV1LHDEUhkNRqB_9Ab0bKEJvpp4kM5PMpUi_QBBBr0NMzqzR2WTNyWLXX99sV6EI7VVy8TwvL-c9ZHsxRWTsI4cvHECdEudCDS3wrgUlRfv8jh3wXolW83HYq38QogWQ-j07JLoHAC3H8YBdna1WOf0KS1tCio2dFymHcrekZkq5uc3JemephLhoQmz8umwat3Ez-uYpZJyRqCGMVNmI5SnlBzpm-5OdCT-8vEfs5tvX6_Mf7cXl95_nZxet65QubV_rShjQelQoB7zVGpTnvXMge-G9l0rD1HHXA_R60lJMw4C-d5pjBx2XR-zzLrf2f1wjFbMM5HCebcS0JsMHMcqODyAq-ukNep_WOdZ2leJCS9CwDTx5oSw5O0_ZRhfIrHI9Tt4YofUohJSVUzvO5USUcTIulD_nK9mG2XAw20nMbhJTJzHbScxzNfkb8zX8f47YOVTZuMD8V_d_Sr8B1iKgQA |
| CitedBy_id | crossref_primary_10_1155_2020_3721579 crossref_primary_10_1088_1742_6596_2096_1_012008 crossref_primary_10_1007_s11276_017_1473_6 crossref_primary_10_1007_s12083_017_0565_5 crossref_primary_10_1109_ACCESS_2016_2553048 crossref_primary_10_3390_s18103516 crossref_primary_10_1016_j_comnet_2018_03_007 crossref_primary_10_3390_s18051509 crossref_primary_10_1109_ACCESS_2019_2932006 crossref_primary_10_3390_s18114055 crossref_primary_10_1093_comjnl_bxx014 crossref_primary_10_1177_1550147719841870 crossref_primary_10_1155_2018_5429546 crossref_primary_10_1155_2017_7538190 crossref_primary_10_1155_2016_6907231 |
| Cites_doi | 10.1145/313451.313525 10.1109/TMC.2008.56 10.1109/TMC.2011.270 10.1109/INFCOM.2009.5061952 10.1145/1614320.1614336 10.1109/ICDCS.2010.41 10.1109/INFCOM.2007.91 10.1145/1460412.1460414 10.1016/S0140-3664(00)00233-4 10.1145/1182807.1182817 10.1145/1031495.1031501 10.1109/WCNC.2003.1200529 10.1109/TPDS.2011.106 10.1109/MCOM.2013.6553686 10.1007/BF01386390 10.1109/INFCOM.2007.92 10.1145/1322263.1322294 10.1145/1267060.1267063 10.1109/INFCOM.2009.5062211 10.1109/MIC.2006.26 10.1145/1530748.1530773 10.1109/ICPADS.2008.16 10.1109/TNET.2007.905588 10.2307/2307717 10.1145/1460412.1460420 10.1109/INFCOMW.2010.5466689 10.1109/MOBHOC.2009.5336958 10.1145/1374618.1374663 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media New York 2014 2015 INIST-CNRS |
| Copyright_xml | – notice: Springer Science+Business Media New York 2014 – notice: 2015 INIST-CNRS |
| DBID | AAYXX CITATION IQODW 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-014-0732-z |
| DatabaseName | CrossRef Pascal-Francis 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) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Korea 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 Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) 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 | ABI/INFORM Global (Corporate) Technology Research Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1572-8196 |
| EndPage | 2236 |
| ExternalDocumentID | 3463054561 28892233 10_1007_s11276_014_0732_z |
| 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 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 IQODW 7SC 7SP 7XB 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI Q9U PUEGO |
| ID | FETCH-LOGICAL-c478t-5276306eade7e36eb8807d15cc0352ddd3780f41c50058f832f66ed5c81e40413 |
| IEDL.DBID | BENPR |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000343925600004&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 | Thu Oct 02 05:42:13 EDT 2025 Tue Nov 04 20:38:42 EST 2025 Wed Apr 02 07:13:54 EDT 2025 Sat Nov 29 04:44:14 EST 2025 Tue Nov 18 22:23:18 EST 2025 Fri Feb 21 02:31:29 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Keywords | Wireless sensor networks Scheduling Broadcast Minimum latency Lower bound Shortest path Approximation algorithm Data broadcast Transmission time Delay Latency Time window Duty cycle NP hard problem Wireless network Ad hoc network Sensor array Collision avoidance |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c478t-5276306eade7e36eb8807d15cc0352ddd3780f41c50058f832f66ed5c81e40413 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1612830801 |
| PQPubID | 26318 |
| PageCount | 18 |
| ParticipantIDs | proquest_miscellaneous_1629341602 proquest_journals_1612830801 pascalfrancis_primary_28892233 crossref_citationtrail_10_1007_s11276_014_0732_z crossref_primary_10_1007_s11276_014_0732_z springer_journals_10_1007_s11276_014_0732_z |
| PublicationCentury | 2000 |
| PublicationDate | 2014-11-01 |
| PublicationDateYYYYMMDD | 2014-11-01 |
| PublicationDate_xml | – month: 11 year: 2014 text: 2014-11-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Boston |
| PublicationPlace_xml | – name: Boston – name: New York, NY – name: New York |
| PublicationSubtitle | The Journal of Mobile Communication, Computation and Information |
| PublicationTitle | Wireless networks |
| PublicationTitleAbbrev | Wireless Netw |
| PublicationYear | 2014 |
| Publisher | Springer US Springer Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer – name: Springer Nature B.V |
| References | DijkstraEWA note on two problems in connexion with graphsNumerische Mathematik19591126927110760910.1007/BF013863900092.16002 Wan, P.-J., Huang, S. C.-H., Wang, L., Wan, Z., & Jia, X. (2009). Minimum-latency aggregation scheduling in multihop wireless networks. In ACM MobiHoc, New Orleans, LA, USA. Becher, A. (2008). Towards short-term wireless link quality estimation. In EmNet, Charlottesville, VIR, USA. LimHKimCFlooding in wireless ad hoc networksComputer Communications2001243435336310.1016/S0140-3664(00)00233-4 Lai, S., & Ravindran, B. (2010). Efficient opportunistic broadcasting over duty-cycled wireless sensor networks. In IEEE INFOCOM, San Diego, CA, USA. Sun, Y., Gurewitz, O., & Johnson, D. B. (2008). Ri-mac: A receiver-initiated asynchronous duty cycle mac protocol for dynamic traffic loads in wireless sensor networks. In ACM SenSys, Raleigh, NC, USA. Maróti, M., Kusy, B., Simon, G., & Lédeczi, A. (2004). The flooding time synchronization protocol. In SenSys, Baltimore, Maryland. Fishkin, A. V. (2003). Disk graphs: A short survey. In WAOA, Budapest, Hungary. Mathworks. (2011). Matlab. http://www.mathworks.com/products/matlab/. Brown, S., & Sreenan, C. (2006). Updating software in wireless sensor networks: A survey. Technical Report UCC-CS-2006-13-07. University College Cork, Ireland. TiwariRDinhTThaiMOn centralized and localized approximation algorithms for interference-aware broadcast schedulingIEEE Transactions on Mobile Computing20131223324710.1109/TMC.2011.270 Hong, J., Li, W., Lu, S., Cao, J., & Chen, D. (2008). Sleeping schedule aware minimum transmission broadcast in wireless ad hoc networks. In IEEE ICPADS, Melbourne, Victoria, Australia. Hua, C., & Yum, T.-S. P. (2007). Asynchronous random sleeping for sensor networks. ACM Transactions on Sensor Networks, 3(3), 15–40. GandhiRMishraAParthasarathySMinimizing broadcast latency and redundancy in ad hoc networksIEEE/ACM Transactions on Networking200816484085110.1109/TNET.2007.905588 Sun, Y., Gurewitz, O., Du, S., Tang, L., & Johnson, D. B. (2009). Adb: An efficient multihop broadcast protocol based on asynchronous duty-cycling in wireless sensor networks. In Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, SenSys ’09 (pp. 43–56). New York: NY, USA, ACM. Wan, P.-J., Wang, L., & Frieder, O. (2009). Fast group communications in multihop wireless networks subject to physical interference. In IEEE MASS, Macau SAR, China. Ferrari, F., Zimmerling, M., Thiele, L., & Saukh, O. (2011). Efficient network flooding and time synchronization with glossy. In IPSN, Chicago, IL, USA. Huang, S.-H., Wan, P.-J., Jia, X., Du, H., & Shang, W. (2007). Minimum-latency broadcast scheduling in wireless ad hoc networks. In IEEE INFOCOM, Anchorage, AK, USA. Guo, S., Gu, Y., Jiang, B., & He, T. (2009). Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links. In ACM MOBICOM, Seattle, WA, USA. HuangS-HWanP-JDengJHanYBroadcast scheduling in interference environmentIEEE Transactions on Mobile Computing20087111338134810.1109/TMC.2008.56 HanKLuoJLiuYVasilakosAAlgorithm design for data communications in duty-cycled wireless sensor networks: A surveyIEEE Communications Magazine201351710711310.1109/MCOM.2013.6553686 BatemanPGeometrical extrema suggested by a lemma of besicovitchThe American Mathematical Monthly19515853063144146610.2307/23077170043.16202 Stann, F., Heidemann, J., Shroff, R., & Murtaza, M. Z. (2006). Rbp: Robust broadcast propagation in wireless networks. In ACM SenSys, Boulder, CO, USA. Chen, Z., Qiao, C., Xu, J., & Taekkyeun Lee, T. (2007). A constant approximation algorithm for interference aware broadcast in wireless networks. In IEEE INFOCOM, Anchorage, Alaska, USA. Hu, W., Tran, V. N., Bulusu, N., Chou, C., Jha, S., & Taylor, A. (2005). The design and evaluation of a hybrid sensor network for cane toad monitoring. In ACM/IEEE IPSN, Los Angeles, CA, USA. KorinczKWelshMMarcilloOJohnsonJRuizMWerner-AllenJDeploying a wireless sensor network on an active volcanoIEEE Internet Computing2006102182510.1109/MIC.2006.26 Nan, W., & Xue-li, S. (2009). Research on nodes location technology in wireless sensor networkunderground. In IEEE IITAW, Nanchang, China. Sasson, Y., Cavin, D., & Schiper, A. (2003). Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In IEEE WCNC, New Orleans, LA, USA. Fonseca, R., Gnawali, O., Jamieson, K., & Levis, P. (2007). Four-bit wireless link estimation. In HotNets, Atlanta, GA, USA. Wan, P.-J., Alzoubi, K., & Frieder, O. (2002). Distributed construction of connected dominating set in wireless ad hoc networks. In IEEE INFOCOM, New York, NY, USA. Ni, S., Tseng, Y. C., & Sheu, J. (1999). The broadcast storm problem in a mobile ad hoc network. In ACM MOBICOM, Seattle, WA, USA. Ye, W., Heidemann, J., & Estrin, D. (2002). An energy-efficient MAC protocol for wireless sensor networks. In IEEE INFOCOM, New York, NY, USA. Gu, Y., & He, T. (2010). Bounding communication delay in energy harvesting sensor networks. In IEEE ICDCS, Genoa, Italy. JiaoXLouWMaJCaoJWangXZhouXMinimum latency broadcast scheduling in duty-cycled multi-hop wireless networksIEEE Transactions on Parallel and Distributed Systems201223111011710.1109/TPDS.2011.106 Dutta, P., & Culler, D. (2008). Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications. In SenSys, Raleigh, NC, USA, ACM. Mahjourian, R., Chen, F., Tiwari, R., Thai, M., Zhai, H., & Fang, Y. (2008). An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks. Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, MobiHoc ’08 (pp. 331–340). New York, NY, USA, ACM. Baggio, A. (2005). Wireless sensor networks in precision agriculture. In ACM REALWSN, Stokholm, Sweden. Gu, Y., & He, T. (2007). Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links. In ACM SenSys, Sydney, Australia, ACM. Gandhi, R., Kim, Y.-A., Lee, S., Ryu, J., & Wan, P.-J. (2009). Approximation algorithms for data broadcast in wireless networks. In IEEE INFOCOM, Rio de Janeiro, Brazil. Wang, F., & Liu, J. (2009). Duty-cycle-aware broadcast in wireless sensor networks. In IEEE INFOCOM, Rio de Janeiro, Brazil. S-H Huang (732_CR20) 2008; 7 732_CR19 R Gandhi (732_CR12) 2008; 16 732_CR3 732_CR24 H Lim (732_CR25) 2001; 24 732_CR1 732_CR29 732_CR7 732_CR28 732_CR4 732_CR27 R Tiwari (732_CR35) 2013; 12 732_CR5 732_CR26 X Jiao (732_CR22) 2012; 23 732_CR21 732_CR40 732_CR8 732_CR9 P Bateman (732_CR2) 1951; 58 EW Dijkstra (732_CR6) 1959; 1 732_CR14 732_CR36 732_CR13 732_CR34 732_CR11 732_CR33 732_CR18 K Korincz (732_CR23) 2006; 10 732_CR17 732_CR39 732_CR38 732_CR15 732_CR37 732_CR10 732_CR32 732_CR31 K Han (732_CR16) 2013; 51 732_CR30 |
| References_xml | – reference: BatemanPGeometrical extrema suggested by a lemma of besicovitchThe American Mathematical Monthly19515853063144146610.2307/23077170043.16202 – reference: Nan, W., & Xue-li, S. (2009). Research on nodes location technology in wireless sensor networkunderground. In IEEE IITAW, Nanchang, China. – reference: Stann, F., Heidemann, J., Shroff, R., & Murtaza, M. Z. (2006). Rbp: Robust broadcast propagation in wireless networks. In ACM SenSys, Boulder, CO, USA. – reference: Sun, Y., Gurewitz, O., & Johnson, D. B. (2008). Ri-mac: A receiver-initiated asynchronous duty cycle mac protocol for dynamic traffic loads in wireless sensor networks. In ACM SenSys, Raleigh, NC, USA. – reference: Ni, S., Tseng, Y. C., & Sheu, J. (1999). The broadcast storm problem in a mobile ad hoc network. In ACM MOBICOM, Seattle, WA, USA. – reference: TiwariRDinhTThaiMOn centralized and localized approximation algorithms for interference-aware broadcast schedulingIEEE Transactions on Mobile Computing20131223324710.1109/TMC.2011.270 – reference: Sun, Y., Gurewitz, O., Du, S., Tang, L., & Johnson, D. B. (2009). Adb: An efficient multihop broadcast protocol based on asynchronous duty-cycling in wireless sensor networks. In Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, SenSys ’09 (pp. 43–56). New York: NY, USA, ACM. – reference: Chen, Z., Qiao, C., Xu, J., & Taekkyeun Lee, T. (2007). A constant approximation algorithm for interference aware broadcast in wireless networks. In IEEE INFOCOM, Anchorage, Alaska, USA. – reference: Huang, S.-H., Wan, P.-J., Jia, X., Du, H., & Shang, W. (2007). Minimum-latency broadcast scheduling in wireless ad hoc networks. In IEEE INFOCOM, Anchorage, AK, USA. – reference: Gu, Y., & He, T. (2007). Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links. In ACM SenSys, Sydney, Australia, ACM. – reference: HuangS-HWanP-JDengJHanYBroadcast scheduling in interference environmentIEEE Transactions on Mobile Computing20087111338134810.1109/TMC.2008.56 – reference: Mahjourian, R., Chen, F., Tiwari, R., Thai, M., Zhai, H., & Fang, Y. (2008). An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks. Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, MobiHoc ’08 (pp. 331–340). New York, NY, USA, ACM. – reference: LimHKimCFlooding in wireless ad hoc networksComputer Communications2001243435336310.1016/S0140-3664(00)00233-4 – reference: DijkstraEWA note on two problems in connexion with graphsNumerische Mathematik19591126927110760910.1007/BF013863900092.16002 – reference: Ferrari, F., Zimmerling, M., Thiele, L., & Saukh, O. (2011). Efficient network flooding and time synchronization with glossy. In IPSN, Chicago, IL, USA. – reference: Fishkin, A. V. (2003). Disk graphs: A short survey. In WAOA, Budapest, Hungary. – reference: GandhiRMishraAParthasarathySMinimizing broadcast latency and redundancy in ad hoc networksIEEE/ACM Transactions on Networking200816484085110.1109/TNET.2007.905588 – reference: JiaoXLouWMaJCaoJWangXZhouXMinimum latency broadcast scheduling in duty-cycled multi-hop wireless networksIEEE Transactions on Parallel and Distributed Systems201223111011710.1109/TPDS.2011.106 – reference: Baggio, A. (2005). Wireless sensor networks in precision agriculture. In ACM REALWSN, Stokholm, Sweden. – reference: Gandhi, R., Kim, Y.-A., Lee, S., Ryu, J., & Wan, P.-J. (2009). Approximation algorithms for data broadcast in wireless networks. In IEEE INFOCOM, Rio de Janeiro, Brazil. – reference: Hong, J., Li, W., Lu, S., Cao, J., & Chen, D. (2008). Sleeping schedule aware minimum transmission broadcast in wireless ad hoc networks. In IEEE ICPADS, Melbourne, Victoria, Australia. – reference: Becher, A. (2008). Towards short-term wireless link quality estimation. In EmNet, Charlottesville, VIR, USA. – reference: Fonseca, R., Gnawali, O., Jamieson, K., & Levis, P. (2007). Four-bit wireless link estimation. In HotNets, Atlanta, GA, USA. – reference: Guo, S., Gu, Y., Jiang, B., & He, T. (2009). Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links. In ACM MOBICOM, Seattle, WA, USA. – reference: Hua, C., & Yum, T.-S. P. (2007). Asynchronous random sleeping for sensor networks. ACM Transactions on Sensor Networks, 3(3), 15–40. – reference: Dutta, P., & Culler, D. (2008). Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications. In SenSys, Raleigh, NC, USA, ACM. – reference: Ye, W., Heidemann, J., & Estrin, D. (2002). An energy-efficient MAC protocol for wireless sensor networks. In IEEE INFOCOM, New York, NY, USA. – reference: Wan, P.-J., Huang, S. C.-H., Wang, L., Wan, Z., & Jia, X. (2009). Minimum-latency aggregation scheduling in multihop wireless networks. In ACM MobiHoc, New Orleans, LA, USA. – reference: Maróti, M., Kusy, B., Simon, G., & Lédeczi, A. (2004). The flooding time synchronization protocol. In SenSys, Baltimore, Maryland. – reference: Brown, S., & Sreenan, C. (2006). Updating software in wireless sensor networks: A survey. Technical Report UCC-CS-2006-13-07. University College Cork, Ireland. – reference: Sasson, Y., Cavin, D., & Schiper, A. (2003). Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In IEEE WCNC, New Orleans, LA, USA. – reference: Wang, F., & Liu, J. (2009). Duty-cycle-aware broadcast in wireless sensor networks. In IEEE INFOCOM, Rio de Janeiro, Brazil. – reference: Lai, S., & Ravindran, B. (2010). Efficient opportunistic broadcasting over duty-cycled wireless sensor networks. In IEEE INFOCOM, San Diego, CA, USA. – reference: Hu, W., Tran, V. N., Bulusu, N., Chou, C., Jha, S., & Taylor, A. (2005). The design and evaluation of a hybrid sensor network for cane toad monitoring. In ACM/IEEE IPSN, Los Angeles, CA, USA. – reference: HanKLuoJLiuYVasilakosAAlgorithm design for data communications in duty-cycled wireless sensor networks: A surveyIEEE Communications Magazine201351710711310.1109/MCOM.2013.6553686 – reference: Gu, Y., & He, T. (2010). Bounding communication delay in energy harvesting sensor networks. In IEEE ICDCS, Genoa, Italy. – reference: KorinczKWelshMMarcilloOJohnsonJRuizMWerner-AllenJDeploying a wireless sensor network on an active volcanoIEEE Internet Computing2006102182510.1109/MIC.2006.26 – reference: Wan, P.-J., Wang, L., & Frieder, O. (2009). Fast group communications in multihop wireless networks subject to physical interference. In IEEE MASS, Macau SAR, China. – reference: Wan, P.-J., Alzoubi, K., & Frieder, O. (2002). Distributed construction of connected dominating set in wireless ad hoc networks. In IEEE INFOCOM, New York, NY, USA. – reference: Mathworks. (2011). Matlab. http://www.mathworks.com/products/matlab/. – ident: 732_CR30 doi: 10.1145/313451.313525 – volume: 7 start-page: 1338 issue: 11 year: 2008 ident: 732_CR20 publication-title: IEEE Transactions on Mobile Computing doi: 10.1109/TMC.2008.56 – volume: 12 start-page: 233 year: 2013 ident: 732_CR35 publication-title: IEEE Transactions on Mobile Computing doi: 10.1109/TMC.2011.270 – ident: 732_CR33 – ident: 732_CR39 doi: 10.1109/INFCOM.2009.5061952 – ident: 732_CR10 – ident: 732_CR29 – ident: 732_CR15 doi: 10.1145/1614320.1614336 – ident: 732_CR14 doi: 10.1109/ICDCS.2010.41 – ident: 732_CR21 doi: 10.1109/INFCOM.2007.91 – ident: 732_CR4 – ident: 732_CR34 doi: 10.1145/1460412.1460414 – volume: 24 start-page: 353 issue: 34 year: 2001 ident: 732_CR25 publication-title: Computer Communications doi: 10.1016/S0140-3664(00)00233-4 – ident: 732_CR32 doi: 10.1145/1182807.1182817 – ident: 732_CR18 – ident: 732_CR27 doi: 10.1145/1031495.1031501 – ident: 732_CR31 doi: 10.1109/WCNC.2003.1200529 – volume: 23 start-page: 110 issue: 1 year: 2012 ident: 732_CR22 publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2011.106 – volume: 51 start-page: 107 issue: 7 year: 2013 ident: 732_CR16 publication-title: IEEE Communications Magazine doi: 10.1109/MCOM.2013.6553686 – ident: 732_CR8 – volume: 1 start-page: 269 issue: 1 year: 1959 ident: 732_CR6 publication-title: Numerische Mathematik doi: 10.1007/BF01386390 – ident: 732_CR36 – ident: 732_CR5 doi: 10.1109/INFCOM.2007.92 – ident: 732_CR40 – ident: 732_CR13 doi: 10.1145/1322263.1322294 – ident: 732_CR19 doi: 10.1145/1267060.1267063 – ident: 732_CR28 – ident: 732_CR11 doi: 10.1109/INFCOM.2009.5062211 – volume: 10 start-page: 18 issue: 2 year: 2006 ident: 732_CR23 publication-title: IEEE Internet Computing doi: 10.1109/MIC.2006.26 – ident: 732_CR37 doi: 10.1145/1530748.1530773 – ident: 732_CR17 doi: 10.1109/ICPADS.2008.16 – volume: 16 start-page: 840 issue: 4 year: 2008 ident: 732_CR12 publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/TNET.2007.905588 – ident: 732_CR3 – ident: 732_CR1 – volume: 58 start-page: 306 issue: 5 year: 1951 ident: 732_CR2 publication-title: The American Mathematical Monthly doi: 10.2307/2307717 – ident: 732_CR7 doi: 10.1145/1460412.1460420 – ident: 732_CR24 doi: 10.1109/INFCOMW.2010.5466689 – ident: 732_CR38 doi: 10.1109/MOBHOC.2009.5336958 – ident: 732_CR9 – ident: 732_CR26 doi: 10.1145/1374618.1374663 |
| SSID | ssj0008399 |
| Score | 2.1930351 |
| Snippet | Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to... (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image) Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a... (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a... |
| SourceID | proquest pascalfrancis crossref springer |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 2219 |
| SubjectTerms | Algorithmics. Computability. Computer arithmetics Algorithms Analysis Applied sciences Approximation Broadcasting Communications Engineering Computer Communication Networks Computer science; control theory; systems Computer systems and distributed systems. User interface Electrical Engineering Energy consumption Engineering Equipments and installations Exact sciences and technology Information retrieval. Graph IT in Business Mathematical analysis Mobile radiocommunication systems Networks Radiocommunications Remote sensors Research methodology Scheduling Scheduling algorithms Sensors Software Studies Telecommunications Telecommunications and information theory Theoretical computing Wireless networks |
| SummonAdditionalLinks | – databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZS8RADA5eD4p4i_VYRvBJKbTT-3ERF59E8WDfSjsz1YW1K21X1F9v0mt3RQV97nQYMpnkC0m-AJzEToSRNHd1hLZct23B9RiBh06uMVEy4LFIymET3tWV3-8H13Ufd95UuzcpydJST5rdTO5R9GvrqJZc_5iHRYfIZihEv31ozS96_KBMcWKURXmvJpX53RYzzmj1JcpRLkk10GIGcX5Jkpa-p7f-r1NvwFoNNVm30o1NmFPpFqxMERBuw02XKMXfBlX_IouGj6NsUDw95wyxLIuzUSRFlFNlNBukTI6LdybecTPJiOJ4iFaS5RgH49q0KifPd-C-d3F3fqnXQxZ0YXt-gYEoWhjDpbppT1muivFBe9J0hCCmVCml5flGYpvCoQmECRqAxHWVdIRvKttAF7gLC-koVXvAhIOxF7ek6ytuJ8oJIh6brmNFwkps3F8Do5F2KGoGchqEMQwn3MkkrRClFZK0wg8NTttfXir6jd8Wd2ausP2D-36AMMjS4LC507B-qnmIkJdI0NBTa3DcfsZHRpmTKFWjMa1BVITQ1eAanDX3PLXFTyfa_9PqA1jmpChlp-MhLBTZWB3BkngtBnnWKbX8E-nv97w priority: 102 providerName: Springer Nature |
| Title | Approximation algorithms for broadcasting in duty cycled wireless sensor networks |
| URI | https://link.springer.com/article/10.1007/s11276-014-0732-z https://www.proquest.com/docview/1612830801 https://www.proquest.com/docview/1629341602 |
| Volume | 20 |
| WOSCitedRecordID | wos000343925600004&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: 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: SpringerLINK Contemporary 1997-Present 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/eLvHCXMwpV1LT9tAEB4V0kNR1XeFKUSLxKnVqvb6fUKAiLg0cnmV9mLZu-s2UrBD7FQkv54ZPwKpBJdeVrK8Xj9mduYbz-43AHupm2AkLTyO0FZwx5GCpwg8OLnGTKtQpDKri034w2FwdRVG7Q-3sl1W2dnE2lCrQtI_8q-ITIirCg3q_uSGU9Uoyq62JTTWoEdMZajnvcPjYXS6tMXo_sM634khFyXBurxmvXnOEj5F0w5HNRd8seKZXk6SEj9S1lS3WIGf_2RMa0c0eP2_r_AGXrUQlB00OvMWnun8HWw8ICZ8D98PiGr8dtTsa2TJ-DeOU_25LhliXJZOi0TJpKQV02yUMzWr5kzOcTDFiPp4jNaTlRgfY9-8WWZefoCLwfH50Qlviy9w6fhBhQEqWh7To_XUvrY9neJE95XlSkkMqkop2w_MzLGkS5UJMzQMmedp5crA0o6JrvEjrOdFrjeBSRdjMmErL9DCybQbJiK1PNdOpJ05OL4BZvfhY9kyk1OBjHF8z6lMsopRVjHJKl4Y8Hl5yaSh5Xiqc39FmssrRBCECI9sA7Y7gcXtFC7je2kZsLs8jZOPMipJrosZ9UG0hJDWFAZ86dTiwRCPPdHW0zf8BC8E6WW95XEb1qvpTO_Ac_m3GpXTPqz5P372W03Ho2_mEbUiwjZyf2F7enZ5B176B8E |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3db9MwED_tSxoIjTFABMpmJPayySJxnK8HNE0b06Z2FUibtLcssR2oVNLSpED7R_E3cpc03YrE3vaw59hnJ_7d-Xc5-w7gfeol6EkLnyO1FVxKJXiKxIPT1pgZHYlUZVWxiaDbDa-uos9L8Ke5C0PHKhubWBlqPVD0j_wDMhPKVYUG9WD4g1PVKIquNiU0ali0zeQXumzFx7NjXN9dIU4-XRyd8llVAa5kEJboeaFK2T4dFA6M65sUERxox1OKUoNqrd0gtDPpKI9K7mWI-Mz3jfZU6Bhpo81HucuwKtHxIr06t4_mlh_JRlRFV9HBo5BbE0Wtruo5OC467pKjUgk-XdgHnwyTApckq2tpLJDdf-Kz1bZ38vShfbBN2JgRbHZYa8QzWDL5Fjy-lXbxOXw5pETqv3v1rU2W9L_ivMtv3wuGDJ6lo0GiVVLQeXDWy5kelxOmJihMM0rs3Me9gRXo_WPbvD5EX7yAy3t5p5ewkg9y8wqY8tDjFK72QyNkZrwoEanje26i3EyifAvsZqFjNcu7TuU_-vFNxmjCRozYiAkb8dSCvXmXYZ105K7G2wvomfcQYRgh-XMtaDUAiWcGqohv0GHBu_ljNC0UL0pyMxhTG-SCSNhtYcF-A8NbIv43o9d3D7gD66cX5524c9Ztv4FHgnSiutzZgpVyNDZvYU39LHvFaLvSLgbX943Ov5sHXFI |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VghAI8UYYSlkkuIBWtdfr1wGhihJRFUVBAqniYux90EipE7IOkP40fh0zfqQNEr31wNnrXdv7zcw3ntkZgOdlVKAnLWKO1FZwKZXgJRIPTqbRGp2JUtmm2UQyHKaHh9loA373Z2EorbLXiY2i1lNF_8h3kJlQrSpUqDu2S4sY7Q3ezL5z6iBFkda-nUYLkQOz_Inum3u9v4d7_UKIwbtPb9_zrsMAVzJJa_TCULz8mJKGExPGpkQ0JzqIlKIyoVrrMEl9KwMVUfs9i-i3cWx0pNLASB_1P857CS4nMk4pnWwUfVlZASQeWRNpRWePwm99RLU5thfguujES44CJvjJmk28MSscbo9t-2qsEd-_YrWNCRzc-p8_3m242RFvtttKyh3YMNVduH6mHOM9-LhLBdZ_jdvTnKyYfMPnro-OHUNmz8r5tNCqcJQnzsYV04t6ydQSJ9OMCj5P0GYwZyqHY6s2ud7dh88X8k4PYLOaVuYhMBWhJypCHadGSGuirBBlEEdhoUIrcX4P_H7Tc9XVY6e2IJP8tJI04SRHnOSEk_zEg5erW2ZtMZLzBm-vIWl1h0jTDElh6MFWD5a8U1wuP0WKB89Wl1HlUBypqMx0QWOQIyKR94UHr3pInpniX0_06PwFn8JVBGX-YX948BiuCRKP5sznFmzW84V5AlfUj3rs5tuNoDH4etHg_APGo2Vi |
| 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=Approximation+algorithms+for+broadcasting+in+duty+cycled+wireless+sensor+networks&rft.jtitle=Wireless+networks&rft.au=Zhao%2C+Dianbo&rft.au=Chin%2C+Kwan-Wu&rft.au=Raad%2C+Raad&rft.date=2014-11-01&rft.issn=1022-0038&rft.eissn=1572-8196&rft.volume=20&rft.issue=8&rft.spage=2219&rft.epage=2236&rft_id=info:doi/10.1007%2Fs11276-014-0732-z&rft.externalDBID=NO_FULL_TEXT |
| 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 |