@conference {
	title = {Adaptive Virtual Queue Random Early Detection in Satellite Networks},
	author = {Byun, Do Jun., Baras, John S.},
	year = {2007},
	month = {04/2007},
	abstract = {Due to exponential increases in internet traffic, Active Queue Management (AQM) has been heavily studied by numerous researchers. However, little is known about AQM in satellite networks. A microscopic examination on queueing behavior in satellite networks is conducted to identify problems with applying existing AQM methods. A new AQM method is proposed to overcome the problems and it is validated with a realistic emulation environment.},
	address = {Pomona, California},
	booktitle = {2007 IEEE Wireless Telecommunications Symposium}
}
@conference {
	title = {Robust Feedback Control vs Uncertainty Model Complexity: from Information Theory to Networked Control},
	author = {Baras, John S.},
	year = {2007},
	month = {04/2007},
	address = {Limasol, Cyprus},
	booktitle = {2007 Workshop on Control over Communication Channels (ConCom 07), part of WiOpt {\textquoteright}07}
}
@conference {
	title = {Stabilization Using Multiple Sensors over Analog Erasure Channels},
	author = {Gupta, Vijay., Martins, Nuno C., Baras, John S.},
	year = {2007},
	month = {04/2007},
	abstract = {Consider a discrete-time, linear time-invariant process,two sensors and one controller. The process is observed by the sensors, which are connected to the controller via links that can be modeled as erasure channels. If a link transmits successfully then a finite-dimensional vector of real numbers is conveyed from the sensor to the controller. If an erasure event occurs, then any information conveyed over the link is lost. This paper addresses the problem of designing the maps that specify the processing at the controller and at the sensors for stabilizing the process in the bounded second moment sense. When the information is lost over the links either in an independent and identically distributed (i.i.d.) or Markovian fashion over time,we derive necessary and sufficient conditions for the existence of maps such that the process is stabilized. Such conditions are expressed as inequalities involving the parameters of the plant and the probabilities of link fading. and provide the least conservative stabilization conditions. We also indicate how our approach can be used if more than two sensors are available,if the sensors can cooperate and if the acknowledgment signals are also transmitted over erasure channels. The analysis also carries over to the case when the single channels are replaced by networks of erasure channels.},
	address = {Limassol, Cyprus},
	booktitle = {Proceedings of the 2007 Control Over Communication Channels, co-located with IEEE WiOpt 2007 Conference},
	pages = {pp. 1-7}
}
@conference {
	title = {Fundamental Tradeoffs and Constrained Coalitional Games in Autonomic Wireless Networks},
	author = {Jiang, Tao., Baras, John S.},
	year = {2007},
	month = {04/2007},
	abstract = {Autonomic networks depend on collaboration between their nodes for all their functionalities. The nodes, even if modeled as selfish, gain from such collaboration, in the sense that they can accomplish functionality and performance that is impossible to achieve without such collaboration. However,such gains from collaboration do not come for free. There are costs for such collaboration incurred by each node (e.g. energy consumption for forwarding other nodes packets). In this paper we use constrained coalitional games (i.e. collaborative dynamic games subject to constraints or costs for collaboration) to investigate several key problems in autonomic wireless networks including: network formation, efficient topologies and stability of coalitions.},
	address = {Limassol, Cyprus},
	booktitle = {5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc,and Wireless Networks},
	pages = {pp. 1-8}
}
