Markov chain analysis of self-organizing mobile nodes self-organizing mobile nodes

DOI10.1007/S10846-011-9649-2zbMath1245.68230OpenAlexW1536909178MaRDI QIDQ444793

Stephen Gundry, Cem Şafak Şahin, M. Ümit Uyar

Publication date: 24 August 2012

Published in: Journal of Intelligent \& Robotic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10846-011-9649-2

zbMATH Keywords

genetic algorithmshomogeneous Markov chainmobile ad hoc networkstopology controldobrushin contraction coefficientsspatial node distribution

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40) Stochastic and other probabilistic methods applied to problems in solid mechanics (74S60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Markov chain that models genetic algorithms in noisy environments
• Static and expanding grid coverage with ant robots: complexity results
• Guide to wireless mesh networks
• A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
• Modeling genetic algorithms with Markov chains.
• Global annealing genetic algorithm and its convergence analysis

This page was built for publication: Markov chain analysis of self-organizing mobile nodes self-organizing mobile nodes