This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-25 Creation time: 03-06-31 --- Number of references 15 inproceedings 2010-krebs-Globecom10-clustering-mesh-conference 2010 12 1 1-5 In the past, many clustering algorithms for ad-hoc networks have been proposed. Their main objective is to solve the scalability issue of ad-hoc networks by grouping nodes into clusters. The challenge in MANETs for those clustering algorithms is to cope with the high node mobility which affects the stability of the cluster structures. Wireless mesh networks consist of a static backbone and a number of mobile nodes. In the backbone of a wireless mesh network the topology is relatively static. However, topology changes occur due to frequent link losses and temporary link instability. Due to the static nature of the backbone, mobility-based approaches are not suitable in this case. In this paper, we state the important aspects for stable clustering in wireless mesh networks with unidirectional links based on the investigation of a 45-node wireless mesh testbed. We analyze well-known clustering algorithms and their performance in a large-scale testbed. Finally, we propose a new clustering algorithm called Stable Link Clustering Algorithm (SLCA). fileadmin/papers/2010/2010-lora-clustering-MESH.pdf http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5683417 Print IEEE Proceedings of the IEEE Global Telecommunications Conference GLOBECOM 2010, Miami, USA Miami, FL, USA IEEE Global Telecommunications Conference, GLOBECOM 2010 6 - 10 December 2010 en 978-1-4244-5636-9 10.1109/GLOCOM.2010.5683417 1 MartinKrebs AndréStein Mónica AlejandraLora Girón inproceedings 2010-lora-CoNEXTStudent-ELA-Workshop 2010 11 1 Nowadays, mobile wireless users are in constant demand of connectivity. Satisfying the connectivity requirements of the users requires a large amount of Access Points (APs) in order to enlarge the wireless service coverage. Wireless Metropolitan Area Sharing Networks (WMSN) are a low cost alternative that fulfill this high degree of user requirements. On WMSN certain places will experiment congestion when a large number of users are associated with the same device. For this reason, new mechanisms are required with the aim of satisfy the Quality of User Experience (QoE). The Experience Level Agreements (ELA) definition for WMSN is a formal way to characterize the requirements of the users and permits having measuring functions for this kind of network, which helps to improve the QoE. fileadmin/papers/2010/2010-lora-agreements-WMSN.pdf http://portal.acm.org/citation.cfm?doid=1921206.1921215 Digital ACM

New York, NY, USA

Proceedings of the ACM CoNEXT 2010 Student Workshop, Philadelphia, USA Philadelphia, PA, USA Proceedings of the ACM CoNEXT 2010 Student Workshop November 30 - December 03, 2010 en 978-1-4503-0468-9 10.1145/1921206.1921215 1 Mónica AlejandraLora Girón 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-lora-algosyn-QoE-dagstuhl 2010 6 1 20 Cooperative Wireless Networks (CWN) have become an attrac- tive alternative for providing ubiquitous and inexpensive connectivity for the mobile users. In CWN certain public and popular spaces may facilitate the appearance of the problem of sporadic user congestion; the occurrence of this local congestion adversely impacts the network and the user, degrading the application throughput, therefore the Quality of User Experience (QoE). fileadmin/papers/2010/2010-lora-Dagstuhl-Proposal-QoE.pdf Print DFG Research Training Group 1298 "AlgoSyn" DFG Research Training Group 1298 "AlgoSyn" Proceeedings of the Joint Workshop of the German Research Training Groups in Computer Science Dagstuhl 2010 RWTH Aachen University Dagstuhl, Germany Workshop of the German Research Training Groups in Computer Science May 31 - June 2, 2010 en 3-86130-146-6 Mónica AlejandraLora Girón 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 2010-lora-COOP-Cooperative-WLAN-Workshop 2010 5 7 number 1 151-161 Cooperative Wireless Networks (CWN) have become an attractive alternative for providing ubiquitous and inexpensive connectivity to mobile users. In a CWN, some hot-spot areas may experience the problem of sporadic congestions. The appearance of this localized congestion adversely impacts the network performance in terms of effective throughput, leading to a Quality of User Experience (QoE) degradation. The challenge then is how to ensure the QoE for the access to services, in this unplanned type of networks. This paper proposes a QoE for CWN with no centralized entities, which is based on the IEEE 802.11e amendment to the IEEE 802.11 Standard, and employs a game theory approach. The proposed scheme permits the distribution of the load between different Access Points. It also provides to the users a mechanism for the selection of the best Access Point in order to satisfy their requirements, and to guarantee the equilibrium in the network. fileadmin/papers/2010/2010-lora-QoE-Cooperative.pdf Online Gunnar Stevens, Volkmar Pipek and Markus Rohde IISI - International Institute for Socio-Informatics

Bonn, Germany

Workshop Proceedings of 9th International Conference on the Design of Cooperative Systems, International reports on socio-informatics, Aix - en - Provence, France Aix-en-Provence, France Mobile Collaboration Systems: Challenges for design, work practice, infrastructure, and business May 2010 en 1861-4280 1 Mónica AlejandraLora Girón 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 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 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 inbook 2010-02-book-alizai-hardware-and-systems 2010 2 1 99-117 http://www.network-simulation.info/ http://www.amazon.com/Modeling-Tools-Network-Simulation-Wehrle/dp/3642123309 Print Springer LNCS Chapter 7 Modeling and Tools for Network Simulation EN 978-3-642-12330-6 Muhammad HamadAlizai LeiGao TorstenKempf OlafLandsiedel inproceedings inproceedingsreference201001227195395138 2010 1 18 1 1-6 This paper presents a cross-layer approach for iterative source-channel decoding (ISCD) in wireless VoIP networks. The novelty of the proposed method is the incorporation of both, speech bits as well as protocol header bits, into the ISCD process. The header bits take the role of pilot bits having perfect reliability. These bits are distributed over the frame as strong supporting points for the MAP decoder which results in a significant enhancement of the output speech quality compared to the benchmark scheme using ISCD for speech only. For this approach, we exploit new cross-layer concepts that support the direct communication between non-adjacent layers. These concepts enable the iterative exchange of extrinsic information between the source decoder located on the application layer and the channel decoder located on the physical layer. This technique can also be applied to audio and video transmission. refector fileadmin/papers/2010/2010-01-scc-breddermann-iscd.pdf CD-ROM / DVD-ROM Rudolf Mathar, Christoph Ruland VDE Verlag

Berlin, Germany

Proceedings of International ITG Conference on Source and Channel Coding Proceedings of International ITG Conference on Source and Channel Coding ITG Siegen International ITG Conference on Source and Channel Coding 2010 January 18-21, 2010 en 978-3-8007-3211-1 1 TobiasBreddermann HelgeLueders PeterVary IsmetAktas FlorianSchmidt inbook 2010-kai-wifi 2010 53-109 https://www.comsys.rwth-aachen.de/typo3/file_list.php?id=%2Fvar%2Fwww%2Ffileadmin%2Fpapers%2F2010%2F# print W. Lemstra; J. Groenewegen; V. Hayes Cambridge University Press

Cambridge, UK

3 The Innovation Journey of WiFi 9780521199711 KaiJakobs WolterLemstra VicHayes BruceTuch CessLinks 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 phdthesis 2010-landsiedel-phd 2010 RWTH Aachen University OlafLandsiedel