This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-26 Creation time: 23-03-48 --- Number of references 14 inproceedings 2010-sensys-alizai-tinywifi 2010 11 429-430 We present TinyWifi, a nesC code base extending TinyOS to support Linux powered network nodes. It enables developers to build arbitrary TinyOS applications and protocols and execute them directly on Linux by compiling for the new TinyWifi platform. Using TinyWifi as a TinyOS platform, we expand the applicability and means of evaluation of wireless protocols originally designed for sensornets towards inherently similar Linux driven ad hoc and mesh networks. Received Best Poster Award fileadmin/papers/2010/2010-11-alizai-tinywifi-sensys.pdf http://portal.acm.org/citation.cfm?id=1870058&preflayout=flat Print ACM

New York, NY, USA

Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland en 978-1-4503-0344-6 10.1145/1869983.1870058 1 Muhammad HamadAlizai BernhardKirchen Jó AgilaBitsch Link HannoWirtz KlausWehrle conference 2010-08-lcn-samad-ASSA 2010 10 11 1 752-755 Online IEEE The 10th IEEE Wireless Local Networks(WLN 2010) in the 35th IEEE Local Computer Networks (LCN 2010), Denver, Colorado, U.S.A. Denver, Colorado, United States IEEE Local Computer Networks (IEEE LCN 2010) 11-14 Oct. 2010 en 978-1-4244-8388-4 FahadSamad SadeqAli Makram conference 2010-08-icccn-samad-PiCAT IEEE ICCCN 2010 2010 8 2 1 1 - 7 Online IEEE Medienkombination The 19th International Conference on Computer Communications and Networks (ICCCN 2010), Zurich, Switzerland Zurich, Switzerland 19th International Conference on Computer Communications and Networks (ICCCN 2010) August 2–5, 2010 en 978-1-4244-7114-0 1095-2055 10.1109/ICCCN.2010.5560076 FahadSamad SadeqAli Makram 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 201004vaegsieeestudentpad 2010 5 20 5-8 The lack of permanent network infrastructure and often unplanned deployments in many multihop wireless communication scenarios restrict nodes to determine their own addresses based on the underlying connectivity in the network. However, due to unreliable connectivity and rapidly changing link qualities in wireless networks, establishing uniform addressing and stable point-to-point routing is challenging. In this paper, we present Statistical Vector Routing (SVR), a virtual coordinates based addressing and routing mechanism that efficiently deals with dynamic communication links in wireless networks. It assigns stable probabilistic addresses to nodes without the need to pessimistically estimate links over longer periods of time. The routing metric predicts the current location of a node in its address distribution. Our prototype implementation over real testbeds indicates that SVR, when compared to current approaches, achieves 3 times more stable addressing, reduces the magnitude of change in addresses by 2-10 times, and minimizes the hop distance and transmissions in the network by 10-15%. wld https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-vaegs-wehrle-probabilistic_addressing.pdf Print Hamburg University of Technology

Hamburg, Germany

Proceedings of the 2nd IEEE Student Conference, Hamburg University of Technology, Hamburg, Germany Hamburg, Germany 2nd IEEE Student Conference, Hamburg University of Technology May 20-21, 2010 en TobiasVaegs Muhammad HamadAlizai KlausWehrle 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 inbook 2010-aktas-modeling-application-traffic-bookchapter 2010 4 397-426 Springer 18 Modeling and Tools for Network Simulation 978-3-642-12330-6 IsmetAktas CemMengi ThomasKing inproceedings 2010-bitsch-link-iq2s-burrowview 2010 3 29 56 -- 61 For a long time, life sciences were restricted to look at animal habitats only post-factum. Pervasive computing puts us in the novel position to gain live views. In this paper we present BurrowView, an application that tracks the movement of rats in their natural habitat and reconstructs the underground tunnel system. To make reliable statements, special consideration has been taken with regard to the information quality. Our system is able to reconstruct paths up to a resolution of 20 cm, the length of a rat without its tail. RatPack fileadmin/papers/2010/2010-03-IQ2S-link-burrowview.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5470603 Online IEEE

New York City, NY, USA

Proceedings of the Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010), Mannheim, Germany IEEE Mannheim, Germany Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010) March 29 to April 2, 2010 en 978-1-4244-6605-4 10.1109/PERCOMW.2010.5470603 1 Jó AgilaBitsch Link GregorFabritius Muhammad HamadAlizai KlausWehrle inproceedings inproceedingsreference201001221179332027 2010 3 15 1-5 In wireless and mobile networking, volatile environ- mental conditions are a permanent challenge, resulting in a demand for cross-layer optimizations. To further increase flexibility, we believe cross-layer architectures should adapt themselves to these changing conditions, just as they adapt the network stack, devices, and applications. In this paper, we propose CRAWLER, a novel cross-layer architecture that combines three core properties: signaling between all layers and system components; extensibility and adaptability at runtime; and high usability for cross-layer developers. CRAWLER increases flexibility, as well as expediting and simplifying cross- layer development. Work in Progress session crawler fileadmin/papers/2010/2010-03-infocom-aktas-crawler.pdf Print IEEE Proceedings of the 2010 INFOCOM IEEE Conference on Computer Communications Workshops, San Diego, CA, USA en 978-1-4244-6739-6 1 IsmetAktas JensOtten FlorianSchmidt KlausWehrle 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 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