Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
GPS-Based Message Broadcasting for Inter-vehicle Communication
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Reliable MAC Layer Multicast in IEEE 802.11 Wireless Networks
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
On connected area coverage sets in wireless sensor networks
Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
Hi-index | 0.00 |
The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute the minimum disc cover set proposed in previous study has been considered too expensive. In this paper, we show that the disc cover set problem is in fact a special case of the general α-hull problem. In addition, we prove that the disc cover set problem is not any easier than the α-hull problem by linearly reducing the element uniqueness problem to the disc cover set problem. In addition to the known α-hull approach, we provide an optimal divide-and-conquer algorithm that constructs the minimum disc cover set for arbitrary cases, including the degenerate ones where the traditional α-hull algorithm incapable of handling.