@conference {
	title = {Domain Based Heirarchical Routing for Large Heterogeneous Manets},
	author = {Chandrashekar, Karthikeyan., Morera, Raquel., McAuley, Anthony J., Baras, John S.},
	year = {2005},
	month = {10/2005},
	abstract = {This paper proposes a domain based hierarchical routing for large ad hoc networks. Our approach is based on auto-configured optimized routing domains and an enhanced inter-domain routing scheme. The large heterogeneous ad-hoc network is divided into more scalable homogeneous domains where each domain can run the routing protocol that best suits its link and traffic characteristics. We here propose an inter-domain routing protocol that exploits existing messages needed to maintain the domain structure. To support heterogeneity, the inter-domain routing scheme is independent of the routing protocols running in each domain. We compare three different approaches to the inter-domain routing: a) based solely on the propagation of domain messages, b) border node based, c) dynamic border node. In this paper, OPNET simulations compare the performance of the different inter-domain routing schemes and show the benefits of the proposed approach using OLSR and DSR as intra-domain routing protocols. Results show significant reduction in protocol overhead, increased route stability and increased route availability in a dynamic heterogeneous network. It is worth mentioning that the increased route stability is not only given by the isolation of more mobile nodes from the rest in a single domain, but also by limiting the cross-layer interactions (e.g. as the routing overhead increases, collisions at the MAC layer increase and therefore more routing packets get lost).},
	address = {Atlantic City, NJ},
	booktitle = {2005 IEEE Military Communications Conference (MILCOM)},
	pages = {pp. 1284-1290}
}
@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 = {Rate of Degradation of Centralized Optimization Solutions and its Application to High Performance Domain Formation in Ad Hoc Networks},
	author = {Manousakis, Kyriakos., Baras, John S., McAuley, Anthony J., Morera, Raquel.},
	year = {2004},
	month = {10/2004},
	abstract = {Future military systems such a FCS and WIN-T require a robust and flexible network that supports thousands of ad hoc nodes; therefore, we must ensure the scalability of networking protocols (e.g., routing, security and QoS). The use of hierarchy is a powerful solution to the scaling problem~since it allows networking protocols to operate on a limited number of nodes, as opposed to the entire network. We have proposed an automated solution to dynamically create and maintain such hierarchy based on a combination of global optimization algorithms and local distributed maintenance protocols. Global optimization clearly improves performance in a static network but, it is unclear how effective it is in a dynamic ad hoc environment. In this paper, we analyze how the hierarchy created deteriorates from the optimal as network conditions change. We show that the fragility of the optimization depends on the particular cost function and the number of metrics that change. More important, we show, for the first time, that global optimization can remain effective for long periods with good cost functions, even in large dynamic ad hoc networks (where metrics may change rapidly due to node mobility and links making and breaking).~This result shows that, with fast optimization algorithms such as modified Simulated Annealing, future military systems can use global optimization to autoconfigure domains to significantly improve perform". We also show that local maintenance protocols support the global optimization mechanisms by extending the time the hierarchy remains feasible.},
	address = {Monterey, California},
	booktitle = {MILCOM 2004},
	pages = {pp. 1536-1542}
}
@conference {
	title = {Routing Domain Autoconfiguration for more Efficient and Rapidly Deployable Mobile Networks},
	author = {Manousakis, Kyriakos., McAuley, Anthony J., Morera, Raquel., Baras, John S.},
	year = {2002},
	month = {12/2002},
	abstract = {One approach to achieving scalability in rapidly deployed dynamic networks, such as Future Combat Systems (FCS), is to automatically divide nodes into small (e.g., 30 node) interconnected IP domains and assigning each a routing protocol that best meets the domain{\textquoteright}s characteristics (Morera and McAuley, 2002). Although an attractive idea, it has not been tested. This paper* presents the first realization of domain autoconfiguration through extensions to the IP Autoconfiguration Suite (IPAS) (McAuley et al., 2001; McAuley et al., 2002; Cheng et al., 2002). While IPAS already configures and reconfigures information such as interface IP address and server locations, it assumes a single domain. We describe IPAS enhancements that support the automatic creation and configuration of multiple domains and describe a prototype implementation where interfaces are dynamically assigned to run different routing protocols. Finally, we show some initial performance results that show configuration time for even large (1000 node) sparse networks in a few seconds and small bandwidth overhead (a few hundred bytes per link).},
	address = {Orlando, Florida},
	booktitle = {23rd Army Science Conference}
}
@article {
	title = {Network and Domain Autoconfiguration: A Unified Approach for Large Dynamic Networks},
	author = {Manousakis, Kyriakos., Baras, John S., McAuley, Anthony J., Morera, Raquel.},
	year = {2005},
	month = {08/2005},
	abstract = {Configuration management is critical to correct and efficient operation of large networks. Where the users and networks are dynamic and ad hoc, manual configuration quickly becomes too complex. The combination of the sheer number of nodes with heterogeneity and dynamics makes it almost impossible for the system administrator to ensure good configuration or even correct operation. To achieve the vision of pervasive computing, nodes must automatically discover their environment and self-configure, then automatically reconfigure to adapt to changes. Protocols such as DHCP, DDNS, and mDNS provide some degree of host autoconfiguration, but network administrators must still configure information such as address pools, routing protocols, and OSPF routing areas. Only limited progress has been made in automating the configuration of routers, servers, and network topology. We propose the first unified attempt to combine both self-configuration of much of the host, router, and server information with automatic generation and maintenance of hierarchy under the same algorithmic framework. Testbed implementations show the approach is practical, while simulations reveal its scalability, rapidity, and efficiency with respect to network performance.},
	pages = {pp. 78-85},
	volume = {Vol.  43},
	number = {Issue 8},
	journal = {IEEE Communication Magazine}
}
