Bi-level Tree Sector Clustering for Energy Efficient Routing in Wireless Sensor Networks

Wireless Sensor Networks, which are composed of a collection of sensor nodes, have found enormous applications nowadays. These networks have the responsibility to sense, aggregate, fuse and transmit data to the Base Station (BS). In view of the fact that the existed limitations, such as tiny batteries in these sensor nodes, could critically affect their operation, having a low-power operation is one of the most obligated obligations. In order to decrease energy consumption and increase the network life time, we proposed a new hierarchical routing protocol, by dividing the network area to sectors and two levels and choosing Cluster Heads (CHs) from the lower level which is more near to the BS. In order to minimize the reverse flow of the data from BS, we use a tree structure in each sector. Also, the frontier between two levels can be moved during network life time and having dead nodes. The results of simulations show that our proposed TSBC protocol outperforms LEACH and many other conventional routing protocols in energy conservation and in network life time. One of the most important properties of our scheme that can distinguish it from any other scheme is reverse flow from BS cancellation or at least deduction. The special formula which is used in our protocol for CH selection, in order to prevent battery depletion in a special spot, can also be adapted to any other hierarchical clustering protocol to achieve higher energy-efficiency. Keywords_ Wireless Sensor Network; WSN;Hierarchical Routing; Cluster; head node; Sector; Minimum Spanning Tree; MST.