Abstract
We consider a wireless sensor network’s lifetime maximization problem as an integer linear programming problem when the redundant set of covers is given, and it is necessary to choose a lifetime of each cover subject to the limited sensor’s resources. Irrespective of the function of any sensor in a cover, we suppose that the sensor may be active during some time, and the number of time rounds when it is active we call the sensor’s resource. We proved that the considered problem is strong NP-hard; proposed the ways to reduce the problem; shown that the problem is not approximable within the 0.997; found special cases when it is in the class APX; proposed several heuristics and performed a simulation.
This research was supported jointly by the Russian Foundation for Basic Research (grant 10-07-92650-IND-a) and by Federal Target ”Grant Scientific and educational personnel of innovation Russia” for 2009-2013 (government contract No. 14.740.11.0362).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Inanc, M., Magdon-Ismail, M., Yener, B.: Power Optimal Connectivity and Coverage in Wireless Sensor Networks. Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY (2003)
Segal, M.: Improving Lifetime of Wireless Sensor Networks. Network Protocols and Algorithms 1(2) (2009) ISSN 1943-3581 2009
Cardei, M., Wu, J., Lu, M., Pervaiz, M.O.: Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges. In: Proceedings of the IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob., vol. 3, pp. 438–445 (2005)
Zalubovsky, V., Astrakov, S., Erzin, A., Choo, H.: Energy-efficient Area Coverage by Sensors with Adjustable Ranges. Sensors 9(4), 2446–2460 (2009)
Berman, P., Galinescu, G., Shan, C., Zelikovsky, A.: Power efficient monitoring management in sensor networks. In: Proceedings of IEEE Wireless Communications and Networking Conference, WCNC 2004, Atlanta, USA, March 21-25, pp. 2329–2334 (2004)
Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of FOCS (1997)
Garey, M.R., Johnson, D.S.: Computers and Intractability. A guide to the theory of NP-completeness. Freeman, New York (1979)
Berman, P., Fujito, T.: Approximating independent sets in degree 3 graphs. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 449–460. Springer, Heidelberg (1995)
Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)
Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized graph products. Computational Complexity 5, 60–75 (1995)
Berman, P. Karpinski, M.: On some tighter inapproximability results. Technical Report TR98-065, ECCC (1998)
Ghouila-Houri, A.: Caract’erisation des matrices totalement unimodulaires. Comptes Rendus Hebdomadaires des S’eances de l’Acad’emie des Sciences 254, 1192–1194 (1962)
Gavril, F.: Algorithms on circular-arc graphs. Networks 4, 357–369 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erzin, A.I., Plotnikov, R.V. (2011). Wireless Sensor Network’s Lifetime Maximization Problem in Case of Given Set of Covers. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6786. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21934-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-21934-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21933-7
Online ISBN: 978-3-642-21934-4
eBook Packages: Computer ScienceComputer Science (R0)