Bottleneck throughput maximization for correlated data routing: A game theoretic approach

Engin Zeydan, Didem Kivanc Tureli, Cristina Comaniciu, Uf Tureli

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

In this paper, we propose an efficient bottleneck throughput maximizing routing framework for correlated data gathering in wireless sensor networks. Our proposed routing metric exploits the the data correlation present in sensor networks. For throughput-maximizing correlation aware routing, a game theoretic framework is developed for a local solution of the NP-complete optimization problem. The proposed throughput maximization algorithm selects the best routes to increase the bottleneck throughput of each source in the network using best response dynamics. Numerical results corroborates predicted throughput gains.

Original languageEnglish
Title of host publication2010 44th Annual Conference on Information Sciences and Systems, CISS 2010
DOIs
StatePublished - 2010
Event44th Annual Conference on Information Sciences and Systems, CISS 2010 - Princeton, NJ, United States
Duration: 17 Mar 201019 Mar 2010

Publication series

Name2010 44th Annual Conference on Information Sciences and Systems, CISS 2010

Conference

Conference44th Annual Conference on Information Sciences and Systems, CISS 2010
Country/TerritoryUnited States
CityPrinceton, NJ
Period17/03/1019/03/10

Keywords

  • Correlated data aggregation
  • Game theory
  • Throughput maximization
  • Wireless sensor networks

Fingerprint

Dive into the research topics of 'Bottleneck throughput maximization for correlated data routing: A game theoretic approach'. Together they form a unique fingerprint.

Cite this