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...
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...
Wireless Multimedia Sensor Networks (WMSNs) have brought unprecedented potentials for applications requiring ubiquitous access to multimedia contents such as still images. However,...
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...
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...