An approximation algorithm for data storage placement in sensor networks

WASA 2007 - The 2nd International Conference on Wireless Algorithms, Systems and Applications

Volumn , Issue , 2007, Pages 71-78

  Sheng, Bo ^a   Tan, Chiu C ^a   Li, Qun ^a   Mao, Weizhen ^a  

^a The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; DATA STORAGE EQUIPMENT; DETECTORS; ENERGY STORAGE; INFORMATION SERVICES; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; POLYNOMIAL APPROXIMATION; SEARCH ENGINES; SENSOR NETWORKS; SENSORS; STORAGE (MATERIALS);

COMMUNICATION COSTS; DATA COLLECTED; DATA QUERYING; DATA STORAGE; HEAVY LOADS; INTEGER LINEAR PROGRAMMING (ILP); INTERNATIONAL CONFERENCES; NODE PLACEMENT; RETRIEVAL (MIR); STORAGE NODES; TOTAL POWER CONSUMPTION; WIRELESS ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 46849090119     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WASA.2007.141     Document Type: Conference Paper

References (23)

1. GLPK (GNU Linear Programming Kit), available [online] http://www.gnu.org/software/glpk/glpk.html.
2. K. Aardal, F. A. Chudak, and D. B. Shmoys. A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inf. Process. Lett., 72(5-6):161-167, 1999.
3. A. A. Ageev. Improved approximation algorithms for multilevel facility location problems. In APPROX '02.
4. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for euclidean k-medians and related problems. In STOC '98.
5. V. Arya, N. Garg, R. Khandekar, K. Munagala, and V. Pandit. Local search heuristic for k-median and facility location problems. In STOC '01.
6. A. Bumb and W. Kern. A simple dual ascent algorithm for the multilevel facility location problem. In APPROX '01/RANDOM '01.
7. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In FOCS '99.
8. M. Charikar, S. Guha, Eva Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem (extended abstract). In STOC '99.
9. J. Chuzhoy and Y. Rabani. Approximating k-median with non-uniform capacities. In SODA '05.
10. S. De. On hop count and euclidean distance in greedy forwarding in wireless ad hoc networks. IEEE Communication Letters, 9, 2005.
11. Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang. GLIDER: Gradient landmark-based distributed routing for sensor networks. In INFOCOM '05.
12. A. D. Flaxman, A. M. Frieze, and J. C. Vera. On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. In STOC '05.
13. S. Guha and S. Khuller. Greedy strikes back: improved facility location algorithms. In SODA '98.
14. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In STOC '02.
15. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM, 48(2):274-296, 2001.
16. B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In MobiCom '00.
17. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. In SODA '98.
18. D. Krivitski, A. Schuster, and R. Wolff. A local facility location algorithm for sensor networks. In DCOSS '05.
19. R. C. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling a three-tier architecture for sparse sensor networks. In First IEEE International Workshop on Sensor Network Protocols and Applications (SPNA).
20. B. Sheng, Q. Li, and W. Mao. Data storage placement in sensor networks. In MobiHoc '06.
21. D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems (extended abstract). In STOC '97.
22. S. Vural and E. Ekici. Analysis of hop-distance relationship in spatially random sensor networks. In MobiHoc '05.
23. J. Zhang. Approximating the two-level facility location problem via a quasi-greedy approach. In SODA '04.