Sciweavers

231 search results - page 33 / 47
» Minimizing Data and Synchronization Costs in One-Way Communi...
Sort
View
MOBIDE
2010
ACM
14 years 9 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
SRDS
1998
IEEE
15 years 1 months ago
View Consistency for Optimistic Replication
Optimistically replicated systems provide highly available data even when communication between data replicas is unreliable or unavailable. The high availability comes at the cost...
Ashvin Goel, Calton Pu, Gerald J. Popek
STACS
2005
Springer
15 years 2 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
69
Voted
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 9 months ago
A Distributed MAC Protocol for Cooperation in Random Access Networks
WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the ...
Georg Böcherer, Alexandre de Baynast
P2P
2007
IEEE
15 years 3 months ago
A Data Placement Scheme with Time-Related Model for P2P Storages
Maintaining desired data availability while minimizing costs is the primary challenge in designing P2P storages. Data placement schemes and data availability calculation methods a...
Jing Tian, Zhi Yang, Yafei Dai