Please use this identifier to cite or link to this item:
Title: K-connectivity in shadowing wireless multi-hop networks
Authors: Zhang, Lili
Soong, Boon Hee
Keywords: DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
Issue Date: 2006
Source: Zhang, L., & Soong, B. H. (2006). K-connectivity in shadowing wireless multi-hop networks. The IEEE Global Telecommunications Conference, pp.1-4.
Abstract: 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.
DOI: 10.1109/GLOCOM.2006.994
Rights: © 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:
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Conference Papers

Files in This Item:
File Description SizeFormat 
k-Connectivity in Shadowing Wireless Multi-Hop Networks.pdfMain article475.53 kBAdobe PDFThumbnail

Citations 50

Updated on Mar 13, 2023

Page view(s) 5

Updated on Mar 22, 2023

Download(s) 5

Updated on Mar 22, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.