Multirate Anypath Routing in Wireless Mesh Networks

Laufer, Rafael; Dubois-Ferrière, Henri; Kleinrock, Leonard

doi:10.1109/infcom.2009.5061904

Cited by 106 publications

(105 citation statements)

References 26 publications

(60 reference statements)

Supporting

Mentioning

102

Contrasting

Unclassified

Order By: Relevance

“…WPR neither considers network partitions [25,26] nor unauthorized backbone nodes [27]. Because backbone nodes are static, we assume that network partitions do not occur very often.…”

Section: Discussionmentioning

confidence: 99%

A routing protocol suitable for backhaul access in wireless mesh networks

2012

View full text Add to dashboard Cite

This work proposes the Wireless-mesh-network Proactive Routing (WPR) protocol for wireless mesh networks, which are typically employed to provide backhaul access. WPR computes routes based on link states and, unlike current routing protocols, it uses two algorithms to improve communications in wireless mesh networks taking advantage of traffic concentration on links close to the network gateways. WPR introduces a controlled-flooding algorithm to reduce routing control overhead by considering the network topology similar to a tree. The main goal is to improve overall efficiency by saving network resources and avoiding network bottlenecks. In addition, WPR avoids redundant messages by selecting a subset of one-hop neighbors, the AMPR * Corresponding author.Email addresses: miguel@gta.ufrj.br (Miguel Elias M. Campista), luish@gta.ufrj.br (Luís Henrique M. K. Costa), otto@gta.ufrj.br (Otto Carlos M. B. Duarte) Preprint submitted to Computer NetworksAugust 4, 2011 (Adapted MultiPoint Relay), needed to reach all two-hop ones. We first analyze the proposed algorithms compared with the algorithms used by OLSR for the same tasks in terms of running time, optimality, and number of routing messages. Results show that the algorithms proposed by WPR are more efficient than the algorithms used by OLSR in running time and number of routing messages. In addition, we also perform simulations to evaluate the performance of WPR. Results reveal that the aggregated throughput of WPR outperforms OLSR by up to 27% using a combination of web and backbone internal traffic despite our design assumption of traffic convergence toward gateways.

show abstract

“…WPR neither considers network partitions [25,26] nor unauthorized backbone nodes [27]. Because backbone nodes are static, we assume that network partitions do not occur very often.…”

Section: Discussionmentioning

confidence: 99%

A routing protocol suitable for backhaul access in wireless mesh networks

2012

View full text Add to dashboard Cite

show abstract

“…The OR distance from i to j is defined as the length of the shortest OR path from i to j. In the recent work from Laufer et al [10], they proposed the Shortest Anypath First (SAF) and Shortest Multi-rate Anypath First (SMAF) algorithms to calculate the optimal OR paths from every node in a network to one receiver with single and multiple transmission rates. These schemes were shown to have the same complexity as the Dijkstra's shortest path algorithm.…”

Section: B Unicast or Distance Between Nodesmentioning

confidence: 99%

“…To minimize the total transmission cost to reach all receivers, we develop an algorithm to build the Minimum Steiner Tree with Opportunistic Routing (MSTOR). More specifically, in a connected wireless network, we first calculate the shortest OR distance [10] between each pair of nodes. The OR distance between nodes i and j is the expected total number of transmissions to send a packet from i to j using unicast OR.…”

Section: Introductionmentioning

confidence: 99%

Opportunistic Overlay Multicast in Wireless Networks

Liu

2010

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

View full text Add to dashboard Cite

Abstract-Opportunistic Routing (OR) has recently been proposed to improve the efficiency of unicast in multi-hop wireless networks. OR exploits the broadcast nature of wireless transmission medium and opportunistically selects a relay path to deliver a packet to its receiver. To adopt OR in wireless multicast, the main challenge is to efficiently share opportunistic relay paths between multiple receivers. In this paper, we propose an opportunistic overlay multicast design for wireless networks, named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by an overlay Steiner tree. The source multicasts packets along the overlay links of the Steiner tree to reach all receivers. The transmission of packets on each overlay link is controlled by unicast OR. We first propose an overlay construction algorithm based on the optimal "OR distance" between nodes. We then design the MSTOR protocol and implement it in OPNET by customizing the IEEE 802.15.4 modules. Through OPNET simulations, we study the performance improvement of MSTOR over several existing unicast and multicast routing schemes. Our results demonstrate that MSTOR can achieve a much higher multicast efficiency than the original unicast OR and the traditional minimum multicasttree based schemes. MSTOR can be easily deployed for multicast in multi-hop wireless networks.

show abstract

“…The main difference, however, is that a node chooses only one of these paths to forward a single packet, depending on the amount of packet loss of each path. Laufer et al [8] propose the multirate anypath routing protocol which also chooses the best transmission rate each node can use to forward a packet, further improving network performance.…”

Section: Introductionmentioning

confidence: 99%

An experimental analysis of routing inconsistency in indoor wireless mesh networks

Couto

Campista

Costa

et al. 2011

2011 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

Abstract-As of today, many routing protocols for wireless mesh networks have been proposed. Nevertheless, quite a few take the high loss rate of control packets into account. This work analyzes the problem of consistent routing information among wireless network nodes. To accomplish this, we propose a metric to evaluate the level of inconsistency among routing tables. Our experimental analysis demonstrates that the high loss rates seen in indoor environments negatively influence route computation.In addition, we demonstrate that the high network dynamics leads to severe instability in next hop selection. Results show that the effect of loss is significant and that the simple manipulation of routing protocol configuration parameters may be not enough to cope with the problem.

show abstract

Multirate Anypath Routing in Wireless Mesh Networks

Cited by 106 publications

References 26 publications

A routing protocol suitable for backhaul access in wireless mesh networks

A routing protocol suitable for backhaul access in wireless mesh networks

Opportunistic Overlay Multicast in Wireless Networks

An experimental analysis of routing inconsistency in indoor wireless mesh networks

Contact Info

Product

Resources

About