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

Deploying Mobile Nodes to Connect Wireless Sensor Networks Using Novel Algorithms

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)
Chang WuYu ; ChungHua Univ., Hsinchu ; Chen, E. ; Chun Cheng Fang

Wireless sensor networks receive lots of attention due to its promising techniques and wide-ranging applications in recent years. The kind of network occasionally becomes disconnected due to initial uneven deployments or unpredictable failures or run out of battery of sensor nodes. However, sensor nodes with mobility then can be used in an addition deployment to reconnect the disconnected sensor networks. Theoretically, the augmenting geometric graph problem is defined here to model this kind of connectivity issues. The work proposes two novel algorithms: the graph-oriented algorithm and the divide-and-conquer algorithm to connect disconnected networks by using as less as possible mobile nodes. The first algorithm highly exploits traditional graph and geometry techniques including Fermat point, convex hull, nearest neighbor, minimum cost spanning tree, and graph contraction. Adopting a quite different approach, the second algorithm resolves the problem by dividing the deployed area and merging sub-solutions recursively. With respect to complexity issue, the graph-oriented algorithm takes 0(n3) time; on the other hand, the divide-and-conquer algorithm requires 0(n log n) time, where n is the size of vertex set of the given graph G=(V, E). These proposed two algorithms have low time complexity and can be implemented in a centralized sensor network.

Published in:

Wireless Algorithms, Systems and Applications, 2007. WASA 2007. International Conference on

Date of Conference:

1-3 Aug. 2007

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.