欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在分析了HEED分簇协议的基础上提出HEED—CHEE分簇算法，对”孤儿节点”和”孤立簇头节点”引入“最优邻居中继入簇”策略，减少分簇产生的簇头数目和簇间节点通信开销；簇间通过多跳方式将融合数据传送回汇聚节点，在构建簇间多跳路由中，选择在簇间通信范围内下一层次中剩余能量最高的簇头作为中继簇头，避免了能量较低的簇头过多的参与数据转发．通过实验仿真表明，HEED-CHEE分簇算法节省了簇头能耗，有效地延长了网络的生存时间．
英文摘要：
This paper presents the HEED-CHEE clustering algorithm based on analysis of the HEED protocol. The ＂Joining cluster by optimal neighbor relay＂ strategy is introduced in HEED-CHEE to deal with ＂orphan node＂ and ＂isolated cluster head＂ . The generated cluster head number and the communication overhead between cluster heads is reduced by this strategy. The data is transmitted to sink node by intra-cluster multihop routing. The next hop cluster head is choosed by taking into account its level and residual energy, thus the low energy cluster head is avoided to take more data relay tasks. The simulation results show that the HEED-CHEE protocol effectively saves the energy consumption of cluster head and prolongs the network lifetime.
同期刊论文项目
同项目期刊论文
Approximation Two Independent Sets Based Connected Dominating Set Construction Algorithm for Wireles
A Cluster-based and Tree-based Power Efficient Data Collection and Aggregation Protocol for Wireless
位置：