A queueing theoretic model for opportunistic network coding

Gunasekara, J. T. Charith; Alfa, Attahiru Sule; Yahampath, Pradeepa

doi:10.1109/iccnc.2013.6504227

Cited by 4 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have seen that much attention has been given to the study of delayed transmission strategies in two‐way relay wireless networks, eg, in previous studies . Yet due to the major challenges in modeling the complex relation between different sessions in multi‐hop wireless networks, clearly further research is required with respect to modeling of the to‐send‐or‐not‐to‐send problem in COPE‐based network coding, especially when the traffic flows and the transmission opportunities are stochastic.…”

Section: Resultsmentioning

confidence: 99%

“…In some other researches, authors considered more restricted conditions and scenarios. For example, in Gunasekara et al, researchers explored a scheme in which 2 users could communicate in network ceded environment through a single powerful access point. They developed a theoretical framework using a discrete time Markov chain to model the system and discrete time Markovian arrival process model packet arrivals.…”

Section: Related Workmentioning

confidence: 99%

“…A glance at the background reveals that this topic has already been looked at in a simple and restricted scenario called reverse carpooling . Reverse carpooling, or two‐way relay scenario, considers 2 flows that traverse a path in opposite directions in relay node.…”

Section: Introductionmentioning

confidence: 99%

“…Let us now check this with the latest available literature. For example, He and Yener analyzed this performance trade‐off in this scenario under a simple FIFO strategy and it was concluded that the delay will tend toward ∞ if the energy saving was considered as the goal; while Chen et al put forward policies that make uncoded transmissions using certain probabilities; Gunasekara et al and Abdelrahman and Gelenbe approached it using waiting time–based policies, and finally Hsu et al proposed an Markov decision process (MDP) solution for this trade‐off in a restricted and very simple case with one packet per time slot as transmission capacity at the relay node.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

To‐send‐or‐not‐to‐send: An optimal stopping approach to network coding in multi‐hop wireless networks

Javan

Sabaei

Dehghan

2017

Int J Communication

View full text Add to dashboard Cite

Network coding is all about combining a variety of packets and forwarding as much packets as possible in each transmission operation. The network coding technique improves the throughput efficiency of multi-hop wireless networks by taking advantage of the broadcast nature of wireless channels. However, there are some scenarios where the coding cannot be exploited due to the stochastic nature of the packet arrival process in the network. In these cases, the coding node faces two critical choices: forwarding the packet towards the destination without coding, thereby sacrificing the advantage of network coding, or, waiting for a while until a coding opportunity arises for the packets. Current research works have addressed this challenge for the case of a simple and restricted scheme called reverse carpooling where it is assumed that two flows with opposite directions arrive at the coding node. In this paper the issue is explored in a general sense based on the COPE architecture requiring no assumption about flows in multi-hop wireless networks. In particular, we address this sequential decision making problem by using the solid framework of optimal stopping theory, and derive the optimal stopping rule for the coding node to choose the optimal action to take, i.e. to wait for more coding opportunity or to stop immediately (and send packet). Our simulation results validate the effectiveness of the derived optimal stopping rule and show that the proposed scheme outperforms existing methods in terms of network throughput and energy consumption.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

To‐send‐or‐not‐to‐send: An optimal stopping approach to network coding in multi‐hop wireless networks

Javan

Sabaei

Dehghan

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Generally, there are two ways of delay and queue-length control: Delay based [15][16][17] and Queue-length based [18]. In the former one, if the waiting time of a packet is larger than a predefined threshold, the packet is forwarded without network coding.…”

Section: Introductionmentioning

confidence: 99%

OQMCAR: An Enhanced Network Coding-aware Routing Algorithm Based on Queue State and Local Topology

2015

KSII TIIS

View full text Add to dashboard Cite

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

show abstract

To Code or Not to Code: When and How to Use Network Coding in Energy Harvesting Wireless Multi-Hop Networks

Javan,

Yaghoubi

2024

IEEE Access

View full text Add to dashboard Cite

The broadcast nature of communication in transmission media has driven the rise of network coding's popularity in wireless networks. Numerous benefits arise from employing network coding in multihop wireless networks, including enhanced throughput, reduced energy consumption, and decreased end-toend delay. These advantages are a direct outcome of the minimized transmission count. This paper introduces a comprehensive framework to employ network coding in these networks. It refines decision-making at coding and decoding nodes simultaneously. The coding-nodes employ optimal stopping theory to find optimal moments for packet transmission. Meanwhile, the decoding-nodes dynamically decide, through SMDP (Semi Markov Decision Process) problem formulation, whether to conserve energy by deactivating radio units or to stay active for improved coding by overhearing packets. The proposed framework, named ENCODE, enables nodes to learn how and when to use network coding over time. Simulation results compare its performance with existing approaches. Our simulation results shed new light on when and how to use network coding in wireless multi-hop networks more effectively.INDEX TERMS Wireless multi-hop networks, Network coding theory, Coding gain, Optimal stopping theory, semi-Markov decision process.

show abstract

A queueing theoretic model for opportunistic network coding

Cited by 4 publications

References 13 publications

To‐send‐or‐not‐to‐send: An optimal stopping approach to network coding in multi‐hop wireless networks

To‐send‐or‐not‐to‐send: An optimal stopping approach to network coding in multi‐hop wireless networks

OQMCAR: An Enhanced Network Coding-aware Routing Algorithm Based on Queue State and Local Topology

To Code or Not to Code: When and How to Use Network Coding in Energy Harvesting Wireless Multi-Hop Networks

Contact Info

Product

Resources

About