A distributed algorithm for multi-constrained anypath routing in wireless mesh networks

Xi Fang, Dejun Yang, Guoliang Xue

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

1 Scopus citations

Abstract

Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In this paper, we study the problem of finding an anypath subject to multiple (K) constraints, which has been proved to be NP-hard. We present a polynomial distributed K-approximation routing algorithm. Our algorithm is as simple as Bellman-Ford's shortest path algorithm. Extensive experiments show that our algorithm is very efficient and its result is as good as that obtained by the best centralized algorithm which requires the global information.

Original languageEnglish (US)
Title of host publication2011 IEEE International Conference on Communications, ICC 2011
DOIs
StatePublished - Sep 2 2011
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: Jun 5 2011Jun 9 2011

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period6/5/116/9/11

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Fang, X., Yang, D., & Xue, G. (2011). A distributed algorithm for multi-constrained anypath routing in wireless mesh networks. In 2011 IEEE International Conference on Communications, ICC 2011 [5962584] (IEEE International Conference on Communications). https://doi.org/10.1109/icc.2011.5962584