Research on optimal intelligent routing algorithm for IoV with machine learning and smart contract

The huge increase in the communication network rate has made the application fields and scenarios for vehicular ad hoc networks more abundant and diversified and proposed more requirements for the efficiency and quality of data transmission.To improve the limited communication distance and poor communication quality of the Internet of Vehicles(IoV),an optimal intelligent routing algorithm is proposed in this paper.Combined multiweight decision algorithm with the greedy perimeter stateless routing protocol,designed and evaluated standardized function for link stability.Linear additive weighting is used to optimize link stability and distance to improve the packet delivery rate of the IoV.The blockchain system is used as the storage structure for relay data,and the smart contract incentive algorithm based on machine learning is used to encourage relay vehicles to provide more communication bandwidth for data packet transmission.The proposed scheme is simulated and analyzed under different scenarios and different parameters.The experimental results demonstrate that the proposed scheme can effectively reduce the packet loss rate and improve system performance.

Memory-Occupied Routing Algorithms for Quantum Relay Networks

Quantum transmission experiments have shown that the success-ful transmission rate of entangled quanta in optical fibers decreases expo-nentially.Although current quantum networks deploy quantum relays to establish long-distance connections,the increase in transmission distance and entanglement switching costs still need to be considered when selecting the next hop.However,most of the existing quantum network models prefer to consider the parameters of the physical layer,which ignore the influence factors of the network layer.In this paper,we propose a meshy quantum network model based on quantum teleportation,which considers both net-work layer and physical layer parameters.The proposed model can reflect the realistic transmission characteristics and morphological characteristics of the quantum relay network.Then,we study the network throughput of different routing algorithms with the same given parameters when multiple source-destination pairs are interconnected simultaneously.To solve the chal-lenges of routing competition caused by the simultaneous transmission,we present greedy memory-occupied algorithm Q-GMOA and random memory-occupied algorithm Q-RMOA.The proposed meshy quantum network model and the memory-occupied routing algorithms can improve the utilization rate of resources and the transmission performance of the quantum network.And the evaluation results indicate that the proposed methods embrace a higher transmission rate than the previous methods with repeater occupation.

Directional Routing Algorithm for Deep Space Optical Network

With the development of science, economy and society, the needs for research and exploration of deep space have entered a rapid and stable development stage. Deep Space Optical Network(DSON) is expected to become an important foundation and inevitable development trend of future deepspace communication. In this paper, we design a deep space node model which is capable of combining the space division multiplexing with frequency division multiplexing. Furthermore, we propose the directional flooding routing algorithm(DFRA) for DSON based on our node model. This scheme selectively forwards the data packets in the routing, so that the energy consumption can be reduced effectively because only a portion of nodes will participate the flooding routing. Simulation results show that, compared with traditional flooding routing algorithm(TFRA), the DFRA can avoid the non-directional and blind transmission. Therefore, the energy consumption in message routing will be reduced and the lifespan of DSON can also be prolonged effectively. Although the complexity of routing implementation is slightly increased compared with TFRA, the energy of nodes can be saved and the transmission rate is obviously improved in DFRA. Thus the overall performance of DSON can be significantly improved.

Real-time Threshold Routing Algorithm Based on Wireless Sensor Network

[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectualization. [Method] Based on the application characteristics of Wireless Sensor Network （WSN）, the intelligent greenhouse monitoring system was designed. And for the incompleteness strategy of load balancing in the Low-Energy Adaptive Clustering Hierarchy （LEACH）, a Real- time Threshold Routing Algorithm （RTRA） was proposed. [Result] The performance of network lifetime and network delay of RTRA were tested in MATLAB and found that, within the same testing environment, RTRA can save nodes energy consumption, prolong network lifetime, and had better real-time performance than LEACH. The al- gorithm satisfies the crops＇ requirements on real-time and energy efficiency in the greenhouse system. [Conclusion] For the good performance on real-time, the de- signed intelligent greenhouse real-time monitoring system laid the foundation for the research and development of agricultural informatization and intellectualization.

Load Balancing Routing Algorithm Based on Extended Link States in LEO Constellation Network

As an important part of satellite communication network,LEO satellite constellation network is one of the hot research directions.Since the nonuniform distribution of terrestrial services may cause inter-satellite link congestion,improving network load balancing performance has become one of the key issues that need to be solved for routing algorithms in LEO network.Therefore,by expanding the range of available paths and combining the congestion avoidance mechanism,a load balancing routing algorithm based on extended link states in LEO constellation network is proposed.Simulation results show that the algorithm achieves a balanced distribution of traffic load,reduces link congestion and packet loss rate,and improves throughput of LEO satellite network.

Congestion aware routing algorithm for delay-disruption tolerance networks

There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.

A Nonuniform Clustering Routing Algorithm Based on an Improved K-Means Algorithm

In a large-scale wireless sensor network(WSN),densely distributed sensor nodes process a large amount of data.The aggregation of data in a network can consume a great amount of energy.To balance and reduce the energy consumption of nodes in a WSN and extend the network life,this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm.The algorithm uses a clustering method to form and optimize clusters,and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN.To ensure that the cluster head(CH)selection in the network is fair and that the location of the selected CH is not concentrated within a certain range,we chose the appropriate CH competition radius.Simulation results show that,compared with LEACH,LEACH-C,and the DEEC clustering algorithm,this algorithm can effectively balance the energy consumption of the CH and extend the network life.

A reliable routing algorithm based on fuzzy Petri net in mobile ad hoc networks

A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.

Reducing energy consumption optimization selection of path transmission routing algorithm in opportunistic networks

Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic networks.This algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected path.This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks.According to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks.

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.

Research on the Best Routing Algorithm of Terminal Distribution Based on the Random Factor of Road Hustling Degree

Dijkstra algorithm is a basic algorithm to analyze the vehicle routing problem (VRP) in the terminal distribution of logistics center. According to the actual client demands of service speed and quality, the conceptions of economical distance of delivery and the best routing algorithm were given on the base of the Dijkstra algorithm with consideration of a coefficient of the road hustle degree. Economical distance of delivery is the shortest physical distance between two customers. It is the value of goods delivery in shortest distance when concerning factors such as the road length, the hustle degree, the driveway quantity, and the type of the road. The improved algorithm is being used in the development and application of a distribution path information system in the terminal distribution of logistics center. The simulation and practical case prove that the algorithm is effective and reasonable.

Load balancing strategy of heterogeneous wireless networks based on multi-hop routing algorithm of ad hoc network

Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.

A DTN Oriented Adaptive Routing Algorithm Based on Node Load

In recent years,Delay Tolerant Networks(DTN)have received more and more attention.At the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network environment.This paper proposes an AdaptiveSpray routing algorithm.The algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself,and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination node.In the forwarding phase,the node will first compare the meeting probability of itself and the meeting node to the destination node,and then choose different forwarding strategies.The simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.

A routing algorithm for FPGAs with time-multiplexed interconnects

Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interconnect architecture,we propose a time-multiplexed routing algorithm that can actively identify qualified nets and schedule them to multiplexable wires.We validate the algorithm by using the router to implement 20 benchmark circuits to time-multiplexed FPGAs.We achieve a 38%smaller minimum channel width and 3.8%smaller circuit critical path delay compared with the state-of-the-art architecture router when a wire can be time-multiplexed six times in a cycle.

A Routing Algorithm for Distributed Optimal Double Loop Computer Networks

A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures,the algorithm can send a packet along the shortest path to destination; when there are failures,the packet can bypasss failed nodes and links.

TIMING-DRIVEN MULTICHIP MODULE ROUTING ALGORITHM WITH CROSSTALK CONSIDERATION

This paper presents a timing-driven MultiChip Module (MCM) routing algorithm considering crosstalk, which maximizes routing density while minimizing vias and total wire length. The routing algorithm allows a more global solution as well as the incorporation of more accurate crosstalk modeling. In addition, various time domain characteristics of MCM are analyzed in this contribution. A deembedding technique for the S -parametercalculation is presented and functions for the time-domain signals are investigated in order to decrease the computation time. Routing results show that the proposed algorithm consistently produces the better results than other previously proposed routers while offering flexibility for future incorporation of noise and delay constraints.

Wavelength Routing Algorithmof All Optical Network Based on Traffic Engineering

General multi-protocol label switching(GMPLS) based on traffic engineering is one of the possible methods to implement all-optical network. This method implements the network with IP technique and guarantees the quality of service with traffic engineering. Based on the establishment of selecting schemes of optical path and methods of traffic calculation, the wavelength routing algorithm of all-optical network based on traffic engineering is presented by combining with prior route of shortest path and traffic engineering, the algorithm procedures are given, and the actual examples are introduced as well as the analysis on simulation calculation. This research results have certain significance for the achievement of optical switching technique of all-optical network.

Location-Based Routing Algorithms for Wireless Sensor Network

Routing algorithms based on geographical location is an important research subject in the Wireless Sensor Network(WSN).They use location information to guide routing discovery and maintenance as well as packet forwarding,thus enabling the best routing to be selected,reducing energy consumption and optimizing the whole network.Through three aspects involving the flooding restriction scheme,the virtual area partition scheme and the best routing choice scheme,the importance of location information is seen in the routing algorithm.

An Evaluation of Routing Algorithms in Traffic Engineering and Quality of Service Provision of Network on Chips

Nowadays the number of cores that are integrated into NoC (Network on Chip) systems is steadily increasing, and real application traffic, running in such multi-core environments requires more and more bandwidth. In that sense, NoC architectures should be properly designed so as to provide efficient traffic engineering, as well as QoS support. Routing algorithm choice in conjunction with other parameters, such as network size and topology, traffic features (time and spatial distribution), as well as packet injection rate, packet size, and buffering capability, are all equivalently critical for designing a robust NoC architecture, on the grounds of traffic engineering and QoS provision. In this paper, a thorough numerical investigation is achieved by taking into consideration the criticality of selecting the proper routing algorithm, in conjunction with all the other aforementioned parameters. This is done via implementation of four routing evaluation traffic scenarios varying each parameter either individually, or as a set, thus exhausting all possible combinations, and making compact decisions on proper routing algorithm selection in NoC architectures. It has been shown that the simplicity of a deterministic routing algorithm such as XY, seems to be a reasonable choice, not only for random traffic patterns but also for non-uniform distributed traffic patterns, in terms of delay and throughput for 2D mesh NoC systems.

Efficient Clustering Routing Algorithm Based on Opportunistic Routing

Based on the analysis of the existing classic clustering routing algorithm HEED, this paper proposes an efficient dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select more proper nodes as the cluster head, the proposed clustering algorithm considers the shortest path prediction of the node to the destination sink and the congestion situation. In the data transmission procedure, the high-efficiency CEDOR opportunistic routing algorithm is applied into the ED-HEED as the data transmission mode between cluster headers. A novel adaptive dynamic clustering mechanism is also considered into the algorithm, as well as the data redundancy and security control. Our Simulation demonstrates that the ED-HEED algorithm can reduce the energy consumption, prolong the network life and keep the security and availability of the network compared with the HEED algorithm.