Signal strength based routing for power saving in mobile ad hoc networks

The transmission bandwidth between two nodes in mobile ad hoc networks is important in terms of power consumption. However, the bandwidth between two nodes is always treated the same, regardless of what the distance is between the two nodes. If a node equips a GPS device to determine the distance between two nodes, the hardware cost and the power consumption increase. In this paper, we propose using a bandwidth-based power-aware routing protocol with signal detection instead of using GPS devices to determine the distance. In our proposed routing protocol, we use the received signal variation to predict the transmission bandwidth and the lifetime of a link. Accordingly, the possible amount of data that can be transmitted and the remaining power of nodes in the path after data transmission can be predicted. By predicting the possible amount of data that can be transmitted and the remaining power of nodes after data transmission, we can design a bandwidth-based power-aware routing protocol that has power efficiency and that prolongs network lifetime. In our simulation, we compare our proposed routing protocol with two signal-based routing protocols, SSA and ABR, and a power-aware routing protocol, MMBCR, in terms of the throughput, the average transmission bandwidth, the number of rerouting paths, the path lifetime, the power consumed when a byte is transmitted, and the network lifetime (the ratio of active nodes).     

Bandwidth-based routing protocols in mobile ad hoc networks

In this paper, we propose a high performance routing protocol and a long lifetime routing protocol by considering the fact that the bandwidth between two mobile nodes should be different when distances are different. In the high performance routing protocol, to reduce the number of rerouting times, we take the bandwidth issue into account to choose the path with the capability to transmit the maximum amount of data with the help of the GPS. With exchanging the moving vectors and the coordinates of two adjacent mobile nodes, the possible link lifetime of two adjacent mobile nodes can be predicted. Subsequently, a path with the maximal amount of data transmission can be found. With regard to our proposed long lifetime routing protocol, to maximize the overall network lifetime, we find a path with the maximal remaining power after data transmission. With the link bandwidth and the desired amount of data transmitted, the consumption power is computed to obtain the remaining power of a mobile node. Accordingly, we can choose the path with the maximal predicted remaining power to maximize the overall network lifetime. In the simulation, we compare our high performance routing protocol with the AODV and LAWS in terms of throughput, rerouting (path breakage), and route lifetime. With respect to power consumption, we compare our proposed power-aware routing protocol with the POAD and PAMP in terms of the overall network lifetime and the ration of survival nodes to the all nodes.     

无线Ad Hoc网络中基于时间广播的功率感知路由

提出了一种TBPR(time-based broadcasting for power-aware routing)协议.TBPR采用路由请求报文延迟发送机制,并通过比较路径中的累计功率消耗,选择能量消耗较低的路由,以降低网络的能量消耗,延长网络的生存周期.计算机仿真实验表明,TBPR能够取得较好的节能效果,并降低无线AdHoc网络中的能量消耗.     

Enhanced AODV routing protocol for Bluetooth scatternet

Bluetooth is one of the most widespread technologies for personal area networks that allow portable devices to form multi-hop Bluetooth ad hoc networks, so called scatternets. Routing is one of the challenges in scatternets because of its impact on the performance of the network. It should focus on reducing the power consumption in the network because most of the nodes are battery-operated portable devices. In this paper, we propose a routing protocol for Bluetooth scatternets that customizes the Ad hoc On-Demand Distance Vector (AODV) routing protocol by making it power-aware and suitable for scatternets. It enhances the AODV flooding mechanism by excluding all non-bridge slaves from taking apart in the AODV route discovery process. In addition, it improves the AODV route discovery phase by considering the hop count, the predicated node’s power, and the average traffic intensity for each node as metrics for best route selection. By removing HELLO packets, our protocol reduces the control packets overhead and the power consumption in network devices. Simulation results show that the proposed protocol achieved considerable improvements over other enhanced AODV protocols by increasing the data delivery ratio by 10.78%, reducing the average end-to-end delay by 8.11%, and reducing the average energy consumption by 7.92%.     

一种基于部分网络编码的无线网络机会路由算法

结合机会路由和网络编码两项新技术各自的优势,提出了一种新的基于部分网络编码的机会路由算法(Opportunistic Routing Algorithm for Wireless Network Based on Partial Network Coding,ORAPNC)。为了避免数据包分叉传输,同时利于执行转发节点间协调机制,ORAPNC首先以期望传输次数作为路由度量建立一条固定路由,并将候选转发节点集中在这条固定路径附近;为了充分减小网络中的冗余数据包,ORAPNC采用一种新的转发节点间协调机制(Forwarding Nodes Coordination Mechanism,FNCM)来实现每跳的数据包传输。仿真结果表明,与其他相关路由协议相比较,ORAPNC可以有效提高网络吞吐量,减小目的节点解出原始数据包的平均时延。     

A new wireless ad hoc multicast routing protocol

An ad hoc network is a multi-hop wireless network of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and mobility require that ad hoc routing protocols be robust, simple, and energy conserving. This paper proposes a new ad hoc multicast routing protocol called neighbor-supporting multicast protocol (NSMP). NSMP adopts a mesh structure to enhance resilience against mobility. And NSMP utilizes node locality to reduce the overhead of route maintenance. NSMP also attempts to improve route efficiency and reduce data transmissions. Our simulation results show that NSMP delivers packets efficiently while substantially reducing control overhead in various environments.     

认知无线电网络中QoS组播路由调度

在多跳认知无线电网络中,组播的信息通常要经由多个中间节点的转发才能到达最终的目的节点。现有的研究中已经有很多的组播路由协议,然而这些协议都是基于传统无线网络的,并不适合新型的认知无线电网络。本文解决的的问题是:在多跳无线网络中,给定一个具有QoS要求的组播请求,如何建立组播路由以及对路径节点进行传输调度,使得在满足QoS要求下整个传输过程的带宽消耗最小。本文提出了一个分布式的组播路由协议来解决该问题,该协议不仅实现了路由过程的建立,同时还完成了对节点传输过程的合理调度。实验结果证明本文的传输调度策略能有效地减少网络的带宽消耗,同时增加组播请求响应的成功率。     

基于云安全模型的簇状树形无线传感器网络路由协议

由于传统的簇状树形无线传感器网络路由协议簇首能耗方差较大,导致存活节点数量和节点剩余能量较少,降低了无线传感器网络的使用寿命,为此设计一种基于云安全模型的簇状树形无线传感器网络路由协议。通过计算簇状树形无线传感器网络在接收与发送数据时的传输能耗,利用云安全模型获取云安全态势各种要素之间的不确定关系,预测节点的综合信任值,以预测结果为基础,采用蚁群算法获取分区节点的最优路径,完成簇状树形无线传感器网络路由协议。实验结果表明,本文设计的路由协议簇首能耗方差较小,存活节点数和节点剩余能量更多,接收数据包量比其他2种协议分别高出了48.1%和22.6%。由此可见,本文设计的路由协议延长了簇状树形无线传感器网络的使用寿命。     

一种在Ad Hoc网络中基于地理位置的节约能量的组播路由算法

在移动adhoc网络中,设计节约能量的组播路由算法是非常重要的,这是由于网络中的节点运行时所需要的能量来自于电池的有限供给。由于节点是可以移动的,这就要求节约能量的路由协议在本质上是分布式的,对于当前的节点状态是自适应的。论文提出一种基于地理位置的节约能量的组播路由算法,使得在满足带宽的同时,组播的能量消耗尽可能的少。其基本思想是:先由基本的组播算法生成一棵组播树,然后由组播树的每个非叶子节点根据其邻居节点的地理位置,动态地选择一些转发点,通过这些点以较小功率转发时可节约能量,以此优化组播树。     

MANET典型路由协议的性能分析与仿真

移动Ad Hoc网络(MANET)是由一组无线移动主机组成的一个没有任何事先建立好的基础设施或集中管理设备的临时网络,其特点是网络拓扑易变,带宽、能源有限及容易受到攻击等。该文对AODV, DSR, DSDV这几种典型的路由协议进行分析比较,指出它们的优缺点及适用场合。通过2个场景的配置,从路由开销、分组投递率、端到端的平均时延3个方面进行实验。仿真结果表明,按需路由协议在3个方面都表现出较好的性能。     

移动Ad Hoc网络中基于剩余生存时间的链路稳定性路由协议

在移动Ad Hoc网络中,链路的稳定性是网络性能的保证。提出一种基于剩余生存时间的链路稳定性路由协议—RLT-LSRP,该协议中当节点检测到分组接收功率小于某一阈值时,依据分组接收功率的变化来区分节点间相对运动的趋势,结合节点的动态属性和三角形几何定理,选择链路剩余生存时间最长的路径进行数据转发,在链路断开之前提前启动路由修复机制。实验结果表明:RLT-LSRP协议能够有效地减少路由失效次数,增强路由的稳定性,延长网络的生存时间。     

基于萤火虫群优化的Ad Hoc网络路由协议

针对Ad Hoc网络拓扑结构多变、网络生存时间受限及数据包分组传输效率低下等问题,本文借鉴萤火虫群优化算法的思想,提出了一种基于萤火虫群优化的Ad Hoc网络路由协议。路由协议用萤火虫优化算法的荧光素强度的更新规则与无线自组网络中的节点移动速度、拥塞程度、节点剩余能量及节点间的距离等因素相互映射,改进萤火虫群优化算法中的搜索萤火虫、驻留萤火虫及回溯萤火虫用于完成Ad Hoc网络中路由协议的路由发现、路由选择及路由维护等过程,整个协议无须传送大量的控制分组,即可实现Ad Hoc网络的稳定。仿真实验结果表明,与AODV及基于蚁群优化的路由算法AntRouting协议相比,本文所提出的路由协议在端到端延时、分组数据传输率及网络生存时间上均有良好的性能。     

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.     

有效能量空洞避免的无线传感器网络混合多跳路由算法

针对在无线传感器网络(WSN)的分簇路由算法中,节点之间能量消耗不均衡容易引发"能量空洞"现象的问题,在研究平面和层次路由协议的基础上,提出了一种有效能量空洞避免的混合多跳路由算法。首先,引入热点区域划分的概念对监测区域进行划分;然后,在分簇阶段,对热点区域外的节点采用非均匀分簇结构,融合簇内数据以减少流入热点区域的数据量;其次,对热点区域内的节点不采取分簇以降低区域内节点的分簇能耗;最后,在簇间通信阶段,通过粒子群优化(PSO)算法寻找同时满足相邻两跳间最大通信距离的最小化和最大通信跳数的最小化的最优传输路径,实现整个网络的能量消耗最低。理论分析和实验结果均表明,所提算法在能量有效性和能耗均衡分配方面都要优于基于增强学习的生命期优化路由协议(RLLO)和基于模糊理论的多层分簇式路由协议(MLFC),网络生存周期分别提高了20.1%和40.5%,可以有效避免"能量空洞"。     

无线传感器网络分层带宽自适应路由协议

在无线传感器网络(WSNs)中,节点能量使用严格受限,限制了网络的使用寿命。固定环带宽度的分层路由协议是一种有效的解决方法。在此基础上,提出了一种引入环带宽度自适应调整的路由机制。该机制根据节点剩余能量和传输数据能耗自动调整环带宽度,并决定节点是否参与网内数据报文的传输。采用Matlab作为仿真工具对该路由机制进行了仿真分析,结果表明:该算法通过调整环带宽度的方式能够有效延长网络使用寿命和维持网内负载均衡。     

基于负载均衡的DSR路由协议改进*

动态源路由DSR路由协议以最短路径优先为原则,但是没考虑负载均衡,产生拥塞区域、连接失败等不利结果.为减轻路由负载,提高协议性能,提出了一种基于负载均衡的DSR路由算法.在路由发现过程中节点根据自身负载情况决定接收或丢弃请求分组,从而避开负载过高节点;中间节点采用不应答路由请求分组策略;目的节点根据路径总负载选择合适的...     

无线传感器网络的RPL路由协议研究

路由协议执行网络拓扑描述、路由选择和数据包转发的功能,影响整个网络的性能和存活时间。现有的路由协议需要发送大量数据包维护网络拓扑,以及大量的存储空间来存储路由条目。由于硬件的限制,无线传感器节点无论是能量,还是其处理能力、存储能力都受到极大的制约。因此,IETFRoLL工作组提出了一种针对低功耗有损网络的IPV6路由协议,即RPL路由协议。文中对RPL路由协议的拓扑构建过程、数据包路由过程和Trickle定时器的算法等进行了分析,通过使用COOJA仿真工具对其进行仿真,验证了RPL路由协议在低功耗有损网络中具有较高的性能。     

基于LS-RTS机制和功率可调路由的跨层协议

为了降低线型无线传感网络能耗和传输延时,在改进CLM协议跨层方法的基础上融合其他经典机制,提出了一种适应线型拓扑结构的跨层协议。协议删除中继路由判决以优化原通信判决门限;对节点统一标记链编号形成新LS-RTS机制以提高链路传输率;精简时隙单元和多跳传输时序降低数据传输时延;并引入功率可调路由减少节点路由计算负担以此降低节点能耗。仿真结果表明,相较于CLM和CLR-DCE等两种跨层协议,本文提出的I-CLM跨层协议在降低传输时延的同时整体能耗至少降低了18.75%和7.32%,一定程度上延长了网络生存时间。     

无源感知网络中能耗和延迟平衡的机会路由协议

部署于野外的感知网络在应用时广泛存在节点能量不足的问题,而新型的使用能量收集技术的节点可以通过周期性地从环境中获取能量来延长网络的生存周期.因此,针对使用能量收集型节点的无源感知网络,能耗不再像有源节点网络那样成为制约网络性能最关键的因素.综合考虑能耗和延迟,可以在使节点获得较长生存周期的同时提高数据到达基站的速度.针对现有应用于无源感知网络的路由协议大多不能兼顾能耗和延迟性能的问题,提出了能耗和延迟平衡的机会路由协议（balance of energy and delay opportunistic routing protocol,简称EDOR）.该协议通过分析节点通信过程来估算节点的预期能耗值,使得节点选择令自己能耗较低的邻居节点作为转发候选.在最终确定转发节点时,该协议通过结合候选节点下一跳邻居节点的占空比信息来进行决策,使得发送节点选择能够更快将数据转发出去的候选节点来降低延迟,从而实现能耗和延迟性能的平衡.最后,该协议还通过设计退避策略来实现转发节点的单一性,减少机会路由过程中产生的不必要的数据包副本数量.     

基于集群计算的移动自组网络节能路由协议

节能问题在移动自组网络中已成为一个越来越重要的设计标准。提出了一种基于集群计算的低功耗路由协议——Cluster—based Energy Saving Routing Protocol（CESP）。其原理是使网络中的若干个节点以一个集群的方式工作在一个特定的节点周围．这个特殊的节点我们称之为集群指挥节点（Cluster Commanding Node—CCN）。集群指挥节点集中管理整个集群节点的能源管理机制,并且在该集群与同一网络中其他节点进行通信的时候起到代理节点的作用。当一个普通的集群节点启用了能源管理机制,它便进入节能模式以使能源消耗最小化。同时,集群管理节点采取缓存数据帧的方式来节能,仅当它接受到相应请示的时候才进行数据发送。