By Topic

Efficient load sharing routing algorithm to increase lifetime of Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Asjad Amin ; Department of Telecommunication and Electronic Engineering, The Islamia University of Bahawalpur, Pakistan ; Waqar Mehbob ; Arslan Haider Ranjha ; Hasnain Abbas
more authors

Wireless Sensor Networks (WSN) are low power networks which have many small nodes. The nodes are low power sensors interconnected to each other to receive and transmit data from source to sink. By the transferring of data, the power of these nodes reduces and eventually the system dies. In this paper we introduce an efficient load sharing routing technique to increase the life time of all the nodes in a way to get maximum efficiency from the network. The routing algorithms such as link state which are used for wireless sensor networks prefer to choose a low cost path to decrease the transmission time but they do not consider the power of nodes for transmission which sometimes result in reduction of a lifetime of a network. We modify the previous method by saving the power of each node. A critical power is defined for a network and a node with power less than critical value is operated in power saving mode and is used only if there is no other substitute path available. A node in power saving mode set the cost of all the connected links to a very large value. When link state algorithm is applied on modified network, it is highly unlikely to get a low cost path with inclusion of such node unless a destination has only one path that includes this low power node. A computer simulation is performed to evaluate the performance of proposed algorithm. Our result clearly indicates an increase in lifetime of a network.

Published in:

Electronics, Communications and Photonics Conference (SIECPC), 2011 Saudi International

Date of Conference:

24-26 April 2011