Multi-constrained anypath routing in wireless mesh networks

Xi Fang; Dejun Yang; Pritam Gundecha; Guoliang Xue

doi:10.1109/SECON.2010.5508266

Multi-constrained anypath routing in wireless mesh networks

Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 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 language	English (US)
Title of host publication	SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
DOIs	https://doi.org/10.1109/SECON.2010.5508266
State	Published - 2010
Event	7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010 - Boston, MA, United States Duration: Jun 21 2010 → Jun 25 2010

Publication series

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

Other

Other	7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010
Country/Territory	United States
City	Boston, MA
Period	6/21/10 → 6/25/10

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/SECON.2010.5508266

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 Article 5508266 (SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks). https://doi.org/10.1109/SECON.2010.5508266

Multi-constrained anypath routing in wireless mesh networks. / Fang, Xi; Yang, Dejun; Gundecha, Pritam et al.
SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. 2010. 5508266 (SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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, SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 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. (SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks). doi: 10.1109/SECON.2010.5508266

@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",

note = "Copyright: Copyright 2010 Elsevier B.V., All rights reserved.; 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010 ; Conference date: 21-06-2010 Through 25-06-2010",

year = "2010",

doi = "10.1109/SECON.2010.5508266",

language = "English (US)",

isbn = "9781424471515",

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

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

AN - SCOPUS:77955119955

SN - 9781424471515

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

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

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

Y2 - 21 June 2010 through 25 June 2010

ER -

Multi-constrained anypath routing in wireless mesh networks

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this