By Topic

An Optimization Based Distributed Algorithm for Mobile Data Gathering 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
$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)
Miao Zhao ; Dept. of Electr. & Comput. Eng., Stony Brook Univ., Stony Brook, NY, USA ; Yuanyuan Yang

Recent advances have shown a great potential of anchor based mobile data gathering in wireless sensor networks. In such a scheme, during each periodic data gathering tour, the mobile collector stays at each anchor point for a period of sojourn time and collects data from nearby sensors via multi-hop communications. We provide an optimization based distributed algorithm for such data gathering in this paper. We adopt network utility, which is a properly defined function, to characterize the data gathering performance, and formalize the problem as a network utility maximization problem under the constraint of guaranteed network lifetime. To efficiently solve the problem, we decompose it into two sets of subproblems and solve them in a distributed manner, which facilitates the scalable implementations. Finally, we provide numerical results to demonstrate the convergence of the proposed distributed algorithm.

Published in:

INFOCOM, 2010 Proceedings IEEE

Date of Conference:

14-19 March 2010