Destination-Sequenced Distance Vector routing

About: Destination-Sequenced Distance Vector routing is a research topic. Over the lifetime, 20341 publications have been published within this topic receiving 490663 citations.

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

Abstract: A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.

Ad Hoc Networking

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.

Ad hoc positioning system (APS)

Abstract: Many ad hoc network protocols and applications assume the knowledge of geographic location of nodes. The absolute location of each networked node is an assumed fact by most sensor networks which can then present the sensed information on a geographical map. Finding location without the aid of GPS in each node of an ad hoc network is important in cases where GPS is either not accessible, or not practical to use due to power, form factor or line of sight conditions. Location would also enable routing in sufficiently isotropic large networks, without the use of large routing tables. We are proposing APS - a distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate location for all nodes in a network where only a limited fraction of nodes have self location capability.

Routing in a delay tolerant network

Abstract: We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also find that with limited additional knowledge, far less than complete global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs.

Ariadne: a secure on-demand routing protocol for ad hoc networks

Abstract: An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents a large number of types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.