Throughput Efficient Large M2M Networks through Incremental Redundancy Combining
Amogh Rajanna, Mos Kaveh

TL;DR
This paper proposes a new cooperative relaying protocol using incremental redundancy combining for large M2M networks, demonstrating significant throughput improvements over traditional non-cooperative multihop relaying.
Contribution
It introduces a novel incremental redundancy combining protocol and evaluates its performance in large M2M networks modeled by Poisson Point Processes.
Findings
Incremental redundancy combining significantly increases throughput.
The protocol outperforms conventional multihop relaying.
Performance gains are substantial at practical network parameters.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpportunistic and Delay-Tolerant Networks · Cooperative Communication and Network Coding · Mobile Ad Hoc Networks
