【摘要】 能源问题对于移动自组网是非常重要的,因为移动节点只能依靠它们有限的电池供应。原先的路由算法中,选路时不考虑节点的剩余能量,选定了一条路由后就一直用下去,直到数据传完或拓扑变更引起重选路由。这样很容易会耗完这条路由上节点的能量,特别是某些有多条路由通过的关键节点。针对移动adhoc网络中节点的有限能量供给问题,提出了一种基于搜索具有较大可持续能量路由的节能策略,并对已存的EA-AODV协议进行改进保护低能量路由的算法就是通过保护能量偏低的节点,延长网络的可操控时间。该策略考虑路由上的节点可用能量的下限低到某一域值就拒绝服务,某一中间值时则设定延迟以避免被选择,然后选择所通过节点的能量都比较充足的路由,从而延长了整个网络可用路由的持续时间。仿真结果验证了该思路,并有较好的性能提升。因此通过实践证明,文中提到的算法与改进都是行之有效的。更多还原

【Abstract】 Energy problem is very important for routing protocol in mobile ad hoc networks since these mobile nodes must rely on their limited battery supply. The algorithmic routine before didn’t consider power remained in the nodes, and used a route when selected it at the beginning, until route was selected again because the data transferring was completed or the net topology was changed. But power of these nodes in this route might be used out, especially those key nodes which are included in many routes. So the route algorithm which protects lower power route is to protect those lower power nodes, and to lengthen the time of net existing. This paper presents an energy saving measure ,which considers minimum of the remaining battery level in nodes on a route and chooses the route having maximal power in order to increase the operational lifetime of the whole network. The emulator validates the imagination, and indicates better capability.更多还原