The dissertation presents an in-depth study of mobile routing protocols, particularly mobile collection protocols through a literature study, a theoretical model, and thorough experimental studies both in simulation and testbeds. A mobile collection service provides data delivery from stationary source nodes to a mobile user (or a sink) over multihop networks. One of the main contributions of this dissertation research is the Whirlpool Adhoc Routing Protocol (WARP), which efficiently routes data to a mobile destination within a static network. The key insight in WARP's design is that, when a destination moves, data traffic can use the existing topology to efficiently probe, repair, and communicate changes with the few control packets. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane, rather than control plane, is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at the destination makes it the region of highest traffic. The dissertation also provides a theoretical basis for WARPs behavior, defining an update area where the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology with the data plane.

The dissertation presents an in-depth study of mobile routing protocols, particularly mobile collection protocols through a literature study, a theoretical model, and thorough experimental studies both in simulation and testbeds. A mobile collection service provides data delivery from stationary source nodes to a mobile user (or a sink) over multihop networks. One of the main contributions of this dissertation research is the Whirlpool Adhoc Routing Protocol (WARP), which efficiently routes data to a mobile destination within a static network. The key insight in WARP's design is that, when a destination moves, data traffic can use the existing topology to efficiently probe, repair, and communicate changes with the few control packets. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane, rather than control plane, is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at the destination makes it the region of highest traffic. The dissertation also provides a theoretical basis for WARPs behavior, defining an update area where the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology with the data plane.

The authoritative guide to the state of the art in ad hoc wireless networking. Reflects the field's latest breakthroughs Covers media access, routing, service discovery, multicasting, power conservation, transport protocol, and much more Includes a complete narration of prototype implementation with communication performance results from practical field trials Introduces key applications for home, business, auto, and defense "Ad hoc" wireless networks eliminate the complexities of infrastructure setup and administration, enabling devices to create and join networks "on the fly"-anywhere, anytime, for virtually any application. The field is rapidly coming of age, reflecting powerful advances in protocols, systems, and real-world implementation experience. In Ad Hoc Mobile Wireless Networks, one of the field's leading researchers brings together these advances in a single consolidated and comprehensive archive. C.K. Toh covers all this, and more: Key challenges: device heterogeneity, diverse traffic profiles, mobility, and power conservation Routing protocols for ad hoc networks, including Associativity Based Routing (ABR) and other IETF MANET protocols Real-world implementation issues-including a complete prototype implementation Ad hoc wireless network performance: results obtained from the latest field trials Leading approaches to service discovery Addressing TCP over an ad hoc wireless network environment Support for multicast communications The role of Bluetooth and WAP Ad Hoc Mobile Wireless Networks introduces detailed application scenarios ranging from home and car to office and battlefield. C.K. Toh also introduces several of the field's leading projects, from Motorola's PIANO platform to UC Berkeley's "Smart Dust." Whether you're a researcher, scientist, implementer, consultant, technical manager, CTO, or student, you won't find a more authoritative and comprehensive guide to the new state of the art in ad hoc networking.

The rapid development of wireless digital communication technology has cre ated capabilities that software systems are only beginning to exploit. The falling cost of both communication and of mobile computing devices (laptop computers, hand-held computers, etc. ) is making wireless computing affordable not only to business users but also to consumers. Mobile computing is not a "scaled-down" version of the established and we- studied field of distributed computing. The nature of wireless communication media and the mobility of computers combine to create fundamentally new problems in networking, operating systems, and information systems. Further more, many of the applications envisioned for mobile computing place novel demands on software systems. Although mobile computing is still in its infancy, some basic concepts have been identified and several seminal experimental systems developed. This book includes a set of contributed papers that describe these concepts and sys tems. Other papers describe applications that are currently being deployed and tested. The first chapter offers an introduction to the field of mobile computing, a survey of technical issues, and a summary of the papers that comprise sub sequent chapters. We have chosen to reprint several key papers that appeared previously in conference proceedings. Many of the papers in this book are be ing published here for the first time. Of these new papers, some are expanded versions of papers first presented at the NSF-sponsored Mobidata Workshop on Mobile and Wireless Information Systems, held at Rutgers University on Oct 31 and Nov 1, 1994.

Master's Thesis from the year 2012 in the subject Computer Science - Software, Coventry University (MSRSAS - computer science and networking), course: Design and Implementation of the Extended Routing Information Protocol[ERIP] for Mobile Ad-hoc Networks in Linux, language: English, abstract: A Mobile Ad-hoc Network (MANET) is a network that can be established with no fixed infrastructure. This means that all its nodes behave as routers and take part in its discovery and maintenance of routes to other nodes in the network. Its routing protocol has to be able to cope with the new challenges that a MANET creates such as node mobility, security maintenance, quality of service, limited bandwidth and limited power supply. These challenges set new demands on MANET routing protocols, like low overhead operation, routing security and best path selection. This Thesis deals with the design and implementation of the Extended Routing Information Protocol (ERIP) for mobile ad-hoc networks in Linux. ERIP is a proactive protocol, characterized by low overhead operation, best path selection based on hop count, loop free working and routing security. Raw sockets are used for exchange of routing information, whereas data exchange happens via TCP or UDP sockets as required by the application. Low overhead operation of ERIP is guaranteed by using the incremental dump strategy. Incremental dumping of the routing table is realized by scheduling only partial updates, instead of full. The routing table is encrypted before broadcast using a simple shared key algorithm to provide routing security. The routing functionality of the implemented protocol is tested by first running ERIP on two laptops and using VLC media player to stream multimedia data between the laptops. The two laptops were then moved out of range of each other and intermediate nodes (laptops) were brought in that were running the same routing protocol. The data was communicated over multiple hops in near real time. The best path selection property was proved by setting up a network of ERIP nodes that had multiple paths between source and destination with different hop counts. The implemented protocol consistently routed data through the path that had the least hop count. Porting the developed protocol to the Linux kernel would allow it be part of the standard Linux distribution. Also, more complex cryptography algorithms can be implemented to provide data and routing security.

Document from the year 2020 in the subject Engineering - Computer Engineering, , language: English, abstract: Sensor nodes have restricted storage, computational and energy resources, these restrictions place a limit on the types of deployable routing mechanisms. Routing protocol disseminates information that enables the sensor nodes to select routes to communicate with other nodes on the network and the choice of the route is determined by the routing algorithms. Thus the routing protocol helps the nodes to gain knowledge about the topology of the network to which it is attached directly. There are mainly two types of routing processes: one is static routing and the other is dynamic routing. In a static routing, the routing tables are set up in a static manner in the nodes. The network routes for the packet are initially set between the nodes. However, if any node on the specified route fails, the data may not reach the destination. In a dynamic routing, routing tables in the routers often change whenever the possible routes change. Dynamic routing is more suitable as the nodes in WSNs may frequently change their position and die at any moment. The routing protocols are classified into single hop and multi hop routing. In a single hop routing, sensor node directly communicates with the sink to share the gathered information. Energy consumption is high in the network using single hop protocol. In multi hop routing, data is routed through the intermediate nodes to the base station. Each node transfers sensed data to the immediate node which in turn transfers the data to the next immediate node and finally the data reaches the base station. Energy consumption in this kind of routing protocol is less and thus the lifetime of the nodes is high. The major challenge to the efficient operation of wireless sensor network lies in its ability to deliver the sensed information from the nodes to the sink within the specific time duration without the loss of data packets with high security. The sensor nodes depend on the battery source for their operation which has limited capacity. Thus the energy resource of the sensor nodes has to be used efficiently in order to increase the operational lifetime of the network.