Research Article
Achievable Region in Slotted ALOHA Throughput for One-Relay Two-Hop Wireless Network Coding
@INPROCEEDINGS{10.1007/978-3-642-11723-7_25, author={Daisuke Umehara and Satoshi Denno and Masahiro Morikura and Takatoshi Sugiyama}, title={Achievable Region in Slotted ALOHA Throughput for One-Relay Two-Hop Wireless Network Coding}, proceedings={Ad Hoc Networks. First International Conference, ADHOCNETS 2009, Niagara Falls, Ontario, Canada, September 22-25, 2009. Revised Selected Papers}, proceedings_a={ADHOCNETS}, year={2012}, month={7}, keywords={one-relay two-hop wireless network slotted ALOHA network coding throughput packet delay queueing system}, doi={10.1007/978-3-642-11723-7_25} }- Daisuke Umehara
Satoshi Denno
Masahiro Morikura
Takatoshi Sugiyama
Year: 2012
Achievable Region in Slotted ALOHA Throughput for One-Relay Two-Hop Wireless Network Coding
ADHOCNETS
Springer
DOI: 10.1007/978-3-642-11723-7_25
Abstract
This paper presents achievable regions in slotted ALOHA throughput both without and with network coding for one-relay two-hop wireless networks between two end node groups. In this paper, there are no restrictions on the total traffic and the number of end nodes per group. It follows that the relay node will be generally involved with asymmetric bidirectional traffic. This paper derives closed-form expressions of the throughput and packet delay per group both without and with network coding from a theoretical perspective regardless of whether the buffer on the relay node is saturated or not. Furthermore, we show that the maximum throughput per group with network coding can be achieved at the boundary of the relay buffer saturation and unsaturation which is expressed as the solution of a polynomial equation in two group node traffics. As a result, we clarify the enhancement of the achievable region in slotted ALOHA throughput by applying network coding.