This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-19 Creation time: 06-43-30 --- Number of references 26 inproceedings Dombrowski2010GC 2010 12 6 1--6 IEEE Proc. of IEEE Global Telecommunications Conference (GLOBECOM'10) Miami, FL, USA IEEE Global Telecommunications Conference (GLOBECOM'10) 06/12/2010 ChristianDombrowski DanielWillkomm AdamWolisz inproceedings 2010-sensys-alizai-tinywifi 2010 11 429-430 We present TinyWifi, a nesC code base extending TinyOS to support Linux powered network nodes. It enables developers to build arbitrary TinyOS applications and protocols and execute them directly on Linux by compiling for the new TinyWifi platform. Using TinyWifi as a TinyOS platform, we expand the applicability and means of evaluation of wireless protocols originally designed for sensornets towards inherently similar Linux driven ad hoc and mesh networks. Received Best Poster Award fileadmin/papers/2010/2010-11-alizai-tinywifi-sensys.pdf http://portal.acm.org/citation.cfm?id=1870058&preflayout=flat Print ACM

New York, NY, USA

Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland en 978-1-4503-0344-6 10.1145/1869983.1870058 1 Muhammad HamadAlizai BernhardKirchen Jó AgilaBitsch Link HannoWirtz KlausWehrle inproceedings 2010-sensys-sasnauskas-coojakleenet 2010 11 383--384 High-coverage testing of sensornet applications is vital for pre-deployment bug cleansing, but has previously been difficult due to the limited set of available tools. We integrate the KleeNet symbolic execution engine with the COOJA network simulator to allow for straight-forward and intuitive high-coverage testing initiated from a simulation environment. A tight coupling of simulation and testing helps detect, narrow down, and fix complex interaction bugs in an early development phase. We demonstrate the seamless transition between COOJA simulation and KleeNet symbolic execution. Our framework enables future research in how high-coverage testing tools could be used in cooperation with simulation tools. kleenet fileadmin/papers/2010/2010-osterlind_sasnauskas-sensys-coojakleenet.pdf Print ACM

New York, NY, USA

Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland en 978-1-4503-0344-6 http://doi.acm.org/10.1145/1869983.1870034 1 FredrikÖsterlind RaimondasSasnauskas AdamDunkels OscarSoria Dustmann KlausWehrle proceedings 2010-wirtz-kuvs-service-overlay 2010 10 Service discovery in traditional networks is realized either by broadcasting requests in the network or by a central entity that holds the necessary information of every service in the network. These techniques are applicable in wireless networks as well, however, only under certain limiting conditions. The authors present a generic overlay that caters to the special requirements of providing and discovering services in wireless mesh networks. The focus of the approach lies on maintaining scalability in large-scale dynamic networks as well as routing efficiency with regard to the communication characteristics of the underlying network. RWTH Aachen University - ComSys /fileadmin/papers/2010/2010-wirtz-kuvs-service-overlay.pdf Gesellschaft für Informatik KuVS

Berlin, Germany

3rd GI/ITG KuVS Fachgespräch on NG SDPs, Berlin, Germany Berlin, Germany 3rd GI/ITG KuVS Fachgespräch on NG SDPs October 14, 2010 english HannoWirtz TobiasHeer KlausWehrle inproceedings 2010softcomweingaertnerprotocolanalysis 2010 9 23 225 - 229 available in IEEE Xplore https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-weingaertner-softcom-analysis.pdf Online FESB

Split, Croatia

Proceedings of the 18th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2010) Hvar, Croatia en 978-1-4244-8663-2 1 EliasWeingaertner MarkoRitter RaimondasSasnauskas KlausWehrle inproceedings 2010-kunz-mascots-horizon 2010 8 18 172-181 The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks. horizon fileadmin/papers/2010/2010-kunz-mascots-horizon.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10), Miami, FL, USA Miami, FL, USA 18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10) August 17-19, 2010 en 978-0-7695-4197-6 1526-7539 10.1109/MASCOTS.2010.26 1 GeorgKunz OlafLandsiedel JamesGross StefanGötz FarshadNaghibi KlausWehrle inproceedings 2010-heer-pisa-sa 2010 8 2 1 588-593 With the goal of providing ubiquitous wireless services (e.g., tourist guides, environmental information, pedestrian navigation), municipal wireless networks are currently being established all around the world. For municipalities, it is often challenging to achieve the bandwidth and coverage that is necessary for many of the envisioned network services. At the same time, Wi-Fi-sharing communities achieve high bandwidth and good coverage at a very low cost by capitalizing on the dense deployment of private access points in urban areas. However, from a technical, conceptual, and security perspective, Wi-Fi sharing community networks resemble a patchwork of heterogeneous networks instead of one well-planned city-wide network. This patchwork character stands in stark contrast to a uniform, secure platform for public and commercial services desirable for the economic success of such a network. Hence, despite its cost-efficiency, the community-based approach cannot be adopted by municipalities easily. In this paper, we show how to realize municipal wireless services on top of a Wi-Fi-sharing infrastructure in a technically sound and economically attractive fashion. In particular, we focus on how to securely provide services to mobile clients with and without client-side software support. Our solution cleanly separates the roles of controlling and administering the network from providing bandwidth and wireless access. With this separation, commercial ISPs and citizens with their private Wi-Fi can contribute to the network infrastructure. This allows municipalities in turn to focus their resources on municipal wireless services. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-heer-icc-pisa-sa.pdf Print IEEE Press

Washington, DC, USA

International Conference on Computer Communication Networks, ICCCN 2010, Zurich Zurich, Switzerland International Conference on Computer Communication Networks, ICCCN 2010 en 978-1-4244-7114-0 10.1109/ICCCN.2010.5560103 1 TobiasHeer ThomasJansen RenéHummen HannoWirtz StefanGötz EliasWeingaertner KlausWehrle inbook 2010-simtools-sasnauskas-transport 2010 6 389-399 Print Klaus Wehrle, Mesut Guenes, James Gross Springer

Germany

17 Modeling and Tools for Network Simulation en 978-3-642-12330-6 1 RaimondasSasnauskas EliasWeingaertner inproceedings icc2010vpsim 2010 5 23 1-6 Nowadays, the development of embedded system hardware and related system software is mostly carried out using virtual platform environments. The high level of modeling detail (hardware elements are partially modeled in a cycle-accurate fashion) is required for many core design tasks. At the same time, the high computational complexity of virtual platforms caused by the detailed level of simulation hinders their application for modeling large networks of embedded systems. In this paper, we propose the integration of virtual platforms with network simulations, combining the accuracy of virtual platforms with the versatility and scalability of network simulation tools. Forming such a hybrid toolchain facilitates the detailed analysis of embedded network systems and related important design aspects, such as resource effectiveness, prior to their actual deployment. https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-schuermans-weingaertner-network_centric.pdf Online IEEE Proceedings of the IEEE International Conference on Communications (ICC), Cape Town, South Africa, May 23-27 en 978-1-4244-6402-9 1550-3607 10.1109/ICC.2010.5502185 1 StefanSchürmanns EliasWeingaertner TorstenKempf GerdAscheid KlausWehrle RainerLeupers inproceedings 201004vaegsieeestudentpad 2010 5 20 5-8 The lack of permanent network infrastructure and often unplanned deployments in many multihop wireless communication scenarios restrict nodes to determine their own addresses based on the underlying connectivity in the network. However, due to unreliable connectivity and rapidly changing link qualities in wireless networks, establishing uniform addressing and stable point-to-point routing is challenging. In this paper, we present Statistical Vector Routing (SVR), a virtual coordinates based addressing and routing mechanism that efficiently deals with dynamic communication links in wireless networks. It assigns stable probabilistic addresses to nodes without the need to pessimistically estimate links over longer periods of time. The routing metric predicts the current location of a node in its address distribution. Our prototype implementation over real testbeds indicates that SVR, when compared to current approaches, achieves 3 times more stable addressing, reduces the magnitude of change in addresses by 2-10 times, and minimizes the hop distance and transmissions in the network by 10-15%. wld https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-vaegs-wehrle-probabilistic_addressing.pdf Print Hamburg University of Technology

Hamburg, Germany

Proceedings of the 2nd IEEE Student Conference, Hamburg University of Technology, Hamburg, Germany Hamburg, Germany 2nd IEEE Student Conference, Hamburg University of Technology May 20-21, 2010 en TobiasVaegs Muhammad HamadAlizai KlausWehrle inproceedings 2010-ipsn-sasnauskas-kleenet 2010 4 12 186--196 Complex interactions and the distributed nature of wireless sensor networks make automated testing and debugging before deployment a necessity. A main challenge is to detect bugs that occur due to non-deterministic events, such as node reboots or packet duplicates. Often, these events have the potential to drive a sensor network and its applications into corner-case situations, exhibiting bugs that are hard to detect using existing testing and debugging techniques. In this paper, we present KleeNet, a debugging environment that effectively discovers such bugs before deployment. KleeNet executes unmodified sensor network applications on symbolic input and automatically injects non-deterministic failures. As a result, KleeNet generates distributed execution paths at high-coverage, including low-probability corner-case situations. As a case study, we integrated KleeNet into the Contiki OS and show its effectiveness by detecting four insidious bugs in the uIP TCP/IP protocol stack. One of these bugs is critical and lead to refusal of further connections. automated protocol testing, experimentation, failure detection, wireless sensor networks kleenet fileadmin/papers/2010/2010-04-ipsn-sasnauskas-KleeNet.pdf Print ACM

New York, NY, USA

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden en 978-1-60558-988-6 http://doi.acm.org/10.1145/1791212.1791235 1 RaimondasSasnauskas OlafLandsiedel Muhammad HamadAlizai CarstenWeise StefanKowalewski KlausWehrle inproceedings 201004IPSNbitschratmote 2010 4 12 432--433 In this work, we present RatMote, a new wireless sensor node for subterranean animal habitat monitoring. RatMote has been developed for project RatPack, which aims at creating a new method for behavioral research on rats in their natural environment using wireless sensor nodes. Recent development in microcontroller architecture allowed us to design a sensor node which calculates up to 22 times more operations per mAh than the widely used TelosB node. This significant performance and efficiency increase allows us to perform computationally demanding algorithms inside the node, needed for vocalization analysis, localization, and mapping. Demo Abstract RatPack fileadmin/papers/2010/2010-04-IPSN-bitsch-ratmote.pdf http://doi.acm.org/10.1145/1791212.1791291 Online ACM

New York City, NY, USA

IPSN '10 Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden ACM Stockholm, Sweden 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010) April 12-16, 2010 en 978-1-60558-988-6 http://doi.acm.org/10.1145/1791212.1791291 1 Jó AgilaBitsch Link ThomasBretgeld AndréGoliath KlausWehrle inproceedings 20104-IPSN-alizai-svr 2010 4 12 366-367 We present Statistical Vector Routing (SVR), a protocol that efficiently deals with communication link dynamics in wireless networks. It assigns virtual coordinates to nodes based on the statistical distribution of their distance from a small set of beacons. The distance metric predicts the current location of a node in its address distribution. Our initial results from a prototype implementation over real testbeds demonstrate the feasibility of SVR. wld https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-alizai-ipsn-pad.pdf http://portal.acm.org/citation.cfm?id=1791257 Print ACM

New York, NY, USA

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden Stockholm, Sweden 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010) April 12-16, 2010 en 978-1-60558-988-6 1 Muhammad HamadAlizai TobiasVaegs OlafLandsiedel RaimondasSasnauskas KlausWehrle inproceedings 201004vaegsjscsvr 2010 4 7 279-280 We present Statistical Vector Routing (SVR), a protocol that efficiently deals with the dynamics shown by communication links of wireless networks. It assigns virtual coordinates to nodes based on the statistical distribution of their distance from a small set of beacons. The distance metric predicts the current location of a node in its address distribution. Our initial results from a prototype implementation over real testbeds demonstrate the feasibility of SVR. https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-alizai-ipsn-pad.pdf Poster Print Hans K. Kaiser and Raimund Kirner Vienna University of Technology

Karlsplatz 13, 1040 Vienna, Austria

Proceedings of the Junior Scientist Conference 2010, Vienna, Austria Vienna, Austria The Junior Scientist Conference April 7-9, 2010 en 978-3-200-01797-9 TobiasVaegs KlausWehrle inproceedings 2010-percomws-heer-munifi Proceedings of the Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010), IEEE. 2010 4 2 1 588 - 593 Municipal Wi-Fi networks aim at providing Internet access and selected mobile network services to citizens, travelers, and civil servants. The goals of these networks are to bridge the digital divide, stimulate innovation, support economic growth, and increase city operations efficiency. While establishing such urban networks is financially challenging for municipalities, Wi-Fi-sharing communities accomplish good coverage and ubiquitous Internet access by capitalizing on the dense deployment of private access points in urban residential areas. By combining Wi-Fi communities and municipal Wi-Fi, a collaborative municipal Wi-Fi system promises cheap and ubiquitous access to mobile city services. However, the differences in intent, philosophy, and technical realization between community and municipal Wi-Fi networks prevent a straight-forward combination of both approaches. In this paper, we highlight the conceptual and technical challenges that need to be solved to create collaborative municipal Wi-Fi networks. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-heer-percomws-collaborative-municipal-wi-fi.pdf Print IEEE Press

Washington, DC, USA

Proceedings of the Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010), Mannheim, Germany. Mannheim, Germany Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010) April 02, 2010 en 978-1-4244-6605-4 10.1109/PERCOMW.2010.5470505 TobiasHeer RenéHummen NicolaiViol HannoWirtz StefanGötz KlausWehrle incollection 2010-kunz-simtools-deployments 2010 4 83-97 Print Klaus Wehrle and Mesut Günes and James Gross Springer

Berlin, Germany

6 Modeling and Tools for Network Simulation en 978-3-642-12330-6 1 GeorgKunz OlafLandsiedel GeorgWittenburg inproceedings 2010-bitsch-link-iq2s-burrowview 2010 3 29 56 -- 61 For a long time, life sciences were restricted to look at animal habitats only post-factum. Pervasive computing puts us in the novel position to gain live views. In this paper we present BurrowView, an application that tracks the movement of rats in their natural habitat and reconstructs the underground tunnel system. To make reliable statements, special consideration has been taken with regard to the information quality. Our system is able to reconstruct paths up to a resolution of 20 cm, the length of a rat without its tail. RatPack fileadmin/papers/2010/2010-03-IQ2S-link-burrowview.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5470603 Online IEEE

New York City, NY, USA

Proceedings of the Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010), Mannheim, Germany IEEE Mannheim, Germany Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010) March 29 to April 2, 2010 en 978-1-4244-6605-4 10.1109/PERCOMW.2010.5470603 1 Jó AgilaBitsch Link GregorFabritius Muhammad HamadAlizai KlausWehrle inproceedings inproceedingsreference201001221179332027 2010 3 15 1-5 In wireless and mobile networking, volatile environ- mental conditions are a permanent challenge, resulting in a demand for cross-layer optimizations. To further increase flexibility, we believe cross-layer architectures should adapt themselves to these changing conditions, just as they adapt the network stack, devices, and applications. In this paper, we propose CRAWLER, a novel cross-layer architecture that combines three core properties: signaling between all layers and system components; extensibility and adaptability at runtime; and high usability for cross-layer developers. CRAWLER increases flexibility, as well as expediting and simplifying cross- layer development. Work in Progress session crawler fileadmin/papers/2010/2010-03-infocom-aktas-crawler.pdf Print IEEE Proceedings of the 2010 INFOCOM IEEE Conference on Computer Communications Workshops, San Diego, CA, USA en 978-1-4244-6739-6 1 IsmetAktas JensOtten FlorianSchmidt KlausWehrle inbook 201001ThieleINTECHRatpack 2010 1 629--644 RatPack http://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-01-Thiele-INTECH-Ratpack.pdf http://sciyo.com/articles/show/title/dynamic-wireless-sensor-networks-for-animal-behavior-research http://www.intechopen.com/articles/show/title/dynamic-wireless-sensor-networks-for-animal-behavior-research Online Domenico Campolo InTech

Vienna, Austria

32 Recent Advances in Biomedical Engineering en 978-953-7619-57-2 1 JohannesThiele Jó AgilaBitsch Link OkuaryOsechas HanspeterMallot KlausWehrle inproceedings 2010-kai-mccsis.pdf 2010 62-66 https://www.comsys.rwth-aachen.de/typo3/file_list.php?id=%2Fvar%2Fwww%2Ffileadmin%2Fpapers%2F2010%2F# CD Sandeep Krishnamurthy, Gurmit Singh, Maggie McPherson IADIS, International Association for Development of the Information Society Proc. e-Democracy, Equity and Social Justice - EDEM2010, Freiburg, Germany en 978-972-8939-24-3 1 KaiJakobs ThomasWagner KaiReimers inproceedings 2010-kai-erima 2010 3 108-116 https://www.comsys.rwth-aachen.de/typo3/file_list.php?id=%2Fvar%2Fwww%2Ffileadmin%2Fpapers%2F2010%2F# Online, CD L. Legardeur; K. North ERIMA

Bidart, FR

Towards new challenges for innovative management practices en 2100-0778 1 KaiJakobs ThomasWagner KaiReimers inproceedings 20105munawardynamictinyos 2010 1-6 Long-term deployments of sensor networks in physically inaccessible environments make remote re-programmability of sensor nodes a necessity. Ranging from full image replacement to virtual machines, a variety of mechanisms exist today to deploy new software or to fix bugs in deployed systems. However, TinyOS - the current state of the art sensor node operating system - is still limited to full image replacement as nodes execute a statically-linked system-image generated at compilation time. In this paper we introduce Dynamic TinyOS to enable the dynamic exchange of software components and thus incrementally update the operating system and its applications. The core idea is to preserve the modularity of TinyOS, i.e. its componentization, which is lost during the normal compilation process, and enable runtime composition of TinyOS components on the sensor node. The proposed solution integrates seamlessly into the system architecture of TinyOS: It does not require any changes to the programming model of TinyOS and existing components can be reused transparently. Our evaluation shows that Dynamic TinyOS incurs a low performance overhead while keeping a smaller - upto one third - memory footprint than other comparable solutions. fileadmin/papers/2010/2010-05-icc-munawar-DynamicTinyOS.pdf Online IEEE Proceedings of the IEEE International Conference on Communications (ICC), Cape Town, South Africa en 978-1-4244-6402-9 1550-3607 1 WaqaasMunawar Muhammad HamadAlizai OlafLandsiedel KlausWehrle inproceedings 2010-ARCS-alizai-promotingpower 2010 387-392 Accurate prediction of energy consumption early in the design process is essential to efficiently optimize algorithms and protocols. However, despite energy efficiency gathering significant attention in networking research, limited effort has been invested in providing requisite evaluation tools and models. Hence, developers demand powerful evaluation tools to assist them in comparing new communication paradigms in terms of energy efficiency, and minimizing the energy requirements of algorithms. In this paper, we argue for promoting energy to a first class metric in network simulations. We explore the challenges involved in modelling energy in network simulations and present a detailed analysis of different modelling techniques. Finally, we discuss their applicability in high-level network simulations. fileadmin/papers/2010/2010-2-ARCS-alizai-promoting-power.pdf Print VDE-VERLAG

Berlin, Germany

Proceedings of the Workshop on Energy Aware Systems and Methods, in conjunction with GI/ITG ARCS 2010 Hannover, Feb. 21-23 en 978-3-8007-3222-7 1 Muhammad HamadAlizai GeorgKunz OlafLandsiedel KlausWehrle inproceedings 201003GarciaEffContAwareAccControlPMS 2010 Proceedings of the First IEEE PerCom Workshop on Pervasive Healthcare OscarGarcia-Morchon KlausWehrle inproceedings 201006GarciaIFIPTM 2010 ManyapplicationsrunningontheInternetoperateinfullyor semi-distributed fashion including P2P networks or social networks. Dis- tributed applications exhibit many advantages over classical client-server models regarding scalability, fault tolerance, and cost. Unfortunately, the distributed system operation also brings many security threats along that challenge their performance and reliability. In particular, faulty or mis- behaving nodes cannot collude to subvert the system operation. This paper addresses the above threats by applying cooperative security techniques to relevant distributed systems in the Internet. Our goal is to present methods that allow the peers to bootstrap basic trust relation- ships at the time of joining a distributed network and remove the peers if trust is lost. We consider the specific security caveats of the analyzed sys- tems, investigate the applicability of existing cooperative security-based protocols, and propose general design guidelines for cooperative-security protocol in described distributed systems. Print Springer

Berlin

Proceedings of IFIPTM 2010 - 4th International Conference on Trust Management Morioka, Japan 4th International Conference on Trust Management en 978-3-642-13445-6 1 DmitriyKuptsov OscarGarcia-Morchon KlausWehrle AndreiGurtov inproceedings 201006GarciaSacmat 2010 Medical sensor networks allow for pervasive health monitoring of users in hospitals, at home, or on the way. The privacy and confidentiality of medical data need to be guaranteed at any moment to make sure that unauthorized parties cannot retrieve confidential information. This is a great challenge due to two main reasons. First, wireless sensors are resource-constrained devices that limit the applicability of traditional solutions. Second, the access control system must be context-aware and adapt its security settings to ensure the users' safety during, e.g., medical emergencies. To solve these issues, this paper presents a modular context-aware access control system tailored to pervasive medical sensor networks in which the access control decisions and the response delay depend upon the health acuteness of a user. Our system extends traditional role-based access control systems by allowing for context-awareness in critical, emergency, and normal access control situations. We further present a lightweight encoding for our modular access control policies as well as an access control engine efficiently running on resource-constrained sensor nodes. Finally, we analyze how the proposed access control system suits existing security architectures for medical sensor networks.

Pittsburgh, USA

Proceedings of ACM Symposium on Access Control Models and Technologies (SACMAT'10) ACM 978-1-4503-0049-0 10.1145/1809842.1809864 1 OscarGarcia-Morchon KlausWehrle