586 search results - page 4 / 118 » A Distributed Graph Algorithm for Geometric Routing in Ad Ho... |
139
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
125
click to vote
ICPP
2000
IEEE
15 years 7 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
152
click to vote
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
152
Voted
BROADNETS
2004
IEEE
15 years 6 months ago
2004
IEEE
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone...
110
Voted
OPODIS
2008
15 years 4 months ago
2008
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...