Game Theoretic and Bio-inspired Optimization Approach for Autonomous Movement of MANET Nodes

Abstract

We introduce a new node spreading bio-inspired game (BioGame) which combines genetic algorithms and traditional game theory. The goal of the BioGame is to maximize the area covered by mobile ad hoc network nodes to achieve a uniform node distribution while keeping the network connected. BioGame is fully distributed, scalable, and does not require synchronization among nodes. Each mobile node runs BioGame autonomously to make movement decisions based solely on local data. First, our force-based genetic algorithm (FGA) finds a set of preferred next locations to move. Next, favorable locations identified by FGA are evaluated by the spatial game set up among a moving node and its current neighbors. In this chapter, we present the FGA and the spatial game elements of our BioGame. We prove the basic properties of BioGame, including its convergence and area coverage characteristics. Simulation experiments demonstrate that BioGame performs well with respect to network area coverage, uniform distribution of mobile nodes, the total distance traveled by the nodes, and convergence speed. Our BioGame outperforms FGA and successfully distributes mobile nodes over an unknown geographical terrain without requiring global network information nor a synchronization among the nodes. BioGame is a good candidate for self-spreading autonomous nodes that provides a power-efficient solution for many military and civilian applications. © Springer-Verlag Berlin Heidelberg 2013.