Energy-efficient clustering in mobile ad-hoc networks using multi-objective particle swarm optimization

被引:121
作者
Ali, Hamid [1 ]
Shahzad, Waseem [1 ]
Khan, Farrukh Aslam [1 ]
机构
[1] Natl Univ Comp & Emerging Sci, Dept Comp Sci, Islamabad 44000, Pakistan
关键词
Mobile ad hoc network (MANET); Multi-objective particle swarm optimization (MOPSO); Clustering; Cluster-head (CH); Energy-efficient networks; Load balance factor; ALGORITHM;
D O I
10.1016/j.asoc.2011.05.036
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
A mobile ad hoc network (MANET) is dynamic in nature and is composed of wirelessly connected nodes that perform hop-by-hop routing without the help of any fixed infrastructure. One of the important requirements of a MANET is the efficiency of energy, which increases the lifetime of the network. Several techniques have been proposed by researchers to achieve this goal and one of them is clustering in MANETs that can help in providing an energy-efficient solution. Clustering involves the selection of cluster-heads (CHs) for each cluster and fewer CHs result in greater energy efficiency as these nodes drain more power than noncluster-heads. In the literature, several techniques are available for clustering by using optimization and evolutionary techniques that provide a single solution at a time. In this paper, we propose a multi-objective solution by using multi-objective particle swarm optimization (MOPSO) algorithm to optimize the number of clusters in an ad hoc network as well as energy dissipation in nodes in order to provide an energy-efficient solution and reduce the network traffic. In the proposed solution, inter-cluster and intra-cluster traffic is managed by the cluster-heads. The proposed algorithm takes into consideration the degree of nodes, transmission power, and battery power consumption of the mobile nodes. The main advantage of this method is that it provides a set of solutions at a time. These solutions are achieved through optimal Pareto front. We compare the results of the proposed approach with two other well-known clustering techniques; WCA and CLPSO-based clustering by using different performance metrics. We perform extensive simulations to show that the proposed approach is an effective approach for clustering in mobile ad hoc networks environment and performs better than the other two approaches. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:1913 / 1928
页数:16
相关论文
共 20 条
[1]
A Survey of Particle Swarm Optimization Applications in Electric Power Systems [J].
AlRashidi, M. R. ;
El-Hawary, M. E. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (04) :913-918
[2]
Alvarez-Benitez JE, 2005, LECT NOTES COMPUT SC, V3410, P459
[3]
THE ARCHITECTURAL ORGANIZATION OF A MOBILE RADIO NETWORK VIA A DISTRIBUTED ALGORITHM [J].
BAKER, DJ ;
EPHREMIDES, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (11) :1694-1701
[4]
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks [J].
Mainak Chatterjee ;
Sajal K. Das ;
Damla Turgut .
Cluster Computing, 2002, 5 (2) :193-204
[5]
Handling multiple objectives with particle swarm optimization [J].
Coello, CAC ;
Pulido, GT ;
Lechuga, MS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :256-279
[6]
A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[7]
Dewri R., 2007, P 14 ACM C COMP COMM
[8]
Mobility-based d-hop clustering algorithm for mobile ad hoc networks [J].
Er, II ;
Seah, WKG .
2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: BROADBAND WIRELESS - THE TIME IS NOW, 2004, :2359-2364
[9]
Multicluster, mobile, multimedia radio network [J].
Gerla, Mario ;
Tsai, Jack Tzu-Chieh .
WIRELESS NETWORKS, 1995, 1 (03) :255-265
[10]
Heiniger R. W., 2000, Proceedings of the 5th International Conference on Precision Agriculture, Bloomington, Minnesota, USA, 16-19 July, 2000, P1