Wireless sensor networks (WSNs) is an emerging technology in several application domains, ranging from urban surveillance to environmental and structural monitoring. Computational intelligence (CI) techniques are particularly suitable for enhancing these systems. However, when embedding CI into wireless sensors, severe hardware limitations must be taken into account. In this paper we investigate the possibility to perform an online, distributed optimization process within a WSN. Such a system might be used, for example, to implement advanced network features like distributed modelling, self-optimizing protocols, and anomaly detection, to name a few. The proposed approach, called DOWSN (distributed optimization for WSN) is an island-model infrastructure in which each node executes a simple, computationally cheap (both in terms of CPU and memory) optimization algorithm, and shares promising solutions with its neighbors. We perform extensive tests of different DOWSN configurations on a benchmark made up of 15 continuous optimization problems; we analyze the influence of the network parameters (number of nodes, inter-node communication period and probability of accepting incoming solutions) on the optimization performance. Finally, we profile energy and memory consumption of DOWSN to show the efficient usage of the limited hardware resources available on the sensor nodes.
Clustering is a mechanism which creates (either static or dynamic) clusters of nodes, where a node is elected cluster-head and collects data from its neighbors. Optimizing the packet traffic, clustering is an effective means to balance energy consumption, improve network life-cycle and ensure a reliable communication. Several clustering algorithms have been proposed in the context of WSNs. For example, in @cite_31 cluster-head selection is performed modeling the WSN as a neural network (being each node a neuron) whose structure and weights are adjusted by means of Genetic Algorithm (GA). A similar study is presented in @cite_17 , where Multi Objective PSO (MOPSO) is applied to dynamic clustering.
@cite_31 @cite_17
2103625053 2061879708 2043763095 1975092558
In wireless sensor networks, the use of energy efficient infrastructure such as clustering may be used to lengthen the network lifetime and prevent network connectivity degradation. In such systems, the performance of the clustering scheme is generally influenced by the cluster head selection method and the number of clusters. This paper presents a dynamic clustering method with multi-objectives that automatically determines the optimum number of clusters in the network. The algorithm, which is based on binary particle swarm pptimization (PSO), eliminates the need to set the number of clusters a priori. In addition, a multi-objective approach is utilized in the cluster head selection algorithm in order to select the best set of cluster heads. Simulation results demonstrate that the proposed protocol can achieve an optimal number of clusters, as well as prolong the network lifetime and increase the data delivery at the base station when compared to other well known clustering algorithms. A suitable clustering algorithm for grouping sensor nodes can increase the energy efficiency of WSNs. However, clustering requires additional overhead, such as cluster head selection and assignment, and cluster construction. This paper proposes a new regional energy aware clustering method using isolated nodes for WSNs, called Regional Energy Aware Clustering with Isolated Nodes (REAC-IN). In REAC-IN, CHs are selected based on weight. Weight is determined according to the residual energy of each sensor and the regional average energy of all sensors in each cluster. Improperly designed distributed clustering algorithms can cause nodes to become isolated from CHs. Such isolated nodes communicate with the sink by consuming excess amount of energy. To prolong network lifetime, the regional average energy and the distance between sensors and the sink are used to determine whether the isolated node sends its data to a CH node in the previous round or to the sink. The simulation results of the current study revealed that REAC-IN outperforms other clustering algorithms. Wireless Sensor Networks (WSN) represent a new dimension in the field of network research. The cluster algorithm can significantly reduce the energy consumption of wireless sensor networks and prolong the network lifetime. This paper uses neuron to describe the WSN node and constructs neural network model for WSN. The neural network model includes three aspects: WSN node neuron model, WSN node control model and WSN node connection model. Through learning the framework of cluster algorithm for wireless sensor networks, this paper presents a weighted average of cluster-head selection algorithm based on an improved Genetic Optimization which makes the node weights directly related to the decision-making predictions. The Algorithm consists of two stages: single-parent evolution and population evolution. The initial population is formed in the stage of single-parent evolution by using gene pool, then the algorithm continues to the next further evolution process, finally the best solution will be generated and saved in the population. The simulation results illustrate that the new algorithm has the high convergence speed and good global searching capacity. It is to effectively balance the network energy consumption, improve the network life-cycle, ensure the communication quality and provide a certain theoretical foundation for the applications of the neural networks. Clustering is an essential tool to facilitate the function of self-organizing peer-to-peer and sensor networks. The LEACH (Low-Energy Adaptive Clustering Hierarchy) algorithm for forming clusters in ad-hoc networks represents a probabilistic way of choosing cluster-heads which shows a large variation over the average link distances of clusters and leads to uneven energy consumption during the transmission phase. However LEACH has the advantage that the energy load of being cluster-head is distributed among all the nodes resulting in a longer network life-time. On the other hand, the RSSI (Received Signal Strength Indicator)-based algorithms try to reduce the variation over the average link distances of clusters by means of choosing cluster-heads in the areas of higher node density in order to have an even energy consumption during transmission phase. But it distributes the energy load of being the cluster-head between some specific nodes which leads to a shorter network life-time. Here, we propose a new clustering scheme E-RSSI (Enhanced RSSI), which has the main advantages of the RSSI based schemes as well as LEACH. The average link distance of E-RSSI is almost the same as the average link distance of RSSI. And E-RSSI, like RSSI, has a significantly smaller variation over the average link distances in comparison with LEACH and at the same time shows significant improvement in network life-time. E-RSSI produces a low energy cost per node like RSSI and a more evenly distributed energy cost per node like LEACH therefore a prolonged network life-time.