Algorithmic models for sensor networks

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Schmid, Stefan ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; REAL TIME SYSTEMS; SENSOR DATA FUSION; TELECOMMUNICATION NETWORKS;

ALGORITHM DEVELOPMENT; SENSOR NETWORKS;

ALGORITHMS;

EID: 33847136218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639417     Document Type: Conference Paper

References (27)

1. L. Barrière, P. Fraigniaud, and L. Narayanan. Robust Position-based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges. In Proc. 5th Intl. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pages 19-27, 2001.
2. J.-H. Chang and L. Tassiulas. Energy Conserving Routing in Wireless Ad-hoc Networks. In Proc. IEEE Infocom, pages 22-31, 2000.
3. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit Disk Graphs. Discrete Mathematics, 86:165-177, 1990.
4. A. E. F. Clementi, G. Huiban, and P. Penna. On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. In Proc. 17th International Symposium on Parallel and Distributed Processing (IPDPS), Washington, DC, USA, 2003.
5. O. Dousse, P. Thiran, and M. Hasler. Connectivity in Ad-hoc and Hybrid Networks. In Proc. IEEE Infocom, 2002.
6. A. El Fawal, J.-Y. Le Boudec, R. Merz, B. Radunovic, J. Widmer, and G. M. Maggio. Trade-off Analysis of PHY-Aware MAC in Low-Rate Low-Power UWB Networks. IEEE Communications Magazine, December 2005.
7. D. Ganesan, D. Estrin, A. Woo, D. Culler, B. Krishnamachari, and S. Wicker. Complex Behavioral Scale: An Experimental Study of Low-Power Wireless Sensor Networks. Technical report, UCLA Computer Science Technical Report UCLA/CSD-TR 02-0013, 2002.
8. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded Geometries, Fractals, and Low-Distortion Embeddings. In Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS), page 534, 2003.
9. P. Gupta and P. Kumar. The Capacity of Wireless Networks. Trans. Information Theory, 46(2):388-404, 2000.
10. S. O. Krumke, M. V. Marathe, and S. S. Ravi. Models and Approximation Algorithms for Channel Assignment in Radio Networks. Wireless Networks, 7(6):575-584, 2001.
11. F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer. Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In Proc. 19th Intl. Symp. on Distributed Computing (DISC), 2005.
12. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What Cannot Be Computed Locally! In Proc. 23rd ACM Symp. on the Principles of Distributed Computing (PODC), 2004.
13. F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the Locality of Bounded Growth. In Proc. 24th ACM Symp. on Principles of Distributed Computing (PODC, pages 60-68, 2005.
14. F. Kuhn, T. Nieberg, T. Moscibroda, and R. Wattenhofer. Local Approximation Schemes for Ad-hoc and Sensor Networks. In Proc. Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 97-103, 2005.
15. F. Kuhn and R. Wattenhofer. Constant-time Distributed Dominating Set Approximation. In Proc. 22nd Annual Symp. on Principles of Distributed Computing (PODC), pages 25-32, 2003.
16. F. Kuhn, R. Wattenhofer, and A. Zollinger. Ad-hoc Networks Beyond Unit Disk Graphs. In Proc. 1st ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), 2003.
17. F. Kuhn, R. Wattenhofer, and A. Zollinger. Worst-Case Optimal and Average-case Efficient Geometric Ad-hoc Routing. In Proc. 4th ACM Int. Symp. on Mobile Ad Hoc Networking & Computing (MobiHoc), pages 267-278, 2003.
18. F. Meyer auf de Heide, C. Schindelhauer, K. Volbert, and M. Grünewald. Energy, Congestion and Dilation in Radio Networks. In Proc. 14th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 230-237, 2002.
19. T. Moscibroda, P. von Rickenbach, and R. Wattenhofer. Analyzing the Energy-Latency Trade-off during the Deployment of Sensor Networks. In Proc. IEEE Infocom, 2006.
20. T. Moscibroda and R. Wattenhofer. Coloring Unstructured Radio Networks. In Proc. 17th Annual ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 39-48, 2005.
21. T. Moscibroda and R. Wattenhofer. The Complexity of Connectivity in Wireless Networks. In Proc. IEEE Infocom, 2006.
22. D. Peleg. Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
23. V. Raghunathan, C. Schurgers. S. Park, and M. Srivastava. Energy Aware Wireless Microsensor networks. IEEE Signal Processing Magazine, 19(2):40-50, 2002.
24. T. Rappaport. Wireless Communications: Principles and Practices. Prentice Hall, 1996.
25. I. Stojmenović, A. Nayak, and J. Kuruvila. Design Guidelines for Routing Protcols in Ad Hoc and Sensor Networks with a Realistic Physical Layer. IEEE Communications Magazine, March 2005.
26. P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. Mobile Networks and Applications, 9(2): 141-149, 2004.
27. Y. Wang, X.-Y. Li, P.-J. Wan, and O. Frieder. Sparse Power Efficient Topology for Wireless Networks. J. of Parallel and Distributed Computing, 2002.