机构地区: 桂林电子科技大学信息与通信学院
出 处: 《计算机应用研究》 2012年第8期3096-3097,3102,共3页
摘 要: 针对如何根据变动的网关节点在网络内部选择合适的数据汇聚节点以传输采集的数据这一问题,综合考虑节点剩余能量和距离因素,提出了一种基于平均剩余能量的数据汇聚节点选择算法,以均衡节点能耗、延长网络生命周期。与基于最大剩余能量的数据汇聚节点选择算法比较,证明该算法能够在保持相近生命周期的情况下大大减少计算量,更适用于资源有限的传感器网络。 To deal with the problem of electing data aggregation nodes in a sensor network to transfer the collected data when the gateway node changes, this paper considered the residual energy of nodes and distances, and proposed an average residual energy-based data aggregation node election algorithm, in order to balance energy consumption and extend network lifetime. Through the comparison with the maximum residual energy-based election algorithm, the results show that the proposed algorithm can greatly reduce the computational cost while maintaining comparable network lifetime, make it more suitable for resource-limited sensor networks.