Multiple communication im multihop radio networks
SIAM Journal on Computing
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Many-to-Many Communication in Radio Networks
Algorithmica
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time-efficient randomized multiple-message broadcast in radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Nearly optimal bounds for distributed wireless scheduling in the SINR model
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Distributed ($#916;+1)-coloring in the physical model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
DCOSS '12 Proceedings of the 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems
Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Connectivity and aggregation in multihop wireless networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
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.