This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-26 Creation time: 03-04-25 --- Number of references 21 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 inproceedings 200707WeingaertnerEuroView2007HVSNNGN 2007 7 23 1 1 Both Wireless Sensor Networks (WSNs) and Vehicular Ad-Hoc Networks (VANETs) are technologies that gained extensive attention in the research community during the last years, and many people agree that those are about to contribute to the networks of tomorrow in a signicant way. Within the talk, we present our work on the novel paradigm of Hybrid Sensor-Vehicular Networks (HSVNs) and their contribution to next-generation network architectures. The idea behind Hybrid Sensor-Vehicular Networks is to deploy sensor nodes within the road environment. For example, it is imaginable that future roads will be equipped with sensor nodes that are able to sense environmental events, such as ice, aquaplaning or structural damages. Those events are gathered locally using a wireless sensor network and are delivered directly to vehicles that pass by. Afterwards, information is spread in a wider area using the VANET. https://www.comsys.rwth-aachen.de/fileadmin/papers/2007/2007-eurongi-hybrid-wsn-weingaertner-kargl.pdf http://www3.informatik.uni-wuerzburg.de/euroview/2007/program.shtml online EuroNGI online Proceedings of 7th Würzburg Workshop on IP "Visions of Future Generation Networks" (EuroView2007) Würzburg, Germany 7th Würzburg Workshop on IP "Visions of Future Generation Networks" (EuroView2007) 23.7.2007 / 24.7.2007 en none none 1 EliasWeingaertner FrankKargl inproceedings 200707BitschSNFGRatPack 2007 7 16 2007-11 95 -- 97 The goal of this project is to describe the behaviour of rats. To study this behaviour, we will resort to the use of wireless sensor networks, monitoring various quantities that yield important information to complement current knowledge on the behavioural repertoire of rats. The challenges we face include data acquisition and processing on the one hand, as rat-borne sensor nodes will need to be small enough not to interfere with the rats' own activities, thus limiting the available memory and processing capabilities. Additionally, rats spend a significant amount of time underground, making data transmission and routing a very interesting challenge, for which we are currently developing novel strategies. RatPack fileadmin/papers/2007/2007-07-Bitsch-SNFG-RatPack.pdf Print Klaus Wehrle RWTH Aachen University

Aachen, Germany

AIB 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Aachen, Germany GI/ITG Fachgruppe "Kommunikation und Verteilte Systeme" Aachen, Germany 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks" July 16-17, 2007 en 0935-3232 1 Jó AgilaBitsch Link KlausWehrle OkuaryOsechas JohannesThiele HanspeterMallot 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 conference 2007-aktas-VTC-ApplicabilityofaMulti-ModeMACProtocol-Conference 2007 4 22 969 - 973 Vehicular Technology Conference, 2007. VTC2007-Spring. IEEE 65th ArifOtyakmaz IsmetAktas MarcSchinnenburg RalfPabst conference 2007-aktas-WCNC2007-AMulti-ModeMACProtocolwithRelaySupport-Conference 2007 3 11 328 - 333 Future mobile radio networks will have the requirement of very high data rates. Typical wireless data communication will not only occur in short range scenarios like hotspots in airports, city centres, exhibition halls, etc., but also in wide area environments, e.g. a moving car in a rural environment. Data services will require a ubiquitous mobile radio system and demand better quality of service, like high data rates and low delays. Two promising concepts for future mobile radio communication are the deployment of relays and the ability to adapt to various deployment strategies by using different radio access technologies, i.e. modes with a common technology basis. The former concept allows enlarging the cell coverage. Relays are not wired connected and consequently a cost-efficient alternative to base stations that work in a decode-and-forward principle. The latter concept provides modes that are tailored solutions for specific environments and thus allow the adaptation to various scenarios by selecting the most adequate one. The aim of this work is to merge the advantages taken from both concepts to one solution. Wireless Communications and Networking Conference, 2007. WCNC 2007 ArifOtyakmaz IsmetAktas MarcSchinnenburg RalfPabst conference 200701riecheccncmmog 2007 1 11 763-767 Online games are an interesting challenge and chance for the future development of the Peer-to-Peer paradigm. Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive betatesting suffer from downtimes because of hard- and software problems. Our approach is to use structured P2P technology for the server infrastructure of MMOGs to improve their reliability and scalability. Such P2P networks are also able to adapt to the current state of the game and handle uneven distributions of the players in the game world. Another feature of our approach is being able to add supplementary servers at runtime. Our system allows using off-the-shelf PCs as infrastructure peers for participation in different game worlds as needed. Due to the nature of the Economy of Scale the same number of hosts will provide a better service than dedicated servers for each game world. RWTH Aachen University - Distributed Systems Group http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4199088&arnumber=4199243&count=254&index=154 http://www.ieee-ccnc.org/2007/ Print IEEE Press Proceedings of 4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007) IEEE Las Vegas, Nevada, USA 4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007) 11-13 January 2007 en 1-4244-0667-6 10.1109/CCNC.2007.155 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer LeoPetrak GeorgCarle article ChrKre07PiK Praxis der Informationsverarbeitung und Kommunikation (PIK) 2007 30 2 112--120 Print De Gruyter Saur de 0930-5157 10.1515/PIKO.2007.112 UtaChristoph Karl-HeinzKrempels 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 book 200711P2PBookChineseEdition 2007 Chinese Translation of Steinmetz, Wehrle (Eds.): Peer-to-Peer Systems and Applications http://book.eol.cn/computers/common/info.asp?id=40463 Steinmetz, Ralf and Wehrle, Klaus China Machine Press 9787111236474 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 Gross07 2007 124--132 Proc. of ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'07) JamesGross MarcEmmelmann OscarPuñal AdamWolisz 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 inproceedings GarciaMorchonEtAl2007 2007 1 Print IEEE

Washington, DC, USA

1 Proceedings of the third International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2007 IEEE CollaborateCom en 978-1-4244-1318-8 1 OscarGarcia-Morchon HeribertBaldus TobiasHeer KlausWehrle techreport 200706WeingaertnerFGSN07HSVNPrototype Proceedings of the 2007 GI Special Interest Meeting ("Fachgespraech") on Wireless Sensor Networks 2007 1-4 Proceedings published as technical report at RWTH Aachen. https://www.comsys.rwth-aachen.de/fileadmin/papers/2007/2007-weingaertner-kargl-fgsn.pdf Klaus Wehrle RWTH Aachen University

Bonn, Germany

RWTH Aachen Aachen, Germany Fachgespraech Sensornetzwerke 16.7.2007 / 17.7.2007 A prototype study on Hybrid Sensor-Vehicular Networks 0935-3232 1 EliasWeingaertner FrankKargl techreport 2007-heer-draft-lhip 2007 This document specifies the Lightweight authentication extension forthe Host Identifier Protocol (LHIP). The goal of LHIP is to reduce the computational requirements of the Host Identifier Protocol (HIP), thus, making its benefits, such as end-host mobility and multihoming, accessible to CPU-restricted devices. LHIP reduces the computational cost of establishing, updating, and closing a HIP association by providing an alternative way of signing and verifying HIP control packets which is based on computationally inexpensive hash function computations and hash chains. However, LHIP does not provide nor does it aim at providing the same level of security as HIP does. Especially, host authentication and payload encryption are not possible. The LHIP extensions in this draft specify also mechanisms for dynamic transitioning between lightweight and full HIP associations on the fly. Work in progress Internet Engineering Task Force Internet-Draft TobiasHeer techreport 200707SNFGProceedings 2007 AIB 2007-11

Aachen, Germany

Distributed Systems Group, RWTH Aachen University Proceedings of Workshop KlausWehrle techreport 2007-heer-draft-midauth 2007 draft-heer-hip-midauth-00 The Host Identity Protocol is a signaling protocol for secure communication, mobility, and multihoming. It achieves these properties by introducing a new 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 enables middleboxes to verify the liveness and freshness of a HIP association and, thus, enables reliable and secure access control in middleboxes. Work in progress Internet Engineering Task Force Internet-Draft TobiasHeer