.png){kind=icon}
返回
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}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
node scheduling
lifetime
wireless sensor network
two-hops-cluster
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
分享收藏分享收藏Nonoperative management of blunt renal trauma: Is routine early follow-up imaging necessary?.png)
BMC Urology
OAAI
BMC UrologyIF0
OAAI分享收藏
查看更多内容