Secure Cloud Controlled Software Defined Radio Network For Bandwidth Allocation

The purpose of this research is to investigate the impact of mobility of wireless devices for opportunistic spectrum access and communications using National Instrument Universal Software Radio Peripherals devices. The overall system utilizes software defined radio networks for frequency allocation, cloud connectivity to maintain up-to-date information, and moving target defense as a security mechanism. Each USRP device sends its geolocation to query the spectrum database for idle channels. The cloud cluster was designed for complex data storage and allocation using a smart load balancer to offer ultra-security to users. This project also explores the advantages of data protection and security through moving target defense. To achieve this, the system would use an array of antennas to split the data into different parts and transmit them across separate antennas. This research provides the design to each of the mentioned projects for the implementation of a fully developed system

Collision Avoidance Based Neighbor Discovery in Ad Hoc Wireless Networks

[EN] Neighbor discovery is an important first step after the deployment of ad hoc wireless networks since they are a type of network that do not provide a communications infrastructure right after their deployment, the devices have radio transceivers which provide a limited transmission range, and there is a lack of knowledge of the potential neighbors. In this work two proposals to overcome the neighbor discovery in static one-hop environments in the presence of collisions, are presented. We performed simulations through Castalia 3.2, to compare the performance of the proposals against that for two protocols from the literature, i.e. PRR and Hello, and evaluate them according to six metrics. According to simulation results, the Leader-based proposal (O(N)) outperforms the other protocols in terms of neighbor discovery time, throughput, discoveries vs packets sent ratio, and packets received vs sent ratio, and the TDMA-based proposal is the slowest (O(N-2)) and presents the worst results regarding energy consumption, and discoveries vs packets sent ratio. However, both proposals follow a predetermined transmission schedule that allows them to discover all the neighbors with probability 1, and use a feedback mechanism. We also performed an analytical study for both proposals according to several metrics. Moreover, the Leader-based solution can only properly operate in one-hop environments, whereas the TDMA-based proposal is appropriate for its use in multi-hop environments.This work has been partially supported by the "Ministerio de Economia y Competitividad" in the "Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia, Subprograma Estatal de Generacion de Conocimiento" within the project under Grant TIN2017-84802-C2-1-P. This work has also been partially supported by European Union through the ERANETMED (Euromediterranean Cooperation through ERANET joint activities and beyond) project ERANETMED3-227 SMARTWATIR.Sorribes, JV.; Peñalver Herrero, ML.; Lloret, J.; Tavares De Araujo Cesariny Calafate, CM. (2022). Collision Avoidance Based Neighbor Discovery in Ad Hoc Wireless Networks. Wireless Personal Communications. 125(2):987-1011. https://doi.org/10.1007/s11277-021-09091-x9871011125

Flexible cooperation in non-standard application environments

The integration of preexisting systems into a single, heterogeneous, distributed non-standard application system in domains like office automation or computer-integrated manufacturing are regarded as cooperating systems. They are characterized through teamwork, distribution and the handling of complex data structures (e.g. multimedia data). Object-oriented database systems, providing for complex object management, represent one approach in support of such applications. They concentrate, however, on data modeling aspects and use more or less conventional transaction concepts, based on a global execution control. Hence, they only partially fulfill application requirements as they do not adequately cope with the autonomy that is often inherent to the system's components. As a consequence, we suggest S-transactions as an appropriate means for describing the cooperation of system components in terms of transactions and beyond. In this paper we outline the modeling of conventional transactions (flat or nested as well as distributed and design transactions) in terms of STDL, the S-transaction definition language. Beyond that we point out how to specify SAGAs and similar concepts. Finally we discuss the specification of non-linear but maybe acyclic or even cyclic cooperation structuresPrepared for: Naval Ocean Systems Center and funded by the Naval Postgraduate School.http://archive.org/details/flexiblecooperat00holtO&MN, Direct FundingNAApproved for public release; distribution is unlimited