Weighted Routing Algorithm Research Articles

Sequential Routing-based Time-division Multiplexing Optimization for Multi-FPGA Systems

Multi-field programming gate array (FPGA) systems are widely used in various circuit design-related areas, such as hardware emulation, virtual prototypes, and chiplet design methodologies. However, a physical resource clash between inter-FPGA signals and I/O pins can create a bottleneck in a multi-FPGA system. Specifically, inter-FPGA signals often outnumber I/O pins in a multi-FPGA system. To solve this problem, time-division multiplexing (TDM) is introduced. However, undue time delay caused by TDM may impair the performance of a multi-FPGA system. Therefore, a more efficient TDM solution is needed. In this work, we propose a new routing sequence strategy to improve the efficiency of TDM. Our strategy consists of two parts: a weighted routing algorithm and TDM assignment optimization. The algorithm takes into account the weight of the net to generate a high-quality routing topology. Then, a net-based TDM assignment is performed to obtain a lower TDM ratio for the multi-FPGA system. Experiments on the public dataset of CAD Contest 2019 at ICCAD showed that our routing sequence strategy achieved good results. Especially in those testcases of unbalanced designs, the performance of multi-FPGA systems was improved up to 2.63. Moreover, we outperformed the top two contest finalists as to TDM results in most of the testcases.

An improved dual-sink architecture with a modified media access control protocol, energy-aware, and quality-of-service guaranteed routing algorithms for wireless body area network

To reduce frequent sensor recharging and replacement due to resource constraint, it becomes imperative to increase the management of energy and network’s quality of service. To this end, this article provides a new wireless body sensor network architecture with two sink nodes and multiple energy management and quality-of-service algorithms. The first algorithm is the normal data avoidance algorithm that is responsible for decreasing the energy usage by avoiding the transmission of normal data. Duplicate data avoidance algorithm avoid transmitting duplicate data thus saving the bandwidth and battery life. Past knowledge-based weighted routing algorithm oversees taking the ideal direction to transmit information, hence improving quality of service. Furthermore, sleep scheduling is integrated to further improve the battery life. In addition, in our proposed model, linear programming which is based on mathematical models was used to model the network lifetime maximization and continuous data transmission minimization. Through simulation in Castalia-based OMNeT++ demonstrates that our proposed work outperforms the works of quasi-sleep-preempt-supported with regard to network lifetime and delay with 50% and 30% improvement, respectively, moreover, it improves the work of critical data with respect to packet drop and throughput with 30% and 75% improvement, respectively.

Complex network routing strategy based on segmented transportation distance limit

In transmission problem of many complex networks, there are some restrictions on the routing path between a pair of sources and destinations, especially for the transmission process that has a segment distance limit, which has a wide range of applications in real transportation, information transmission, etc. on large real networks. In this work, we constructed a complex network transmission model, defined the transmission distance limit to [Formula: see text] and randomly selected a part of the nodes in the scale-free network as the station. Based on the shortest path algorithm and a weighted routing algorithm, we observed the results under the transmission distance limit. The results show that the setting of [Formula: see text] is important, which can be used to guide and control the fuel carrying capacity of vehicles on the transportation network. Finally, we selected two real road network for simulation and the results demonstrate the effectiveness of the algorithm in scale-free networks and real networks.

Trust Aware Light Weight Secure Routing Protocol for Wireless Body Sensor Network using RCP Measures

The growth of information technology and networking solutions encouraged the deployment of WBSN. It supports the monitoring and control of human conditions towards various issues. However, the security of data transmission and routing plays vital role and to achieve this, different algorithms has been identified. But, the earlier methods are does not produce expected QoS (Quality of Service) parameters. To improve the performance of routing, a novel trust aware light weight routing algorithm (RCP-TLSR (Reputation Completion Privacy Preservation-TLSR) has been proposed. The sensors of wireless body network discover the available routes between the source and destination. The selection of route and the sensor node has been identified according to the RCP measure which has been computed according to the reputation, completion and privacy preservation values. By choosing the routes according to the values of RCP, the method achieves higher performance in routing. On the other side, the data security has been enforced by block level encryption technique which is understandable for the concern sensor nodes. The method improves the performance in security and routing highly.

Designing insistence-aware medium access control protocol and energy conscious routing in quality-of-service-guaranteed wireless body area network

Wireless body area network is a type of wireless sensor network that enables efficient healthcare system. To minimize frequent sensor replacement due to resource restrictions, it is necessary to improve energy efficiency in wireless body area network. This article deals with energy efficiency and quality-of-service improvement together in novel wireless body area network architecture. A novel wireless body area network architecture is designed with dual sink nodes in order to minimize delay and energy consumption. A novel insistence-aware medium access control protocol which is aware of criticality of sensed data is presented in the proposed wireless body area network. Prior knowledge-based weighted routing algorithm is responsible to select optimal route for data transmission. In prior knowledge-based weighted routing, weight value is computed by considering significant metrics such as residual energy, link stability, distance, and delay in order to improve energy efficiency and quality of service in the network. Energy consumption is further minimized by incorporating graph-based sleep scheduling algorithm. In graph-based sleep scheduling, criticality of sensor node is also considered as major metric. In coordinator, split and map–based neural network classifier is involved to perform packet classification. After classification, packets are assigned to corresponding sink node according to packet type. Then, throughput and delay metrics are improved by frame aggregation process which is involved in sink node. Extensive simulation in OMNeT++ shows better performance in network lifetime, throughput, residual energy, dropped packets, and delay.

Improved efficient static weighted routing strategy on two-layer complex networks

Global static routing is one kind of important routing algorithms for complex networks, especially in large communication networks. In this paper, we propose a heuristic global static routing algorithm to mitigate traffic congestion on two-layer complex networks. The proposed routing algorithm extends the relevant static weighted routing algorithm in the literature [Y. Zhou, Y. F. Peng, X. L. Yang and K. P. Long, Phys. Sci. 84, 055802 (2011)]. Our routing path is constructed from a proper assignment of edge weights by considering the static information of both layers and an adjustable parameter α. When this routing algorithm is adopted on BA–BA two-layer networks with an appropriate parameter α, it can achieve the maximum network traffic capacity compared with the shortest path (SP) routing algorithm and the static weighted routing algorithm.

Novel algorithm for upgrading of translucent optical networks

The problem of how to upgrade translucent optical networks is studied in this paper. This study is motivated by the cost advantage of not having network nodes fully equipped with transceivers in the beginning of network deployment but adding transceivers as and when it is necessary. A novel heuristic algorithm for the selection of nodes to upgrade (by adding transceivers) based on the transitional weight of the nodes and the length of the links is proposed. Spare transceivers in the nodes can be used to regenerate signals. An algorithm for locating the regeneration nodes in the network is also proposed. The proposed upgrade node selection algorithm is studied with the regeneration node selection algorithm and a wavelength weighted routing algorithm by means of numerical simulations. Simulation results show that upgrading translucent optical network by means of the proposed upgrade node selection algorithm has lower blocking probability and cost advantage compared to other strategies.