Resource Allocation for Throughput Optimization in Buffer-Limited Mobile Ad Hoc Networks

This paper studies the throughput optimization for buffer-limited mobile ad hoc networks (MANETs) based on resource allocation policies. Specifically, we consider a practical MANET configuration where the total limited buffer space of a network node can be flexibly allocated to its source buffer and relay buffer, and a two-hop relay scheme with control parameter α is adopted for packet delivery. For such a MANET with any specific setting, i.e., the buffer space allocation and α are fixed, we first develop a theoretical framework to characterize the network dynamics to derive the exact expression of per node throughput. Based on this, we then propose efficient search methods to determine the optimum setting of α or/and buffer space allocation, for maximizing the per node throughput. Finally, extensive simulation and numerical results are provided to demonstrate the validity of our theoretical modeling and illustrate the effects of network resource allocation on throughput performance.

I. Introduction

The mobile ad hoc networks (MANETs) can be defined as a collection of self-autonomous mobile nodes, which communicate with each other via wireless links without infrastructure and centralized administration [1]. Due to their high flexibility and strong robustness, MANETs have become an appealing candidate for lots of critical applications like emergency rescue, military troop communication and traffic offloading for cellular networks, and thus are expected to be an indispensable component in future heterogeneous wireless network architecture [2], [3]. To facilitate the application and commercialization of MANETs, a thorough understanding of their fundamental performance is of great importance [4], [5].