Adaptive Random Linear Network Coding with Controlled Forwarding for wireless broadcast

Mahmood, Kashif; Kunz, Thomas; Matrawy, Ashraf

doi:10.1109/wd.2010.5657753

Cited by 8 publications

(8 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The next two figures show the required number of MAC layer packet transmissions for both scenarios, with and without the support of cross-source coding. In all cases, packet delivery is high, but not 100%, as we lose packets due to collisions etc., see the results in [16]. So the MAC transmissions are normalized by the PDR to allow fair comparison across protocols with different PDRs.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…We call our protocol ARLNCCF for Adaptive Random Linear Network Coding with Controlled Forwarding. The core protocol is further described in [16], where we already showed that crosssource coding reduces packet latency and increases packet delivery ratio (PDR). Here we briefly review the relevant features of the protocol and evaluate the protocol efficiency, i.e., does the protocol broadcast packets using only few MAC layer packet transmissions?…”

Section: A Cross-session Broadcast Protocolmentioning

confidence: 99%

See 1 more Smart Citation

Broadcasting in multihop wireless networks: The case for multi-source network coding

Kunz

Mahmood

2012

2012 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

Network Coding, in particular Random Linear Network Coding, has been extensively researched for communication in multihop wireless networks, such as MANETs.A key aspect of random linear network coding is the definition of generations, the set of native data packets that can be coded together. To keep the decoding complexity and packet latency low, generations are typically small. In addition, to simplify generation management, it is usually assumed that a generation only contains packets originating from the same source. For broadcast scenarios, we show via examples, analytically derived lower bounds, and protocol simulations that the latter restriction reduces the coding gains that are achievable. Allowing packets from different sources to be combined (i.e., coded together) can improve PDR, reduce packet latency, and further reduce the number of packet transmissions at the MAC layer. We also discuss the added complexity that results from having packets from different sources in a single generation and propose our solution, embedded in a RLNC broadcast protocol called ARLNCCF.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: A Cross-session Broadcast Protocolmentioning

confidence: 99%

Broadcasting in multihop wireless networks: The case for multi-source network coding

Kunz

Mahmood

2012

2012 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The forwarding node adds its own packets with original packets and sends outgoing coded packets. Typically, RLNC performs three different operations [21], they are 1. Encoding, 2.…”

Section: Random Linear Network Coding For Unicastmentioning

confidence: 99%

On Improving Reliability in Multicast Routing Protocol for Wireless Sensor Network

Sampradeepraj¹,

Raja²

2020

ITC

View full text Add to dashboard Cite

Multicast routing becomes the most challenging problem in Wireless Sensor Networks (WSN). Multicasting is an effective way to facilitate group communication in which the multicast data need to be sent from a source node to multiple receivers. In this paper, a simple and efficient algorithm Minimum Connected Dominating Set (MCDS) is used to form a virtual backbone as forwarding group of the network. The MCDS aims at minimizing the number of nodes, where few nodes should be dominated, which are responsible for forwarding the multicast packets by applying Random Linear Network Coding (RLNC). RLNC has great potential to improve the performance of multicast routing protocol. The objective of this paper is to improve the performance of On-Demand Multicasting Routing Protocol (ODMRP) with respect to reliability using RLNC over MCDS for WSN, so that bandwidth utilization can be increased in the network. The proposed approach is named as RLNMCDS-ODMRP, which deliver multicast data in high reliable. Experimental results and performance analysis show that the proposed protocol outperforms the classical multicast routing protocols that use MCDS or RLNC.

show abstract

“…Similarly as in ARQ technique, from (1), (11), (12), and considering the independent data received at the receivers, the average network throughput of RNC technique is represented as…”

Section: Random Network Coding (Rnc)mentioning

confidence: 99%

“…In another work, Goel et al [9] derived a lower bound of energy consumed in wireless multicast networks using NC. Further, some adaptive NC schemes have been proposed in wireless networks to increase the network throughput and bandwidth efficiency [11], [12], [13]. However, all these works did not consider prioritized data or focused only on heuristic algorithms to minimize the decoding delay of special scenarios with limited number of receivers.…”

mentioning

confidence: 99%

Adaptive scheduling for multicasting hard deadline constrained prioritized data via network coding

Tran

Lin

Liu

et al. 2012

2012 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Abstract-Network coding offers a promising platform for multicast transmission by approaching its min-cut capacity. However, pushing the network throughput toward this upper bound comes with a sacrifice in delivery delay due to the decoding procedure that requires performing batch of coded packets. Further, in some transmission scenarios where the receivers experience deep fading or unable to collect a full set of the transmitted data, no useful information is recovered. The effect is more severe in the networks where the transmitted information has priority structure with hard deadline constraint due to the limited delivery time and data interdependencies. In this paper, we consider single-hop wireless networks where the transmitter wishes to multicast hard deadline constrained prioritized data to many receivers over lossy channels. We first study the network performance of a variety of transmission techniques, depending on how the transmitter schedules transmission in each time slot. We then propose an adaptive encoding and scheduling technique to maximize the network throughput. To find the optimal transmission scheduling at the presence of the network dynamics, we cast the problem in the framework of Markov Decision Processes (MDP) and use backward induction method to find an optimal solution. We further propose simulation-based algorithm and greedy scheduling technique that obtain high performance with much lower time complexity. Both analytical and simulation results have been provided to corroborate the effectiveness of the proposed techniques.

show abstract

Adaptive Random Linear Network Coding with Controlled Forwarding for wireless broadcast

Cited by 8 publications

References 30 publications

Broadcasting in multihop wireless networks: The case for multi-source network coding

Broadcasting in multihop wireless networks: The case for multi-source network coding

On Improving Reliability in Multicast Routing Protocol for Wireless Sensor Network

Adaptive scheduling for multicasting hard deadline constrained prioritized data via network coding

Contact Info

Product

Resources

About