Isomorphic Routing Protocol
Issue Date
2015-05-31Author
Baird, Ralph
Publisher
University of Kansas
Format
53 pages
Type
Thesis
Degree Level
M.S.
Discipline
Information Technology
Rights
Copyright held by the author.
Metadata
Show full item recordAbstract
A mobile ad-hoc network (MANET) routing algorithm defines the path packets take to reach their destination using measurements of attributes such as adjacency and distance. Graph theory is applied to networks to form structures from patterns of nodes. Isomorphism measures equality beginning in the individual node and in sets of nodes and edges. The measurement of isomorphism is applied in this research to form paths from an aggregate set of route inputs, such as adjacency, cardinality, and network width. The path is constrained to increase in connectivity and centrality. A routing protocol is then developed that is based on the presence of isomorphism in a MANET topology. A series of simulation experiments are then conducted in the ns-3 simulator to measure the performance of the routing protocol proposed here. Finally, suggestions for future improvements are given
Collections
- Engineering Dissertations and Theses [1055]
- Theses [3942]
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.