LoboVault Home
 

A Dynamic Programming Approach for Routing in Wireless Mesh Networks

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/6895

A Dynamic Programming Approach for Routing in Wireless Mesh Networks

Show full item record

Title: A Dynamic Programming Approach for Routing in Wireless Mesh Networks
Author: Crichigno, Jorge; Khoury, Joud; Wu, Min-You; Shu, Wei
Subject(s): wireless mesh network
routing
capacity
end-to-end delay
Abstract: The routing problem in Wireless Mesh Networks (WMNs) is concerned with finding “good” source destination paths. It generally faces multiple objectives to be optimized, such as i) path capacity, which accounts for the bits per second (bps) that can be sent along the path connecting the source to the destination node, and ii) end-to-end delay. This paper presents the Mesh Routing Algorithm (MRA), a dynamic programming approach for computing high-capacity paths while simultaneously bounding the end-to-end delay. The proposed algorithm also provides the option for locating multiple link-disjoint paths, such that the amount of traffic through each path is proportional to its capacity. Simulation results show that MRA outperforms other common techniques in terms of computing high capacity paths, while at the same time bounding the end-to-end delay to a desired value.
Date: 2008-08-26
Series: 08
009
URI: http://hdl.handle.net/1928/6895

Files in this item

Files Size Format View
TR.pdf 346.7Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

UNM Libraries

Search LoboVault


Advanced Search

Browse

My Account