MuCAR: A greedy multi-flow-based coding-aware routing in wireless networks

Chen, Jing; Yuan, Quan; Du, Ruxu; Wu, Jie

doi:10.1109/sahcn.2015.7338330

Cited by 5 publications

(2 citation statements)

References 15 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [26], authors investigate multi-flow coding situation and introduce a Greedy Multi-flow-based Coding-Aware Routing (MuCAR) protocol. A decoding policy and the coding condition in the multi-flow environment are defined to achieve one of sub-optimal solutions to the presented problem.…”

Section: Coding-aware Routingmentioning

confidence: 99%

CANCAR – Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

2018

KSII TIIS

View full text Add to dashboard Cite

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

show abstract

Section: Coding-aware Routingmentioning

confidence: 99%

CANCAR – Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

2018

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…Recently Chen et al generalized the result of COPE for multiple flows beyond the 2-hops scenario [24]. An illustration of coding multiple flows beyond the 2-hops scenario for wireless mesh network (WMN) is shown in Figure 3.…”

Section: Inter-session Network Coding Aware Routingmentioning

confidence: 99%

Efficient coding for unicast flows in opportunistic wireless networks

Awais¹,

Qureshi²

2017

IET Communications

View full text Add to dashboard Cite

In this paper we consider the scenario of multiple unicast flows intersecting a common router in an opportunistic wireless network. Instead of forwarding packets in each of the flows independently, the router can perform inter-session network coding and transmit codewords to improve the network throughput. Unlike coding for multicast data flow for which an optimal code can be constructed in polynomial time, coding for unicast data flows is a more complicated coding problem and has been shown to be an NP-hard problem. Opportunities for inter-session network coding have also been shown to exist in single-hop wireless data dissemination network such as Wi-Fi and WiMAX networks. In this paper we propose an efficient coding scheme for unicast flows and demonstrate its higher coding gain over previously proposed state of the art coding schemes, validated using simulation results and wireless sensor network testbed packet reception traces. We also show that our proposed algorithm is optimal for all 238 non-isomorphic coding instances for n ≤ 4, and for 9500 of the 9608 non-isomorphic coding instances for n = 5, where n is the number of unicast packets. Access Point Has: p 1 , p 2 , p 3 , p 4. Codewords: p 1 p 2 , p 3 p 4. Client c 1 Overheard: p 2 , p 3. Want: p 1 , p 4. Client c 2 Overheard: p 1. Want: p 2. Client c 3 Overheard: p 4. Want: p 3 .

show abstract

Adaptive Traffic Signal Control with Network-Wide Coordination

Chen

Yao

et al. 2017

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

MuCAR: A greedy multi-flow-based coding-aware routing in wireless networks

Cited by 5 publications

References 15 publications

CANCAR – Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

CANCAR – Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

Efficient coding for unicast flows in opportunistic wireless networks

Adaptive Traffic Signal Control with Network-Wide Coordination

Contact Info

Product

Resources

About