A Distributed Energy-Aware Routing Protocol for Underwater Wireless Sensor Networks

The design of routing protocols for Underwater Wireless Sensor Networks (UWSNs) poses many challenges due to the intrinsic properties of underwater environments. In this paper we present DUCS (Distributed Underwater Clustering Scheme), a new GPS-free routing protocol that does not use flooding techniques, minimizes the proactive routing message exchange and uses data aggregation to eliminate redundant information. Besides, DUCS assumes random node mobility and compensates the high propagation delays of the underwater medium using a continually adjusted timing advance combined with guard time values to minimize data loss. The theoretical and simulation studies carried out demonstrate its effectiveness.     

A Vector-Based Routing Protocol in Underwater Wireless Sensor Networks

One major concern shared by many researchers about underwater wireless sensor networks (UWSNs), with respect to the limitations and particularities of underwater environment, is the problem of routing. These limitations include three-dimensional topology, limited bandwidth, node movement, long delay, limited energy, and construction costs. The new routing protocols for underwater networks have been developed on the basis of voracious routing systems. The main problem with UWSNs is finding an efficient route between the source and the target to send more packets to the target with lower levels of energy consumption. In this research, by improving VBF algorithm, which is dependent on the radius of the routing pipe, an algorithm is introduced which considers pipe radius as a function of the environment’s dimensions and of the range and the number of nodes. Consequently, by changing one of these parameters, the radius of the routing pipe changes. However, to control the energy consumed by the nodes, there exists a function that, if the recipient node’s energy to receive the packet is much lower than that of the sender node, the proposed method reduces the size of the routing pipe’s radius to lessen its chance of being selected as the guiding node so that other nodes are able to have the chance of getting the packet’s guiding node. The proposed algorithm has been compared with VBVA, HHVBF, and VBF protocols; the simulation results obtained from NS-2 simulator indicate that the proposed protocol could cut back on energy consumption, especially in networks with high number of nodes, by relying on changing the width of the routing pipe in proportion to network density. It was also successful in delivering more packets in non-dense networks.     

End-to-End Delay and Energy Efficient Routing Protocol for Underwater Wireless Sensor Networks

Providing better communication and maximising the communication performance in a Underwater Wireless Sensor Network (UWSN) is always challenging due to the volatile characteristics of the underwater environment. Radio signals cannot properly propagate underwater, so there is a need for acoustic technology that can support better data rates and reliable underwater wireless communications. Node mobility, 3-D spaces and horizontal communication links are some critical challenges to the researcher in designing new routing protocols for UWSNs. In this paper, we have proposed a novel routing protocol called Layer by layer Angle-Based Flooding (L2-ABF) to address the issues of continuous node movements, end-to-end delays and energy consumption. In L2-ABF, every node can calculate its flooding angle to forward data packets toward the sinks without using any explicit configuration or location information. The simulation results show that L2-ABF has some advantages over some existing flooding-based techniques and also can easily manage quick routing changes where node movements are frequent.     

一种无线传感器网络简单按需路由协议

对被监测对象进行实时监测,在有敏感事件突然发生时,由监测传感器及时向监测者报告被监测对象的相关信息是一类非常重要的无线传感器网络应用.针对这类应用,文章提出了一种无线传感器网络简单按需路由协议:SOD.协议通过动态汇聚节点生成协议使得节点能量消耗尽可能均衡化;利用扩散算法减少路由建立和恢复过程中消息的发送.考虑到此类应用的数据突发性和实时性特点,协议采取紧凑设计的原则,将路由请求消息与最初的突发数据相绑定,在路由建立的同时很好地保证了监测的实时性.仿真和实验表明该协议具有简单性、能量有效性和实时性等特点.     

Greedy Anti-Void Routing Protocol for Wireless Sensor Networks

The unreachability problem (i.e. the so-called void problem) which exists in the greedy routing algorithms has been studied for the wireless sensor networks. However, most of the current research work can not fully resolve the problem (i.e. to ensure the delivery of packets) within their formulation. In this letter, the greedy anti-void routing (GAR) protocol is proposed, which solves the void problem by exploiting the boundary finding technique for the unit disk graph (UDG). The proposed rolling-ball UDG boundary traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node. The proofs of correctness for the proposed GAR protocol are also given at the end of this letter.     

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

微机电系统、处理器、无线通信及存储技术的进步促进了无线传感器网络的飞速发展,使得无线传感器网络成为一种全新的信息获取和处理技术。在对其网络特点进行分析的基础上,介绍了无线传感器网络体系结构。路由技术是无线传感器网络通信层的核心技术,也是其组网的基础,着重讨论了无线传感器网络的路由协议的特点及其相关问题。     

Stable-Aware Evolutionary Routing Protocol for Wireless Sensor Networks

In real life scenario for wireless sensor networks (WSNs), energy heterogeneity among the sensor nodes due to uneven terrain, connectivity failure, and packet dropping is a crucial factor that triggered the race for developing robust and reliable routing protocols. Prolonging the time interval before the death of the first sensor node, viz. the stability period, is critical for many applications where the feedback from the WSN must be reliable. Although Low Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-like protocols are fundamental and popular clustering protocols to manage the system’s energy and thus to prolong the lifespan of the network, they assume a near to a perfect energy homogeneous system where a node failure, drainage and re-energizing are typically not considered. More recent protocols like Stable Election Protocol (SEP) considers the reverse, i.e., energy heterogeneity, and properly utilizes the extra energy to guarantee a stable and reliable performance of the network system. While paradigms of computational intelligence such as evolutionary algorithms (EAs) have attracted significant attention in recent years to address various WSN’s challenges such as nodes deployment and localization, data fusion and aggregation, security and routing, they did not (to the best of our knowledge) explore the possibility of maintaining heterogeneous-aware energy consumption to guarantee a reliable and robust routing protocol design. By this, a new protocol named stable-aware evolutionary routing protocol (SAERP), is proposed in this paper to ensure maximum stability and minimum instability periods for both homogeneous/heterogeneous WSNs. SAERP introduces an evolutionary modeling, where the cluster head election probability becomes more efficient, to well maintain balanced energy consumption in both energy homogeneous and heterogeneous settings. The performance of SAERP over simulation for 90 WSNs is evaluated and compared to well known LEACH and SEP protocols. We found that SAERP is more robust and always ensures longer stability period and shorter instability period.     

A Scalable Priority-Based Multi-Path Routing Protocol for Wireless Sensor Networks

In this paper, a scalable priority-based multi-path routing protocol (PRIMP) is proposed for wireless sensor networks to offer extended network lifetime and robust network fault tolerance, under the context of stringent energy constraint and vulnerability of sensors to dynamic environmental conditions. A novel interest dissemination strategy which invokes an on-demand virtual source technique is designed in PRIMP to minimize communication overheads and energy wastage. In routing, data traffic is distributed over multiple braided data paths simultaneously by a priority-based probabilistic approach at each hop to achieve the robustness against the unreliable transmission due to frequent node failures. Extensive simulations validate that PRIMP exhibits significantly better performance in energy conservation, load-balancing and data delivery than comparable schemes, while at the same time PRIMP achieves a nice scalability feature in terms of energy dissipation with various network sizes and network densities. Last but not least, PRIMP addresses the slow startup problem that is prevalent in data-centric routing schemes.     

A Uniform Balancing Energy Routing Protocol for Wireless Sensor Networks

In wireless sensor network, the power supply is, generally, a non-renewable battery. Consequently, energy effectiveness is a crucial factor. To maximize the battery life and therefore, the duration of network service, a robust wireless communication protocol providing a best energy efficiency is required. In this paper, we present a uniform balancing energy routing protocol. In this later the transmission path is chosen for maximizing the whole network lifetime. Every transmission round, only the nodes which have their remaining energies greater than a threshold can participate as routers for other nodes in addition to sensing the environment. This choice allows the distribution of energy load among any sensor nodes; thus extends network lifetime. The experimental results shows that the proposed protocol outperforms some protocols given in the literature.     

Energy Efficient Layered Cluster Head Rotation Based Routing Protocol for Underwater Wireless Sensor Networks

Energy efficiency is of paramount concern in underwater sensor networks. The very nature of underwater environment makes it difficult to deploy an energy efficient network that enhances network lifetime. The existing protocols of terrestrial networks cannot be implemented directly to underwater scenarios and as such new protocols have to be designed because of speed of signal propagation under water. Improving the energy efficiency in UWSNs is an active area of research and many protocols to that end have been proposed. The routing protocol that this paper proposes is Energy Efficient Layered Cluster Head Rotation (EE-LCHR) routing protocol. This protocol makes use of the multi sink architecture and creates virtual layers containing a number of sensor nodes such that the hop count from the sensor nodes in a particular layer to the surface sink is the same. Also each layer has a number of clusters with a cluster head that keeps on rotating depending on the fitness value of the sensor nodes. The proposed protocol as compared to other extant protocols like EE-DBR and DBR improves network lifetime. The presence of virtual layers and rotation of cluster heads together ensure that energy balance is better achieved in our proposed protocol which leads to an enhanced network lifetime.

     

一种基于分簇的无线传感器网络安全路由协议

LEACH协议首次提出在WSNs（无线传感器网络）中采用动态分簇的层次结构,大大降低了能耗,提高了网络寿命。基于集中式簇头选举的LEACH-C协议比LEACH更节省能耗,但二者都没有考虑安全性,从而可能遭遇各种攻击。论文采用动态密钥分配对LEACH-C进行了安全性改进,并提出了一种适用于集中式控制的安全分簇路由协议SLEACH-C。     

MintRouteEE:一种无线传感器网络能量有效的路由协议

路由是无线传感器网络的关键问题之一。通过分析TinyOS系统中MintRoute路由协议的主要结构和路由策略。提出一种能量有效的路由协议MintRouteEE。模拟结果表明，MintRouteEE能够较大地降低网络的能耗，从而达到延长网络生存时间的目的。     

The Cooperative-Communication Based Underwater Layered Routing Protocol for Underwater Wireless Sensor Network

Wireless Personal Communications - Millimeter-wave massive multiple-input multiple-output (MIMO) employs a lens antenna array for minimizing the radio frequency (RF) chains count, yet it remains as...     

QMCR:A Q-Learning-Based Multi-Hop Cooperative Routing Protocol for Underwater Acoustic Sensor Networks

Routing plays a critical role in data transmission for underwater acoustic sensor networks (UWSNs) in the internet of underwater things (IoUT). Traditional rout...     

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

针对无线传感器网络中节点能量受限的特征,提出了ILEACH(improved-LEACH)分簇路由协议,达到延长网络生存时间的目的,该分簇路由协议在簇头选取时,充分考虑了节点的剩余能量;簇形成时利用了距离阈值的约束来优化分簇方案;数据收集阶段,根据节点的权值在簇头节点之间建立到基站的路由树,利用NS2仿真软件对LEACH和ILEACH协议进行仿真、比较,结果显示ILEACH具有良好的性能.     

Routing Protocol for Heterogeneous Hierarchical Wireless Multimedia Sensor Networks

Recently, wireless multimedia sensor networks (WMSNs) have emerged as one of the most important technologies, driven by the development of powerful multimedia device such as CMOS. WMSNs require several factors such as resource constraints, specific QoS, high bandwidth and so on. In this paper, we propose a hierarchical heterogeneous network model based routing protocol for WMSNs. In our proposal, proposed network model is classified into monitoring class, delivery class and aggregation class. Also we define two kinds of the routing path in order to ensure bandwidth and QoS. In simulation results, we illustrate the performance of our proposal.     

基于生成树的无线传感器网络分布式路由协议

在无线传感器网络中,节点具有有限的电池能量,为了延长网络的生存时间,提出了一种基于生成树的分布式路由协议STRP及其具有能量意识的改进版本STRP-PA.每个传感器节点根据相邻节点与基站的距离、剩余能量等信息寻找父节点,构造一棵以基站为根的近优最小生成树,节点采集的数据沿树传输,并在树杈节点进行聚合.仿真实验结果表明:STRP-PA协议能够节省网络能量,显著延长网络稳定工作的时间,性能明显好于LEACH协议.     

无线传感器网络LEACH路由协议改进

由于无线传感器网络(Wireless Sensor Networks,WSN)中节点能量有限,需要设计能量有效的协议,以延长网络的生存时间。在LEACH路由协议的基础上,综合考虑节点已经充当簇头的次数、剩余能量和地理位置参数来优化簇头的选择机制,提出了LEACH-W路由协议算法。实验结果表明,LEACH-W算法具有更长的网络生命周期。     

链路可靠的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.     

Energy Efficient Fuzzy Routing Protocol for Wireless Sensor Networks

Wireless Personal Communications - Energy efficiency to route data in wireless sensor networks is key concern to enhance network lifetime. In this paper, an energy efficient routing protocol has...