Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김선우 | - |
dc.date.accessioned | 2019-12-04T07:48:32Z | - |
dc.date.available | 2019-12-04T07:48:32Z | - |
dc.date.issued | 2018-02 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, v. 17, no. 5, page. 3201-3210 | en_US |
dc.identifier.issn | 1536-1276 | - |
dc.identifier.issn | 1558-2248 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/document/8303665 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/117377 | - |
dc.description.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. | en_US |
dc.description.sponsorship | This work was supported in part by the Samsung Research Funding and Incubation Center of Samsung Electronics under Project SRFC-IT-1601-09, and in part by the Ministry of Science and ICT, Korea, under the Information Technology Research Center support program (IITP-2017-0-01637) supervised by the Institute for Information and Communications Technology Promotion. The work of A. P. Kartun-Giles was supported by the EPSRC Institutional Sponsorship Grant "Random Walks on Random Geometric Networks," 2015. The associate editor coordinating the review of this paper and approving it for publication was S. Kompella. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | en_US |
dc.subject | Random geometric graphs | en_US |
dc.subject | random connection model | en_US |
dc.subject | stochastic geometry | en_US |
dc.subject | broadcast | en_US |
dc.subject | range-free localisation | en_US |
dc.title | Counting k-Hop Paths in the Random Connection Model | en_US |
dc.type | Article | en_US |
dc.relation.no | 5 | - |
dc.relation.volume | 17 | - |
dc.identifier.doi | 10.1109/TWC.2018.2808290 | - |
dc.relation.page | 3201-3210 | - |
dc.relation.journal | IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS | - |
dc.contributor.googleauthor | Kartun-Giles, Alexander P. | - |
dc.contributor.googleauthor | Kim, Sunwoo | - |
dc.relation.code | 2018000229 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF ELECTRONIC ENGINEERING | - |
dc.identifier.pid | remero | - |
dc.identifier.orcid | http://orcid.org/0000-0002-7055-6587 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.