By Topic

Dynamic Relay Node Placement in 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
$31 $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

2 Author(s)
Mena, J. ; Dept. of Comput. Sci. & Eng., California Univ., Riverside, CA ; Kalogeraki, V.

In this paper we present an online algorithm that attacks the problem of placing relay nodes in regions where high localized congestion is detected. Congestion refers to the network overload caused by excess concurrent attempts of wireless devices to access the common shared channel. Our algorithm uses the expected transmission delay (ETD) metric based on both current measurements and history observations over a window of time and is used by the nodes to identify the level of congestion in the local environment of the node. Our scheme uses a dissemination probing mechanism to exchange statistical local information periodically which are used to detect the congested area. Detailed simulation results illustrate the working and benefits of our approach.

Published in:

Applications and the Internet, 2008. SAINT 2008. International Symposium on

Date of Conference:

July 28 2008-Aug. 1 2008