On Performance Modeling for MANETs under General Limited Buffer Constraint
Jia Liu, Yang Xu, Yulong Shen, Xiaohong Jiang, and Tarik Taleb

TL;DR
This paper develops a comprehensive performance modeling framework for MANETs with limited source and relay buffers, providing exact performance metrics and insights into buffer constraints' effects on network performance.
Contribution
It introduces a novel theoretical framework based on Queuing and birth-death chain theories for buffer-limited MANETs, applicable to various protocols and mobility models.
Findings
Derived exact expressions for throughput and delay.
Demonstrated buffer constraints significantly impact performance.
Validated models through simulations and case studies.
Abstract
Understanding the real achievable performance of mobile ad hoc networks (MANETs) under practical network constraints is of great importance for their applications in future highly heterogeneous wireless network environments. This paper explores, for the first time, the performance modeling for MANETs under a general limited buffer constraint, where each network node maintains a limited source buffer of size to store its locally generated packets and also a limited shared relay buffer of size to store relay packets for other nodes. Based on the Queuing theory and birth-death chain theory, we first develop a general theoretical framework to fully depict the source/relay buffer occupancy process in such a MANET, which applies to any distributed MAC protocol and any mobility model that leads to the uniform distribution of nodes' locations in steady state. With the help of this…
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.
