Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Computer Engineering
Hot Swapping Protocol Implementations In The Opnet Modeler Development Environment, Mark E. Coyne
Hot Swapping Protocol Implementations In The Opnet Modeler Development Environment, Mark E. Coyne
Theses and Dissertations
This research effort demonstrates hot swapping protocol implementations in OPNET via the building of a dependency injection testing framework. The thesis demonstrates the externalization (compiling as stand-alone code) of OPNET process models, and their inclusion into custom DLL's (Dynamically Linked Libraries). A framework then utilizes these process model DLL's, to specify, or “inject,” process implementations post-compile time into an OPNET simulation. Two separate applications demonstrate this mechanism. The first application is a toolkit that allows for the testing of multiple routing related protocols in various combinations without code re-compilation or scenario re-generation. The toolkit produced similar results as the same …
Scripted Mobile Network Routing In A Contested Environment, Anthony R. Otto
Scripted Mobile Network Routing In A Contested Environment, Anthony R. Otto
Theses and Dissertations
Mobile wireless network protocols currently run on optimistic routing algorithms, adjusting node connectivity only when the chosen connectivity metrics, such as signal strength, pass beyond minimum thresholds. Optimistic routing has several weaknesses. Optimistic routing suffers from increased network overhead during increased frequency of node movement and increased node density per area, and optimistic routing also suffers from non-optimistic access change for individual nodes. The overall communication throughput of a network may be increased if the network topology change is scripted; a scripted plan can allow messages to travel along a more efficient topological path while creating less topology control traffic. …
Performance Analysis And Comparison Of Multiple Routing Protocols In A Large-Area, High Speed Mobile Node Ad Hoc Network, Daniel K. Roberts
Performance Analysis And Comparison Of Multiple Routing Protocols In A Large-Area, High Speed Mobile Node Ad Hoc Network, Daniel K. Roberts
Theses and Dissertations
The U.S. Air Force is interested in developing a standard ad hoc framework using "heavy" aircraft to route data across large regions. The Zone Routing Protocol (ZRP) has the potential to provide seamless large-scale routing for DOD under the Joint Tactical Radio System program. The goal of this study is to determine if there is a difference between routing protocol performance when operating in a large-area MANET with high-speed mobile nodes. This study analyzes MANET performance when using reactive, proactive, and hybrid routing protocols, specifically AODV, DYMO, Fisheye, and ZRP. This analysis compares the performance of the four routing protocols …
Overcoming Tcp Degradation In The Presence Of Multiple Intermittent Link Failures Utilizing Intermediate Buffering, Duane F. Harmon
Overcoming Tcp Degradation In The Presence Of Multiple Intermittent Link Failures Utilizing Intermediate Buffering, Duane F. Harmon
Theses and Dissertations
It is well documented that assumptions made in the popular Transmission Control Protocol's (TCP) development, while essential in the highly reliable wired environment, are incompatible with today's wireless network realities in what we refer to as a challenged environment. Challenged environments severely degrade the capability of TCP to establish and maintain a communication connection with reasonable throughput. This thesis proposes and implements an intermediate buffering scheme, implemented at the transport layer, which serves as a TCP helper protocol for use in network routing equipment to overcome short and bursty, but regular, link failures. Moreover, the implementation requires no modifications to …
Geolocation Of A Node On A Local Area Network, John R. Clarson
Geolocation Of A Node On A Local Area Network, John R. Clarson
Theses and Dissertations
Geolocation is the process of identifying a node using only its Internet Protocol (IP) address. Locating a node on a LAN poses particular challenges due to the small scale of the problem and the increased significance of queuing delay. This study builds upon existing research in the area of geolocation and develops a heuristic tailored to the difficulties inherent in LANs called the LAN Time to Location Heuristic (LTTLH). LTTLH uses several polling nodes to measure latencies to end nodes, known locations within the LAN. The Euclidean distance algorithm is used to compare the results with the latency of a …