<fmt:message key='jsp.layout.header-default.alt'/>  
 

DSpace@UM >
Faculty of Computer Science and Information Technology >
Conference Proceedings >
International Conference on Informatics >
Informatics 2007 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1812/382

Title: ADAPTIVE ROUTING ALGORITHM FOR LOAD BALANCING IN WIRELESS SENSOR NETWORKS
Authors: R.Sumathi
M.G.Srinivasa
R.Srinivasan
Keywords: Load balancing
Network lifetime
Adaptive routing
Node Specific parameters
Frequency count
Neighbor list
Threshold
Issue Date: 2007
Abstract: Energy conservation is the critical design issue in wireless sensor network(WSN),since sensor nodes are energy constrained. Each sensor nodes relies on its limited battery power for data acquisition, processing, transmission and reception. Sensor nodes uses low power multihop wireless transmission mode to route the data messages from source to base station. Since most of the energy of a sensor node is spent in data transmission, routing of data messages is particularly a major issue. Several routing schemes have been proposed to utilize the available limited energy resource of sensor nodes efficiently with the objective of prolonging the lifetime of sensor networks. Besides maximizing the lifetime of sensor network, it is preferable to distribute the energy dissipation among the nodes to avoid early depletion of the network. In this paper, an attempt is made for distribution of load across nodes uniformly by considering energy and past communication activities at each node. To address this issue, our algorithm constitutes a new path for each iteration by selecting suitable nodes having energy not less than energy required to forward the sensed data messages. Here there is no dependency on specific nodes to forward the data messages, this feature makes algorithm adaptive. Eventually, the proposed scheme provides a good chance to all nodes to actively participate in forwarding data messages and thus helps in achieving our goal to distribute the load. A value, called threshold, which varies with size of the sensed data message, despite preventing the early death of heavily involved nodes due to battery drain off, force the nodes to enter into reduced activity, thus enhancing the network lifetime.
Description: Proceeding of the 2nd International Conference on Informatics (Informatics 2007), 27th-28th November 2007, Hilton Petaling Jaya Hotel, Petaling Jaya, Selangor, Malaysia. Page T4-1 - T4-7
URI: http://dspace.fsktm.um.edu.my/handle/1812/382
ISBN: 978-983-43491-1-0
Appears in Collections:Informatics 2007

Files in This Item:

File Description SizeFormat
CSN.pdf2.45 MBAdobe PDFView/Open


This item is protected by original copyright



Your Tags:

 

  © Copyright 2008 DSpace Faculty of Computer Science and Information Technology, University of Malaya . All Rights Reserved.
DSpace@UM is powered by MIT - Hawlett-Packard. More information and software credits. Feedback