Multi-Hop Routing for Multi-Stationed Wireless Sensor Networks

Wireless sensor networks (WSN) consists of tiny autonomous devices called sensors capable of sensing, processing and transmitting information. Energy consumption, routing and maximizing lifetime are the important challenges in the sensor network. In this paper, we propose multiple tree construction (MTC) algorithm to address the problem of finding path from each node to its nearest base stations to maximize the network lifetime. The algorithm deals with having optimal number of base stations. Analytical and simulation results show that MTC performs better than existing algorithms involving single base station.