Brief Announcement: Multi-Broadcasting under the SINR Model

We study the multi-broadcast problem in multi-hop ad-hoc wireless networks, under the SINR model, deployed in the 2D Euclidean plane. In multi-broadcast, there are $k$ initial messages, potentially belonging to different nodes, that must be forwarded to all $n$ nodes of the network. We present deterministic algorithms for multi-broadcast for the different settings reflecting the different types of knowledge, about the topology of the network, available to the nodes: (i) the whole network topology (ii) their own coordinates and coordinates of their neighbors (iii) only their own physical coordinates (iv) only their own ids and the ids of their neighbors, but not actual physical co-ordinates. The last result is specially interesting, as it is the first deterministic protocol, for the SINR model, that does not require nodes to know their coordinates in the plane (a very specialized type of knowledge), but intricately exploits the fact that they lie on a two dimensional plane.