无线传感器网络路由中的能量预测及算法实现

基于无线传感器网络中路由协议高效合理利用能量的要求,提出一种基于剩余能量预测的地理位置路由(EPGR,energy prediction and geographical routing)算法。算法通过建立传感器网络节点运作模型,及相邻节点剩余能量预测机制,优化路由选择。仿真和分析表明,EPGR算法能够有效地优化数据传输路径,均衡传感器网络节点的能量消耗,延长网络寿命。     

面向智慧园区的WSN路由优化算法

为解决智慧园区中无线传感器网络(WSN)的能耗不均衡问题,构建了路由代价函数,并提出了一种新的能耗均衡路由算法.该算法结合智慧园区中无线传感器网络的特点,综合考虑节点地理位置和剩余能量来构建路由代价函数.传感器节点通过选择其邻居节点中路由代价最小的节点进行数据转发.仿真结果表明,该算法可以有效节约网络能耗,同时延长了网络的生命周期.     

一种基于Dijkstra+策略的路由空洞算法GEAR+

针对无线传感器网络中地理位置和能量路由(GEAR)算法可能产生的路由空洞问题,GEAR算法通过改变自身和邻居节点的代价来解决问题,但同一节点可能会再次遇到同一路由空洞.文中提出了一种基于Diikstra+策略的路由空洞GEAR+算法可以避免上述问题.仿真分析表明,该算法在平均能量消耗和节点发送数据分组的数量上都优于GEAR算法.     

一种基于地理位置信息的无线传感器网最小能耗路由算法

提高能量有效性是无线传感器网络(WSN)设计的主要目标之一,采用能量有效路由协议是提高WSN能量有效性的一种重要手段。该文提出了一种面向无线传感器网络的最小能耗(MEC)路由算法GLB-DMECR。该算法采用了新颖的MEC路由思想,即利用理想的最小能耗路径来引导路由选择过程,从而发现实际的MEC路径;该算法采用分布式、基于局部网络状态信息的路由决策机制,具有良好的稳定性和可扩展性;该算法充分挖掘了节点地理位置信息在路由中的效用,利用地理位置信息实现路由而不需要网络付出过多的额外代价。该算法具有较低的实现复杂度。仿真结果说明, 其最小能耗性能在非常广的网络环境下要优于或等同于现有典型同类算法。     

一种行进启发式节省能量的地理位置路由

文章首先介绍了基于地理位置的路由协议和它的优势,提出一种行进启发式节省能量的协议,基于贪婪算法和一种能量算法,采取提前绕洞机制,合理有效地解决了路由空洞问题。缩短了路由的路径长度,使得网络中节点消耗的能量尽可能平均,从而进一步延长了传感器网络的生命周期。     

能量感知非均匀成簇路由优化算法

无线传感器网络(WSN)具有的能量有限,其能量利用效率的高低直接影响着网络的生命周期.为了提高无线传感器网络的能量利用效率,提出了一种能量感知非均匀成簇路由优化算法(Energy Awareness Unequal Clustering Routing Optimization Algorithm,EUCR).该算法通过节点在网络中所处的位置确定各节点的邻居节点,并以局部能量选举簇头,各簇头根据其邻居节点构建非均匀分簇网络.同时该算法在路由阶段考虑了簇头的剩余能量和转发代价.仿真结果表明,EUCR算法能有效提高网络的能量利用效率,并延长网络的生命周期.     

无线传感器网络基于梯度的分簇路由算法

无线传感器网络中节点的能量是有限的,而且一般不能补充能量.所以如何最大化节点能量的利用率,延长整个传感器网络的生命周期,一直是无线传感器网络的一个研究热点.本文针对Leach路由算法的不足,提出一种新的基于能量考虑的梯度分簇路由算法.最后通过OMNET++仿真试验,来验证新的路由算法的优越性.     

无线多媒体传感器网络QoS区分 服务路由机制

 无线多媒体传感器网络中多种类型数据并存,服务质量需求各异,因此如何提供服务质量保障机制是无线多媒体传感器网络研究领域的重点问题.本文提出了一种基于角度的区分服务路由算法,在该算法中,网络节点将各自的邻居节点按其偏转角度进行分类,为不同需求的数据流选择不同的转发区域,并结合邻居节点的地理位置、单跳通信负载、剩余能量等信息完成各数据流的区分路由.仿真结果表明,该算法在多媒体数据流传输的延迟、抖动、丢包率以及能耗等性能上均要优于已有算法.     

一种有效的稀疏无线传感器网络路由方案

稀疏无线传感器网络中节点之间距离过远,使得移动代理节点成为最有效的数据收集方式,然而移动代理节点由于能量限制无法在一次数据收集中到达网络所有节点进行数据收集.为保证在能量受限的移动代理节点总路由路径最短,给出了一种稀疏无线传感器网络能量受限移动代理节点的路由方案.首先构建移动代理节点的路由数学模型,然后根据移动代理节点初始能量将无线传感器网络划分成不同的子集,最后采用旅行商人问题的模拟退火算法计算出每个子集最短路由,全部子路由的集合即最优路由.仿真及其分析结果表明:随着网络节点个数增多和移动代理节点能量增大,所给方案的总路由能够比较接近于理想情况,在实际应用中比较有效且适于推广.     

基于定位的超宽带传感器网络路由算法研究

超宽带定位技术应用于移动传感器网络路由算法是目前研究热点,该文提出一种基于超宽带定位的源动态路由算法,通过超宽带定位建立网络拓扑,并根据节点移动速度来反映节点的移动效应;通过受限泛洪和移动预测两种路由机制来提高路由性能.仿真结果表明,该算法能提高移动节点的路由成功率,降低路由平均延时.     

Energy-efficient location services for mobile ad hoc networks

Location-based routing protocols are stateless since they rely on position information in forwarding decisions. However, their efficiency depends on performance of location services which provide the position information of the desired destination node. Several location service schemes have been proposed, but the most promising among them, hierarchical hashing-based protocols, rely on intuitive design in the published solutions. In this paper, we provide full analysis of the efficiency of routing in hierarchical hashing-based protocols as a function of the placement of the routers. Based on the theoretical analysis of the gain and costs of the query and reply routing, we propose a novel location service protocol that optimizes the distance traveled by the location update and query packets and, thus, reduces the overall energy cost. These gains are further increased in the second presented protocol by the optimal location of servers that we established through analysis of geometrical relationships between nodes and location servers. Simulation results demonstrate that the proposed protocols achieve around 30–35% energy efficiency while improving or maintaining the query success rate in comparison to the previously proposed algorithms.     

一种位置信息辅助的Ad Hoc网络按需距离矢量路由协议

 针对Ad Hoc网络中按需距离矢量路由协议路由开销大,以及位置路由中位置信息在获取方式上存在的缺点,提出一种位置信息辅助的按需距离矢量路由协议(LAODV),协议结合AODV以按需的方式获取网络节点的位置信息,并以泛洪、位置信息修正的贪婪转发和局部受限泛洪相结合方式进行路由发现,同时提出了路由维护策略和局部多径备份路由策略。仿真结果表明,LAODV能够获得较好的分组递交率、时延和路由开销性能。     

Energy Efficient Location Error Resilient Connectivity in Wireless Sensor Networks

Geographic routing for realistic conditions is often permeated with localization errors resulting in poor performance and high energy consumption. We propose a simple yet novel geographic routing method to accomplish routing in the presence of location and channel errors. In this algorithm, it is proposed that next hop node is selected based on the combined probability of distance, estimated location error and estimated channel access probability associated with neighbor nodes. The metrics observed for performance were the successful packet delivery rate and the energy consumed. Our algorithms performance is better compared to greedy forwarding techniques of algorithms such as Greedy routing scheme (GRS) and geographic random forwarding (GeRaF). Simulations show the throughput for our algorithm is better compared to others along with reducing the energy wasted on lost packets.

     

基于粒子滤波步行长度预测的移动ad hoc网络路由算法

针对移动ad hoc网络拓扑结构变化大、路由复杂度高、数据传输性能低等问题,提出了一种新的移动通信系统自适应路由算法。为了使得网络拓扑结构更接近移动网络间歇性连接的特点,该算法在网络结构上采用了一种改进的Levy Walk移动模型。采用一种粒子滤波步行长度预测的方法,通过蒙特卡罗抽样得到递归贝叶斯滤波器,并在粒子滤波后进行步行长度预测,确定消息的副本数量,从而减少由于节点转发过多消息副本带来的能量消耗量,提高消息的传递效率。实验仿真结果表明：与基于改进蚁群优化和利润优化模型的路由算法相比,该算法的消息传递成功率分别提高了0.08和0.04,节点平均能量效率提高了17.9%和13.4%,在提升数据传输成功率和节能上具有较好效果。     

一种无线传感器网络性能评估及优化方法

 文章提出了一种无线传感器网络性能评价及优化方法,以单位能耗所支持的平均数据速率为量度,分析了路由策略、接入机制及物理层传输技术对网络性能的综合影响。在讨论单跳分组成功传输概率、时延的基础上,将问题拓展至多跳网络,对网络端到端分组成功传输概率、耗时、耗能进行了统计分析,导出了单位能耗所支持的平均数据速率的表达式,并依此对网络性能进行了仿真研究。结果表明：网络性能可以通过优化分组发送概率和编码纠错能力的方法得到较大改进。     

Hash-Based Virtual Hierarchies for Scalable Location Service in Mobile Ad-hoc Networks

A location service is an essential prerequisite for geographic routing protocols for MANETs. We present VHLS, a new distributed location service protocol, that features a dynamic location server selection mechanism and adapts to network traffic workload, minimizing the overall location service overhead. We demonstrate that the ratio of location queries to updates is an important performance parameter in such protocols. Our analysis and simulations show that VHLS provides better query success rates, location service quality, and geographic routing performance than the GLS and GHLS protocols. VHLS also scales well as the network size and traffic workload increases.     

基于地理位置的无线传感器网络路由协议

基于地理位置的路由协议是无线传感器网络路由协议研究的一个重要方向。利用位置信息指导路由的发现、维护和数据转发,能够优化路径选择,减少路由能耗,实现网络的全局优化。从限制洪泛机制、虚拟分区机制、最优路由确认机制3个方面,可以看出地理位置信息在路由协议中的重要性。     

基于洪泛的物联网位置服务算法

在物联网位置服务中,移动执行器发送位置更新消息,而固定传感器发送搜索消息,来学习执行器的最新位置。其目标是实现更新和搜索消息组合成本最小化,并最大限度地提高寻找目标执行器的成功率,随后将数据包路由到该目标执行器。分析了物联网位置服务的基本要求,介绍了物联网位置服务的主要类型,描述了三种先应式位置服务算法(倍增圆更新、基于方向的更新和基于地理路由的更新)和两种反应式位置服务算法(请求区搜索和扩展环搜索)的工作原理。     

Predictive and Fault-Tolerant Location Service in Mobile Ad Hoc Networks

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks (MANETs). One of the biggest challenge in geographic routing protocols is the design of efficient distributed location services that can locate the positions of mobile nodes. The accurate positioning of mobile nodes in MANETs is important to location service scheme since they are related to efficiency of routing protocols. We propose a grid-based predictive Location Service (GPLS) scheme and a hole-tolerant grid-based predictive Location Service (GPLS-H) scheme. In proposed location service scheme GPLS and GPLS-H, the network is partitioned into grids and grids are divided into groups by using a HASH function, which guarantees the uniform distribution of location servers of a node in the network. The main contribution of this paper is that the proposed location service scheme GPLS and GPLS-H provide accurate location query capability by means of location prediction of mobile nodes and GPLS-H can tolerate the “holes” in grid networks. The simulation results show that the location service scheme GPLS and GPLS-H have better performance than CRLS and SLURP in query success ratio, query delay and location availability.     

Multi-objective fractional artificial bee colony algorithm to energy aware routing protocol in wireless sensor network

Due to the promising application of collecting information from remote or inaccessible location, wireless sensor networks pose big challenge for data routing to maximize the communication with more energy efficient. Literature presents different cluster-based energy aware routing protocol for maximizing the life time of sensor nodes. Accordingly, an energy efficient clustering mechanism, based on artificial bee colony algorithm and factional calculus is proposed in this paper to maximize the network energy and life time of nodes by optimally selecting cluster-head. The hybrid optimization algorithm called, multi-objective fractional artificial bee colony is developed to control the convergence rate of ABC with the newly designed fitness function which considered three objectives like, energy consumption, distance travelled and delays to minimize the overall objective. The performance of the proposed FABC-based cluster head selection is compared with LEACH, PSO and ABC-based routing using life time, and energy. The results proved that the proposed FABC maximizes the energy as well as life time of nodes as compared with existing protocols.