@conference {
	title = {Design Framework for Hierarchy Maintenance Algorithms in Mobile Ad Hoc Networks},
	author = {Manousakis, Kyriakos., Baras, John S., McAuley, Anthony J., Morera, Raquel.},
	year = {2005},
	month = {10/2005},
	abstract = {Domain autoconfiguration techniques allow the quick formation of highly optimized hierarchies that greatly enhance network scalability and overall performance. For example, instead of producing a simple two level hierarchy based only on topology, the optimization can produce multi-level hierarchies that take into account factors such as mission goals and predicted node/link heterogeneity. However, in dynamic networks, such as expected in the future military networks, these highly optimized solutions degrade very quickly. Indeed, if we use standard local maintenance algorithms that do not align well with the optimization goals, then the performance can reach the level of a suboptimal solution in less than two minutes. This paper proposes a taxonomy of local maintenance algorithms into four basic classes and quantifies the performance benefits of using representative approaches that act in accordance with the optimization goals.},
	address = {Atlantic City, NJ},
	booktitle = {2005 IEEE Military Communications Conference (MILCOM)},
	pages = {pp. 1-6}
}
@conference {
	title = {Mobility Based Distributed Domain Generation Algorithm for MANETs},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2005},
	month = {06/2005},
	abstract = {Ad hoc networks are very important for scenarios where there is not fixed network infrastructure. These scenarios may appear both in the military and the commercial world. Even though there is much advancement in the area of these networks, they do not scale well. This is due to the inability of the existing protocols (e.g., MAC, routing, security) to tolerate the dynamics of these networks when their size becomes large. A remedy is to apply these protocols in a hierarchical manner. The hierarchy generation in these dynamic environments can be advantageous since the network appears to be smaller due to the aggregation and abstraction resulted from the grouping of nodes. The numerous topological changes can be tolerated easier and the applied protocols can perform better. This division greatly reduces overall overhead (e.g., routing overhead with n nodes goes from O(n2) to O(nlogn)) and allows protocols to be tuned to more homogenous conditions). On the other hand, hierarchy has to be generated carefully in order to be beneficial for the network otherwise, it may harm it, due to the imposed maintenance overhead. Towards this objective we have to take into consideration the network environment and design appropriately the hierarchy generation algorithms. In this paper, we present a mobility based domain generation algorithm (DGA), which in a distributed manner attempts to exploit similarities in the mobility patterns of the participating nodes by utilizing a set of mobility metrics. By grouping together nodes with similar mobility characteristics, the mobility based DGA targets the generation of robust to mobility hierarchical structures. The algorithm presents better scalability and robustness characteristics from well known existing distributed domain generation algorithms.},
	address = {Maui, Hawaii},
	booktitle = {2005 International Conference on Wireless Networks, Communications and Mobile Computing},
	pages = {pp. 820-825}
}
