A new QoS aware and energy efficient opportunistic routing protocol for wireless sensor networks

Energy efficiency and Quality of Service (QoS) providing are known to be critical design concerns in routing protocols for Wireless Sensor Networks (WSNs). Recent studies, demonstrate that Opportunistic Routing (OR) can greatly improve the performance of WSNs by exploiting the broadcast nature of the wireless medium. In this paper, we propose a new QoS aware and Energy efficient Opportunistic Routing protocol (QEOR) to efficiently routing data under QoS and energy constraints for WSNs. QEOR uses a new multi-metric QoS based candidate selection method in order to accurately select and prioritise the candidate forwarders. The selection is focused on a QoS function that takes into consideration the reliabilty of buffers and links, while the prioritisation is established according to transmission delays. To achieve an obvious improvement on the energy consumption, QEOR uses an energy efficient coordination method and an implicit ACKnowledgement scheme for collision and redundancy avoidance. Simulation results show that QEOR provides best performances as compared to other OR protocols.     

Energy efficient and QoS based routing protocol for wireless sensor networks

The increasing demand for real-time applications in Wireless Sensor Networks (WSNs) has made the Quality of Service (QoS) based communication protocols an interesting and hot research topic. Satisfying Quality of Service (QoS) requirements (e.g. bandwidth and delay constraints) for the different QoS based applications of WSNs raises significant challenges. More precisely, the networking protocols need to cope up with energy constraints, while providing precise QoS guarantee. Therefore, enabling QoS applications in sensor networks requires energy and QoS awareness in different layers of the protocol stack. In many of these applications (such as multimedia applications, or real-time and mission critical applications), the network traffic is mixed of delay sensitive and delay tolerant traffic. Hence, QoS routing becomes an important issue. In this paper, we propose an Energy Efficient and QoS aware multipath routing protocol (abbreviated shortly as EQSR) that maximizes the network lifetime through balancing energy consumption across multiple nodes, uses the concept of service differentiation to allow delay sensitive traffic to reach the sink node within an acceptable delay, reduces the end to end delay through spreading out the traffic across multiple paths, and increases the throughput through introducing data redundancy. EQSR uses the residual energy, node available buffer size, and Signal-to-Noise Ratio (SNR) to predict the best next hop through the paths construction phase. Based on the concept of service differentiation, EQSR protocol employs a queuing model to handle both real-time and non-real-time traffic.     

An efficient Dynamic Addressing based routing protocol for Underwater Wireless Sensor Networks

Underwater Wireless Sensor Networks (UWSNs) are different in many aspects as compared to terrestrial sensor networks. Other than long propagation delays and high error probability, continuous node movement makes it hard to manage the location information of sensor nodes. Determining the location of every node is a major issue as nodes can move continuously with the water currents. In order to handle the problem of large propagation delays and unreliable link quality, many algorithms have been proposed and some of them provide good solutions for these issues, but continuous node movements still need attention. In order to handle the problem of node mobility, we proposed a Hop-by-Hop Dynamic Addressing Based (H2-DAB) routing protocol, where every node in the network will be assigned a routable address in a quick and efficient way without requiring an explicit configuration or any dimensional location information. It helps to provide an option where nodes can communicate without any centralized infrastructure, also a mechanism is available where nodes can come and leave the network without having any serious effect on the rest of the network. Simulation results show that H2-DAB can manage easily during the quick routing changes where node movements are very frequent yet require little or no overhead in order to complete its tasks.     

一种WMSNs能量感知QoS路由机制设计

随着对监测数据的要求越来越高,多媒体传感器网络具有广泛的应用前景。由于多媒体信息对QoS的要求比较高和网络对能量的依赖较大,使得无线多媒体网络中QoS问题的研究极具挑战性。从网络层角度提出一种基于能量感知的可靠路由机制,通过充分考虑节点的剩余能量和路径的可靠性,选择相应的路由,从而提高了对网络资源的利用和网络的可靠性。仿真实验显示该机制能有效提高传输的可靠性,降低网络通信开销。     

无线传感器网络分簇路由的能量有效性研究

无线传感器网络中的节点以簇的方式进行路由时,簇成员可使用单跳或多跳通信模式将感知数据包发送至簇头。该文以簇内成员节点的最大能耗作为评价指标,研究了单跳和多跳的能量有效性,得出了通信模式的选择取决于通道衰减系数的结论。考虑到单纯的单跳或多跳模式会引起网络能耗不均衡,提出了簇成员节点以一定概率在单跳和多跳间切换的混合通信模式。以典型的网络参数进行仿真,验证了混合通信模式在能量有效性和能耗均衡分配方面的优势。     

基于SMP的分簇WSN生存性评估模型

无线传感网(WSN)很适合用于战场侦察和应急通信等场合,增强WSN的生存能力并对其进行量化评估逐渐受到关注。本文提出一种基于半马尔可夫过程(SMP)的分簇WSN生存性评估模型,该模型在考虑应急通信中簇头生存状态的基础上建立了基于SMP的簇头生存状态转移图;结合网络生存性需求计算WSN的生存性效用函数,并定量分析了多种评价指标对网络生存能力的影响及其相关性;进而,利用该模型对采用SRPC协议和RLEACH协议的WSN生存能力进行了量化评估和比较分析。分析与验证结果表明,提出的生存性评估模型不仅可以对应急通信中WSN的生存能力进行客观有效的评估,还能对WSN的实际部署和应用提供参考依据。     

能量高效的无线传感器网络分簇路由协议

无线传感器网络的路由协议设计要同时关注单个节点的能耗及整个网络能量的均匀消耗。在分析现有分簇路由协议的基础上,提出一种能量高效的分簇路由协议,通过结合节点能量选举簇头,采用限制簇规模的优化簇形成算法和改进的多跳簇间转发方式,节约节点能量,平衡簇间负载。仿真结果表明,该协议能有效降低网络能量消耗,延长网络生存周期。     

一种改进的无线传感器网络分簇路由算法

在无线传感器网络中,分簇路由具有管理方便、高效节能、易于实现等特点,成为当前重点研究的路由算法。现有的典型分簇路由算法存在着簇首节点能耗分布不均,簇首节点与基站未采用最短路径,数据可能“绕道”传递等缺陷,使得在网络规模较大时网络能耗及生命周期等性能表现不佳。针对这些问题,结合LEACH和SHORT的思想提出了一种改进的多层分簇路由算法（LEACH-S）,它建立了簇首到簇首路由,并保证相邻簇首之间距离最短。NS2仿真结果表明,在网络规模较大,密度较低时,LEACH-S较LEACH-C将网络生命周期延长了约15%。     

一种新的基于簇头优化的WSN路由协议

在无线传感器网络的分簇路由协议中,低功耗自适应分簇(Low Energy Adaptive Clustering Hierarchy)算法是其中比较流行的协议之一.文章根据Leach协议提出了一种新型的簇头选举算法LEACH-NOC(New Optimal Cluster),其簇头选举采用两个步骤,首先通过LEACH分簇的思想,将网络分成若干个簇,然后在簇内重新选择簇首时使其尽量靠近簇的质心且能量大于该簇内剩余节点的平均值.MATLAB仿真结果显示,改进的协议能够具有更好的能量有效性,延长了第一个节点簇头死亡(FND)的时间.     

无线传感器网络的QoS体系结构

不同于传统互联网,作为涵盖了数据感知、处理和传输的复杂任务型网络,无线传感器网络面向应用的特点给服务质量(QoS)研究带来了许多新的挑战,需要针对QoS体系结构以及QoS指标间复杂关系的系统工作.文中首先提出了无线传感器网络中QoS指标的分层模型以及相应的规范化描述,然后分析了QoS指标的映射关系,最后提出了一个层次化的QpS体系结构,希望为无线传感器网络中QoS保障技术的系统性研究提供参考.     

A reliable QoS aware routing protocol with slot assignment for mobile ad hoc networks

A mobile ad hoc network (MANET) is a collection of mobile hosts that form a temporary network on the fly without using any fixed infrastructure. Recently, the explosive growth in the use of real-time applications on mobile devices has resulted in new challenges to the design of protocols for MANETs. Chief among these challenges to enable real-time applications for MANETs is incorporating support for quality of service (QoS), such as bandwidth constraints. However, MANETs having a high ratio of topology change make routing especially unstable; making stability is an important challenge, especially for routing having a quality of service provision. In this paper, we propose a reliable multi-path QoS routing (RMQR) protocol with a slot assignment scheme. In this scheme, we examine the QoS routing problem associated with searching for a reliable multi-path (or uni-path) QoS route from a source node to a destination node in a MANET. This route must also satisfy certain bandwidth requirements. We determine the route expiration time between two connected mobile nodes using global positioning system (GPS). Then, two parameters, the route expiration time and the number of hops, are used to select a routing path with low latency and high stability. Simulation results show that the proposed RMQR protocol have some outstanding properties when compared with Lin's [Lin C-R. On-demand QoS routing in multihop mobile networks. In: Proceedings of the twentieth annual joint conference of the IEEE computer and communications societies (INFOCOM), vol. 3(22–26), 2001, p. 1735–44], Liao's [Liao W-H, Tseng Y-C, Wang S-L, Sheu J-P. A multi-path QoS routing protocol in a wireless mobile Ad Hoc network. Telecommunication Systems 2002;19(3–4):329–47], and Chen's [Chen Y-S, Tseng Y-C, Sheu J-P, Kuo P-H. An on-demand, link-state, multi-path QoS routing in a wireless mobile Ad-Hoc network. Computer Communications 204;27(1):27–40] protocols.     

Energy efficient chain based cooperative routing protocol for WSN

In this paper, we investigate the reduction in total transmission time and the energy consumption of wireless sensor networks using multi-hop data aggregation by forming coordination in hierarchical clustering. Novel algorithm handles wireless sensor network in numerous circumstances as in large extent and high density deployments. One of the major purposes is to collect information from inaccessible areas by using factorization of the area into subareas (clusters) and appointing cluster head in each of the subarea. Coordination and cooperation among the local nodes via relay nodes in local cluster (By forming sub clusters) helped to serve each and every node. Routing is based on the predefined path, proposed by new transmission algorithm. Transmission distance is minimized by using cluster coordinators for inter cluster communication and relay nodes within the cluster. We show by extended simulations that Chain Based Cluster Cooperative Protocol (CBCCP) performs very well in terms of energy and time. To prove it, we compare it with LEACH, SEP, genetic HCR and ERP and found that new protocol consumes six times less energy than LEACH, five times less energy than SEP, four time less energy than genetic HCR and three times less energy than ERP, which further validate our work.     

基于蚁群算法的能量有效的传感器网络可靠路由协议

针对传统的多路径方法在网络生存时间方面表现的不足,提出了一种基于蚁群算法的新方法.该方法在路径选择时不仅考虑了路径的最优性也即最小跳数,而且还把节点的剩余能量作为路径选择的依据.在发送数据时,基于概率选择其中的一条路径,避免始终使用一条路径传送数据以防止该路径上的节点能量耗尽,网络中各节点比较均衡地消耗能量.因此,该方法有效的延长了网络生存时间.最后,基于TOSSIM的仿真结果表明,该方法与已有的不相交多路径方法和缠绕方法相比,网络可靠性较高,网络生存时间较长.     

A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks

In mobile ad hoc networks (MANETs), the mobility of the nodes is a complicating factor that significantly affects the effectiveness and performance of the routing protocols. Our work builds upon recent results on the effect of node mobility on the performance of available routing strategies (i.e., path-based, using support) and proposes a protocol framework that exploits the usually different mobility rates of the nodes by adapting the routing strategy during execution. We introduce a metric for the relative mobility of the nodes, according to which the nodes are classified into mobility classes. These mobility classes determine, for any pair of origin and destination, the routing technique that best corresponds to their mobility properties. Moreover, special care is taken for nodes remaining almost stationary or moving with high (relative) speeds. Our key design goal is to limit the necessary implementation changes required to incorporate existing routing protocols into our framework. We provide extensive evaluation of the proposed framework, using a well-known simulator (NS2). Our first findings demonstrate that the proposed framework improves, in certain cases, the performance of existing routing protocols.     

融合K均值分簇MST路由的无线传感网压缩采样技术

考虑无线传感网中数据采集特点和能量约束性,将分簇路由策略融合到压缩感知采样中,提出了一种融合K均值分簇MST路由的压缩采样算法.算法采用稀疏投影矩阵以减小投影矩阵与稀疏基之间的相关度,利用K均值分簇MST(Mini?mum Spanning Tree)机制构造数据融合树,在保证数据重构质量的基础上减少网络数据传输量.仿真结果表明,算法可以提高网络能量使用效率,同时可以适应各种规模的无线传感网.     

An efficient bow-based on-demand QoS routing protocol for MIMO ad hoc networks

The multiple inputs multiple output (MIMO) architecture supports smart antennas and MIMO links is now a popular technique for exploiting the multi-path, spatial multiplexing, and diversity gain to provide high spectral efficiencies and performance improvement in wireless ad hoc networks. In this work, we propose a new multi-path on demand quality-of-service (QoS) routing architecture, looked like a bow and called as bow structure, in MIMO ad hoc networks. A bow-based MIMO ad hoc networks routing protocol, named as BowQR, is also proposed to support QoS requirement and to improve the transmission efficiency. Each bow structure is composed of rate-links and/or range-links on demand to provide multi-path routing and satisfy the bandwidth requirement. Two types of transmission links, the rate-link and range-link, exploit the spatial multiplexing and spatial diversity to provide extremely high spectral efficiencies and increase the transmission range. Finally, the simulation results show that our BowQR protocol achieves the performance improvements in throughput, success rate, and average latency.     

一种用于移动自组控制网络的QoS路由

为更好地将移动自组网络用于网络控制系统（NCS）,结合NCS的网络特性,提出了一种基于链路信号质量的QoS路由算法。主要QoS机制包括根据接收信号强度选择较稳定的路由;用Hello报文广播节点的预留带宽;中间节点为所有受影响的数据流修复路由、目的节点向源节点广播路由修复报文进行路由修复。NS2仿真表明当节点移动性强时,该QoS路由算法可有效减少网络的平均端到端时延和丢包率,提高控制系统稳定性。     

基于簇的无线传感器网络路由协议改进方案

无线传感器网络是一种全新的信息获取和处理技术。节能、能量消耗平衡等是延长传感器网络寿命的关键。该论文在全面分析LEACH和LEACH-C路由协议的基础上,结合两者各自的优点,提出一种新的基于簇的路由协议改进方案LAC(LEACH and LEACH-C)。该方案模拟仿真的结果显示,这个改进方案较其他方案能更好地提高了网络的寿命。     

簇头负载均衡的无线传感器网络分簇路由协议

针对无线传感器网络分簇路由协议中因簇间路由产生的簇头能量消耗不均衡的问题,提出一种簇头负载均衡的分簇算法。此算法在产生非均匀分布的簇头的基础上,建立由簇头组成的骨干传输网络的簇间转发路径,计算簇头的中转数据量。传感器节点在选择簇头时进一步考虑簇头的中转数据量,实现簇头的负载均衡。仿真实验结果表明,该路由协议有效地平衡了簇头的负载,并显著延长了网络的生存时间。     

ELIQoS:一种高效节能、与位置无关的传感器网络服务质量协议

如何保证在覆盖足够的监测区域的同时延长网络的寿命是无线传感器网络所面临的最重要问题之一,广泛采用的策略是选出工作节点以满足应用期望的服务质量(即覆盖率),同时关闭其他冗余节点.分析了随机部署网络在已知监测区域大小和节点感知范围情况下,无需节点位置信息,应用期望的服务质量与所需的工作节点数量之间的数学关系.在此基础上提出了一种高效节能、与位置无关的传感器网络服务质量协议(ELIQoS),协议根据节点能量大小,选取最少的工作节点满足应用期望的服务质量.实验结果表明,ELIQoS协议不仅可以有效地提供满足应用期望的服务质量,而且可以减少能量消耗,实现能耗负载均衡.