Multi-hop Wireless Connectivity Research Articles

EdgeML: Towards network-accelerated federated learning over wireless edge

Federated learning (FL) is a distributed machine learning technology for next-generation AI systems that allows a number of workers, i.e., edge devices, collaboratively learn a shared global model while keeping their data locally to prevent privacy leakage. Enabling FL over wireless multi-hop networks can democratize AI and make it accessible in a cost-effective manner. However, the noisy bandwidth-limited multi-hop wireless connections can lead to delayed and nomadic model updates, which significantly slows down the FL convergence speed. To address such challenges, this paper aims to accelerate FL convergence over wireless edge by optimizing the multi-hop federated networking performance. In particular, the FL convergence optimization problem is formulated as a Markov decision process (MDP). To solve such MDP, multi-agent reinforcement learning (MA-RL) algorithms along with domain-specific action space refining schemes are developed, which online learn the delay-minimum forwarding paths to minimize the model exchange latency between the edge devices (i.e., workers) and the remote server. To validate the proposed solutions, EdgeML is developed and implemented, which is the first experimental framework in the literature for FL over multi-hop wireless edge computing networks. EdgeML allows us to fast prototype, deploy, and evaluate novel FL algorithms along with RL-based system optimization methods in real wireless devices. Moreover, a physical experimental testbed is implemented by customizing the widely adopted Linux wireless routers and ML computing nodes. Such testbed can provide valuable insights into the practical performance of FL in the field. Finally, our experimentation results on the testbed show that the proposed network-accelerated FL system can practically and significantly improve FL convergence speed, compared to the FL system empowered by the production-grade commercially-available wireless networking protocol, BATMAN-Adv.

Q-Learning and MADMM Optimization Algorithm Based Interference Aware Channel Assignment Strategy for Load Balancing in WMNS

Wireless Mesh Networks (WMNs) have been considered one of the main technologies for configuring wireless machines since they appeared. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts on the network and allow access to the internet through the gateway routers. These wireless routers are normally equipped with the multiple radios in the wireless mesh network that operate on multiple channels with the multiple interference, which is caused to reduce the network performance and end-to-end delay. In this paper, we proposed an efficient optimization algorithm to solve the channel assignment problem which cause due to the multichannel multiradios in WMN’s. The main objective of our paper is to minimize the channel interference among networked devices. So, initially we construct a multicast tree with minimum interference by using Q-Learning algorithm, which is helps to minimize the end-to-end delay of packet delivery. From the constructed multicast tree, we intend to develop a channel assignment strategy with the minimum interference by using Modified version of Alternative Direction Method of Multipliers (MADMM) optimization algorithm, which is helps to increase the network throughput and packet delivery ratio. The proposed strategy was implemented by using NS-2 (Network Simulator-2) and the experimental result show that the performance of the proposed method is very high compared to the other method and the performance was calculated by using the feature metrics such as average throughput, packet delivery ratio, end-toend delay and total cost, which is compared with the other existing channel assignment strategies such as Learning Automata and Genetic Algorithm (LA-GA), GA-based approach, link-channel selection and rate-allocation (LCR) and learning automata based multicast routing (LAMR) channel assignment methods.

Spatial Firewalls: Quarantining Malware Epidemics in Large-Scale Massive Wireless Networks

Billions of wireless devices are foreseen to participate in big data aggregation and smart automation in order to interface the cyber and physical worlds. Such large-scale ultra-dense wireless connectivity is vulnerable to malicious software (malware) epidemics. Malware worms can exploit multihop wireless connectivity to stealthily diffuse throughout the wireless network without being noticed by security servers at the core network. Compromised devices can then be used by adversaries to remotely launch cyber attacks that cause large-scale critical physical damage and threaten public safety. This article overviews the types, threats, and propagation models for malware epidemics in large-scale wireless networks (LSWNs). Then the article proposes a novel and cost-efficient countermeasure against malware epidemics in LSWNs, called spatial firewalls. It is shown that equipping a strategically selected small portion (i.e., less than 10 percent) of the devices with state-of-the-art security mechanisms is sufficient to create spatially secured zones that quarantine malware epidemics. Quarantined infected devices are then cured by on-demand localized software patching. To this end, several firewall deployment strategies are discussed and compared.

New algorithm of multi-strategy channel allocation for edge computing

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.

Resource Allocation and Node Placement in Multi-Hop Heterogeneous Integrated-Access-and-Backhaul Networks

We consider a heterogeneous MIMO-OFDMA based dense small cell (SC) system in which each macro cell base station (MBS) serves its coverage area with the help of small cell base stations (SBSs) through multi-hop wireless connections. The SBSs act as integrated access and backhaul (IAB) nodes that handle both access and backhaul traffics with wireless links. We first develop an optimal (sum-rate maximization) resource allocation (RA) algorithm which considers subcarriers/spatial subchannels assignment and the associated power allocations. We also present two low-complexity suboptimal RA schemes which, as verified by simulations, incur only minor performance loss in the high SNR region. Our RA algorithms can be applied to other multi-hop networks with general UE association rule and node location distributions. We study the channel aging effect caused by the time lag between the time channel state information (CSI) is measured and that when data transmission occurs. We show the benefit of channel prediction and the limit of a centralized RA approach. The advantages of frequency (channel) reuse and the multi-hop architecture are demonstrated as well. A related but perhaps more important system design issue for an IAB cellular network is the IAB node placement problem. With the given UE association rule and UE location distribution, we present systematic approaches to find the optimal node locations. For two special propagation models, we derive closed-form expressions for the node locations that maximizes a spectral efficiency lower bound. Numerical results validate the accuracy of our estimates based on either numerical evaluations or closed-form solutions.

Performance Assessment and Comparison of Efficient Ad Hoc Reactive and Proactive Network Routing Protocols

The research on mobile ad hoc networks is intensively attracted by the research community due to their good characteristic of multi-hop wireless connectivity and energetically altering network topology. It collects infra-structure less mobile nodes building a temporary network without any centralized administration. So far, numbers of ad hoc routing protocols were developed and executed. The simulation work has been performed to access the performance of ad hoc on-demand distance vector routing (AODV), dynamic source routing (DSR) and wireless routing protocol (WRP). Hence, GloMoSim simulator was used to perform the simulations. The author adopted two dissimilar scenarios, namely, 50 and 100 nodes, with rectangular area sizes of 1500 × 1000 and 2000 × 1500 m2, respectively, to estimate the impact of network size on the performances. Simulation findings demonstrated that for definite differentials, WRP shows an enhanced performance than the other two protocols such as DSR and AODV.

Performance comparision of mobile Ad-Hoc network using routing protocols

Selection of the protocols and path routing are the most common strategies that are to be focused while designing any kind of wireless networks such as MANETs and VANETs. MANETs are basically characterized as frequently changing network topology, multi-hop wireless connectivity and an efficient dynamic routing protocol. In MANETs, the protocol is selected on the basis of how the data is delivered and how its integrity is maintained. Hence, before making the selection of any routing protocol we should make the performance analysis of various routing protocol. In this paper, performance analysis of various routing protocols Ad-hoc On-Demand Distance Vector (AODV), Distance source routing (DSR) and Destination Sequenced Distance Vector (DSDV) are carried out using NS2 simulator. We compare the performance of these routing protocols on the basis of various parameters such as throughput, packet delivery ratio, delay and energy consumption.

Energy-based efficient authenticated routing protocol for MANETs for DDOS attacks with minimised power consumption

In MANET, reliable and secure communication is the most challenging task. Mobile ad hoc network (MANET) is characterised by mobile hosts, dynamic topology, multi-hop wireless connectivity and infrastructure less ad hoc environment. Limited resource availability such as battery power and security are the major issues to be handled with mobile ad hoc networks. An attacker can easily disrupt the functioning of the network by attacking the underlying routing protocol. Hence, security in ad hoc networks is still a debatable area. In this paper, we have proposed energy-based efficient authenticated routing protocol (EBEARP) for mobile ad hoc networks. Our protocol provides efficient security against route discovery attacks using hop-by-hop signatures. It quickly detects the malicious nodes, thus assisting the nodes to drop the invalid packets, earlier. It also uses an efficient node selection mechanism, which maximises network life time and minimises power consumption. With the help of detailed simulation studies, we show that EBEARP provides better packet delivery ratio with minimised energy.

Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network.

Wireless mesh networks (WMNs) have been considered as one of the key technologies for the configuration of wireless machines since they emerged. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts in the network and also allow them to access the Internet via gateway devices. Wireless routers are typically equipped with multiple radios operating on different channels to increase network throughput. Multicast is a form of communication that delivers data from a source to a set of destinations simultaneously. It is used in a number of applications, such as distributed games, distance education, and video conferencing. In this study, we address a channel assignment problem for multicast in multi-radio multi-channel WMNs. In a multi-radio multi-channel WMN, two nearby nodes will interfere with each other and cause a throughput decrease when they transmit on the same channel. Thus, an important goal for multicast channel assignment is to reduce the interference among networked devices. We have developed a minimum interference channel assignment (MICA) algorithm for multicast that accurately models the interference relationship between pairs of multicast tree nodes using the concept of the interference factor and assigns channels to tree nodes to minimize interference within the multicast tree. Simulation results show that MICA achieves higher throughput and lower end-to-end packet delay compared with an existing channel assignment algorithm named multi-channel multicast (MCM). In addition, MICA achieves much lower throughput variation among the destination nodes than MCM.

Performance Analysis of AODV, CBRP, AOMDV, DSR MANET Routing Protocol using NS2 Simulation

Mobile ad hoc network is a self-directed structure of mobile nodes connected by wireless links. All nodes operate not only as an end system, but also as work as a router to forward the packets. Ad hoc wireless networks are characterized by multihop wireless connectivity, infrastructure less and habitually changing topology. It may be necessary for one mobile node to schedule other hosts for forwarding a packet from source to destination node due to the constrained transmission range of wireless network interfaces. Therefore a self-motivated routing protocol is required for these networks to work properly. A number of Routing protocols have been created to achieve this task. In this paper, a comparative analysis of four reactive routing protocols namely AODV, AOMDV, DSR and CBRP is done. Here CBRP is also a hierarchical routing protocol. This paper is aimed to analyze the adequacy of considered routing protocols in an energy constrained environment under varying mobility and pause time. These protocols have been analyzed extensively for various performance parameters (energy consumption, delay, throughput, Packet Delivery Ratio etc.) over different network scenarios. Simulation results show that none of the protocol surpasses other for all considered scenarios. However, CBRP has produced better results in terms of throughput, normalized routing load and delay while AOMDV is a better choice for energy related parameters. Simulation results of the paper are very helpful for the wise selection of the energy efficient base routing approach to scale MANETs.

Performance Comparison of AODV/DSR On-Demand Routing Protocols for Ad Hoc Networks

Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. I compare the performance of two prominent on demand routing protocols for mobile ad hoc networks—Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV). We demonstrate that even though DSR and AODV share similar on-demand behaviour, the differences in the protocol mechanics can lead to significant performance differentials. The AODV out-perform DSR in the normal situation but in the constrained situation DSR out-performs AODV, the degradation is as severe as (30%) in AODV whereas DSR degrades marginally (10%) as observed through simulation [7].

Energy Efficient and Load Balanced Routing for Wireless Multihop Network Applications

Wireless Sensor Networks (WSNs) can benefit from ad hoc networking technology characterized by multihop wireless connectivity and infrastructure less framework. These features make them suitable for next-generation networks to support several applications such M2M applications for smart cities and public safety scenarios. Pivotal design requirements for these scenarios are energy efficiency, since many of these devices will be battery powered placing a fundamental limit on network, and specifically node lifetime. Moreover, the way in which traffic is managed also influences network lifetime, since there is a high probability for some nodes to become overloaded by packet forwarding operations in order to support neighbour data exchange. These issues imply the need for energy efficient and load balanced routing approaches that can manage the network load and not only provide reduced energy consumption on the network but also prolong the network lifetime providing robust and continuous. This work proposes a new energy efficient and traffic balancing routing approach that can provide a weighted and flexible trade-off between energy consumption and load dispersion. Simulation results show that the proposed protocol achieves high energy efficiency, decreases the percentage of failed nodes due to lack of battery power, and extends the lifespan of the network.

A STUDY AND COMPARISON OF OLSR, AODV AND ZRP ROUTING PROTOCOLS IN AD HOC NETWORKS

A mobile ad hoc networks (MANET) is characterized b y multihop wireless connectivity consisting of inde pendent nodes which move dynamically by changing its network connectivity without the uses of any pre-ex istent infrastructure. MANET offers[1, 2] such flexibility which helps the network to form anywhe re, at any time, as long as two or more nodes are c onnected and communicate with each other either directly when they are in ra dio range or via intermediate mobile nodes. Routing is a significant issue and challenge in ad hoc networks and many routing proto cols have been proposed like OLSR, AODV, DSDV,DSR, ZRP, and TORA, LAR so far to improve the routing performance and relia bility. This research paper describes the character istics of ad hoc routing protocols OLSR, AODV and ZRP based on the performan ce metrics like packet delivery ratio, end‐to‐end d elay, throughput and jitter by increasing number of nodes in the network . This comparative study proves that OLSR, ZRP perf orms well in dense networks in terms of low mobility and low traffic but in hig h mobility and high traffic environment ZRP perform s well than OLSR and AODV.

Experimental Characterization of Channel Selection and Multi-Hops in Wireless Mesh Network

Wireless Mesh Network (WMN) is able to extend the coverage of the network infrastructure by multi-hop wireless connections between APs. However, full potentialities and limits of this new technology have still to be explored. In this paper, we design an experimental testbed to analyze the characterization of Channel Selection and Multi-hops in Wireless Mesh Network, we believe that the data collected by our experiments may be of interest to network designers who want to know the effective capabilities of a WMN before investing on its deployment.

A Survey paper on Comparative Analysis on Routing Protocol for Energy Efficiency in MANET

Mobile Adhoc Network (MANET) is characterized by mobile hosts, dynamic topology, multi-hop wireless connectivity and infrastructure less ad hoc environment. The adhoc environment is accessible to both legitimate network users and malicious attackers. Moreover, as the wireless links are highly errors prone and can go down frequently due to mobility of nodes, therefore, energy efficient, secure and stable routing over MANET is still a very critical task due to highly dynamic environment. Moreover, the nodes in MANETs are typically powered by batteries which have limited energy reservoir and some times it also becomes very difficult to recharge or replace the battery of the nodes. Hence, power consumption becomes an important issue. The power consumption rate of each node must be evenly distributed to maximize the lifetime of ad hoc mobile networks, and the overall transmission power for each connection request must be minimized. In this paper, we compare a two types of Mobile adhoc network i.e., proactive and reactive for Energy Efficiency in Manet. Energy Efficient is basically termed as which consume a less energy. So, this paper gives comparison about various routing protocols related to Energy Efficiency. Keywords: MANET, PROACTIVE, REACTIVE, Network

Performance Evaluation of the IBETX Routing Metric Over DSDV Routing Protocol in Wireless Ad hoc Networks

Abstract Wireless ad-hoc networks are characterized by a collection of wireless mobile nodes that dynamically form a temporary network without the use of any pre-defined network infrastructure or centralized administration. They have attributes such multi-hop wireless connectivity, continuously changing topology and easy deployment. The increasing demands that are made by users pose a challenge in the improvement of the quality of wireless ad-hoc networks. The performance of wireless ad-hoc networks depend on the efficiency of routing protocols, especially the routing metric operating within it. In this paper, the performance of the recently proposed routing metric Interference Bandwidth Adjusted Expected transmission count (IBETX) metric is compared with two prominent existing metrics, the Expected transmission count (ETX) and the Inverse Expected Transmission count (InvETX) over the Destination Sequenced Distance Vector (DSDV) routing protocol. The performance differentials are analysed using varying packet rates and node densities. From the simulations results, IBETX metric outperforms the ETX and InvETX metric because it implements the bandwidth sharing mechanism and makes use of the information available at the MAC layer. It can also be noted that it is very sensitive to data traffic rate. It performs well in low and medium node densities.

Capacity Based Multicast Channel Assignment in Wireless Mesh Network

Wireless mesh networking (WMN) is an emerging technology that enables multihop wireless connectivity to areas where wiring or installing cables is difficult or expensive. Multicast is a form of communication that delivers information from a source to a group of destinations. In a single-channel WMN, all nodes share and communicate with each other via the same channel. In such a network, the throughput capacity of multicast degrades significantly as the network size increases. A critical factor that contributes to this rapid degradation is the co-channel interference in single-channel WMNs. The major advantage of WMN is that power is not the major issue as compare to other wireless network like MANET, Sensor etc. Hence Power can be optimally utilized in WMN to increase throughput and total network efficiency. In this paper, we propose a channel assignment algorithm for multicast based on high channel capacity with minimum interference. This scheme usesall overlapping and non overlapping channel for the channel assignment. By this scheme we provide better performance in terms of average packet delivery ratio, average throughput and average end to end delay with respect to multichannel multicast channel assignment schemes.

Traffic Sensitive Dynamic Source Routing Protocol for Mobile Ad hoc Networks

Mobile Ad-Hoc Networks (MANETs) are characterized by multi-hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. Routing must maintain required paths in such an environment with an acceptable overhead. On-Demand routing protocols discover paths only when they are requested by flooding the request through the network at great cost. Caches are used to reduce the frequency of flooding route requests. Many routing protocols exist for MANETs. On-demand routing protocols have attracted more attention because of their less overhead and wide applicability. This study is on the behavior of DSR protocol, which is based entirely on on-demand behavior. Multipath routing is gaining importance as it increases reliability and aids in load balancing. More traffic than that can be handled by the IFQ of a node reduces throughput and increases routing overhead . In this work an effort is made to integrate the benefits of multipath routing and traffic sensitive routing. Simulation studies show enhanced throughput for Traffic Sensitive Dynamic Source Routing (TSDSR) when compared to DSR.

Ontological Engineering Approach towards Trust Oriented Security Framework for Adhoc Networks

Conventionally, user authentication and access control mechanisms would be almost enough, to handle security for stand-alone computers and small networks. Ad hoc networks are illustrated by multi-hop wireless connectivity and recurrently changing network topology which have made them infrastructure less. Adding trust to the existing security infrastructures would improvise the security of these environments. Describing trust relations and their sub-components using ontologies, creates a methodology and mechanism in order to efficiently design and engineer trust networks. This is going to be used as a service for providing trust for ad hoc network at any level i.e. routing, authentication or access control. A trust oriented security framework for adhoc network using ontological engineering approach is proposed by modeling ad hoc network, the OLSR (Optimized Link State Routing) protocol and trust model as OWL (Ontology Web language) ontologies, which are integrated using Jena. In this model, a trustor can calculate its trust about trustee and use the calculated trust values to make decisions depending on the context of the application or interaction about granting or rejecting it. A number of experiments with a possible implementation of suggested framework are performed to make out the characteristics of the trust model and its effect on the ad hoc network operations.

Worm_Secure Protocol for Wormhole Protection in AODV Routing Protocol

A Mobile Adhoc Network (MANET) is characterized by mobile nodes, multihop wireless connectivity, Non infrastructural environment and dynamic topology. In Ad Hoc network routing is the reactive on-demand philosophy where routes are established only when required. Stable Routing, Security and Power efficiency are the major concerns in this field. The ad hoc environment is accessible to both legitimate network users and malicious attackers. The proposed scheme named as worm_secure is intended to incorporate security aspect on existing protocols .This paper checks one of the common attack on MANET as wormhole and tries solving the situation. Scheme has been incorporated on AODV and results have been calculated using NS2.