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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

633 篇 会议
619 篇 期刊文献
6 篇 学位论文
2 册 图书

馆藏范围

1,260 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,197 篇 工学
- 764 篇 计算机科学与技术...
- 567 篇 电气工程
- 448 篇 信息与通信工程
- 171 篇 电子科学与技术（可...
- 113 篇 软件工程
- 95 篇 仪器科学与技术
- 91 篇 控制科学与工程
- 55 篇 机械工程
- 28 篇 材料科学与工程（可...
- 21 篇 交通运输工程
- 12 篇 网络空间安全
- 10 篇 航空宇航科学与技...
- 8 篇 力学（可授工学、理...
- 8 篇 光学工程
- 8 篇 石油与天然气工程
- 7 篇 动力工程及工程热...
- 7 篇 测绘科学与技术
- 6 篇 土木工程
- 3 篇 建筑学
103 篇 管理学
- 95 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
100 篇 理学
- 40 篇 物理学
- 27 篇 数学
- 26 篇 化学
- 18 篇 生物学
- 10 篇 系统科学
- 4 篇 地球物理学
- 3 篇 地理学
10 篇 医学
- 7 篇 临床医学
3 篇 经济学
3 篇 法学
3 篇 教育学
- 3 篇 教育学
3 篇 军事学
2 篇 文学
2 篇 艺术学
1 篇 历史学
1 篇 农学

主题

1,260 篇 routing algorith...
80 篇 wireless sensor ...
78 篇 network-on-chip
60 篇 wireless sensor ...
44 篇 routing
44 篇 interconnection ...
41 篇 fault tolerance
30 篇 clustering
28 篇 reliability
28 篇 load balancing
24 篇 topology
23 篇 interconnection ...
20 篇 noc
18 篇 opportunistic ne...
18 篇 network topology
18 篇 wsn
18 篇 network on chip
18 篇 networks-on-chip
17 篇 qos
16 篇 energy consumpti...

机构

8 篇 xidian univ stat...
7 篇 univ calif santa...
6 篇 hosei univ dept ...
6 篇 sharif univ tech...
6 篇 xidian univ stat...
5 篇 south china univ...
5 篇 univ chinese aca...
5 篇 xidian univ sch ...
5 篇 northeastern uni...
5 篇 school of inform...
5 篇 inst res fundame...
5 篇 guangdong univ f...
4 篇 tianjin polytech...
4 篇 tsinghua univ de...
4 篇 shaanxi normal u...
4 篇 college of infor...
4 篇 inner mongolia u...
4 篇 xidian univ inst...
4 篇 henan univ sch c...
4 篇 shenyang ligong ...

作者

16 篇 gu huaxi
11 篇 wang kun
9 篇 patooghy ahmad
8 篇 plosila juha
8 篇 palesi maurizio
7 篇 yang yintang
7 篇 kaneko keiichi
7 篇 liljeberg pasi
7 篇 tang minghua
7 篇 watanabe takahir...
6 篇 valinataj mojtab...
6 篇 xu gang
6 篇 jiang xin
6 篇 amano h
6 篇 li yamin
5 篇 tenhunen hannu
5 篇 duan xinming
5 篇 wang liang
5 篇 zhang feng
5 篇 lin xiaola

语言

1,203 篇 英文
32 篇 其他
25 篇 中文

检索条件"主题词=Routing Algorithm"

共 1260 条记录，以下是261-270 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

An Efficient History-Based routing algorithm for Interconnection Networks

An Efficient History-Based Routing Algorithm for Interconnec...

引用

International SoC Design Conference (ISOCC)

作者： Moosavi, Sanaz Rahimi Chang, Chia-Yuan Rahmani, Amir-Mohammad Plosila, Juha Man, Ka Lok Jeong, Taikyeong T. Lim, Eng Gee Univ Turku Dept Informat Technol Turku Finland Turku Ctr Comp Sci TUCS Turku Finland Xian Jiaotong Liverpool Univ Suzhou Peoples R China Myongji Univ Seoul South Korea Balt Inst Adv Technol Vilnius Lithuania

ISBN: (纸本)9781467329880;9781467329897

Network-on-chip (NoC) approach has been proposed as a solution to the complex on-chip communication problems by scaling down the concepts of macro- and tele-networks, and applying them to the system-on-chip domain. In this paper, an efficient routing algorithm for two-dimensional mesh network-on-chips is presented. The algorithm, which is based on Odd-Even turn model, is called History-Based Odd-Even (HB-OE). It is more fair and efficient in load balancing compared to the typical Odd-Even turn model algorithm. In this routing, based on the location of the current node, the network is divided into four sub-networks and the history of each sub-network regarding the direction of the last forwarded packet is saved using a flag register. We further enhance this routing by using a technique named Free-Channel to check the availability of the output ports as well as their history. To assess the latency of the proposed algorithm, transpose traffic profile for packet injection is used. The simulation results reveal that the HB-OE + Free-Channel routing policy can achieve lower latency compared to the conventional Odd-Even turn model with negligible area overhead.

关键词： Network-on-chip routing algorithm Odd-Even turn model Low latency routing

来源：评论

学校读者我要写书评

暂无评论

An Efficient routing algorithm Based on Interest Similarity and Trust Relationship Between Users in Opportunistic Networks 11th

An Efficient Routing Algorithm Based on Interest Similarity ...

引用

11th China Wireless Sensor Network Conference (CWSN)

作者： Qin, Xueyang Wang, Xiaoming Lin, Yaguang Wang, Liang Zhang, Lichen Minist Educ Key Lab Modern Teaching Technol Xian 710062 Shaanxi Peoples R China Shaanxi Normal Univ Sch Comp Sci Xian 710119 Shaanxi Peoples R China

ISBN: (纸本)9789811081231;9789811081224

In opportunistic networks, due to the randomness of node moving and the uncertainty of network topology, it's a challenging issue to establish a complete communication link between the source and the destination node. Fortunately, the "store-carry-forward" strategy can be used to solve this problem. However, such forwarding strategy heavily relies on the cooperation among nodes. Thus, the selection of a proper relay node has a great impact on the performance of the whole network. In this paper, considering the differences between users' interest and the variability of interest with the change of time, firstly, we propose a dynamic update and calculation method of the value of interests, and then establish a calculation model of interest. Secondly, according to the Ebbinghaus forgetting curve and the ability of users to forward messages, we propose a dynamic calculation method of the trust value of users and establish a model for computing trust relationships. Finally, we propose an efficient routing algorithm based on interest similarity and trust relationship (BIST) between users. The simulation results show that our proposed algorithm has better routing performance, and it validates the correctness and validity of our proposed models and algorithm.

关键词： Interest similarity Opportunistic network routing algorithm Trust relationship

来源：评论

学校读者我要写书评

暂无评论

Clustering routing algorithm Based on Energy Threshold and Location Distribution for Wireless Sensor Network 37

Clustering Routing Algorithm Based on Energy Threshold and L...

引用

37th Chinese Control Conference (CCC)

作者： Li, Anchao Chen, Guifen Changchun Univ Sci & Technol Sch Elect & Informat Engn Changchun 130022 Jilin Peoples R China

ISBN: (纸本)9789881563958

Energy efficiency has always been a major challenge in routing algorithm design. Aiming at the disadvantage of low energy efficiency of distributed energy efficient clustering algorithm (DEEC), an improved energy heterogeneous clustering routing algorithm is proposed. The improved algorithm is divided into two stages: cluster head selection and inter-cluster multi-hop transmission. In the stage of cluster head selection, the cluster head selection is made more reasonable and effective by setting energy threshold and location distribution. In the multi-hop transmission stage, the next hop node is determined considering the position, remaining energy, number of forwarding and number of nodes in the cluster. Simulation results show that compared with the original algorithm, the improved algorithm extends the network life cycle, balances the network energy load, and improves the data transmission efficiency.

关键词： Wireless sensor network routing algorithm location distribution energy threshold multi-hop transmission

来源：评论

学校读者我要写书评

暂无评论

Improved Energy Efficient Adaptive Clustering routing algorithm for WSN 11th

Improved Energy Efficient Adaptive Clustering Routing Algori...

引用

11th China Wireless Sensor Network Conference (CWSN)

作者： Song, Guozhi Qu, Guoliang Ma, Qing Zhang, Xin Tianjin Polytech Univ Sch Comp Sci & Software Engn Tianjin 300387 Peoples R China

ISBN: (纸本)9789811081231;9789811081224

routing algorithm is the key to prolong the lifetime of the overall wireless sensor network. At present, clustering routing algorithm is more widely used in wireless sensor networks. But this way of transmitting information through the cluster can lead to uneven energy consumption in the network, which is known as the "hot zone" problem. However, the uneven clusters, the way of multi-hop transmission between clusters can solve this problem. According to the characteristics of routing in wireless sensor network, this paper analyzes the defects and disadvantages of the current routing algorithm. This paper proposes a series of improvement measures for the current uneven clustering routing algorithm. This paper proposes a new algorithm which has a longer network life and better stability compared with the existing routing algorithm through experimental results and analysis.

关键词： Wireless sensor networks routing algorithm Uneven clustering routing

来源：评论

学校读者我要写书评

暂无评论

GSASRA: A Globally Self-Adaptive and Scalable routing algorithm for Network-on-Chips Architecture using Particle Swarm Optimization 1

GSASRA: A Globally Self-Adaptive and Scalable Routing Algori...

引用

1st International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)

作者： Abba, Sani Lee, Jeong-A Chosun Univ Comp Syst Lab Dept Comp Engn Gwangju City South Korea

ISBN: (纸本)9781479932511

Adaptive algorithms are able to intelligently adjust their behavior in light of the changing situation to achieve the best promising results. The adaptive routing algorithms have been employed in multi-chip interconnection networks in order to get better network performance. In this paper we propose a new Globally Self-adaptive and Scalable routing algorithm for Network-on-Chip (NoC) architectures namely (GSASRA). Our algorithm makes global routing decisions using particle swarm optimization technique to find global congestion information and to efficiently and intelligently decide the path to route the packet in each direction from source to the destination nodes. We implemented our proposed approach using SystemC and compared our approach with the SystemC based Fully-Adaptive and XY routing algorithms under matrix-transpose traffic pattern. Results from our experiment and simulations show that, our approach proves to be efficient in terms of throughput, latency and energy consumption for self-adaptive and scalable network-on-chip architectures.

关键词： Global Self-Adaptive and Scalable routing algorithm (GSASRA) Self-Adaptability Network-on-Chip (NoC) routing algorithm Particle Swarm Optimization (PSO) SystemC

来源：评论

学校读者我要写书评

暂无评论

Research on WSN routing algorithm for Vegetable Greenhouse 18

Research on WSN Routing Algorithm for Vegetable Greenhouse

引用

2nd High Performance Computing and Cluster Technologies Conference (HPCCT)

作者： Xu Shipu Wang Yunsheng Liu Yong Rao Weixiong Ma Mingzhou Zhao Jingyin Zhang Chenxi Tongji Univ Software Engn Sch 4800 Caoan Rd Shanghai Peoples R China Shanghai Acad Agr Sci 1000 Jinqi Rd Shanghai Peoples R China Dalian Univ Technol Econ & Technol Dev Zone 31 Tieshanxilu Rd Dalian Liaoning Peoples R China

ISBN: (纸本)9781450364850

Aiming at the application of wireless sensor networks in vegetable greenhouses' environmental monitoring, several ad hoc routing algorithms were studied. By comparison of different routing algorithms, the most suitable conclusion for application in vegetable greenhouse of AODV (Ad hoc network on-demand distance vector) routing algorithm was obtained. Therefore, the principle of AODV algorithm is analyzed and studied. And simulation scene by NS2 was performed. In conclusion, the relationship between the number of time nodes and the quality of communication in the application scene, provided a theory evidence for the practical application in vegetable greenhouses of this wireless sensor network algorithm (WSN).

关键词： WSN routing algorithm NS2 vegetable greenhouse

来源：评论

学校读者我要写书评

暂无评论

The Rresearch of routing algorithm Based on DSP routing Module in Medium-voltage Power Line Communication

The Rresearch of Routing Algorithm Based on DSP Routing Modu...

引用

International Conference on Mechatronics Engineering and Computing Technology (ICMECT)

作者： Ge, Baolai Hou, Sizu North China Elect Power Univ Baoding Hebei Peoples R China

ISBN: (纸本)9783038351153

With the rapid development of Internet technology throughout the world, the technology of DSP has progressed tremendously. The paper conducts a research on the routing algorithm based on DSP routing module in medium-voltage power line communication. It attempts to improve link state routing algorithm based on OSPF protocol so as to enable all the circuits of the communicated DSP chips to send and receive data in real-time detection.

关键词： DSP Power line communication routing algorithm Link state routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A reconfigurable routing algorithm for a fault-tolerant 2D-Mesh Network-on-Chip

A reconfigurable routing algorithm for a fault-tolerant 2D-M...

引用

45th ACM/IEEE Design Automation Conference

作者： Zhang, Zhen Greiner, Alain Taktak, Sami Univ Paris 06 4 Pl Jussieu F-75252 Paris France

ISBN: (纸本)9781605581156

In this paper we present a reconfigurable routing algorithm for a 2D-Mesh Network-on-Chip (NoC) dedicated to fault-tolerant, Massively Parallel Multi-Processors Systems on Chip (MP2-SoC). The routing algorithm can be dynamically reconfigured, to adapt to the modification of the micro-network topology caused by a faulty router. This algorithm has been implemented in a reconfigurable version of the DSPIN micro-network, and evaluated from the point of view of performance (penalty on the network saturation threshold), and cost (extra silicon area occupied by the reconfigurable version of the router).

关键词： 2D-Mesh NoC fault-tolerant routing algorithm MP2-SoC reconfiguration DSPIN

来源：评论

学校读者我要写书评

暂无评论

MWPR: Minimal Weighted Path routing algorithm for Network on Chip 5th

MWPR: Minimal Weighted Path Routing Algorithm for Network on...

引用

5th International Conference on Advanced Computing, Networking, and Informatics (ICACNI)

作者： Prasad, E. Lakshmi Reddy, A. R. Prasad, M. N. Giri JNTUA Dept ECE Anantapuramu 515002 India

ISBN: (纸本)9789811086366;9789811086359

Due to the cumbersome routing links in Network on Chip (NoC), routing congestion and latency issues have taken place. To minimize the traffic congestion and latency issues, minimal weighted path routing (MWPR) algorithm and virtual channel (VC) router are introduced. The introduced methods are applied and experimented with respect to various bit lengths for 4x4 x 8 Star over Mesh. Simulation and synthesis results have carried out by using Xilinx 14.3 and executed in vertex-4 FPGA. The empirical result analysis exhibits that the time period for 8 bit is 0.884 ns, for 16 bit is 0.965 ns, and for 32 bit is 1.171 ns and the amount of power consumption for 8 bit is 240.96 mW, for 16 bit is 286.72 mW, and for 32 bit is 419.58 mW.

关键词： routing algorithm System on chip Network on chip Multiprocessors

来源：评论

学校读者我要写书评

暂无评论

The Howard-Romanovskii routing algorithm Revisited, with Applications to Robot Scheduling

The Howard-Romanovskii Routing Algorithm Revisited, with App...

引用

International Conference on Computers and Industrial Engineering (CIE39)

作者： Kats, Vladimir Levner, Eugene Inst Ind Math Beer Sheva Israel Holon & Bar Dan Univ Holon Inst Technol Ramat Gan Israel

ISBN: (纸本)9781424441358

We consider the original routing algorithm invented by Romanovskii (1967) for solving a cyclic project scheduling problem and establish its close relationship with the well-known routing algorithm by Dantzig, Blattner and Rao (1967). Though Romanovskii's and Dantzig-Blattner-Rao's algorithms can only treat fixed numerical data, we show that they both can be extended to solve problems with interval-valued input data.

关键词： Scheduling routing algorithm robotic scheduling polynomial algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共126页 << < 23 24 25 26 27 28 29 30 31 32 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：