Multi-Constrained Any path Routing in Wireless Mesh Networks

Date Added: Feb 2010
Format: PDF

Traditional routing algorithms and protocols for wireless networks often follow the design methodology for wired networks by abstracting the wireless links as wired links and looking for the shortest delay, least cost or widest bandwidth path(s) between a pair of source and destination nodes. However for unreliable wireless networks, due to the broadcast nature of wireless medium, it is usually less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation motivates the idea of opportunistic routing. It has been shown that opportunistic routing can help improve the performance of wireless networks.