Genetic Algorithms for Topology Control Problems

Cem Sahin

ISBN 10: 3844309020 / ISBN 13: 9783844309027

Published by LAP LAMBERT Academic Publishing Feb 2011, 2011

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -This book present a bio-inspired topology control mechanism, force-based genetic algorithm (FGA), where a GA is run by each mobile node to achieve a uniform spread of nodes and to provide a fully connected network over an unknown area. We provide a formal analysis of FGA in terms of convergence speed, uniformity at area coverage, and Lyapunov stability theorem. This work also emphasizes the use of nodes to achieve a uniform distribution over an unknown terrain without a priori information. In contrast, each node running our FGA has to make its own movement direction and speed decisions based on local neighborhood information, such as obstacles and the number of neighbors, without a centralized control unit or global knowledge. The stochastic behavior of FGA makes it difficult to analyze its convergence speed. We built metrically transitive homogeneous and inhomogeneous Markov chain models to analyze the convergence of our FGA with respect to the communication ranges of mobile nodes and the total number of nodes in the system. The Dobrushin contraction coefficient of ergodicity is used for measuring convergence speed for the Markov chain models of our FGA. 136 pp. Englisch.

Seller Inventory # 9783844309027

Bibliographic Details

• Title: Genetic Algorithms for Topology Control Problems
• Publisher: LAP LAMBERT Academic Publishing Feb 2011
• Publication Date: 2011
• Language: English
• ISBN 10: 3844309020
• ISBN 13: 9783844309027
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 9D millimeters 220 millimeters width by 150 millimeters height by 9 millimeters depth
• Weight: 221 grams

About this title

Synopsis

This book present a bio-inspired topology control mechanism, force-based genetic algorithm (FGA), where a GA is run by each mobile node to achieve a uniform spread of nodes and to provide a fully connected network over an unknown area. We provide a formal analysis of FGA in terms of convergence speed, uniformity at area coverage, and Lyapunov stability theorem. This work also emphasizes the use of nodes to achieve a uniform distribution over an unknown terrain without a priori information. In contrast, each node running our FGA has to make its own movement direction and speed decisions based on local neighborhood information, such as obstacles and the number of neighbors, without a centralized control unit or global knowledge. The stochastic behavior of FGA makes it difficult to analyze its convergence speed. We built metrically transitive homogeneous and inhomogeneous Markov chain models to analyze the convergence of our FGA with respect to the communication ranges of mobile nodes and the total number of nodes in the system. The Dobrushin contraction coefficient of ergodicity is used for measuring convergence speed for the Markov chain models of our FGA.

About the Author

Cem ?afak ?ahin, Ph.D.: received his BS degree from Gazi University, Turkey in 1996, MS degree from Middle East Technical University, Turkey in 2000, and MPhil. and Ph.D. degrees from the City University of New York, USA in 2010, all in Electrical Engineering. He is currently with the Strategic Analysis and Testing team at American Express.