Accirate subgraph probabilities in a Random Geometric Graph and application to cooperative multihop ad-hoc networks

Thomas Bourgeois, Shigeru Shimamoto

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In this paper, we propose a new model to determine subgraph probabilities in a Random Geometric Graph(RGG). A subgraph in a RGG can be used to model various scenarios involving a given number of nodes in a multihop ad hoc network. We determine the probabilities for the two essential cases of complete subgraphs with three and four vertices, respectively, which have not yet been addressed correctly in the literature. Our theoretical results are confirmed by simulation and thus represent a significant step towards the quantitative analysis of complex scenarios, such as cooperative communications, in multi hop ad-hoc networks.

    Original languageEnglish
    Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
    Pages506-511
    Number of pages6
    DOIs
    Publication statusPublished - 2012
    Event2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA
    Duration: 2012 Dec 32012 Dec 7

    Other

    Other2012 IEEE Global Communications Conference, GLOBECOM 2012
    CityAnaheim, CA
    Period12/12/312/12/7

    Fingerprint

    Ad hoc networks
    Cooperative communication
    Chemical analysis

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Accirate subgraph probabilities in a Random Geometric Graph and application to cooperative multihop ad-hoc networks. / Bourgeois, Thomas; Shimamoto, Shigeru.

    GLOBECOM - IEEE Global Telecommunications Conference. 2012. p. 506-511 6503163.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Bourgeois, T & Shimamoto, S 2012, Accirate subgraph probabilities in a Random Geometric Graph and application to cooperative multihop ad-hoc networks. in GLOBECOM - IEEE Global Telecommunications Conference., 6503163, pp. 506-511, 2012 IEEE Global Communications Conference, GLOBECOM 2012, Anaheim, CA, 12/12/3. https://doi.org/10.1109/GLOCOM.2012.6503163
    Bourgeois, Thomas ; Shimamoto, Shigeru. / Accirate subgraph probabilities in a Random Geometric Graph and application to cooperative multihop ad-hoc networks. GLOBECOM - IEEE Global Telecommunications Conference. 2012. pp. 506-511
    @inproceedings{773f9c70811c488d90910bde68dfecf6,
    title = "Accirate subgraph probabilities in a Random Geometric Graph and application to cooperative multihop ad-hoc networks",
    abstract = "In this paper, we propose a new model to determine subgraph probabilities in a Random Geometric Graph(RGG). A subgraph in a RGG can be used to model various scenarios involving a given number of nodes in a multihop ad hoc network. We determine the probabilities for the two essential cases of complete subgraphs with three and four vertices, respectively, which have not yet been addressed correctly in the literature. Our theoretical results are confirmed by simulation and thus represent a significant step towards the quantitative analysis of complex scenarios, such as cooperative communications, in multi hop ad-hoc networks.",
    author = "Thomas Bourgeois and Shigeru Shimamoto",
    year = "2012",
    doi = "10.1109/GLOCOM.2012.6503163",
    language = "English",
    isbn = "9781467309219",
    pages = "506--511",
    booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

    }

    TY - GEN

    T1 - Accirate subgraph probabilities in a Random Geometric Graph and application to cooperative multihop ad-hoc networks

    AU - Bourgeois, Thomas

    AU - Shimamoto, Shigeru

    PY - 2012

    Y1 - 2012

    N2 - In this paper, we propose a new model to determine subgraph probabilities in a Random Geometric Graph(RGG). A subgraph in a RGG can be used to model various scenarios involving a given number of nodes in a multihop ad hoc network. We determine the probabilities for the two essential cases of complete subgraphs with three and four vertices, respectively, which have not yet been addressed correctly in the literature. Our theoretical results are confirmed by simulation and thus represent a significant step towards the quantitative analysis of complex scenarios, such as cooperative communications, in multi hop ad-hoc networks.

    AB - In this paper, we propose a new model to determine subgraph probabilities in a Random Geometric Graph(RGG). A subgraph in a RGG can be used to model various scenarios involving a given number of nodes in a multihop ad hoc network. We determine the probabilities for the two essential cases of complete subgraphs with three and four vertices, respectively, which have not yet been addressed correctly in the literature. Our theoretical results are confirmed by simulation and thus represent a significant step towards the quantitative analysis of complex scenarios, such as cooperative communications, in multi hop ad-hoc networks.

    UR - http://www.scopus.com/inward/record.url?scp=84877661586&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84877661586&partnerID=8YFLogxK

    U2 - 10.1109/GLOCOM.2012.6503163

    DO - 10.1109/GLOCOM.2012.6503163

    M3 - Conference contribution

    SN - 9781467309219

    SP - 506

    EP - 511

    BT - GLOBECOM - IEEE Global Telecommunications Conference

    ER -