By Topic

Distributed node placement algorithms for constructing well-connected 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
$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

3 Author(s)
Arthur J. Friend ; Institute for Computational and Mathematical Engineering, Stanford University, CA 94305, USA ; Vahideh H. Manshadi ; Amin Saberi

We study the problem of node placement in a sensor network. We consider proximity-based communication models where each sensor can only communicate with the ones within a given distance from it and the quality of communication between two sensors decreases with their distance. Each sensor can move locally and our goal is to improve the network connectivity by locally relocating the sensors. We use tools from spectral graph theory to determine the criticality of each edge to the global network connectivity. Based on the criticality measure, we develop algorithms that iteratively move the sensors in directions that improve the communication along more critical edges. Our algorithms are fully decentralized and only use local information exchange which are essential features for the sensor network application due to lack of centralized control and access to information in such networks. We formulate our problem as a convex optimization and use techniques from proximal minorant methods to prove the convergence of our iterative algorithms. Further, to make the algorithms fully local we use ideas such as the alternating direction method of multipliers from the distributed optimization literature. We also quantitatively illustrate the effectiveness of our schemes using simulation on a few sample networks.

Published in:

INFOCOM, 2012 Proceedings IEEE

Date of Conference:

25-30 March 2012