.png){kind=icon}
.png){kind=icon}
Return
Cluster based node scheduling method for wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-011-4336-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 a (c) 1/2m) 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.
Keywords:
node scheduling
lifetime
wireless sensor network
two-hops-cluster
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
4.9K
Citations:
8.9K