Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens

CONE

05411 Abstracts Collection -- Anonymous Communication and its Applications

From 09.10.05 to 14.10.05, the Dagstuhl Seminar 05411 ``Anonymous Communication and its Applications\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Time-Varying Graphs and Dynamic Networks

The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems -- delay-tolerant networks, opportunistic-mobility networks, social networks -- obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the formal models proposed so far to express some specific concepts are components of a larger formal description of this universe. The main contribution of this paper is to integrate the vast collection of concepts, formalisms, and results found in the literature into a unified framework, which we call TVG (for time-varying graphs). Using this framework, it is possible to express directly in the same formalism not only the concepts common to all those different areas, but also those specific to each. Based on this definitional work, employing both existing results and original observations, we present a hierarchical classification of TVGs; each class corresponds to a significant property examined in the distributed computing literature. We then examine how TVGs can be used to study the evolution of network properties, and propose different techniques, depending on whether the indicators for these properties are a-temporal (as in the majority of existing studies) or temporal. Finally, we briefly discuss the introduction of randomness in TVGs.Comment: A short version appeared in ADHOC-NOW'11. This version is to be published in Internation Journal of Parallel, Emergent and Distributed System

A Privacy Preserving Framework for RFID Based Healthcare Systems

RFID (Radio Frequency IDentification) is anticipated to be a core technology that will be used in many practical applications of our life in near future. It has received considerable attention within the healthcare for almost a decade now. The technology’s promise to efficiently track hospital supplies, medical equipment, medications and patients is an attractive proposition to the healthcare industry. However, the prospect of wide spread use of RFID tags in the healthcare area has also triggered discussions regarding privacy, particularly because RFID data in transit may easily be intercepted and can be send to track its user (owner). In a nutshell, this technology has not really seen its true potential in healthcare industry since privacy concerns raised by the tag bearers are not properly addressed by existing identification techniques. There are two major types of privacy preservation techniques that are required in an RFID based healthcare system—(1) a privacy preserving authentication protocol is required while sensing RFID tags for different identification and monitoring purposes, and (2) a privacy preserving access control mechanism is required to restrict unauthorized access of private information while providing healthcare services using the tag ID. In this paper, we propose a framework (PriSens-HSAC) that makes an effort to address the above mentioned two privacy issues. To the best of our knowledge, it is the first framework to provide increased privacy in RFID based healthcare systems, using RFID authentication along with access control technique

The Bus Goes Wireless: Routing-Free Data Collection with QoS Guarantees in Sensor Networks

Abstract—We present the low-power wireless bus (LWB), a new communication paradigm for QoS-aware data collection in lowpower sensor networks. The LWB maps all communication onto network floods by using Glossy, an efficient flooding architecture for wireless sensor networks. Therefore, unlike current solutions, the LWB requires no information of the network topology, and inherently supports networks with mobile nodes and multiple data sinks. A LWB prototype implemented in Contiki guarantees bounded end-to-end communication delay and duplicate-free, inorder packet delivery—key QoS requirements in many control and mission-critical applications. Experiments on two testbeds demonstrate that the LWB prototype outperforms state-of-theart data collection and link layer protocols, in terms of reliability and energy efficiency. For instance, we measure an average radio duty cycle of 1.69 % and an overall data yield of 99.97 % in a typical data collection scenario with 85 sensor nodes on Twist. I

GeoNotes: A Location-based Information System for Public Spaces

The basic idea behind location-based information systems is to connect information pieces to positions in outdoor or indoor space. Through position technologies such as Global Positioning System (GPS), GSM positioning, Wireless LAN positioning o

Private and Flexible Urban Message Delivery

With the popularity of intelligent mobile devices, enormous amounts of urban information has been generated and demanded by the public. In response, ShanghaiGrid (SG) aims to provide abundant information services to the public. With a fixed schedule and urbanwide coverage, an appealing service in SG is to provide free message delivery service to the public using buses, which allows mobile device users to send messages to locations of interest via buses. The main challenge in realizing this service is to provide an efficient routing scheme with privacy preservation under a highly dynamic urban traffic condition. In this paper, we present the innovative scheme BusCast to tackle this problem. In BusCast, buses can pick up and forward personal messages to their destination locations in a store-carry-forward fashion. For each message, BusCast conservatively associates a routing graph rather than a fixed routing path with the message to adapt the dynamic of urban traffic. Meanwhile, the privacy information about the user and the message destination is concealed from both intermediate relay buses and outside adversaries. Both rigorous privacy analysis and extensive trace-driven simulations demonstrate the efficacy of the BusCast scheme