基于移动Sink节点剩余能量树路由算法

Mobile sink node routing algorithm based on residual energy scan tree

在深入研究了异步可延伸能效(SEAD)算法和MintRoute算法的基础上,提出了剩余能量树路由算法,该算法将网络中的节点分成能量相近的区域,再利用SEAD算法的思想,在每个能量相近的区域中构建以采样节点为根,传递节点作为枝叶的树状网络结构模型,将树最末端的节点作为代理节点,Sink节点移动时,只需要保持同代理节点的通信,便可以保证Sink节点同整个网络连通。运用该路由算法可以很好地解决无线传感器网络中的因某个节点过早死亡而导致网络路由"瓶颈"问题和节点间的信息泛洪问题。采用剩余能量树路由算法,可以使网络能量得到更均衡合理充分的利用,仿真实验结果表明,该算法可以很好地延长网络寿命。

Based on the in-depth study of the SEAD （scalable energy-efficient asynchronous dissemination） and MintRoute algorithms, a new routing algorithm which divides the nodes in the network into areas with similar energy through the residual energy scanning algo- rithm is proposed first, and then a tree network model in each area with similar energy is created with the sampling points as the root and the transferring points as the leaves. The leaf nodes are regarded as the agent nodes and can guarantee the connection of the network and the mobile Sink node by maintaining the communication among the agent nodes. The routing algorithm solves the ＂bottleneck＂ in the wireless sensor network and the flooding of information among the nodes well and can prolong the lifetime of the network.