Energy-efficient k-coverage scheduling algorithm for sensor networks with adjustable sensing range

A dynamic energy efficient scheduling algorithm for k-coverage Wireless Sensor Networks with adjustable sensing range has been proposed in this study. These types of sensors require a minimal coverage range setting to reduce the utilization of energy. In our proposed algorithm, each sensor utilizes the minimum feasible sensing range without affecting the network coverage; on the other hand, the activated sensors are able to cover the same area if they are activated with their maximum sensing range. Outcomes of the experiments have revealed that, the algorithm proposed in this study has reduced the cost of sensing energy of all sensors, without affecting the network coverage, and furthermore, the power has been effectively distributed among the network sensors, and lifetime of the network has been successfully extended.

[1]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[2]  Jie Wu,et al.  Maximum network lifetime in wireless sensor networks with adjustable sensing ranges , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[3]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[4]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[5]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[6]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  M. Manaf,et al.  MLS: An efficient maximum layers scheduling algorithm for k-coverage wireless sensor networks , 2012, 2012 IEEE Symposium on Wireless Technology and Applications (ISWTA).

[8]  Thomas F. La Porta,et al.  Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks , 2012, TOSN.

[9]  Himanshu Gupta,et al.  Variable radii connected sensor cover in sensor networks , 2004, SECON.

[10]  József Balogh,et al.  On k−coverage in a mostly sleeping sensor network , 2008, Wirel. Networks.

[11]  Shan Gao,et al.  Designing k-coverage schedules in wireless sensor networks , 2008, J. Comb. Optim..

[12]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[13]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[14]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.

[15]  Yu-Chee Tseng,et al.  Location Tracking in a Wireless Sensor Network by Mobile Agents and Its Data Fusion Strategies , 2003, Comput. J..

[16]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).