Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model

In a multiple-message broadcast, an arbitrary number of messages originate at arbitrary nodes in the network at arbitrary times. The problem is to disseminate all these messages to the whole network. This paper gives the first randomized distributed multiple-message broadcast algorithm with worst-case performance guarantee in wireless ad-hoc networks employing the SINR interference model which takes interferences from all the nodes in the network into account. The network model used in this paper also considers the harsh characteristics of wireless ad-hoc networks: there is no prior structure, and nodes cannot perform collision detection and have little knowledge of the network topology. Under all these restrictions, our proposed randomized distributed multiple-message broadcast protocol can deliver any message m to all nodes in the network in O(D+k+log2n) timeslots with high probability, where D is the network diameter, k is the number of messages whose broadcasts overlap with m, and n is the number of nodes in the network. We also study the lower bound for randomized distributed multiple-message broadcast protocols. In particular, we prove that any uniform randomized algorithm needs $\Omega(D+k+\frac{\log^2n}{\log\log\log n})$ timeslots to deliver k messages initially stored at k nodes to all nodes in the network.

[1]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

[2]  Dariusz R. Kowalski,et al.  Many-to-Many Communication in Radio Networks , 2007, Algorithmica.

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

[4]  Magnús M. Halldórsson,et al.  Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model , 2011, ICALP.

[5]  Berthold Vöcking,et al.  Distributed Contention Resolution in Wireless Networks , 2010, DISC.

[6]  Nancy A. Lynch,et al.  The abstract MAC layer , 2009, Distributed Computing.

[7]  Eyal Kushilevitz,et al.  An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..

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

[9]  Reuven Bar-Yehuda,et al.  Multiple communication in multi-hop radio networks , 1989, PODC '89.

[10]  Chuan Wu,et al.  Latency-minimizing data aggregation in wireless sensor networks under physical interference model , 2014, Ad Hoc Networks.

[11]  Chuan Wu,et al.  Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model , 2010, MSWIM '10.

[12]  Majid Khabbazian,et al.  Time-efficient randomized multiple-message broadcast in radio networks , 2011, PODC '11.

[13]  Francis C. M. Lau,et al.  Distributed local broadcasting algorithms in the physical interference model , 2011, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS).

[14]  Nancy A. Lynch,et al.  Structuring unreliable radio networks , 2011, PODC '11.

[15]  Francis C. M. Lau,et al.  An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks , 2012, 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems.

[16]  Roger Wattenhofer,et al.  Local broadcasting in the physical interference model , 2008, DIALM-POMC '08.

[17]  Christian Scheideler,et al.  An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model , 2008, MobiHoc '08.

[18]  Tomasz Jurdzinski,et al.  Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks , 2002, ISAAC.

[19]  Nancy A. Lynch,et al.  Decomposing broadcast algorithms using abstract MAC layers , 2010, DIALM-POMC '10.

[20]  Francis C. M. Lau,et al.  Distributed (Δ + 1)-Coloring in the Physical Model , 2011, ALGOSENSORS.