This paper provides an overview of the Internet of Things (IoT) with emphasis on enabling technologies, protocols, and application issues. The IoT is enabled by the latest developments in RFID, smart sensors, communication technologies, and Internet protocols. The basic premise is to have smart sensors collaborate directly without human involvement to deliver a new class of applications. The current revolution in Internet, mobile, and machine-to-machine (M2M) technologies can be seen as the first phase of the IoT. In the coming years, the IoT is expected to bridge diverse technologies to enable new applications by connecting physical objects together in support of intelligent decision making. This paper starts by providing a horizontal overview of the IoT. Then, we give an overview of some technical details that pertain to the IoT enabling technologies, protocols, and applications. Compared to other survey papers in the field, our objective is to provide a more thorough summary of the most relevant protocols and application issues to enable researchers and application developers to get up to speed quickly on how the different protocols fit together to deliver desired functionalities without having to go through RFCs and the standards specifications. We also provide an overview of some of the key IoT challenges presented in the recent literature and provide a summary of related research work. Moreover, we explore the relation between the IoT and other emerging technologies including big data analytics and cloud and fog computing. We also present the need for better horizontal integration among IoT services. Finally, we present detailed service use-cases to illustrate how the different protocols presented in the paper fit together to deliver desired IoT services.

Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications

Networked sensors-those that coordinate amongst themselves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present unique challenges in the design of unattended autonomous sensor networks. These challenges lead us to hypothesize that sensor network coordination applications may need to be structured differently from traditional network applications. In particular, we believe that localized algorithms (in which simple local node behavior achieves a desired global objective) may be necessary for sensor network coordination. In this paper, we describe localized algorithms, and then discuss directed diffusion, a simple communication model for describing localized algorithms.

https://www.cs.jhu.edu/~cs647/class-papers/Sensor%20Nets/estrin.pdf

Next century challenges: scalable coordination in sensor networks

Underwater sensor nodes will find applications in oceanographic data collection, pollution monitoring, offshore exploration, disaster prevention, assisted navigation and tactical surveillance applications. Moreover, unmanned or autonomous underwater vehicles (UUVs, AUVs), equipped with sensors, will enable the exploration of natural undersea resources and gathering of scientific data in collaborative monitoring missions. Underwater acoustic networking is the enabling technology for these applications. Underwater networks consist of a variable number of sensors and vehicles that are deployed to perform collaborative monitoring tasks over a given area. In this paper, several fundamental key aspects of underwater acoustic communications are investigated. Different architectures for two-dimensional and three-dimensional underwater sensor networks are discussed, and the characteristics of the underwater channel are detailed. The main challenges for the development of efficient networking solutions posed by the underwater environment are detailed and a cross-layer approach to the integration of all communication functionalities is suggested. Furthermore, open research issues are discussed and possible solution approaches are outlined. � 2005 Published by Elsevier B.V.

/pdf/underwater-acoustic-sensor-networks-research-challenges-15fjl1gvhc.pdf

Underwater acoustic sensor networks: research challenges

National Institute of Standards and Technology における超伝導研究及び生活

Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. Military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in the design of these networks is their vulnerability to security attacks. In this article, we study the threats on ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks. We also use replication and new cryptographic schemes, such as threshold cryptography, to build a highly secure and highly available key management service, which terms the core of our security framework.

/pdf/securing-ad-hoc-networks-3hudjv4io2.pdf

Securing ad hoc networks

This document describes the Lightweight Ad hoc On-Demand - Next
Generation (LOADng) distance vector routing protocol, a reactive
routing protocol intended for use in Mobile Ad hoc NETworks (MANETs).

The Lightweight On-demand Ad hoc Distance-vector Routing Protocol - Next Generation (LOADng)

The Ad hoc On-demand Distance-Vector routing protocol (AODV) was published in 2003 by the IETF, as experimental RFC 3561. This routing protocol was one of four routing protocols, developed by the IETF for use in mobile ad hoc networks (MANETs) -- with the other being DSR, TBRPF and OLSR. As operational experiences with these protocols accumulated, the IETF set forth on standardization of OLSRv2, a successor to OLSR, and DYMO -- with DYMO being the intended successor to DSR and AODV. Alas, while there was traction for and standardization of OLSRv2, interest in, development, standardization, and use of DYMO in MANETs slowly withered. AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV. This paper presents this development -- from AODV, as specified in RFC3561 -- to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes "from AODV to LOADng", and observes that LOADng unites simplification, flexibility and performance improvements.

/pdf/loadng-towards-aodv-version-2-303lmxnez2.pdf

LOADng: Towards AODV Version 2

We study the impact of using partial versus full topology in the OLSR (optimized link state routing) protocol for MANETs (mobile ad hoc networks). The core of OLSR is the notion of multi-point relays (MPRs), serving the purpose of reducing the amount of link-state information flooded to nodes in the network, as well as reducing the redundancy in the flooding process. The OLSR protocol specification contains a tunable parameter, MPR coverage, which adjusts the degree of redundancy in both the advertised link-state information, and the links over which the link-state information is advertised. We investigate the impact of assigning various values to this parameter. We further investigate two options for advertising additional link-state information: the "MPR full link-state" option implies that whenever a node is selected to declare any link-state information, it declares all its local link state information; the "full link-state" option states, that all nodes must declare all their local link-state information. Through simulations, we investigate the performance characteristics of OLSR with and without these options.

/pdf/investigating-the-impact-of-partial-topology-in-proactive-e0kqy6kfci.pdf

Investigating the impact of partial topology in proactive MANET routing protocols

Network load-balancers generally either do not take the application state into account, or do so at the cost of a centralized monitoring system. This paper introduces a load-balancer running exclusively within the IP forwarding plane, i.e., in an application protocol agnostic fashion – yet which still provides application-awareness and makes real-time, decentralized decisions. To that end, IPv6 Segment Routing is used to direct data packets from a new flow through a chain of candidate servers, until one decides to accept the connection, based solely on its local state. This way, applications themselves naturally decide on how to fairly share incoming connections, while incurring minimal network overhead, and no out-of-band signaling. A consistent hashing algorithm, as well as an in-band stickiness protocol, allow for the proposed solution to be able to be reliably distributed across a large number of instances. Performance evaluation by means of an analytical model and actual tests on different workloads (including a Wikipedia replay as a realistic workload) show significant performance benefits in terms of shorter response times, when compared with the traditional random load-balancer. In addition, this paper introduces and compares kernel bypass high-performance implementations of both 6LB and the state-of-the-art load-balancer, showing that the significant system-level benefits of 6LB are achievable with a negligible data-path CPU overhead.

/pdf/6lb-scalable-and-application-aware-load-balancing-with-yptbidjpu8.pdf

6LB: Scalable and Application-Aware Load Balancing with Segment Routing

This document describes a general and flexible TLV (type-length-value
structure) for representing time using the generalized MANET packet/
message format. It defines two message and two address block TLVs for
representing validity and interval times for MANET routing protocols.

/pdf/representing-multi-value-time-in-mobile-ad-hoc-networks-1xr3tozebu.pdf

Thomas Clausen

Papers

The Lightweight On-demand Ad hoc Distance-vector Routing Protocol - Next Generation (LOADng)

LOADng: Towards AODV Version 2

Investigating the impact of partial topology in proactive MANET routing protocols

6LB: Scalable and Application-Aware Load Balancing with Segment Routing

Representing Multi-Value Time in Mobile Ad Hoc Networks (MANETs)