Related Experiment Video
Updated: Nov 3, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Optimizing the Bluetooth Low-Energy Service Discovery Process
Kristof T'Jonck1, Bozheng Pang1, Hans Hallez1
1M-Group, imec-DistriNet, Department of Computer Science, KU Leuven Bruges Campus, 8200 Bruges, Belgium.
Abstract:
Bluetooth Low Energy (BLE), a short-range and low-power communication protocol, has gained a lot of popularity in recent years. A part of BLE is the Generic Attribute Profile (GATT) which defines the data communication between two devices. During the initial connection between two BLE devices a discovery of services, characteristics and descriptors is required for the GATT to operate. During this discovery phase, the device is unusable as it builds the foundation for further data transactions. When unoptimized, this discovery step can take up to a few seconds, leading to frustrations for the end user or delays in some applications. In this paper, we aim to find guidelines on how to optimize this discovery process. A simulation framework was developed, able to simulate and analyze the packet exchange of the service discovery, while taking link layer parameters into account. The results show that minimizing the connection interval and maximizing the data length leads to the lowest discovery times. Practical experiments in real environment, however, show that the theoretically calculated times are not reachable due to processing overhead and retransmissions. Theoretical results also show that the current BLE discovery process, even after optimizations, has a lot of overhead. To fix the problems with the current protocol, this paper proposes a new Rapid Service Discovery Protocol, which enables a fast and efficient service discovery.
Related Concept Videos
Maximum Power Transfer
By substituting the entire circuit with...
Drug Discovery: Overview
Optimal Foraging
Contact-dependent Signaling
Gap Junctions
In animal cells, gap junctions are formed...

