Abstract
Density control is a promising method to conserve system energy and prolonging lifetime of wireless sensor networks. In this paper, we address the issue of maintaining sensing coverage of surveillance target in large density wireless sensor networks and present an efficient technique for the selection of active sensor nodes. First, the At Most k-Coverage Problem (AM k-Coverage) is defined and modeled as a nonlinear integer programming. Second, Genetic Algorithm which is a quasi-parallel method to construct set cover is designed to solve the multi-objective nonlinear integer programming. And later by using Genetic Algorithm, a central algorithm is designed to organize a sensor network into coverage sets. Finally, Experimental results show that the proposed algorithm can construct the coverage sets reliably and reduce the number of active sensor nodes which is helpful to reduce system energy consumption and prolong the network lifespan.
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
Steuer, R.E.: Multiple criteria optimization: Theory, computation, and application. Wiley, New York (1986)
Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. on Comput. 51(12), 1448–1453 (2002)
Cardei, M., Du, D.Z.: Improving wireless sensor network lifetime through power aware organization. ACM Wireless Networks 11(3) (2005)
Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 3, pp. 1976–1984 (2005)
Cardei, M., Wu, J., Lu, M., Pervaiz, M.O.: Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: Proc. of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob (2005)
Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 15(10), 908–920 (2004)
Harary, F., Haynes, T.: Double domination in graphs. ARS Combinatoria 55, 201–213 (2000)
Koubaa, H., Fleury, E.: On the performance of double domination in ad hoc networks. In: Proc. of IFIP Medhoc (2000)
Shaikh, J., Solano, J., Stojmenovic, I., Wu, J.: New metrics for dominating set based energy efficient activity scheduling in ad hoc networks. In: Proc. of the International Workshop on Wireless Local Networks, WLN (2003)
Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless networks. In: Proc. of IPDPS (2005)
Deb, K.: An Efficient Constraint Handling Method for GAs. Computer Methods in Applied Mechanics and Engineering 186(2/4), 311–338 (2000)
Srinivas, N., Deb, K.: Multi-Objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Computation 2(3), 221–248 (1994)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)
Deband, K., Agarwal, R.B.: Simulated Binary Crossover for Continuous Search Space. Complex Systems 9, 115–148 (1995)
Dai, F., Wu, J.: On Constructing K-Connected K-Dominating Set in Wireless Networks. In: Proc. of IEEE IPDPS (2005)
Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Ramchandran, K., Sztipanovits, J. (eds.) Proc. of the 3rd Int’l Conf. on Information Processing in Sensor Networks, Berkeley, pp. 424–432. ACM Press, New York (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zhang, D., Xu, M., Wang, S., Zhang, B. (2007). Minimization of the Redundant Coverage for Dense Wireless Sensor Networks. In: Lee, YH., Kim, HN., Kim, J., Park, Y., Yang, L.T., Kim, S.W. (eds) Embedded Software and Systems. ICESS 2007. Lecture Notes in Computer Science, vol 4523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72685-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-72685-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72684-5
Online ISBN: 978-3-540-72685-2
eBook Packages: Computer ScienceComputer Science (R0)