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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,216 篇 工学
- 1,738 篇 计算机科学与技术...
- 1,178 篇 软件工程
- 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,309 篇 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,161 篇 英文
79 篇 其他
66 篇 中文
2 篇 西班牙文
2 篇 朝鲜文
1 篇 土耳其文

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

共 2309 条记录，以下是1001-1010 订阅

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

详细简洁

排序：

An Overlapping Clustering Approach for routing in Wireless Sensor Networks

An Overlapping Clustering Approach for Routing in Wireless S...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Ma, Can Wang, Lei Xu, Jiaqi Qin, Zhenquan Shu, Lei Wu, Di Dalian Univ Technol Dalian Peoples R China

ISBN: (纸本)9781467359399;9781467359382

The design and analysis of routing algorithm is an important issue in Wireless Sensor Networks (WSNs). Most traditional geographical routing algorithms cannot achieve good performance in duty-cycled networks. In this paper, we propose a k-connected overlapping clustering approach with energy awareness, namely k-OCHE, for routing in WSNs. The basic idea of this approach is to select a cluster head by energy availability (EA) status. The k-OCHE scheme adopts a sleep scheduling strategy of CKN, where neighbors will remain awake to keep it k-connected, so that it can balance energy distributions well. Compared with traditional routing algorithms, the proposed k-OCHE approach obtains a balanced load distribution and consequently a longer network lifetime.

关键词： Network routing Wireless sensor networks routing algorithms cluster head Potassium awake Load balancing scheduling policy energy balance

来源：评论

学校读者我要写书评

暂无评论

Prediction-based routing with Packet Scheduling under Temporal Constraint in Delay Tolerant Networks

Prediction-based Routing with Packet Scheduling under Tempor...

引用

32nd IEEE International Performance, Computing, and Communications Conference (IPCCC)

作者： Liu, Guoliang Krishnamani, Janani Sunderraman, Rajshekhar Li, Yingshu Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9781479932146;9781479932139

routing in D isruption Tolerant Networks (DTNs) is a challenging problem due to the intermittent connectivity between the nodes. Researchers have proposed many routing protocols that adapt to the temporary connections of DTNs. One classification of routing protocols makes use of historical information to predict future contact patterns for any pair of nodes. However, most existing protocols focus on the probability of a path from the source to the destination without considering the information in a packet which includes the source, destination, size, TTL (Time-To-Live) and limited resources such as available buffer size and bandwidth. In this paper, we propose a new prediction-based routing algorithm that takes into account packet information under the conditions of limited transmission opportunities. T he goal of this protocol is to increase the overall delivery ratio through scheduling packets at each node. Meanwhile, this protocol may sacrifice some messages' delivery delay time to some extent. Extensive simulation results with real traces show that our protocol with packet scheduling has better performance than the pure probabilistic routing algorithms in term of delivery ratio. Our protocol's performance advantage is more obvious for nodes with higher packet intensity and shorter TTL in packets.

关键词： Packet protocols routing protocols packet schedule Network routing disruption-tolerant network destination Ganglia TTL gene Transistor transistor logic circuits routing algorithms Probability

来源：评论

学校读者我要写书评

暂无评论

routing USING PHYSICAL LAYER NETWORK CODING

ROUTING USING PHYSICAL LAYER NETWORK CODING

引用

21st Signal Processing and Communications Applications Conference (SIU)

作者： Girici, Tolga TOBB Ekonomi & Teknol Univ Elekt & Elekt Muhendisligi Bolumu Ankara Turkey

ISBN: (纸本)9781467355636;9781467355629

In this work we focused on routing using physical layer network coding. Contrary to regular network coding, in physical layer network coding modulated analog waveforms are added at the receivers. Although synchronization is needed for this purpose, adding waveforms helps save energy. In the previous literature some geographical routing algorithms are modified with physical layer network coding, using helper nodes. In this work we solve the optimal routing problem using the Bellman-Ford routing algorithm. For this purpose we defined a link cost metric. Numerical comparisons with the algorithms in the literature reveal that especially in the case of high path loss exponent the proposed algorithm significantly decreases the energy expenditure. Moreover, the proposed algorithm is able to work in cases, where the channel gain does not only depend on distance.

关键词： Network coding Physical layer Network routing hierarchical network waveforms routing Problem path loss routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Natural Gradient routing: Sink convergence using data as guide

Natural Gradient Routing: Sink convergence using data as gui...

引用

IEEE Latin-America Conference on Communications (LATINCOM)

作者： Buchhorsts, Claudia Dujovne, Diego Univ Diego Portales Escuela Informat & Telecomunicac Santiago Chile

ISBN: (纸本)9781479911486

During the last decade, WSN routing algorithms diversity has evolved and clustered onto several categories. Although most of them still rely on the use of individual node addresses as an input for the routing algorithm, there is a renewed interest in the use of addressless routing, specially from the proposed IETF (RFC6550) standard of the RPL algorithm, which defines an incremental rank value on each node to establish the route towards the Sink. In this paper, we propose a new routing algorithm called Natural Gradient routing (NGR), which uses sensed values in a gradient field as a rank, and a single forwarding rule to approach the Sink. With extensive simulation work we compare our proposal against two reference routing algorithms: Flooding, which represents the absence of predefined routes and AODV, a deterministic reactive shortest-path approach. We show that first, our proposal has a similar consumption, delay and overhead performance than AODV with minimal complexity, and second, the NGR configuration period is reduced to zero, thus decreasing the baseline consumption until the first packet is sent.

关键词： routing algorithms Sinks Network routing Line of nodes

来源：评论

学校读者我要写书评

暂无评论

Active Cross Layer QoS routing Algorithm Based on ACO in Mobile Internet

Active Cross Layer QoS Routing Algorithm Based on ACO in Mob...

引用

International Conference on Information Science and Technology (ICIST)

作者： Cao, Huaihu Zhang, Yanmei Zhu, Jianming Cent Univ Finance & Econ Sch Informat Beijing 100081 Peoples R China

ISBN: (纸本)9781467351379

In the mobile Internet environment, due to the node's signal uncertainty, limited energy and mobility, the original passive Internet routing algorithm is no longer applicable. In order to solve this problem, this paper presents an Active Cross Layer QoS routing Algorithm Based on ACO, which combines mobile agent and ant colony optimization technology. This algorithm can find the link layer, network layer and application layer information actively to achieve optimization QoS routing in a large scale mobile Internet. Finally, two simulating experiments are finished, the simulating results show that this algorithm has better performance than the traditional routing algorithm in cost and response speed.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Algorithm for Multicast routing in Sparse-Splitting Optical WDM Networks

A Heuristic Algorithm for Multicast Routing in Sparse-Splitt...

引用

17th International Conference on Optical Networking Design and Modeling (ONDM)

作者： Constantinou, Costas K. Ellinas, Georgios Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus

ISBN: (纸本)9781479904914

Multicast routing in optical WDM networks is investigated in the current paper in the presence of optical splitters only at a fraction of the network nodes. This work presents a novel multicast routing algorithm for sparse-splitting networks that is specifically designed for this category of networks. The proposed algorithm is compared with the most efficient multicast routing algorithms for sparse networks that are found in the literature through examples and simulations. Performance results show that the proposed approach achieves an important reduction on the average cost of the calculated multicasting trees, compared to the existing heuristics.

关键词： wavelength division multiplexing network Multicast Heuristic algorithms routing algorithms Network routing optical beam splitters

来源：评论

学校读者我要写书评

暂无评论

HIERARCHICAL NETWORKS: routing AND CLUSTERING (A CONCISE SURVEY)

HIERARCHICAL NETWORKS: ROUTING AND CLUSTERING (A CONCISE SUR...

引用

26th IEEE Annual Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： Kiwan, H. Morgan, Y. L. Univ Regina & Appl Sci Fac Engn Regina SK Canada

ISBN: (纸本)9781479900336;9781479900312

The network topologies enhancements are necessary in correspond to the growing of data networks. In this paper, large network problem is described. It includes the routing update cost. The concept of hierarchical network is explained as a considered solution. The hierarchical routing algorithms working methodology and protocols are presented and compared. In addition, it provides a sufficient description for the pros and cons of each protocol. The hierarchical network problems of cluster number, size distribution and number of levels, and solving approaches are discussed. This paper discusses how to identify the best clustering algorithm for wired, ad-hoc and wireless sensor networks. The optimization guidelines are explained.

关键词： Hierarchical networks routing algorithms clustering topology optimization

来源：评论

学校读者我要写书评

暂无评论

DTN routing Protocols on Resource Constrained Devices: Design, Implementation and First Experiments

DTN Routing Protocols on Resource Constrained Devices: Desig...

引用

21st International Conference on Software, Telecommunications and Computer Networks (SoftCOM)

作者： Massri, Khalil Vitaletti, Andrea Univ Roma La Sapienza Dipartimento Ingn Informat Automat & Gest Piazzale Aldo Moro 5 I-00185 Rome Italy

ISBN: (纸本)9789532900439

In this paper, we present our experience in designing a reference architecture for implementing Delay Tolerant Networking protocols running on resource constrained devices. The proposed architecture, has been employed to implement the Epidemic protocol on the Openbeacon active tags, and it has been validated on a simple experiment for data collection, in which 20 students carrying the tags are asked to freely move in a room while generating data that are collected by two sinks. Our experiments show that some of the simplistic assumptions made in the simulation of DTN protocols, such as the perfect knowledge of the neighborhood, are not valid in real test-bed and can significantly affect the performance of the routing algorithms.

关键词： DTNA gene routing protocols routing algorithms TAGGING Data Collection Methods Empirical design Network protocols

来源：评论

学校读者我要写书评

暂无评论

A New routing Method based on Hybrid Algorithm

A New Routing Method based on Hybrid Algorithm

引用

3rd International Conference on Applied Mechanics, Materials and Manufacturing (ICAMMM 2013)

作者： Chen, Jianhui Tang, Yulan Wu Xi Inst Technol Coll Elect & Informat Technol Wuxi 214121 Jiangsu Peoples R China Wuxi City Coll Dept Elect & Informat Engn Wuxi 214151 Jiangsu Peoples R China

ISBN: (纸本)9783037858882

A new routing algorithm is proposed for FPGA to improve the increasing transformation cost of pseudo-Boolean Satisfiability algorithm in the routing process. The approach combines advantages of pseudo-Boolean Satisfiability and geometric routing algorithm. First, Frontier- one of geometric routing algorithm is chosen for FPGA routing. Then pseudo-Boolean Satisfiability algorithm is used when the process of Frontier is not successful. Technique of static symmetry-breaking is also adding to carry out pretreatment of pseudo-Boolean constraints, detecting and breaking the symmetries in the routing flow. The advantage is that the search path is pruned, and the cost is consequently reduced. Preliminary experiments results show that the hybrid method have no adverse affect on overall program. It has also reduced the runtime observably, and sped up the solving process.

关键词： Benchmarking Boolean function Field programmable gate arrays routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Optimization-Based Robust routing Algorithm for IP Energy-Efficient Networks

An Optimization-Based Robust Routing Algorithm for IP Energy...

引用

18th IEEE Symposium on Computers and Communications (ISCC)

作者： Jiang, Dingde Zhao, Wenhui Xu, Zhengzheng Liu, Jindi Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110819 Peoples R China

ISBN: (纸本)9781479937554

This paper studies the routing problem for IP energy-efficient networks. We propose a robust routing algorithm to reach the higher network energy efficiency, which is based on optimization problem. To attain the highly energy-efficient routing for IP networks, the link of low utilization is turned into the sleeping state to save the network energy. At the same time, the low link traffic is aggregated to the link with high utilization to enhance the link utilization and to sleep the links as many as possible. We present an optimized link sleeping method to maximize the number of the sleeping links. By targeting the network robustness, a weight adaptive strategy is brought forth to reduce the link congestion and enhance the robustness of the network. Simulation results indicate that our algorithm is effective and feasible for IP energy-efficient networks.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共231页 << < 97 98 99 100 101 102 103 104 105 106 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：