Minimum queue length load-balancing in planned Wireless Mesh Networks

Abstract

Wireless Mesh Networks (WMNS) have emerged in the last years as a cost-efficient alternative to traditional wired access networks. In order to fully exploit the intrinsically scarce resources WMNS possess, the use of dynamic routing has been proposed. We argue instead in favour of separating routing from forwarding (i.e.à la MPLS) and implementing a dynamic load-balancing scheme that forwards incoming packets along several pre-established paths in order to minimize a certain congestion function. In this paper, we consider a particular but very important scenario: a planned WMN where all bidirectional point-to-point links do not interfere with each other. Due to its versatility and simplicity, we use the sum over all links of the mean queue length as congestion function. A method to learn this function from measurements is presented, whereas simulations illustrate the framework.

A simple active queue management based on the prediction of the packet arrival rate

“…This model can adapt to traffic assignment when QoS applies, and was also employed in the model discussed in Section II by taking into account traffic from another provider borrowing the network. In [17], a similar model for queue balancing is proposed, but instead it is applied over wireless mesh networks. Simulation results for this model revealed stable queue sizes at low congestion levels, after applying the proposed optimization mechanisms.…”

Reputation‐based cross‐layer intrusion detection system for wormhole attacks in wireless mesh networks

“…Most of the SIDSs detect and isolate wormhole attacks by considering only predefined single‐layer parameters and do not observe the node or path behaviour. More packets are dropped or delayed because of channel collisions at the MAC layer or extra queuing delays in WMNs, which will degrade the network performance. Behavior‐based SIDSs do not consider packet collisions and queuing delays in WMNs to detect wormhole attacks.…”

“…To define these values in the backbone mesh, group heads monitor the network traffic of their group members to evaluate each member's per‐packet expected queuing delay () and blocking probability (), where i represents the group head and j represents the group member. Because group heads know their group members’ finite buffer and transmission capacities, an M/M/1/K queuing model is used to calculate and . The following equations are used by group heads to calculate the and values of their corresponding group members.…”

Selection of Energy and Queue Aware Forwarding Neighbor in Wireless Mesh Network

“…Yanbing et al [16] analyzed the average queuing delay, average queuing length, and optimize the average queuing delay by increasing the number of network interfaces as well as the transmitting rate of sending interfaces. Capdehourat et al [17] proposed an algorithm for dynamic multipath forwarding in a WMN. The algorithm enabled load balancing and carries out the network to operate at the minimum average congestion.…”