Sciweavers

1008 search results - page 10 / 202
» Routing in intermittent network topologies
Sort
View
171
Voted
ICOIN
2003
Springer
15 years 7 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid
ICPP
1992
IEEE
15 years 6 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss
JSA
2006
86views more  JSA 2006»
15 years 1 months ago
High-performance adaptive routing for networks with arbitrary topology
A strategy to implement adaptive routing in irregular networks is presented and analyzed in this work. A simple and widely applicable deadlock avoidance method, applied to a ring ...
Valentin Puente, José A. Gregorio, Fernando...
115
Voted
JUCS
2008
138views more  JUCS 2008»
15 years 1 months ago
A Knowledge Discovery Agent for a Topology Bit-map in Ad Hoc Mobile Networks
: A central characteristic of ad hoc mobile networks is the frequent changes of their topology. This is the source of many problems that need to be solved. AODV is an on-demand rou...
SungSoo Lee, HangKon Kim, ChongGun Kim
94
Voted
ICUMT
2009
14 years 11 months ago
Coordinate-based routing: Refining nodeIds in structured peer-to-peer systems
Structured peer-to-peer systems--also known as key-based routing protocols--offer a base for a broad range of applications. In the past, different topology adaptation mechanisms fo...
Fabian Hartmann, Bernhard Heep