Routing Algorithm For Networks Research Articles

Competitive swarm optimization based unequal clustering and routing algorithms (CSO-UCRA) for wireless sensor networks

Cluster based routing approaches have been researched extensively for saving energy of wireless sensor networks (WSNs). In a cluster based routing mechanism, cluster heads (CHs) cooperate mutually to forward their data to the base station (BS) through multi-hop fashion. Due to this process, CHs near to the BS loaded with huge relay traffic and tend to die quickly, which causes partition of the network is popularly known as a hot-spot problem. To tackle the hot-spot problem, in this paper, competitive swarm optimization (CSO) based algorithms have been proposed, jointly call these algorithms as CSO-UCRA (CSO based Unequal Clustering and Routing Algorithms). First, the CH selection algorithm has been presented which is based on CSO based technique, next assign the non-CH sensors to CHs based on the derived CHproficiency function. Finally, a CSO based routing algorithm has been presented. Efficient particle encoding schemes and novel fitness functions have been developed for these algorithms. The CSO-UCRA is simulated extensively with varying number of sensor nodes and CHs for various WSN scenarios, and the obtained results are compared with some recent devised algorithms and standard meta-heuristic based algorithm called PSO-UCRA to show the efficiancy in terms of various performance metrics. CSO-UCRA shows decreased energy consumption of 28.48%, 22.55%, 12.92%, and 3.81%, increased network lifetime of 56.92%, 46.02%, 26.2%, and 8.04% and increased data packets received 73%, 52.5%, 20.8%, and 6.18% over EBUC, EAUCF, EPUC and PSO-UCRA respectively.

Fault-tolerant routing algorithm based on disjoint paths in 3-ary n-cube networks with structure faults

The 3-ary n-cube network is widely used in large-scale multi-processor parallel computers. It is an important issue to design high-performance communication technology with fault tolerance. In this paper, we study the fault-tolerant routing of 3-ary n-cube without desired intersection. Firstly, we propose a fully adaptive routing algorithm for 3-ary n-cube network based on the new virtual network partition technology. The virtual channel allocation of the algorithm is given and its deadlock free property is proved. Secondly, we propose a construction of disjoint paths in 3-ary n-cube networks under the fault model. Finally, we propose a novel fault-tolerant routing algorithm for 3-ary n-cube networks based on the disjoint path with structure faults. The simulation results show that the proposed fault-tolerant routing algorithm outperforms the previous fault-tolerant routing algorithm in many situations, which has a 19–21 percent increase in throughput and the injection rate.

Scale‐free topology security mechanism of wireless sensor network against cascade failure

SummaryAs the basic architecture of the Internet of things, wireless sensor networks are the most important technical means to detect data on the Internet of things, and their security is essential to the development and implementation of the Internet of things. The wireless sensor network based on the scale‐free theory has strong fault tolerance when random nodes fail and can better adapt to the unsupervised and complex environment of wireless sensor networks. However, in a wireless sensor network with scale‐free function, the unevenness of its degree distribution causes some nodes to be very critical in the network. Once attacked, it will cause major damage to the network. Selective promotion attacks are relatively common. At the network level, the attacker destroys the normal collection of network data by selectively losing information or not forwarding sensitive information, which is extremely harmful to the network using this function. In order to overcome the influence of excessive dependence on a single path on the balance performance of the network, starting from the entire network, a secure multi‐path routing algorithm for wireless sensor networks based on scale‐free topology is proposed. Through the analysis of the network topology, the highest degree network node can be found. Optimize the load factor, use digital watermarking technology to locate the network path packet loss rate, and perform Gaussian modeling on the packet loss rate. Then the routing loading function and the routing packet loss rate are used as the confidence model factors to create the routing confidence model. We must first establish a model, select the transmission path according to the received function, and then obtain the global optimal security sensor routing algorithm. Through the algorithm in this thesis, the security of the wireless sensor network is improved by 17%.

Routing algorithms for the shuffle-exchange permutation network

For a natural number n, let $$S_n$$ denote the symmetric group on n letters. Let $$\textit{SEP}_n$$ be the Cayley graph $$\text {Cay}(S_n,\{\sigma ,\sigma ^{-1},\tau \})$$ , where $$\tau =(12)$$ and $$\sigma =(1,\ldots , n)$$ . In this note, we present an easy static routing algorithm for $$\textit{SEP}_n$$ which gives us an exact formula for the path between every pair of nodes in $$\textit{SEP}_n$$ and it does not need any calculations. Also, we show that an upper bound of this algorithm is $$\lfloor {(3n+1)^2/ 9}\rfloor$$ . Furthermore, we use our results to present a dynamic routing algorithm for $$\textit{SEP}_n$$ which needs at most n calculations for routing and also it does not need large amount of memory for routing tables.

An energy-saving routing algorithm for opportunity networks based on asynchronous sleeping mode

The opportunistic network is based on the idea of "Store-Carry-Forward" between nodes which haven't complete communication links. It uses the encounter opportunity presented by node mobility to establish a route to realize communication. The traditional Epidemic algorithm uses the flooding mechanism which greatly increases the energy consumption of nodes, and it is often unable to supplement the energy of nodes at any time in the application environment of the opportunistic network. Therefore, this paper proposes an asynchronous sleep mechanism, which allows nodes to judge whether to enter the sleep state according to their own energy situation, real-time state and other information. It ensures that the nodes do not miss the possible communication opportunities by dynamically controlling the sleep time and wake-up time. The simulation results show that the proposed EASE algorithm can guarantee the network performance and greatly reduce the energy consumption of nodes compared with the classical opportunistic network routing algorithms.

Distributed energy balance routing algorithm for wireless sensor network based on multi-attribute decision-making

The clustering routing protocol proposed in this paper is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. Stable Election Protocol (SEP) is a clustering routing protocol proposed for secondary heterogeneous networks. Unlike LEACH, it is not a round-robin algorithm based on the number of nodes, but based on energy balance. This article first promotes SEP and adapts it to multi-level heterogeneous networks. On this basis, the Stable Election Protocol Energy Consider (SEP-EC) algorithm based on node residual energy is proposed, and its feasibility is proved theoretically. The research results show that for the Ad Hoc network with high load, high mobility and energy limitation, the load energy balance multi-path routing protocol proposed in this paper can not only effectively use multiple paths with better quality, but also can perceive path stability in real time. It terminates the call of unstable path early, and effectively reduces the packet loss rate, delay and route discovery frequency of Ad Hoc network. The average end-to-end delay of the SEP-EC protocol proposed in this paper is 0.52 s, and the average remaining surviving nodes is 83.5%.

A wireless weak-connected network routing algorithm inspired by Physarum polycephalum

Wireless weak-connected network (WWN) is a special self-organizing network, which can self-organize in an unstructured style and communicate with each other without infrastructure support. In this network, the link connection is weak and the topology is dynamic, which limits the performance of routing tasks. In order to address this issue, a novel Physarum-inspired routing algorithm (P-iRA) is proposed based on the intelligence and adaptability of Physarum polycephalum. Firstly, we construct a link capacity model for WWN via mapping the Physarum polycephalum network. Then, we design a next-hop selection strategy to obtain an optimal forwarding node in candidate set. Finally, we present a stochastic route strategy to achieve data transmission by virtue of finding the best routing path. Simulation results demonstrate that P-iRA improves approximately 47%, 34%, 56%, 20%, and 8% compared with Direct Delivery, Epidemic, First Contact, MaxProp, and Spray And Wait, respectively.

Optimized Traffic And Enhanced Lifetime Routing Algorithm In WSN


 
 
 
 Abstract:
 Wireless Sensor Networks (WSNs) have gained significant traction as a viable solution for a diverse range of applications that necessitate the monitoring and regulation of distant environments. Wireless sensor networks (WSNs) are frequently constrained by the energy resources of the individual sensor nodes, resulting in network failures and reduced operational lifetimes. In response to this challenge, we present a proposed optimised traffic and lifetime routing algorithm for Wireless Sensor Networks (WSNs). The algorithm has been specifically designed to minimise network traffic and ensure equitable energy consumption across all sensor nodes. The algorithm utilises a fusion of clustering and network coding methodologies to leverage spatial diversity and redundancy within the network. The performance of the proposed algorithm is assessed through simulation experiments and is juxtaposed with various contemporary routing algorithms. The findings indicate that the algorithm we employed exhibits superior performance compared to other algorithms with respect to network longevity, network flow, and energy usage. The algorithm under consideration exhibits potential for utilisation in diverse Wireless Sensor Network (WSN) applications that necessitate dependable and energy-efficient data transmission.
 
 
 

Load Balancing Oriented Predictive Routing Algorithm for Data Center Networks

A data center undertakes increasing background services of various applications, and the data flows transmitted between the nodes in data center networks (DCNs) are consequently increased. At the same time, the traffic of each link in a DCN changes dynamically over time. Flow scheduling algorithms can improve the distribution of data flows among the network links so as to improve the balance of link loads in a DCN. However, most current load balancing works achieve flow scheduling decisions to the current links on the basis of past link flow conditions. This situation impedes the existing link scheduling methods from implementing optimal decisions for scheduling data flows among the network links in a DCN. This paper proposes a predictive link load balance routing algorithm for a DCN based on residual networks (ResNet), i.e., the link load balance route (LLBR) algorithm. The LLBR algorithm predicts the occupancy of the network links in the next duty cycle, according to the ResNet architecture, and then the optimal traffic route is selected according to the predictive network environment. The LLBR algorithm, round-robin scheduling (RRS), and weighted round-robin scheduling (WRRS) are used in the same experimental environment. Experimental results show that compared with the WRRS and RRS, the LLBR algorithm can reduce the transmission time by approximately 50%, reduce the packet loss rate from 0.05% to 0.02%, and improve the bandwidth utilization by 30%.

DORA: A Destination-Oriented Routing Algorithm for Energy-Balanced Wireless Sensor Networks

This research presents a new multichain routing strategy named the destination-oriented routing algorithm (DORA). The proposed design generates a new multichain routing scheme to transmit packets for energy-balanced WSNs. Based on the multichain routing, the optimal transmission distance between any two nodes is derived by the mathematical analysis model. With the optimal distance, the design criterion is to select the furthest forwarding node within the communication range and the direction to the sink, thus forming the multichain structures by accurate distance, direction, and multiple paths. With the shorter chain routing, unnecessary energy loss can be reduced to prolong the global network lifespan. The simulation results demonstrate that the proposed DORA doubles the network lifespan, compared with that of conventional PEGASIS and improves 60% lifespan on the RPC protocol.

A survey on routing algorithms for opportunistic mobile social networks

Opportunistic Mobile Social Networks (OMSNs) are kind of Delay Tolerant Networks (DTNs) that leverage characteristics of Mobile Ad Hoc Networks (MANETs) and Social Networks, particularly the social features, to boost performance of routing algorithms. Users in OMSNs communicate to share and disseminate data to meet needs for variety of applications. Such networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city initiatives. Devices carried by human is the carrier of message transmission, so the social features of human can be used to improve the ability of data transmission. In this paper, we conduct a comparative survey on routing algorithms in OMSNs. We first analyze routing algorithms based on three social features. Since node selfishness is not really considered previously in aforementioned routing algorithms, but has significant impact on network performance, we treat node selfishness as another social feature, classify and elaborate routing algorithms based on incentive mechanism. To assess the impact of social features on routing algorithms, we conducted simulation for six routing algorithms and analyzed the simulation result. Finally, we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.

Energy Efficient Routing Algorithm Based on Harmony Search

Under the premise of limited node energy, an efficient and energy-saving wireless sensor network routing algorithm was proposed to prolong the lifetime of overall network. By analysing the operation pattern of wireless sensor network, the energy model and transmission model was introduced, and BTPHS algorithm based on the above two was proposed. BTPHS algorithm divided the network lifetime into 3 periods. According to the characteristics of the energy distribution and energy consumption in different periods of the network, two new node selection strategies were proposed and a new objective function as a reference standard was provided. The adjustment process of the HS algorithm is abandoned, which makes less parameters in proposed routing algorithm. The experiment results indicate that BTPHS algorithm can prolong the lifetime of overall WSN network effectively.

A Systematic Review of Routing Algorithms for Wireless Sensor Networks

A Systematic Review of Routing Algorithms for Wireless Sensor Networks

Identifying the sequence specificities of circRNA-binding proteins based on a capsule network architecture

BackgroundCircular RNAs (circRNAs) are widely expressed in cells and tissues and are involved in biological processes and human diseases. Recent studies have demonstrated that circRNAs can interact with RNA-binding proteins (RBPs), which is considered an important aspect for investigating the function of circRNAs.ResultsIn this study, we design a slight variant of the capsule network, called circRB, to identify the sequence specificities of circRNAs binding to RBPs. In this model, the sequence features of circRNAs are extracted by convolution operations, and then, two dynamic routing algorithms in a capsule network are employed to discriminate between different binding sites by analysing the convolution features of binding sites. The experimental results show that the circRB method outperforms the existing computational methods. Afterwards, the trained models are applied to detect the sequence motifs on the seven circRNA-RBP bound sequence datasets and matched to known human RNA motifs. Some motifs on circular RNAs overlap with those on linear RNAs. Finally, we also predict binding sites on the reported full-length sequences of circRNAs interacting with RBPs, attempting to assist current studies. We hope that our model will contribute to better understanding the mechanisms of the interactions between RBPs and circRNAs.ConclusionIn view of the poor studies about the sequence specificities of circRNA-binding proteins, we designed a classification framework called circRB based on the capsule network. The results show that the circRB method is an effective method, and it achieves higher prediction accuracy than other methods.

Model-based evaluation of the power versus performance of network routing algorithms

In order to optimize traffic flows and power consumption of network components, various green routing algorithms and protocols have been proposed. These algorithms and protocols apply different techniques to attain their own goals. One of the most important techniques is the sleep-scheduling technique that switches the status of the network components, nodes or links, into active/inactive modes. There are four characteristics affecting the power and performance of communication networks which distinguish green routing algorithms and protocols, namely the sleep-scheduled component, decision structure, network traffic awareness, and quality of service awareness. In this paper, a method is proposed to model, evaluate, and compare the power and performance of the green routing algorithms that use the sleep-scheduling technique. We apply stochastic activity networks to model and analyze the routing algorithms with respect to the network topology. The results obtained from the comparison of the algorithms, validated with the OMNeT++ simulator, can be used by network administrators to make the right decisions.

WITHDRAWN: Sequence number based secure routing algorithm for IoT networks

Internet of Things (IoT) is one among the rapid growing networks, commonly used in smart mobile devices such as laptops, tablets, smartphones, etc. Due to the dynamic nature and partial resource availability of the IoT nodes, its communication links between intermediate relay nodes may fail frequently and this will affect the routing performance of the network. While designing secure routing algorithm for IoT networks, limits in existing proactive and reactive routing protocols creates challenges. Also due to Mobility, Bandwidth, Energy Constraints, Routing cost and Delay, the availability of the nodes may vary from node to node and thus causing an issue in identifying the positions of mobile malicious nodes. To overcome these issues, in the present paper Sequence Number based Secure Routing (SNSR) algorithm has been implemented using existing IoT packet structure. The objective of this paper is to maximizes the packet delivery ratio and network life-time in order to improve the network performance. On comparing simulation results of SNSR algorithm with AODV and ABR routing algorithm, SNSR algorithm produced better performance of 95% than others.

An IPv6 Passive‐Aware Network Routing Algorithm Based on Utility Value Combined with Deep Neural Network

Passive sensing networks can maintain the operation of the network by capturing energy from the environment, thereby solving the energy limitation problem of network nodes. Therefore, passive sensing networks are widely used in data collection in complex environments. However, the complexity of the network deployment environment makes passive sensing nodes unable to obtain stable energy from the surroundings. Therefore, better routing strategies are needed to save network energy consumption. In response to this problem, this paper proposes an IPv6 passive‐aware network routing algorithm for the Internet of Things. This method is based on the characteristics of passive sensing networks. By analyzing the successful transmission rate of the network node transmission link, transmission energy consumption, end‐to‐end transmission delay, and waiting delay of IPv6 packets, the utility evaluation function of the route is obtained. After the utility evaluation function is obtained, the network routing is selected through the utility evaluation function. Then, the utility value and the deep neural network method are combined to train the classification model. The classification model assigns the best routing strategy according to the characteristics of the current network, thereby improving the energy consumption and delay performance of the network.

TECHNOLOGICAL MODEL AND SUSTAINABILITY ASSESSMENT METHODOLOGY OF THE MULTISERVICE COMMUNICATION NETWORK FUNCTIONING

The modern development of multiservice communication networks (MÑN) is characterized by the desire of operators to provide users with an unlimited range of services with guaranteed quality of service (QoS). QoS is determined by the stability of the network’s functioning, that is, its ability to function without errors. The existing routing algorithms in modern networks focus the main load on the most productive sections, while the rest of the network is used quite poorly. This is confirmed by the results of studies [1,2], in which the structure of modern global communication networks is assigned to the class of small-world graphs. Obviously, that the increased connectivity of such networks determines high indicators of its stability, but at the same time, this route redundancy is poorly used by existing routing protocols to provide QoS when transmitting different traffic (triple-play: audio, video, and data) [3, 4]. There is also no work devoted to the analysis of the possibilities of sharing different routes (route parallelism) for the implementation of QoS enhancement mechanisms in the MÑN. This article discusses the technological concept of a network with route parallelism in communication networks built on the basis of the IP protocol family.

An efficient cooperative routing algorithm for large-scale wireless networks based on capacity and location

An efficient cooperative routing algorithm for large-scale wireless networks based on capacity and location

Clustering and routing algorithm for wireless sensor networks

Clustering and routing algorithm for wireless sensor networks