A distributed opportunistic scheduling scheme for wireless network coding

Authors:
Athanasios Gkelias;Kin K. Leung
Affiliations:
Electrical and Electronic Engineering Department, Imperial College Lodnon, London, UK;Electrical and Electronic Engineering Department, Imperial College Lodnon, London, UK
Venue:
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
Year:
2009

Citing 3
Cited 0

Adaptive network coding and scheduling for maximizing throughput in wireless networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
XORs in the air: practical wireless network coding

IEEE/ACM Transactions on Networking (TON)
Network information flow

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network coding (NC) is an emerging technology area promising to increase the utilization of both wired and wireless networks. It can be seen as an extension to routing by allowing relay nodes to combine the information received from multiple links in the subsequent transmissions. NC was initially proposed in the context of multicast in wired networks where it was proven to achieve the maximum multicast capacity. However, the operation of NC in wireless networks with multiple unicast transmissions and its impact on the different layers has not been fully understood. In this paper we give a thorough insight into the interaction of NC and scheduling in wireless networks and we propose a novel distributed proportional fair (PF) scheduling algorithm that exploits multiuser diversity and coding opportunities to maximize the network throughput while guarantees "proportional fairness".