Frost, VictorBaird, Ralph2016-01-012016-01-012015-05-312015http://dissertations.umi.com/ku:13956https://hdl.handle.net/1808/19375A 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 given53 pagesenCopyright held by the author.Information technologyComputer scienceEngineeringGRAPH THEORYISOMOMRPHISMMANETMobile Ad Hoc Networkns3Routing ProtocolThesisopenAccess