Initializing newly deployed ad hoc and sensor networks

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2004, Pages 260-274

  Kuhn, Fabian ^a   Moscibroda, Thomas ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Ad hoc networks; Asynchronous wake up; Clustering; Distributed algorithms; Dominating set algorithms; Initialization; Sensor networks

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBLEM SOLVING; RADIO COMMUNICATION; SENSORS; SYNCHRONIZATION; TOPOLOGY;

AD HOC NETWORKS; ASYNCHRONOUS WAKE-UP; CLUSTERING; DISTRIBUTED ALGORITHMS; DOMINATING SET ALGORITHMS; INITIALIZATION; SENSOR NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 11244265814     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1023720.1023746     Document Type: Conference Paper

References (36)

1. I. Akyildiz, W. SU, Y. Sankarasubramaniam, and E. Cayirci. Wireless Sensor Networks: A Survey. Computer Networks Journal, 38(4):393-422, 2002.
2. rd ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC), pages 157-164, EPFL Lausanne, Switzerland, 2002.
3. D. J. Baker and A. Ephremides. The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Transactions on Communications, COM-29(11):1694-1701, 1981.
4. th ACM Symp. on Principles of Distributed Computing (PODC), pages 98-108, 1987.
5. th Int. workshop on Discrete algorithms and methods for mobile computing and communications, pages 19-27, 2001.
6. S. Basagni. Distributed Clustering for Ad Hoc Networks. In Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), pages 310-315, 1999.
7. M. Chatterjee, S. K. Das, and D. Turgut. An On-Demand Weighted Clustering Algorithm (WCA) for Ad-Hoc Networks. In Proceedings of IEEE GLOBECOM 2000, pages 1697-1701. ACM Press, 2000.
8. J. Deng and Z. Haas. Dual Busy Tone Multiple Access (DBTMA): A New Medium Access Control for Packet Radio Networks. In Proceedings of IEEE ICUPC, volume 1, pages 973-977, 1998.
9. Y. M. E. Kushilevitz. An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks. SIAM Journal on Computing, 27:702-712, 1998.
10. U. Feige. A Threshold of In n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634-652, 1998.
11. th Symposium on Computational Geometry (SCG), pages 188-196, 2001.
12. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
13. th ACM symposium on Principles of Distributed Computing (PODC), pages 113-121, 2000.
14. M. Gerla and J. Tsai. Multicluster, mobile, multimedia radio network. ACM/Baltzer Journal of Wireless Networks, 1(3):255-265, 1995.
15. rd Annual Hawaii International Conference on System Sciences, pages 3005-3014, 2000.
16. H. B. Hunt, III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. NC-Approximation Schemes for NP- and PSPACE-hard Problems for Geometric Graphs. Journal of Algorithms, 26(2):238-274, 1998.
17. th ACM Symposium on Principles of Distributed Computing (PODC), pages 33-42, 2001.
18. th Annual International Symposium on Algorithms and Computation (ISAAC), volume 2518 of Lecture Notes in Computer Science, pages 535-549, 2002.
19. R. M. Karp. Reducibility Among Combinatorial Problems. In Proc. of a Symposium on the Complexity of Computer Computations, pages 85-103, 1972.
20. R. Kershner. The number of circles covering a set. American Journal of Mathematics, 62, 1939.
21. th Annual European Symposium on Algorithms (ESA), 2004.
22. rd ACM Symposium on the Principles of Distributed Computing (PODC), 2004.
23. nd ACM Int. Symposium on the Principles of Distributed Computing (PODC), pages 25-32, 2003.
24. F. Kuhn, R. Wattenhofer, and A. Zollinger. Ad-hoc Networks Beyond Unit Disk Graphs. In Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 69-78. ACM Press, 2003.
25. S. Kutten and D. Peleg. Fast Distributed Construction of Small k-Dominating Sets and Applications. Journal of Algorithms, 28:40-66, 1998.
26. K. Nakano and S. Olariu. Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with no Collision Detection. IEEE Transactions on Parallel and Distributed Systems, 11(8), 2000.
27. st International Conference on Embedded Networked Sensor Systems (SenSys), pages 181-192. ACM Press, 2003.
28. L. G. Roberts. Aloha Packet System with and without Slots and Capture. ACM SIGCOMM, Computer Communication Review, 5(2):28-42, 1975.
29. J. Sharony. An architecture for mobile radio networks with dynamically changing topology using virtual subnets. Mobile Networks and Applications, 1(1):75-86, 1996.
30. P. Sinha, R. Sivakumar, and V. Bharghavan. Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures. In IEEE Conference on Computer Communications (INFOCOM), pages 1763-1772, 2001.
31. F. A. Tobagi and L. Kleinrock. Packet Switching in Radio Channels: Part II - The Hidden Terminal Problem in Carrier Sense Multiple Access and the Busy Tone Solution. COM-23(12):1417-1433, 1975.
32. P. Wan, K. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. In Proceedings of INFOCOM, 2002.
33. nd Int. Conf. on Distributed Computing Systems (ICDCS), 2002.
34. thInt. Conf. on Mobile Computing and Networking (MOBICOM), pages 221-235. ACM Press, 2001.
35. rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pages 7-14, 1999.
36. W. Ye, J. Heidemann, and D. Estrin. An Energy-Efficient MAC protocol for Wireless Sensor Networks. In Proceedings of IEEE INFOCOM, pages 1567-1576, New York, NY, USA, June 2002.