Multi Swarm Optimization Based Clustering with Tabu Search in Wireless Sensor Network.

A novel differential evolution based clustering algorithm for wireless sensor networks

Routing algorithms for large-scale sensor networks should be capable of finding energy efficient paths to prolong the lifetime of the networks in a decentralized manner. With this respect, Ant System has several proper characteristics for routing algorithm in large-scale wireless sensor networks. First, its distributed mechanism enables routing algorithm to find a solution with only local information and be robust for uncertainties in wireless sensor networks. Second, the framework of the Ant System is proper to solve dynamic problems such as routing problem. Transition probability in Ant System can be used to estimate how good a given routing path is. Capturing these features, this work proposes two Ant Systems based routing algorithms, which are AS-RWSNs (Ant System for Routing in Wireless Sensor Networks) and SAAS-RWSN (Structure-Aware AS-RWSN). The AS-RWSN applies the original Ant System to routing algorithm for wireless sensor network and SAAS-RSN upgrades AS-RWSN with considering properties of network structure such as degree of node. In SAAS-RSN, sensors with high node degree have high data traffic since they have more routing paths. Consequently, SAAS-RSN achieves an energy balance over sensor network through this routing scheme. We demonstrate the effectiveness of the proposed algorithms by comparing three existing routing algorithms.

Energy conservation and fault tolerance are the most two important challenging issues for the development of large scale wireless sensor networks (WSNs). Failure of cluster heads in a cluster based WSN is more catastrophic as they are responsible not only for data aggregation and transmission of the aggregated data to the base station but also relaying data for multi-hop communication. Therefore, a routing algorithm in WSNs should be energy aware as well as fault tolerant. In this paper, we present a distributed energy efficient and fault tolerant routing algorithm for WSNs. The algorithm selects next-hop cluster head in energy efficient manner in the data routing phase and carefully restores the connectivity of the neighbours of a cluster head in case of its failure. The algorithm is tested extensively by considering several scenarios of WSN. The experimental results are compared with the existing algorithms in terms of several metrics to show the effectiveness of the proposed algorithm.

Clustering sensor nodes into groups is an efficient topology control approach for achieving long-term operation of Wireless Sensor Networks (WSNs). The performance of clustering is greatly influenced by the selection of Cluster Heads (CHs), which are in charge of creating clusters and controlling member nodes. Finding the optimal set of CHs is known to be non-deterministic polynomial (NP)-hard problem for a WSN. Evolutionary computation approaches can be applied to find fast and efficient solutions to such problems. In this paper, the problem of CHs election is formulated as a single-objective optimization problem, aiming to obtain clusters that maximize the network energy efficiency and link quality. The formulated problem has been solved using three Evolutionary approaches: Genetic Algorithms (GA), Differential Evolution (DE) and Particle Swarm Optimization (PSO). Their performance has been compared in terms of the achieved fitness value. In addition, the performance of the proposed protocol is evaluated and compared to well-known cluster-based sensor network protocols.

Automatic localization is one of the major issues in Wireless Sensor Networks (WSN). DV-hop algorithm is a well-known localization algorithm in WSN but with limited localization accuracy. In this paper, an improved DV-hop localization algorithm in hybrid optical wireless sensor networks is proposed based on the optimization of the parameters in WSN. Various factors that affect the localization accuracy of the DV-hop algorithm in WSN are investigated, including the communication radius of the node, the number of beacon nodes and the number of the total nodes. As the DV-hop algorithm is applied into hybrid optical sensor and WSNs (O-WSN) with rectangular topology, different parameters have to be optimized accordingly. Simulation results show that the square topology outperforms the rectangle topology more than 45 % under the same network parameters using the improved DV-hop algorithm. Therefore another improved DV-hop called Sub-Square Weighted DV-hop (SSW DV-hop) is proposed for the rectangle topology. Both simulation and experiment results demonstrate that applying the SSW DV-hop algorithmin O-WSNs could significantly improve the localization accuracy.

Wireless sensor networks (WSNs) have been an emerging field in recent years. WSNs have major advantages in battlefields and emergency situations. However, due to the limited power of the sensor nodes, WSNs are restricted with their applications. The effective management of energy over the sensor nodes leads to good performance of the network. In this paper, we are proposing the energy-aware cluster head selection algorithm (ECHSA) for WSNs. The cluster head selection plays a major role in reducing the energy consumption of the cluster. To support our approach, the minimum energy transmission is proposed, and the simulation of the ECHSA is carried out with the NS-2 simulation. The results are compared with the sectored low energy adaptive cluster head (S-LEACH) and Theins algorithms. The results proved the efficiency of the proposed algorithm.

In Wireless Sensor Network (WSN), unreasonable node clustering algorithm will inevitably lead to premature death, unawareness of regional information.To address problems of traditional LEACH algorithm, An improved LEACH multi-hop routing algorithm based on Energy Distance Threshold (EDT) is presented. It mainly improves from aspects of cluster number, cluster head selection and inter-cluster communication. The improved clustering hierarchy algorithm considers the nodes Energy Distance Threshold as an important factor in selection then chooses the best cluster head within the area. The selection of cluster head is based on re-select manner, which dynamically and effectively select cluster heads by control cluster number and combing with EDT. After cluster head completes local data fusion and processing, it look for adjacent cluster head as next hop closer to base station with larger EDT if the head is far away from station. The next hop repeats above process till the base station is arrived. Such manner of multi-hop among clusters enables communication among clusters and base stations so as to avoid direct communication between head and station. The method reduces energy consumption and also balances energy. Simulation results show the improved LEACH algorithm has higher energy utilizing rate, and it helps prolong network’s lifetime.

One of the main emphases of the prevalent clustering and routing algorithms in wireless sensor networks is efficient energy utilization aimed towards enhanced network lifetime. In this paper we are proposing a clustering approach where the sensor nodes are clustered together based on a defined spatial correlation and the geographical location of each sensor nodes. The Cluster Head or Cluster Leader along with routing path is decided by our proposed algorithm based on the estimated chance-value during each rounds of data transfer. Thus in our scheme a multi-hop routing is effected wherein either two-level or three-level hops are dynamically chosen based on the spatial correlation existing between the nodes for the data transfer from the sensing node to the sink. It has been observed that our proposed algorithm outperforms the standard algorithms namely Low Energy Adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP) and Distributed Energy Efficient Clustering (DEEC) Protocol with regards to system throughput and Network Lifespan of WSN.

Lifetime requirements and coverage demands are emphasized in wireless sensor networks. An area coverage algorithm based on differential evolution is developed in this study to obtain a given coverage ratio [Formula: see text]. The proposed algorithm maximizes the lifetime of wireless sensor networks to monitor the area of interest. To this end, we translate continuous area coverage into classical discrete point coverage, so that the optimization process can be realized by wireless sensor networks. Based on maintaining the ε-coverage performance, area coverage algorithm based on differential evolution takes the minimal energy as optimization objective. In area coverage algorithm based on differential evolution, binary differential evolution is redeveloped to search for an improved node subset and thus meet the coverage demand. Taking into account that the results of binary differential evolution are depended on the initial value, the resulting individual is not an absolutely perfect node subset. A compensation strategy is provided to avoid unbalanced energy consumption for the obtained node subset by introducing the positive and negative utility ratios. Under the helps of those ratios and compensation strategy, the resulting node subset can be added additional nodes to remedy insufficient coverage, and redundancy active nodes can be pushed into sleep state. Furthermore, balance and residual energy are considered in area coverage algorithm based on differential evolution, which can expand the scope of population exploration and accelerate convergence. Experimental results show that area coverage algorithm based on differential evolution possesses high energy and computation efficiencies and provides 90% network coverage.

The main source of energy consumption in the wireless sensor network is due to transmission and receiving of data packets. However the cluster head (CH) near to the base station (BS) in cluster based wireless sensor network depletes energy faster and die quickly due to transmission of heavier data traffic of other CHs to the BS. In this paper we propose a particle swarm optimization (PSO) based approach which construct the routing path and distribute the routing load over the CHs near to the BS and maximize the lifetime of networks. We also consider the fault tolerance issue due to the sudden failure of CHs during data routing phase. The simulation results show the effectiveness of the proposed algorithm over the existing algorithms.

Wireless Sensor Network (WSN) is a promising approach that is developed for a wide range of applications due to its low installation cost. However, the nodes in the WSN are susceptible to different security threats, because these nodes are located in hostile or harsh environments. Moreover, an inappropriate selection of routing path affects the data delivery of the WSN. The important goal of this paper is to obtain secure data transmission while minimizing energy consumption. In this paper, Trust Centric - Multiobjective Black Widow Optimization (TC-MBWO) is proposed for selection of Secure Cluster Head (SCH) from the large-scale WSN. Moreover, the secure routing path is generated by using the TC-MBWO, in which the factors considered for the cost function are: residual energy, distance, trust and node degree. Therefore, the secured clustering and routing achieved by using TC-MBWO, provides the resistance against malicious nodes and simultaneously the energy consumption is also minimized by identifying the shortest path. The proposed TC-MBWO method is analyzed in terms of alive nodes, dead nodes, energy consumption, throughput, and network lifetime. Here, the TC-MBWO method is compared with different existing methods such as Low Energy Adaptive Clustering Hierarchy (LEACH), Particle Swarm Optimization - Grey Wolf Optimizer (PSO-GWO), Particle-Water Wave Optimization (P-WWO) and Particle-based Spider Monkey Optimization (P-SMO). The alive nodes of the TC-MBWO are 70 for 2800 rounds which are higher in number when compared to the PSO-GWO, P-WWO and P-SMO.

Partition of networks into optimal set of clusters is the prominent technique to prolong the network lifetime of energy constrained wireless sensor networks. Enumeration search method cannot find optimal clusters within polynomial bounded time for large scale networks since the computational complexity of problem grows exponentially with the dimension of networks. Optimal cluster configuration in sensor networks is known to be Non-deterministic Polynomial (NP)-hard optimization problem and for that reason we have applied polynomial time metaheuristic algorithms to find optimal or near-optimal solutions. In this paper, we present clustering algorithms based on Simulated Annealing (SA) and Particle Swarm Optimization (PSO) to find optimal set of cluster heads in the network. The optimization problem consists of finding optimal configuration of clusters such that the communication distance per cluster is not only minimized but the cluster balance and energy efficiency is also maintained in the network. The SA and PSO toolboxes are developed in C++ and integrated with OMNeT++ simulation environment to implement the proposed clustering algorithms. The performance of algorithms with respect to network lifetime, load balance and energy efficiency of network is examined in the simulation.

Lifetime and energy consumption are the main objectives of wireless sensor networks (WSNs). The existing methodologies have certain inhibitions which limit their applications. Clustering optimization is a major technique in any wireless sensor networks to optimize energy efficiency. Clustering technique assembles the objects of comparable shape in one shape. This technique is the excellent data assembly model for WSN, and it handles the redundant data within the network. The selection of the cluster head is an important feature in the clustering technique, then cluster heads cumulative the data and transmits to sink. Here fuzzy logic control algorithm has been proposed with hybridized particle swarm optimization algorithm and gravitational search algorithm to select cluster heads in WSN (FHPSOGSA). The algorithm is used to merge the constraints like remaining energy, node degree and distance to sink and select the best appropriate nodes as Cluster Head (CH). Simulation outcome displays that the proposed algorithm (FHPSOGSA) is establish to yield best results over other conventional algorithms.

In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes’ transmission power in two-tiered hierarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy & Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated information to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs’ transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs’ transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node’s degree, average node’s power radius and network lifetime, respectively.

Wireless sensor networks are energy constraint networks. Energy efficiency, to prolong the network for a longer time is critical issue for wireless sensor network protocols. Clustering protocols are energy efficient approaches to extend the lifetime of network. Intra-cluster communication is the main driving factor for energy efficiency of clustering protocols. Intra-cluster energy consumption depends upon the position of cluster head in the cluster. Wrongly positioned clusters head make cluster more energy consuming. In this paper, a simple and efficient cluster head selection scheme is proposed, named Smart Cluster Head Selection (SCHS). It can be implemented with any distributed clustering approach. In SCHS, the area is divided into two parts: border area and inner area. Only inner area nodes are eligible for cluster head role. SCHS reduces the intra-cluster communication distance hence improves the energy efficiency of cluster. The simulation results show that SCHS has significant improvement over LEACH in terms of lifetime of network and data units gathered at base station.