An Energy-efficient Routing Protocol for Homogeneous Wireless Sensor Networks

Authors:

Er. Devendra Prasad (Maharishi Markandeshwar College of Engineering, Mullana)

Er. Gaurav Bathla (Haryana Engineering College, Jagadhri)

Keywords: WSN, energy efficient, data aggregation, routing algorithm, Base station, minimum spanning tree.

Abstract:

A Wireless Sensor Network (WSN) is composed of sensor nodes spread over the field to sense the data. The sensed data must be gathered & transmitted to Base Station (BS) for end user queries. The used sensor nodes being in- expensive having low computation power & limited energy so are not as much reliable as their expensive macro sensor counter parts but their size and cost enable hundred to thousand of micro sensors to achieve high quality fault tolerant system. In an environment where in each round all sensor nodes have to send data to base station, it is required to effectively utilize energy of sensor nodes so as to increase the life- time of the system. The ' use of data aggregation & fusion as proposed in LEACH increases system lifetime by a factor of 8 as compared to conventional routing protocols. In this paper along with data aggregation & fusion, we are trying to minimize reduction in system energy by first generating MST between all sensor nodes so as to minimize their transmission energy with in network and after that a node of highest energy among the top tier will transmit the aggregated data of whole network to base station. Keeping network topology same till any node of network dies another highest energy node from top most rank tier is chosen to communicate with BS. This technique achieves much improvement in system life time as compared to LEACH and PEGASIS.