https://cs.uwaterloo.ca/~brecht/courses/854-Emerging-2014/readings/iot/iot-survey.pdf

The Internet of Things: A survey

The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.

/pdf/ad-hoc-on-demand-distance-vector-aodv-routing-2v7bybe614.pdf

Ad hoc On-Demand Distance Vector (AODV) Routing

An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.

/pdf/ad-hoc-on-demand-distance-vector-routing-3w61wv0p1h.pdf

Ad-hoc on-demand distance vector routing

Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

/pdf/an-application-specific-protocol-architecture-for-wireless-1s7y9fiv40.pdf

An application-specific protocol architecture for wireless microsensor networks

Wireless Communications

Ad hoc networks are autonomous collections of devices that establish connectivity without the need for infrastructure devices. Typically, the network links are modeled as wireless links and the network nodes are considered able to move freely, so that wireless links frequently fail as neighbors move away from each other, and new links form when two nodes approach. These networks have many applications, including the following (among others):• automotive networks• ad hoc conferencing• mesh networks• sensor networks• range extension for cellular telephone networks• embedded computing

Ad Hoc Networks, IETF, and convergence in solution space: extended abstract

Zielvektor-Leitweglenkung in Reihenfolge der Ziele für mobile Rechner.

This document specifies a new extension for use by Foreign Agents
operating Mobile IP for IPv4. Currently, a foreign agent cannot supply
status information without destroying the ability for a mobile node to
verify authentication data supplied by the home agent. The new
extension solves this problem by making a better place for the foreign
agent to provide its status information to the mobile node.
[STANDARDS-TRACK]

/pdf/foreign-agent-error-extension-for-mobile-ipv4-1iychgjtyp.pdf

Charles E. Perkins

Papers

Ad Hoc Networks, IETF, and convergence in solution space: extended abstract

Zielvektor-Leitweglenkung in Reihenfolge der Ziele für mobile Rechner.

Foreign Agent Error Extension for Mobile IPv4

Mobil-router-unterstützung für ipv6