This file was created by the TYPO3 extension
bib
--- Timezone: CET
Creation date: 2024-03-29
Creation time: 12-36-35
--- Number of references
15
inproceedings
2010-krebs-Globecom10-clustering-mesh-conference
Topology Stability-Based Clustering for Wireless Mesh Networks
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-sensys-alizai-tinywifi
Poster Abstract: TinyOS Meets Wireless Mesh Networks
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
inproceedings
5646775
<prt>Indoor Navigation Approach Based on Approximate Positions</prt>
2010
9
778--784
Print
Mautz, R., Kunz, M. and Ingensand, H.
IEEE
Proceedings of the 2010 International Conference on Indoor Positioning and Indoor Navigation (IPIN 2010), Zurich, Switzerland
en
978-1-4244-5864-6
10.1109/IPIN.2010.5646775
OryChowaw-Liebman
UtaChristoph
Karl-HeinzKrempels
ChristophTerwelp
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
DBLP:conf/winsys/Chowaw-LiebmanCKT10
Evaluation of an Indoor Navigation Approach based on Approximate Positions
2010
7
195-201
Print
Rafael F. S. Caldeirinha and Mohammad S. Obaidat
SciTePress
WINSYS 2010 - Proceedings of the International Conference on Wireless Information Networks and Systems, Athens, Greece, WINSYS is part of ICETE - The International Joint Conference on e-Business and Telecommunications
en
978-989-8425-24-9
OryChowaw-Liebman
UtaChristoph
Karl-HeinzKrempels
ChristophTerwelp
inproceedings
DBLP:conf/winsys/ChristophKST10a
Automatic Context Detection of a Mobile user
2010
7
189-194
Print
Rafael F. S. Caldeirinha and Mohammad S. Obaidat
SciTePress
WINSYS 2010 - Proceedings of the International Conference on Wireless Information Networks and Systems, Athens, Greece, WINSYS is part of ICETE - The International Joint Conference on e-Business and Telecommunications
en
978-989-8425-24-9
UtaChristoph
Karl-HeinzKrempels
Jannovon Stülpnagel
ChristophTerwelp
inproceedings
icc2010vpsim
Towards Network Centric Development of Embedded Systems
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-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
inbook
2010-aktas-modeling-application-traffic-bookchapter
Modeling Application Traffic
2010
4
397-426
Springer
18
Modeling and Tools for Network Simulation
978-3-642-12330-6
IsmetAktas
CemMengi
ThomasKing
incollection
2010-kunz-simtools-parallelDES
Parallel Discrete Event Simulation
2010
4
121-131
Print
Klaus Wehrle and Mesut Günes and James Gross
Springer
Berlin, Germany
8
Modeling and Tools for Network Simulation
en
978-3-642-12330-6
1
GeorgKunz
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
inproceedings
DBLP:conf/webist/ChristophGK10
Efficient Literature Research based on Semantic Tagnets - Implemented and Evaluated for a German Text-corpus
2010
4
2
48-54
Print
Joaquim Filipe and José Cordeiro
INSTICC Press
WEBIST 2010, Proceedings of the 6th International Conference on Web Information Systems and Technologies, Valencia, Spain
en
978-989-674-025-2
UtaChristoph
DanielGötten
Karl-HeinzKrempels
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
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
inproceedings
201006GarciaIFIPTM
On Applications of Cooperative Security in Distributed Networks
2010
ManyapplicationsrunningontheInternetoperateinfullyor semi-distributed fashion including P2P networks or social networks. Dis- tributed applications exhibit many advantages over classical client-server models regarding scalability, fault tolerance, and cost. Unfortunately, the distributed system operation also brings many security threats along that challenge their performance and reliability. In particular, faulty or mis- behaving nodes cannot collude to subvert the system operation.
This paper addresses the above threats by applying cooperative security techniques to relevant distributed systems in the Internet. Our goal is to present methods that allow the peers to bootstrap basic trust relation- ships at the time of joining a distributed network and remove the peers if trust is lost. We consider the specific security caveats of the analyzed sys- tems, investigate the applicability of existing cooperative security-based protocols, and propose general design guidelines for cooperative-security protocol in described distributed systems.
Print
Springer
Berlin
Proceedings of IFIPTM 2010 - 4th International Conference on Trust Management
Morioka, Japan
4th International Conference on Trust Management
en
978-3-642-13445-6
1
DmitriyKuptsov
OscarGarcia-Morchon
KlausWehrle
AndreiGurtov