摘要
通过把复杂的连通问题逐步化简,并利用理论分析、数学建模和几何证明,采用几何理论和数学归纳法的思想,从拓扑学的角度给出了传感器区域的一种网格划分方法。最后从理论上给出了在一个实现完全无缝连通的传感器区域内最少需要多少簇首的解析表达式,即从理论上解决了把整个传感器区域至少划分成多少个簇才能实现完全无缝连通的问题。
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.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2006年第9期36-37,40,共3页
Computer Engineering
基金
国家"242"信息安全计划基金资助项目"大规模网络安全预警分析技术"(2005A33)
关键词
无线传感器网络
连通问题
簇首
网格
解析
Wireless sensor networks （WSN）
Connectivity problem
Cluster head
Grid
Analysis formula
