Nodes In Wireless Mesh Networks Research Articles

Secure routing protocol based on dynamic reputation and load balancing in wireless mesh networks

Aiming at the characteristics of dynamic topology change and vulnerability of wireless mesh networks (WMN), a secure routing protocol based on dynamic reputation and load balance (SRP-DRLB) is proposed to improve the routing security and load balance. By dynamically predicting of the reputation and traffic of the node in WMN, SRP-DRLB adopts edge weight strategy and node load idleness to avoid the competitive access of a large number of data packets to nodes with high reputation. SRP-DRLB dynamically adjusts routes according to the real-time status of network nodes’ reputation and traffic, reducing the impact of malicious nodes on the network and the overload of high-reputation nodes, thus improving the identification rate of malicious nodes and node load balancing. Simulation results show that SRP-DRLB can effectively ensure the security of data transmission, and it has the advantages of improving the identification rate of malicious nodes, the success rate of packet transmission and avoiding network congestion.

Application of Fiedler Value for Mitigation of Loss of Connectivity in Wireless Mesh Networks

This paper proposes a new scheme for very fast detection of a sensor going offline or loss of connectivity of sensor in Wireless Mesh Networks (WMN) in order to avoid any packet loss. A sensor is declared offline by a gateway if it does not receive any packet from the sensor for a specific time interval termed as keep-alive time. In mesh networks, this keep-alive window is kept for a very long duration; sometimes it is as high as 2.5 to 3 hours. The time duration is kept high so that gateway does not declare a sensor that is in deep sleep to conserve battery, as offline. However, keeping a large keep-alive time window leads to the very likely possibility of missing the timely detection of a critical event like a smoke sensor or gas leak sensor going offline. In the proposed method, the gateway maintains its table of neighbourhood matrix in order to facilitate fast and efficient tracking as well as tracing of the nodes for the detection of the loss of connectivity of a sensor. A Laplacian matrix formulation proposed by Fiedler is invoked for tracking and tracing lost nodes of WMN. Through the Fiedler value, this paper substantiates the efficacy of monitoring a large WMN not only for its algebraic connectivity but also to compute the number of disconnected partitions in it. This is achieved through the number of null values of eigenvalues of the Laplacian matrix of the graph of WMN. Through simulation studies, this paper demonstrates achieving an 88 % success rate in the detection of disconnection with an average latency of 39.806 ms. On the contrary, a conventional process for the time duration after which a sensor can be declared offline might be an hour or even more depending upon the pre-set duration of the keep-alive time window.

Security in IoT Mesh Networks Based on Trust Similarity

Internet of Things (IoT) Mesh networks are becoming very popular to enable IoT devices to communicate without relying on dedicated PC services. Internet of Things (IoT) implicitly uses mesh networks. IoT connectivity to cloud and edge computing is in vogue. A Wireless Mesh Network (WMN) is a multi-hop and distributed wireless network with mesh routers and mesh clients. Data originating from mesh clients are forwarded to destinations through mesh routers. In IoT Mesh networks, mesh clients are IoT devices. The crucial security issue with these networks is the lack of a trusted third party for validation. However, trust between nodes is required for the proper functioning of the network. WMNs are particularly vulnerable as they rely upon cooperative forwarding. In this research work, a secure and sustainable novel trust mechanism framework is proposed. This framework identifies the malicious nodes in WMNs and improves the nodes’ cooperation. The proposed framework or model differentiates between legitimate and malicious nodes using direct trust and indirect trust. Direct trust is computed based on the packet-forwarding behavior of a node. Mesh routers have multi radios, so the promiscuous mode may not work. A new two-hop mechanism is proposed to observe the neighbors’ packet forwarding behavior. Indirect trust is computed by aggregating the recommendations using the weighted D-S theory, where weight is computed using a novel similarity mechanism that correlates the recommendations received from different neighbors. Dynamic weight computation calculates the overall trust by using several interactions. We present the evaluations to show the effectiveness of the proposed approach in the presence of packet drop/modification attacks, bad-mouthing attacks, on-off attacks, and collusion attacks by using the ns-2 simulator.

Distributed optimal congestion control and channel assignment in wireless mesh networks

Wireless mesh networks have numerous advantages in terms of connectivity as well as reliability. Traditionally the nodes in wireless mesh networks are equipped with single radio, but the limitations are lower throughput and limited use of the available wireless channel. In order to overcome this, the recent advances in wireless mesh networks are based on multi-channel multi-radio approach. Channel assignment is a technique that selects the best channel for a node or to the entire network just to increase the network capacity. To maximize the throughput and the capacity of the network, multiple channels with multiple radios were introduced in these networks. In the proposed system, algorithms are developed to improve throughput, minimise delay, reduce average energy consumption and increase the residual energy for multi radio multi-channel wireless mesh networks. In literature, the existing channel assignment algorithms fail to consider both interflow and intra flow interferences. The limitations are inaccurate bandwidth estimation, throughput degradation under heavy traffic and unwanted energy consumption during low traffic and increase in delay. In order to improve the performance of the network distributed optimal congestion control and channel assignment algorithm (DOCCA) is proposed. In this algorithm, if congestion is identified, the information is given to previous node. According to the congestion level, the node adjusts itself to minimise congestion.

Adaptive Mechanism for Discovering Internet Gateways in Wireless Networks Using Swarm Intelligence

One of the most critical and challenging processes is the provision of internet connectivity for nodes in Wireless Mesh Networks (WMN) or mobile ad hoc networks (MANET). A wide variety of “business and non-commercial” applications are implemented in MANET, most of them gaining Internet resources. Gateway (GW) or Mesh GWs are the key components of MANET's Internet connectivity, and multiple GWs are implemented to improve MANET's capabilities. Many of the current routing protocols are implemented and improved to work with MANET, either using traditional routing approaches or tree-based network approaches. But since MANET is a complex and transient network, it is very necessary to explore new or tack the GWs failure that adds more overhead on the network. Thus, in this paper a hybrid protocol inspired by the swarm intelligence technique that follows the non-root GWs discovery approach using Ant Colony Optimization (ACO) is suggested. The experimental results validate the processes of exploring new GWs, testing and maintaining existing paths to GWs, exploring different paths to existing GWs and detecting any connection failure in any route, and attempting to fix that failure.

Robust Beamforming Design for SWIPT-Based Multi-Radio Wireless Mesh Network with Cooperative Jamming

Wireless mesh networks (WMNs) can provide flexible wireless connections in a smart city, internet of things (IoT), and device-to-device (D2D) communications. The performance of WMNs can be greatly enhanced by adopting a multi-radio technique, which enables a node to communicate with more nodes simultaneously. However, multi-radio WMNs face two main challenges, namely, energy consumption and physical layer secrecy. In this paper, both simultaneous wireless information and power transfer (SWIPT) and cooperative jamming technologies were adopted to overcome these two problems. We designed the SWIPT and cooperative jamming scheme, minimizing the total transmission power by properly selecting beamforming vectors of the WMN nodes and jammer to satisfy the individual signal-to-interference-plus-noise ratio (SINR) and energy harvesting (EH) constrains. Especially, we considered the channel estimate error caused by the imperfect channel state information. The SINR of eavesdropper (Eve) was suppressed to protect the secrecy of WMN nodes. Due to the fractional form, the problem was proved to be non-convex. We developed a tractable algorithm by transforming it into a convex one, utilizing semi-definite programming (SDP) relaxation and S-procedure methods. The simulation results validated the effectiveness of the proposed algorithm compared with the non-robust design.

Magnify Qos with Tabu & Link Scheduling In Wmn

Wireless mesh networks(WMN) are remarkably endowed knowledge and steadfastness a progressively more imperative arrangement in impending cohort wireless mobile networks. A node in WMN act as both patron and attendant and convey data using hop by hop transmission. The preponderance urbane quality of WMN is scalability, and hence the prime problem is interference. We put self-assured a narrative technique to prolong route using TABU optimization(TSO) and stalk by link scheduling to shrivel interference and consequently swelling Quality Of Services(QOS). The investigational upshot shows arbitrator to the existing loom our new proposed method show increase in QOS.

Software Defined Wireless Mesh Network Flat Distribution Control Plane

Wireless Mesh Networks (WMNs), have a potential offering relatively stable Internet broadband access. The rapid development and growth of WMNs attract ISPs to support users’ coverage anywhere anytime. To achieve this goal network architecture must be addressed carefully. Software Defined Networking (SDN) proposes new network architecture for wired and wireless networks. Software Defined Wireless Networking (SDWN) has a great potential to increase efficiency, ease the complexity of control and management, and accelerate technology innovation rate of wireless networking. An SDN controller is the core component of an SDN network. It needs to have updated reports of the network status change, as in network topology and quality of service (QoS) in order to effectively configure and manage the network it controls. In this paper, we propose Flat Distributed Software Defined Wireless Mesh Network architecture where the controller aggregates entire topology discovery and monitors QoS properties of extended WMN nodes using Link Layer Discovery Protocol (LLDP) protocol, which is not possible in multi-hop ordinary architectures. The proposed architecture has been implemented on top of POX controller and Advanced Message Queuing Protocol (AMQP) protocol. The experiments were conducted in a Mininet-wifi emulator, the results present the architecture control plane consistency and two application cases: topology discovery and QoS monitoring. The current results push us to study QoS-routing for video streaming over WMN.

Forwarding with Prediction over Machine Learning based Nodes in Wireless Mesh Networks

As part of the next generation Internet, Wireless Mesh Networks have emerged as a key technology to deliver Internet broadband access, wireless local area network coverage and network connectivity at low costs. The capacity of a wireless mesh network is improved by equipping mesh nodes with multi-radios tuned to non-overlapping channels. Hence the data forwarding between two nodes has multiple selections of links and the bandwidth between the pair of nodes varies dynamically. The new technology makes mesh nodes cognitive, thus a mesh node is able to adopt machine learning mechanisms to choose the possible best next hop which has maximum bandwidth when it intends to forward data. In this paper, we present a new forwarding algorithm by which a forwarding node dynamically select its next hop with highest potential bandwidth capacity to resume communication based on learning algorithm. The efficiency of this approach is that a node only maintains three past status, and then it is able to learn and predict the potential bandwidth capacities of its links. Then, the node selects the next hop with potential maximal link bandwidth. Additionally, a geometrical based algorithm is developed to let the forwarding node figure out the best forwarding region in order to avoid flooding. Simulations demonstrate that our approach significantly outperforms peer algorithms.

SUSTAIN ROUTE BY TABU AND AMPLIFING QOS WITH DISTRIBUTED SCHEDULING IN WMN

Wireless mesh networks (WMN) are exceedingly gifted technology and will play a progressively more imperative position in upcoming generation wireless mobile networks. A node in WMN act as both client and server and transmits data using hop by hop transmission. The majority sophisticated feature of WMN is scalability, and hence the foremost problem is interference. We put forward a novel technique to maintain route using TABU optimization (TSO) and trail by distributed scheduling to shrink interference and hence mounting Quality Of Services (QOS). The experimental results shows compared to the existing approach our new proposed method shows increase in QOS.

Escalating quality of services with channel assignment and traffic scheduling in wireless mesh networks

Wireless mesh networks (WMN) is an budding technology that provides affluent assortment of applications that engross in future generation networking technologies. WMN is promising network habitually considered for its architecture due to its adaptability of its node. A node in WMN acts as a client and as well as a server processing hop by hop transmission. We minimize delay using Tabu search optimization and followed by traffic scheduling enhancing the quality of services in WMN. The simulation results prove our proposed work achieved in many quality of services.

Securing Locations of Mobile Nodes in Wireless Mesh Network’s

The current deployment of wireless mesh networks requires mobility management to track the current locations of mobile nodes around the network without service interruption. To do so, the Hierarchical Mobile IPv6 protocol has been chosen, which minimises the required signalling by introducing a new entity called the mobile anchor point to act as a local home agent for all visiting mobile nodes in a specific domain. It allows a mobile node to register its local/regional care-of addresses with a mobile anchor point by sending a local binding update message. However, the local binding update is quite sensitive; it modifies the routing to enable mobility in the wireless mesh networks. When a local binding update message is spoofed, an attacker can redirect traffic that is destined for legitimate mobile node either to itself or to another node. This situation leads to an increased risk of attacks. Therefore, this paper contributes to addressing this security issue based on wireless mesh networks by cryptography generation and verification of a mobile node’s local and regional care-of addresses, as well as the application of a novel method to verify the reachability of mobile node at claimed local care-of address. This is called the enhanced mobile anchor point registration protocol. The Scyther tool has been used to ensure the proposed protocol accuracy. Furthermore, the performance, in terms of the mobile anchor point registration delay and signalling overhead, is evaluated by using the OPNET modeller simulator.

Firefly load balancing based energy optimized routing for multimedia data delivery in wireless mesh network

The traffic in wireless mesh network (WMN) is unbalanced. Therefore, few nodes take more data than the other which causes congestion and packet loss and also affects the transmission performance. Thus, there is a need for load balancing technique to improve routing performance. Few research works have been developed for balancing the load of node in WMN. However, conventional technique does not provide an optimal solution for achieving high throughput and reducing the energy consumption (EC). In order to overcome such limitation, firefly load balancing based energy optimized routing (FLB-EOR) technique is proposed. The FLB-EOR technique is designed for load balancing while delivering multimedia data from the source node to destination with minimum EC in WMNs. The FLB-EOR technique initially used FLB algorithm in order to control the multimedia data congestion over a WMN by considering the load of mesh node. With aid of FLB algorithm, FLB-EOR technique discovers the minimal load weightage nodes in network for transmitting multimedia data which resulting in improved throughput and load balancing efficiency (LBE). After finding the minimal weightage nodes, gravitational neighbour-node selection algorithm is used to find the nearest neighbor for sending the multimedia data from source to destination. In gravitational neighbour-node selection algorithm, distance between the nodes is calculated for finding optimal nearest neighbour node to route multimedia data to destination. This helps to reduce the EC and to increase the network lifetime. The FLB-EOR technique conducts simulation works on factors such as throughput, LBE, EC, network lifetime and end to end delay. The simulation results illustrate that the FLB-EOR technique is able to increases the LBE and also reduces the EC of multimedia data delivery when compared to state-of-the-art works.

Link State Routing Based on Compressed Sensing

In table routing protocols such as link state routing, every node in the network periodically broadcasts its link state and the state of its neighbors. These routing updates result in the transmission of a large number of packets. Some of these packets contain correlated or even redundant data which could be compressed if there is central management in the network. However, in autonomous networks, each node acts as a router, in which case central coordination is not possible. In this paper, compressed sensing is used to reduce routing traffic overhead. This can be done at nodes which have greater processing capabilities and no power consumption limitations such as backbone nodes in wireless mesh networks. A method is proposed to select a subset of nodes and thus a subset of links to probe their state. The sensed states are encoded to generate a low dimension sampled vector. This compressed link state vector is broadcast to the entire network. Nodes can then reconstruct link states from this vector using side information. Performance results are presented which demonstrate accurate anomaly detection while adapting to topology changes. Further, it is shown that a proper choice of weighting coefficients in the sampling process can improve detection performance.

Performance of Implementation IBR-DTN and Batman-Adv Routing Protocol in Wireless Mesh Networks

Wireless mesh networks is a network which has high mobility and flexibility network. In Wireless mesh networks nodes are free to move and able to automatically build a network connection with other nodes. High mobility, heterogeneous condition and intermittent network connectivity cause data packets drop during wireless communication and it becomes a problem in the wireless mesh networks. This condition can happen because wireless mesh networks use connectionless networking type such as IP protocol which it is not tolerant to delay. To solve this condition it is needed a technology to keep data packets when the network is disconnect. Delay tolerant technology is a technology that provides store and forward mechanism and it can prevent packet data dropping during communication. In our research, we proposed a test bed wireless mesh networks implementation by using proactive routing protocol and combining with delay tolerant technology. We used Batman-adv routing protocol and IBR-DTN on our research. We measured some particular performance aspect of networking such as packet loss, delay, and throughput of the network. We identified that delay tolerant could keep packet data from dropping better than current wireless mesh networks in the intermittent network condition. We also proved that IBR-DTN and Batman-adv could run together on the wireless mesh networks. In The experiment throughput test result of IBR-DTN was higher than Current TCP on the LoS (Line of Side) and on environment with obstacle.Keywords: Delay Tolerant, IBR-DTN, Wireless Mesh, Batman-adv, Performance

Chanel assignment optimization algorithm based on link throughput and node priority

How to reduce interference among neighbor nodes in wireless mesh networks is still an important and key issue nowadays. In this paper, an optimized channel assignment algorithm (OCA) is proposed to solve this problem based on link throughput and node priority. The effects of the numbers of network interface cards and channels on the network throughput are analyzed and evaluated. When there are seven of the numbers of both network interface cards and channels, the efficiency of utilizing network interface card and channel reaches highest. Compared with centralized channel assignment algorithm (CCA), the proposed algorithm has less packet loss rate and more network throughput significantly.

무선 메쉬 네트워크에서 라우터 노드 배치를 위한 타부 서치 알고리즘

ABSTRACT This paper proposes a Tabu search algorithm to maximize the connectivity between the router nodes and the client nodes in wireless mesh networks. As the number of the router nodes and the client nodes in the networks increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time for a high-density network, we propose a Tabu search algorithm to obtain the optimal solution for maximizing the connectivity. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the maximum number of the connectivity and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms. 키워드 : 무선 메쉬 네트워크, 타부 서치, 라우터 노드 배치, 최적화 Key word : Optimization, router node placement, tabu search, wireless mesh networksJournal of the Korea Institute of Information andCommunication Engineering

SIR 향상 다중 노드용 UCA 빔 형성 전력 할당 방법

본 논문에서는 원형 배열 안테나를 사용한 무선 메쉬 네트워크 LOS 환경에서 다중 노드 빔 형성을 위한 SIR 향상 빔 형성 전력 할당 기법을 제안한다. 제안된 방법은 다중 노드 접속을 위한 다중 노드 빔 형성 시 존재하는 전력 제한 조건을 만족시키며 송신 전력이 최대화되는 다중 빔 전력 할당 기법이다. 전산 모의 실험을 통하여 제안 한 빔 형성 전력 할당을 적용하였을 때 UCA 안테나에서 기존의 방법보다 다중 노드의 SIR이 향상됨을 확인하였다. This paper proposes a power allocation method for multiple node beamforming with uniform circular array antennas to increase SIR of nodes in wireless mesh network. The proposed method calculates beamforming power allocation vectors that maximizes SIR satisfied with power constraint of HPA. The simulation results demonstrate the proposed method achieves the enhanced SIR of nodes than that of beamforming method.

Joint anti-attack scheme for channel assignment in multi-radio multi-channel wireless mesh networks

Nowadays, multi-radio multi-channel wireless mesh networks have been widely exploited to provide high-speed Internet access. By assigning different channels, the interference between wireless mesh network nodes can be greatly reduced, leading to a better network performance. However, the channel assignment attacks have imposed a serious security problem, where the diverse messages, that is, Channel Usage Message CUM, Channel Change Message CCM, Channel Switch Operation CSO and Security Alarm Message SAM, are often used to launch attacks by the malicious nodes in order to disturb the normal channel assignment and thus the overall network performance. In this paper, we propose a joint anti-attack scheme JAS against the channel assignment attacks. Our JAS is composed of four key components: CUM, CCM, CSO and SAM defense schemes to protect the channel assignment. The CUM defense scheme verifies the CUM messages and their sender. The CCM defense scheme employs three rounds of CCM verifications. Furthermore, three control messages are exploited by the CSO defense scheme. The SAM defense scheme offers two rounds of verification for the alarm messages. Moreover, we apply our JAS to a popular distributed channel assignment algorithm, that is, Hyacinth. Through extensive simulation, the performance of the proposed scheme is evaluated by comparing with SeCA and SmartC in terms of Goodput and additional overhead. Observed from the simulation results, our scheme is demonstrated to outperform the best-known secure channel assignment algorithms. Copyright © 2014 John Wiley & Sons, Ltd.

ALLEVIATE EXPOSED NODE ISSUES IN WIRELESS MESH NETWORK (WMN) USING A NOVEL APPROACH OF CONCURRENT MEDIUM ACCESS CONTROL (C-MAC) PROTOCOL

The importance and high growth of the communication infrastructure is clearly stated under the Malaysia Economic Transformation Programme (ETP). The most popular technology that used to provide the internet service to public is the IEEE 802.11a/b/g/n based WiFi. However, the coverage provided by the WiFi technology is only limited up to certain range. In addition, the performance of the WiFi network also will become poorer and poorer as the number of users associate with that WiFi network increases. In order to address these issues, the best topology configuration known as mesh is proposed by wireless research community. This technology is also called as Wireless Mesh Networks (WMN) and it became an emerging technology which is plays an important role in the next generation wireless communication. However, the implementation of IEEE 802.11 Medium Access Control (MAC) protocol in WMN significantly degrades the network performance due to the presence of exposed node problem. The presence of exposed nodes in WMN caused waiting delay (prevent the surrounding neighboring nodes to involve in transmission activity for entire duration of ongoing transmission) and it is subsequently leads to poor throughput achievement. The significance of this research is to investigate the cause of exposed nodes that degrade the performance of WMN and proposed a novel protocol to solve it to provide better network performance and throughput.