MINIMUM LOCAL DISK COVER SETS FOR BROADCASTING IN HETEROGENEOUS MULTIHOP WIRELESS NETWORKS

摘要: The concept of forwarding sets is widely adopted in many broadcast protocols for wireless multihop networks to alleviate the storm problem. In these protocols, after receiving a message, each node that requested relay message instructs subset its 1-hop neighbors, a.k.a. set, further it. this paper, we propose use Minimum Local Disk Cover Set (MLDCS) as set heterogeneous networks, where nodes may have different transmission ranges.We show minimum local disk cover equivalent skyline and then divide-and-conquer algorithm with optimal time complexity compute locally statelessly. Moreover, unlike other heuristics, proposed requires only neighbor information. This helps reduce formation latency thus will be more suitable environments frequently changed network topology, such vehicular ad hoc networks.