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

Distributed Randomized Broadcasting in Wireless Networks under the SINR Model

“…Although the problem solved in that paper is a generalization of broadcast, the presented solution is restricted merely to networks having the communication graph connected for ε = 2 3 r, where r is the largest possible SINR ratio. In contrast, our solutions are efficient and scalable for any networks with communication graph connected for any value of ε < 1 2 . There is a vast amount of work on centralized algorithms under the SINR model.…”

“…Recently, a distributed randomized algorithm for multi-broadcast has been presented [1] for uniform networks. Although the problem solved in that paper is a generalization of broadcast, the presented solution is restricted merely to networks having the communication graph connected for ε = 2 3 r, where r is the largest possible SINR ratio.…”

“…Locations of stations and parameters of the SINR model determine a communication graph of the network: It is defined on network nodes and contains links (v, w) such that the distance from v to w is at most (1 − ε) of the maximum SINR ratio possible at node w, where 0 < ε < 1 is a fixed model parameter. This definition is common in the literature, c.f., [1], and naturally motivated. Intuitively, we should be able to propagate messages along the links in the communication graph, but not necessarily between any two non-connected nodes, as the distance between them (bigger than (1 − ε) fraction of the maximum SINR ratio possible) could be easily interrupted by even a single faraway transmission in realistic scenarios.…”

Connectivity and aggregation in multihop wireless networks

“…These works do not attempt to construct a network among dominators. Broadcast or aggregation networks among dominators are formed in some works [23,8] (as well as the works in the previous paragraph), but none give quite what we need. They either need a large (at least 2/3) to work [23,7], use precise location information [8], and/or do not form an aggregation network [8,23].…”

“…The work we directly use is that of [22], where an algorithm is provided to find dominating sets in the SINR model in O(log n) time. Also relevant is [13], where a dominating set is constructed using a distributed algorithm in a quasi unit disk model, which can be converted to the SINR model (see [23]). These works do not attempt to construct a network among dominators.…”