This file was created by the TYPO3 extension
bib
--- Timezone: CEST
Creation date: 2024-04-29
Creation time: 02-48-19
--- Number of references
8
inproceedings
2010-kunz-mascots-horizon
Expanding the Event Horizon in Parallelized Network Simulations
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-ipsn-sasnauskas-kleenet
KleeNet: Discovering Insidious Interaction Bugs in Wireless Sensor Networks Before Deployment
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
Poster Abstract: Statistical Vector based Point-to-Point Routing in Wireless Networks
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
From Simulations to 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
Tools and Modeling Approaches for Simulating 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
20105munawardynamictinyos
Dynamic TinyOS: Modular and Transparent Incremental Code-Updates for Sensor Networks
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
Promoting Power to a First Class Metric in Network Simulations
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
Mechanisms, Models, and Tools for Flexible Protocol Development and Accurate Network Experimentation
2010
RWTH Aachen University
OlafLandsiedel