@conference {
	title = {Decentralized control of autonomous vehicles},
	author = {Baras, John S., Tan, Xiaobo., Hovareshti, Pedram.},
	year = {2003},
	month = {12/2003},
	abstract = {Decentralized control methods are appealing in coordination of multiple vehicles due to their low demand for long-range communication and their robustness to single-point failures. In this paper we explore a decentralized approach to path generation for a group of vehicles in a battlefield scenario. The mission is to maneuver the vehicles to cover a target area while avoiding obstacles and threats during the maneuver. Each vehicle makes its moving decision by minimizing a potential function that encodes information about its neighbours, obstacles, threats and the target. Preliminary analysis of vehicle behaviors is conducted. Simulation has shown that this approach leads to interesting emergent behaviors, and the behaviors can be varied by adjusting the weighting coefficients of different potential function terms.},
	address = {Maui, Hawaii},
	booktitle = {42nd IEEE Conference on Decision and Control},
	pages = {pp. 1532-1537}
}
@conference {
	title = {Jointly optimal quantization, estimation, and control of hidden Markov chains},
	author = {Baras, John S., Tan, Xiaobo., Xi, Wei.},
	year = {2003},
	month = {12/2003},
	abstract = {It is of interest to understand the tradeoff between the communication resource consumption and the achievable system performance in networked control systems. In this paper we explore a general framework for tradeoff analysis and decision making in such systems by studying joint quantization, estimation, and control of a hidden Markov chain. Dynamic programming is used to find the optimal quantization and control scheme that minimizes a weighted combination of different cost terms including the communication cost, the delay, the estimation error, and the running cost. Simulation and analysis based on example problems show that this approach is able to capture the tradeoffs among competing objectives by adjusting the cost weights.},
	address = {Maui, Hawaii},
	booktitle = {42nd IEEE Conference on Decision and Control},
	pages = {pp. 1098-1103}
}
@conference {
	title = {Modeling and Simulation of Telecommunication Networks for Control and Management},
	author = {Baras, John S.},
	year = {2003},
	month = {12/2003},
	abstract = {In this paper, we describe methodologies for telecommunication networks modeling and simulation that are targeted to be useful as tools in on-line and off-line decision making of the type encountered in network control, management and planning problems. We describe the development, validation and use of self-similar and multifractal models, queuing control and performance evaluation, assessing the incremental utility of various models, hierarchical models based on aggregation, analytic approximation models for various performance metrics, trade-off and sensitivity analysis using a multi-objective optimization framework and automatic differentiation. We also describe four illustrative examples of applying these methodologies to dynamic network control and management problems. The examples involve primarily mobile ad hoc wireless and satellite networks in changing environments.},
	address = {New Orleans, Louisiana},
	booktitle = {35th Winter Simulation Conference: Driving Innovation},
	pages = {pp. 431-440}
}
@conference {
	title = {A Feedback Implosion Suppression Algorithm for Satellite Reliable Multicast},
	author = {Akkor, Gun., Baras, John S., Hadjitheodosiou, Michael.},
	year = {2003},
	month = {12/2003},
	abstract = {In this paper, we propose a knapsack-based feedback suppression algorithm for reliable multicast transport protocols operating over a satellite network. A reliable transport protocol needs to identify the packets which failed to reach a given destination. This is achieved through feedback packets returned to the source. For multicast services, receive feedback has been shown to lead to the feedback implosion problem. Feedback implosion is a well-studied problem and various solutions exist in the literature. However, these solutions mainly focus on wireline terrestrial networks and do not take into account the inherent characteristics of the satellite channel and the architecture of the deployed network. Therefore, we need to revisit the problem and provide a new set of solutions for efficient integration to next-generation satellite systems. In this paper, we introduce a feedback implosion suppression algorithm, which effectively suppresses the amount of feedback relayed through the satellite channel, while ensuring that the critical information is conveyed in a timely fashion. The performance of the algorithm is evaluated through simulations.},
	address = {San Francisco, California},
	booktitle = {IEEE Globecom 2003},
	pages = {pp. 3765-3769}
}
@conference {
	title = {Modeling vulnerabilities of ad hoc routing protocols},
	author = {Yang, Shahan., Baras, John S.},
	year = {2003},
	month = {12/2003},
	abstract = {The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model fo protocol behavior is developed in which time is modeled by a set of constraints on the time of occurrence of events, enabling the representation of partially ordered timed events and asynchronous communication. Data variables are represented symbolically, capturing a range of distinct executions in each expression. Given a formal description of Ad Hoc On-Demand Distance Vector Routing Algorithm (AODV) and the desired safety property (route stability), an analysis by a naive semi-decision procedure discovers an instance of an attack that leads to a violation of the property.},
	address = {Fairfax, Virginia},
	booktitle = {1st ACM workshop on Security of ad hoc and sensor networks},
	pages = {pp. 12-20.},
	organization = {George Mason University}
}
