| 摘要: |
| 首先,建立了极大相似分布模型;其次,引入节点的虚拟坐标的概念,用来替代节点实际的位置坐标.在此基础上,提出了一种分布式的、与节点位置无关的节点调度方案.方案由一个覆盖算法和一个连通算法组成,方案中的覆盖算法利用虚拟坐标信息进行分组.在不需要节点位置信息的条件下,使各个分组内的传感器节点较为均匀地分布在目标区域.该方案不仅解决了任意分组中的节点充分覆盖目标区域的问题,而且保证了网络的连通.仿真实验表明,该节点调度方案在覆盖率、维持分组连通时额外加入到分组内的节点个数以及网络生存时间等性能上均优于与节点位置无关的节点随机调度协议. |
| 关键词: 传感器网络 调度 极大相似分布 覆盖 连通 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z227 (国家高技术研究发展计划(863)); the Natural Science Key Foundation of Hu'nan Province of China under Grant No.06JJ20049 (湖南省重点自然科学基金) |
|
| A Node Scheduling Scheme Based on Virtual Coordinate in Sensor Networks |
|
LI Xiao-Long,LIN Ya-Ping,YI Ye-Qing,YU Jian-Ping,LU Xin-Guo
|
| Abstract: |
| Firstly a maximum similarity distribution model is proposed. Secondly, a new definition, named virtual coordinate of a node which composes of the minimum hop counts to several special nodes, is introduced in instead of absolute physical coordinate of a node. Based on the theories, a distributed location-independent node scheduling scheme is proposed. The scheme consists of a coverage algorithm and a connection algorithm. The coverage algorithm takes advantage of the nodes' virtual coordinate to divide all nodes into several subsets. Without using location information, this scheduling scheme not only has the ability that sensor nodes in subsets are more uniformly distributed in the target region than other schemes, but also guarantees that all subsets are connective. The simulation results show that the scheme outperforms the randomized node scheduling scheme, on the coverage rate and network lifetime, as well as the number of external nodes when maintaining subsets to be connective. |
| Key words: sensor network scheduling maximum similarity distribution coverage connectivity |
