@conference {
	title = {Observing a Linear Process over Analog Erasure Channels using Multiple Sensors: Necessary and Sufficient Conditions for Mean-square Stability},
	author = {Gupta, Vijay., Martins, Nuno C., Baras, John S.},
	year = {2007},
	month = {12/2007},
	abstract = {Consider a discrete-time linear time-invariant process being observed by two sensors, which are connected to an observer 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 sensors and the observer to calculate the minimum mean square error estimate of the state of the process. We derive necessary and sufficient conditions for the existence of maps such that the estimate error is bounded in the second moment sense.},
	address = {New Orleans, Louisiana},
	booktitle = {46th IEEE Conference on Decision and Control},
	pages = {pp. 659-664}
}
@conference {
	title = {Sensor Scheduling using Smart Sensors},
	author = {Hovareshti, Pedram., Gupta, Vijay., Baras, John S.},
	year = {2007},
	month = {12/2007},
	abstract = {The sensor selection problem arises when multiple sensors are jointly trying to estimate a process but only a subset of them can take and/or use measurements at any time step. In a networked estimation situation, sensors are typically equipped with some memory and processing capabilities. We illustrate that utilization of these capabilities can lead to significant performance gains in the sensor selection problem for improved estimation performance. Further, it also leads to significant pruning of the search tree that yields the optimum sensor schedule. We also present a periodicity result for the case where the decision is whether the sensor should transmit or not.},
	address = {New Orleans, Louisiana},
	booktitle = {46th IEEE Conference on Decision and Control},
	pages = {pp. 494-499}
}
@conference {
	title = {Convergence Results for Ant Routing Algorithms via Stochastic Approximation and Optimization},
	author = {Purkayastha, Punyaslok., Baras, John S.},
	year = {2007},
	month = {12/2007},
	abstract = {"Ant algorithms" have been proposed to solve a variety of problems arising in optimization and distributed control. They form a subset of the larger class of {\textquotedblleft}Swarm Intelligence{\textquotedblright} algorithms. The central idea is that a {\textquoteleft}swarm{\textquoteright} of relatively simple agents can interact through simple mechanisms and collectively solve complex problems. Instances that exemplify the above idea abound in nature. The abilities of ant colonies to collectively accomplish complex tasks have served as sources of inspiration for the design of {\textquotedblleft}Ant algorithms{\textquotedblright}. Examples of {\textquotedblleft}Ant algorithms{\textquotedblright} are {\textquotedblleft}Ant Routing{\textquotedblright} algorithms that have been proposed for communication networks. We analyze in this paper an Ant-Based Routing Algorithm for packet-switched wireline networks. The algorithm is an attractive multiple path probabilistic routing scheme, that is fully adaptive and distributed. Using methods from adaptive algorithms and stochastic approximation, we show that the evolution of the link delay estimates can be closely tracked by a deterministic ODE system. A study of the equilibrium points of the ODE then gives us the equilibrium behavior of the routing algorithm, in particular, the equilibrium routing probabilities, and mean delays in the links under equilibrium. We also show that the fixed-point equations that the equilibrium probabilities satisfy are actually the necessary and sufficient conditions of an appropriate optimization problem. Simulations supporting the analytical results are provided.},
	address = {New Orleans, Louisiana},
	booktitle = {46th IEEE Conference on Decision and Control},
	pages = {pp. 340-345}
}
@conference {
	title = {Combined Single-Path Routing and Flow Control in Many-User Region: A Case for Nash Efficiency},
	author = {Chen, Huigang., Baras, John S.},
	year = {2007},
	month = {12/2007},
	abstract = {We consider the problem of combined single-path routing and flow control, which is nonconvex and NP-hard to solve exactly. We focus on the {\textquotedblleft}many-user{\textquotedblright} region, i.e. large networks that have far more number of users than that of bottleneck links, which is close to real network scenarios. We first show that by allowing a proportionally small number of users to use multipath routing~while keeping the remaining majority to use single-path routing, the resulting solution achieves multipath optimality. Therefore it is conceptually plausible that in the many-user region a local algorithm can achieve solutions arbitrarily close to the optimal solution. To show this is indeed correct, we focus on the solutions brought out by the simplest local algorithm, the Nash algorithm. We first examine a special type of network and show that the Nash equilibrium exists and the Nash algorithm always converges. It is then shown that the price of anarchy, that is the gap between the worst Nash equilibrium and the social optimal, is bounded when the number of users goes to infinity. For general networks, it is not known whether there exists a Nash equilibrium. However, we introduce the concept of approximate Nash equilibrium and we show its existence given a~sufficiently large number of users. Then we prove that the approximate Nash equilibrium will be arbitrary close to the social optimal when the number of users is sufficiently large.},
	address = {New Orleans, Louisiana},
	booktitle = {46th IEEE Conference on Decision and Control},
	pages = {pp. 26-31}
}
@conference {
	title = {Broadcast Scheduling for Time-Constrained Information Delivery},
	author = {Raissi-Dekhordi, Majid., Baras, John S.},
	year = {2007},
	month = {11/2007},
	abstract = {In this report, the problem of broadcast scheduling in Push broadcast systems is studied. We introduce an optimization approach that leads to well-justified policies for Push broadcast systems with time constraints. In particular, we apply our results to a Push broadcast system with different deadlines associated to the files while allowing the files to have arbitrary demand rates and lengths.We calculate the optimal average cost for our experimental settings and show, through extensive simulation studies, that the results obtained from our scheduling policy are very close to that optimal value for each experiment.},
	address = {Washington DC},
	booktitle = {IEEE 2007 Global Communications Conference (GLOBECOM) Enhibition \&amp; Industry Forum},
	pages = {pp. 5298-5303}
}
@conference {
	title = {Trust Document Distribution in Manets},
	author = {Jiang, Tao., Baras, John S.},
	year = {2007},
	month = {10/2007},
	abstract = {Mobile ad-hoc networks (MANETs) are used in battlefields where no network infrastructure exists. Users rely on their physical neighbors to communicate with other users that are not in proximity. Accurate trust establishment and maintenance is essential for secure and reliable message transmissions in MANETs. Because of the mobility and dynamics of MANETs, the validity and value of trust documents change~with time as well as with battlefield conditions and scenario stage. Thus trust management in MANETs is a much more dynamic problem than in conventional wireline networks, as well as wireless cellular networks. In traditional networks, centralized trusted servers provide necessary trust documents for trust establishment. However, such servers are not available in MANETs. Trust documents are distributed among users in the network. In this paper, we develop and analyze distributed schemes for efficiently and securely distributing trust documents, and updates, so that users are able to establish reliable trust relations with their neighbors. Key performance metrics are time response and availability of documents across the network. Our approach is inspired from network coding, where trust documents are combined during distribution.},
	address = {Orlando, FL},
	booktitle = {2007 Military Communication Conference},
	pages = {pp. 1-7}
}
@conference {
	title = {Intrusion Detection System Resiliency to Byzantine Attacks: The Case Study of Wormholes in OLSR},
	author = {Baras, John S., Radosavac, Svetlana., Theodorakopoulos, George., Sterne, Dan., Budulas, Peter., Gopaul, Richard.},
	year = {2007},
	month = {10/2007},
	abstract = {In this paper, we extend the work presented in [1] by quantifying the effects of in-band wormhole attacks on Intrusion Detection Systems. More specifically, we propose a mathematical framework for obtaining performance bounds of Byzantine attackers and the Intrusion Detection System (IDS) in terms of detection delay. We formulate the problem of distributed collaborative defense against coordinated attacks in MANET as a dynamic game problem. In our formulation, we have on the one hand a group of attackers that observe what is going on in the network and coordinate their attack in an adaptive manner. On the other side, we have a group of defending nodes (the IDS nodes) that collaboratively observe the network and coordinate their actions against the attackers. Using extensions of the game theoretic framework of [2] we provide a mathematical framework for efficient identification of the worst attacks and damages that the attackers can achieve, as well as the best response of the defenders. This approach leads to quantifying resiliency of the routing-attack IDS with respect to Byzantine attacks.},
	address = {Orlando, FL},
	booktitle = {2007 Military Communication Conference},
	pages = {pp. 1-7}
}
@conference {
	title = {Loss Model Approximations and Sensitivity Computations for Multi-Hop Wireless Network Design},
	author = {Baras, John S., Tabatabaee, Vahid., Papageorgiou, George., Rentz, Nicolas., Shang, Yadong.},
	year = {2007},
	month = {10/2007},
	abstract = {We develop and evaluate a new method for estimating various performance metrics of multi-hop wireless networks, including MANETs. The estimates depend implicitly on network design parameters, and therefore the method can form the basis for designing such networks so as to achieve predictable performance bounds. Explicit simulation models for large wireless networks are too complex and can not be used for analysis and design of wireless networks in realistic settings. We introduce a simple approximate (throughput) loss model that couples the physical, MAC and routing layers. The model provides quantitative statistical relations between the loss parameters used to characterize multiuser interference and physical path conditions on the one hand and traffic rates between origin-destination pairs on the other. We use a fixed point approach together with recently proposed models for the MAC layer to find a consistent solution satisfying all equations in the set. The result is an implicit model of performance metrics, such as throughput, packet loss, delay, parameterized by design variables, such as path routing probabilities, power levels, noise levels. We next apply Automatic Differentiation (AD) to these implicit performance models and develop a methodology for design and parameter selection/tuning of wireless protocols.},
	address = {Orlando, FL},
	booktitle = {2007 Military Communication Conference},
	pages = {pp. 1-7}
}
@conference {
	title = {Trust in Social, Communication and Other Networks},
	author = {Baras, John S.},
	year = {2007},
	month = {10/2007},
	address = {Stockholm, Sweden},
	booktitle = {ACCESS Lecture at the ACCESS Linnaeus Center},
	organization = {KTH, Royal Institute of Technology}
}
@conference {
	title = {Probabilistic Switching and Convergence Rate in Consensus Problems},
	author = {Hovareshti, Pedram., Baras, John S., Gupta, Vijay.},
	year = {2007},
	month = {09/2007},
	abstract = {We consider the convergence problem of consensus seeking agents and the effect of probabilistic switching on the convergence rate. Using a probabilistic setting, we develop a framework to study the convergence rate for different classes of graph topologies, including Small World networks. We show that by making the effective diameter of the underlying graph small, probabilistic switching can be helpful in the design of fast consensus algorithms.},
	address = {Chicago, Illinois},
	booktitle = {Allerton Conference on Communication, Control and Computing},
	pages = {pp. 423-430},
	organization = {Allerton House, UIUC}
}
@conference {
	title = {Improving Network Performance in Hybrid Wireless Networks Using a Satellite Overlay},
	author = {Roy-Chowdhury, Ayan., Baras, John S.},
	year = {2007},
	month = {09/2007},
	abstract = {Large wireless networks have the ability to provide rapid connectivity in disaster areas~or to interconnect users in far-flung geographical locations. However, limitations on performance and robustness have delayed the adoption of such networks. In this paper, we show that by the addition of a satellite overlay network, the performance and robustness of large-scale wireless networks can be greatly improved and thus make their deployment possible. We define a satellite overlay network as consisting of one or more satellite nodes and multiple terrestrial {\textquoteleft}{\textquoteleft}gateway{\textquoteright}{\textquoteright} nodes that have interfaces for both satellite links and terrestrial wireless communication. We divide the terrestrial network into multiple {\textquoteleft}{\textquoteleft}clusters{\textquoteright}{\textquoteright} of wireless nodes, with each cluster being served by one or more gateway nodes. Ordinary terrestrial user nodes reach the gateway node through multi-hop terrestrial paths. We thus propose a design for a hybrid satellite and terrestrial wireless network. Through network modeling and simulation, we show that significant improvement in end-to-end performance is possible in a wireless network when the satellite overlay is present, in comparison to the performance in flat wireless networks. Our results are for both stationary and mobile ground wireless nodes.},
	address = {Turin, Italy},
	booktitle = {13th KA and Broadband Communications Conference},
	pages = {pp. 111-118}
}
@conference {
	title = {Collaborative Control of Underwater Vehicles under Severely Limited Communication},
	author = {Baras, John S.},
	year = {2007},
	month = {09/2007},
	address = {Bol, Croatia},
	booktitle = {2007 IFAC Conference on Controls and Applications in Marine Systems (CAMS {\textquoteright}07)}
}
@conference {
	title = {On Optimal Watermarking Schemes in Uncertain Gaussian Channels},
	author = {Cardenas, Alvaro A., Moustakides, George V., Baras, John S.},
	year = {2007},
	month = {09/2007},
	abstract = {This paper describes the analytical derivation of a new watermarking algorithm satisfying optimality properties when the distortion of the watermarked signal is caused by a Gaussian process. We also extend previous work under the same assumptions and obtain more general solutions.},
	address = {San Antonio, Texas},
	booktitle = {IEEE International Conference on Signal Processing ICIP 2007},
	pages = {pp. 449-452}
}
@conference {
	title = {Comparison of Ray Tracing Simulations and Millimeter Wave Channel Sounding Measurements},
	author = {Neekzad, Behnam., Sayrafian, Kamran., Perez, Julio., Baras, John S.},
	year = {2007},
	month = {09/2007},
	abstract = {Temporal-Angular channel sounding measurements of an indoor millimeter wave channel (60 GHz) is analyzed to determine the location of two-dimensional clusters of arrivals at the receiver. The measurement scenarios are also emulated by a ray tracing tool. The results are similarly analyzed to verify possible agreements and determine the effectiveness of such tools in predicting cluster locations as well as ray arrival statistics within clusters in millimeter wave indoor channel.},
	address = {Athens, Greece},
	booktitle = {18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications},
	pages = {pp. 1-5}
}
@conference {
	title = {Constrained Coalitional Games and Component Based Networking},
	author = {Baras, John S.},
	year = {2007},
	month = {08/2007},
	address = {Adelphi, Maryland},
	booktitle = {ARL Fellows Symposium: Towards a Science of Networks}
}
@conference {
	title = {Trust and Reputation in Communication, Social and Other Networks},
	author = {Baras, John S.},
	year = {2007},
	month = {07/2007},
	address = {Athens, Greece},
	organization = {Department of Informatics, University of Athens}
}
@conference {
	title = {Security and Trust for Wireless Autonomic Networks: System and Control Methods},
	author = {Baras, John S.},
	year = {2007},
	month = {07/2007},
	address = {Kos Island, Greece},
	booktitle = {2007 European Control Conference (ECC07)}
}
@conference {
	title = {Effects of Graph Topology on Performance of Distributed Algorithms for Networked Control and Sensing},
	author = {Baras, John S., Hovareshti, Pedram.},
	year = {2007},
	month = {06/2007},
	abstract = {We consider distributed collaborative control andsensing as they frequently arise in networked control systems.The algorithms are constrained to use local information. Weshow by experiments that the performance of such distributed,local information based algorithms, can depend dramaticallyon the structure of the underlying topology (connectivitypattern) of the agents. We investigate the speed of convergence,accuracy, robustness and resiliency of such algorithms includingconsensus problems. We consider several graphs that can beused to represent collaborative control and communicationpatterns. We first show that small world topologies offer severaladvantages from a perspective of a favorable tradeoff betweenperformance of collaborative behaviors vs costs of collaborativebehaviors (or equivalently constraints for collaboration). Second,we show that a two level hierarchy consisting of carefullylocated and controlled leaders at the higher level and therest of the agents at the lower level, can provide a veryefficient communication pattern with substantial improvementof performance. We close with a description of the possibletopologies for this two tier structure and their performance.},
	address = {Kalamata, Greece},
	booktitle = {Proceedings of the 2007 Kalamata Workshop on Networked Distributed Systems for Intelligent Sensing and Control},
	pages = {pp. 1-8},
	organization = {Filoxenia}
}
@conference {
	title = {Level-triggered Control of a Scalar Linear System},
	author = {Rabi, Maben., Baras, John S.},
	year = {2007},
	month = {06/2007},
	abstract = {In networked control systems, because of limits on communication rates, control waveforms are frequently piece-wise constant with limits on rates at which they can switch levels. It is, therefore, natural to expect event triggered control switchings to perform more efficiently than time-triggered ones. This article verifies the validity of this supposition. A method for designing good level-triggered control schemes is obtained by reducing the continuous time problem to one in discrete time. Then, by numerical procedures, the performance of the level-triggered schemes is computed for comparison with that of the periodically switched control scheme.},
	address = {Athens, Greece},
	booktitle = {Proceedings of the 15th IEEE Mediterranean Conference on Control and Automation},
	pages = {pp. 1-6}
}
@conference {
	title = {MPC Based Motion Control of Car-like Vehicle Swarms},
	author = {Xi, Wei., Baras, John S.},
	year = {2007},
	month = {06/2007},
	abstract = {In this paper we study low level motion control of car-like vehicles for applications of UAV swarms. First, a Suboptimal Continuous-Curvature trajectory generation approach is studied to generate suboptimal reference trajectories(tracks) to connect desired way-point sequences. Two Model Predictive Control (MPC) based track following control approaches are then proposed to deal with the multiple constraints present in practice; for example, actuator saturation,local collision avoidance. Simulations further confirm the motion control design.},
	address = {Athens, Greece},
	booktitle = {Proceedings of 15th IEEE Mediterranean Conference on Control and Automation},
	pages = {pp. 1-6}
}
@conference {
	title = {Security and Trust Management in Wireless Autonomic Networks},
	author = {Baras, John S.},
	year = {2007},
	month = {06/2007},
	address = {Corfu, Greece},
	booktitle = {2007 Mediterranean Conference on Ad Hoc Networks (Med-Hoc-Net 2007)}
}
@conference {
	title = {A New Rate-based Active Queue Management: Adaptive Virtual Queue RED},
	author = {Byun, Do Jun., Baras, John S.},
	year = {2007},
	month = {05/2007},
	abstract = {In an effort to improve performance of congested gateways, a new Active Queue Management (AQM) algorithm, Adaptive Virtual Queue Random Early Detection (AVQRED), was developed by feeding virtual queue size to the RED algorithm. The objective of the new algorithm is to improve overall performance by keeping link utilization high, link utilization stable, queueing delay low and consecutive packet drop rate low. This paper shows the objective is met by comparing AVQRED with six other well known AQM methods in a realistic emulation environment. To provide fair comparisons, the AQM parameters are fine-tuned by exploring many different parameter settings via emulations. The emulation results conclude that AVQRED improves overall performance by 8 to 25\%. To provide intuitive properties and validate the emulation results, a mathematical model is proposed and fed to MATLAB, and the results from MATLAB and emulations are compared.},
	address = {New Brunswick, Canada},
	booktitle = {Proceedings of the 5th Annual Conference on Communication Networks and Services Research},
	pages = {pp. 389-396}
}
@conference {
	title = {Malicious Users in Unstructured Networks},
	author = {Theodorakopoulos, George., Baras, John S.},
	year = {2007},
	month = {05/2007},
	abstract = {Unstructured networks (like ad-hoc or peer-to-peer networks) are networks without centralized control of their operation. Users make local decisions regarding whether to follow the network protocol or not. While providing scalability benefits, this degrades the performance, which is compounded by the potential presence of Malicious Users. In general, these users are trying to disrupt the operation of the network, and prevent the legitimate users from achieving their objectives. More specifically, they could try to break the connectivity of the network, or waste the resources of the legitimate users. In this work we use game theory to examine the effect of Malicious Users. All users are modeled as payoff-maximizing strategic agents. A simple model, fictitious play, is used for the legitimate user behavior, but no limits are imposed on the Malicious Users strategies. We look for the worst case equilibrium: the one that gives Malicious Users the highest payoff. We identify the importance of the network topology.},
	address = {Anchorage, Alaska},
	booktitle = {Proceedings of the 26th Annual IEEE Conference on Computer Communications (Infocom)},
	pages = {pp. 884-891}
}
@conference {
	title = {Performance Comparison of Detection Schemes for MAC Layer Misbehavior},
	author = {Cardenas, Alvaro A., Radosavac, Svetlana., Baras, John S.},
	year = {2007},
	month = {05/2007},
	abstract = {This paper revisits the problem of detecting greedy behavior in the IEEE 802.11 MAC protocol by evaluating the performance of two previously proposed schemes: DOMINO and the Sequential Probability Ratio Test (SPRT). The evaluation is carried out in four steps. We first derive a new analytical formulation of the SPRT that takes into account the discrete nature of the problem. Then we develop a new tractable analytical model for DOMINO. As a third step, we evaluate the theoretical performance of SPRT and DOMINO with newly introduced metrics that take into account the repeated nature of the tests. This theoretical comparison provides two major insights into the problem: it confirms the optimality of SPRT and motivates us to define yet another test, a nonparametric CUSUM statistic that shares the same intuition as DOMINO but gives better performance.We finalize the paper with experimental results, confirming our theoretical analysis and validating the introduction of the new nonparametric CUSUM statistic.},
	address = {Anchorage, Alaska},
	booktitle = {Proceedings of the 26th Annual IEEE Conference on Computer Communications (Infocom)},
	pages = {pp. 1496-1504}
}
@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}
}
@conference {
	title = {Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models},
	author = {Cardenas, Alvaro A., Moustakides, George V., Baras, John S.},
	year = {2007},
	month = {03/2007},
	abstract = {This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm and the adversary we consider are both nonparametric in a continuous signal space, and thus they have no externally imposed limitations on their allowed strategies except for some distortion constraints. We show that in this framework no deterministic detection algorithm is optimal. We then find optimal randomized detection algorithms for different distortion levels and introduce a new performance tradeoff between completeness and accuracy when a detection algorithm does not have enough evidence to make an accurate decision.},
	address = {Baltimore, Maryland},
	booktitle = {41st Annual Conference on Information Sciences and Systems},
	pages = {pp. 911-916}
}
@conference {
	title = {Detecting IEEE 802.11 MAC Layer Misbehavior in Ad Hoc Networks},
	author = {Radosavac, Svetlana., Cardenas, Alvaro A., Baras, John S., Moustakides, George V.},
	year = {2007},
	month = {01/2007},
	abstract = {Selfish behavior at the Medium Access (MAC) Layer can have devastating side effects on the performance of wireless networks, with effects similar to those of Denial of Service (DoS) attacks. In this paper we consider the problem of detection and prevention of node misbehavior at the MAC layer, focusing on the back-off manipulation by selfish nodes. We first propose an algorithm that ensures honest behavior of non-colluding participants. Furthermore, we analyze the problem of colluding selfish nodes, casting the problem within a minimax robust detection framework and providing an optimal detection rule for the worst-case attack scenarios. Finally, we evaluate the performance of single and colluding attackers in terms of detection delay. Although our approach is general and can be used with any probabilistic distributed MAC protocol, we focus our analysis on the IEEE 802.11 MAC.},
	booktitle = {Robust Strategies Against Individual and Colluding Attacker\&quot; Journal of Computer Security: Special Issue on Security of Ad Hoc and Sensor Networks},
	pages = {pp. 103-128}
}
