Design and experimental performance analysis of a B.A.T.M.A.N.-based double Wi-Fi interface mesh network

This paper evaluates a routing protocol called Better Approach to Mobile Ad hoc Networking (B.A.T.M.A.N.) for a wireless mesh network. Specifically, this paper describes the practical deployment of the outdoor wireless mesh network using a PC Engine™ embedded application called the ALIX3 series system. The actual measurement of the outdoor wireless mesh network performance is the utmost importance to evaluate the B.A.T.M.A.N. decentralized routing protocol management. This routing protocol eliminates the need to spread the routing information to each node. Furthermore, B.A.T.M.A.N routing protocol is implemented as a kernel module operating at layer 2 and the routing information is embedded in the data packets. Hence, this paper provides both the experimental and real measurements of the practical outdoor wireless mesh network using B.A.T.M.A.N. routing protocol.

As an inexpensive, scalable internet-access network, a wireless internet-access mesh network ( WIMNET ) is composed of multiple access-points ( APs ) connected by wireless links. WIMNET can improve the dependability to link or AP failures by allocating APs redundantly in the network field. Because redundant APs may increase the operational cost and degrade the performance due to increasing radio interferences, only the necessary APs for communications between the hosts and the internet gateway should be activated in conventional situations. Previously, we proposed an active AP selection algorithm to select the minimum number of APs to be activated such that the overall throughput is maximised, assuming that every link has the same constant speed. However, our preliminary experiments for the emerging high-speed IEEE802.11n protocol that should be introduced into WIMNET, found that this speed is greatly affected by the link environment such as the distance. In this paper, we present an extension of the active AP selection algorithm to efficiently select active APs under link speed changes. Besides, we extend the routing tree algorithm used in the algorithm procedure and the WIMNET simulator for throughput evaluations. We verify the effectiveness through extensive simulations in three instances.

Virtual Home Region Multi-Hash Location Management Service (VIMLOC) for Large-Scale Wireless Mesh Networks

This paper considers the problem of self-diagnosis of wireless mesh networks (WMNs) and mobile ad-hoc networks (MANETs) using the comparison approach. In this approach, the network consists of a collection of n independent heterogeneous mobile or stationary hosts interconnected via wireless links, and it is assumed that at most sigma of these hosts are faulty. In order to diagnose the state of the wireless mesh and ad-hoc network, tasks are assigned to pairs of hosts and the outcomes of these tasks are compared. The agreements and disagreements among hosts are the basis for identifying the faulty ones. We develop a new distributed self-diagnosis protocol, called adaptive-DSDP, for MANETs and WMNs that identifies both hard and soft faults in a finite amount of time. We analyze the time and communication complexities of our protocol and compare it to existing self-diagnosis protocols

In a wireless mesh network (WMN), mesh clients (MCs) access the Internet through the wireless backbone formed by the Internet Gateways (IGWs) and Mesh Routers (MRs). An IGW as the traffic center may easily become the congestion center in a WMN. The load balancing between IGWs will reduce the traffic congestion thereby improving the network performance and providing a better quality of service (QoS). In this paper, potential load balancing between different IGW service domains is examined and fairness metrics are defined for both homogenous and heterogeneous WMNs. A distributed load balancing scheme based on diffusion methods is proposed to achieve a global load fairness. The effectiveness and efficiency of proposed load balancing scheme are verified by extensive simulations.

In a wireless mesh network (WMN), mesh clients (MCs) access the Internet through the wireless backbone formed by the Mesh Routers (MRs) and Internet Gateways (IGWs). Internet Gateways are the traffic center in each IGW service domain thus may also become the congestion center. To improve the performance of a WMN, the load balancing between different IGW service domains is investigated. The load fairness between IGWs domains will improve the network performance and provides a better quality of service (QoS) for end users. In this paper, the fairness index is defined for both homogenous and heterogeneous WMNs. A probabilistic load balancing algorithm based on the simulated annealing method is proposed to get the global load fairness.

Wireless mesh network (WMN) is a peculiar type of growing technology that can alter the world more effectively in the coming decades. Multicast routing in mesh networks is the distribution of data from a single source to multiple destinations or multiple sources to multiple destinations through the intermediate nodes. There can be many numbers of intermediate nodes between source and destination. But the number of hops a packet traverses decides the energy consumed, data rate, speed, throughput and other characteristics of a network. The reduction in the number of hops leads to reduced processing of data which leads to reduced consumption of power. In this paper, energy coherence for wireless mesh networks from a point of view that started recently to attract the attention of the conservation of energy for operational and the environment reasons which is known as the Green Networking is considered. This paper discusses the energy coherence of multicast routing algorithm based on angle which reduces the hop count leading to reduction in energy consumption and the angle with efficient energy optimization is found. Not only the energy, other network parameters like throughput, delay, packet delivery ratio, packet loss ratio have also been improved at the appropriate angle. This in turn enhances the QoS of the network.

Field Based Routing (FBR) is the next promising class of routing algorithms especially for wireless mesh networks. The inherent nature of shared medium wireless mesh networks, however, poses fundamental challenges to the design of effective routing policies that are optimal with respect to speed, time and resource utilization. In this paper, globally optimized routing algorithm for multiple subscribers in wireless mesh networks is proposed. Mesh network with multiple nodes will serve as an environment that optimizes some global utility function limited by the mobile nodes position in underlying MAC (Media Access Control) layer. By solving the optimization problem, the network is brought to a point of efficient operation with a certain routing policy for each node. This information will be the operating point that can be used to find better ways adaptive, which is able to steer the network towards the optimal routing. Global optimization of FBR is depicted through path estimation using PSO (Particle Swarm Optimization).

Wireless multi-hop mesh network (Wireless Mesh Network, WMN), is a new network technology developed from mobile Ad hoc, widely used in the world. The paper carried out in-depth research and outlook to the key technologies, network architecture, performance and characteristics and typical application scenarios of Wireless Mesh Network.

Wireless Mesh Networks (WMN) are becoming inevitable in this world of high technology as it provides low cost access to broadband services. Moreover, the technologists are doing research to make WMN more reliable and secure. Subsequently, among wireless ad-hoc networking technologies, Bluetooth Low Energy (BLE) is gaining high degree of importance among researchers due to its easy availability in the gadgets and low power consumption. BLE started its journey from version 4.0 and announced the latest version 5 with mesh support capability. BLE being a low power and mesh supported technology is nowadays among the hot research topics for the researchers. Many of the researchers are working on BLE mesh technology to make it more efficient and smart. Apart from other variables of efficiency, like all communication networks, mesh network security is also of a great concern. In view of the aforesaid, this paper provides a comprehensive review on several works associated to the security in WMN and BLE mesh networks and the research related to the BLE security protocols. Moreover, after the detailed research on related works, this paper has discussed the pros and cons of the present developed mesh security mechanisms. Also, at the end after extracting the curx from the present research on WMN and BLE mesh security, this research study has devised some solutions as how to mitigate the BLE mesh network security lapses.

Mobile Ad-hoc Networks are a growing field of interest. They have many real-world applications, such as enabling internet connected sensors to operate in environments without pre-existing infrastructure. In past work, we have demonstrated that the Long Range (LoRa) radio frequency (RF) modulation technique, in conjunction with a mesh network can meet these needs in static networks. To extend this to applications with mobile nodes, several adaptations have been implemented to extend the original B.A.T.M.A.N (Better Approach to Mobile Ad-hoc Networking) mesh network algorithm. Node movement models were developed and tested to improve simulation accuracy. We also implemented situationally aware, machine learning (ML) based, route discovery techniques to ensure adequate network information is available in dynamic environments, without adding excessive overhead in static situations. To optimize these changes, a Black Box Optimizer was used in conjunction with an event-based simulation tool to train the ML model.

Wireless mesh networking has trans pired as a gifted technology for potentialbroadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wi reless mesh networks which are routed through the gateways.Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A profes sional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allo cation, sub carrier allocation andpacket scheduling. This approach combines the merits of aKarush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is conclude d that, this approach achieves a preferred stability between system implementation and computational convolution.

Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Network routing plays a critical role in determining the performance of a wireless mesh network. To study the best mesh network routing strategy which can maximize the network throughput while satisfying the fairness constraints, existing research proposes to formulate the mesh network routing problem as an optimization problem. These works usually make ideal assumptions such as known static traffic input. Whether they could be applied for practical use under the highly dynamic and uncertain traffic in wireless mesh network is still an open issue. The main objective of this paper is to understand the effects of traffic uncertainty in wireless mesh networks and consider these effects in throughput maximization routing. It identifies the appropriate optimization framework that could integrate the statistical user traffic demand model into a tractable throughput maximization problem. The trace-driven simulation study demonstrates that our algorithm can effectively incorporate the traffic demand uncertainty in routing optimization, and outperform the throughput maximization routing which only considers static traffic demand.

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

The IEEE Standard 802.16 supports for creating wireless mesh networks. The primary advantage of mesh networks is an improvement of capacity by concurrent transmission in the wireless environment. Therefore, the degree of spatial reuse is very crucial to realize the full potential of such wireless mesh networks. In this paper, we investigate the spatial reuse in IEEE 802.16 mesh networks. We propose a scheduling mechanism and a routing algorithm taking into account the interference in wireless environment to achieve maximum spatial reuse hence to increase the overall network throughput. The simulation results show that the proposed schemes achieve significant improvement and are more effective.