K-connectivity in shadowing wireless multi-hop networks
Soong, Boon Hee
Date of Issue2006
IEEE Global Telecommunications Conference (2006 : San Francisco, California, US)
School of Electrical and Electronic Engineering
In this paper, we study the network performance of a wireless multi-hop network in terms of the successful link probability and k-connectivity probability by taking into account shadowing. We provide the closed-form analytic results of the successful link probability, and henceforth k-connectivity, in the context of shadowing multi-hop networks. Given a certain number of nodes spatially distributed according to a Poisson point process, we examine the critical density to keep the probability that a node is k-connected close to 1. The impacts of the shadowing on the k-connectivity are illustrated and discussed. The results can be practically used for the design of a wireless multi-hop network.
DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
© 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: http://dx.doi.org/10.1109/GLOCOM.2006.994.