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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
622 篇 期刊文献
6 篇 学位论文
2 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

1,263 篇 routing algorith...
79 篇 wireless sensor ...
79 篇 network-on-chip
60 篇 wireless sensor ...
46 篇 interconnection ...
44 篇 routing
41 篇 fault tolerance
30 篇 clustering
28 篇 reliability
28 篇 load balancing
25 篇 topology
23 篇 interconnection ...
20 篇 network topology
20 篇 noc
18 篇 opportunistic ne...
18 篇 wsn
18 篇 network on chip
18 篇 networks-on-chip
17 篇 qos
16 篇 quality of servi...

机构

8 篇 xidian univ stat...
7 篇 univ calif santa...
6 篇 hosei univ dept ...
6 篇 sharif univ tech...
5 篇 south china univ...
5 篇 univ chinese aca...
5 篇 xidian univ sch ...
5 篇 northeastern uni...
5 篇 school of inform...
5 篇 inst res fundame...
5 篇 xidian univ stat...
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 ...

作者

15 篇 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,202 篇 英文
35 篇 其他
26 篇 中文

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

共 1263 条记录，以下是151-160 订阅

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

详细简洁

排序：

DBAR: An Efficient routing algorithm to Support Multiple Concurrent Applications in Networks-on-Chip 11

DBAR: An Efficient Routing Algorithm to Support Multiple Con...

引用

38th Annual International Symposium on Computer Architecture

作者： Ma, Sheng Jerger, Natalie Enright Wang, Zhiying Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781450304726

With the emergence of many-core architectures, it is quite likely that multiple applications will run concurrently on a system. Existing locally and globally adaptive routing algorithms largely overlook issues associated with workload consolidation. The shortsightedness of locally adaptive routing algorithms limits performance due to poor network congestion avoidance. Globally adaptive routing algorithms attack this issue by introducing a congestion propagation network to obtain network status information beyond neighboring nodes. However, they may suffer from intra-and inter-application interference during output port selection for consolidated workloads, coupling the behavior of otherwise independent applications and negatively affecting performance. To address these two issues, we propose Destination-Based Adaptive routing (DBAR). We design a novel low-cost congestion propagation network that leverages both local and non-local network information for more accurate congestion estimates. Thus, DBAR offers effective adaptivity for congestion beyond neighboring nodes. More importantly, by integrating the destination into the selection function, DBAR mitigates infra-and inter-application interference and offers dynarnic isolation among regions. Experimental results show that DBAR can offer better performance than the best baseline algorithm for all measured configurations;it is well suited for workload consolidation. The wiring overhead of DBAR is low and DBAR provides improvement in the energy-delay product for medium and high injection rates.

关键词： Networks-on-chip routing algorithm Workload Consolidation

来源：评论

学校读者我要写书评

暂无评论

Nearest Access routing algorithm for the ZigBee Network in 5G Environment 1

引用

4th International Conference on Communications, Signal Processing, and Systems (CSPS)

作者： Mu, Jiasong Jiang, Shu Tianjin Normal Univ Coll Elect & Commun Engn Tianjin Peoples R China China Shipbldg Ind Corp Inst 704 Shanghai 200031 Peoples R China

ISBN: (数字)9783662498316

ISBN: (纸本)9783662498316;9783662498293

ZigBee network uses a mixed routing mechanism combined with hierarchical tree routing (HRP) and ad hoc on demand distance vector (AODV) to meet the different demands. However, the existing scheme cannot fully satisfy the applications. The 5G communication network is featured by the smarter devices and the native support for the M2 M communication. The 5G terminals have the potential to optimize the data transmission in the ZigBee network. In this paper, we proposed a nearest access routing algorithm for the ZigBee network in 5G environment. Based on the accessibility to various kinds of wireless network of the 5G terminal, the data flow in its neighbourhood is converged and transmitted in the IP network. By that mechanism, the bandwidth and energy resources in the ZigBee network can be saved. The simulation results show that the proposed algorithm effectively share the traffic for the ZigBee network by reducing and balancing the throughput.

关键词： ZigBee routing algorithm 5G Throughput

来源：评论

学校读者我要写书评

暂无评论

Cool Elevator: A Thermal-Aware routing algorithm for Partially Connected 3D NoCs 6

Cool Elevator: A Thermal-Aware Routing Algorithm for Partial...

引用

6th International Conference on Computer and Knowledge Engineering (ICCKE)

作者： Taheri, Ebadollah Patooghy, Ahmad Mohammadi, Karim Iran Univ Sci & Technol Dept Elect Engn Tehran Iran Iran Univ Sci & Technol Sch Comp Engn Dependable Syst & Architectures Lab Tehran Iran

ISBN: (纸本)9781509035861

Despite of high throughput and low fabrication cost of vertically partially connected 3D Noes, thermal difficulties arise from poor heat dissipation and inappropriate traffic distribution of these kinds of 3D Noes. This paper proposes an adaptive routing algorithm in order to manage thermal challenges in partially connected 3D Noes. In the proposed routing algorithm, vertical links declare their availability/unavailability status to their neighbor nodes due to their current temperature. In this way, hot vertical links have a chance to reduce their traffic load and to cool down. In a predefined time periods vertical links update process is done to determine current hot and cool vertical links. In an updating time periods, cool vertical links are announced to the routers of each layer for transmitting packets to other layers. Access Noxim simulator is used to evaluates the routing algorithm in different partially 3D networks. Results show that the proposed routing algorithm decreases the number of overheated nodes by at least 74% and improves the thermal variance by at least 13%. These results are achieved within at most 10% overhead in average latency delay.

关键词： Thermal-aware routing algorithm 3D NoC Deadlock-free

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm for Node Protection in Wireless Sensor Network Based on Clustering Ant Colony Strategy 8th

A Routing Algorithm for Node Protection in Wireless Sensor N...

引用

8th International Conference on Artificial Intelligence and Security (ICAIS)

作者： Feng, Xiao Wang, Yuanzheng Dong, Tengfei Liao, Yingxia Zhang, Yixin Lin, Yi State Grid Informat Telecommun Grp Co Ltd Beijing 102211 Peoples R China

ISBN: (纸本)9783031067914;9783031067907

Thanks to the rapid development of wireless communication and electronic technology, wireless sensor networks have been increasingly used in military, medical and other fields. Because of the characteristics of wireless sensor networks, traditional network routing protocols are not applicable in wireless sensor networks. In recent research, many wireless sensor network routing algorithms have been proposed. Among these algorithms, the cluster routing algorithm performs well, but the cluster routing algorithm often has the problem that some nodes die prematurely due to too many communication tasks. Ant colony optimization algorithm can effectively solve the combinatorial optimization problem with NP-Hard characteristics, and is widely used in routing algorithms. Therefore, we propose a node protection routing algorithm for wireless sensor network based on clustering ant colony strategy (NPAWSN). This algorithm optimizes the clustering process, selects multiple cluster head nodes for clusters with high communication pressure, and at the same time, designs a new path probability selection model for ant movement, which fully considers the remaining energy of cluster head nodes close to the sink, effectively alleviating the problem of premature death of some nodes due to too many transmission tasks. The algorithm considers the sensor energy, communication efficiency and other factors. The use of adaptive ant colony algorithm improves the convergence speed and maintains the high performance of the routing algorithm.

关键词： Clustering Ant colony optimize routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Agent routing algorithm in Wireless Sensor Networks

Agent Routing Algorithm in Wireless Sensor Networks

引用

4th International Conference on Graphic and Image Processing (ICGIP)

作者： Zhang Yuqing Yang Shuqun Fujian Normal Univ Fac Software Fuzhou Peoples R China

ISBN: (纸本)9780819495662

Wireless sensor networks are a new technology of information acquisition and processing, so they are widely used in all kinds of fields. In the paper we introduce Agent technology into the wireless sensor network, conduct a in-depth research on the four routing schemes, and propose a new improved routing scheme, which considers the energy consumption of both nodes and path. Furthermore, The scheme we proposed has efficient routing function, can balance the energy consumption of nodes and extends the lifetime of the network in a more efficient way.

关键词： Agent wireless sensor network energy consumptio routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Inter-Satellite routing algorithm by Searching the Global Neighborhood for Dynamic Inter-Satellite Networks 10

Inter-Satellite Routing Algorithm by Searching the Global Ne...

引用

10th International Conference on Advanced Computational Intelligence (ICACI)

作者： Xie, Ping Zhang, Zhong-Shan Zhang, Jin China Aerosp Acad Syst Sci & Engn Beijing Peoples R China Natl Univ Def Technol Coll Syst Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781538643624

The space segment of the navigation satellite constellation is a time-varying dynamic inter-satellite information network. This paper intends to address the routing design issues of dynamic inter-satellite networks. Firstly, we introduce two combinatorial routing strategies of hop-count and time factors by analyzing the characteristics of the dynamic transformation. Then considering the complexity of the routing algorithm under combinatorial strategies, we propose the Inter-Satellite routing algorithm by Searching the Global Neighborhood (ISRA-SGN), which is embedded into different routing strategies, leading to their corresponding routing algorithms. The computational results based on the simulation instance show that the proposed algorithms is effective and can be used to find the optimal routing path of different routing strategies. Especially, the ISRA-SGN embedded into the specific routing strategy has better performance than the Inter-Satellite routing algorithm without Searching the Global Neighborhood (ISRA).

关键词： inter-satellite network inter-satellite routing strategy routing algorithm global neighborhood searching dynamic satellite networks

来源：评论

学校读者我要写书评

暂无评论

A Link Failure Aware routing algorithm for Networks-on-Chip in Nano Technologies

A Link Failure Aware Routing Algorithm for Networks-on-Chip ...

引用

9th IEEE Conference on Nanotechnology (IEEE-NANO)

作者： Valinataj, Mojtaba Mohammadi, Siamak Safari, Saeed Plosila, Juha Univ Tehran Sch Elect & Comp Engn Tehran Iran Univ Turku Dept Informat Technol Turku Finland

ISBN: (纸本)9789810836948

As nanotechnology scales down, the reliability issues are becoming more crucial, especially for Network-on-Chip (NoC) which must provide the communication requirements of Multi-Processor System-on-Chip (MP-SoC) even in presence of faults. In this paper we present a low cost faulty-link-tolerant routing algorithm through dynamic reconfiguration when the regular mesh topology is altered by faulty links. This algorithm is a reconfigurable extension of deterministic routing algorithms and is deadlock free by prohibiting a few turns. The performance and total energy consumption overheads which are very small under the low loads are evaluated through appropriate simulations.

关键词： NoC routing algorithm permanent fault reconfiguration

来源：评论

学校读者我要写书评

暂无评论

A Novel routing algorithm in Cognitive Radio Ad Hoc Networks

A Novel Routing Algorithm in Cognitive Radio Ad Hoc Networks

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Li, Jun Zhou, Yifeng Lamont, Louise Gagnon, Francois Commun Res Ctr Canada 3701 Carling Ave Ottawa ON K2H 8S2 Canada Ecole Technol Super Dept Elect Engn Montreal PQ H3C 1K3 Canada

ISBN: (纸本)9781424492688

Cognitive radio ad hoc networks (CRAHNs) have become a popular network architecture for connecting mobile nodes thanks to the flexibility and adaptability of such type of network. In this paper, we propose a novel scheme for efficient routing design in CRAHNs. The proposed routing scheme firstly forms a simple directed graph for the given physical network. Using the simple directed graph, multiple optimal routing paths can be computed for a pair of cognitive radio users. An optimal routing path minimizes both the hop count and the adjacent hop interference. Examples are used to demonstrate the performance and efficiency of the proposed CRAHN routing technique. Results are also compared with other existing routing techniques for CRAHNs.

关键词： Ad hoc networks CRAHN Cognitive radio Interference Network topology Peer to peer computing routing Topology ad hoc networks cognitive radio cognitive radio ad hoc network directed graph directed graphs hop count hop interference network architecture optimal routing path routing algorithm telecommunication network routing

来源：评论

学校读者我要写书评

暂无评论

A Deadlock-Free routing algorithm Requiring No Virtual Channel on 3D-NoCs with Partial Vertical Connections

A Deadlock-Free Routing Algorithm Requiring No Virtual Chann...

引用

7th IEEE/ACM International Symposium on Networks-on-Chip (NoCS)

作者： Lee, Jinho Choi, Kiyoung Seoul Natl Univ Sch Elect Engn & Comp Sci Seoul 151 South Korea

ISBN: (纸本)9781467364911;9781467364928

Elevator-first routing algorithm has been introduced for partially connected 3D network-on-chip as a low-cost, distributed and deadlock-free routing algorithm using two virtual channels. This paper proposes Redelf, a modification of the elevator-first routing algorithm on a 3D mesh topology. The proposed algorithm requires no virtual channel to ensure deadlock-freedom.

关键词： NoC deadlock routing algorithm 3D stacking

来源：评论

学校读者我要写书评

暂无评论

Stability oriented multicast routing algorithm

Stability oriented multicast routing algorithm

引用

Conference on Network Architectures, Management, and Applications IV, Pts 1 & 2

作者： Feng, Da Sun, Weiqiang Jin, Yaohui Hu, Weisheng Guo, Wei Shanghai Jiao Tong Univ State Key Lab Fiber Opt Local Area Networks & Adv 800 Dongchuan Rd Shanghai 200240 Peoples R China

ISBN: (纸本)081946449X

Existing multicast models have taken traffic concentration, source-end delay, delay jitter into consideration, while some dynamic application like digital TV delivery poses a new challenge. Users can join/leave multicast group dynamically and arbitrarily. When all users in a service group have left the multicast group, multicast protocols will delete the corresponding delivery edge in the multicast tree, which leads to great control overhead in delivery network. This overhead comes from several aspects, like forwarding tree maintain, update, membership management. Even if the multicast tree is pre-calculated and cannot delete edges in runtime, the users' leaving action can lead to resource utilization problem, especially when the delivery network's bandwidth is expensive. In this paper we designed an algorithm to find the optimized multicast tree to ensure stability of network under dynamic user behavior. With this algorithm, effect of users' random behavior can be smoothed out, thus increase performance of the delivery network.

关键词： IPTV multicast routing algorithm stable tree

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共127页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：