State-of-the-art of distributed channel assignment

Channel assignment for Wireless Mesh Networks (WMNs) attempts to increase the network performance by decreasing the interference of simultaneous transmissions. The reduction of interference is achieved by exploiting the availability of fully or partially non-overlapping channels. Although it is still a young research area, many different approaches have already been developed. These approaches can be distinguished into centralized and distributed. Centralized algorithms rely on a central entity, usually called Channel Assignment Server (CAS), which calculates the channel assignment and sends the result to the mesh routers. In distributed approaches, each mesh router calculates its channel assignment decision based on local information. Distributed approaches can react faster to topology changes due to node failures or mobility and usually introduce less protocol overhead since communication with the CAS is not necessary. As a result, distributed approaches are more suitable once the network is operational and running. Distributed approaches can further be classified into static and dynamic, in regard to the modus of channel switching. In dynamic approaches, channels can be switched on a per-packet basis, whereas in static approaches radios stay on a specific channel for a longer period of time. Static assignments have been more in focus, since the channel switching time for current Institute of Electrical and Electronics Engineers (IEEE) 802.11 hardware is in the order of milliseconds which is two orders higher than the packet transmission time. Recently, surveys of channel assignment algorithms have been presented which cover certain aspects of the research field. The survey in [1] introduces the problem and presents a couple of distributed algorithms and [2] gives a broad introduction to centralized and distributed approaches. The survey herein is focused on distributed approaches for peer- to-peer network architectures. This report describes the problem formulation for channel assignment in WMNs and the fundamental concepts and challenges of this research area. We present different distributed channel assignment algorithms and characterize them according to a set of classification keys. Since channel assignment algorithms may change the connectivity and therefore the network topology, they may have a high impact on routing. Therefore, we present routing metrics that consider channel diversity and adapt better to the multi- radio multi-channel scenario than traditional routing metrics designed for single channel networks. The presented algorithms are discussed and compared focusing on practical evaluations in testbed and network environments. The implementation for real networks is a hard and labor-intensive task because the researcher has to deal with the complexity of the hardware, operating system, and wireless network interface drivers. As a result, frameworks emerged in order to simplify the implementation process. We describe these frameworks and the mechanisms used to help researchers implementing their algorithms and show their limitations and restrictions

Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks

Multi-channel multi-interface Wireless Mesh Networks permit to spread the load across orthogonal channels to improve network capacity. Although broadcast is vital for many layer-3 protocols, proposals for taking advantage of multiple channels mostly focus on unicast transmissions. In this paper, we propose broadcast algorithms that fit any channel and interface assignment strategy. They guarantee that a broadcast packet is delivered with a minimum probability to all neighbors. Our simulations show that the proposed algorithms efficiently limit the overhead

A study on stryi-icnos potatorum and pisum sativum as natural coagulants for meat food processing wastewater

Slow maintained load test is widely used by contractors in Malaysia to ensure the driven pile could accommodate the design load of the structure. Slow maintained load test is a test to determine load-settlement curve and pile capacity for a period of time using conventional load test. Conventional static pile load test equipment is large in size thus making it heavier and takes a long time to install. In addition, it consumes a lot of space which causes congestion at construction sites. Therefore, the objective of this thesis is to conduct a conventional load test by replacing the pile kentledge load with anchorage and reaction pile. Preparations of ten designs comprising six commercial designs were reviewed. In addition, four proposed designs were suggested for the setup. Final design was produced based on its safety factors and criteria referred via literature review. The test frame consists of reaction frame with four reaction helical pile with two helixes per reaction pile. The deformation shapes, safety factor, stress, and strain of the design and finite element of the model has been analysed with the use of SolidWorks and Pia.xis 30 software. SolidWorks software emphasizes on the model load-deflection relationship while Plaxis 30 ensures a correlation of reaction between pile uplift force and soil. Then, the model was tested on site to determine the relationship between physical load­deflection and pile-soil uplift force. The results of uplift force and displacement for numerical and physical test were nearly identical which increment of load­displacement graph pattern. The higher the uplift force, the higher the displacement obtained. In conclusion, the result obtained and the design may be considered as a guideline for future application of sustainable slow maintained pile load test

Survey on wireless technology trade-offs for the industrial internet of things

Aside from vast deployment cost reduction, Industrial Wireless Sensor and Actuator Networks (IWSAN) introduce a new level of industrial connectivity. Wireless connection of sensors and actuators in industrial environments not only enables wireless monitoring and actuation, it also enables coordination of production stages, connecting mobile robots and autonomous transport vehicles, as well as localization and tracking of assets. All these opportunities already inspired the development of many wireless technologies in an effort to fully enable Industry 4.0. However, different technologies significantly differ in performance and capabilities, none being capable of supporting all industrial use cases. When designing a network solution, one must be aware of the capabilities and the trade-offs that prospective technologies have. This paper evaluates the technologies potentially suitable for IWSAN solutions covering an entire industrial site with limited infrastructure cost and discusses their trade-offs in an effort to provide information for choosing the most suitable technology for the use case of interest. The comparative discussion presented in this paper aims to enable engineers to choose the most suitable wireless technology for their specific IWSAN deployment

A Topology Control-Based Self-Organisation in Wireless Mesh Networks

An algorithm for self-organisation that assigns the channels intelligently in multi-radio wireless mesh networks (MR-WMN) is important for the proper operation of MR-WMN. The aim of the self-organisation algorithm is to reduce the overall interference and increase the aggregate capacity of the network. In this paper, we have first proposed a generic self-organisation algorithm that addresses these two challenges. The basic approach is that of a distributed, light-weight, cooperative multiagent system that guarantees scalability. Second, we have evaluated the performance of the proposed self-organisation algorithm for two sets of initialisation schemes. The initialisation process results in a topology control of MR-WMN by way of spatial distribution of connectivity between the mesh nodes. The results have been obtained for realistic scenarios of MR-WMN node densities and topologies. We have shown in addition the need to develop non-transmit power control based algorithms to achieve a further increase in system capacity