Papers
Topics
Authors
Recent
2000 character limit reached

Exact Throughput Analysis of Random CoopMAC Networks in the Presence of Shadowing

Published 10 Nov 2016 in cs.NI | (1611.03336v2)

Abstract: The throughput performance of a random cooperative medium access control (CoopMAC) network in the presence of shadowing is considered. The nodes are assumed to be randomly distributed according to a homogeneous two-dimensional Poisson point process with constant intensity. The conditions under which a helper 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 random CoopMAC network that is subject to path loss and shadowing. This expression is then used to investigate the effects of shadowing, intensity of nodes and the distance between source and destination nodes on the cooperative throughput of the network. It is observed that the average cooperative throughput of the network increases only slightly when the intensity of helpers increases beyond a certain value.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.