A simulation-based method for predicting connectivity in wireless multihop networks

Telecommunication Systems

Volumn 26, Issue 2-4, 2004, Pages 321-338

  Koskinen, Henri ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Ad hoc networks; Graph algorithms; k connectivity; Sensor networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; MATHEMATICAL MODELS; PERCOLATION (COMPUTER STORAGE); PROBABILITY; STATISTICAL METHODS;

AD HOC NETWORKS; GRAPH ALGORITHM; K-CONNECTIVITY; SENSOR NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 3543145986     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:TELS.0000029044.31054.5a     Document Type: Conference Paper

References (16)

1. G.D. Battista and R. Tamassia, On-line maintenance of triconnected components with SPQR-trees, Algorithmica 15 (1996) 302-318.
2. C. Bettstetter, On the minimum node degree and connectivity of a wireless multihop network, in: Proc. of the 3rd ACM Internat. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02), 2002, pp. 80-91.
3. 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.
4. 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/.
5. 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.
6. P. Gupta and P.R. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory 46(2) (2000) 388-404.
7. 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.
8. 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).
9. R. Meester and R. Roy, Continuum Percolation (Cambridge Univ. Press, Cambridge, 1996).
10. Nesetril, Milkova and Nesetrilova, Otakar Boruvka on minimum spanning tree problem: Translation of both the 1926 papers, Comments, history, DMATH: Discrete Mathematics 233 (2001); URL: citeseer.nj.nec.com/nesetri100otakar.html.
11. M.D. Penrose, The longest edge of the random minimal spanning tree, Annals of Applied Probability 7(2) (1997) 340-361.
12. M.D. Penrose, On k-connectivity for a geometric random graph, Random Structures and Algorithms 15(2) (1999) 145-164.
13. T.K. Philips, S.S. Panwar and A.N. Tantawi, Connectivity properties of a packet radio network model, IEEE Transactions on Information Theory 35(5) (1989) 1044-1047.
14. R.C. Prim, Shortest connection networks and some generalizations, Bell Systems Technology Journal 36(1957) 1389-1401.
15. 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.
16. M.A. Weiss, Data Structures and Algorithm Analysis (Benjamin/Cummings, Redwood City, CA, 1995).