Bluetooth Low Energy (BLE) Mesh Networks enable flexible and reliable communications for low-power Internet of Things (IoT) devices. Most BLE-based mesh protocols are implemented as overlays on top of the standard Bluetooth star topologies while using piconets and scatternets. Nonetheless, mesh topology support has increased the vulnerability of BLE to security threats, since a larger number of devices can participate in a BLE Mesh network. To address these concerns, BLE version 5 enhanced existing BLE security features to deal with various authenticity, integrity, and confidentiality issues. However, there is still a lack of detailed studies related to these new security features. This survey examines the most recent BLE-based mesh network protocols and related security issues. In the first part, the latest BLE-based mesh communication protocols are discussed. The analysis shows that the implementation of BLE pure mesh protocols remains an open research issue. Moreover, there is a lack of auto-configuration mechanisms in order to support bootstrapping of BLE pure mesh networks. In the second part, recent BLE-related security issues and vulnerabilities are highlighted. Strong Intrusion Detection Systems (IDS) are essential for detecting security breaches in order to protect against zero-day exploits. Nonetheless, viable IDS solutions for BLE Mesh networks remain a nascent research area. Consequently, 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.
The standard Bluetooth Low-Energy mesh networks assume the use of flooding for multihop communications. The flooding approach causes network overheads and delays due to continuous message broadcasting in the absence of a routing mechanism. Among the routing protocols, AODV is one of the most popular and robust routing protocol for wireless ad hoc networks. In this paper, we optimized the AODV protocol for Bluetooth Low-Energy communication to make it more efficient in comparison to the mesh protocol. With the proposed protocol (Optimized AODV (O-AODV)), we were able to achieve lower overheads, end-to-end delay, and average per-hop one-way delay in comparison to the BLE mesh (flooding) protocol and AODV protocol for all three scenarios (linear topology with ten nodes, multipath topology with six and ten nodes). In addition, the proposed protocol exhibited practically constant route requests and route reply setup times. Furthermore, the proposed protocol demonstrated a better Packet Delivery Ratio (PDR) for O-AODV (84%) in comparison to AODV (71%), but lower than the PDR of the mesh (flooding) protocol with 93%.
Bluetooth Low Energy (BLE) mesh networks provide flexible and reliable communication among low-power sensor-enabled Internet of Things (IoT) devices, enabling them to communicate in a flexible and robust manner. Nonetheless, the majority of existing BLE-based mesh protocols operate as flooding-based piconet or scatternet overlays on top of existing Bluetooth star topologies. In contrast, the Ad hoc On-Demand Distance Vector (AODV) protocol used primarily in wireless ad hoc networks (WAHNs) is forwarding-based and therefore more efficient, with lower overheads. However, the packet delivery ratio (PDR) and link recovery time for AODV performs worse compared to flooding-based BLE protocols when encountering link disruptions. We propose the Multipath Optimized AODV (M-O-AODV) protocol to address these issues, with improved PDR and link robustness compared with other forwarding-based protocols. In addition, M-O-AODV achieved a PDR of 88%, comparable to the PDR of 92% for flooding-based BLE, unlike protocols such as Reverse-AODV (R-AODV). Also, M-O-AODV was able to perform link recovery within 3700 ms in the case of node failures, compared with other forwarding-based protocols that require 4800 ms to 6000 ms. Consequently, M-O-AODV-based BLE mesh networks are more efficient for wireless sensor-enabled IoT environments.
1 January 2004 in Lecture Notes in Computer Science
On the web, most structured document collections consist of documents from different sources and marked up with different types of structures. The diversity of structures has led to the emergence of heterogeneous structured documents. The heterogeneity of structured documents is one of the reason for query-document mismatch in structured document retrieval. In structured document retrieval, a user is assumed to have intimate knowledge of the document structures and is able to specify contextual constraints in their queries. However, it is impossible for the user to know all structures in heterogeneous structured document collections. In this paper, we propose to include similar correspondence relations in the representation model for structured document retrieval. The similar correspondences make the relations between similar contents explicit in order to improve structured document retrieval effectiveness. We introduce a generic and flexible structured document model to represent heterogeneous structured documents as well as the similar correspondences in the document collections. We also illustrate how the proposed model can be utilized in structured document retrieval.