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

An improved harmony search based energy-efficient routing algorithm for wireless sensor networks

APPLIED SOFT COMPUTING 2016年 41卷 135-147页

作者： Zeng, Bing Dong, Yan Huazhong Univ Sci & Technol Sch Mech Sci & Engn State Key Lab Digital Mfg Equipment & Technol 1037 Luoyu Rd Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Elect & Informat Engn Dept 1037 Luoyu Rd Wuhan 430074 Peoples R China

Wireless sensor networks (WSNs) is one of the most important technologies in this century. As sensor nodes have limited energy resources, designing energy-efficient routing algorithms for WSNs has become the research focus. And because WSNs routing for maximizing the network lifetime is a NP-hard problem, many researchers try to optimize it with meta-heuristics. However, due to the uncertain variable number and strong constraints of WSNs routing problem, most meta-heuristics are inappropriate in designing routing algorithms for WSNs. This paper proposes an Improved Harmony Search Based Energy Efficient routing Algorithm (IHSBEER) for WSNs, which is based on harmony search (HS) algorithm (a meta-heuristic). To address the WSNs routing problem with HS algorithm, several key improvements have been put forward: First of all, the encoding of harmony memory has been improved based on the characteristics of routing in WSNs. Secondly, the improvisation of a new harmony has also been improved. We have introduced dynamic adaptation for the parameter HMCR to avoid the prematurity in early generations and strengthen its local search ability in late generations. Meanwhile, the adjustment process of HS algorithm has been discarded to make the proposed routing algorithm containing less parameters. Thirdly, an effective local search strategy is proposed to enhance the local search ability, so as to improve the convergence speed and the accuracy of routing algorithm. In addition, an objective function model that considers both the energy consumption and the length of path is developed. The detailed descriptions and performance test results of the proposed approach are included. The experimental results clearly show the advantages of the proposed routing algorithm for WSNs. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks routing algorithms Energy-efficient Meta-heuristic Harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

routing Algorithm of Wireless Sensor Network and Robustness Analysis Based on Fuzzy Mathematics

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2017年第12期13卷 85-103页

作者： Xiang, Ying Chen, Miaochao Zhuang, Xiaohong Li, Xiaoxing Changzhou Vocat Inst Mech Technol Basic Dept Culture Changzhou 213164 Peoples R China Chaohu Univ Sch Appl Math Chaohu 238000 Peoples R China Future Land Holdings Co Ltd Shanghai 200000 Peoples R China

In order to reduce the energy consumption and enhance the robustness of wireless sensor network (WSN), this paper proposes a hierarchical clustering routing algorithm based on fuzzy mathematics (HCRAFM). To make a comprehensive analysis of WSN, it is also necessary to detect the robustness of the network. Facing the multiple random variables, the traditional robustness detection models assume that all nodes have the same weight, making it impossible to quantify the analysis indices or obtain accurate results. Thus, the fuzzy mathematics theory was introduced to the WSN robustness detection, forming a fuzzy comprehensive evaluation method. The simulation results show that the HCRAFM strikes a load balance between WSN nodes, extends the life cycle of each node, and prolongs the service life of the network. In addition, the proposed algorithm is proved to have sound robustness and strong applicability.

关键词： routing algorithms Robustness Analysis Wireless Sensor Network (WSN) Fuzzy Mathematics

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Hybrid Social Based routing Algorithm for MANET-DTN

引用

MOBILE INFORMATION SYSTEMS 2016年第1期2016卷

作者： Matis, Martin Dobos, L'ubomir Papaj, Jan Tech Univ Kosice Dept Elect & Multimedia Commun Kosice 04001 Slovakia

A new routing algorithm for mobile ad hoc networks is proposed in this paper: an Enhanced Hybrid Social Based routing (HSBR) algorithm for MANET-DTN as optimal solution for well-connected multihop mobile networks (MANET) and/or worse connected MANET with small density of the nodes and/or due to mobility fragmented MANET into two or more subnetworks or islands. This proposed HSBR algorithm is fully decentralized combining main features of both Dynamic Source routing (DSR) and Social Based Opportunistic routing (SBOR) algorithms. The proposed scheme is simulated and evaluated by replaying real life traces which exhibit this highly dynamic topology. Evaluation of new proposed HSBR algorithm was made by comparison with DSR and SBOR. All methods were simulated with different levels of velocity. The results show that HSBR has the highest success of packet delivery, but with higher delay in comparison with DSR, and much lower in comparison with SBOR. Simulation results indicate that HSBR approach can be applicable in networks, where MANET or DTN solutions are separately useless or ineffective. This method provides delivery of the message in every possible situation in areas without infrastructure and can be used as backup method for disaster situation when infrastructure is destroyed.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

引用

WIRELESS NETWORKS 2016年第8期22卷 2637-2647页

作者： Mohajerani, Abdolreza Gharavian, Davood Shahid Beheshti Univ Fac Elect Engn Tehran Iran

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.

关键词： Wireless sensor networks routing algorithms Ant colony optimization Energy consumption Network lifetime

来源：评论

学校读者我要写书评

暂无评论

An optimal inherently stabilizing routing algorithm for star P2P overlay networks

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2016年第17期28卷 4405-4428页

作者： Karaata, Mehmet Hakan Alsulaiman, Thamer Kuwait Univ Dept Comp Engn POB 5969 Safat 13060 Kuwait

Star graphs possess many desirable properties such as scalable node degrees and diameters, which are essential to facilitate reduced routing table sizes and low maximum path length for routing in large P2P networks. In addition, because a large number of disjoint paths are available and each data/replica in an n-star can be placed in an (n - 1)-star, load balancing and alleviation of network bottlenecks can be implemented in star P2P overlay networks. Therefore, star networks have been proposed as viable alternatives to existing overlay topologies for large P2P networks. In this paper, we propose an optimal stabilizing and inherently stabilizing algorithm for routing messages over all disjoint paths between two peers in a star P2P overlay network. The algorithm is optimal in terms of its time complexity in rounds and the length of the longest path traversed by the messages, and fault tolerant due to being stabilizing and inherently stabilizing, allowing the system to withstand transient faults. The algorithm can be used to increase network reliability and survivability in P2P networks. In addition, the usage of all disjoint paths to route messages between two peers leads to increased network bandwidth while distributing the communication overhead across the network and eliminating network bottlenecks in P2P networks. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： Cayley graphs communication networks node-disjoint paths P2P overlay networks routing algorithms star networks

来源：评论

学校读者我要写书评

暂无评论

Process Variation Delay and Congestion Aware routing Algorithm for Asynchronous NoC Design

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2016年第3期24卷 909-919页

作者： Ezz-Eldin, Rabab El-Moursy, Magdy A. Hamed, Hesham F. A. Beni Suef Univ Dept Elect Engn Bani Suwayf 62511 Egypt Mentor Graph Corp Cairo 11361 Egypt Elect Res Inst Cairo Egypt Menia Univ Dept Elect Engn Al Minya 11432 Egypt

The effect of process variation (PV) on delay is a major reason to deteriorate the performance in advanced technologies. The performance of different routing algorithms is determined with/without PV for various traffic patterns. The saturation throughput and average message delay are used as performance metrics to evaluate the throughput. PV decreases the saturation throughput and increases the average message delay. PV increases the average message delay by up to 90% and decreases the saturation throughput by up to 29% compared with nominal characteristics of different routing algorithms. Adaptive routing algorithm should be manipulated with the PV. A novel PV delay and congestion aware routing (PDCR) algorithm is proposed for asynchronous network-on-chip design. PDCR is adaptive, low cost, and scalable. The novel routing algorithm outperforms different adaptive routing algorithms in the average delay and saturation throughput for various traffic patterns. PDCR can achieve up to 12%-32% average message delay lower than that of other routing algorithms. Moreover, the proposed scheme yields improvements in saturation throughput by up to 11%-82% compared with other adaptive routing algorithms.

关键词： Asynchronous design congestion network on chip (NoC) process variation (PV) routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic greedy routing in overlay networks using virtual coordinates from the hyperbolic plane

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2016年第4期27卷 519-532页

作者： Magoni, Damien Cassagnes, Cyril Univ Bordeaux LaBRI Talence France Univ Luxembourg SnT 6 Rue Richard Coudenhove Kalergi L-1359 Luxembourg Luxembourg

Greedy routing algorithms based on virtual coordinates have attracted considerable interest in recent years. Those based on coordinates taken from the hyperbolic plane have interesting theoretical scalability properties. However, their scalability and reliability are yet to be ensured when applied to large-scale dynamic networks. In this paper, we propose a scalable and reliable solution for creating and managing dynamic overlay networks where nodes have hyperbolic coordinates. In this context, our solution provides a greedy routing algorithm based on the hyperbolic distance. To cope with network dynamics, we have defined two methods for avoiding temporary local minima and one method for maintaining the greedy embedding over time. Through analysis, we evaluate the complexity costs of our solution. Through simulations, we assess the scalability of our solution on static networks and its reliability on dynamic networks. Results show that using our solution based on hyperbolic geometry provides scalability and reliability to both addressing and routing tasks in dynamic overlay networks. Copyright (C) 2015 John Wiley & Sons, Ltd.

关键词： greedy method Scalability Hyperbolic dynamic network hyperbolic coordinates Lobachevskian geometry Coordinates routing algorithms overlay network

来源：评论

学校读者我要写书评

暂无评论

routing Algorithm Based on SPSO

Routing Algorithm Based on SPSO

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Jing Liang Mingyuan Yu Caitong Yue Mengmeng Li Zongxiao Yue School of Electrical Engineering Zhengzhou University

To solve the overlap problem in node selection process in order to fill the existing routing algorithms deficiencies, This paper designs a traditional Gossiping routing algorithm based on SPSO. At the

ISBN: (纸本)9781467389808

关键词： Wireless sensor network Particle swarm routing algorithm routing algorithms Particle swarm optimization Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Scalable software-defined optical networking with high-performance routing and wavelength assignment algorithms

引用

OPTICS EXPRESS 2015年第21期23卷 27354-27360页

作者： Lee, Chankyun Cao, Xiaoyuan Yoshikane, Noboru Tsuritani, Takehiro Rhee, June-Koo Kevin KDDI R&D Labs Inc Fujimino Saitama 3568502 Japan Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon 305701 South Korea

The feasibility of software-defined optical networking (SDON) for a practical application critically depends on scalability of centralized control performance. The paper, highly scalable routing and wavelength assignment (RWA) algorithms are investigated on an OpenFlow-based SDON testbed for proof-of-concept demonstration. Efficient RWA algorithms are proposed to achieve high performance in achieving network capacity with reduced computation cost, which is a significant attribute in a scalable centralized-control SDON. The proposed heuristic RWA algorithms differ in the orders of request processes and in the procedures of routing table updates. Combined in a shortest-path-based routing algorithm, a hottest-request-first processing policy that considers demand intensity and end-to-end distance information offers both the highest throughput of networks and acceptable computation scalability. We further investigate trade-off relationship between network throughput and computation complexity in routing table update procedure by a simulation study. (C) 2015 Optical Society of America

关键词： Assignment algorithms Network topology Optical networks Optical signals routing algorithms Wavelength assignment

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Iterative Local Search Algorithm for The Electric Fleet Size and Mix Vehicle routing Problem with Time Windows and Recharging Stations

引用

IFAC-PapersOnLine 2016年第12期49卷 955-960页

作者： Vaz Penna, Puca Huachi Afsar, H. Murat Prins, Christian Prodhon, Caroline Universidade Federal de Ouro Preto Departamento de Computação Campus Morro do Cruzeiro s/n Ouro Preto-MG 35400-000 Brazil ICD-LOSI UMR CNRS 6281 Université de Technologie de Troyes 12 Marie Currie CS 42060 Troyes CEDEX10004 France

As the cities around the world become larger, quality of life of the citizens is more and more threatened due to the traffic congestion, energy consumption, noise disturbance and carbon emissions because of of increasing transport. Electrical vehicles present an opportunity to reduce greenhouse gas emissions. But limited driving range and long recharging times are among the challenges that the research community has to face. This paper proposes an iterative local search algorithm coupled with a set partitioning model to solve The Electric Fleet Size and Mix Vehicle routing Problem with Time Windows and Recharging Stations. Several types of electrical vehicles with varying driving range, capacity and fixed cost should service a set of customers within their time limits and during their tours each vehicle can be recharged in stations. We show the efficiency and the quality of our method by solving benchmark instances of the Heterogeneous Fleet Electric Vehicle Problems with Time Windows. © 2016

关键词： Fleet operations Benchmarking Energy utilization Gas emissions Greenhouse gases Iterative methods Learning algorithms Local search (optimization) routing algorithms Traffic congestion Vehicle routing Vehicles Electrical vehicles Fleet size and mixes Heterogeneous fleet Iterative local searches Metaheuristic Noise disturbance Research communities Vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：