Sciweavers

216 search results - page 16 / 44
» Data storage placement in sensor networks
Sort
View
JNW
2006
145views more  JNW 2006»
14 years 9 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
14 years 9 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
84
Voted
DASFAA
2009
IEEE
122views Database» more  DASFAA 2009»
15 years 1 months ago
Optimization on Data Object Compression and Replication in Wireless Multimedia Sensor Networks
Wireless Multimedia Sensor Networks (WMSNs) have brought unprecedented potentials for applications requiring ubiquitous access to multimedia contents such as still images. However,...
MingJian Tang, Jinli Cao, Xiaohua Jia, Ke-Yan Liu
79
Voted
APSCC
2007
IEEE
14 years 9 months ago
Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
Yu Gu, Hengchang Liu, Fei Song, Baohua Zhao
DSN
2008
IEEE
14 years 11 months ago
Reliability of flat XOR-based erasure codes on heterogeneous devices
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
Kevin M. Greenan, Ethan L. Miller, Jay J. Wylie