Insights on critical energy efficiency approaches in internet-of-things application

Internet-of-things (IoT) is one of the proliferated technologies that result in a larger scale of connection among different computational devices. However, establishing such a connection requires a fault-tolerant routing scheme. The existing routing scheme results in communication but does not address various problems directly linked with energy consumption. Cross layer-based scheme and optimization schemes are frequently used scheme for improving the energy efficiency performance in IoT. Therefore, this paper investigates the approaches where cross-layer-based schemes are used to retain energy efficiencies among resource-constrained devices. The paper discusses the effectivity of the approaches used to optimize network performance in IoT applications. The study outcome of this paper showcase that there are various open-end issues, which is required to be addressed effectively in order to improve the performance of application associated with the IoT system

Statistical model checking of ad hoc routing protocols in lossy grid networks

We extend recent work by Hofner and McIver con the performances of the ad hoc routing protocols AODV and DYMO in terms of routes established. Hofner and McIver apply statistical model checking to show that on arbitrary small networks (up to 5 nodes) the most recent, and apparently more robust, DYMO protocol is less efficient than AODV. Here, we reformulate their experiments on 4x3 toroidal networks, with possibly lossy communication. As a main result we demonstrate that, in this more realistic scenario, DYMO performs significantly better than AODV

Modeling and verifying the OLSR protocol using Uppaal

Masteroppgave i Informasjons- og kommunikasjonsteknologi IKT590 Universitetet i Agder 2014Wireless Mesh Networks (WMNs) are a popular technology due to their exibility andself-organizing nature that provide support for broadband communication. They areused in a wide range of application areas, such as public transportation, tunnels, realtime racing car telemetry and emergency response communication. Route _nding andmaintenance, two important factors determining the performance of such networks,are provided using routing algorithms. The Optimized Link State Routing (OLSR)protocol is an example of such algorithms which is used in this study.One issue about this protocol is that its speci_cation is in English that may causeambiguities or di_erent interpretations. The _rst contribution of this project is thedevelopment of a formal and unambiguous model of OLSR and its main functionalitiesusing timed automata as our formal speci_cation language. The second contributionof the project is a precise analysis of OLSR using the model checker Uppaal. By acareful automated analysis with Uppaal, the project shows a complementary approachto classical techniques, such as test-bed experiments and simulation.One overall goal of this study is the demonstration that automated, formal andrigorous analysis of real-world protocols is possible and can be achieved in a rathershort period of time. Our model covers all core components of OLSR and abstractsfrom the optional features. At the moment, the project analyses fundamental behaviorsuch as packet delivery; the model guarantees that a packet which is injected into anetwork is _nally delivered at the destination. Moreover, the study veri_es that nodesin the network can _nd shortest paths to other nodes

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

Formal Modeling and Analysis of Mobile Ad hoc Networks

Fokkink, W.J. [Promotor]Luttik, S.P. [Copromotor