scispace - formally typeset
Proceedings ArticleDOI

On Relay Selection Approaches in Bluetooth Mesh Networks

TLDR
To improve packet delivery ratio, this work considers three different relay selection mechanisms and develops their extensions that are capable to operate in a distributed fashion and is evaluated via extensive simulations.
Abstract
Bluetooth Mesh (BM) is a new communication standard, which is designed for the upcoming Internet of Things. It builds on the Bluetooth Low Energy (BLE) protocol and allows devices to extend the range and create a mesh network. BM introduces a publisher/ observer structure where a publisher node can broadcast a packet, known also as an advertisement, and all observers can receive the packet. Typically, in BM networks flooding is used to propagate the advertisements. Flooding is known to suffer from broadcast storm problem and be nonreli-able. To improve packet delivery ratio we propose an approach where only a few nodes, relays, are involved in packet forwarding. Selection of the relay nodes, which is a focus of the paper, is a nontrivial task: on the one hand, a minimization of number of relays is desired, on the other hand, using a minimum dominated set would not provide redundancy. We consider three different relay selection mechanisms and develop their extensions that are capable to operate in a distributed fashion. Their performance is evaluated via extensive simulations.

read more

Citations
More filters
Journal ArticleDOI

Understanding the Performance of Bluetooth Mesh: Reliability, Delay, and Scalability Analysis

TL;DR: Results prove that scalability is especially challenging for Bluetooth mesh since it is prone to broadcast storm, hindering the communication reliability for denser deployments, and introduce randomization in these timing parameters, as well as varying the duration of the Advertising Events.
Journal ArticleDOI

Bluetooth Low Energy Mesh Networks: Survey of Communication and Security Protocols

TL;DR: A comparative survey of IDS approaches for related low-power wireless protocols was used to map out potential approaches for enhancing IDS solutions for BLE Mesh networks, showing that the implementation of BLE pure mesh protocols remains an open research issue.
Proceedings ArticleDOI

Relay Node Selection in Bluetooth Mesh Networks

TL;DR: This paper focuses on the choice of relay selection algorithms suitable for BM networks, and different centralized, decentralized, and localized algorithms based on Connected Dominating Set are evaluated and compared.
Journal ArticleDOI

QoS enabled heterogeneous BLE mesh networks

TL;DR: A novel set of standard compliant Quality of Service (QoS) extensions for BLE mesh networks enable better traffic management in the mesh network, providing sufficient redundancy to achieve reliability whilst avoiding unnecessary packet flooding to reduce collisions.
Journal ArticleDOI

Exploring data collection on Bluetooth Mesh networks

TL;DR: In this article , the authors evaluate sporadic data collection on a Bluetooth Mesh network, using the OMNET++ INET simulator, and propose and evaluate algorithms for mobility-aware, adaptive, routing of sensor data towards the sink node.
References
More filters
Proceedings ArticleDOI

The broadcast storm problem in a mobile ad hoc network

TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Journal ArticleDOI

The broadcast storm problem in a mobile ad hoc network

TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Proceedings ArticleDOI

On calculating connected dominating set for efficient routing in ad hoc wireless networks

TL;DR: In this paper, the authors proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances.
Journal ArticleDOI

Approximation Algorithms for Connected Dominating Sets

GuhaS., +1 more
- 01 Apr 1998 - 
TL;DR: The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex.
Proceedings ArticleDOI

Geometric ad-hoc routing: of theory and practice

TL;DR: A new geometric routing algorithm is proposed which is outstandingly efficient on practical average-case networks, however is also in theory asymptotically worst-case optimal and the formerly necessary assumption that the distance between network nodes may not fall below a constant value is dropped.
Related Papers (5)