Abstract
The aim of the paper is to investigate the average case behavior of certain algorithms that are designed for connecting mobile agents in the two- or three-dimensional space. The general model is the following: let X be a set of points in the d-dimensional Euclidean space E d , d≥ 2; r be a function that associates each element of x ∈ X with a positive real number r(x). A graph G(X,r) is an oriented graph with the vertex set X, in which (x,y) is an edge if and only if ρ(x,y) ≤ r(x), where ρ(x,y) denotes the Euclidean distance in the space E d . Given a set X, the goal is to find a function r so that the graph G(X,r) is strongly connected (note that the graph G(X,r) need not be symmetric). Given a random set of points, the function r computed by the algorithm of the present paper is such that, for any constant δ, the average value of r(x)δ (the average transmitter power) is almost surely constant.
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
Clementi, A., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Mobile Networks and Applications 9, 125–140 (2004)
Deuschel, J.-D., Pisztora, A.: Surface order large deviations fo high-density percolation. Probability Theory and Related Fields 104, 467–482 (1996)
Kleinrock, L., Silvester, J.A.: Optimum transmission radii for packet radio networks or why six is a magic number. In: IEEE Nat. Telecommun. Conf., pp. 431–435 (1978)
Peierls, R.: On Ising’s model of ferromagnetism. In: Proceedings of the Cambridge Philosophical Society, vol. 36, pp. 477–481
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Takagi, H., Kleinrock, L.: Optimal transmission ranges for randomly distributed packet radioterminals. IEEE Trans. Commun. COM-32, 246–257 (1984)
Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10, 169–181 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kučera, L. (2005). Low Degree Connectivity in Ad-Hoc Networks. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_20
Download citation
DOI: https://doi.org/10.1007/11561071_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)