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.

一种无线Mesh网双收发器多信道MAC协议的功率控制方案

提出一种基于双收发器的多信道媒介访问控制(Media access control,MAC)协议的功率控制机制,节点通过握手信号计算出数据发送所需要的最小发送功率,数据收发器以最小的功率发送数据。网络仿真结果表明,该机制可提高网络的吞吐率,减小平均端到端时延。

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.

On Channel Assignment for Multicast in Multi-Radio Multi-Channel Wireless Mesh Networks:A Survey

The major challenge faced by wireless mesh networks is the capacity reduction caused by interference,and interference can be reduced or even eliminated through appropriate channel assignment.This article presents a comprehensive survey of channel assignment schemes for multicast in multi-radio multi-channel wireless mesh networks.We analyze the state-of-the-art channel assignment schemes for multicast and provide comprehensive taxonomy of the latest work.In general,we classify the channel assignment schemes for multicast into two types,that is,sequential multicast routing and channel assignment(SMRCA)and joint multicast routing and channel assignment(JMRCA).Detailed review of channel assignment schemes in each category is provided.Possible future research directions and corresponding solutions are also explored to motivate research interests in the field of channel assignment for multicast in wireless mesh networks.

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.

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.

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.

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 Survivability Routing Mechanism in SDN Enabled Wireless Mesh Networks:Design and Evaluation

In software-defined networking,the separation of control plane from forwarding plane introduces new challenges to network reliability.This paper proposes a fault-tolerant routing mechanism to improve survivability by converting the survivability problem into two sub-problems:constructing an elastic-aware routing tree and controller selection.Based on the shortest path tree,this scheme continuously attempts to prune the routing tree to enhance network survivability.After a certain number of iterations,elastic-aware routing continues to improve network resiliency by increasing the number of edges in this tree.Simulation results demonstrate this fault-tolerant mechanism performs better than the traditional method in terms of the number of protected nodes and network fragility indicator.

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.

Intrusion Detection Model Based on Incomplete Information Ga me in Wireless Mesh Networks

Wireless Mesh Networks （WMNs） have many applications in homes, schools, enterprises, and public places because of their useful characteristics, such as high bandwidth, high speed, and wide coverage. However, the security of wireless mesh networks is a precondition for practical use. Intrusion detection is pivotal for increasing network security. Considering the energy limitations in wireless mesh networks, we adopt two types of nodes： Heavy Intrusion Detection Node （HIDN） and Light Intrusion Detection Node （LIDN）. To conserve energy, the LIDN detects abnorrml behavior according to probability, while the HIDN, which has sufficient energy, is always operational. In practice, it is very difficult to acquire accurate information regarding attackers. We propose an intrusion detection model based on the incomplete inforrmtion game （ID-IIG）. The ID-IIG utilizes the Harsanyi transformation and Bayesian Nash equilibrium to select the best strategies of defenders, although the exact attack probability is unknown. Thus, it can effectively direct the deployment of defenders. Through experiments, we analyze the perforrmnce of ID-IIG and verify the existence and attainability of the Bayesian Nash equilibrium.

Multicast Scheduling Algorithm Supporting Spatial Mini-slot Reuse for IEEE 802.16 Mesh Networks

Abstract： In this paper, we propose a mecha- nism for multicast data transmission in IEEE 802.16 mesh networks aimed at increasing the throughput by incorporating mini-slot spatial reuse. The proposed mechanism includes two novel algorithms： a source-based multicast tree topology construction algorithm followed by an interference-aware multieast scheduling algorithm. The proposed multicast interfer- ence-aware scheduling algorithm can be ap- plied to both source-based and rendez- vous-based multicast tree topologies. Results of our simulation study show that in compari- son to the mechanism used for the IEEE 802.16＇s standard, the proposed multicast tree generation algorithm reduces the number of consumed mini-slots by 64% on average. Moreover, using the proposed interfer- ence-aware scheduling algorithm decreases the number of required mini-slots by a further 22% on average. Therefore, the proposed mul- ticast scheduling mechanism shows a higher throughput than the previous approaches and it is more scalable with respect to increasing the number of multicast groups as well as in- creasing the number of members inside each multicast group.

LOAD AWARE ADAPTIVE BACKBONE SYNTHESIS IN WIRELESS MESH NETWORKS

Wireless Mesh Networks(WMNs) are envisioned to support the wired backbone with a wireless Backbone Networks(BNet) for providing internet connectivity to large-scale areas.With a wide range of internet-oriented applications with different Quality of Service(QoS) requirement, the large-scale WMNs should have good scalability and large bandwidth.In this paper, a Load Aware Adaptive Backbone Synthesis(LAABS) algorithm is proposed to automatically balance the traffic flow in the WMNs.The BNet will dynamically split into smaller size or merge into bigger one according to statistic load information of Backbone Nodes(BNs).Simulation results show LAABS generates moderate BNet size and converges quickly, thus providing scalable and stable BNet to facilitate traffic flow.

Available capacity and robust wireless mesh connectivity of TDD-based networks

This paper addresses the available capacity and robust connectivity of time division duplex based wireless mesh networks （TDD-based WMNs）. A stochastic model is presented for TDD-based WMNs. Considering the parameters that affect the network performance like ratio of control slots number to data slots number, collision probability, node density and average hopcounts, the availa- ble capacity for each node is inferred. Meanwhile, the order of transmission range for robust connec- tivity of large scale WMNs is derived. With the stochastic model and inferred available capacity per node, the performance of TDD-based WMNs using IEEE 802.16 standard is analyzed under various conditions. Simulation results indicate that the available capacity of IEEE 802.16-based TDD-based WMNs and the theoretical result have the same increasing and decreasing trend as the node density increases. Simulation results also illustrate the optimal value of the ratio of control slots number to data slots number that maximizes the available capacity.

A Combined Admission and Priority Control Mechanism for Assuring Communication Quality in VANETs integrated with Wireless Mesh Networks

In this paper, we introduce a new combined priority and admission control mechanism applying in the VCN （Vehicular Communication Network） which is designed with an integration of the Vehicular Ad-hoc Networks （VANETs） based on standard IEEE 802.11 p and IEEE 802.11 s WMNs （Wireless Mesh Networks）. Simulation experiments are intensively investigated to evaluate the novel combined priority and admission control mechanism to assure quality of the I2V （Infrastructure to Vehicle） emergency services occurred during the time video flows are being delivered between content servers and cars. The simulation results show effectiveness of proposed priority and admission control schemes in term of the minimized end-to-end delay as well as the increase of throughput and PDR （Packet Delivery Ratio） of the emergency data flow.

Performance Enhancement and Utility Maximization for TCP in Wireless Mesh Networks

In Wireless Mesh Networks (WMNs),the performance of conventional TCP significantly deteriorates due to the unreliable wireless channel.To enhance TCP performance in WMNs,TCP/LT is proposed in this paper.It introduces fountain codes into packet reorganization in the protocol stack of mesh gateways and mesh clients.Furthermore,it is compatible with conventional TCP.Regarded as a Performance Enhancement Proxies (PEP),a mesh gateway buffers TCP packets into several blocks.It simultaneously processes them by using fountain encoders and then sends them to mesh clients.Apart from the improvement of the throughput of a unitary TCP flow,the entire network utility maximization can also be ensured by adjusting the scale of coding blocks for each TCP flow adaptively.Simulations show that TCP/LT presents high throughput gains over single TCP in lossy links of WMNs while preserving the fairness for multiple TCPs.As losses increase,the transmission delay of TCP/LT experiences a slow linear growth in contrast to the exponential growth of TCP.

A Routing Metric Based on Available Bandwidth Routing in Wireless Mesh Networks

Wireless Mesh Network has drawn much attention due to wide area service coverage with low system cost and being easy to install.However,WMN suffers from high bit error rate,which provides different link capacity among wireless mesh routers.The conventional routing metrics select the path based on link quality.The link with the best quality is preferred as the data transmission path,and thus all nodes likely select the same link,which leads to network performance degradation.This paper proposes a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path.It is confirmed that the proposed method provides higher network performance of reduced delay,reduced packet loss and increased throughput than conventional routing metrics.

Cooperative Layer-2 Based Routing Approach for Hybrid Wireless Mesh Networks

In a Wireless Mesh Network(WMN),the convenience of a routing strategy strongly depends on the mobility of the intermediate nodes that compose the paths.Taking this behaviour into account,this paper presents a routing scheme that works differently accordingly to the node mobility.In this sense,a proactive routing scheme is restricted to the backbone to promote the use of stable routes.Conversely,the reactive protocol is used for searching routes to or from a mobile destination.Both approaches are simultaneously implemented in the mesh nodes so that the routing protocols share routing information that optimises the network performance.Aimed at guaranteeing the IP compatibility,the combination of the two protocols in the core routers is carried out in the Medium Access Control(MAC)layer.In contrast to the operation in the IP layer where two routing protocols cannot work concurrently,the transfer of the routing tasks to the MAC layer enables the use of multiple independent forwarding tables.Simulation results show the advantage of the proposal in terms of packet losses and data delay.

The Study on Wireless Mesh Networks Security based on Improved Coding Scheme

In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect fi＇om multiple failures in wireless mesh networks to achieve high throughput where the redundancy is considered for the average number of failures. Our coding scheme is designed to protect fi＇om the average number of failures to increase the network throughput. When the number of failures is more than the average case, the destination will have to walt for more coded packets in the following time slots.

The Study on Wireless Mesh Networks Security based on Improved Coding Scheme

In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect from multiple failures in wireless mesh networks to achieve high throughput where the redundancy is considered for the average number of failures. Our coding scheme is designed to protect from the average number of failures to increase the network throughput. When the number of failures is more than the average case, the destination will have to wait for more coded packets in the following time slots.