F.2.7. Optimization
Mahsa Dehbozorgi; Pirooz Shamsinejadbabaki; Elmira Ashoormahani
Abstract
Clustering is one of the most effective techniques for reducing energy consumption in wireless sensor networks. But selecting optimum cluster heads (CH) as relay nodes has remained as a very challenging task in clustering. All current state of the art methods in this era only focus on the individual ...
Read More
Clustering is one of the most effective techniques for reducing energy consumption in wireless sensor networks. But selecting optimum cluster heads (CH) as relay nodes has remained as a very challenging task in clustering. All current state of the art methods in this era only focus on the individual characteristics of nodes like energy level and distance to the Base Station (BS). But when a CH dies it is necessary to find another CH for cluster and usually its neighbor will be selected. Despite existing methods, in this paper we proposed a method that considers node neighborhood fitness as a selection factor in addition to other typical factors. A Particle Swarm Optimization algorithm has been designed to find best CHs based on intra-cluster distance, distance of CHs to the BS, residual energy and neighborhood fitness. The proposed method compared with LEACH and PSO-ECHS algorithms and experimental results have shown that our proposed method succeeded to postpone death of first node by 5.79%, death of 30% of nodes by 25.50% and death of 70% of nodes by 58.67% compared to PSO-ECHS algorithm
M. R. Okhovvat; M. T. Kheirabadi; A. Nodehi; M. Okhovvat
Abstract
Minimizing make-span and maximizing remaining energy are usually of chief importance in the applications of wireless sensor actor networks (WSANs). Current task assignment approaches are typically concerned with one of the timing or energy constraints. These approaches do not consider the types and various ...
Read More
Minimizing make-span and maximizing remaining energy are usually of chief importance in the applications of wireless sensor actor networks (WSANs). Current task assignment approaches are typically concerned with one of the timing or energy constraints. These approaches do not consider the types and various features of tasks WSANs may need to perform and thus may not be applicable to some types of real applications such as search and rescue missions. To this end, an optimized and type aware task assignment approach called TATA is proposed that considers the energy consumption as well as the make-span. TATA is an optimized task assignment approach and aware of the distribution necessities of WSANs with hybrid architecture. TATA comprises of two protocols, namely a Make-span Calculation Protocol (MaSC) and an Energy Consumption Calculation Protocol (ECal). Through considering both time and energy, TATA makes a tradeoff between minimizing make-span and maximizing the residual energies of actors. A series of extensive simulation results on typical scenarios show shorter make-span and larger remaining energy in comparison to when stochastic task assignment (STA), opportunistic load balancing (OLB), and task assignment algorithm based on quasi-Newton interior point (TA-QNIP) approaches is applied.