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

Miao Zhao; Yuanyuan Yang

doi:10.1109/INFCOM.2010.5462184

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

Miao Zhao
, Yuanyuan Yang

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

7 Citations (Scopus)

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.

Original language	English
Title of host publication	2010 Proceedings IEEE INFOCOM
DOIs	https://doi.org/10.1109/INFCOM.2010.5462184
Publication status	Published - 15 Jun 2010
Externally published	Yes
Event	IEEE INFOCOM 2010 - San Diego, CA, United States Duration: 14 Mar 2010 → 19 Mar 2010

Conference

Conference	IEEE INFOCOM 2010
Country/Territory	United States
City	San Diego, CA
Period	14/03/10 → 19/03/10

ASJC Scopus subject areas

General Computer Science
Electrical and Electronic Engineering

More information

10.1109/INFCOM.2010.5462184

Cite this

@inproceedings{c3d2026e9ea64835a64890d0ab3629cf,

title = "An optimization based distributed algorithm for mobile data gathering in wireless sensor networks",

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.",

author = "Miao Zhao and Yuanyuan Yang",

year = "2010",

month = jun,

day = "15",

doi = "10.1109/INFCOM.2010.5462184",

language = "English",

isbn = "9781424458363",

booktitle = "2010 Proceedings IEEE INFOCOM",

note = "IEEE INFOCOM 2010 ; Conference date: 14-03-2010 Through 19-03-2010",

}

TY - GEN

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

AU - Zhao, Miao

AU - Yang, Yuanyuan

PY - 2010/6/15

Y1 - 2010/6/15

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/77953319179

U2 - 10.1109/INFCOM.2010.5462184

DO - 10.1109/INFCOM.2010.5462184

M3 - Conference article published in proceeding or book

SN - 9781424458363

BT - 2010 Proceedings IEEE INFOCOM

T2 - IEEE INFOCOM 2010

Y2 - 14 March 2010 through 19 March 2010

ER -

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

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this