240 0

Counting k-Hop Paths in the Random Connection Model

Title
Counting k-Hop Paths in the Random Connection Model
Author
김선우
Keywords
Random geometric graphs; random connection model; stochastic geometry; broadcast; range-free localisation
Issue Date
2018-02
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, v. 17, no. 5, page. 3201-3210
Abstract
We study, via combinatorial enumeration, the probability of k-hop connection between two nodes in a wireless multihop network. This addresses the difficulty of providing an exact formula for the scaling of hop counts with Euclidean distance without first making a sort of mean field approximation, which in this case assumes all nodes in the network have uncorrelated degrees. We therefore study the mean and variance of the number of k-hop paths between two vertices x, y in the random connection model, which is a random geometric graph where nodes connect probabilistically rather than deterministically according to a critical connection range. In the example case where Rayleigh fading is modeled, the variance of the number of three hop paths is in fact composed of four separate decaying exponentials, one of which is the mean, which decays slowest as parallel to x - y parallel to -> infinity. These terms each correspond to one of exactly four distinct substructures which can form when pairs of paths intersect in a specific way, for example at exactly one node. Using a sum of factorial moments, this relates to the path existence probability. We also discuss a potential application of our results in bounding the broadcast time.
URI
https://ieeexplore.ieee.org/document/8303665https://repository.hanyang.ac.kr/handle/20.500.11754/117377
ISSN
1536-1276; 1558-2248
DOI
10.1109/TWC.2018.2808290
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > ELECTRONIC ENGINEERING(융합전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE