1395 search results - page 29 / 279 » Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Netw... |
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...
ADHOC
2007
13 years 7 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
MOBICOM
2003
ACM
14 years 29 days ago
2003
ACM
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...