By Topic

A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xi Fang ; Arizona State Univ., Tempe, AZ, USA ; Dejun Yang ; Guoliang Xue

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.

Published in:

Communications (ICC), 2011 IEEE International Conference on

Date of Conference:

5-9 June 2011