Email this article 
Open Access
Subscription or Fee Access
Design of Efficient Genetic Algorithm using Local Exploration with K Cover to Enhance Coverage in Wireless Sensor Networks
Abstract
Wireless sensor network is a rapidly growing area for research and commercial development. Coverage of all targets with minimum number of sensors a key issue in WSN applications such as surveillance. One effective method is to partition the collection of sensors into several covers, each of which must include all targets, and then to activate these covers one by one. The problem of finding the maximum number of covers has been modeled as the set K-cover problem, which has been proven to be NP-complete. This paper proposes a local operator based Genetic algorithm to solve K-cover problem. Proposed solution has high value of disjoint sets at the same time use lesser number of sensors to form cover. A set of unused sensors at the end can be reutilized to deliver the backup support for any cover set if there is any fault available with any member .This will help in enhancing the coverage all targets with minimum number of sensors.
Keywords
References
I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, “Wireless sensor networks: a survey”, Computer Networks 38 (4) (2002) 393–422.
P. Berman, G. Calinescu, C. Shah, A. Zelikovsky, “Power efficient monitoring management in sensor networks”, in: Proceedings of the Wireless Communications and Networking Conference, vol. 4, 2004, pp. 2329–2334
M.Cardei, D.Z. Du,” Improving wireless sensor network lifetime through power aware organization”, Wireless Networks 11 (3) (2005) 333–340.
M.Cardei, M.T. Thai, Y. Li, W. Wu, “Energy-efficient target coverage in wireless sensor networks”, in: Proceedings of the IEEE INFOCOM, IEEE, 2005, pp.1976–1984.
M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979.
Z. He, B.S. Lee, X.S. Wang, “Aggregation in sensor networks with a user-provided quality of service goal”, Information Sciences 178 (9) (2008) 2128–2149.
W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks”, in Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, 2000, pp. 1–10.
Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin, Directed diffusion: “a scalable and robust communication paradigm for sensor networks”, in: MobiCom ’00: Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, ACM, 2000, pp. 56–67.
L.Krishnamachari, D. Estrin, S. Wicker,”The impact of data aggregation in wireless sensor networks”, in: Proceedings of the 22nd International Conference on Distributed Computing Systems Workshop, 2002, pp. 575–578, 2002.
F. Marcelloni, M. Vecchio, “Enabling energy-efficient and lossy-aware data compression in wireless sensor networks by multi-objective evolutionary optimization”, Information Sciences 180 (10) (2010) 1924–1941.
C.Ok, S. Lee, P. Mitra, S. Kumara,” Distributed routing in wireless sensor networks using energy welfare metric”, Information Sciences 180 (9) (2010)
P.S. Sausen, M.A. Spohn, A. Perkusich, “Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones”,Information Sciences 180 (5) (2010) 653–663.
Meenakshi Bansal, Iqbal Singh, Parvinder S. Sandhu,” Coverage and Connectivity Problem in Sensor Networks””World Academy of Science, Engineering and Technology 73, 2011.
AlShawi, I.S,”Lifetime Enhancement in Wireless Sensor Networks Using Fuzzy Approach and A-Star Algorithm”, Sensors Journal, IEEE (Volume:12 , Issue: 10 ),2012
Rout, R.R,” Enhancement of Lifetime using Duty Cycle and Network Coding in Wireless Sensor Networks”, Wireless Communications, IEEE, Volume:12 Issue:2,2013
Majidi Mansouri,Hazem Nounou, Mohamed Nounou “Genetic algorithm- based adpaptive Optimization for Target Tracking in Wireless sensor Networks”, Journal of signal processing systems,Feb 2014,Volume 74, Issue 2, pp 189-202.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.