IBLEACH: intra-balanced LEACH protocol for wireless sensor networks

Wireless sensor networks (WSNs) are composed of many low cost, low power devices with sensing, local processing and wireless communication capabilities. Recent advances in wireless networks have led to many new protocols specifically designed for WSNs where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of routing protocols for WSNs. In this paper, the low-energy adaptive clustering hierarchy (LEACH) routing protocol is considered and improved. We propose a clustering routing protocol named intra-balanced LEACH (IBLEACH), which extends LEACH protocol by balancing the energy consumption in the network. The simulation results show that IBLEACH outperforms LEACH and the existing improvements of LEACH in terms of network lifetime and energy consumption minimization.     

一种针对无线传感器网络LEACH协议的改进算法

针对传统LEACH协议在簇首选取的随意性,以及簇首节点将数据以单跳形式传输给汇聚节点造成能耗大的缺点。文中提出了改进协议,该算法在对簇头节点的选择时会将节点的剩余能量考虑进去,会在选择剩余能量最多,同时以其到汇聚节点距离小的节点作为下一跳来传输数据,以实现多个簇之间的路由数据传输。通过Matlab仿真可以知道,改进后的协议使整个传感器网络的能量消耗变得更加均衡,同时使整个网络的生存时间得到了15%的延长。     

无线传感器网络功率路由算法研究

无线传感器网络的应用越来越广泛,主要是军事、工业、医疗等方面。然而无线传感器网络具有节点能量、存储和计算能力非常有限等特点,文中在传统的LEACH（低功耗自适应集簇分层型）协议的基础上进行了改进,并提出了一种新的无线传感器网络路由算法LEACH-N。新算法沿用了LEACH协议簇的结构,在簇头选择方法上基于传统DCHS算法的簇头选择算法,簇内成员与簇头之间直接通信,簇头与基站之间轮流进行单跳和多跳通信;多跳通信则是采用一种改进的MTE（最小传输能量）路由算法。通过NS2仿真软件对LEACH-N协议与LEACH协议分别进行了性能测试。实验结果表明,相比LEACH协议,LEACH—N协议系统能耗低、网络生命周期长,且具有更好的规模可扩展性。     

基于改进LEACH的多簇头分簇路由算法

为了降低无线传感器网络(WSN)的能耗,延长网络的生存周期,提出一种多簇头双工作模式的分簇路由算法.算法对低功耗自适应集簇分层(LEACH)协议作了以下改进:采用多簇头双工作模式来分担单簇头的负荷,以解决单簇头因能耗较大而过早消亡的问题;选举簇头时充分考虑节点位置和节点剩余能量,并应用粒子群优化(PSO)算法优化簇头的选举,以均衡网络内各节点的能耗;建立簇与簇之间的数据传输路由,以减少簇间通信的能耗.仿真结果表明,算法有效降低了网络的能耗,延长了网络的生存周期.     

基于TinyOS的无线传感器网络LEACH算法的改进

LEACH协议是无线传感器网络中最流行的分簇路由协议之一.针对LEACH算法簇分布不均匀以及网络能耗不均衡等问题提出了一种高效节能多跳路由算法.在簇建立阶段,新算法根据网络模型计算出最优簇头间距值,调整节点通信半径以控制簇的大小,形成合理网络拓扑结构;在数据传输阶段,簇头与基站之间采用多跳的通信方式,降低了节点能耗.在TinyOS操作系统下,使用nesC语言设计实现了LEACH-EEMH算法.基于TOSSIM平台的仿真结果表明,新算法较LEACH算法在均衡网络能耗、延长网络寿命方面具有显著优势.     

Energy‐efficient multihop routing in WSN using the hybrid optimization algorithm

The technical growth in the field of the wireless sensor networks (WSNs) has resulted in the process of collecting and forwarding the massive data between the nodes, which was a major challenge to the WSNs as it is associated with greater energy loss and delay. This resulted in the establishment of a routing protocol for the optimal selection of the multipath to progress the routing in WSNs. This paper proposes an energy‐efficient routing in WSNs using the hybrid optimization algorithm, cat–salp swarm algorithm (C‐SSA), which chooses the optimal hops in progressing the routing. Initially, the cluster heads (CHs) are selected using the low‐energy adaptive clustering hierarchy (LEACH) protocol that minimizes the traffic in the network. The CHs are engaged in the multihop routing, and the selection of the optimal paths is based on the proposed hybrid optimization, which chooses the optimal hops based on the energy constraints, such as energy, delay, intercluster distance, intracluster distance, link lifetime, delay, and distance. The simulation results prove that the proposed routing protocol acquired minimal delay of 0.3165 with 50 nodes and two hops, maximal energy of 0.1521 with 50 nodes and three hops, maximal number of the alive nodes as 39 with 100 nodes and two hops, and average throughput of 0.9379 with 100 nodes and three hops.     

Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks

Clustering and multi-hop routing algorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the load between multiple cluster heads, save the energy consumption of the inter-cluster routing, in this paper, we propose an energy-efficient routing algorithm based on Unequal Clustering Theory and Connected Graph Theory for WSN. The new algorithm optimizes and innovates in two aspects: cluster head election and clusters routing. In cluster head election, we take into consideration the vote-based measure and the transmission power of sensor nodes when to sectionalize these nodes into different unequal clusters. Then we introduce the connected graph theory for inter-cluster data communication in clusters routing. Eventually, a connected graph is constituted by the based station and all cluster heads. Simulation results show that, this new algorithm balances the energy consumption among sensor nodes, relieves the influence of energy-hole problem, improve the link quality, achieves a substantial improvement on reliability and efficiency of data transmission, and significantly prolongs the network lifetime.     

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

无线传感器网络（Wireless Sensor Networks,简称WSNs）作为一种新的获取信息的方式和处理模式,已成为通信领域的研究重点。而路由协议则是无线传感器网络当前的热点研究之一。目前,针对较为典型的分簇式路由协议LEACH路由协议的研究,是无线传感器网络目前研究的一个热点。介绍了无线传感器网络路由协议常见的攻击类型,并从路由安全的角度建议性的提出了一种对LEACH路由协议针对安全性的改进方案,并应用NS2仿真平台,对改进协议做了仿真并进行了性能分析。     

Fuzzy chessboard clustering and artificial bee colony routing method for energy‐efficient heterogeneous wireless sensor networks

Energy is an extremely critical resource for battery‐powered wireless sensor networks (WSNs), thus making energy‐efficient protocol design a key challenging problem. However, uneven energy consumption is an inherent problem in WSNs caused by multi‐hop routing and many‐to‐one traffic pattern among sensors. In this paper, we therefore propose a new clustering method called fuzzy chessboard clustering (FFC), which is capable to overcome the bottleneck problem and addressing the uneven energy consumption problem in heterogeneous WSNs. We also propose an energy‐efficient routing method called artificial bee colony routing method (ABCRM) to find the optimal routing path for the heterogeneous WSNs. ABCRM seeks to investigate the problems of balancing energy consumption and maximization of network lifetime. To demonstrate the effectiveness of FCC‐ABCRM in terms of lessening end‐to‐end delay, balancing energy consumption, and maximization of heterogeneous network lifetime, we compare our method with three approaches namely, chessboard clustering approach, PEGASIS, and LEACH. Simulation results show that the network lifetime achieved by FCC‐ABCRM could be increased by nearly 25%, 45%, and 60% more than that obtained by chessboard clustering, PEGASIS, and LEACH, respectively. Copyright © 2013 John Wiley & Sons, Ltd.     

An Energy-Efficient Routing Algorithm Based on Relative Identification and Direction for Wireless Sensor Networks

In studies of wireless sensor networks (WSNs), routing protocols in network layer is an important topic. To date, many routing algorithms of WSNs have been developed such as relative direction-based sensor routing (RDSR). The WSNs in such algorithm are divided into many sectors for routing. RDSR could simply reduce the number of routes as compared to the convention routing algorithm, but it has routing loop problem. In this paper, a less complex, more efficient routing algorithm named as relative identification and direction-based sensor routing (RIDSR) algorithm is proposed. RIDSR makes sensor nodes establish more reliable and energy-efficient routing path for data transmission. This algorithm not only solves the routing loop problem within the RDSR algorithm but also facilitates the direct selection of a shorter distance for routing by the sensor node. Furthermore, it saves energy and extends the lifetime of the sensor nodes. We also propose a new energy-efficient algorithm named as enhanced relative identification and direction-based sensor routing (ERIDSR) algorithm. ERISDR combines triangle routing algorithm with RIDSR. Triangle routing algorithm exploits a simple triangle rule to determine a sensor node that can save more energy while relaying data between the transmitter and the receiver. This algorithm could effectively economize the use of energy in near-sensor nodes to further extend the lifetime of the sensor nodes. Simulation results show that ERIDSR get better performance than RDSR, and RIDSR algorithms. In addition, ERIDSR algorithm could save the total energy in near-sensor nodes more effectively.     

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

Novel chemical reaction optimization based unequal clustering and routing algorithms for wireless sensor networks

Energy conserving of sensor nodes is the most crucial issue in the design of wireless sensor networks (WSNs). In a cluster based routing approach, cluster heads (CHs) cooperate with each other to forward their data to the base station (BS) via multi-hop routing. In this process, CHs closer to the BS are burdened with heavier relay traffic and tend to die prematurely which causes network partition is popularly known as a hot spot problem. To mitigate the hot spot problem, in this paper, we propose unequal clustering and routing algorithms based on novel chemical reaction optimization (nCRO) paradigm, we jointly call these algorithms as novel CRO based unequal clustering and routing algorithms (nCRO-UCRA). In clustering, we partition the network into unequal clusters such that smaller size clusters near to the sink and larger size clusters relatively far away from the sink. For this purpose, we develop the CH selection algorithm based on nCRO paradigm and assign the non-cluster head sensor nodes to the CHs based on derived cost function. Then, a routing algorithm is presented which is also based on nCRO based approach. All these algorithms are developed with the efficient schemes of molecular structure encoding and novel potential energy functions. The nCRO-UCRA is simulated extensively on various scenarios of WSNs and varying number of sensors and the CHs. The results are compared with some existing algorithms and original CRO based algorithm called as CRO-UCRA to show the superiority in terms of various performance metrics like residual energy, network lifetime, number of alive nodes, data packets received by the BS and convergence rate.     

An Enhanced Cluster Head Selection of LEACH Based on Power Consumption and Density of Sensor Nodes in Wireless Sensor Networks

The cluster head of LEACH algorithm was selected randomly in WSNs. It effects the distribution of clusters for the shadowing effect of obstruction in real scenarios. The network consumption is increased because of poor communication between nodes. A new selection method is presented to solve those problems in this paper. The logarithmic function is adopted to eliminate the shadowing effect of obstruction. The most suitable cluster is sorted out because the density of nodes is defined as the new threshold value. Simulation results show that the performances of new algorithm are obviously better than LEACH, ALEACH and Kost-LEACH algorithms. Compared with classical algorithms, the nodes utilization could enhance more than 2.0%, average energy consumption of the nodes is reduced by 9.1 J at least, and the probability of nodes failure to join the cluster could be decreased great than 3.7%.

     

基于网格的无线传感器网络非均匀分簇算法

在无线传感器网络中,首先要考虑的是如何解决能耗问题.针对无线传感器网络现有算法存在的节点能耗不均匀及节点部署密集造成的数据冗余和能量浪费,提出了一种节能路由算法UECG.通过设定虚拟网格以及非均匀分簇来实现网络能量的均衡消耗.仿真结果表明,与LEACH协议及其改进协议EEUC相比,UECG算法能够有效减少冗余数据,平衡簇群间的能量消耗,达到延长网络寿命的目的.     

Topology control of tactical wireless sensor networks using energy efficient zone routing

The US Department of Defense (DoD) routinely uses wireless sensor networks (WSNs) for military tactical communications. Sensor node die-out has a significant impact on the topology of a tactical WSN. This is problematic for military applications where situational data is critical to tactical decision making. To increase the amount of time all sensor nodes remain active within the network and to control the network topology tactically, energy efficient routing mechanisms must be employed. In this paper, we aim to provide realistic insights on the practical advantages and disadvantages of using established routing techniques for tactical WSNs. We investigate the following established routing algorithms: direct routing, minimum transmission energy (MTE), Low Energy Adaptive Cluster Head routing (LEACH), and zone clustering. Based on the node die out statistics observed with these algorithms and the topological impact the node die outs have on the network, we develop a novel, energy efficient zone clustering algorithm called EZone. Via extensive simulations using MATLAB, we analyze the effectiveness of these algorithms on network performance for single and multiple gateway scenarios and show that the EZone algorithm tactically controls the topology of the network, thereby maintaining significant service area coverage when compared to the other routing algorithms.     

Double Cluster Based Energy Efficient Routing Protocol for Wireless Sensor Network

Reducing the energy consumption of sensor nodes and prolonging the life of the network is the central topic in the research of wireless sensor network (WSN) protocol. The low-energy adaptive clustering hierarchy (LEACH) is one of the hierarchical routing protocols designed for communication in WSNs. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios. A developed routing protocol named as DL-LEACH is proposed. The DL-LEACH protocol cluster head election considers residual energy of nodes, distance from node to the base station and neighbor nodes, which makes cluster head election reasonable and node energy consumption balance. The simulation results of proposed protocols are compared for its network life time in MATLAB with LEACH protocol. The DL-LEACH is prolong the network life cycle by 75 % than LEACH.     

一种基于LEACH的无线传感器网络路由算法及仿真

在低功耗自适应分簇（LEACH,Low Energy Adaptive Clustering Hierarch）算法中,由于每一轮循环都要重新构造簇,距离较远的簇头节点可能会因长距离发送数据而过早耗尽自身能量,能量较低的节点当选为簇头节点时将会加速该节点的死亡,影响整个网络的生命周期。针对LEACH算法分簇机制中存在的不足,提出了一种改进的路由算法。仿真结果表明,改进算法通过考虑节点的剩余能量与固定分簇的方法,有效的改善了网络能量均衡,提高了网络生存时间。     

基于能量和密度的WSNs动态分区成簇路由算法

针对传统的层次型网络存在的分簇不合理和能耗不均衡等问题,提出了一种基于能量和密度的动态非均匀分区成簇路由算法。该算法先根据节点与基站之间的距离将网络合理地进行动态的区域划分,在区域内成簇,使靠近基站的簇规模小于距离基站较远的簇,减少靠近基站的簇首负担和能量消耗;通过综合考虑节点剩余能量和节点密度等因素来优化簇的非均匀划分和簇首的选择,簇首间采取基于数据聚合的多跳传输机制。仿真结果表明,与经典路由算法LEACH相比,该算法能有效均衡节点能耗,延长网络生命周期。     

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.