LIDF: Layered intrusion detection framework for ad-hoc networks

As ad-hoc networks have different characteristics from a wired network, the intrusion detection techniques used for wired networks are no longer sufficient and effective when adapted directly to a wireless ad-hoc network. In this article, first τhe security challenges in intrusion detection for ad-hoc networks are identified and the related work for anomaly detection is discussed. We then propose a layered intrusion detection framework, which consists of collection, detection and alert modules that are handled by local agents. The collection, detection and alert modules are uniquely enabled with the main operations of ad-hoc networking, which are found at the OSI link and network layers. The proposed modules are based on interpolating polynomials and linear threshold schemes. An experimental evaluation of these modules shows their efficiency for several attack scenarios, such as route logic compromise, traffic patterns distortion and denial of service attacks

Properties and topology of the DES-Testbed

The Distributed Embedded Systems Testbed (DES-Testbed) is a hybrid wireless mesh and wireless sensor network that has been deployed at Freie Universität Berlin and was successively extended from November 2007 to December 2010. This technical report gives an overview of the current topology and the properties of the IEEE 802.11 wireless mesh network that is part of the DES-Testbed. The information that was gathered from an experimental study shall enable researchers to optimize their experiment scenarios, to support the evaluation of experiments, and to derive improved models of real world deployments. The differences of testbeds compared with simulation models and how to evaluate and filter the raw data are addressed. The focus of our study is an up-to-date description of the testbed state and to highlight particular issues. We show that the node degree, link ranges, and packet delivery ratios are not normal distributed and that simple means are not sufficient to describe the properties of a real world wireless network. Significant differences of the results from three channels are discussed. As last, the technical report shows that the DES-Testbed is an overall well connected network that is suited for studies of wireless mesh network and wireless mobile ad-hoc network problems.09.03.201

Practical Aggregation in the Edge

Due to the increasing amounts of data produced by applications and devices, cloud infrastructures are becoming unable to timely process and provide answers back to users. This has led to the emergence of the edge computing paradigm that aims at moving computations closer to end user devices. Edge computing can be defined as performing computations outside the boundaries of cloud data centres. This however, can be materialised across very different scenarios considering the broad spectrum of devices that can be leveraged to perform computations in the edge. In this thesis, we focus on a concrete scenario of edge computing, that of multiple devices with wireless capabilities that collectively form a wireless ad hoc network to perform distributed computations. We aim at devising practical solutions for these scenarios however, there is a lack of tools to help us in achieving such goal. To address this first limitation we propose a novel framework, called Yggdrasil, that is specifically tailored to develop and execute distributed protocols over wireless ad hoc networks on commodity devices. As to enable distributed computations in such networks, we focus on the particular case of distributed data aggregation. In particular, we address a harder variant of this problem, that we dub distributed continuous aggregation, where input values used for the computation of the aggregation function may change over time, and propose a novel distributed continuous aggregation protocol, called MiRAge. We have implemented and validated both Yggdrasil and MiRAge through an extensive experimental evaluation using a test-bed composed of 24 Raspberry Pi’s. Our results show that Yggdrasil provides adequate abstractions and tools to implement and execute distributed protocols in wireless ad hoc settings. Our evaluation is also composed of a practical comparative study on distributed continuous aggregation protocols, that shows that MiRAge is more robust and achieves more precise aggregation results than competing state-of-the-art alternatives

MANETs: Internet Connectivity and Transport Protocols

A Mobile Ad hoc Network (MANET) is a collection of mobile nodes connected together over a wireless medium, which self-organize into an autonomous multi-hop wireless network. This kind of networks allows people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking is not a new concept, having been around in various forms for over 20 years. However, in the past only tactical networks followed the ad hoc networking paradigm. Recently, the introduction of new technologies such as IEEE 802.11, are moved the application field of MANETs to a more commercial field. These evolutions have been generating a renewed and growing interest in the research and development of MANETs. It is widely recognized that a prerequisite for the commercial penetration of the ad hoc networking technologies is the integration with existing wired/wireless infrastructure-based networks to provide an easy and transparent access to the Internet and its services. However, most of the existing solutions for enabling the interconnection between MANETs and the Internet are based on complex and inefficient mechanisms, as Mobile-IP and IP tunnelling. This thesis describes an alternative approach to build multi-hop and heterogeneous proactive ad hoc networks, which can be used as flexible and low-cost extensions of traditional wired LANs. The proposed architecture provides transparent global Internet connectivity and address autocofiguration capabilities to mobile nodes without requiring configuration changes in the pre-existing wired LAN, and relying on basic layer-2 functionalities. This thesis also includes an experimental evaluation of the proposed architecture and a comparison between this architecture with a well-known alternative NAT-based solution. The experimental outcomes confirm that the proposed technique ensures higher per-connection throughputs than the NAT-based solution. This thesis also examines the problems encountered by TCP over multi-hop ad hoc networks. Research on efficient transport protocols for ad hoc networks is one of the most active topics in the MANET community. Such a great interest is basically motivated by numerous observations showing that, in general, TCP is not able to efficiently deal with the unstable and very dynamic environment provided by multi-hop ad hoc networks. This is because some assumptions, in TCP design, are clearly inspired by the characteristics of wired networks dominant at the time when it was conceived. More specifically, TCP implicitly assumes that packet loss is almost always due to congestion phenomena causing buffer overflows at intermediate routers. Furthermore, it also assumes that nodes are static (i.e., they do not change their position over time). Unfortunately, these assumptions do not hold in MANETs, since in this kind of networks packet losses due to interference and link-layer contentions are largely predominant, and nodes may be mobile. The typical approach to solve these problems is patching TCP to fix its inefficiencies while preserving compatibility with the original protocol. This thesis explores a different approach. Specifically, this thesis presents a new transport protocol (TPA) designed from scratch, and address TCP interoperability at a late design stage. In this way, TPA can include all desired features in a neat and coherent way. This thesis also includes an experimental, as well as, a simulative evaluation of TPA, and a comparison between TCP and TPA performance (in terms of throughput, number of unnecessary transmissions and fairness). The presented analysis considers several of possible configurations of the protocols parameters, different routing protocols, and various networking scenarios. In all the cases taken into consideration TPA significantly outperforms TCP

Simulation and experimental testbed for adaptive video streaming in ad hoc networks

[EN] This paper presents a performance evaluation of the scalable video streaming over mobile ad hoc networks. In particular, we focus on the rate-adaptive method for streaming scalable video (H.264/SVC). For effective adaptation a new cross-layer routing protocol is introduced. This protocol provides an efficient algorithm for available bandwidth estimation. With this information, the video source adjusts its bit rate during the video transmission according to the network state. We also propose a free simulation framework that supports evaluation studies for scalable video streaming. The simulation experiments performed in this study involve the transmission of SVC streams with Medium Grain Scalability (MGS) as well as temporal scalability over different network scenarios. The results reveal that the rate-adaptive strategy helps avoid or reduce the congestion in MANETs obtaining a better quality in the received videos. Additionally, an actual ad hoc network was implemented using embedded devices (Raspberry Pi) in order to assess the performance of the proposed adaptive transmission mechanism in a real environment. Additional experiments were carried out prior to the implementation with the aim of characterizing the wireless medium and packet loss profile. Finally, the proposed approach shows an important reduction in energy consumption, as the study revealed.This paper was performed with the support of the National Secretary of Higher Education, Science, Technology and Innovation (SENESCYT)–Ecuador Government (scholarship 195-2012) and the Multimedia Communications Group (COMM) belong to the Institute of Telecommunications and Multimedia Applications (iTEAM)-Universitat Politècnica de València.Gonzalez-Martinez, SR.; Castellanos Hernández, WE.; Guzmán Castillo, PF.; Arce Vila, P.; Guerri Cebollada, JC. (2016). Simulation and experimental testbed for adaptive video streaming in ad hoc networks. Ad Hoc Networks. 52:89-105. https://doi.org/10.1016/j.adhoc.2016.07.007S891055

Experimental Methodology For Wireless Networks

The adoption of new protocols and network mechanisms requires an experimentation phase which is complex to deploy, and even more on wireless networks. Generally, ad-hoc tools are developed for the specific needs on a experimental scenario to capture, analize and store statistical data. Because there is no common experimental methodology within the research community, and research publications do not provide often the experimental conditions, it is almost impossible for another researcher to reproduce the same experimental scenario. Within this research report, we define a network evaluation methodology to simplify the deployment of wireless experiments and their analysis. The proposed method uses a modular approach for the different experimentation phases. We also illustrate this methodology by an example

Intrusion detection in IPv6-enabled sensor networks.

In this research, we study efficient and lightweight Intrusion Detection Systems (IDS) for ad-hoc networks through the lens of IPv6-enabled Wireless Sensor Actuator Networks. These networks consist of highly constrained devices able to communicate wirelessly in an ad-hoc fashion, thus following the architecture of ad-hoc networks. Current state of the art IDS in IoT and WSNs have been developed considering the architecture of conventional computer networks, and as such they do not efficiently address the paradigm of ad-hoc networks, which is highly relevant in emerging network paradigms, such as the Internet of Things (IoT). In this context, the network properties of resilience and redundancy have not been extensively studied. In this thesis, we first identify a trade-off between the communication and energy overheads of an IDS (as captured by the number of active IDS agents in the network) and the performance of the system in terms of successfully identifying attacks. In order to fine-tune this trade-off, we model networks as Random Geometric Graphs; these are a rigorous approach that allows us to capture underlying structural properties of the network. We then introduce a novel IDS architectural approach that consists of a central IDS agent and set of distributed IDS agents deployed uniformly at random over the network area. These nodes are able to efficiently detect attacks at the networking layer in a collaborative manner by monitoring locally available network information provided by IoT routing protocols, such as RPL. The detailed experimental evaluation conducted in this research demonstrates significant performance gains in terms of communication overhead and energy dissipation while maintaining high detection rates. We also show that the performance of our IDS in ad-hoc networks does not rely on the size of the network but on fundamental underling network properties, such as the network topology and the average degree of the nodes. The experiments show that our proposed IDS architecture is resilient against frequent topology changes due to node failures

Modulation Schemes and Connectivity in Wireless Underground Channel

In this chapter, a thorough treatment of the modulation schemes for UG Wireless is presented. The effects of soil texture and water content on the capacity of multi-carrier modulation in WUC are discussed. The multi-carrier capacity model results are analyzed. Moreover, the underground MIMO design for underground communications is explained thoroughly. An analysis of medium access in wireless underground is done as well. Furthermore, the soil properties are considered for cross-layer communications of UG wireless. The performance analysis of traditional modulation schemes is also considered. The soil moisture-based modulation approach is also explored in this chapter. The connectivity and diversity reception approaches are discussed for wireless underground communications. The connectivity and interference models are studied for Ad-Hoc and Hybrid Networks. The topology control mechanisms for maintaining network connectivity are explored for maximizing network capacity under the physical models (e.g., the protocol interference model and physical interference model). Moreover, the underground diversity is examined for 3W-Rake receiver and coherent detection along with experimental evaluation and comprehensive analysis of performance of equalization techniques

DTN7: An Open-Source Disruption-tolerant Networking Implementation of Bundle Protocol 7

In disruption-tolerant networking (DTN), data is transmitted in a store-carry-forward fashion from network node to network node. In this paper, we present an open source DTN implementation, called DTN7, of the recently released Bundle Protocol Version 7 (draft version 13). DTN7 is written in Go and provides features like memory safety and concurrent execution. With its modular design and interchangeable components, DTN7 facilitates DTN research and application development. Furthermore, we present results of a comparative experimental evaluation of DTN7 and other DTN systems including Serval, IBR-DTN, and Forban. Our results indicate that DTN7 is a flexible and efficient open-source multi-platform implementation of the most recent Bundle Protocol Version 7.Comment: 18th International Conference on Ad Hoc Networks and Wireless (AdHoc-Now 2019

A testbed for MANETs: Implementation, experiences and learned lessons

In this paper, we present the implementation, experiences and lessons learned of our tesbed for Ad-hoc networks and Mobile Ad hoc Networks (MANETs). We used OLSR protocol for real experimental evaluation. We investigate the effect of mobility and topology changing in the throughput of a MANET. We study the impact of best-effort traffic for Mesh Topology and Linear Topology. In this work, we consider eight experimental models and we assess the performance of our testbed in terms of throughput, round trip time and packet loss. We found that some of the OLSR's problems can be solved, for instance the routing loop, but this protocol still has the self-interference problem. Also, there is an intricate interdependence between MAC layer and routing layer. We carried out the experiments considering stationary nodes of an Ad-hoc network and the node mobility of MANETs. We found that throughput of TCP was improved by reducing Link Quality Window Size (LQWS). For TCP data flow, we got better results when the LQWS value was 10. Moreover, we found that the node join and leave operations increase the packet loss. The OLSR protocol has a good performance when the source node is moving. However, the performance is not good when the relay nodes are moving.Peer ReviewedPostprint (published version