BLE Mesh： A Practical Mesh Networking Development Framework for Public Safety Communications

Owing to advanced storage and communication capabilities today, smart devices have become the basic interface between individuals and their surrounding environment. In particular, massive devices connect to one other directly in a proximity area, thereby enabling abundant Proximity Services（Pro Se）, which can be classified into two categories： public safety communication and social discovery. However, two challenges impede the quick development and deployment of Pro Se applications. From the viewpoint of networking, no multi-hop connectivity functionality component can be directly operated on commercially off-the-shelf devices, and from the programming viewpoint, an easily reusable development framework is lacking for developers with minimal knowledge of the underlying communication technologies and connectivity. Considering these two issues, this paper makes a twofold contribution. First, a multi-hop mesh networking based on Bluetooth Low Energy（BLE） is implemented,in which a proactive routing mechanism with link-quality（i.e., received signal strength indication） assistance is designed. Second, a Pro Se development framework called BLE Mesh is designed and implemented, which can provide significant benefits for application developers, framework maintenance professionals, and end users. Rich application programming interfaces can help developers to build Pro Se apps easily and quickly. Dependency inversion principle and template method pattern allow modules in BLE Mesh to be loosely coupled and easy to maintain and update. Callback mechanism enables modules to work smoothly together and automation processes such as registration, node discovery, and messaging are employed to offer nearly zero-configuration for end users.Finally, based on the designed Pro Se development kit, a public safety communications app called Quote Send App is built to distribute emergency information in close area without Internet access. The process illustrates the easy usability of BLE Mesh to develop Pro Se apps.

Modelling a Learning-Based Dynamic Tree Routing Model for Wireless Mesh Access Networks

Link asymmetry in wireless mesh access networks(WMAN)of Mobile ad-hoc Networks(MANETs)is due mesh routers’transmission range.It is depicted as significant research challenges that pose during the design of network protocol in wireless networks.Based on the extensive review,it is noted that the substantial link percentage is symmetric,i.e.,many links are unidirectional.It is identified that the synchronous acknowledgement reliability is higher than the asynchronous message.Therefore,the process of establishing bidirectional link quality through asynchronous beacons underrates the link reliability of asym-metric links.It paves the way to exploit an investigation on asymmetric links to enhance network functions through link estimation.Here,a novel Learning-based Dynamic Tree routing(LDTR)model is proposed to improve network performance and delay.For the evaluation of delay measures,asymmetric link,interference,probability of transmission failure is evaluated.The proportion of energy consumed is used for monitoring energy conditions based on the total energy capacity.This learning model is a productive way for resolving the routing issues over the network model during uncertainty.The asymmetric path is chosen to achieve exploitation and exploration iteratively.The learning-based Dynamic Tree routing model is utilized to resolve the multi-objective routing problem.Here,the simulation is done with MATLAB 2020a simulation environment and path with energy-efficiency and lesser E2E delay is evaluated and compared with existing approaches like the Dyna-Q-network model(DQN),asymmetric MAC model(AMAC),and cooperative asymmetric MAC model(CAMAC)model.The simulation outcomes demonstrate that the anticipated LDTR model attains superior network performance compared to others.The average energy consump-tion is 250 J,packet energy consumption is 6.5 J,PRR is 50 bits/sec,95%PDR,average delay percentage is 20%.

In-Depth Study of Potential-Based Routing and New Exploration of Its Scheduling Integration

Industrial wireless mesh networks(WMNs)have been widely deployed in various industrial sectors,providing services such as manufacturing process monitoring,equipment control,and sensor data collection.A notable characteristic of industrial WMNs is their distinct traffic pattern,where the majority of traffic flows originate from mesh nodes and are directed towards mesh gateways.In this context,this paper adopts and revisits a routing algorithm known as ALFA(autonomous load-balancing field-based anycast routing),tailored specifically for anycast(one-to-one-of-many)networking in WMNs,where traffic flows can be served through any one of multiple gateways.In essence,the scheme is a hybrid-type routing strategy that leverages the advantages of both back-pressure routing and geographic routing.Notably,its novelty lies in being developed by drawing inspiration from another field,specifically from the movement of charges in an electrostatic potential field.Expanding on the previous work,this paper explores further in-depth discussions that were not previously described,including a detailed description of the analogy between an electrostatic system and a WMN system based on precise mapping perspectives derived from intensive analysis,as well as discussions on anycast,numerical methods employed in devising the ALFA scheme,its characteristics,and complexity.It is worth noting that this paper addresses these previously unexplored aspects,representing significant contributions compared to previous works.As a completely new exploration,a new scheduling strategy is proposed that is compatible with the routing approach by utilizing the potential-based metric not only in routing but also in scheduling.This assigns higher medium access priority to links with a larger potential difference.Extensive simulation results demonstrate the superior performance of the proposed potential-based joint routing and scheduling scheme across various aspects within industrial WMN scenarios.

Traffic-aware static channel assignment algorithm in wireless mesh networks

A channel assignment algorithm with awareness of link traffic is proposed in multi-radio multi-channel wireless mesh networks. First, the physical interference model based on the signal-to-interference-plus-noise ratio and successful transmission condition is described. The model is more suitable for a wireless communication environment than other existing models. Secondly, a pure integer quadratic programming （PIQP） model is used to solve the channel assignment problem and improve the capacity of wireless mesh networks. Consequently, a traffic- aware static channel assignment algorithm（TASC） is designed. The algorithm adopts some network parameters, including the network connectivity, the limitation of the number of radios and the successful transmission conditions in wireless communications. The TASC algorithm can diminish network interference and increase the efficiency of channel assignment while keeping the connectivity of the network. Finally, the feasibility and effectivity of the channel assignment solution are illustrated by the simulation results. Compared witb similar algorithms, the proposed algorithm can increase the capacity of WMNs.

Distribution algorithm of entangled particles for wireless quantum communication mesh networks

With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes selection in order to save cost and reduce complexity. A minimum spanning tree（ MST）-based quantum distribution algorithm（ QDMST） is presented to construct the mesh backbone network. First, the articulation points are found,and for each connected block uncovered by the articulation points, the general centers are solved. Then, both articulation points and general centers are classified as backbone nodes and an M ST is formed. The quantum path between every two neighbor nodes on the MST is calculated. The nodes on these paths are also classified as backbone nodes. Simulation results validate the advantages of QDMST in the average backbone nodes number and average quantum channel distance compared to the existing random selection algorithm under multiple network scenarios.

SLCRM： Subjective Logic-Based Cross-Layer Reputation Mechanism for Wireless Mesh Networks

Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this problem and protect innocent users from malicious attacks, it is important to encourage cooperation and deter malicious behaviors. Reputation systems constitute a major category of techniques used for managing trust in distributed networks, and they are effective in characterizing and quantifying a node＇s behavior for WMNs. However, conventional layered reputation mechanisms ignore several key factors of reputation in other layers; therefore, they cannot provide optimal performance and accurate malicious node identification and isolation for WMNs. In this paper, we propose a novel dynamic reputation mechanism, SLCRM, which couples reputation systems with a cross-layer design and node-security-rating classification techniques to dynamically detect and restrict insider attacks. Simulation results show that in terms of network throughput, packet delivery ratio, malicious nodes＇ identification, and success rates, SI_CRM imple- ments security protection against insider attacks in a more dynamic, effective, and efficient manner than the subjective logic and uncertainty-based reputation model and the familiarity-based reputation model.

Intrusion Detection for Wireless Mesh Networks using Finite State Machine

Wireless Mesh Networks is vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, Lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer suffi- cient and effective for those features. In this paper, we propose a distributed intrusion detection ap- proach based on timed automata. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then we con- struct the Finite State Machine （FSM） by the way of manually abstracting the correct behaviors of the node according to the routing protocol of Dynamic Source Routing （DSR）. The monitor nodes can verify every node＇s behavior by the Finite State Ma- chine （FSM）, and validly detect real-time attacks without signatures of intrusion or trained data.Compared with the architecture where each node is its own IDS agent, our approach is much more efficient while maintaining the same level of effectiveness. Finally, we evaluate the intrusion detection method through simulation experiments.

Towards an Artificial Immune System for Detecting Anomalies in Wireless Mesh Networks

This paper focuses on investigating immunological principles in designing a multi-agent security architecture for intrusion detection and response in wireless mesh networks.In this approach,the immunity-based agents monitor the situation in the network.These agents can take appropriate actions according to the underlying security policies.Specifically,their activities are coordinated in a hierarchical fashion while sensing,communicating,determining and generating responses.Such an agent can learn about and adapt to its environment dynamically and can detect both known and unknown intrusions.The proposed intrusion detection architecture is designed to be flexible,extendible,and adaptable so that it can perform real-time monitoring.This paper provides the conceptual view and a general framework of the proposed system.In the end,the architecture is illustrated by an example and by simulation to show it can prevent attacks efficiently.

Security in Wireless Mesh Neworks: Challenges and Solutions

Wireless mesh network is a new emerging field with its potential applications in extremely unpredictable and dynamic environments.However,it is particularly vulnerable due to its features of open medium,dynamic changing topology, cooperative routing algorithms.The article surveys the state of the art in security for wireless mesh networks.Firstly,we analyze various possible threats to security in wireless mesh networks.Secondly,we introduce some representative solutions to these threats,including solutions to the problems of key management,secure network routing,and intrusion detection.We also provide a comparison and discussion of their respective merits and drawbacks,and propose some improvements for these drawbacks.Finally,we also discuss the remaining challenges in the area.

Tree-Based Proactive Routing Protocol for Wireless Mesh Network

Wireless Mesh Network （WMN） is seen as an effective Intemet access solution for dynamic wireless applications. For the low mobility of mesh routers in WMN, the backbone topography can be effectively maintained by proactive routing protocol. Pre-proposals like Tree Based Routing （TBR） protocol and Root Driven Routing （RDR） protocol are so centralized that they make the gateway becorre a bottleneck which severely restricts the network performance. We proposed an Optimized Tree-based Routing （OTR） protocol that logically separated the proactive tree into pieces. Route is partly computed by the branches instead of root. We also discussed the operation of multipie Intemet gateways which is a main issue in WMN. The new proposal lightens the load in root, reduces the overhead and improves the throughput. Numerical analysis and simulation results confirm that the perforrmnce of WMN is improved and OTR is more suitable for large scale WMN.

A Novel Optical Burst Mesh Network with Optical Time Slot Interchange at Source Nodes

In this paper, we propose an optical burst network architecture supporting the ge- netic mesh topology. The intermediate node architecture of the mesh network can be the same with current wavelength switching Wave- length Division Multiplexing （WDM） net- works, and thus can reuse existing deployed infrastructure. We employ a novel Optical Time Slot Interchange （OTSI） at the source nodes for the first time to mitigate the burst conten- tion and to increase the bandwidth utilization. Time- and wavelength-domain reuse in the OTSI significantly saves optical components and red- uces blocking probability.

Survivable Routing Protocol for Green Wireless Mesh Networks Based on Energy Efficiency

This paper proposes a new Energyefficient Survivable Routing Protocol(ESRP)based on solar energy and wind mixed for power supply in green wireless mesh networks(WMNs).The ESRP combines hop penalty strategy and flooding delaying strategy to improve the performances of traditional routing protocol.This paper uses QualNet to simulate and verify the performances of proposed ESRP.Compared with the traditional routing protocol,the simulation results show that the energy utilization of ESRP is more efficient by 13%.At the same time,ESRP is more load-balanced to postpone the appearance of the first energy depletion node and reduce the number of energy depletion nodes,and thus it effectively improves network survivability.

Design and analysis of intrusion detection systems for wireless mesh networks

Intrusion is any unwanted activity that can disrupt the normal functions of wired or wireless networks. Wireless mesh networking technology has been pivotal in providing an affordable means to deploy a network and allow omnipresent access to users on the Internet. A multitude of emerging public services rely on the widespread, high-speed, and inexpensive connectivity provided by such networks. The absence of a centralized network infrastructure and open shared medium makes WMNs particularly susceptible to malevolent attacks, especially in multihop networks. Hence, it is becoming increasingly important to ensure privacy, security, and resilience when designing such networks. An effective method to detect possible internal and external attack vectors is to use an intrusion detection system. Although many Intrusion Detection Systems (IDSs) were proposed for Wireless Mesh Networks (WMNs), they can only detect intrusions in a particular layer. Because WMNs are vulnerable to multilayer security attacks, a cross-layer IDS are required to detect and respond to such attacks. In this study, we analyzed cross-layer IDS options in WMN environments. The main objective was to understand how such schemes detect security attacks at several OSI layers. The suggested IDS is verified in many scenarios, and the experimental results show its efficiency.

Multi-path based secure communication in wireless mesh networks

Communication security is a critical aspect of QoS provisioning in wireless mesh network （WMN）. Because of the inherent characteristics of WMN, conventional security mechanisms cannot be applied. In order to guarantee the communication security, a novel communication security mechanism is proposed. The mechanism uses a communication encryption scheme to encrypt data packets and employs a risk avoidance scheme to avoid the malicious nodes during communications. Simulation results indicate that the mechanism is able to provide secure communication effectively and reduce the damage of attacks through multiple paths.

Incorporating Network Coding into TCP Grounded on Network Utility Maximization in Multi-Radio Multi-Channel Wireless Mesh Networks

A new approach, named TCP-I2NC, is proposed to improve the interaction between network coding and TCP and to maximize the network utility in interference-free multi-radio multi-channel wireless mesh networks. It is grounded on a Network Utility Maxmization (NUM) formulation which can be decomposed into a rate control problem and a packet scheduling problem. The solutions to these two problems perform resource allocation among different flows. Simulations demonstrate that TCP-I2NC results in a significant throughput gain and a small delay jitter. Network resource is fairly allocated via the solution to the NUM problem and the whole system also runs stably. Moreover, TCP-I2NC is compatible with traditional TCP variants.

Polynomials of Degree-Based Indices for Three-Dimensional Mesh Network

In order to study the behavior and interconnection of network devices,graphs structures are used to formulate the properties in terms of mathematical models.Mesh network(meshnet)is a LAN topology in which devices are connected either directly or through some intermediate devices.These terminating and intermediate devices are considered as vertices of graph whereas wired or wireless connections among these devices are shown as edges of graph.Topological indices are used to reflect structural property of graphs in form of one real number.This structural invariant has revolutionized the field of chemistry to identify molecular descriptors of chemical compounds.These indices are extensively used for establishing relationships between the structure of nanotubes and their physico-chemical properties.In this paper a representation of sodium chloride(NaCl)is studied,because structure of NaCl is same as the Cartesian product of three paths of length exactly like a mesh network.In this way the general formula obtained in this paper can be used in chemistry as well as for any degree-based topological polynomials of three-dimensional mesh networks.

Wireless Mesh Networks and Cooperative Relaying Technologies

The Wireless Mesh Network (WMN) has become a focus in research of wireless broadband communications . In a switching technologies - based wireless Mesh network, the entire network is regarded as an IP subnet, so it cannot be applied in situations where large coverage is required . The use of cooperative relaying technologies can improve the transmission rate and reliability of wireless link; while the wireless Mesh network, once integrated with cooperative relaying technologies and routing technologies , can improve its spectrum efficiency and cover a wide area . However, there are many problems to be solved with respect to standardization, key technologies research and industrialization. Therefore , the application of cooperative relaying technologies in wireless Mesh networks is still a great challenge .

A TRUST MECHANISM-BASED CHANNEL ASSIGNMENT AND ROUTING SCHEME IN COGNITIVE WIRELESS MESH NETWORKS WITH INTRUSION DETECTION

Cognitive Wireless Mesh Networks(CWMN) is a novel wireless network which combines the advantage of Cognitive Radio(CR) and wireless mesh networks.CWMN can realize seamless in-tegration of heterogeneous wireless networks and achieve better radio resource utilization.However,it is particularly vulnerable due to its features of open medium,dynamic spectrum,dynamic topology,and multi-top routing,etc..Being a dynamic positive security strategy,intrusion detection can provide powerful safeguard to CWMN.In this paper,we introduce trust mechanism into CWMN with intrusion detection and present a trust establishment model based on intrusion detection.Node trust degree and the trust degree of data transmission channels between nodes are defined and an algorithm of calcu-lating trust degree is given based on distributed detection of attack to networks.A channel assignment and routing scheme is proposed,in which selects the trusted nodes and allocates data channel with high trust degree for the transmission between neighbor nodes to establish a trusted route.Simulation re-sults indicate that the scheme can vary channel allocation and routing dynamically according to network security state so as to avoid suspect nodes and unsafe channels,and improve the packet safe delivery fraction effectively.

Scalability Technologies for Wireless Mesh Networks

The continuous increase of data transmission density in wireless mobile communications has posed a challenge to the system performance of Wireless Mesh Networks (WMNs ). There is a rule for wireless Ad hoc networks that the average node capacity decreases while the number of nodes increases , so it is hard to establish a large - scale wireless Mesh network. Network scalability is very important for enhancing the adaptive networking capability of the wireless Mesh network. This article discusses key scalability technologies for Mesh Base Stations (BSs ) and Mesh Mobile Stations (MSs ), such as channel allocation, intelligent routing , multi- antenna , node classification, Quality of Service (QoS) differentiation and cooperative transmission.

Wireless Mesh Network and IEEE 802 Standards

Although the wireless broadband access system is developing rapidly, its development is limited due to some disadvantages , such as small capacity of bandwidth and small coverage . The Wireless Mesh Network (WMN) is one of the important technologies for 'last mile 'broadband wireless access . The WMN can integrate with multiple wireless systems , such as Wireless Local Area Network (WLAN), Wireless Personal Area Network (WPAN), and Wireless Metropolitan Area Network (WMAN), to improve the performance of the wireless network and enlarge the coverage range . With the wide applications of the WMN, the IEEE 802 standard group is devoted to promoting the development of the WMN technology and establishing the related technical standards . At present, WMN standards have appeared in IEEE 802.11s , 802.15, 802.16, and 802.20.