@conference {
	title = {A Stochastic Algorithm for Self-Organization of Autonomous Swarms},
	author = {Xi, Wei., Tan, Xiaobo., Baras, John S.},
	year = {2005},
	month = {12/2005},
	abstract = {In earlier work of the authors simulation results indicated the possibility of achieving self-organization of autonomous vehicles through Gibbs sampler-based simulated annealing. However, the dynamic graph structure associated with the network evolution presents challenges in convergence analysis. In this paper a novel algorithm is presented and shown to yield desired global configurations with primarily local interactions. Its convergence speed is provided in terms of the Gibbs potential function. The analytical results are further verified through simulation.},
	address = {Seville, Spain},
	booktitle = {44th IEEE Conference on Decision and Control and the European Control Conference (CDC-ECC {\textquoteright}05)},
	pages = {pp. 765-770}
}
@conference {
	title = {Maximum Entropy Models, Dynamic Games, and Robust Output Feedback Control for Automata},
	author = {Baras, John S., Rabi, Maben.},
	year = {2005},
	month = {12/2005},
	abstract = {In this paper, we develop a framework for designing controllers for automata which are robust with respect to uncertainties. A deterministic model for uncertainties is introduced, leading to a dynamic game formulation of the robust control problem. This problem is solved using an appropriate information state. We derive a Hidden Markov Model as the maximum entropy stochastic model for the automaton. A risk-sensitive stochastic control problem is formulated and solved for this Hidden Markov Model. The two problems are related using small noise limits.},
	address = {Seville, Spain},
	booktitle = {44th IEEE Conference on Decision and Control and the European Control Conference (CDC-ECC {\textquoteright}05)},
	pages = {pp.1043-1049}
}
@conference {
	title = {Iterative Dynamics on Graphs with Variable Topology},
	author = {Baras, John S.},
	year = {2005},
	month = {12/2005},
	address = {New Haven, CT},
	organization = {Yale University}
}
@conference {
	title = {A Multiple Subset Sum Formulation for Feedback Implosion Suppression over Satellite Networks},
	author = {Akkor, Gun., Baras, John S., Hadjitheodosiou, Michael.},
	year = {2005},
	month = {11/2005},
	abstract = {In this paper, we present a feedback implosion suppression (FIS) algorithm that reduces the volume of feedback information transmitted through the network without relying on any collaboration between users, or on any infrastructure other than the satellite network. Next generation satellite systems that utilize the Ka frequency band are likely to rely on various fade mitigation techniques, in order to guarantee a service quality that is comparable to other broadband technologies. User feedback would be a valuable input for a number of such components, however, collecting periodic feedback from a large number of users would result in the well-known feedback implosion problem. Feedback implosion is identified as a major problem when a large number of users try to transmit their feedback messages through the network, holding up a significant portion of the uplink resources and clogging the shared uplink medium. In this paper, we look at a system where uplink channel access is organized in time-slots. The goal of the FIS algorithm is to reduce the number of uplink time-slots hold up for the purpose of feedback transmission. Our analysis show that the FIS algorithm effectively suppresses the feedback messages of 95\% of all active users, but still achieves acceptable performance results when the ratio of available time-slots to number of users is equal to or higher than 5\%.},
	address = {St. Louis, MO},
	booktitle = {Globecom 2005 Wireless Communications},
	pages = {pp. 3226-3230}
}
@conference {
	title = {An Authentication Framework for Hybrid Satellite Network with Resource-Constrained Nodes},
	author = {Roy-Chowdhury, Ayan., Baras, John S., Hadjitheodosiou, Michael.},
	year = {2005},
	month = {11/2005},
	abstract = {The new phase of space exploration involves a growing number of human and robotic space missions to remote planets with varying communication and service requirements. Due to the critical nature of the missions, security is a very important requirement that needs to be addressed. Among primary security requirements are user authentication and message integrity that are needed to ensure that the data in the network is transmitted without unauthorized modifications between the source and destinations, and that data from only authorized network nodes are accepted by other nodes. In this paper we focus on the issue of user authentication and data integrity for a specific space network architecture supporting lunar exploration. We consider a hybrid network consisting of a terrestrial network on Earth, a network on the lunar surface, and a satellite constellation that connects the two surface networks. The lunar network comprises sensor nodes serviced by stationary gateways and mobile robotic vehicles with sensing capability, while the network on Earth is envisioned as a combination of private and public networ:ks. The problem of authentication in this network is co~plex due to the presence of nodes with varying capabilities in terms of computation strength, storage and energy. The nodes on .Earth and the gatewayso n the lunar surfacew ould have higher computationa nd energyc apabilitiesc omparedto the satellites and the sensor nodes. In this situation, an authentication protocol that is optimized to the strengths and limitations of the different classeso f nodesw ould be most suited. We focus on a solution that will operate under the constraints of the space environment (delay, limited energy, limited processing capability at remote nodes). We present a framework for user authentication and data integrity based on an authentication algorithm that makes use of symmetric certificates and hash chains of keys used to compute Message Authentication Codes,to provide asymmetric authentication capabilities to the network nodes. nodes with more resources. We give a detailed description of the authentication protocol we develop for this network and p~ovide an analysis of the security of the protocol by considering various types of passive and active attacks. We also highlight the savings incurred in terms of processing, storage and network bandwidth, which we get in using the proposed protocol in comparison to standard public-key authentication protocols.},
	address = {Wuhan, China},
	booktitle = {International Conference on Spatial Information Technology (ICSIT 2005)},
	pages = {pp. 1-12}
}
@conference {
	title = {Component Based System Synthesis},
	author = {Baras, John S.},
	year = {2005},
	month = {11/2005},
	address = {Washington DC},
	booktitle = {NSF ERC Annual Meeting, Panel on {\textquotedblleft}Strategies for Integration: Optimizing the Systems Focus in ERCs{\textquotedblright}}
}
@conference {
	title = {Collaborative Networked Control: Stochastic Algorithms},
	author = {Baras, John S.},
	year = {2005},
	month = {10/2005},
	address = {Philadelphia, Pennsylvania},
	organization = {GRASP Laboratory, University of Pennsylvania}
}
@conference {
	title = {Hybrid Networks with a Space Segment - Topology Design and Security Issues},
	author = {Roy-Chowdhury, Ayan., Baras, John S., Hadjitheodosiou, Michael., Rentz, Nicolas.},
	year = {2005},
	month = {10/2005},
	abstract = {In this paper we investigate a hybrid network topology that is suitable for supporting interplanetary communications. We define an architecture comprised of a network of sensor nodes on a remote planetary surface, connected to a hybrid terrestrial network of wired and wireless LANs through a series of satellite relays. All the nodes in the network are IP-addressable and support public and symmetric key cryptography. The resulting network forms a hierarchical hybrid mesh that connects users on Earth to networks on or around a remote planetary surface. We describe the design of the network and present preliminary simulation results illustrating the network performance for various parameters. We also discuss how algorithms for user authentication, message integrity and data confidentiality can be incorporated in the network infrastructure for secure end-to-end communication.},
	address = {Atlantic City, NJ},
	booktitle = {2005 Military Communications Conference (MILCOM 2005),},
	pages = {pp.1414 - 1420}
}
@conference {
	title = {Domain Based Heirarchical Routing for Large Heterogeneous Manets},
	author = {Chandrashekar, Karthikeyan., Morera, Raquel., McAuley, Anthony J., Baras, John S.},
	year = {2005},
	month = {10/2005},
	abstract = {This paper proposes a domain based hierarchical routing for large ad hoc networks. Our approach is based on auto-configured optimized routing domains and an enhanced inter-domain routing scheme. The large heterogeneous ad-hoc network is divided into more scalable homogeneous domains where each domain can run the routing protocol that best suits its link and traffic characteristics. We here propose an inter-domain routing protocol that exploits existing messages needed to maintain the domain structure. To support heterogeneity, the inter-domain routing scheme is independent of the routing protocols running in each domain. We compare three different approaches to the inter-domain routing: a) based solely on the propagation of domain messages, b) border node based, c) dynamic border node. In this paper, OPNET simulations compare the performance of the different inter-domain routing schemes and show the benefits of the proposed approach using OLSR and DSR as intra-domain routing protocols. Results show significant reduction in protocol overhead, increased route stability and increased route availability in a dynamic heterogeneous network. It is worth mentioning that the increased route stability is not only given by the isolation of more mobile nodes from the rest in a single domain, but also by limiting the cross-layer interactions (e.g. as the routing overhead increases, collisions at the MAC layer increase and therefore more routing packets get lost).},
	address = {Atlantic City, NJ},
	booktitle = {2005 IEEE Military Communications Conference (MILCOM)},
	pages = {pp. 1284-1290}
}
@conference {
	title = {Design Framework for Hierarchy Maintenance Algorithms in Mobile Ad Hoc Networks},
	author = {Manousakis, Kyriakos., Baras, John S., McAuley, Anthony J., Morera, Raquel.},
	year = {2005},
	month = {10/2005},
	abstract = {Domain autoconfiguration techniques allow the quick formation of highly optimized hierarchies that greatly enhance network scalability and overall performance. For example, instead of producing a simple two level hierarchy based only on topology, the optimization can produce multi-level hierarchies that take into account factors such as mission goals and predicted node/link heterogeneity. However, in dynamic networks, such as expected in the future military networks, these highly optimized solutions degrade very quickly. Indeed, if we use standard local maintenance algorithms that do not align well with the optimization goals, then the performance can reach the level of a suboptimal solution in less than two minutes. This paper proposes a taxonomy of local maintenance algorithms into four basic classes and quantifies the performance benefits of using representative approaches that act in accordance with the optimization goals.},
	address = {Atlantic City, NJ},
	booktitle = {2005 IEEE Military Communications Conference (MILCOM)},
	pages = {pp. 1-6}
}
@conference {
	title = {Swarm Collaborative Intelligence: From Networked Control to Trust in MANET},
	author = {Baras, John S.},
	year = {2005},
	month = {10/2005},
	address = {Chania, Crete},
	organization = {Technical University of Crete}
}
@conference {
	title = {Modeling and Design of a Communication Architecture Supporting Lunar Exploration},
	author = {Roy-Chowdhury, Ayan., Hadjitheodosiou, Michael., Baras, John S., Rentz, Nicolas.},
	year = {2005},
	month = {09/2005},
	abstract = {We discuss some basic requirements and trade-offs for designing a communication network supporting the needs of lunar exploration missions. We describe the unique characteristics of this network and outline a prototype network architecture. The proposed network consists of three distinct segments - a terrestrial network on Earth, a network on the lunar surface, and a space segment comprising a satellite constellation that connect the two surface networks.~We develop a simulation platform that includes the network topology, node orbits and mobility, and test the network performance with different applications and traffic loads. We present simulation results obtained with our models that illustrate the network connectivity and delay for varying satellite orbital patterns and traffic characteristics. We also discuss the requirements and constraints for providing a secure infrastructure for end-to-end communication in space exploration networks~and suggest algorithms and protocols for implementing end-to-end encryption, authentication and secure group communication.},
	address = {Rome, Italy},
	booktitle = {23rd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)},
	pages = {pp. 1-10}
}
@conference {
	title = {AeroTCP: A Splitting Transport Protocol for an IP-based Satellite Network Supporting Aeronautical Communications},
	author = {Shang, Yadong., Hadjitheodosiou, Michael., Baras, John S.},
	year = {2005},
	month = {09/2005},
	abstract = {The IP-based Broadband Aeronautical Satellite Network will provide numerous new applications and services for both airspace system operations and passenger communications. However, the performance of data communications protocols and applications over such systems is dramatically degraded, especially the Internet TCP/IP protocol suite. In this paper, we propose a new transport protocols for satellite network supporting Internet and data services. Based on the observation that it is difficult for an end to- end TCP solution to solve the performance problem effectively, we propose a new splitting based TCP protocol, called Aeronautical Transport Control Protocol (AeroTCP), which takes advantage of the specific properties of satellite channel. Our simulation results show that AeroTCP improves satellite channel utilization and fairness.},
	address = {Rome, Italy},
	booktitle = {23rd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)}
}
@conference {
	title = {Integrated Packet Level FEC Coding for Bulk Data Transfer Over Satellite Network},
	author = {Akkor, Gun., Baras, John S., Hadjitheodosiou, Michael.},
	year = {2005},
	month = {09/2005},
	abstract = {Packet level forward error correction (FEC) coding has been widely accepted as an efficient way of reducing the number of retransmissions and recovering from packet losses for reliable multicast in satellite networks. While there has been a significant effort in defining packet level FEC schemes that detail the structure, organization and delivery of the encoding packets, little attention has been given to how the physical channel, channel coding, and the downlink power budget affect the design space of these schemes in the context of a satellite network architecture. In this paper, we take a step in this direction, and define the points of interaction between various components and build a simulation environment. Using this simulation setup, we provide design suggestions for integrating FEC coding into reliable multicast transport protocols.},
	address = {Rome, Italy},
	booktitle = {23rd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)}
}
@conference {
	title = {Dynamic Resource Allocation for an IP-based Communications Network Supporting Space Exploration},
	author = {Zeng, Hui., Hadjitheodosiou, Michael., Baras, John S.},
	year = {2005},
	month = {09/2005},
	abstract = {We address issues related to efficiency, fairness, end-to-end delay minimization and Quality-of-Service (QoS) framework in order to enable a flexible access and dynamic mission operation capability in the next generation NASA space-to-ground IP-based communication infrastructure. In our scenario, the downlink channel of the NASA Tracking and Data Relay Satellite System is shared by a number of spacecraft, which we model as streams with different priority levels going through a common queue and a router. Both the current and future potential architectures for this relay system are addressed. We formulate an optimization problem for long-term static bandwidth allocation and present its solution to serve as initial bandwidth allocation algorithm and periodical regulation approach. Along with it, a hybrid Time Division Multiple Access (TDMA)-based protocol is proposed and then an assignment problem for the short-term dynamic optimal timeslot scheduling is studied. By using simulation, the performance of a suitable Medium Access Control (MAC) protocol with timeslot scheduling is analyzed and compared with that of the existing static fixed-assignment scheme.},
	address = {Rome, Italy},
	booktitle = {23rd AIAA International Communications Satellite Systems Conference and Exhibit (ICSSC)},
	pages = {pp. 1-12}
}
@conference {
	title = {bufSTAT - A Tool for Early Detection and Classification of Buffer Overflow Attacks},
	author = {Radosavac, Svetlana., Seamon, Karl., Baras, John S.},
	year = {2005},
	month = {09/2005},
	abstract = {Buffer overflows constitute by far the most frequently encountered class of attacks against computer systems. In this paper we introduce a tool, termed bufSTAT that achieves a low probability of false alarm and issues early attack warnings. BufSTAT relies on Finite State Machines (FSM) for attack modeling and can detect every stage of an ongoing attack and can thus prevent its execution by issuing early warning in a progressive manner. It can also detect sophisticated multi-stage attacks that are executed over long periods of time. A significant attribute of our approach is that it is amenable to detecting unknown attacks as well after appropriate modification of bufSTAT.},
	address = {Athens, Greece},
	booktitle = {First International Conference on Security and Privacy for Emerging Areas in Communication Networks}
}
@conference {
	title = {A Framework for MAC Protocol Misbehavior Detection in Wireless Networks},
	author = {Radosavac, Svetlana., Baras, John S., Koutsopoulos, Iordanis. },
	year = {2005},
	month = {09/2005},
	abstract = {The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main reasons for the growing interest in the issue of compliance to protocol rules. Reliable and timely detection of deviation from legitimate protocol operation is recognized as a prerequisite for ensuring efficient and fair use of network resources and minimizing performance losses. Nevertheless, the random nature of protocol operation together with the inherent difficulty of monitoring in the open and highly volatile wireless medium poses significant challenges. In this paper, we consider the fundamental problem of detection of node misbehavior at the MAC layer. Starting from a model where the behavior of a node is observable, we cast the problem within a minimax robust detection framework, with the objective to provide a detection rule of optimum performance for the worst-case attack. The performance is measured in terms of required number of observations in order to derive a decision. This framework is meaningful for studying misbehavior because it captures the presence of uncertainty of attacks and concentrates on the attacks that are most significant in terms of incurred performance losses. It also refers to the case of an intelligent attacker that can adapt its policy to avoid being detected. Although the basic model does not include interference, we show that our ideas can be extended to the case where observations are hindered by interference due to concurrent transmissions. We also present some hints for the problem of notifying the rest of the network about a misbehavior event. Our work provides interesting insights and performance bounds and serves as a prelude to a future study that would capture more composite instances of the problem.},
	address = {Cologne, Germany},
	booktitle = {4th ACM Workshop on Wireless Security,},
	pages = {pp. 33-42}
}
@conference {
	title = {Swarm Collaborative Intelligence: From Networked Control to Trust in MANET},
	author = {Baras, John S.},
	year = {2005},
	month = {08/2005},
	address = {Napa Valley, CA},
	booktitle = {Workshop on Swarming in Natural and Engineered Systems}
}
@conference {
	title = {Solving Optimal Neural Layout by Gibbs Sampling},
	author = {Jiang, Tao., Xu, Peng., Abshire, Pamela A., Baras, John S.},
	year = {2005},
	month = {07/2005},
	abstract = {Neural systems of organisms derive their functionality largely from the numerous and intricate connections between individual components. These connections are costly and have been refined via evolutionary pressure that acts to maximize their functionality while minimizing the associated cost. This tradeoff can be formulated as a constrained optimization problem. In this paper, we use simulated annealing, implemented through Gibbs sampling, to investigate the minimal cost placement of individual components in neural systems. We show that given the constraints and the presumed cost function associated with the neural interconnections, we can find the configuration corresponding to the minimal cost. We restrict the mechanisms considered to those involving incremental improvement through local interactions since real neural systems are likely to be subject to such constraints. By adjusting the cost function and comparing with the actual configuration in neural systems, we can infer the actual cost function associated with the connections used by nature. This provides a powerful tool to biologists for investigating the configurations of neural systems.},
	address = {Salt Lake City, Utah},
	booktitle = {8th Joint Conference on Information Sciences 2005 (JCIS 2005 in conjunction with the 7th International Conference on Computational Intelligence and Natural Computation 2005, CINC)},
	pages = {pp. 424-427}
}
@conference {
	title = {Wireless Sensor Networks and Applications},
	author = {Baras, John S.},
	year = {2005},
	month = {07/2005},
	address = {Athens, Greece},
	organization = {Athens Agricultural University}
}
@conference {
	title = {Distributed Stochastic Coordination Algorithms for Autonomous Vehicle Control},
	author = {Baras, John S.},
	year = {2005},
	month = {07/2005},
	address = {New Orleans},
	booktitle = {Cooperative Control Mini-Symposium, 2005 SIAM Conference on Control Theory and Applications}
}
@conference {
	title = {Gibbs Sampler-Based Path Planning for Autonomous Vehicles: Convergence analysis},
	author = {Xi, Wei., Tan, Xiaobo., Baras, John S.},
	year = {2005},
	month = {07/2005},
	abstract = {Simulation has indicated that distributed self-organization of autonomous swarms might be achieved through Gibbs sampler-based simulated annealing. However, the dynamic nature of the underlying graph presents significant challenges in convergence analysis. As a first step toward such analysis, convergence of the algorithm is established in this paper for two special cases: single vehicle with limited sensing/moving range, and multiple vehicles with full sensing/moving range. The impact of Gibbs potential functions on the convergence speed is also investigated, which provides insight into the design of these functions.},
	address = {Prague, Czech Republic},
	booktitle = {IFAC 2005}
}
@conference {
	title = {Teaching System-Level Thinking at the Undergraduate Level: A Proposal for Fundamental Changes in Systems, Control, Communication and Computing Instruction},
	author = {Baras, John S.},
	year = {2005},
	month = {06/2005},
	address = {Limassol, Cyprus},
	booktitle = {Joint ISIC{\textquoteright}05 and MED{\textquoteright}05 Conferences}
}
@conference {
	title = {Analysis of Delay Properties and Admission Control in 802.11 Networks},
	author = {Raissi-Dekhordi, Majid., Chandrashekar, Karthikeyan., Baras, John S.},
	year = {2005},
	month = {06/2005},
	abstract = {The ubiquitous use of 802.11 wireless networks highlights the importance of understanding the performance of the 802.11 protocol, specifically its delay properties which is the key to sustaining delay sensitive applications over such networks. In this paper, analytical expressions are derived for the channel access delay distribution of 802.11 networks. An implicit admission control scheme is proposed that uses the channel service time distribution as input to determine the maximum number of users that can be admitted. The analytical expressions for the delay are shown to closely match simulation results. We analyze the performance of the admission control scheme and calculate the saturation throughput for the admitted user. Simulation results validate the effectiveness of the admission control scheme and the analytical results.},
	address = {Maui, Hawaii},
	booktitle = {2005 International Conference on Wireless Networks, Communications and Mobile Computing},
	pages = {pp. 674-679}
}
@conference {
	title = {Mobility Based Distributed Domain Generation Algorithm for MANETs},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2005},
	month = {06/2005},
	abstract = {Ad hoc networks are very important for scenarios where there is not fixed network infrastructure. These scenarios may appear both in the military and the commercial world. Even though there is much advancement in the area of these networks, they do not scale well. This is due to the inability of the existing protocols (e.g., MAC, routing, security) to tolerate the dynamics of these networks when their size becomes large. A remedy is to apply these protocols in a hierarchical manner. The hierarchy generation in these dynamic environments can be advantageous since the network appears to be smaller due to the aggregation and abstraction resulted from the grouping of nodes. The numerous topological changes can be tolerated easier and the applied protocols can perform better. 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 conditions). On the other hand, hierarchy has to be generated carefully in order to be beneficial for the network otherwise, it may harm it, due to the imposed maintenance overhead. Towards this objective we have to take into consideration the network environment and design appropriately the hierarchy generation algorithms. In this paper, we present a mobility based domain generation algorithm (DGA), which in a distributed manner attempts to exploit similarities in the mobility patterns of the participating nodes by utilizing a set of mobility metrics. By grouping together nodes with similar mobility characteristics, the mobility based DGA targets the generation of robust to mobility hierarchical structures. The algorithm presents better scalability and robustness characteristics from well known existing distributed domain generation algorithms.},
	address = {Maui, Hawaii},
	booktitle = {2005 International Conference on Wireless Networks, Communications and Mobile Computing},
	pages = {pp. 820-825}
}
@conference {
	title = {A Hybrid Scheme for Distributed Control of Autonomous Swarms},
	author = {Xi, Wei., Tan, Xiaobo., Baras, John S.},
	year = {2005},
	month = {06/2005},
	abstract = {In this paper, a hybrid scheme for distributed control of autonomous vehicles is presented by combining the deterministic gradient-flow method and the stochastic method based on the Gibbs sampler. The scheme has the advantages of both methods and can potentially provide fast, distributed maneuvers while avoiding getting trapped at local minima of the potential function. Preliminary analysis is performed for the optimal design of the parameters controlling the switching between the two methods. The performance of the hybrid scheme is further enhanced by the introduction of vehicle memory. Simulation results are provided to confirm the analysis and show the effectiveness of the proposed algorithm.},
	address = {Portland USA},
	booktitle = {American Control Conference},
	pages = {pp. 3486-3491}
}
@conference {
	title = {Cooperation, Trust and Games in Wireless Networks},
	author = {Baras, John S., Jiang, Tao.},
	year = {2005},
	month = {06/2005},
	abstract = {As an important concept in network security, trust is interpreted as a set of relations among agents participating in the network activities. Trust relations are based on the previous behavior of an agent within a protocol. Trust establishment in distributed and resource-constraint networks, such as mobile ad hoc networks (MANETs), sensor networks and ubiquitous computing systems, is much more difficult but more crucial than in traditional hierarchical architectures, such as the Internet and base station- or access point-centered wireless LANs. Generally, this type of distributed networks have neither pre-established infrastructures, nor centralized control servers or trusted third parties (TTP). The trust information or evidence used to evaluate trustworthiness is provided by peers, i.e. the agents that form the network. Furthermore, resources (power, bandwidth, computation etc.) are normally limited because of the wireless and ad hoc environment, so the trust evaluation procedure should only rely on local information. Schemes that depend only on local interaction also have the desired emergent property that enables fast reaction to network member changes, topology changes and security changes that frequently happen in mobile networks. Therefore, the essential and unique properties of trust management in this new paradigm of wireless networking, as opposed to traditional centralized approaches are: uncertainty and incompleteness of trust evidence, trust value is between -1 and 1; locality in trust information exchange; distributed computation.},
	address = {Berkeley, CA},
	booktitle = {.Symposium on Systems, Control and Networks}
}
@conference {
	title = {Hybrid Wireless Networks Design, Performance Evaluation and Management},
	author = {Baras, John S.},
	year = {2005},
	month = {06/2005},
	address = {Los Angeles, CA},
	organization = {The Boeing Company}
}
@conference {
	title = {A Systems Engineering Perspective to Cross-Layer Design and Optimization with Applications to Wireless Information Assurance},
	author = {Baras, John S.},
	year = {2005},
	month = {05/2005},
	address = {Rome, NY},
	organization = {Air Force Rome Laboratory}
}
@article {
	title = {Control of Hysteresis in Smart Actuators with Application to Micro-Positioning},
	author = {Tan, Xiaobo., Baras, John S., Krishnaprasad, P S.},
	year = {2005},
	month = {05/2005},
	abstract = {Hysteresis in smart material actuators makes the effective use of these actuators quite challenging. The Preisach operator has been widely used to model smart material hysteresis. Motivated by positioning applications of smart actuators, this paper addresses the value inversion problem for a class of discretized Preisach operators, i.e., to find an optimal input trajectory given a desired output value. This problem is solved through optimal state transition of a finite state machine (FSM) that corresponds to the discretized Preisach operator. A state-space reduction scheme for the FSM is developed, which significantly saves the memory and the computation time. Experimental results on micro-positioning control of a magnetostrictive actuator are presented to demonstrate the effectiveness of the proposed approach.},
	pages = {pp. 483-492},
	volume = {Volume 54},
	number = {Issue 5},
	journal = {Systems \&amp; Control Letters}
}
@conference {
	title = {Trust in Self-organized Mobile Ad Hoc Networks},
	author = {Baras, John S.},
	year = {2005},
	month = {03/2005},
	address = {Volos, Greece},
	booktitle = {Invited Seminar, University of Thessaly}
}
@conference {
	title = {Autonomous Trust Establishment},
	author = {Jiang, Tao., Baras, John S.},
	year = {2005},
	month = {03/2005},
	abstract = {Trust establishment in networks is the essential foundation for follow-on security mechanisms, such as key management and secure transmission. In this paper, we concentrate on self-organized, distributed and resource-constraint networks which pose formidable challenges on trust establishment due to lack of infrastructure and centralized servers. We model our trust establishment strategy as a local voting scheme and discuss its long run behavior. More specifically, we investigate the dynamic evolution of trust within the network, i.e. how trust spreads among nodes, via analyzing its convergence behavior. By theoretical analysis based on graph theory, we also find the conditions under which trust spreads to a maximum set of nodes and parameters that speed up or slow down this transition.},
	address = {Lisbon, Portugal},
	booktitle = {2nd International Network Optimization Conference},
	pages = {pp. 1-8}
}
@conference {
	title = {A Multichannel Random Access Protocol for Multislot Short Messages with Delay Constraints},
	author = {Zhou, Xiaoming., Baras, John S.},
	year = {2005},
	month = {03/2005},
	abstract = {A multichannel random access protocol called FMCSA for multislot short messages is proposed in this paper to be used in access networks with large propagation delay. This protocol combines random access with the use of packet level forward error correction coding for new messages and scheduled retransmissions for partially received messages. Analytical and simulation results show that FMCSA can achieve a higher throughput and lower delay than slotted Aloha. When the system is operating in the low load region, the short messages can be delivered in their first attempts with very high probability. With the load increasing, more messages will be received partially in their first attempts and the scheduled retransmission scheme will guarantee the partially received messages to be recovered in their second attempts. Therefore the delay performance of FMCSA is much more robust to the load fluctuation than slot Aloha.},
	address = {Miami, Florida},
	booktitle = {INFOCOM 2005}
}
@conference {
	title = {Complex Engineering Systems},
	author = {Baras, John S.},
	year = {2005},
	month = {03/2005},
	address = {Arlington, VA},
	booktitle = {NSF Workshop {\textquotedblleft}From Macro to Nano: Challenges and Opportunities in Integrative Complex Systems Engineering{\textquotedblright}}
}
@conference {
	title = {Managing Trust in Self-organized Mobile Ad Hoc Networks},
	author = {Baras, John S.},
	year = {2005},
	month = {02/2005},
	address = {Athens, Greece},
	booktitle = {Invited Seminar, National Technical University of Athens},
	organization = {University of Athens}
}
@conference {
	title = {Managing Trust in Self-organized Mobile Ad Hoc Networks},
	author = {Baras, John S.},
	year = {2005},
	month = {02/2005},
	address = {San Diego, CA},
	booktitle = {Wireless and Mobile Security Workshop, part of NDSS 2005}
}
