440 search results - page 56 / 88 » Path set selection in mobile ad hoc networks |
100
click to vote
WONS
2005
IEEE
15 years 5 months ago
2005
IEEE
Increasing need for people to be “connected”; while at the same time remain as mobile as ever poses several interesting issues in wireless networks. It is conceivable in the n...
102
click to vote
ICPP
2000
IEEE
15 years 4 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...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Vehicular ad hoc networks using WLAN technology have recently received considerable attention. We present a position-based routing scheme called Connectivity-Aware Routing (CAR...
107
click to vote
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
115
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. Th...