This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-19 Creation time: 20-30-15 --- Number of references 8 inproceedings 2007-heer-pisa Seventh IEEE International Conference on Peer-to-Peer Computing, P2P 2007 2007 9 2 1 251-252 http://www.comsys.rwth-aachen.de/fileadmin/papers/2007/2007-p2p-heer-pisa.pdf Print IEEE

Washington, DC, USA

Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing, 2007. P2P 2007, Galway, Ireland. Galway, Ireland Seventh IEEE International Conference on Peer-to-Peer Computing, 2007. P2P 2007. en 978-0-7695-2986-8 10.1109/P2P.2007.12 1 TobiasHeer ShaohuiLi KlausWehrle techreport 2007-fgsn-alizai-timetossim 2007 7 fileadmin/papers/2008/2007-07-fgsn-alizai-accurate-timing.pdf https://www.ds-group.info/events/fgsn07/fgsn07proc.pdf Print RWTH Aachen

Aachen, Germany

Proceedings of the 6th GI/ITG KuVS Workshop on Wireless Sensor Networks (FGSN 07) RWTH Aachen Aachen, Germany FGSN 07 July 2007 en Muhammad HamadAlizai OlafLandsiedel KlausWehrle article 200707ITp2p Special Issue on Peer-to-Peer of the it - Information Technology Journal 2007 49 ISSN 0935-3232 http://it-Information-Technology.de RalfSteinmetz KlausWehrle NicolasLiebau article LandsiedelEtAl2007 Special Issue on Peer-to-Peer of the it - Information Technology Journal 2007 49 5 298-303 Mobile ad-hoc networks and distributed hash tables share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. However, node mobility and the continually changing physical topology pose a special challenge to scalability and the design of a DHT for mobile ad-hoc networks. In this paper, we show that with some local knowledge we can build a scalable and mobile structured peer-to-peer network, called Mobile Hash Table (MHT). Furthermore, we discuss practical challenges such as Churn, load balacing and security of the Mobile Hash Table. A special focus is put on the differences and new challenges that the use of a DHT in a mobile environment poses. http://it-Information-Technology.de Print Oldenbourg Verlag

Munich, Germany

en 1611-2776 1 OlafLandsiedel TobiasHeer KlausWehrle inbook 2007landsiedelwsnalgpseudo 2007 203-213 http://www.springer.com/computer/communications/book/978-3-540-74990-5 Dorothea Wagner, Roger Wattenhofer Springer Lecture Notes in Computer Science, Theoretical Computer Science and General Issues 11 Algorithms for Sensor and Ad-Hoc Networks OlafLandsiedel conference 200711Globecom2007Landsiedelmultipathonionrouting 2007 Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing a static tunnel through an overlay network is build via layered encryption. All traffic exchanged by its end points is relayed through this tunnel.In contrast, this paper introduces dynamic multipath Onion Routing to extend the static Onion Routing paradigm. This approach allows each packet exchanged between two end points to travel along a different path. To provide anonymity the first half of this path is selected by the sender and the second half by the receiver of the packet. The results are manifold: First, dynamic multipath Onion Routing increases the resilience against threats, especially pattern and timing based analysis attacks. Second, the dynamic paths reduce the impact of misbehaving and overloaded relays. Finally, inspired by Internet routing, the forwarding nodes do not need to maintain any state about ongoing flows and so reduce the complexity of the router. In this paper, we describe the design of our dynamic Multipath Onion Router (MORE) for peer-to-peer overlay networks, and evaluate its performance. Furthermore, we integrate address virtualization to abstract from Internet addresses and provide transparent support for IP applications. Thus, no application-level gateways, proxies or modifications of applications are required to sanitize protocols from network level information. Acting as an IP-datagram service, our scheme provides a substrate for anonymous communication to a wide range of applications using TCP and UDP. IEEE Global Communication Conference (GlobeCom), Washington D.C. OlafLandsiedel AlexisPimenidis KlausWehrle HeikoNiedermayer GeorgCarle inproceedings 200706juriFGSN07platform 2007

Aachen, Germany

Proceedings of 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks" JuriSaragazki OlafLandsiedel KlausWehrle inproceedings 200707SchmidtFGSN07composition 2007

Aachen, Germany

Proceedings of 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Aachen StefanSchmitz OlafLandsiedel KlausWehrle