Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing
In this paper, we demonstrate how simulated annealing algorithm can be applied to clustering algorithms used in ad hoc networks; specifically our recently proposed weighted clustering algorithm (WCA) is optimized by simulated annealing. As the simulated annealing stands to be a powerful stochastic s...
Saved in:
Published in | 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003 Vol. 3; pp. 1492 - 1497 vol.3 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
2003
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!