Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Garey, M.L., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)
Sun, M., Lai, T.H.: Computing Optimal Local Cover Set for Broadcast in Ad Hoc Networks. In: Proc. IEEE ICC, April 2002, pp. 3291–3295 (2002)
Sun, M., et al.: GPS-Based Message Broadcasting for Inter-vehicle Communications. In: Proc. IEEE ICPP, August 2000, pp. 279–286 (2000)
Intanagonwiwat, C., et al.: Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. In: ACM MOBICOM, August 2000, pp. 56–67 (2000)
Ko, Y.B., Vaidya, N.H.: Location-Aided Routing (LAR) in Mobile Ad Hoc Networks. In: ACM MOBICOM, August 1998, pp. 66–75 (1998)
Ni, S.Y., et al.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. In: ACM MOBICOM, August 1999, pp. 151–162 (1999)
Sun, M., Lai, T.H.: Location Aided Broadcast in Wireless Ad Hoc Network Systems. In: Proc. IEEE WCNC, March 2002, pp. 597–602 (2002)
Sun, M., et al.: Reliable MAC Layer Multicast in IEEE 802.11 Wireless Networks. In: Proc. IEEE ICPP, August 2002, pp. 527–536 (2002)
Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the Shape of a Set of Points in the Plane. IEEE Transactions on Information Theory IT-29, 551–559 (1983)
Sun, M., et al.: Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks. Auburn University Technical Report, CSSE05-06 (May 2005)
Dobkin, D.P., Lipton, R.J.: On the Complexity of Computations Under Varying Sets of Primitives. Journal of Computer and System Sciences 18, 86–91 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, MT., Ma, X., Yi, CW., Yang, CK., Lai, T.H. (2005). Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_75
Download citation
DOI: https://doi.org/10.1007/11534310_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)