Simulation and emulation are techniques frequently used for performance evaluation of wireless multi-hop networks. If the wireless devices are mobile, the movement patterns of these objects are found to have significant impact on the simulation and emulation results. This is quite obvious as the movements influence the topology of the network.In this paper we describe and present BonnMotion. BonnMotion is an open-source Java software which creates and analyzes mobility scenarios. It has been developed at the University of Bonn, Germany, where it serves as a tool for the investigation of mobile multi-hop network scenario characteristics. The scenarios can also be exported for the network simulators ns-2, GloMoSim/QualNet, COOJA, and MiXiM.

BonnMotion: a mobility scenario generation and analysis tool

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogs of classical filters, but intended for signals defined on graphs. This paper brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which are able to approximate any desired graph frequency response, and give exact solutions for specific graph signal denoising and interpolation problems. The philosophy to design the ARMA coefficients independently from the underlying graph renders the ARMA graph filters suitable in static and, particularly, time-varying settings. The latter occur when the graph signal and/or graph topology are changing over time. We show that in case of a time-varying graph signal, our approach extends naturally to a two-dimensional filter, operating concurrently in the graph and regular time domain. We also derive the graph filter behavior, as well as sufficient conditions for filter stability when the graph and signal are time varying. The analytical and numerical results presented in this paper illustrate that ARMA graph filters are practically appealing for static and time-varying settings, as predicted by theoretical derivations.

Autoregressive Moving Average Graph Filtering

Broadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks, and used to spread emergency messages in critical scenarios after a disaster scenario and/or an accidents. As the type broadcast scheme used plays an important role in the performance of the network, it has to be selected carefully. Though several types of broadcast schemes have been proposed, probabilistic broadcast schemes have been demonstrated to be suitable schemes for wireless ad hoc networks due to a range of benefits offered by them such as low overhead, balanced energy consumption, and robustness against failures and mobility of nodes. In the last decade, many probabilistic broadcast schemes have been proposed by researchers. In addition to reviewing the main features of the probabilistic schemes found in the literature, we also present a classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and present some examples of real implementations, in this paper.

/pdf/a-survey-on-probabilistic-broadcast-schemes-for-wireless-ad-7b3rmky4fl.pdf

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Disastrous events are one of the most challenging applications of multihop ad hoc networks due to possible damages of existing telecommunication infrastructure. The deployed cellular communication infrastructure might be partially or completely destroyed after a natural disaster. Multihop ad hoc communication is an interesting alternative to deal with the lack of communications in disaster scenarios. They have evolved since their origin, leading to different ad hoc paradigms such as MANETs, VANETs, DTNs, or WSNs. This paper presents a survey on multihop ad hoc network paradigms for disaster scenarios. It highlights their applicability to important tasks in disaster relief operations. More specifically, the paper reviews the main work found in the literature, which employed ad hoc networks in disaster scenarios. In addition, it discusses the open challenges and the future research directions for each different ad hoc paradigm.

A survey on multihop ad hoc networks for disaster response scenarios

The Internet of Things (IoT) is attracting considerable attention from the universities, industries, citizens and governments for applications, such as healthcare, environmental monitoring and smart buildings. IoT enables network connectivity between smart devices at all times, everywhere, and about everything. In this context, Wireless Sensor Networks (WSNs) play an important role in increasing the ubiquity of networks with smart devices that are low-cost and easy to deploy. However, sensor nodes are restricted in terms of energy, processing and memory. Additionally, low-power radios are very sensitive to noise, interference and multipath distortions. In this context, this article proposes a routing protocol based on Routing by Energy and Link quality (REL) for IoT applications. To increase reliability and energy-efficiency, REL selects routes on the basis of a proposed end-to-end link quality estimator mechanism, residual energy and hop count. Furthermore, REL proposes an event-driven mechanism to provide load balancing and avoid the premature energy depletion of nodes/networks. Performance evaluations were carried out using simulation and testbed experiments to show the impact and benefits of REL in small and large-scale networks. The results show that REL increases the network lifetime and services availability, as well as the quality of service of IoT applications. It also provides an even distribution of scarce network resources and reduces the packet loss rate, compared with the performance of well-known protocols.

https://www.mdpi.com/1424-8220/13/2/1942/pdf

A routing protocol based on energy and link quality for Internet of Things applications.

Realistic, scenario-dependent mobility modeling is crucial for the reliable performance evaluation of wireless networks. For opportunistic networks several measured movement traces are available. However, for scalability and abstraction of the measured scenarios, synthetic mobility models are needed. In the last decade a significant number of synthetic mobility models have been proposed. However, many of these models lack realism. For example, they miss to consider geographic restrictions in a realistic way.In contrast to this, realistic maps are publicly available. Thus, these maps can help integrating geographic restrictions into mobility models. A quite simple way is to integrate location-based services into a scenario modeling tool. In this paper we show such an integration and evaluate the performance of it, as well. The performance evaluation shows that the runtime for the scenario generation is pretty small, even though location-based services are used.

Synthetic map-based mobility traces for the performance evaluation in opportunistic networks

Among other statistical features, the analysis of fine-grained GPS traces from different outdoor scenarios has shown that human mobility statistically resembles Levy Walks and led to the design of the Self-similar Least-Action Walk (SLAW) mobility model. It was concluded that human mobility is scale-free and that this feature is invariant irrespective of any geographic constraints. These constraints were considered too scenario-specific and were omitted in SLAW. However, we argue that geographic constraints should not be considered as an unnecessary detail, but as an important feature of a realistic mobility model for the simulative performance evaluation of mobile networks. Therefore, we introduce geographic restrictions to SLAW in the form of maps. Our evaluation of the extended model (called MSLAW) shows that the introduced restrictions have a significant impact on several performance metrics relevant for opportunistic networks.

Introducing Geographic Restrictions to the SLAW Human Mobility Model

The growing range of Wireless Sensor Network (WSN) applications, their long-life and large-scale design, as well as various deployment fields necessitate the feasibility of remote maintenance and reprogramming of in-situ sensor nodes. The network-wide dissemination of program code is not appropriate in every WSN due to the heterogeneity of sensor hardware, the diversity of sensing tasks, and the event and location dependency of software. Thus, a flexible and group-wise selective Over-The-Air Programming (OTAP) is required in these scenarios. Furthermore, securing the OTAP protocol is imperative in order to prevent unauthorized and malicious reprogramming attempts. In this paper, we introduce SenSeOP, a selective and secure OTAP protocol for WSNs. For this purpose, the proposed protocol uses multicast transfer supported by asymmetric cryptography. We evaluate the performance of our approach in real testbeds, compare it with state-of-the-art protocols, and show that this approach enables efficient and reliable wireless reprogramming.

Selective and Secure Over-The-Air Programming for Wireless Sensor Networks

Realistic modeling of the nodes' mobility is essential for obtaining credible results from the simulative performance evaluation of wireless multi-hop networks. However, most of the mobility models in the literature have not been validated with real world movement traces. To overcome this issue, we follow a trace-based approach to mobility modeling, where movement traces from the real world scenario are statistically analyzed and used for parametrization. In this paper, we introduce and evaluate a new realistic mobility model for first responder scenarios based on such an analysis while also considering geographic restrictions by incorporating free publicly available map data.

Matthias Schwamborn

Papers

BonnMotion: a mobility scenario generation and analysis tool

Synthetic map-based mobility traces for the performance evaluation in opportunistic networks

Introducing Geographic Restrictions to the SLAW Human Mobility Model

Selective and Secure Over-The-Air Programming for Wireless Sensor Networks

A realistic trace-based mobility model for first responder scenarios