Sciweavers

1524 search results - page 255 / 305
» Adapting BitTorrent to Wireless Ad Hoc Networks
Sort
View
OPODIS
2010
14 years 7 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
GLOBECOM
2009
IEEE
14 years 7 months ago
Energy-Efficient Space-Time Coded Cooperative Routing in Multihop Wireless Networks
Due to the limited energy supplies of nodes in many applications like wireless sensor networks, energy efficiency is crucial for extending the lifetime of these networks. This pape...
Behrouz Maham, Ravi Narasimhan, Are Hjørung...
ICN
2005
Springer
15 years 3 months ago
An Energy Constrained Multi-hop Clustering Algorithm for Wireless Sensor Networks
A wireless sensor network is a new kind of wireless Ad-Hoc network consisting of a large number of small low cost, power constrained sensors deployed in a large area for gathering...
Navin Kumar Sharma, Mukesh Kumar
IPPS
2005
IEEE
15 years 3 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
EURONGI
2006
Springer
15 years 1 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer