Distributed resource management and matching in sensor networks

2009 International Conference on Information Processing in Sensor Networks, IPSN 2009

Volumn , Issue , 2009, Pages 97-108

  Gao, Jie ^a   Guibas, Leonidas ^b   Milosavljević, Nikola ^b   Zhou, Dengpan ^a  

^a Stony Brook University   (United States)

^b Stanford University   (United States)

Author keywords

Distributed matching; Resource management; Sensor networks

Indexed keywords

COMMUNICATION COST; DISTRIBUTED ALGORITHM; DISTRIBUTED MATCHING; DISTRIBUTED RESOURCE MANAGEMENT; FIRE STATION; GLOBAL COORDINATION; LOGARITHMIC DISTORTION; MATCHING ALGORITHM; MATCHINGS; OFFLINE; PARKING SPOT; PERFORMANCE RATIO; POLICE CAR; POLYLOGARITHMIC; RESOURCE MANAGEMENT; SIMULATION EXPERIMENTS; SOLUTION QUALITY; THEORETICAL RESULT;

DATA PROCESSING; LAW ENFORCEMENT; NATURAL RESOURCES MANAGEMENT; PARALLEL ALGORITHMS; RESOURCE ALLOCATION; SENSOR NETWORKS; WIRELESS NETWORKS;

NETWORK MANAGEMENT;

EID: 71049194301     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. http://www.mathworks.com/matlabcentral/fileexchange/6543/.
2. B. Awerbuch and D. Peleg. Concurrent online tracking of mobile users. In SIGCOMM '91: Proceedings of the conference on Communications architecture & protocols, pages 221-233, New York, NY, USA, 1991. ACM.
3. 2 κ)-competitive algorithm for metric bipartite matching. In Proceedings of the 15th Annual European Symposium (ESA'07), pages 522-533, 2007.
4. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, page 184, Washington, DC, USA, 1996. IEEE Computer Society.
5. Y. Bartal. On approximating arbitrary metrices by tree metrics. In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 161-168, New York, NY, USA, 1998. ACM.
6. Y. Bartal and A. Rosen. The distributed k-server problem - a competitive distributed translator for κ-server problems. In Proceeding of IEEE Symposium on Foundations of Computer Science, pages 344-353, 1992.
7. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 2005.
8. A. Coté, A. Meyerson, and L. Poplawski. Randomized κ-server on hierarchical binary trees. In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 227-234, New York, NY, USA, 2008. ACM.
9. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 448-455, New York, NY, USA, 2003. ACM.
10. S. Funke, L. J. Guibas, A. Nguyen, and Y. Wang. Distance-sensitive information brokerage in sensor networks. In Proceedings of the second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), pages 234-251, 2006.
11. J. Gao, L. J. Guibas, J. Hershberger, and N. Milosavljević. Sparse data aggregation in sensor networks. In Proc. of the International Conference on Information Processing in Sensor Networks (IPSN'07), pages 430-439, April 2007.
12. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995.
13. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 534-543, 2003.
14. J. Kleinberg and Éva Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. J. ACM, 49(5):616-639, 2002.
15. A. Meyerson, A. Nanavati, and L. Poplawski. Randomized online algorithms for minimum metric bipartite matching. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 954-959, New York, NY, USA, 2006. ACM.
16. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ, 1982.
17. E. M. Reingold and R. E. Tarjan. On a greedy heuristic for complete matching. SIAM J. Computing, 10(4):676-681, November 1981.