Research On Topology Configuration And Routing Algorithm In BLE Mesh Network

In recent years,with the iterative update of protocol versions and the reserves of related technologies,Bluetooth Low Energy is now able to support mesh network networking,enabling many-to-many transmission.BLE mesh network is designed for mutual communication between large-scale nodes with low data transmission in a large connection scenario,providing solutions for more IoT scenarios such as building automation,intelligent security,and smart city.In the currently published BLE mesh profile specification,a managed-flooding method is adopted to meet the communication needs.Due to the redundant data transmission in the flooding mode,the network is flooded with a large amount of duplicate data,resulting in network congestion and unnecessary energy consumption,and the application range is greatly limited.Therefore,BLE mesh network need a routing-based solution that can reduce network overhead and improve network performance.In order to solve the problems existing in the current BLE mesh network,the existing flood-based solutions and solutions based on different routing algorithms are compared and analyzed in consideration of network characteristics and protocol versions.In the IoT scenario with large connection and low data transmission,the performance of the opportunity routing algorithm that does not depend on a single next hop node is superior to the traditional routing algorithm.Therefore,an opportunity routing algorithm in BLE mesh network(BMOR)is proposed.In this paper,the transmission problem in opportunistic routing algorithm is firstly modeled,and the path cost is designed as the routing metric.Each node in the network performs the forwarding node selection and coordinated forwarding of the forwarding node set distributed according to the routing metric.Then,considering the broadcast and data channel in BLE mesh network,the network topology is configured based on the two bearers of BLE and the connectivity of the whole network is ensured.The algorithm mechanism implements data transmission between nodes according to the topology.In order to verify the performance of the proposed solution,the solution was compared with existing solutions.By comparing the average path cost and average end-to-end delay for one transmission,the solution can effectively reduce the number of duplicate packets in the network,reduce path overhead,and reduce network overhead.