Your browser does not support JavaScript!

Scheduling performance enhancement by network coding in wireless mesh networks

Scheduling performance enhancement by network coding in wireless mesh networks

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

When a wireless mesh network accommodates interactive applications with quality of service requirements, schedule-based protocols are more suitable than contention-based protocols. In this paper, the problem of determining an appropriate schedule assignment for multiple group transmissions within a spatial time division multiple access link scheduling network is referred to as an integrated multiple-group communication and link scheduling problem. A polynomial-time scheduling algorithm, designated as a source-parallel-aware assignment (SPAA), is proposed to increase the spatial utilisation within each time slot in order to enhance the network throughput. Furthermore, an advanced version of SPAA, designated as joint source-parallel-aware assignment with network coding (JSANC), is proposed to reduce the effects of bottleneck paths on the schedule frame length by flexibly applying conventional or opportunistic network coding approaches. Simulation results show that the proposed algorithms achieve a better network throughput than existing flow-based or particular order-based scheduling schemes.


    1. 1)
      • Chafekar, D., Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: `Approximation algorithms for computing capacity of wireless networks with SINR constraints', Proc. 27th IEEE Int. Conf. on Computer Communications (INFOCOM 08), April 2008, Phoenix, AZ, USA, p. 1166–1174.
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • Cui, T., Chen, L., Ho, T.: `Energy efficient opportunistic network coding for wireless networks', Proc. 27th IEEE Int. Conf. on Computer Communications (INFOCOM 08), April 2008, Phoenix, AZ, USA, p. 1022–1030.
    8. 8)
      • Leoncini, M., Santi, P., Valente, P.: `An STDMA-based framework for QoS provisioning in wireless mesh networks', Proc. Fifth IEEE Int. Conf. on Mobile Ad-Hoc and Sensor System (MASS 08), October 2008, Atlanta, GA, USA, p. 223–232.
    9. 9)
    10. 10)
    11. 11)
      • Liao, G.-L., Chen, C.-Y., Hsu, S.-W., Wu, T.-Y., Chao, H.-C.: `Adaptive situation-aware load balance scheme for mobile wireless mesh networks', Proc. Third IEEE Int. Workshop on Mobility Management in the Networks of the Future World (MobiWorld 2011), April 2011, Shanghai, China.
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • Y.L. Tang , Y. Yao , C.H. Lo . Improvement of channel assignment scheme for WiMax mesh networks. J. Internet Technol. , 2 , 135 - 142
    18. 18)
      • Grönkvist, J., Hansson, A.: `Comparison between graph-based and interference-based STDMA scheduling', Proc. Second ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MOBIHOC 01), October 2001, Long Beach, CA, USA, p. 255–258.
    19. 19)
    20. 20)
      • D.B. West . (1996) Introduction to graph theory.
    21. 21)
    22. 22)
      • Y.L. Tang , T.Y. Wu , J.W. Ding , J.J. Chen . Resource sharing and bandwidth allocation for WiMAX mesh networks using centralized scheduling. J. Internet Technol. , 2 , 251 - 259
    23. 23)
      • Grönkvist, J., Nilsson, J., Yuan, D.: `Throughput of optimal spatial reuse TDMA for wireless ad-hoc networks', Proc. 59th IEEE Vehicular Technology Conf. (VTC2004-Spring), May 2004, Milan, Italy, p. 2156–2160.

Related content

This is a required field
Please enter a valid email address