Cart (Loading....) | Create Account
Close category search window
 

Bio-Inspired Relay Node Placement Heuristics for Repairing Damaged 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

3 Author(s)
Senel, F. ; Dept. of Comput. Sci. & Electr. Eng., Univ. of Maryland, Baltimore County, Baltimore, MD, USA ; Younis, M. ; Akkaya, K.

Due to the harsh surroundings and violent nature of wireless sensor network (WSN) applications, the network sometimes suffers a large-scale damage that involves several nodes and would thus create multiple disjoint partitions. This paper investigates a strategy for recovering from such damage through the placement of relay nodes (RNs) and promotes a novel approach. The proposed approach opts to reestablish connectivity (i.e., 1-vertex connectivity) using the least number of relays while ensuring a certain quality in the formed topology. Unlike contemporary schemes that often form a minimum spanning tree among the isolated segments, the proposed approach establishes a topology that resembles a spider web, for which the segments are situated at the perimeter. Such a topology not only exhibits stronger connectivity than a minimum spanning tree but achieves better sensor coverage and enables balanced distribution of traffic load among the employed relays as well. To further increase the robustness of the formed topology, the SpiderWeb approach is further extended so that the final topology is guaranteed to be 2-vertex connected. Both centralized and distributed implementations of the SpiderWeb approach are discussed. The simulation results demonstrate the effectiveness of the proposed recovery algorithm.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:60 ,  Issue: 4 )

Date of Publication:

May 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.