Advertisement

Wireless Personal Communications

, Volume 97, Issue 3, pp 4855–4876 | Cite as

A Framework of Joint Scheduling and Network Coding for Real-Time Traffic with Diverse Delay Constraints

  • Qinglong LiuEmail author
  • Gang Feng
  • Yantao Guo
Article
  • 118 Downloads

Abstract

Network coding is a promising technology that can be used to effectively enhance the throughput of wireless networks. In realistic wireless networks, due to the random nature of wireless medium access and possible rate mismatch among different codeable flows, there may be insufficient packets to be coded together at intermediate nodes, which compromises the potential throughput gain by exploiting network coding. In this paper, we propose a joint scheduling and network coding (SNC) framework to maximize coding opportunity for real-time traffic flows with diverse delay constraints. SNC consists of two mechanisms: Delaying Packet Transmission Policy (DTP) and Network Coding Group (NCG) based Scheduling Policy (GSP). DTP dynamically decides whether to delay packet transmission of an NCG or not and adjusts the encoding degree. We formulate this problem as a finite-horizon Markov decision process to obtain the optimal encoding degree adaptation policy. Based on the results of DTP and delay requirements of real-time traffic flows, GSP calculates a weight for each NCG and schedules the coded packets of an NCG for transmission according to the weight. Simulation results demonstrate the effectiveness and advantages of SNC, compared with NC schemes using opportunistic policy and greedy policy.

Keywords

Delay Opportunistic network coding Real-time traffic Scheduling 

Notes

Acknowledgements

This work is supported by the open project Grant of Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory (Grant No.: KX152600017/ITD-U15008).

References

  1. 1.
    Mohsenian-Rad, H., Huang, J., Wong, V., Jaggi, S., & Schober, R. (2013). Inter-session network coding with strategic users: A game-theoretic analysis of the butterfly network. IEEE Transactions on Communications, 61(4), 1473–1484.CrossRefGoogle Scholar
  2. 2.
    Katti, S., Rahul, H., Hu, W., Katabi, D., Medard, M., & Crowcroft, J. (2008). XORs in the air: Practical wireless network coding. IEEE/ACM Transactions on Networking, 16(3), 497–510.CrossRefGoogle Scholar
  3. 3.
    Li, Y., Zheng, F.-C., & Fitch, M. (2013). Physical layer network coding with channel and delay estimation. IET Communications, 7, 1109–1116. (7).CrossRefGoogle Scholar
  4. 4.
    Liu, Q., & Feng, G. (2012). Mitigating the impact of asynchronous acks on the performance of opportunistic network coding. IEEE in Global Communications Conference (GLOBECOM), 2012, 5644–5649.Google Scholar
  5. 5.
    Yang, S., & Wu, J. (2010). Efficient broadcasting using network coding and directional antennas in manets. IEEE Transactions on Parallel and Distributed Systems, 21(2), 148–161.CrossRefGoogle Scholar
  6. 6.
    Chi, K., Jiang, X., & Horiguchi, S. (2008). Network coding opportunity analysis of COPE in multihop wireless networks. In Wireless communications and networking conference, 2008. WCNC 2008. IEEE (pp. 2858–2863).Google Scholar
  7. 7.
    Le, J., Lui, J., Chiu, D. M. (2008). How many packets can we encode?—An analysis of practical wireless network coding. In The 27th conference on computer communications INFOCOM 2008. IEEE (pp. 371–375).Google Scholar
  8. 8.
    Zhang, J., & Fan, P. (2010). Optimal scheduling for network coding: Delay v.s. efficiency. In Global telecommunications conference (GLOBECOM 2010), 2010 IEEE (pp. 1–5).Google Scholar
  9. 9.
    Hsu, Y.-P., Abedini, N., Ramasamy, S., Gautam, N., Sprintson, A., & Shakkottai, S. (2011). Opportunities for network coding: To wait or not to wait. In 2011 IEEE International symposium on information theory proceedings (ISIT) (pp. 791–795).Google Scholar
  10. 10.
    Chen, W., Letaief, K., & Cao, Z. (2007) Opportunistic network coding for wireless networks. In IEEE International Conference on Communications, 2007. ICC ’07 (pp. 4634–4639).Google Scholar
  11. 11.
    Seferoglu, H., & Markopoulou, A. (2010). Delay-optimized network coding for video streaming over wireless networks. IEEE International Conference on Communications (ICC), 2010, 1–5.Google Scholar
  12. 12.
    Ostovari, P., Wu, J., & Khreishah, A. (2012). Deadline-aware broadcasting in wireless networks with local network coding. In 2012 international conference on computing, networking and communications (ICNC). IEEE (pp. 1123–1127).Google Scholar
  13. 13.
    Zhao, F., & Medard, M. (2010) On analyzing and improving COPE performance. In Information Theory and Applications Workshop (ITA) (pp. 1–6).Google Scholar
  14. 14.
    Liu, Q., & Feng, G. (2011). Optimization based queue management for opportunistic network coding. In 2011 6th International ICST conference on communications and networking in China (CHINACOM) (pp. 1159–1164).Google Scholar
  15. 15.
    Wang, Z., & Crowcroft, J. (1993). Analysis of burstiness and jitter in real-time communications. ACM SIGCOMM Computer Communication Review, 23(4), 13–19.CrossRefGoogle Scholar
  16. 16.
    Yang, L., Sagduyu, Y. E., Zhang, J., & Li, J. H. (2015). Deadline-aware scheduling with adaptive network coding for real-time traffic. IEEE/ACM Transactions on Networking (TON), 23(5), 1430–1443.CrossRefGoogle Scholar
  17. 17.
    Tran, T. T., Li, H., Lin, W., Liu, L., & Khan, S. U. (2012). Adaptive scheduling for multicasting hard deadline constrained prioritized data via network coding. IEEE Global Communications Conference (GLOBECOM), 2012, 5621–5626.Google Scholar
  18. 18.
    Puterman, M. L. (2009). Markov decision processes: Discrete stochastic dynamic programming (Vol. 414). New York: Wiley.zbMATHGoogle Scholar
  19. 19.
    Chang, H. S., Fu, M. C., Hu, J., & Marcus, S. I. (2007). Simulation-based algorithms for Markov decision processes (communications and control engineering). London: Springer.CrossRefGoogle Scholar
  20. 20.
    Chen, H., Feng, J., & Tse, C. K. (2010). Performance-lifetime tradeoff for source extraction in multihop sensor networks. International Journal of Communication Systems, 23(12), 1613–1631.CrossRefGoogle Scholar
  21. 21.
    Feng, W., & Elmirghani, J. M. (2010). Lifetime evaluation in energy-efficient rectangular ad hoc wireless networks. International Journal of Communication Systems, 23(12), 1500–1520.CrossRefGoogle Scholar
  22. 22.
    Papailiopoulos, D., Luo, J., Dimakis, A., Huang, C., & Li, J. (2012). Simple regenerating codes: Network coding for cloud storage. INFOCOM, Proceedings IEEE, 2012, 2801–2805.Google Scholar
  23. 23.
    Dimakis, A., Godfrey, P., Wu, Y., Wainwright, M., & Ramchandran, K. (2010). Network coding for distributed storage systems. IEEE Transactions on Information Theory, 56(9), 4539–4551.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.National Key Laboratory of Science and Technology on CommunicationsUniversity of Electronic Science and Technology of ChinaChengduChina
  2. 2.Science and Technology on Information Transmission and Dissemination in Communication Networks LaboratoryShijiazhuangChina

Personalised recommendations