Consort: Node-Constrained Opportunistic Routing in wireless mesh networks

Xi Fang, Dejun Yang, Guoliang Xue

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

18 Scopus citations

Abstract

Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper, we study the problems of how to choose opportunistic route for each user to optimize the total utility or profit of multiple simultaneous users in a wireless mesh network (WMN) subject to node constraints. We formulate these two problems as two convex programming systems. By combining primal-dual and subgradient methods, we present a distributed iterative algorithm Consort (node-Constrained Opportunistic Routing). In each iteration, Consort updates Lagrange multipliers in a distributed manner according to the user and node behaviors obtained in the previous iteration, and then each user and each node individually adjusts its own behavior based on the updated Lagrange multipliers. We prove the convergence of this iterative algorithm, and provide bounds on the amount of feasibility violation and the gap between our solution and the optimal solution in each iteration.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages1907-1915
Number of pages9
DOIs
Publication statusPublished - 2011
EventIEEE INFOCOM 2011 - Shanghai, China
Duration: Apr 10 2011Apr 15 2011

Other

OtherIEEE INFOCOM 2011
CountryChina
CityShanghai
Period4/10/114/15/11

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Fang, X., Yang, D., & Xue, G. (2011). Consort: Node-Constrained Opportunistic Routing in wireless mesh networks. In Proceedings - IEEE INFOCOM (pp. 1907-1915). [5934993] https://doi.org/10.1109/INFCOM.2011.5934993