skip to main content
10.1145/1374618.1374662acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

Minimum-latency gossiping in multi-hop wireless networks

Published: 26 May 2008 Publication History

Abstract

We studied the minimum-latency gossiping (all-to-all broadcast) problem in multi-hop wireless networks defined as follows. Each node in the network is initially given a message and the objective is to design a minimum-latency schedule such that each node distributes its message to all other nodes. We considered the unit-size message model, in which different messages cannot be combined as one message, and the unit disk graph model, in which a link exists between two nodes if and only if their Euclidean distance is less than 1. This problem is known to be NP-hard in such models. In this work we designed a gossiping scheme that significantly improved all current gossiping algorithms in terms of approximation ratio. Our work has approximation ratio 27, a great improvement of the current state-of-the-art algorithm (which has ratio 1000+).

References

[1]
R. Bar-Yehuda, A. Israeli, and A. Itai. Multiple communication in multihop radio networks. SIAM Journal on Computing, 22(4):875--887, 1993.]]
[2]
J. C. Bermond, L. Gargano, A. A. Rescigno, and U. Vacarro. Fast gossiping by short messages. In ICALP?95: the 22th International Colloquium on Automata, Languages and Programming, pages 135--146, 1995.]]
[3]
J.-C. Bermond, L. Gargano, A. A. Rescigno, and U. Vaccaro. Fast gossiping by short messages. SIAM Journal on Computing, 27(4):917--941, 1998.]]
[4]
B. S. Chlebus, L. Gasieniec, A. Lingas, and A. T. Pagourtzis. Oblivious gossiping in ad-hoc radio networks. In DIALM'01: the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 44--51, 2001.]]
[5]
M. Christersson, L. Gasieniec, and A. Lingas. Gossiping with bounded size messages in ad hoc radio networks. In ICALP'02: the 29th International Colloquium on Automata, Languages and Programming, pages 377?389, London, UK, 2002. Springer-Verlag.]]
[6]
M. Chrobak, L. Gasiniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. In FOCS'00: the 41st IEEE Symposium on Foundation of Computer Science, pages 575--581, 2000.]]
[7]
M. Chrobak, L. Gasiniec, and W. Rytter. A randomized algorith for gossiping in radio networks. In COCOON'01: the 7th Annual International Computing and Combinatorics Conference, pages 483--492, 2001.]]
[8]
M. Chrobak, L. Gasiniec, and W. Rytter. ast broadcasting and gossiping in radio networks. Journal of Algorithms, 43(2):177--189, 2002.]]
[9]
A. E. F. Clementi, A. Monti, and R. Silvestri. Selective families, superimposed codes, and broadcasting in unknown radio networks. In SODA'01: the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 709-?718, 2001.]]
[10]
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, chapter 25. McGraw-Hill, 2nd edition, 2001.]]
[11]
M. Flamini and S. Perennes. Lower bounds on the broadcasting and gossiping time of restricted protocols, 1999. Technical Report, INRIA.]]
[12]
C. Florens, M. Franceschetti, and R. J. McEliece. Lower bounds on data collection time in sensory networks. IEEE Journal on Selected Areas in Communications, 22(6).]]
[13]
R. W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5(6).]]
[14]
R. Gandhi, S. Parthasarathy, and A. Mishra. Minimizing broadcast latency and redundancy in ad hoc networks. In MobiHoc'03: the ACM International Symposium on Mobile Ad Hoc Networking and Computing, pages 222--232, 2003.]]
[15]
L. Gasieniec and A. Lingas. On adaptive deterministic gossiping in ad hoc radio networks. Information Processing Letters, 83:89--93, 2002.]]
[16]
L. Gasieniec and I. Potapov. Gossiping with unit messages in known radio networks. In TCS'02: the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, pages 193--205, Deventer, The Netherlands, The Netherlands, 2002. Kluwer, B.V.]]
[17]
L. Gasieniec, I. Potapov, and Q. Xin. Time efficient gossiping in known radio networks. In SIROCCO'04: the 11th Colloquium on Structural Information and Communication Complexity, pages 173--184, 2004.]]
[18]
S. C.-H. Huang, P.-J. Wan, X. Jia, H. Du, and W. Shang. Minimum-latency broadcast scheduling in wireless ad hoc networks. In INFOCOM'?07: the 26th Annual IEEE Conference on Computer Communications, pages 733--739, 2007.]]
[19]
P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In SODA'02: the 13th ACM-SIAM Symposium on Discrete Algorithms, pages 697--704, 2002.]]
[20]
X. Jia. A distributed algorithm of delay bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Trans. on Networking, 6(6).]]
[21]
D. Li, X. Jia, and H. Liu. Energy efficient broadcast routing in ad hoc wireless networks. IEEE Trans on Mobile Computing, 3(2).]]
[22]
F. Manne and Q. Xin. Optimal gossiping with unit size messages in known topology radio networks. In CAAN'06: the 3rd Workshop of Combinatorial and Algorithmic Aspects of Networking, pages 125--134, Berlin/Heidelberg, 2006. Springer.]]
[23]
S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In MobiCom'99: the 5th annual ACM/IEEE international conference on Mobile computing and networking, pages 151--162, New York, NY, USA, 1999. ACM Press.]]
[24]
K. Ravishankar and S. Singh. Asymptotically optimal gossiping in radio networks. Discrete Applied Mathematics, 61:61--85, 1995.]]
[25]
K. Ravishankar and S. Singh. Gossiping on a ring with radios. ParallelProcessing Letters, 6(1):115?126, 1996.]]
[26]
Y. Xu. An O(n<sup>1:5</sup>) deterministic gossiping algorithm for radio networks. Algorithmica, 36(1).]]

Cited By

View all
  • (2023)Low Latency Allcast Over Broadcast Erasure ChannelsIEEE Transactions on Information Theory10.1109/TIT.2022.321977369:3(1604-1617)Online publication date: Mar-2023
  • (2023)Data Collection Scheduling in Directional Wireless Sensor Networks2023 8th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS57501.2023.10150591(387-391)Online publication date: 21-Apr-2023
  • (2022)Structure-Free Broadcast Scheduling for Duty-Cycled Multihop Wireless Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2021.308414521:12(4624-4641)Online publication date: 1-Dec-2022
  • Show More Cited By

Index Terms

  1. Minimum-latency gossiping in multi-hop wireless networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
    May 2008
    474 pages
    ISBN:9781605580739
    DOI:10.1145/1374618
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 26 May 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. TDMA
    2. broadcast
    3. gossip

    Qualifiers

    • Research-article

    Conference

    MobiHoc08
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Low Latency Allcast Over Broadcast Erasure ChannelsIEEE Transactions on Information Theory10.1109/TIT.2022.321977369:3(1604-1617)Online publication date: Mar-2023
    • (2023)Data Collection Scheduling in Directional Wireless Sensor Networks2023 8th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS57501.2023.10150591(387-391)Online publication date: 21-Apr-2023
    • (2022)Structure-Free Broadcast Scheduling for Duty-Cycled Multihop Wireless Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2021.308414521:12(4624-4641)Online publication date: 1-Dec-2022
    • (2022)A Distributed Framework for Low-Latency Data Collection in Battery-Free Wireless Sensor NetworksIEEE Internet of Things Journal10.1109/JIOT.2021.31158249:11(8438-8453)Online publication date: 1-Jun-2022
    • (2021)Data Aggregation, Gathering and Gossiping in Duty-Cycled MultihopWireless Sensor Networks subject to Physical InterferenceAdvances in Science, Technology and Engineering Systems Journal10.25046/aj0601426:1(369-377)Online publication date: Jan-2021
    • (2021)Layer Based Fast Data Collection in Battery-Free Wireless Sensor NetworksWireless Algorithms, Systems, and Applications10.1007/978-3-030-85928-2_1(3-15)Online publication date: 2-Sep-2021
    • (2018)Scheduling Problems in Wireless Sensor Networks and Internet of Things: A Comparative Overview2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)10.1109/IEMCON.2018.8615099(667-673)Online publication date: Nov-2018
    • (2016)An all-to-all broadcast protocol for variable packet sizes using directional antennas2016 25th Wireless and Optical Communication Conference (WOCC)10.1109/WOCC.2016.7506560(1-5)Online publication date: May-2016
    • (2015)Throughput improvement for delay-sensitive video broadcast in wireless mesh networksComputers and Electrical Engineering10.1016/j.compeleceng.2015.07.00248:C(214-225)Online publication date: 1-Nov-2015
    • (2015)Minimum-Latency Broadcast and Data Aggregation Scheduling in Secure Wireless Sensor NetworksWireless Algorithms, Systems, and Applications10.1007/978-3-319-21837-3_54(550-560)Online publication date: 1-Aug-2015
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media