无线传感网络中能耗均衡的混合通信算法研究

基于经典的低能耗自适应分簇算法(LEACH),提出了一种能耗均衡的混合通信算法(EEHCA).由基站根据节点剩余能量和簇头之间的距离选举簇头,节点用单跳模式和多跳模式交替与簇头进行通信且概率分别是p和1-p,从而使簇头的分布更均匀,节点的负载更均衡.仿真结果表明该算法有效地平衡了节点的能量消耗,在延长生命周期方面明显好于LEACH.     

无线传感器网络能量均衡分簇路由协议

针对LEACH协议存在的3大问题:簇头选举时未考虑节点剩余能量、频繁成簇造成了大量额外能耗以及欠缺对簇间能耗均衡的考虑,提出了能量有效分簇路由协议(LEACH-improved).该协议中,首轮成簇后网络中簇的分布和数量将保持不变,以后每轮各簇的簇头由上一轮簇头结合节点的能量水平来指定,借鉴泛洪算法的思想,在簇间建立多...     

WSN中一种基于剩余能量级别的负载均衡路由协议

文中提出了一种WSN中基于剩余能量级别的负载均衡的分簇路由协议REICRP.在簇的建立阶段,RELCRP采用了基于优先级的簇头选取策略,高优先级的节点能更早地广播簇头竞选通告,从而避免剩余能量低的节点成为簇头.簇间通信采用单跳一多跳混合传输模式,簇头节点根据剩余能量级别切换传输方式,以缓解"热点"问题.仿真结果表明:RELCRP有效地均衡了网络中节点的能量消耗,延长了网络的生存时间.     

无线传感器网络能量均衡分簇路由协议

LEACH是无线传感器网络(Wireless Sensor Network,WSN)中一种经典的分层式路由协议,在此基础上通过对LEACH成簇算法及簇间路由的改进,提出了一种新的均衡能量消耗分簇路由协议。该协议在无线传感器网络成簇过程中充分考虑了传感器节点的能量状态,同时簇首向基站的通信采用基于能量的簇间路由。理论分析及仿真结果表明,改进的协议能够均衡传感器节点的能量消耗,有效地延长网络寿命。     

一种基于LEACH-C改进的能量有效分簇协议

针对LEACH-C协议周期性地簇重构会造成额外开销以及簇头节点和普通节点间能耗不均的缺陷,提出了改进的能量有效分簇协议(Improved Energy-Efficient Clustering Hierarchy,IEECH)。在IEECH中,由簇中所选出的发送节点分担簇头节点的高能量负载,因此不再需要进行全局的簇重构。网络节点的能耗由于发送节点的轮转进一步得到了均衡。因此,该算法和LEACH以及LEACH-C相比,可以有效地延长网络的寿命。最后,通过NS2仿真实验也得到了验证。     

一种新的无线可充电传感器网络分簇算法

为了弥补现有无线可充电传感器网络充电效率低下和节点能量冗余并存的问题,提出了一种基于节点信息的分簇算法。首先,根据传感器节点的剩余能量状态,选择候选簇首。其次,计算候选簇首集合中节点之间的距离,并与基于节点密度的距离阈值比较,最终筛选出合适的簇首。其他节点根据就近原则选择簇首,形成对应的簇。该算法由于同时考虑节点剩余能量和簇首之间的距离,可以使得具有较多剩余能量的节点成为簇首,且簇首均匀分布整个网络中。仿真结果表明,提出的算法可以提高充电效率,减少节点的能量冗余或节点能量消耗过快而死亡的现象,从而有效延长整个网络的寿命。     

基于电量均衡的无线传感器网络分簇算法

为了延长无线传感器网络的生命期,针对节点能耗分布不均匀的问题,提出一种电量均衡的分簇算法.该算法将节点剩余能量作为构建分簇结构的依据,对剩余能量较少的节点赋予一定的约束,使之成为普通节点,并使电量多的节点成为簇头节点,均衡网络电量负载,解决了网络中部分低电量节点担任骨干节点而导致能耗的问题,从而有效延长了网络的生命期.仿真实验证明了该算法的有效性.     

一种基于能量和距离的无线传感器网络分簇路由协议

在无线传感器网络的路由技术中,基于簇的路由算法在拓扑管理、能耗利用、数据融合等方面都有较强的优势.在分析EECS协议的基础上,提出了EECS协议存在的问题,并相应地修改了成簇算法,设计了ADEECS协议,增强了算法的能量均衡性能.在簇头选举阶段总是选择剩余能量最多的节点,在成簇阶段ADEECS协议同时考虑了节点的剩余能量和节点与基站的距离.仿真结果也证明了ADEECS协议相对于EECS很大地提高了网络的生命周期.     

无线传感网络移动分簇路由策略

无线传感网络(WSN)路由协议中,分簇路由具有拓扑管理方便、能量高效和数据融合简单等优点,成为当前重点研究的路由技术。通过研究各种环境下的移动传感器网络,有效地降低能耗则是研究移动无线传感器网络的重要目的之一。针对无线传感网络中移动性问题,基于LEACH协议,利用移动传感器网络中节点距离、速度和剩余能量等因素提出了能量高效的移动分簇路由算法。实验结果表明此算法能够较好地支持节点移动,从而降低网络能耗,延长网络生存时间。     

An energy‐efficient and balanced clustering approach for improving throughput of wireless sensor networks

Maximizing the lifespan of wireless sensor networks is currently drawing a lot of attention in the research community. In order to reduce energy consumption, sensor nodes that are far from the base station avoid sending data directly. As a result, several disjoint clusters are formed, and nodes within a cluster send their data through the cluster head to avoid long transmissions. However, several parameters related to transmission cost need to be considered when selecting a cluster head. While most of the existing research work considers energy and distance as the most stringent parameters to reduce energy consumption, these approaches fail to create a fair and balanced cluster. Consequently, unbalanced clusters are formed, resulting in the degradation of overall performance. In this research work, a cluster head selection algorithm is proposed that covers all parts of the sensing area in a balanced manner, saving a significant amount of energy. Furthermore, a capture effect–based intracluster communication mechanism is proposed that efficiently utilizes the time slot under various traffic conditions. A Näive Bayes classifier is used to adapt the window size dynamically according to the traffic pattern. Finally, a simulation model using OMNeT++ is developed to compare the proposed approach with the pioneer clustering approach, LEACH, and the contemporary LEACH‐MAC protocol in terms of performance. The results of the simulation indicate that the proposed approach improves the overall performance in terms of network lifetime, energy efficiency, and throughput.     

Fuzzy-based unequal clustering protocol for underwater wireless sensor networks

Underwater wireless sensor network (UWSN) is a network made up of underwater sensor nodes, anchor nodes, surface sink nodes or surface stations, and the offshore sink node. Energy consumption, limited bandwidth, propagation delay, high bit error rate, stability, scalability, and network lifetime are the key challenges related to underwater wireless sensor networks. Clustering is used to mitigate these issues. In this work, fuzzy-based unequal clustering protocol (FBUCP) is proposed that does cluster head selection using fuzzy logic as it can deal with the uncertainties of the harsh atmosphere in the water. Cluster heads are selected using linguistic input variables like distance to the surface sink node, residual energy, and node density and linguistic output variables like cluster head advertisement radius and rank of underwater sensor nodes. Unequal clustering is used to have an unequal size of the cluster which deals with the problem of excess energy usage of the underwater sensor nodes near the surface sink node, called the hot spot problem. Data gathered by the cluster heads are transmitted to the surface sink node using neighboring cluster heads in the direction of the surface sink node. Dijkstra's shortest path algorithm is used for multi-hop and inter-cluster routing. The FBUCP is compared with the LEACH-UWSN, CDBR, and FBCA protocols for underwater wireless sensor networks. A comparative analysis shows that in first node dies, the FBUCP is up to 80% better, has 64.86% more network lifetime, has 91% more number of packets transmitted to the surface sink node, and is up to 58.81% more energy efficient than LEACH-UWSN, CDBR, and FBCA.     

A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.     

A load balancing energy efficient clustering algorithm for MANETs

Nodes in mobile ad hoc Networks (MANETs) are characterized by their limited resources. Hence, the concept of clustering was introduced to allow spacial reuse of bandwidth and to minimize routing overhead. However, node mobility perturbs the stability of the network and affects the performance of other protocols such as scheduling, routing, and resource allocation, which makes re‐clustering the network to maintain up‐to‐date information at each node unavoidable. Consequently, clustering models for MANETS should be carefully designed while taking into consideration the fact that mobile nodes are energy constrained. In this paper, we propose a dynamic energy‐efficient clustering algorithm that prolongs the network lifetime by electing cluster‐heads taking into consideration, in addition to other parameters such as mobility, their residual energies and making them dynamically monitor their energy consumption to either diminish the number of their cluster‐members or relinquish their roles. We have evaluated the performance of the proposed clustering model and compared it with other related clustering approaches found in the literature. Obtained results show the efficiency of the proposed algorithm. Copyright © 2010 John Wiley & Sons, Ltd.     

An energy efficient clustering routing algorithm for wireless sensor networks

~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A…     

Localized and load‐balanced clustering for energy saving in wireless sensor networks

In this paper, the ‘localized and load‐balanced clustering (LLBC)’ protocol is proposed for the energy savings and lifetime increases of wireless sensor networks. LLBC contains two approaches. One is improved cluster head rotation (ICHR) and the other is modified static clustering (MSC). ICHR uses the present cluster heads to select most energetic sensors as the next‐round cluster heads and avoids the margin cluster heads being selected as cluster heads repeatedly. MSC is suitable when the network has a few very high energetic sensors. It uses the method of inter‐cluster load balance to adjust the cardinality of each cluster as close to the average cardinality as possible. The simulation results with respect to FND (the time when a node dies first), HND (the time when half of the total nodes have died), and energy consumption show that the orders of effectiveness are: for ICHR and low‐energy adaptive clustering hierarchy (LEACH)‐C, before 250 rounds of cluster head rotations, there is no significant difference between the two, but after 250 rounds, ICHR>LEACH?C; and in general, LEACH?C>LEACH>MSC>mini variance>direct communication. Copyright © 2008 John Wiley & Sons, Ltd.     

Energy‐efficient void avoidance geographic routing protocol for underwater sensor networks

Underwater wireless sensor networks (UWSNs) consist of a group of sensors that send the information to the sonobuoys at the surface level. Void area, however, is one of the challenges faced by UWSNs. When a sensor falls in a void area of communication, it causes problems such as high latency, power consumption, or packet loss. In this paper, an energy‐efficient void avoidance geographic routing protocol (EVAGR) has been proposed to handle the void area with low amount of energy consumption. In this protocol, a suitable set of forwarding nodes is selected using a weight function, and the data packets are forwarded to the nodes inside the set. The weight function includes the consumed energy and the depth of the candidate neighboring nodes, and candidate neighboring node selection is based on the packet advancement of the neighboring nodes toward the sonobuoys. Extensive simulation experiments were performed to evaluate the efficiency of the proposed protocol. Simulation results revealed that the proposed protocol can effectively achieve better performance in terms of energy consumption, packet drop, and routing overhead compared with the similar routing protocol.     

LRP: Link quality‐aware queue‐based spectral clustering routing protocol for underwater acoustic sensor networks

Recently, underwater acoustic sensor networks (UASNs) have been considered as a promising approach for monitoring and exploring the oceans in lieu of traditional underwater wireline instruments. As a result, a broad range of applications exists ranging from oil industry to aquaculture and includes oceanographic data collection, disaster prevention, offshore exploration, assisted navigation, tactical surveillance, and pollution monitoring. However, the unique characteristics of underwater acoustic communication channels, such as high bit error rate, limited bandwidth, and variable delay, lead to a large number of packet drops, low throughput, and significant waste of energy because of packets retransmission in these applications. Hence, designing an efficient and reliable data communication protocol between sensor nodes and the sink is crucial for successful data transmission in underwater applications. Accordingly, this paper is intended to introduce a novel nature‐inspired evolutionary link quality‐aware queue‐based spectral clustering routing protocol for UASN‐based underwater applications. Because of its distributed nature, link quality‐aware queue‐based spectral clustering routing protocol successfully distributes network data traffic load evenly in harsh underwater environments and avoids hotspot problems that occur near the sink. In addition, because of its double check mechanism for signal to noise ratio and Euclidean distance, it adopts opportunistically and provides reliable dynamic cluster‐based routing architecture in the entire network. To sum up, the proposed approach successfully finds the best forwarding relay node for data transmission and avoids path loops and packet losses in both sparse and densely deployed UASNs. Our experimental results obtained in a set of extensive simulation studies verify that the proposed protocol performs better than the existing routing protocols in terms of data delivery ratio, overall network throughput, end‐to‐end delay, and energy efficiency.     

基于动态分区的无线传感器网络非均匀成簇路由协议简

针对节点负载不均而形成的“热区”问题,提出了一种基于动态分区负载均衡的分布式成簇路由协议(UCDP)。其核心思想是：将网络合理化地动态分区,使距离基站较近的区面积较小,从而减少需要承担转发任务节点的区内通信开销,节省更多的能量供数据转发使用;综合考虑距离因子和剩余能量因子进行区内非均匀成簇;有机结合簇内单跳和区间转发,区头与簇头共同协作进行路由传输。实验表明,协议具有较好的稳定性,显著延长了网络的生存周期。     

Adaptive concentric chains protocol for energy efficient routing in wireless sensor networks

This paper addresses the energy efficiency of data collection based on a concentric chain clustering topology for wireless sensor networks (WSNs). To conserve the energy dissipation of nodes spent in data routing, the paper attempts to take advantage of the two opportunities: (a) the impact of the relative positions of wireless nodes to the base station on the energy efficiency of the routing chain within each cluster; (b) the effect of the varying‐sized chains on the selection rule of cluster heads (CHs). To establish an energy‐efficient chain to connect all the nodes in a cluster, the paper proposes a principal vector projection approach, which takes into account both the position of each node and that of the base station, to determine the order to which a node can be linked into the chain in order to reduce the energy requirement of the chain. Since the CH selection rules in the concentric chains are mutually independent, solely based on their self‐cluster sizes, the multi‐hop path passing through all the CHs will consist of longer links and thus consume a significant fraction of the total energy. Thus, in order to suppress the effect of the unequal cluster sizes on decreasing the energy efficiency of the multi‐hop path of CHs, the paper offers an average‐cluster‐size‐based rule (ACSB) for each cluster in order to adapt the CH selection with both the number of active nodes in the current cluster and the average value of all cluster sizes. With these two proposed schemes, an adaptive concentric chain‐based routing algorithm is proposed which enables nodes to collaboratively reduce the energy dissipation incurred in gathering sensory data. By computer simulation, the results demonstrate that the proposed algorithm performs better than other similar protocols in terms of energy saved and lifetime increased capabilities for WSNs which deploy random sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd.