Multi-constrained anypath routing in wireless mesh networks

Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue

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

7 Scopus citations

Abstract

Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In this paper, we focus on anypath routing subject to K constraints, and present a polynomial time K-approximation algorithm. When K = 1, our algorithm is the optimal polynomial time algorithm for the corresponding problem. When K ≥ 2, the corresponding problem is NP-hard. We are the first to present an O(1)-approximation algorithm. Furthermore, our algorithm is as simple as Dijkstra's shortest path algorithm, and is therefore suitable for implementation in actual wireless routing protocols.

Original languageEnglish (US)
Title of host publicationSECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
DOIs
StatePublished - Aug 5 2010
Event7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010 - Boston, MA, United States
Duration: Jun 21 2010Jun 25 2010

Publication series

NameSECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

Other

Other7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010
CountryUnited States
CityBoston, MA
Period6/21/106/25/10

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Multi-constrained anypath routing in wireless mesh networks'. Together they form a unique fingerprint.

Cite this