共查询到20条相似文献,搜索用时 0 毫秒
1.
In recent years, cloud computing provides a spectacular platform for numerous users with persistent and alternative varying requirements. In the cloud environment, security and service availability are the two most significant factors during the data encryption process. For providing optimal service availability, it is necessary to establish a load balancing technique that is capable of balancing the request from diverse nodes present in the cloud. This paper aims in establishing a dynamic load balancing technique using the APMG approach. Here in this paper, we integrated adaptive neuro-fuzzy interference system-polynomial neural network as well as memory-based grey wolf optimization algorithm for optimal load balancing. The memory-based grey wolf optimization algorithm is employed to enhance the precision of ANFIS-PNN and to maximize the locations of the membership functions respectively. Also, two significant factors namely the turnaround time and CPU utilization involved in optimal load balancing scheme are evaluated. Finally, the performance evaluation of the proposed MG-ANFIS based dynamic load balancing approach is compared with various other load balancing approaches to determine the system performances. 相似文献
2.
Wireless Personal Communications - The widespread use of wireless sensor devices and their advancements in terms of size, deployment cost and user friendly interface have given rise to many... 相似文献
3.
针对同构无线传感器网络的能源瓶颈问题提出一种能源有效的自适应路由协议,该协议在分布式动态分簇的基础上提出一种班车算法对数据进行逐层汇聚,以减少网络中流动数据包的数量,同时分担簇头节点的计算量。Tossim仿真试验表明该协议能够显著地减少节点的能量开销,提高网络的适应性,有效地延长网络的生命周期。 相似文献
4.
本文在简要地介绍了无线传感器网络体系结构的基础上,研究了当前主要的几种无线传感器网络路由协议模型,并进行了比较分析. 相似文献
5.
Wireless Personal Communications - Energy efficient routing in wireless sensor networks (WSNs) require non-conventional paradigm for design and development of power aware protocols. Swarm... 相似文献
6.
针对无线传感器网络中节点能量受限的特征,提出了ILEACH(improved-LEACH)分簇路由协议,达到延长网络生存时间的目的,该分簇路由协议在簇头选取时,充分考虑了节点的剩余能量;簇形成时利用了距离阈值的约束来优化分簇方案;数据收集阶段,根据节点的权值在簇头节点之间建立到基站的路由树,利用NS2仿真软件对LEACH和ILEACH协议进行仿真、比较,结果显示ILEACH具有良好的性能. 相似文献
7.
无线传感器网络中传感器节点能量有限,为了提高能量利用率,针对现有算法随机选择簇首、簇结构不合理等缺陷提出了一种新的能量有效的分簇路由算法EERA.EERA采用新的簇首选举、成簇,以及构建簇间路由算法,基于节点剩余能量与节点的相对位置选择簇首、成簇,使剩余能量较多的节点优先成为簇首并且各簇首能较均匀的分布在网络区域内;构建簇间路由时将最小跳数路由算法与改进的MTE算法结合起来,在簇间形成最小跳数、最小能耗路径.仿真结果表明,EERA算法可以均衡全网能量消耗,延长网络的生命周期. 相似文献
8.
1IntroductionAs the development of MEMStechnology,the microsensors whichintegrate manyfunctions such as sensing,signal processing and communication have been widelyused[1]. Wireless Sensor Network ( WSN) is construct-ed with hundreds to thousands of sensors and one ormore SINKs .Sensors can sense (monitor) many physi-cal signals such as sound,light ,electronics ,tempera-ture and humidity of the objects in a given region[2 ~3].Sensors transfer these signalsinto sensing data and sendsensin… 相似文献
9.
The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis is geographic routing. This paper contains an introduction to the problem field of geographic routing, presents a specific routing algorithm based on a synthesis of the greedy forwarding and face routing approaches, and provides an algorithmic analysis of the presented algorithm from both a worst-case and an average-case perspective. 相似文献
10.
Wireless Personal Communications - Research on wireless sensor network (WSN) has mainly involved the use of a portable and limited power source, namely batteries, to power the sensors. Without... 相似文献
12.
The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively. 相似文献
13.
无线传感器网络的重要应用特性是具有感测信息的传感节点形成一个自适应本地网络,由中心节点执行不同的协作信息处理任务。该文基于互信息量分析了不同中心节点选择机制的开销性能,证明了基于扩散计算的选择机制的开销有效性;提出一种自适应协同通信路由协议(ACCRP):节点以分布式的方式选择中心节点并建立传输路径;分析讨论了ACCRP的性能参数;并通过实验验证了ACCRP是能源有效的、可扩展的自适应路由协议。 相似文献
14.
针对无线传感器网络资源受限、能量约束问题,提出了ESRAC算法.该算法综合PEGASIS算法及蚁群算法的优点,考虑到全网的能量消耗,将能量因子加入到概率选择模型和信息素更新机制中,构造最短路由.并且利用混沌扰动,使蚁群算法跳离局部最优解,避免路由过程中的热点问题.仿真实验表明该算法更好地节约了全网能量,延长了网络的生命周期. 相似文献
15.
在大规模无线传感器网络中以最节能的方式将数据发送到sink是该领域研究的热点之一。针对LEACH算法的不足之处,提出了一种能耗均衡的路由算法。此算法在考虑节点剩余能量的基础上采用两分法选举簇首,然后簇首通过能耗代价函数计算出一条能耗最小的路径,以多跳转发的方式将数据传送到sink.,为了进一步减少节点的能耗,算法在簇内采用了数据聚合机制。仿真结果表明,算法有效地均衡了网络能耗,延长了网络生存期。 相似文献
16.
In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime. 相似文献
17.
In this paper, we first propose a method, ABVCap, to construct a virtual coordinate system in a wireless sensor network. ABVCap assigns each node multiple 5-tuple virtual coordinates. Subsequently, we introduce a protocol, ABVCap routing, to route packets based on the ABVCap virtual coordinate system. ABVCap routing guarantees packet delivery without the computation and storage of the global topological features. Finally, we demonstrate an approach, ABVCap maintenance, to reconstruct an ABVCap virtual coordinate system in a network with node failures. Simulations show ABVCap routing ensures moderate routing path length, as compared to virtual-coordinate-based routing, GLIDER, Hop ID, GLDR, and VCap. 相似文献
18.
在无线传感器网络体系结构中,路由技术至关重要。本文描述了无线传感器路由协议所面临的问题与挑战,分析和比较了典型的平面路由协议和层次路由协议。最后总结了理想路由协议应该具有的特点以及路由协议未来的研究策略及发展趋势。 相似文献
19.
Multipath routing is an efficient technique to route data in wireless sensor networks (WSNs) because it can provide reliability, security and load balance, which are especially critical in the resource constrained system such as WSNs. In this paper we provide a survey of the state-of-the-art of proposed multipath routing protocols for WSNs, which are classified into three categories, infrastructure based, non-infrastructure based and coding based, based on the special techniques used in building multiple paths and delivering sensing data. For each category, we study the design of protocols, analyze the tradeoff of each design, and overview several representing protocols. In addition, we give a summery of design goals, challenges, and evaluation metrics for multipath routing protocols in resource constrained systems in general. 相似文献
20.
Sensory data gathered from sensor nodes in physical proximity tend to exhibit strong correlation. To minimize such redundancy and hence curtail the load in wireless sensor networks with a goal to conserve energy, effective in-network fusion schemes have been extensively proposed in the literature. To this end, routing schemes supporting data fusion are extremely important as they dictate where and when sensory data streams shall intersect with each other and thus fusion will be performed. In this article we briefly articulate this problem and classify recently proposed routing schemes supporting data fusion in wireless sensor networks into three categories: routing-driven, coding-driven, and fusion-driven. We also give an overview of various algorithms in each category by summarizing their design approaches, benefits, and drawbacks. 相似文献
|