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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

632 篇 会议
620 篇 期刊文献
6 篇 学位论文
2 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

1,260 篇 routing algorith...
80 篇 wireless sensor ...
78 篇 network-on-chip
60 篇 wireless sensor ...
45 篇 interconnection ...
44 篇 routing
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,200 篇 英文
34 篇 其他
26 篇 中文

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

共 1260 条记录，以下是1211-1220 订阅

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

详细简洁

排序：

An Efficient Searching Scheme in Unstructured P2P Networks

An Efficient Searching Scheme in Unstructured P2P Networks

引用

2010 International Conference on Advanced Measurement and Test (AMT 2010)

作者： Zhang Ming 1,a Yang Jinqiu 1,b 1 College of Computer Science and Technology,Zhejiang University,Hangzhou,China

Unstructured peer-to-peer(P2P)systems,due to their excellent support for content lookup and sharing,are creating a large proportion of network traffic in today’s Internet.A P2P system typically involves thousands or millions of live peers in the *** this paper,we propose and evaluate an efficient searching scheme in unstructured P2P *** scheme proposes a local adaptive routing *** routing protocol adopts a simple scheme which driven by query interest among *** analyze this scheme’s performance and present simulation *** simulation results demonstrated the benefits of the proposed system and show that the approach is able to dynamically group nodes in clusters containing peers with shared interests,at the same time,and organized into a community network.

关键词： peer-to-peer search community unstructured topology routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study on RTM and O1turn routings

A Comparative Study on RTM and O1turn Routings

引用

作者： Ming-hua Tang Jing Lin School of Internet Finance and Information Engineering Guang Dong University of Finance School of Information Management Shanghai Lixin University of Accounting and Finance

For 2D mesh based Network-on-Chip(NoC), the o1 turn routing algorithm is proposed to achieve near-optimal worst-case throughput. RTM routing has the best routing performance among all those routings which have repetitive prohibited turns. In this paper, detailed simulations are conducted to compare these two routing algorithms. Simulation results show that RTM routing has better performance than o1 turn routing under most traffic scenarios. O1 turn routing's performance improve quickly when more virtual channels are implemented.

关键词： Network-on-Chip routing algorithm routing pressure Logic-based routing

来源：评论

学校读者我要写书评

暂无评论

Active Networks for Efficient and Distributed Network Management Based on an Artificial Neural Network

Active Networks for Efficient and Distributed Network Manage...

引用

2001 International Symposium on Distributed Computing and Applications to Business, Engineering and Science

作者： Youwei Yuan La-mei Yan Department of Computer Science & Technology,Zhuzhou Engineering Institute Hunan,412008,China

The distributed management framework(DMF) presented in this paper provides an environment that allows a broad range of management tasks to move and run anywhere within the managed *** paper presents a new approach based on the Hopfield model of artificial neural networks to solve the routing problem in the distributed computer networks *** proposed method can find the best path between any node pair by minimizing an energy function. Comparison with the other optimal routing algorithms,the mean delays obtained by the neural-network approach are generally more stable and considerably smaller in execution. As a result,the proposed neural-network approach is suitable to be integrated into overall topological design processes,for moderate and high-speed networks subject to quality of services constraints as well as to changes in configuration and link costs.

关键词： Distributed Management Active Network Management Neural Network routing algorithm Mobile Agent

来源：评论

学校读者我要写书评

暂无评论

AF-CHORD:AN IMPROVED CHORD MODEL BASED ADJUSTED FINGER TABLE

AF-CHORD:AN IMPROVED CHORD MODEL BASED ADJUSTED FINGER TABLE

引用

2011 4th IEEE International Conference on Broadband Network and Multimedia Technology

作者： Shidong Zhang 1 ,Bai Wang 1 ,Gengyu Wei 1 ,Yuan Zhou 2 1 School of Computer Science and Technology, Beijing University of Posts and Telecommunications,Beijing 100876,China 2 National Computer network Emergency Response Technical Team/Coordination Center of China,Beijing,China

This paper proposed an improved Chord model called AF-Chord,which is based on the adjusted constructor for Finger Table,and give out its routing *** constructing the Finger Table,we have considered the using of the redundancy table entries,and provide a improved routing *** simulation experiment, we can prove that in the premise of a constant Finger Table capacity,the average length of logical routing path while seeking for resourses and the ability of load ba lancing have obviously been improved.

关键词： P2P Chord Model Finger Table routing algorithm routing Paths Load Balancing

来源：评论

学校读者我要写书评

暂无评论

Simulation of Gravity and Flooding algorithm for Wireless Sensor Network

Simulation of Gravity and Flooding Algorithm for Wireless Se...

引用

IEEE Malaysia International Conference on Communications

作者： Karyono Ihan Martoyo Henri P. Uranus Junita Byungho Kim Graduate and Undergraduate Program in Electrical Engineering University of Pelita Harapan Dept. of Computer Engineering Kyungsung University

ISBN: (纸本)9781424455317;9781424455324

Wireless Sensor Network (WSN) is a network of sensors that has a very large scale of nodes with a tight resources limitation. WSN is application specific, with a wide range of applications in military, survey, industrial, up to home usage. The major problems for WSN are resource limitations and dynamic network, which require unique algorithms for unique applications. Our study focused on the implementation and the characterization of the Gravity algorithm, with the Flooding algorithm as a comparison. The Gravity algorithm uses the gravity weight which is stored on each node to form a virtual contour. This contour will guide the message to reach the sink. This work is the first implementation of the Gravity model in OMNeT++. Simulations conducted in the full mesh and the layered topology show that the Gravity algorithm uses less energy and a higher diversity factor compared to the Flooding algorithm. A similar result is also acquired when the probability of failures are considered. The result shows that the Gravity algorithm outperforms the Flooding algorithm while still maintaining the simplicity of the algorithm. This is important to a WSN which is resources limited. Only a small amount of memory is needed for the gravity weight calculation and storage.

关键词： Wireless Sensor Network OMNeT++ Flooding Gravity routing algorithm Wireless sensor networks Gravity Flood routing algorithms WSN gene gravity model algorithms diversity factor Custom design simulating

来源：评论

学校读者我要写书评

暂无评论

An Improved Spray and Wait algorithm based on RVNS in Delay Tolerant Mobile Sensor Networks

An Improved Spray and Wait Algorithm based on RVNS in Delay ...

引用

IEEE International Conference on Communications

作者： Kun Wang Yun Shao Lei Shu Yanfei Sun Lei He Nanjing University of Posts and Telecommunications Guangdong University of Petrochemical Technology University of California Los Angeles

ISBN: (纸本)9781467364300

Due to the limited resources of DTMSN (Delay Tolerant Mobile Sensor Networks), network congestion becomes a critical problem to resolve. Traditional congestion control methods where the number of copies is restricted to limit data packet forwarding cannot adapt to constantly changing network environment because of fixed number of copies. Fortunately, this problem can be solved through a real-time algorithm by modifying data packet forwarding conditions. However, one of the major challenges of this algorithm is detecting characteristics of the network environment accurately and efficiently. In this paper, an optimized routing algorithm, RVNS (Reduced Variable Neighborhood Search)-based Spray and Wait (SW) is proposed. In this algorithm, nodes will transmit and store the counter record of each other when they meet, based on which, RVNS is introduced to calculate a real-time threshold for the forwarding condition to control packet delivery. Simulation results show that the proposed algorithm increases delivery probability and dramatically reduces the overhead ratio. In some extreme cases, this algorithm can reach an extremely low overhead ratio (ten times lower than that of SW), meaning that the proposed algorithm suits challenged networks well.

关键词： Reduced Variable Neighborhood Search (RVNS) Spray and Wait routing algorithm Delay Tolerant Mobile Sensor Networks (DTMSN) Congestion Control Redundant Copies

来源：评论

学校读者我要写书评

暂无评论

A Novel Clustering algorithm for Ad Hoc Network

A Novel Clustering Algorithm for Ad Hoc Network

引用

IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Li Gao Dejun Mu Yuexian Wang Guoqing Zhang Li Zhang College of Computer Northwestern Polytechnical University College of Automation Northwestern Polytechnical University

ISBN: (纸本)9781424427994

In recent years, various types of ad hoc routing protocols have been studied in the mobile ad hoc networks. Specifically, the clustering hierarchical routing algorithms have been developed to increase the system performance. Hierarchical structure has inevitably brought some drawbacks, maintaining the hierarchical structure needs more complicated cluster heads selection algorithm, which may result in the cost of maintaining cluster structure. This paper explores a novel clustering algorithm for ad hoc network. This algorithm is based on the higher stability of the cluster structures and the lower cost of maintaining the route, and the concept of "Exception Degree " is introduced into the algorithm which can judge whenever to start to adjust cluster structures in terms of the exception degree. Analysis and experiments demonstrate the features that the frequency of changing cluster heads is lower and the stability is higher.

关键词： Ad hoc network Clustering routing algorithm Stability

来源：评论

学校读者我要写书评

暂无评论

RD:REDUCING MESSAGE OVERHEAD IN DUAL

RD:REDUCING MESSAGE OVERHEAD IN DUAL

引用

2009 IEEE International Conference on Network Infrastructure and Digital Content（IC-NIDC 2009）

作者： Nan Yao,Shuai Gao,Yajuan Qin,Hongke Zhang National Engineering Laboratory for Next Generation Internet Interconnection Devices,Beijing Jiaotong University,Beijing

The efficiency of routing algorithms has always been an open question accompanied with the evolving history of routing *** storm could easily be found in today’s Internet routing infrastructure,especially in the context of distance-vector like algorithm,requiring each node affected by network anomalies to send requests to ALL its neighbors and wait for *** in-depth analysis,we found that not everyone in network needs to know every cost change in the whole *** this paper,we present a new DUAL-based routing algorithm called Reduction on Message Overhead in DUAL (RD),using two rules for suppressing some updates in *** this way,we could minimize resources utilized for transmission of cost-change updates,thus improve the efficiency of *** give theoretical analysis about the correctness of RD and present detailed design and comparative characteristics of the protocol.

关键词： routing algorithm DUAL Message Overhead Distance Vector

来源：评论

学校读者我要写书评

暂无评论

Study on Network-on-Chip Saturation

Study on Network-on-Chip Saturation

引用

2019 International Conference on Informatics, Control and Robotics 2019信息学、控制和机器人学国际会议(ICICR2019)

作者： Ming-hua TANG Jing LIN School of Internet Finance and Information Engineering GuangDong University of Finance School of Information Management Shanghai Lixin University of Accounting and Finance

In Network-on-Chip(NoC), although the term "saturation" is always used while discussing about performance and power figures exhibited by a NoC, there is not, however, an unanimous definition of the saturation status. There are at least six representative usages about saturation, which shows that there is lack of systematical study on saturation in the literature. In this paper, we carry out detailed study on saturation. The current usages about saturation are analyzed. The simulation results show that NoC saturation status is quite complex. Consequently, saturation should not be used without careful consideration.

关键词： Network-on-Chip routing algorithm Saturation

来源：评论

学校读者我要写书评

暂无评论

RD: REDUCING MESSAGE OVERHEAD IN DUAL

RD: REDUCING MESSAGE OVERHEAD IN DUAL

引用

2009 IEEE International Conference on Network Infrastructure and Digital Content(2009年IEEE网络基础设施与数字内容国际会议 IEEE IC-NIDC2009)

作者： Nan Yao Shuai Gao Yajuan Qin Hongke Zhang National Engineering Laboratory for Next Generation Internet Interconnection Devices Beijing Jiaotong University Beijing

The efficiency of routing algorithms has always been an open question accompanied with the evolving history of routing problems. Message storm could easily be found in today's Internet routing infrastructure, especially in the context of distance-vector like algorithm, requiring each node affected by network anomalies to send requests to ALL its neighbors and wait for response. Through in-depth analysis, we found that not everyone in network needs to know every cost change in the whole graph. In this paper, we present a new DUAL-based routing algorithm called Reduction on Message Overhead in DUAL (RD), using two rules for suppressing some updates in network. In this way, we could minimize resources utilized for transmission of cost-change updates, thus improve the efficiency of DUAL. We give theoretical analysis about the correctness of RD and present detailed design and comparative characteristics of the protocol.

关键词： routing algorithm DUAL Message Overhead Distance Vector

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 117 118 119 120 121 122 123 124 125 126 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：