@conference {
	title = {Reachability Analysis for Linear Discrete Time Set{\textendash}Dynamics Driven by Random Convex Compact Sets},
	author = {Rakovic, Sasa V., Matei, Ion., Baras, John S.},
	year = {2012},
	month = {12/2012},
	abstract = {This paper studies linear set{\textendash}dynamics driven by random convex compact sets (RCCSs), and derives the set{\textendash}dynamics of the expectations of the associated reach sets as well as the dynamics of the corresponding covariance functions. It is established that the expectations of the reach sets evolve according to deterministic linear set{\textendash}dynamics while the associated dynamics of covariance functions evolves on the Banach space of continuous functions on the dual unit ball. The general framework is specialized to the case of Gaussian RCCSs, and it is shown that the Gaussian structure of random sets is preserved under linear set{\textendash}dynamics of random sets.},
	address = {Maui, Hawaii},
	booktitle = {51st IEEE Conference on Decision and Control},
	pages = {pp. 4751-4756}
}
@conference {
	title = {Social Networks over Wireless Networks},
	author = {Stai, Eleni., Baras, John S., Papavassiliou, Symeon.},
	year = {2012},
	month = {12/2012},
	abstract = {We consider the formation, operation and maintenance of dynamic social networks (among human users) supported by technological communication networks such as wireless networks, or hybrid wireline-wireless networks. The technological (physical) networks of interest display dynamic behavior in several dimensions, including variable connectivity, variable congestion, variable link characteristics. As broadband wireless devices and networks are becoming ubiquitous these human-machine systems, that combine the social aspects and behavioral activities of humans with the technological characteristics of the underlying physical networks, provide several important challenges in efforts to model them, evaluate their performance and dynamically control them so certain performance requirements are met. These include combinations of performance, trust, privacy, energy efficiency. In this paper we develop novel models for these complex human-machine systems that incorporate social network behavioral models and wireless network models that are inspired from statistical physics (hyperbolic graphs). We investigate the performance of wireless network protocols that support and respond to the constraints implied by the social network they support.},
	address = {Maui, Hawaii},
	booktitle = {51st IEEE Conference on Decision and Control},
	pages = {pp. 2696-2703}
}
@conference {
	title = {A Randomized Gossip Consensus Algorithm on Convex Metric Spaces},
	author = {Matei, Ion., Somarakis, Christoforos., Baras, John S.},
	year = {2012},
	month = {12/2012},
	abstract = {A consensus problem consists of a group of dynamic agents who seek to agree upon certain quantities of interest. This problem can be generalized in the context of convex metric spaces that extend the standard notion of convexity. In this paper we introduce and analyze a randomized gossip algorithm for solving the generalized consensus problem on convex metric spaces. We study the convergence properties of the algorithm using stochastic differential equations theory. We show that the dynamics of the distances between the states of the agents can be upper bounded by the dynamics of a stochastic differential equation driven by Poisson counters. In addition, we introduce instances of the generalized consensus algorithm for several examples of convex metric spaces.},
	address = {Maui, Hawaii},
	booktitle = {51st IEEE Conference on Decision and Control,},
	pages = {pp. 7425-7430}
}
@conference {
	title = {A Distributed Opportunistic Scheduling Protocol for Multi-Channel Wireless Ad-Hoc Networks},
	author = {Chen, Hua., Baras, John S.},
	year = {2012},
	month = {12/2012},
	abstract = {The topic of opportunistic scheduling for wireless ad-hoc networks has been studied for single-channel networks in several recent works. Since now many wireless systems provide multiple channels for data transmission, this problem is of practical interest for networks with multiple channels. In this paper, we study the problem of opportunistic scheduling for one type of ad-hoc networks where the wireless spectrum can be divided into multiple independent sub-channels for better efficiency. We start with a naive multi-channel protocol where the scheduling scheme is working independently from sub-channel to sub-channel.We show that the naive protocol can only marginally improve the system throughput. We then develop a protocol to jointly consider the opportunistic scheduling behavior across multiple sub-channels. We characterize the optimal stopping rule and present several bounds for the system throughput of the multi-channel protocol. We show that by joint optimization of the scheduling scheme across multiple sub-channels, the proposed protocol improves the system throughput considerably in contrast to that of single-channel systems.},
	address = {Anaheim, California},
	booktitle = {IEEE Globecom 2012},
	pages = {pp. 292-297}
}
@conference {
	title = {A Graph Theoretic Mathematical Model for Alzheimer{\textquoteright}s Disease},
	author = {Kyrtsos, C Rose., Baras, John S.},
	year = {2012},
	month = {11/2012},
	abstract = {Alzheimer{\textquoteright}s disease (AD) is currently the most common form of dementia affecting the elderly, and its occurrence rate is only expected to increase over the next several decades. Though there is a vast array of knowledge about individual molecules and genetics involved with the disease, there is no clear understanding of the mechanism of pathogenesis. To help better understand the disease process, a graph theoretic model was developed that studies both the concentration of molecules thought to be involved in pathogenesis (Aβ, interleukin1, tumor necrosis factor alpha, cholesterol, ATP levels), as well as the cell number in a small location in the brain. Particular emphasis was put on the role of the inflammatory process in AD progression. This represents one of the first models that uses graph theory combined with a systems biology approach to study AD.},
	address = {Larnaca, Cyprus},
	booktitle = {12th IEEE International Conference on BioInformatics and BioEngineering},
	pages = {pp. 472-477}
}
@conference {
	title = {Minimizing Aggregation Latency under the Physical Interference Model in Wireless Sensor Networks},
	author = {Wang, Baobing., Baras, John S.},
	year = {2012},
	month = {11/2012},
	abstract = {Wireless Sensor Networks (WSNs) have been widely~recognized as a promising technology that can enhance various~aspects of today{\textquoteright}s electric power systems, making them a vital~component of the smart grid. Efficient aggregation of data~collected by sensors is crucial for a successful WSN-based smart~grid application. Existing works on the Minimum Latency Aggregation~Scheduling (MLAS) problem in WSNs usually adopt the~protocol interference model, which is a tremendous simplification~of the physical reality faced in wireless networks. In contrast,~the more realistic physical interference model has been proved~to have the potential to increase the network capacity. In this~paper, we propose a distributed algorithm to minimize the data~aggregation latency under the physical interference model, which~jointly considers routing, power assignment and transmission~scheduling.~},
	address = {Tainan City , Taiwan},
	booktitle = {Third International Conference on Smart Grid Communications (IEEE SmartGridComm 2012)},
	pages = {pp. 19-24}
}
@conference {
	title = {A Formal Framework for Joint Privacy and Security Modeling and Analysis in Data and Communication Networks},
	author = {Baras, John S.},
	year = {2012},
	month = {11/2012},
	abstract = {We develop a formal framework to model and analyze combined security and privacy requirements in data and communication networks. The network is modeled by two interacting multigraphs: one representing the logical (social, organizational) relationships between nodes (users, servers), and a second one representing the physical interconnections between nodes. Nodes and links in both multigraphs are annotated by weights (numerical, logical, rules) that represent security and privacy requirements. Our recent theory of multiple semiring optimization and tradeoff analysis in networks forms the foundation. Automatic theorem proving and satisfiability methodologies are also employed. Extensions to dynamic networks, privacy and security, are described.},
	address = {Pacific Grove, CA},
	booktitle = {46th Asilomar Conference on Signals, Systems and Computers}
}
@conference {
	title = {Model-Based Systems Enginnering Approach to Energy Efficient Building Design},
	author = {Daily, David R.},
	year = {2012},
	month = {11/2012},
	abstract = {Project

During my senior year at the University of Maryland, I was challenged to develop and investigate a research question utilizing Systems Engineering methodologies and tools for my capstone project.~ My project uses Model-Based Systems Engineering to model and simulate a residential building{\textquoteright}s HVAC operational effect and perform trade-off analysis on the building parameters.~ I have since continued this research for my Masters of Science in Systems Engineering thesis.

Purpose

According to the U.S. Energy Information Administration{\textquoteright}s {\textquotedblleft}Annual Energy Outlook 2012{\textquotedblright}, the residential and commercial sectors use a combined 28 percent of total U.S. energy consumption.~ With energy efficiency technology improvements and policy change, the EIA estimates that building energy consumption could be reduced by 10\%-18.5\% within these sectors by 2035.~ Reducing building energy demand is a necessary step in curbing the GHG issue and creates new requirements to meet these goals.~ Model-Based System Engineering allows for easy requirements verification and validation while creating a truly optimized system.

Methodology

I used SysML to develop a model of the building, its components, and other inputs into the system (i.e. weather).~ I am able to create a robust model in the SysML program MagicDraw, including detailed parametric, activity, and sequence diagrams, along with significant requirements definitions.~ I made a basic thermodynamics simulation in MATLAB and linked the two programs.~ With this link established, I automated the parametric analysis of the building parameters.~ The resulting 846 iterations gave me performance data to perform trade-off analysis to optimize cost and energy efficiency.

Results

When the setpoint temperature of the building is outside the allowable range, the HVAC system uses energy to condition the space, while thermal losses and gains vary the indoor temperature.~ The efficiency metric is defined as the period length between the activations of the HVAC system.~ A longer period indicates a more energy efficient system. Through trade-off analysis, I conclude that the parameter of insulation R-Value had the greatest cost-to-efficiency benefit while window U-Value had the second most impact.},
	address = {Toms River, New Jersey},
	booktitle = {The 2012 Mid-Atlantic Section Conference of the American Society for Engineering Education}
}
@conference {
	title = {A Class of Backpressure Algorithms for Networks Embedded in Hyperbolic Space with Controllable Delay-Throughput Trade-off},
	author = {Stai, Eleni., Baras, John S., Papavassiliou, Symeon.},
	year = {2012},
	month = {10/2012},
	abstract = {Future communications consist of an increasing number of wireless parts, while simultaneously need to support the widespread multimedia applications imposed by social networks. These human-machine systems, driven by both real time social interactions and the challenges of the wireless networks~design, call for efficient and easy to implement, distributed cross-layer algorithms for their operation. Performance metrics such as throughput, delay, trust, energy consumption, need to be improved and optimized aiming at high quality communications. We investigate the coveted throughput-delay trade-off in static wireless multihop net- works based on a {\textquotedblleft}computer-aided{\textquotedblright} design of the backpressure scheduling/routing algorithm for networks embedded in hyperbolic space. Both routing and scheduling exploit the hyperbolic distances to orient the packets to the destination and prioritize the transmissions correspondingly. The proposed design provides us with the freedom of controlling its theoretical throughput optimality and of counterbalancing its practical performance through simulations, leading to significant improvements of the throughput-delay trade-off.},
	address = {Paphos, Cyprus Island},
	booktitle = {15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2012), pp. no. 15-22, Paphos, Cyprus Island},
	pages = {pp. 15-22}
}
@conference {
	title = {A Rigorous Framework for Model-based Systems Engineering and Applications},
	author = {Baras, John S.},
	year = {2012},
	month = {10/2012},
	address = {Laurel, MD},
	booktitle = {INCOSE Chesapeake Bay Chapter},
	organization = {Applied Physics Laboratory, Johns Hopkins University}
}
@conference {
	title = {Jubilee Panel 1: The Ecology of Communication,Control and Computing Research and Education},
	author = {Baras, John S.},
	year = {2012},
	month = {10/2012},
	booktitle = {50th Annual Allerton Conference on Communication, Control and Computing}
}
@conference {
	title = {Components, Compositionality and Architectures for Networked CPS},
	author = {Baras, John S.},
	year = {2012},
	month = {10/2012},
	address = {London, UK},
	booktitle = {London CPS Workshop}
}
@conference {
	title = {Performance Evaluation of Hybrid SAMA VSAT with FMCSA and Reservations},
	author = {Perumal, Senni., Baras, John S.},
	year = {2012},
	month = {09/2012},
	abstract = {In this paper, we describe our work on developing and evaluating detailed OPNET simulation models of an enhanced Very Small Aperture Terminal (VSAT) satellite Internet gateway and an enhanced satellite hub based on Cerona SkySPAN technology with capacity and latency optimizations in a hybrid random access and reservation based return channel so as to allow significantly higher number of users and a better user experience. The Cerona SkySPAN technology uses Digital Video Broadcast via Satellite 2nd standard (DVB-S2) in the forward channel and Spread Aloha Multiple Access (SAMA) protocol in the return channel. We augment the SAMA return channel protocol with a hybrid random access and reservation based Dynamic Channel Allocation (DCA) scheme. The overall goal of the DCA algorithm is to make the system behave like a random access system at low loads for small messages so as to provide low message delay and to behave like a MF-TDMA reservation based system at high loads as well as for real time traffic so as to provide high maximum throughput and a better user experience. The random access protocol used at low loads is SAMA enhanced with Fast Multi-channel Slotted Aloha (FMCSA) protocol. FMCSA combines Multi-Channel Slotted Aloha (MCSA) with packet level forward error correction for new messages and scheduled retransmissions for partially received messages. This protocol increases the maximum possible throughput of SAMA and reduces the delay of multi-slot short messages while providing more robust delay performance with respect to load fluctuations, thus resulting in a much better user experience at low loads. The system transitions into a reservation based system at higher loads and for real time traffic so to support higher maximum throughput and achieve good QoS for real time traffic. The satellite return channel is divided into multi-frequency periodic frames. Each frame has mini-slots used for sending reservation requests in contention mode and larger data-slots used for sending data in either contention mode (FMCSA) or reservation mode (where the HUB allocates data-slots based on requests). We show via OPNET simulations that the enhanced SAMA VSAT with the hybrid DCA algorithm improves the throughput, latency and robustness of the SkySPAN SAMA system. We also compare, via OPNET simulations, the enhanced system with a DVB-RCS system to show the improvements in user experience both in terms of delay and throughput.},
	address = {Ottawa, Canada},
	booktitle = {18th Ka and Broadband Communications, Navigation and Earth Observation Conference}
}
@conference {
	title = {A comparison between upper bounds on performance of two consensus-based distributed optimization algorithms},
	author = {Matei, Ion., Baras, John S.},
	year = {2012},
	month = {09/2012},
	abstract = {In this paper we address the problem of multi-agent optimization for convex functions expressible as sums of convex functions. Each agent has access to only one function in the sum and can use only local information to update its current estimate of the optimal solution. We consider two consensus-based iterative algorithms, based on a combination between a consensus step and a subgradient decent update. The main difference between the two algorithms is the order in which the consensus-step and the subgradient descent update are performed. We obtain upper bounds on performance metrics of the two algorithms. We show that updating first the current estimate in the direction of a subgradient and then executing the consensus step ensures a tighter upper bound compared with the case where the steps are executed in reversed order. In support of our analytical results, we give some numerical simulations of the algorithms as well.},
	address = {Santa Barbara, CA},
	booktitle = {3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems(NecSys 2012), pp. 168-173, Santa Barbara, California},
	pages = {pp. 168-173}
}
@conference {
	title = {Expander Families as Information Patterns for Distributed Control of Vehicle Platoons},
	author = {Menon, Anup., Baras, John S.},
	year = {2012},
	month = {09/2012},
	abstract = {A state space formulation of the distributed control of a 1-D vehicle platoon is considered. The objective is to understand the effects of the underlying information exchange pattern between the vehicles on the control performance of the platoon. The symmetric control case is considered where each vehicle gives equal weight to all the information available to it in determining its control law. It is shown that expander families of graphs when used as information patterns result in stability margins decaying to zero at rate at most O(1/N); an improvement over the previously known O(1/N^2) decay with nearest neighbor type information patterns.},
	address = {Santa Barbara, CA},
	booktitle = {3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems(NecSys 2012), pp. 288-293, Santa Barbara, California},
	pages = {pp. 288-293}
}
@conference {
	title = {Enhancing Privacy in LTE Paging System using Physical Layer Identification},
	author = {Ta, Tuan., Baras, John S.},
	year = {2012},
	month = {09/2012},
	abstract = {User location privacy is a growing concern in cellular networks.~It has been recently shown that the paging architecture in GSM~networks leaks user location information. In this paper, we first prove~theoretically that LTE networks also have the same vulnerability. We~then propose a solution making use of a novel signal processing technique,~physical layer identification. The idea is to embed users{\textquoteright} unique~tags onto the downlink paging signal waveforms so that the tags are ~stealthy and robust. We show that our scheme not only improves users{\textquoteright}~privacy, but also saves system bandwidth.},
	address = {Pisa, Italy},
	booktitle = {Proceedings of the Data Privacy Management 7th International Workshop co-located with ESORICS 2012},
	pages = {pp. no. 15-28}
}
@conference {
	title = {Inflammation and Cholesterol: Friend Or Foe in Alzheimer{\textquoteright}s Disease},
	author = {Kyrtsos, C Rose., Baras, John S.},
	year = {2012},
	month = {08/2012},
	abstract = {Alzheimer{\textquoteright}s disease (AD) is the most common form of dementia affecting the elderly, leading to debilitating memory loss and significant cognitive decline. The exact mechanism of pathogenesis is not well understood. Here, we present an organ level model that studies the role of cholesterol metabolism and inflammation in the early stages of AD, demonstrating the importance of brain cholesterol on the expression of beta amyloid. The model has been further validated with experimental data.},
	address = {San Diego, California},
	booktitle = {SIAM Conference on the Life Sciences 2012}
}
@conference {
	title = {Throughput-Delay Trade-off in Wireless Multi-hop Networks via Greedy Hyperbolic Embedding},
	author = {Stai, Eleni., Baras, John S., Papavassiliou, Symeon.},
	year = {2012},
	month = {07/2012},
	abstract = {Real time applications over wireless multihop networks, demand routing/scheduling algorithms that achieve desirable delay-throughput trade-offs, with high throughput and low end-to-end delay. The backpressure algorithm, has received much attention by the research community in the past few years, as it satisfies the throughput optimal requirement. The backpressure algorithm performs routing and scheduling based on congestion gradients, by allowing transmission to the links that maximize the differential backlog between neighboring nodes. However, by deploying routing without using any information about the position or distance to the destination, it explores all possible source-destination paths leading to undesirable high delays. In this paper, we propose a method of restricting the number of paths used by the backpressure algorithm, with the aid of the greedy embedding of a network in the hyperbolic space. We propose two algorithms, the {\textquotedblleft}Greedy{\textquotedblright} backpressure and the {\textquotedblleft}Greediest{\textquotedblright} backpressure for both static and dynamic networks, which consider the network embedded in the hyperbolic space and combine the greedy routing in hyperbolic coordinates with the backpressure scheduling. We prove analytically their throughput optimality and study through simulations the induced improvement in the delay-throughput trade-off compared with the backpressure algorithm.},
	address = {Melbourne, Australia},
	booktitle = {20th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2012)},
	pages = {pp. 1-8}
}
@conference {
	title = {The Consensus Problem Under Vanishing Communication Weights},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2012},
	month = {07/2012},
	abstract = {We revisit the classical multi-agent distributed consensus problem under the dropping of the assumption that the existence of a connection between agent implies weights uniformly bounded away from zero. We formulate and study the problem by establishing global convergence results in discrete time, under fixed, switching and random topologies. We study the application of the results to flocking networks.},
	address = {Melbourne, Australia},
	booktitle = {20th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2012)},
	pages = {pp. 1-8}
}
@conference {
	title = {Flow Control in Time-Varying, Random Supply Chain Networks},
	author = {Matei, Ion., Gueye, Assane., Baras, John S.},
	year = {2012},
	month = {07/2012},
	abstract = {Todays supply chains are more and more complex. They depend on a network of independent, yet interconnected moving parts. They rely on critical infrastructures and experience a lot of time variability and randomness.Designing strategies that deal with such constantly changing supply chains is necessary in this increasingly globalized economy where supply chain disruptions have impacts that propagate not only locally but also globally.In this paper we propose a randomized flow control algorithm for a time varying, random supply chain network. We formulate a constrained stochastic optimization problem that maximizes the profit function in terms of the long-run,time-average rates of the flows in the supply chain. We show that our algorithm, which is based on queueing theory and stochastic analysis concepts, can get arbitrarily close to the solution of the aforementioned optimization problem.},
	address = {Melbourne, Australia},
	booktitle = {20th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2012)},
	pages = {pp. 1-4}
}
@conference {
	title = {Trust-Based Multi-Agent Filtering for Increased Smart Grid Security},
	author = {Matei, Ion., Baras, John S., Srinivasan, Vijay.},
	year = {2012},
	month = {07/2012},
	abstract = {We address the problem of state estimation of the power system for the Smart Grid. We assume that the monitoring of the electrical grid is done by a network of agents with both computing and communication capabilities. We propose a security mechanism aimed at protecting the state estimation process against false data injections originating from faulty equipment or cyber-attacks. Our approach is based on a multi-agent filtering scheme, where in addition to taking measurements, the agents are also computing local estimates based on their own measurements and on the estimates of the neighboring agents. We combine the multi-agent filtering scheme with a trust-based mechanism under which each agent associates a trust metric to each of its neighbors. These trust metrics are taken into account in the filtering scheme so that information transmitted from agents with low trust is disregarded. In addition, a mechanism for the trust metric update is also introduced, which ensures that agents that diverge considerably from their expected behavior have their trust values lowered.},
	address = {Barcelona, Spain},
	booktitle = {Proceedings of the 2012 Mediterranean Control Conference},
	pages = {pp. 716-721}
}
@conference {
	title = {Composite Trust in Networked Multi-Agent Systems},
	author = {Baras, John S., Jiang, Tao.},
	year = {2012},
	month = {06/2012},
	abstract = {Trust plays a crucial role in the analysis, synthesis and operation of the integrated system consisting of social-cognitive, information and communication networks. Multi-agent systems and associated coalition operations, which involve two or more organizations, further augment the diversity and complexity of network interactions. Trust and its derivative notions affect dramatically the networked coalition operations. A substantial part of the research challenge has to do with the multitude of meanings, interpretations, symbolisms and mathematical models used to represent and analyze trust. In this paper, we introduce value directed graphs with weighted nodes as our model for composite trust. We extend the value directed graph with weighted nodes composite trust model to include not only numerical weights, but also constraints. We show that the semiring-based constraint satisfaction problem (SCSPs) framework can serve as the unified model to investigate trust relation establishment.},
	address = {Montreal, Canada},
	booktitle = {2012 American Control Conference (ACC 2012),},
	pages = {pp. 3547-3552}
}
@conference {
	title = {Increasing Message Relevance in Social Networks via Context-based Routing},
	author = {Pouli, Vasiliki., Baras, John S., Arvanitis, Anastasios.},
	year = {2012},
	month = {06/2012},
	abstract = {Several applications are built around sharing information by leveraging social network connections. For example, in social buying sites like Groupon, a deal is usually forwarded to interested recipients through their social graph. A primary goal is to improve user satisfaction by maximizing the relevance of the shared message to the target audience. In this work, we address this problem by proposing a context- based routing approach that exploits both user preferences and the network structure aiming at enhancing the relevance of forwarded messages and ensuring that each message will be delivered to the most interested users.},
	address = {Milwaukee USA},
	booktitle = {3rd International Workshop on Modeling Social Media: Collective Intelligence in Social Media (MSM 2012)},
	pages = {pp. 21-24}
}
@conference {
	title = {Integrated Modeling and Simulation Framework for Wireless Sensor Networks},
	author = {Wang, Baobing., Baras, John S.},
	year = {2012},
	month = {06/2012},
	abstract = {Existing ad hoc system design methods for Wireless Sensor Networks (WSNs) suffer from lack of reusability. In addition, the interactions between the continuous-time physical environments and WSNs have not been well studied. In this paper, we propose a model-based systems design (MBSD) framework for WSNs, which is a systematic methodology applying systems engineering principles to enhance model reusability and collaborations among multiple modeling domains. Firstly, we describe a hierarchy of model libraries to model various behaviors and structures of WSNs, including physical environments, physical platforms, communication and computation components, system services and applications. Based on the MBSD framework, we introduce a system design flow to compose both continuoustime and event-triggered modules to develop applications with support for performance study by simulations. Next, we briefly describe the main modules for physical platforms, the Media Access Control (MAC) layer, wireless channels and physical environments, which are developed using the Systems Modeling Language (SysML), Simulink and Modelica. Finally, we use a building thermal control system as the case study to demonstrate the composability, reusability and flexibility of the proposed MBSD framework.},
	address = {Toulouse, France},
	booktitle = {21st IEEE International Conference on Collaboration Technologies and Infrastructures (WETICE 2012- CoMetS track)},
	pages = {pp. 268-273}
}
@conference {
	title = {Wormhole Detection Using Channel Characteristics},
	author = {Jain, Shalabh., Ta, Tuan., Baras, John S.},
	year = {2012},
	month = {06/2012},
	abstract = {The potential applications and pervasive nature of mobile ad-hoc networks (MANETs) has made them an attractive target for attackers. The wireless medium of communication coupled with constrained resources enable attacks which can be executed by a weak adversary. A wormhole is one such attack which poses considerable threat, particularly to routing protocols. In this paper, we devise a novel scheme for detecting a wormhole by utilizing the inherent symmetry of electromagnetic wave propagation in the wireless medium. We demonstrate the loss of this symmetry in case of a wormhole attack and propose a method to detect and flag the adversary. We modify the insecure neighborhood discovery to incorporate authentication. We further extend this scheme to a trust system with low overhead.},
	address = {Ottawa, Canada},
	booktitle = {First IEEE International Workshop on Security and Forensics in Communication Systems (SFCS 2012)},
	pages = {pp. 6699-6704}
}
@conference {
	title = {Complex Network Problems via Greedy Hyperbolic Embedding},
	author = {Baras, John S.},
	year = {2012},
	month = {06/2012},
	address = {Gaithersburg, Maryland},
	booktitle = {2nd NIST-Bell Labs Workshop on Large Complex Networks},
	organization = {NIST}
}
@conference {
	title = {Cooperative Multi-agent Systems and {\textquotedblleft}Magical{\textquotedblright} Graphs},
	author = {Baras, John S.},
	year = {2012},
	month = {05/2012},
	address = {Gothenborg, Sweden},
	organization = {Signal and Systems Department, Chalmers University}
}
@conference {
	title = {Preventing Wormhole Attacks using Physical Layer Authentication},
	author = {Jain, Shalabh., Baras, John S.},
	year = {2012},
	month = {04/2012},
	abstract = {Mobile ad-hoc networks (MANETs) are a key enabler of pervasive computing. Constrained resources in mobile stations make it critical for nodes to be able to cooperate to enhance communication and computation capabilities. However, the wireless and dynamic nature of the links presents easy attack vectors for adversaries. The ability to securely discover and identify neighboring nodes (secure ND) is a fundamental building block for such networks. Even a relatively weak adversarial relay has the capability of distorting the network view and diverting significant amount of traffic. This can cause significant performance degradation. In this paper, we utilize the physical layer authentication scheme introduced by Yu, Baras and Sadler [1] to secure neighborhood discovery against adversarial relays. The proposed method incurs little performance overhead and requires no additional hardware. We provide analytical and simulation based performance evaluation of the security of our scheme.},
	address = {Paris, France},
	booktitle = {2012 IEEE Wireless Communications and Networking Conference (WCNC 2012)},
	pages = {pp. 2739-2744}
}
@conference {
	title = {Understanding Alzheimer{\textquoteright}s disease with Network Biology},
	author = {Kyrtsos, C Rose., Baras, John S.},
	year = {2012},
	month = {03/2012},
	abstract = {Alzheimer{\textquoteright}s disease (AD) is a complex disease showing dysregulation of several key pathways and an abnormal increase in levels of beta amyloid (Aβ) and hyperphosphorylated tau. Although AD is the most common type of memory loss among the elderly, its pathogenesis is not well understood. Mathematical modeling offers a unique opportunity to gain a better understanding of the AD disease process by combining the current knowledge within a quantitative framework. Using a network model for AD, we discuss how the transition from a normal, healthy brain to an AD brain network can be modeled using a Markov model.},
	address = {Philadelphia, PA},
	booktitle = {The 2012 Northeast Bioengineering Conference (NEBEC 2012)},
	pages = {pp. 67-68},
	organization = {Temple University}
}
@conference {
	title = {Deal Sites{\textquoteright} Characteristics},
	author = {Pouli, Vasiliki., Baras, John S.},
	year = {2012},
	month = {03/2012},
	abstract = {Deal sites like Groupon (www.groupon.com) , Travelzoo (www.travelzoo.com ), LivingSocial (www.livingsocial.com ) and others are social network sites that offer daily deals to users for discounted prices. The daily deals consist of trips, restaurants, gifts, theaters, and many others, in various countries across the world. Users by buying a deal create a link with the seller and follow him. Users can also refer friends and earn money. Groupon is the number one daily deal site and as of January 2011 it has more than 50 million subscribers, it has sold more than 22 million Groupon deals in North America and has saved in this way more than $980 millions only in North America. Our target is to examine deal sites with millions of users such as Groupon and compute various statistics. More specifically in this project we want to gather data from the Groupon deal site and compute statistical results like: what kind of deals are mostly sold out (e.g. trips, gifts, food?) and in which areas across USA and Canada. Also we want to find out the range of prices per category of deals that is more attractive to the users. One other thing of interest is the seasons (time periods) that most deals are sold out (for example Christmas, Valentines day etc). Last but not least, it is also worth seeing which companies offer more than one deals, which company had the most deals and in which category.The Groupon site gives you an API to request: deals for specific categories, information about the deals, how many deals were sold out, in which area, by which company etc. By the use of this API we can gather information on the deals and then via the use of Hadoop (http://hadoop.apache.org/ ) we can process all this information to compute the statistical results mentioned above and infer useful conclusions. The outcomes of this project can be useful for further improvements; development or extensions to these kinds of deal sites that can make both buyers and sellers even more satisfied and save people from lots of money.},
	address = {Redondo Beach, CA},
	booktitle = {The Social Network Big Data Hackathon at the INSNA Sunbelt Conference},
	pages = {pp. no. 2712-2717},
	organization = {Crowne Plaza Hotel}
}
@conference {
	title = {COMPASS: Component-based Architectures for Systems Synthesis},
	author = {Baras, John S.},
	year = {2012},
	month = {02/2012},
	address = {Link{\"o}ping, Sweden},
	booktitle = {MODPROD Conference},
	organization = {Link{\"o}ping University}
}
@conference {
	title = {Cooperative Swarms},
	author = {Baras, John S.},
	year = {2012},
	month = {01/2012},
	address = {Champaign, IL},
	booktitle = {7th Annual Coordinated Sciences Laboratory Student Conference},
	organization = {University of Illinois Urbana-Champaign}
}
