Performance Evaluation Framework Based on Multiuser Cooperative Mobility in MANETs

Three algorithms for multiuser mobility method are evaluated in terms of performance to derive the most suitable algorithms for different practical application scenarios. Traditional multiuser mobility methods focus on improving throughput performance only without considering algorithm execution overhead and complexity. In contrast to previous studies, this paper develops an analytical tradeoff framework for the throughput and algorithmic complexity evaluation based on multiuser cooperative mobility in Mobile Ad Hoc Networks (MANETs). On the one hand, we quantitatively derive and model the optimal strategy for optimization throughput. On the other hand, we jointly evaluate the complexity performance of proposed algorithms, which are demonstrated by the discrepancies in the number of users, movable range, and location distribution. Numerical simulations show that the game-theoretic algorithm provides 16.85% throughput gain with high user volume, the bound-algorithm offers 17.22% throughput gain at large movement ranges and the graph-algorithm can reduce 29.26% complexity, indicating the effectiveness of our proposed framework.