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

Packets are transmitted between stations of an ad-hoc network of mobile stations by using routing tables which are stored at each station of the network. Routing information is broadcast or multicast according to three schedules; upon demand to show new routes, periodically to show recently changed routes, and less often to provide a complete dump of all known routes. A new route will trigger immediate re-broadcast so that this information is quickly disseminated. A new route is defined to be one with a better metric or a metric of infinity. A metric of infinity indicates a broken link; i.e., a particular destination is no longer reachable and thus all other destinations depending upon the newly unreachable destination are themselves unreachable. Periodically, routes are advertised. This advertisement serves primarily in most cases to notify all neighbors that everything they have stored is still correct regarding the broadcasting Mobile Host. On rarer occasions when the routing topology changes, the demand nature of the incremental update displaces the periodic transmission until an update interval transpires. In order to damp out oscillations, data is kept about how often the routes change. Based on this data, a decision may be made to delay advertising routes which are about to change soon, thus damping oscillations of the route tables.

Highly dynamic destination-sequenced destination vector routing for mobile computers

Route Optimization in Mobile IP

From the Book:
PREFACE: 
Two technological advances in recent years have radically altered the nature of computing for most computer users The first is mobility Laptop computers now represent the fastest growing segment of the computer market Most observers expect that laptop computers, palmtop computers, networked personal digital assistants, and other such mobile computers will eventually represent the majority of the stations connected to the Internet The advantage of mobile computing is that users may access all their applications from any location, whether they are in another building or a different state The second advance is the widespread use of the Internet for communication, file transfer, and World Wide Web connectivity This book describes how to make a mobile computer user a citizen of the Internet and how to access everything the information superhighway has to offer The goal of this book is to provide you with an introduction to the design and implementation of Internet protocols that are useful for maintaining network connections even while moving from place to place We look at several protocols including Mobile IP, route optimization, IP version 6, the Dynamic Host Configuration Protocol, encapsulation, source routing, and some related miscellaneous topics still under development

To take full advantage of the information in this book, you should be familiar with basic Internet protocols, such as the Transmission Control Protocol (TCP)/IP Rich Stevens' book TCP/IP Illustrated, Volume 1: The Protocols and Douglas Comer's Internetworking with TCP/IP both provide excellent introductions to TCP/IP As a developer of hardware and softwareproductsfor the Internet, you should have these books on your shelves

By the time you finish Mobile IP: Design Principles and Practices, you will be able to implement Mobile IP, and will have a clear understanding of the system impact of mobility You will also understand the relevant protocols, and the traps and pitfalls that you are likely to encounter along the way

As you read the book, you will notice many italicized terms, some of which have conventional meanings that may be different than one's first impression (for example, foreign agent) These terms are defined in the Glossary: Please check definitions there, and be sure that you understand a term's meaning before moving on in the text 

0201634694P04062001

Mobile IP : design principles and practices

Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing

Mobile IP is a proposed standard protocol that builds on the Internet Protocol by making mobility transparent to applications and higher level protocols like TCP. Mobile IP (RFC 2002) is a standard proposed by a working group within the Internet Engineering Task Force; it allows the mobile node to use two IP addresses: a fixed home address and a care-of address that changes at each new point of attachment. The article presents the Mobile IP standard in moderate technical detail and points the reader toward a wealth of further information. Is also describes how Mobile IP will change with IP version 6, the product of a major effort within the IETF to engineer an eventual replacement for the current version of IP. Although IPv6 will support mobility to a greater degree than IPv4, it will still need Mobile IP to make mobility transparent to applications and higher level protocols such as TCP. There is a great deal of interest in mobile computing and apparently in Mobile IP as a way to provide for it. A quick Web search for items related to Mobile IP returned over 60,000 hits-impressive even given the notorious lack of selectivity for such procedures. Mobile IP forms the basis either directly or indirectly of many current research efforts and products. The Cellular Digital Packet Data (CDPD), for example, has created a widely deployed communications infrastructure based on a previous draft specification of the protocol. In addition, most major router vendors have developed implementations for Mobile IP.

/pdf/mobile-networking-through-mobile-ip-4edc3zdhot.pdf

Charles E. Perkins

Papers

Highly dynamic destination-sequenced destination vector routing for mobile computers

Route Optimization in Mobile IP

Mobile IP : design principles and practices

Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing

Mobile networking through Mobile IP