Deakin home > Deakin University Library > Deakin Research Online > On the maximum throughput of two-hop wireless network coding

On the maximum throughput of two-hop wireless network coding

Zeng, Deze, Guo, Song, Jin, Hai and Yu, Shui 2011, On the maximum throughput of two-hop wireless network coding, in WCNC 2011 : IEEE Wireless Communications and Networking Conference, IEEE, Piscataway, N. J., pp. 416-421.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads

Title On the maximum throughput of two-hop wireless network coding
Author(s) Zeng, Deze
Guo, Song
Jin, Hai
Yu, Shui
Conference name IEEE Wireless Communications and Networking. Conference (2011 : Cancun, Mexico)
Conference location Cancun, Mexico
Conference dates 28-31 Mar. 2011
Title of proceedings WCNC 2011 : IEEE Wireless Communications and Networking Conference
Editor(s) [Unknown]
Publication date 2011
Conference series IEEE Wireless Communications and Networking Conference
Start page 416
End page 421
Publisher IEEE
Place of publication Piscataway, N. J.
Keyword(s) encoding
network coding
receivers
relays
throughput
transmitters
wireless networks
Summary Network coding has shown the promise of significant throughput improvement. In this paper, we study the throughput of two-hop wireless network coding and explore how the maximum throughput can be achieved under a random medium access scheme. Unlike previous studies, we consider a more practical network where the structure of overhearing status between the intended receivers and the transmitters is arbitrary. We make a formal analysis on the network throughput using network coding upon the concept of network coding cliques (NCCs). The analysis shows that the maximum normalized throughput, subject to fairness requirement, is n/n+m, where n is the number of transmitters and m is the number of NCCs in a 2-hop wireless network. We have also found that this maximum throughput can be achieved under a random medium access scheme when the medium access priority of the relay node is equal to the number of NCCs in the network. Our theoretical findings have been validated by simulation as well.
ISBN 9781612842547
9781612842554
ISSN 1525-3511
Language eng
Field of Research 080401 Coding and Information Theory
Socio Economic Objective 890399 Information Services not elsewhere classified
HERDC Research category E1 Full written paper - refereed
HERDC collection year 2011
Copyright notice ©2011, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30042202

Document type: Conference Paper
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Versions
Version Filter Type
Access Statistics: 46 Abstract Views, 8 File Downloads  -  Detailed Statistics
Created: Tue, 14 Feb 2012, 15:16:11 EST