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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,586 篇 会议
718 篇 期刊文献
3 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

2,215 篇 工学
- 1,737 篇 计算机科学与技术...
- 1,176 篇 软件工程
- 870 篇 信息与通信工程
- 612 篇 电气工程
- 196 篇 动力工程及工程热...
- 168 篇 电子科学与技术（可...
- 126 篇 控制科学与工程
- 103 篇 光学工程
- 73 篇 机械工程
- 53 篇 仪器科学与技术
- 50 篇 交通运输工程
- 40 篇 化学工程与技术
- 37 篇 航空宇航科学与技...
- 20 篇 土木工程
- 19 篇 建筑学
- 18 篇 生物工程
- 17 篇 材料科学与工程（可...
- 16 篇 农业工程
757 篇 理学
- 461 篇 数学
- 229 篇 物理学
- 46 篇 统计学（可授理学、...
- 45 篇 系统科学
- 40 篇 化学
- 29 篇 生物学
307 篇 管理学
- 169 篇 管理科学与工程(可...
- 153 篇 图书情报与档案管...
- 64 篇 工商管理
32 篇 经济学
- 32 篇 应用经济学
18 篇 医学
- 15 篇 临床医学
17 篇 农学
- 17 篇 作物学
11 篇 法学
6 篇 文学
5 篇 教育学
5 篇 军事学
2 篇 艺术学

主题

2,308 篇 routing algorith...
145 篇 optical networks
97 篇 network topology
94 篇 network routing
77 篇 wireless sensor ...
59 篇 algorithms
44 篇 wavelength assig...
37 篇 network-on-chip
37 篇 interconnection ...
36 篇 routing
34 篇 energy consumpti...
33 篇 wavelength divis...
30 篇 multicast
30 篇 fiber optics and...
29 篇 networks (060.42...
29 篇 quality of servi...
28 篇 ganglia
26 篇 optical signals
26 篇 packet switching
25 篇 networking hardw...

机构

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,160 篇 英文
79 篇 其他
66 篇 中文
2 篇 西班牙文
2 篇 朝鲜文
1 篇 土耳其文

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

共 2308 条记录，以下是821-830 订阅

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

详细简洁

排序：

Performance analysis of new algorithms for routing in mobile ad-hoc networks : the development and performance evaluation of some new routing algorithms for mobile ad-hoc networks based on the concepts of angle direction and node density

Performance analysis of new algorithms for routing in mobile...

引用

作者： Elazhari, Mohamed S University of Bradford

学位级别：doctor

Mobile Ad hoc Networks (MANETs) are of great interest to researchers and have become very popular in the last few years. One of the great challenges is to provide a routing protocol that is capable of offering the shortest and most reliable path in a MANET in which users are moving continuously and have no base station to be used as a reference for their position. This thesis proposes some new routing protocols based on the angles (directions) of the adjacent mobile nodes and also the node density. In choosing the next node in forming a route, the neighbour node with the closest heading angle to that of the node of interest is selected, so the connection between the source and the destination consists of a series of nodes that are moving in approximately the same direction. The rationale behind this concept is to maintain the connection between the nodes as long as possible. This is in contrast to the well known hop count method, which does not consider the connection lifetime. We propose three enhancements and modifications of the Ad-hoc on demand distance vector (AODV) protocol that can find a suitable path between source and destination using combinations and prioritization of angle direction and hop count. Firstly, we consider that if there are multiple routing paths available, the path with the minimum hop count is selected and when the hop counts are the same the path with the best angle direction is selected. Secondly, if multiple routing paths are available the paths with the best angle direction are chosen but if the angles are the same (fall within the same specified segment), the path with minimum hop count is chosen. Thirdly, if there is more than one path available, we calculate the average of all the heading angles in every path and find the best one (lowest average) from the source to the destination. In MANETs, flooding is a popular message broadcasting technique so we also propose a new scheme for MANETS where the value of the rebroadcast packets fo

关键词： 004 Mobile Ad hoc Networks (MANETs) Performance analysis routing algorithms Angle direction Node density

来源：评论

学校读者我要写书评

暂无评论

A low-complexity probabilistic routing algorithm for polar orbits satellite constellation networks

A low-complexity probabilistic routing algorithm for polar o...

引用

IEEE/CIC International Conference on Communications in China

作者： Xinmeng Liu Zhuqing Jiang Chonghua Liu Shanbao He Chao Li Yuying Yang Aidong Men Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781509002443

Satellite communication networks have advantages of global coverage and inherent broadcast capability, and offer a solution for providing broadband access to end-users. The regular mesh topologies, typical for satellite networks, comprise of Inter-Satellite Links(ISLs). But due to dynamic changing of traffic load and inter-plane ISL distance variation, adaptive routing is an absolute requirement for optimizing the network utilization. In this paper, we present a low-complexity probabilistic routing(LCPR) algorithm for polar orbits satellite constellation networks. The traditional algorithms choose the path with minimum hops according to the routing tables stored in the on-board equipment. Different from them, we make all the satellite to choose the next hop with minimum propagation delay according to the longitude and latitude of the current node and destination. Without routing table stored in the satellites, the algorithm reduces the space complexity effectively. The whole algorithm has no iteration process, thus decreasing the time complexity to some degree. Additionally, in the proposed algorithm, each satellite can inform the neighbouring satellites of the queue utilization condition periodically so that packet may be sent to a respectively free node adaptively according to the probability. Results from simulations show that LCPR has better performance than other routing algorithms in term of throughput and packet loss rate, which is especially suited large-scale users condition.

关键词： LEO satellite networks adaptive distributed routing SATELLITE NETWORKS Self tuning Polar orbits routing algorithms satellite constellations route list satellites Iterative Process satellite communication networks VEHICLE EQUIPMENT complexity classes global coverage Propagation delay space complexities Transportation load

来源：评论

学校读者我要写书评

暂无评论

RPA-RA: A Resource Preference Aware routing Algorithm in Software Defined Network

RPA-RA: A Resource Preference Aware Routing Algorithm in Sof...

引用

IEEE Global Communications Conference

作者： Defang Lee Peilin Hong Jianfei Li The Information Network Lab of EEIS Department USTC Huawei Technologyies Co. Ltd. Beijing

ISBN: (纸本)9781479959532

In Software Defined Network (SDN), every switch contains multiple flow tables, each flow table containing multiple flow entries. The number of flow entries determines the number of flows that can be forwarded by the switch. Link resources (like bandwidth) is no longer the only one to be considered when routing because node resources (like flow table) may also cause network bottlenecks. Moreover, from a view of network traffic, different flows have different preference to these network resources. In this paper, we use Analytic Hierarchy Process to analysis the characteristics of network traffic, then based on K-shortest path algorithm, a novel Resource Preference Aware routing Algorithm, simplified as RPA-RA, is proposed. RPA-RA selects the most proper path for a flow from k shortest paths by considering the resource preference of the flows. The aim is to balance the usage of link bandwidth and the flow table simultaneously when routing, so that the network can accept and process more flows. At last, our algorithm is validated with POX and Mininet. The simulation results show that RPA-RA can balance the usage of the flow table and bandwidth, result in fewer resource bottlenecks, and make the network accept more flows relatively.

关键词： Resource Preference Aware routing SDN Analytic Hierarchy Process K shortest paths flow tables Analytic hierarchy process routing algorithms traffic network shortest path computer software Preferences preference Web resources Bandwidth Network

来源：评论

学校读者我要写书评

暂无评论

An attack impairment-aware multicast routing algorithm based on hyper-domain graph model in multi-domain optical network

An attack impairment-aware multicast routing algorithm based...

引用

Third International Conference on Cyberspace Technology (CCT 2015)

作者： Lingzhi Jiang Department of Information Engineering Engineering University of CAPF Xi 'an 710086 China

In order to solve the problem of multicast attack impairment-aware routing in multi-domain optical network, an attack impairment-aware routing algorithm (HGFM) based on hyper -domain graph model is presented. In the proposed algorithm, the state vector and quantum rotation gate of quantum evolutionary is introduced into the polymorphic ant colony algorithm. The simulation experiments and analysis show that the proposed algorithm has better blocking performance compared with other algorithms without considering the attack impairments.

关键词： Optical network impairment-aware multi-domain multicast routing Fiber optic networks Graphical models routing algorithms Multicast

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Optimization algorithm for Geographic Greedy Hole-Bypassing routing algorithms in WMSNs

A Heuristic Optimization algorithm for Geographic Greedy Hol...

引用

2010 3rd IEEE International Conference on Broadband Network and Multimedia Technology, IC-BNMT2010

作者： Tang, Ruichun Guo, Shuangle Ji, Hongying Gong, Cunqun College of Information Science and Engineering Ocean University of China Qingdao 266100 China College of Mathematics and Computer Science Hengshui University Hengshui 053000 China

ISBN: (纸本)9781424467709

The hole-bypassing problem in WMSNs( wireless multimedia sensor networks ) is considered. Based On heuristic thinking, a Heuristic Optimization algorithm for Geographic Greedy Hole-Bypassing routing algorithms (HOGGHB) is proposed. Firstly, the critical nodes are explored in the route provided by an existing greedy routing algorithm. Secondly, the optimization gain ratios of the optimizable subroutes between every two critical nodes are computed, and then the optimizable subroutes with the large optimization gain ratios are selected to be optimized. Simulation results demonstrate the validity of HOGGHB algorithm. © 2010 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A comparative study of an energy-balanced routing in various wireless sensor network models

A comparative study of an energy-balanced routing in various...

引用

International Conference on Control, Automation and Systems ( ICCAS)

作者： Xiao Hui Li Zhi Wen Shang Seung Ho Hong Bing Zhao Xiaobing Liang College of Information Science and Engineering Wuhan University of Science and Technology Wuhan China Department of Electronic Engineering Hanyang University Ansan Korea Metrology Department China Electric Power Research Institute (CEPRI) Beijing China

ISBN: (纸本)9781479999767

The battery-powered wireless sensor networks are limited by the energy capacity and communication ability. Designing a suitable routing algorithm to improve the energy efficiency and network lifetime is highly required. However, a lack of knowledge with regard to how to apply these routing algorithms is a barrier for users in taking advantage of this method. Here we compare and evaluate the performances of two routing algorithms: ADOVjr and EBR that we have developed for WSN in three network models constructed by complex network theory. Based on the simulation results on the network lifetime and energy consumption behaviors, we suggest appropriate application areas for these two algorithms. Our performance analysis will help the improvement of energy-balanced routing algorithms and guide their implementation on WSN.

关键词： Wireless sensor networks Energy-balanced routing AODVjr Complex networks Wireless sensor networks complex networks routing algorithms WSN gene energy capacity Ability to communicate EBR network model Energy efficiency Network theory

来源：评论

学校读者我要写书评

暂无评论

Location-based multicast routing algorithms for wireless sensor networks in presence of interferences

Location-based multicast routing algorithms for wireless sen...

引用

12th IEEE International Conference on Communication Systems 2010, ICCS 2010

作者： Cha, Jaeyoung Jeon, Jonghyeok Kim, Junseok Kwon, Younggoo Department of Electronic Engineering Konkuk University Seoul Korea Republic of Department of Electrical and Computer Engineering University of Arizona Tucson AZ 85721 United States

ISBN: (纸本)9781424470068

Location-based multicast routing (LMR) technique can increase the lifetime and the channel capacity of wireless sensor network (WSN) by reducing the number of duplicated data transmissions and control messages. Previous LMR algorithms can suffer performance deterioration in real deployments because they consider only location of nodes and can transmit packets across concrete walls or other interfering object. To tackle this problem, we propose an interference-aware location based mulciast routing algorithm for WSNs. In the proposed algorithm, each node adjusts the energy cost for each link adaptively considering the interference effect and uses it for multicast decision in order to minimize the interference impact. Experimental results show that the proposed algorithm improves the delivery and energy performance when the network is affected by interference. © 2010 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Query Gain routing Algorithm and Application in Wireless Sensor Networks

Research on Query Gain Routing Algorithm and Application in ...

引用

作者： Sainan XIAO School of Information Science & Engineering Hunan City University

It is necessary to reduce the consumption of network node energy and the network load for solving the query design for routing algorithm in wireless sensor network, thus this article presents query gain routing algorithms and load balancing mechanism. This algorithm selects routing node by querying the routing information of gain matrix according to the successful record of historical query. The load balancing mechanism queries the energy information, which records node in the routing process and transfers load to balance the energy consumption of each node in the query path. This algorithm is able to effectively aware routing load to reduce the network energy consumption and avoid the data collision. The experimental result shows that compared with other query routing strategy, the query gain routing can increase the success rate of query under the condition of reducing the node energy consumption, but the load balancing mechanism can reduce the energy consumption of query gain routing further and prolong the network life cycle more effectively.

关键词： routing algorithms Load Gain Energy

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony Optimization-based Trustful routing Algorithm for Wireless Sensor Networks

An Ant Colony Optimization-based Trustful Routing Algorithm ...

引用

International Conference on Computer Science and Network Technology

作者： Zhong Luo Liuzheng Lu Jianqun Xie Jinrong He School of Computer Hubei University of Education Wuhan China Department of Information Technology College of Arts & Sciences of Jianghan University Wuhan China College of information engineering Northwest A&F University Shaanxi China

ISBN: (纸本)9781467381741

To ensure the security of the data forwarding and requirement of QoS(Quality of Services) in wireless sensor networks, we propose an ant colony optimization-based trustful routing algorithm. The objective function includes the key factors, such as the time delay, the bandwidth and the energy consumption of the link from the source to the destination. Also, in order to optimize the path selection, to ensure that the data forwarding node safety, the trust value of neighbor nodes is introduced to the fitness function. Simulation results show that this proposed algorithm prolongs lifetime of whole network, and obtain fast, secure and energy-efficient routing in communication process.

关键词： wireless sensor networks trustful Ant Colony Optimization routing Wireless sensor networks Ant colony optimization data forwarding Network routing routing algorithms Ants energy consumption Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Statistical convergence analysis of routing algorithms

Statistical convergence analysis of routing algorithms

引用

9th International Conference on Networks, ICN 2010

作者： Bohdanowicz, Frank Jakobs, Marcel Steigner, Christoph University of Koblenz Germany

ISBN: (纸本)9780769539799

Whenever new and better routing algorithms are developed a comprehensive convergence analysis can show the real achievements of new algorithms. This paper presents a new approach for a convergence analysis together with a new distance vector routing algorithm, which is no longer affected by the wellknown Counting-to-Infinity (CTI) problem. The RMTI algorithm uses event-triggered updates instead of time-periodic updates in order to speed up convergence time and to reduce update traffic. Convergence properties of RMTI are compared with RIPv2 under the impeded condition of provoked CTI-situations caused by link failures in order to show the difference of RMTI to common RIPv2 algorithms. The major focus of this paper is the description of a test environment and the approaches used to measure the convergence time of the routing algorithms. Special effort is directed at minimizing measurement perturbations by separation of measurement and evaluation tasks into online data capturing and offline statistical analysis. The results show that this convergence measurement method is a universally valid method and that RMTI is a newly competitive intra domain routing algorithm which can-in contrast to others-execute filtering policies. © 2010 IEEE.

关键词： Convergence analysis Performance comparison RMTI routing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共231页 << < 79 80 81 82 83 84 85 86 87 88 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：