Analysis of the Bluetooth device discovery protocol

Goutam Chakraborty, Kshirasagar Naik, Debasish Chakraborty, Norio Shiratori, David Wei

    Research output: Contribution to journalArticle

    17 Citations (Scopus)

    Abstract

    Device discovery and connection establishment are fundamental to communication between two Bluetooth (BT) devices. In this paper, we give an analytical model of the time it takes for the master in a piconet to discover one slave. We show that, even in the absence of packet interference, the discovery time can be long in some instances. We have simulated the discovery protocol by actually implementing it to validate the analytical model. By means of simulations, we show how discovery time is affected by (i) the presence of multiple potential slaves, and (ii) changes in the maximum backoff limit. Using simulation studies we observed the effectiveness of two proposed improvements to device discovery, namely, (i) avoiding repetitions of the A and B trains before a train switch, and (ii) eliminating the idea of random backoff, or reducing the backoff limit. We show that discovery time can be reduced by avoiding repetitions of the A and B trains before a train switch. However, complete elimination of the random backoff is not a good idea, as discovery time will be too long when the number of BT devices is large. Instead, choosing a small backoff limit of 250-300 slots is highly effective in reducing discovery time even in the presence of a large number (say, 50) of potential slaves.

    Original languageEnglish
    Pages (from-to)421-436
    Number of pages16
    JournalWireless Networks
    Volume16
    Issue number2
    DOIs
    Publication statusPublished - 2010 Feb

    Fingerprint

    Bluetooth
    Analytical models
    Switches
    Network protocols
    Communication

    Keywords

    • Bluetooth
    • Device discovery
    • Inquiry
    • Inquiry scan

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Networks and Communications
    • Information Systems

    Cite this

    Chakraborty, G., Naik, K., Chakraborty, D., Shiratori, N., & Wei, D. (2010). Analysis of the Bluetooth device discovery protocol. Wireless Networks, 16(2), 421-436. https://doi.org/10.1007/s11276-008-0142-1

    Analysis of the Bluetooth device discovery protocol. / Chakraborty, Goutam; Naik, Kshirasagar; Chakraborty, Debasish; Shiratori, Norio; Wei, David.

    In: Wireless Networks, Vol. 16, No. 2, 02.2010, p. 421-436.

    Research output: Contribution to journalArticle

    Chakraborty, G, Naik, K, Chakraborty, D, Shiratori, N & Wei, D 2010, 'Analysis of the Bluetooth device discovery protocol', Wireless Networks, vol. 16, no. 2, pp. 421-436. https://doi.org/10.1007/s11276-008-0142-1
    Chakraborty G, Naik K, Chakraborty D, Shiratori N, Wei D. Analysis of the Bluetooth device discovery protocol. Wireless Networks. 2010 Feb;16(2):421-436. https://doi.org/10.1007/s11276-008-0142-1
    Chakraborty, Goutam ; Naik, Kshirasagar ; Chakraborty, Debasish ; Shiratori, Norio ; Wei, David. / Analysis of the Bluetooth device discovery protocol. In: Wireless Networks. 2010 ; Vol. 16, No. 2. pp. 421-436.
    @article{841fdab29ef64d4b9cf7ffce11725ba2,
    title = "Analysis of the Bluetooth device discovery protocol",
    abstract = "Device discovery and connection establishment are fundamental to communication between two Bluetooth (BT) devices. In this paper, we give an analytical model of the time it takes for the master in a piconet to discover one slave. We show that, even in the absence of packet interference, the discovery time can be long in some instances. We have simulated the discovery protocol by actually implementing it to validate the analytical model. By means of simulations, we show how discovery time is affected by (i) the presence of multiple potential slaves, and (ii) changes in the maximum backoff limit. Using simulation studies we observed the effectiveness of two proposed improvements to device discovery, namely, (i) avoiding repetitions of the A and B trains before a train switch, and (ii) eliminating the idea of random backoff, or reducing the backoff limit. We show that discovery time can be reduced by avoiding repetitions of the A and B trains before a train switch. However, complete elimination of the random backoff is not a good idea, as discovery time will be too long when the number of BT devices is large. Instead, choosing a small backoff limit of 250-300 slots is highly effective in reducing discovery time even in the presence of a large number (say, 50) of potential slaves.",
    keywords = "Bluetooth, Device discovery, Inquiry, Inquiry scan",
    author = "Goutam Chakraborty and Kshirasagar Naik and Debasish Chakraborty and Norio Shiratori and David Wei",
    year = "2010",
    month = "2",
    doi = "10.1007/s11276-008-0142-1",
    language = "English",
    volume = "16",
    pages = "421--436",
    journal = "Wireless Networks",
    issn = "1022-0038",
    publisher = "Springer Netherlands",
    number = "2",

    }

    TY - JOUR

    T1 - Analysis of the Bluetooth device discovery protocol

    AU - Chakraborty, Goutam

    AU - Naik, Kshirasagar

    AU - Chakraborty, Debasish

    AU - Shiratori, Norio

    AU - Wei, David

    PY - 2010/2

    Y1 - 2010/2

    N2 - Device discovery and connection establishment are fundamental to communication between two Bluetooth (BT) devices. In this paper, we give an analytical model of the time it takes for the master in a piconet to discover one slave. We show that, even in the absence of packet interference, the discovery time can be long in some instances. We have simulated the discovery protocol by actually implementing it to validate the analytical model. By means of simulations, we show how discovery time is affected by (i) the presence of multiple potential slaves, and (ii) changes in the maximum backoff limit. Using simulation studies we observed the effectiveness of two proposed improvements to device discovery, namely, (i) avoiding repetitions of the A and B trains before a train switch, and (ii) eliminating the idea of random backoff, or reducing the backoff limit. We show that discovery time can be reduced by avoiding repetitions of the A and B trains before a train switch. However, complete elimination of the random backoff is not a good idea, as discovery time will be too long when the number of BT devices is large. Instead, choosing a small backoff limit of 250-300 slots is highly effective in reducing discovery time even in the presence of a large number (say, 50) of potential slaves.

    AB - Device discovery and connection establishment are fundamental to communication between two Bluetooth (BT) devices. In this paper, we give an analytical model of the time it takes for the master in a piconet to discover one slave. We show that, even in the absence of packet interference, the discovery time can be long in some instances. We have simulated the discovery protocol by actually implementing it to validate the analytical model. By means of simulations, we show how discovery time is affected by (i) the presence of multiple potential slaves, and (ii) changes in the maximum backoff limit. Using simulation studies we observed the effectiveness of two proposed improvements to device discovery, namely, (i) avoiding repetitions of the A and B trains before a train switch, and (ii) eliminating the idea of random backoff, or reducing the backoff limit. We show that discovery time can be reduced by avoiding repetitions of the A and B trains before a train switch. However, complete elimination of the random backoff is not a good idea, as discovery time will be too long when the number of BT devices is large. Instead, choosing a small backoff limit of 250-300 slots is highly effective in reducing discovery time even in the presence of a large number (say, 50) of potential slaves.

    KW - Bluetooth

    KW - Device discovery

    KW - Inquiry

    KW - Inquiry scan

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

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

    U2 - 10.1007/s11276-008-0142-1

    DO - 10.1007/s11276-008-0142-1

    M3 - Article

    VL - 16

    SP - 421

    EP - 436

    JO - Wireless Networks

    JF - Wireless Networks

    SN - 1022-0038

    IS - 2

    ER -