A Sustainable Scheme for Minimizing Energy in Visual Sensor Network using Disjoint Set Cover Approach
Engineering and Technology Journal,
2020, Volume 38, Issue 12, Pages 1818-1831
AbstractDirectional sensors in wireless visual sensor networks attract growing attention as a promising tool for monitoring the real world; directional sensors consume energy for two main tasks: sensing and communication. Since a VSN contains a number of configurable visual sensors with changeable spherical sectors of restricted angle known as a field of view that is intended to monitor a number of targets located in a random manner over a given area. Therefore maximizing the network lifetime through minimizing power consumption while covering the targets remains a challenge. In this paper, the problem of obtaining a disjoint set cover includes a minimum number of camera sensors is solved. The problem is known to be NP-complete. The sustainable design is improving an existing Iterative Target Oriented Algorithm (ITOA) to cover moving targets move randomly over a given area of deployment starting from entry points reaching to exit ones in a realistic simulation. To evaluate the performance of the modified algorithm, a comparison is provided with three existing algorithms (Iterative centralized Greedy Algorithm (ICGA), Iterative Centralized Forced-directed Algorithm ICFA, and Iterative Target Oriented Algorithm ITOA). Simulation results revealed that the sustainable scheme can find a disjoint set with a minimum number of sensors covers the maximum number of moving targets in an energy-efficient way and extended network lifetime.
 Y. Xiong, J. Li, and M. Lu, “Critical location spatial-temporal coverage optimization in visual sensor network,” Sensors (Switzerland), Vol. 19, No. 19, pp. 1–14, 2019.
 M. Cardei and B. Raton, “Energy -Efficient Target Coverage in Wireless Sensor Networks,” Proceedings - IEEE INFOCOM 16(5):1976 - 1984 vol. 3 · April 2005 .
 J. Ai and A. A. Abouzeid, “Coverage by directional sensors in randomly deployed wireless sensor networks,” J. Comb. Optim., vol. 11, no. 1, pp. 21–41, 2006.
 Yanli Cai, Wei Lou, Minglu Li, and Xiang-Yang Li, “Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks,” IEEE Trans. Comput., vol. 58, no. 9, pp. 1259–1274, 2009.
 V. P. Munishwar and N. B. Abu-Ghazaleh, “Target-oriented coverage maximization in visual sensor networks,” p. 175, 2011.
 N. Ahn and S.Park, "A New Mathematical Frormulation and a Heuristic for the Maximum Disjoint Set Covers problem to Improve the Lifetime of the Wireless Sensor Network", vol. 13, pp209-225, 2011.
 L. Ding, W. Wu, J. Willson, L. Wu, Z. Lu, and W. Lee, “Constant-approximation for target coverage problem in wireless sensor networks,” Proc. - IEEE INFOCOM, pp. 1584–1592, 2012
 A. Neishaboori, A. Saeed, K. A. Harras, and A. Mohamed, “Low complexity target coverage heuristics using mobile cameras,” Proc. - 11th IEEE Int. Conf. Mob. Ad Hoc Sens. Syst. MASS 2014, pp. 217–221, 2015.
 S. Farzana, K. A. Papry, A. Rahman, and R. Rab, “Maximally pair-wise disjoint set covers for directional sensors in visual sensor networks,” IFIP Wirel. Days, vol. 2016-April, no. iv, 2016.
 R. Sharma, “Traits of visual sensor networks,” Proceedings of the International Conference on Inventive Research in Computing Applications (ICIRCA) IEEE Xplore Compliant Part Number: CFP18N67-ART; July, 2018.
 D. G. Costa and L. A. Guedes, “The coverage problem in video-based wireless sensor networks: A survey,” Sensors, vol. 10, no. 9, pp. 8215–8247, 2010.
 H. Gupta, Z. Zhou, S. Member, S. R. Das, and Q. Gu, “Connected Sensor Cover : Self-Organization of Sensor Networks for Efficient Query Execution,” vol. 14, no. 1, pp. 55–67, 2006.
 V. P. Munishwar and N. B. Abu-Ghazaleh, “Coverage algorithms for visual sensor networks,” ACM Trans. Sens. Networks, vol. 9, no. 4, 2013.
 H. Zannat, T. Akter, M. Tasnim, and A. Rahman, “The coverage problem in visual sensor networks: A target oriented approach,” J. Netw. Comput. Appl., vol. 75, pp. 1–15, 2016.
 M. F. Abdulhalim and A. Attea, “Multi-layer Genetic Algorithm for Maximum Disjoint Reliable Set Covers Problem in Wireless Sensor Networks,” 2004.
 R. Deepa, R. Venkataraman, M. Pushpalatha, and P. T. Ravichandran, “A review on cover set problem in wireless sensor networks,” J. Adv. Res. Dyn. Control Syst., vol. 9, no. 8, pp. 151–161, 2017.
 R. A. Hamamreh, “An Energy-Efficient Clustering Routing Protocol for WSN based on MRHC,” Int. J. Digit. Inf. Wirel. Commun., vol. 8, no. 3, pp. 214–222, 2018.
 S. Soro and W. B. Heinzelman, “On the coverage problem in video-based wireless sensor networks,” 2nd Int. Conf. Broadband Networks, BROADNETS 2005, vol. 2005, pp. 9–16, 2005.
 W. C. Feng, E. Kaiser, W. C. Feng, and M. Le Baillif, “Panoptes: Scalable Low-Power Video Sensor Networking Technologies,” ACM Trans. Multimed. Comput. Commun. Appl., vol. 1, no. 2, pp. 151–167, 2005.
- Article View: 15
- PDF Download: 7