% % This file was created by the TYPO3 extension % bib % --- Timezone: CET % Creation date: 2024-03-28 % Creation time: 09-25-50 % --- Number of references % 8 % @Inproceedings { 2010-sensys-alizai-tinywifi, title = {Poster Abstract: TinyOS Meets Wireless Mesh Networks}, year = {2010}, month = {11}, pages = {429-430}, abstract = {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.}, affiliation = {Received Best Poster Award}, url = {fileadmin/papers/2010/2010-11-alizai-tinywifi-sensys.pdf}, web_url = {http://portal.acm.org/citation.cfm?id=1870058\&preflayout=flat}, misc2 = {Print}, publisher = {ACM}, address = {New York, NY, USA}, booktitle = {Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland}, language = {en}, ISBN = {978-1-4503-0344-6}, DOI = {10.1145/1869983.1870058}, reviewed = {1}, author = {Alizai, Muhammad Hamad and Kirchen, Bernhard and Bitsch Link, J{\'o} Agila and Wirtz, Hanno and Wehrle, Klaus} } @Inproceedings { 201004vaegsieeestudentpad, title = {Probabilistic Addressing in Wireless Networks}, year = {2010}, month = {5}, day = {20}, pages = {5-8}, abstract = {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\%.}, tags = {wld}, url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-vaegs-wehrle-probabilistic_addressing.pdf}, misc2 = {Print}, publisher = {Hamburg University of Technology}, address = {Hamburg, Germany}, booktitle = {Proceedings of the 2nd IEEE Student Conference, Hamburg University of Technology, Hamburg, Germany}, event_place = {Hamburg, Germany}, event_name = {2nd IEEE Student Conference, Hamburg University of Technology}, event_date = {May 20-21, 2010}, language = {en}, author = {Vaegs, Tobias and Alizai, Muhammad Hamad and Wehrle, Klaus} } @Inproceedings { 2010-ipsn-sasnauskas-kleenet, title = {KleeNet: Discovering Insidious Interaction Bugs in Wireless Sensor Networks Before Deployment}, year = {2010}, month = {4}, day = {12}, pages = {186--196}, abstract = {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.}, keywords = {automated protocol testing, experimentation, failure detection, wireless sensor networks}, tags = {kleenet}, url = {fileadmin/papers/2010/2010-04-ipsn-sasnauskas-KleeNet.pdf}, misc2 = {Print}, publisher = {ACM}, address = {New York, NY, USA}, booktitle = {Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden}, language = {en}, ISBN = {978-1-60558-988-6}, DOI = {http://doi.acm.org/10.1145/1791212.1791235}, reviewed = {1}, author = {Sasnauskas, Raimondas and Landsiedel, Olaf and Alizai, Muhammad Hamad and Weise, Carsten and Kowalewski, Stefan and Wehrle, Klaus} } @Inproceedings { 20104-IPSN-alizai-svr, title = {Poster Abstract: Statistical Vector based Point-to-Point Routing in Wireless Networks}, year = {2010}, month = {4}, day = {12}, pages = {366-367}, abstract = {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.}, tags = {wld}, url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-alizai-ipsn-pad.pdf}, web_url = {http://portal.acm.org/citation.cfm?id=1791257}, misc2 = {Print}, publisher = {ACM}, address = {New York, NY, USA}, booktitle = {Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden}, event_place = {Stockholm, Sweden}, event_name = {9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010)}, event_date = {April 12-16, 2010}, language = {en}, ISBN = {978-1-60558-988-6}, reviewed = {1}, author = {Alizai, Muhammad Hamad and Vaegs, Tobias and Landsiedel, Olaf and Sasnauskas, Raimondas and Wehrle, Klaus} } @Inproceedings { 2010-bitsch-link-iq2s-burrowview, title = {BurrowView - Seeing the world through the eyes of rats}, year = {2010}, month = {3}, day = {29}, pages = {56 -- 61}, abstract = {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.}, tags = {RatPack}, url = {fileadmin/papers/2010/2010-03-IQ2S-link-burrowview.pdf}, web_url2 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5470603}, misc2 = {Online}, publisher = {IEEE}, address = {New York City, NY, USA}, booktitle = {Proceedings of the Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010), Mannheim, Germany}, organization = {IEEE}, event_place = {Mannheim, Germany}, event_name = {Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010)}, event_date = {March 29 to April 2, 2010}, language = {en}, ISBN = {978-1-4244-6605-4}, DOI = {10.1109/PERCOMW.2010.5470603}, reviewed = {1}, author = {Bitsch Link, J{\'o} Agila and Fabritius, Gregor and Alizai, Muhammad Hamad and Wehrle, Klaus} } @Inbook { 2010-02-book-alizai-hardware-and-systems, title = {Tools and Modeling Approaches for Simulating Hardware and Systems}, year = {2010}, month = {2}, volume = {1}, pages = {99-117}, url = {http://www.network-simulation.info/}, web_url = {http://www.amazon.com/Modeling-Tools-Network-Simulation-Wehrle/dp/3642123309}, misc2 = {Print}, publisher = {Springer LNCS}, chapter = {Chapter 7}, booktitle = {Modeling and Tools for Network Simulation}, language = {EN}, ISBN = {978-3-642-12330-6}, author = {Alizai, Muhammad Hamad and Gao, Lei and Kempf, Torsten and Landsiedel, Olaf} } @Inproceedings { 20105munawardynamictinyos, title = {Dynamic TinyOS: Modular and Transparent Incremental Code-Updates for Sensor Networks}, year = {2010}, pages = {1-6}, abstract = {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.}, url = {fileadmin/papers/2010/2010-05-icc-munawar-DynamicTinyOS.pdf}, misc2 = {Online}, publisher = {IEEE}, booktitle = {Proceedings of the IEEE International Conference on Communications (ICC), Cape Town, South Africa}, language = {en}, ISBN = {978-1-4244-6402-9}, ISSN = {1550-3607}, reviewed = {1}, author = {Munawar, Waqaas and Alizai, Muhammad Hamad and Landsiedel, Olaf and Wehrle, Klaus} } @Inproceedings { 2010-ARCS-alizai-promotingpower, title = {Promoting Power to a First Class Metric in Network Simulations}, year = {2010}, pages = {387-392}, abstract = {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.}, url = {fileadmin/papers/2010/2010-2-ARCS-alizai-promoting-power.pdf}, misc2 = {Print}, publisher = {VDE-VERLAG}, address = {Berlin, Germany}, booktitle = {Proceedings of the Workshop on Energy Aware Systems and Methods, in conjunction with GI/ITG ARCS 2010 Hannover, Feb. 21-23}, language = {en}, ISBN = {978-3-8007-3222-7}, reviewed = {1}, author = {Alizai, Muhammad Hamad and Kunz, Georg and Landsiedel, Olaf and Wehrle, Klaus} }