Papers
Topics
Authors
Recent
Search
2000 character limit reached

Throughput Efficient Large M2M Networks through Incremental Redundancy Combining

Published 20 Nov 2016 in cs.IT and math.IT | (1611.06610v2)

Abstract: In this paper, we investigate the performance of incremental redundancy combining as a new cooperative relaying protocol for large M2M networks with opportunistic relaying. The nodes in the large M2M network are modeled by a Poisson Point Process, experience Rayleigh fading and utilize slotted ALOHA as the MAC protocol. The progress rate density (PRD) of the M2M network is used to quantify the performance of proposed relaying protocol and compare it to conventional multihop relaying with no cooperation. It is shown that incremental redundancy combining in a large M2M network provides substantial throughput improvements over conventional relaying with no cooperation at all practical values of the network parameters.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Authors (2)

Collections

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