论文部分内容阅读
针对实时性较强的传感器网络,提出一种跳数受限的高能效分簇路由(HCECR)算法。HCECR算法采用存活时间(TTL)分簇的概念,并根据簇内成员数量和累计最小可达能耗构建兼顾跳数限制和能量效率的簇结构。同时,新算法区分紧急和普通数据包,分别采取不同的转发机制,并在簇外多跳通信中引入边缘节点中继数据以降低簇外通信开销。仿真表明:新算法在保证数据包实时性的同时,提升了簇头与普通节点之间的负载均衡度,延长了网络生存周期。
For the real-time sensor networks, a high energy efficient clustering routing (HCECR) algorithm with limited hop count is proposed. The HCECR algorithm uses the concept of time-to-live (TTL) clustering and builds a cluster structure that takes into account both hop limit and energy efficiency based on the number of members in the cluster and the cumulative minimum achievable energy. At the same time, the new algorithm distinguishes emergency and ordinary data packets, and adopts different forwarding mechanisms respectively. The edge node relay data is introduced into the multi-hop communication outside the cluster to reduce the overhead of communication outside the cluster. The simulation shows that the new algorithm not only improves the real-time performance of data packets, but also improves the load balancing between cluster heads and ordinary nodes and prolongs the network lifetime.