Sciweavers

4984 search results - page 868 / 997
» Network-Assisted Wireless Computing
Sort
View
MOBIHOC
2002
ACM
16 years 2 months ago
Performance analysis of the CONFIDANT protocol
: Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate...
Sonja Buchegger, Jean-Yves Le Boudec
MOBIHOC
2002
ACM
16 years 2 months ago
Algorithmic aspects of topology control problems for ad hoc networks
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ra...
MOBIHOC
2001
ACM
16 years 2 months ago
Comparison between graph-based and interference-based STDMA scheduling
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
Anders Hansson, Jimmi Grönkvist
MOBIHOC
2001
ACM
16 years 2 months ago
Geometric spanner for routing in mobile networks
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...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
MOBIHOC
2001
ACM
16 years 2 months ago
A probabilistic analysis for the range assignment problem in ad hoc networks
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...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...