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+log2⁡n)O(D+k+log2⁡n) 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 Ω(D+k+log2⁡nlog⁡log⁡log⁡n) timeslots to disseminate k messages initially stored at k nodes.