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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,584 篇 会议
698 篇 期刊文献
3 篇 学位论文

馆藏范围

2,285 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,192 篇 工学
- 1,727 篇 计算机科学与技术...
- 1,172 篇 软件工程
- 863 篇 信息与通信工程
- 600 篇 电气工程
- 196 篇 动力工程及工程热...
- 165 篇 电子科学与技术（可...
- 125 篇 控制科学与工程
- 103 篇 光学工程
- 73 篇 机械工程
- 51 篇 仪器科学与技术
- 50 篇 交通运输工程
- 40 篇 化学工程与技术
- 36 篇 航空宇航科学与技...
- 18 篇 土木工程
- 18 篇 生物工程
- 17 篇 材料科学与工程（可...
- 17 篇 建筑学
- 16 篇 农业工程
755 篇 理学
- 459 篇 数学
- 229 篇 物理学
- 46 篇 统计学（可授理学、...
- 45 篇 系统科学
- 40 篇 化学
- 29 篇 生物学
306 篇 管理学
- 168 篇 管理科学与工程(可...
- 153 篇 图书情报与档案管...
- 64 篇 工商管理
32 篇 经济学
- 32 篇 应用经济学
18 篇 医学
- 15 篇 临床医学
17 篇 农学
- 17 篇 作物学
11 篇 法学
6 篇 文学
5 篇 教育学
4 篇 军事学
2 篇 艺术学

主题

2,285 篇 routing algorith...
145 篇 optical networks
97 篇 network topology
90 篇 network routing
75 篇 wireless sensor ...
55 篇 algorithms
44 篇 wavelength assig...
37 篇 network-on-chip
37 篇 interconnection ...
36 篇 routing
33 篇 wavelength divis...
31 篇 energy consumpti...
30 篇 multicast
30 篇 fiber optics and...
29 篇 networks (060.42...
27 篇 ganglia
26 篇 optical signals
25 篇 networking hardw...
25 篇 quality of servi...
25 篇 packet switching

机构

9 篇 beijing univ pos...
8 篇 college of infor...
7 篇 tsinghua univ de...
7 篇 beijing universi...
6 篇 univ glasgow dep...
6 篇 chongqing key la...
5 篇 univ calif davis...
5 篇 univ nebraska de...
5 篇 univ cyprus dept...
4 篇 school of electr...
4 篇 northeastern uni...
4 篇 school of commun...
4 篇 northeastern uni...
4 篇 school of electr...
4 篇 university of el...
4 篇 school of comput...
4 篇 kth royal inst t...
4 篇 columbia univ de...
4 篇 college of compu...
4 篇 kazimierz wielki...

作者

15 篇 ren zhi
14 篇 zhang jie
13 篇 zhao yongli
8 篇 xu gang
8 篇 skeie tor
8 篇 kaneko keiichi
7 篇 wang xingwei
7 篇 duato j
7 篇 huang min
7 篇 peng shietung
6 篇 kumar shashi
6 篇 ebrahimi masoume...
6 篇 ould-khaoua m
6 篇 piechowiak macie...
6 篇 zwierzykowski pi...
6 篇 escudero-sahuqui...
6 篇 palesi maurizio
5 篇 min huang
5 篇 duan xinming
5 篇 duato j.

语言

2,151 篇 英文
66 篇 其他
63 篇 中文
2 篇 西班牙文
2 篇 朝鲜文
1 篇 土耳其文

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

共 2285 条记录，以下是81-90 订阅

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

详细简洁

排序：

Effects of applying mobility localization on source routing algorithms for mobile ad hoc network.

Effects of applying mobility localization on source routing ...

引用

8th IEEE International Symposium on Computers and Communication (ISCC 2003)

作者： Rajan, H

ISBN: (纸本)076951961X

Network topology in Mobile Ad Hoc Networks is subject to constant/abrupt change. Source routing algorithms tend not to perform well due to this unstable topology, which invalidates the source routes often, however, the changes in the topology are often local due to the continuous nature of physical movement of nodes. The hypothesis behind this work is that performance of source routing algorithm can be enhanced by localizing these changes in the source route due to mobility, called "Mobility Localization". Rest of the work discusses and evaluates this hypothesis.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient and Congestion Aware routing algorithms for Wireless Sensor Networks Connected as Hypercube

Energy Efficient and Congestion Aware Routing Algorithms for...

引用

International Symposium on Telecommunications

作者： Mohajerzadeh, Amir Hossein Yaghmaee, Mohammad Hossien Eskandari, Zahra Deldari, Hossein Ferdowsi Univ Mashad Dept Comp Engn Mashhad Iran

ISBN: (纸本)9781424427505

Wireless Sensor Networks (WSN) have been noticed and researched nowadays. These new type of networks have unique characteristics. WSNs have different limitations such as computational power, storage capacity, energy source and etc. The main constraint of wireless sensor networks is energy. The energy source of sensor nodes is limited and not rechargeable. Therefore, optimizing consumption of energy is essential for WSNs protocols. Hypercube topology is very popular in distributed environments. In last few years, many different topology specific routing algorithms have been designed for wireless sensor networks, but to the best of our knowledge, none of them consider Hypercube as their topology. In this paper, different routing algorithms are proposed for WSN with Hypercube topology. The performance of all proposed routing algorithms is evaluated, and the best algorithm which can provide more fairness is introduced. Simulation results which are represented in last section of this paper are the base of our conclusions. The main goal of this paper is to find a fair energy aware routing algorithm for wireless sensor network connected as Hypercube.

关键词： Energy Aware Algorithm Fairness Hypercube routing algorithms Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

A tool for the analysis of reconfiguration and routing algorithms in irregular networks 2nd

引用

2nd International Workshop on Communication, Architecture, and Applications for Network-Based Parallel Computing (CANPC 98)

作者： Casado, R Caminero, B Cuenca, P Quiles, F Garrido, A Duato, J Univ Castilla La Mancha E Univ Politecn Albacete Spain Univ Politecn Valencia Fac Informat E-46071 Valencia Spain

ISBN: (纸本)3540641408

High performance interconnection networking is one of the most active research fields in the area of communications. Their quick development has been increased by the interest in using multiple workstations in parallel processing. These local networks use ideas that are already successfully applied in parallel computer interconnection networks. However, their more flexible and dynamic environment exposes new problems, such as topology configuration and message routing, which are difficult to solve with the current methods used in regular networks. Therefore, it is advisable to apply tools that kelp the researcher to develop and verify the behavior of new algorithms for these new networks. Nowadays, the RAAP group (Redes y Arquitecturas de Altas Prestaciones, High Performance Networks and Architectures) of the University of Castilla-La Mancha is working in this way. In this paper, we present a software tool developed by the RAAP group with the aim of helping in the research. It does not try to simulate the communications within the network (where a long computation process would not be able to guarantee none of its properties) but to analyze its behavior, through the channel dependency graph. The result is an agile and practical tool that provides conclusions in a quick and reliable way.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Sensitivity of routing algorithms with Various Models of Wireless Sensor Networks

Performance Sensitivity of Routing Algorithms with Various M...

引用

IEEE 8th International Conference on Intelligent Sensors, Sensor Networks and Information Processing (IEEE ISSNIP)

作者： Bernard, Julien Felea, Violeta Univ Franche Comte CNRS UMR 6174 Inst FEMTO ST F-25030 Besancon France

ISBN: (纸本)9781467355018;9781467354998

routing algorithms for wireless sensor networks are often evaluated through simulations in order to measure the lifetime of the network and the efficiency of the algorithm regarding energy consumption. Some particular communication models with their parameters' set are used to implement the simulation and are rarely identical. We exhibit two kinds of performance sensitivity regarding simulations: the first one concerns the communication model itself and the second one is generated by the parameters of the communication model. We provide a generalized model that covers very different situations and we state the routing problem as a linear programming problem in order to measure the absolute efficiency of the algorithms with different models and parameter values. Our experiments run using two routing protocols, LEACH and Flow Augmentation, showed that different models or parameters can lead to significantly different results and conclusions. We tried to characterize the origin of the performance sensitivity in each case.

关键词： Wireless sensor networks routing algorithms communication modeling algorithm efficiency absolute efficiency Flow augmentation simulating routing Problem Communication Research linear programming

来源：评论

学校读者我要写书评

暂无评论

Performance sensitivity of routing algorithms to failures in networks of workstations 3rd

Performance sensitivity of routing algorithms to failures in...

引用

3rd International Symposium on High Performance Computing (ISHPC 2000)

作者： Molero, X Silla, F Santonja, V Duato, J Univ Politecn Valencia Dept Informat Sistemes & Comp Valencia 46022 Spain

ISBN: (纸本)3540411283

Networks of workstations (NOWs) axe becoming an increasingly popular alternative to parallel computers for those applications with high needs of resources such as memory capacity and input/output storage space, and also for small scale parallel computing. Although the mean time between failures (MTBF) for individual links and switches in a NOW is very high, the probability of a failure occurrence dramatically increases as the network size becomes larger. Moreover, there axe external factors, such as accidental link disconnections, that also can affect the overall NOW reliability. Until the faulty element is replaced, the NOW is functioning in a degraded mode. Thus, it becomes necessary to quantify how much the global NOW performance is reduced during the time the system remains in this state. In this paper we analyze the performance degradation of networks of workstations when failures in links or switches occur. Because the routing algorithm is a key issue in the design of a NOW, we quantify the sensitivity to failures of two routing algorithms: up*/down* and minimal adaptive routing algorithms. Simulation results show that, in general, up*/down* routing is highly robust to failures. On the other hand, the minimal adaptive routing algorithm presents a better performance, even in the presence of failures, but at the expense of a larger sensitivity.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of routing algorithms with Static and Dynamic Link Cost in SDN 16

Comparison of Routing Algorithms with Static and Dynamic Lin...

引用

16th IEEE Annual Consumer Communications and Networking Conference (CCNC)

作者： Akin, Erdal Korkmaz, Turgay Univ Texas San Antonio San Antonio TX 78249 USA

ISBN: (纸本)9781538655535

There are several routing algorithms that can be used in the context of Software Defined Networking (SDN), where a logically centralized controller obtains the global view of the network and network state information, makes the routing decisions, and installs them to the switches in the selected paths. Comparing the performance of the existing routing algorithms under realistic simulation scenarios and understanding the factors that impact their performance are very important for their adaption in practice. Accordingly, we implemented several existing routing algorithms using RYU SDN controller and evaluated their performance on Mininet emulator. We considered three categories of routing algorithms with Static Link Cost (RA-SLC), Dynamic Link Cost (RA-DLC), and Dynamic Link cost with Minimum Interference (RA-DLCMI) under both the idealistic case assuming the availability of accurate network state information (NSI) and the practical case where the NSI is collected periodically and has some inaccuracy. Our experimental results showed that both RA-DLC and RA-DLCMI outperformed RA-SLC in terms of throughput and the number of accepted flows while there was no significant difference between RA-DLC and RA-DLCMI. We also observed that periodic collections caused inaccuracies in NSI and negatively affected the performance of all algorithms.

关键词： routing algorithms Minimum interference routing SDN Software Defined Networking Traffic Engineering

来源：评论

学校读者我要写书评

暂无评论

Resource-aware routing algorithms for multi-hop cellular networks

Resource-aware routing algorithms for multi-hop cellular net...

引用

International Conference on Multimedia and Ubiquitous Engineering

作者： Park, Yongsuk Jung, Eun-Sun Networking Technology Laboratory Samsung Advanced Institute of Technology South Korea

ISBN: (纸本)9780769527772

The cellular network systems are expected to evolve into Multi-hop Cellular Network (MCN). While a mobile terminal and the base station have a direct connection in a conventional cellular network, in MCN a mobile terminal may reach the base station via relays by using multi-hopping. The relay can be either mobile terminal referred to client relay or dedicated relay referred to infra relay that has capabilities like those of the base station. In this paper, we focus on routing mechanism in multi-hop cellular networks. In particular, we study routing performance metrics for multi-hop cellular networks which consider energy efficiency and the relay capabilities.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving IoT Communications Based on Smart routing algorithms

Improving IoT Communications Based on Smart Routing Algorith...

引用

IEEE Global Conference on Communications (GLOBECOM) / Workshop on Wireless Networking and Control for UAV

作者： Hamrioui, S. Hamrioui, C. A. M. De la Torre-Diez, I. Lorenz, P. LIoret, J. Univ Nantes Polytech Sch IETR UMR 6164 Nantes France Tizi Ouzou Univ Tizi Ouzou Algeria Univ Valladolid Dept Signal Theory Commun & Telemat Engn Valladolid Spain Univ Haute Alsace Mulhouse France Univ Politecn Valencia Valencia Spain

ISBN: (纸本)9781538647271

Due to the recorded success by Internet of Things (IoT) technology, more and more domains use it as a communications and exchange network such as e-health, smart cities, vehicles, etc. IoT do not stop integrating an important number of components and objects that are characterized by their complexity and heterogeneity. Such constraints make the existing routings protocols unsuitable for IoT communications. To accomplish all the expected tasks and satisfy the user services, it is important to guarantee a quality of communication that answers to the requirements of the various applications in terms of data and processing (availability, integrity, efficiency, etc.). The objective of our work in this paper is to propose a smart and efficient routing algorithm to improve the IoT communications performance. The proposed method is called SERA (Smart and Efficient routing Algorithm) which is based on self-organization of the communications between devices according to their new parameters. The evaluation of SERA has shown that SERA improves considerably the IoT communications performance in terms of some QoS and energy efficiency parameters.

关键词： IoT routing algorithms efficient communications QoS energy efficiency smart method route selection self-organizing

来源：评论

学校读者我要写书评

暂无评论

On Ant routing algorithms in Ad-hoc Networks

On Ant Routing Algorithms in Ad-hoc Networks

引用

IEEE Global Telecommunications Conference (GLOBECOM 06)

作者： Rosati, Laura Berioli, Matteo Reali, Gianluca German Aerosp Ctr DLR Inst Commun & Nav POB 1116 Oberpfaffenhofen Germany Univ Perugia Dept Elect & Informat Engn I-06125 Perugia Italy

ISBN: (纸本)9781424403561

This paper shows a novel approach for routing datagrams in ad-hoc networks, called Distributed Ant routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating food and storing food. The algorithm aims at minimizing complexity in the nodes and this is achieved at the expenses of the optimality of the derived solution. The work also describes an analytical approach to the problem: The validity of the heuristic approach, ant routing, is supported by mathematical proofs and the same methods helps in the selection of the algorithm parameters. Simulation results are presented at the end to confirm the mathematical calculations.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Impact of Selfishness on Probabilistic routing algorithms in Delay Tolerant Networks

Analyzing the Impact of Selfishness on Probabilistic Routing...

引用

International Conference on Computing and Network Communications (CoCoNet)

作者： Sobin, C. C. IIT Roorkee Dept Comp Sci & Engn Uttarakhand 247667 India

ISBN: (纸本)9781467373098

Delay Tolerant Networks (DTNs) are sparse networks, in which communication is possible without end-to-end connectivity. A node in DTN is considered as selfish when that node is not willing to forward the packet further in the network, and drops the packet from the network. Probabilistic algorithms such as Prophet, MaxProp, etc, does not consider the selfishness of the nodes and always choose the relay node with the highest delivery probability to the destination. In real time, there can be a scenario present in which few nodes in a network acts selfishly. In this paper, we assess the effects of the presence of few selfish nodes in the network on the performance of probabilistic routing algorithms with the help of ONE Simulator, and also proposes a method to increase the performance of the probabilistic algorithms in the presence of the same.

关键词： Selfishness routing algorithms Packet Trunk Node Network Ganglia DTNA gene

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共229页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：