An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
The Quickest Transshipment Problem
Mathematics of Operations Research
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Algorithms for Data Migration with Cloning
SIAM Journal on Computing
Electric-field-based routing: a reliable framework for routing in MANETs
ACM SIGMOBILE Mobile Computing and Communications Review
Interprocessor Communication with Limited Memory
IEEE Transactions on Parallel and Distributed Systems
Data collection, storage, and retrieval with an underwater sensor network
Proceedings of the 3rd international conference on Embedded networked sensor systems
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Ultra-low power data storage for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Fidelity and yield in a volcano monitoring sensor network
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Computer Networks: The International Journal of Computer and Telecommunications Networking
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
MADRE: The Memory-Aware Data Redistribution Engine
Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Density-based anycast: a robust routing strategy for wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Design, implementation, and evaluation of EnviroMic: A storage-centric audio sensor network
ACM Transactions on Sensor Networks (TOSN)
Distributed resource management and matching in sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Distributed monitoring and aggregation in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Hi-index | 0.00 |
We address the energy-efficient data redistribution problem in data-intensive sensor networks (DISNs). In a DISN, a large volume of data gets generated, which is first stored in the network and is later collected for further analysis when the next uploading opportunity arises. The key concern in DISNs is to be able to redistribute the data from data-generating nodes into the network under limited storage and energy constraints at the sensor nodes. We formulate the data redistribution problem where the objective is to minimize the total energy consumption during this process while guaranteeing full utilization of the distributed storage capacity in the DISNs. We show that the problem is APX-hard for arbitrary data sizes; therefore, a polynomial time approximation algorithm is unlikely. For unit data sizes, we show that the problem is equivalent to the minimum cost flow problem, which can be solved optimally. However, the optimal solution's centralized nature makes it unsuitable for large-scale distributed sensor networks. Thus, we design a distributed algorithm for the data redistribution problem which performs very close to the optimal, and compare its performance with various intuitive heuristics. The distributed algorithm relies on potential function-based computations, incurs limited message and computational overhead at both the sensor nodes and data generator nodes, and is easily implementable in a distributed manner. We analytically study the convergence and performance of the proposed algorithm and demonstrate its near-optimal performance and scalability under various network scenarios. In addition, we implement the distributed algorithm in TinyOS, evaluate it using TOSSIM simulator, and show that it outperforms EnviroStore, the only existing scheme for data redistribution in sensor networks, in both solution quality and message overhead. Finally, we extend the proposed algorithm to avoid disproportionate energy consumption at different sensor nodes without compromising the solution quality.