基于负载均衡的簇间路由协议

针对无线传感器网络簇头节点负载不均衡的问题,提出一种基于负载均衡的簇间路由协议.该协议通过记录邻居簇头节点到Sink节点的最小跳数信息建立到Sink节点的多条路径,根据簇节点的剩余能量和负载选择合适的路径进行路由,从而实现了簇头节点间的负载均衡.仿真实验结果表明,该路由协议能有效地均衡网络负载和簇头节点能量消耗,减少数据传输延迟,延长网络生存时间.     

无线传感器网络中基于能量效率的多路径路由算法

针对无线传感器网络节点能量受限的特点,本文提出了一种能量有效、负载均衡的多路径路由算法(EMR)。该算法在按需路由协议AODV基础上,不单纯以最小跳数或者最小时延作为路由选择依据,充分考虑到了路由的能量消耗最小化,避开剩余能量过低的节点,数据沿着最小跳数或路径关键能量比较高的路径传输,降低了网络的能量消耗,也避免关键节点的过量负载。分析与仿真结果表明,与AODV协议相比较,EMR具有更好的分组投递率、端到端时延,推迟了网络中出现死亡节点的时间,从而延长了网络生命周期。     

基于能量感知的AODV路由协议

AODV协议是基于最小跳数的,而没有考虑节点的剩余能量,这就容易使某些节点过早的死亡。针对这一问题,结合能量有效路由,提出了一种基于能量感知的AODV协议(AODV-EA)。新考虑了节点的剩余能量,在路由建立过程中,中间节点转发路由请求RREQ时,延迟一个与能量成反比的时间,这就最大可能地选择了路径中节点能量大的路径。仿真结果表明:改进的协议与原协议相比,推迟了节点的死亡时间,降低了丢包率。     

一种基于剩余能量和负载的AODV路由协议

移动自组网中的按需距离矢量路由协议(AODV)是基于最小跳数的,没有考虑能量消耗均衡及网络生命周期的问题,造成某些节点过早死亡。针对这一问题,提出了一种基于剩余能量和节点缓存队列负载的路由协议,有效地避免了能量较低和负载较重的节点参与路由。仿真实验结果表明,所提出的新协议有效地减少了端对端平均延时,延长了网络生命周期。     

一种适用于无线多媒体传感器网络的节点不相交多路径路由协议

设计了一种适用于无线多媒体传感器网络的高效节点不相交多路径路由协议.以源路由的方式建立多路径,中间节点通过有选择的转发RREQs,降低路由建立开销.将链路质量量化为数据接收率,利用数据接收率、节点能量及路径跳数等,定义了路径效率模型,将路径效率模型引入到路由建立过程中.仿真结果表明,与SMR及TinyONDMR协议相比,新协议建立路由的开销更低,所建路径上节点能量分布更理想,进行数据传输时的能量效率更高,同时不会显著增加路径的传输时延.     

一个基于能量消耗的域路由协议

针对移动Adhoc网络环境,基于节点能量消耗速度提出了一个新的域路由协议EZRP。该协议中定义了一个有关节点剩余生命期与路由路径跳数的函数,并以该函数值作为路由选择参数进行最优路径的选择,从而使能量充足的节点获得更多参与通信的机会。该协议对网络中节点的能量消耗起到了很好的平衡作用,从而使网络生命期更长。基于NS-2网络模拟器,对该协议与ZRP协议进行了模拟实验,实验结果表明。该协议的节点死亡个数少,网络路由负载小,网络运行时间长。     

井下带状环境中无线传感器网络路由协议研究

针对用于井下矿压监测系统的无线传感器网络节点呈带状静态分布的特点,以最小跳数路由协议为研究对象,对其路由创建阶段、数据传输阶段、维护更新阶段进行改进,提出了一种节点能量分级的最小跳数路由协议。该路由协议通过对节点能量分级处理的方式,减少了控制分组和数据传输路径的冗余量。仿真结果表明,该路由协议的网络生存期、数据分组平均端到端时延以及控制分组百分比较传统的定向扩散协议及最小跳数路由协议有明显改善。     

无线传感器网络中一种负载均衡的跳跃式路由协议

如何实现能量的高效利用,延长网络的生命周期一直是无线传感器网络研究的热点.在传统的路由协议中,靠近基站的节点由于要转发其它节点的数据容易过早耗尽能量而失效.本文基于传感器节点传输功率可调这一假设,提出了一种负载均衡的跳跃式路由协议(LBR).协议中每个节点维护K跳的路由表.在需要发送数据时,剩余能量较少的节点将数据发送给下一跳节点,而剩余能量较多的节点可以跨越多跳进行数据传输.从而均衡了节点的能量消耗.模拟结果表明,采用该协议建立的路由,不仅具有延时小,数据传送的路径长度短,维护简单等优点,并且能够改善网络的负载均衡,极大地延长网络的生命周期.     

无线传感网络能量有效负载均衡的多路径路由策略

由于无线传感网络中网络节点的能量受限性,路由成为最受关注的问题.鉴于多路径传输既要考虑能量节约,又要考虑负载均衡,提出了一种新型能量有效负载均衡的多路径路由算法.该算法综合考虑了路径的跳数、节点剩余能量和网络的能量状况,数据沿着最小跳数或路径关键能量比较高的路径传输,降低了网络的能量消耗,也避免关键节点的过量负载.实验结果验证了和传统的AODV算法相比该算法在分组投递率、端到端时延和死亡节点出现的数量方面的优势.     

移动自组织网络路由协议的节能策略

本文针对移动自组织网绍环境,基于节点能量消耗速度提出了一个新的改进的AODV路由协议。该协议定义了一个有关节点剩余生命期与路由路径跳数的函数,并以该函数值作为路由选择参数进行最优路径的选择,从而使能量充足的节点获得更多参与通信的机会。该协议对网络中节点的能量消耗起到了很好的平衡作用,从而使网络生命期更长。基于NS-2网络模拟器,对该协议与AODV协议进行了模拟实验,实验结果表明。该协议的网络路由负载小,网络运行时间长。     

基于能量消耗的网格路由协议

基于移动AdHoc网络环境中的节点能量消耗速度,提出一种新的网格路由协议。定义一个计算节点能量消耗速度的函数,以该函数值为路由参数,结合Floyed算法进行最优路径选择。与原有协议的比较结果表明,该协议可以降低节点能耗,延长网络生命周期。     

An efficient hop count routing protocol for wireless ad hoc networks

An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.     

An Efcient Hop Count Routing Protocol for Wireless Ad Hoc Networks

An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.     

MANET中一种新QoS路由技术的研究

移动AdHoc网络（MANET）支持QoS保证的能力,受限于无线介质的带宽和节点的移动特性。由于节点的移动,网络拓朴频繁发生变化,一旦节点移动,当前的路由就很容易失效,从而造成通讯中断,这种情况就是链路失效。QoS路由是MANET获得端到端QoS保证的第1步。然而,拓朴变化造成的链路失效状况的存在,使得路由的可靠性对于QoS路由而言非常重要。为使链路失效造成的影响最小,找到生存时间长并且可靠性高的路由就显得尤为重要。提出了一种在MANET中支持Oos路由,并能较好解决链路失效状况的方案。该方案定义了一种新机制,在执行时类似表驱路由协议,通过利用主路径上被共享的邻居节点信息,为主路径上各个独立的子路径预备了可替换的路径。     

Enhancing DSR maintenance with power awareness

A power-aware route maintenance protocol for Mobile Ad Hoc Networks (MANETs) is introduced. Termed Dynamic Path Switching (DPS), the new protocol puts an overloaded node to sleep before a route link breaks because that node runs out of energy, and brings other suitable nodes into play instead. When the battery charge of a node reaches a stated level, the node can advance a request to change to a sleep state for a while. The request is honoured unless survival of some path rests on the forwarding activity of that very node. All nodes are assumed to be collaborative. The DPS protocol is fully backward compatible, as it can be implemented within existing routing protocols such as Dynamic Source Routing (DSR). The new protocol has been extensively simulated with the established network simulator NS2. The findings indicate a much improved power awareness of the updated routing protocol with respect to the unadorned one. Power saving is particularly effective during long-lived sessions.     

无线传感器网络优化路由树构造算法

针对无线传感器网络使用洪泛建立路由树时,传统的碰撞退避机制和路由树构造策略容易造成消息剧烈碰撞、路由容易瘫痪和建立非优化路由树等问题,提出了无线传感器网络优化路由树构造算法。算法定义路由有效期、父节点优先级队列,并结合跨层设计思想,修改MAC退避算法,提出交叉退避窗口策略,并经仿真实验证明能够有效地构造出较优的路由树。     

基于信号功率随机衰落模型的无线传感器网络干扰感知路由

为了降低无线传感器网络信号功率的衰减以及节点干扰对数据传输效率所造成的影响,提出了一种基于信号功率随机衰落模型的无线传感器网络干扰感知路由。首先,根据概率论提出了干扰节点不同分布情况下成功传输数据的两种概率干扰模型,并将节点的干扰、路由收敛及节点剩余能量问题作为路由度量建立了干扰感知路由;然后,通过将干扰、路由收敛,以及节点剩余能量作为评估权值,来共同决定最佳的下一跳节点。通过NS2的仿真数据表明,与基于差异化服务的干扰感知路由算法和基于编码的干扰感知路由协议相比,所提出的算法在数据投递平均成功率、能量消耗及平均延迟时间上均有一定优势。     

Incentive-based control of ad hoc networks: A performance study

Ad hoc networks are self-configuring networks of mobile nodes, connected by wireless links. If a destination node is beyond the transmission range of an origin node, then the nodes must cooperate to provide a multi-hop route. Any node can act as a sender, receiver or transit node. It is clear that it is in a node’s interest to be a sender or receiver, but it is less clear what the value is of forwarding traffic on behalf of other nodes. The nodes should therefore be given incentives to act as transit nodes, otherwise the network would fail to function. A way to do so is by introducing for each node a credit balance, where nodes use credits to pay for the costs of sending their own traffic, and earn credits by forwarding traffic from other nodes.However, nodes that are located near the edge of the network will attract little transit traffic and earn few credits. In contrast, nodes located near the centroid of the network will attract transit traffic and earn credits. We investigate various ways of providing nodes near the edge of the network with preferential treatment in order to improve their credit balance and their throughputs.We next focus on the situation where each node can move to improve its utility expressed in terms of either credit balance or throughput. Here radio interference plays an important role, as it defines an interesting trade-off: nodes may prefer to be close together in order to reduce the power needed to transmit data, but on the other hand proximity increases radio interference, and has therefore a negative effect on connectivity. Simulation experiments reveal that the positions of the nodes converge to non-trivial optimal positions on 2D and 3D surfaces.     

Active route-maintenance protocol for signal-based communication path in ad hoc networks

Ad hoc wireless networks consist of mobile hosts in a network without base stations, and are characterized by a highly dynamic network topology. The network topology changes frequently due to host migration, signal interference and power outages, making routing maintenance a challenging consideration in designing routing protocols. This study presents an active route-maintenance protocol to prevent the current route from disconnecting. Monitoring the signal strength and stability of individual hosts allows the active node, which causes the route to have a weak connection, to issue actively a route-reestablishment instruction for selecting one of its neighbors as a candidate of active node. An enhanced active route-maintenance protocol is also proposed to reduce the probability of route breakage and enhance the route's efficiency. Performance simulation reveals that the proposed route maintenance protocol effectively reduces both the overhead and route maintenance, and alleviates route-breakage.     

无线传感器网络的能量有效性控制策略 ——最小跳数和功率自适应

提出了一种适用于无线传感器网络的能量有效性控制策略——最小跳数和功率自适应的混合使用方法。该能量控制策略在无线传感器网络的两个阶段实现：在任务感知阶段,一方面Sink节点通过最小跳数的算法洪泛感知任务建立路由,并根据路由信息建立可能的备份路由,另一方面在建立的路由基础上采用基于二分查找的功率自适应算法确定各个网络节点的最佳发射功率;在感知数据交付阶段,根据任务感知阶段确定的路由和发射功率进行数据传输。通过对最小跳数算法和基于二分查找的功率自适应算法的分析和实验,表明该能量控制策略可以很好地减少能量的开销。