Throughput analysis of two-hop wireless CSMA network coding

Daisuke Umehara, Satoshi Denno, Masahiro Morikura, Takatoshi Sugiyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

This paper considers two-hop wireless systems employing network coding and a carrier sense multiple access (CSMA) protocol. Network coding is a recent and highly regarded technology for the capacity enhancement of multiple unicast and multisource multicast networks. The two-hop wireless CSMA systems are often involved with the hidden node problem, but the impact of the hidden nodes on network coding has not been analyzed in theory. This paper provides explicit expressions of the throughput for single-relay two-hop wireless CSMA systems both without and with network coding. The throughput can be obtained from these expressions for given system parameters even when end nodes via the relay node are hidden each other. Furthermore it is shown that the transmit probability of the relay node is a design parameter that is crucial for maximizing the achievable throughput for CSMA systems with network coding. It is clarified that the throughput for CSMA systems can be enhanced as compared with that for slotted ALOHA systems in case of non-hidden end nodes whereas it deteriorates considerably in case of hidden end nodes.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 IEEE International Conference on Communications, ICC 2010 - Cape Town, South Africa
Duration: May 23 2010May 27 2010

Other

Other2010 IEEE International Conference on Communications, ICC 2010
CountrySouth Africa
CityCape Town
Period5/23/105/27/10

Fingerprint

Carrier sense multiple access
Network coding
Throughput
Network protocols

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Umehara, D., Denno, S., Morikura, M., & Sugiyama, T. (2010). Throughput analysis of two-hop wireless CSMA network coding. In IEEE International Conference on Communications [5502114] https://doi.org/10.1109/ICC.2010.5502114

Throughput analysis of two-hop wireless CSMA network coding. / Umehara, Daisuke; Denno, Satoshi; Morikura, Masahiro; Sugiyama, Takatoshi.

IEEE International Conference on Communications. 2010. 5502114.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Umehara, D, Denno, S, Morikura, M & Sugiyama, T 2010, Throughput analysis of two-hop wireless CSMA network coding. in IEEE International Conference on Communications., 5502114, 2010 IEEE International Conference on Communications, ICC 2010, Cape Town, South Africa, 5/23/10. https://doi.org/10.1109/ICC.2010.5502114
Umehara D, Denno S, Morikura M, Sugiyama T. Throughput analysis of two-hop wireless CSMA network coding. In IEEE International Conference on Communications. 2010. 5502114 https://doi.org/10.1109/ICC.2010.5502114
Umehara, Daisuke ; Denno, Satoshi ; Morikura, Masahiro ; Sugiyama, Takatoshi. / Throughput analysis of two-hop wireless CSMA network coding. IEEE International Conference on Communications. 2010.
@inproceedings{17a47ac6e255463d88c1431471ca3c3b,
title = "Throughput analysis of two-hop wireless CSMA network coding",
abstract = "This paper considers two-hop wireless systems employing network coding and a carrier sense multiple access (CSMA) protocol. Network coding is a recent and highly regarded technology for the capacity enhancement of multiple unicast and multisource multicast networks. The two-hop wireless CSMA systems are often involved with the hidden node problem, but the impact of the hidden nodes on network coding has not been analyzed in theory. This paper provides explicit expressions of the throughput for single-relay two-hop wireless CSMA systems both without and with network coding. The throughput can be obtained from these expressions for given system parameters even when end nodes via the relay node are hidden each other. Furthermore it is shown that the transmit probability of the relay node is a design parameter that is crucial for maximizing the achievable throughput for CSMA systems with network coding. It is clarified that the throughput for CSMA systems can be enhanced as compared with that for slotted ALOHA systems in case of non-hidden end nodes whereas it deteriorates considerably in case of hidden end nodes.",
author = "Daisuke Umehara and Satoshi Denno and Masahiro Morikura and Takatoshi Sugiyama",
year = "2010",
doi = "10.1109/ICC.2010.5502114",
language = "English",
isbn = "9781424464043",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Throughput analysis of two-hop wireless CSMA network coding

AU - Umehara, Daisuke

AU - Denno, Satoshi

AU - Morikura, Masahiro

AU - Sugiyama, Takatoshi

PY - 2010

Y1 - 2010

N2 - This paper considers two-hop wireless systems employing network coding and a carrier sense multiple access (CSMA) protocol. Network coding is a recent and highly regarded technology for the capacity enhancement of multiple unicast and multisource multicast networks. The two-hop wireless CSMA systems are often involved with the hidden node problem, but the impact of the hidden nodes on network coding has not been analyzed in theory. This paper provides explicit expressions of the throughput for single-relay two-hop wireless CSMA systems both without and with network coding. The throughput can be obtained from these expressions for given system parameters even when end nodes via the relay node are hidden each other. Furthermore it is shown that the transmit probability of the relay node is a design parameter that is crucial for maximizing the achievable throughput for CSMA systems with network coding. It is clarified that the throughput for CSMA systems can be enhanced as compared with that for slotted ALOHA systems in case of non-hidden end nodes whereas it deteriorates considerably in case of hidden end nodes.

AB - This paper considers two-hop wireless systems employing network coding and a carrier sense multiple access (CSMA) protocol. Network coding is a recent and highly regarded technology for the capacity enhancement of multiple unicast and multisource multicast networks. The two-hop wireless CSMA systems are often involved with the hidden node problem, but the impact of the hidden nodes on network coding has not been analyzed in theory. This paper provides explicit expressions of the throughput for single-relay two-hop wireless CSMA systems both without and with network coding. The throughput can be obtained from these expressions for given system parameters even when end nodes via the relay node are hidden each other. Furthermore it is shown that the transmit probability of the relay node is a design parameter that is crucial for maximizing the achievable throughput for CSMA systems with network coding. It is clarified that the throughput for CSMA systems can be enhanced as compared with that for slotted ALOHA systems in case of non-hidden end nodes whereas it deteriorates considerably in case of hidden end nodes.

UR - http://www.scopus.com/inward/record.url?scp=77955345534&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955345534&partnerID=8YFLogxK

U2 - 10.1109/ICC.2010.5502114

DO - 10.1109/ICC.2010.5502114

M3 - Conference contribution

AN - SCOPUS:77955345534

SN - 9781424464043

BT - IEEE International Conference on Communications

ER -