Sciweavers

273 search results - page 17 / 55
» Local approximation schemes for ad hoc and sensor networks
Sort
View
IWCMC
2006
ACM
14 years 1 months ago
DSMA: an access method for MIMO ad hoc networks based on distributed scheduling
In this work, we analyze the effects of a distributed transmission coordination scheme that is particularly suited for ad hoc networks with the ability to exploit spatially–mult...
Paolo Casari, Marco Levorato, Michele Zorzi
COMSWARE
2007
IEEE
14 years 1 months ago
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
François Ingelrest, David Simplot-Ryl, Ivan...
ICNP
2006
IEEE
14 years 1 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
DCOSS
2011
Springer
12 years 7 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
MOBICOM
2006
ACM
14 years 1 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic