Research Article | OPEN ACCESS
A Novel Enhanced Coverage Optimization Algorithm for Effectively Solving Energy Optimization Problem in WSN
1M. Senthil Kumar and 2Ashish Chaturvedi
1Department of Electronics and Communication Engineering, V.B.S. Purvanchal University, Jaunpur, Uttar Pradesh, India
2Arni School of Computer Science and Applications, Arni University, Indora (Kathgarh), Himachal Pradesh, India
Research Journal of Applied Sciences, Engineering and Technology 2014 4:696-701
Received: January 26, 2013 | Accepted: March 21, 2013 | Published: January 27, 2014
Abstract
In Wireless Sensor Networks (WSN), Efficient-Energy Coverage (EEC) is one of the important issues for considering the (WSNs) implementation. In this study, we have developed the new algorithm ECO (Enhanced Coverage Optimization) for solving the EEC problem effectively. The proposed algorithm uses three types of major work for effectively solving the problem. One of the three pheromones is the local pheromone, which helps an ant organize its coverage set with fewer sensors. The other two pheromones are global pheromones, one of which is used to optimize the number of required active sensors per Point of Interest (PoI) and the other is used to form a sensor set that has as many senses as an ant has selected the number of active sensors by using the former pheromone. This study also introduces one technique that leads to a more realistic approach to solving the EEC problem that is to utilize the probabilistic sensor detection model. The main goal of ECO is Efficient Coverage on target area with minimum energy consumption and increased network's lifetime.
Keywords:
Ant Colony Optimization (ACO), energy efficient coverage, three types of pheromones, Point of Interest (PoI), probabilistic sensor detection,
References
-
Anastasi, G., M. Conti and M.D. Francesco, 2009. Extending the lifetime of wireless sensor networks through adaptive sleep. IEEE T. Ind. Inform., 5(3): 351-365.
CrossRef -
Chen, J., J. Li, S. He, Y. Sun and H.H. Chen, 2010. Energy-efficient coverage based on the probabilistic sensing model in wireless sensor networks. IEEE Commun. Lett., 14(9): 833-835.
CrossRef -
Heinzelman, W.B., A.P. Chandrakasan and H. Balakrishnan, 2002. An application-specific protocol architecture for wireless microsensor networks. IEEE T. Wirel. Commun., 1: 660-670.
CrossRef -
Li, Q., L. Cui, B. Zhang and Z. Fan, 2010. A low energy intelligent clustering protocol for wireless sensor networks. Proceeding of IEEE International Conference on Industrial Technology, pp: 1675-1682.
CrossRef -
Lin, Y., X.M. Hu, J. Zhang, O. Liu and H.L. Liu, 2010. Optimal node scheduling for the lifetime maximization of two-tier wireless sensor networks. Proceeding of IEEE Congress on Evolutionary Computation (ECE), pp: 1-8.
CrossRef -
Lindsey, S. and C.S. Raghavendra, 2002. PEGASIS: Power-efficient gathering in sensor information systems. Proceedings of the Aerospace Conference, Big Sky, MT, pp: 1125-1130.
CrossRef -
Luntovskyy, A., V. Vasyutynskyy and K. Kabitzsch, 2010. Propagation modeling and placement algorithms for wireless sensor networks. Proceeding of IEEE International Symposium on Industrial Electronics (ISIE), pp: 3493-3497.
CrossRef -
Ming, Z., Z. Ping, S. Zheng and H. Tongzhi, 2010. A Novel Energy efficient converage control in WSNs based on ant colony optimization. Proceeding of IEEE International Symposium on Computer Communication Control and Automation, pp: 523-527.
-
Noah, S., R.A. Abbass, D.A.E. Seoud, N.A. Ali, R.M. Daoud, H.H. Amer and H.M. ElSayed, 2010. Effect of node distributions on lifetime of wireless sensor networks. Proceeding of IEEE International Symposium on Industrial Electronics, pp: 434-439.
CrossRef -
Selcuk, O. and D. Karaboga, 2009. Routing in wireless sensor networks using an Ant Colony Optimization (ACO) router chip. Sensors, 9(2): 909-921.
CrossRef PMid:22399947 PMCid:PMC3280839
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|