论文部分内容阅读
提出了一种传送能量最小MEP(Minimal Energy-consuming Path)的无线传感网络路由算法,该算法选择能使簇内节点总功耗小的节点作为簇头,避免Leach算法随机选择簇头导致簇内节点总功耗过大的弊端;在构造簇间路由树时,采用了距离幂作为代价权,克服了以最短长度距离作为代价权不能保证转发数据总功耗最小的弱点,实现了在多跳转发数据时总的传送能量最小。仿真结果证明MEP能够有效地延长网络的生命周期。
A routing algorithm based on Minimal Energy-consuming Path (MEP) is proposed. This algorithm chooses nodes that can reduce the total power consumption of cluster nodes as cluster heads and avoids Leach algorithm from randomly selecting cluster heads to cluster In the construction of inter-cluster routing tree, distance power is taken as the cost, which overcomes the weakness that the shortest length distance can not guarantee the minimum total power consumption of forwarding data, When transmitting data, the total transmission energy is the smallest. Simulation results show that MEP can effectively extend the life cycle of the network.