| 无线传感器网络中簇树骨干网的维护和更新算法 |
| |
| 引用本文： | 阎新芳. 无线传感器网络中簇树骨干网的维护和更新算法[J]. 河南科学, 2006, 24(5): 719-722 |
| |
| 作者姓名： | 阎新芳 |
| |
| 作者单位： | 郑州大学,信息工程学院,郑州,450052 |
| |
| 基金项目： | 高等学校博士学科点专项科研项目 |
| |
| 摘 要： | 无线Adhoc传感器网络中的路由设计将能效高放在首位,设计用于路由基础的高效能簇树骨干网是延长网络寿命很有效的方法.文中利用图论中极大权独立集和根树的概念给出一种求簇树骨干网的EACT算法及对该骨干网的维护和更新算法.并通过仿真结果表明算法的有效性.
|
| 关 键 词： | 无线传感器网络 独立集 簇树 EACT算法 |
| 文章编号： | 1004-3918(2006)05-0719-04 |
| 收稿时间： | 2006-03-20 |
| 修稿时间： | 2006-03-20 |
Maintenance and Update of Cluster Tree Algorithm in Wireless Sensor Networks |
| |
| YAN Xin-fang. Maintenance and Update of Cluster Tree Algorithm in Wireless Sensor Networks[J]. Henan Science, 2006, 24(5): 719-722 |
| |
| Authors: | YAN Xin-fang |
| |
| Affiliation: | College of Information Engineering, Zhengzhou University, Zhengzhou 450052, China |
| |
| Abstract: | Energy-efficient routing design is important requirement in wireless Ad hoc sensor systems.Designing a high-efficient cluster tree backbone network for the basic of routing is a effective way for prolonging network lifetime.Based on root tree and Maximal Weighted Independent Set,we propose the EACT(Energy-Aware Clustering Tree) algorithm and the maintenance and update algorithm of the cluster tree backbone network.The simulation results demonstrate that our approach would be availability. |
| |
| Keywords: | wireless sensor networks cluster tree independent set EACT algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
