This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-09-08 Creation time: 01-13-07 --- Number of references 14 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 techreport 2011-draft-garcia-core-security-03 2011 10 31 draft-garcia-core-security-03 A direct interpretation of the Internet of Things concept refers to the usage of standard Internet protocols to allow for human-to-thing or thing-to-thing communication. Although the security needs are well-recognized, it is still not fully clear how existing IP-based security protocols can be applied to this new setting. This Internet-Draft first provides an overview of security architecture, its deployment model and general security needs in the context of the lifecycle of a thing. Then, it presents challenges and requirements for the successful roll-out of new applications and usage of standard IP-based security protocols when applied to get a functional Internet of Things. Work in progress iotsec; ietf http://tools.ietf.org/html/draft-garcia-core-security-03 Online Internet Engineering Task Force Internet-Draft en OscarGarcia-Morchon Sye LoongKeoh Sandeep S.Kumar RenéHummen RenéStruik 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-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 techreport 2011-draft-garcia-core-security-02 2011 7 11 draft-garcia-core-security-02 A direct interpretation of the Internet of Things concept refers to the usage of standard Internet protocols to allow for human-to-thing or thing-to-thing communication. Although the security needs are well-recognized, it is still not fully clear how existing IP-based security protocols can be applied to this new setting. This Internet-Draft first provides an overview of security architecture, its deployment model and general security needs in the context of the lifecycle of a thing. Then, it presents challenges and requirements for the successful roll-out of new applications and usage of standard IP-based security protocols when applied to get a functional Internet of Things. Work in progress iotsec; ietf http://tools.ietf.org/html/draft-garcia-core-security-02 Online Internet Engineering Task Force Internet-Draft en OscarGarcia-Morchon Sye LoongKeoh Sandeep S.Kumar RenéHummen RenéStruik 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-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 article 22011-itag-samad-cadplus Lecture Notes in Informatics GI-Edition 2011 3 25 S-10 Informatiktage 2011 279-282 Druck Köllen Verlag GmbH

Bonn, Germany

Gesellschaft für Informatik (GI) S-10 en 978-3-88579- 444-8 1614-3213 ShankarKaruppayah FahadSamad 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 techreport 2011-draft-garcia-core-security-01 2011 3 14 draft-garcia-core-security-01 A direct interpretation of the Internet of Things concept refers to the usage of standard Internet protocols to allow for human-to-thing or thing-to-thing communication. Although the security needs are well-recognized, it is still not fully clear how existing IP-based security protocols can be applied to this new setting. This Internet-Draft first provides an overview of security architecture, its deployment model and general security needs in the context of the lifecycle of a thing. Then, it presents challenges and requirements for the successful roll-out of new applications and usage of standard IP-based security protocols when applied to get a functional Internet of Things. Work in progress iotsec; ietf http://tools.ietf.org/html/draft-garcia-core-security-01 Online Internet Engineering Task Force Internet-Draft en OscarGarcia-Morchon Sye LoongKeoh Sandeep S.Kumar RenéHummen RenéStruik techreport 2011-draft-garcia-core-security-00 2011 3 7 draft-garcia-core-security-00 A direct interpretation of the Internet of Things concept refers to the usage of standard Internet protocols to allow for human-to-thing or thing-to-thing communication. Although the security needs are well-recognized, it is still not fully clear how existing IP-based security protocols can be applied to this new setting. This Internet-Draft first provides an overview of security architecture, its deployment model and general security needs in the context of the lifecycle of a thing. Then, it presents challenges and requirements for the successful roll-out of new applications and usage of standard IP-based security protocols when applied to get a functional Internet of Things. Work in progress iotsec; ietf http://tools.ietf.org/html/draft-garcia-core-security-00 Online Internet Engineering Task Force Internet-Draft en OscarGarcia-Morchon Sye LoongKeoh Sandeep S.Kumar RenéHummen RenéStruik article 2011-03-Zimmermann Wireless Communications and Mobile Computing 2011 3 11 3 321-337 Online John Wiley & Sons Ltd.

Hoboken, NJ, USA

en 10.1002/wcm.982 1 AlexanderZimmermann ArndHannemann BenjaminSchleinzer