Abstract
In this paper, we propose two techniques to solve a 2-covered path problem. Given a set of n antennas with m available radii and two points A and B on the plane, our goal is to find a suitable radius p∈m (as well as transmission power) for each antenna so that the active antennas in a 2-covered path with endpoints A and B consumes minimum transmission power. The proposed techniques called 2-covered area stretching planning (TASP) and radii shrinking planning (RSP) that apply different strategies to reduce power consumption. Experimental results show that RSP derives less power consumption than TASP, and RSP and TASP take O(n 2) and O(n 3) time complexity, respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aardal, K., van Hoesel, C.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for the frequency assignment problem. 4OR 1, 261–318 (2006)
Abellanas, M., Bajuelos, A.L., Matos, I.: Optimal 2-coverage of a polygonal region in a sensor network. Algorithms 2, 1138–1154 (2009)
Abellanas, M., Bajuelos, A.L., Matos, I.: 2-Covered paths by a set of antennas with minimum power transmission range. Information Processing Letters 109(14), 868–883 (2009)
Boukerche, A., Fei, X., Araujo, R.B.: An energy aware coverage-preserving scheme for wireless sensor networks. In: Proocedings of the 2nd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks, Montreal, Canada, October 13, pp. 205–213 (2005)
Chen, L., Yuan, D.: Solving a minimum-power covering problem with overlap constraint for cellular network design. European Journal of Operational Research 203, 814–823 (2010)
Eisenblatter, A., Geerdes, H.F., Grotschel, M.: Planning UMTS radio networks. OR/MS Today 35, 41–46 (2008)
Eisenblatter, A., Koch, T., Martin, A., Achterberg, T., Fugenschuh, A., Koster, A., Wegel, O., Wessaly, R.: Modelling feasible network configurations for UMTS. In: Anandalingam, G., Raghavan, S. (eds.) Telecommunications Network Design and Management. Kluwer Academic Publishers (2002)
Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal Packing and Covering in the Plane are NP-Complete. Information Processing Letter, 133–138 (1981)
Franceschetti, M., Cook, M., Bruck, J.: A geometric theorem for approximate disk covering algorithms. Technical report, California Institute of Technology (2001)
Gonzalez, T.F.: Covering a set of points in multidimensional space. Information Processing Letters 40(4), 181–188 (1991)
Hochbaum, D.S., Maass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. Journal of ACM 32(1), 130–136 (1985)
Nawrocki, M., Aghvami, H., Dohler, M. (eds.): Understanding UMTS RadioNetwork Modelling, Planning and Automated Optimisation: Theory and Practice. Wiley (2006)
Xiao, B., Zhuge, Q., Zhang, Y., Sha, E.H.M.: Algorithms for disk covering problems with the most points. In: Proceedings of the IASTED International Conference on
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, DR., Hsu, CC., Chen, YS., Guo, JF. (2012). Solving a 2-Covered Path Problem with Variable Radii for Wireless Sensor Networks. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2012. Lecture Notes in Computer Science, vol 7440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33065-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-33065-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33064-3
Online ISBN: 978-3-642-33065-0
eBook Packages: Computer ScienceComputer Science (R0)