Ad-hoc and sensor networks: Worst-case vs. Average-case

International Zurich Seminar on Digital Communications

Volumn , Issue , 2004, Pages 156-159

  Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROWNIAN MOVEMENT; COMPUTER SIMULATION; ENERGY EFFICIENCY; GRAPH THEORY; HEURISTIC METHODS; NETWORK PROTOCOLS; POWER TRANSMISSION; RANDOM PROCESSES; SENSORS; SOLAR CELLS; TOPOLOGY;

CLUSTERING; COMMUNICATION INFRASTRUCTURES; SENSOR NETWORKS; TOPOLOGY CONTROL;

COMMUNICATION SYSTEMS;

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

References (32)

1. K. Alzoubi, P.-J. Wan, and O. Frieder. Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In MobiHoc, pages 157-164, EPFL Lausanne, Switzerland, 2002.
2. B. Awerbuch and D. Peleg. Concurrent online tracking of mobile users. In SIGCOMM, pages 221-233, 1991.
3. J. Beutel. Geolocation in a Picoradio Environment. Master Thesis, ETH Zurich and UC Berkeley, 1999.
4. J. Beutel, O. Kasten, and M. Ringwald. BTnodes - A Distributed Platform for Sensor Nodes. In Proc. of ACM SenSys, 2003.
5. R. Bischoff and R. Wattenhofer. Analyzing Connectivity-Based Multi-Hop Ad-Hoc Positioning. In Proc. of the Second Annual IEEE International Conference on Pervasive Computing and Communications (PerCom), 2004.
6. rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), pages 48-55, 1999.
7. M. Burkhart, P. von Rickenbach, R. Wattenhofer, and A. Zollinger. Topology control vs. interference. Technical report, Computer Science Department, ETH Zurich, Switzerland, 2003.
8. C. Busch, S. Surapaneni, and S. Tirthapura. Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks. In 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2003.
9. D.M.Blough, M.Leoncini, G.Resta, and P.Santi. The k-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks. In ACM MobiHoc, 2003.
10. U. Feige. A Threshold of In n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634-652, 1998.
11. E. M. Gafni and D. P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communication, 29, 1981.
12. th Annual Symposium on Computational Geometry (SCG), pages 188-196. ACM Press, 2001.
13. A. Goldberg, S. Plotkin, and G. Shannon. Parallel symmetry-breaking in sparse graphs. In STOC, pages 315-324, 1987.
14. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. E. Culler, and K.S.J. Pister. System architecture directions for networked sensors. In Architectural Support for Programming Languages and Operating Systems, pages 93-104, 2000.
15. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2003.
16. L. Jia, R. Rajaraman, and R. Suel. An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 33-42, 2001.
17. V. Kawadia and P. R. Kumar. Power control and clustering in ad hoc networks. In Infocom, 2003.
18. th Canadian Conference on Computational Geometry, pages 51-54, Vancouver, August 1999.
19. F. Kuhn, T. Moscibroda, and R. Wattenhofer. How the Hidden Terminal Problem affects Initialization in Ad-Hoc Networks. Technical report, Department of Computer Science, ETH Zurich, 2003.
20. nd ACM Symposium on the Principles of Distributed Computing (PODC), 2003.
21. F. Kuhn and R. Wattenhofer. Distributed Combinatorial Optimization. Technical Report 426, Department of Computer Science, ETH Zurich, 2003.
22. nd ACM Symposium on the Principles of Distributed Computing (PODC), 2003.
23. F. Kuhn, R. Wattenhofer, and A. Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In Proc. Dial-M'02, Atlanta, Georgia, USA, September 2002.
24. F. Kuhn, R. Wattenhofer, and A. Zollinger. Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing. In MobiHoc, 2003.
25. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2002.
26. J.C. Navas and T. Imielinski. GeoCast - Geographic Addressing and Routing. In MobiCom, pages 66-76, 1997.
27. rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (D1AL-M), 1999.
28. A. Rao, C. Papadimitriou, S. Ratnasamy, S. Shenker, and I. Stoica. Geographic Routing without Location Information. In MobiCom, 2003.
29. Y. Wang and X.-Y. Li. Localized Construction of Bounded Degree Planar Spanner. In Proc. of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003.
30. R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang. Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks. In INFOCOM, 2001.
31. R. Wattenhofer and A. Zollinger. XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks. Technical Report 407, Department of Computer Science, ETH Zurich, 2003.
32. Y. Xue, B. Li, and K. Nahrstedt. A scalable location management scheme in mobile ad-hoc networks. In IEEE LCN, 2001.