A Novel Sleep Scheduling Algorithm for Wireless Sensor Networks

Sleep Scheduling is one of the most important challenges for energy conservation in Wireless Sensor Networks (WSNs). Connected Dominating Set (CDS) based virtual backbone is often employed in WSNs. Compared with the ordinary CDS, the R-hop Connected Dominating Set (R-CDS) with smaller size is more suitable for build a virtual backbone for energy conservation. In this paper, a R-hop connected dominating sets based Partition Algorithm (RPA) is proposed to construct the R-CDP with the knowledge of local connectivity information only. RPA establishes multiple overlapped virtual backbones for WSNs such that every virtual backbone works in sleep schedule to achieve energy consumption evenly among all sensor nodes for prolonging the lifetime of the networks to maximization. The simulation results show that compared with the other schemes, our strategy can improve the performance of the networks in longer lifetime.

[1]  Jie Wu,et al.  On Maximizing the Lifetime of Wireless Sensor Networks Using Virtual Backbone Scheduling , 2012, IEEE Transactions on Parallel and Distributed Systems.

[2]  Lei Wang,et al.  Cluster based node scheduling method for wireless sensor networks , 2011, Science China Information Sciences.

[3]  Selim G. Akl,et al.  Maximizing the lifetime of wireless sensor networks through domatic partition , 2009, 2009 IEEE 34th Conference on Local Computer Networks.

[4]  Li Xu,et al.  Constructing Connected Dominating Set Based on Crossed Cube in WSN , 2013, 2013 5th International Conference on Intelligent Networking and Collaborative Systems.

[5]  Jiguo Yu,et al.  Domatic partition in homogeneous wireless sensor networks , 2014, J. Netw. Comput. Appl..

[6]  Chittaranjan A. Mandal,et al.  Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

[7]  Bhaskar Krishnamachari,et al.  Delay efficient sleep scheduling in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Sriram V. Pemmaraju,et al.  Approximation Algorithms for Domatic Partitions of Unit Disk Graphs , 2009, APPROX-RANDOM.

[9]  Li Xu,et al.  A novel sleep scheduling scheme in green wireless sensor networks , 2014, The Journal of Supercomputing.

[10]  Deying Li,et al.  Two Algorithms for Connected R-Hop k-Dominating Set , 2009, Discret. Math. Algorithms Appl..

[11]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[12]  Imran A. Pirwani,et al.  Energy conservation via domatic partitions , 2006, MobiHoc '06.

[13]  Deng Li,et al.  High-Density Randomly Deployed Nodes Sleep Scheduling Algorithm in Wireless Sensor Networks , 2013 .

[14]  Chan Zheng,et al.  Construction of d-Hop Connected Dominating Sets in Wireless Sensor Networks , 2011 .

[15]  Douglas F. Rall,et al.  Connected Domatic Number in Planar Graphs , 2001 .