Proactive Routing Protocols Research Articles

Improved Proactive Routing Protocol Considering Node Density Using Game Theory in Dense Networks

In mobile ad hoc networks, network nodes cooperate by packet forwarding from the source to the destination. As the networks become denser, more control packets are forwarded, thus consuming more bandwidth and may cause packet loss. Recently, game theory has been applied to address several problems in mobile ad hoc networks like energy efficiency. In this paper, we apply game theory to reduce the control packets in dense networks. We choose a proactive routing protocol, Optimized Link State Routing (OLSR) protocol. We consider two strategies in this method: willingness_always and willingness_never to reduce the multipoint relay (MPR) ratio in dense networks. Thus, nodes with less influence on other nodes are excluded from nomination as MPRs. Simulations were used to confirm the efficiency of using our improved method. The results show that the MPR ratio was significantly reduced, and packet delivery ratio was increased compared to the conventional protocol.

An SDN approach to route massive data flows of sensor networks

SummaryWith the advent of the Internet of Things (IoT), more and more devices can establish a connection with local area networks and use routing protocols to forward all information to the sink. But these devices may not have enough resources to execute a complex routing protocol or to memorize all information about the network. With proactive routing protocols, each node calculates the best path, and it needs enough resources to memorize the network topology. With reactive routing protocols, each node has to broadcast the message to learn the right path that the packets must follow. In all cases, in large networks such as IoT, this is not an appropriate mechanism. This paper presents a new software‐defined network (SDN)–based network architecture to optimize the resource consumption of each IoT object while securing the exchange of messages between the embedded devices. In this architecture, the controller is in charge of all decisions, and objects only exchange messages and forward packets among themselves. In the case of large networks, the network is organized into clusters. Our proposed network architectures are tested with 1000 things grouped in five clusters and managed by one SDN controller. The tests using OpenDayLight and IoT embedded applications have been implemented on several scenarios providing the ability and the scalability from dynamic reorganization of the end‐devices. This approach explores the network performance issues using a virtualized SDN‐clustered environment which contributes to a new model for future network architectures.

On Modeling Optimizations and Enhancing Routing Protocols for Wireless Multihop Networks

The contribution of this paper is two fold. It first analyses the flooding strategies for the Wireless Multihop Networks (WMNs) then it enhances the reactive and proactive routing protocols. For analysis purpose, we select four widely used flooding techniques for routing: i. traditional flooding, ii. Time-To-Live based Expanding Ring Search (TTL-based ERS) flooding scheme, iii. TTL-based Scope Routing (SR) flooding and iv. Multi-Point Relays (MPR) flooding. These techniques play a vital role and act as a backbone for routing protocols. Therefore, we compare efficiency of these techniques for six widely used routing protocols: Ad-hoc On-demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), DYnamic MANET On-demand (DYMO), Fish-eye Scope Routing (FSR) and Optimized Link State Routing (OLSR). DSDV uses traditional flooding, AODV, DSR and DYMO use TTL-based ERS flooding, FSR uses TTL-based SR flooding and OLSR uses MPR flooding. This paper also presents mathematical models for flooding techniques and studies the affects of these techniques on their respective protocols in terms of energy and time consumption. This is done to measure the cost incurred by the routing protocols in the form of routing overhead and latencies. A novel contribution of this work is the enhancement in search set values and intervals of routing algorithms to improve the efficiency of selected existing protocols. A detailed comparison analysis of selected protocols with their default and enhanced routing algorithms in NS-2 is also a part of this work.

Self-Organized Proactive Routing Protocol for Non-Uniformly Deployed Underwater Networks.

Electromagnetic (EM) waves cannot propagate more than few meters in sea water due to the high absorption rate. Acoustic waves are more suitable for underwater communication, but they travel very slowly compared to EM waves. The typical speed of acoustic waves in water is 1500 m/s, whereas speed of EM waves in air is approximately 3 × 108 m/s. Therefore, the terrestrial wireless sensor network (WSN) protocols assume that the propagation delay is negligible. Hence, reactive protocols are deemed acceptable for WSNs. Other important issues related to underwater wireless sensor networks (UWSNs) are determining the position of the underwater nodes and keeping a time synchronization among the nodes. Underwater nodes can neither determine their position nor synchronize using Global Navigation Satellite Systems (GNSS) because of the short penetration of EM waves in sea water. The limited mobility of UWSN nodes and variation in the propagation speed of acoustic waves make time synchronization a challenging task for underwater acoustic networks (UASNs). For all these reasons, WSN protocols cannot be readily used in UASNs. In this work, a protocol named SPRINT is designed to achieve high data throughput and low energy operation in the nodes. There is a tradeoff between the throughput and the energy consumption in the wireless networks. Longer links mean higher energy consumption. On the other hand, the number of relay nodes or hops between the source node and the final destination node is a key factor which affects the throughput. Each hop increases the delay in the packet forwarding and, as a result, decreases the throughput. Hence, energy consumption requires the nearest nodes to be chosen as forwarding nodes, whereas the throughput requires the farthest node to be selected to minimize the number of hops. SPRINT is a cross-layer, self-organized, proactive protocol which does not require positioning equipment to determine the location of the node. The routing path from the node to the gateway is formed based on the distance. The data sending node prefers to choose the neighbor node which is closest to it. The distance is measured by the signal strength between the two nodes.

Energy‐efficient circle zones stable election protocol with helper nodes for heterogeneous WSNs

The design of an energy-efficient routing protocol is crucial for extending the life-time of limited energy-constrained wireless sensor networks (WSNs). To achieve this goal, the authors propose three proactive routing protocols; the first protocol is a circle zone stable election protocol (CZSEP). This protocol is a two-level heterogeneous energy protocol with a circle zone located at the centre of the network field and used to deploy the normal nodes and with advanced nodes that are randomly distributed around the circle zone. The performance of the proposed CZSEP was compared to that of the conventional ZSEP considering the same total initial energy. To further improve the performance of CZSEP, they propose the second protocol named as, CZSEP with helper nodes (CZSEP-HN) which is a three-level heterogeneous energy protocol. In CZSEP-HN, they add helper nodes in certain places in the network field to minimise the energy consumption in the considered network. Both CZSEP and CZSEP-HN can overcome the problem of large transmission distance between normal nodes and the base station (BS) and between cluster-heads and BS exists in conventional ZSEP. Finally, they propose the third protocol, which is a modified CZSEP-HN (MCZSEP-HN) to overcome the problem of energy consumption in CZSEP-HN. MCZSEP-HN is a four-level heterogeneous energy protocol with two circle zones one for normal nodes and the other for intermediate nodes. The obtained results showed that the MCZSEP-HN outperforms the other protocols in terms of life-time, throughput, stability and instability period and can reduce the energy consumption in WSNs.

Improving the Network Performance using MP-OLSR Protocol for Wireless Ad Hoc Network (MANET)

MP-OLSR is the abbreviation of Multipath (Optimized Link source Routing) Protocol which is also known as hybrid protocol, that helps to increase the path in OLSR which clearly works on “proactive routing protocol” specifically developed for Ad Hoc Networks. Wireless Ah Hoc Networks are one among the emerging technology with many operations. This network has some uniquecharacteristics like shared co-operation, dynamic topology and wireless medium.MP-OLSR protocol has the potential to achieve dynamic exchange of data without relying on one base station or a backbone wired network and it is also capable of handling the intermittent exchange of data to manage the topology information for the network also it maintains the design of on-demand routing table and the packets will be forwarded to multiple paths. Here, we propose an idea for enhancing the Multipath-OLSR by using Clustering Algorithm which helps to avoid link failure and recovering the route and also routing protocol to reduce traffic delay and overhead of network that eventually increases the throughput and delivery ratio of a packet.

Performance Evaluation and Comparison of GRP and OLSR Routing Protocols for Video Streaming Over Mobile Ad Hoc Networks Using OPNET 14.5

Due to the increased use of mobile devices with the high demand for applications such as video application, most companies have tended to pay attention to Mobile Ad hoc Networks. This type of network is characterized by multi-hop wireless networks where data packets are sent in a "store and forward" manner from the source to an arbitrary destination via intermediate nodes. The mobile nodes are connected by multi-routes routing as the nodes in this network not only serve as hosts but also as routers where data is routed to and from other nodes in the network and therefore the mobile node not only sends its data packets but also sends data packets of other mobile nodes. The network architecture changes dynamically, mainly because of Mobility of nodes, so we need routing protocols to establish the connection. Routing protocols are categorized into proactive routing protocols, reactive routing protocols and hybrid routing protocols. So in this research, we has been studied Geographical Routing Protocol (GRP ), Optimized Link State Routing Protocol (OLSR) routing protocols which is one of proactive routing protocols and hybrid routing protocols respectively on the basis of Throughput, Delay and Load..etc and evaluated the performance in a large mobile ad hoc network and in a small mobile ad hoc network as well as for different video resolutions, the OPNET 14.5 network simulator was used to obtain research results. It was found that the GRP protocol performs better for a small number of nodes whether the video resolution is low or high while its performance decreases when the number of nodes increases in the network but the OLSR protocol improves when the number of nodes is increased.

Latency and energy-efficient multi-hop routing protocol for unmanned aerial vehicle networks

Unmanned aerial vehicle is one of the main announced use cases of 5G/IMT2020, which is expected to have various applications in many fields. These devices have limited capabilities in terms of energy and processing. Due to the complex structure of unmanned aerial vehicle networks and the high mobility constraints, design of efficient routing protocol, for supporting such network, is a challenge. Thus, efficient routing of data among unmanned aerial vehicles between source and destination is an important issue in designing unmanned aerial vehicle networks. Proactive routing protocols are one of the main categories of routing protocols developed for mobile ad hoc networks and vehicular ad hoc networks. Optimized link state routing protocol is one of the most common proactive routing protocols that has been modified to support unmanned aerial vehicle networks, considering high mobility feature of the network. In this work, we propose a latency and energy-efficient proactive routing protocol for dense unmanned aerial vehicle networks, with high-density devices, based on optimized link state routing protocol algorithm, referred to as multi-objective optimized link state routing protocol. The proposed routing protocol is topology aware and can be used for low-latency and high-mobility applications. The proposed multi-objective optimized link state routing protocol routing algorithm considers all modified versions of optimized link state routing protocol and introduces a novel method for selecting multipoint relay nodes that considers the traffic load on the communication channel and the load on each unmanned aerial vehicle node. Moreover, the proposed algorithm considers the communication link stability and the energy constraints. The system is simulated over a reliable environment for various scenarios, and it is compared to the original optimized link state routing protocol and its modified versions. Simulation results indicate that the proposed protocol achieves higher efficiency in terms of latency, energy, and reliability.

Inculcating Trust in Hybrid Routing Approach for Securing MANET

The rudimentary notion of using MANET is that the exchange of information in between the portable nodes count on the swift arrangement of a momentary network. Also, each node in a MANET can travel spontaneously in any direction and can change its links to the other nodes repeatedly. In hybrid protocols, initially, the routing is established with the help of some proactively prospected routes and later on serves the request with the help of reactive flooding. In MANET, the security and the routing are the two most crucial and challenging aspects that open up a vast area for improvement. Security includes a set of considerations that are adequately funded. Designing a competent routing protocol for wireless ad-hoc network along with the fulfilment of security aspects is a challenging task. MANET demands for a new set of networking strategies to be adopted in order to provide competent and secure overhead free end-to-end communication. In MANET, hybrid routing protocols are considered to be the most effective types of protocols as they take the advantage of both proactive and reactive routing protocols. After performing an intense literature survey, it could be concluded that there is a specific requirement of a protocol hybrid in nature that could include the two most specific factors for MANET (i.e., routing and security). The existing hybrid routing protocols suffers from the problems like optimisation control, images detection, and image quantization. To solve the above-mentioned issues of hybrid routing protocols, various optimization algorithms have been proposed that are natural genetics-inspired. The various techniques that can be used to enhance the security are cryptography, bio-metric, trust-based approach, Hash function algorithm, etc.

Subarea tree routing algorithm based infrastructure for mobile ad-hoc networks

Ad hoc networks are self-organizing and multi-hop networks for data communication. Subarea Tree Routing (STR) has used for multi-hop networks for network division into various subareas. The main objective of this paper is creating a dynamic sub-area tree infrastructure for Mobile Ad hoc Networks (MANET). The proposed architecture uses the hierarchical procedure to divide the whole network into many geographical sub-area networks. In addition, each sub-area has a selected root node, we can configure the root node manually due to small ad hoc network and uses auto-discovery procedure to select the roots for large networks. The root node is located at the center of sub-area with hop level zero. The root function is used to update the routing table and root table for sub-area. After sub-area created any interconnected node detects a new inefficient node for sending the invitation message to join the sub-area tree. In the same sub-area, proactive routing protocols are used between the sub-area root node and its interconnect nodes and reactive routing protocols are used between all sub-areas root nodes. The new sub-area tree provides an infrastructure to avoid the flooding procedures. Routing in the sub-area tree avoids the transmission collision to optimize the ad-hoc networks. Â

Routing Protocols for Low Power and Lossy Networks in Internet of Things Applications.

The emergence of the Internet of Things (IoT) and its applications has taken the attention of several researchers. In an effort to provide interoperability and IPv6 support for the IoT devices, the Internet Engineering Task Force (IETF) proposed the 6LoWPAN stack. However, the particularities and hardware limitations of networks associated with IoT devices lead to several challenges, mainly for routing protocols. On its stack proposal, IETF standardizes the RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks) as the routing protocol for Low-power and Lossy Networks (LLNs). RPL is a tree-based proactive routing protocol that creates acyclic graphs among the nodes to allow data exchange. Although widely considered and used by current applications, different recent studies have shown its limitations and drawbacks. Among these, it is possible to highlight the weak support of mobility and P2P traffic, restrictions for multicast transmissions, and lousy adaption for dynamic throughput. Motivated by the presented issues, several new solutions have emerged during recent years. The approaches range from the consideration of different routing metrics to an entirely new solution inspired by other routing protocols. In this context, this work aims to present an extensive survey study about routing solutions for IoT/LLN, not limited to RPL enhancements. In the course of the paper, the routing requirements of LLNs, the initial protocols, and the most recent approaches are presented. The IoT routing enhancements are divided according to its main objectives and then studied individually to point out its most important strengths and weaknesses. Furthermore, as the main contribution, this study presents a comprehensive discussion about the considered approaches, identifying the still remaining open issues and suggesting future directions to be recognized by new proposals.

Towards Void Hole Alleviation by Exploiting the Energy Efficient Path and by Providing the Interference-Free Proactive Routing Protocols in IoT Enabled Underwater WSNs.

Nowadays, the Internet of Things enabled Underwater Wireless Sensor Network (IoT-UWSN) is suffering from serious performance restrictions, i.e., high End to End (E2E) delay, low energy efficiency, low data reliability, etc. The necessity of efficient, reliable, collision and interference-free communication has become a challenging task for the researchers. However, the minimum Energy Consumption (EC) and low E2E delay increase the performance of the IoT-UWSN. Therefore, in the current work, two proactive routing protocols are presented, namely: Bellman–Ford Shortest Path-based Routing (BF-SPR-Three) and Energy-efficient Path-based Void hole and Interference-free Routing (EP-VIR-Three). Then we formalized the aforementioned problems to accomplish the reliable data transmission in Underwater Wireless Sensor Network (UWSN). The main objectives of this paper include minimum EC, interference-free transmission, void hole avoidance and high Packet Delivery Ratio (PDR). Furthermore, the algorithms for the proposed routing protocols are presented. Feasible regions using linear programming are also computed for optimal EC and to enhance the network lifespan. Comparative analysis is also performed with state-of-the-art proactive routing protocols. In the end, extensive simulations have been performed to authenticate the performance of the proposed routing protocols. Results and discussion disclose that the proposed routing protocols outperformed the counterparts significantly.

A smart proactive routing protocol in cognitive radio networks

In this paper, we introduce a smart proactive routing protocol based on the Q-learning algorithm to find the most stable routes which imposes a minimum interference on the primary users. Unlike traditional proactive routing protocols, in our proposed method control packets are not broadcast whenever the network topology changes. Indeed, we apply a generalised version of Q-learning to predict the model of the routes stability. This model is used to prevent the flood of state information that is ineffective for routing decisions. The frequency of changes in the model is much less than that in the network topology. In the new approach, secondary users broadcast control packets following any changes in the model which reduces the routing overhead. Evaluation of the simulation results show that our routing protocol outperforms existing schemes in terms of throughput and the interference imposed on the primary users' spectrum as well as routing overhead.

Region Aware Proactive Routing Approaches Exploiting Energy Efficient Paths for Void Hole Avoidance in Underwater WSNs

Nowadays, constrained battery life expectancy is an important issue for reliable data delivery in an Underwater Wireless Sensor Network (UWSN). Conventional transmission methodologies increase the transmission overhead, i.e., the collision of packets, which influence the data transmission. Replacement of the sensors' battery in brutal underwater environment is a difficult task. Therefore, to maintain a strategic distance from the unexpected failure of the network and to increase the life expectancy of the network, energy efficient routing protocols are required. At this end, in this paper, a proactive routing protocol with three different network types is proposed to solve the aforementioned issues. The proposed protocol adaptively changes its communication strategy depending on the type of the network, i.e., dense network, partially dense network and sparse network. This adaptive strategy helps the routing protocols to continue their transmission by avoiding the void holes. In the proposed protocol named Proactive routing Approach with Energy efficient Path Selection (PA-EPS-Case I), vertical inter-transmission layering concept is introduced (using shortest and fastest path) in the dense and partially dense region. In addition, cluster formation concept is also appended to make transmission successful in the sparse regions. The Packet Delivery Ratio (PDR) is improved by the proposed protocol with minimum End to End (E2E) delay and packet drop ratio. Scalability of the proposed routing protocols is also analyzed by varying the number of nodes from 100-500. A comparative analysis is performed with two cutting edge routing protocols namely: Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) and Cluster-based WDFAD-DBR (C-DBR). Simulation results demonstrate that proposed protocol achieved 12.64% higher PDR with 20% decrease in E2E delay than C-DBR. Furthermore, the proposed routing protocol outperformed C-DBR in terms of packet drop ratio up to 14.29% with an increase of EC up to 30%.

A smart proactive routing protocol in cognitive radio networks

In this paper, we introduce a smart proactive routing protocol based on the Q-learning algorithm to find the most stable routes which imposes a minimum interference on the primary users. Unlike traditional proactive routing protocols, in our proposed method control packets are not broadcast whenever the network topology changes. Indeed, we apply a generalised version of Q-learning to predict the model of the routes stability. This model is used to prevent the flood of state information that is ineffective for routing decisions. The frequency of changes in the model is much less than that in the network topology. In the new approach, secondary users broadcast control packets following any changes in the model which reduces the routing overhead. Evaluation of the simulation results show that our routing protocol outperforms existing schemes in terms of throughput and the interference imposed on the primary users' spectrum as well as routing overhead.

Communication Network Model that supports a Sensing System based on Robustness Criteria

Proactive routing protocols are commonly used in wireless sensor networks due to their main feature is distributing information very quickly. However, most of the implementations using these protocols do not guarantee the robustness that unexpected emergencies required. In this paper, it tries to model a wireless sensor network implemented in a three-floor's building, robust enough to assure the working of the net despite of the loss of nodes in emergency situations. The performance of DSDV (Destination Sequenced Distance Vector) and OLSR (On Link State Routing) is simulated in various scenarios using a different number of nodes in the building. The results show that the OLSR protocol can achieve a better performance in terms of robustness in the proposed scenarios.

Context-Aware Smallworld Routing for Wireless Ad-Hoc Networks

We propose a Context-aware Smallworld routing protocol for wireless ad-hoc networks which finds efficient routes to the destination nodes often through a very short chain of intermediate nodes, without using any routing table. This protocol exploits the “small-world” phenomenon of social networks where source-destination pairs typically get connected through few intermediate friends and the individuals can collectively discover such short paths. The key idea behind our routing protocol is that for forwarding an incoming packet to the destination, a node picks the next hop from among the one-hop neighbor from its one-hop neighborhood that is closest to the destination, and multiple randomly selected long-distance neighbor(s) , i.e., from outside of its one-hop neighborhood, based on which of these neighbors is closest to the destination. The long-distance neighbors are selected by using their contextual information through a probabilistic mapping. We provide the theoretical foundations behind our protocol. This simple but effective algorithm can meet performance objectives for most scenarios by reducing loss and latency. Simulation results, using synthetic network topologies, have demonstrated that the routing performance of context-aware Smallworld is better than geographical ( distance-based ) Smallworld and other standard proactive routing protocols (e.g., OLSRv2) when metrics, such as packet losses , end-to-end delays , hop-counts , connectivity drops , and control traffic generated , are used as the key performance indicators. We also show that the proposed protocol is resilient to dynamic topology changes.

A Safe Proactive Routing Protocol SDSDV for Ad Hoc Network

In mobile Ad Hoc network, nodes move freely, this can lead to frequent changes of network topology. Routing protocol algorithm is the strategy to establish communication links for network nodes, and its performance influences the availability of Ad Hoc network directly. By using wireless channel to transmit data in Ad Hoc network, the invaded malicious nodes will cause various attacks, aim to steal the transmission data or destroy the network. Based on the traditional proactive routing protocol for Ad Hoc network, an improved safe routing strategy SDSDV is put forward to resist attacks against routing protocols. The safe proactive routing protocol includes route request and route response two stages. When the network initialization is complete, after successful identity authentication by each other, secure communication paths are established between nodes and the encrypted data will be transmission through the path. The protocol integrates distributed authentication, encryption algorithm, hash check, and other security policy together. SDSDV protocol reduces the risk of malicious manipulation of routing information and ensures the safe and reliable routing between the source and destination nodes.

DETECTING SINKHOLE ATTACK IN MANET USING OLSR ROUTING PROTOCOL WITH ARTIFICIAL INTELLIGENCE

Security is the most basic requirement in MANET so that the confidential information cannot be stolen by the hackers. Routing protocols attacks are mainly occurs in MANET to steal the information by informing them a wrong route. Sinkhole attack is one of the most commonly occurred attack in the MANET. In sinkhole attack, a burglar hops broadcast immoral routing message to produce itself as a specific hop and consider that a network will transfer all the information by itself. After entertaining whole network information, it modify the secret information, such as data packet may changes or drops the packets to make the network very complex. In the proposed work, OLSR (Proactive link state routing protocol) protocol will be used to find the route between source and destination within the Mobile –ad-hoc network. This protocol will used hello and topology control message to find the route within the network. The performance of OLSR will be improved by using OLSR in combination with ABC algorithm. ABC is an optimization technique that will used to improve the performance on the basis of population based search procedure. After applying these two approaches the performance parameters of the MANET like Throughput, delay, energy consumption and Bit error rate will be determined. Also, a classification technique known as artificial neural network will be applied to solve the problem occur in the network after applying ABC. Thus parameters like Throughput, Delay, Mean Square error, bit error rate and energy consumption will be calculated. The simulation of the research work will be carried out in MATLAB environment.

Energy efficient collaborative proactive routing protocol for Wireless Sensor Network

A Wireless Sensor Network (WSN) is a group of tiny power-constrained nodes that cover a vast region of interest (ROI), sense and communicate it to the Base Station (BS). The main challenge encountered in WSNs is how to cover the ROI perfectly and transmit the monitored data to the BS for the longest possible time. Although many energy-efficient routing protocols for periodic monitoring applications were recently introduced, the dynamic nature and complex environments of WSN applications make building such protocols a considerable challenge. In this paper, the node degree of the Degree Constrained Tree (DCT) in homogeneous proactive WSN is studied analytically for the network with one BS that is outside the ROI. Since the node degree affects the network lifetime of these types of networks, the optimum node degree for minimum energy consumption in DCT is derived. Subsequently, the paper proposes a Collaborative Distributed Antenna (CDA) routing protocol that is based on distributed antenna theory to provide fair load distribution in terms of transmission energy. CDA is based on DCT with optimal node degree and is designed for periodic data monitoring in WSN applications. The experimental results prove our analysis to emphasize that using optimal node degree in DCT doubles its network lifetime compared to using other node degrees. Moreover, adding CDA to DCT with optimal node degree is proved to double the network stability period and reduce the ratio between instability period and the network lifetime to its half. It also shows 25% increase in network lifetime and minimum rate of node loss compared to its peers, such that the lifetime of half the nodes is preserved until few rounds before the end of network lifetime.