Sciweavers

14 search results - page 1 / 3
» Avoiding Counting to Infinity in Distance Vector Routing
Sort
View
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
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
INFOCOM
2008
IEEE
13 years 10 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
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...
ICC
2008
IEEE
141views Communications» more  ICC 2008»
13 years 10 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan