Mobile sink node routing algorithm based on residual energy scan tree
Yong Zheng Zhou · Jisuanji gongcheng yu sheji · 2011
Based on in-depth study of SEAD(scalable energy-efficient asynchronous dissemination) and MintRoute algorithms,a new routing algorithm which divides nodes in network into areas with similar energy through residual energy scanning algo-rithm is proposed first,and then a tree network model in each area with similar energy is created with sampling points as root and transferring points as leaves.The leaf nodes are regarded as agent nodes and can guarantee connection of network and mobile Sink node by maintaining communication among agent nodes.The routing algorithm solves the bottleneckin wireless sensor network and flooding of information among nodes well and can prolong lifetime of network.