scispace - formally typeset
Open AccessBook

Ad Hoc Networking

TLDR
In this article, the authors present a series of technical papers about ad hoc networks from a variety of laboratories and experts, and explain the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity.
Abstract
Ad hoc networks are to computing devices what Yahoo Personals are to single people: both help individuals communicate productively with strangers while maintaining security. Under the rules of ad hoc networking--which continue to evolve--your mobile phone can, when placed in proximity to your handheld address book, establish a little network on its own and enable data sharing between the two devices. In Ad Hoc Networking, Charles Perkins has compiled a series of technical papers about networking on the fly from a variety of laboratories and experts. The collection explains the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity. In this treatment, ad hoc networking covers a broad swath of situations. An ad hoc network might consist of several home-computing devices, plus a notebook computer that must exist on home and office networks without extra administrative work. Such a network might also need to exist when the people and equipment in normally unrelated military units need to work together in combat. Though the papers in this book are much more descriptive of protocols and algorithms than of their implementations, they aim individually and collectively at commercialization and popularization of mobile devices that make use of ad hoc networking. You'll enjoy this book if you're involved in researching or implementing ad hoc networking capabilities for mobile devices. --David Wall Topics covered: The state-of-the-art in protocols and algorithms to be used in ad hoc networks of mobile devices that move in and out of proximity to one another, to fixed resources like printers, and to Internet connectivity. Routing with Destination-Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad hoc On-Demand Distance Vector (AODV), and other resource-discovery and routing protocols; the effects of ad hoc networking on bandwidth consumption; and battery life.

read more

Citations
More filters
Book ChapterDOI

Wireless Ad Hoc Networking

TL;DR: In this article, mobile ad hoc networks and their characteristics are described, and the design issues, applications and future trends of such networks will be discussed.
Journal Article

Adaptive Optimizing of Hello Messages in Wireless Ad-Hoc Networks

TL;DR: Extensive performance analysis via simulation proves the effectiveness of the proposed fuzzy algorithm used to model the uncertainty measurements for updating local connectivity successfully in time to improve the accuracy of neighborhood information and hence the overall network performance.
Journal ArticleDOI

Optimizing Service Selection and Allocation in Situational Computing Applications

TL;DR: A novel model for the service selection problem of workflow-based applications in the context of self-managing situated computing, which evaluates at runtime the optimal binding to concrete services as well as the tradeoff between the remote execution of software fragments and their dynamic deployment on local nodes of the computational environment.
Proceedings ArticleDOI

On the definition of ad hoc network connectivity

Dan Yu, +1 more
TL;DR: The proposed ad hoc network path connectivity is different from, but closely related to academically used graph connectivity definition, and its relationships between other common measurements of network connectivity are carefully studied.
Journal ArticleDOI

Randomly Ranked Mini Slots for Fair and Efficient Medium Access Control in Ad Hoc Networks

TL;DR: This paper proposes a MAC protocol that can achieve an excellent balance between throughput and fairness and makes use of granule time slots and sequences of pseudorandom numbers to maximize spatial reuse and divide the throughput fairly among nodes.