Minimum-latency gossiping in multi-hop wireless networks

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+).

[1]  Andrzej Lingas,et al.  On adaptive deterministic gossiping in ad hoc radio networks , 2002, SODA '02.

[2]  Hai Liu,et al.  Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks , 2004, IEEE Trans. Mob. Comput..

[3]  Wojciech Rytter,et al.  A randomized algorithm for gossiping in radio networks , 2004, Networks.

[4]  Stéphane Pérennes,et al.  Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols , 2004, SIAM J. Discret. Math..

[5]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[6]  Igor Potapov,et al.  Gossiping with Unit Messages in Known Radio Networks , 2002, IFIP TCS.

[7]  Jean-Claude Bermond,et al.  Fast Gossiping by Short Messages , 1998, SIAM J. Comput..

[8]  Suresh Singh,et al.  Gossiping on a Ring with Radios , 1996, Parallel Process. Lett..

[9]  Igor Potapov,et al.  Time Efficient Gossiping in Known Radio Networks , 2004, SIROCCO.

[10]  Massimo Franceschetti,et al.  Lower bounds on data collection time in sensory networks , 2004, IEEE Journal on Selected Areas in Communications.

[11]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[12]  Ying Xu.  An O(n1.5) Deterministic Gossiping Algorithm for Radio Networks , 2002, Algorithmica.

[13]  Andrea E. F. Clementi,et al.  Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.

[14]  Suresh Singh,et al.  Asymptotically optimal Gossiping in Radio Networks , 1995, Discret. Appl. Math..

[15]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[16]  Andrzej Lingas,et al.  Gossiping with Bounded Size Messages in ad hoc Radio Networks , 2002, ICALP.

[17]  Xiaohua Jia,et al.  Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[18]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[19]  Rajiv Gandhi,et al.  Minimizing broadcast latency and redundancy in ad hoc networks , 2003, MobiHoc '03.

[20]  Piotr Indyk,et al.  Explicit constructions of selectors and related combinatorial structures, with applications , 2002, SODA '02.

[21]  Qin Xin,et al.  Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks , 2006, CAAN.

[22]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[23]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

[24]  Andrzej Lingas,et al.  Oblivious gossiping in ad-hoc radio networks , 2001, DIALM '01.