@conference {
	title = {Multi-Metric Energy Efficient Routing in Mobile Ad-Hoc Networks},
	author = {Paraskevas, Evripidis., Manousakis, Kyriakos., Das, Subir., Baras, John S.},
	year = {2014},
	month = {10/2014},
	abstract = {Increasing network lifetime by reducing energy consumption across the network is one of the major concerns while designing routing protocols for Mobile Ad-Hoc Networks. In this paper, we investigate the main reasons that lead to energy depletion and we introduce appropriate routing metrics in the routing decision scheme to mitigate their effect and increase the network lifetime. For our routing scheme, we take into consideration multiple layer parameters, such as MAC queue utilization, node degree and residual energy. We integrate our multi-metric routing scheme into OLSR, a standard MANET proactive routing protocol. We evaluate via simulations in NS3 the protocol modifications under a range of different static and mobile scenarios. The main observations are that in static and low mobility scenarios our modified routing protocol leads to a significant increase (5\%-20\%) in network lifetime compared to standard OLSR and slightly better performance in terms of Packet Delivery Ratio (PDR).},
	address = {Baltimore, Maryland},
	booktitle = {Military Communications Conference (MILCOM 2014)},
	pages = {pp. 1146-1151}
}
@conference {
	title = {New Algorithm for the Design of Topology Aware Hypercube in Multi-hop Ad hoc Networks},
	author = {Striki, Maria., Manousakis, Kyriakos., Baras, John S.},
	year = {2009},
	month = {03/2009},
	abstract = {Securing group communications in resource constrained, infrastructure-less environments such as Mobile Ad Hoc Networks (MANETs) has become one of the most challenging research directions in the areas of wireless network security. MANETs are emerging as the desired environment for an increasing number of commercial and military applications, addressing also an increasing number of users. Security, on the other hand, is becoming an indispensable requirement of our modern life for all these applications. The inherent limitations of such dynamic and resource-constraint networks impose major difficulties in establishing a suitable secure group communications framework. This is even more so for the operation of Key Agreement (KA), under which all parties contribute equally to the group key. The logical design of efficient KA protocols has been the main focus of the related research to-date. Such a consideration, however, gives only a partial account on the actual performance of a KA protocol in a multi-hop network. This is because protocols have been evaluated only in terms of the group key related messaging in isolation from the underlying network functions that interact with the logical scheme and support its correct execution (i.e. routing). In recent work, we contributed towards efficiently extending a number of Diffie-Hellman (DH)-based group KA protocols in wireless multi-hop ad-hoc networks. Towards this end, we introduced a number of new algorithms to efficiently estimate the combined routing {\textendash} communication costs. We then improved these protocols with the addition of a new communication schedule subject to the underlying routing. Indeed, the resulting protocols were significantly more efficient in some or all of the metrics of interest, as our analytical and simulation results indicated. In this work, we contribute towards the latter, by extending an existing KA scheme that was left out in our previous work: Hypercube. Through our analysis and simulations, we demonstrate the superiority of the new, {\textquotedblleft}enriched{\textquotedblright} Hypercube that takes into account the underlying routing via the application of a topologically aware communications schedule.},
	address = {Gosier Guadeloupe, France},
	booktitle = {8th International Conference on Networks ICN 2009},
	pages = {pp.236-244}
}
@conference {
	title = {Fault-Tolerant Extension of Hypercube for Secure and Reliable Group Communications},
	author = {Striki, Maria., Baras, John S., Manousakis, Kyriakos.},
	year = {2008},
	month = {04/2008},
	abstract = {Securing group communications in resource constrained, infrastructure-less Mobile Ad Hoc Networks (MANETs) has become one of the most challenging research directions in the areas of wireless networking and security. MANETs are emerging as the desired environment for an increasing number of commercial and military applications, addressing also an increasing number of users. Security, on the other hand, is becoming an indispensable requirement of our modern life for all these applications. The inherent limitations of MANETs impose major difficulties on establishing a suitable secure group communications framework. We contribute to the latter by extending Hypercube, an existing key agreement (KA) scheme - all parties contribute equally to the group key - to tolerate multiple member failures with low cost. We achieve this by enhancing Hypercube with a novel adaptively proactive algorithm. Members are assumed to be already authenticated via some underlying mechanism and we only focus on the design and analysis of a fault-tolerant scheme. Our algorithm has been evaluated and compared with the existing approach. Through our analysis and simulations, we demonstrate its superiority in terms of robustness and efficiency.},
	address = {Cancun, Mexico},
	booktitle = {Seventh International Conference on Networking (ICN 2008)},
	pages = {pp. 223-231}
}
@conference {
	title = {New Algorithms for the Efficient Design of Topology-Oriented Key Agreement Protocols in Multi-hop Ad Hoc Networks},
	author = {Striki, Maria., Baras, John S., Manousakis, Kyriakos.},
	year = {2008},
	month = {03/2008},
	abstract = {Securing group communications in resource constrained, infrastructure-less environments such as Mobile Ad Hoc Networks (MANETs) has become one of the most challenging research directions in the areas of wireless network security. MANETs are emerging as the desired environment for an increasing number of commercial and military applications, addressing also an increasing number of users. Security, on the other hand, is an indispensable requirement of our modern life for all these applications. The inherent limitations of such dynamic and resource-constraint networks impose major difficulties in establishing a suitable secure group communications framework. This is even more so for the task of Key Agreement (KA), under which all parties contribute equally to the group key. The logical design of efficient KA protocols has been the main focus of the related research to-date. Such a consideration, however, gives only a partial account on the feasibility and actual performance of a KA protocol in a real multi-hop network. This is because protocols have been evaluated only in terms of the group key related messaging in isolation from the underlying network functions that interact with the logical scheme and support its correct execution (i.e. routing). In this work, we contribute towards efficiently extending a number of Diffie-Hellman (DH)-based group KA protocols in wireless multi-hop ad-hoc networks, and measuring their actual performance over these networks. Towards this end, we introduce a number of new algorithms that intelligently blend the logical protocol design with the underlying routing and network topology, to produce schemes that substantially improve on the metrics of interest. Indeed, the resulting protocols accomplish this goal, as our analytical and simulation results indicate.},
	address = {Berlin, Germany},
	booktitle = {6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt{\textquoteright}08)},
	pages = {pp. 384-393}
}
@conference {
	title = {A Robust Distributed TGDH-based Scheme for Secure Group Communications in MANET{\textquoteright}s},
	author = {Striki, Maria., Baras, John S., Manousakis, Kyriakos.},
	year = {2006},
	month = {06/2006},
	abstract = {Securing multicast communications in Mobile Ad Hoc Networks (MANET) is considered among the most challenging research directions in the areas of wireless networking and security. MANET is emerging as the desired environment for an increasing number of commercial and military applications, addressing also a growing number of users. Security, on the other hand, is now an indispensable requirement for these applications. However, the limitations of the dynamic, infrastructure-less nature of MANET impose major difficulties in establishing a secure framework suitable for such services. The design of efficient key management (KM) schemes for MANET is of paramount importance since the performance of the KM functions imposes an upper limit on the efficiency and scalability of the whole secure group communication system. In this work, we contribute towards this direction by extending TGDH to a novel distributed scheme: DS-TGDH. Our aim is to modify TGDH to: a) be feasible in the most general resource-constrained MANET where no nodes with special capabilities exist, b) produce considerably lower overhead for the network nodes involved, c) handle disruptions with low cost. We consider the underlying routing protocol in our design, and we apply a distributed TGDH version over a robust schedule, optimizing parameters of interest. We focus on the design and analysis of the {\textquotedblleft}stealthy{\textquotedblright} TGDH and compare it with the original. Through our analysis and results, we shed insight on the actual feasibility of these protocols for MANET and provide realistic and fair comparison results that more accurately advocate the pros and cons of each protocol over the environment of study.},
	address = {Istanbul, Turkey},
	booktitle = {ICC2006 - IEEE International Conference on Communications},
	pages = {pp. 2249-2255}
}
@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}
}
@conference {
	title = {Improving the~ Speed of Dynamic Cluster Formation in Manet~ via Simulated~ Annealing},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2004},
	month = {11/2004},
	abstract = {Future military systems, such as FCS, require a robust and flexible network that supports thousands of ad hoc nodes. Therefore, networking protocols for MANETs must be made to scale. The use of hierarchy is a powerful general solution to the scaling problem. We have previously proposed methods based on Simulated Annealing (SA) to optimize hierarchy in MANETs. The challenge, however, is to improve the slow convergence time of SA, so it can be used in dynamic environments, without penalizing optimality. In previous work, the importance of parameters such as cooling schedule, state transition probabilities, and convergence condition are investigated. This paper proposes a new approach to decrease SA convergence time. SA is an optimization technique based on an iterative process that takes an initial solution, or map, to start the process. In this paper, we analyze the effect that this initial solution has on the SA convergence time as a function of the network size. We believe that the combined modifications to SA can speed the optimization process to the point that it can quickly generate very efficient clustering solutions in large dynamic networks.},
	address = {Orlando, Florida},
	booktitle = {24th Army Science Conference (ASC2004)},
	pages = {pp. 1-8}
}
@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 = {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}
}
@conference {
	title = {Clustering for transmission range control and connectivity assurance for self configured ad hoc networks},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2003},
	month = {10/2003},
	abstract = {Ad hoc networks have been the new networking technology trend because of their promising characteristics. These characteristics fit better the requirements of today{\textquoteright}s army and the needs of today{\textquoteright}s commercial world. Most of the applications that have been referred in the bibliography assume devices that are of finite power. The latter is true because of the existing technology (web-enabled cell phones, PDAs, laptops, PPCs). The goal for ad hoc networks is to accommodate lightweight, battery-powered portable devices. Because of the finite power limitation, we have to design efficient ways to use the existing power. A first step towards efficient utilization of power is to eliminate its unnecessary usage wherever possible. For a networking device, significant part of power is consumed for communications and more specifically for transmissions. In this work we focus on eliminating the transmission power consumed into the network subject to the network{\textquoteright}s connectivity. The assurance of network connectivity is essential in this problem since the usage of limited transmission power from the nodes may result in a partitioned network. We provide solutions to the efficient usage of transmission power by clustering the nodes based on their proximity and ensuring the intracluster and intercluster connectivity of the network. The algorithms presented in this paper achieve their objective as the collected results from their simulation show.},
	address = {Boston, MA},
	booktitle = {Military Communications Conference, MILCOM 2003},
	pages = {pp. 1043-1047}
}
@conference {
	title = {Dynamic Clustering for Transmission Range Control in Ad Hoc Networks},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2003},
	month = {04/2003},
	abstract = {Ad hoc networks have being given a lot of attention in recent years. The problems associated with this kind of networks are many and difficult to solve because of their dynamic nature {\textendash} networks with non-static topology and non-static infrastructure. A large number of the issues under investigation are related with the finite power of the mobile devices. In terms of the communication tasks that those devices perform, the transmission power that is utilized plays a very important role to the long-term survivability of the network. The issue of transmission power affects the connectivity of the network, in a way that when the utilized transmission power is small then the network may be partitioned. In this work the latter has equivalent importance with the case where the assignment of excessive transmission power, resulting in a very dense net of communication links. When we use large transmission power then the long-term survivability and connectivity of the network is jeopardized because the nodes use their finite power inefficiently. Our task is to adjust the transmission power to the level where both the connectivity of the network is ensured and the transmitted power is minimized among all participating devices.},
	address = {College Park, Maryland},
	booktitle = {Collaborative Technology Alliances (CTA) Communications \&amp; Networks (C\&amp;N) Alliance - 2003 Annual Symposium},
	organization = {University of Maryland Conference Center}
}
@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}
}
@conference {
	title = {Reliable multicast for flat hierarchy networks based on adaptive air caching},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2002},
	month = {10/2002},
	abstract = {The evolution of satellite networks in the commercial and military world has pushed the research community towards the solution of important problems related to this kind of networks. One of those important problems is how to design an efficient reliable multicast protocol in a network where there is no hierarchy involved, and the link presents characteristics like high propagation delay and high BER. The existing reliable multicast protocols cannot be applied in the case of flat hierarchy networks, since those are based on intermediate receivers and local recovery techniques. So, we introduce the air caching technique, which serves as a fast access memory that is realized on the air and contains packets for the recovery of corrupted or erroneous data packets at the receivers. In this paper we present some of the protocols that we designed and are based on air caching combined with FEC and ARQ. In the past[7] we have presented protocols that are based on those techniques but the characteristics of the Air Cache were constant. In this paper we propose RM protocols, which are based on adaptive air caching, where the size and/or content of the Air Cache change dynamically based on feedback information. Our goal is to improve the delay and/or bandwidth usage characteristics of the non-adaptive Air Cache RM protocols.},
	address = {Anaheim, CA},
	booktitle = {IEEE Military Communications Conference MILCOM},
	pages = {pp. 1295-1299}
}
@conference {
	title = {Scalable and robust reliable multicast for satellite networks},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2001},
	month = {10/2001},
	abstract = {The evolution of satellite applications has created new traffic patterns on satellite links. That is because the number of users demanding service from satellite links has increased tremendously. The result is a more sophisticated use of resources. One way of accomplishing that is by multicasting, which is a natural extension of the broadcast nature of the satellite medium. Numerous existing satellite applications demand reliable delivery of the transmitted data, which is opposed to the unreliable nature of multicast transmission due to the error prone satellite medium. We have designed a number of reliable multicasting protocols which are based on forward error correction (FEC) and air caching. The combination of those two techniques results in a significant boost in the performance of reliable multicasting protocols.},
	address = {VA, USA},
	booktitle = {Military Communications Conference, McLean},
	pages = {pp. 676-680}
}
@conference {
	title = {Introducing Air Caching Techniques for Boosting Reliable Multicasting for Satellite Networks},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2001},
	month = {03/2001},
	abstract = {The emergence of satellite networks and the demand for reliability in transferring large files over the network via satellites has created the need for building effective reliable multicasting protocols, customized for this kind of networks. During the previous years, several protocols and techniques have been proposed to address the demanding problem of reliability in multicasting protocols. In our study we are trying to give a different perspective to the work that already has been done, with the use of Air Caching. The combined use of this technique along with the use of forward error correction (FEC) can boost substantially the performance of reliable protocols in terms of transmission rounds, by paying a small overhead in bandwidth usage. We present three protocols, the UDPAC (Unchanged Data Packets in Air Cache), the RDPAC (Replace Data Packets in Air Cache) and the PPAC (Parity Packets inAir Cache). The performance of these three protocols, in terms of Transmission Rounds and robustness in erroneous environments, is compared with two already known protocols, which are based on the simple ARQ and the FEC, respectively.},
	address = {College Park, Maryland},
	booktitle = {5th ARL Federated Laboratory Symposium},
	pages = {pp. 1-6},
	organization = {University of Maryland}
}
@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}
}
