Sciweavers

2149 search results - page 280 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 1 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
IPSN
2010
Springer
15 years 3 months ago
Information processing for live photo mosaic with a group of wireless image sensors
Photo tourism [11] is a platform that allows users to transform unstructured online digital photos into a 3D experience. Nowadays, image sensors are being extensively used to allo...
Fulu Li, James Barabas, Ana L. Santos
IPPS
2006
IEEE
15 years 7 months ago
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...
Haiying Shen, Cheng-Zhong Xu
103
Voted
SENSYS
2006
ACM
15 years 7 months ago
StarDust: a flexible architecture for passive localization in wireless sensor networks
The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, en...
Radu Stoleru, Pascal Vicaire, Tian He, John A. Sta...
WSNA
2003
ACM
15 years 6 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li