ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. BitTorrent is one of the Internet’s most efficient content distribution protocols. It is known to perform very well over the wired Internet where end-to-end performance...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Providing service discovery in an efficient and scalable way in ad hoc networks is a challenging problem, in particular for multihop scenarios, due to the large number of potential...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Energy-efficient query dissemination plays an important role for the lifetime of sensor networks. In this work, we consider probabilistic flooding for query dissemination and deve...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
The development of Wireless Body Area Networks (WBANs) for wireless sensing and monitoring of a person’s vital functions, is an enabler in providing better personal health care w...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
The paper investigates the usefulness of multi-path routing to achieve lifetime improvements by load balancing and exploiting cross-layer information in wireless sensor networks. P...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...