分区域的树型多链的无线传感器网络路由算法

Sub⁃regional tree⁃type multi⁃chains routing algorithm for WSNs

针对PEGASIS算法形成的链路太长、维护成本太高,COSEN算法形成的链路存在交叉链、数据逆传递等缺陷,文中提出分区域的树型多链的无线传感器网络路由算法。该算法首先根据数据的相关性将全网区域分成若干个长条状的区域,在每个区域中节点根据它们之间的距离和角度连接成一条链,若有交叉链,删除交叉链中较长的那条链。成链过程中会产生孤立节点,若是分区域内的孤立节点,则根据它们之间的距离和角度及支链中的节点数连接到链中;若是区域外的节点,寻找已经成链的最近节点连接到链中,形成分区域的树型多链结构。最后各分链的链头以单跳和多跳相结合的方式与sink节点通信。仿真结果表明,文中算法可有效避免长链的形成,能够节省全网节点能耗,减小数据传输时延,延长无线传感器网络的生命周期。

As the link formed by PEGASIS(power⁃efficient gathering in sensor information systems)algorithm is too long and its maintenance cost is too high,and the link formed by COSEN(chain oriented sensor network)algorithm has defects such as cross link and data inverse transmission,a sub⁃regional tree⁃type multi⁃chains routing algorithm for WSNs(wireless sensor networks)is proposed.In the algorithm,the whole network area is divided into several strip⁃shaped areas according to the correlation of data.In each area,the nodes are connected into a chain according to the distance and angle between them.If there is a cross chain,the longer chain in the cross chain is deleted.The isolated nodes can be generated in the chain forming process,the isolated nodes in the sub⁃region can be connected to the chain according to the distance and angle between them and the number of nodes in the branch chain,and the isolated nodes outside the sub⁃region can be connected to the chain by finding the nearest node that has become a chain,so that the sub⁃regional tree⁃type multi⁃chains structure is formed.The chain head of each sub⁃chain can communicate with sink nodes in a combination way of single⁃hop and multi⁃hop.The simulation results show that the algorithm can effectively avoid the formation of long chains,save energy consumption of nodes in the entire network,reduce data transmission delay,and prolong the life cycle of WSNs.