.png){kind=icon}
.png){kind=icon}
Return
A clique base node scheduling method for wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2010.03.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers the node scheduling problem for m-covered and connected sensor networks. A new concept of Clique is proposed in this paper. Based on that concept, a new distributed node scheduling algorithm is designed, which can allocate all nodes in the sensor network into k(k <= m) different groups {0.1,...,k-1} without requiring location information. At the same time, it can guarantee that each group will be still connected and maintain the coverage ratio as high as possible. Theoretical analysis and simulation results show that the newly proposed algorithm has better performance than previous randomized scheduling scheme proposed in Liu et al. (2006), and can prolong the lifetime of the sensor network effectively. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Node scheduling
Sensor network
Clique
Distributed
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
3.6K
Citations:
1.1W