Performance of network-coding-assisted scheduling schemes and their applications in uplink time division duplexing code division multiple access systems

Access Full Text

Performance of network-coding-assisted scheduling schemes and their applications in uplink time division duplexing code division multiple access systems

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

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.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
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
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.

Network coding can deliver multiple data streams simultaneously and make full use of broadcast nature of wireless channels. The authors propose two diversity-enabled network-coding (NC) schemes to optimise wireless uplink scheduling. The existing scheduling protocols normally have to allow the users with relatively low channel gains to transmit, and it can maintain fairness but reduce congregated throughput. The main idea of the proposed scheme is to always schedule users with the best channel condition, while the use of NC encourages the scheduled users to help others which have not been served previously. Delay and capacity performance for different network coded scheduling schemes are analysed. Round-robin and pure opportunistic scheduling are evaluated for performance comparison. In order to show the effectiveness of the proposed schemes, NC schedulers are applied to a time division duplexing code division multiple access wireless cellular networks. System-level simulation was carried out based on the third generation partnership project specifications. Per-sector average throughput and cumulative distribution function of user average throughput are adopted as the performance metrics. Analytical and simulation results show that the proposed NC schedulers can achieve a better tradeoff between fairness and throughput than those without NC.

Inspec keywords: wireless channels; network coding; code division multiple access; scheduling; protocols; cellular radio; channel coding; time division multiple access

Other keywords: wireless uplink scheduling; data streams; NC schedulers; cumulative distribution function; scheduling protocols; round-robin scheduling; wireless channels; network coded scheduling schemes; uplink time division duplexing code division multiple access cellular network; network-coding-assisted scheduling scheme; diversity-enabled network-coding schemes; third generation partnership project specifications; pure opportunistic scheduling; system-level simulation

Subjects: Mobile radio systems; Codes; Multiple access communication; Protocols

References

    1. 1)
      • The 3rd Generation Partnership Project (3GPP) TR 30.03: ‘Universal mobile telecommunications system (UMTS); selection procedures for the choice of radio transmission technologies of the UMTS’, April 1998, v3.2.0, downloaded from ftp://ftp.3gpp.org/Specs/.
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • Zhang, S., Liew, S., Lu, L.: `Physical layer network coding schemes over finite and infinite fields', Proc. IEEE Global Telecommunications Conf. (GLOBECOM08), December 2008.
    6. 6)
    7. 7)
      • Tarasak, P., Sethakaset, U., Sun, S.: `Capacity analysis of two-user opportunistic scheduling for wireless network coding', Proc. IEEE Int. Symp. on Information Theory (ISIT), June–July 2009, p. 2572–257.
    8. 8)
      • I.S. Gradshteyn , I.M. Ryzhik . (1980) Table of integrals, series and products.
    9. 9)
      • Yomo, H., Popovski, P.: `Opportunistic scheduling for wireless network coding', Proc. IEEE Int. Conf. on Communications (ICC07), June 2007, p. 5610–5615.
    10. 10)
    11. 11)
      • Zhang, S., Liew, S., Lam, P.: `Physical layer network coding', Proc. 12th Annual Int. Conf. on Mobile Computing and Networking (ACM MobiCom 2006), September 2006.
    12. 12)
    13. 13)
      • J.G. Proakis . (1995) Digital communications.
    14. 14)
      • The 3rd Generation Partnership Project (3GPP) TR 25.996: ‘Technical specification group radio access network; spatial channel model for multiple input multiple output simulations’, June 2007, v7.0.0, downloaded from ftp://ftp.3gpp.org/Specs/.
    15. 15)
    16. 16)
      • R. Horn , C. Johnson . (1985) Matrix analysis.
    17. 17)
      • The 3rd Generation Partnership Project (3GPP) TS 25.221: ‘Technical specification group radio access network; physical channels and mapping of transport channels onto physical channels’, September 2007, v7.4.0, downloaded from ftp://ftp.3gpp.org/Specs/.
    18. 18)
      • R.W. Yeung , S.-Y.R. Li , N. Cai , Z. Zhang . (2006) Network coding theory, foundations and trends in communications and information theory.
    19. 19)
    20. 20)
    21. 21)
    22. 22)
    23. 23)
      • Lin, Z., Vucetic, B.: `Power and rate adaptation for wireless network coding with opportunistic scheduling', Proc. IEEE Int. Symp. on Information Theory (ISIT), July 2008, p. 21–25.
    24. 24)
      • H.A. David , H.N. Nagaraja . (2003) Order statistics.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.1045
Loading

Related content

content/journals/10.1049/iet-com.2010.1045
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading