Abstract
This study presents an approach to the problem of predicting k-connectivity in wireless multihop networks. Assuming the network consists of randomly placed nodes with a common transmission range, the threshold range for k-connectivity is a random variable. Knowing the distribution of this random variable under the circumstances of interest allows one to determine how the number of nodes, the transmission range, and the network area are related so that a random network realization is k-connected with a given probability.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.D. Battista and R. Tamassia, On-line maintenance of triconnected components with SPQR-trees, Algorithmica15 (1996) 302–318.
C. Bettstetter, On theminimum node degree and connectivity of a wirelessmultihop network, in: Proc. of the 3rd ACM Internat. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02), 2002, pp. 80–91.
C. Bettstetter and J. Zangl, How to achieve a connected ad hoc network with homogeneous range assignment: An analytical study with consideration of border effects, in: Proc. of the 4th IEEE Internat. Conf. on Mobile and Wireless Communication Networks (MWCN'02), 2002, pp. 125–129.
R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 173, 2nd ed. (Springer, New York, 2000); http://www.math.uni-hamburg.de/home/diestel/books/graph. theory/.
O. Dousse, P. Thiran and M. Hasler, Connectivity in ad-hoc and hybrid networks, in: Proc. of the 21st Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM 2002), Vol. 2, 2002, pp. 1079–1088.
P. Gupta and P.R. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory46(2) (2000) 388–404.
C. Gutwenger and P. Mutzel, A linear time implementation of SPQR-trees, in: Proc. of the 8th Internat. Symposium on Graph Drawing (GD 2000), 2000, pp. 77–90.
H. Koskinen, A simulation-based method for predicting connectivity in ad hoc networks, in: Proc. of Internat. Network Optimization Conf. (INOC 2003), 2003 (short paper).
R. Meester and R. Roy, Continuum Percolation (Cambridge Univ. Press, Cambridge, 1996).
Nesetril, Milkova and Nesetrilova, Otakar Boruvka on minimum spanning tree problem: Translation of both the 1926 papers, Comments, history, DMATH: Discrete Mathematics233 (2001); URL: citeseer.nj.nec.com/nesetril00otakar.html.
M.D. Penrose, The longest edge of the random minimal spanning tree, Annals of Applied Probability 7(2) (1997) 340–361.
M.D. Penrose, On k-connectivity for a geometric random graph, Random Structures and Algorithms15(2) (1999) 145–164.
T.K. Philips, S.S. Panwar and A.N. Tantawi, Connectivity properties of a packet radio network model, IEEE Transactions on Information Theory35(5) (1989) 1044–1047.
R.C. Prim, Shortest connection networks and some generalizations, Bell Systems Technology Journal 36 (1957) 1389–1401.
M. Sánchez, P. Manzoni and Z. Haas, Determination of critical transmission range in ad-hoc networks, in: Proc. of Multiaccess Mobility and Teletraffic for Wireless Communications 1999 Workshop (MMT'99), 1999; URL: citeseer.ist.psu.edu/273394.html.
M.A. Weiss, Data Structures and Algorithm Analysis (Benjamin/Cummings, Redwood City, CA, 1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Koskinen, H. A Simulation-Based Method for Predicting Connectivity in Wireless Multihop Networks. Telecommunication Systems 26, 321–338 (2004). https://doi.org/10.1023/B:TELS.0000029044.31054.5a
Issue Date:
DOI: https://doi.org/10.1023/B:TELS.0000029044.31054.5a