| 无线传感器网络中连通问题的研究 |
| |
| 引用本文： | 汪学清,杨永田.无线传感器网络中连通问题的研究[J].计算机工程,2006,32(9):36-37,40. |
| |
| 作者姓名： | 汪学清 杨永田 |
| |
| 作者单位： | 哈尔滨工程大学计算机科学与技术学院,哈尔滨,150001 |
| |
| 基金项目： | 国家"242"信息安全计划 |
| |
| 摘 要： | 通过把复杂的连通问题逐步化简，并利用理论分析、数学建模和几何证明。采用几何理论和数学归纳法的思想，从拓扑学的角度给出了传感器区域的一种网格划分方法。最后从理论上给出了在一个实现完全无缝连通的传感器区域内最少衙要多少簇首的解析表达式，即从理论上解决了把整个传感器区域至少划分成多少个簇才能实现完全无缝连通的问题。
|
| 关 键 词： | 无线传感器网络 连通问题 簇首 网格 解析 |
| 文章编号： | 1000-3428（2006）09-0036-02 |
| 收稿时间： | 2005-05-05 |
| 修稿时间： | 2005-05-05 |
Research on Connectivity Problem of Wireless Sensor Networks |
| |
| WANG Xueqing,YANG Yongtian.Research on Connectivity Problem of Wireless Sensor Networks[J].Computer Engineering,2006,32(9):36-37,40. |
| |
| Authors: | WANG Xueqing YANG Yongtian |
| |
| Affiliation: | College of Computer Science and Technology, Harbin Engineering University, Harbin 150001 |
| |
| Abstract: | The paper simplifies complex connectivity problem step by step. By means of theoretical analysis, math modeling and geometry proving and making use of geometric theories and the method of mathematics induction, the method of grid plot of sensor field is proposed from the viewpoint of topology. In the end, the analysis formula of minimum number of cluster heads is theoretically educed under circumstances of entire and seamless connectivity in wireless sensor networks. That is, the problem of entire and seamless connectivity is solved that how many clusters total sensor field is plotted at the fewest. |
| |
| Keywords: | Wireless sensor networks(WSN) Connectivity problem Cluster head Grid Analysis formula |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
