25 search results - page 5 / 5 » mobihoc 2001 |
111
click to vote
MOBIHOC
2001
ACM
15 years 11 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...
MOBIHOC
2001
ACM
15 years 11 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
108
click to vote
MOBIHOC
2000
ACM
15 years 4 months ago
2000
ACM
The rapid spreading of mobile computerized devices marks the beginning of a new computing paradigm characterized by ad hoc networking and spontaneous interaction, taking place tra...
140
click to vote
MOBIHOC
2001
ACM
15 years 11 months ago
2001
ACM
A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in formin...
MOBIHOC
2001
ACM
15 years 11 months ago
2001
ACM
In an ad hoc network, the use of source routing has many advantages, including simplicity, correctness, and flexibility. For example, all routing decisions for a packet are made b...