@conference {
	title = {Recursive Identification of Hysteresis in Smart Materials},
	author = {Tan, Xiaobo., Baras, John S.},
	year = {2004},
	month = {06/2004},
	abstract = {This paper studies recursive identification of hysteresis in smart materials. A Preisach operator with a piece-wise uniform density function is used to model the hysteresis. Persistent excitation conditions for parameter convergence are discussed in terms of the input to the Preisach operator. Two classes of recursive identification schemes are explored, one based on the hysteresis output, the other based on the time difference of the output. Experimental results based on a magnetostrictive actuator are presented.},
	address = {Boston, MA},
	booktitle = {2004 American Control Conference},
	pages = {pp. 3857-3862}
}
@conference {
	title = {Distributed Change Detection for Worms, DDoS and Other Network Attacks},
	author = {Cardenas, Alvaro A., Baras, John S., V. Ramezani},
	year = {2004},
	month = {06/2004},
	abstract = {Self-propagating code (worms) and distributed denial of service (DDoS) attacks are the most frequent and quite devastating attacks on communication networks and the Internet. We provide novel formulations for the rapid detection of these attacks in the control-theoretic framework of change detection. We present algorithms that effectively can detect worms from their temporal spreading characteristics. We describe the effects of the network topology on the algorithms and their performance. We next present algorithms for detecting DDoS while discriminating against changes in the normal traffic. This is accomplished by a distributed detection formalism where a concept of directionality is introduced and exploited. We then turn into attacks to routing protocols in mobile wireless networks. We develop change detection formulations involving hidden Markov models, which match distribution of the number of hops in the mobile and wireless nodes. Using observations that suggest that this distribution is altered substantially in the presence of such attacks we develop and analyze algorithms for their detection.},
	address = {Boston, MA},
	booktitle = {2004 American Control Conference},
	pages = {pp. 1008-1013}
}
@conference {
	title = {Long-Run Performance Analysis of a Multi-Scale TCP Traffic Model},
	author = {Liu, Nelson X., Baras, John S.},
	year = {2004},
	month = {06/2004},
	abstract = {The long-run queueing performance of a multi-scale TCP traffic model, the HOO model, is analysed. Since the model links the multi-scale behaviour with practical traffic elements and approximates TCP traffic very well, the analysis is expected to provide insights into the physical interpretation of multi-scale traffic and to give useful results for performance prediction. To derive a meaningful solution and avoid the extreme difficulty of an exact analysis, the authors adopt several techniques to track the problem, among which are techniques to establish equivalent processes to the traffic process or the queue content process in two cases, the case of fast flows and the case of slow flows. Quantitative results for the queue tails are obtained in both cases, and a unified form is derived. It indicates that three levels of traffic elements in different time scales, i.e. the connection, the burst and the packet, all affect the asymptotic queueing performance. It shows quantitatively how the connection determines the index of the queue tail, and the burst and the packet contribute to the tail with their averages. Used with simple statistical inferences, the analytical result is shown to predict the queueing performance of real traffic well.},
	booktitle = {IEE Proceedings- Communications},
	pages = {pp. 251-257}
}
@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 = {Towards Integrating Key Distribution with Entity Authentication for Efficient, Scalable and Secure Group Communication in MANETs},
	author = {Striki, Maria., Baras, John S.},
	year = {2004},
	month = {06/2004},
	abstract = {We focus on the design of key management (KM) schemes tailored for the environment of Mobile Ad Hoc Networks (MANETs). A MANET is a collection of wireless mobile nodes, communicating among themselves over possibly multi-hop paths, without the help of any infrastructure such as base stations or access points. The fact that no central authorization entity is assumed at all times for all nodes makes the task of network operations more difficult and indicates the need for distributed algorithms to provide the functions of centralized entities. KM ensures communication security among nodes and the capability of their cooperation as a secure group. It consists of key generation, user authentication and key distribution services. In this work we address key distribution, group key generation, entity authentication: we emphasize that entity authentication should be designed with key distribution algorithms in mind and vice versa, to achieve efficient and scalable KM schemes for MANETs. We present an entity authentication scheme based on the Merkle Tree algorithm, applied on a key generation protocol recently developed - MOT- to produce an efficient, scalable and secure KM scheme.},
	address = {Paris, France},
	booktitle = {2004 IEEE International Conference on Communications},
	pages = {pg. 4377-4381}
}
@conference {
	title = {Web Access Over a Multiple Access Channel: Evaluations and Improvements},
	author = {Zhou, Xiaoming., Liu, Nelson X., Baras, John S.},
	year = {2004},
	month = {06/2004},
	abstract = {We evaluate Web browsing performance over a multiple access satellite channel for three different MAC layer protocols. A Web user behavior model is used to generate realistic source traffic. A new transport layer protocol called RWBP is proposed to solve the TCP problems inside satellite networks. RWBP uses per-flow queuing, round robin scheduling and receiver window backpressure for congestion control. We compare its performance with TCP over the three multiple access protocols. Our simulation results show that RWBP can reduce the multiple access channel load and at the same time improve the Web page response time when driven by realistic Web traffic. For the MAC layer protocols, combined free demand assignment multiple access (CFDAMA) always performs better than the other two protocols.},
	address = {Paris, France},
	booktitle = {2004 IEEE International Conference on Communications},
	pages = {pp. 4392-4396}
}
@conference {
	title = {Attacks and Defenses Utilizing Cross-Layer Interactions in MANET},
	author = {Baras, John S., Radosavac, Svetlana.},
	year = {2004},
	month = {06/2004},
	abstract = {Cross-layer protocol design is one of the prevailing methodologies that have recently been adopted in networking research and leads to significant performance benefits. In this study,we assess the performance of cross-layer interaction and investigate its effects with regard to security and information assurance of mobile ad hoc wireless networks. Using attacks in realistic wireless networks as a prototype, we find that natural cross-layer interactions between physical, MAC and network layer protocols in MANET can turn out to be a weak point, causing various attacks and intrusions. However, by allowing a controlled synergy between layers affected by attacks, we facilitate timely detection of such attacks that are otherwise difficult to detect and may have devastating effects on network functionality and operation.},
	address = {Washington DC},
	booktitle = {Workshop on Cross-Layer Issues in the Design of Tactical Mobile Ad Hoc Wireless Networks: Integration of Communication and Networking Functions to Support Optimal Information Management},
	organization = {Naval Research Laboratory}
}
