Throughput capacity of two-hop relay MANETs under finite buffers

Since the seminal work of Grossglauser and Tse [1], the two-hop relay algorithm and its variants have been attractive for mobile ad hoc networks (MANETs) due to their simplicity and efficiency. However, most literature assumed an infinite buffer size for each node, which is obviously not applicable to a realistic MANET. In this paper, we focus on the exact throughput capacity study of two-hop relay MANETs under the practical finite relay buffer scenario. The arrival process and departure process of the relay queue are fully characterized, and an ergodic Markov chain-based framework is also provided. With this framework, we obtain the limiting distribution of the relay queue and derive the throughput capacity under any relay buffer size. Extensive simulation results are provided to validate our theoretical framework and explore the relationship among the throughput capacity, the relay buffer size and the number of nodes.

[1]  Edwin K. P. Chong,et al.  Throughput-storage tradeoff in ad hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[3]  Hans Daduna.  Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks , 2001 .

[4]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[5]  Xiaohong Jiang,et al.  Exact throughput capacity under power control in mobile ad hoc networks , 2012, 2012 Proceedings IEEE INFOCOM.

[6]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[7]  Michael J. Neely,et al.  Network Capacity Region and Minimum Energy Function for a Delay-Tolerant Mobile Ad Hoc Network , 2011, IEEE/ACM Transactions on Networking.

[8]  P. R. Kumar,et al.  Internets in the sky: capacity of 3D wireless networks , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[9]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[10]  Xiaohong Jiang,et al.  Delay and Capacity in Ad Hoc Mobile Networks with f-cast Relay Algorithms , 2011, IEEE Transactions on Wireless Communications.

[11]  Olle Häggström.  Finite Markov Chains and Algorithmic Applications , 2002 .

[12]  Xiaohong Jiang,et al.  Throughput Capacity of MANETs with Group-Based Scheduling and General Transmission Range , 2013, IEICE Trans. Commun..

[13]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.

[14]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[15]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  J. Woods,et al.  Probability and Random Processes with Applications to Signal Processing , 2001 .

[17]  Ahmad Al Hanbali,et al.  A survey of message diffusion protocols in mobile ad hoc networks , 2008, VALUETOOLS.

[18]  Eytan Modiano,et al.  Optimal Control of Wireless Networks with Finite Buffers , 2010, 2010 Proceedings IEEE INFOCOM.