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
2043763095 2103625053
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. 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.