Time synchronization

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

Volumn 4621 LNCS, Issue , 2007, Pages 359-405

  Busse, Marcel ^a   Streichert, Thilo ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149134450     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74991-2_19     Document Type: Conference Paper

References (410)

1. Abraham, I., Dolev, D., Malkhi, D.: LLS: a locality aware location service for mobile ad hoc networks. In: Proceedings of the DIALM-POMC Joint Work-shop on Foundations of Mobile Computing (DIALM-POMC 2004), pp. 75-84 (2004)
2. Abraham, I., Gavoille, C., Goldberg, A., Malkhi, D.: Routing in networks with low doubling dimension. In: Proceedings of the 26th International Conference on Distributed Computing Systems (ICDCS'06), p. 75. IEEE Computer Society Press, Los Alamitos (2006)
3. Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 305-319. Springer, Heidelberg (2004)
4. Abraham, I., Gavoille, C., Malkhi, D.: Compact routing for graphs excluding a fixed minor. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 442-456. Springer, Heidelberg (2005)
5. Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: lower bounds. In: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'06), pp. 207-216. ACM Press, New York (2006)
6. Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: upper bounds. In: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'06), pp. 217-224. ACM Press, New York (2006)
7. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact nameindependent routing with minimum stretch. In: Proceedings of the 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'04), pp. 20-24. ACM Press, New York (2004)
8. Abraham, I., Malkhi, D.: Compact routing on euclidian metrics. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC'04), pp. 141-149. ACM Press, New York (2004)
9. Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'05), pp. 49-55. ACM Press, New York (2005)
10. Abramson, N.: The ALOHA system - Another alternative for computer communications. In: Proceedings of the Fall Joint Compute Conference. AFIPS Conference, vol. 37, pp. 281-285 (1970)
11. Allwright, J.R., Bordawekar, R., Coddington, P., Dincer, K., Martin, C.: A comparison of parallel graph coloring algorithms. Technical report, Northeast Parallel Architectures Center, Syracuse University (1995)
12. Alzoubi, K., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'02), Lausanne, Switzerland (2002)
13. 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, pp. 1139-1150. Springer, Heidelberg (2005)
14. Ambühl, C., Erlebach, T., Mihalak, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, Springer, Heidelberg (2006)
15. Anderegg, L., Eidenbenz, S.: Ad hoc-vcg: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MOBICOM'03), pp. 245-259. ACM Press, New York (2003)
16. Anderson, R., Chan, H., Perrig, A.: Key infection: Smart trust for smart dust. In: Proceedings of IEEE International Conference on Network Protocols (ICNP 2004), October 2004, IEEE Computer Society Press, Los Alamitos (2004)
17. Arias, M., Cowen, L., Laing, K., Rajaraman, R., Taka, O.: Compact routing with name independence. SIAM Journal on Discrete Mathematics 20(3), 705-726 (2006)
18. Arikan, E.: Some complexity results about packet radio networks. IEEE Transactions on Information Theory 30(4) (1984)
19. Arya, S., Das, G., Mount, D., Salowe, J., Smid, M.: Euclidean spanners: short, thin, and lanky. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC'95), pp. 489-498. ACM Press, New York (1995)
20. Aspnes, J., Goldenberg, D., Yang, Y.: On the computational complexity of sensor network localization. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol. 3121, Springer, Heidelberg (2004)
21. ATmega 128: http://www.atmel.com/dyn/resources/prod_documents/ doc2467.pdf
22. Attiya, H., Welch, J.: Distributed Computing, 2nd edn. Wiley, Chichester (2004)
23. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A.: Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties, 2nd edn. Springer, Heidelberg (2002)
24. Awerbuch, B.: Complexity of network synchronization. Journal of the ACM 32(4), 804-823 (1985)
25. Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC'87), pp. 230-240. ACM Press, New York (1987)
26. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive routing. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC'89), pp. 479-489. ACM Press, New York (1989)
27. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. Journal of Algorithms 11(3), 307-341 (1990)
28. Awerbuch, B., Peleg, D.: Sparse partitions. In: Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science (FOCS'90), pp. 503-513. IEEE Computer Society Press, Los Alamitos (1990)
29. Axelrod, R.: The Evolution of Cooperation. Basic Books (1984)
30. Bao, L., Garcia-Luna-Aceves, J.J.: Topology management in ad hoc networks. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03), Annapolis, MD, USA (2003)
31. Barrière, L., Fraigniaud, P., Narayanan, L.: Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M'01), Rome, Italy, pp. 19-27 (2001)
32. Bartal, Y., Byers, J., Raz, D.: Global optimization using local information with applications to flow control. In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS'97), October 1997, p. 303. IEEE Computer Society Press, Los Alamitos (1997)
33. Basagni, S., Mastrogiovanni, M., Petrioli, C.: A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks. In: Proceedings of the 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS'04), IEEE Computer Society Press, Los Alamitos (2005)
34. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability - towards tight results. SIAM Journal on Computing 27(3), 804-915 (1998)
35. Bianchi, G.: Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal on Selected Areas in Communications 18(3), 535-547 (2000)
36. Björklund, P., Väarbrand, P., Yuan, D.: A column generation method for spatial tdma scheduling in ad hoc networks. Ad Hoc Networks 2(4), 405-418 (2004)
37. Blaß, E.-O., Junker, H., Zitterbart, M.: Effiziente Implementierung von Public-Key Algorithmen für Sensornetze. In: Informatik 2005, 2nd Workshop on Sensor Networks (2005)
38. Blaß, E.-O., Zitterbart, M.: An Efficient Key Establishment Scheme for Secure Aggregating Sensor Networks. In: ACM Symposium on Information, Computer and Communications Security (2006)
39. Blough, D., Leoncini, M., Resta, G., Santi, P.: Topology control with better radio models: Implications for energy and multi-hop interference. In: Proceedings of the 8th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM'06), IEEE Computer Society Press, Los Alamitos (2005)
40. Blum, B., He, T., Son, S., Stankovic, J.: IGF: A state-free robust communication protocol for wireless sensor networks. Technical Report CS-2003-11, University of Virginia, USA (2003)
41. Bobba, R., Eschenauer, L., Gligor, V., Arbaugh, W.: Bootstrapping Security Associations for Routing in Mobile Ad-Hoc Networks (2002), http://citeseer.ist.psu.edu/bobba02bootstrapping.html
42. Bock, F.: An algorithm to construct a minimum spanning tree in a directed network. In: Developments in Operations Research, pp. 29-44 (1971)
43. Bose, P., Brodnik, A., Carlsson, S., Demaine, E., Fleischer, R., López-Ortiz, A., Morin, P., Munro, J.: Online routing in convex subdivisions. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 47-59. Springer, Heidelberg (2000)
44. Bose, P., Morin, P.: Online routing in triangulations. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol. 1741, pp. 113-122. Springer, Heidelberg (1999)
45. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M'99) (1999)
46. Boudec, J.-Y., Vojnović, M.: Perfect simulation and stationarity of a class of mobility models. In: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05), Miami, Florida, March 2005 (2005)
47. Brady, A., Cowen, L.: Compact routing on power-law graphs with additive stretch. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06), pp. 119-128. SIAM (2006)
48. Brady, A., Cowen, L.: Compact routing with additive stretch using distance labelings. In: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'06), p. 233. ACM Press, New York (2006)
49. Brady, A., Cowen, L.: Exact distance labelings yield additive-stretch compact routing schemes. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 339-354. Springer, Heidelberg (2006)
50. Breu, H., Kirkpatrick, D.: Unit disk graph recognition is np-hard. Computational Geometry: Theory and Applications 9(1-2), 3-24 (1998)
51. Broch, J., Maltz, D., Johnson, D., Hu, Y.-C., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proceedings of the 4th Annual International Conference on Mobile Computing and Networking (MOBICOM'98), pp. 85-97 (1998)
52. Bruck, J., Gao, J., Jiang, A.: Localization and routing in sensor networks by local angle information. In: Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'05), ACM Press, New York (2005)
53. BTnodes rev3 - Product brief: http://www.btnode.ethz.ch/pub/files/ btnode_rev3.22_productbrief.pdf
54. Buchegger, S., Boudec, J.-Y.: The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-Hoc Networks. In: Proceedings of the 1th International Symposium on Modeling and Optimizationin Mobile, Ad Hoc and Wireless Networks (WiOpt'03) (2003)
55. Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'04), pp. 9-19. ACM Press, New York (2004)
56. Busch, C., Surapaneni, S., Tirthapura, S.: Analysis of link reversal routing algorithms for mobile ad hoc networks. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'03), San Diego, California, USA, (June 2003)
57. Buttyán, L., Hubaux, J.-P.: Nuglets: a virtual currency to stimulate cooperation in self-organized ad hoc networks. Technical Report DSC/2001, Swiss Federal Institute of Technology - Lausanne (2001)
58. Camerini, P., Fratta, L., Maffioli, F.: A Note on Finding Optimum Branchings. Networks 9, 309-312 (1979)
59. Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. In: Wireless Communications and Mobile Computing (2002)
60. Cao, Q., Abdelzaher, T.: A scalable logical coordinates framework for routing in wireless sensor networks. In: Proc. of IEEE RTSS, IEEE Computer Society Press, Los Alamitos (2004)
61. Capkun, S., Buttyán, L., Hubaux, J.-P.: Self-Organized Public-Key Management for Mobile Ad Hoc Networks. IEEE Transactions on Mobile Computing 2(1), 52-64 (2003)
62. Cardinal, J., Collette, S., Langerman, S.: Region counting graphs. In: Proceedings of the 21st European Workshop on Computational Geometry (EWCG'05), pp. 21-24 (2005)
63. Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance. In: Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI'99) (1999)
64. Cerpa, A., Estrin, D.: ASCENT: Adaptive Self-Configuring Sensor Networks Topologies. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'02), IEEE Computer Society Press, Los Alamitos (2002)
65. Cerpa, A., Wong, J., Kuang, L., Potkonjak, M., Estrin, D.: Statistical Model of Lossy Links in Wireless Sensor Networks. In: Proc. ACM/IEEE IPSN (2005)
66. Chan, H., Perrig, A.: PIKE: Peer Intermediaries for Key Establishment in Sensor Networks. In: Proceedings of IEEE Infocom, IEEE Computer Society Press, Los Alamitos (2005)
67. Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Security and Privacy, IEEE Computer Society Press, Los Alamitos (2003)
68. Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225-267 (1999)
69. Chen, B., Morris, R.: L+: Scalable Landmark Routing and Address Lookup for Multi-hop Wireless Networks. Technical Report 837, MIT LCS (2002)
70. Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42(4), 202-208 (2003)
71. Chiang, C.-C., Wu, H.-K., Liu, W., Gerla, M.: Routing in clustered multihop, mobile wireless networks with fading channel. In: Proceedings of the IEEE Singapore International Conference on Networks (SICON'97), pp. 197-211. IEEE Computer Society Press, Los Alamitos (1997)
72. Chu, Y.-J., Lin, T.-H.: On the shortest arborescence of a directed graph. Science Sinica 14, 1396-1400 (1965)
73. Chudak, F., Erlebach, T., Panconesi, A., Sozio, M.: Primal-dual distributed algorithms for covering and facility location problems. Unpublished Manuscript (2005)
74. Chvátal, V.: A greedy heuristic for the set-covering problems. Operations Research 4(3), 233-235 (1979)
75. Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Discrete Mathematics 86, 165-177 (1990)
76. Clausen, T., Jacquet, P. (eds.): Optimized link state routing protocol (OLSR). IETF RFC 3626 (October 2003)
77. Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocea, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121-131. Springer, Heidelberg (2001)
78. Clementi, A.E.F., Di Ianni, M., Silvestri, R.: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theoretical Computer Science 299, 751-761 (2003)
79. Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks (2002)
80. Clementi, A.E.F., Penna, P., Silvestri, R.: The power range assignment problem in radio networks on the plane. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 651-660. Springer, Heidelberg (2000)
81. Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control 70(1), 32-53 (1986)
82. WST: Application areas: Condition based monitoring, http://wins. rockwellscientific.com/WST_CBM.html
83. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)
84. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
85. Couto, D.S.J.D., Aguayo, D., Chambers, B.A., Morris, R.: Performance of multihop wireless networks: shortest path is not enough. In: Proc. of ACM HotNets, ACM Press, New York (2003)
86. Cowen, L.J.: Compact routing with minimum stretch. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), pp. 255-260. SIAM (1999)
87. Cowen, L.J., Goddard, W., Jesurum, C.E.: Coloring with defect. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97), Philadelphia, PA, USA, pp. 548-557. IEEE Computer Society Press, Los Alamitos (1997)
88. Cristescu, R., Beferull-Lozano, B., Vetterli, M.: On network correlated data gathering. In: Proceedings of the 23nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04), Hong Kong, IEEE Computer Society Press, Los Alamitos (2004)
89. Cristescu, R., Beferull-Lozano, B., Vetterli, M.: Networked slepian-wolf: Theory, algorithms and scaling laws. In: to appear in IEEE Transactions on Information Theory (2005)
90. Cristescu, R., Beferull-Lozano, B., Vetterli, M., Wattenhofer, R.: Network correlated data gathering with explicit communication: Np-completeness and algorithms. In: to appear in IEEE/ACM Transactions on Networking (April 2006)
91. Cristescu, R., Vetterli, M.: On the optimal density for real-time data gathering of spatio-temporal processes in sensor networks. In: Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN'05), Los Angeles, CA (2005)
92. Culler, D.: Towards the sensor network macroscope. Keynote Talk at the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 05) (2005)
93. Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, Heidelberg (2002)
94. Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 15(10), 908-920 (2004)
95. Darwen, P.J., Yao, X.: On Evolving Robust Strategies for Iterated Prisoner's Dilemma. In: Yao, X. (ed.) Progress in Evolutionary Computation. LNCS, vol. 956, pp. 276-292. Springer, Heidelberg (1995)
96. Das, S.M., Pucha, H., Hu, Y.C.: Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing. In: INFOCOM 2005, IEEE Computer Society Press, Los Alamitos (2005)
97. Datta, S., Stojmenovic, I., Wu, J.: Internal node and shortcut based routing with guaranteed delivery in wireless networks. In: Cluster Computing 5, pp. 169-178. Kluwer Academic Publishers, Dordrecht (2002)
98. De Marco, G., Pelc, A.: Fast distributed graph coloring with O(Δ) colors. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), Philadelphia, PA, USA, pp. 630-635. Society for Industrial and Applied Mathematics, New York (2001)
99. Deb, B., Nath, B.: On the node-scheduling approach to topology control in ad hoc networks. In: Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'05), pp. 14-26. ACM Press, New York (2005)
100. Demirbas, M., Arora, A., Gouda, M.: A pursuer-evader game for sensor networks. In: Proc. of SSS (2003)
101. Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)
102. Dolev, D., Yao, A.C.-C.: On the Security of Public-Key Protocols. IEEE Transactions on Information Theory (1983)
103. Doshi, S., Bhandare, S., Brown, T.: An on-demand minimum energy routing protocol for a wireless ad hoc network. SIGMOBILE Mob. Comput. Commun. Rev. 6(3), 50-66 (2002)
104. Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. The Carus Mathematical Monographs. The Mathematical Association of America (1984)
105. Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), pp. 717-724 (2003)
106. Dunkels, A., Gronvall, B., Voigt, T.: Contiki - a lightweight and flexible operating system for tiny networked sensors. In: Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN'04), Washington, DC, USA, pp. 455-462. IEEE Computer Society Press, Los Alamitos (2004)
107. Edmonds, J.: Optimum branchings. Research of the National Bureau of Standards 71B, 233-240 (1967)
108. Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. Journal of Algorithms 46(2), 97-114 (2003)
109. Elkin, M.: A faster distributed protocol for constructing a minimum spanning tree. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), pp. 359-368 (2004)
110. Elkin, M.: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04), pp. 331-340. ACM Press, New York (2004)
111. Elson, J., Girod, L., Estrin, D.: Fine-grained network time synchronization using reference broadcasts. Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI'02) 36(SI), 147-163 (2002)
112. Ephremides, A., Truong, T.V.: Scheduling broadcasts in multihop radio networks. IEEE Transactions on Communications 38(4), 456-460 (1990)
113. Eppstein, D.: Spanning trees and spanners. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, chapter 9, pp. 425-461. Elsevier Science Publishers B.V., Amsterdam (2000)
114. Erdõs, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics 51, 79-89 (1985)
115. Eren, T., Goldenberg, D., Whiteley, W., Yang, Y.R., Morse, A.S., Anderson, B., Belhumeur, P.N.: Rigidity, computation, and randomization in network localization. In: Proceedings of the 23nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04), IEEE Computer Society Press, Los Alamitos (2004)
116. Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), Philadelphia, PA, USA, pp. 671-679. Society for Industrial and Applied Mathematics (2001)
117. Eschenauer, L., Gligor, V.D.: A Key Management Scheme for Distributed Sensor Networks. In: 9th Conference on Computer and Communications Security (2002)
118. Even, S., Goldreich, O., Moran, S., Tong, P.: On the NP-completeness of certain network testing problems. Networks 14, 1-24 (1984)
119. Fall, K., Varadhan, K.: The ns Manual (2002)
120. Fan, R., Chakraborty, I., Lynch, N.: Clock synchronization for wireless networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 400-414. Springer, Heidelberg (2005)
121. Fan, R., Lynch, N.: Gradient clock synchronization. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC'04), St. John's, Newfoundland, Canada, July 2004, pp. 320-327. ACM Press, New York (2004)
122. Feeney, L.: Energy efficient communication in ad hoc networks. In: Basagni, S., Conti, M., Giordano, S., Stojmenovic, I. (eds.) Mobile Ad Hoc Networking, Wiley, Chichester (2004)
123. Feige, U.: A threshold of In n for approximating set cover. Journal of the ACM 45(4), 634-652 (1998)
124. Feige, U.: Approximating the bandwidth via volume respecting embeddings. Journal of Computer and System Sciences 60(3), 510-539 (2000)
125. Feige, U., Halldórsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM Journal on Computing 32(1), 172-195 (2002)
126. Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A bgp-based mechanism for lowest-cost routing. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02), pp. 173-182. ACM Press, New York (2002)
127. Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: recent results and future directions. In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M'02), pp. 1-13 (2002)
128. Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, USC/ISI (March 1987)
129. Fischer, M.J., Lynch, N., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374-382 (1985)
130. Floyd, S., Jacobson, V., Liu, C.-G., McCanne, S., Zhang, L.: A reliable multicast framework for light-weight sessions and application level framing. In: Proc. of ACM SIGCOMM, ACM Press, New York (1995)
131. Flury, R., Wattenhofer, R.: MLS: An Efficient Location Service for Mobile Ad Hoc Networks. In: 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Florence, Italy (May 2006)
132. Fonseca, R., Ratnasamy, S., Culler, D., Shenker, S., Stoica, I.: Beacon Vector Routing: Scalable Point-to-Point in Wireless Sensornets. In: Proc. of NSDI (2005)
133. Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757-772. Springer, Heidelberg (2001)
134. Fraigniaud, P., Gavoille, C.: A space lower bound for routing in trees. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 65-75. Springer, Heidelberg (2002)
135. Frank, C., Römer, K.: Algorithms for generic role assignment in wireless sensor networks. In: Proceedings of the 3rd International Conference on Embedded Networked Sensor Systems (SENSYS'05), San Diego, CA, USA (November 2005)
136. Frank, C.: Distributed facility location algorithms for flexible configuration of wireless sensor networks. In: Proceedings of the 3rd International Conference on Distributed Computing in Sensor Systems (DCOSS'07), Santa Fe, NM, USA (June 2007)
137. Frederickson, G., Janardan, R.: Optimal message routing without complete routing tables. In: Proceedings of the 5th ACM Symposium on Principles of Distributed Computing (PODC'86), pp. 88-97. ACM Press, New York (1986)
138. Frick, M.: A survey of (m, k)-colorings. In: Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory? Annals of Discrete Mathematics, vol. 55, pp. 45-58. Elsevier Science Publishers B.V, Amsterdam (1993)
139. Friedman, E., Resnick, P.: The Social Cost of Cheap Pseudonyms. Journal of Economics and Management Strategy 10(2), 173-199 (1998)
140. Füßler, H., Widmer, J., Käsemann, M., Mauve, M., Hartenstein, H.: Contention-based forwarding for mobile ad-hoc networks. Elsevier's Ad Hoc Networks 1(4), 351-369 (2003)
141. Gabow, H.N.: Implementation of Algorithms for maximum Matching on Nonbipatite Graphs. PhD thesis, Stanford University (1974)
142. Gafni, E.M., Bertsekas, D.P.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications 29 (1981)
143. Ganeriwal, S., Kumar, R., Srivastava, M.B.: Timing-sync protocol for sensor networks. In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SENSYS'03), Los Angeles, CA, USA, November 2003, pp. 138-149. ACM Press, New York (2003)
144. Ganesan, D., Cristescu, R., Beferull-Lozano, B.: Power-efficient sensor placement and transmission structure for data gathering under distortion constraints. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN'04), Berkeley, CA (2004)
145. Ganesan, D., Estrin, D., Heidemann, J.: Dimensions: Why do we need a new data handling architecture for sensor networks. In: Proc. of ACM HotNets, ACM Press, New York (2002)
146. Gansner, E.R., Koren, Y., North, S.C.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, Springer, Heidelberg (2005)
147. Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Discrete mobile centers. In: Proceedings of the 17th Annual Symposium on on Computational Geometry (SCG'01), pp. 188-196. ACM Press, New York (2001)
148. Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOCOl), Long Beach, CA, USA (October 2001)
149. Garay, J.A., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing 27, 302-316 (1998)
150. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of A/'P-Completeness. W.H. Freeman and Company (1979)
151. Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics 14(2), 207-222 (2001)
152. Gavoille, C.: A survey on interval routing. Theoretical Computer Science 245(2), 217-253 (2000)
153. Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News-Distributed Computing Column 32(1), 36-52 (2001)
154. Gavoille, C., Gengler, M.: Space-efficiency for routing schemes of stretch factor three. Journal of Parallel and Distributed Computing 61(5), 679-687 (2001)
155. Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Distributed Computing 16(2-3), 111-120 (2003)
156. Gavoille, C., Peleg, D., Perennes, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms 53(1), 85-112 (2004)
157. Gavoille, C., Perennes, S.: Memory requirements for routing in distributed networks. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing (PODC'96), pp. 125-133. ACM Press, New York (1996)
158. Gehweiler, J., Lammersen, C., Sohler, C.: A distributed 0(l)-approximation algorithm for the uniform facility location problem. In: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'06), Cambridge, Massachusetts, USA, pp. 237-243. ACM Press, New York (2006)
159. Gentry, C.: Key Recovery and Message Attacks on NTRU-Composite. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 182. Springer, Heidelberg (2001)
160. Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM Journal on Applied Mathematics 16(1), 1-29 (1968)
161. Girod, L., Elson, J., Cerpa, A., Stathopoulos, T., Ramanathan, N., Estrin, D.: EmStar: a Software Environment for Developing and Deploying Wireless Sensor Networks. In: Proc. of USENIX (2004)
162. Goel, A., Estrin, D.: Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), Baltimore, Maryland, USA, pp. 499-505 (2003)
163. Goldberg, A.V., Plotkin, S.A., Shannon, G.E.: Parallel symmetry-breaking in sparse graphs. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC87), pp. 315-324. ACM Press, New York (1987)
164. Goldreich, O.: Foundations of Cryptography - Volume I Basic Tools. Cambridge University Press, Cambridge (2001), http://www.wisdom.wei_mann.ac.il/ ~oded/foc-voll.html
165. Goldreich, O.: Foundations of Cryptography - Volume II Basic Applications. Cambridge University Press, Cambridge (2004),
166. http://www.wisdom.weizmann.ac.il/~oded/foc-vol2.html
167. Gotsman, C, Koren, Y.: Distributed graph layout for sensor networks. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, Springer, Heidelberg (2005)
168. Green, J., Laffont, J.: Incentives in public desision making. In: Studies in Public Economies, vol. 1, pp. 65-78 (1979)
169. Greenstein, B., Estrin, D., Govindan, R., Ratnasamy, S., Shenker, S.: DIFS: A distributed index for features in sensor networks. In: Proc. of IEEE WSNA, IEEE Computer Society Press, Los Alamitos (2003)
170. Grossglauser, M., Vetterli, M.: Locating nodes with EASE: Mobility diffusion of last encounters in ad hoc networks. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03), IEEE Computer Society Press, Los Alamitos (2003)
171. Groves, T.: Incentives in teams. Econométrica 41(4), 617-631 (1973)
172. Guba, N., Camp, T.: Recent Work on GLS: A Location Service for an Ad Hoc Network. In: Proceedings of the Grace Hopper Celebration (GHC 2002) (2002)
173. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. In: Diaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 179-193. Springer, Heidelberg (1996)
174. Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. Journal of Algorithms 31, 228-248 (1999)
175. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory IT-46(2), 388-404 (2000)
176. Gura, N., Patel, A., Wander, A.: Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs (2003), http://www.research.sun.com/projects/crypto
177. Hajek, B.E., Sasaki, G.H.: Link scheduling in polynomial time. IEEE Transactions on Information Theory 34(5), 910-917 (1988)
178. Hale, W.K.: Frequency assignment: Theory and applications. IEEE Proceedings 68, 1497-1514 (1980)
179. Han, C-C, Kumar, R., Shea, R., Kohler, E., Srivastava, M.B.: A dynamic operating system for sensor nodes. In: Proceedings of the 3rd International Conference on Mobile Systems, Applications, and Services (MOBISYS'05), pp. 163-176. ACM Press, New York (2005)
180. He, T., Krishnamurthy, S., Stankovic, J.A., Abdelzaher, T.F., Luo, L., Stoleru, R., Yan, T., Gu, L., Hui, J., Krogh, B.: An energy-efficient surveillance system using wireless sensor networks. In: In Proceedings of Second International Conference on Mobile Systems, Applications, and Services (MobiSys) (2004)
181. Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Fault tolerant distributed coloring algorithms that stabilize in linear time. In: 16th IEEE International Parallel and Distributed Processing Symposium (IPDPS '02), Washington, DC, USA, p. 153. IEEE Computer Society Press, Los Alamitos (2002)
182. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient
183. Heissenbüttel, M.: Routing and Broadcasting in Ad-hoc Networks. PhD thesis, University of Bern, Switzerland (2005)
184. Hershberger, J., Suri, S.: Vickrey pricing in network routing: Fast payment computation. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'01), pp. 252-259. IEEE Computer Society Press, Los Alamitos (2001)
185. Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., Pister, K.: System architecture directions for networked sensors. In: Proc. of ASPLOS, (November 2000)
186. Hochbaum, D.S.: Heuristics for the fixed cost median problem. Mathematical Programming 22(1), 148-162 (1982)
187. Hou, T.C, Li, V.O.K.: Transmission range control in multihop packet radio networks. IEEE Transactions on Communications 34(1), 38-44 (1986)
188. Howgrave-Graham, N., Nguyen, P.Q., Pointcheval, D., Proos, J., Silverman, J.H., Singer, A., Whyte, W.: The Impact of Decryption Failures on the Security of NTRU Encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 226-246. Springer, Heidelberg (2003)
189. Huang, H., Richa, A.W., Segal, M.: Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks. In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M'02), Atlanta, GA, USA, pp. 52-61 (2002)
190. Hubaux, J.-P., Buttyán, L., Capkun, S.: The Quest for Security in Mobile Ad Hoc Networks. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing'(MOBIHOCOl), ACM Press, New York (2001)
191. Humblet, P.A.: A distributed algorithm for minimum weighted directed spanning trees. IEEE Transactions on Communications COM-31(6), 756-762 (1983)
192. IEEE: P802.11, IEEE Draft Standard for Wireless LAN Medium Acess Control (MAC) and Physical Layer (PHY) Specifications, D3.0
193. Marathe, H.B H.I.M.V., Radhakrishnan, V., Ravi, S S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Journal of Algorithms 26(2), 238-274 (1998)
194. Drysdale III, R.L(S.), McElfresh, S.A., Snoeyink, J.: On exclusion regions for optimal triangulations. Discrete Applied Mathematics 109(1-2), 49-65 (2001)
195. Intanagonwiwat, C, Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proc. of ACM MobiCom, ACM Press, New York (2000)
196. Intel Mote2: http://embedded.seattle.intel-research.net/wiki/
197. Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM 50, 795-824 (2003)
198. Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L.: Impact of interference on multi-hop wireless network performance. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MOBICOM'03), pp. 66-80. ACM Press, New York (2003)
199. Jain, K., Vazirani, V.V.: Primal-dual approximation algorithms for metric facility location and k-median problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS'99), October 1999, pp. 2-13. IEEE Computer Society Press, Los Alamitos (1999)
200. Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proceedings IEEE 80(9), 1502-1517 (1992)
201. Jia, L., Rajaraman, R., Suel, T.: An efficient distributed algorithm for constructing small dominating sets. In: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODCOl), pp. 33-42. ACM Press, New York (2001)
202. Joa-Ng, M., Lu, I-T.: A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks. IEEE Journal on Selected Areas in Communications 17(8), 1415-1425 (1999)
203. Johnson, D.B.: Scalable and Robust Internetwork Routing for Mobile Hosts. In: Proc. of IEEE ICDCS, IEEE Computer Society Press, Los Alamitos (1994)
204. Johnson, D.S., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, T., Korth, H.F. (eds.) Mobile Computing, Kluwer Academic Publishers, Dordrecht (1996)
205. Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 535-549. Springer, Heidelberg (2002)
206. Kalpakis, K., Dasgupta, K., Namjoshi, P.: Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Computer Networks: The International Journal of Computer and Telecommunications Networking 42(6), 697-716 (2003)
207. Kao, M.-Y., Li, X.-Y., Wang, W.: Towards truthful mechanisms for binary demand games: a general framework. In: Proceedings of the 6th ACM conference on Electronic Commerce (EC05), pp. 213-222. ACM Press, New York (2005)
208. Karger, D.R., Lehmann, E.L., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. of ACM STOC, ACM Press, New York (1997)
209. Kargl, F.: Sicherheit in Mobilen Ad hoc Netzwerken. PhD thesis, University of Ulm (2003)
210. Kam, P.: MACA - A new channel access method for packet radio. In: Proceedings of the 9th ARRL Computer Networking Conference 1990, pp. 134-140 (1990)
211. Karp, B.: Geographic Routing for Wireless Networks. PhD thesis, Division of Engineering and Applied Sciences, Harvard University (2002)
212. Karp, B., Kung, H T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM'00) (2000)
213. Keil, J M., Gutwin, CA.: Classes of graphs which approximate the complete Euclidean graph. Discrete and Computational Geometry 7, 13-28 (1992)
214. Khalili, A., Katz, J., Arbaugh, W.A.: Toward Secure Key Distribution in Truly Ad-Hoc Networks. In: Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT-w'03) (2003)
215. Khuller, S., Raghavachari, B., Young, N.E: Balancing minimum spanning and shortest path trees. Algorithmica 14, 305 (1995)
216. Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: Proceedings of the Second USENIX/ACM Symposium on Networked System Design and Implementation (NSDI 2005), Boston, MA, USA, May 2005
217. Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: On the pitfalls of geographic face routing. In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2005), Cologne, Germany, September 2005
218. Kirkpatrick, D.G., Radke, J.D.: A framework for computational morphology. In: Toussaint, G.T. (ed.) Computational Geometry, pp. 217-248. NorthHolland, Amsterdam (1985)
219. Kirousis, L.M., Kranakis, E., Krizanc, D., PeIc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289-305 (2000)
220. Kleinrock, L., Kamoun, F.: Hierarchical routing for large networks; performance evaluation and optimization. Computer Networks and ISDN Systems 1, 155-174 (1977)
221. Koblitz, N.: A Course in Number Theory and Cryptography. Springer, Heidelberg (1994)
222. Konjevod, G., Richa, A.W., Xia, D.: Optimal-stretch name-independent compact routing in doubling metrics. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC06), pp. 198-207. ACM Press, New York (2006)
223. Kopetz, H.: Real-Time Systems - Design Principles for Distributed Embedded Applications. Kluwer Academic Publishers, Dordrecht (1997)
224. Kopetz, H., Schwabl, W.: Global time in distributed real-time systems. Technical Report 15, TU Wien (1989)
225. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 2nd edn. Springer, Heidelberg (2002)
226. Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, Canada, August 1999, pp. 51-54 (1999)
227. Krishna, P., Chatterjee, M., Vaidya, N.H., Pradhan, D.K.: A cluster-based approach for routing in ad-hoc networks. In: Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing, pp. 1-10 (1995)
228. Krishnamachari, B.: A wireless sensor networks bibliography, http://ceng.use.edu/~anrg/SensorNetBib.html
229. Krivitski, D., Schuster, A., Wolff, R.: A local facility location algorithm for sensor networks. In: Prasanna, V.K., Iyengar, S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, Springer, Heidelberg (2005)
230. 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, pp. 273-287. Springer, Heidelberg (2005)
231. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: Proceedings of the DIALMPOMC Joint Workshop on Foundations of Mobile Computing (DIALMPOMC 2005), Cologne, Germany (September 2005)
232. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing newly deployed ad hoc and sensor networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MOBICOM'04), Philadelphia, USA, pp. 260-274. ACM Press, New York (2004)
233. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Radio network clustering from scratch. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 460-472. Springer, Heidelberg (2004)
234. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally? In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC'04), St. John's, New Foundland, Canada, July 2004, pp. 300-309. ACM Press, New York (2004)
235. Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC05), July 2005, pp. 60-69. ACM Press, New York (2005)
236. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit disk graph approximation. In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2005), Cologne, Germany, September 2005 (2005)
237. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Fault-tolerant clustering in ad hoc and sensor networks. In: Proceedings of the 26th International Conference on Distributed Computing Systems (ICDCS'06), July 2006
238. Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06), ACM Press, New York (2006)
239. Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC03), Boston, MA, USA, pp. 25-32. ACM Press, New York (2003)
240. Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC'06), Denver, Colorado, USA, July 2006, pp. 7-15. ACM Press, New York (2006)
241. Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: Of theory and practice. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC03), Boston, MA, USA, ACM Press, New York (2003)
242. Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M'02), Atlanta, GA, USA (2002)
243. Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2003), San Diego, CA, USA (September 2003)
244. Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03), Annapolis, MD, USA (2003)
245. Kumar, S., Alaettinoglu, C, Estrin, D.: Scalable object-tracking through unattended techniques (SCOUT). In: Proc. of IEEE ICNP (2000)
246. Kumar, V S A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Algorithmic aspects of capacity in wireless networks. SIGMETRICS Perform. Eval. Rev. 33(1), 133-144 (2005)
247. Kutten, S., Peleg, D.: Fast distributed construction of small k-dominating sets and applications. In: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing (PODC95), pp. 238-249. ACM Press, New York (1995)
248. Lamport, L., Melliar-Smith, P M.: Synchronizing clocks in the presence of faults. Journal of the Association of Computer Machinery 32(1), 52-78 (1985)
249. Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. IEEE Transactions on Programming Languages and Systems 4(3), 382-401 (1982)
250. Langendoen, K., Halkes, C: Energy-efficient medium access control. In: Zurawski, R. (ed.) Embedded Systems Handbook, CRC Press (2005)
251. Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, Springer, Heidelberg (2000)
252. Leong, B., Liskov, B., Morris, R.: Geographic Routing without Planarization. In: Proceedings of the Third USENIX/ACM Symposium on Networked System Design and Implementation (NSDI 2006), San Jose, CA, USA, May 2006 (2006)
253. Leong, B., Mitra, S., Liskov, B.: Path Vector Face Routing: Geographic Routing with Local Face Information. In: Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP'05), Boston, Massachusetts, USA (2005)
254. Li, J., Jannotti, J., Couto, D.S J D., Karger, D.R., Morris, R.: A Scalable Location Service for Geographic Ad-Hoc Routing. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM'00), pp. 120-130 (August 2000)
255. Li, L., Halpern, J.Y., Bahl, P., Wang, Y.-M., Wattenhofer, R.: A conebased distributed topology-control algorithm for wireless multi-hop networks. IEEE/ACM Transactions on Networking 13(1), 147-159 (2005)
256. Li, X.-Y.: Topology control in wireless ad hoc networks. In: Basagni, S., Conti, M., Giordano, S., Stojmenovic, I. (eds.) Mobile Ad Hoc Networking, chapter 6, Wiley, Chichester (2003)
257. Li, X.-Y., Cǎlinescu, G., Wan, P.-J., Wang, Y.: Localized Delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 14(9) (2003)
258. Li, X., Kim, Y.-J., Govindan, R., Hong, W.: Multidimensional range queries in sensor networks. In: Proc. of ACM SenSys, ACM Press, New York (2003)
259. Lindsey, S., Raghavendra, C.S.: Pegasis: Power-efficient gathering in sensor information systems. In: Proceedings of IEEE Aerospace Conference, vol. 3, pp. 3-1130 (2002)
260. Lindsey, S., Raghavendra, C.S., Sivalingam, K.M.: Data gathering in sensor networks using energy delay metric. In: International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, San Francisco, CA, April 2001 (2001)
261. Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
262. Liu, J., Issarny, V.: Enhanced Reputation Mechanism for Mobile Ad Hoc Networks. In: Proceedings of the 2nd International Conference on Trust Management (iTrust'04), pp. 48-62 (2004)
263. Locher, T., Wattenhofer, R.: Oblivious gradient clock synchronization. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, Springer, Heidelberg (2006)
264. Lorincz, K., Malan, D.J., Fulford-Jones, T.R.F., Nawoj, A., Clavel, A., Shnayder, V., Mainland, G., Welsh, M.: Sensor networks for emergency response: Challenges and opportunities. In: IEEE Pervasive Computing, IEEE Computer Society Press, Los Alamitos (2004)
265. Lotker, Z., Patt-Samir, B., Peleg, D.: Distributed MST for constant diameter graphs. In: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODCOl), pp. 63-71. ACM Press, New York (2001)
266. Lu, H.-I: Improved compact routing tables for planar networks via orderly spanning trees. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 57-66. Springer, Heidelberg (2002)
267. Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing (ST0C85), May 1985, pp. 1-10. ACM Press, New York (1985)
268. Luby, M., Nisan, N.: A parallel approximation algorithm for positive linear programming. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC93), May 1993, pp. 448-457. ACM Press, New York (1993)
269. Lundelius, J., Lynch, N.: An upper and lower bound for clock synchronization. Information and Control 62, 190-204 (1984)
270. Lundquist, J., Dettinger, M., Cayan, D.: Meteorology and hydrology in yosemite national park: a sensor network application. In: Proceedings of Information Processing in Sensor Networks (IPSN) (2003)
271. Luo, H., Luo, J., Liu, Y.: Energy efficient routing with adaptive data fusion in sensor networks. In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2005), pp. 80-88. ACM Press, New York (2005)
272. Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks. In: Proc. of OSDI, Dec. 2002
273. Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229-242. Springer, Heidelberg (2002)
274. Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D., Anderson, J.: Wireless sensor networks for habitat monitoring. In: Proceedings of ACM International Workshop on Wireless Sensor Networks and Applications (WSNA'02), ACM Press, New York (2002)
275. Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D., Anderson, J.: Wireless Sensor Networks for Habitat Monitoring. In: Proc. of IEEE WSNA, September 2002
276. Malan, D.J., Welsh, M., Smith, M.D.: A Public-Key Infrastructure for Key Distribution in TinyOS Based on Elliptic Curce Cryptography. In: 1st IEEE International Conference on Sensor and Ad Hoc Communications and Networks, IEEE Computer Society Press, Los Alamitos (2004)
277. Marathe, M.V., Breu, H., Ravi, H.B H.I.S S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25, 59-68 (1995)
278. Maroti, M., Kusy, B., Simon, C, Ledeczi, A.: The flooding time synchronization protocol. In: Proceedings of ACM Second International Conference on Embedded Networked Sensor Systems (SenSys 04), ACM Press, New York (2004)
279. Marsh, S.: Formalising Trust as a Computational Concept. PhD thesis, Department of Mathematics and Computer Science, University of Stirling (1994)
280. Marti, S., Giuli, T J., Lai, K., Baker, M.: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM'00), pp. 255265 (2000)
281. Martinez, K., Padhy, P., Riddoch, A., Ong, R., Hart, J.: Glacial environment monitoring using sensor networks. In: Proceedings of Workshop on Real-World Wireless Sensor Networks (REALWSN'05) (2005)
282. Mas-Colell, A., Whinston, M., Green, J.: Microeconomic Theory. Oxford University Press, Oxford (1995)
283. Meier, L., Thiele, L.: Brief announcement: Gradient clock synchronization in sensor networks. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC05), Las Vegas, Nevada, USA, July 2005, p. 283 (2005)
284. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (1997)
285. Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., Grünewald, M.: Energy, congestion and dilation in radio networks. In: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'02), pp. 230-237. ACM Press, New York (2002)
286. MIC A2: http ://www.xbow.com/Products/Product_pdf_f iles/Wireless_ pdf/MICA2_Datasheet.pdf.
287. MICA2DOT: http://www.xbow.com/Products/Product_pdf_files/ Wireless_pdf/MICA2D0T_Datasheet.pdf.
288. MICAz: http://www.xbow.com/Products/Product_pdf_files/Wireless_ pdf/MICAz_Datasheet.pdf.
289. Miller, S.P., Neuman, B C., Schiller, J L, Saltzer, J.H.: Kerberos Authentication and Authorization System. Project Athena Technical Plan, MIT Project Athena (1998)
290. Mirchandani, P.B., Francis, R.L. (eds.): Discrete Location Theory. Discrete Mathematics and Optimization. Wiley, Chichester (1990)
291. Moscibroda, T., O'Dell, R., Wattenhofer, M., Wattenhofer, R.: Virtual coordinates for ad hoc and sensor networks. In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2004) (2004)
292. Moscibroda, T., von Rickenbach, P., Wattenhofer, R.: Analyzing the energy-latency trade-off during the deployment of sensor networks. In: Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'06), Barcelona, Spain (April 2006)
293. Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: MISSING - WHERE WAS THIS PUBLISHED?
294. Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'05), pp. 39-48. ACM Press, New York (2005)
295. Moscibroda, T., Wattenhofer, R.: Facility location: Distributed approximation. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC05), July 2005, pp. 108-117. ACM Press, New York (2005)
296. Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC'05), July 2005, pp. 148-157. ACM Press, New York (2005)
297. Moscibroda, T., Wattenhofer, R.: Maximizing the lifetime of dominating sets. In: Proceedings of the 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN'Q5), IEEE Computer Society Press, Los Alamitos (2005)
298. Moscibroda, T., Wattenhofer, R.: Minimizing interference in ad hoc and sensor networks. In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2005), Cologne, Germany, September 2005, pp. 24-33 (2005)
299. Mostfaoui, A., Raynal, M.: Solving consensus using chandra-toueg's unreliable failure detectors: general quorum-based approach. In: Proceedings of the 13th International Symposium on Distributed Computing (DISC'99) (1999)
300. MSP430 MCUs: http://ti.com/msp430
301. Murphey, R.A., Pardalos, P.M., Resende, M.G C.: Frequency assignment problems. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 4, pp. 295-377. Kluwer Academic Publishers Group, Dordrecht (1999)
302. Naor, M., Stockmeyer, L.J.: What can be computed locally? SIAM Journal on Computing 24(6), 1259-1277 (1995)
303. Newsome, J., Shi, E., Song, D., Perrig, A.: The Sybil Attack in Sensor Networks: Analysis &: Defenses. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN'04), pp. 259-268 (2004)
304. Nieberg, T., Hurink, J.: A ptas for the minimum dominating set problem in unit disk graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, Springer, Heidelberg (2006)
305. Nikaein, N., Bonnet, C., Nikaein, N.: HARP - Hybrid Ad hoc Routing Protocol. In: International Symposium on Telecommunications (IST 2001), Teheran, Iran, September 2001 (2001)
306. Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC'99), pp. 129-140. ACM Press, New York (1999)
307. Ogier, R.G., Templin, F.L., Lewis, M.G.: Topology dissemination based on reverse-path forwarding (TBRPF). IETF RFC 3684 (February 2004)
308. C.M. O'Rourke: Efficient NTRU Implementations. Master's thesis, Worcester Polytechnic Institute (April 2002), http://www.wpi.edu/Pubs/ ETD/Available/etd-0430102-111906/unrestricted/corourke.pdf
309. Osterweil, E., Mysore, M., Rahimi, M., Estrin, D.: The Extensible Sensing System. Technical report, Center for Embedded Networked Sensing (CENS), UCLA (2003)
310. Park, V.D., Corson, M S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'97), pp. 1405-1413. IEEE Computer Society Press, Los Alamitos (1997)
311. Parthasarathy, S., Gandhi, R.: Distributed algorithms for coloring and connected domination in wireless ad hoc networks. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 447-459. Springer, Heidelberg (2004)
312. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the Association of Computer Machinery 27(2), 228-234 (1980)
313. Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 30-41. Springer, Heidelberg (1999)
314. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)
315. Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM Journal on Computing 30(5), 1427-1442 (2001)
316. Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. Journal of the ACM 36(3), 510-530 (1989)
317. Pemmaraju, S., Pirwani, I.: Energy conservation via domatic partitions. In: Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC06), pp. 143-154. ACM Press, New York (2006)
318. Perich, F., Undercoffer, J.L, Kagal, L., Joshi, A., Finin, T., Yesha, Y.: In Reputation We Believe: Query Processing in Mobile Ad-Hoc Networks. In: Proceedings of the 1th International Conference on Mobile and Ubiquitous Systems: Networking and Services (August 2004)
319. Perkins, C., Bhagwat, P.: Highly dynamic Destination-Sequenced DistanceVector routing (DSDV) for mobile computers. In: Proc. of ACM SIGCOMM, ACM Press, New York (1994)
320. Perkins, C., Royer, E.M.: Ad hoc On-Demand Distance Vector Routing. In: Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), February 1999, IEEE Computer Society Press, Los Alamitos (1999)
321. Perrig, A., Stankovic, J., Wagner, D.: Security in Wireless Sensor Networks. Commun. ACM 47(6), 53-57 (2004)
322. Prakash, R.: Unidirectional links prove costly in wireless ad-hoc networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M'99), Seattle, Washington, USA (1999)
323. Priyantha, N.B., Balakrishnan, H., Demaine, E.D., Teller, S.: Anchor-free distributed localization in sensor networks. Technical Report TR-892, MIT, LCS (April 2003)
324. Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. ACM SIGACT News 33(2), 60-73 (2002)
325. Rajendran, V., Obraczka, K., Garcia-Luna-Aceves, J J.: Energy-efficient, collision-free medium access control for wireless sensor networks. In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SENSYS'03), pp. 181-192 (2003)
326. Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5(2), 81-94 (1999)
327. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multi-hop radio networks. In: Proceedings of SIGCOMM'92, pp. 211-222. ACM Press, New York (1992)
328. Ramasubramanian, V., Haas, Z.J., Sirer, E.G.: SHARP: A hybrid adaptive routing protocol for mobile ad hoc networks. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC03), Annapolis, MD, USA (2003)
329. Rao, A., Ratnasamy, S., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proc. of ACM MobiCom, ACM Press, New York (2003)
330. Rappaport, T.: Wireless Communication: Principles and Practice. PrenticeHall, Englewood Cliffs (2002)
331. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC'95), pp. 475-484. ACM Press, New York (1997)
332. Reiter, M.K., Stubblebine, S.G.: Authentication Metric Analysis and Design. ACM Transactions on Information and System Security 2(2), 138-158 (1999)
333. Roberts, F.S.: T-colorings of graphs: Recent results and open problems. Discrete Mathematics 93(2-3), 229-245 (1991)
334. Roberts, L.G.: ALOHA packet system with and without slots and capture. ACM SIGCOMM Computer Communication Review 5(2), 28-42 (1975)
335. Römer, K.: Time synchronization in ad hoc networks. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOCOl), Long Beach, CA, USA, October 2001, pp. 173-182. ACM Press, New York (2001)
336. Römer, K., Mattern, F.: The design space of wireless sensor networks. IEEE Wireless Communications 11(6), 54-61 (2004)
337. Rothammel, K., Krischke, A.: Rothammels Antennenbuch. DARC-Verlag (2002)
338. Royer, E.M., Toh, C.-K.: A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications 6 (1999)
339. Santi, P.: Topology control in wireless ad hoc and sensor networks. ACM Computing Surveys 37(2), 164-194 (2005)
340. Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. Wiley, Chichester (2005)
341. Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The Computer Journal 28(1), 5-8 (1985)
342. Savarese, C., Rabaey, J.M., Langendoen, K.: Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In: USENIX Technical Annual Conference'02 (2002)
343. ScatterWeb: http://www.scatterweb.de/
344. Schmid, S., Wattenhofer, R.: Algorithmic Models for Sensor Networks. In: 14th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS), April 2006
345. Schneier, B.: Applied Cryptography, 2nd edn. John Wiley &; Sons Inc., Chichester (1995)
346. Shang, Y., Ruml, W.: Improved mds-based localization. In: Proceedings of the 23nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04), IEEE Computer Society Press, Los Alamitos (2004)
347. Shenker, S., Ratnasamy, S., Karp, B., Govindan, R., Estrin, D.: Data-centric storage in sensornets. In: SIGCOMM Comput. Commun. Rev. (2003)
348. Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC'95), pp. 265-274. ACM Press, New York (1997)
349. Simmons, G.: An Introduction to Shared Secret and/or Shared Control Schemes and their Application. Contemporary Cryptology. IEEE Computer Society Press, Los Alamitos (1992)
350. Simon, G., Ledeczi, A., Maroti, M.: Sensor network-based countersniper system. In: In Proceedings of ACM Second International Conference on Embedded Networked Sensor Systems (SenSys 04), ACM Press, New York (2004)
351. Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. In: IEEE Transactions on Information Theory, pp. 471-480. IEEE Computer Society Press, Los Alamitos (1973)
352. Smart kindergarten: http://nesl.ee.ucla.edu/projects/smartkg/
353. Solis, I., Obraczka, K.: The impact of timing in data aggregation for sensor networks. In: Proceedings of the IEEE International Conference on Communications (ICC04), IEEE Computer Society Press, Los Alamitos (2004)
354. Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.R.: Energy efficiency of ad hoc networks with selfish users. In: Proceedings of the 4th European Wireless Conference (EW'02), February 2002
355. Szegedy, M., Vishwanathan, S.: Locality based graph coloring. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC93), pp. 201-207. ACM Press, New York (1993)
356. Takagi, H., Kleinrock, L.: Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transaction on Communications 32(3), 246-257 (1984)
357. Tan, H.O., Körpeoglu, I.: Power efficient data gathering and aggregation in wireless sensor networks. SIGMOD Rec. 32(4), 66-71 (2003)
358. Tarjan, R.E.: Finding optimum branchings. Networks 7, 25-35 (1977)
359. Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics (1983)
360. TelosB: http ://www.xbow.com/Products/Product_pdf_files/¥ireless_ pdf/TelosB_Datasheet.pdf
361. Thorup, M.: Quick and good facility location. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), SIAM (2003)
362. Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM 51(6), 993-1024 (2004)
363. Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'01), pp. 1-10. ACM Press, New York (2001)
364. Thorup, M., Zwick, U.: Approximate distance oracles. Journal of the ACM 52(1), 1-24 (2005)
365. TinyOS community forum: http://www.tinyos.net/.
366. Tobagi, F.A., Kleinrock, L.: Packet switching in radio channels: Part II - The hidden terminal problem in carrier sense multiple-access and the busy-tone solution. IEEE Transactions on Communications 23, 1417-1433 (1975)
367. Tsuchiya, P.F.: The landmark hierarchy: a new hierarchy for routing in very large networks. In: Proc. of ACM SIGCOMM, ACM Press, New York (1988)
368. Tutte, W.T.: How to draw a graph. Proceedings of the London Mathematical Society 13, 743-768 (1963)
369. SETI@Home: http://setiathome.ssl.berkeley.edu/
370. Urrutia, J.: Routing with guaranteed delivery in geometric and wireless networks. In: Stojmenovic, I. (ed.) Handbook of Wireless Networks and Mobile Computing, chapter 18, pp. 393-406. Wiley, Chichester (2002)
371. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 6(3), 80-82 (1977)
372. van Hoesel, L G W., Havinga, P J M.: A lightweight medium access protocol (LMAC) for wireless sensor networks. In: 1st Int. Workshop on Networked Sensing Systems (INSS) (2004)
373. van Leeuwen, J., Tan, R.B.: Routing with compact routing tables. Technical Report RUU-CS-83-16, Dept. of Computer Science, Utrecht University (1983)
374. van Leeuwen, J., Tan, R.B.: Interval routing. The Computer Journal 30(4), 298-307 (1987)
375. van Leeuwen, J., Tan, R.B.: Compact routing methods: A survey. In: Proceedings of the 1st International Colloquium on Structural Information and Communication Complexity (SIROCCO'94), pp. 99-110. Carleton University Press (1994)
376. Vazirani, V.V.: Approximation Algorithms, 2nd edn. Springer, Heidelberg (2003)
377. Veitkamp, R.C.: The γ-neighborhood graph. Computational Geometry: Theory and Applications 1(4), 227-246 (1992)
378. Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz. 3, 25-30 (1964)
379. von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A robust interference model for wireless ad-hoc networks. In: 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS '05), p. 239. IEEE Computer Society Press, Los Alamitos (2005)
380. von Rickenbach, P., Wattenhofer, R.: Gathering correlated data in sensor networks. In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2004), Philadelphia, Pennsylvania, USA (October 2004)
381. Vygen, J.: Approximation algorithms for facility location problems. Technical Report 05950-OR, Research Institute for Discrete Mathematics, University of Bonn (2005)
382. Walters, J.P., Liang, Z., Shi, W., Chaudhary, V.: Wireless sensor network security: A survey (2000), http://www.cs.wayne.edu/-XXX-tilde-weisong/ papers/walters05-wsn-security-survey.pdf.
383. Wan, P.-J., Alzoubi, K., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'02), IEEE Computer Society Press, Los Alamitos (2002)
384. Wan, P.-J., Cǎlinescu, G., Li, X.-Y., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1162-1171. IEEE Computer Society Press, Los Alamitos (2001)
385. Wang, W., Li, X.-Y.: Truthful low-cost unicast in selfish wireless networks. In: Proceedings of the 4th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN'04), IEEE Computer Society Press, Los Alamitos (2004)
386. Wang, W., Li, X.-Y., Sun, Z., Wang, Y.: Design multicast protocols for noncooperative networks. In: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05), Miami, Florida (March 2005)
387. Wang, W., Li, X.-Y., Wang, Y.: Truthful multicast routing in selfish wireless networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MOBICOM'04), pp. 245-259. ACM Press, New York (2004)
388. Wang, Y., Vassileva, J.: Bayesian Network-Based Trust Model. In: Proceedings of the IEEE/WIC International Conference on Web Intelligence (WI'03), pp. 372-378 (2003)
389. Wang, Y., Wang, W., Li, X.-Y.: Distributed low-cost backbone formation for wireless ad hoc networks. In: Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC05), pp. 2-13. ACM Press, New York (2005)
390. Wattenhofer, M., Wattenhofer, R., Widmayer, P.: Geometric routing without geometry. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, Springer, Heidelberg (2005)
391. Wattenhofer, R.: Sensor networks: Distributed algorithms reloaded - or revolutions? In: Flocchini, P., Gasieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, Springer, Heidelberg (2006)
392. Wattenhofer, R., Li, L., Bahl, P., Wang, Y.-M.: Distributed topology control for wireless multihop ad-hoc networks. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'01), pp. 1388-1397. IEEE Computer Society Press, Los Alamitos (2001)
393. Wattenhofer, R., Zollinger, A.: XTC: A practical topology control algorithm for ad-hoc networks. In: 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS '04), IEEE Computer Society Press, Los Alamitos (2004)
394. Watts, D.J.: Small Worlds. Princeton University Press, Princeton (1999)
395. Whang, D.H., Xu, N., Rangwala, S., Chintalapudi, K., Govindan, R., Wallace, J.W.: Development of an embedded networked sensing system for structural health monitoring. In: In Proceedings of International Workshop on Smart Materials and Structures Technology (2004)
396. Woo, A., Tong, T., Culler, D.: Taming the underlying challenges of reliable multihop routing in sensor networks. In: Proc. of ACM SenSys, ACM Press, New York (2003)
397. Woodall, D.: Improper colourings of graphs. In: Nelson, R., Wilson, R.J. (eds.) Graph Colourings, Longman Scientific and Technical (1990)
398. Wu, J.: Dominating-set-based routing in ad hoc wireless networks. In: Stojmenovic, I. (ed.) Handbook of Wireless Networks and Mobile Computing, chapter 20, pp. 425-450. Wiley, Chichester (2002)
399. Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M'99), pp. 7-14 (1999)
400. Intel PXA27x0 processor family: http://download.intel.com/design/pca/ applicationsprocessors/datashts/28000304.pdf.
401. Yao, A.C.-C.: On constructing minimum spanning trees in fc-dimensional spaces and related problems. SIAM Journal on Computing 11(4), 721-736 (1982)
402. Yu, Y., Krishnamachari, B., Prasanna, V.K.: Energy-latency tradeoffs for data gathering in wireless sensor networks. In: Proceedings of the 23nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04), March 2004, IEEE Computer Society Press, Los Alamitos
403. Zacharia, G., Moukas, A., Maes, P.: Collaborative Reputation Mechanisms in Electronic Marketplaces. In: Proceedings of the 32nd Hawaii International Conference on System Sciences (HICSS'99) (1999)
404. Zebranet: http://www.princeton.edu/~mrm/zebranet.html
405. Zhao, J., Govindan, R.: Understanding packet delivery performance in dense wireless sensor networks. In: Proc. of ACM SenSys, ACM Press, New York (2003)
406. Zhong, S., Chen, J., Yang, Y.R.: Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03), pp. 1987-1997. IEEE Computer Society Press, Los Alamitos (2003)
407. Zhou, L., Haas, Z.J.: Securing Ad Hoc Networks. IEEE Network 13(6), 24-30 (1999)
408. Zimmermann, P.R.: The Official PGP User's Guide. MIT Press, Cambridge (1995)
409. Zollinger, A.: Networking Unleashed: Geographic Routing and Topology Control in Ad Hoc and Sensor Networks. PhD thesis, ETH Zurich, Switzerland, Diss. ETH 16025 (2005)
410. Zorzi, M., Rao, R.R.: Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance. IEEE Transaction on Mobile Computing 2(4), 337-348 (2003)