196 search results - page 35 / 40 » Clustering Overhead for Hierarchical Routing in Mobile Ad ho... |
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
JUCS
2007
13 years 7 months ago
2007
: Ad hoc wireless networks have enormous commercial and military potential because of their self-organizing capacity and mobility support. However, some specificities of these net...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Design, development and evaluation of adaptive, scalable, and power aware Bio/Nature inspired routing protocols has received a significant amount of attention in the recent past....
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents an approach to integrate publish/subscribe semantics with on-demand multicast in wireless ad hoc networks, providing dynamic group communication with fine-gra...