FlexONC: Joint Cooperative Forwarding and Network Coding With Precise Encoding Conditions

Kafaie, Somayeh; Chen, Yuanzhu; Ahmed, Mohamed H.; Dobre, Octavia A.

doi:10.1109/tvt.2017.2659539

Cited by 4 publications

(9 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, there is essentially a trade-off between the encoding ratio and the end-to-end delay. In fact, only throughput performance was investigated in the past studies on IFNC 12–17 mentioned in section “Introduction.” 18 From our simulation results, IFNCPA is considered to be useful for applications that can tolerate about a few hundred milliseconds for the end-to-end delay. Note that although the end-to-end delay is still below the limit of 400 ms for audio or video applications, 22 it exceeds the allowed value of 150 ms in the environment under asymmetric and high traffic load.…”

Section: Conclusion and Remarksmentioning

confidence: 99%

See 1 more Smart Citation

Efficient and reliable packet transfer protocol for wireless multihop bidirectional communications

Takaki

Ando

Maesako

et al. 2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In wireless multihop bidirectional communication environment, there is a possibility that packet collision and retransmission owing to the hidden node problem decrease efficiency of throughput. The aim of this article is to achieve efficient and reliable packet transmissions in such environments. To do so, we propose a packet transmission scheme named inter-flow network coding with passive acknowledgment. In inter-flow network coding with passive acknowledgment, it is necessary to optimize the encoding latency and to avoid passive acknowledgment packet collision, so we address these issues in this article. Finally, we also confirm that the inter-flow network coding with passive acknowledgment scheme is effective in terms of the collection ratio and delay through simulations.

show abstract

Section: Conclusion and Remarksmentioning

confidence: 99%

“…Several variants of COPE and BEND have been proposed to enable more coding opportunities and increase network capacity, for example, DCAR, 14 CORE, 15 DODEX+ , 16 INCP, 17 and FlexONC. 18 These schemes can be regarded as inheriting the ACK mechanism of COPE and BEND, and none of them utilizes passive ACKs.…”

Section: Introductionmentioning

confidence: 99%

Efficient and reliable packet transfer protocol for wireless multihop bidirectional communications

Takaki

Ando

Maesako

et al. 2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…To reduce decoding failures is also very important in coding-aware routing. FlexONC [22] utilizes a switch rule and an ACK strategy to limit decoding failures and allows nonintended forwarders to help in decoding, encoding, and forwarding. To promote the reliability of coding opportunities and deal with the coding collision problem effectively, CFCR [23] also introduces the information confirmation process to decrease the failure ratio of decoding.…”

Section: 2mentioning

confidence: 99%

CARTA: Coding-Aware Routing via Tree-Based Address

Yang

2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Network coding-aware routing has become an effective paradigm to improve network throughput and relieve network congestion. However, to detect coding opportunities and make routing decision for a data flow, most existing XOR coding-aware routing methods need to consume much overhead to collect overhearing information on its possible routing paths. In view of this, we propose low-overhead and dynamic Coding-Aware Routing via Tree-based Address (CARTA) for wireless sensor networks (WSNs). In CARTA, a Multi-Root Multi-Tree Topology (MRMTT) with a tree-based address allocation mechanism is firstly constructed to provide transmission paths for data flows. Then, a low-overhead coding condition judgment method is provided to detect real-time coding opportunities via tree address calculation in the MRMTT. Further, CARTA defines routing address adjustments caused by encoding and decoding to ensure the flows’ routing paths can be adjusted flexibly according to their real-time coding opportunities. It also makes additional constraints on congestion and hop count in the coding condition judgment to relieve network congestion and control the hop counts of routing paths. The simulation results verify that CARTA can utilize more coding opportunities with less overhead on coding, and this is ultimately beneficial for promoting network throughout and balancing energy consumption in WSNs.

show abstract

“…For mixing more than two flows, every two of them should hold the conditions above. However, in some scenarios as shown in [85], encoding decisions made based on these coding conditions may decide incorrectly to mix some packets that cannot be decoded at the next-hops.…”

Section: E Coding Conditionsmentioning

confidence: 99%

“…To elaborate on the inaccuracy of these coding conditions, let us assume that in Fig. 14, reproduced from [85], N 0 transmits P 1 to N 7 , N 7 transmits P 2 to N 9 , and N 2 transmits P 3 to N 0 . Also, we assume that these sources are out of transmission range of their destinations, and N 5 forwards P 1 and P 3 as a coded packet P 1 ⊕ P 3 .…”

Section: E Coding Conditionsmentioning

confidence: 99%

Joint Inter-Flow Network Coding and Opportunistic Routing in Multi-Hop Wireless Mesh Networks: A Comprehensive Survey

Kafaie

Chen

Dobre

et al. 2018

IEEE Commun. Surv. Tutorials

Self Cite

View full text Add to dashboard Cite

Network coding and opportunistic routing are two recognized innovative ideas to improve the performance of wireless networks by utilizing the broadcast nature of the wireless medium. In the last decade, there has been considerable research on how to synergize inter-flow network coding and opportunistic routing in a single joint protocol outperforming each in any scenario. This paper explains the motivation behind the integration of these two techniques, and highlights certain scenarios in which the joint approach may even degrade the performance, emphasizing the fact that their synergistic effect cannot be accomplished with a naive and perfunctory combination. This survey paper also provides a comprehensive taxonomy of the joint protocols in terms of their fundamental components and associated challenges, and compares existing joint protocols. We also present concluding remarks along with an outline of future research directions.Inter-flow network coding, opportunistic routing, network coding-aware routing, unicast traffic, multi-hop wireless mesh networks. I. INTRODUCTIONWireless mesh network (WMN) [1], [2] is a type of wireless communication networks aiming to realize the dream of a seamlessly connected world. In mesh infrastructure, radio nodes are connected via wireless links creating a multi-hop wireless network, and nodes can talk to each other and pass data over long distances. This is realized by forming long paths consisting of smaller segments and handing off data over mulitple hops. This cooperative data delivery is the key idea of mesh networks to share connectivity across a large area with inexpensive wireless technologies.Despite these advancements, users' expectations rise fast, and new applications require higher throughput and lower delay [3]. In addition, the performance of wireless networks is significantly restricted by interference, and the unreliability of the wireless channel. Also, it is adversely affected by the contention among different data flows and devices in sharing bandwidth and other network resources. However, since the last decade two promising approaches of "Opportunistic Routing" and "Network Coding" are proved to improve the performance of wireless networks significantly by creatively utilizing the broadcast nature of the wireless medium.Network coding (NC), more specifically inter-flow network coding (IXNC), is the process of forwarding more than one packet in each transmission. Doing so, it increases the "effective" capacity of the network [4] and improves the throughput. Opportunistic routing 1 (OR) also benefits from the broadcast nature of wireless networks via path diversity. In OR, in contrast to traditional forwarding, there is no fixed route, and nodes do not forward a packet to a specified pre-selected next-hop. In fact, a node first broadcasts the packet, and then the next-hop is selected among all neighbors that have received the packet successfully. In addition, as explained in Section II-B, OR can reduce the total number of transmissions by exploiting long but p...

show abstract

FlexONC: Joint Cooperative Forwarding and Network Coding With Precise Encoding Conditions

Cited by 4 publications

References 28 publications

Efficient and reliable packet transfer protocol for wireless multihop bidirectional communications

Efficient and reliable packet transfer protocol for wireless multihop bidirectional communications

CARTA: Coding-Aware Routing via Tree-Based Address

Joint Inter-Flow Network Coding and Opportunistic Routing in Multi-Hop Wireless Mesh Networks: A Comprehensive Survey

Contact Info

Product

Resources

About