This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-09-09 Creation time: 07-54-15 --- Number of references 22 inproceedings 2011-wirtz-kaleidoscope 2011 12 14 mobile_access fileadmin/papers/2011/2011-wirtz-kaleidoscope.pdf Online

ITU

Proceedings of the ITU-T Kaleidoscope Event 2011, Cape Town, South Africa Cape Town, South Africa ITU-T Kaleidoscope: The fully networked human? 2011-12-12 en 978-92-61-13651-2 1 HannoWirtz RenéHummen NicolaiViol TobiasHeer Mónica AlejandraLora Girón KlausWehrle inproceedings 2011-12-conext-schmidt-refector 2011 12 6 1--12 refector fileadmin/papers/2011/2011-schmidt-refector-conext.pdf Online ACM

New York, NY, USA

Proceedings of the 7th International Conference on emerging Networking EXperiments and Technologies (CoNEXT), Tokyo, Japan Tokyo, Japan 7th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) 6-9 December, 2011 en 978-1-4503-1041-3 10.1145/2079296.2079318 1 FlorianSchmidt Muhammad HamadAlizai IsmetAktas KlausWehrle inproceedings 2011-globecom-bitsch-geodtn 2011 12 5 1 -- 5 In this paper we present a disruption tolerant routing algorithm based on geographic location information, which improves upon the hop count compared to the current state of the art by up to a factor of three in large scale human networks. Leveraging only the history of geographic movement patterns in the two-hop neighborhood, our algorithm is able to perform well in the absence of knowledge of social interaction between nodes and without detailed future schedule information. Representing previously visited locations as probability distributions encoded in an efficient vector, we formalize a heuristic for efficiently forwarding messages in disruption tolerant networks, implement a framework for comparing our approach with the state of the art, and evaluate key metrics, such as hop count and delivery rate, as well as energy consumption and battery depletion fairness on real world data. We are able to outperform the state of the art in human mobility based networks considerably in terms of energy usage per node, thereby extending data network availability further into areas devoid of otherwise necessary communication infrastructure. fileadmin/papers/2011/2011-GlobeCom-bitsch-geoDTN.pdf Online

Piscataway, NJ, USA

IEEE GLOBECOM 2011 - Next Generation Networking Symposium (GC'11 - NGN), Houston, Texas, USA IEEE Houston, Texas, USA IEEE GLOBECOM 2011 - Next Generation Networking Symposium (GC'11 - NGN) 5-9 December 2011 en 978-1-4244-9268-8 1930-529X 1 Jó AgilaBitsch Link DanielSchmitz KlausWehrle article 2011-heer-iot-journal Springer Wireless Personal Communications Journal 2011 10 61 3 527-542 A direct interpretation of the term Internet of Things refers to the use of standard Internet protocols for the human-to-thing or thing-to-thing communication in embedded networks. Although the security needs are well-recognized in this domain, it is still not fully understood how existing IP security protocols and architectures can be deployed. In this paper, we discuss the applicability and limitations of existing Internet protocols and security architectures in the context of the Internet of Things. First, we give an overview of the deployment model and general security needs. We then present challenges and requirements for IP-based security solutions and highlight specific technical limitations of standard IP security protocols. iotsec fileadmin/papers/2011/2011-heer-iot-challenges.pdf Online Springer

Netherlands

en 0929-6212 10.1007/s11277-011-0385-5 1 TobiasHeer OscarGarcia-Morchon RenéHummen Sye LoongKeoh Sandeep S.Kumar KlausWehrle inproceedings 2011-extremecom-bitsch-neighbordiscovery 2011 9 26 1--6 We present an energy efficient neighbor discovery framework that enables Linux and TinyOS based systems to discover and connect to neighbors via IEEE 802.11 and IEEE 802.15.4, which are only available sporadically. Using quorum schemes, we schedule on and off times of the wireless transmitters, to guarantee mutual discovery with minimum power given a specific latency requirement. Neighbor discovery is fundamental to intermittently connected networks, such as disruption and delay tolerant networks and optimizing it, can lead to significant overall energy savings. Using perfect difference sets, our results indicate that we reduce the latency by up to 10 times at a duty cycle of 2% compared to the state of the art. We further define and characterize our neighbor discovery scheme with respect to fairness for asymmetric energy scenarios. Using these results, we allow energy-harvesting applications to adjust neighbor discovery based on their current energy requirements as a well defined trade-off. Neighbor Discovery; Sporadic Connectivity; Wireless Networks fileadmin/papers/2011/2011-ExtremeCom-bitsch-NeighborDiscovery.pdf http://www.cl.cam.ac.uk/~fb375/extremecom/2011/program.html http://dl.acm.org/citation.cfm?id=2414398&CFID=194814085&CFTOKEN=73001357 Online Hui, Pan and Lindgren, Anders ACM Proceedings of the 3rd Extreme Conference of Communication (ExtremeCom 2011), Manaus, Brazil Manaus, Brazil ExtremeCom 2011 26-30 September 2011 en 978-1-4503-1079-6 1 Jó AgilaBitsch Link ChristophWollgarten StefanSchupp KlausWehrle inproceedings 2011-wirtz-chants 2011 9 23 fileadmin/papers/2011/2011-wirtz-chants.pdf Online ACM

New York, NY, USA

Proceedings of the ACM MobiCom Workshop on Challenged Networks (Chants 2011), Las Vegas, NV, USA Las Vegas, NV, USA ACM MobiCom Workshop on Challenged Networks (Chants 2011) 2011-09-23 en 978-1-4503-0870-0 10.1145/2030652.2030666 1 HannoWirtz TobiasHeer RobertBackhaus KlausWehrle inproceedings 2011-ipin-bitsch-footpath-long 2011 9 21 1--8 We present FootPath, a self-contained, map-based indoor navigation system. Using only the accelerometer and the compass readily available in modern smartphones we accurately localize a user on her route, and provide her with turn-by-turn instructions to her destination. To compensate for inaccuracies in step detection and heading estimation, we match the detected steps onto the expected route using sequence alignment algorithms from the field of bioinformatics. As our solution integrates well with OpenStreetMap, it allows painless and cost-efficient collaborative deployment, without the need for additional infrastructure. footpath fileadmin/papers/2011/2011-IPIN-bitsch-footpath-long.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6071934&tag=1 Online IEEE Proceedings of the 2011 International Conference on Indoor Positioning and Indoor Navigation (IPIN), Guimaraes, Portugal Guimarães, Portugal 2011 International Conference on Indoor Positioning and Indoor Navigation (IPIN) 21-23 September 2011 en 978-1-4577-1803-8 http://dx.doi.org/10.1109/IPIN.2011.6071934 1 Jó AgilaBitsch Link PaulSmith NicolaiViol KlausWehrle inproceedings 2011-ipin-bitsch-footpath 2011 9 21 1--4 We present FootPath, a self-contained, map-based indoor navigation system. Using only the accelerometer and the compass readily available in modern smartphones we accurately localize a user on her route, and provide her with turn-by-turn instructions to her destination. To compensate for inaccuracies in step detection and heading estimation, we match the de- tected steps onto the expected route using sequence alignment algorithms from the field of bioinformatics. As our solution integrates well with OpenStreetMap, it allows painless and cost-efficient collaborative deployment, without the need for additional infrastructure. short paper (long paper is also available) footpath fileadmin/papers/2011/2011-IPIN-bitsch-footpath.pdf http://ipin2011.dsi.uminho.pt/PDFs/Shortpaper/17_Short_Paper.pdf fileadmin/papers/2011/2011-IPIN-bitsch-footpath-slides.pdf Online IEEE Proceedings of the 2011 International Conference on Indoor Positioning and Indoor Navigation (IPIN), Guimaraes, Portugal Guimarães, Portugal 2011 International Conference on Indoor Positioning and Indoor Navigation (IPIN) 21-23 September 2011 en 978-972-8692-63-6 1 Jó AgilaBitsch Link PaulSmith KlausWehrle inproceedings 2011-wintech-wirtz 2011 9 19 89-90 Mobile Ad-Hoc Networks (MANETs) rely on the 802.11 ad- hoc mode to establish communication with nearby peers. In practice, this makes MANETs hard to realize. While 802.11-compliant mobile devices implement the ad-hoc mode on the hardware layer, the software layer typically does not implement support for ad-hoc networking in terms of ad-hoc routing and name resolution protocols. Modern mobile operating systems, such as Android and iOS, even hide the inherent ad-hoc functionality of the wireless card through restrictions in the OS. In contrast to this, support for the 802.11 infrastructure mode is a commodity. We propose establishing ad-hoc networks using the 802.11 infrastructure mode. In MA-Fi (Mobile Ad-Hoc Wi-Fi), a small core of mobile router nodes (RONs) provides infrastruc-ture mode network access to mobile station nodes (STANs). As RONs also act as a station in infrastructure networks of other RONs, MA-Fi achieves multi-hop communication between RON and STAN devices in the overall network. We show the creation and operation of mobile ad-hoc networks using MA-Fi. We focus on mobility of RONs and STANs as well as topology control in the overall network. fileadmin/papers/2011/2011-wirtz-wintech.pdf Online ACM

New York, NY, USA

Proceedings of the Sixth ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and Characterization (WiNTECH 2011), Las Vegas, NV, USA Las Vegas, Nevada, USA The Sixth ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and Characterization 2011-09-19 en 978-1-4503-0867-0 10.1145/2030718.2030737 1 HannoWirtz RobertBackhaus RenéHummen KlausWehrle inproceedings VaegsABW2011 2011 9 16 77-80 A tremendous amount of energy is wasted today, because computing devices are left running all the time even though they are needed only sporadically. Especially in office environments many devices (e.g., printers) are very rarely turned off, because they need to be available from time to time and because it is inconvenient having to switch them on and off manually. Existing solutions, such as Wake-on-LAN (WoL), provide support for managing the power consumption of the network devices remotely using an always-on data channel. However, these solutions are inefficient, because power to the network interface has to be maintained even when the host system is asleep just to ensure remote accessibility. We propose a Wireless Sensor Network (WSN) based out-of-band signaling architecture for network interfaces which minimizes the systems’ power consumption during the large idle periods when nobody is using them. This is done by separating the data and control channels on the Internet-enabled devices using a low-power out-of-band signaling channel based on battery driven, energy scavenging devices. Unlike existing solutions, which only allow parts of the system to go in sleep modes, our architecture allows the whole system, including the main power supply, to be shut down. Our initial investigation indicates a significant reduction in energy consumption of devices during idle times compared to the existing in-band signaling mechanisms such as WoL. Energy Saving, Wireless Sensor Network, Out-of-Band Signalling https://www.comsys.rwth-aachen.de/fileadmin/papers/2011/2011-vaegs-fgsn-ecocom.pdf Online Proceedings of the 10th GI/ITG KuVS Fachgespräch Drahtlose Sensornetze (FGSN), Paderborn, Germany RWTH Aachen University Paderborn, Germany 10th GI/ITG KuVS Fachgespräch Drahtlose Sensornetze (FGSN11) September 15-16, 2011 en 1 TobiasVaegs Muhammad HamadAlizai Jó AgilaBitsch Link KlausWehrle inproceedings 2011-wintech-alizai-tinywifi 2011 9 19-27 tinywifi fileadmin/papers/2011/2010-09-tinywifi-alizai-wintech.pdf Online ACM

New York, NY, USA

Proceedings of the Sixth ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and Characterization (WiNTECH ), Las Vegas, NV, USA Las Vegas, NV, USA The 17th Annual International Conference on Mobile Computing and Networking September 2011 en 978-1-4503-0867-0 10.1145/2030718.2030725 1 Muhammad HamadAlizai HannoWirtz BernhardKirchen TobiasVaegs OmprakashGnawali KlausWehrle inproceedings 2011-kunz-mascots-performance-prediction 2011 7 25 359 - 368 horizon fileadmin/papers/2011/2011-kunz-performance-prediction-mascots.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 19th Annual Meeting of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'11), Singapore Singapore 19th Annual Meeting of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems July 25-17, 2011 en 978-1-4577-0468-0 1526-7539 10.1109/MASCOTS.2011.15 1 GeorgKunz SimonTenbusch JamesGross KlausWehrle inproceedings 2011-hummen-pisa-demo 2011 6 15 15 35--36 mobile_access fileadmin/papers/2011/2011-hummen-wisec-pisa-sa-demo.pdf Online ACM

New York, NY, USA

Proceedings of the fourth ACM Conference on Wireless Network Security, Hamburg, Germany Hamburg, Germany Wireless Network Security 2011 (WiSec 2011) en 1559-1662 10.1145/2073290.2073297 1 RenéHummen HannoWirtz NicolaiViol TobiasHeer KlausWehrle inproceedings 2011-icdcs-sasnauskas-sde 2011 6 333-342 Recent advances in symbolic execution have proposed a number of promising solutions to automatically achieve high-coverage and explore non-determinism during testing. This attractive testing technique of unmodified software assists developers with concrete inputs and deterministic schedules to analyze erroneous program paths. Being able to handle complex systems' software, these tools only consider single software instances and not their distributed execution which forms the core of distributed systems. The step to symbolic distributed execution is however steep, posing two core challenges: (1) additional state growth and (2) the state intra-dependencies resulting from communication. In this paper, we present SDE—a novel approach enabling scalable symbolic execution of distributed systems. The key contribution of our work is two-fold. First, we generalize the problem space of SDE and develop an algorithm significantly eliminating redundant states during testing. The key idea is to benefit from the nodes' local communication minimizing the number of states representing the distributed execution. Second, we demonstrate the practical applicability of SDE in testing with three sensornet scenarios running Contiki OS. kleenet fileadmin/papers/2011/2011-06-icdcs-sasnauskas-sde.pdf Druck IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 31st IEEE International Conference on Distributed Computing Systems (ICDCS 2011), June 2011, Minneapolis, MN, USA en 978-0-7695-4364-2 1063-6927 10.1109/ICDCS.2011.28 1 RaimondasSasnauskas OscarSoria Dustmann Benjamin LucienKaminski CarstenWeise StefanKowalewski KlausWehrle inproceedings 2011-iscc-alizai-ble 2011 6 fileadmin/papers/2011/2011-alizai-iscc-ble.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

16th IEEE Symposium on Computers and Communications (ISCC), Kerkyra, Greece Kerkyra, Greece en 978-1-4577-0678-3 10.1109/ISCC.2011.5983839 1 Muhammad HamadAlizai HannoWirtz GeorgKunz BenjaminGrap KlausWehrle inproceedings 2011-ipsn-alizai-pad 2011 4 fileadmin/papers/2011/2011-ipsn-alizai-pad.pdf Online ACM

New York, NY, USA

Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2011), Chicago, IL, USA Chicago, IL, USA en 978-1-60558-988-6 1 Muhammad HamadAlizai TobiasVaegs OlafLandsiedel StefanGötz Jó AgilaBitsch Link KlausWehrle inproceedings 2011-nsdi-slicetime-weingaertner 2011 3 30 https://www.comsys.rwth-aachen.de/fileadmin/papers/2011/2011-weingaertner-nsdi-slicetime-camera_ready_14P.pdf Online USENIX

Berkeley, CA, USA

Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI '11), Boston, MA, USA Boston, Massachusetts en 1 EliasWeingaertner FlorianSchmidt Hendrikvom Lehn TobiasHeer KlausWehrle inproceedings 2011-kunz-omnetpp-horizon 2011 3 21 359-366 Developing an efficient parallel simulation framework for multiprocessor systems is hard. A primary concern is the considerable amount of parallelization overhead imposed on the event handling routines of the simulation framework. Besides more complex event scheduling algorithms, the main sources of overhead are thread synchronization and locking of shared data structures. As a result, the overhead of parallelization may easily outweigh the benefits of parallelization in comparison to classic sequential simulation. We introduce two efficient event handling schemes based on our parallel-simulation extension Horizon for the OMNeT++ simulator.First, we present a \emph{push-based event handling scheme} to minimize the overhead of thread synchronization and locking. Second, we complement this scheme with a novel \emph{event scheduling algorithm} that significantly reduces the overhead of parallel event scheduling. Lastly, we prove the correctness of our scheduling algorithm. Our evaluation reveals a total reduction in the event handling overhead of up to 16x when combining both schemes. horizon fileadmin/papers/2011/2011-kunz-horizon-omnetworkshop.pdf Online ICST

Brussels, Belgium

Proceedings of the 4th International Workshop on OMNeT++ (OMNeT++'11), Barcelona, Spain Barcelona, Spain 4th International Workshop on OMNeT++ (OMNeT++'11) March 21, 2011 en 978-1-936968-00-8 10.4108/icst.simutools.2011.245504 1 GeorgKunz MirkoStoffers JamesGross KlausWehrle inproceedings 2011-weingaertner-device-driver-enabled 2011 3 https://www.comsys.rwth-aachen.de/fileadmin/papers/2011/2011-weingaertner-simutools-wifi-emu_camera-ready.pdf Online ICST

Brussels, Belgium

Proceedings ot the4th International ICST Conference on Simulation Tools and Techniques (SIMUTools 2011) Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques (SIMUTools 2011), Barcelona, Spain Barcelona, Spain accepted en 978-1-936968-00-8 1 EliasWeingaertner Hendrikvom Lehn KlausWehrle poster 2011-03-vomLehn-NSDI-PrivacyOnWeb 2011 3 poster and abstract fileadmin/papers/2011/2011-03-vomLehn-NSDI-PrivacyOnWeb.pdf Online 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI '11), Boston, MA, USA Usenix Boston, MA, USA NSDI March 30 – April 1, 2011 accepted en 1 Hendrikvom Lehn Jó AgilaBitsch Link KlausWehrle article 2011-kai-JITSR Int. J. on IT Standards & Standardisation Research 2011 1 9 1 fileadmin/papers/2011/2011-kai-JITSR.pdf print IGI Global

Hershey, PA, US

1539-3062 1 KaiJakobs ThomasWagner KaiReimers techreport 2011-heer-draft-middle-auth 2011 draft-heer-hip-middle-auth-04 The Host Identity Protocol [RFC5201] is a signaling protocol for secure communication, mobility, and multihoming that introduces a cryptographic namespace. This document specifies an extension for HIP that enables middleboxes to unambiguously verify the identities of hosts that communicate across them. This extension allows middleboxes to verify the liveness and freshness of a HIP association and, thus, to secure access control in middleboxes. Work in progress ietf, mobile_access http://tools.ietf.org/html/draft-heer-hip-middle-auth-04 Online Internet Engineering Task Force Internet-Draft en TobiasHeer MiikaKomu RenéHummen KlausWehrle