@inproceedings{2f28794f979246779167eb056fe2b698,
title = "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.",
author = "Yi, {Chih Wei} and Liu, {Fang Chun} and Sun, {Min Te}",
year = "2007",
doi = "10.1109/ICPPW.2007.55",
language = "???core.languages.en_GB???",
isbn = "0769529348",
series = "Proceedings of the International Conference on Parallel Processing Workshops",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "47--52",
booktitle = "2007 International Conference on Parallel Processing Workshops, ICPPW",
note = "2007 International Conference on Parallel Processing Workshops, ICPPW 2007 ; Conference date: 10-09-2007 Through 14-09-2007",
}