Sensor networks continue to puzzle: Selected open problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4904 LNCS, Issue , 2008, Pages 25-38

  Locher, Thomas ^a   Von Rickenbach, Pascal ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING;

FUNDAMENTAL PROBLEMS; NETWORKING COMMUNITY; SELECTED OPEN PROBLEMS;

SENSOR NETWORKS;

EID: 39149129079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (60)

1. th Annual Joint Conf. of the IEEE Computer and Communications Societies (2001)
2. Ambühl, C.: An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, Springer, Heidelberg (2005)
3. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A Lower Bound for Radio Broadcast. J. Comput. Syst. Sci. 43, 290-298 (1991)
4. Czumaj, A., Rytter, W.: Broadcasting Algorithms in Radio Networks with Unknown Topology. J. Algorithms 60, 115-143 (2006)
5. Peleg, D.: Time Efficient Broadcasting in Radio Networks: A Review. In: Janowski, T., Mohanty, H. (eds.) ICDCIT 2007. LNCS, vol. 4882, Springer, Heidelberg (2007)
6. rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999)
7. th ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (2003)
8. Durocher, S., Kirkpatrick, D., Narayanan, L.: On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. Personal communication (2007)
9. Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Trans. Information Theory 46, 388-404 (2000)
10. th Annual Joint Conf. of the IEEE Computer and Communications Societies (2006)
11. th ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (2006)
12. th Annual Joint Conf. of the IEEE Computer and Communications Societies (2007)
13. th Int. Conf. on Information Processing in Sensor Networks (2007)
14. th ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (2007)
15. th ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (2007)
16. th Annual Joint Conf. of the IEEE Computer and Communications Societies (2001)
17. Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. Wiley, Chichester (2005)
18. th Int. Conf. on Mobile Computing and Networking (2005)
19. th Annual ACM Symposium on Principles of Distributed Computing (2006)
20. th ACM Int. Symposium on Mobile Ad-hoc Networking and Computing (2004)
21. Moaveni-Nejad, K., Li, X.Y.: Low-Interference Topology Control for Wireless Adhoc Networks. Ad Hoc & Sensor Wireless Networks: An International Journal 1 (2005)
22. rd ACM Joint Workshop on Foundations of Mobile Computing (2005)
23. Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing Interference-Minimal Networks. Computational Geometry: Theory and Applications (2007)
24. Fussen, M., Wattenhofer, R., Zollinger, A.: Interference Arises at the Receiver. In: WIRELESSCOM. Proc. of the Int. Conf. on Wireless Networks, Communications, and Mobile Computing (2005)
25. th Int. Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (2005)
26. rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999)
27. nd Int. Workshop on Algorithmic Aspects of Wireless Sensor Networks (2006)
28. rd ACM Joint Workshop on Foundations of Mobile Computing (2005)
29. Karp, R.: Reducibility Among Combinatorial Problems. J. ACM 45, 634-652 (1998)
30. Masuyama, S., Ibaraki, T., Haseqawa, T.: The Computational Complexity of the M-Center Problems in the Plane. Trans. IECE Japan E64, 57-64 (1981)
31. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Math. 86, 165-177 (1990)
32. Feige, U.: A Threshold of In n for Approximating Set Cover. J. ACM 45, 634-652 (1998)
33. Marathe, M., Breu, H., Ravi, H., Rosenkrantz, D.: Simple Heuristics for Unit Disk Graphs. Networks 25, 59-68 (1995)
34. th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (2006)
35. Nieberg, T., Hurink, J.L.: A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. Memorandum 1732, Universiteit Twente, Dep't of Applied Mathematics (2004)
36. th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (2006)
37. Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing 15, 1036-1053 (1986)
38. th ACM Symposium on Principles of Distributed Computing (2001)
39. nd ACM Symposium on Principles of Distributed Computing (2003)
40. th ACM-SIAM Symposium on Discrete Algorithms (2006)
41. rd ACM Joint Workshop on Foundations of Mobile Computing (2005)
42. th ACM Symposium on Principles of Distributed Computing (2005)
43. Linial, N.: Locality in Distributed Graph Algorithms. SIAM Journal on Computing 21, 193-201 (1992)
44. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, Springer, Heidelberg (2005)
45. th ACM Symposium on Principles of Distributed Computing (2007)
46. th Annual Int. Conf. on Mobile Computing and Networking (2001)
47. O'Dell, R., Wattenhofer, R.: Theoretical Aspects of Connectivity-based Multi-hop Positioning. Theoretical Computer Science 344, 47-68 (2005)
48. Breu, H., Kirkpatrick, D.: Unit Disk Graph Recognition is NP-hard. Computational Geometry: Theory and Applications 9, 3-24 (1998)
49. nd ACM Joint Workshop on Foundations of Mobile Computing (2004)
50. st Int. Workshop on Algorithmic Aspects of Wireless Sensor Networks (2004)
51. th ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (2005)
52. nd ACM Joint Workshop on Foundations of Mobile Computing (2004)
53. th Annual Symposium on Foundations of Computer Science (1998)
54. th Annual European Symposium on Algorithms (2007)
55. Priyantha, N.B., Balakrishnan, H., Demaine, E.D., Teller, S.: Anchor-free Distributed Localization in Sensor Networks. Technical Report TR-892, MIT, LCS (2003)
56. Gotsman, C., Koren, Y.: Distributed Graph Layout for Sensor Networks. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, Springer, Heidelberg (2005)
57. Srikanth, T.K., Toueg, S.: Optimal Clock Synchronization. J. ACM 34, 626-645 (1987)
58. rd Annual ACM Symposium on Principles of Distributed Computing (2004)
59. Fan, R., Chakraborty, I., Lynch, N.: Clock Synchronization for Wireless Networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, Springer, Heidelberg (2005)
60. th Int. Symposium on Distributed Computing (2006)