Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Effective Mobile Routing Through Dynamic Addressing, Heungsoon Park
Effective Mobile Routing Through Dynamic Addressing, Heungsoon Park
Theses and Dissertations
Military communications has always been an important factor in military victory and will surely play an important part in future combat. In modern warfare, military units are usually deployed without existing network infrastructure. The IP routing protocol, designed for hierarchical networks cannot easily be applied in military networks due to the dynamic topology expected in military environments. Mobile ad-hoc networks (MANETs) represent an appropriate network for small military networks. But, most ad-hoc routing protocols suffer from the problem of scalability for large networks. Hierarchical routing schemes based on the IP address structure are more scalable than ad-hoc routing but are …
Distributed Fault-Tolerant Quality Of Service Routing In Hybrid Directional Wireless Networks, Larry C. Llewellyn Ii
Distributed Fault-Tolerant Quality Of Service Routing In Hybrid Directional Wireless Networks, Larry C. Llewellyn Ii
Theses and Dissertations
This thesis presents a distributed fault-tolerant routing protocol (EFDCB) for QoS supporting hybrid mobile ad hoc networks with the aim of mitigating QoS disruption time when network failures occur. The experimental design presented in this thesis describes 22 experiments aimed at illustrating EFDCB's ability to handle fault-tolerance. The interpreted results show that EFDCB excels over a global rerouting protocol at this challenge which is the goal of this work.
Performance Evaluation Of Ad Hoc Routing In A Swarm Of Autonomous Aerial Vehicles, Matthew T. Hyland
Performance Evaluation Of Ad Hoc Routing In A Swarm Of Autonomous Aerial Vehicles, Matthew T. Hyland
Theses and Dissertations
This thesis investigates the performance of three mobile ad hoc routing protocols in the context of a swarm of autonomous unmanned aerial vehicles (UAVs). It is proposed that a wireless network of nodes having an average of 5.1774 log n neighbors, where n is the total number of nodes in the network, has a high probability of having no partitions. By decreasing transmission range while ensuring network connectivity, and implementing multi-hop routing between nodes, spatial multiplexing is exploited whereby multiple pairs of nodes simultaneously transmit on the same channel. The proposal is evaluated using the Greedy Perimeter Stateless Routing (GPSR), …