Showing papers on "Wireless mesh network published in 2020"
TL;DR: A comprehensive survey on the controller placement problem (CPP) in SDN is presented and the classical CPP formulation along with its supporting system model is presented.
Abstract: In recent years, Software Defined Networking (SDN) has emerged as a pivotal element not only in data-centers and wide-area networks, but also in next generation networking architectures such as Vehicular ad hoc network and 5G. SDN is characterized by decoupled data and control planes, and logically centralized control plane. The centralized control plane in SDN offers several opportunities as well as challenges. A key design choice of the SDN control plane is placement of the controller(s), which impacts a wide range of network issues ranging from latency to resiliency, from energy efficiency to load balancing, and so on. In this paper, we present a comprehensive survey on the controller placement problem (CPP) in SDN. We introduce the CPP in SDN and highlight its significance. We present the classical CPP formulation along with its supporting system model. We also discuss a wide range of the CPP modeling choices and associated metrics. We classify the CPP literature based on the objectives and methodologies. Apart from the primary use-cases of the CPP in data-center networks and wide area networks, we also examine the recent application of the CPP in several new domains such as mobile/cellular networks, 5G, named data networks, wireless mesh networks and VANETs. We conclude our survey with discussion on open issues and future scope of this topic.
129 citations
TL;DR: This article provides a review of the state-of-the-art multihop proposals for LoRaWAN, and carried out a comparative analysis and classification, considering technical characteristics, intermediate devices function, and network topologies.
Abstract: The growth of the Internet of Things (IoT) led to the deployment of many applications that use wireless networks, like smart cities and smart agriculture. Low Power Wide Area Networks (LPWANs) meet many requirements of IoT, such as energy efficiency, low cost, large coverage area, and large-scale deployment. Long Range Wide Area Network (LoRaWAN) networks are one of the most studied and implemented LPWAN technologies, due to the facility to build private networks with an open standard. Typical LoRaWAN networks are single-hop in a star topology, composed of end-devices that transmit data directly to gateways. Recently, several studies proposed multihop LoRaWAN networks, thus forming wireless mesh networks. This article provides a review of the state-of-the-art multihop proposals for LoRaWAN. In addition, we carried out a comparative analysis and classification, considering technical characteristics, intermediate devices function, and network topologies. This paper also discusses open issues and future directions to realize the full potential of multihop networking. We hope to encourage other researchers to work on improving the performance of LoRaWAN mesh networks, with more theoretical and simulation analysis, as well as practical deployments.
61 citations
TL;DR: A wrapper-based approach using the modified whale optimization algorithm, in which the genetic algorithm operators were combined with the WOA to improve the search space of whales, and the mutation operator helped to avoid being stuck in the local optimum.
Abstract: Machine learning–based intrusion detection system (IDS) is an important requirement for securing data traffic in wireless mesh networks. The noisy and redundant features of network data tend to degrade the performance of the attack detection classifiers. Therefore , the selection of informative features plays a vital role in the enhancement to the IDS. In this paper, we propose a wrapper-based approach using the modified whale optimization algorithm (WOA). One drawback of WOA is that premature convergence results in a local optimal solution. To overcome this limitation, we proposed a method in which the genetic algorithm operators were combined with the WOA. The crossover operator was used to further improve the search space of whales, and the mutation operator helped to avoid being stuck in the local optimum. The proposed method selects the informative features in the network data, which helps to accurately detect intrusions. Using a support vector machine (SVM), we identified the types of intrusions based on the selected features. The performance of the improved method was analyzed by using the CICIDS2017 and ADFA-LD standard datasets. Our proposed method had better attack detection rate than the standard WOA and other evolutionary algorithms; it also had good accuracy and was suitable for IDS in the wireless mesh networks. The performance of the IDS was increased by selecting the informative features with the improved whale optimization algorithm. The attack detection ratio was higher than that of the standard WOA.
49 citations
TL;DR: The MSCA (Multi-Strategy Channel Allocation algorithm for edge computing) algorithm presented in this paper can minimize channel interference and overall network energy consumption while satisfying throughput and end-to-end delay.
Abstract: Wireless mesh networks (WMNs) are a kind of wireless network technology that can transmit multi-hop information, and have been regarded as one of the key technologies for configuring wireless machines. In WMNs, wireless routers can provide multi-hop wireless connections between nodes in the network and access the Internet through gateway devices. Multicast is a communication technology that uses best effort to send information from a source node to multiple destinations. In this paper, we study the problems of channel interference and time slot multi-user collisions caused by radio during WMNs information transmission. Through innovative use of edge computing technology to construct a node data cache model and step-by-step calculation of node channel separation, a multi-strategy channel allocation algorithm for edge computing is proposed. The mechanism of this algorithm is to use edge computing technology to pre-store the data in the nodes in the multicast tree and calculate the channel separation between the nodes, and then select the transmission channel number of the node with the least interference to avoid mutual interference between node information transmissions. Through experimental tests and comparisons, the MSCA (Multi-Strategy Channel Allocation algorithm for edge computing) algorithm presented in this paper can minimize channel interference and overall network energy consumption while satisfying throughput and end-to-end delay.
48 citations
TL;DR: The proposed approach allows profiting data transfer capability by data packet and using this information for routing and preventing overcrowd in network nodes and finally, distributing the load over it and revealed that at least 10% of undue delays through network can be prevented while permittivity does not reduce, thanks to the approach.
Abstract: Nowadays, wireless mesh networks are known as important parts of different commercial, scientific, and industrial processes. Their prevalence increases day-by-day and the future of the world is associated with such technologies for better communication. However, the issue of improving quality of service for dealing with more complex and intense flow of data has been always a remarkable research problem, as a result of improved wireless communication systems. In this sense, objective of this study is to provide a new algorithm for contributing to the associated literature. In the study, peer to peer wireless mesh networks and the concept of service quality were examined first and then an approach for improving service quality in such networks has been proposed accordingly. In detail, the proposed an approach allows profiting data transfer capability by data packet and using this information for routing and preventing overcrowd in network nodes and finally, distributing the load over it. When middle nodes overcrowd, they withhold to send control messages of route creating or do that by delay. The proposed approach has been evaluated and the findings revealed that at least 10% of undue delays through network can be prevented while permittivity does not reduce, thanks to the approach. Also energy consumption within network nodes partially increases due to adding table and the search which can be overlooked.
35 citations
TL;DR: A robust and trusted scheme (RTS) for IoT-based mobile mesh networks to provide reliable routing, data confidentiality, and integrity, and a secure and authentic data protection technique is proposed using public-private key cryptography, which aims to increase the protection of mesh clients with minimal overhead.
Abstract: Wireless mesh networks consist of various mesh clients that are organized in an unfixed infrastructure and packets are forwarded using a multi-hop model. Routing protocols have a significant impact on mesh networks because their performance has a crucial effect on nodes connectivity and throughput. Recently, the integration of mesh clients with the Internet of Things (IoT) has gained significant importance to connect billions of machines and achieve fast coverage with minimum network cost. However, if mesh clients are mobile, then data routing via intermediate nodes gives a noteworthy effect on the network performance and latency. Furthermore, over the Internet, a malicious node may be a part of the mesh network and as a result, the sending information can be manipulated and compromised. Therefore, this research article aims to propose a robust and trusted scheme (RTS) for IoT-based mobile mesh networks to provide reliable routing, data confidentiality, and integrity. Firstly, the proposed scheme presents a robust data routing among mobile mesh clients, routers and gateway devices based on the network parameters and measurement of wireless channels. Moreover, the wireless channels between mesh devices are formulated based on the efficacy of link costs for data dissemination. Besides, the location of mobile mesh clients is determined by computing the distance vector at a regular time interval. Secondly, a secure and authentic data protection technique is proposed using public-private key cryptography, which aims to increase the protection of mesh clients with minimal overhead. The competence of the proposed scheme is significantly improved with respect to network throughput by an average of 14%, packet loss rate by an average of 37%, latency rate by an average of 12%, computational overhead by an average of 34%, and energy efficiency by an average of 20% as compared to other works.
34 citations
TL;DR: It is demonstrated that in-band telemetry can provide ultra-efficient network monitoring operations without any effect on the network behavior and performance, validating its suitability for Industrial Wireless Sensor Networks.
Abstract: With the emergence of the Internet of Things (IoT) and Industry 4.0 concepts, industrial applications are going through a tremendous change that is imposing increasingly diverse and demanding network dynamics and requirements with a wider and more fine-grained scale. Therefore, there is a growing need for more flexible and reconfigurable industrial networking solutions complemented with powerful monitoring and management functionalities. In this sense, this paper presents a novel efficient network monitoring and telemetry solution for Industrial Wireless Sensor Networks mainly focusing on the 6TiSCH Network stack, a complete protocol stack for ultra-reliable ultra-low-power wireless mesh networks. The proposed monitoring solution creates a flexible and powerful in-band network telemetry design with minimized resource consumption and communication overhead while supporting a wide range of monitoring operations and strategies for dealing with various network scenarios and use cases. Besides, the technical capabilities and characteristics of the proposed solution are evaluated via a real-life implementation, practical and theoretical analysis. These experiments demonstrate that in-band telemetry can provide ultra-efficient network monitoring operations without any effect on the network behavior and performance, validating its suitability for Industrial Wireless Sensor Networks.
34 citations
TL;DR: Agrinex system features a mesh-like configuration of in-field nodes that act both as the sensor for soil moisture, temperature and humidity and actuator on a valve that regulates drip irrigation and is a promising start for a WSAN framework of various applications particularly in agriculture.
29 citations
01 Oct 2020
TL;DR: An Improved Selection of Encircling and Spiral updating position of WO (ISESW) based model for detecting the attacks in WMN systems is proposed and the superiority of adopted scheme is evaluated over traditional models in terms of varied measures.
Abstract: Wireless Mesh networks (WMNs) suffers from abundant security issues because of its dynamic and open communication channels. It is thus risky to formulate an Intrusion Detection System (IDS) that could make out diverse unidentified attacks in the network. This paper intends to propose an Improved Selection of Encircling and Spiral updating position of WO (ISESW) based model for detecting the attacks in WMN systems. The adopted scheme includes two phase’s namely, Feature Selection and Classification. Initially, the features (informative features) from the given data are selected using Principal Component Analysis (PCA) model. The selected informative features are then subjected to classification process using Neural Network (NN), where the presence of attacks is classified. To make the detection more accurate, the weights of NN are fine-tuned using the ISESW algorithm, which is the improved version of WOA model. Finally, the superiority of adopted scheme is evaluated over traditional models in terms of varied measures.
26 citations
TL;DR: A cross-layer routing scheme that supports adaptive bit-rate multimedia (ABM) transmissions over MCRNs that is based on the QoS-aware end-to-end path delay, and PU-activity aware end- to- end path stability metrices is proposed.
Abstract: Due to the recent developments in the wireless mesh and ad-hoc networks, multi-hop cognitive radio networks (MCRNs) have attained the significant attention towards providing the reliable multimedia communications. However, in reliable multimedia communications each multimedia application observed a very stringent quality-of-service (QoS) requirements. Moreover, in MCRNs, channel allocated to the multimedia secondary users (MSUs) can be re-occupied by the primary users (PUs) at any time which causes the end-to-end path discontinuity that severely affect the performance of the MCRNs. Therefore, under the dynamic channel availability, selecting an end-to-end path that is not only stable but also fulfills the QoS requirements of the real time and multimedia (RM) applications is a challenging task and still an open research problem. Hence, in this paper, we propose a cross-layer routing scheme that supports adaptive bit-rate multimedia (ABM) transmissions over MCRNs. Moreover, our path selection is based on the QoS-aware end-to-end path delay, and PU-activity aware end-to-end path stability metrices. Furthermore, to avoid the PU interference, continuity in transmission, efficient channel utilization, and supporting error resilience over time varying wireless channels our selected end-to-end path is periodically updated. Simulation study shows that the proposed scheme is more robust and suitable for supporting ABM over MCRNs.
21 citations
28 Oct 2020
TL;DR: This paper proposes a CCM based Hill Climbing (HC) for mesh router placement optimization problem and proposes a Coverage Construction Method (CCM) for thisMesh router placement problem.
Abstract: Wireless mesh networks (WMNs) are one of the wireless network technologies that have received much attention in recent years, and as the name implies, routers can provide a stable network over a wide area by configuring the network like a mesh. In order to provide a lower cost and more stable network, various methods for optimizing the placement of mesh routers are being studied. In a previous work, we proposed a Coverage Construction Method (CCM) for this mesh router placement problem. In this paper, we propose a CCM based Hill Climbing (HC) for mesh router placement optimization problem.
01 Feb 2020
TL;DR: A joint time-slot scheduling, sub-band scheduling, and power allocation (JTSP) scheme is proposed to solve the resource allocation problem in 6G THz backhaul networks, formulated as a mixed integer nonlinear program (MINLP) problem, which is NP-Complete.
Abstract: Self-backhauling is a promising solution for ultra-dense networks. Since the Teraherz (THz) band can provide a very broad bandwidth, THz-based self-backhauling is an attractive technology for 6G ultra-dense networks to achieve “near-wired” transmissions and reduce cost. Based on THz, small base stations form a wireless mesh backhaul network, and a small base station can communicate with multiple neighbors concurrently. However, in a mesh network, time-slot must be carefully scheduled among directional links to fully exploit concurrent transmission opportunities while avoid cross-link interference and conflictions. Besides, since the THz band has frequency-selective and distance-selective properties, when allocating sub-bands to links with different transmission distance, the Long-User-Central-Window (LUCW) principle must be followed. Moreover, transmit power needs to be proper allocated to avoid interference. Therefore, the resource allocation problem in 6G THz backhaul networks is complicated. In this paper, a joint time-slot scheduling, sub-band scheduling, and power allocation (JTSP) scheme is proposed to solve the problem. This problem is formulated as a mixed integer nonlinear program (MINLP) problem, which is NP-Complete. To reduce the computational complexity, a greedy shrinking algorithm (GSA) is designed in JTSP to obtain a suboptimal solution. The effectiveness of JTSP is validated by simulations. Results illustrate that compared with traditional methods and algorithms, the proposed scheme can achieve 12.5%-60.7% throughput gain.
TL;DR: Simulation results show that, compared with GA algorithm and K-means algorithm, the improved particle swarm algorithm has a stable solution effect, strong robustness, and can obtain a smaller coverage radius, thereby improving the network service quality.
TL;DR: In this article, an SDN-based routing architecture for wireless mesh networks is presented, which combines SDN with WMN to allow mesh networks to meet current user requirements with several resources, coverage, and scalable high bandwidth capability.
Abstract: Software Defined Networking (SDN) has been seen as a revolutionary and exciting network technology that aims to enable control and network management of various network types, whether wired or wireless. Nevertheless, SDN research focuses very little on wireless communication and, more specifically, on Wireless Mesh Networks (WMNs). Moreover, the issue of routing is vitally important in WMNs, but the legacy and traditional routing protocols cannot make the most of multiple paths between the source node and destination node due to the complexity and cost of the network. In this paper, we present SDNMesh, an SDN based routing architecture for WMNs. We combine SDN with WMN to allow mesh networks to meet current user requirements with several resources, coverage, and scalable high bandwidth capability. Apart from the mentioned capability, SDN’s unified approach leads to better network capacity management. Experiments have been carried out using the Mininet-WiFi simulation tool to create a network environment that allows integration of the two networking paradigms, centralized, and decentralized. Simulation results show that our SDNMesh routing solution performs better in terms of network performance metric throughput, packet loss ratio, and delay while comparing with traditional routing approaches such as OLSR, BATMAN, and an SDN based Three-Stage routing protocols. Moreover, experimental results show that SDNMesh gives better results in terms of the mentioned performance metrics.
TL;DR: A collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs is presented and a mixed integer linear programming (MILP) is formulated to optimize the network utility and enhance the practical usefulness under the given traffic demands.
Abstract: In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), ie, it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance
TL;DR: Kabbinale et al. as discussed by the authors proposed blockchain for economically sustainable wireless mesh networks, which has been published in final form at https://doi.org/10.1002/cpe.5349.
Abstract: This is the peer reviewed version of the following article: Kabbinale, AR, Dimogerontakis, E, Selimi, M, et al. Blockchain for economically sustainable wireless mesh networks. Concurrency Computat Pract Exper. 2020; 32:e5349, which has been published in final form at https://doi.org/10.1002/cpe.5349. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.
TL;DR: A delay- and interference-aware routing (DIAR) method using optimization is proposed in this article to find effective routes in a wireless mesh network to obtain better network performance.
Abstract: Effective routing design can significantly improve the whole network performance. In order to achieve the global best network performance, the problem of routing can be formulated as a constrained optimization problem. A delay- and interference-aware routing (DIAR) method using optimization is proposed in this article to find effective routes in a wireless mesh network. With the rapid development of wireless communication, next-generation networks urge shorter delay. DIAR aims at selecting routes with minimum end-to-end delay for several concurrent data flows. Delay is derived according to interference, bandwidth, and the probability of transmission failure. Then, the relationship between delay and the number of interfering nodes is built for the first time, which makes the estimation of delay more simple. When solving the optimization problem, an improved genetic algorithm is proposed to balance load. Besides, DIAR considers dynamic network condition caused by selecting different paths to transmit packets and evaluates the network condition while finding the solution of routing. The paths with least end-to-end delay will be finally chosen as the solution. Simulation results show that DIAR can obtain better network performance.
TL;DR: A cross-layer algorithm named MRCSC, which adopts an efficient collision-free mechanism to greedily schedule different multicast transmission in the network, and uses both intra- and inter-cell relaying to create multicast trees with a specific bandwidth.
TL;DR: A new adaptive channel allocation algorithm for a multi-radio multi-channel wireless mesh network is proposed that is aimed to minimize the number of channel reassignments while maximizing the performance under practical constraints.
Abstract: The wireless mesh network (WMN) has proven to be a great choice for network communication technology. WMNs are composed of access points (APs) that are installed and communicate with each other through multi-hop wireless networks. One or more of these APs acts as a gateway (GW) to the internet. Hosts of WMNs are stationary or mobile. According to the structure of WMNs, some network features may be affected, such as the overall performance, channel interference, and AP connectivity. In this paper, we propose a new adaptive channel allocation algorithm for a multi-radio multi-channel wireless mesh network. The algorithm is aimed to minimize the number of channel reassignments while maximizing the performance under practical constraints. The algorithm defines a decision function for the channel reassignments. The decision function aims to minimize the traffic around the GW. Whenever the traffic changes in the wireless mesh network, the decision function decides which channel radio reassignment should be done. We demonstrated the effectiveness of our algorithm through extensive simulations using Network Simulator 2 (NS-2).
TL;DR: A comparative study of existing polling cycle mechanisms is provided and it is found that the new fast polling algorithm significantly outperforms previously proposed polling-cycle mechanisms with improvements typically exceeding 70%.
Abstract: We present a new fast polling algorithm (FPA) in a wireless mesh network (WMN) for Narrowband Internet of Things systems using multi-hop WMNs. We focus on wireless networks with stationary IoT remote telemetry units (IoT RTU), such as wireless network monitoring. The goal of the new FPA is to minimize the time required for supervisory control and data acquisition center to poll all RTUs one by one and to receive their responses using random network coding. We study the performance of the proposed FPA by applying it in a WMN composing of 3 and 50 RTUs with a sub-carrier spacing of 6.25 kHz, 12.5 kHz, 25 kHz, and 50 kHz. This paper also provides a comparative study of existing polling cycle mechanisms; we find that our FPA significantly outperforms previously proposed polling-cycle mechanisms with improvements typically exceeding 70%.
TL;DR: A low-cost and low-power sensor node for mesh architectures has been developed and tested in this work and the aim of the test was to characterize which are the effects of the overheating on the current consumption, the sensor response, the analog-to-digital converter, and the digital- to-analog converter.
Abstract: The monitoring of environmental condition, together with soil parameter, is extremely important in precision farming technologies. One of the best solutions to implement environmental monitoring system in agriculture is to use a wireless mesh network to cover large area and ensure fault tolerance. A low-cost and low-power sensor node for mesh architectures has been developed and tested in this work. The node is based on a system on a chip microcontroller and few sensors to acquire air temperature, air humidity, soil temperature, soil moisture, and solar radiation. Generally, the effects of temperature on the dynamic metrological performance and on the reliability of wireless sensor network are not adequately dealt with. Moreover, no international standard for the environmental test of wireless sensor networks is available. In this article, a temperature step-stress test profile was implemented to characterize the behavior of the prototype at different temperature, from 20 °C up to 80 °C (step of 5 °C) using a climatic chamber. The aim of the test was to characterize which are the effects of the overheating on the current consumption, the sensor response, the analog-to-digital converter, and the digital-to-analog converter. The experimental test highlights some minor anomalies. However, all the unexpected behaviors are not caused by permanent failure mechanisms that lead to failure in the whole node. They are simple drifts that disappear when temperature returns to the standard environmental conditions.
13 Oct 2020
TL;DR: In this article, a solution construction method for mesh router placement optimization problem is proposed, where the placement of the mesh routers affects transmission loss, installation cost, operational complexity, etc.
Abstract: The Wireless Mesh Networks (WMNs) consists of mesh routers and mesh clients connected by multi-hop radio communication. Mesh router provides serves as an access point and communicates with the other mesh routers and mesh clients. On the other hand, placement of the mesh routers affects transmission loss, installation cost, operational complexity, etc. However, optimizing the placement of the mesh routers can resolve these problems and increases the network performance. In our previous work, we considered meta-heuristic based mesh router placement optimization system. In this paper, we propose a solution construction method for mesh router placement optimization problem.
TL;DR: This paper constructs a hybrid RF/FSO MCMR WMN topology and addresses its resource allocation (RA) problem in terms of interface assignment, channel allocation, routing, FSO link allocation, and topology control and shows that the RA scheme is efficient and the throughput can be enhanced dramatically by proper FSO links augmentation.
Abstract: The overwhelming data rates in next generation wireless networks impose a burden on the high-capacity network planning. One promising strategy to meet the demand for high-capacity communications is to augment radio frequency (RF) based multi-channel multi-radio (MCMR) wireless mesh network (WMN) by free-space optics (FSO). In this paper, we construct a hybrid RF/FSO MCMR WMN topology and address its resource allocation (RA) problem in terms of interface assignment, channel allocation, routing, FSO link allocation, and topology control. Considering the weather effects on FSO link availability and the fading nature of RF links, the RA problem is formulated as a two-stage optimization problem with the objective of maximizing the network throughput. In our optimization model, we formulate each stage as a mixed integer linear program, and the bottleneck RF links are gradually upgraded by FSO links. To avoid the computational complexity of the second stage optimization, an improved iterated local search algorithm is proposed. Simulation results show that our RA scheme is efficient and the throughput can be enhanced dramatically by proper FSO link augmentation.
TL;DR: A secure Geo-Location Oriented Routing (Secure-GLOR) protocol for wireless mesh networks, which incorporates a hybrid encryption scheme for its multilevel security framework, which improves the network’s overall performance compared to the basic encryption by using a combination of symmetric key as well as asymmetric key encryption.
01 Jan 2020
TL;DR: This paper proposes a user mobility-aware channel assignment algorithm based on weighted link ranking to fairly allocate the channels and minimizes the interference, thus improves the capacity of the network.
Abstract: Wireless Mesh Networks (MR-WMNs) are characterized by having multiple radio interfaces with which, node can send/receive data to/from multiple nodes. This feature increases the network capacity and improves data delivery rate. However, interference between the co-located channels is one of the main constraints that hinder such networks from achieving the optimal utilization of the available resources such as bandwidth and transmission routes. Bottleneck is one of the consequences of such limitation, which leads to network fragmentation and performance degradation especially in the critical links shared by multiple paths connecting the nodes with the gateway. Although several studies have been conducted to address such limitation, they were all built on the premise of stationary topology, which does not hold for real world WMNs that include mobile users in addition to backbone nodes and routers. To this end, this paper proposes a user mobility-aware channel assignment algorithm based on weighted link ranking to fairly allocate the channels and minimizes the interference, thus improves the capacity of the network. Multiple criteria were used to rank those links before applying the channel assignment algorithm. Those criteria were obtained from traffic and network topology such as distance from the gateways, interference index, and traffic load. The results from numerical simulation demonstrate that the proposed scheme has reduced the interference which, consequently, improved the network capacity.
TL;DR: The current research proposed a novel Grey Wolf Trust Accumulation (GWTA) Schema in wireless mesh network architecture, thus the attacks are identified by the finest function of the GWTA model and the predicted attacked nodes are replaced to the last position of the network medium to prevent the packet loss.
Abstract: Mobile Ad hoc Network is self-organized and movable in nature, it is widely used in various applications including military and private sectors. However, security is one of the key concerns in routing because of the moving nodes; thus it is usually affected by Black Hole and Grey Hole attack. These types of malicious activities are more harmful to the network channel, and once the attack is happened it is difficult to predict and mitigate. To end this problem the current research proposed a novel Grey Wolf Trust Accumulation (GWTA) Schema in wireless mesh network architecture, thus the attacks are identified by the finest function of the GWTA model. Moreover, the predicted attacked nodes are replaced to the last position of the network medium to prevent the packet loss. Furthermore, the comparison studies proved the effectiveness of the proposed model by attaining less packet drop and high throughput ratio rate.
TL;DR: A comprehensive study on the performance of QUIC in Wireless Mesh Networks (WMN), which shows that while QUIC outperforms TCP in wired networks, it exhibits significantly lower performance than TCP in the WMN.
Abstract: The exponential growth in adoption of mobile phones and the widespread availability of wireless networks has caused a paradigm shift in the way we access the Internet. It has not only eased access to the Internet, but also increased users’ appetite for responsive services. New protocols to speed up Internet applications have naturally emerged. The QUIC transport protocol is one prominent case. Initially developed by Google as an experiment, the protocol has already made phenomenal strides, thanks to its support in Google’s servers and Chrome browser. Since QUIC is still a relatively new protocol, there is a lack of sufficient understanding about its behavior in real network scenarios, particularly in the case of wireless networks. In this paper we present a comprehensive study on the performance of QUIC in Wireless Mesh Networks (WMN). We perform a measurement campaign on a production WMN to compare the performance of QUIC against TCP when retrieving files from the Internet. Our results show that while QUIC outperforms TCP in wired networks, it exhibits significantly lower performance than TCP in the WMN. We investigate the reasons for this behavior and identify the root causes of the performance issues. We find that some design choices of QUIC may penalize the protocol in WiFi, e.g., uncovering sub-optimal interactions of QUIC with MAC layer features, such as frame aggregation. Finally, we implement and evaluate our solution and demonstrate up to 28% increase in throughput of QUIC.
Patent•
27 Oct 2020TL;DR: In this paper, a method for pseudo channel hopping in a node of a wireless mesh network is presented, where each channel is scanned for a scan dwell time associated with the channel, updating statistics for each channel based on packets received by the node during the scanning of the channel.
Abstract: A method for pseudo channel hopping in a node of a wireless mesh network is provided that includes scanning each channel of a plurality of channels used for packet transmission by the node, wherein each channel is scanned for a scan dwell time associated with the channel, updating statistics for each channel based on packets received by the node during the scanning of the channel, and selecting a channel of the plurality of channels for scanning based on the statistics when the scan dwell time of a currently scanned channel ends.
01 Sep 2020
TL;DR: This scientific work is preparatory for the adoption of Machine Learning algorithms that will drive and optimise the configuration of WMN, directly deployed at the Edge, achieving advances for navigation services.
Abstract: Navigation Systems are challenging software solutions that can support users who move in unknown environments. In this context, Bluetooth Beacons can strongly benefit of Mesh configuration for the deployment of new efficient mobility services in Edge computing and Internet of Things (IoT) scenarios. In this paper, we investigate how to use the Wireless Mesh Network (WMN) concept for improving the indoor and outdoor Navigation Systems using low-cost Bluetooth devices. This scientific work is preparatory for the adoption of Machine Learning algorithms that will drive and optimise the configuration of WMN, directly deployed at the Edge, achieving advances for navigation services. Detailed analysis of Bluetooth Low Energy (BLE) signal propagation in both indoor and outdoor scenarios are reported, representing the starting point for forthcoming developments. Specifically, our analysis shows how BLE interference among beacons depends on the distance among beacons and transmitting power, and this open new opportunities in designing new optimization strategies to be executed at the Edge.
TL;DR: The proposed eSNAP method combines available digitized building planning/design information with theories of the Euclidean distance matrices and combinatorial optimization to enable the automatic configuration of IoT nodes and leverage the channel and time diversities of the received signal measurements obtained by off-the-shelf wireless RF modules to enhance the positioning accuracy over time.
Abstract: The configuration of sensor nodes in Internet-of-Things (IoT) systems is a time-consuming and labor-intensive process, often due to the lack of user interfaces in embedded sensor devices or the large number of nodes in a network. A crucial step in configuring an IoT node is mapping its identification (ID) to its physical location within the deployment area. This step is more pronounced in lighting systems, where both lighting control and sensing data need to be supported. In this article, we propose, eSNAP , an ID-location mapping method that enables the automatic configuration of wireless sensor nodes in connected lighting systems. Such mapping allows setting up and maintaining a secure and reliable IoT network with little human intervention, while providing valuable contextual information for the sensor data, which is critical in most IoT applications, including lighting. Our proposed method combines available digitized building planning/design information with theories of the Euclidean distance matrices and combinatorial optimization to enable the automatic configuration of IoT nodes. Furthermore, we leverage the channel and time diversities of the received signal measurements obtained by off-the-shelf wireless RF modules to enhance the positioning accuracy over time. We evaluate and validate the proposed method using state-of-the-art wireless mesh networking standards on two real-world setups: 1) a 30-node lab setup implemented using the Bluetooth mesh standard-compliant embedded platform and 2) a real-world connected lighting system based on ZigBee mesh in a corporate office building.