arXiv subjects

Marius Portmann

Publications and source records attributed to Marius Portmann.

52 records · Page 3Linked to original sources

arXiv2020

Experimental Evaluation of LoRaWAN in NS-3

Long Range Wide Area Networks (LoRaWAN) is an open medium access control (MAC) layer technology devised for the long range connectivity of massive number of low power network devices. This work gives an overview of the key aspects of LoRaWAN technology and presents results that we achieved via extensive evaluation of Class A LoRaWAN devices in different network settings using the state-of-the-art network simulator (NS-3). At first, we focus on a single device and its mobility. We further undertook evaluations in an extended network scenario with a changing number of devices and traffic intensity. In particular, we evaluate the packet delivery ratio (PDR), uplink (UL) throughput, and sub-band utilization for the confirmed and unconfirmed UL transmissions in different environments. Our results give new insights for future efforts to optimize the LoRaWAN performance for different large scale Internet of Things (IoT) applications with low power end devices.

cs.NI↗

arXiv2020

A Model for Reliable Uplink Transmissions in LoRaWAN

Long range wide area networks (LoRaWAN) technology provides a simple solution to enable low-cost services for low power internet-of-things (IoT) networks in various applications. The current evaluation of LoRaWAN networks relies on simulations or early testing, which are typically time consuming and prevent effective exploration of the design space. This paper proposes an analytical model to calculate the delay and energy consumed for reliable Uplink (UL) data delivery in Class A LoRaWAN. The analytical model is evaluated using a real network test-bed as well as simulation experiments based on the ns-3 LoRaWAN module. The resulting comparison confirms that the model accurately estimates the delay and energy consumed in the considered environment. The value of the model is demonstrated via its application to evaluate the impact of the number of end-devices and the maximum number of data frame retransmissions on delay and energy consumed for the confirmed UL data delivery in LoRaWAN networks. The model can be used to optimize different transmission parameters in future LoRaWAN networks.

cs.NI↗

arXiv2020

Task Scheduling for Simultaneous IoT Sensing and Energy Harvesting: A Survey and Critical Analysis

The Internet of Things (IoT) has important applications in our daily lives including health and fitness tracking, environmental monitoring and transportation. However, sensor nodes in IoT suffer from the limited lifetime of batteries resulting from their finite energy availability. A promising solution is to harvest energy from environmental sources, such as solar, kinetic, thermal and radio frequency, for perpetual and continuous operation of IoT sensor nodes. In addition to energy generation, recently energy harvesters have been used for context detection, eliminating the need for additional activity sensors (e.g. accelerometers), saving space, cost, and energy consumption. Using energy harvesters for simultaneous sensing and energy harvesting enables energy positive sensing -- an important and emerging class of sensors, which harvest higher energy than required for signal acquisition and the additional energy can be used to power other components of the system. Although simultaneous sensing and energy harvesting is an important step forward towards autonomous self-powered sensor nodes, the energy and information availability can be still intermittent, unpredictable and temporally misaligned with various computational tasks on the sensor node. This paper provides a comprehensive survey on task scheduling algorithms for the emerging class of energy harvesting-based sensors (i.e., energy positive sensors) to achieve the sustainable operation of IoT. We discuss inherent differences between conventional sensing and energy positive sensing and provide an extensive critical analysis for devising new task scheduling algorithms incorporating this new class of sensors. Finally, we outline future research directions towards the implementation of autonomous and self-powered IoT.

eess.SP↗

arXiv2020

Towards Optimal Kinetic Energy Harvesting for the Batteryless IoT

Traditional Internet of Things (IoT) sensors rely on batteries that need to be replaced or recharged frequently which impedes their pervasive deployment. A promising alternative is to employ energy harvesters that convert the environmental energy into electrical energy. Kinetic Energy Harvesting (KEH) converts the ambient motion/vibration energy into electrical energy to power the IoT sensor nodes. However, most previous works employ KEH without dynamically tracking the optimal operating point of the transducer for maximum power output. In this paper, we systematically analyse the relation between the operating point of the transducer and the corresponding energy yield. To this end, we explore the voltage-current characteristics of the KEH transducer to find its Maximum Power Point (MPP). We show how this operating point can be approximated in a practical energy harvesting circuit. We design two hardware circuit prototypes to evaluate the performance of the proposed mechanism and analyse the harvested energy using a precise load shaker under a wide set of controlled conditions typically found in human-centric applications. We analyse the dynamic current-voltage characteristics and specify the relation between the MPP sampling rate and harvesting efficiency which outlines the need for dynamic MPP tracking. The results show that the proposed energy harvesting mechanism outperforms the conventional method in terms of generated power and offers at least one order of magnitude higher power than the latter.

eess.SP↗

arXiv2020

Towards Energy Positive Sensing using Kinetic Energy Harvesters

Conventional systems for motion context detection rely on batteries to provide the energy required for sampling a motion sensor. Batteries, however, have limited capacity and, once depleted, have to be replaced or recharged. Kinetic Energy Harvesting (KEH) allows to convert ambient motion and vibration into usable electricity and can enable batteryless, maintenance free operation of motion sensors. The signal from a KEH transducer correlates with the underlying motion and may thus directly be used for context detection, saving space, cost and energy by omitting the accelerometer. Previous work uses the open circuit or the capacitor voltage for sensing without using the harvested energy to power a load. In this paper, we propose to use other sensing points in the KEH circuit that offer information rich sensing signals while the energy from the harvester is used to power a load. We systematically analyse multiple sensing signals available in different KEH architectures and compare their performance in a transport mode detection case study. To this end, we develop four hardware prototypes, conduct an extensive measurement campaign and use the data to train and evaluate different classifiers. We show that sensing the harvesting current signal from a transducer can be energy positive, delivering up to ten times as much power as it consumes for signal acquisition, while offering comparable detection accuracy to the accelerometer signal for most of the considered transport modes.

eess.SP↗

arXiv2019

Joint QoS-control and Handover Optimization in Backhaul aware SDN-based LTE Networks

Future cellular networks will be dense and require key traffic management technologies for fine-grained network control. The problem gets more complicated in the presence of different network segments with bottleneck links limiting the desired quality of service (QoS) delivery to the last mile user. In this work, we first design a framework for software-defined cellular networks (SDCN) and then propose new mechanisms for management of QoS and non-QoS users traffic considering both access and backhaul networks, jointly. The overall SDN-LTE system and related approaches are developed and tested using network simulator (ns-3) in different network environments. Especially, when the users are non-uniformly distributed, the results shows that compared to other approaches, the proposed load distribution algorithm enables at least 6\% and 23\% increase in the average QoS user downlink (DL) throughput for all network users and 40\%-ile edge users, respectively. Also, the proposed system efficiently achieves desired QoS and handles the network congestion without incurring significant overhead.

cs.NI↗

arXiv2018

MAC-Layer Rate Control for 802.11 Networks: Lesson Learned and Looking Forward

Rate control at the MAC-layer is one of the fundamental building blocks in many wireless networks. Over the past two decades around thirty mechanisms have been proposed in the literature. Among them, there are mechanisms that make rate selection decisions based on sophisticated measurements of wireless link quality, and others that are based on straight-forward heuristics. Minstrel, for example, is an elegant mechanism that has been adopted by hundreds of millions of computers, yet, not much was known about its performance until recently. The purpose of this paper is to provide a comprehensive survey and analysis of existing solutions from the two fundamental aspects of rate control - metrics and algorithms. We also review how these solutions were evaluated and compared against each other. Based on our detailed studies and observations, we share important insights on future development of rate control mechanisms at the MAC-layer. This discussion also takes into account the recent developments in wireless technologies and emerging applications, such as Internet-of-Things, and shows issues that need to be addressed in the design of new rate control mechanisms suitable for these technologies and applications.

cs.NI↗

arXiv2016

SCOR: Software-defined Constrained Optimal Routing Platform for SDN

A Software-defined Constrained Optimal Routing (SCOR) platform is introduced as a Northbound interface in SDN architecture. It is based on constraint programming techniques and is implemented in MiniZinc modelling language. Using constraint programming techniques in this Northbound interface has created an efficient tool for implementing complex Quality of Service routing applications in a few lines of code. The code includes only the problem statement and the solution is found by a general solver program. A routing framework is introduced based on SDN's architecture model which uses SCOR as its Northbound interface and an upper layer of applications implemented in SCOR. Performance of a few implemented routing applications are evaluated in different network topologies, network sizes and various number of concurrent flows.

cs.NI↗

arXiv2015

Modelling and Verifying the AODV Routing Protocol

This paper presents a formal specification of the Ad hoc On-Demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been tailored for the modelling of Mobile Ad Hoc Networks and Wireless Mesh Network protocols. Our formalisation models the exact details of the core functionality of AODV, such as route discovery, route maintenance and error handling. We demonstrate how AWN can be used to reason about critical protocol properties by providing detailed proofs of loop freedom and route correctness.

cs.NI↗

arXiv2015

A Rigorous Analysis of AODV and its Variants

In this paper we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol using a formal specification in AWN (Algebra for Wireless Networks), a process algebra which has been specifically tailored for the modelling of Mobile Ad Hoc Networks and Wireless Mesh Network protocols. Our formalisation models the exact details of the core functionality of AODV, such as route discovery, route maintenance and error handling. We demonstrate how AWN can be used to reason about critical protocol correctness properties by providing a detailed proof of loop freedom. In contrast to evaluations using simulation or other formal methods such as model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, traffic pattern, etc. A key contribution of this paper is the demonstration of how the reasoning and proofs can relatively easily be adapted to protocol variants.

cs.NI↗

arXiv2015

Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops

In the area of mobile ad-hoc networks and wireless mesh networks, sequence numbers are often used in routing protocols to avoid routing loops. It is commonly stated in protocol specifications that sequence numbers are sufficient to guarantee loop freedom if they are monotonically increased over time. A classical example for the use of sequence numbers is the popular Ad hoc On-Demand Distance Vector (AODV) routing protocol. The loop freedom of AODV is not only a common belief, it has been claimed in the abstract of its RFC and at least two proofs have been proposed. AODV-based protocols such as AODVv2 (DYMO) and HWMP also claim loop freedom due to the same use of sequence numbers. In this paper we show that AODV is not a priori loop free; by this we counter the proposed proofs in the literature. In fact, loop freedom hinges on non-evident assumptions to be made when resolving ambiguities occurring in the RFC. Thus, monotonically increasing sequence numbers, by themselves, do not guarantee loop freedom.

cs.NI↗

arXiv2015

Modelling and Analysis of AODV in UPPAAL

This paper describes work in progress towards an automated formal and rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, a popular protocol used in ad hoc wireless networks. We give a brief overview of a model of AODV implemented in the UPPAAL model checker, and describe experiments carried out to explore AODV's behaviour in two network topologies. We were able to locate automatically and confirm some known problematic and undesirable behaviours. We believe this use of model checking as a diagnostic tool complements other formal methods based protocol modelling and verification techniques, such as process algebras. Model checking is in particular useful for the discovery of protocol limitations and in the development of improved variations.

cs.NI↗

arXiv2015

Automated Analysis of AODV using UPPAAL

This paper describes an automated, formal and rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, a popular protocol used in wireless mesh networks. We give a brief overview of a model of AODV implemented in the UPPAAL model checker. It is derived from a process-algebraic model which reflects precisely the intention of AODV and accurately captures the protocol specification. Furthermore, we describe experiments carried out to explore AODV's behaviour in all network topologies up to 5 nodes. We were able to automatically locate problematic and undesirable behaviours. This is in particular useful to discover protocol limitations and to develop improved variants. This use of model checking as a diagnostic tool complements other formal-methods-based protocol modelling and verification techniques, such as process algebra.

cs.NI↗

arXiv2015

A Process Algebra for Wireless Mesh Networks

We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.

cs.LO↗

arXiv2013

A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV

We propose AWN (Algebra for Wireless Networks), a process algebra tailored to the modelling of Mobile Ad hoc Network (MANET) and Wireless Mesh Network (WMN) protocols. It combines novel treatments of local broadcast, conditional unicast and data structures. In this framework we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group. We give a complete and unambiguous specification of this protocol, thereby formalising the RFC of AODV, the de facto standard specification, given in English prose. In doing so, we had to make non-evident assumptions to resolve ambiguities occurring in that specification. Our formalisation models the exact details of the core functionality of AODV, such as route maintenance and error handling, and only omits timing aspects. The process algebra allows us to formalise and (dis)prove crucial properties of mesh network routing protocols such as loop freedom and packet delivery. We are the first to provide a detailed proof of loop freedom of AODV. In contrast to evaluations using simulation or model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, etc. Due to ambiguities and contradictions the RFC specification allows several interpretations; we show for more than 5000 of them whether they are loop free or not, thereby demonstrating how the reasoning and proofs can relatively easily be adapted to protocol variants. Using our formal and unambiguous specification, we find shortcomings of AODV that affect performance, e.g. the establishment of non-optimal routes, and some routes not being found at all. We formalise improvements in the same process algebra; carrying over the proofs is again easy.

cs.NI↗

arXiv2012

The groupies of random multipartite graphs

If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.

math.CO↗