Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers

CE Perkins, P Bhagwat - ACM SIGCOMM computer communication …, 1994 - dl.acm.org
An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the
required intervention of any centralized Access Point. In this paper we present an innovative …

A highly adaptive distributed routing algorithm for mobile wireless networks

VD Park, MS Corson - Proceedings of INFOCOM'97, 1997 - ieeexplore.ieee.org
We present a new distributed routing protocol for mobile, multihop, wireless networks. The
protocol is one of a family of protocols which we term" link reversal" algorithms. The …

AntNet: Distributed stigmergetic control for communications networks

G Di Caro, M Dorigo - Journal of Artificial Intelligence Research, 1998 - jair.org
This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in
communications networks. AntNet is a distributed, mobile agents based Monte Carlo system …

Collective patterns and decision-making

JL Deneubourg, S Goss - Ethology Ecology & Evolution, 1989 - Taylor & Francis
Autocatalytic interactions between the members of an animal group or society, and
particularly chemically or visually mediated allelomimesis, can be an important factor in the …

Associativity-based routing for ad hoc mobile networks

CK Toh - Wireless personal communications, 1997 - Springer
This paper presents a new, simple and bandwidth-efficient distributed routing protocol to
support mobile computing in a conference size ad-hoc mobile network environment. Unlike …

[图书][B] OSPF: anatomy of an Internet routing protocol

JT Moy - 1998 - books.google.com
Readers will find clear explanations of routing fundamentals, such as how a router forwards
packets, IP addressing, CIDR (Classless Inter-Domain Routing), the routing table, Internet …

Algorithms for finding paths with multiple constraints

JM Jaffe - Networks, 1984 - Wiley Online Library
Abstract Let G=(V, E) be a graph with weight function w: E rightarrow Z+ and length function
l: E/rightarrow Z+. The problem of determining for v1, V2/in V whether there is a path from v1 …

A distributed routing algorithm for mobile wireless networks

MS Corson, A Ephremides - Wireless networks, 1995 - Springer
We present a loop-free, distributed routing protocol for mobile packet radio networks. The
protocol is intended for use in networks where the rate of topological change is not so fast as …

Distributed algorithms for generating loop-free routes in networks with frequently changing topology

E Gafni, D Bertsekas - IEEE transactions on communications, 1981 - ieeexplore.ieee.org
We consider the problem of maintaining communication between the nodes of a data
network and a central station in the presence of frequent topological changes as, for …

Loop-free routing using diffusing computations

JJ Garcia-Lunes-Aceves - IEEE/ACM transactions on …, 1993 - ieeexplore.ieee.org
A family of distributed algorithms for the dynamic computation of the shortest paths in a
computer network or internet is presented, validated, and analyzed. According to these …