@conference {
	title = {Control of Autonomous Swarms Using Gibbs Sampling},
	author = {Baras, John S., Tan, Xiaobo.},
	year = {2004},
	month = {12/2004},
	abstract = {A distributed control approach is proposed for self-organization of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph where the (mobile) nodes and their communication/sensing links constitute the vertices and the edges of the graph, respectively. The movement of nodes is governed by the Gibbs sampler. The Gibbs potentials, local in nature, are designed to reflect collective goals such as gathering, dispersion, and linear formation. The algorithm can be run completely in parallel, and hence it is robust and scalable. Simulation results are provided to illustrate the proposed method.},
	address = {Atlantis, Paradise Island, Bahamas},
	booktitle = {43rd IEEE Conference on Decision and Control},
	pages = {pp. 4752-4757}
}
@conference {
	title = {Numerical Study on Joint Quantization and Control Under Block-Coding},
	author = {Tan, Xiaobo., Xi, Wei., Baras, John S.},
	year = {2004},
	month = {12/2004},
	abstract = {This paper addresses the joint quantization and control problem for hidden Markov chains with variable-length block-coding. The aim is to understand the impact of communication bandwidth and information delay (due to block-coding) on the control performance. A heuristic algorithm is developed to solve the dynamic programming (DP) equation through the introduction of a metric on the discrete observation space. Numerical results are presented demonstrating the attention division in block-coding and the tradeoffs between control performance and communication bandwidth.},
	address = {Atlantis, Paradise Island, Bahamas},
	booktitle = {43rd IEEE Conference on Decision and Control},
	pages = {pp. 4515-4520}
}
@conference {
	title = {Cooperative Games, Phase Transitions on Graphs and Distributed Trust in MANET},
	author = {Baras, John S., Jiang, Tao.},
	year = {2004},
	month = {12/2004},
	abstract = {Mobile ad-hoc networks (MANET) provide a relative new paradigm of wireless networking, which poses several formidable challenges for control, monitoring and management, due to the basically "infrastructureless" nature of these networks. Security is viewed in this paper as part of the control-operations-management functionality of MANET. An important and critical part of security is trust establishment and maintenance. We provide a description of distributed trust within the MANET framework that consists of two major components: (a) trust document distribution; and (b) distributed trust computation. Within (a) we summarize our earlier work on swarm-intelligence based trust document distribution schemes, including their major advantages as compared to other schemes as well as their performance. This paper is primarily addressing our new results within (b). Here we show that under a variety of schemes for distributed trust computation and establishment we have established strong connections with various components of the theory of random graphs. In this context we demonstrate how phase transitions (in this case they mean node transitions from nontrusted to trusted) can appear within a MANET. We link the existence and analysis of such phase transitions to dynamic cooperative games. We demonstrate that dynamic cooperative games provide a natural framework for analyzing several problems for MANET. We also demonstrate the fundamental influence of the topology of the MANET on these phase transitions. Finally we conclude with a preliminary description of results that describe the effects of mobility and topology change on these trust establishment schemes.},
	address = {Atlantis, Paradise Island, Bahamas},
	booktitle = {43rd IEEE Conference on Decision and Control,},
	pages = {pp. 93-98}
}
@conference {
	title = {Sampling of Diffusion Processes for Real-Time Estimation},
	author = {Rabi, Maben., Baras, John S.},
	year = {2004},
	month = {12/2004},
	abstract = {This paper addresses the causal sampling of observations of a diffusion process that results in a good quality continuous estimator based upon these samples. The optimal sampling scheme with a fixed number of samples is found by solving an optimal (multiple) stopping problem. This is solved explicitly in a special case. A class of threshold approximations is also described.},
	address = {Atlantis, Paradise Island, Bahamas},
	booktitle = {43rd IEEE Conference on Decision and Control},
	pages = {pp. 4163-4168}
}
@conference {
	title = {Distributed Certification Authority Generation to Enhance Autonomous Key Management for Group Communications in MANETs},
	author = {Striki, Maria., Baras, John S.},
	year = {2004},
	month = {11/2004},
	abstract = {A MANET is a collection of wireless mobile nodes dynamically forming a temporary network, without the use of fixed infrastructure or centralized entities, and this is exactly the environment envisioned for military operations by the Objective Force. Military command and control rely on secure (multicast) communications, and thus key management (KM) schemes that ensure secure communications under MANET constraints are required. However, without fixed infrastructure, e.g. trusted third parties (TTPs), Certification Authorities (CAs), the design of KM becomes particularly difficult, since its most fundamental service {\textendash} entity authentication, privileges update/revocation - rely on these entities to establish trust among nodes, terminate or renew participation to secure operations in a pre-agreed, global manner. Without this guarantee, all subsequent KM operations make no sense. So, it is of paramount importance to provide a secure authentication service that detects misbehavior and defends against dishonest users in the network. Thus, the challenge lies in dynamically generating mechanisms that provide individual nodes and KM groups with functionalities similar to those of the original CAs of fixed infrastructure, under MANET constraints. In this work, we develop distributed, scalable, robust and efficient mechanisms for dynamically generating CAs in MANETs, by distributing the tasks of a CA among legitimate members of existing (preferably hierarchical) KM groups. We will show how the features of our scheme render it superior in performance and resilience and how properties of KM groups are exploited to avoid impractical heavy bandwidth-delay solutions of other proposals in the literature.},
	address = {Orlando, Florida},
	booktitle = {24th Army Science Conference (ASC2004)}
}
@conference {
	title = {Measurement and Simulation Based Effective Bandwidth Estimation},
	author = {Liu, Nelson X., Baras, John S.},
	year = {2004},
	month = {11/2004},
	abstract = {Effective bandwidth represents the resource demand for network traffic to achieve its QoS goal. However, so far, the estimation of the effective bandwidth for modern Internet traffic has been difficult and inaccurate. We present a novel scheme using measurement and simulation techniques to estimate the effective bandwidth. The advantages of the scheme lie in its accuracy, its applicability to various traffic environments, and its efficiency. We describe the simulation procedure, the efficient search algorithm to lock the effective bandwidth quickly, the sample size determination algorithm, and the performance judgment policy in the simulation to guarantee the estimation accuracy. We also examine the issue of estimating the effective bandwidth of aggregate traffic from sub-aggregates, and provide an empirical formula to achieve very good accuracy.},
	address = {Dallas, TX},
	booktitle = {GLOBECOM 04},
	pages = {pp. 2108-2112}
}
@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 = {Providing Full Connectivity in Large Ad-Hoc Networks by Dynamic Placement of Aerial Platforms},
	author = {Chandrashekar, Karthikeyan., Raissi-Dekhordi, Majid., Baras, John S.},
	year = {2004},
	month = {10/2004},
	abstract = {In this paper, we address the problem of providing full connectivity to disconnected ground MANET nodes by dynamically placing unmanned aerial vehicles (UAVs) to act as relay nodes. We provide a heuristic algorithm to find the minim1 number of such aerial vehicles required to provide full connectivity and find the corresponding locations for these aerial platforms (UAVs). We also track the movement of the ground nodes and update the location of the UAVs. We describe a communication framework that enables the ground nodes to communicate with its peer ground nodes as well as the UAVs that act as relay nodes. The communication architecture is designed to work with existing MANET Routing Protocols.},
	address = {Monterey, California},
	booktitle = {MILCOM 2004},
	pages = {pp. 1429-1436}
}
@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 = {Capability Assessment and Design Evaluation for the Hybrid Network of Space GiG and Terrestrial Sensor Nets: Global Monitoring, Tracking and Query},
	author = {Liu, Nelson X., Baras, John S.},
	year = {2004},
	month = {10/2004},
	abstract = {In this paper, we propose a hierarchical architecture for organizing the hybrid network of the LEO-satellite based space network and terrestrial sensor nets. The hybrid network has unique advantages in providing global monitoring, tracking, and query capabilities. We assess these three capabilities of the network, and seek the optimal design in terms of the cooperation of the MAC and routing protocols. We evaluate six combinations of the MAC and routing protocols, and identify the best solution. Extensive simulation results are provided, Application models and performance metrics for the three capabilities are developed. The work provides a reference framework for pursuing global monitoring, tracking, query capabilities with hybrid space-terrestrial networks.},
	address = {Monterey, California},
	booktitle = {MILCOM 2004},
	pages = {pp. 899-905}
}
@conference {
	title = {Detection and Prevention of MAC Layer Misbehavior in Ad Hoc Networks},
	author = {Cardenas, Alvaro A., Radosavac, Svetlana., Baras, John S.},
	year = {2004},
	month = {10/2004},
	abstract = {Selfish behavior at the MAC layer can have devastating side effects on the performance of wireless networks, similar to the effects of DoS attacks. In this paper, we focus on the prevention and detection of the manipulation of the backoff mechanism by selfish nodes in 802.11. We first propose an algorithm to ensure honest backoffs when at least one, either the receiver or the sender is honest. Then we discuss detection algorithms to deal with the problem of colluding selfish nodes. Although we have focused on the MAC layer of 802.11, our approach is general and can serve as a guideline for the design of any probabilistic distributed MAC protocol.},
	address = {Washington DC},
	booktitle = {2nd ACM workshop on Security of ad hoc and sensor networks},
	pages = {pp. 17-22}
}
@conference {
	title = {TCP Splitting Protocol for Broadband Aeronautical Satellite Networks},
	author = {Shang, Yadong., Hadjitheodosiou, Michael., Baras, John S.},
	year = {2004},
	month = {10/2004},
	abstract = {In this paper, we recommend suitable transport protocols for an aeronautical network supporting Internet and data services via satellite. For the future IP-based aeronautical satellite hybrid network, we describe TCP protocol and focus on the problems that cause dramatically degraded performance of the Transport Protocol. Based on the observation that it is difficult for an end-to-end solution to solve these problems effectively, we propose a new TCP-splitting protocol, termed Aeronautical Transport Control Protocol (AeroTCP). The main idea of this protocol is to use a fixed window for flow control and one duplicated acknowledgment (ACK) for fast recovery. We also study the Gilbert-Elliott channel model for satellite channel since protocol behavior often depends strongly on the channel behavior. Our simulation results show that AeroTCP can maintain higher utilization for the satellite link than end-to-end TCP, especially in burst error-environment.},
	address = {Salt Lake City, Utah},
	booktitle = {23rd Digital Avionics Systems Conference (DASC)},
	pages = {pp. 11.C.3 (1-9)}
}
@conference {
	title = {Vision-Based Microtribological Characterization of Linear Microball Bearings},
	author = {Tan, Xiaobo., Modafe, Alireza., Hergert, R., Ghalichechian, N., Shapiro, B, Baras, John S., Ghodssi, R.},
	year = {2004},
	month = {10/2004},
	abstract = {Microball bearings can potentially provide robust and low friction support in micromachines such as micromotors and microgenerators. Their microtribological behavior needs to be investigated for design and control of such micromachines. In this paper a vision-based, non-intrusive measurement method is presented for characterization of friction in linear microball bearings. Infrared imaging is used to directly observe the dynamics of microballs and track the motion of bearing components. It is verified that microballs roll most of the time with occasional sliding or bumping resulting from fabrication nonuniformity. The friction-velocity curve demonstrates evident hysteresis. The dependence of frictional behavior on several factors is studied.},
	address = {Long Beach, California},
	booktitle = {ASME/STLE International Joint Tribology Conference (IJTC04)},
	pages = {pp. 1-6}
}
@conference {
	title = {ATEMU: A Fine-Grained Sensor Network Simulator},
	author = {Polley, Jonathan., Blazakis, Dionysus., McGee, Jonathan., Rusk, Dan., Baras, John S., Karir, Manish.},
	year = {2004},
	month = {10/2004},
	abstract = {In this paper we describe the design and implementation of ATEMU, a fine grained sensor network simulator. ATEMU is intended to bridge the gap between actual sensor network deployments and sensor network simulations. We adopt a hybrid strategy, where the operation of individual sensor nodes is emulated in an instruction by instruction manner, and their interactions with each other via wireless transmissions are simulated in a realistic manner. A unique feature of ATEMU is its ability to simulate a heterogeneous sensor network. Using ATEMU it is possible to not only accurately simulate the operation of different application on the MICA2 platform but also a complete sensor network where the sensor nodes themselves maybe based on different hardware platforms. In addition we also describe our implementation of XATDB, our front-end debugger/GUI for ATEMU. XATDB provides an excellent educational tool for people to start learning about the operation of sensor nodes and sensor networks, without requiring the purchase of actual sensor node hardware. The accuracy and emulation capabilities provided by ATEMU ensure that when and if actual hardware is used, the software will already have undergone rigorous testing and debugging on an accurate platform. This would provide the sensor network deployment community with a much more accurate estimate of the performance of various algorithms and protocols in realistic scenarios and platforms.},
	address = {Santa Clara, CA},
	booktitle = {First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks},
	pages = {pp. 145-152}
}
@conference {
	title = {Trust Evaluation in Ad-Hoc Networks},
	author = {Theodorakopoulos, George., Baras, John S.},
	year = {2004},
	month = {10/2004},
	abstract = {An important concept in network security is trust, interpreted as a relation among entities that participate in various protocols. Trust relations are based on evidence related to the previous interactions of entities within a protocol. In this work, we are focusing on the evaluation process of trust evidence in Ad Hoc Networks. Because of the dynamic nature of Ad Hoc Networks, trust evidence may be uncertain and incomplete. Also, no pre-established infrastructure can be assumed. The process is formulated as a path problem on a directed graph, where nodes represent entities, and edges represent trust relations. Using the theory of semirings, we show how two nodes can establish an indirect trust relation without previous direct interaction. The results are robust in the presence of attackers. We give intuitive requirements for any trust evaluation algorithm. The performance of the scheme is evaluated on three topologies.},
	address = {Philadelphia, PA},
	booktitle = {2004 ACM workshop on Wireless security},
	pages = {pp. 1-10}
}
@conference {
	title = {Adaptive Hierarchical Resource Management for the Hybrid network of MANET-Satellite Internet},
	author = {Liu, Nelson X., Zhou, Xiaoming., Baras, John S.},
	year = {2004},
	month = {09/2004},
	abstract = {MANETs are often deployed in an infrastructure-less or hostile region where the satellite provides the only link for the MANETs to communicate with the rest part of the world. It faces many challenges to support multiple serviced communications between MANETs and Internet through satellite. In this paper we propose an efficient resource management scheme called AHRM to dynamically allocate bandwidths among multiple MANET users and multiple priority and non-priority services sharing a multi-access satellite channel. It uses a flexible hierarchical structure to exploit the channel utility and resolve contention from two levels. A bandwidth adaptation algorithm is designed to adjust the allocation dynamically in response to traffic and link status changes. The algorithm turns out to be in line with reinforcement learning and is a customized version of it for the practical satellite network setting. Implementation issues are discussed. Simulation results are presented, showing that the scheme can guarantee fast delivery of critical messages in spite of channel contention, and significantly improve the performance of multiple services.},
	address = {Los Angeles, California},
	booktitle = {2004 IEEE Vehicular Technology Conference},
	pages = {pp. 4027-4031}
}
@article {
	title = {Modeling and Control of Hysteresis in Magnetostrictive Actuators},
	author = {Tan, Xiaobo., Baras, John S.},
	year = {2004},
	month = {07/2004},
	abstract = {A novel dynamic model is proposed for the hysteresis in magnetostrictive actuators by coupling a Preisach operator to an ordinary differential equation, and a parameter identification method is described. An efficient inversion algorithm for a class of Preisach operators with piecewise uniform density functions is then introduced, based upon which an inverse control scheme for the dynamic hysteresis model is presented. Finally, the inversion error is quantified and l1 control theory is applied to improve the robustness of inverse compensation. Simulation and experimental results based on a Terfenol-D actuator are provided.},
	pages = {pp. 1469-1480},
	volume = {Volume 40},
	number = {Issue 9},
	journal = {Automatica}
}
@article {
	title = {Adaptive Identification and Control of Hysteresis in Smart Materials},
	author = {Tan, Xiaobo., Baras, John S.},
	year = {2004},
	month = {09/2004},
	abstract = {Hysteresis hinders the effective use of smart materials in sensors and actuators. This paper addresses recursive identification and adaptive inverse control of hysteresis in smart material actuators, where hysteresis is modeled by a Preisach operator with a piecewise uniform density function. Two classes of identification schemes are proposed and compared, one based on the hysteresis output, the other based on the time difference of the output. Conditions for parameter convergence are presented in terms of the input to the Preisach operator. An adaptive inverse control scheme is developed by updating the Preisach operator (and thus its inverse) with the output-based identification method. The asymptotic tracking property of this scheme is established, and for periodic reference trajectories, the parameter convergence behavior is characterized. Practical issues in the implementation of the adaptive identification and inverse control methods are also investigated. Simulation and experimental results based on a magnetostrictive actuator are provided to illustrate the proposed approach.},
	pages = {pp. 827-839},
	volume = {Vol.  50},
	number = {No. 6},
	journal = {IEEE Transactions on Automatic Control.}
}
@conference {
	title = {Adaptive Inverse Control of Hysteresis in Smart Materials},
	author = {Tan, Xiaobo., Baras, John S.},
	year = {2004},
	month = {09/2004},
	abstract = {Hysteresis hinders the effective use of smart materials in sensors and actuators. This paper addresses recursive identification and adaptive inverse control of hysteresis in smart material actuators, where hysteresis is modeled by a Preisach operator with a piecewise uniform density function. Two classes of identification schemes are proposed and compared, one based on the hysteresis output, the other based on the time-difference of the output. Conditions for parameter convergence are presented in terms of the input to the Preisach operator. An adaptive inverse control scheme is developed by updating the Preisach operator (and thus its inverse) with the output-based identification method. The asymptotic tracking property of this scheme is established, and for periodic reference trajectories, the parameter convergence behavior is characterized. Practical issues in the implementation of the adaptive identification and inverse control methods are also investigated. Simulation and experimental results based on a magnetostrictive actuator are provided to illustrate the proposed approach.},
	address = {Stuttgart, Germany},
	booktitle = {2004 Nonlinear Control Systems (NOLCOS) IFAC Workshop}
}
@techreport {
	title = {Key Management for Secure Multicast in Hybrid Satellite Networks},
	author = {Roy-Chowdhury, Ayan., Baras, John S.},
	year = {2004},
	month = {08/2004},
	abstract = {This paper proposes a design for key management for secure multicast in hybrid satellite networks. Communication satellites offer an efficient way to extend IP multicast services for groups in wide-area networks. In order to be commercially viable, the multicast traffic should be accessible only to paying subscribers. Access control can be achieved by data encryption. This requires secure and efficient methods to generate, distribute and update the keys. Most current key management protocols do not scale well when applied to large dynamic groups in wide-area networks. This paper attempts to solve the above problem for groups in a hybrid network that is composed of terrestrial Ethernet LANs interconnected by ATM-based satellite channels. We investigate current group key management protocols, and design a framework for secure and scalable key management for the multicast routing architecture in the satellite network. The proposed framework is presented in detail, alongwith analysis and simulation results.},
	address = {Toulouse, France}
}
@conference {
	title = {Key Management for Secure Multicast in Hybrid Satellite Networks},
	author = {Roy-Chowdhury, Ayan., Baras, John S.},
	year = {2004},
	month = {08/2004},
	abstract = {This paper proposes a design for key management for secure multicast in hybrid satellite networks. Communication satellites offer an efficient way to extend IP multicast services for groups in wide-area networks. In order to be commercially viable, the multicast traffic should be accessible only to paying subscribers. Access control can be achieved by data encryption. This requires secure and efficient methods to generate, distribute and update the keys. Most current key management protocols do not scale well when applied to large dynamic groups in wide-area networks. This paper attempts to solve the above problem for groups in a hybrid network that is composed of terrestrial Ethernet LANs interconnected by ATM-based satellite channels. We investigate current group key management protocols, and design a framework for secure and scalable key management for the multicast routing architecture in the satellite network. The proposed framework is presented in detail, alongwith analysis and simulation results.},
	address = {Toulouse, France},
	booktitle = {19th IFIP International Information Security Conference (SEC 2000)},
	pages = {pp. 533-548}
}
@conference {
	title = {Cumulative Caching for Reduced User-Perceived Latency for WWW Transfers on Networks with Satellite Links},
	author = {Bhalekar, Aniruddha., Baras, John S.},
	year = {2004},
	month = {08/2004},
	abstract = {The demand for internet access has been characterized by an exponential growth. The introduction of high-speed satellite communications systems providing direct-to-home internet is a response to this increasing demand. However such systems use geo-synchronous satellites and suffer from high latency. Currently, the most popular application layer protocols for the World Wide Web (WWW) are HTTP/1.0 and HTTP/1.1. Since HTTP is a request-response protocol, there are performance issues with using it over high-delay links such as links involving Geo-synchronous Earth Orbit (GEO) satellites. Such usage leads to severely increased user perceived latency which makes "internet browsing" a cumbersome experience. In this paper we investigate this problem and analyze a mechanism to reduce this user-perceived delay.},
	address = {Fortaleza, Brazil},
	booktitle = {Service Assurance with Partial and Intermittent Resources: First International Workshop, SAPIR 2004},
	pages = {pp. 179-186}
}
@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}
}
@conference {
	title = {Understanding the Trade-Off Between Multiuser Diversity Gain and Delay - An Analytical Approach},
	author = {Srinivasan, Roshni., Baras, John S.},
	year = {2004},
	month = {05/2004},
	abstract = {Innovative scheduling algorithms for packet switched air-interfaces have been shown to support higher data rates by exploiting the multiuser diversity inherent to cellular wireless systems. While such opportunistic schedulers significantly improve the system throughput, they could degrade the user experience through unfair resource allocation and increased variability in the scheduled rate and delay. The growing demand for service differentiation between real-time multimedia traffic and data traffic underscores the need for these schedulers to incorporate delay constraints. The analytical results in this paper not only highlight the inherent trade-off between system throughput and the delay experienced by mobile users with opportunistic scheduling, but they also provide a novel way of quantifying the Quality of Service(Q0S) offered by a general opportunistic scheduler.Our analysis is strongly supported by system simulations of a time-slotted cellular downlink shared by multiple mobile users with independent, time-varying channels. In addition, we use a continuous approximation to compute closed form expressions for the scheduler statistics.},
	address = {Milan, Italy},
	booktitle = {2004 IEEE 59th Vehicular Technology Conference},
	pages = {pp. 2543-2547}
}
@conference {
	title = {Transport Protocol Support for Aeronautical Satellite Communications},
	author = {Shang, Yadong., Hadjitheodosiou, Michael., Baras, John S.},
	year = {2004},
	month = {05/2004},
	abstract = {We recommend suitable transport protocols for an aeronautical network supporting Internet and data services via satellite. We study the characteristics of an aeronautical satellite hybrid network and focus on the problems that cause dramatically degraded performance of the Transport Protocol. We discuss various extensions to standard TCP that alleviate some of these performance problems. Through simulation, we identify those TCP implementations that can be expected to perform reasonably well. Based on the observation that it is difficult for an end-to-end solution to solve these problems effectively, we propose a new TCP-splitting protocol, termed Aeronautical Transport Control Protocol (AeroTCP). The main idea of this protocol is to use a fixed window for flow control and one duplicated acknowledgement (ACK) for fast recovery. Our simulation results show that AeroTCP can maintain higher utilization for the satellite link than end-to-end TCP, especially in high BER environment.},
	address = {Monterey, California},
	booktitle = {22nd AIAA International Communications Satellite Systems Conference \&amp; Exhibit 2004 (ICSSC22)}
}
@conference {
	title = {Framework for IP Multicast in Satellite ATM Networks},
	author = {Roy-Chowdhury, Ayan., Baras, John S.},
	year = {2004},
	month = {05/2004},
	abstract = {This paper proposes a design for IP multicast routing in hybrid satellite networks. The emergence of IP multicast for Internet group communication has placed focus on communication satellites as an efficient way to extend the multicast services for groups with distributed membership in wide-area networks. This poses interesting challenges for routing. Hybrid satellite networks can have both wired and wireless links and also combine different link-layer technologies like Ethernet and ATM. No proposed IP multicast routing protocol for wired networks offers an integrated solution for such networks. This paper attempts to provide a solution by proposing a design for IP multicast routing in wide-area networks that have terrestrial Ethernet LANs interconnected by ATM-based satellite channels. The paper reviews the multicast services offered by IP and ATM, and proposes a multicast routing framework that combines PIM-SM protocol for terrestrial multicasting with the ATM MARS and VC mesh architecture for multicast routing over the satellite links. Modifications are made to the standard protocols to suit the unique needs of the network being considered. The feasibility of the proposed design is tested by performing simulations. The proposed framework is presented in detail, along with analysis and simulation results.},
	address = {Monterey, California},
	booktitle = {22nd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)},
	pages = {pp. 1-13}
}
@conference {
	title = {An Optimization-based Approach to Flow~Control and Resource Allocation Problem in Satellite Communication Systems},
	author = {Akkor, Gun., Baras, John S., Hadjitheodosiou, Michael.},
	year = {2004},
	month = {05/2004},
	abstract = {We propose an approach to optimize resource sharing and flow control in a multi-beam broadband satellite system that supports both unicast and multicast flows. We show that, in this architecture, the load on every spot-beam queue could be different, depending on the type of the flows and the distribution of the receivers across spot-beam coverage areas. This load imbalance may significantly under-utilized the system resources and decrease the system throughput when both unicast and multicast flows are active in the system. In this paper, we formulate an optimization problem for Intra- and inter-beam resource sharing such that the variance of the session rates experienced by users of a flow located in different beam coverage areas is minimized. The result of our resource allocation also determines the maximum sustainable rate of each flow. We present results that compare the beam utilization and maximum sustainable sessions rates with and without optimization. We conclude that this method improves the average session rates up to 40\% and average utilization of the system up to 15\% when both unicast and multicast flows are active.},
	address = {Monterey, California},
	booktitle = {22nd AIAA International Communication Satellite Systems Conference \&amp; Exhibit 2004, (ICSSC)}
}
@techreport {
	title = {Framework for IP Multicast in Satellite ATM Networks},
	author = {Roy-Chowdhury, Ayan., Baras, John S.},
	year = {2004},
	month = {05/2004},
	abstract = {This paper proposes a design for IP multicast routing in hybrid satellite networks. The emergence of IP multicast for Internet group communication has placed focus on communication satellites as an efficient way to extend IP multicast services for groups with distributed membership in wide-area networks. This poses interesting challenges for routing. Satellite networks can have both wired and wireless links and also combine different link-layer technologies like Ethernet and ATM. No proposed IP multicast routing protocol for wired networks offers an integrated solution for such networks. This paper attempts to provide a solution by proposing a design for IP multicast routing in wide-area networks that have terrestrial Ethernet LANs interconnected by ATM-based satellite channels. The paper reviews the multicast services offered by IP and ATM, and proposes a multicast routing framework that combines PIM-SM protocol for terrestrial multicasting with the ATM MARS and VC mesh architecture for multicast routing over the satellite links. Modifications are made to the standard protocols to suit the unique needs of the network being considered. The feasibility of the proposed design is tested by performing simulations. The proposed framework is presented in detail, along with analysis and simulation results.},
	address = {Monterey, California},
	number = {Number: CSHCN TR 2004-8}
}
@conference {
	title = {Protocol Support for A New Satellite-Based Airspace Communication Network},
	author = {Shang, Yadong., Hadjitheodosiou, Michael., Baras, John S.},
	year = {2004},
	month = {04/2004},
	abstract = {We Recommend suitable transport protocols for an aeronautical network supporting internet and data services via sattelite.We study the characteristics of an aeronautical satellite hybrid network and focus on the problems that cause dramatically degraded performance of the Transport Protocol. We discuss various extensions to standard TCP that alleviate some of these performance problems. Through simulation, we identify those TCP implementations that can be expected to perform well. Based on the observation that it is difficult for an end-to-end solution to solve these problems effectively, we propose a new TCP splitting protocol, termed Aeronautical Transport Control Protocol (AeroTCP). The main idea of this protocol is to use a fixed window for flow control and one duplicated acknowledgement (ACK) for fast recovery. Our simulation results show that AeroTCP~can maintain higher utilization for the satellite link than end-to-end TCP, especially in high BER environment.},
	address = {Fairfax, Virginia},
	booktitle = {4th Integrated Communications, Navigation, and Surveillance (ICNS) Conference},
	pages = {pp. 81-90}
}
@conference {
	title = {Fixed Point Approximation for Multirate Multihop Loss Networks with State-Dependent Routing},
	author = {Liu, Mingyan., Baras, John S.},
	year = {2004},
	month = {04/2004},
	abstract = {In this paper we consider a class of loss networks that have arbitrary topologies and routes of arbitrary length. Multiple traffic classes are present, each with different bandwidth requirement, and each routed according to a state-dependent routing scheme. In particular, we consider the least loaded routing method generalized to routes of arbitrary number of hops. The connection level performance metric of interest is the end-to-end blocking probability. We are interested in developing fast evaluation methods to provide reasonably accurate estimates of the blocking probability, especially under heavy traffic load. Our algorithms are based on the fixed-point method framework, also known as the reduced load approximation. In addition to what commonly examined by previous work, two more factors contribute to the complexity of the computation in the scenario under consideration in this paper. One is the state-dependent nature of the routing mechanism, the other is the possible overlapping between routes due to the general multihop topology of the network. We present two fast approximation algorithms to evaluate the blocking probability with state-dependent routing by simplifying the route overlapping computation. We discuss the computational complexity of our algorithms as well as sources of approximation error. We then compare the numerical results with that of simulation and show that our algorithms provide fairly accurate blocking probability estimates especially under heavy traffic load.},
	booktitle = {IEEE/ACM Transactions on Networking},
	pages = {pp.361 - 374}
}
@conference {
	title = {Ant-based Adaptive Trust Evidence Distribution in MANET},
	author = {Jiang, Tao., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {Due to the lack of infrastructure and vulnerability of wireless links, security in ad hoc networks is considered to be much more difficult than in traditional hierarchical networks. Building the trust relationship between entities is a fundamental problem in ad hoc networks, since the availability of servers, which distribute trust certificates, is not guaranteed. Furthermore, the existence of any trusted server might not be assumed either. Therefore, the commonly used key distribution center (KDC) and certification authority (CA) are not applicable in such highly autonomous environments. In this paper, we propose a scheme for the distribution of trust certificates, which is completely distributed and adaptive to mobility. Our scheme is based on the swarm intelligence paradigm, which has been used for routing both in wired and wireless networks. Our simulations in ns-2 show that it performs very well in ad hoc environments.},
	address = {Tokyo, Japan},
	booktitle = {2nd International Workshop on Mobile Distributed Computing, in conjunction with the International Conference on Distributed Computing Systems, MDC\&rsquo;04},
	pages = {pp. 588-593}
}
@article {
	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 analyzed. Since the model links the multi-scale behavior 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.},
	pages = {pp. 251-257},
	volume = {Vol.  151},
	number = {No. 3},
	journal = {Communications \&ndash; IEEE Proceedings}
}
@conference {
	title = {A Reliable Multicast Transport Protocol with Feedback Implosion Suppression for Satellite Communication Systems},
	author = {Akkor, Gun., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {In this paper, we propose a reliable multicast transport protocol for satellite communication systems. Many of the emerging applications in the Internet would benefit from reliable multicast services, and broadband satellite communication systems have attractive characteristics for supporting such services. However, many of the protocols designed primarily for terrestrial networks do not perform well over satellite networks. Therefore, it is necessary to look at the problem of reliable multicast in the solution space of satellite communications. Our protocol makes use of a special form of forward error correcting codes and couples it with an adaptive window based control mechanism to dynamically adjust the number of encoding packets forwarded to the users. Protocol makes very good use of the broadcast nature of the satellite channel and attempts to minimize the feedback volume by a novel feedback implosion suppression algorithm. We evaluate the protocol performance by computer simulations.},
	address = {Princeton, New Jersey},
	booktitle = {38th Annual Conference on Information Sciences and Systems (CISS 2004)},
	pages = {pp. 1-6}
}
@conference {
	title = {A Parallel Virtual Queue Structure for Active Queue Management},
	author = {Jou,  Jia-Shiang., Tan, Xiaobo., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {Performance of the Adaptive RED scheme is susceptible to bursty web traffic. A parallel queue structure was proposed earlier to address this problem, where real time connections (such as web and UDP) and non-real time connections (such as FTP) are served in two different queues with droptail and Adaptive RED policies, respectively. In this paper a modified Adaptive RED scheme is proposed for the second queue to improve the goodput of non-real time connections. In this scheme the queue length thresholds for the Adaptive RED are dynamically determined by the average droppping probability. Simulation shows that the packet dropping probability of the Adaptive RED queue stays within a desired small region. The stability of the queue length variation under this policy is proved under mild conditions.},
	address = {Princeton, New Jersey},
	booktitle = {Proceedings of 38th Conference on Information Sciences and Systems - CISS 2004,},
	pages = {pp. 1-6}
}
@conference {
	title = {A Parallel Queue Structure for Active Queue Management},
	author = {Jou,  Jia-Shiang., Tan, Xiaobo., Baras, John S.},
	year = {2004},
	month = {03/2004},
	address = {Princeton, NJ},
	booktitle = {Annual Conference on Information Sciences and Systems}
}
@conference {
	title = {Cross-Layer Attacks in Wireless Ad-Hoc Networks},
	author = {Radosavac, Svetlana., Benammar, Nassir., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {Denial of Service (DoS) attacks are difficult to prevent and protect against. In this paper we focus on DoS attacks in wireless ad hoc networks that propagate from MAC to routing layer, causing breaking of critical routes. We present several traffic patterns that an intelligent attacker can generate to cause Denial of Service attack in one or several nodes in ad hoc networks. More specifically, we focus on the properties of IEEE 802.11 MAC protocol and attack propagation to the routing layer. We focus on attacks that use low-rate traffic patterns with the goal of disabling one or more specific nodes or partitioning the network. We propose a scheme for attack detection based on modelling of MAC protocols using Extended Finite State Machines (EFSM) and present general outline for an Intrusion Detection System that has the ability to generate attack patterns and check the validity of communication patterns in the network.},
	address = {Princeton, New Jersey},
	booktitle = {Proceedings of 38th Conference on Information Sciences and Systems - CISS 2004,},
	pages = {pp. 1266-1271}
}
@conference {
	title = {Adaptive Dynamic Routing in Mobile Wireless Ad Hoc Networks Utilizing On-Line Link Life Estimates},
	author = {Alzate, Marco A., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {The current duration of a link in a mobile wireless ad hoc network (MANET) can be used for link stability assessment through on-line remaining link life estimation. These estimates implicitly include the effects of true propagation mechanisms, mobility space geometry, power control mechanisms and other phenomena that are ignored or simplistically modeled in other methods based on location or signal strength measures. In this paper we use such estimates for multipath/backup adaptive dynamic routing, and compare its performance with a corresponding multipath/backup version of DSR.},
	address = {Princeton, NY},
	booktitle = {38th Annual Conference on Information Sciences and Systems (CISS 2004)}
}
@conference {
	title = {Dynamic Clustering of Self Configured Ad-Hoc Networks Based on Mobility},
	author = {Manasoukis, Kyriakos., Baras, John S.},
	year = {2004},
	month = {03/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, with cross-domain interaction only through a few border nodes. 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 condition 1]. On the other hand, the benefits from grouping the nodes are obvious only when the clustering is done in a way that the overhead that is produced due to its application does not offset the gain from the grouping of nodes. A significant source of overhead is the reclustering of nodes due to dynamic changes in network topology. If we manage to minimize the effect of reclustering then we expect the performance of the network to be improved (e.g., more scalable and survivable network). In this work we try to identify the various mobility groups and cluster the nodes accordingly. By grouping together nodes with similar mobility characteristics we can minimize/eliminate the effect of reclustering, since the topology changes will not affect the intra cluster connectivity.},
	address = {Princeton, NJ},
	booktitle = {38th Annual Conference on Information Sciences and Systems (CISS 2004)},
	pages = {pp. 1-6}
}
@conference {
	title = {LES: Layered Encryption Security},
	author = {Karir, Manish., Baras, John S.},
	year = {2004},
	month = {02/2004},
	abstract = {In this paper we discuss the concept of Layered Encryption Security(LES). We analyze the need for introducing layering in a security infrastructure. Layered encryption provides us the ability to selectively disclose different parts of data to different parties that might be interested in it without compromising the security of the other parts. We have implemented a simple prototype implementation to demonstrate the practical feasibility of the concept by modifying IPSEC. Measurements from our implementation indicate that the Layered Encryption approach does not add unacceptable delays and does not substantially increase processing requirements at either the end points or at intermediate nodes.},
	address = { French Caribbean},
	booktitle = {3rd International Conference on Networking (ICN\&rsquo;04)},
	organization = {Gosier Guadeloupe}
}
@conference {
	title = {Multicast Routing in Mobile Ad Hoc Networks Using Source Grouped Flooding},
	author = {Chandrashekar, Karthikeyan., Baras, John S.},
	year = {2004},
	month = {02/2004},
	abstract = {In this paper, we address the multicast routing problem for mobile ad hoc networks (MANETs). We present the Source Grouped Flooding approach to achieve multicast in MANETs. In this protocol, each source creates a flooding group consisting of nodes connecting the source to the multicast members. The nodes in the flooding group are recruited based on hop count distance constraints obtained during a request-reply phase. The flooding group though robust may result in redundant data transmissions. We also propose a probabilistic data forwarding mechanism to achieve efficient data dissemination. The protocol aims to achieve the robustness of flooding and data distribution efficiency of tree based protocols. Simulation results verify performance.},
	address = {Barcelona, Spain},
	booktitle = {5th European Wireless Conference}
}
@conference {
	title = {Implementing Ad Hoc to Terrestrial Network Gateways},
	author = {McGee, Jonathan., Karir, Manish., Baras, John S.},
	year = {2004},
	month = {02/2004},
	abstract = {In this paper we describe our experience of implementing a gateway between ad hoc and terrestrial routing protocols. Our implementation of the gateway includes support for both a unicast routing protocol, as well as a multicast routing protocol. Though we limit our implementation to a particular set of protocols, we believe that the principles involved can easily be applied to other routing protocols. In particular, in this paper we detail our work on implementing a gateway between a network running MOSPF on a wired terrestrial network interface and MAODV on a wireless ad hoc network interface. Though we focus primarily on the single gateway scenario, we also discuss complications that arise from the use of multiple gateways and illustrate the potential failures that can arise in those scenarios.},
	address = {Frankfurt, Germany},
	booktitle = {2nd International Conference on Wired/Wireless Internet Communications (WWIC 2004)},
	pages = {pp. 132-142}
}
@conference {
	title = {Analyzing the Performance of Data Users in Packet Switched Wireless Systems with Prioritized Voice Traffic},
	author = {Srinivasan, Roshni., Baras, John S.},
	year = {2004},
	month = {02/2004},
	abstract = {The integration of wireless telephony and data services in 3G and 4G wireless systems that use packet-switched air interfaces poses new challenges in the management of network resources. Although highly compressed voice traffic is given priority over data traffic, scheduling algorithms which exploit multiuser diversity have been shown to significantly improve the data throughput . In this paper, we quantify the effect of prioritized voice traffic on the performance of data users in the system using a mix of analysis and simulation. We analytically characterize the scheduled rate, delay and packet service times for data in the presence of prioritized voice traffic by using a general scheduling metric that incorporates a measure of the user{\textquoteright}s channel quality in addition to a delay constraint. The results provide important tools for cellular network operators to evaluate system performance and provision resources for traffic with varying Quality of Service(QoS) requirements.},
	address = {Frankfurt, Germany},
	booktitle = {2nd International Conference on Wired/Wireless Internet Communications (WWIC 2004)},
	pages = {pp. 236-247}
}
@conference {
	title = {Measurement and Simulation Based Effective Bandwidth Estimation MANETs},
	author = {Liu, Nelson X., Baras, John S.},
	year = {2004},
	month = {01/2004},
	abstract = {Effective bandwidth represents the resource demand for network traffic to achieve its QoS goal. However, the estimation of the effective bandwidth for modern Internet traffic is difficult and inaccurate so far. In this paper we present a novel scheme using the measurement and simulation techniques to estimate the effective bandwidth. The advantages of the schemelie in its accuracy, its applicability to various traffic environments, and its efficiency. We describe the simulation procedure, the efficient search algorithm to quickly lock the effective bandwidth, the sample size determination algorithm, and the performance judgment policy in the simulation to guarantee the estimation accuracy. We also examine the issue of estimating the effective bandwidth of aggregate traffic from sub-aggregates, and provide an empirical formula to achieve very good accuracy.},
	address = {Dallas, Texas},
	booktitle = {GLOBECOM 2004}
}
