An Optimal Location Allocation by Multi-User Cooperative Mobility for Maximizing Throughput in MANETs

User cooperative mobility is a new approach to improve system throughput in mobile ad hoc networks (MANETs). Compared with traditional technologies such as expanding link bandwidth and promoting transmission protocol efficiency, this new method significantly reduces the cost of communication infrastructure, protocol complexity, and energy consumption through the mobility of helpers or collaborators. Nevertheless, diverse challenges, especially multiple user cooperative mobility in practical application, become a significant issue. Currently, most of the propositions assume a single mobility user and do not interpret the multiple user cooperative mobility scenarios. This paper proposes a new algorithm, called Maximum Throughput algorithm for Optimal Position (MTOP), based on the known geographic location information of fixed users. In this algorithm, the lower and upper bounds are derived to determine the search space domain based on feasible location assembles. Furthermore, we define a conflict set of locations graph (CSLG) to prove this proposition that the domain includes the optimal location-allocation. Finally, the simulation results show that the throughput of MTOP is increased by 298.81%, 37.91%, and 23.04%, respectively, compared with the intuitive method, simulated annealing algorithm, and game theory method. Our proposed algorithm is confirmed to be effective in improving throughput, reducing complexity, and overhead in multiple user cooperative mobility systems.