3D Network-on-Chips (3D NoCs) have higher scalability, higher throughput, and lower power consumption over 2D NoCs. However, the reliability of data transfer in 3D NoCs is seriously threatened by thermal problems. Thi...
详细信息
ISBN:
(纸本)9781538675182
3D Network-on-Chips (3D NoCs) have higher scalability, higher throughput, and lower power consumption over 2D NoCs. However, the reliability of data transfer in 3D NoCs is seriously threatened by thermal problems. This is due to poor heat dissipation, inappropriate traffic distribution, and cooling restriction for layers away of the chip heat-sink in 3D NoCs. To solve this problem, this paper proposes an efficient deadlock-free and traffic-and thermal-aware routing algorithm, called Floating XY-YX. The main idea behind Floating XY-YX routing algorithm is twofold: 1) to use XY and YX routing algorithms in consecutive layers in dessicate form, and 2) to evenly load the traffic, which is realized by switching the type of XY and YX routing algorithms to YX and XY routing algorithms, respectively. Based on the experimental results, the proposed routing algorithm reduces the temperature variance by 30.74% and traffic variance by 23.77% with respect to the state-of-the-art routing mechanisms.
An improved PDSL cluster routing algorithm based on LEACH protocol is put forward, by which data owing different priority are provided for differential services and the cluster routing of LEACH protocol is optimized. ...
详细信息
ISBN:
(纸本)9781467344999;9780769548814
An improved PDSL cluster routing algorithm based on LEACH protocol is put forward, by which data owing different priority are provided for differential services and the cluster routing of LEACH protocol is optimized. By making cluster head nodes dynamically select single-hop routing or multi-hop routing, the consumption of network energy is balanced. Simulation result shows that life cycle of PDSL cluster routing algorithm is longer than that of LEACH, and life cycle is increased 11% and network robustness is promoted 1.4% than that of LEACH.
We propose a mobile agent fixed-direction one step routing algorithm based on modeling WSN node data collection task. This algorithm divides the data collection task into three stages to finish and they are searching ...
详细信息
ISBN:
(纸本)9783037859414
We propose a mobile agent fixed-direction one step routing algorithm based on modeling WSN node data collection task. This algorithm divides the data collection task into three stages to finish and they are searching start node for MA data collection, data collection and returning the sink node. MA determines the next hop node according to the surrounding node information sensed and current move direction information. Simulation result shows that the proposed algorithm can ensure that all nodes information in WSN is collected. Then, it can effectively reduce the total number of hops for information transferring and the node total energy consumption compared to LGF algorithm in C\S mode
Based on the certainty and predictability of deep space network topology and link status, in this paper, we propose a multi-path routing algorithm taking both communication latency and communication capacity into cons...
详细信息
ISBN:
(纸本)9781479959709
Based on the certainty and predictability of deep space network topology and link status, in this paper, we propose a multi-path routing algorithm taking both communication latency and communication capacity into consideration. After the simulation, the proposed algorithm can achieve many goals including shortening the data transmission time and communication latency, prolonging the link available time and so on.
The current Internet can only provide "best effort" transport service, so it is becoming a very urgent task how to provide QoS guarantees for growing video on demand, multimedia conferencing and other multim...
详细信息
ISBN:
(纸本)9781627485852
The current Internet can only provide "best effort" transport service, so it is becoming a very urgent task how to provide QoS guarantees for growing video on demand, multimedia conferencing and other multimedia applications based on the existing network architecture. This paper proposes a QoS routing algorithm based on mobile agent and ant colony (QR2A). The QR2A algorithm combines various constraints and network load conditions with the ant colony algorithm in the pheromone, while not only meets the QoS requirements, and solve the problem of network load balancing effectively, and the algorithm is less cost. Meanwhile, the paper also gives formal description, correctness and convergence analysis of QR2A algorithm. Finally practical effect of the algorithm is verified through by the simulation experiment. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Harbin University of Science and Technology
Because the nodes of wireless sensor networks have the very limited energy, the main design goal for wireless sensor networks routing is how to improve energy efficiency. As a scheme to solve this problem, an energy e...
详细信息
ISBN:
(纸本)9780769538655
Because the nodes of wireless sensor networks have the very limited energy, the main design goal for wireless sensor networks routing is how to improve energy efficiency. As a scheme to solve this problem, an energy equalizing routing algorithm (EERA) for wireless sensor networks was proposed. In the cluster head product phase, the candidates compete for cluster heads according to their residual energy within some coverage range and the distance between each other in order to make the distribution of cluster heads balanced and cover all networks. In data transmission phase, a multi-hop routing tree among the cluster heads was built to send data to the base station according to the residuary energy of the cluster heads and the distance between them, so that the communication load can be reduced. The simulation results show that the new algorithm can reduce the energy consumption and prolong the network lifetime.
In view of the deficiency of existing power line networking algorithms, the paper proposes a novel improved clustering multipath blind routing algorithm, which meets the requirements of survivability and real-time, so...
详细信息
ISBN:
(纸本)9781479965755
In view of the deficiency of existing power line networking algorithms, the paper proposes a novel improved clustering multipath blind routing algorithm, which meets the requirements of survivability and real-time, solves the problem of network reconstruction on link invalidation. Also, solutions to some abnormal situations, such as node joining and exiting are given. Finally, the validity and superiority of the algorithm is verified through simulations. The results show that the improved clustering algorithm proposed in this paper can achieve network construction and reconstruction rapidly and flexibly, which is of positive significance to improve the reliability of communication.
With the continuous advancement of computer network communication technology, traditional wired and wireless networks are limited by cables and base stations, and are not applicable in some application scenarios. Ther...
详细信息
ISBN:
(纸本)9788995004388
With the continuous advancement of computer network communication technology, traditional wired and wireless networks are limited by cables and base stations, and are not applicable in some application scenarios. Therefore, mobile wireless communication methods have attracted more and more attention. Due to its dynamic topology and self-organizing without center, the self-organizing network can form a mobile temporary multi-hop mobile communication network through multiple wireless communication devices, which can well meet the above requirements. At present, research on self-organizing networks mainly focuses on routing protocols. The main types are based on network topology information and location information. This paper designs a routing algorithm based on link reliability. The algorithm fully considers the self-organizing network link information, and models the node's sending and receiving work as a Markov decision process, and uses Q-learning to demodulate. This article used NS2 for network simulation and analysis and comparison of performance indicators with traditional routing algorithms.
Multicast communication can support wide range of applications such as digital video distribution. In multicast communication, routing pathes are established in terms of minimizing the total cost of the multicast tree...
详细信息
ISBN:
(纸本)0780344693
Multicast communication can support wide range of applications such as digital video distribution. In multicast communication, routing pathes are established in terms of minimizing the total cost of the multicast tree or minimizing the distance of each connections from source to the destinations. In this paper, we also concern about the number of copies in one switching fabric and propose a new algorithm for multicast routing in which (1) if avoids concentration of copying at a specific exchange node and (2) it ensure the optimal path for longest connections among destinations. Time complexity and space complexity of the algorithm are discussed.
Delay Tolerant Networks ( DTNs) are sparse and highly dynamic networks where intermittent connectivity is a common event. In these networks, nodes have time-limited connection opportunity to other moving nodes. Theref...
详细信息
ISBN:
(纸本)9781538682746
Delay Tolerant Networks ( DTNs) are sparse and highly dynamic networks where intermittent connectivity is a common event. In these networks, nodes have time-limited connection opportunity to other moving nodes. Therefore, routing is a major challenge in these networks and researchers have tried to design efficient routing algorithms. Important performance metrics of desired routing algorithms are high delivery probability, low energy consumption and low end to end latency. In this paper, we propose an energy-efficient routing algorithm which is based upon the encounter probabilities of nodes. We use these encounter probabilities to derive a utility metric. Moreover, we utilize assumptions and observations of small world experiment to limit active copies and permitted hops of messages. The proposed utility metric and constraints lead us to design an energy-efficient and low overhead routing algorithm for DTN applications. We evaluate the impact of limited buffer capacity and variation of maximum moving speed of nodes on the proposed routing algorithm and compare the results with MaxProp, PROPHET, and SeeR. The first two are well-known DTN routing algorithms and the third is a recently proposed routing scheme for DTN scenarios. Results show that our proposed algorithm reduces the energy consumption of nodes by a factor of 4. It also has a higher delivery probability compared to previously proposed algorithms.
暂无评论