Towards optimal rate allocation for data aggregation in wireless sensor networks

Lu Su, Yan Gao, Yong Yang, Guohong Cao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Scopus citations

Abstract

This paper aims at achieving optimal rate allocation for data aggregation in wireless sensor networks. We first formulate this rate allocation problem as a network utility maximization problem. Due to its non-convexity, we take a couple of variable substitutions on the original problem and transform it into an approximate problem, which is convex. We then apply duality theory to decompose this approximate problem into a rate control subproblem and a scheduling subproblem. Based on this decomposition, a distributed algorithm for joint rate control and scheduling is designed, and proved to approach arbitrarily close to the optimum of the approximate problem. Finally, we show that our approximate solution can achieve near-optimal performance through both theoretical analysis and simulations.

Original languageEnglish (US)
Title of host publicationProceedings of the 12th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'11
DOIs
StatePublished - 2011
Event12th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'11 - Paris, France
Duration: May 17 2011May 19 2011

Publication series

NameProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Other

Other12th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'11
CountryFrance
CityParis
Period5/17/115/19/11

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Towards optimal rate allocation for data aggregation in wireless sensor networks'. Together they form a unique fingerprint.

Cite this