Decentralized schemes for clustering and routing in ad-hoc networks using neural networks
"Ad-hoc networks are formed in several applications. Rescue operations and multiple unmanned air vehicle applications are examples. These networks are dynamic in nature and hence conventional routing and clustering schemes are not suited for them. Most of the routing and clustering algorithms are heuristics based. One main disadvantage of such algorithms is that any form of optimization cannot be achieved more over stability and convergence properties cannot be guaranteed. In this study, new Grossberg neural network (GNN) based algorithms are presented for routing and clustering in ad-hoc networks. These algorithms are implemented in a decentralized manner and have very low computation and storage requirements. GNNs are dynamic in nature and hence are well suited for applications in ad-hoc networks"--Abstract, leaf iii.
Balakrishnan, S. N.
Mechanical and Aerospace Engineering
M.S. in Mechanical Engineering
National Science Foundation (U.S.)
University of Missouri--Rolla
ix, 73 leaves
© 2006 Vivek Yadav, All rights reserved.
Thesis - Citation
Library of Congress Subject Headings
Wireless communication systems -- Mathematical models
Neural networks (Computer science) -- Mathematical models
Routing (Computer network management)
Cluster analysis -- Computer programs
Print OCLC #
Link to Catalog Record
Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.http://laurel.lso.missouri.edu/record=b5848193~S5
Yadav, Vivek, "Decentralized schemes for clustering and routing in ad-hoc networks using neural networks" (2006). Masters Theses. 5860.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.