Due to high manufacturing cost of Through Silicon Via (TSV) in 3D Network-on-Chips (NoCs), not every router is vertically connected. In most 3D NoCs only a subset of TSVs are contrived which results into incomplete 3D...
详细信息
ISBN:
(纸本)9781728116440
Due to high manufacturing cost of Through Silicon Via (TSV) in 3D Network-on-Chips (NoCs), not every router is vertically connected. In most 3D NoCs only a subset of TSVs are contrived which results into incomplete 3D NoCs in the vertical dimension. This irregularity introduces new complexity in the design of efficient routing algorithms for partially connected 3D NoCs. In this paper, we propose an efficient routing algorithm to evenly distribute traffic in incomplete 3D NoCs. The proposed algorithm uses turn model analysis to categorize layers, columns, and rows of the NoC into different groups. Then, specific turns are prohibited in each group such that the whole routing is deadlock free, livelock free, and independent of the location of TSVs over the network. By finding the best combination for prohibited turns over the network, we limited the number of required virtual channels to two virtual channel per each physical channel. Simulation results show that the proposed partially adaptive routing has improved packet latency by 32.8% in comparison with Elevator-First algorithm. The advantage of the proposed algorithm is that it shows more improvements on the packet latency and network throughput when the size of network grows.
Due to large coverage, medium -high orbit satellites can be used in reconnaissance, navigation, communication and otherfields. The premise of normal work of satellite services is that nodes can communicate with each o...
详细信息
ISBN:
(数字)9781728105109
ISBN:
(纸本)9781728105109
Due to large coverage, medium -high orbit satellites can be used in reconnaissance, navigation, communication and otherfields. The premise of normal work of satellite services is that nodes can communicate with each other and realize information sharing. An important research direction of satellite networking is routing protocol, we mainly improve a routing protocol based on virtual network topology. Ant colony algorithm is introduced when selecting the optimal path. We mainly describe the principle and process of this algorithm, and cony out simulation according to specific application scenarios, which guarantees network Qos quality and reduces communication overhead when selecting the path. Finally, the simulation results show that the network average delay is in seconds, the average of deley jitter of each path is in milliseconds, and the packet loss probability of each path is 0.11%, which means that the algorithm can guarantee the Qos quality of atellite network.
As the number of cores on a single chip increased, the inter-core communication system quickly became the performance bottleneck. In order to solve the performance and scalability issues of bus-based systems, Network-...
详细信息
ISBN:
(纸本)9781728148823
As the number of cores on a single chip increased, the inter-core communication system quickly became the performance bottleneck. In order to solve the performance and scalability issues of bus-based systems, Network-on-chip (NoC) was proposed. This eventually met its own bottleneck and several technologies sprouted out from NoC research. The most commonly researched upgrade to NoCs was 3D NoCs, which utilized stacked routers to reduce the maximum hop count. Other researchers have looked at alternative transmission mediums, such as photonics. These technologies can be combined to give great performance and power benefits but can be slowed down by congestion in their path-setup phase. In order to solve this issue, we propose a traffic-aware routing algorithm that can evenly distribute the traffic throughout the chip, all while simultaneously avoiding faulty nodes. The results show that the proposed algorithm was successful in balancing the load across the chip and that the performance costs of the algorithm were mostly offset by the benefits of reducing blocked paths.
The application of CRSN (Cognitive Radio Sensor Networks) can alleviate the shortage of spectrum resources. As one of the core technologies of WSNs (Wireless Sensor Networks), routing algorithm is important to the ove...
详细信息
ISBN:
(纸本)9781450372930
The application of CRSN (Cognitive Radio Sensor Networks) can alleviate the shortage of spectrum resources. As one of the core technologies of WSNs (Wireless Sensor Networks), routing algorithm is important to the overall performance of the network. Therefore, a cognitive clustering routing algorithm for Heterogeneous WSNs is proposed. The algorithm is suitable for cooperative communication networks between cognitive sensor nodes and common sensor nodes. Selecting a cluster head according to the number of idle channels and the residual energy of the node. Protect low-energy nodes and make full use of high-energy nodes by setting double energy thresholds. The concept of node edge degree is applied to improve the probability of cluster selection. A new clustering mechanism is introduced according to the node location. Compared to the original algorithm, the improved algorithm of the original algorithm, and the existing routing algorithm for CRSN, the simulation results show that the network life cycle and the data transmission amount is significantly increased.
Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, t...
详细信息
Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, the classical flooding and greedy algorithms and their derivatives also have some limitations. The path delay calculated by the flooding algorithm is small but the calculation is large, while the greedy algorithm is the opposite. In this paper, a balanced inter-satellite routing algorithm based on partition routing is proposed. This paper presents the simulation experiments for the following indexes of the classic inter-satellite routing algorithms and the balanced partition routing algorithm: computation complexity, single-node computation pressure, routing path delay, path delay variance (data in Topo table satisfy mu = 5, sigma(2) = 10). The results reveal that the balanced partition routing algorithm achieves better performance. In this paper, two optimization directions of the balanced partition routing algorithm are simulated under conditions that the data in the Topo table satisfy mu = 5, sigma(2) = 6, sigma(2) = 10 and sigma(2) = 15, respectively, when comparing their performance indicators. The experiments show that these two optimization methods can be adapted to various application scenarios and can further reduce the hardware cost of satellite nodes.
In the field of vehicular wireless sensor networks-based structural health monitoring, the structural damage identification is achieved by two structural features, namely natural frequencies and mode shapes. The kind ...
详细信息
In the field of vehicular wireless sensor networks-based structural health monitoring, the structural damage identification is achieved by two structural features, namely natural frequencies and mode shapes. The kind of data fusion-based routing algorithm in specific applications needs to meet time synchronization requirements and meet certain constraints, such as the single-hop communication between cluster head node and each node in cluster, the overlap between different clusters and so on. To meet the special constraints for data fusion-based routing algorithm in structural health monitoring, this paper proposed a new method based on an improved flooding time synchronization protocol, which is called time synchronization and enhanced greedy algorithm based on D(v) (TSDEGA) routing algorithm. The TSDEGA method can achieve the minimum connected cover by node's own degree D(v), and it can also meet the structural health monitoring routing constraints. The simulation experiments show that TSDEGA has better energy resistance and longer network lifetime, and it is superior to the traditional greedy algorithms. The proposed algorithm can effectively eliminate interference of outliers and improve the accuracy in order to meet time synchronization requirements in structural health monitoring applications.
A delay tolerant network (DTN) is a mobile ad hoc network with extremely limited network resources. When DTN is applied in the urban environment, nodes are not willing to consume their limited resources to forward mes...
详细信息
A delay tolerant network (DTN) is a mobile ad hoc network with extremely limited network resources. When DTN is applied in the urban environment, nodes are not willing to consume their limited resources to forward messages for other nodes, or they prefer a relay node that encounters the destination node with a higher probability to forward messages for themselves owing to the characteristics of sociality and selfishness of nodes, which results in poor network performance. To address this issue, a routing algorithm based on incentive mechanisms was proposed in this paper, which is called ARAG. In the process of forwarding message, the algorithm determines the probability of messages received by relay nodes based on the resource consumption of the sender node. Simultaneously, when a source node generates a message, the threshold of copies is set based on the consumption of its resources, and the total number of the same message in the network will not exceed the threshold. Simulation results show that the algorithm is superior to the existing Epidemic algorithm, Prophet algorithm, and GTMEA algorithm in terms of the delivery ratio, the average delay, and network overhead.
Efficient and reliable routing plays a key role in wireless sensor networks in which routing design with regard to network availability and node lifetime needs to be deliberately considered. When multi-hop relay trans...
详细信息
Efficient and reliable routing plays a key role in wireless sensor networks in which routing design with regard to network availability and node lifetime needs to be deliberately considered. When multi-hop relay transmission is frequently applied to reduce a source node's energy consumption and improve network capacity, a key issue affecting the nodes' participation in the transmission is the problem of suitably determining the next hop in order to prolong each node's lifetime and to maintain the energy-balancing of the whole network. In this study, we propose an energy-aware routing scheme by taking the Cauchy operator, node's residual energy and routing distance into account. Based on Cauchy inequation, we achieve a relationship between the routing distance and the energy usage in the routing. By fixing a relay selection parameter and then identifying the next hop appropriately, we obtain a balancing energy-aware routing algorithm. Numerical results are provided to verify the lifetime and equilibrium of the energy distribution by comparing with them with those of a traditional approach.
The unmanned aerial system (UAS), as a typical aeronautical Ad-hoc network (AANET) system, which is composed of unmanned aerial vehicle clusters has a lot of advantages such as flexible deployment, excellent cost-bene...
详细信息
The unmanned aerial system (UAS), as a typical aeronautical Ad-hoc network (AANET) system, which is composed of unmanned aerial vehicle clusters has a lot of advantages such as flexible deployment, excellent cost-benefit ratio and free from the effect of environment. It will be an important part of the space-sky information network in the future. Due to the fast-moving of nodes in AANET/UAS, the topology changes frequently. The routing overhead becomes huge and inefficient, and connectivity keeping becomes difficult. In this paper, a shortest path routing algorithm based on grid position no center(GPNC-SP algorithm) is proposed, which uses the logical grid distance to replace the original Euclidean distance to reduce the sensitivity of fast-moving nodes. This algorithm automatically computes and maintains the adjacency relationship and topology structure by perception and updating algorithm and adopts Dijkstra algorithm to achieve the shortest routing path. Also, a regional reconstruction strategy(RSS) is designed to optimize the routing path dynamically. At the same time, two metrics, i.e., the percentage of the effective communication area(P-eca %) and the sensitivity with logical grid size (Se) are used to determine the optional scope of logical grid width. Comparing with the two traditional typical routing protocols (DREAM and DSDV algorithms), this algorithm sacrifices a certain degree of communication distance to achieve better performances of network overhead, link stability, and calculating speed. The final simulation experiments under the Matlab environment demonstrate the effectiveness and practicality of this algorithm.
A recently proposed wafer-sized active integrated circuit capable of programmably interconnecting integrated circuits deposited on its surface needs a routing tool with computation time in the order of minutes. In thi...
详细信息
A recently proposed wafer-sized active integrated circuit capable of programmably interconnecting integrated circuits deposited on its surface needs a routing tool with computation time in the order of minutes. In this paper, a first algorithm computes the shortest route in O(n), n being the number of edges between source and destination. The second algorithm performs a parallelized random search to resolve conflicting routes. Our algorithm can route high density PCB-like netlists (25% vertices occupancy) on an 80,000 vertices regular interconnection network in about 9 min, while typical density netlists (5-15%) are routed in times ranging from 0.4 to 11 s.
暂无评论