Finite Markov Chain Analysis of Genetic Algorithms with Niching
Proceedings of the 5th International Conference on Genetic Algorithms
Global Convergence of Genetic Algorithms: A Markov Chain Analysis
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Distributed deployment algorithms for mobile wireless sensor networks
Distributed deployment algorithms for mobile wireless sensor networks
Image Analysis, Random Fields and Markov Chain Monte Carlo Methods: A Mathematical Introduction (Stochastic Modelling and Applied Probability)
A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm
Expert Systems with Applications: An International Journal
An adaptive gateway discovery for mobile ad hoc networks
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
Node connectivity index as mobility metric for GA based QoS routing in MANET
Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Genetic algorithms for self-spreading nodes in MANETs
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Optimizing quality of service of wireless mobile ad-hoc networks using evolutionary computation
Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead
A genetic algorithm on multi-sensor networks lifetime optimization
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Self organization for area coverage maximization and energy conservation in mobile ad hoc networks
Transactions on Computational Science XV
Hi-index | 0.00 |
We analyze the convergence properties of our force based genetic algorithm(fga) as a decentralized topology control mechanism distributed among software agents. fga guides autonomous mobile agents over an unknown geographical area to obtain a uniform node distribution. The stochastic behavior of fga makes it difficult to analyze the effects of various manet characteristics over its convergence rate. We present ergodic homogeneous Markov chains to analyze the convergence of our fga with respect to changing communication range of mobile nodes. Simulation experiments indicate that the increased communication range for the mobile nodes does not result in a faster convergence.