Map multi constrained anypath routing in wireless mesh networks

1. MAP: Multi-Constrained Anypath Routing in Wireless Mesh Networks
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 any path routing have been 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 (Multi-
constrained AnyPath), where K denotes 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.
Ambit lick Solutions
Mail Id: Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com