Approximate decoding for network coded inter-dependent data

Kwon, Minhae; Park, Hyunggon; Thomos, Nikolaos; Frossard, Pascal

doi:10.1016/j.sigpro.2015.09.010

Cited by 6 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That is, random mixing in the intersession network coding may lead to an increased decoding delay if only a subset of the coded sources of interest arrives at the terminal node. In this case, alternative decoding algorithms [38], [39], [40], [41] can be deployed.…”

Section: Packet Anonymitymentioning

confidence: 99%

See 1 more Smart Citation

Network Coding Based Evolutionary Network Formation for Dynamic Wireless Networks

Kwon¹,

Park²

2019

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

In this paper, we aim to find a robust network formation strategy that can adaptively evolve the network topology against network dynamics in a distributed manner. We consider a network coding deployed wireless ad hoc network where source nodes are connected to terminal nodes with the help of intermediate nodes. We show that mixing operations in network coding can induce packet anonymity that allows the inter-connections in a network to be decoupled. This enables each intermediate node to consider complex network inter-connections as a node-environment interaction such that the Markov decision process (MDP) can be employed at each intermediate node. The optimal policy that can be obtained by solving the MDP provides each node with optimal amount of changes in transmission range given network dynamics (e.g., the number of nodes in the range and channel condition). Hence, the network can be adaptively and optimally evolved by responding to the network dynamics. The proposed strategy is used to maximize long-term utility, which is achieved by considering both current network conditions and future network dynamics. We define the utility of an action to include network throughput gain and the cost of transmission power. We show that the resulting network of the proposed strategy eventually converges to stationary networks, which maintain the states of the nodes. Moreover, we propose to determine initial transmission ranges and initial network topology that can expedite the convergence of the proposed algorithm. Our simulation results confirm that the proposed strategy builds a network which adaptively changes its topology in the presence of network dynamics. Moreover, the proposed strategy outperforms existing strategies in terms of system goodput and successful connectivity ratio.

show abstract

Section: Packet Anonymitymentioning

confidence: 99%

“…The Bellman optimality operator is used between (37) and (38), and Property 8 is used between (38) and (39). By substituting d in (40) for (35), we conclude the following equation.…”

Section: Appendix B Proof Of Theoremmentioning

confidence: 99%