A random graph-based model to analyze packet interference between frequency hopping systems with an application to Bluetooth

Kshirasagar Naik, David S L Wei, Yu T. Su, N. Shiratori

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    In this paper, we present a graph-based model for analyzing interference between two frequency hopping systems for wireless communication. Informally, frequency hopping means that successive packets are transmitted on different frequencies from a pseudo-random sequence. The frequency band occupied by a packet may be narrow or wide. Our model is based on the concept of probabilistic graphs, where a node represents a "channel" and an edge denotes the probability of interference between two packets belonging to two different channels. Two packets on two channels are said to be mutually interfering if the two packets overlap in time and are transmitted on the same frequency. Thus, from the viewpoint of probabilistic graphs, the expected number of nodes with at least one incident edge is a measure of packet interference in a collection of wireless channels. We apply this model of packet interference to a heterogeneous cluster of Bluetooth piconets, where a piconet could be either of 79-hop type or of 23-hop type. Though the 23-hop type has been phased out, we use it as an example in this paper.

    Original languageEnglish
    Pages (from-to)3286-3291
    Number of pages6
    JournalComputer Communications
    Volume31
    Issue number14
    DOIs
    Publication statusPublished - 2008 Sep 5

    Fingerprint

    Frequency hopping
    Bluetooth
    Frequency bands
    Communication

    Keywords

    • Bluetooth technology
    • Frequency hopping systems
    • Packet interference
    • Probabilistic graphs

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    A random graph-based model to analyze packet interference between frequency hopping systems with an application to Bluetooth. / Naik, Kshirasagar; Wei, David S L; Su, Yu T.; Shiratori, N.

    In: Computer Communications, Vol. 31, No. 14, 05.09.2008, p. 3286-3291.

    Research output: Contribution to journalArticle

    Naik, Kshirasagar ; Wei, David S L ; Su, Yu T. ; Shiratori, N. / A random graph-based model to analyze packet interference between frequency hopping systems with an application to Bluetooth. In: Computer Communications. 2008 ; Vol. 31, No. 14. pp. 3286-3291.
    @article{9be03638eeeb480e82358e0cd451208a,
    title = "A random graph-based model to analyze packet interference between frequency hopping systems with an application to Bluetooth",
    abstract = "In this paper, we present a graph-based model for analyzing interference between two frequency hopping systems for wireless communication. Informally, frequency hopping means that successive packets are transmitted on different frequencies from a pseudo-random sequence. The frequency band occupied by a packet may be narrow or wide. Our model is based on the concept of probabilistic graphs, where a node represents a {"}channel{"} and an edge denotes the probability of interference between two packets belonging to two different channels. Two packets on two channels are said to be mutually interfering if the two packets overlap in time and are transmitted on the same frequency. Thus, from the viewpoint of probabilistic graphs, the expected number of nodes with at least one incident edge is a measure of packet interference in a collection of wireless channels. We apply this model of packet interference to a heterogeneous cluster of Bluetooth piconets, where a piconet could be either of 79-hop type or of 23-hop type. Though the 23-hop type has been phased out, we use it as an example in this paper.",
    keywords = "Bluetooth technology, Frequency hopping systems, Packet interference, Probabilistic graphs",
    author = "Kshirasagar Naik and Wei, {David S L} and Su, {Yu T.} and N. Shiratori",
    year = "2008",
    month = "9",
    day = "5",
    doi = "10.1016/j.comcom.2008.05.013",
    language = "English",
    volume = "31",
    pages = "3286--3291",
    journal = "Computer Communications",
    issn = "0140-3664",
    publisher = "Elsevier",
    number = "14",

    }

    TY - JOUR

    T1 - A random graph-based model to analyze packet interference between frequency hopping systems with an application to Bluetooth

    AU - Naik, Kshirasagar

    AU - Wei, David S L

    AU - Su, Yu T.

    AU - Shiratori, N.

    PY - 2008/9/5

    Y1 - 2008/9/5

    N2 - In this paper, we present a graph-based model for analyzing interference between two frequency hopping systems for wireless communication. Informally, frequency hopping means that successive packets are transmitted on different frequencies from a pseudo-random sequence. The frequency band occupied by a packet may be narrow or wide. Our model is based on the concept of probabilistic graphs, where a node represents a "channel" and an edge denotes the probability of interference between two packets belonging to two different channels. Two packets on two channels are said to be mutually interfering if the two packets overlap in time and are transmitted on the same frequency. Thus, from the viewpoint of probabilistic graphs, the expected number of nodes with at least one incident edge is a measure of packet interference in a collection of wireless channels. We apply this model of packet interference to a heterogeneous cluster of Bluetooth piconets, where a piconet could be either of 79-hop type or of 23-hop type. Though the 23-hop type has been phased out, we use it as an example in this paper.

    AB - In this paper, we present a graph-based model for analyzing interference between two frequency hopping systems for wireless communication. Informally, frequency hopping means that successive packets are transmitted on different frequencies from a pseudo-random sequence. The frequency band occupied by a packet may be narrow or wide. Our model is based on the concept of probabilistic graphs, where a node represents a "channel" and an edge denotes the probability of interference between two packets belonging to two different channels. Two packets on two channels are said to be mutually interfering if the two packets overlap in time and are transmitted on the same frequency. Thus, from the viewpoint of probabilistic graphs, the expected number of nodes with at least one incident edge is a measure of packet interference in a collection of wireless channels. We apply this model of packet interference to a heterogeneous cluster of Bluetooth piconets, where a piconet could be either of 79-hop type or of 23-hop type. Though the 23-hop type has been phased out, we use it as an example in this paper.

    KW - Bluetooth technology

    KW - Frequency hopping systems

    KW - Packet interference

    KW - Probabilistic graphs

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

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

    U2 - 10.1016/j.comcom.2008.05.013

    DO - 10.1016/j.comcom.2008.05.013

    M3 - Article

    AN - SCOPUS:49649123018

    VL - 31

    SP - 3286

    EP - 3291

    JO - Computer Communications

    JF - Computer Communications

    SN - 0140-3664

    IS - 14

    ER -