Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing
暂无分享,去创建一个
[1] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[2] Duc Truong Pham,et al. Intelligent optimisation techniques , 2000 .
[3] Sajal K. Das,et al. An on-demand weighted clustering algorithm (WCA) for ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).
[4] Sajal K. Das,et al. WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.
[5] ČernýV.. Thermodynamical approach to the traveling salesman problem , 1985 .
[6] Béla Bollobás,et al. Random Graphs , 1985 .
[7] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[8] Ivan Stojmenovic,et al. Ad hoc Networking , 2004 .
[9] Ramez Elmasri,et al. Optimizing clustering algorithm in mobile ad hoc networks using genetic algorithmic approach , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.
[10] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[11] John H. Kalivas,et al. Adaption of simulated annealing to chemical optimization problems , 1995 .
[12] D. Balmer. Theoretical and Computational Aspects of Simulated Annealing , 1991 .