A Sink Node Allocation Scheme in Wireless Sensor Networks Using Suppression Particle Swarm Optimization
Hidehiro Nakano, Masaki Yoshimura, Akihide Utani, Arata Miyauchi, Hisao Yamamoto · InTech eBooks · 2010
Sustainable Wireless Sensor Networks 4002004).Each sensor node, in this scheme, sends sensing data to the nearest sink node.In comparison with the case of a one-sink wireless sensor network, the communication load of sensor nodes around a sink node is reduced.In the existing studies, however, the effective locations for sink nodes, which are an important design problem for the long-term operation of a wireless sensor network, have not been discussed.This chapter discusses a method of suppressing the communication load on sensor nodes by effectively placing a limited number of sink nodes in an observation area.As a technique of solving effective locations for sink nodes, this chapter presents a new search algorithm named the suppression particle swarm optimization algorithm (Yoshimura et al., 2009).This algorithm is based on the particle swarm optimization algorithm (Kennedy & Eberhart, 1995) that is one of the swarm intelligence algorithms.The suppression particle swarm optimization algorithm can provide plural effective allocation sets for sink nodes so that total hops in all sensor nodes are minimized.As their allocation sets are switched dynamically, the above two requirements can be satisfied.This chapter consists of five sections.In Section 2, the basic particle swarm optimization algorithm is introduced.In Section 3, the suppression particle swarm optimization algorithm is explained.In Section 4, simulation results for two types of wireless sensor networks are presented.Through numerical simulations, effectiveness by using the suppression particle swarm optimization algorithm is confirmed.In Section 5, the overall conclusions of this work are given and future problems are discussed.