检索结果-内蒙古大学图书馆

Predict and Forward: An Efficient routing-Delivery Scheme Based on Node Profile in Opportunistic Networks

FUTURE INTERNET 2018年第8期10卷 74-74页

作者： Liu, Kanghuai Chen, Zhigang Wu, Jia Xiao, Yutong Zhang, Heng Cent S Univ Sch Software Changsha 410075 Hunan Peoples R China Mobile Hlth Minist Educ China Mobile Joint Lab Changsha 410083 Hunan Peoples R China

In the social scene of opportunistic networks, message applications find suitable relay nodes or certain transmission destinations from the surrounding neighbors through specific network addresses of users. However, at the dawn of big data and 5G networks, the variational location information of nodes is difficult to be available to mobile devices all the time, and a long wait for the destination may cause severe end-to-end delay. To improve the transmission environment, this study constructs an efficient routing-delivery scheme (Predict and Forward) based on node profile for the opportunistic networks. The node profile effectively characterizes nodes by analyzing and comparing their attributes instead of network addresses, such as physical characteristics, places of residence, workplaces, occupations or hobbies. According to the optimal stopping theory, this algorithm implements the optimal transmission for Prelearn messages by dividing the complex data transmission process into two different phases (Predict and Forward). Through simulations and the comparison of routing algorithms in opportunistic networks, the proposed strategy increases the delivery ratio by 80% with the traditional methods on average, and the average end-to-end delay in this algorithm is the lowest.

关键词： opportunistic network node profile routing algorithm node meeting data transmission

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm of ZigBee Network Based on Weighted Link and Node States

A Routing Algorithm of ZigBee Network Based on Weighted Link...

引用

8th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM)

作者： Pei-Cheng, Jiang Xiao-Feng, Qiu Ming, Chen Bing, Li PLA Univ Sci & Technol Inst Command Automat Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781612846835;9781612846828

The ZigBee wireless sensor network is an important supporting technology of IoT (Internet of Things). For the reason that various applications of IoT may incur heavy traffic on the network of ZigBee, and the existing methods of constructing ZigBee topology routing tree fail to consider both the link configuration and the busy-degree of the node, so the existing routing algorithm should be optimized to advance the performance of the whole network. Aiming at the above shortcomings, this paper takes the busy-degree of the node, link quality and number of hops into account, and proposes a compositive weighted routing (CWR) algorithm. Experimental results on NS2 show us that the algorithm can improve the packet average arriving rate, decrease the packet average end-to-end delay and keep energy balance among nodes.

关键词： IoT ZigBee routing algorithm Load balancing Network Simulator version 2

来源：评论

学校读者我要写书评

暂无评论

High Performance Virtual Channel Based Fully Adaptive Thermal-aware routing for 3D NoC 18th

High Performance Virtual Channel Based Fully Adaptive Therma...

引用

18th International Symposium on Quality Electronic Design (ISQED)

作者： Jiang, Xin Lei, Xiangyang Zeng, Lian Watanabe, Takahiro Waseda Univ Grad Sch Informat Prod & Syst Tokyo Japan

ISBN: (纸本)9781509054046

The thermal problem is a challenge in recent Network on Chip (NoC) designs due to its great impact on the network performance and reliability, especially for 3D NoC. In this work, we design a virtual channel based fully adaptive routing algorithm for the runtime 3D NoC thermal-aware management. For throttling information collection, instead of transmitting the topology information of the whole network, we use a 12 bits register to reserve the router state for one hop away instead of transmitting the topology information of the whole network. It saves the hardware cost largely and decreases the network latency. To ensure deadlock and livelock free and minimize the hardware overhead, we only use two virtual channels for each horizontal channel to achieve full adaptivity and high routability. For path selection, we design a strategy that takes priority to the distance, but also consider path diversity and traffic state. Experimental results show that the proposed algorithm shows better network latency and throughput with low power compared with traditional algorithms.

关键词： thermal-aware routing algorithm fully adaptive 3D NoC

来源：评论

学校读者我要写书评

暂无评论

Stealth-ACK: stealth transmissions of No C acknowledgements

引用

Science China(Information Sciences) 2017年第9期60卷 21-35页

作者： Jinhua TAO Shi QIU Shaoli LIU Tianshi CHEN Rui MAO Institute of Computing Technology Chinese Academy of Sciences College of Computer Science and Software Engineering Shenzhen University

Network-on-Chip(No C) is a promising replacement of bus architecture due to its better *** state-of-the-art No Cs, each packet contains several fixed-length flits, which facilitates allocations of network resources but brings in many unused bits. In this paper, we propose a novel technique called Stealth-ACK to effectively address the above problem. Stealth-ACK leverages unused bits in head flits of non-ACK packets to carry and stealthily transmit ACK information. Such stealth transmissions of ACK information effectively reduce not only the amount of dedicated ACK packets on No C, but also the number of unused bits in head flits of non-ACK packets, which significantly reduces wastes on No C bandwidth. Experimental results show that Stealth-ACK averagely increases the throughput of 16 × 16 2-D mesh No C by 11.9%, and averagely reduces the No C latency by 34.8% on application traces of SPLASH-2. Moreover, Stealth-ACK only requires trivial hardware modification to basic router architectures, which incurs negligible power consumption and area cost.

关键词： networks-on-chip acknowledgement packet router architecture optimisation routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Delay Characteristics Dependency on Type of Wire Segments in FPGA routing

Delay Characteristics Dependency on Type of Wire Segments in...

引用

International conference on Microelectronic Devices, Circuits and Systems (ICMDCS)

作者： Nunna, Krishna Chaitanya Maddipati, Usha Gummadi, Swami Naidu Reddy, Rama Vara Prasad Sasi Inst Technol & Engn Dept Elect & Commun Engn Tadepalligudem 534101 India

ISBN: (纸本)9781538617168

Hierarchical routing resources play vital role in FPGA routing. Better routability options can be obtained using segmented approach of wires thus enabling routing optimization. Source and sink logic blocks can be connected via wire segments such that the overall wire length and switching transistors inside the switch box can be saved over an extent. This paper presents an experimental approach of study of wire segments types affecting the routability. Widely used segment types are considered for experiments. A routing algorithm containing the cost equation based on routing segment types is proposed. Results show that at least 15% less critical path delay can be achieved tested against 12 largest MCNC benchmark circuits.

关键词： Critical path delay FPGA Hierarchical routing segments routing algorithm Wire segment

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficiency routing Scheme Based on Clusters with a Mobile Sink for WSNs 3rd

An Energy-Efficiency Routing Scheme Based on Clusters with a...

引用

3rd International Conference on Cloud Computing and Security (ICCCS)

作者： Liu, Xiaodong Liu, Qi Edinburgh Napier Univ Sch Comp 10 Colinton Rd Edinburgh EH10 5DT Midlothian Scotland

ISBN: (纸本)9783319685052;9783319685045

With the development of microelectronic devices and the radio, the application of WSN is more popular and can be applied in the various areas, which has attracted scholars. However, the requirements of performance for WSNs are becoming great in terms of reducing the energy consumption and prolonging the network lifetime. In the paper, an energy-efficiency routing scheme based on clusters with a mobile sink which consist of six parts is proposed. Through the simulation, we have demonstrated that the proposed routing algorithm has a higher performance which can reduce energy consumption on WSNs.

关键词： Energy-efficiency routing algorithm WSN Sink

来源：评论

学校读者我要写书评

暂无评论

Location-assistant content distribution scheme for emergency rescue

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2018年第9期14卷 1-14页

作者： Zhang, Guomin Song, Lihua Wang, Haitao Hu, Chao Wang, Na Army Engn Univ PLA Coll Command Control Engn Nanjing 210007 Jiangsu Peoples R China Army Engn Univ PLA Teaching & Res Support Ctr Nanjing Jiangsu Peoples R China Army Engn Univ PLA Coll Commun Engn Nanjing Jiangsu Peoples R China

In order to optimize the timeliness and pertinence of message delivery in emergency rescue scenarios and improve the service performance of emergency communications network, we propose a location-assistant content distribution scheme based on delay tolerant network. First of all, considering that the movement patterns of rescue teams tend to follow a predetermined course of action, we design a location-based group mobility model. Due to the intermittent network connectivity and variety of emergency service, a content-classification-based publish/subscribe architecture and a GenericSpray routing algorithm based on the prediction of overlap opportunity in spatio-temporal positions are proposed. Furthermore, we also give a cache management strategy based on the content significance. Since locationassistant content distribution scheme can predict the overlap of activity between rescue teams through the course of action, not only can the number of copy forwarding and message delivery delays be significantly reduced but also the priority delivery of important messages can be ensured by message classification. Simulation experiments show that compared with the traditional delay tolerant network routing algorithm and the classic first-in-first-out caching strategy, location-assistant content distribution scheme improves the performance of message delivery rate, transmission delay, and control overhead significantly.

关键词： Emergency rescue delay tolerant network mobility model location aided content distribution routing algorithm cache management

来源：评论

学校读者我要写书评

暂无评论

Footprint: Regulating routing Adaptiveness in Networks-on-Chip 17

Footprint: Regulating Routing Adaptiveness in Networks-on-Ch...

引用

44th Annual International Symposium on Computer Architecture (ISCA)

作者： Fu, Binzhang Kim, John Chinese Acad Sci SKL Comp Architecture ICT Beijing Peoples R China Huawei Technol Co Ltd Shenzhen Guangdong Peoples R China Korea Adv Inst Sci & Technol Sch Comp Daejeon South Korea Hewlett Packard Labs Palo Alto CA USA

ISBN: (纸本)9781450348928

routing algorithms can improve network performance by maximizing routing adaptiveness but can be problematic in the presence of endpoint congestion. Tree-saturation is a well-known behavior caused by endpoint congestion. Adaptive routing can, however, spread the congestion and result in thick branches of the congestion tree - creating Head-of-Line (HoL) blocking and degrading performance. In this work, we identify how ignoring virtual channels (VCs) and their occupancy during adaptive routing results in congestion trees with thick branches as congestion is spread to all VCs. To address this limitation, we propose Footprint routing algorithm - a new adaptive routing algorithm that minimizes the size of the congestion tree, both in terms of the number of nodes in the congestion tree as well as branch thickness. Footprint achieves this by regulating adaptiveness by requiring packets to follow the path of prior packets to the same destination if the network is congested instead of forking a new path or VC. Thus, the congestion tree is dynamically kept as slim as possible and reduces HoL blocking or congestion spreading while maintaining high adaptivity and maximizing VC buffer utilization. We evaluate the proposed Footprint routing algorithm against other adaptive routing algorithms and our simulation results show that the network saturation throughput can be improved by up to 43% (58%) compared with the fully adaptive routing (partially adaptive routing) algorithms.

关键词： Congestion routing algorithm network-on-chip

来源：评论

学校读者我要写书评

暂无评论

HyBar:high efficient barrier synchronization based on a hybrid packet-circuit switching Network-on-Chip

引用

Science China(Information Sciences) 2017年第6期60卷 237-248页

作者： Zhenqi WEI Peilin LIU Rongdi SUN School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University

Realizing barrier synchronization in multi-/many-core processors with high efficiency becomes more and more challenging as the number of cores integrated in a single chip keeps growing. Quite a few barrier solutions have been proposed, while they provide limited improvements for synchronizing large amounts of cores or incur unfavorable restrictions on performing concurrent barriers. This paper presents Hy Bar, a hardware barrier based on a hybrid switching No C which adopts packet switching and circuit switching methods in two sub-networks respectively. Dedicated channels in the circuit-switching sub-network are dynamically built and removed when barrier requests traverse the packet-switching sub-network according to a modified dimensionorder routing algorithm. The efficiency of inter-core communication for concurrent barriers is improved by merging barrier arrival requests and broadcasting release requests along the circuit channels. The execution time of synthetic cases, benchmark kernels and parallel applications using various barrier solutions are evaluated in an RTL-based simulation platform. Experimental results show that our proposal provides about 15%–50%performance improvement compared to previous solutions, while the hardware overhead is marginal under SMIC40 nm technology. Moreover, Hy Bar introduces a minor efficiency loss for concurrent barriers with no limitation on their layouts of participating cores in the on-chip network.

关键词： NoC barrier synchronization packet-circuit switching concurrent barriers routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Stochastic Fault-tolerant routing in Locally Twisted Cubes 6

Stochastic Fault-tolerant Routing in Locally Twisted Cubes

引用

6th ICT International Student Project Conference (ICT-ISPC)

作者： Takano, Yudai Kaneko, Keiichi Tokyo Univ Agr & Techonol Grad Sch Engn Tokyo Japan

ISBN: (纸本)9781538629963

The locally twisted cube provides a prospective topology suitable for interconnection networks of the massively parallel systems. A routing algorithm is proposed in this paper that tolerates faulty vertices in locally twisted cubes based on two kinds of routing probabilities. A computer experiment is also conducted to verify the performance of our algorithm.

关键词： interconnection network locally twisted cube fault tolerance routing algorithm massively parallel systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：