共查询到20条相似文献，搜索用时 125 毫秒
1.
通过优化网络路由,提高网络的拓扑性能,实现网络的能量平衡。传统的网络路由算法采用能量平衡环形路由算法,出现网络能耗不均衡。提出一种基于反馈约束改进蚁群算法的网络路由优化方法。采用区域分割处理办法,得到分簇路由任务概率随机分布模式下的置信概率,通过蚁群反馈约束,提高信息正确传输的概率,根据贝叶斯定理,得到路由现成路由子节点定位和扑救路径方位置信度的递归计算式,实现网络路由优化。仿真实验表明,算法能有效提高网络信息正确传输的概率,可靠性较高,几乎能达到无失真传输,随着路由跳数的增加,设计的路由算法的优势愈发明显,提高了信息传输的通信质量。 相似文献
2.
针对无线视频传感器网络能量异构普遍存在的特点,提出一种引入优化压缩思维的无线视频传感器网络路由协议,确定节点的可压缩性,在簇头节点中完成数据的稀疏以及观测,将少数测量数据发送至汇聚节点,汇聚节点通过采集节点压缩数据的测量向量,进行压缩感知解码,完成数据的压缩以及重构操作。通过蚁群算法获取无线视频传感器网络中最小成本的路径,将数据分组发送至所有邻居节点,蚂蚁依据能量水平的高低确定下一跳,从而更好的完成全网能量均衡,蚂蚁走完所有路径后,对其信息素进行计算,求出信息素的挥发带来的负反馈,给出新的带宽函数以及跳数函数,节点间通过周期性的广播路由更新分组确保路由表的正确性,在路由选择时综合分析带宽与跳数因素,有效提高了无线视频传感器网络的吞吐量。仿真实验结果表明,所提协议可有效均衡网络能耗,延长整个网络生命周期。 相似文献
3.
《科技通报》2017,(3)
物联网传感网络广泛应用在环境监测和模式识别等领域,物联网传感网络的路由协议通过多跳汇聚树路由网络进行组网,随着节点数目的增多容易出现链路故障,需要进行路由修复和改进设计。提出一种基于链信息头抽取和信息源定位的物联网传感器网络路由改进设计方法。构建了物联网下传感器网络的组网和路由探测模型,采用链路信息簇头节点抽取和信息源定位方法进行链路路由信息数据聚集,采用预加重方法广播竞选簇头节点的能量损失,通过双向链路估计得到路由节点的数据传输协议,采用链路节点能量和Sink节点距离分层方法实现路由优化设计。仿真结果表明,采用该方法进行物联网传感网络的路由优化设计,提高了链路信息收发和数据传输的可靠性和吞吐量,性能优越。 相似文献
4.
无线传感网络通常是以无线传感节点的能量和信号传输路径的关系构建路由协议的。传统的LEACH协议没有考虑无线传感网络中存在多嵌入不兼容通信设备的问题,一旦网络中存在大量嵌入不兼容传感节点,则这些节点的属性就会偏离普通节点,将会导致无线传感网络通信性能降低。为此,提出考虑多嵌入不兼容设备的无线传感网络路由优化设计方法。在传统的LEACH路由协议的基础上进行优化设计,以传感节点剩余能量作为衡量指标选取合理的节点作为路由节点,并进行均匀布置。在信息传输的过程中,将多跳传输与单跳传输相结合,从而实现了不兼容设备下的路由协议优化。实验结果表明,利用本文算法进行路由协议构建,能够降低网络的能量消耗和信息传输的延时率,提高了通信效率。 相似文献
5.
为了提高无线传感器网络的能量利用率和延长网络的生命周期,本文提出了基于负载平衡的无线传感器网络路由算法。首先,将网络划分成多个网格,根据网格内节点的负载情况定义网格的状态,结合网格的地理位置和网格负载状态选择路由网格;其次,根据节点剩余能量和负载大小在选择的网格内选取一个合适的节点开始数据的收发工作;最后,通过模拟实验将本文算法与GPSR算法和GEAR算法进行比较。仿真结果表明,该算法有效改善了网络的负载均衡,延长了网络的生存期,并提高了网络的吞吐量。 相似文献
6.
无线传感器网络WSN的路由存活概率云计算模型的优化设计可以提高WSN网络的网络复杂和数据吞吐量,在WSN网络的路由发射功率能耗具有匹配衰减特性,路由存活概率优化困难。传统方法采用灰色马尔可夫链组合模型进行存活概率预测,云计算精度不高。提出一种基于不变波束形成的WSN路由存活概率云计算优化模型,进行WSN网络云计算路由链路模型的结构设计,在WSN网络中进行任务节点信息表征,采用能量剩余度向量概率密度优化分配算法进行能量分配,把WSN的能量节点信号从阵元域变换到波束域得到阵列域,采用空间协方差矩阵逆的高阶次幂来逼近WSN的数据传输信号模型,将旋转角度控制在半功率主瓣以内,由此得到了云计算模型下WSN路由节点数据传输模型。仿真实验表明,该算法能提高WSN路由的存活概率,从而提高了WSN的吞吐量和通信能力,路由概率寻优中抑制了在WSN网络的路由发射功率能耗的匹配衰减性,通过最小的能量开销实现路由分发速率和负载效益的最大化。 相似文献
7.
基于链路同态解析的WSN路由选择算法 总被引：3，自引：0，他引：3
《科技通报》2015,(8)
通过优化无线传感器网络(WSN)的路由选择算法,实现负载均衡,节省WSN节点的能量开销。传统的路由选择算法使用基于汇聚节点随机链路分析的路由选择算法,控制网络中节点的密度实现路由选择,算法受到外界干扰较大,性能不好。提出一种基于链路同态解析的WSN路由选择算法。设计WSN节点的能量调度算法,提取网络传输的数据多路复用器输出端口的数据,找到经过最短路径数目最多的边并将它从网络中移除,采用能量剩余度同态解析模型,把WSN的能量节点变换到链路同态解析波束域中,实现WSN路由选择算法改进,实现WSN节点的能量调度,提高WSN的负载均衡能力。仿真结果表明,该算法能优化WSN的路由选择,节点的平均能量消耗最低,提高了WSN的可靠性和生存周期。 相似文献
8.
休眠机制是无线传感器网络中节省能量、提高网络寿命的主要方法之一,但同时也带来了端到端延迟性能的下降.尤其对于低占空比无线传感器网络,不同路由方法对网络性能特别是延迟性能的影响很大.提出一种基于随机调度的分布式逐跳路由方法:根据邻居节点的位置信息及其随机调度种子信息,在下一跳选择中以前进距离与延迟之比作为转发测度.理论分析和仿真结果显示.对比已有方法,该方法在端到端分组投递延迟和转发跳数方面具有优势. 相似文献
9.
10.
提出一种面向无线Ad Hoc与传感器网络的基于自适应能量阈值的按需节能组播路由协议EMRP.该协议能根据网络能量状态和节点保护比例,自适应地确定能量保护阈值.在按需构造组播路由树的过程中,该阈值抑制网络中能量过低的节点参与组播,从而实现网络能耗均衡.EMRP同时引入目标驱动的策略,以尽量减小组播结构的规模、降低组播代价.EMRP协议执行过程中,不要求节点保存任何全局或局部网络拓扑信息,开销低,实现简单.仿真结果表明,与已有工作相比,EMRP协议能大大降低组播路由的每分组传输能耗,显著延长网络寿命. 相似文献
11.
《Journal of The Franklin Institute》2017,354(11):4457-4480
Due to the hopeful application of gathering information from unreachable position, wireless sensor network creates an immense challenge for data routing to maximize the communication with more energy efficiency. In order to design the energy efficient routing, the optimization based clustering protocols are more preferred in wireless sensor network. In this paper, we have proposed competent optimization based algorithm called Fractional lion (FLION) clustering algorithm for creating the energy efficient routing path. Here, the proposed clustering algorithm is used to increase the energy and lifetime of the network nodes by selecting the rapid cluster head. In addition, we have proposed multi-objective FLION clustering algorithm to develop the new fitness function based on the five objectives like intra-cluster distance, inter-cluster distance, cluster head energy, normal nodes energy and delay. Here, the proposed fitness function is used to find the rapid cluster centroid for an efficient routing path. Finally, the performance of the proposed clustering algorithm is compared with the existing clustering algorithms such as low energy adaptive clustering hierarchy (LEACH), particle swarm optimization (PSO), artificial bee colony (ABC) and Fractional ABC clustering algorithm. The results proved that the lifetime of the wireless sensor nodes is maximized by the proposed FLION based multi-objective clustering algorithm as compared with existing protocols. 相似文献
12.
根据IEEE 802.11协议在链路层提供有限次数链路重传的特点,提出了一种在基于IEEE 802.11的移动Ad Hoc网络（MANET）中保证可靠通信的节能路由改进算法——ERRC（Energy-efficient Routing algorithm for Reliable Communication in IEEE 802.11-based MANET）,它可以方便地应用于MANET中现有的反应式路由协议。ERRC分析并建立了适合于IEEE 802.11情况的重传模型和能耗模型,提供了在发送数据分组时的功率控制机制,在节点选路时综合考虑了分组错误概率、节点代价函数的影响。仿真结果表明,ERRC算法可以显著提高网络生存期,在节省能耗方面比没有考虑分组错误概率的节能路由算法更为精确。 相似文献
13.
Jingwei Miao Omar Hasan Sonia Ben Mokhtar Lionel Brunie Kangbin Yim 《International Journal of Information Management》2013
Message routing in mobile delay tolerant networks inherently relies on the cooperation between nodes. In most existing routing protocols, the participation of nodes in the routing process is taken as granted. However, in reality, nodes can be unwilling to participate. We first show in this paper the impact of the unwillingness of nodes to participate in existing routing protocols through a set of experiments. Results show that in the presence of even a small proportion of nodes that do not forward messages, performance is heavily degraded. We then analyze two major reasons of the unwillingness of nodes to participate, i.e., their rational behavior (also called selfishness) and their wariness of disclosing private mobility information. 相似文献
14.
文章在分析比较了目前流行的几种无线传感器网络路由协议的基础上,结合灭火救援工作方面的特点和需求,提出了一种适用于灭火救援工作环境的网状拓扑结构的ZigBee无线传感器网络的路由算法,并从路由建立、路由维护、路由恢复等方面进行了详细描述。该路由算法对其它具有ZigBee网状拓扑结构的系统具有一定的参考价值。 相似文献
15.
16.
《Journal of The Franklin Institute》2022,359(5):2377-2402
Distributed target tracking is an important problem in sensor networks (SNs). In this paper, the problem of distributed target tracking is addressed under cyber-attacks for targets with discrete-time and continuous-time nonlinear dynamics. Two distributed filters are obtained for every node of the SN to estimate the states of a general class of nonlinear targets which can be seen in many practical applications. Compared with the existing results in the literature, the network topology of the SN is assumed to be subjected to the denial-of-service attack such that the communication links among sensor nodes are paralyzed or destroyed by this kind of attack. Moreover, the proposed algorithms are designed based on an event-triggered communication strategy that means the frequency of information transmission and unnecessary resource consumption are significantly reduced. The presented algorithms’ stability is also analyzed in the presence of noise to achieve secure event-triggered target tracking in mean-square. Two simulation examples are utilized to demonstrate the efficiency of the proposed event-triggered algorithms. 相似文献
17.
由于无线网状网具有多网卡多信道，节点移动性低等特性，使用传统的基于最短路径的移动Ad Hoc网络路由协议并不能获得良好的性能。为此本文提出了一种新的无线网状网路由协议――MEIL算法，通过引入链路干扰度，节点负载度等概念，综合考虑了无线信道的丢包率，链路干扰以及节点的负载等多种重要因素，来确定路由判据，选择链路质量好、干扰小、负载轻的路径来传输数据，有效地提高了网络吞吐量。仿真结果表明，MEIL算法比AODV路由协议和DSDV+ETX算法更适用于无线网状网，在各种业务环境下其吞吐量，时延，到达报文量等性能均具有更好的效果。 相似文献
18.
目前无线传感器网络中,大多数定位算法需要节点间的距离信息,这些方法有很多弊端.提出一种不需要节点间距离的定位方法,可以避免上述弊端.该方法只需要2个锚节点,且锚节点的位置任意.仿真结果显示该方法有较好的性能. 相似文献
19.
《Journal of The Franklin Institute》2006,343(4-5):389-403
Appropriate routing in data transfer is a challenging problem that can lead to improved performance of networks in terms of lower delay in delivery of packets and higher throughput. Considering the highly distributed nature of networks, several multi-agent based algorithms, and in particular ant colony based algorithms, have been suggested in recent years. However, considering the need for quick optimization and adaptation to network changes, improving the relative slow convergence of these algorithms remains an elusive challenge. Our goal here is to reduce the time needed for convergence and to accelerate the routing algorithm's response to network failures and/or changes by imitating pheromone propagation in natural ant colonies. More specifically, information exchange among neighboring nodes is facilitated by proposing a new type of ant (helping ants) to the AntNet algorithm. The resulting algorithm, the “modified AntNet,” is then simulated via NS2 on NSF network topology. The network performance is evaluated under various node-failure and node-added conditions. Statistical analysis of results confirms that the new method can significantly reduce the average packet delivery time and rate of convergence to the optimal route when compared with standard AntNet. 相似文献
20.
In this paper, the state estimation problem for discrete-time networked systems with communication constraints and random packet dropouts is considered. The communication constraint is that, at each sampling instant, there is at most one of the various transmission nodes in the networked systems is allowed to access a shared communication channel, and then the received data are transmitted to a remote estimator to perform the estimation task. The channel accessing process of those transmission nodes is determined by a finite-state discrete-time Markov chain, and random packet dropouts in remote data transmission are modeled by a Bernoulli distributed white sequence. Using Bayes’ rule and some results developed in this study, two state estimation algorithms are proposed in the sense of minimum mean-square error. The first algorithm is optimal, which can exactly compute the minimum mean-square error estimate of system state. The second algorithm is a suboptimal algorithm obtained under a lot of Gaussian hypotheses. The proposed suboptimal algorithm is recursive and has time-independent complexity. Computer simulations are carried out to illustrate the performance of the proposed algorithms. 相似文献