Abstract
By researching on the node scheduling problem of m-covered and connected sensor networks, a new concept of two-hops-cluster is proposed in this paper, and based on it, a new distributed node scheduling algorithm THCNS for allocating all nodes in the sensor network into k(k ⩽m) different groups {0, 1, ..., k −1} is designed, without requiring location information. Our algorithm guarantees that each group to be connected and maintains the coverage ratio with high possibility. Theoretical analysis and simulation results show that it has better performance than previous randomized scheduling scheme, and can prolong the lifetime of the sensor network effectively.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Akyildiz I F, Su W, Sankarasubramaniam Y, et al. A survey on sensor networks. IEEE Commun Mag, 2002, 40: 102–114
Wang C, Yin Q Y, Wang W J. An efficient ranging method based on Chinese remainder theorem for RIPS measurement. Sci China Inf Sci, 2010, 53: 1233–1241
Wang L, Wei R Z. Reputation model based pair-wise key establishment scheme for sensor networks. Ad Hoc Sensor Wirel Netw, 2010, 9: 163–177
Tang Q L, Yang L Q, Qin T F, et al. Energy-saving PPM schemes for WSNs. Sci China Ser F-Inf Sci, 2008, 51: 571–585
Chen B J, Jamieson K, Balakrishnan H, et al. Span: an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks. ACM Wirel Netw, 2002, 8: 481–494
Liu C, Wu K, Xiao Y, et al. Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks. IEEE Trans Parall Distr, 2006, 17: 562–575
Li X Y, Wan P J, Frieder O. Coverage in wireless ad hoc sensor networks. IEEE Trans Comput, 2003, 52: 753–763
TSAI Y R. Coverage preserving routing protocols for randomly distributed wireless sensor networks. IEEE Trans Wirel Commun, 2007, 6: 1240–1245
Cortes J, Martinez S, Karatas T, et al. Coverage control for mobile sensing networks. IEEE Trans Robotic Autom, 2004, 20: 243–255
Ding Y, Wang C, Xiao L. A connectivity based partition approach for node scheduling in sensor networks. In: Proceedings of DCOSS. LNCS, 2007. 354–367
Godfrey P B, Ratajczak D. Naps: scalable, robust topology management in wireless ad hoc networks. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks. Berkeley: ACM, 2004. 443–451
Wang X, Xing G, Zhang Y, et al. Integrated coverage and connectivity configuration in wireless sensor networks. In: Proceedings of the ACM International Conference on Embedded Networked Sensor Systems(SenSys). Los Angeles: ACM, 2003. 28–39
Tian D, Georganas D. Connectivity maintenance and coverage preservation in wireless sensor networks. Ad Hoc Netw, 2005, 3: 744–761
Kumar S, Lai T H, Balogh J. On k-coverage in a mostly sleeping sensor network. In: Proceedings of the ACM International Conference on Mobile Computing and Networking(MobiCom). New York: ACM, 2004. 144–158
Wu Y W, Li X Y, Liu Y H, et al. Energy-efficient wake-up scheduling for data collection and aggregation. IEEE Trans Parall Distr, 2010, 21: 275–287
Lu J, Bao L C, Suda T. Probabilistic self-scheduling for coverage configuration in wireless ad-hoc sensor networks. Int J Perv Comput Commun, 2008, 4: 26–39
Wang L, Lin Y P, Liu Y H. Key distribution for group-based sensor deployment using a novel interconnection graph. In: IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM). Helsinki: IEEE, 2007. 1–9
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, L., Wei, R. & Tian, Z. Cluster based node scheduling method for wireless sensor networks. Sci. China Inf. Sci. 55, 755–764 (2012). https://doi.org/10.1007/s11432-011-4336-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-011-4336-2