An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
XORs in the air: practical wireless network coding
IEEE/ACM Transactions on Networking (TON)
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Energy-delay tradeoff in a two-way relay with network coding
Performance Evaluation
| Hi-index | 0.00 |
We first propose a discrete-time Markov queueing model for a wireless lossy butterfly network which employs opportunistic network coding and dynamic buffer allocation at the bottlenecked relay node. Unlike earlier studies - which assume two or more static buffers at the relay, one for each packet flow - we propose that the relay dynamically allocate buffer space to incoming packets without assuming the static capacities of their respective buffers. Such dynamic buffer allocation in our context thus operates much like two water tanks positioned side by side and connected at the bottom by a static open valve. Motivated by an increasing demand for real-time applications, we show the delay benefit of network coding for a generic wireless lossy butterfly network over classical scheduling schemes such as first-in first-out and round-robin schemes. To improve the performance further, we propose a simple scheduling algorithm, called buffer equalized opportunistic network coding, which operates much like a pair of water tanks with a sliding open valve in the middle to allow packets (water) to move across tanks. We show that the proposed scheme improves in terms of delay over the original model.