Authors: Lei Wang, Yimin Wang, Yaping Lin
Addresses: College of Software, Hunan University, Changsha, Hunan, 410082, P.R. China; Department of Computer Science, Lakehead University, Thunder Bay, P7B5E1, Canada. ' College of Software, Hunan University, Changsha, Hunan, 410082, P.R. China. ' College of Software, Hunan University, Changsha, Hunan, 410082, P.R. China; Department of Computer Science and Engineering, UT-Arlington, Arlington, TX 76019, USA
Abstract: For m-covered and connected sensor networks, a new distributed node scheduling algorithm is designed, which can allocate all the nodes in the sensor network into k (k ≤ m) different groups without requiring location information. Theoretical analysis and simulation results show that the newly proposed algorithm has better node scheduling performance and can prolong the lifetime of the sensor networks more effectively than the traditional random-based node scheduling scheme.
Keywords: node scheduling; wireless sensor networks; WSNs; cluster; distributed scheduling; wireless networks; simulation; network lifetime.
International Journal of Mobile Network Design and Innovation, 2009 Vol.3 No.1, pp.53 - 61
Available online: 16 Dec 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article