Sciweavers

65 search results - page 7 / 13
» Ad-hoc On-Demand Distance Vector Routing
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
15 years 3 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
PIMRC
2010
IEEE
14 years 7 months ago
Self-optimizing routing in MANETs with multi-class flows
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
Pierre Coucheney, Bruno Gaujal, Corinne Touati
ICNS
2007
IEEE
15 years 3 months ago
A Routing Based Service Discovery Protocol for Ad hoc Networks
: Ad hoc networks are networks that consist of wireless mobile nodes. They are networks that do not require any preestablished infrastructure. Their ability to quickly and dynamica...
Abdel Obaid, Azeddine Khir, Hafedh Mili
ACNS
2004
Springer
142views Cryptology» more  ACNS 2004»
15 years 2 months ago
S-RIP: A Secure Distance Vector Routing Protocol
Distance vector routing protocols (e.g., RIP) have been widely used on the Internet, and are being adapted to emerging wireless ad hoc networks. However, it is well-known that exis...
Tao Wan, Evangelos Kranakis, Paul C. van Oorschot
CCR
2002
98views more  CCR 2002»
14 years 9 months ago
Efficient flooding with Passive Clustering (PC) in ad hoc networks
An ad hoc network is a fast deployable selfconfiguring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Node...
Taek Jin Kwon, Mario Gerla