Next Article in Journal
Towards Long-Term Multi-Hop WSN Deployments for Environmental Monitoring: An Experimental Network Evaluation
Previous Article in Journal
Towards Sensor-Actuator Coupling in an Automated Order Picking System by Detecting Sealed Seams on Pouch Packed Goods
Article Menu

Export Article

Open AccessArticle
J. Sens. Actuator Netw. 2014, 3(4), 274-296;

Towards a Fair and Efficient Packet Scheduling Scheme in Inter-Flow Network Coding

National University of Singapore, #02-02-10, AMI Lab, IDMI, 21 Heng Mui Keng Terrace,119613, Singapore
Institute for Infocomm Research, 1 Fusionopolis Way, #20-10 Connexis North Tower, 138632, Singapore
Author to whom correspondence should be addressed.
Received: 23 June 2014 / Revised: 29 September 2014 / Accepted: 22 October 2014 / Published: 4 November 2014
Full-Text   |   PDF [251 KB, uploaded 4 November 2014]   |  


Network coding techniques are usually applied upon network-layer protocols to improve throughput in wireless networks. In scenarios with multiple unicast sessions, fairness is also an important factor. Therefore, a network coding-aware packet-scheduling algorithm is required. A packet-scheduling algorithm determines which packet to send next from a node’s packet backlog. Existing protocols mostly employ a basic round-robin scheduling algorithm to give “equal” opportunities to different packet flows. In fact, this “equal”-opportunity scheduling is neither fair, nor efficient. This paper intends to accentuate the importance of a coding-aware scheduling scheme. With a good scheduling scheme, we can gain more control over the per-flow throughput and fairness. Specifically, we first formulate a static scheduling problem and propose an algorithm to find the optimal scheduling scheme. We then extend the technique to a dynamic setting and, later, to practical routing protocols. Results show that the algorithm is comparatively scalable, and it can improve the throughput gain when the network is not severely saturated. The fairness among flows is drastically improved as a result of this scheduling scheme. View Full-Text
Keywords: network coding; packet scheduling; fairness; weighted clique cover network coding; packet scheduling; fairness; weighted clique cover

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Wang, J.; Chai, T.Y.; Wong, W.-C. Towards a Fair and Efficient Packet Scheduling Scheme in Inter-Flow Network Coding. J. Sens. Actuator Netw. 2014, 3, 274-296.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
J. Sens. Actuator Netw. EISSN 2224-2708 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top