Abstract
Ad hoc networks consist of wireless, self-organizing nodes that can communicate with each other in order to establish decentralized and dynamically changing network topologies. Node discovery is a fundamental procedure in the establishment of an ad hoc network, as a given node needs to discover what other nodes are in its communication range. Existing multi-channel node discovery protocols are typically constrained by the network configuration that will be imposed on the nodes once they are discovered. We present a communication model that is independent of the network configuration that will be established after node discovery. We present a pair of node discovery protocols for k ≥ 2 nodes in a multi-channel system and analyze them using the given communication model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alonso, G., Kranakis, E., Wattenhofer, R., Widmayer, P.: Probabilistic Protocols for Node Discovery in Ad-hoc Single Broadcast Channel Networks. In: Workshop on Mobile AdHoc Networks (WMAN), International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France, April 22 - 26 (2003)
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)
Blom, G., Thoburn, D.: How Many Random Digits Are Required Until Given Sequences Are Obtained. J. Applied Probability 19, 518–531 (1982)
BlueHoc: An Open-Source Simulator, http://oss.software.ibm.com/developerworks/opensource/bluehoc
Ericsson Microelectronics: ROK 101 007 Bluetooth Module Datasheet Rev. PA5 (April 2000)
Garcés, R., Garcia-Luna-Aceves, J.J.: Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks. In: IEEE Infocom 2000, Tel-Aviv, Israel, March 26 - 30 (2000)
Feller, W.: An Introduction to Probability Theory and its Applications, vol. II. Wiley, Chichester (1966)
Haartsen, J.: Bluetooth Baseband Specification v. 1.0, http://www.Bluetooth.com
Kasten, O., Langheinrich, M.: First Experiences with Bluetooth in the Smart-Its Distributed Sensor Network, Workshop on Ubiquitous Computing and Communications. In: PACT 2001 (October 2001)
Law, C., Mehta, A.K., Siu, K.-Y.: Performance of a Bluetooth Scatternet Formation Protocol. In: The Second ACM Annual Workshop on Mobile Ad Hoc Networking and Computing (mobiHoc 2001), Long Beach, California, USA, October 4-5 (2001)
Li, S.R.: A Martingale Approach to the Study of Occurrence of Sequence Patterns in Repeated Experiments. Annals of Probability 8, 1171–1176 (1980)
Perkins, C.E. (ed.): Ad Hoc Networking. Addison-Wesley, Reading (2001)
Ross, S.: Stochastic Processes, 2nd edn. John Wiley and Sons, Chichester (1996)
Salonidis, T., Bhagwat, P., Tassiulas, L.: Proximity Awareness and Fast Connection Establishment in Bluetooth. In: The First ACM Annual Workshop on Mobile Ad Hoc Networking and Computing (MobiHoc 2000), Boston, Massachusetts, USA, August 11 (2000)
Salonidis, T., Bhagwat, P., Tassiulas, L., LaMaire, R.: Distributed Topology Construction of Bluetooth Personal Area Networks. In: Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), Anchorage, Alaska, USA, April 22 - 26 (2001)
Siegemund, F., Rohs, M.: Rendezvous Layer Protocols for Bluetooth-Enabled Smart Devices, Technical Report, 1st International Conference on the Architecture of Computer Systems, ARCS - Trends in Network and Pervasive Computing (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alonso, G., Kranakis, E., Sawchuk, C., Wattenhofer, R., Widmayer, P. (2003). Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2003. Lecture Notes in Computer Science, vol 2865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39611-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-39611-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20260-8
Online ISBN: 978-3-540-39611-6
eBook Packages: Springer Book Archive