A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

In wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.     

Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

基于事件驱动的动态分簇网络的协作传输方法

针对事件驱动的无线传感器网络的传输可靠性问题,该文利用节点间的互助,提出一种基于事件驱动的动态分簇网络的协作传输方法。无事件发生时,各节点按预先形成的静态簇低频传输数据。而一旦有事件发生,能感知事件发生的节点快速组成事件簇,向簇头发送采集的数据,簇头融合数据后发往汇聚节点。为提升传输可靠性,当簇头传输失败时,由最佳中继协作转发数据给汇聚节点。在最佳中继的选择上,考虑到事件的连续移动,以及处于事件前向通道上的节点具有较大的感应值和较好的协作能力等条件,该文提出了基于前向通道的最佳中继选择策略。仿真和实验结果表明,所提协作传输方法能够有效提高传输可靠性。     

一种负载均衡且能量高效的水下传感网络分簇协议

针对水下无线传感网络能量效率低、生命周期短的问题,提出了一种负载均衡且能量高效的水下分簇（load balanced and energy efficient underwater clustering,LBEEUC）协议。该算法在分簇过程中首先根据节点的经验负载来确定节点所在区域簇头的比例,使经验负载大的区域分布较多的簇头,分担数据转发的任务,均衡网络的能耗;其次在节点入簇时,在簇内设置中继节点,用于均衡远离簇头节点的传输能耗,并提前进行数据融合,减少数据冗余;最后在建立簇间路由时,利用Q 学习算法根据路径消耗的总能量最小的原则选择最优传输路径。仿真结果表明,本算法有效地均衡了网络的能耗,提高了能量利用效率,进而提高了网络的生存时间。     

IAMMAC: an interference‐aware multichannel MAC protocol for wireless sensor–actor networks

In this paper, we discuss an interference aware multichannel MAC (IAMMAC) protocol assign channels for communication in wireless sensor‐actor networks. An actor acts as a cluster head for k‐hop sensors and computes the shortest path for all the sensors. Then, the actor partitions the cluster into multiple subtrees and assigns a noninterference channel to each subtree. The actor 1‐hop sensors are represented as relay nodes. The actor selects a relay node as a backup cluster head (BCH) based on the residual energy and node degree. After selecting a BCH from the relay nodes, the actor broadcast this information to the remaining relay nodes using the common control channel. The relay sensors use the same channel of BCH to communicate with it. However, the other cluster members do not change their data channel. Further, interference‐aware and throughput‐aware multichannel MAC protocol is also proposed for actor–actor coordination. The performance of the proposed IAMMAC protocol is analyzed using standard network parameters such as packet delivery ratio, goodput, end‐to‐end delay, and energy dissipation in the network. The obtained simulation results indicate that the IAMMAC protocol has superior performance as compared with the existing MAC protocols. Copyright © 2015 John Wiley & Sons, Ltd.     

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

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

Deterministic K‐means secure coverage clustering with periodic authentication for wireless sensor networks

Innovative and emerging developments in sensor networks are proven to be the backbone for real‐time applications such as satellite communications, military and border area surveillance systems, health care systems, traffic monitoring systems, seismic and underwater monitoring systems, and agriculture and habitat environment systems. Coverage and clustering techniques enable the sensor network to operate in group‐based and region‐based communication and thus save the node energy. Energy‐efficient protocols save the node energy and increase the network life cycle in a resource‐constrained sensor network. Cluster head (CH) node manages and controls the operations such as network topology, coverage area, and routing paths (multi‐paths and fault‐tolerant paths) of the network. In this paper, we present deterministic K‐means secure coverage clustering (K‐SCC) with periodic authentication. The proposed protocol uses coverage clustering technique with periodic authentication between the CH node and sensor nodes to establish the secure channel in the network. Maximum cover of K nodes is maintained in the secure coverage cluster to achieve authenticated communication between the sensor nodes in the network. The proposed K‐SCC protocol is compared with the existing protocols such as deterministic‐SCC and random‐SCC protocols. Simulation results indicate that the proposed K‐SCC protocol achieves an average of 84% coverage ratio (cluster/sensor node ratio) as compared with 62% coverage ratio in the existing SCC protocols. Simulations also indicate that the proposed K‐SCC protocol consumes 20% less energy as compared with the existing SCC protocol. Copyright © 2015 John Wiley & Sons, Ltd.     

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算法在每轮数据传输过程中,所有子节点均向汇聚节点传输数据,成员节点充当簇头次数不均匀,导致信息冗余与节点能量浪费,使网络生存时间变短。针对这一问题,提出了一种基于部分成员节点随机转发机制的分簇算法,让子节点在数据传输过程中,按照均匀分布规律,选择部分节点工作。仿真结果显示,与经典的LEACH算法相比,改进后的协议延长了约38%的网络寿命,推迟了第一节点死亡时间约13%,大大地降低了能耗。在大规模网络仿真方面,优势更明显。     

一种基于K-means的WSN移动汇聚路由算法

无线传感网络(Wireless Sensor Network,WSN)作为一种资源受限的网络,网络中节点的能耗直接影响了网络的性能。因此,均衡网络中的能耗,延长网络的生命周期,成为设计WSN路由算法的重要目标。于是,在LEACH-C协议的基础上提出了一种移动汇聚路由算法。分簇阶段由Sink节点计算最优簇首个数,通过K-means聚类将网络中的节点划分至不同的集群,选择通信成本最低的节点作为各集群的簇首。稳定传输阶段通过移动Sink进行数据采集,针对不同的延迟分别规划Sink节点的移动轨迹。MATLAB仿真结果表明,与LEACH和LEAHC-C算法相比簇首的分布更合理,结合Sink节点的移动策略能有效均衡网络能耗,延长网络的寿命。     

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

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

Dynamic clustering approach based on wireless sensor networks genetic algorithm for IoT applications

Energy is vital parameter for communication in Internet of Things (IoT) applications via Wireless Sensor Networks (WSN). Genetic algorithms with dynamic clustering approach are supposed to be very effective technique in conserving energy during the process of network planning and designing for IoT. Dynamic clustering recognizes the cluster head (CH) with higher energy for the data transmission in the network. In this paper, various applications, like smart transportation, smart grid, and smart cities, are discussed to establish that implementation of dynamic clustering computing-based IoT can support real-world applications in an efficient way. In the proposed approach, the dynamic clustering-based methodology and frame relay nodes (RN) are improved to elect the most preferred sensor node (SN) amidst the nodes in cluster. For this purpose, a Genetic Analysis approach is used. The simulations demonstrate that the proposed technique overcomes the dynamic clustering relay node (DCRN) clustering algorithm in terms of slot utilization, throughput and standard deviation in data transmission.

     

Energy Efficient QoS Aware Hierarchical KF-MAC Routing Protocol in Manet

The paper proposes an energy efficient quality of services (QoS) aware hierarchical KF-MAC routing protocol in mobile ad-hoc networks. The proposed KF-MAC (K-means cluster formation firefly cluster head selection based MAC routing) protocol reduces the concentration of QoS parameters when the node transmits data from source to destination. At first, K-means clustering technique is utilized for clustering the network into nodes. Then the clustered nodes are classified and optimized by the firefly optimization algorithm to find cluster heads for the clustered nodes. The transmission of data begins in the network nodes and TDMA based MAC routing does communication. The observation on KF-MAC protocol performs well for QoS parameters such as bandwidth, delay, bit error rate and jitter. The evaluation of proposed protocol based on a simulation study concludes that the proposed protocol provides a better result in contrast to the existing fuzzy based energy aware routing protocol and modified dynamic source routing protocol. With KF-MAC protocol, the collision free data transmission with low average energy consumption is achieved.     

基于改进SSA优化WSN分簇协议

无线传感器网络(Wireless Sensor Networks,WSN)的路由协议是无线传感器网络领域中的一个研究热点.针对LEACH协议的不足,提出一种基于自适应t分布改进麻雀搜索算法(Improved Sparrow Search Algorithm,ISSA)的改进LEACH协议(LEACH?ISSA),以解决...     

A novel residual energy‐based distributed clustering and routing approach for performance study of wireless sensor network

Non‐uniform energy consumption during operation of a cluster‐based routing protocol for large‐scale wireless sensor networks (WSN) is major area of concern. Unbalanced energy consumption in the wireless network results in early node death and reduces the network lifetime. This is because nodes near the sink are overloaded in terms of data traffic compared with the far away nodes resulting in node deaths. In this work, a novel residual energy–based distributed clustering and routing (REDCR) protocol has been proposed, which allows multi‐hop communication based on cuckoo‐search (CS) algorithm and low‐energy adaptive‐clustering–hierarchy (LEACH) protocol. LEACH protocol allows choice of possible cluster heads by rotation at every round of data transmission by a newly developed objective function based on residual energy of the nodes. The information about the location and energy of the nodes is forwarded to the sink node where CS algorithm is implemented to choose optimal number of cluster heads and their positions in the network. This approach helps in uniform distribution of the cluster heads throughout the network and enhances the network stability. Several case studies have been performed by varying the position of the base stations and by changing the number of nodes in the area of application. The proposed REDCR protocol shows significant improvement by an average of 15% for network throughput, 25% for network scalability, 30% for network stability, 33% for residual energy conservation, and 60% for network lifetime proving this approach to be more acceptable one in near future.     

Low-Energy Adaptive Unequal Clustering Protocol Using Fuzzy c-Means in Wireless Sensor Networks

Clustering technique in wireless sensor networks incorporate proper utilization of the limited energy resources of the deployed sensor nodes with the highest residual energy that can be used to gather data and send the information. However, the problem of unbalanced energy consumption exists in a particular cluster node in the network. Some more powerful nodes act as cluster head to control sensor network operation when the network is organized into heterogeneous clusters. It is important to assume that energy consumption of these cluster head nodes is balanced. Often the network is organized into clusters of equal size where cluster head nodes bear unequal loads. Instead in this paper, we proposed a new protocol low-energy adaptive unequal clustering protocol using Fuzzy c-means in wireless sensor networks (LAUCF), an unequal clustering size model for the organization of network based on Fuzzy c-means (FCM) clustering algorithm, which can lead to more uniform energy dissipation among the cluster head nodes, thus increasing network lifetime. A heuristic comparison between our proposed protocol LAUCF and other different energy-aware protocol including low energy adaptive clustering hierarchy (LEACH) has been carried out. Simulation result shows that our proposed heterogeneous clustering approach using FCM protocol is more effective in prolonging the network lifetime compared with LEACH and other protocol for long run.     

无线传感器网络的分区异构分簇协议研究

针对无线传感器网络能量受限和路由协议中节点能量消耗不均衡的问题,提出一种新的无线传感器网络的分区异构分簇协议(PHC协议).该协议的核心是将3种不同能量等级的节点根据能量的不同分别部署在不同区域,能量较高的高级节点和中间节点使用聚类技术通过簇头直接传输数据到汇聚点,能量较低的普通节点则直接传输数据到汇聚点.仿真结果表明,该协议通过对节点合理的分配部署,使簇头分布均匀,更好地均衡了节点的能量消耗,延长了网络的稳定期,提高了网络的吞吐量,增强了网络的整体性能.     

一种多媒体传感器网络低能耗分簇协议

多媒体传感器网络面临的主要挑战是在能量受限的情况下传输大量数据。在经典分簇协议LEACH的基础上,提出一种考虑数据量的多媒体传感器网络低能耗分簇协议。在簇头选举阶段,选择剩余能量多和数据量大的节点作为簇头;在成簇阶段,同时考虑节点到簇头的通信距离和节点的数据量让节点加入簇。仿真结果表明,提出的协议能有效提高网络的生命周期。     

交通路灯监控系统的无线传感网链状路由算法

在交通路灯监控系统中为节省网络节点能耗和降低数据传输时延,提出一种无线传感网链状路由算法（CRASMS）。该算法根据节点和监控区域的信息将监控区域分成若干个簇区域,在每一个簇区域中依次循环选择某个节点为簇头节点,通过簇头节点和传感节点的通信建立簇内星型网络,最终簇头节点接收传感节点数据,采用数据融合算法降低数据冗余,通过簇头节点间的多跳路由将数据传输到Sink节点并将用户端的指令传输到被控节点。仿真结果表明：CRASMS算法保持了PEGASIS算法在节点能耗方面和LEACH算法在传输时延方面的优点,克服了PEGASIS 算法在传输时延方面和LEACH算法在节点能耗方面的不足,将网络平均节点能耗和平均数据传输时延保持在较低水平。在一定的条件下,CRASMS算法比LEACH和PEGASIS算法更优。     

基于冗余节点的LEACH协议的改进

无线传感器网络中LEACH协议是一种典型的能有效延长网络生命周期的节能通信协议。因为其优秀的节能效果和其简单的规程得到了广泛的认可。但是LEACH簇头算法存在簇头开销大、簇头没有确定的数量和位置等不足。而在成簇后的稳定阶段,节点通过一跳通信将数据传送给簇头,簇头也通过一跳通信将聚合后的数据传送给基站,这样会造成簇头节点...