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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

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

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

共 1260 条记录，以下是211-220 订阅

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

详细简洁

排序：

Ant Based routing algorithm For Videostreaming

Ant Based Routing Algorithm For Videostreaming

引用

International Conference on Communication and Electronics Systems (ICCES)

作者： Shobanbabu, P. Reddy, P. Chenna JNTUA Coll Engn Comp Sci & Engn Kadapa Andhra Pradesh India JNT Univ Comp Sci & Engn Anantapur Andhra Pradesh India

ISBN: (纸本)9781509010660

an ad hoc wireless network (AHWN) is a wireless network without any central node to communicate. The network is ad hoc because it doesn't have any fixed infrastructure and the node positions change randomly. In wired networks, routers and each node percolate to send the packets. The theme of a routing protocol in ad hoc networks is finding different paths to different nodes. The design of routing algorithm for such networks is difficult. Ant colony optimization (ACO) is a metaheuristic inspired from ants foraging behavior. In ACO algorithms, ants are agents or packets which move in the network for searching the path from sender to destination. Ants place pheromone on each traversed link. A path is constructed quickly which the majority of the ants (packets) follow. The path is based on pheromone concentration. Ant based routing algorithm (ARA) and AntHocNet algorithm depend on ACO. It is a combinational algorithm which includes a reactive route finding setup process with a proactive route maintaining process. Its aim is to keep information about existing routes and finding new routes. Video streaming is a collection of images displayed one after another with a set of frequency to give visibility of motion of frames. Video streaming in ad hoc networks is a challenging problem. In this paper performance of video streaming transmission using AntHocNet is evaluated using ns-2 simulator. This evaluation is compared with video streaming in wired networks using the AntNet routing algorithm. Video streaming support from Evalvid is used.

关键词： ANT routing algorithm Video Streaming AntHocNet AntNet

来源：评论

学校读者我要写书评

暂无评论

A New routing algorithm for Irregular Mesh NoCs

A New Routing Algorithm for Irregular Mesh NoCs

引用

International SoC Design Conference 2008

作者： Bokharaei, V. Samadi Shamaei, A. Sarbaziazad, H. Abbaspour, M. Shahid Beheshti Univ Dept Elect & Comp Engn Tehran Iran IPM Sch Comp Sci Tehran Iran Sharif Univ Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9781424425983

Network-on-Chips (NoCs) usually use regular mesh-based topologies. Regular mesh topologies are not always efficient because of power and area constraints which should be considered in designing system-on-chips. To overcome this problem, irregular mesh NoCs are used for which the design of routing algorithms is an important issue. This paper presents a novel routing algorithm for irregular mesh-based NoCs called "i-route". In contrast to other routing algorithms, this algorithm can be implemented on any arbitrary irregular mesh NoC without any change in the place of IPs. In this algorithm, messages are routed using only 2 classes of virtual channels. Simulation results show that using only 2 virtual channels, "i-route" exhibits a better performance compared to other algorithms already proposed in the same context.

关键词： NoCs Mesh Irregular mesh routing algorithm Virtual channels Performance

来源：评论

学校读者我要写书评

暂无评论

ARMPP: An Ant-based routing algorithm with Multi-phase Pheromone and Power-saving in Mobile Ad Hoc Networks 3

ARMPP: An Ant-based Routing Algorithm with Multi-phase Phero...

引用

3rd International Symposium on Computing and Networking (CANDAR)

作者： Miyashita, Shohei Li, Yamin Hosei Univ Grad Sch CIS Tokyo 1848584 Japan Hosei Univ Fac Comp & Informat Sci Tokyo 1848584 Japan

ISBN: (纸本)9781467397971

This paper proposes an ant-based routing algorithm with multi-phase pheromone and power-saving (ARMPP) for enhancing the adaptability and stability of mobile ad hoc networks (MANETs). The routing algorithm is based on the ant colony optimization framework that is a kind of swarm intelligence and inspired from the ant's life. MANETs are dynamic, self-configured, self-built, and infrastructure-less networks. In MANETs, a link disruption resulting from the dynamic topology deteriorates the performance of network, and the increment of energy consumption brings reduction of the network lifetime because almost all nodes operate on a battery. The goal of this paper is to enhance the adaptability and stability in reacting to the mobility of nodes, that is, to variate the network topology timely and to maximize the lifetime of the network. We propose a two-stage construction method of pheromone and a new pheromone update method. In simulation experiments, we compare ARMPP with reference algorithms of ad hoc on-demand distance vector (AODV) and destination-sequenced distance vector routing (DSDV). The simulation results show that our algorithm can achieve better performance than those algorithms in the measures of the adaptability and stability.

关键词： mobile ad hoc networks routing algorithm power-saving ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

TBRA: A Scalable routing algorithm in Highly Mobile Large Scale Pure Ad Hoc Wireless Mesh Networks

TBRA: A Scalable Routing Algorithm in Highly Mobile Large Sc...

引用

2nd IEEE International Conference on Computer Science and Information Technology

作者： Ren, Wei Ren, Yi Zhang, Hui China Univ Geosci Sch Comp Sci Wuhan 430074 Peoples R China Univ Agder Info & Comm Tech Dept Kristiansand Norway Politecn Torino Dept Elect Turin Italy

ISBN: (纸本)9781424445189

In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based routing algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis and simulation results verify that routing setup delay of TBRA grows only linear to hop counts (scalable to node's speed) and communication overhead increases only linear to the number of nodes.

关键词： routing algorithm Scalable routing Wireless Mesh Network Mobile Ad-hoc Networks Mesh Networks

来源：评论

学校读者我要写书评

暂无评论

Research of Dynamic routing algorithm Based on Mobile Agent

引用

3rd International Conference on Teaching and Computational Science (WTCS 2009)

作者： Lan, Li Harbin Univ Commerce Coll Comp & Informat Engn Harbin Peoples R China

ISBN: (纸本)9783642254369

routing is briefly explained in this paper, as well as the mechanism and the shortcomings of current dynamic routing are analyzed. After briefly introducing the advantages of mobile agent, the paper focuses on applying the new Mobile Agent technology to routing algorithm and proposes an innovative dynamic routing algorithm based on MA.

关键词： Dynamic routing Mobile agent routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Adjustment A* routing algorithm

Dynamic Adjustment A* Routing Algorithm

引用

International Conference on Innovative Computing and Communication/Asia-Pacific Conference on Information Technology and Ocean Engineering

作者： Dai, Zhiquan Guan, Yong Guan, Ran Capital Normal Univ Coll Informat Engn Beijing Peoples R China

ISBN: (纸本)9780769539423

routing algorithm mainly focuses on routing method to ensure the connection between the sender and the receiver during each session is optimal and effective. It is very useful in packet transmission, especially in meeting the quality of service. Some traditional shortest path search algorithm (Width preferred search algorithm, Dijkstra algorithm) can solve the shortest path problem well within polynomial time when the wireless and cable network have infrastructure. But in the real-time communication environment, high dynamic topology of network structure and the QoS under network structure, we usually need to find out a group of the shortest or the second shortest path as the basis of scheme evaluation and selection. Usually, the heuristic search algorithm can solve the problem well, the heuristic function of the heuristic search algorithm equals sum of the actual passed path cost and the estimated cost of current node to target node. According to the feature of heuristic function, this paper dynamically adjusts the proportion in the searching process, and uses it in the search of the shortest path of network node. The result of this experiment shows that the efficiency of the improved algorithm is about 12.5% higher than that of the original algorithm.

关键词： optimal path heuristic function A Star algorithm Dynamic regulation routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel routing algorithm for mobile pervasive computing

A novel routing algorithm for mobile pervasive computing

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Fantacci, Romano Tarchi, Daniele Tassi, Andrea Univ Florence Dept Elect & Telecommun Florence Italy

ISBN: (纸本)9781424456383

The interest towards real-time computing has lead an even more interest in grid computing. While in the past the implementation of grid computing has been done on high performance computers, in the recent years there is an increasing interest in the pervasive grid scenarios, where multiple devices can be used for a distributed computing. The most challenging idea is to use mobile devices connected among them with wireless connections for setting up pervasive grid environments. In this context, it is a crucial problem the optimization of the routing algorithms among the processing nodes, in order to satisfy the performance requirements of a distributed computing. Aim of this paper is the design of specific routing algorithms for different pervasive grid applications with a particular attention to time sensitive scenarios.

关键词： distributed computing grid computing grid computing high performance computer mobile computing mobile pervasive computing real-time computing routing algorithm telecommunication network routing

来源：评论

学校读者我要写书评

暂无评论

A reliable probabilistic grid routing algorithm in MANETs

A reliable probabilistic grid routing algorithm in MANETs

引用

2nd International Conference on Pervasice Computing and Applications

作者： Wu, Zhengyu Song, Hantao Xu, Xiaomei Jiang, Shaofeng Beijing Forestry Univ Sch Informat Beijing 100083 Peoples R China Beijing Inst Technol Sch Comp Sci & Technol Beijing 100081 Peoples R China

ISBN: (纸本)9781424409709

Mobile ad hoc networks (MANETs) with limited resources and highly dynamic nature make routing unstable and challenging. The major challenge for MANETs is therefore to establish reliable routes. In this paper, we propose a new routing algorithm called Reliable Probabilistic Grid routing algorithm (RPGRA). RPGRA is a location based routing algorithm and it exploits the concept of a routing protocol called GRID. The main difference between these two protocols is that RPGRA defines a new parameter called grid head stability to select stable grid head and utilizes probability to forward, but the GRID does not. RPGRA is a probabilistic forwarding algorithm that neighbors are selected as the next hop according to probability. Our work is based on selective forwarding and the selective forwarding probability based on the node degree and link availability is presented to increase the reliability of selective forwarding. The proposed simulation results demonstrate that the proposed scheme obtains better performance in packet delivery ratio, end-to-end delay and routing load than GRID and AODV.

关键词： wireless networks ad hoc networks probabilistic grid routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient routing algorithm Based on Social Awareness in DTNs

An Efficient Routing Algorithm Based on Social Awareness in ...

引用

77th IEEE Vehicular Technology Conference (VTC)

作者： Wang, Kun Guo, Huang Wu, Meng Yang, Zhen Liu, Yan Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Comm & Sensor Netw Tec Nanjing 210003 Jiangsu Peoples R China Nanjing Univ Technol Coll Automat & Elect Engn Nanjing 210009 Peoples R China

ISBN: (纸本)9781467363372

This paper presents an improved routing algorithm based on the social link awareness. In this algorithm, multiple social features of the nodes' behaviors are utilized to quantify the nodes pairs' social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and the overhead, and increases the successful delivery ratio, thereby improving the routing efficiency.

关键词： DTNs(Delay Tolerant Networks) social awareness routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved QoS routing algorithm in Internet

An Improved QoS Routing Algorithm in Internet

引用

3rd International Conference on Computer-Aided Design, Manufacturing, Modeling and Simulation(CDMMS 2013)

作者： Huang Hongbo Wang Yongzhi Yueyang Vocat Tech Coll Inst Informat Engn Yueyang Hunan Peoples R China Inst Informat Engn Yueyang Vocat Tech Coll Yueyang Yueyang Hunan Peoples R China

ISBN: (纸本)9783037859100

An Efficient routing algorithm for Improving the QoS in Internet has been proposed and presented in this paper. The algorithm is a kind of Multi Constrained Path algorithm. The routing take place based on more than one link weight components. To avoid the NP complete problem and to increase the computational efficiency some advancement are added. These include the definition of Non Linear Path Length, where the sub paths may not be the shortest path, having 'k' no of shortest paths in a node instead of having only the shortest path, then removing the path dominancy for state space reduction. As a last the concept look ahead is also included through which a predicted path to destination is mapped. This work only implements the removal of path dominancy where the queue is updated by removing the dominated paths from the queue. The simulation is also showing the better performance of the system.

关键词： Qos routing algorithm Internet

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：