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

An improved schnyder routing algorithm for node failure in wireless sensor networks

Journal of Information and Computational Science 2015年第2期12卷 581-588页

作者： Wang, Lisong Sun, Quan Zhang, Lei Miao, Wansheng College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Laboratory of Science and Technology on Avionics Integration AVIC Aeronautical Radio Electronics Research Institute No. 432 Guiping Street Xuhui District Shanghai China

The virtual coordinate-based geometric routing protocol is widely used in wireless sensor networks. In this paper Schnyder geometric routing algorithm based on coordinate-based geometric is researched and implemented. A novel algorithm called Greedy-Compass Double Model routing Algorithm is proposed in order to solve the problem of node failure. Finally, an experiment is demonstrated to show that the achievable rate of the improved algorithm is much higher than that of Schnyder algorithm under the same condition. Copyright © 2015 Binary Information Press.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Homogeneous Wireless Sensor Network routing Algorithm: An Energy Aware Cluster Based Approach 22

A Homogeneous Wireless Sensor Network Routing Algorithm: An ...

引用

22nd Iranian Conference on Electrical Engineering (ICEE)

作者： Abolfazli, Zahra Mahdavi, Mehdi Isfahan Univ Technol Dept Elect & Comp Engn Esfahan *** Iran

ISBN: (纸本)9781479944095

An energy efficient routing algorithm is the major concern in wireless sensor network. routing protocols can be categorized into four groups which are including quality of service (QoS) routing protocols, location-based routing protocols data-centric routing protocols and hierarchical -based routing protocols. For those applications in which the sensors are engaged in environment discovery, the hierarchical-based routing protocols are more efficient. In the other way, clustering techniques have been shown to be useful in both energy and scalability points of view. Hence, in this paper an energy aware routing algorithm based on clustering techniques is proposed. The proposed algorithm is suitable for the multi-hop large scale networks. Our main proposal is apply the network leveling techniques by which the efficiency of clustering based on HEED algorithm is improved. We compare our proposed algorithm with the known algorithms such as BMR and EELBCRP. In comparison with the existing algorithms, the simulation results of our proposed algorithm present the enhancement of the network lifetime significantly. Moreover, our proposed algorithm prevents the network from partitioning based on the energy consumption balance that it produces in the network.

关键词： Sensor node clustering algorithms routing algorithms network lifetime energy aware component

来源：评论

学校读者我要写书评

暂无评论

On Multipath routing Algorithm for Software Defined Networks

On Multipath Routing Algorithm for Software Defined Networks

引用

8th IEEE International Conference on Advanced Networks and Telecommunication Systems - (IEEE ANTS)

作者： Kulkarni, Siddharth S. Badarla, Venkataramana Indian Inst Technol Jodhpur Jodhpur 342011 Rajasthan India

ISBN: (纸本)9781479958672

Software Defined Networking (SDN) is an emerging phenomenon in computer networking. SDN splits control element and forwarding element of a network. It has characteristics such as centralized management, programmability, more security, granularity and reliability. Therefore SDN is suitable for data center, cloud computing and carrier networks. As reliability and fault tolerance are main concerns, these networks inherently add multiple paths between any two nodes in the network, thus creating opportunities for potential gain in network capacity (throughput). Back-pressure algorithm which uses all possible paths between the source and destination nodes is proven as a throughput optimal routing and scheduling algorithm. However, it exhibits excessively high delays and jitter. In order to realize the key benefit of gain in network capacity, in this work we propose to use back-pressure routing in software-defined networks. However, we address the problem of high delays and jitter associated with back-pressure algorithm by using centralized control and monitoring feature of SDN. The modified backpressure algorithm is evaluated through extensive simulations and observed a significant reduction in delays while retaining throughput optimality of the basic back-pressure algorithm.

关键词： routing algorithms Jitter network capacity Network INTEGRATED SHIP CONTROL algorithms Throughput BACK PRESSURE computer software Cloud Computing Fault tolerance Gain

来源：评论

学校读者我要写书评

暂无评论

Travel time estimation using speed predictions

Travel time estimation using speed predictions

引用

International IEEE Conference on Intelligent Transportation Systems

作者： Aditya Narayanan Nikola Mitrovic Muhammad Tayyab Asif Justin Dauwels Patrick Jaillet the School of Electrical and Electronic Engineering College of Engineering Nanyang Technological University Singapore 639798. the Department of Electrical Engineering and Computer Science School of Engineering

ISBN: (纸本)9781467365970

Adanced traveler information systems (ATIS) use sensing, communication and data processing technologies to collect and disseminate real time road traffic information. Route guidance systems utilize this data to estimate and optimize travel times. Paths with the shortest travel times are then computed to suggest to the users, an optimal path to reach their destination. In this study, we examine the accuracy of popular travel time calculation techniques, that use historical, instantaneous and predictive data to compute travel time. A dynamic time calculation technique that accounts for time varying road speeds is used and the driver is considered to experience changes in the traffic pattern as the journey progresses. We base our study on real world traffic data collected from Singapore. We calculate the travel times for trips on major routes based on these techniques and compare them with the true average travel time on the particular route. We also analyze the variablity in travel time that can be experienced by the user when guided by different route guidance system. The results show that dynamic predictive routing using multiple prediction horizons provides a better estimate of actual travel times as opposed to routing algorithms that only utilize real-time data about current traffic conditions.

关键词： shortest travel times instantaneous predictive Travel time Predictive traffic patterns Route Guidance Systems average travel time Time Estimation real-time data routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Circular routing Algorithm for 3D-NoC

Fault-Tolerant Circular Routing Algorithm for 3D-NoC

引用

International Congress on Technology, Communication and Knowledge (ICTCK)

作者： Alizadeh, Razieh Saneei, Mohsen Ebrahimi, Masoumeh ShahidBahonar Univ Kerman Dept Elect Engn Kerman Iran Univ Turku Dept IT Turku Finland KTH ES Dept Stockholm Sweden

ISBN: (纸本)9781479980215

ExpandingNetworks-on-Chip (NoCs) to the third dimension (3D-NoC) has been known as a promising solution for the latency challenges of future many-core Systems-on-Chip. 3D-NoC may take advantages of TSVsfor vertical links which are shorter and faster than horizontal ones. Faults may occur in TSVs as well as the horizontal links though faults inTSVs are more costly. In this paper, we present a fault-tolerant routing algorithm targeting faults in both TSVs and horizontal links. The proposed routing algorithm is based on defining some circular routing paths which offers a deadlock-free routing for packets in mesh-based topologies. In addition to tolerating faults, these circular pathshelp in reducing congestion in the centralpart of the network at high injection rates. The proposed circular routing algorithm is able to tolerate all one-faulty links. In addition, it is shown that its performance is better than those of traditional methods.

关键词： fault tolerance network routing network-on-chip three-dimensional integrated circuits 3D-NoC TSV fault-tolerant circular routing algorithm horizontal links mesh-based topologies networks-on-chip one-faulty links Circuit faults Fault tolerance Fault tolerant systems Mesh networks routing System recovery Three-dimensional displays network-on-chip Fault tolerance Network routing three-dimensional displays three-dimensional integrated circuits system recovery Fault tolerant systems Circuit faults Mesh networks routing algorithms Through-silicon vias Taura syndrome virus of marine penaeid shrimp

来源：评论

学校读者我要写书评

暂无评论

Enhancement of Fiber Frequency Utilization by Employing Grouped Optical Path routing

Enhancement of Fiber Frequency Utilization by Employing Grou...

引用

Optical Fiber Communications Conference and Exhibition (OFC)

作者： Terada, Yuki Mori, Yojiro Hasegawa, Hiroshi Sato, Ken-ichi Nagoya Univ Chikusa Ku Nagoya Aichi 4648603 Japan

Optical path grouped routing not only simplifies the node's architecture, but also mitigates the signal degradation due to optical filtering at each node. It can improve frequency utilization of fibers or mitigate... 详细信息

ISBN: (纸本)9781557529930

关键词： Multiplexing Optical networks Reconfigurable optical add drop multiplexers routing algorithms Wavelength routing Wavelength selective switches Networks, assignment and routing algorithms (060.4251) Networks, network optimization (060.4256)

来源：评论

学校读者我要写书评

暂无评论

Congestion-aware adaptive routing in 2D mesh multicores 13

Congestion-aware adaptive routing in 2D mesh multicores

引用

13th IEEE International Symposium on Network Computing and Applications (NCA)

作者： Avresky, Dimiter Chaix, Fabien Nicolaidis, Michael TIMA Grenoble France TIMA Grenoble France

ISBN: (纸本)9781479953936

New CMOS processes offer cheaper but less reliable transistors. This trend foreshadows the apparition of processors consisting of hundreds and thousands of cores prone to defects. In this context, the performance of the core interconnect under faults will be critical. In this work, we propose the combination of a novel adaptive routing algorithm and several related router mechanisms, which firstly ensure message transfers under transient and permanent faults and second adapt to congestion in order to improve the interconnect performances. In effect, the widespread 2D mesh topology offers a high redundancy of routes. Hence, a fault-tolerant congestion-aware routing algorithm is able to improve substantially the interconnect efficiency under degraded conditions. Besides, the Virtual Channel allocation is optimized for performance, and a message truncation mechanism is added to cope with dynamic permanent and transient faults.

关键词： Circuitfaults Faulttolerance Faulttolerantsystems Multicoreprocessing Ports(Computers) routing Systemrecovery Network routing permanent fault CMOS process transient fault routing algorithms distributed adaptive routing algorithm PROCESSOR Self tuning Channel allocation virtual channels

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Wireless NoCs in Presence of Irregular Network routing Strategies

Performance Evaluation of Wireless NoCs in Presence of Irreg...

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Wettin, Paul Murray, Jacob Kim, Ryan Yu, Xinmin Pande, Partha Pratim Heo, Deukhyoun Washington State Univ Sch Elect Engn & Comp Sci Pullman WA 99164 USA

ISBN: (纸本)9783981537024

The millimeter (mm)-wave small-world wireless NoC (mSWNoC) is an enabling interconnect architecture to design high performance and low power multicore chips. As the mSWNoC has an overall irregular topology, it is extremely important to design suitable deadlock-free routing mechanisms for it. In this paper we quantify the latency, energy dissipation, and thermal profiles of mSWNoC architectures by incorporating irregular network routing strategies. We demonstrate that the latency, energy dissipation, and thermal profile are affected by the adopted routing methodologies. In presence of the benchmarks considered, the variation in latency and energy dissipation is small. However, the network hotspot temperature can vary considerably depending on the exact routing strategy and the characteristics of the benchmark.

关键词： millimeter-wave wireless network-on-chip small-world irregular routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Mechanism of Detecting Communication Network of Power Remote Automatic Meter Reading

Research on Mechanism of Detecting Communication Network of ...

引用

2015 3rd International Conference on Machinery,Materials and Information Technology Applications(ICMMITA 2015)

作者： Gu Gao Chen Hao Wu Zuliang Xue Shengke Tian Shikun Xu Haiyan Jin Yulan State Grid Corporation of China in Shaoxing College of Information Science and Electronic Engineering Zhejiang University

With the launch and implementation of the intelligent grid, the remote meter reading through power line carrier and GPRS wireless network has been widely deployed gradually. However, the wireless network based on SIM card is vulnerable to interference at present, the packet loss and drop occurring sometimes, and due to the complex environment and enormous attenuation of the grid network, the requirements of high quality communication are not guaranteed. Therefore, it is one of the significant technologies that the effective method of detecting communication network of the power remote automatic meter reading. Analyses the features and parameters of GPRS wireless network for the power information collection simultaneously, researches mainly on the comprehensive detecting communication network of the power remote automatic meter reading and power line carrier routing. Evaluate status of the communication of the remote meter reading supported by the statistics from power line carrier network, including the time of routing, communication success rate and communication delay.

关键词： power line carrier GPRS wireless network routing algorithms parameters detecting

来源：评论

学校读者我要写书评

暂无评论

An Application-Specific routing Algorithm to Maximize Flow-Lifetime in Sensor Networks

An Application-Specific Routing Algorithm to Maximize Flow-L...

引用

IEEE 11th International Conference on Networking, Sensing and Control (ICNSC)

作者： Dong, Yizhou Yu, Ming Florida State Univ Dept Elect & Comp Engn Tallahassee FL 32310 USA

ISBN: (纸本)9781479931064

Energy efficient routing has been well investigated with the goal of maximizing the network lifetime, which is usually defined as the time the first node dies. Once a node is dead, data transmissions in the network are assumed to fail. In this paper, we present a novel application-specific energy-efficient routing algorithm to maximize the lifetime of application flows in wireless sensor networks. We consider the network remains alive as long as the energy can maintain the flows of the application traffic even if some nodes run out of battery. First, we formulate the routing problem as a linear programming problem, which can be converted to a max-min fairness problem. Second, the lifetime of a path is evaluated by analyzing link metrics including residual energy, transmission rate, and link distance. Third, a heuristic routing algorithm is proposed to compute the best route which minimizes the cost of application flows. Simulation results have shown that our routing algorithm can prolong the flows lifetime around 10%.

关键词： routing algorithms Energy efficiency data transmission routing Problem Sensor networks linear programming Maximize Wireless sensor networks Line of nodes Simulation results

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：