Common control channels in cognitive radio (CR) ad hoc networks are spectrum resources temporarily allocated and commonly available to CR users for control message exchange. With no presumably available network infrastructure, CR users rely on cooperation to perform spectrum management functions. One the one hand, CR users need to cooperate to establish common control channels, but on the other hand, they need to have common control channels to facilitate such cooperation. This control channel problem is further complicated by primary user (PU) activities, channel impairments, and intelligent attackers. Therefore, how to reliably and securely establish control links in CR ad hoc networks is a challenging problem. In this work, a framework for control channel design and analysis is proposed to address control channel reliability and security challenges for seamless communication and spectral efficiency in CR ad hoc networks. The framework tackles the problem from three perspectives: (i) responsiveness to PU activities: an efficient recovery control channel method is devised to efficiently establish control links and extend control channel coverage upon PU's return while mitigating the interference with PUs, (ii) robustness to channel impairments: a reinforcement learning-based cooperative sensing method is introduced to improve cooperative gain and mitigate cooperation overhead, and (iii) resilience to jamming attacks: a jamming-resilient control channel method is developed to combat jamming under the impacts of PU activities and spectrum sensing errors by leveraging intrusion defense strategies. This research is particularly attractive to emergency relief, public safety, military, and commercial applications where CR users are highly likely to operate in spectrum-scarce or hostile environment.

This work presents the implementations of three adaptive broadcast protocols for vehicular ad hoc networks (VANET) using the Network Simulator 3 (Ns-3). Performing real life tests for VANET protocols is very costly and risky, so simulation becomes a viable alternative technique. Ns-3 is one of the most advanced open source network simulators. Yet Ns-3 lacks implementations of broadcast protocols for VANET. We first implement the Distance to Mean (DTM) protocol, which uses the distance to mean to determine if a node should rebroadcast or not. We then implement the Distribution-Adaptive Distance with Channel Quality (DADCQ) protocol, which uses node distribution, channel quality and distance to determine if a node should favor rebroadcasting. The third protocol, Statistical Location-Assisted Broadcast protocol (SLAB), is an improvement of DADCQ which automates the threshold function design using machine learning. Our NS-3 implementations of the three protocols have been validated against their JiST/SWANS implementations. / Includes bibliography. / Thesis (M.S.)--Florida Atlantic University, 2016. / FAU Electronic Theses and Dissertations Collection

A Vehicular Ad-hoc Network (VANET) is a wireless ad-hoc network that provides communications among vehicles with on-board units and between vehicles and nearby roadside units. The success of a VANET relies on the ability of a routing protocol to ful ll the throughput and delivery requirements of any applications operating on the network. Currently, most of the proposed VANET routing protocols focus on urban or highway environments. This dissertation addresses the need for an adaptive routing protocol in VANETs which is able to tolerate low and high-density network tra c with little throughput and delay variation. This dissertation proposes three Geographic Ad-hoc On-Demand Distance Vector (GEOADV) protocols. These three GEOADV routing protocols are designed to address the lack of exibility and adaptability in current VANET routing protocols. The rst protocol, GEOADV, is a hybrid geographic routing protocol. The second protocol, GEOADV-P, enhances GEOADV by introducing predictive features. The third protocol, GEOADV-PF improves optimal route selection by utilizing fuzzy logic in addition to GEOADV-P's predictive capabilities. To prove that GEOADV and GEOADV-P are adaptive their performance is demonstrated by both urban and highway simulations. When compared to existing routing protocols, GEOADV and GEOADV-P lead to less average delay and a higher average delivery ratio in various scenarios. These advantages allow GEOADV- P to outperform other routing protocols in low-density networks and prove itself to be an adaptive routing protocol in a VANET environment. GEOADV-PF is introduced to improve GEOADV and GEOADV-P performance in sparser networks. The introduction of fuzzy systems can help with the intrinsic demands for exibility and adaptability necessary for VANETs. An investigation into the impact adaptive beaconing has on the GEOADV protocol is conducted. GEOADV enhanced with an adaptive beacon method is compared against GEOADV with three xed beacon rates. Our simulation results show that the adaptive beaconing scheme is able to reduce routing overhead, increase the average delivery ratio, and decrease the average delay. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2017. / FAU Electronic Theses and Dissertations Collection

In the wake of major disasters, the failure of existing communications infrastructure and the subsequent lack of an effective communication solution results in increased risks, inefficiencies, damage and casualties. Currently available options such as satellite communication are expensive and have limited functionality. A robust communication solution should be affordable, easy to deploy, require little infrastructure, consume little power and facilitate Internet access. Researchers have long proposed the use of ad hoc wireless networks for such scenarios. However such networks have so far failed to create any impact, primarily because they are unable to handle network transience and have usability constraints such as static topologies and dependence on specific platforms. LifeNet is a WiFi-based ad hoc data communication solution designed for use in highly transient environments. After presenting the motivation, design principles and key insights from prior literature, the dissertation introduces a new routing metric called Reachability and a new routing protocol based on it, called Flexible Routing. Roughly speaking, reachability measures the end-to-end multi-path probability that a packet transmitted by a source reaches its final destination. Using experimental results, it is shown that even with high transience, the reachability metric - (1) accurately captures the effects of transience (2) provides a compact and eventually consistent global network view at individual nodes, (3) is easy to calculate and maintain and (4) captures availability. Flexible Routing trades throughput for availability and fault-tolerance and ensures successful packet delivery under varying degrees of transience. With the intent of deploying LifeNet on field we have been continuously interacting with field partners, one of which is Tata Institute of Social Sciences India. We have refined LifeNet iteratively refined base on their feedback. I conclude the thesis with lessons learned from our field trips so far and deployment plans for the near future.

Opportunistic communication techniques have shown to provide significant performance improvements in centralised random access wireless networks. The key mechanism of opportunistic communication is to send back-to-back data packets whenever the channel quality is deemed "good". Recently there have been attempts to introduce opportunistic communication techniques in distributed wireless networks such as wireless ad hoc networks. In line of this research, we propose a new paradigm of medium access control, called Channel MAC based on the channel randomness and opportunistic communication principles. Scheduling in Channel MAC depends on the instance at which the channel quality improves beyond a threshold, while neighbouring nodes are deemed to be silent. Once a node starts transmitting, it will keep transmitting until the channel becomes "bad". We derive an analytical throughput equation of the proposed MAC in a multiple access environment and validate it by simulations. It is observed that Channel MAC outperforms IEEE 802.11 for all probabilities of good channel condition and all numbers of nodes. For higher number of nodes, Channel MAC achieves higher throughput at lower probabilities of good channel condition increasing the operating range. Furthermore, the total throughput of the network grows with increasing number of nodes considering negligible propagation delay in the network. A scalable channel prediction scheme is required to implement the practical Channel MAC protocol in practice. We propose a mean-value based channel prediction scheme, which provides prediction with enough accuracy to be used in the Channel MAC protocol. NS2 simulation result shows that the Channel MAC protocol outperforms the IEEE 802.11 in throughput due to its channel diversity mechanism in spite of the prediction errors and packet collisions. Next, we extend the Channel MAC protocol to support multi-rate communications. At present, two prominent multi-rate mechanisms, Opportunistic Auto Rate (OAR) and Receiver Based Auto Rate (RBAR) are unable to adapt to short term changes in channel conditions during transmission as well as to use optimum power and throughput during packet transmissions. On the other hand, using channel predictions, each source-destinations pair in Channel MAC can fully utilise the non-fade durations. We combine the scheduling of Channel MAC and the rate adaptive transmission based on the channel state information to design the 'Rate Adaptive Channel MAC' protocol. However, to implement the Rate adaptive Channel MAC, we need to use a channel prediction scheme to identify transmission opportunities as well as auto rate adaptation mechanism to select rates and number of packets to transmit during those times. For channel prediction, we apply the scheme proposed for the practical implementation of Channel MAC. We propose a "safety margin" based technique to provide auto rate adaptation. Simulation results show that a significant performance improvement can be achieved by Rate adaptive Channel MAC as compared to existing rate adaptive protocols such as OAR.

Opportunistic communication techniques have shown to provide significant performance improvements in centralised random access wireless networks. The key mechanism of opportunistic communication is to send back-to-back data packets whenever the channel quality is deemed "good". Recently there have been attempts to introduce opportunistic communication techniques in distributed wireless networks such as wireless ad hoc networks. In line of this research, we propose a new paradigm of medium access control, called Channel MAC based on the channel randomness and opportunistic communication principles. Scheduling in Channel MAC depends on the instance at which the channel quality improves beyond a threshold, while neighbouring nodes are deemed to be silent. Once a node starts transmitting, it will keep transmitting until the channel becomes "bad". We derive an analytical throughput equation of the proposed MAC in a multiple access environment and validate it by simulations. It is observed that Channel MAC outperforms IEEE 802.11 for all probabilities of good channel condition and all numbers of nodes. For higher number of nodes, Channel MAC achieves higher throughput at lower probabilities of good channel condition increasing the operating range. Furthermore, the total throughput of the network grows with increasing number of nodes considering negligible propagation delay in the network. A scalable channel prediction scheme is required to implement the practical Channel MAC protocol in practice. We propose a mean-value based channel prediction scheme, which provides prediction with enough accuracy to be used in the Channel MAC protocol. NS2 simulation result shows that the Channel MAC protocol outperforms the IEEE 802.11 in throughput due to its channel diversity mechanism in spite of the prediction errors and packet collisions. Next, we extend the Channel MAC protocol to support multi-rate communications. At present, two prominent multi-rate mechanisms, Opportunistic Auto Rate (OAR) and Receiver Based Auto Rate (RBAR) are unable to adapt to short term changes in channel conditions during transmission as well as to use optimum power and throughput during packet transmissions. On the other hand, using channel predictions, each source-destinations pair in Channel MAC can fully utilise the non-fade durations. We combine the scheduling of Channel MAC and the rate adaptive transmission based on the channel state information to design the 'Rate Adaptive Channel MAC' protocol. However, to implement the Rate adaptive Channel MAC, we need to use a channel prediction scheme to identify transmission opportunities as well as auto rate adaptation mechanism to select rates and number of packets to transmit during those times. For channel prediction, we apply the scheme proposed for the practical implementation of Channel MAC. We propose a "safety margin" based technique to provide auto rate adaptation. Simulation results show that a significant performance improvement can be achieved by Rate adaptive Channel MAC as compared to existing rate adaptive protocols such as OAR.

Avec l’évolution des besoins d’utilisateurs, plusieurs technologies de réseaux sans fil ont été développées. Parmi ces technologies, nous trouvons les réseaux mobiles ad hoc (MANETs) qui ont été conçus pour assurer la communication dans le cas où le déploiement d’une infrastructure réseaux est coûteux ou inapproprié. Dans ces réseaux, le routage est une fonction primordiale où chaque entité mobile joue le rôle d’un routeur et participe activement dans le routage. Cependant, les protocoles de routage ad hoc tel qu’ils sont conçus manquent de contrôle de sécurité. Sur un chemin emprunté, un nœud malveillant peut violemment perturber le routage en bloquant le trafic. Dans cette thèse, nous proposons une solution de détection des nœuds malveillants dans un réseau MANET basée sur l’analyse comportementale à travers les filtres bayésiens et les chaînes de Markov. L’idée de notre solution est d’évaluer le comportement d’un nœud en fonction de ses échanges avec ses voisins d’une manière complètement décentralisée. Par ailleurs, un modèle stochastique est utilisé afin de prédire la nature de comportement d’un nœud et vérifier sa fiabilité avant d’emprunter un chemin. Notre solution a été validée via de nombreuses simulations sur le simulateur NS-2. Les résultats montrent que la solution proposée permet de détecter avec précision les nœuds malveillants et d’améliorer la qualité de services de réseaux MANETs / With the evolution of user requirements, many network technologies have been developed. Among these technologies, we find mobile ad hoc networks (MANETs) that were designed to ensure communication in situations where the deployment of a network infrastructure is expensive or inappropriate. In this type of networks, routing is an important function where each mobile entity acts as a router and actively participates in routing services. However, routing protocols are not designed with security in mind and often are very vulnerable to node misbehavior. A malicious node included in a route between communicating nodes may severely disrupt the routing services and block the network traffic. In this thesis, we propose a solution for detecting malicious nodes in MANETs through a behavior-based analysis and using Bayesian filters and Markov chains. The core idea of our solution is to evaluate the behavior of a node based on its interaction with its neighbors using a completely decentralized scheme. Moreover, a stochastic model is used to predict the nature of behavior of a node and verify its reliability prior to selecting a path. Our solution has been validated through extensive simulations using the NS-2 simulator. The results show that the proposed solution ensures an accurate detection of malicious nodes and improve the quality of routing services in MANETs

Indiana University-Purdue University Indianapolis (IUPUI) / With the rapid growth in wireless mobile communication technology, Vehicular Ad-hoc Network (VANET) has emerged as a promising method to effectively solve transportation-related issues. So far, most of researches on VANETs have been conducted with simulations as the real-world experiment is expensive. A core problem affecting the fidelity of simulation is the mobility model employed. In this thesis, a sophisticated traffic simulator capable of generating realistic vehicle traces is introduced. Combined with network simulator NS-2, we used this tool to evaluate the general performance of several routing protocols and studied the impact of intersections on simulation results. We show that static nodes near the intersection tend to become more active in packet delivery with higher transferred throughput.

This thesis investigates both theoretical and practical aspects of the design and analysis of modern error-control coding schemes, namely low-density parity-check (LDPC) codes and rateless codes for unequal error protection (UEP). It also studies the application of modern error-control codes in efficient data dissemination in wireless ad-hoc and sensor networks. Two methodologies for the design and analysis of UEP-LDPC codes are proposed. For these proposed ensembles, density evolution formulas over the binary erasure channel are derived and used to optimize the degree distribution of the codes. Furthermore, for the first time, rateless codes that can provide UEP are developed. In addition to providing UEP, the proposed codes can be used in applications for which unequal recovery time is desirable, i.e., when more important parts of data are required to be recovered faster than less important parts. Asymptotic behavior of the UEP-rateless codes under the iterative decoding is investigated. In addition, the performance of the proposed codes is examined under the maximum-likelihood decoding, when the codes have short to moderate lengths. Results show that UEP-rateless codes are able to provide very low error rates for more important bits with only a subtle loss in the performance of less important bits. Moreover, it is shown that given a target bit error rate, different parts of the information symbols can be decoded after receiving different numbers of encoded symbols. This implies that information can be recovered in a progressive manner, which is of interest in many practical applications such as media-on-demand systems. This work also explores fundamental research problems related to applying error-control coding such as rateless coding to the problem of reliable and energy-efficient broadcasting in multihop wireless ad-hoc sensor networks. The proposed research touches on the four very large fields of wireless networking, coding theory, graph theory, and percolation theory. Based on the level of information that each node has about the network topology, several reliable and energy-efficient schemes are proposed, all of which are distributed and have low complexity of implementation. The first protocol does not require any information about the network topology. Another protocol, which is more energy efficient, assumes each node has local information about the network topology. In addition, this work proposes a distributed scheme for finding low-cost broadcast trees in wireless networks. This scheme takes into account various parameters such as distances between nodes and link losses. This protocol is then extended to find low-cost multicast trees. Several schemes are extensively simulated and are compared.

This dissertation describes the impact of using asymmetric encryption algorithms, with emphasis on algorithms RSA, ECC and MQQ in scenarios VANET (Vehicular Ad hoc Network). In the research were investigated some simulators as GrooveNet, VANET / DSRC, VANET / CRL Epidemic, NS-2, trans, NCTUns / EstiNET, SUMO, VanetMobiSim and ns-3, suitable for VANET. The algorithms have been implemented in C and inserted into the ns-3, where the simple scenarios created a network VANET. The results showed that it is possible to add protocol-layer security services of vehicular networks (1609.2), these asymmetric algorithms and obtain secure communication between nodes in the VANET. / Esta dissertação de mestrado descreve o impacto de usar algoritmos assimétricos de criptografia, dando ênfase aos algoritmos RSA, ECC e MQQ em cenários de VANET (Vehicular Ad hoc Network). Na pesquisa foram investigados alguns simuladores como GrooveNet, VANET/DSRC, VANET/Epidemic CRL, NS-2, TraNS, NCTUns/EstiNET, SUMO, VanetMobiSim e ns-3, próprio para VANET. Os algoritmos foram implementados em C e inseridos no ns-3, onde se criam cenários simples de uma rede VANET. Os resultados obtidos permitem concluir que é possível agregar ao protocolo, na camada de serviços de segurança das redes veiculares (1609.2), esses algoritmos assimétricos e obter comunicação segura entre os nós da VANET.