Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Wireless Ad Hoc Networks

Abstract

The concept of the forwarding set has been used extensively by many broadcast protocols in wireless ad hoc networks to alleviate the broadcast storm problem. In these protocols, when a node receives a broadcast, it only instructs a subset of its neighbors, a.k.a. the forwarding set, to relay the message. In this paper, we propose to use the local minimum disk cover set as the forwarding set in heterogeneous wireless ad hoc networks, where nodes may have different transmission radius. We show that the minimum local disk cover set of a node is equivalent to its skyline set, and propose a divide-and-conquer algorithm with the optimal time complexity O (n log n) to compute the skyline set locally and statelessly.