Efficient WSN Routing Using Bootstapped PSO Clustering

The increasing convergence of microprocessors, wireless communication, and micro electro-mechanical systems (MEMS) has led to the development of Wireless Sensor Networks (WSNs). Optimization problems for WSN are usually versions of classic problems in the operational research area, such as routing and clustering, which are NP- Difficult. Thus, it is natural to use meta-heuristics to solve these problems. The main objective of this work is to apply the Bootstrapped PSO metaheuristic to form WSN clusters. bootstrapped PSO was chosen because it is a meta-heuristic that proved to be efficient in solving similar problems, such as P-medians, and because it is a method not yet used to solve the problem addressed in this work.