On the asymptotic connectivity of random networks under the random connection model

Guoqiang Mao*, Brian Do Anderson

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    18 Citations (Scopus)

    Abstract

    Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density ρand a pair of nodes separated by an Euclidean distance x are directly connected with probability g(x/rρ ), where g : [0,∞ρ+b/cp) [0,1] satisfies three conditions: rotational invariance, qnon-increasing monotonicity and integral boundedness, √ρ+b/Cp = ∫R2g(∥x∥)dx and bis a constant, independent of the event that another pair of nodes are directly connected. In this paper, we analyze the asymptotic distribution of the number of isolated nodes in the above network using the Chen-Stein technique and the impact of the boundary effect on the number of isolated nodes as ρ. On that basis we derive a necessary condition for the above network to be asymptotically almost surely connected. These results form an important link in expanding recent results on the connectivity of the random geometric graphs from the commonly used unit disk model to the more generic and more practical random connection model.

    Original languageEnglish
    Title of host publication2011 Proceedings IEEE INFOCOM
    Pages631-639
    Number of pages9
    DOIs
    Publication statusPublished - 2011
    EventIEEE INFOCOM 2011 - Shanghai, China
    Duration: 10 Apr 201115 Apr 2011

    Publication series

    NameProceedings - IEEE INFOCOM
    ISSN (Print)0743-166X

    Conference

    ConferenceIEEE INFOCOM 2011
    Country/TerritoryChina
    CityShanghai
    Period10/04/1115/04/11

    Fingerprint

    Dive into the research topics of 'On the asymptotic connectivity of random networks under the random connection model'. Together they form a unique fingerprint.

    Cite this