Sciweavers

43 search results - page 1 / 9
» Area Avoidance Routing in Distance-Vector Networks
Sort
View
INFOCOM
2008
IEEE
13 years 11 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy
INFOCOM
2007
IEEE
13 years 10 months ago
Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...
Haim Zlatokrilov, Hanoch Levy
TELSYS
2002
73views more  TELSYS 2002»
13 years 4 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
PERCOM
2003
ACM
13 years 9 months ago
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks
We investigate the performance issues of destinationsequenced distance vector (DSDV) and ad-hoc on-demand distance vector (AODV) routing protocols for mobile ad hoc networks. Four...
Yi Lu, Weichao Wang, Yuhui Zhong, Bharat K. Bharga...
ICWN
2004
13 years 5 months ago
Does Cluster Architecture Enhance Performance Scalability of Clustered Mobile Ad Hoc Networks?
This paper explains and evaluates the performance of a cluster architecture-based routing protocol, called Link Cluster Protocol (LCP), in mobile ad hoc networks (MANETs). LCP show...
Myeong L. Lim, Chansu Yu