Routing Algorithm For Networks Research Articles

Void hole avoidance routing algorithm for underwater sensor networks

A communication void is one of the most serious issues in any routing techniques. This issue occurs when a node does not have any forwarder node to forward the data packets towards the sink node or surface station. The presence of a void node affects the overall performance of routing techniques in terms of end-to-end delay, data loss, energy consumption, and so on. The primary objective of this work is to avoid the void region in underwater sensor networks (UWSNs). For the same purpose, this work introduces the void-hole avoidance routing algorithm for UWSNs. This work avoids horizontal transmission, which further reduces the end-to-end delay. The residual energy, depth, holding time, and distance from the sending node to the forwarding node and forwarding node to the surface station are used as a matrix to select the best forwarder node. The simulation has been done on MATLAB to analyse the performance of the proposed algorithm. The proposed routing algorithm attained better performance using the metrics, namely packet delivery delay, number of dead nodes, and energy tax with the values of 0.9147, 48, and 72.14 by varying the transmission range, and 0.9184, 38, and 71.12 by varying the network size, respectively.

An Efficient Cooperative Routing Algorithm for Large-Scale Wireless Networks based on Capacity and Location

Cooperative communication has been extensively used in small-scale wireless networks, by virtue of its capability to mitigate the fading effects. Extending cooperative communication technique to large-scale networks undergoes severe interference; multi-radio-multi-channel is exploited in large scale wireless networks to ameliorate throughput by concurrent transmissions over orthogonal channels to dwindle interference. Capitalising on these potential advantages, stand in need for efficacious routing and potent mapping of channels to radios. In this paper, we have proffered an algorithm by concurrently considering: 1) relay selection using distance and maximum-available-channel-capacity parameters; 2) channel assignment using dynamic global table. Our algorithm selects a relay-node based on the available channel capacity in the shortest-path to minimise the transmission delay without affecting aggregate throughput. The evaluation and analysis of the proposed model is compared with interference-aware-cooperative-routing algorithm and observed that the proposed algorithm has improved delay reduction by 27.5% and the average number of hops by 32.5%.

A Routing Algorithm for Delay Tolerant Networks

Based on the limitations of traditional submission ratio of Prophet caused by the performance difference and state difference of nodes in the new service environment, and the idea of utility quantization, a Prophet-BSAS algorithm based on node state was designed. The utility parameters and utility functions of the improved algorithm were analyzed in detail, and the performance of Prophet-BSAS and other classical routing algorithms was simulated and analyzed under the typical mobility model.

Utility-Based Wireless Routing Algorithm for Massive MIMO Heterogeneous Networks

With the development of 5G communication, massive multiple input multiple output (MIMO) technology is getting more and more attention. Massive MIMO uses a large amount of simultaneous transmitting and receiving antennas to reduce power consumption and raise the level of transmission quality. Meanwhile, the diversification of user equipment (UE) in the 5G environment also makes heterogeneous networks (HetNets) more prevalent. HetNets allow UE of different network standards to access small cells, while the base stations of small cells access a macro base station (BS) to form a multihop wireless heterogeneous backhaul network. However, how to effectively combine these two technologies by efficiently allocating the antennas of each BS during the route construction process of heterogeneous wireless backhaul networks is still an important issue that is yet to be solved. In this paper, we propose an algorithm called preallocated sequential routing (PSR). Based on the links’ channel conditions and the available antennas and location of BSs, it builds a wireless heterogeneous network backhaul topology and adjusts each link’s transmitting and receiving antennas to maximize total utility. Simulation results showed that the proposed algorithm significantly improved the overall utility and the utility of the outer area of heterogeneous networks.

Social characteristics-based routing algorithm for a mobile social network

Utilization of social characteristics presents a modern approach in the design of routing protocols for Mobile Social Networks. In this paper, we present a novel routing algorithm called the Social Characteristics-based Distributed Routing Algorithm (SCDRA) for a Mobile Social Network. SCDRA explores community and friendship as social features to effectively route messages. In SCDRA, nodes develop their community in a distributed way based on the concept of a familiar set. Merging of communities of nodes is governed by certain rules. Friendship in SCDRA evolves based on various factors like inter-contact duration, frequency of encounters and successful delivery of messages forwarded in a few past time intervals between the nodes. Routing of messages is accomplished by utilizing community and friendship as social characteristics. Extensive simulation studies performed show that the proposed algorithm performs better when compared to existing algorithms such as Bubble rap, SMART and EpSoc for performance metrics like delivery ratio, overhead ratio and average delivery latency in various scenarios.

An Enhanced Dynamic Source Routing Algorithm for the Mobile Ad-Hoc Network using Reinforcement learning under the COVID-19 Conditions

Today, the use of computer networks is evident in all walks of life, including mobile phones, vehicles, personal computers, the workplace and more. Creating and operating networks between each of the above-mentioned devices require good infrastructure to be able to communicate between these devices. To solve this problem, there were networks called ad-hoc networks, which were able to network with each other without the need for specific infrastructure and only through direct and wireless communication between the equipment. But how to make the right connections in these types of networks, as well as high-speed communication for devices, are also challenges for researchers. In this study, we try to implement the communication between these devices by the DSR routing algorithm and, using the Q learning technique of the reinforced learning algorithm, we enhance it to respond to QOS in Ad-Hoc mobile networks compared to previous solutions. In addition to what has been improved in this article. In the following articles, we will try to improve the discussion of communication security using this method and also apply this method to routing VANETs networks.

Routing algorithm based on triangular fuzzy layer model and multi‐layer clustering for opportunistic network

With the development of 5G network and big data and the popularity of mobile intelligent devices, the opportunistic social network has been further developed. At present, several existing routing algorithms based on node similarity use the context information of the node to select the best relay node. However, most opportunistic social algorithms only consider the social properties of nodes and ignore the importance of the similarity of the moving trajectories of the nodes. The transmission opportunity of messages in the opportunity social network is generated by the movement of the nodes, so this feature must betaken into account in the designing of the routing algorithm. Therefore, this study proposes a routing algorithm based on the triangular fuzzy layer model and multi-layer clustering for the opportunistic social network. In this study, the authors use the fuzzy analytic hierarchy process model to analyse the social similarity and trajectory similarity to determine the best message transmission node. This study compares the other four opportunistic social network routing algorithms in the simulation environment. In general, among the five routing algorithms, the transmission rate of the TFMC algorithm is the best. The average end-to-end delay and average network overhead are also the lowest.

Routing Improvement in Underwater Wireless Sensor Networks for Energy Saving Purposes

Underwater wireless sensor networks have attracted much attention in various applications such as natural disasters monitoring, defense, industries, etc. A new routing algorithm for underwater wireless sensor networks is developed and tested. The algorithm shows a better end-to-end delay yet less energy consumption. This was achieved by limiting the data transmission to a number of specific adjacent nodes to whom the transmitter is authorized to send the message. The algorithm performance was compared with other algorithms (depth based routing and cooperative depth based routing protocols) and the results show a better performance.

Towards an efficient combination of adaptive routing and queuing schemes in Fat-Tree topologies

The interconnection network is a key element in High-Performance Computing (HPC) and Datacenter (DC) systems whose performance depends on several design parameters, such as the topology, the switch architecture, and the routing algorithm. Among the most common topologies in HPC systems, the Fat-Tree offers several shortest-path routes between any pair of end-nodes, which allows multi-path routing schemes to balance traffic flows among the available links, thus reducing congestion probability. However, traffic balance cannot solve by itself some congestion situations that may still degrade network performance. Another approach to reduce congestion is queue-based flow separation, but our previous work shows that multi-path routing may spread congested flows across several queues, thus being counterproductive. In this paper, we propose a set of restrictions to improve alternative routes selection for multi-path routing algorithms in Fat-Tree networks, so that they can be positively combined with queuing schemes.

Energy-efficient and SDN-enabled routing algorithm for wireless body area networks

Wireless Body Area Networks (WBANs) are one of the special branches of Wireless Sensor Networks (WSNs) that attract attention in various disciplines such as health, engineering, biology, and computers. Also, WBANs are an important research area that can contribute to human life and health in many ways. The Software-Defined Networking (SDN) approach is a solution that can make simpler, flexible, manageable, and more efficient the heterogeneous and complex network structures, such as WBANs. In the Software-Defined WBAN (SD-WBAN) architecture, it is of great importance to extend the network lifetime due to the limited energy of the sensor nodes and the routing process is one of the most important energy consumption processes of SD-WBANs. For an effective and efficient routing approach, service quality requirement parameters, for example, throughput, energy efficiency, end-to-end delay, and packet transmission rates need to be considered. In this study, a new energy-efficient and SDN-enabled routing algorithm (ESR-W) has been developed with the use of the Fuzzy-based Dijkstra technique. So, the most appropriate route determination is performed with a central and reactive (on-demand) approach among many SD-WBAN users. SNR, battery level and hop count metrics are used for routing decisions. In order to compare ESR-W with existing protocols AODV and SDNRouting, extensive scenarios and simulations have been performed in the Riverbed Modeler simulation software. According to the results, ESR-W has been observed very successful compared to other protocols in terms of throughput, end-to-end delay, packet transmission rate, and energy consumption.

Research of Routing Algorithms in SON Networks Using Simulation Predictive Modeling Software

Research of Routing Algorithms in SON Networks Using Simulation Predictive Modeling Software

Performance analysis of ant-lion optimization based routing algorithm for wireless sensor networks

PurposeThe miniscule wireless sensor nodes, engaged in the wide range of applications for its capability of monitoring the physical changes around, requires an improved routing strategy with the befitting sensor node arrangement that plays a vital part in ensuring a completeness of the network coverage.Design/methodology/approachThis paves way for the reduced energy consumption, the enhanced network connections and network longevity. The conventional methods and the evolutionary algorithms developed for arranging of the node ended with the less effectiveness and early convergence with the local optimum respectively.FindingsThe paper puts forward the befitting arrangement of the sensor nodes, cluster-head selection and the delayless routing using the ant lion (A-L) optimizer to achieve the substantial coverage, connection, the network-longevity and minimized energy consumption.Originality/valueThe further performance analysis of the proposed system is carried out with the simulation using the network simulator-2 and compared with the genetic algorithm and the particle swarm optimization algorithm to substantiate the competence of the proposed routing method using the ant lion optimization.

A performance study of dynamic routing algorithm for SDM translucent optical networks with assistive storage

In this paper, we focus on dynamic lightpath provisioning in translucent spectrally spatially flexible optical networks (SS-FONs) created with a combination of both spectral (EON) and spatial (SDM) flexibility. We utilize the distance-adaptive transmission (DAT) in order to select a modulation for request and routing path in a flexible manner. Moreover, we assume that the signal regeneration is realized with the application of optical transceivers operating in a back-to-back (B2B) configuration. Finally, we propose a novel routing framework for SS-FONs, which involves performing Store-and-Forward (SnF) using Assistive Storage (AS), to reduce peak traffic demand and to better the utilization of network bandwidth. We design different test scenarios, varying in Assistive Storage availability, with and without modulation conversion during the B2B regeneration process and different real-life network topologies. In order to be able to compare the results of test scenarios, we propose a dynamic routing algorithm named adaptive routing with B2B regeneration and Assistive Storage (ARB2BAS) that solves routing, space and spectrum allocation (RSSA) optimization problem. We study how different flexibility aspect affects the network blocking performance, namely the Bandwidth Blocking Probability (BBP) metric. The obtained results show that the proper selection of an algorithm (scenario) has a significant impact on network performance in terms of the blocking probability. Moreover, introducing Assistive Storage enables the network to serve more requests for all of the studied B2B scenarios and network topologies.

An Elite Hybrid Metaheuristic Optimization Algorithm for Maximizing Wireless Sensor Networks Lifetime With a Sink Node

Energy saving becomes a central issue in the design of wireless sensor networks routing algorithms. The objective of this study is to maximize the survival time of wireless sensor networks routing with a sink node by developing an efficient routing algorithm based on the elite hybrid metaheuristic optimization algorithm. The proposed algorithm comes as an original method that innovatively brings together the global search abilities of the particle swarm optimization algorithm, difference operator of differential algorithm and pheromones of ant-colony optimization algorithm in order to avoid local search and retain diversity of the population. As a result, the method quickly finds an optimal solution. A novel routing algorithm based on the proposed elite hybrid metaheuristic optimization algorithm is designed. Comprehensive simulation studies show that the proposed algorithm can increase maximum lifetime of wireless sensor networks by 38% in comparison with the results being produced with the state-of-the art algorithm routing algorithms based on other population-based optimization algorithms.

A Dynamic Routing Path Reduction Protocol in Underwater Wireless Sensor Network

Recently, underwater wireless sensor networks (UWSNs) have emerged as a promising networking technique for various underwater applications. An energy efficient routing protocol plays a vital role in data transmission and practical applications. However, due to the specific characteristics of UWSNs, such as dynamic structure, narrow bandwidth, rapid energy consumption, and high latency, it is difficult to build routing protocols for UWSNs. In this paper, We propose a location aware opportunistic routing algorithm for under water communication. We analyse three main problems in under water communication; forwarding set selection forwarding set ranking to handle FSR problem, void handling method to handle the communication void (CV) and overhear and suppression procedure to deal with duplicate forwarding suppression (DFS) problems. The importance of the work is that it will provide an energy efficient pressure based opportunistic routing algorithm for wireless sensor network (UWSN). The routing protocol has been implemented in the ns2-AqaSim simulator and testbed for measurement of the performance metrics of the UASN. The simulation results showed that the novel routing method throughput has increased by 16%, 33%, and 55% when compared with SUN, VBF and DF method. It can effectively improve the throughput of nodes, balance positioning performance as well as energy use efficiency, and optimize the positioning result of UWASN.

Intrusion Detection System in Wireless Sensor Networks by using Lesser Algorithm

Wireless sensor networks (WSNs) are vulnerable to various types of security threats that may degrade the performance of the entire network. This problem could not provide protection for the attacks on key management and authentication protocols during fatal issues such as service denial attacks, routing attacks, sybil attacks and few other. Over the last few years, researchers have developed different distributed and centralized intrusion detection systems for wireless sensor networks but not reached to a higher performance level. A solution to this problem is the proposed Intrusion Detection System (IDS) with an implementation of more efficient algorithms that can perform routing decisions at every node. There are a couple of routing algorithms in the wireless sensor network which use topology data and takes routing decisions instantly. Extensions to the original position-based algorithm were subsequently presented to perform even more efficiently in conditions where they do not operate. Host growth brings about a route transition, which causes some network to settle on new routes. For ad hoc networks certain routing protocols have already been proposed. The fundamental idea is to allow cellular beneficiaries with bad channel conditions to use the ad hoc network to connect to those cellular collectors who experience great cellular channel conditions. The proposed system can also analyze the network by collecting enough data and detects irregular sensor node(s) behaviour. Finally, the current article explains the implementation of the lower algorithm in sensor networks for evaluating the network intrusion detection system.

Topology analysis and routing algorithms design for PTNet network

SummaryData center network (DCN) is used for transmission, storage, and processing of big data, which plays an important role in cloud computing and CDN distribution. Network topology and routing algorithm are its core research content and key technical issues. The traditional network topology is difficult to guarantee the quality of service in scalability and fault tolerance. The server‐centric DCN topology can ensure the scale of the DCN by recursively increasing the number of network nodes and links. Relative to the Dcell, BCube, and BCCC typical network topology, PTNet network as a typical representative of a new type of the server‐centric DCN topology, which has more advantages in scalability, fault tolerance, and so on. The PTNet network topology is theoretically analyzed in terms of network diameter, bottleneck throughput, and total number of links in the network. Based on the deep research of PTNet network, this article analyzes and studies the network topology, multicast, and broadcast routing algorithm.

Energy Efficient and Reliable Routing Algorithm for Wireless Sensors Networks

In energy-constrained wireless sensor networks, low energy utilization and unbalanced energy distribution are seriously affecting the operation of the network. Therefore, efficient and reasonable routing algorithms are needed to achieve higher Quality of Service (QoS). For the Dempster–Shafer (DS) evidence theory, it can fuse multiple attributes of sensor nodes with reasonable theoretical deduction and has low demand for prior knowledge. Based on the above, we propose an energy efficient and reliable routing algorithm based on DS evidence theory (DS-EERA). First, DS-EERA establishes three attribute indexes as the evidence under considering the neighboring nodes’ residual energy, traffic, the closeness of its path to the shortest path, etc. Then we adopt the entropy weight method to objectively determine the weight of three indexes. After establishing the basic probability assignment (BPA) function, the fusion rule of DS evidence theory is applied to fuse the BPA function of each index value to select the next hop. Finally, each node in the network transmits data through this routing strategy. Theoretical analysis and simulation results show that DS-EERA is promising, which can effectively prolong the network lifetime. Meanwhile, it can also reach a lower packet loss rate and improve the reliability of data transmission.

Study on the algorithm for smart community sensor network routing with adaptive optimization via cluster head election

AbstractTo reduce the uneven energy consumption for the data transmission and extend network life of intelligent community sensor network, an adaptive routing optimized algorithm for intelligent community sensor networks with cluster head election is proposed. In this algorithm, a three‐dimensional clustering method adapted to the structure of intelligent community sensor network is proposed. The three‐dimensional clustering method uses the cluster head election mechanism based on minimizing the total transmission loss to optimize the energy of the intelligent community sensor network. Second, an adaptive ant colony propagation method is proposed to solve the problem of intercluster data propagation after clustering. With the best path finding algorithm of ant colony algorithm, energy balance routing with lower energy loss and lower packet error rate is proposed. Finally, the simulation results show that the algorithm has better performance in reducing energy consumption and delay, improving transmission efficiency and node survival time.

Physical layer impairments aware routing and spectrum allocation algorithm for transparent flexible-grid optical networks

In this paper, we discuss physical layer impairments (PLIs) aware routing and spectrum allocation (RSA) algorithm for the transparent flexible-grid optical networks. The flexible-grid optical networks have the capability of delivering data with multi-rate, multi-reach, high spectrum efficiency, high flexibility, and low bit error rates (BER). However, in transparent flexible-grid optical networks, as the transmission distance increases, optical signals are subject to traverse over many bandwidth-variable wavelength cross connects (BV-WXCs) and multiple fiber spans. As a result, the PLIs get accumulated and are added to the optical signal. These accumulated impairments degrade the signal quality to an unacceptable level at the receiver. Hence, the quality of transmission (QoT) falls below the acceptable threshold value and making it hard for the receiver to detect the signal properly. This problem has not received enough attention in the literature yet. Therefore, our objective is to develop an impairments aware RSA algorithm, which establishes the QoT satisfied flexpath based on the available resources and the quality of the signal available at the receiver. We formulate the PLIs-aware RSA problem as an integer linear program (ILP) that provides an optimal solution. We propose a PLIs-aware heuristic algorithm for large-size networks where ILP is not efficient. Using extensive simulation results, we compute the total blocking probability and the spectrum efficiency. The results show that our algorithm outperforms in terms of blocking probability and spectrum utilization.