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

4th International Conference on Wireless and Optical Communications (IWOC)

作者： Tang, Tingfang Guo, Peng Liu, Xuefeng Huazhong Univ Sci & Technol Wuhan Peoples R China

ISBN: (纸本)9781510601550

In-network processing is an efficient way to reduce the transmission cost in wireless sensor networks (WSNs). The in-network processing of many domain-specific computation tasks in WSNs usually requires to losslessly distribute the computation of the tasks into the sensor nodes, which is however usually not easy. In this paper we are concerned with such kind of tasks whose computation can only be partitioned into recursive computation mode. To distribute the recursive computations into WSNs, it is required to design an appropriate single in-network processing path, along which the intermediate data is forwarded and updated in the WSNs. We address the recursive computation with constant size of computation result, e.g., distributed least square estimation (D-LSE). Finding the optimal in-network processing path to minimize the total transmission cost in WSNs, is a new problem and seldom studied before. To solve it, we propose a novel routing algorithm called as S-TSP, and compare it with some other greedy algorithms. Extensive simulations are conducted, and the results show the good performance of the proposed S-TSP algorithm.

关键词： wireless sensor networks in-network processing recursive computation routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved ant colony algorithm for routing in software defined networking

引用

Journal of Computational and Theoretical Nanoscience 2016年第1期13卷 438-442页

作者： Tang, Yong Wang, Wei-Zhen Dong, Shu-Na Tang, Ding Yong Computer Science and Technology School of UESTC Chengdu611731 China School of Information Science and Technology Southwest Jiaotong University Chengdu610031 China

It is difficult for the best-effort service way of traditional network to meet QoS requirements of applications. Software Defined Networking (SDN) raises a good idea for the above-mentioned issue. The controller can control and manage network resources in SDN. This paper proposes an improved ant colony algorithm by mainly adding the QoS constraints. This algorithm calculates routes meeting QoS requirements through obtaining the network topology and resources usage status from the controller. When the network is in state of heavy load, it is impossible for the bandwidth of the single path to meet the bandwidth requirements of applications. And this algorithm uses the multipath aggregation strategy to distribute the flow to the multiple paths and makes the sum of bandwidth of these multiple paths satisfy the bandwidth requirement of applications. Experiment results show that this algorithm can meet latency and bandwidth requirements of applications. © 2016 American Scientific Publishers All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Challenges and Opportunities with Place and Route of Modern FPGA Designs 16

Challenges and Opportunities with Place and Route of Modern ...

引用

ACM International Symposium on Physical Design (ISPD)

作者： Nijssen, Raymond Achronix Semicond Corp 2953 Bunker Hill Lane Santa Clara CA 95054 USA

ISBN: (纸本)9781450340397

In the last decade place and route algorithms used for large high performance FPGA designs have been successfully adapted from those used in ASIC design flows. All major FPGA tool sets now use advanced analytical global placement algorithms with sophisticated cell clustering. Thanks to this, fast runtimes and predictable performance on designs with millions of placeable objects empower designers to quickly and often evaluate their decisions. Fast design flow turn-around times and predictability are of tremendous value to help designers improve timing closure problems in their designs, and accommodate them to floorplanning constraints and congestion bottlenecks. Although many P&R related aspects are common between ASIC and FPGA technologies, many are unique to FPGAs. For example, the many tight, rigid constraints, as well as aggressive runtime requirements and the heterogeneity of the problems. As these unique challenges have received relatively little coverage in literature this presentation focuses on the entailing opportunities. In particular, unlike ASICs in which different types of cell instances can be moved between and within rows freely, FPGAs have discrete, fixed heterogeneous resource locations onto which the user design must be fitted: a flip-flop instance in the user netlist can only be placed onto a flip-flop site of the FPGA fabric. Carry chains in FPGA fabrics are very fast, but run only vertically, typically only in one direction. And the routing fabric of an FPGA must impose countless routing restrictions, like one-way routing and input sharing, without which the size of the chip would become prohibitively large. These essential restrictions must be well understood and taken into account in algorithms targeting FPGAs. In its first part, this presentation will cover several examples of such aspects and will suggest approaches. The second part covers incremental compilation, various forms of parallel processing are other must-have features for a co

关键词： fpga placement algorithms routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Epidemic routing based on adaptive compression of vectors: efficient low-delay routing for opportunistic networks based on adaptive compression of vectors

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2015年第3期28卷 560-573页

作者： Ren, Zhi Peng, Shuang Chen, Hong Fang, Jun Chen, Qianbin Chongqing Univ Posts & Telecommun Chongqing Key Lab Mobile Commun Technol Chongqing 400065 Peoples R China Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 610054 Sichuan Peoples R China

In the study of routing in opportunistic networks, we find that there are some redundant overhead when the existing epidemic-based routing algorithms exchange summary vectors (SVs) and request vectors (RVs), and store SVs. To address this issue, we propose an efficient low-delay routing algorithm, epidemic routing based on adaptive compression of vectors (ERACV). Our proposed algorithm adaptively shortens the length of SVs and RVs by compressing the same bit sequences, optimizes the mechanism of exchanging SVs and RVs, and improves the order of transmitting data packets. Theoretical analysis verifies the effectiveness of ERACV in decreasing redundant overhead and packet delay. Simulation results show that ERACV reduces SVs' storage and control overheads by at least 18.0% and 35.8%, respectively, as well as decreases the average end-to-end delay of data packets by more than 2.5%, as compared with epidemic routing algorithm and message transmission control scheme. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： opportunistic networks routing algorithms vectors compression adaptation

来源：评论

学校读者我要写书评

暂无评论

Retrieving and routing quantum information in a quantum network

引用

QUANTUM INFORMATION PROCESSING 2015年第12期14卷 4651-4664页

作者： Sazim, S. Chiranjeevi, V. Chakrabarty, I. Srinathan, K. Inst Phys Bhubaneswar 751005 Orissa India Int Inst Informat Technol Hyderabad 500032 Telangana India

In extant quantum secret sharing protocols, once the secret is shared in a quantum network (qnet) it cannot be retrieved, even if the dealer wishes that his/her secret no longer be available in the network. For instance, if the dealer is part of the two qnets, say and and he/she subsequently finds that is more reliable than , he/she may wish to transfer all her secrets from to . Known protocols are inadequate to address such a revocation. In this work we address this problem by designing a protocol that enables the source/dealer to bring back the information shared in the network, if desired. Unlike classical revocation, the no-cloning theorem automatically ensures that the secret is no longer shared in the network. The implications of our results are multi-fold. One interesting implication of our technique is the possibility of routing qubits in asynchronous qnets. By asynchrony we mean that the requisite data/resources are intermittently available (but not necessarily simultaneously) in the qnet. For example, we show that a source S can send quantum information to a destination R even though (a) S and R share no quantum resource, (b) R's identity is unknown to S at the time of sending the message, but is subsequently decided, (c) S herself can be R at a later date and/or in a different location to bequeath her information ('backed-up' in the qnet) and (d) importantly, the path chosen for routing the secret may hit a dead end due to resource constraints, congestion, etc., (therefore the information needs to be back-tracked and sent along an alternate path). Another implication of our technique is the possibility of using insecure resources. For instance, if the quantum memory within an organization is insufficient, it may safely store (using our protocol) its private information with a neighboring organization without (a) revealing critical data to the host and (b) losing control over retrieving the data. Putting the two implications together, namely routing and se

关键词： QUANTUM information science QUANTUM networks (Optics) routing algorithms INFORMATION retrieval THEOREMS (Mathematics)

来源：评论

学校读者我要写书评

暂无评论

Incorporating an Indicator Based on Modularity to Improve routing in Optical Networks

Incorporating an Indicator Based on Modularity to Improve Ro...

引用

International Conference on Transparent Optical Networks

作者： Carmelo J. A. Bastos-Filho Danilo R. B. Araújo Joaquim F. Martins-Filho University of Pernambuco Recife 50720-001 Pernambuco Brazil Federal Rural University of Pernambuco Recife 52171-900 Pernambuco Brazil Federal University of Pernambuco Recife 50740-530 Pernambuco Brazil

ISBN: (纸本)9781509014682

Some characteristics of optical networks can be assessed by analyzing the topology of the network. Many metrics can be used for this purpose. Modularity indicators were already proposed to study complex networks, and they have been useful to clarify many real world problems. In this paper, we propose an indicator inspired in the traditional modularity concept aiming at finding suitable routes in optical networks. The primary goal of this study is to introduce a measure of the degree of interference between routes to be used in the routing process in order to improve the overall performance of optical networks. We provide some preliminary results, which show that our proposal is promising.

关键词： Optical Networks Network Optimization routing algorithms Complex Networks

来源：评论

学校读者我要写书评

暂无评论

OPPRES: Opportunistic routing algorithm for routing messages in Emergency Situations using Vehicular Delay Tolerant Network

OPPRES: Opportunistic Routing algorithm for routing messages...

引用

IEEE International Conference on Advanced Networks and Telecommuncations Systems

作者： Milind R. Penurkar Umesh A. Deshpande Dept. of Computer Science and Engineering VNIT

ISBN: (纸本)9781509021949

A vehicular delay tolerant network (VDTN) is a special type of delay tolerant network (DTN), in which vehicles act as mobile nodes that are carriers of the message. It is characterized by the absence of an end-to-end connectivity between the nodes residing at the extreme ends. The routing in VDTN is critical as nodes are not connected permanently and the goal is to complete the message delivery successfully. We propose an Opportunistic routing algorithm for Emerging Situations (OPPRES) using VDTN to route messages in the real world. OPPRES is based on a utility mechanism for routing messages in VDTN. The algorithm takes into account node's contact history recorded as a utility for forwarding the messages. This history comprises the past encounters of a node with the destination nodes or the relay nodes. The algorithm can be used to route the messages in emergency situations. Simulations show that, our algorithm OPPRES beat some existing DTN routing approaches like PRoPHET and Spray-and-Wait in terms of increased message delivery ratio and less average delivery latency at the cost of the large overhead ratio.

关键词： Vehicular Delay Tolerant Networks Intermittent Connectivity routing Utility Emergency Situation EMERGENCY SITUATIONS Network routing routing algorithms Messages message passing Ganglia end-to-end

来源：评论

学校读者我要写书评

暂无评论

An improved OSPF routing algorithm based on quotient and granularity space theory

International Journal of Signal Processing, Image Processing...

引用

International Journal of Signal Processing, Image Processing and Pattern Recognition 2016年第6期9卷 311-322页

作者： Qi, Zhong College of Mathematics and Computer Science Gannan Normal University Ganzhou China

As the rapid increasing of Internet users from all over the world, it is necessary to enhance the reliability and compatibility of network when large number of data transferred frequently. One of the most important services is routing method since enormous data are transferred and exchanged within the network. This paper introduces an improved OSPF routing algorithm which uses the quotient and granularity space theory. Based on the simulation and experiments, several key findings are observed. Firstly, using the improved algorithm, the convergence time is much less than the no hierarchical network and the performance is better in terms of OSPF response. Secondly, it is found that the bandwidth utilization reaches 30Kbit/s, comparing with the network without hierarchy, the improvement is 40% that the bandwidth utilization increased from 18Kbit/s to 30 Kbit/s. The hierarchical network outperforms the one without layers. © 2016 SERSC.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy Aware Simple Ant routing Algorithm for Wireless Sensor Networks

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-11页

作者： Jabbar, Sohail Iram, Rabia Imran, Muhammad Ahmad, Awais Paul, Anand Minhas, Abid Ali Iftikhar, Andmohsin Bahria Univ Dept Comp Sci Islamabad 44000 Pakistan COMSATS Inst Informat Technol Dept Comp Sci Sahiwal 57000 Pakistan King Saud Univ Riyadh 11451 Saudi Arabia Kyungpook Natl Univ Sch Comp Sci & Engn Taegu 702701 South Korea Al Yamamah Univ Coll Comp & Informat Syst Riyadh 11512 Saudi Arabia Charles Sturt Univ Sch Comp & Math Wagga Wagga NSW 2678 Australia

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

关键词： routing algorithms WIRELESS sensor networks SIMULATION methods & models WIRELESS sensor nodes COMPUTER networks

来源：评论

学校读者我要写书评

暂无评论

A Method to Improve Adaptivity of Odd-Even routing Algorithm in Mesh NoCs

A Method to Improve Adaptivity of Odd-Even Routing Algorithm...

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Mohammad Sadrosadati Ramin Bashizade Shahin Roozkhosh Ali Shafiee Hamid Sarbazi-Azad Department of Computer Engineering Sharif University of Technology Tehran Iran Department of Computer Science University of Utah Utah USA Computer Science School Institute for Researches in Fundamental Sciences Tehran Iran

Adaptive routing algorithms help balancing the resource utilization in different parts of the network and hence, prevent a resource becoming the performance bottleneck while other resources are still under-utilized. In this paper, we present a novel approach, called Preemptive Waiting, which is applied to Odd-Even routing algorithm (PWOE). PWOE postpones the saturation traffic rate of NoC by 13.4% compared to OE, under synthetic traffic loads.

关键词： Adaptivity Network-on-Chip Odd-even Performance network-on-chip routing algorithms Resource utilization traffic rate Medical Subject Headings Transportation load

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：