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

International Workshop on Information and Electronics Engineering (IWIEE) / International Conference on Information, Computing and Telecommunications (ICICT)

作者： Cao Huaihu Cent Univ Finance & Econ Sch Informat Beijing 100081 Peoples R China

ISBN: (纸本)9781627485852

The current Internet can only provide "best effort" transport service, so it is becoming a very urgent task how to provide QoS guarantees for growing video on demand, multimedia conferencing and other multimedia applications based on the existing network architecture. This paper proposes a QoS routing algorithm based on mobile agent and ant colony (QR2A). The QR2A algorithm combines various constraints and network load conditions with the ant colony algorithm in the pheromone, while not only meets the QoS requirements, and solve the problem of network load balancing effectively, and the algorithm is less cost. Meanwhile, the paper also gives formal description, correctness and convergence analysis of QR2A algorithm. Finally practical effect of the algorithm is verified through by the simulation experiment. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Harbin University of Science and Technology

关键词： QoS routing algorithm Ant Colony Optimization Agent

来源：评论

学校读者我要写书评

暂无评论

A Novel Quality of Service routing algorithm for Wireless Sensor Networks

A Novel Quality of Service Routing Algorithm for Wireless Se...

引用

7th International Conference on MEMS, NANO and Smart Systems (ICMENS 2011)

作者： Lin, Lin Yan, Shu Nian, Yi Jiangsu Univ Dept Comp Sci & Telecommun Engn Zhenjiang Peoples R China

ISBN: (纸本)9783037853122

A new routing algorithm, RABA, is proposed in this paper. It seeks the shortest path between cluster head and Base Station by Ant Colony Optimization (ACO). The cluster head far away from Base Station transmits message along the shortest path, therefore reducing the transmission path length and lowering the node energy consumption. The simulation compared with LEACH shows that this algorithm can reduce routing length effectively and prolong network lifetime, providing more high quality of service.

关键词： routing algorithm Quality of Service (QoS) Wireless Sensor Networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

Research on routing algorithm for Wireless Sensor Network Based on Energy Balance

Research on Routing Algorithm for Wireless Sensor Network Ba...

引用

International Conference on Industrial Control and Electronics Engineering (ICICEE)

作者： Wang Jianguo Wang Zhongsheng Shi Fei Song Guohua Xian Technol Univ Sch Comp Sci & Engn Xian Peoples R China WuXi Municipal Burea State Taxon Taxon Server Off WuXi Peoples R China

ISBN: (纸本)9780769547923

This paper further analyzes the energy consumption model of the LEACH protocol, and proposes a routing algorithm for wireless sensor networks based on energy balance. It uses a more reasonable clustering method;thereby it can further balance energy consumption of the network. In this algorithm the cluster head periodically compute the residual energy of all of members in each work cycle. It takes into full account the residual energy of nodes to determine the route. It chooses an appropriate route under the premise that transmission efficiency and network energy consumption are balanced. Simulation experiments results show that the routing algorithm based on energy balance proposed by this paper can balance the relationship of routing and energy consumption, and can prolong the network lifetime.

关键词： routing algorithm Wireless sensor network LEACH protocol Clustering Energy balance

来源：评论

学校读者我要写书评

暂无评论

Tight Bounds on the Ratio of Network Diameter to Average Internode Distance 9

Tight Bounds on the Ratio of Network Diameter to Average Int...

引用

9th IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)

作者： Parhami, Behrooz Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)9781538672662

The average internode distance for a network is fairly difficult to derive. There is often no closed-form formula for this parameter, leading to the need for simulation-based derivation methods. Network diameter, by contrast, is relatively easier to determine and, for many networks of common interest, we have closed-form formulas for it. The bounds established in this paper show that the two parameters are usually not totally independent and that, from a practical standpoint, network diameter can be used in lieu of average internode distance for the evaluation of message-routing algorithms and assessment or comparison of communication performance, particularly for symmetric networks that are prevalent in many parallel systems.

关键词： Communication Graph Interconnection network Parallel processing routing algorithm Symmetric network

来源：评论

学校读者我要写书评

暂无评论

COMPARISON OF routing algorithmS FOR STORAGE AND RETRIEVAL MECHANISM IN CYLINDRICAL AS/RS

引用

TRANSPORT 2016年第1期31卷 11-21页

作者： Janilionis, Vytautas V. Bazaras, Zilvinas Janilionis, Vytautas [a] Dept of Transport Engineering Kaunas University of Technology Kaunas Lithuania[b] Dept of Applied Mathematics Kaunas University of Technology Lithuania

The objective of this research is to propose new routing algorithms for the Storage and Retrieval Mechanism (SRM) in the Cylindrical Automated Storage and Retrieval System (C-AS/RS) and contribute to the system conceptualization by investigating the maximum achievable retrieval request rates for different routing algorithms and system parameters. For this purpose, flexible and detailed simulation model was developed and investigated for 2 SRM types, 3 routing algorithms and a feasible set of system movement and load transfer time parameters. Based on the simulation output, the regression models for different SRM types and routing algorithms were developed for predicting the maximum retrieval request rate. The differences of the average maximum retrieval request rate were evaluated for various system configurations and routing algorithms. The alternative to optimal routing algorithm was proposed, reducing the system performance only by 1.4?÷?2.4% on average, but requiring significantly less calculations when planning the SRM tour. In addition, the system analysis indicated that SRM vertical velocity and load transfer time have the highest impact on the system performance and for different SRM types the average maximum retrieval request rates differ by 22.2?÷?31.8%.

关键词： cylindrical automated storage and retrieval system routing algorithm branch and bound algorithm automated warehouse simulation regression analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Efficient History-Based routing algorithm for Interconnection Networks

An Efficient History-Based Routing Algorithm for Interconnec...

引用

International SoC Design Conference (ISOCC)

作者： Moosavi, Sanaz Rahimi Chang, Chia-Yuan Rahmani, Amir-Mohammad Plosila, Juha Man, Ka Lok Jeong, Taikyeong T. Lim, Eng Gee Univ Turku Dept Informat Technol Turku Finland Turku Ctr Comp Sci TUCS Turku Finland Xian Jiaotong Liverpool Univ Suzhou Peoples R China Myongji Univ Seoul South Korea Balt Inst Adv Technol Vilnius Lithuania

ISBN: (纸本)9781467329880;9781467329897

Network-on-chip (NoC) approach has been proposed as a solution to the complex on-chip communication problems by scaling down the concepts of macro- and tele-networks, and applying them to the system-on-chip domain. In this paper, an efficient routing algorithm for two-dimensional mesh network-on-chips is presented. The algorithm, which is based on Odd-Even turn model, is called History-Based Odd-Even (HB-OE). It is more fair and efficient in load balancing compared to the typical Odd-Even turn model algorithm. In this routing, based on the location of the current node, the network is divided into four sub-networks and the history of each sub-network regarding the direction of the last forwarded packet is saved using a flag register. We further enhance this routing by using a technique named Free-Channel to check the availability of the output ports as well as their history. To assess the latency of the proposed algorithm, transpose traffic profile for packet injection is used. The simulation results reveal that the HB-OE + Free-Channel routing policy can achieve lower latency compared to the conventional Odd-Even turn model with negligible area overhead.

关键词： Network-on-chip routing algorithm Odd-Even turn model Low latency routing

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks

引用

JOURNAL OF SUPERCOMPUTING 2017年第10期73卷 4560-4579页

作者： Habibian, Hossein Patooghy, Ahmad Inst Res Fundamental Sci IPM Sch Comp Sci Tehran Iran Iran Univ Sci & Technol Dept Comp Engn Tehran Iran

This paper presents a fault-tolerant routing methodology for both injured hypercube and cube-connected cycles interconnection topologies. The proposed routing methodology efficiently tolerates any pattern of faulty regions with any number of faulty nodes in the network which is based on the best-first search and backtracking strategy. Deadlock freedom of the proposed routing methodology is obtained by only one virtual channel per physical channel. In order to evaluate the proposed routing methodology, a 7-dimensional hypercube network is simulated in various conditions, i.e., different traffic rates, different number of faulty nodes and different message lengths. Simulation results confirm that the proposed routing methodology in comparison with the previous methods provides acceptable performance while it significantly increases the reliability of the network. It also guarantees delivery of messages between any pair of source and destination while the network is connected.

关键词： Interconnection network Fault tolerance routing algorithm Performance

来源：评论

学校读者我要写书评

暂无评论

QoS routing algorithm Based on Multi-parameter Constraints for Wireless Sensor Networks

引用

2nd International Conference on Advanced Engineering Materials and Technology (AEMT)

作者： Lin, Lin Nian, Yi Jiangsu Univ Dept Comp Sci & Telecommun Engn Zhenjiang Peoples R China

ISBN: (纸本)9783037854488

RBMC-a novel routing algorithm based on multi-parameter constraints for wireless sensor network was proposed. The algorithm found out the minimum cost path from source sensor to sink by ants with multi-parameter, and the source sensor could transmit information along the shortest path. Thus the transmission path length and the corresponding network delay could be efficiently reduced. We analyzed the performance of RBMC through compared with the existing other routing algorithms in simulation experiment. Results show that the proposed method can reduce energy cost and balance the energy load effectively.

关键词： Quality of Service (QoS) Wireless Sensor Networks (WSNs) routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Coordinate Based routing algorithm for Wireless Sensor Networks

Coordinate Based Routing Algorithm for Wireless Sensor Netwo...

引用

3rd IEEE and IFIP South Central Asian Himalayas Regional International Conference on Internet (AH-ICI)

作者： Karna, Anil Kumar Shanghai Jiao Tong Univ Dept Comp Sci & Engn Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China

ISBN: (纸本)9781467325912;9781467325899

Power management in wireless sensor networks has always been a concern for network engineers and hardware manufacturers. Wireless sensor nodes are supposed to operate for extended periods of time, perhaps years, without physical interaction from human beings. Replacing batteries is also not possible or is an inconvenience in most of these networks. Thus, in order to extend the life of entire wireless sensor network system, either higher capacity of batteries needs to be used on each node or the energy consumption of batteries itself needs to be reduced. Energy consumption, from a software point of view, may be reduced both logically and physically by minimizing the involvements of nodes while transferring data from source to destination, which is decided by the routing protocol. This paper proposes a routing protocol that is based on coordinate mathematics. The path selected to transfer the data from source to destination is almost the shortest active path. Generally, this routing protocol at maximum, only sends the information to two of its neighboring nodes, while not influencing other neighboring nodes in idle state. Beside this, location of all the nodes are previously assigned, so the physical location of source node can be easily located for further procedure. This paper, in summary, proposes a routing protocol designed to sort out two key issues of wireless sensor networks namely power conservation and locating the nodes that have detected information that needs to update.

关键词： Wireless Sensor Networks routing algorithm routing Protocol Power Management Power Conservation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：