Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a Euclidean plane. We assume that each node has a variable transmission range and can learn the distance to the closest active neighbor at any time. We also assum...
Gespeichert in:
| Veröffentlicht in: | Journal of parallel and distributed computing Jg. 66; H. 4; S. 578 - 585 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.04.2006
|
| Schlagworte: | |
| ISSN: | 0743-7315, 1096-0848 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a Euclidean plane. We assume that each node has a variable transmission range and can learn the distance to the closest active neighbor at any time. We also assume that nodes have a special collision detection (CD) capability so that a transmitting node can detect a collision within its transmission range. We study the basic communication problem of collecting data from all nodes called
convergecast. Recently, there appeared many new applications such as real-time multimedia, battlefield communications and rescue operations that impose stringent delay requirements on the convergecast time. We measure the
latency of convergecast, that is the number of time steps needed to collect the data in any
n-node network. We propose a very simple randomized
distributed algorithm that has the expected running time
O
(
log
n
)
. We also show that this bound is tight and any algorithm needs
Ω
(
log
n
)
time steps while performing convergecast in an arbitrary network.
One of the most important problems in wireless ad hoc networks is to minimize the energy consumption, which maximizes the network lifetime. We study the trade-off between the energy and the latency of convergecast. We show that our algorithm consumes at most
O
(
n
log
n
)
times the minimum energy. We also demonstrate that for a line topology, the minimum energy convergecast takes
n time steps while any algorithm performing convergecast within
O
(
log
n
)
time steps requires
Ω
(
n
/
log
n
)
times the minimum energy. |
|---|---|
| AbstractList | Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a Euclidean plane. We assume that each node has a variable transmission range and can learn the distance to the closest active neighbor at any time. We also assume that nodes have a special collision detection (CD) capability so that a transmitting node can detect a collision within its transmission range. We study the basic communication problem of collecting data from all nodes called
convergecast. Recently, there appeared many new applications such as real-time multimedia, battlefield communications and rescue operations that impose stringent delay requirements on the convergecast time. We measure the
latency of convergecast, that is the number of time steps needed to collect the data in any
n-node network. We propose a very simple randomized
distributed algorithm that has the expected running time
O
(
log
n
)
. We also show that this bound is tight and any algorithm needs
Ω
(
log
n
)
time steps while performing convergecast in an arbitrary network.
One of the most important problems in wireless ad hoc networks is to minimize the energy consumption, which maximizes the network lifetime. We study the trade-off between the energy and the latency of convergecast. We show that our algorithm consumes at most
O
(
n
log
n
)
times the minimum energy. We also demonstrate that for a line topology, the minimum energy convergecast takes
n time steps while any algorithm performing convergecast within
O
(
log
n
)
time steps requires
Ω
(
n
/
log
n
)
times the minimum energy. |
| Author | Kesselman, Alex Kowalski, Dariusz R. |
| Author_xml | – sequence: 1 givenname: Alex surname: Kesselman fullname: Kesselman, Alex email: akessel@mpi-sb.mpg.de organization: Max Planck Institüt für Informatik, Saarbrücken, Germany – sequence: 2 givenname: Dariusz R. surname: Kowalski fullname: Kowalski, Dariusz R. email: darek@csc.liv.ac.uk organization: Department of Computer Science, University of Liverpool, Liverpool, UK |
| BookMark | eNp9kMtOwzAQRS1UJNrCD7DyDySMEzcPiQ2qKCBVsOnecsaT1qGNK9sU8fckKisW3cxs5ozuPTM26V1PjN0LSAWI4qFLu6PBNANYpEKkAPKKTQXURQKVrCZsCqXMkzIXixs2C6EDEGJRVlP2vtIhcmND9Lb5imS43m-dt3F34K3zHF1_Ir8lHM9sz7XhO4d8S-5AA4Lca2Md7yl-O_8Zbtl1q_eB7v72nG1Wz5vla7L-eHlbPq0TzAFigmVbUT4kF4UE1ABNU-QGDdRNa-phSpPVUMgWpWwqrCsBbVYS6bIRErN8zrLzW_QuBE-tOnp70P5HCVCjENWpUYgahSgh1CBkgKp_ENqoo3V99NruL6OPZ5SGTidLXgW01CMZ6wmjMs5ewn8B35J_Ww |
| CitedBy_id | crossref_primary_10_1007_s11276_010_0282_y crossref_primary_10_1016_j_comnet_2007_10_011 crossref_primary_10_1016_j_ins_2009_11_013 crossref_primary_10_1016_j_tcs_2021_02_009 crossref_primary_10_1016_j_adhoc_2011_01_003 crossref_primary_10_1016_j_adhoc_2009_01_004 crossref_primary_10_1145_2629493 crossref_primary_10_1109_TPDS_2010_80 crossref_primary_10_1016_j_adhoc_2014_09_011 crossref_primary_10_1109_TC_2010_50 crossref_primary_10_1016_j_jksuci_2023_01_008 crossref_primary_10_1109_ACCESS_2017_2734847 crossref_primary_10_1007_s00453_014_9939_8 crossref_primary_10_1007_s10878_014_9748_7 crossref_primary_10_1016_j_tcs_2012_11_030 |
| Cites_doi | 10.1109/SFCS.2003.1238222 10.1145/570645.570667 10.1007/3-540-45655-4_37 10.1016/0022-0000(92)90042-H 10.1109/26.79285 10.1145/381448.381454 10.1109/SFCS.2000.892325 10.1145/872035.872045 10.1016/S0304-3975(02)00538-8 10.1016/S0020-0190(01)00312-X 10.1023/A:1020716919751 10.1145/378580.378590 10.1016/S0304-3975(98)00223-0 10.1109/WCNC.2003.1200684 10.1007/3-540-45465-9_33 10.1007/978-0-387-35608-2_17 10.1109/GLOCOM.2003.1258890 10.1109/26.20105 10.1109/2.940014 10.1137/S0097539794279109 10.1109/VETEC.1997.600463 10.1016/0022-0000(91)90015-W 10.1145/1055959.1055963 10.1145/570753.570754 |
| ContentType | Journal Article |
| Copyright | 2006 Elsevier Inc. |
| Copyright_xml | – notice: 2006 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jpdc.2005.11.004 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| EndPage | 585 |
| ExternalDocumentID | 10_1016_j_jpdc_2005_11_004 S074373150500256X |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-c7f8e31011640ca00bb63dcd09bfd909b4d29064fc44b8c9810f27eea7b14c23 |
| ISICitedReferencesCount | 32 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000236522100010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Sat Nov 29 07:13:53 EST 2025 Tue Nov 18 22:21:36 EST 2025 Fri Feb 23 02:27:56 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Convergecast Randomized algorithms Radio networks Energy/latency trade-off |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-c7f8e31011640ca00bb63dcd09bfd909b4d29064fc44b8c9810f27eea7b14c23 |
| PageCount | 8 |
| ParticipantIDs | crossref_primary_10_1016_j_jpdc_2005_11_004 crossref_citationtrail_10_1016_j_jpdc_2005_11_004 elsevier_sciencedirect_doi_10_1016_j_jpdc_2005_11_004 |
| PublicationCentury | 2000 |
| PublicationDate | 2006-04-01 |
| PublicationDateYYYYMMDD | 2006-04-01 |
| PublicationDate_xml | – month: 04 year: 2006 text: 2006-04-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2006 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Frodigh, Johansson, Larsson (bib17) 2000; 4 A. Nasipuri, K. Lim, A directionality based location discovery scheme for wireless sensor networks, in: Proceedings of WSNA’2002. V. Annamalai, S.K.S. Gupta, L. Schwiebert, On tree-based convergecasting in wireless sensor networks, in: WCNC 2003—IEEE Wireless Communications and Networking Conference, vol. 4(1), March 2003, pp. 1942–1947. Kirousis, Kranakis, Krizanc, Pelc (bib25) 2000; 243 A.E.F. Clementi, A. Monti, R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, in: Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’2001), 2001, pp. 709–718. A. Dessmark, A. Pelc, Tradeoffs between knowledge and time of communication in geometric radio networks, in: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’2001), 2001, pp. 59–66. Kesselman, Kowalski, Segal (bib24) 2005; 9 M. Chrobak, L. Ga¸sieniec, W. Rytter, Fast broadcasting and gossiping in radio networks, in: Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS’2000), 2000, pp. 575–581. B.S. Chlebus, L. Ga¸sieniec, A. Lingas, A. Pagourtzis, Oblivious gossiping in ad-hoc radio networks, in: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’2001), 2001, pp. 44–51. Alon, Bar-Noy, Linial, Peleg (bib1) 1991; 43 D. Kowalski, A. Pelc, Broadcasting in undirected ad hoc radio networks, in: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC’2003), 2003, pp. 73–82. Bar-Yehuda, Goldreich, Itai (bib3) 1992; 45 I. Gaber, Y. Mansour, Broadcast in radio networks, in: Proceeding of the 6th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’1995), 1995, pp. 577–585. D. Liu, M. Prabhakaran, On randomized broadcasting and gosiping in radio networks, in: Proceedings of the 8th Annual International Conference on Computing and Combinatorics (COCOON’2002), Lecture Notes in Computer Science, vol. 2387, 2002, pp. 340–349. L. Gasieniec, I. Potapov, Gossiping with unit messages in known radio networks, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (TCS’2002), 2002, pp. 193–205. Gasieniec, Potapov, Xin (bib21) 2004; vol. 3104 Rappaport (bib33) 1996 M. Cagalj, J.P. Hubaux, C. Enz, Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: Proceedings of the 8th Annual International Conference on Mobile Computing and Networking (MobiCom’02), 2002, pp. 172–182. Clementi, Ferreira, Penna, Perennes, Silvestri (bib13) 2003; 1–3 K. Krizman, T. Bieda, T. Rappaport, Wireless position location: fundamentals, implementation strategies, and source of error, in: Proceedings of Vehicular Technical Conference, 1997, pp. 919–923. Chen, Huang (bib7) 1989; 37 Kushilevitz, Mansour (bib29) 1998; 27 Perkins (bib32) 2001 J. Cartigny, D. Simplot, I. Stojmenovic, Localized minimum-energy broadcasting in ad-hoc networks, in: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’03), 2003. M. Chrobak, L. Ga¸sieniec, D. Kowalski, The wake-up problem in multi-hop radio networks, in: Proceedings of the 15th ACM–SIAM Symposium on Discrete Algorithms (SODA’2004), 2004, pp. 985–993. S. Upadhyayula, V. Annamalai, S.K.S. Gupta, A low-latency and energy-efficient algorithm for convergecast in wireless sensor networks, in: GLOBECOM 2003—IEEE Global Telecommunications Conference, vol. 22(1), December 2003, pp. 3525–3530. Wieselthier, Nguyen, Ephremides (bib36) 2002; 7 M. Christersson, L. Ga¸sieniec, A. Lingas, Gossiping with bounded size messages in ad-hoc radio networks, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP’2002), 2002, pp. 377–389. Gasieniec, Lingas (bib19) 2002; 83 Gasieniec, Radzik, Xin (bib22) 2004; vol. 3111 D. Kowalski, A. Pelc, Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, in: Proceedings of the 10th Colloquium on Structural Information and Communication Complexity (SIROCCO’2003), 2003, pp. 195–210. A. Czumaj, W. Rytter, Broadcasting algorithms in radio networks with unknown topology, in: Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS’2003), 2003, pp. 492–501. Hightower, Borriello (bib23) 2001; 34 Wan, Calinescu, Li, Frieder (bib35) 2002 G. Calinescu, Computing 2-hop neighborhoods in ad hoc wireless networks, in: Proceedings of the Adhoc-Now ’03. Chlamtac, Weinstein (bib8) 1991; 39 Wieselthier (10.1016/j.jpdc.2005.11.004_bib36) 2002; 7 10.1016/j.jpdc.2005.11.004_bib20 10.1016/j.jpdc.2005.11.004_bib28 10.1016/j.jpdc.2005.11.004_bib27 10.1016/j.jpdc.2005.11.004_bib26 Chlamtac (10.1016/j.jpdc.2005.11.004_bib8) 1991; 39 Gasieniec (10.1016/j.jpdc.2005.11.004_bib22) 2004; vol. 3111 Wan (10.1016/j.jpdc.2005.11.004_bib35) 2002 Kirousis (10.1016/j.jpdc.2005.11.004_bib25) 2000; 243 Gasieniec (10.1016/j.jpdc.2005.11.004_bib21) 2004; vol. 3104 Bar-Yehuda (10.1016/j.jpdc.2005.11.004_bib3) 1992; 45 Hightower (10.1016/j.jpdc.2005.11.004_bib23) 2001; 34 10.1016/j.jpdc.2005.11.004_bib4 10.1016/j.jpdc.2005.11.004_bib14 Kesselman (10.1016/j.jpdc.2005.11.004_bib24) 2005; 9 10.1016/j.jpdc.2005.11.004_bib5 10.1016/j.jpdc.2005.11.004_bib6 10.1016/j.jpdc.2005.11.004_bib12 10.1016/j.jpdc.2005.11.004_bib34 10.1016/j.jpdc.2005.11.004_bib11 10.1016/j.jpdc.2005.11.004_bib10 10.1016/j.jpdc.2005.11.004_bib9 10.1016/j.jpdc.2005.11.004_bib31 Rappaport (10.1016/j.jpdc.2005.11.004_bib33) 1996 10.1016/j.jpdc.2005.11.004_bib30 Perkins (10.1016/j.jpdc.2005.11.004_bib32) 2001 Chen (10.1016/j.jpdc.2005.11.004_bib7) 1989; 37 10.1016/j.jpdc.2005.11.004_bib18 10.1016/j.jpdc.2005.11.004_bib16 Kushilevitz (10.1016/j.jpdc.2005.11.004_bib29) 1998; 27 10.1016/j.jpdc.2005.11.004_bib15 Frodigh (10.1016/j.jpdc.2005.11.004_bib17) 2000; 4 Clementi (10.1016/j.jpdc.2005.11.004_bib13) 2003; 1–3 Gasieniec (10.1016/j.jpdc.2005.11.004_bib19) 2002; 83 10.1016/j.jpdc.2005.11.004_bib2 Alon (10.1016/j.jpdc.2005.11.004_bib1) 1991; 43 |
| References_xml | – reference: G. Calinescu, Computing 2-hop neighborhoods in ad hoc wireless networks, in: Proceedings of the Adhoc-Now ’03. – volume: vol. 3104 start-page: 173 year: 2004 end-page: 184 ident: bib21 article-title: Time efficient gossiping in known radio networks publication-title: Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO’2004), Lecture Notes in Computer Science – volume: 45 start-page: 104 year: 1992 end-page: 126 ident: bib3 article-title: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization publication-title: J. Comput. System Sci. – reference: A. Czumaj, W. Rytter, Broadcasting algorithms in radio networks with unknown topology, in: Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS’2003), 2003, pp. 492–501. – volume: 7 start-page: 481 year: 2002 end-page: 492 ident: bib36 article-title: Energy-efficient broadcast and multicast trees in wireless networks publication-title: Mobile Networks Appl. (MONET) – volume: 39 start-page: 426 year: 1991 end-page: 433 ident: bib8 article-title: The wave expansion approach to broadcasting in multihop radio networks publication-title: IEEE Trans. Commun. – volume: 243 start-page: 289 year: 2000 end-page: 305 ident: bib25 article-title: Power consumption in packet radio networks publication-title: Theoret. Comput. Sci. – volume: vol. 3111 start-page: 397 year: 2004 end-page: 407 ident: bib22 article-title: Faster deterministic gossiping in directed ad-hoc radio networks publication-title: Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT’2004), Lecture Notes in Computer Science – volume: 27 start-page: 702 year: 1998 end-page: 712 ident: bib29 article-title: An publication-title: SIAM J. Comput. – start-page: 314 year: 2001 end-page: 318 ident: bib32 article-title: Ad hoc networking: an introduction publication-title: Ad Hoc Networking – reference: L. Gasieniec, I. Potapov, Gossiping with unit messages in known radio networks, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (TCS’2002), 2002, pp. 193–205. – reference: M. Christersson, L. Ga¸sieniec, A. Lingas, Gossiping with bounded size messages in ad-hoc radio networks, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP’2002), 2002, pp. 377–389. – reference: M. Chrobak, L. Ga¸sieniec, D. Kowalski, The wake-up problem in multi-hop radio networks, in: Proceedings of the 15th ACM–SIAM Symposium on Discrete Algorithms (SODA’2004), 2004, pp. 985–993. – reference: A. Dessmark, A. Pelc, Tradeoffs between knowledge and time of communication in geometric radio networks, in: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’2001), 2001, pp. 59–66. – reference: M. Cagalj, J.P. Hubaux, C. Enz, Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: Proceedings of the 8th Annual International Conference on Mobile Computing and Networking (MobiCom’02), 2002, pp. 172–182. – reference: B.S. Chlebus, L. Ga¸sieniec, A. Lingas, A. Pagourtzis, Oblivious gossiping in ad-hoc radio networks, in: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’2001), 2001, pp. 44–51. – reference: M. Chrobak, L. Ga¸sieniec, W. Rytter, Fast broadcasting and gossiping in radio networks, in: Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS’2000), 2000, pp. 575–581. – year: 1996 ident: bib33 article-title: Wireless Communications: Principles and Practices – reference: I. Gaber, Y. Mansour, Broadcast in radio networks, in: Proceeding of the 6th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’1995), 1995, pp. 577–585. – reference: D. Kowalski, A. Pelc, Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, in: Proceedings of the 10th Colloquium on Structural Information and Communication Complexity (SIROCCO’2003), 2003, pp. 195–210. – volume: 4 start-page: 248 year: 2000 end-page: 263 ident: bib17 article-title: Wireless ad hoc networking—the art of networking without a network publication-title: Ericsson Rev. – volume: 37 start-page: 293 year: 1989 end-page: 295 ident: bib7 article-title: The strongly connecting problem on multihop packet radio networks publication-title: IEEE Trans. Commun. – reference: J. Cartigny, D. Simplot, I. Stojmenovic, Localized minimum-energy broadcasting in ad-hoc networks, in: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’03), 2003. – reference: A.E.F. Clementi, A. Monti, R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, in: Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’2001), 2001, pp. 709–718. – volume: 43 start-page: 290 year: 1991 end-page: 298 ident: bib1 article-title: A lower bound for radio broadcast publication-title: J. Comput. System Sci. – reference: V. Annamalai, S.K.S. Gupta, L. Schwiebert, On tree-based convergecasting in wireless sensor networks, in: WCNC 2003—IEEE Wireless Communications and Networking Conference, vol. 4(1), March 2003, pp. 1942–1947. – volume: 34 start-page: 57 year: 2001 end-page: 66 ident: bib23 article-title: Location systems for ubiquitous computing publication-title: IEEE Comput. – reference: D. Kowalski, A. Pelc, Broadcasting in undirected ad hoc radio networks, in: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC’2003), 2003, pp. 73–82. – reference: S. Upadhyayula, V. Annamalai, S.K.S. Gupta, A low-latency and energy-efficient algorithm for convergecast in wireless sensor networks, in: GLOBECOM 2003—IEEE Global Telecommunications Conference, vol. 22(1), December 2003, pp. 3525–3530. – reference: D. Liu, M. Prabhakaran, On randomized broadcasting and gosiping in radio networks, in: Proceedings of the 8th Annual International Conference on Computing and Combinatorics (COCOON’2002), Lecture Notes in Computer Science, vol. 2387, 2002, pp. 340–349. – volume: 1–3 start-page: 751 year: 2003 end-page: 761 ident: bib13 article-title: The minimum broadcast range assignment problem on linear multi-hop wireless networks publication-title: Theoret. Comput. Sci. – reference: K. Krizman, T. Bieda, T. Rappaport, Wireless position location: fundamentals, implementation strategies, and source of error, in: Proceedings of Vehicular Technical Conference, 1997, pp. 919–923. – year: 2002 ident: bib35 article-title: Minimum-energy broadcast routing in static ad hoc wireless networks – volume: 9 start-page: 15 year: 2005 end-page: 26 ident: bib24 article-title: Energy efficient connectivity in ad hoc networks from user's and designer's perspective publication-title: ACM SIGMOBILE Mobile Comput. Commun. Rev. – reference: A. Nasipuri, K. Lim, A directionality based location discovery scheme for wireless sensor networks, in: Proceedings of WSNA’2002. – volume: 83 start-page: 89 year: 2002 end-page: 94 ident: bib19 article-title: On adaptive deterministic gossiping in ad hoc radio networks publication-title: Inform. Process. Lett. – ident: 10.1016/j.jpdc.2005.11.004_bib15 doi: 10.1109/SFCS.2003.1238222 – ident: 10.1016/j.jpdc.2005.11.004_bib4 doi: 10.1145/570645.570667 – ident: 10.1016/j.jpdc.2005.11.004_bib30 doi: 10.1007/3-540-45655-4_37 – volume: 45 start-page: 104 year: 1992 ident: 10.1016/j.jpdc.2005.11.004_bib3 article-title: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization publication-title: J. Comput. System Sci. doi: 10.1016/0022-0000(92)90042-H – volume: 39 start-page: 426 year: 1991 ident: 10.1016/j.jpdc.2005.11.004_bib8 article-title: The wave expansion approach to broadcasting in multihop radio networks publication-title: IEEE Trans. Commun. doi: 10.1109/26.79285 – ident: 10.1016/j.jpdc.2005.11.004_bib9 doi: 10.1145/381448.381454 – ident: 10.1016/j.jpdc.2005.11.004_bib12 doi: 10.1109/SFCS.2000.892325 – ident: 10.1016/j.jpdc.2005.11.004_bib26 doi: 10.1145/872035.872045 – year: 2002 ident: 10.1016/j.jpdc.2005.11.004_bib35 – volume: 1–3 start-page: 751 issue: 299 year: 2003 ident: 10.1016/j.jpdc.2005.11.004_bib13 article-title: The minimum broadcast range assignment problem on linear multi-hop wireless networks publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(02)00538-8 – ident: 10.1016/j.jpdc.2005.11.004_bib6 – volume: 83 start-page: 89 year: 2002 ident: 10.1016/j.jpdc.2005.11.004_bib19 article-title: On adaptive deterministic gossiping in ad hoc radio networks publication-title: Inform. Process. Lett. doi: 10.1016/S0020-0190(01)00312-X – volume: 7 start-page: 481 issue: 6 year: 2002 ident: 10.1016/j.jpdc.2005.11.004_bib36 article-title: Energy-efficient broadcast and multicast trees in wireless networks publication-title: Mobile Networks Appl. (MONET) doi: 10.1023/A:1020716919751 – ident: 10.1016/j.jpdc.2005.11.004_bib11 – ident: 10.1016/j.jpdc.2005.11.004_bib16 doi: 10.1145/378580.378590 – volume: 4 start-page: 248 year: 2000 ident: 10.1016/j.jpdc.2005.11.004_bib17 article-title: Wireless ad hoc networking—the art of networking without a network publication-title: Ericsson Rev. – volume: 243 start-page: 289 year: 2000 ident: 10.1016/j.jpdc.2005.11.004_bib25 article-title: Power consumption in packet radio networks publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(98)00223-0 – ident: 10.1016/j.jpdc.2005.11.004_bib2 doi: 10.1109/WCNC.2003.1200684 – ident: 10.1016/j.jpdc.2005.11.004_bib10 doi: 10.1007/3-540-45465-9_33 – ident: 10.1016/j.jpdc.2005.11.004_bib20 doi: 10.1007/978-0-387-35608-2_17 – ident: 10.1016/j.jpdc.2005.11.004_bib27 – ident: 10.1016/j.jpdc.2005.11.004_bib34 doi: 10.1109/GLOCOM.2003.1258890 – volume: 37 start-page: 293 issue: 3 year: 1989 ident: 10.1016/j.jpdc.2005.11.004_bib7 article-title: The strongly connecting problem on multihop packet radio networks publication-title: IEEE Trans. Commun. doi: 10.1109/26.20105 – volume: 34 start-page: 57 issue: 8 year: 2001 ident: 10.1016/j.jpdc.2005.11.004_bib23 article-title: Location systems for ubiquitous computing publication-title: IEEE Comput. doi: 10.1109/2.940014 – volume: vol. 3111 start-page: 397 year: 2004 ident: 10.1016/j.jpdc.2005.11.004_bib22 article-title: Faster deterministic gossiping in directed ad-hoc radio networks – start-page: 314 year: 2001 ident: 10.1016/j.jpdc.2005.11.004_bib32 article-title: Ad hoc networking: an introduction – volume: 27 start-page: 702 year: 1998 ident: 10.1016/j.jpdc.2005.11.004_bib29 article-title: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks publication-title: SIAM J. Comput. doi: 10.1137/S0097539794279109 – year: 1996 ident: 10.1016/j.jpdc.2005.11.004_bib33 – volume: vol. 3104 start-page: 173 year: 2004 ident: 10.1016/j.jpdc.2005.11.004_bib21 article-title: Time efficient gossiping in known radio networks – ident: 10.1016/j.jpdc.2005.11.004_bib5 – ident: 10.1016/j.jpdc.2005.11.004_bib28 doi: 10.1109/VETEC.1997.600463 – ident: 10.1016/j.jpdc.2005.11.004_bib14 – ident: 10.1016/j.jpdc.2005.11.004_bib18 – volume: 43 start-page: 290 year: 1991 ident: 10.1016/j.jpdc.2005.11.004_bib1 article-title: A lower bound for radio broadcast publication-title: J. Comput. System Sci. doi: 10.1016/0022-0000(91)90015-W – volume: 9 start-page: 15 issue: 1 year: 2005 ident: 10.1016/j.jpdc.2005.11.004_bib24 article-title: Energy efficient connectivity in ad hoc networks from user's and designer's perspective publication-title: ACM SIGMOBILE Mobile Comput. Commun. Rev. doi: 10.1145/1055959.1055963 – ident: 10.1016/j.jpdc.2005.11.004_bib31 doi: 10.1145/570753.570754 |
| SSID | ssj0011578 |
| Score | 1.9260492 |
| Snippet | Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a Euclidean plane. We... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 578 |
| SubjectTerms | Convergecast Energy/latency trade-off Radio networks Randomized algorithms |
| Title | Fast distributed algorithm for convergecast in ad hoc geometric radio networks |
| URI | https://dx.doi.org/10.1016/j.jpdc.2005.11.004 |
| Volume | 66 |
| WOSCitedRecordID | wos000236522100010&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: PRVESC databaseName: ScienceDirect Freedom Collection 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZWWw5cgPIQ5VH5wC1KlYddJ8cKtQIOqwrtYW-RX9lmSZNVkj7Er2ccOyEstGoPXKwoLyeeTzNje2Y-hD6pMOU0VJGvUyl8M0Pwwc7HPpguLlOi2LFQPdkEWyyS1So9n822Qy7MdcmqKrm9Tbf_VdRwDoRtUmcfIe7xpXACjkHo0ILYoX2Q4M9425l9F0tlBf4kL9d1U3QXl31IYR9m3qy1NLcVlceVd1FLb63rS0OuJb2Gq6L2Khse3t7hvJqK4WWpbZ2BaWeyZ4kY7GGvydtWl26d1aTTjBfqGxiLHy7RvSmu2p_e96PdVYgxeMUqK1PqlMU2NXPQrJZPxSGITNQktbQ9zuJSS9rzlzK36wqbo81WSbv6ZeqtWrbiPytn71i0Mc5wCGHbZOYdhnKTwpQn6wvI7kWMpskc7Z18PV19G3eeQmqt9_A_LtHKxgTufsm_nZmJg7J8gZ454eATi4h9NNPVS_R8YO3ATom_QgsDEDyRGR4BggEgeAoQXFSYKwwAwSNAcA8QPADkNVqenS4_f_Edq4Yv4yDofMnyRINTH8JEOZA8CIQ4jpVUQSpylUJLlKEAILkkRCQyTcIgj5jWnImQyCh-g-ZVXem3CCfMbNOBR0h1RAQjSQRza0FZnHAZSJ0foHAYnUy6ivOG-KTM7pbLAfLGZ7a23sq9d9Nh0DPnMVpPMAMM3fPcu0f18h49_Q35D2jeNVf6I3oir7uibQ4dgH4B8q6O6A |
| linkProvider | Elsevier |
| 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=Fast+distributed+algorithm+for+convergecast+in+ad+hoc+geometric+radio+networks&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Kesselman%2C+Alex&rft.au=Kowalski%2C+Dariusz+R.&rft.date=2006-04-01&rft.issn=0743-7315&rft.volume=66&rft.issue=4&rft.spage=578&rft.epage=585&rft_id=info:doi/10.1016%2Fj.jpdc.2005.11.004&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jpdc_2005_11_004 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |