An optimization based distributed algorithm for mobile data gathering in wireless sensor networks

Authors:
Miao Zhao;Yuanyuan Yang
Affiliations:
Department of Electrical and Computer Engineering, New York State Center of Excellence in Wireless and Information Technology, Stony Brook University, Stony Brook, NY;Department of Electrical and Computer Engineering, New York State Center of Excellence in Wireless and Information Technology, Stony Brook University, Stony Brook, NY
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 7
Cited 0

Parallel and Distributed Computation: Numerical Methods

Parallel and Distributed Computation: Numerical Methods
Convex Optimization

Convex Optimization
A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Rate allocation and network lifetime problems for wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for maximum lifetime routing in wireless sensor networks

IEEE Transactions on Wireless Communications
A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink

IEEE Transactions on Wireless Communications
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.