Open AccessExact throughput analysis of random cooperative medium access control networks in the presence of shadowing
Author(s) -
Nikbakht Homa,
Rabiei Amir Masoud,
ShahMansouri Vahid
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2017.0127
Subject(s) - throughput , computer science , poisson point process , poisson distribution , computer network , path (computing) , transmission (telecommunications) , point process , path loss , topology (electrical circuits) , mathematics , telecommunications , statistics , wireless , combinatorics
The throughput performance of a random cooperative medium access control (CoopMAC) network in the presence of shadowing and path loss is considered. The nodes are assumed to be distributed as a homogeneous two‐dimensional Poisson point process with constant intensity. The helpers are divided into several tiers each having a distinct operating region and a distinct cooperative throughput. Then, the conditions under which a helper in a particular tier can improve the transmission rate between a given pair of nodes are examined. Based on these conditions, an exact analytical expression is derived for the average cooperative throughput of a Poisson CoopMAC network that is subject to path loss and shadowing. The expression is then used to investigate the effects of shadowing, intensity of helpers and distance between source and destination nodes on the average cooperative throughput of the network.