A LEACH-Based Routing Algorithm For Wireless Sensor Network

Wireless sensor network consisting of a large number of small sensors withlow-power transceiver can be an effective tool for gathering data in a variety ofenvironment. The collected data must be transmitted to the base station for furtherprocessing. A large number of sensors, whose energy are offered by battery, aredeployed to sense the environments. Since a network consists of sensors with limitedbattery energy,themethod for data gathering and routing must be energy efficient inorder to prolong the lifetime of the network. LEACH is an elegant energy efficientprotocol to maximize the lifetime of sensor network. Starting from the basic idea ofLEACH, this paper introduced a low energy cluster-based routing algorithm, which canbe used in wireless sensor network. This algorithm requires location information of allnodes of the network. It clusters nodes into group. The areas of clustering aredetermined and fixed by the base station. The algorithm rotates cluster heads based onthe energy of nodes, and builds routing tree among cluster heads, among which only theroot node communicates the base station directly. Finally, this paper simulated the newalgorithm using NS2. Simulation results show that the algorism performs better thanLEACH.