Approximation methods for optimal network coding in a multi-hop control network with packet losses

2015 ◽  
Author(s):  
F. Smarra ◽  
A. D'Innocenzo ◽  
M.D. Di Benedetto
Keyword(s):  
Network Coding ◽  
Control Network ◽  
Approximation Methods ◽  
Packet Losses ◽  
Optimal Network

scholarly journals Improving Delay-Based Data Dissemination Protocol in VANETs with Network Coding

2013 ◽  
Vol 2 (3-4) ◽  
Author(s):  
Farhan H. Mirani ◽  
Anthony Busson ◽  
Cedric Adjih
Keyword(s):  
Network Coding ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Data Dissemination ◽  
Relevant Information ◽  
Opportunistic Network ◽  
Excellent Performance ◽  
Packet Losses ◽  
The Family ◽  
Hoc Networks

In vehicular ad hoc networks (VANETs), for a large number of applications, the destination of relevant information such as alerts, is the whole set of vehicles located inside a given area. Therefore dissemination with efficient broadcast is an essential communication primitive. One of the families of broadcast protocols suitable for such networks, is the family of delay-based broadcast protocols, where farthest receivers retransmit first and where transmissions also act as implicit acknowledgements. For lossless networks, such protocols may approach the optimum efficiency. However with realistic loss models of VANET wireless communication, their performance is noticeably degraded. This is because packet losses have a double effect: directly on the amount of successfully received packets and indirectly with implicit acknowledgement misses. In this article, in order to combat the effects of packet losses, we combine delay-based broadcast with network coding, through a new protocol: Delay-based Opportunistic Network Coding protocol (DONC). By design, DONC aims at cancelling the twofold effects of packet and implicit acknowledgement losses. We describe the details of the DONC protocol, and we study its behavior, with realistic models and simulations. Results illustrate the excellent performance of the protocol.

scholarly journals Effective Retransmission in Network Coding for TCP

2011 ◽  
Vol 6 (1) ◽  
pp. 53 ◽  
Author(s):  
Jing Chen ◽  
Lixiang Liu ◽  
Xiaohui Hu ◽  
Wei Tan
Keyword(s):  
Network Coding ◽  
Control Algorithm ◽  
Transport Protocol ◽  
Packet Losses ◽  
Implicit Information ◽  
Streaming Applications ◽  
Congestion Control Algorithm ◽  
Systems Simulation ◽  
Lossy Channel ◽  
Decoding Delay

Incorporating network coding into TCP has the advantage of masking packet losses from the congestion control algorithm. It could make a lossy channel appear as a lossless channel for TCP, therefore the transport protocol can only focus on handling congestion. However, most schemes do not consider the decoding delay, thus are not suitable to be implemented in practical systems. We propose a novel feedback based network coding (FNC) retransmission scheme which has high throughput and quite low decoding delay without sacrificing throughput. It uses the implicit information of the seen scheme to acquire the exact number of packets the receiver needs for decoding all packets based on feedback. We also change the encoding rules of retransmission, so as to decode part of packets in advance. The scheme can work well on handling not only random losses but also bursty losses. Our scheme also keeps the end-to-end philosophy of TCP that the coding operations are only performed at the end hosts. Thus it is easier to be implemented in practical systems. Simulation results show that our scheme significantly outperforms the previous coding approach in reducing decoding delay, and obtains the throughput which is close to the scenarios where there is zero error loss. It is particularly useful for streaming applications.

Decoding Probability in Random Linear Network Coding with Packet Losses

2013 ◽  
Vol 17 (11) ◽  
pp. 1-4 ◽  
Author(s):  
Carla-Fabiana Chiasserini ◽  
Emanuele Viterbo ◽  
Claudio Casetti
Keyword(s):  
Network Coding ◽  
Linear Network ◽  
Packet Losses ◽  
Linear Network Coding ◽  
Random Linear Network Coding

An optimal network coding based backpressure routing approach for massive IoT network

2020 ◽  
Vol 26 (5) ◽  
pp. 3657-3674 ◽  
Author(s):  
S. Malathy ◽  
V. Porkodi ◽  
A. Sampathkumar ◽  
M. H. D. Nour Hindia ◽  
Kaharudin Dimyati ◽  
...  
Keyword(s):  
Network Coding ◽  
Optimal Network

DELAY CONTROL NETWORK CODING TECHNIQUE

2015 ◽  
Vol 77 (10) ◽  
Author(s):  
Shereen A. M. Ahmed Hamato ◽  
Sharifah H. S. Ariffin ◽  
Norsheila Fisal ◽  
Farizah Yunus
Keyword(s):  
Network Coding ◽  
Control Network ◽  
Main Question ◽  
Logic Operation ◽  
Unbounded Delay ◽  
Delay Control ◽  
Wireless Medium ◽  
Maximum Improvement ◽  
Asymmetric Flows ◽  
Pure Network

Network coding is a technique known to efficiently utilize the bandwidth by exploiting the broadcast nature of the wireless medium. Network coding reduces the number of retransmissions by allowing the relay not only to forward the packets, but to do some logic operation. However, considering the randomness and the asymmetric nature of the traffic in the wireless medium, it is usually very challenging for the relay to predict when the next packet is coming, thus the main question for the relay when receives a packet is whether to hold the packet in order to obtain a network coding opportunity or to rebroadcast the packet directly and eliminate the delay. In this paper, we address this challenge by introducing two schemes; Bandwidth Consideration Scheme (BCS) which considers pure network coding to achieve the maximum improvement in network throughput, and Time Limited Scheme (TLS), which uses the network coding but considers the imposed delay. The results show that, BCS can lead to up to 50% improvement in the bandwidth, however for symmetric flows using pure network coding leads to unbounded delay. On the other hand, TLS noticeably decreases the imposed delay for the symmetric flows and leads to relatively similar improvement in the throughput for asymmetric flows. 

scholarly journals Performance Evaluation of RPL Objective Function: A Case of Contiki Operation System

2020 ◽  
Author(s):  
Innocent Onwuegbuzie ◽  
Samuel-Soma Ajibade ◽  
Taiwo Fele ◽  
Sunday Akinwamide
Keyword(s):  
Power Consumption ◽  
Objective Function ◽  
Network Performance ◽  
Destination Node ◽  
Delivery Ratio ◽  
Lossy Networks ◽  
Packet Losses ◽  
Data Routing ◽  
Optimal Network ◽  
Operational Lifetime

Wireless Sensor Networks (WSN) is the network of the resource-constrained network which forms the foundation of the Internet of Things (IoT). The Routing Protocol for Low-power and Lossy Networks (RPL) is responsible for generating and managing data routing paths. Nodes implementing RPL uses the mechanics of Objective Function (OF) to select the preferred next-hop node – parent node, and optimal routing path to the destination node. If routing decisions are not efficiently made, this results in increased collision domain, leading to packet losses and packet retransmission which impairs the network operational lifetime. In this study, we present the Contiki Operating System (OS), a state-of-the-art OS for IoTs, ContikiRPL; Contiki variant of RPL. We investigated the performance of RPL with respect to its two OFs; Objective Function Zero (OF0) and the Minimum Rank with Hysteresis Objective Function (MRHOF). The performance of these OFs was evaluated on the following metrics; Packet Delivery Ratio (PDR), Power consumption, and network latency. The result shows that MRHOF outperformed OF0 on all metrics with an overall average PDR of 91.5%, a latency of 44ms, and power consumption of 1.72mW across all nodes. This results in optimal network performance with improved network operational lifetime.

Sign in / Sign up

Export Citation Format

Share Document