Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Computer Engineering

Leveraging Peer-To-Peer Energy Sharing For Resource Optimization In Mobile Social Networks, Aashish Dhungana Jan 2020

Leveraging Peer-To-Peer Energy Sharing For Resource Optimization In Mobile Social Networks, Aashish Dhungana

Theses and Dissertations

Mobile Opportunistic Networks (MSNs) enable the interaction of mobile users in the vicinity through various short-range wireless communication technologies (e.g., Bluetooth, WiFi) and let them discover and exchange information directly or in ad hoc manner. Despite their promise to enable many exciting applications, limited battery capacity of mobile devices has become the biggest impediment to these appli- cations. The recent breakthroughs in the areas of wireless power transfer (WPT) and rechargeable lithium batteries promise the use of peer-to-peer (P2P) energy sharing (i.e., the transfer of energy from the battery of one member of the mobile network to the battery of …


Assessment Of Structure From Motion For Reconnaissance Augmentation And Bandwidth Usage Reduction, Jonathan B. Roeber Mar 2018

Assessment Of Structure From Motion For Reconnaissance Augmentation And Bandwidth Usage Reduction, Jonathan B. Roeber

Theses and Dissertations

Modern militaries rely upon remote image sensors for real-time intelligence. A typical remote system consists of an unmanned aerial vehicle, or UAV, with an attached camera. A video stream is sent from the UAV, through a bandwidth-constrained satellite connection, to an intelligence processing unit. In this research, an upgrade to this method of collection is proposed. A set of synthetic images of a scene captured by a UAV in a virtual environment is sent to a pipeline of computer vision algorithms, collectively known as Structure from Motion. The output of Structure from Motion, a three-dimensional model, is then assessed in …


Handshaking Protocols And Jamming Mechanisms For Blind Rendezvous In A Dynamic Spectrum Access Environment, Aaron A. Gross Mar 2010

Handshaking Protocols And Jamming Mechanisms For Blind Rendezvous In A Dynamic Spectrum Access Environment, Aaron A. Gross

Theses and Dissertations

Blind frequency rendezvous is an important process for bootstrapping communications between radios without the use of pre-existing infrastructure or common control channel in a Dynamic Spectrum Access (DSA) environment. In this process, radios attempt to arrive in the same frequency channel and recognize each other’s presence in changing, under-utilized spectrum. This paper refines existing blind rendezvous techniques by introducing a handshaking algorithm for setting up communications once two radios have arrived in the same frequency channel. It then investigates the effect of different jamming techniques on blind rendezvous algorithms that utilize this handshake. The handshake performance is measured by determining …


The Modular Clock Algorithm For Blind Rendezvous, Nicholas C. Theis Mar 2009

The Modular Clock Algorithm For Blind Rendezvous, Nicholas C. Theis

Theses and Dissertations

This thesis examines the problem in initializing communications whereby cognitive radios need to find common spectrum with other cognitive radios, a process known as frequency rendezvous. It examines the rendezvous problem as it exists in a dynamic spectrum access cognitive network. Specifically, it addresses the problem of rendezvous in an infrastructureless environment. A new algorithm, the modular clock algorithm, is developed and analyzed as a solution for the simple rendezvous environment model, coupled with a modified version for environment models with less information. The thesis includes a taxonomy of commonly used environment models, and analysis of previous efforts to solve …


Use Of Tabu Search In A Solver To Map Complex Networks Onto Emulab Testbeds, Jason E. Macdonald Mar 2007

Use Of Tabu Search In A Solver To Map Complex Networks Onto Emulab Testbeds, Jason E. Macdonald

Theses and Dissertations

The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources. This research uses tabu search to find near-optimal physical topology solutions to user experiments consisting of scale-free complex networks. While simulated annealing arrives at solutions almost exclusively by chance, tabu search incorporates the use of memory and other techniques to guide the search towards good solutions. Both search algorithms are compared to determine whether tabu search can produce equal or higher quality solutions than simulated annealing in a shorter amount of time. It …