1966 search results - page 91 / 394 » Robust Routing in Wireless Ad Hoc Networks |
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
Vehicular ad hoc networks (VANETs) are envisioned to provide us with numerous interesting services in the near future. One of the most promising applications is the dissemination ...
122
click to vote
MOBIHOC
2002
ACM
15 years 11 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...
130
click to vote
MOBIHOC
2002
ACM
15 years 11 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...
108
click to vote
MSWIM
2006
ACM
15 years 5 months ago
2006
ACM
The simulation of wireless networks has been an important tool for researchers and the industry in the last years. Especially in the field of Mobile Ad Hoc Networking, most curre...
100
click to vote
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...