Decentralized schemes for clustering and routing in ad-hoc networks using neural networks

Author

Vivek Yadav

Abstract

"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, page iii.

Advisor(s)

Balakrishnan, S. N.

Committee Member(s)

Leu, Ming
Sreeram, Ramakrishnan

Department(s)

Mechanical and Aerospace Engineering

Degree Name

M.S. in Mechanical Engineering

Sponsor(s)

National Science Foundation (U.S.)

Publisher

University of Missouri--Rolla

Publication Date

Fall 2006

Pagination

ix, 73 pages

Rights

© 2006 Vivek Yadav, All rights reserved.

Document Type

Thesis - Citation

File Type

text

Language

English

Subject Headings

Wireless communication systems -- Mathematical models
Neural networks (Computer science) -- Mathematical models
Routing (Computer network management)
Cluster analysis -- Computer programs

Thesis Number

T 9085

Print OCLC #

123899726

Link to Catalog Record

Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.

Recommended Citation

Yadav, Vivek, "Decentralized schemes for clustering and routing in ad-hoc networks using neural networks" (2006). Masters Theses. 5860.
https://scholarsmine.mst.edu/masters_theses/5860