Using Multi-Objective Particle Swarm Optimization for Energy-Efficient Clustering in Wireless Sensor Networks

Using Multi-Objective Particle Swarm Optimization for Energy-Efficient Clustering in Wireless Sensor Networks

Hamid Ali (National University of Computer and Emerging Sciences, Pakistan), Waseem Shahzad (National University of Computer and Emerging Sciences, Pakistan) and Farrukh Aslam Khan (National University of Computer and Emerging Sciences, Pakistan)
DOI: 10.4018/978-1-4666-0101-7.ch013
OnDemand PDF Download:
No Current Special Offers


In this chapter, the authors propose a multi-objective solution to the problem by using multi-objective particle swarm optimization (MOPSO) algorithm to optimize the number of clusters in a sensor network in order to provide an energy-efficient solution. The proposed algorithm considers the ideal degree of nodes and battery power consumption of the sensor nodes. The main advantage of the proposed method is that it provides a set of solutions at a time. The results of the proposed approach were compared with two other well-known clustering techniques: WCA and CLPSO-based clustering. Extensive simulations were performed to show that the proposed approach is an effective approach for clustering in WSN environments and performs better than the other two approaches.
Chapter Preview


The field of Wireless Sensor Networks (WSNs) has emerged as a very active area of research during the last few years. A WSN consists of autonomous tiny devices that cooperatively monitor physical or environmental conditions such as temperature, vibration, pressure, motion etc. These tiny devices or sensors have limited battery power, memory and processing capabilities. One of the important challenges of a WSN is the energy-efficient communication which increases the lifetime of the network. Several techniques have been proposed to achieve this goal and clustering in WSNs is one of them that can help in providing an energy-efficient solution. Clustering requires the selection of cluster-heads (CHs) for each cluster. Fewer CHs result in greater energy efficiency as these nodes consume more power and energy as compared to non cluster-heads. Several techniques are available in the literature for clustering by using optimization and evolutionary techniques. The main drawback of these techniques is that they handle only one objective at a time. These techniques do not provide a freedom of choice to the user.

A wireless sensor network (WSN) which is a special type of wireless ad hoc network consists of autonomous tiny devices that are capable of cooperatively monitoring physical or environmental conditions. These nodes have limited battery, processing speed, storage, and communication capabilities. These limitations of WSNs bring new problems and challenges for the researchers. Clustering is a technique of organizing objects into meaningful groups with respect to their common characteristics. The objective of clustering in WSNs is to identify the groups of nodes in such a way that the groups are exclusive and any node in the network belongs to a single group. The nodes known as cluster-heads (CHs) are responsible for the formation of clusters, maintenance of network topology, and the allocation of resources to all nodes present in their clusters. Since the configuration of CHs can change frequently due to the mobility of sensor nodes, minimizing the number of cluster-heads becomes an essential component. Optimal selection of CHs is an NP-hard problem. The neighbourhood of a CH is a set of nodes that lie within its transmission range. Since energy-efficiency is an important requirement for a WSN that increases its lifetime, clustering can provide an energy-efficient solution as only a few nodes are involved in doing the main operations in the sensor network such as management, routing, data aggregation etc. Therefore, clustering can greatly help in achieving an energy-efficient solution for WSNs.

Optimization refers to determining one or more solutions of a given problem which correspond to extreme values of one or more objectives. It has been an active area of research as many real-world problems have become increasingly complex. Therefore, better optimization techniques are always required. Most real world problems consist of several objectives that are needed to be optimized at the same time. Such kinds of problems arise in many applications. While solving multi-objective problems (MOPs) with traditional mathematical programming techniques, a single solution is generated from a set of solutions in one run. Therefore, these techniques are not much suitable for solving multi-objective optimization problems. Evolutionary Algorithms paradigm is very suitable to solve MOPs because they are population-based and can generate a set of solutions in one run (Liang et al., 2006).

Complete Chapter List

Search this Book: