Showing papers on "Routing protocol published in 2021"

V2VR: Reliable Hybrid-Network-Oriented V2V Data Transmission and Routing Considering RSUs and Connectivity Probability

Abstract: Vehicular ad hoc networks (VANETs) have been widely used in intelligent transportation systems (ITSs) for purposes such as the control of unmanned aerial vehicles (UAVs) and trajectory prediction. However, an efficient and reliable data routing decision scheme is critical for VANETs due to the feature of self-organizing wireless multi-hop communication. Compared with wireless networks, which are unstable and have limited bandwidth, wired networks normally provide longer transmission distances, higher network speeds and greater reliability. To address this problem, this paper proposes a reliable VANET routing decision scheme based on the Manhattan mobility model, which considers the integration of roadside units (RSUs) into wireless and wired modes for data transmission and routing optimization. First, the problems of frequently moving vehicles and network connectivity are analyzed based on road networks and the motion information of vehicle nodes. Second, an improved greedy algorithm for vehicle wireless communication is used for network optimization, and a wired RSU network is also applied. In addition, routing decision analysis is carried out in accordance with the probabilistic model for various transmission ranges by checking the connectivity among vehicles and RSUs. Finally, comprehensive experiments show that our proposed method can support real-time planning and improve network transmission performance compared with other baseline protocol approaches in terms of several metrics, including package delivery ratio, time delay and wireless hops.

Energy efficient cluster based routing protocol for WSN using butterfly optimization algorithm and ant colony optimization

Abstract: Wireless Sensor Networks (WSNs) consist of a large number of spatially distributed sensor nodes connected through the wireless medium to monitor and record the physical information from the environment. The nodes of WSN are battery powered, so after a certain period it loose entire energy. This energy constraint affects the lifetime of the network. The objective of this study is to minimize the overall energy consumption and to maximize the network lifetime. At present, clustering and routing algorithms are widely used in WSNs to enhance the network lifetime. In this study, the Butterfly Optimization Algorithm (BOA) is employed to choose an optimal cluster head from a group of nodes. The cluster head selection is optimized by the residual energy of the nodes, distance to the neighbors, distance to the base station, node degree and node centrality. The route between the cluster head and the base station is identified by using Ant Colony Optimization (ACO), it selects the optimal route based on the distance, residual energy and node degree. The performance measures of this proposed methodology are analyzed in terms of alive nodes, dead nodes, energy consumption and data packets received by the BS. The outputs of the proposed methodology are compared with traditional approaches LEACH, DEEC and compared with some existing methods FUCHAR, CRHS, BERA, CPSO, ALOC and FLION. For example, the alive nodes of the proposed methodology are 200 at 1500 iterations which is higher compared to the CRHS and BERA methods.

Efficient and Secure Routing Protocol Based on Artificial Intelligence Algorithms With UAV-Assisted for Vehicular Ad Hoc Networks in Intelligent Transportation Systems

Abstract: Vehicular Ad hoc Networks (VANETs) that are considered as a subset of Mobile Ad hoc Networks (MANETs) can be applied in the field of transportation especially in Intelligent Transportation Systems (ITS). The routing process in these networks is a challenging task due to rapid topology changes, high vehicle mobility and frequent disconnection of links. Therefore, developing an efficient routing protocol that satisfies restriction of delay and minimum overhead is faced with many difficulties and limitations. Also, the detection of malicious vehicles is a significant task in VANETs. To address these issues, using Unmanned Aerial Vehicles (UAVs) can be helpful to cope with these limitations. In this paper, operation of UAVs in ad hoc mode and their cooperation with vehicles in VANETs are studied to help in the process of routing and detection of malicious vehicles. A routing protocol named VRU is proposed that includes two distinct ways of routing of data: (1) delivering packets of data between vehicles with the help of UAVs using a protocol named VRU_vu, and (2) routing packet of data between UAVs using a protocol named VRU_u. The NS-2.35 simulator under Linux Ubuntu 12.04 is utilized in order to appraise the performance of VRU routing components in an urban scenario. Also, VanetMobiSim generator of mobility and MobiSim are used to produce the motions of vehicles and to produce the motions of UAVs, respectively. The performance analysis displays that VRU protocol can improve the packet delivery ratio by 16% and detection ratio by 7% compared to other reviewed routing protocol. Also, VRU protocol decreases end-to-end delay by an average of 13% and overhead by 40%.

The Babel Routing Protocol

Abstract: Babel is a loop-avoiding distance-vector routing protocol that is robust and efficient both in ordinary wired networks and in wireless mesh networks. This document describes the Babel routing protocol, and obsoletes RFCs 6126 and 7557.

Energy-Efficient Clustering Scheme for Flying Ad-Hoc Networks Using an Optimized LEACH Protocol

Abstract: A Flying Ad-hoc network constitutes many sensor nodes with limited processing speed and storage capacity as they institute a minor battery-driven device with a limited quantity of energy. One of the primary roles of the sensor node is to store and transmit the collected information to the base station (BS). Thus, the life span of the network is the main criterion for the efficient design of the FANETS Network, as sensor nodes always have limited resources. In this paper, we present a methodology of an energy-efficient clustering algorithm for collecting and transmitting data based on the Optimized Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. The selection of CH is grounded on the new optimized threshold function. In contrast, LEACH is a hierarchical routing protocol that randomly selects cluster head nodes in a loop and results in an increased cluster headcount, but also causes more rapid power consumption. Thus, we have to circumvent these limitations by improving the LEACH Protocol. Our proposed algorithm diminishes the energy usage for data transmission in the routing protocol, and the network’s lifetime is enhanced as it also maximizes the residual energy of nodes. The experimental results performed on MATLAB yield better performance than the existing LEACH and Centralized Low-Energy Adaptive Clustering Hierarchy Protocol in terms of energy efficiency per unit node and the packet delivery ratio with less energy utilization. In addition, the First Node Death (FND) is also meliorated when compared to the LEACH and LEACH-C protocols.

An Intelligent Route Computation Approach Based on Real-Time Deep Learning Strategy for Software Defined Communication Systems

Abstract: Software Defined Networking (SDN) is regarded as the next generation paradigm as it simplifies the structure of the data plane and improves the resource utilization. However, in current Software Defined Communication Systems (SDCSs), the maximum or minimum metric value based routing strategies come from traditional networks, which lack the ability of self-adaptation and do not efficiently utilize the computation resource in the controllers. To solve these problems, in this paper, we utilize the deep learning technique to conduct the routing computation for the SDCSs. Specifically, in our proposal, the considered Convolutional Neural Networks (CNNs) are adopted to intelligently compute the paths according to the input real-time traffic traces. To reduce the computation overhead of the central controller and improve the adaptation of CNNs to the changing traffic pattern, we consider an online training manner. Analysis shows that the computation complexity can be significantly reduced through the online training manner. Moreover, the simulation results demonstrate that our proposed CNNs are able to compute the appropriate paths combinations with high accuracy. Furthermore, the adopted periodical retraining enables the deep learning structures to adapt to the traffic changes.

UAV Communication Networks Issues: A Review

Abstract: The unmanned aerial vehicle communication networks (UAVCN) comprises of a collection of unmanned aerial vehicles (UAVs) to build a network that can be used for many applications. These nodes autonomously fly in free space in ad-hoc mode to carry out the mission. However, the UAVs face some challenging issues during collaboration and communication. These nodes have high speed, hence the communication links fail to route the traffic that affects the routing mechanism. Therefore, UAVCN communication affecting the quality of service and facing the performance issue. Power is another major problem to limit and optimize the use of power, the energy-efficient mechanism is needed. In this paper, an attempt is made to explore the issues of unmanned aerial vehicle communication networks: UAVCN characteristics, UAVCN design issues, UAVCN applications, routing protocols, quality of service, power issue and identify the future open research areas which could be considered for further research to explore the UAVCN technology.

Ant Colony Optimization Based Quality of Service Aware Energy Balancing Secure Routing Algorithm for Wireless Sensor Networks

Abstract: Existing routing protocols for wireless sensor networks (WSNs) focus primarily either on energy efficiency, quality of service (QoS), or security issues. However, a more holistic view of WSNs is needed, as many applications require both QoS and security guarantees along with the requirement of prolonging the lifetime of the network. The limited energy capacity of sensor nodes forces a tradeoff to be made between network lifetime, QoS, and security. To address these issues, an ant colony optimization based QoS aware energy balancing secure routing (QEBSR) algorithm for WSNs is proposed in this article. Improved heuristics for calculating the end-to-end delay of transmission and the trust factor of the nodes on the routing path are proposed. The proposed algorithm is compared with two existing algorithms: distributed energy balanced routing and energy efficient routing with node compromised resistance. Simulation results show that the proposed QEBSR algorithm performed comparatively better than the other two algorithms.

A Survey of Routing Protocols for Underwater Wireless Sensor Networks

Abstract: Underwater wireless sensor network (UWSN) is currently a hot research field in academia and industry with many underwater applications, such as ocean monitoring, seismic monitoring, environment monitoring, and seabed exploration. However, UWSNs suffer from various limitations and challenges: high ocean interference and noise, high propagation delay, narrow bandwidth, dynamic network topology, and limited battery energy of sensor nodes. The design of routing protocols is one of the solutions to address these issues. A routing protocol can efficiently transfer the data from the source node to the destination node in the network. This article presents a review of underwater routing protocols for UWSNs. We classify the existing underwater routing protocols into three categories: energy-based, data-based, and geographic information-based protocols. In this article, we summarize the underwater routing protocols proposed in recent years. The proposed protocols are described in detail and give advantages and disadvantages. Meanwhile, the performance of different underwater routing protocols is analyzed in detail. Besides, we also present the research challenges and future directions of underwater routing protocols, which can help the researcher better explore in the future.

Trust Aware Secure Energy Efficient Hybrid Protocol for MANET

Abstract: Mobile ad hoc network (MANETs) is infrastructure-less, self-organizing, fast deployable wireless network, so they truly are exceptionally appropriate for purposes between special outside occasions, communications in locations without a radio infrastructure, crises, and natural disasters, along with military surgeries. Security could be the primary weak spot in manet on account of this flexibility of structures and always changing dynamic topology, that will be very exposed to your selection of strikes like eavesdropping, routing, and alteration of programs. MANET is affected with security issues, surpassing Quality of services (QoS). So, intrusion tracking which modulates your system to recognize some other violation weakness would be that the top approach to guarantee security for MANET. Detecting intrusions has a critical part in supplying protections and functions as beyond layer of defenses against access. Power collapse of the cellular node maybe not merely alter the node alone but its capacity to forwards packets which is based on total system life. This also caused the institution of the routing protocol to its stable optimal choice of this multi-path to increase the navigation MANETs. Provision of energy-efficient and secure routing is a challenge given the changing topology and restricted resources of this kind of network. To address the energy efficiency and security we suggest a trust-based secure energy efficient navigation in MANETs employing the hybrid algorithm, cat slap single-player algorithm (C-SSA), that selects the best jumps in advancing the routing. In the beginning, the fuzzy clustering is put on, and the cluster heads (CHs) are picked predicated maximum worth of indirect, direct, and recent trust. Predicated on trust threshold worth nodes additionally discovered. Even the CHs are participated from the multi hop routing, and the assortment of the best route relies upon the projected hybrid protocol, and that selects the best routes determined by the delay, throughput, along with connectivity within this course. The proposed method obtained a minimal energy of 0.11m joules, a negligible delay of 0.005 msec, a maximum throughput of 0.74 bps, a maximum packet delivery ratio of 0.99 %, and a maximum detection rate of 90%. The proposed method compared with the existing techniques in the presence and absent of the selective packet dropping attack.

A Comprehensive Review on Secure Routing in Internet of Things: Mitigation Methods and Trust-Based Approaches

Abstract: Internet of Things (IoT) is a network of “things,” connected via Internet, to collect and exchange data. These “things” can be sensors, actuators, smartphones, wearables, computers, or any object that is interconnected to provide specific services. Similarly, wireless sensor network (WSN), as a part of IoT, forwards the gathered data after sensing any event. The scalability and heterogeneity of IoT offer limited protection and is prone to diverse attacks, including WSN-inherited attacks. Moreover, IPv6 routing protocol for low power and lossy networks (RPL), a de facto routing protocol for IoT networks, also suffers from certain vulnerabilities based on its features and functionalities. Researchers have proposed various mitigation mechanisms for secure networks and routing in IoT. Recently, trust-based approaches have gained tremendous interest from the research community to embed security in IoT networks and routing protocols. In the existing literature, several trust models have been introduced according to the security needs of the IoT system, such as SecTrust, DCTM-IoT, CTRUST, etc. In this research, security issues and requirements of IoT networks and RPL routing protocol are studied with respect to various attacks, such as Blackhole, Spoofing, Rank, etc. Additionally, various mitigation methods and significance of trust models in IoT for secure routing are analyzed. Further, trust metrics in IoT environments, including the open issues and research challenges, as well as the implication of trust as a security paradigm in IoT networks and routing protocols are discussed.

Comparative Study of Energy Efficient Routing Techniques in Wireless Sensor Networks

Abstract: This paper surveys the energy-efficient routing protocols in wireless sensor networks (WSNs). It provides a classification and comparison following a new proposed taxonomy distinguishing nine categories of protocols, namely: Latency-aware and energy-efficient routing, next-hop selection, network architecture, initiator of communication, network topology, protocol operation, delivery mode, path establishment and application type. We analyze each class, discuss its representative routing protocols (mechanisms, advantages, disadvantages…) and compare them based on different parameters under the appropriate class. Simulation results of LEACH, Mod-LEACH, iLEACH, E-DEEC, multichain-PEGASIS and M-GEAR protocols, conducted under the NS3 simulator, show that the routing task must be based on various intelligent techniques to enhance the network lifespan and guarantee better coverage of the sensing area.

DRRS-BC: Decentralized Routing Registration System Based on Blockchain

Abstract: The border gateway protocol (BGP) has become the indispensible infrastructure of the Internet as a typical inter-domain routing protocol. However, it is vulnerable to misconfigurations and malicious attacks since BGP does not provide enough authentication mechanism to the route advertisement. As a result, it has brought about many security incidents with huge economic losses. Exiting solutions to the routing security problem such as S-BGP, So-BGP, Ps-BGP, and RPKI, are based on the Public Key Infrastructure and face a high security risk from the centralized structure. In this paper, we propose the decentralized blockchain-based route registration framework-decentralized route registration system based on blockchain (DRRS-BC). In DRRS-BC, we produce a global transaction ledge by the information of address prefixes and autonomous system numbers between multiple organizations and ASs, which is maintained by all blockchain nodes and further used for authentication. By applying blockchain, DRRS-BC perfectly solves the problems of identity authentication, behavior authentication as well as the promotion and deployment problem rather than depending on the authentication center. Moreover, it resists to prefix and subprefix hijacking attacks and meets the performance and security requirements of route registration.

A comprehensive survey on LEACH-based clustering routing protocols in Wireless Sensor Networks

Abstract: During the previous few years, Wireless Sensor Network (WSN) appears as an active research domain due to the wide use of this technology in several applications, such as military, health, automation, and so forth. WSN supervises physical attributes where human activity is difficult or impossible. The WSN is a set of multiple sensor nodes that are haphazardly deployed in a specific space. These nodes sense data and record values continuously and send these data to the Base Station (BS) through other sensor nodes. Several issues are encountered in the WSNs, including energy consumption, deployment of sensor nodes, routing algorithms, energy efficiency, Cluster-Head (CH) selection, robustness, etc. Numerous routing protocols have been developed by researchers to resolve these constraints, and several techniques of optimization are proposed to define the optimal road between the transmitter and the receiving node. Hierarchical routing protocols increase the network lifetime by enhancing its performance. The most popular hierarchical method is LEACH (Low Energy Adaptive Clustering Hierarchy) that grouped sensor nodes into clusters. Each cluster consists of normal nodes and is controlled by a CH, which is elected by cluster members to collect their data and send it to the BS. The LEACH protocol decreased the energy consumption in WSNs. In this survey, we provide a comprehensive study of LEACH descendant clustering protocols. This survey is the first study to classify LEACH-based routing protocols into CH selection, data transmission, and both CH selection and data transmission techniques. This survey is compared to other actual surveys. To evaluate these protocols, we look at many metrics, such as the CH selection method, communication method, the scalability, energy efficiency, mobility, localization of nodes, and so forth. According to these metrics, we propose a comparative analysis of these clustering routing protocols. This survey discusses also the strengths and limitations of each LEACH-variant protocol. Conclusively, the paper terminates with recommendations on future research fields in WSN.

Q-Learning-Based Data-Aggregation-Aware Energy-Efficient Routing Protocol for Wireless Sensor Networks

Abstract: The energy consumption of the routing protocol can affect the lifetime of a wireless sensor network (WSN) because tiny sensor nodes are usually difficult to recharge after they are deployed. Generally, to save energy, data aggregation is used to minimize and/or eliminate data redundancy at each node and reduce the amount of the overall data transmitted in a WSN. Furthermore, energy-efficient routing is widely used to determine the optimal path from the source to the destination, while avoiding the energy-short nodes, to save energy for relaying the sensed data. In most conventional approaches, data aggregation and routing path selection are considered separately. In this study, we consider the degrees of the possible data aggregation of neighbor nodes when a node needs to determine the routing path. We propose a novel Q-learning-based data-aggregation-aware energy-efficient routing algorithm. The proposed algorithm uses reinforcement learning to maximize the rewards, defined in terms of the efficiency of the sensor-type-dependent data aggregation, communication energy and node residual energy, at each sensor node to obtain an optimal path. We used sensor-type-dependent aggregation rewards. Finally, we performed simulations to evaluate the performance of the proposed routing method and compared it with that of the conventional energy-aware routing algorithms. Our results indicate that the proposed protocol can successfully reduce the amount of data and extend the lifetime of the WSN.

Novel Online Sequential Learning-Based Adaptive Routing for Edge Software-Defined Vehicular Networks

Abstract: To provide efficient networking services at the edge of Internet-of-Vehicles (IoV), Software-Defined Vehicular Network (SDVN) has been a promising technology to enable intelligent data exchange without giving additional duties to the resource constrained vehicles. Compared with conventional centralized SDVNs, hybrid SDVNs combine the centralized control of SDVNs and self-organized distributed routing of Vehicular Ad-hoc NETworks (VANETs) to mitigate the burden on the central controller caused by the frequent uplink and downlink transmissions. Although a wide variety of routing protocols have been developed, existing protocols are designed for specific scenarios without considering flexibility and adaptivity in dynamic vehicular networks. To address this problem, we propose an efficient online sequential learning-based adaptive routing scheme, namely, Penicillium reproduction-based Online Learning Adaptive Routing scheme (POLAR) for hybrid SDVNs. By utilizing the computational power of edge servers, this scheme can dynamically select a routing strategy for a specific traffic scenario by learning the pattern from network traffic. Firstly, this paper applies Geohash to divide the large geographical area into multiple grids, which facilitates the collection and processing of real-time traffic data for regional management in controller. Secondly, a new Penicillium Reproduction Algorithm (PRA) with outstanding optimization capabilities is designed to improve the learning effectiveness of Online Sequential Extreme Learning Machine (OS-ELM). Finally, POLAR is deployed in control plane to generate decision-making model (i.e., routing policy). Based on the real-time featured data, this scheme can choose the optimal routing strategy for a specific area. Extensive simulation results show that POLAR is superior to a single traditional routing protocol in terms of packet delivery ratio and latency.

Dynamic Route Discovery Using Modified Grasshopper Optimization Algorithm in Wireless Ad-Hoc Visible Light Communication Network

Abstract: In recent times, visible light communication is an emerging technology that supports high speed data communication for wireless communication systems. However, the performance of the visible light communication system is impaired by inter symbol interference, the time dispersive nature of the channel, and nonlinear features of the light emitting diode that significantly reduces the bit error rate performance. To address these problems, many environments offer a rich infrastructure of light sources for end-to-end communication. In this research paper, an effective routing protocol named the modified grasshopper optimization algorithm is proposed to reduce communication interruptions, and to provide alternative routes in the network without the need of previous topology knowledge. In this research paper, the proposed routing protocol is implemented and analyzed using the MATLAB environment. The experimental result showed that the proposed routing protocol adapts to dynamic changes in the communication networks, like obstacles and shadows. Hence, the proposed protocol achieved better performance in data transmission in terms of throughput, packet delivery ratio, end-to-end delay, and routing overhead. In addition, the performance is analyzed by varying the number of nodes like 50, 100, 250, and 500. From the experimental analysis, the proposed routing protocol achieved maximum of 16.69% and minimum of 2.20% improvement in packet delivery ratio, and minimized 0.80 milliseconds of end-to-end delay compared to the existing optimization algorithms.

Energy-Efficient Intelligent Routing Scheme for IoT-Enabled WSNs

Abstract: Recently, the Internet of Things (IoT) has attracted much interest in its wide applications, such as smart healthcare, home automation, transportation, and smart city. In these IoT-based systems, wireless sensor networks (WSNs) are highly used to gather information needed by smart environments. However, due to huge heterogeneous data coming from different sensing devices, IoT-enabled WSNs face different challenges, such as high communication delay, low throughput, and poor network lifetime. In this article, a deep-reinforcement-learning (DRL)-based intelligent routing scheme is proposed for IoT-enabled WSNs that significantly reduce delay and increase network lifetime. The proposed algorithm divides the whole network into different unequal clusters depending on the current data load present in the sensor node that significantly prevents immature death of the network. An extensive experiment on the proposed algorithm is performed using ns3. The experimental results are compared with the state-of-the-art algorithms to demonstrate the efficiency of the proposed scheme in terms of the number of alive nodes, packet delivery, energy efficiency, and communication delay in the network.

DARE-SEP: A Hybrid Approach of Distance Aware Residual Energy-Efficient SEP for WSN

Abstract: Wireless Sensor Networks (WSNs) are comprised of multiple sensor nodes deployed in an ad-hoc manner to sense or observe physical phenomena by collecting real-time data. These sensor nodes are battery-enabled with limited energy constraints affecting network lifetime. Energy conservation of these nodes is vital in designing a routing protocol to maximize network lifetime. Heterogeneity of the network plays an important role in prolonging the network lifetime by making use of dissimilar nodes in terms of energy, power, and processing capabilities. In this paper, a hybrid approach, named as Distance Aware Residual Energy-Efficient Stable Election Protocol (DARE-SEP) , is proposed that combines features of Residual Energy Efficient Stable Election Protocol (REE-SEP) with Direct Transmission (DT) and Distance-Based protocol (DP). The proposed protocol is aimed to provide an optimal transmission route from sensor nodes to the Cluster Heads (CHs), considering the network dynamics. Multi-hop routing is used between CHs and sinks nodes to reduce energy consumption. The results show a 10% increase in energy efficiency, thus enhancing the network lifespan compared with the conventional routing protocols in Heterogeneous Wireless Sensor Networks (HWSNs).

A New Hybrid Routing Protocol Using a Modified K-Means Clustering Algorithm and Continuous Hopfield Network for VANET

Abstract: Vehicular Ad-hoc Networks (VANET) offer several user applications for passengers and drivers, as well as security and internet access applications. To ensure efficient data transmission between vehicles, a reliable routing protocol is considered a significant challenge. This paper suggests a new clustering-based routing protocol combining a modified K-Means algorithm with Continuous Hopfield Network and Maximum Stable Set Problem (KMRP) for VANET. In this way, the basic input parameters of the K-Means algorithm, such as the number of clusters and the initial cluster heads, will not be selected randomly, but using Maximum Stable Set Problem and Continuous Hopfield Network. Then the assignment of vehicles to clusters will be carried out according to Link Reliability Model as a metric that replaces the distance parameter in the K-Means algorithm. Finally, the cluster head is selected by weight function according to the amount of free buffer space, the speed, and the node degree. The simulation results have proved that the designed protocol performs better in a highway vehicular environment, compared to the most recent schemes designed for the same objective. In fact, KMRP reduces traffic congestion, and thus provides a significant increase in Throughput. In addition, KMRP decreases the transmission delay and guarantees the stability of the clusters in high density and mobility, which acts better in terms of the Packet Delivery Ratio.

Data Collection in MI-Assisted Wireless Powered Underground Sensor Networks: Directions, Recent Advances, and Challenges

Abstract: Wireless underground sensor networks (WUSNs) facilitate remote monitoring and control of various underground environments, which are suffering from a significant reliability problem. To address this problem and relieve the ongoing networking challenges, we propose a new concept, called the magnetic induction (MI)-assisted wireless powered underground sensor network (MI-WPUSN), which integrates the advantages of MI communication techniques with those of wireless power transfer mechanisms. MI-WPUSN offers a unique platform consisting of seven envisioned devices and four distinct communication modes to provide significant reliability potential, which is constrained by its complex and challenging data collection. To unlock the potential of MI-WPUSN, we provide a systematic research roadmap for MI-WPUSN data collection, spreading from sensor deployment to multiple channel access control and to frequency-selective routing establishment. Specifically, we first summarize the state-of-the-art research advances on sensor deployment, based on which we propose a bidirectional projection-based deployment topology that achieves high network reliability and discuss the sensor numerical determination problem resorting to weighted Voronoi diagrams. We then introduce the principles for multiple channel access control and review the existing research. Finally, after introducing kernel regression methods that can easily handle the frequency-selective property of MI-WPUSN, we develop a modified Q-learning-based routing protocol. In particular, we list and analyze the underlying challenges and related future issues in each direction.

Intelligent Routing Based on Reinforcement Learning for Software-Defined Networking

Abstract: Traditional routing protocols employ limited information to make routing decisions, which can lead to a slow adaptation to traffic variability, as well as restricted support to the Quality of Service (QoS) requirements of applications. This article introduces a novel approach for routing in Software-defined networking (SDN), called Reinforcement Learning and Software-Defined Networking Intelligent Routing (RSIR). RSIR adds a Knowledge Plane to SDN and defines a routing algorithm based on Reinforcement Learning (RL) that takes into account link-state information to make routing decisions. This algorithm capitalizes on the interaction with the environment, the intelligence provided by RL and the global view and control of the network furnished by SDN, to compute and install, in advance, optimal routes in the forwarding devices. RSIR was extensively evaluated by emulation using real traffic matrices. Results show RSIR outperforms the Dijkstra’s algorithm in relation to the stretch, link throughput, packet loss, and delay when available bandwidth, delay, and loss are considered individually or jointly for the computation of optimal paths. The results demonstrate that RSIR is an attractive solution for intelligent routing in SDN.

Energy-Aware Geographic Routing for Real-Time Workforce Monitoring in Industrial Informatics

Abstract: Workforce monitoring is a vital activity in large factories in order to oversee the worker’s concentration on their duty and increase productivity. Workforces are kind of moving targets which can be monitored via wireless sensor networks (WSNs). As sensor nodes have a limited source of energy, optimal energy consumption is of crucial importance in these networks. Several protocols for routing are designed in order to consider efficient energy consumption in conjunction with target tracking and coverage. In this article, a new energy-efficient routing algorithm geographic routing time transfer (GRTT) is proposed to use topological information of sensor nodes for target tracking and coverage applications. In this article, a weight called relay ability is defined for each node according to the sensor network topology. These weights are calculated and announced to sensor nodes by cluster heads (CHs). Once a target enters the area covered by sensor nodes, a signal is sent to the CH through the route having maximum predefined weights in the network. Simulations show better results than other tracking routing methods based on the metrics of energy consumption of the network, power consumption, and throughput for GRTT (proposed method), dynamic energy-efficient routing protocol (DEER), virtual force-based energy-hole mitigation (VFEM), nonequal-probability multicast routing protocol (MRP-NEP), and trace-announcing routing scheme (TARS) methods.

A Q-Learning-Based Topology-Aware Routing Protocol for Flying Ad Hoc Networks

Abstract: Flying ad hoc networks (FANETs) have emanated over the last few years for numerous civil and military applications. Owing to underlying attributes such as a dynamic topology, node mobility in three-dimensional (3D) space, and the limited energy of unmanned aerial vehicles (UAVs), a routing protocol for FANETs is challenging to design. Exiting topology-based routing is unsuitable for highly dynamic FANETs. Location-based routing protocols can be preferred for FANETs owing to their scalability, but are based on one-hop neighbor information and do not contemplate the reachability of further appropriate nodes for forwarding. Owing to the rapid mobility of UAVs, the topology frequently changes; thus, some route entries in the routing table can become invalid and the next-hop nodes may be unavailable before a timeout. That is, the routing decision based on one-hop neighbors cannot assure a successful delivery. In this study, we propose a novel Q-learning-based topology-aware routing (QTAR) protocol for FANETs to provide reliable combinations between the source and destination. The proposed QTAR improves the routing decision by considering two-hop neighbor nodes, extending the local view of the network topology. With the Q-learning technique, QTAR adaptively adjusts the routing decision according to the network condition. Our simulation results reveal that QTAR outstrips the existing routing protocols in respect of various performance metrics under distinct scenarios.

TBSMR: A Trust-Based Secure Multipath Routing Protocol for Enhancing the QoS of the Mobile Ad Hoc Network

Abstract: Mobile ad hoc network (MANET) is a miscellany of versatile nodes that communicate without any fixed physical framework. MANETs gained popularity due to various notable features like dynamic topology, rapid setup, multihop data transmission, and so on. These prominent features make MANETs suitable for many real-time applications like environmental monitoring, disaster management, and covert and combat operations. Moreover, MANETs can also be integrated with emerging technologies like cloud computing, IoT, and machine learning algorithms to achieve the vision of Industry 4.0. All MANET-based sensitive real-time applications require secure and reliable data transmission that must meet the required QoS. In MANET, achieving secure and energy-efficient data transmission is a challenging task. To accomplish such challenging objectives, it is necessary to design a secure routing protocol that enhances the MANET’s QoS. In this paper, we proposed a trust-based multipath routing protocol called TBSMR to enhance the MANET’s overall performance. The main strength of the proposed protocol is that it considers multiple factors like congestion control, packet loss reduction, malicious node detection, and secure data transmission to intensify the MANET’s QoS. The performance of the proposed protocol is analyzed through the simulation in NS2. Our simulation results justify that the proposed routing protocol exhibits superior performance than the existing approaches.

Energy optimized micro genetic algorithm based LEACH protocol for WSN

Abstract: This article presents the design, analyses and implementation of the novel routing protocol for energy optimization based on LEACH for WSN. Network Lifetime is the major problem in various routing protocols used in WSN. In order to overcome that problem, our proposed routing protocol is developed, which is a combination of Micro Genetic algorithm with LEACH protocol. Our proposed µGA-LEACH protocol, strengthen the cluster head (CH) selection and also reduce the energy consumption of the network when compared to existing protocols. This paper shows the improvement of network lifetime and energy consumption with the optimal CH selection based on a micro genetic algorithm and also compared the results with an existing hierarchical routing protocol like LEACH, LEACH-C, LEACH GA and GADA LEACH routing protocol with various packet sizes, and initial energy.

A Novel Hybrid Optimization for Cluster‐Based Routing Protocol in Information-Centric Wireless Sensor Networks for IoT Based Mobile Edge Computing

Abstract: In present days, the utilization of mobile edge computing (MEC) and Internet of Things (IoT) in mobile networks offers a bottleneck in the evolving technological requirements. Wireless Sensors Network (WSN) become an important component of the IoT and is the major source of big data. In IoT enabled WSN, a massive amount of data collection generated from a resource-limited network is a tedious process, posing several challenging issues. Traditional networking protocols offer unfeasible mechanisms for large-scaled networks and might be applied to IoT platform without any modifications. Information-Centric Networking (ICN) is a revolutionary archetype which that can resolve those big data gathering challenges. Employing the ICN architecture for resource-limited WSN enabled IoT networks may additionally enhance the data access mechanism, reliability challenges in case of a mobility event, and maximum delay under multihop communication. In this view, this paper proposes an IoT enabled cluster based routing (CBR) protocol for information centric wireless sensor networks (ICWSN), named CBR-ICWSN. The proposed model undergoes a black widow optimization (BWO) based clustering technique to select the optimal set of cluster heads (CHs) effectively. Besides, the CBR-ICWSN technique involves an oppositional artificial bee colony (OABC) based routing process for optimal selection of paths. A series of simulations take place to verify the performance of the CBR-ICWSN technique and the results are examined under several aspects. The experimental outcome of the CBR-ICWSN technique has outperformed the compared methods interms of network lifetime and energy efficiency.

A Review of AI-enabled Routing Protocols for UAV Networks: Trends, Challenges, and Future Outlook.

Abstract: Unmanned Aerial Vehicles (UAVs), as a recently emerging technology, enabled a new breed of unprecedented applications in different domains. This technology's ongoing trend is departing from large remotely-controlled drones to networks of small autonomous drones to collectively complete intricate tasks time and cost-effectively. An important challenge is developing efficient sensing, communication, and control algorithms that can accommodate the requirements of highly dynamic UAV networks with heterogeneous mobility levels. Recently, the use of Artificial Intelligence (AI) in learning-based networking has gained momentum to harness the learning power of cognizant nodes to make more intelligent networking decisions. An important example of this trend is developing learning-powered routing protocols, where machine learning methods are used to model and predict topology evolution, channel status, traffic mobility, and environmental factors for enhanced routing. This paper reviews AI-enabled routing protocols designed primarily for aerial networks, with an emphasis on accommodating highly-dynamic network topology. To this end, we review the basics of UAV technology, different approaches to swarm formation, and commonly-used mobility models, along with their impact on networking paradigms. We proceed with reviewing conventional and AI-enabled routing protocols, including topology-predictive and self-adaptive learning-based routing algorithms. We also discuss tools, simulation environments, remote experimentation platforms, and public datasets that can be used for developing and testing AI-enabled networking protocols for UAV networks. We conclude by presenting future trends, and the remaining challenges in AI-based UAV Networking, for different aspects of routing, connectivity, topology control, security and privacy, energy efficiency, and spectrum sharing.

An Efficient Clustering Framework for Massive Sensor Networking in Industrial Internet of Things

Abstract: Massive machine-type Internet of Things (IoT) communication (mMTIC) has the potential for high impact in the anticipated future industry 4.0 sensor networking applications. However, the energy limitation and battery life of the IoT nodes have always been one of the long-standing problems. Clustering routing protocol (CRP) being the most efficient existing approach often suffers when nodes closer to the sink depletes their energy, thereby producing an unwanted energy hole, where packets in flight toward the sink often get interrupted. Considering mMTIC covering a large geographical area, such as monitoring bush fires, the multihop communication among the nodes often causes such an energy hole problem. In this article, we develop an artificial-intelligence-based CRP framework for incorporating a small periphery of a fixed shaped area to ameliorate such energy holes. Our proposed framework is not only energy-optimized but also acts as a robust approach for massive communication and informed data collection.