CAOR: Coding-aware opportunistic routing in wireless ad hoc networks

Chung, Kun-Cheng; Chou, Yi-Chun; Liao, Wanjiun

doi:10.1109/icc.2012.6364183

Cited by 14 publications

(15 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A number of routing protocols for lossy MANETs have been proposed in literature [6], [8]- [22]. The unicast routing protocol in [6] improved the throughput by running a shortest path algorithm for route selection, where each link weight represents the expected number of transmissions required for successfully delivering a packet over the link.…”

Section: Related Workmentioning

confidence: 99%

Bandwidth-Satisfied Multicast by Multiple Trees and Network Coding in Lossy MANETs

Chen

2017

IEEE Systems Journal

View full text Add to dashboard Cite

Wireless links are inherently lossy due to channel fading or interference. Previously, duplicate packets were transmitted on multiple routes of lossy mobile ad hoc networks (MANETs) to enhance reliability. In this paper, a multicast routing protocol that constructs multiple multicast trees and employs network coding is proposed for lossy MANETs, where each multicast tree can satisfy a predefined percentage of the bandwidth requirement. The proposed protocol can reduce the total bandwidth consumption while providing bandwidth guarantees to a requested flow and ongoing flows. As a consequence of employing network coding, no redundant packet is generated, and no scheduling algorithm for distributing packets among the multicast trees is needed. Simulation results show that the proposed protocol outperforms prior multicast routing protocols in terms of the receiving ratio, the admission ratio, and the total bandwidth consumption.Index Terms-Bandwidth guarantee, lossy mobile ad hoc network (MANET), multicast, network coding, quality of service (QoS).

show abstract

Section: Related Workmentioning

confidence: 99%

Bandwidth-Satisfied Multicast by Multiple Trees and Network Coding in Lossy MANETs

Chen

2017

IEEE Systems Journal

View full text Add to dashboard Cite

show abstract

“…The network coding has also emerged as an energy efficient technique to improve broadcasting capabilities in a network [22][23][24][25]. The researchers in [26][27][28][29][30] further develop new coding-aware routing protocols for wireless networks to provide better path bandwidth estimate and identify high throughput paths. Moreover, network coding technique can be used to protect against wireless link failure [31] and path failure [32].…”

Section: Network Codingmentioning

confidence: 99%

An efficient network reprogramming protocol for wireless sensor networks

Dong

2015

Computer Communications

View full text Add to dashboard Cite

“…Intermediate nodes individually make coding decisions, but it can barely catch the coding opportunity that the number of packets coded together is larger than 2. The coding-aware opportunistic routing (CAOR) [30] integrates intra-flow network coding based OR with inter-flow network coding. However, integrating intra-flow and inter-flow network coding together make the coding opportunities in the network are relatively small.…”

Section: Related Workmentioning

confidence: 99%

CAR: Coding-Aware Opportunistic Routing for Unicast Traffic in Wireless Mesh Networks

Liu

Yang²,

Wang³

et al. 2014

J Netw Syst Manage

View full text Add to dashboard Cite

An intermediate node in an inter-flow network coding scheme needs to know exactly which are the previous hop and next hop of a packet before coding. It is difficult to incorporate inter-flow network coding into opportunistic routing (OR) because the next hop of a packet in OR can't be determined in advance. Codingaware opportunistic routing (CAR) is proposed in this paper to address this problem on fixed wireless mesh networks (WMNs). Meanwhile, it aims to maximize the number of native packets coded in each single transmission. It dynamically selects a route for a given flow according to the real-time coding opportunities. There are no control packets in CAR, which greatly reduces the overhead costs. CAR gives the coded packet that consists of a larger number of native packets with a smaller forwarding delay. The forwarder with the largest number of native packets coded together is ultimately selected to send data. Simulations demonstrate that CAR achieves significantly better throughput gains and derives a reasonable end-to-end delay in both cross topology and mesh topology under both transmission control protocol (TCP) and user datagram protocol (UDP) traffic, as explained below. CAR achieves more than 35 % throughput improvement under TCP traffic and more than 15 % throughput improvement under UDP traffic, compared to other state-of-art protocols in cross topology, respectively. CAR also provides a several-fold increase in throughput in a large scale network (mesh topology). In a word, CAR significantly improves network performance of a WMN.

show abstract

CAOR: Coding-aware opportunistic routing in wireless ad hoc networks

Cited by 14 publications

References 5 publications

Bandwidth-Satisfied Multicast by Multiple Trees and Network Coding in Lossy MANETs

Bandwidth-Satisfied Multicast by Multiple Trees and Network Coding in Lossy MANETs

An efficient network reprogramming protocol for wireless sensor networks

CAR: Coding-Aware Opportunistic Routing for Unicast Traffic in Wireless Mesh Networks

Contact Info

Product

Resources

About