@conference {
	title = {AeroTCP: A Splitting Transport Protocol for an IP-based Satellite Network Supporting Aeronautical Communications},
	author = {Shang, Yadong., Hadjitheodosiou, Michael., Baras, John S.},
	year = {2005},
	month = {09/2005},
	abstract = {The IP-based Broadband Aeronautical Satellite Network will provide numerous new applications and services for both airspace system operations and passenger communications. However, the performance of data communications protocols and applications over such systems is dramatically degraded, especially the Internet TCP/IP protocol suite. In this paper, we propose a new transport protocols for satellite network supporting Internet and data services. Based on the observation that it is difficult for an end to- end TCP solution to solve the performance problem effectively, we propose a new splitting based TCP protocol, called Aeronautical Transport Control Protocol (AeroTCP), which takes advantage of the specific properties of satellite channel. Our simulation results show that AeroTCP improves satellite channel utilization and fairness.},
	address = {Rome, Italy},
	booktitle = {23rd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)}
}
@conference {
	title = {Integrated Packet Level FEC Coding for Bulk Data Transfer Over Satellite Network},
	author = {Akkor, Gun., Baras, John S., Hadjitheodosiou, Michael.},
	year = {2005},
	month = {09/2005},
	abstract = {Packet level forward error correction (FEC) coding has been widely accepted as an efficient way of reducing the number of retransmissions and recovering from packet losses for reliable multicast in satellite networks. While there has been a significant effort in defining packet level FEC schemes that detail the structure, organization and delivery of the encoding packets, little attention has been given to how the physical channel, channel coding, and the downlink power budget affect the design space of these schemes in the context of a satellite network architecture. In this paper, we take a step in this direction, and define the points of interaction between various components and build a simulation environment. Using this simulation setup, we provide design suggestions for integrating FEC coding into reliable multicast transport protocols.},
	address = {Rome, Italy},
	booktitle = {23rd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)}
}
@conference {
	title = {Dynamic Resource Allocation for an IP-based Communications Network Supporting Space Exploration},
	author = {Zeng, Hui., Hadjitheodosiou, Michael., Baras, John S.},
	year = {2005},
	month = {09/2005},
	abstract = {We address issues related to efficiency, fairness, end-to-end delay minimization and Quality-of-Service (QoS) framework in order to enable a flexible access and dynamic mission operation capability in the next generation NASA space-to-ground IP-based communication infrastructure. In our scenario, the downlink channel of the NASA Tracking and Data Relay Satellite System is shared by a number of spacecraft, which we model as streams with different priority levels going through a common queue and a router. Both the current and future potential architectures for this relay system are addressed. We formulate an optimization problem for long-term static bandwidth allocation and present its solution to serve as initial bandwidth allocation algorithm and periodical regulation approach. Along with it, a hybrid Time Division Multiple Access (TDMA)-based protocol is proposed and then an assignment problem for the short-term dynamic optimal timeslot scheduling is studied. By using simulation, the performance of a suitable Medium Access Control (MAC) protocol with timeslot scheduling is analyzed and compared with that of the existing static fixed-assignment scheme.},
	address = {Rome, Italy},
	booktitle = {23rd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)},
	pages = {pp. 1-12}
}
@conference {
	title = {Modeling and Design of a Communication Architecture Supporting Lunar Exploration},
	author = {Roy-Chowdhury, Ayan., Hadjitheodosiou, Michael., Baras, John S., Rentz, Nicolas.},
	year = {2005},
	month = {09/2005},
	abstract = {We discuss some basic requirements and trade-offs for designing a communication network supporting the needs of lunar exploration missions. We describe the unique characteristics of this network and outline a prototype network architecture. The proposed network consists of three distinct segments - a terrestrial network on Earth, a network on the lunar surface, and a space segment comprising a satellite constellation that connect the two surface networks.~We develop a simulation platform that includes the network topology, node orbits and mobility, and test the network performance with different applications and traffic loads. We present simulation results obtained with our models that illustrate the network connectivity and delay for varying satellite orbital patterns and traffic characteristics. We also discuss the requirements and constraints for providing a secure infrastructure for end-to-end communication in space exploration networks~and suggest algorithms and protocols for implementing end-to-end encryption, authentication and secure group communication.},
	address = {Rome, Italy},
	booktitle = {23rd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)},
	pages = {pp. 1-10}
}
@conference {
	title = {bufSTAT - A Tool for Early Detection and Classification of Buffer Overflow Attacks},
	author = {Radosavac, Svetlana., Seamon, Karl., Baras, John S.},
	year = {2005},
	month = {09/2005},
	abstract = {Buffer overflows constitute by far the most frequently encountered class of attacks against computer systems. In this paper we introduce a tool, termed bufSTAT that achieves a low probability of false alarm and issues early attack warnings. BufSTAT relies on Finite State Machines (FSM) for attack modeling and can detect every stage of an ongoing attack and can thus prevent its execution by issuing early warning in a progressive manner. It can also detect sophisticated multi-stage attacks that are executed over long periods of time. A significant attribute of our approach is that it is amenable to detecting unknown attacks as well after appropriate modification of bufSTAT.},
	address = {Athens, Greece},
	booktitle = {First International Conference on Security and Privacy for Emerging Areas in Communication Networks}
}
@conference {
	title = {A Framework for MAC Protocol Misbehavior Detection in Wireless Networks},
	author = {Radosavac, Svetlana., Baras, John S., Koutsopoulos, Iordanis. },
	year = {2005},
	month = {09/2005},
	abstract = {The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main reasons for the growing interest in the issue of compliance to protocol rules. Reliable and timely detection of deviation from legitimate protocol operation is recognized as a prerequisite for ensuring efficient and fair use of network resources and minimizing performance losses. Nevertheless, the random nature of protocol operation together with the inherent difficulty of monitoring in the open and highly volatile wireless medium poses significant challenges. In this paper, we consider the fundamental problem of detection of node misbehavior at the MAC layer. Starting from a model where the behavior of a node is observable, we cast the problem within a minimax robust detection framework, with the objective to provide a detection rule of optimum performance for the worst-case attack. The performance is measured in terms of required number of observations in order to derive a decision. This framework is meaningful for studying misbehavior because it captures the presence of uncertainty of attacks and concentrates on the attacks that are most significant in terms of incurred performance losses. It also refers to the case of an intelligent attacker that can adapt its policy to avoid being detected. Although the basic model does not include interference, we show that our ideas can be extended to the case where observations are hindered by interference due to concurrent transmissions. We also present some hints for the problem of notifying the rest of the network about a misbehavior event. Our work provides interesting insights and performance bounds and serves as a prelude to a future study that would capture more composite instances of the problem.},
	address = {Cologne, Germany},
	booktitle = {4th ACM Workshop on Wireless Security,},
	pages = {pp. 33-42}
}
