MAP: Multiconstrained anypath routing in wireless mesh networks

Xi Fang, Dejun Yang, Guoliang Xue

Research output: Contribution to journalArticle

18 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. Previous studies on anypath routing have concentrated on finding an anypath, which optimizes a single quality of service (QoS) parameter. In this paper, we study anypath routing subject to multiple constraints. We first prove that the problem is NP-hard when the number of constraints is larger than one. We then present a polynomial time K - approximation algorithm MAP, where K is the number of constraints. Our algorithm is as simple as Dijkstra's shortest path algorithm. Therefore, it is suitable for implementation in wireless routing protocols.

Original languageEnglish (US)
Article number6244801
Pages (from-to)1893-1906
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume12
Issue number10
DOIs
StatePublished - Sep 3 2013

    Fingerprint

Keywords

  • Wireless mesh networks
  • anypath routing
  • multiple constraints
  • provably good approximation algorithms

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this