A Study Of Backbone Tree Routing Protocol For Wireless Sensor Network

In many large Wireless Sensor Networks(WSNs), nodes are deployed densely, which lead to increase of packet collision, and reduction of the communications efficiency between nodes, and network throughput and connectivity, waste of the node's limited energy, therefore to design an efficient routing protocol in WSNs is of great significance in part of utilizing node energy and improving the network life. A part of nodes in WSNs is selected as backbone nodes which is connected and composes a backbone network which covered the monitoring area, and backbone nodes is tree topology structure logically, data is transmitted along the tree backbone to the destination.In this theses, the current routing of WSNs are analyzed, aiming at the disadvantage that the nodes unbalanced consumption each other, high energy dissipation and short network lifetime in the protocol, based on the EAD routing protocol, designing a new routing protocol named as DB-EAD (Distance Based on EAD), in which we improve the backbone node selection algorithm according to the distance between the neighbors node each other as well as the node remaining energy. DB-EAD routing solves the problem of the depth of backbone tree in EAD and make the backbone node distributed reasonably, the nodes load more balanceable. We present MSDB-EAD routing protocol for multi-sink WSNs based on DB-EAD.The result of the experiment demonstrates that DB-EAD routing protocol makes the node energy consumption balanced, increases the energy efficiency and minims the data delay time. Theory analysis and simulation data show that MSDB can overcome the bottleneck node of the sink neighbors and prolong the network lifetime efficiently as the number of the sink increased.