@conference {
	title = {Applying Simulated Annealing for Domain Generation in Ad-Hoc Networks},
	author = {Manousakis, Kyriakos., Morera, Raquel., Baras, John S.},
	year = {2004},
	month = {06/2004},
	abstract = {If heterogeneous ad hoc battlefield networks are to scale to hundreds or thousands of nodes, then they must be automatically split into separate network domains. Domains allow routing, QoS and other networking protocols to operate on fewer nodes. This division greatly reduces overall overhead (e.g., routing overhead with n nodes goes from O(n^2) to O(nlogn)) and allows protocols to be tuned to more homogenous conditions [1]. Domain generation (or clustering) can be done using either local or global information. The two approaches are complementary since local domain generation reacts faster, requires less overhead, and is more robust; while global domain generation provides better overall domains. While most existing work has concentrated on local distributed solutions, this paper reports on new global domain generation techniques. In particular we concentrate on the design of good cost functions and efficient optimization algorithms. We show that simple {\textquotedblleft}intuitive{\textquotedblright} cost functions do not produce good domains; rather we need complex functions with multiple parameters depending on the design goals (e.g., low overhead or low delay). Although existing optimization algorithms are too slow to be useful in a large dynamic network, we show that a modified simulated annealing algorithm, with well chosen cooling schedule, state transition probabilities and stop criteria, produces good quality domains in acceptable time},
	address = {Paris, France},
	booktitle = {IEEE International Conference on Communications},
	pages = {pp. 3864-3868}
}
