检索结果-南通市图书馆

adaptive swarm-based routing in communication networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Zhejiang University Science 2004年第7期5卷 867-872页

作者：吕勇赵光宙苏凡军历小润 CollegeofElectricalEngineering ZhejiangUniversityHongzhou310027China

Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness and distributed, decentralized nature, which are well suited for routing in modern communication networks. This paper describes an adaptive swarm-based routing algorithm that increases convergence speed, reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called *** on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.

关键词： Communication networks Ant based adaptive routing

adaptive Multi-Cost routing Protocol to Enhance Lifetime for Wireless Body Area Network

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第7期72卷 1089-1103页

作者： Muhammad Mateen Yaqoob Waqar Khurshid Leo Liu Syed Zulqarnain Arif Imran Ali Khan Osman Khalid Raheel Nawaz Department of Computer Science COMSATS University IslamabadAbbottabad Campus22060Pakistan Department of OTEHM Manchester Metropolitan UniversityManchesterUK

Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several *** is a fascinating domain of WBAN for smart monitoring of a patient’s *** important factor to consider in WBAN is a node’s *** the lifetime of nodes is critical to address many issues,such as utility and *** routing protocols have addressed the energy conservation problem but considered only a few parameters,thus affecting their ***,most of the existing schemes did not consider traffic prioritization which is critical in *** this paper,an adaptive multi-cost routing protocol is proposed with a multi-objective cost function considering minimum distance from sink,temperature of sensor nodes,priority of sensed data,and maximum residual energy on sensor *** performance of the proposed protocol is compared with the existing schemes for the parameters:network lifetime,stability period,throughput,energy consumption,and path *** is evident from the obtained results that the proposed protocol improves network lifetime and stability period by 30%and 15%,respectively,as well as outperforms the existing protocols in terms of throughput,energy consumption,and path loss.

关键词： Multi-cost routing protocol network lifetime wireless body area network adaptive routing residual energy clustering poisson distribution

adaptive swarm-based routing in communication networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2004年第7期5卷 119-124页

作者：吕勇赵光宙苏凡军历小润 College of Electrical Engineering China Zhejiang University Hongzhou 310027

Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness and distributed, decentralized nature, which are well suited for routing in modern communication networks. This paper describes an adaptive swarm-based routing algorithm that increases convergence speed, reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called momentum. Experiment on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.

关键词： Communication networks Ant based adaptive routing

A survey of routing algorithm for mesh Network-on-Chip

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2016年第4期10卷 591-601页

作者： Yue WU Chao LU Yunji CHEN State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 101408 China Loongson Technology Corporation Limited Beijing 100095 China

With the rapid development of semiconductor in- dustry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Under such background, Network-on-Chip （NoC） is proposed and gradually replacing the traditional on-chip interconnections such as sharing bus and crossbar. For the convenience of physical layout, mesh is the most used topology in NoC design. routing algorithm, which decides the paths of pack- ets, has significant impact on the latency and throughput of network. Thus routing algorithm plays a vital role in a wellperformed network. This study mainly ：focuses on the routing algorithms of mesh NoC. By whether taking network information into consideration in routing decision, routing algorithms of NoC can be roughly classified into oblivious routing and adaptive routing. Oblivious routing costs less without adaptiveness while adaptive routing is on the contrary. To combine the advantages of oblivious and adaptive routing algorithm, half-adaptive algorithms were proposed. In this paper, the concepts, taxonomy and features of routing algorithms of NoC are introduced. Then the importance of routing algorithms in mesh NoC is highlighted, and representative routing algorithms with respective features are reviewed and summarized. Finally, we try to shed light upon the future work of NoC routing algorithms.

关键词： Network-on-Chip mesh topology routing algorithm adaptive routing oblivious routing

维普期刊数据库

An Efficient adaptive Deadlock-Free routing Algorithm for Torus Networks

在线全文

学校读者我要写书评

暂无评论

An Efficient Adaptive Deadlock-Free Routing Algorithm for To...

PERFORMANCE ANALYSIS OF MINIMAL PATH FAULT TOLERANT routing IN NOC

第十四届全国容错计算学术会议(CFTC'2011)

作者： Wei Luo is with Hunan Electric Power Corporation Information Center, Changsha 410007,P.R.China.Dong Xiang is with the School of Software, Tsinghua University,Beijing 100084,P.R.China.

A deadlock-free minimal routing algorithm called clue is first presented for VCT(virtual cut-through)-switched tori. Only two queues(virtual channels) are *** channel is applied in the deadlock-free routing algorithm for the mesh sub-network based on a known base routing scheme,such as, negative-first or dimension-order *** other channel is similar to an adaptive *** combination completes a very novel fully-adaptive routing scheme because the first channel does not supply routing paths for every source-destination pair. Based on clue,we proposed two other algorithms named flow controlled clue and wormhole *** controlled clue is also proposed for VCT-switched *** is fully adaptive deadlock-free. Each input port requires at least two buffers,each of which is able to keep a packet.A simple but well-designed flow control function is used in the proposed flow controlled clue routing algorithm to avoid *** clue is proposed for wormhole-switched *** is partially adaptive because we add some constraints to the adaptive channel for deadlock avoidance. Simulation results show that:in VCT-switched tori,clue and flow controlled clue work better than the bubble flow control scheme under several popular traffic patterns in 2D and 3D *** a wormhole-switched tori,the advantage of wormhole clue over Duato’s protocol is also very *** the uniform traffic,the maximum normalized accepted traffic of wormhole clue is about 20%better than Duato’s protocol in 2D tori.

关键词： Index Terms-Virtual cut-through switching wormhole switching adaptive routing deadlock-free torus

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2011年第4期28卷 587-595页

作者： M.Ahmed V.Laxmi M.S.Gaur Department of Computer Engineering Malaviya National Institute of Technology

Occurrence of faults in Network on Chip(NoC) is inevitable as the feature size is con-tinuously decreasing and processing elements are increasing in *** can be revocable if it is *** fault may occur inside router,or in the core or in communication *** of transient faults are overflow of buffers in router,clock skew,cross talk,etc..Revocation of transient faults can be done by retransmission of faulty packets using oblivious or adaptive routing *** faults causes non-functionality of segment and mainly occurs during fabrication *** reliability increases with the efficient routing algorithms,which can handle the maximum faults without deadlock in *** transient faults are temporary and can be easily revoked using re-transmission of packet,permanent faults require efficient routing to route the packet by bypassing the nonfunctional ***,our focus is on the analysis of adaptive minimal path fault tolerant routing to handle the permanent *** analysis between partial adaptive fault tolerance routing West-First,North-Last,Negative-First,Odd Even,and Minimal path Fault Tolerant routing(MinFT) algorithms with the nodes and links failure is performed using NoC Interconnect routing and Application Modeling simulator(NIRGAM) for the 2D Mesh *** suggests that MinFT ensures data transmission under worst conditions as compared to other adaptive routing algorithms.

关键词： Minimal path Fault Tolerant(MinFT) adaptive routing Network on Chip(NoC)

维普期刊数据库

Dynamic load distribution with hop-by-hop forwarding based on max-min one-way delay

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2014年第6期57卷 113-124页

作者： CHEN Fei WU ChunMing WANG Bin QIAN YaGuan WU XiaoChun College of Computer Science Zhejiang University College of Science Zhejiang University of Science and Technology College of Information and Electronic Engineering Zhejiang Gongshang University

Load balancing can effectively improve network performance and scalability,but it may cause packet disorder,so worsening the ***,without MPLS to establish the desired end-to-end paths,hop-by-hop routing load balancing is more difficult to achieve than the source routing;however,it can significantly improve network *** this paper,we propose a load balancing scheme with hop-by-hop routing,by using the burstiness features of flows to make sure that the packets of the same flow arrive at the receiving end in *** results show that our algorithm can adapt to the dynamic changes of the end-to-end delay and the routing vector,and also can achieve fine-gained load balancing.

关键词： load balancing adaptive routing multipath routing traffic engineering packet reordering

adaptive Route Sink Relocation Using Cluster Head Chain Cycling Model in WSN

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Intelligent Automation & Soft Computing 2023年第5期36卷 1811-1826页

作者： M.Sudha P.Shanmugapriya Rami Q.Malik Ahmed Alkhayyat Department of Electronics and Communication Engineering Paavai Engineering CollegeNamakkal637018India Department of Electronics and Communication Engineering Saranathan College of EngineeringTiruchirappalli620012India Department of Medical Instrumentation Techniques Engineering Al-Mustaqbal University CollegeHillah51001Iraq College of Technical Engineering The Islamic UniversityNajafIraq

Wireless Sensor Networks(WSN)have revolutionized the processes involved in industrial ***,the most important challenge faced by WSN sensors is the presence of limited *** research inves-tigations have been conducted so far on how to prolong the energy in *** phenomenon is a result of inability of the network to have battery powered-sensor ***-efﬁcient routing on packetﬂow is a parallel phenomenon to delay nature,whereas the primary energy gets wasted as a result of WSN *** holes are present in the vicinity of sink and it is an important efﬁcient-routing protocol for *** order to solve the issues discussed above,an energy-efﬁcient routing protocol is proposed in this study named as adaptive Route Decision Sink Relocation Protocol using Cluster Head Chain Cycling approach(ARDSR-CHC2H).The proposed method aims at improved communica-tion at sink-inviting *** this point,Cluster Head Node(CHN)is selected,since it consumes low energy and permits one node to communicate with others in two *** main purpose of the proposed model is to reduce energy con-sumption and deﬁne new interchange technology.A comparison of simulation results demonstrates that the proposed algorithm achieved low cluster creation time,better network error and high Packet Delivery Rate with less network failure.

关键词： Cluster head energy-efﬁcient routing chain routing cycling approach sink relocation adaptive routing WSN

Energy Efficient On-Chip Communications Implementation Based on Power Slacks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronic Science and Technology 2014年第4期12卷 354-360页

作者： Xiao-Yu Xia Wen-Ming Pan Jia-Chong Kan Guangzhou Institute of Advanced Technology Chinese Academy of Sciences Guangzhou Institute of Advanced Technology Chinese Academy of Sciences

The quest for energy efficiency has growing importance in high performance many-core systems. However, in current practices, the power slacks, which are the differences observed between the input power budget and the actual power consumed in the many-core systems, are typically ignored, thus leading to poor energy efficiency. In this paper, we propose a scheme to effectively power the on-chip communications by exploiting the available power slack that is totally wasted in current many-core systems. As so, the demand for extra energy from external power sources （e.g., batteries） is minimized, which helps improve the overall energy efficiency. In essence, the power slack is stored at each node and the proposed routing algorithm uses a dynamic programming network to find the globally optimal path, along which the total energy stored on the nodes is the maximum. Experimental results have confirmed that the proposed scheme, with low hardware overhead, can reduce latency and extra energy consumption by 44% and 48%, respectively, compared with the two competing routing methods.

关键词： adaptive routing dynamicprogramming network networks-on-chip power slack.

维普期刊数据库