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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是331-340 订阅

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

详细简洁

排序：

Modeling and Simulation of Network-on-Chip routing algorithm Based on OPNET

Modeling and Simulation of Network-on-Chip Routing Algorithm...

引用

International Conference on Intelligent Computing and Human-Computer Interaction (ICHCI)

作者： Li, Fei Gao, Wanjia Chen, Liangchang Liu, Wenyi North Univ China Sch Instruments & Elect Taiyuan Shanxi Peoples R China

ISBN: (纸本)9781665423168

When a large amount of data floods into the network, the traditional routing algorithm of the Network-on-Chip will cause network congestion due to the selection of the same path, which will seriously affect the transmission and real-time performance of the data. Based on that, this paper proposes an efficient adaptive routing algorithm to avoid the situation. In this paper, the binary tree topology was improved. Then this paper uses OPNET simulation software to model the improved routing algorithm in three layers, and performs simulation experiments on the model. The evaluations show that the simulation results of the algorithm meet the expectations, and the algorithm can select the shortest path for the packets flooding into the network, which avoiding network congestion. The end-to-end delay is 48s less than the traditional routing algorithm, and the real-time performance is higher. This research can effectively avoid network congestion when there is a mass of data in the network.

关键词： Network-on-Chip routing algorithm topology OPNET end-to-end delay

来源：评论

学校读者我要写书评

暂无评论

3D Torus ONoC: Topology Design, Router Modeling and Adaptive routing algorithm 13

3D Torus ONoC: Topology Design, Router Modeling and Adaptive...

引用

13th International Conference on Optical Communications and Networks (IEEE ICOCN)

作者： Hou, Weigang Guo, Lei Cai, Qing Zhu, Lijiao Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China

ISBN: (纸本)9781479972197

With the rapid development of electronic products, the high-speed computing and the personal mobile terminal all make greater demands the on-chip performance. Due to the limited bandwidth, the low communication efficiency and the bad scalability, the Network on Chip (NoC) has been unable to satisfy the requirements of the applications above. More recently, the Optical NoC (ONoC) is introduced as an efficient solution. Compared with NoC, ONoC has the higher bandwidth, the lower power consumption and the shorter latency. With the increasing number of IP cores on a single chip, the study of 3-Dimensional (3D) ONoC has already entered the preliminary stage. Thus in this paper, we design a new 3D ONoC topology structure called 3D X-Torus. Next, we design a bidirectional optical router and a vertical optical router for our topology. Finally, we propose the corresponding routing algorithm. Our simulation results demonstrate the performances of our 3D ONoC topology, optical router and routing algorithm.

关键词： Optical Network on Chip (ONoC) 3D ONoC topology optical router design and modeling routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Space Angle Based Energy-Aware routing algorithm in Three Dimensional Wireless Sensor Networks

Space Angle Based Energy-Aware Routing Algorithm in Three Di...

引用

12th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)

作者： Li Yaman Wang Xingwei Huang Min Northeastern Univ Coll Informat Sci & Engn Shenyang Liaoning Provin Peoples R China

ISBN: (纸本)9780769550602

Most of the existing routing algorithms are based on two dimension, and the results can't be directly applied to the three dimensional wireless sensor networks, the Space Angle Based Energy-Aware routing algorithm in three dimensional wireless sensor networks is designed in this paper. Firstly, the Iterative Split Clustering algorithm for dividing the network nodes is proposed. Secondly, we design the Space Angel Energy routing algorithm to transfer data within the clusters and between the clusters respectively, achieving the goal of less energy consumption and extending the network lifetime. We simulate and implement the algorithm and evaluate the performance based on topologies with different scales, and get a conclusion that by comparing with the typical algorithm, the routing algorithms proposed in this paper are able to reduce the network energy consumption effectively and extend the network lifetime.

关键词： three dimensional wireless sensor networks clustering routing algorithm energy saving

来源：评论

学校读者我要写书评

暂无评论

SWARM INTELLIGENCE OPTIMIZATION BASED routing algorithm FOR WIRELESS SENSOR NETWORKS

SWARM INTELLIGENCE OPTIMIZATION BASED ROUTING ALGORITHM FOR ...

引用

International Conference on Neural Networks and Signal Processing

作者： Wang Chao Lin Qiang Shanghai Univ Sch Commun & Informat Engn Shanghai 200072 Peoples R China

ISBN: (纸本)9781424423101

Energy balance is an important performance index in the design of routing algorithm for wireless sensor networks. A swarm intelligence optimization based routing algorithm for Wireless Sensor Networks is proposed, whose kernel idea is taking less hop numbers into consideration and choosing the nodes with less pheromone as next hop to avoid some nodes' prematurely exhausting their energy because of too concentrated routes through the nodes. The experiments show that the algorithm proposed in this paper is better than the Directed Diffusion routing protocol both in end-to-end delay and global energy balance and can effectively balance the global energy consumption and prolong the network lifetime.

关键词： routing algorithm Swarm Intelligence Simulation Annealing Energy Balance

来源：评论

学校读者我要写书评

暂无评论

A Heuristic routing algorithm for Clos Network

A Heuristic Routing Algorithm for Clos Network

引用

7th World Congress on Intelligent Control and Automation

作者： Duan, Xinming Liu, Shuqiang Tianjin Polytech Univ Dept Comp Tech Tianjin Peoples R China Tianjin Univ Finance & Econ Dept Math Tianjin Peoples R China

ISBN: (纸本)9781424421138

This paper presents a new Clos network routing algorithm in order to reduce the high time complexity of original algorithm for Clos network. The paper illustrates that it is an independent problem whether a column in specification matrix is completive. As a result, it eliminates backtrackings among columns and backtrackings among elements in the same column. The presented algorithm completely achieves non-blocking routing and reaches low time complexity O(N-3/2) even in the worst case. So the algorithm is readily applicable to the control of Clos network.

关键词： Clos network routing algorithm time complexity

来源：评论

学校读者我要写书评

暂无评论

3DEP: A Efficient routing algorithm to Evenly Distribute Traffic over 3D Network-on-Chips 27

3DEP: A Efficient Routing Algorithm to Evenly Distribute Tra...

引用

27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)

作者： Vahdatpanah, Fatemeh Elahi, Mahdi Kashi, Somayeh Taheri, Ebadollah Patooghy, Ahmad Iran Univ Sci & Technol Sch Comp Engn Tehran Iran Univ Cent Arkansas Dept Comp Sci Conway AR 72035 USA

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.

关键词： Turn Model routing algorithm 3D Network-on-Chip Deadlock Partially Adaptive

来源：评论

学校读者我要写书评

暂无评论

A Frame Aggregation Extension of routing algorithm for Wireless Mesh Networks 2

A Frame Aggregation Extension of Routing Algorithm for Wirel...

引用

International Symposium on Computing and Networking CANDAR

作者： Funabiki, Nobuo Tani, Yuuma Tajima, Shigeto Okayama Univ Dept Elect & Commun Engn Okayama Japan Osaka Univ Grad Sch Engn Sci Toyonaka Osaka Japan

ISBN: (纸本)9781479941520

As a scalable Internet-access network, an Wireless Internet-access Mesh NETwork (WIMNET) consists of multiple wireless access-points (APs) that are connected through wireless links. At least one AP acts as a gateway (GW) to the Internet where any host must reach there through multi-hop communications between APs. To handle large traffics, the latest highspeed IEEE 802.11ac protocol should be adopted for scalable WIMNET, where the routing path determines the performance under its practical implementations using commercial products. Therefore, we have proposed a routing algorithm considering 1) multiple GWs, 2) the link speed change, and 3) the limited number of hops. In this paper, to further improve the performance, we extend the routing algorithm to efficiently consider the frame aggregation in IEEE802.11ac. We verify the effectiveness of our proposal through simulating two topologies using the extended WIMNET simulator.

关键词： Wireless mesh network WIMNET IEEE802.11ac routing algorithm frame aggregation simulation

来源：评论

学校读者我要写书评

暂无评论

A Robust routing algorithm with Fair Congestion Control in Wireless Sensor Network

A Robust Routing Algorithm with Fair Congestion Control in W...

引用

17th International Conference on Computer Communications and Networks

作者： Liu, Yunlu Liu, Yuheng Pu, Juhua Xiong, Zhang Beihang Univ Sch Comp Sci & Technol Beijing Peoples R China

ISBN: (纸本)9781424423897

In recent years, there has been a growing interest in wireless sensor networks (WSNs). Considering the limited energy, memory and computational capacity of the sensor nodes, it becomes necessary to ensure rational use of their resources. The fairness and congestion control are also need to be taken into account. It is in this context that a robust routing algorithm with fair congestion control in wireless sensor network (called RRA-FCC) is proposed. RRA-FCC performs a low cost and robust routing based on dividing the monitoring region into several subareas initially. Furthermore, RRA-FCC provides a fair congestion control, which improves the whole network fairness in congestion. The simulation results show that RRA-FCC performs well in the throughput of Sink nodes, energy consumption and the whole network fairness in congestion.

关键词： wireless sensor networks routing algorithm fairness congestion control

来源：评论

学校读者我要写书评

暂无评论

Overlapping Clustering routing algorithm Based on L-PLC Meter Reading System

Overlapping Clustering Routing Algorithm Based on L-PLC Mete...

引用

IEEE International Conference on Automation and Logistics

作者： Wang, Zhenchao Wang, YiJin Wang, Jing HeBei Univ Coll Elect & Informat Engn Baoding HeBei Province Peoples R China

ISBN: (纸本)9781424447947

In the meter reading system of low voltage power line communication (L-PLC), data signals are forwarded by relay nodes adopting routing algorithm. This paper puts forward a dynamic routing algorithm adapting to meter reading system of L-PLC. The algorithm is based on overlapping clustering, so it can establish multiple shortest routings. Then a new rule is given that a node can respond to clustering command from all nodes but its sub-nodes. As a result, the routing constructure of net topology is got rather than a tree topology. Further more, in order to record information of all paths, we build a routing table as matrix, and acquire paths through searching the routing table. If one of the paths is broken, other paths as backup routing will be chosen. By this way, alternative paths are increased, which reduces network reconstruction and improves the reliability of communication. By sensing channel conditions, the algorithm could automatically inspect nodes which can execute communication directly, build dynamic network routing, search relay nodes and finish the communication.

关键词： L-PLC meter reading system clustering routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Distributed routing algorithm Based on the Reliable Path

A Distributed Routing Algorithm Based on the Reliable Path

引用

5th International Conference on Wireless Communications, Networking and Mobile Computing

作者： Ma Zan Xu Zhen Rui Liyang BUAA Sch Elect Informat Engn Beijing Peoples R China

ISBN: (纸本)9781424436927

In this paper we present a distributed routing algorithm based on the reliable path to improve the efficiency of routing protocols in ad hoc network. This protocol takes advantage of the graphical information, velocity and position, to acquire the link lifetime. When the link is broken, the routing information is updated at once. Moreover, one neighbor with the fewest hops to the destination and relatively greater link lifetime is used to forward messages without transmission back-off delay as the next hop. The experimental results show that DBRP can deliver messages more reliably and more quickly compared to SSR.

关键词： ad hoc network routing algorithm reliable path link lifetime

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：