By Topic

Node Placement in Wireless Sensor Network to Achieve Biconnectivity

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

2 Author(s)
Yinghua Zhou ; Coll. of Comput. Sci. & Technol., Chongqing Univ. of Posts & Telecommun., Chongqing ; Xuemei Cai

The reliability goal of wireless sensor network requires the network to be biconnected, so that the failure of one single node will not disturb the connectivity of the whole network. Wireless sensor network with uniform communication power and transmission radius is modeled as planar undirected graph. A search algorithm running in O(n3) polynomial time is proposed to find all the biconnected components in the wireless sensor network. Then all the articulation points in the network are found out. A greedy algorithm with worst case O(n2log(n/3)) polynomial time bound is proposed to place nodes as few as possible to achieve network biconnectivity. The new paths formed by the supplemented nodes help to decrease the number of relay hops between some sensor nodes and the sink node.

Published in:

Networks Security, Wireless Communications and Trusted Computing, 2009. NSWCTC '09. International Conference on  (Volume:2 )

Date of Conference:

25-26 April 2009