Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Application Of Optimization Techniques To Spectrally Modulated, Spectrally Encoded Waveform Design, Todd W. Beard
Application Of Optimization Techniques To Spectrally Modulated, Spectrally Encoded Waveform Design, Todd W. Beard
Theses and Dissertations
A design process is demonstrated for a coexistent scenario containing Spectrally Modulated, Spectrally Encoded (SMSE) and Direct Sequence Spread Spectrum (DSSS) signals. Coexistent SMSE-DSSS designs are addressed under both perfect and imperfect DSSS code tracking conditions using a non-coherent delay-lock loop (DLL). Under both conditions, the number of SMSE subcarriers and subcarrier spacing are the optimization variables of interest. For perfect DLL code tracking conditions, the GA and RSM optimization processes are considered independently with the objective function being end-to-end DSSS bit error rate. A hybrid GA-RSM optimization process is used under more realistic imperfect DLL code tracking conditions. In …
Dialable Cryptography For Wireless Networks, Marnita T. Eaddie
Dialable Cryptography For Wireless Networks, Marnita T. Eaddie
Theses and Dissertations
The objective of this research is to develop an adaptive cryptographic protocol, which allows users to select an optimal cryptographic strength and algorithm based upon the hardware and bandwidth available and allows users to reason about the level of security versus the system throughput. In this constantly technically-improving society, the ability to communicate via wireless technology provides an avenue for delivering information at anytime nearly anywhere. Sensitive or classified information can be transferred wirelessly across unsecured channels by using cryptographic algorithms. The research presented will focus on dynamically selecting optimal cryptographic algorithms and cryptographic strengths based upon the hardware and …
A Novel Communications Protocol Using Geographic Routing For Swarming Uavs Performing A Search Mission, Robert L. Lidowski
A Novel Communications Protocol Using Geographic Routing For Swarming Uavs Performing A Search Mission, Robert L. Lidowski
Theses and Dissertations
This research develops the UAV Search Mission Protocol (USMP) for swarming UAVs and determines the protocol's effect on search mission performance. It is hypothesized that geographically routing USMP messages improves search performance by providing geography-dependent data to locations where it impacts search decisions. It is also proposed that the swarm can use data collected by the geographic routing protocol to accurately determine UAV locations and avoid sending explicit location updates. The hypothesis is tested by developing several USMP designs that are combined with the Greedy Perimeter Stateless Routing (GPSR) protocol and a search mission swarm logic into a single network …
Priority Based Buffering Over Multiple Lossy Links Using Tcp Aware Layer Buffering, Kevin J. Savidge
Priority Based Buffering Over Multiple Lossy Links Using Tcp Aware Layer Buffering, Kevin J. Savidge
Theses and Dissertations
Wireless military information systems require high reliability, which is difficult to achieve in adverse conditions. To provide high reliability, one must overcome packet loss across multiple wireless hops. Buffering packets in a lossy environment is well explored; however, the ability to selectively buffer TCP traffic across multiple lossy links is a new area of research. This document seeks to explore the delivery of high priority traffic in a lossy environment and conclude that prioritized buffing can increase the probability that a high priority download will finish, where others will fail. It is shown that buffering provides six times the throughput …
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. …