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 Citations (Scopus)

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 - 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

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

Fingerprint

Wireless mesh networks (WMN)
Approximation algorithms
Polynomials
Routing protocols
Computational complexity
Wireless networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Fang, X., Yang, D., Gundecha, P., & Xue, G. (2010). Multi-constrained anypath routing in wireless mesh networks. In SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks [5508266] https://doi.org/10.1109/SECON.2010.5508266

Multi-constrained anypath routing in wireless mesh networks. / Fang, Xi; Yang, Dejun; Gundecha, Pritam; Xue, Guoliang.

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

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

Fang, X, Yang, D, Gundecha, P & Xue, G 2010, Multi-constrained anypath routing in wireless mesh networks. in SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks., 5508266, 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010, Boston, MA, United States, 6/21/10. https://doi.org/10.1109/SECON.2010.5508266
Fang X, Yang D, Gundecha P, Xue G. Multi-constrained anypath routing in wireless mesh networks. In SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. 2010. 5508266 https://doi.org/10.1109/SECON.2010.5508266
Fang, Xi ; Yang, Dejun ; Gundecha, Pritam ; Xue, Guoliang. / Multi-constrained anypath routing in wireless mesh networks. SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. 2010.
@inproceedings{350ca23f1c5547c1abf15f22570fe063,
title = "Multi-constrained anypath routing in wireless mesh networks",
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.",
author = "Xi Fang and Dejun Yang and Pritam Gundecha and Guoliang Xue",
year = "2010",
doi = "10.1109/SECON.2010.5508266",
language = "English (US)",
isbn = "9781424471515",
booktitle = "SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks",

}

TY - GEN

T1 - Multi-constrained anypath routing in wireless mesh networks

AU - Fang, Xi

AU - Yang, Dejun

AU - Gundecha, Pritam

AU - Xue, Guoliang

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77955119955&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955119955&partnerID=8YFLogxK

U2 - 10.1109/SECON.2010.5508266

DO - 10.1109/SECON.2010.5508266

M3 - Conference contribution

SN - 9781424471515

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

ER -