Energy-Aware Clustering in the Internet of Things by Using the Genetic Algorithm

Internet of things (IoT) uses a lot of key technologies to collect different types of data around the world to make an intelligent and integrated whole. This concept can be as simple as a connection between a smartphone and a smart TV, or can be complex communications between the urban infrastructure and traffic monitoring systems. One of the most challenging issues in the IoT environment is how to make it scalable and energy-efficient with regard to its growing dimensions. Object clustering is a mechanism that increases scalability and provides energy efficiency by minimizing communication energy consumption. Since IoT is a large scale dynamic environment, clustering of its objects is a NP-Complete problem. This paper formulates energy-aware clustering of things as an optimization problem targeting an optimum point in which, the total consumed energy and communication cost are minimal. Then. it employs the Genetic Algorithm (GA) to solve this optimization problem by extracting the optimal number of clusters as well as the members of each cluster. In this paper, a multi objective GA for clustering that has not premature convergence problem is used. In addition, for fast GA execution multiple implementation, considerations has been measured. Moreover, the consumed energy for received and sent data, node to node and node to BS distance have been considered as effective parameters in energy consumption formulation. Numerical simulation results show the efficiency of this method in terms of the consumed energy, network lifetime, the number of dead nodes and load balancing

Hard and Soft Thresholding Based Genetic enthused Reactive Routing Protocol for Heterogeneous Sensor Network

Wireless Sensor Network has a wide area of applications but the main problem in WSN is its lifetime.To solve the issue of short lifetime of the WSN, hard and soft thresholding is infused with genetic algorithm. By using the genetic algorithm the energy consumption of the nodes is greatly reduced and the lifetime of the WSN also increases. By making use of hard thresholding (HT) and soft thresholding (ST) the network becomes a reactive network which saves the energy of the nodes during the data transmission also. Moreover the genetic algorithm has been used for clustering of the nodes and the thresholding has been used for the data transmission in the proposed protocol. The simulations of have shown increase in stability and the lifetime of the genetic algorithm (GA) based reactive protocol as compared to the genetic algorithm (GA) inspired protocol

Survey on Multi Agent Energy Efficient Clustering Algorithms in Wireless Sensor Networks

In the last few years, there are many applications for Wireless Sensor Networks (WSNs). One of the main drawbacks of these networks is the limited battery power of sensor nodes. There are many cases to reduce energy consumption in WSNs. One of them is clustering. Sensor nodes partitioned into the clusters so that one is chosen as Cluster Head (CH). Clustering and selection of the proper node as CH is very significant in reducing energy consumption and increasing network lifetime. In this paper, we have surveyed a multi agent clustering algorithms and compared on various parameters like cluster size, cluster count, clusters equality, parameters used in CHs selection, algorithm complexity, types of algorithm used in clustering, nodes location awareness, inter-cluster and intra-cluster topologies, nodes homogeneity and MAC layer communications

Genetic Algorithm based Cluster Head Selection for Optimimized Communication in Wireless Sensor Network

Wireless Sensor Network (WSNs) utilizes conveyed gadgets sensors for observing physical or natural conditions. It has been given to the steering conventions which may contrast contingent upon the application and system design. Vitality administration in WSN is of incomparable significance for the remotely sent vitality sensor hubs. The hubs can be obliged in the little gatherings called the Clusters. Clustering is done to accomplish the vitality effectiveness and the versatility of the system. Development of the group likewise includes the doling out the part to the hub based on their borders. In this paper, a novel strategy for cluster head selection based on Genetic Algorithm (GA) has been proposed. Every person in the GA populace speaks to a conceivable answer for the issue. Discovering people who are the best proposals to the enhancement issue and join these people into new people is a critical phase of the transformative procedure. The Cluster Head (CH) is picked using the proposed technique Genetic Algorithm based Cluster Head (GACH). The performance of the proposed system GACH has been compared with Particle Swarm Optimization Cluster Head (PSOCH). Simulations have been conducted with 14 wireless sensor nodes scattered around 8 kilometers. Results proves that GACH outperforms than PSOCH in terms of throughput, packet delivery ratio and energy efficiency

Genetic Algorithm based Cluster Head Selection for Optimimized Communication in Wireless Sensor Network

Wireless Sensor Network (WSNs) utilizes conveyed gadgets sensors for observing physical or natural conditions. It has been given to the steering conventions which may contrast contingent upon the application and system design. Vitality administration in WSN is of incomparable significance for the remotely sent vitality sensor hubs. The hubs can be obliged in the little gatherings called the Clusters. Clustering is done to accomplish the vitality effectiveness and the versatility of the system. Development of the group likewise includes the doling out the part to the hub based on their borders. In this paper, a novel strategy for cluster head selection based on Genetic Algorithm (GA) has been proposed. Every person in the GA populace speaks to a conceivable answer for the issue. Discovering people who are the best proposals to the enhancement issue and join these people into new people is a critical phase of the transformative procedure. The Cluster Head (CH) is picked using the proposed technique Genetic Algorithm based Cluster Head (GACH). The performance of the proposed system GACH has been compared with Particle Swarm Optimization Cluster Head (PSOCH). Simulations have been conducted with 14 wireless sensor nodes scattered around 8 kilometers. Results proves that GACH outperforms than PSOCH in terms of throughput, packet delivery ratio and energy efficiency

A heuristic crossover enhanced evolutionary algorithm for clustering wireless sensor network

© Springer International Publishing Switzerland 2016.In this paper, a Heuristic-Crossover Enhanced Evolutionary Algorithm for Cluster Head Selection is proposed. The algorithm uses a novel heuristic crossover operator to combine two different solutions in order to achieve a high quality solution that distributes the energy load evenly among the sensor nodes and enhances the distribution of cluster head nodes in a network. Additionally, we propose the Stochastic Selection of Inactive Nodes, a mechanism inspired by the Boltzmann Selection process in genetic algorithms. This mechanism stochastically considers coverage effect in the selection of nodes that are required to go into sleep mode in order to conserve energy of sensor nodes. The proposed selection of inactive node mechanisms and cluster head selections protocol are performed sequentially at every round and are part of the main algorithm proposed, namely the Heuristic Algorithm for Clustering Hierarchy (HACH). The main goal of HACH is to extend network lifetime of wireless sensor networks by reducing and balancing the energy consumption among sensor nodes during communication processes. Our protocol shows improved performance compared with state-of-the-art protocols like LEACH, TCAC and SEECH in terms of improved network lifetime for wireless sensor networks deployments

Opportunistic data collection and routing in segmented wireless sensor networks

La surveillance régulière des opérations dans les aires de manoeuvre (voies de circulation et pistes) et aires de stationnement d'un aéroport est une tâche cruciale pour son fonctionnement. Les stratégies utilisées à cette fin visent à permettre la mesure des variables environnementales, l'identification des débris (FOD) et l'enregistrement des statistiques d'utilisation de diverses sections de la surface. Selon un groupe de gestionnaires et contrôleurs d'aéroport interrogés, cette surveillance est un privilège des grands aéroports en raison des coûts élevés d'acquisition, d'installation et de maintenance des technologies existantes. Les moyens et petits aéroports se limitent généralement à la surveillance de quelques variables environnementales et des FOD effectuée visuellement par l'homme. Cette dernière activité impose l'arrêt du fonctionnement des pistes pendant l'inspection. Dans cette thèse, nous proposons une solution alternative basée sur les réseaux de capteurs sans fil (WSN) qui, contrairement aux autres méthodes, combinent les propriétés de faible coût d'installation et maintenance, de déploiement rapide, d'évolutivité tout en permettant d'effectuer des mesures sans interférer avec le fonctionnement de l'aéroport. En raison de la superficie d'un aéroport et de la difficulté de placer des capteurs sur des zones de transit, le WSN se composerait d'une collection de sous-réseaux isolés les uns des autres et du puits. Pour gérer cette segmentation, notre proposition s'appuie sur l'utilisation opportuniste des véhicules circulants dans l'aéroport considérés alors comme un type spécial de nœud appelé Mobile Ubiquitous LAN Extension (MULE) chargé de collecter les données des sous-réseaux le long de son trajet et de les transférer vers le puits. L'une des exigences pour le déploiement d'un nouveau système dans un aéroport est qu'il cause peu ou pas d'interruption des opérations régulières. C'est pourquoi l'utilisation d'une approche opportuniste basé sur des MULE est privilégiée dans cette thèse. Par opportuniste, nous nous référons au fait que le rôle de MULE est joué par certains des véhicules déjà existants dans un aéroport et effectuant leurs déplacements normaux. Et certains nœuds des sous- réseaux exploiteront tout moment de contact avec eux pour leur transmettre les données à transférer ensuite au puits. Une caractéristique des MULEs dans notre application est qu'elles ont des trajectoires structurées (suivant les voies de circulation dans l'aéroport), en ayant éventuellement un contact avec l'ensemble des nœuds situés le long de leur trajet (appelés sous-puits). Ceci implique la nécessité de définir une stratégie de routage dans chaque sous-réseau, capable d'acheminer les données collectées des nœuds vers les sous-puits et de répartir les paquets de données entre eux afin que le temps en contact avec la MULE soit utilisé le plus efficacement possible. Dans cette thèse, nous proposons un protocole de routage remplissant ces fonctions. Le protocole proposé est nommé ACME (ACO-based routing protocol for MULE-assisted WSNs). Il est basé sur la technique d'Optimisation par Colonies de Fourmis. ACME permet d'assigner des nœuds à des sous-puits puis de définir les chemins entre eux, en tenant compte de la minimisation de la somme des longueurs de ces chemins, de l'équilibrage de la quantité de paquets stockés par les sous-puits et du nombre total de retransmissions. Le problème est défini comme une tâche d'optimisation multi-objectif qui est résolue de manière distribuée sur la base des actions des nœuds dans un schéma collaboratif. Nous avons développé un environnement de simulation et effectué des campagnes de calculs dans OMNeT++ qui montrent les avantages de notre protocole en termes de performances et sa capacité à s'adapter à une grande variété de topologies de réseaux.The regular monitoring of operations in both movement areas (taxiways and runways) and non-movement areas (aprons and aircraft parking spots) of an airport, is a critical task for its functioning. The set of strategies used for this purpose include the measurement of environmental variables, the identification of foreign object debris (FOD), and the record of statistics of usage for diverse sections of the surface. According to a group of airport managers and controllers interviewed by us, the wide monitoring of most of these variables is a privilege of big airports due to the high acquisition, installation and maintenance costs of most common technologies. Due to this limitation, smaller airports often limit themselves to the monitoring of environmental variables at some few spatial points and the tracking of FOD performed by humans. This last activity requires stopping the functioning of the runways while the inspection is conducted. In this thesis, we propose an alternative solution based on Wireless Sensor Network (WSN) which, unlike the other methods/technologies, combines the desirable properties of low installation and maintenance cost, scalability and ability to perform measurements without interfering with the regular functioning of the airport. Due to the large extension of an airport and the difficulty of placing sensors over transit areas, the WSN might result segmented into a collection of subnetworks isolated from each other and from the sink. To overcome this problem, our proposal relies on a special type of node called Mobile Ubiquitous LAN Extension (MULE), able to move over the airport surface, gather data from the subnetworks along its way and eventually transfer it to the sink. One of the main demands for the deployment of any new system in an airport is that it must have little or no interference with the regular operations. This is why the use of an opportunistic approach for the transfer of data from the subnetworks to the MULE is favored in this thesis. By opportunistic we mean that the role of MULE will be played by some of the typical vehicles already existing in an airport doing their normal displacements, and the subnetworks will exploit any moment of contact with them to forward data to the sink. A particular characteristic of the MULEs in our application is that they move along predefined structured trajectories (given by the layout of the airport), having eventual contact with the set of nodes located by the side of the road (so-called subsinks). This implies the need for a data routing strategy to be used within each subnetwork, able to lead the collected data from the sensor nodes to the subsinks and distribute the data packets among them so that the time in contact with the MULE is used as efficiently as possible. In this thesis, we propose a routing protocol which undertakes this task. Our proposed protocol is named ACME, standing for ACO-based routing protocol for MULE-assisted WSNs. It is founded on the well known Ant Colony Optimization (ACO) technique. The main advantage of ACO is its natural fit to the decentralized nature of WSN, which allows it to perform distributed optimizations (based on local interactions) leading to remarkable overall network performance. ACME is able to assign sensor nodes to subsinks and generate the corresponding multi-hop paths while accounting for the minimization of the total path length, the total subsink imbalance and the total number of retransmissions. The problem is defined as a multi-objective optimization task which is resolved in a distributed manner based on actions of the sensor nodes acting in a collaborative scheme. We conduct a set of computational experiments in the discrete event simulator OMNeT++ which shows the advantages of our protocol in terms of performance and its ability to adapt to a variety of network topologie

A genetic algorithm-based energy-aware multi-hop clustering scheme for heterogeneous wireless sensor networks

Background: The energy-constrained heterogeneous nodes are the most challenging wireless sensor networks (WSNs) for developing energy-aware clustering schemes. Although various clustering approaches are proven to minimise energy consumption and delay and extend the network lifetime by selecting optimum cluster heads (CHs), it is still a crucial challenge.Methods: This article proposes a genetic algorithm-based energy-aware multi-hop clustering (GA-EMC) scheme for heterogeneous WSNs (HWSNs). In HWSNs, all the nodes have varying initial energy and typically have an energy consumption restriction. A genetic algorithm determines the optimal CHs and their positions in the network. The fitness of chromosomes is calculated in terms of distance, optimal CHs, and the node's residual energy. Multi-hop communication improves energy efficiency in HWSNs. The areas near the sink are deployed with more supernodes far away from the sink to solve the hot spot problem in WSNs near the sink node.Results: Simulation results proclaim that the GA-EMC scheme achieves a more extended network lifetime network stability and minimises delay than existing approaches in heterogeneous nature.peer-reviewe