Abstract
We present efficient distributed algorithms for computing 2-hop neighborhoods in Ad Hoc Wireless Networks. The knowledge of the 2-hop neighborhood is assumed in many protocols and algorithms for routing, clustering, and distributed channel assignment, but no efficient distributed algorithms for computing the 2-hop neighborhoods were previously published.
The problem is nontrivial, as the graphs induced by ad-hoc wireless networks can be dense. We employ the broadcast nature of the wireless networks to obtain a distributed algorithm in which every node gains knowledge of its 2-hop neighborhood using a total of O(n) messages, where n is the total number of nodes in the network, and each message has O(logn) bits, which we assume is enough to encode the ID and the geographic position of a node. Our algorithm operates in an asynchronous environment, and makes use of the geographic position of the nodes.
A more complicated algorithm achieves the same communication bounds when geographical positions are not available, but nodes are capable of evaluating the distance to neighboring nodes or the angle of signal arrival. We also discuss updating the knowledge of 2-hop neighborhoods when nodes join or leave the network.
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
Alzoubi, K.M.: Distributed Algorithms for Connected Dominating Set in Wireless Ad Hoc Networks, Illinois Institute of Technology (2002)
Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In: ACM MOBIHOC 2002 (2002)
Bao, L., Garcia-Luna-Aceves, J.J.: Channel Access Scheduling in Ad Hoc Networks with Unidirectional Links. In: 5th International Workshop on Discrete Algorithms and Methods for Mobility, pp. 9–18 (2001)
Basu, S.: Different bounds on the different Betti numbers of semi-algebraic sets. To appear in Discrete and Computational Geometry, Available at http://www.math.gatech.edu/~saugata
Basu, S., Pollack, R., Roy, M.F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2003)
Bharghavan, V., Das, B.: Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets. In: International Conference on Communications 1997, Montreal, Canada (June 1997)
Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Computational Geometry. Theory and Applications 9, 3–24 (1998)
Calamoneri, T., Petreschi, R.: L(2,1)-Labeling of Planar Graphs. In: 5th International Workshop on Discrete Algorithms and Methods for Mobility, pp. 28–33 (2001)
Calinescu, G., Mandoiu, I., Wan, P.-J., Zelikovsky, A.: Selecting Forwarding Neighbors in Wireless Ad Hoc Networks. In: 5th International Workshop on Discrete Algorithms and Methods for Mobility, pp. 34–43 (2001)
Chlamtac, I., Pinter, S.: Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network. IEEE Trans. on Computers 36(6), 728–737 (1987)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)
Griggs, J.R., Yeh, R.K.: Labeling Graphs with a Condition at Distance 2. SIAM J. Disc. Math 5, 586–595 (1992)
Hightower, J., Borriello, G.: Location Systems for Ubiquitous Computing. IEEE Computer 34(8), 57–66 (2001)
Jacquet, P., Laouiti, A., Minet, P., Viennot, L.: Performance analysis of OLSR multipoint relay flooding in two ad hoc wireless network models. In: RSRCP, Special issue on Mobility and Internet (2001)
Krizman, K., Bieda, T., Rappaport, T.: Wireless position location: fundamentals, implementation strategies, and source of error. In: Veh. Tech. Conf., pp. 919–923 (1997)
Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple Heuristics for Unit Disk Graphs. Networks 25, 59–68 (1995)
Mishra, B.: Computational Real Algebraic Geometry. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)
Nasipuri, A., Lim, K.: A Directionality based Location Discovery Scheme for Wireless Sensor Networks. In: WSNA 2002 (2002)
Ramanathan, S., Steenstrup, M.: A survey of routing techniques for mobile communication networks. ACM/Baltzer Mobile Networks and Applications, 89– 104 (1996)
Stojmenovic, I., Lin, X.: Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems 12, 1023–1032 (2001)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. In: IEEE INFOCOM 2002 (2002)
Wang, Y., Li, X.-Y.: Geometric Spanners for Wireless Ad Hoc Networks. In: ICDCS 2002 (2002)
Whiteley, W.: Rigidity and Scene Analysis. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 893–916. CRC Press, Boca Raton (1997)
Wu, J., Li, H.L.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd ACM international workshop on Discrete algorithms and methods for mobile computing and communications, pp. 7–14 (1999)
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
Calinescu, G. (2003). Computing 2-Hop Neighborhoods in Ad Hoc Wireless 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_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-39611-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20260-8
Online ISBN: 978-3-540-39611-6
eBook Packages: Springer Book Archive