## Performance studies of wireless multihop networks

No Thumbnail Available

##### Journal Title

##### Journal ISSN

##### Volume Title

Doctoral thesis (article-based)

Checking the digitized thesis and permission for publishing

Instructions for the author

Instructions for the author

Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.

##### Author

##### Date

2006-05-12

##### Major/Subject

##### Mcode

##### Degree programme

##### Language

en

##### Pages

77, [68]

##### Series

Report / Helsinki University of Technology, Networking Laboratory, 3/2006

##### Abstract

Wireless multihop networks represent a fundamental step in the evolution of wireless communications, a step that has proven challenging. Such networks give rise to a wide range of novel performance and design problems, most of which are of a geometric nature. This dissertation addresses a selection of such problems. The first part of this thesis presents studies in which the network nodes are assumed to receive signals sufficiently clearly only from within some fixed range of operation. Using this simple model, the first two problems addressed are to predict the probabilities that a network with randomly placed nodes is connected or completely covers a given target domain, respectively. These problems are equivalent to determining the probability distribution of the minimal range providing connectivity or coverage. Algorithms for determining these threshold ranges for a given set of network nodes are developed. Because of the complex nature of these problems in finite settings, they are both approached by empirically modeling the convergence of these distributions to their known asymptotic limits. Next, a novel optimization problem is presented, in which the task is to make a given disconnected network into a connected one by adding a minimal number of additional nodes to the network, and heuristic algorithms are proposed for this problem. In the second part, these networks are studied in the context of a more realistic model in which the condition for successful communication between network nodes is expressed as an explicit minimum value for the received signal-to-noise-and-interference ratio. The notion of the threshold range for connectivity is first generalized to this network model. Because connectivity is now affected by medium access control (MAC), two alternative MAC schemes are considered. Finally, an infinite random network employing slotted Aloha is studied under this model. Since the probability of successful reception in a random time slot is a function of the locations of other nodes, this temporal probability is a random variable with its own probability distribution over different node configurations. Numerical approximations for evaluating both the mean and the tail probability of this distribution are developed. The accuracy of these approximations can be improved indefinitely, at the cost of numerical computations.##### Description

##### Keywords

wireless multihop networks, ad hoc networks, sensor networks, connectivity, coverage, throughput, geometric random graphs, stochastic geometry

##### Other note

##### Parts

- Henri Koskinen. A simulation-based method for predicting connectivity in wireless multihop networks. Telecommunication Systems, 26 (2-4), pages 321-338, June 2004.
- Henri Koskinen. Quantile models for the threshold range for k-connectivity. In: Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems (MSWiM '04), pages 1-7, October 2004. ACM Press, New York, NY, USA. [article2.pdf] © 2004 Association for Computing Machinery (ACM). By permission.
- Pasi Lassila, Esa Hyytiä, and Henri Koskinen. Connectivity properties of Random Waypoint mobility model for ad hoc networks. In: Proceedings of the Fourth Annual Mediterranean Workshop on Ad Hoc Networks (Med-Hoc-Net), 10 pages, June 2005, printed proceedings to appear. [article3.pdf] © 2005 Springer Science+Business Media. By permission.
- Henri Koskinen. On the coverage of a random sensor network in a bounded domain. In: Proceedings of the 16th ITC Specialist Seminar, pages 11-18, August 2004. [article4.pdf] © 2004 by author.
- Henri Koskinen, Jouni Karvo, and Olli Apilo. On improving connectivity of static ad-hoc networks by adding nodes. In: Proceedings of the Fourth Annual Mediterranean Workshop on Ad Hoc Networks (Med-Hoc-Net), 10 pages, June 2005, printed proceedings to appear. [article5.pdf] © 2005 Springer Science+Business Media. By permission.
- Henri Koskinen. Generalization of critical transmission range for connectivity to wireless multihop network models including interference. In: Proceedings of the Third IASTED International Conference on Communications and Computer Networks (CCN 2005), pages 88-93, October 2005. [article6.pdf] © 2005 by author.
- Henri Koskinen and Jorma Virtamo. Probability of successful transmission in a random slotted-Aloha wireless multihop network employing constant transmission power. In: Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems (MSWiM '05), pages 191-199, October 2005. ACM Press, New York, NY, USA. [article7.pdf] © 2005 Association for Computing Machinery (ACM). By permission.