Virtual coordinates for ad hoc and sensor networks

Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC'04

Volumn , Issue , 2004, Pages 8-16

  Moscibroda, Thomas ^a   Wattenhofer, Mirjam ^a   O'Dell, Regina ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Metric embedding; Unit disk graphs; Virtual coordinates

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; GLOBAL POSITIONING SYSTEM; GRAPH THEORY; HEURISTIC METHODS; LINEAR PROGRAMMING; ROUTERS; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC SENSOR NETWORKS; METRIC EMBEDDING; SENSOR NETWORKS; UNIT DISK GRAPHS; VIRTUAL COORDINATES;

TELECOMMUNICATION NETWORKS;

EID: 14844291444     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1022630.1022633     Document Type: Conference Paper

References (30)

1. M. Badoiu. Approximation Algorithm for Embedding Metrics into a Two-dimensional Space. In Proc. of the ACM-SIAM Symp. on Discrete Algorithms (SODA), 2003.
2. R. Bischoff and R. Wattenhofer. Analyzing Connectivity-based, Multi-hop Ad hoc Positioning. In Proc. of the IEEE Intl. Conf. on Pervasive Computing and Communications (PerCom), 2004.
3. P. Biswas and Y. Ye. Semidefinite Programming for Ad Hoc Wireless Sensor Network Localization. In Proc. of Intl. Symp. on Information Processing in Sensor Networks (IPSN), 2004.
4. A. Blum, G. Konjevod, R. Ravi, and S. Vempala. Semi-definite Relaxations for Minimum Bandwidth and other Vertex-ordering Problems. Theor. Comput. Sci., 235(1):25-42, 2000.
5. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with Guaranteed Delivery in Ad hoc Wireless Networks. In Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), 1999.
6. H. Breu and D. G. Kirkpatrick. Unit Disk Graph Recognition is NP-hard. Comput. Geom. Theory Appl., 9(1-2):3-24, 1998.
7. R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris. Practical, Distributed Network Coordinates. SIGCOMM Comput. Commun. Rev., 34(1):113-118, 2004.
8. L. Doherty, L. E. Ghaoui, and K. Pister. Convex Position Estimation in Wireless Sensor Networks. In Proc. of Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2001.
9. G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer Approximation Algorithms via Spreading Metrics. In Proc. of the IEEE Symp. on Foundations of Computer Science (FOCS), 1995.
10. U. Feige. Approximating the Bandwidth via Volume Respecting Embeddings. J. of Computer and System Sciences, 60(3):510-539, 2000.
11. M. Grotschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.
12. T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher. Range-Free Localization Schemes in Large Scale Sensor Networks. In Proc. of Mobile Computing and Networking (MobiCom), 2003.
13. B. Hofmann-Wellenhof, H. Lichtenegger, and J. Collins. Global Positioning Systems: Theory and Practice. Springer, 5th edition, 2001.
14. B. Karp and H. Kung. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In Proc. of Mobile Computing and Networking (MobiCom), 2000.
15. F. Kuhn, T. Moscibroda, and R. Wattenhofer. Unit Disk Graph Approximation. In Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), 2004.
16. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric Ad-Hoc Routing: Of Theory and Practice. In Proc. of Symp. on Principles of Distributed Computing (PODC), 2003.
17. N. Linial, E. London, and Y. Rabinovich. The Geometry of Graphs and some of Its Algorithmic Applications. Combinatorica, 15(2):215-245, 1995.
18. G. Manku, M. Naor, and U. Wieder. Know Thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks. In Proc. of ACM Symp. on Theory of Computing (STOC), 2004.
19. M. V. Marathe, H. Breu, H. B. H. III, S. S. Ravi, and D. J. Rosenkrantz. Simple Heuristics for Unit Disk Graphs. Networks, 25:59-68, 1995.
20. R. Nagpal, H. Shrobe, and J. Bachrach. Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network. In Proc. of Information Processing in Sensor Networks (IPSN), 2003.
21. E. Ng and H. Zhang. Predicting Internet Network Distance with Coordinates-based Approaches. In Proc. of Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2002.
22. D. Niculescu and B. Nath. Ad Hoc Positioning System (APS). In Proc. of IEEE Global Communications (GLOBECOM), 2001.
23. D. Niculescu and B. Nath. Error characteristics of ad hoc positioning systems. In Proc. of Intl. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), 2004.
24. A. Rao, C. Papadimitriou, S. Ratnasamy, S. Shenker, and I. Stoica. Geographic Routing without Location Information. In Proc. of Mobile Computing and Networking (MobiCom), 2003.
25. C. Savarese, J. Rabaey, and K. Langendoen. Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks. In Proc. of USENIX Technical Conference, 2002.
26. A. Savvides, C.-C. Han, and M. Srivastava. Dynamic Fine-Grained Localization in Ad-Hoc networks of Sensors. In Proc. of Mobile Computing and Networking (MobiCom), 2001.
27. Y. Shang, W. Ruml, Y. Zhang, and M. Fromherz. Localization from Mere Connectivity. In Proc. of Intl. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), 2003.
28. I. G. Tollis, R. Tamassia, G. D. Battista, and P. Eades. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, 1998.
29. S. Vempala. Random Projection: A New Approach to VLSI Layout. In Proc. of the IEEE Symp. on Foundations of Computer Science (FOCS), 1998.
30. S. Vempala. The Random Projection Method. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, 2004.