Abstract | ||
---|---|---|
This paper presents a new, differential-evolution based method for solving the problem of optimal selection of cluster-heads and cluster-members in mobile ad hoc networks. A novel encoding scheme is used to represent nodes in the network graph, and randomly-generated networks of different sizes are solved. The present method handles problems of much larger sizes than do the best-known methods in the literature. Empirical results show the superiority of this method over state-of-the-art approaches on two counts: quality of the solution and time to find the solution. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/CEC.2011.5949890 | IEEE Congress on Evolutionary Computation |
Keywords | Field | DocType |
evolutionary computation,mobile ad hoc networks,cluster-heads,cluster-members,differential evolution,mobile ad hoc networks | Mobile computing,Mobile ad hoc network,Computer science,Ad hoc wireless distribution service,Theoretical computer science,Differential evolution,Optimized Link State Routing Protocol,Wireless ad hoc network,Cluster analysis,Genetic algorithm | Conference |
ISSN | ISBN | Citations |
Pending | 978-1-4244-7834-7 | 7 |
PageRank | References | Authors |
0.55 | 8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Uday K. Chakraborty | 1 | 873 | 44.61 |
Swagatam Das | 2 | 6026 | 276.66 |
Travis E. Abbott | 3 | 60 | 5.25 |