On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks

Zeng, Kai; Lou, Wenjing; Zhai, Huiqing

doi:10.1109/infocom.2008.133

Cited by 101 publications

(84 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Radunovic et al [17] presents an optimization framework to derive routing, scheduling, and rate adaptation schemes for wireless mesh networks. Zeng et al [7] presents a linear-programming formulation to optimize the end-to-end throughput of opportunistic routing, considering multiple rates and transmission conflict graphs. However, in both cases the authors try to optimize several components simultaneously and therefore the posed problem becomes NP-hard.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Multirate Anypath Routing in Wireless Mesh Networks

2009

View full text Add to dashboard Cite

Abstract-In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set and one of them forwards the packet on to the destination. To date, there is no theory capable of jointly optimizing both the set of next hops and the transmission rate used by each node. We bridge this gap by introducing a polynomial-time algorithm to this problem and provide the proof of its optimality. The proposed algorithm runs in the same running time as regular shortest-path algorithms and is therefore suitable for deployment in link-state routing protocols. We conducted experiments in a 802.11b testbed network, and our results show that multirate anypath routing performs on average 80% and up to 6.4 times better than anypath routing with a fixed rate of 11 Mbps. If the rate is fixed at 1 Mbps instead, performance improves by up to one order of magnitude.

show abstract

Section: Resultsmentioning

confidence: 99%

“…We call this the shortest multirate anypath problem. To our knowledge, this is still an open problem [3], [4], [7] and we believe our algorithm is the first practical solution for it.…”

Section: Introductionmentioning

confidence: 99%

Multirate Anypath Routing in Wireless Mesh Networks

2009

View full text Add to dashboard Cite

show abstract

“…In [2], the authors introduced a robust distributed opportunistic routing scheme base on ETX metric that can find the optimal OR path from a source to a receiver. The work in [3] proposed a method to calculate the maximum throughput between two end nodes with OR in ad-hoc networks. The recent work from [4] studies the capacity of hybrid wireless networks under OR, which exploits high speed data transmissions in infrastructure network through base stations to improve the routing performance.…”

Section: Related Work: Unicast Opportunistic Routingmentioning

confidence: 99%

“…While some attempts have been made to achieve a high efficiency in wireless multicast, the research field is still largely open. In parallel, Opportunistic Routing (OR) [1], [2], [3], [4], [5] 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 destination.…”

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

“…It has been verified that erasure coding is better than retransmissions in terms of cost and delay [4], [16], [17]. Erasure coding can be used for both inter-flow routing [18] and intra-flow routing [19].…”

Section: Related Workmentioning

confidence: 99%

Erasure-coding based utility routing in multi-hop wireless networks

2009

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems

View full text Add to dashboard Cite

Abstract-Recently, erasure coding has become widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Most existing works assume that the number of redundant erasure-coded packets is unlimited for a message. In this paper, we relax this assumption and integrate the packet quantity into a routing problem in order to achieve a good balance between energy cost and reliability (packet delivery ratio). In doing so, we encounter two major challenges in regards to our new routing problem: one is determining the optimal quantity of redundant packets and the other is determining the optimal routing path. We introduce a benefit value to reflect the trade-off between cost and reliability, and design a single metric (expected utility) by integrating benefit value, cost, and reliability. Based on the expected utility metric, we explore the optimality in both path coding and source coding models. In the path coding model, we design an optimal algorithm, and in the source coding model we propose a heuristic solution. Results from extensive simulations on our custom simulator verify our claims.

show abstract

On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks

Cited by 101 publications

References 18 publications

Multirate Anypath Routing in Wireless Mesh Networks

Multirate Anypath Routing in Wireless Mesh Networks

Opportunistic Overlay Multicast in Wireless Networks

Erasure-coding based utility routing in multi-hop wireless networks

Contact Info

Product

Resources

About