Elkin Urrea

Genetic algorithms for self-spreading nodes in MANETs

We present a force-based genetic algorithm for self-spreading mobile nodes uniformly over a geographical area. Wireless mobile nodes adjust their speed and direction using a genetic algorithm, where each mobile node exchanges its genetic information of speed and direction encoded in its chromosomes with the neighboring nodes. Simulation experiments show encouraging results for the performance of our force-based genetic algorithm with respect to normalized area coverage..

Bio-inspired topology control for knowledge sharing mobile agents

We present different approaches for knowledge sharing bio-inspired mobile agents to obtain a uniform distribution of the nodes over a geographical terrain. In this application, the knowledge sharing agents in a mobile ad hoc network adjust their speed and directions based on genetic algorithms (GAs). With an analytical model, we show that the best fitness value is obtained when the number of neighbors for a mobile agent is equal to the mean node degree. The genetic information that each mobile agent exchanges with other neighboring agents within its communication range includes the nodes location, speed, and movement direction. We have implemented a simulation software to study the effectiveness of different GA-based algorithms for network performance metrics including node densities, speed, and number of generations that a GA runs. Compared to random-walk and Hill Climbing approaches, all GA-based cases show encouraging results by converging towards a uniform node distribution.

Uniform distribution of mobile agents using genetic algorithms for military applications in MANETs

There has been increased research interest in providing uniform distribution of autonomous mobile nodes controlled by active running software agents over an unknown geographical area in mobile ad-hoc networks (MANETs). This problem becomes more challenging under the harsh and bandwidth limited conditions imposed by military applications. In this framework, the software agent running at the application layer for each autonomous mobile node adjusts its direction and speed by using local information from its neighbors. A genetic algorithm (GA) is used by each node to select the ldquofitterrdquo speed and direction options among exponentially large number of choices converging towards a uniform distribution. For a military application example, consider that in the observed occurrence of a threat situation, if the number of autonomous mobile agents change with time (e.g., losing assets during an operation), the remaining agents should reposition themselves to compensate the lost in coverage and network connectivity. We implemented simulation software to evaluate the effectiveness of GAs within these types of military applications. The results show that GAs can be applied to autonomous mobile nodes and are an effective tool for providing a robust solution for network area coverage under restrained communication conditions.

Self organization for area coverage maximization and energy conservation in mobile ad hoc networks

Mobile Ad hoc Networks (manets) are widely used for a large number of strategic applications from military to commercial tasks including disaster area discovery, mine field clearing, and transportation systems. In realistic applications, it is not feasible to deploy mobile nodes manually or using a centralized controller. We provide a nature-inspired approach to achieve self-organization of mobile nodes over unknown terrains. In this framework, each mobile node uses a genetic algorithm as a self-distribution mechanism to decide its next speed and movement direction to obtain a uniform distribution. We present a formal analysis of the effectiveness of our genetic algorithm and introduce an inhomogeneous Markov chain model to prove its convergence. The experiment results from our simulation software and our vmware-based testbed show that our nature-inspired algorithm delivers promising results for uniform distribution of mobile nodes over unknown terrains.

Analysis of Emergent Behavior for GA-based Topology Control Mechanism for Self-Spreading Nodes in MANETs

We introduce a genetic algorithm based MANET topology control mechanism to be used in decision making process of adaptive and autonomic systems at run time. A mobile node adapts its speed and direction using limited information collected from local neighbors operating in an unknown geographical terrain. We represent the genetic operators (i.e., selection, crossover and mutation) as a dynamical system model to describe the behavior of a single node’s decision mechanism. In this dynamical system model each mobile node is viewed as a stochastic variable. We build a homogeneous Markov chain to study the convergent nature of multiple mobile nodes running our algorithm, called FGA. Each state in our chain represents a configuration of the nodes in a MANET for a given instant. The homogeneous Markov chain model of our FGA is shown to be ergodic; its convergence is demonstrated using Dobrushin’s contraction coefficients. We also observe that the nodes with longer communication ranges utilize more information about their neighborhood to make better decisions, require less movement and converge faster, whereas smaller communication ranges utilize limited information, take more time to escape local optima, and, hence, consume more energy.

Formal convergence analysis for bio-inspired topology control in MANETs

We present a convergence analysis of a genetic algorithm based topological control mechanism for the decision making process of evolutionary and autonomous systems that adaptively reconfigures spatial configuration in mobile ad hoc networks (MANETs). Mobile nodes adjust their speed and direction using information collected from the local neighborhood environment in unknown geography. We extend the stochastic model of the genetic operators (i.e., selection, crossover and mutation) called the dynamical system model that represents the behavior of a single nodes decision mechanism in the network viewed as a stochastic variable. We introduce an ergodic homogeneous Markov chain to analyze the convergent nature of multiple mobile nodes running our algorithm, called the Force-based Genetic Algorithm (FGA). Here, a state represents an instantaneous spatial configuration of nodes in a MANET. It is shown that the Markov chain model of our FGA is ergodic and its convergence is shown using Dobrushins contraction coefficients. It is observed that scenarios where nodes have small communication ranges compared to their movement range converge quicker than larger ones due the limited information they have of their neighborhood, making movement decisions simpler, thus conserving energy.

Estimating behavior of a GA-based topology control for self-spreading nodes in MANETs

This paper presents a dynamical system model for FGA, a force-based genetic algorithm, which is used as decentralized topology control mechanism among active running software agents to achieve a uniform spread of autonomous mobile nodes over an unknown geographical area. Using only local information, FGA guides each node to select a fitter location, speed and direction among exponentially large number of choices, converging towards a uniform node distribution. By treating a genetic algorithm (GA) as a dynamical system we can analyze it in terms of its trajectory in the space of possible populations. We use Voses theoretical model to calculate the cumulative effects of GA operators of selection, mutation, and crossover as a population evolves through generations. We show that FGA converges toward a significantly higher area coverage as it evolves.

Convergence analysis of genetic algorithms for topology control in MANETs

We describe and verify convergence properties of our forced-based genetic algorithm (FGA) as a decentralized topology control mechanism distributed among software agents. FGA uses local information to guide autonomous mobile nodes over an unknown geographical terrain to obtain a uniform node distribution. Analyzing the convergence characteristics of FGA is difficult due to the stochastic nature of GA-based algorithms. Ergodic homogeneous Markov chains are used to describe the convergence characteristics of our FGA. In addition, simulation experiments verify the convergence of our GA-based algorithm.

Resilient node self-positioning methods for MANETS based on game theory and genetic algorithms

We present a distributed and scalable game participated by autonomous MANET nodes to place themselves uniformly over a dynamically changing environment. A node spreading potential game, called Rel-NSPG, run at each node, autonomously makes movement decisions based on localized data while the best next location to move is selected by a genetic algorithm (GA). Since it requires only a limited synchronization among the closest neighbors of a player, and does not require a priori knowledge of the environment, Rel-NSPG is a good candidate for node spreading class of applications used in military tasks. The performance of Rel-NSPG degrades gracefully when the number of MANET nodes decrease either due to equipment malfunction or hostile activities. We show that this resilience to loss of nodes is inherent in Rel-NSPG. Simulation experiments demonstrate that, after a subset of the MANET nodes arbitrarily become unavailable, the remaining nodes recover and offset lost nodes. Similarly, when there are losses concentrated in a given region, remaining nodes reconfigure their positions to compensate for the missing area coverage. The simulation experiments with arbitrarily placed obstacles, in addition to lost assests, produce promising results.

Applications of game theory to mobile ad hoc networks: Node spreading potential game

Sustaining a complete and accurate information about MANET nodes is often impractical due to dynamic topology, lack of centralized authority, decentralized architecture and heterogeneous nodes in MANETs. Main concerns for MANET performance are power consumption, topology control, spectrum sharing, and localization, all of which are intensified by node mobility. Another inherent characteristic of mobile nodes in MANETs is that they have limited or no cooperation among themselves, and their motivations are often selfish with conflicting individual interests. We present a distributed game for obtaining a uniform node distribution among the MANET nodes over a given geographical territory. We show that our potential game can be an effective mechanism for distributed tasks such as uniform node distribution.