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

APUS: Fast and Scalable PAXOS on RDMA

State machine replication (SMR) uses Paxos to enforce the same inputs for a program (e.g., Redis) replicated on a number of hosts, tolerating various types of failures. Unfortunately, traditional Paxos protocols incur prohibitive performance overhead on server programs due to their high consensus latency on TCP/IP. Worse, the consensus latency of extant Paxos protocols increases drastically when more concurrent client connections or hosts are added. This paper presents APUS, the first RDMA-based Paxos protocol that aims to be fast and scalable to client connections and hosts. APUS intercepts inbound socket calls of an unmodified server program, assigns a total order for all input requests, and uses fast RDMA primitives to replicate these requests concurrently. We evaluated APUS on nine widely-used server programs (e.g., Redis and MySQL). APUS incurred a mean overhead of 4.3% in response time and 4.2% in throughput. We integrated APUS with an SMR system Calvin. Our Calvin-APUS integration was 8.2X faster than the extant Calvin-ZooKeeper integration. The consensus latency of APUS outperformed an RDMA-based consensus protocol by 4.9X. APUS source code and raw results are released on github. com/hku-systems/apus.published_or_final_versio

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

Topology Control, Routing Protocols and Performance Evaluation for Mobile Wireless Ad Hoc Networks

A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MANETs. In this dissertation, we will propose four algorithms that address different aspects of routing problems in MANETs. Firstly, in position based routing protocols to design a scalable location management scheme is inherently difficult. Enhanced Scalable Location management Service (EnSLS) is proposed to improve the scalability of existing location management services, and a mathematical model is proposed to compare the performance of the classical location service, GLS, and our protocol, EnSLS. The analytical model shows that EnSLS has better scalability compared with that of GLS. Secondly, virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is an NP-hard problem. In the dissertation, we develop two new pure localized protocols for calculating the CDS. One emphasizes forming a small size initial near-optimal CDS via marking process, and the other uses an iterative synchronized method to avoid illegal simultaneously removal of dominating nodes. Our new protocols largely reduce the number of nodes in CDS compared with existing methods. We show the efficiency of our approach through both theoretical analysis and simulation experiments. Finally, using multiple redundant paths for routing is a promising solution. However, selecting an optimal path set is an NP hard problem. We propose the Genetic Fuzzy Multi-path Routing Protocol (GFMRP), which is a multi-path routing protocol based on fuzzy set theory and evolutionary computing

Consistency issue and related trade-offs in distributed replicated systems and databases: a review

However, achieving these qualities requires resolving a number of trade-offs between various properties during system design and operation. This paper reviews trade-offs in distributed replicated databases and provides a survey of recent research papers studying distributed data storage. The paper first discusses a compromise between consistency and latency that appears in distributed replicated data storages and directly follows from CAP and PACELC theorems. Consistency refers to the guarantee that all clients in a distributed system observe the same data at the same time. To ensure strong consistency, distributed systems typically employ coordination mechanisms and synchronization protocols that involve communication and agreement among distributed replicas. These mechanisms introduce additional overhead and latency and can dramatically increase the time taken to complete operations when replicas are globally distributed across the Internet. In addition, we study trade-offs between other system properties including availability, durability, cost, energy consumption, read and write latency, etc. In this paper we also provide a comprehensive review and classification of recent research works in distributed replicated databases. Reviewed papers showcase several major areas of research, ranging from performance evaluation and comparison of various NoSQL databases to suggest new strategies for data replication and putting forward new consistency models. In particular, we observed a shift towards exploring hybrid consistency models of causal consistency and eventual consistency with causal ordering due to their ability to strike a balance between operations ordering guarantees and high performance. Researchers have also proposed various consistency control algorithms and consensus quorum protocols to coordinate distributed replicas. Insights from this review can empower practitioners to make informed decisions in designing and managing distributed data storage systems as well as help identify existing gaps in the body of knowledge and suggest further research directions