@conference {
	title = {Collaborative Networked Control: Stochastic Algorithms},
	author = {Baras, John S.},
	year = {2005},
	month = {10/2005},
	address = {Philadelphia, Pennsylvania},
	organization = {GRASP Laboratory, University of Pennsylvania}
}
@conference {
	title = {Hybrid Networks with a Space Segment - Topology Design and Security Issues},
	author = {Roy-Chowdhury, Ayan., Baras, John S., Hadjitheodosiou, Michael., Rentz, Nicolas.},
	year = {2005},
	month = {10/2005},
	abstract = {In this paper we investigate a hybrid network topology that is suitable for supporting interplanetary communications. We define an architecture comprised of a network of sensor nodes on a remote planetary surface, connected to a hybrid terrestrial network of wired and wireless LANs through a series of satellite relays. All the nodes in the network are IP-addressable and support public and symmetric key cryptography. The resulting network forms a hierarchical hybrid mesh that connects users on Earth to networks on or around a remote planetary surface. We describe the design of the network and present preliminary simulation results illustrating the network performance for various parameters. We also discuss how algorithms for user authentication, message integrity and data confidentiality can be incorporated in the network infrastructure for secure end-to-end communication.},
	address = {Atlantic City, NJ},
	booktitle = {2005 Military Communications Conference (MILCOM 2005),},
	pages = {pp.1414 - 1420}
}
@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 = {Swarm Collaborative Intelligence: From Networked Control to Trust in MANET},
	author = {Baras, John S.},
	year = {2005},
	month = {10/2005},
	address = {Chania, Crete},
	organization = {Technical University of Crete}
}
