Publications VS: Bibliography 2006 BibTeX
@inproceedings {INPROC-2006-73,
author = {Stephan Urbanski and Marcus Handte and Gregor Schiele and Kurt Rothermel},
title = {{Experience using Processes for Pervasive Computing}},
booktitle = {Pervasive University Workshop at Informatik 2006},
editor = {GI},
publisher = {GI},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
pages = {1--5},
type = {Conference Paper},
month = {October},
year = {2006},
language = {English},
cr-category = {D.2.11 Software Engineering Software Architectures},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Pervasive Computing envisions seamless computing support for users while
performing their everyday tasks. Many of these tasks are hard to capture by the
notion of a single application as their requirements on computing support vary
over time. To ease the development of applications for such tasks, we have
designed an application model for process-oriented pervasive applications,
called Sentient Processes, and a supporting middleware system implementing the
flow control for processes. In this paper, we show the capabilities of the
Sentient Process model to capture everyday user tasks by the example of a
process supporting a student in managing his classes during a term.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-73&engl=1}
}
@inproceedings {INPROC-2006-72,
author = {Stephan Urbanski and Christian Becker and Kurt Rothermel},
title = {{Sentient Processes - Process-based Applications in Pervasive Computing}},
booktitle = {WIP Track at 4th IEEE Conference on Pervasive Computing and Communications (PerCom)},
editor = {IEEE},
address = {Pisa, Italy},
publisher = {IEEE},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
pages = {1--4},
type = {Conference Paper},
month = {March},
year = {2006},
language = {English},
cr-category = {D.2.3 Software Engineering Coding Tools and Techniques,
D.2.11 Software Engineering Software Architectures},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Users' tasks are typically a sequence of steps. Today, the goal of pervasive
computing applications - to support users in their tasks by using context
information - is only partially met as applications supported by current
infrastructures focus on individual steps instead of supporting the
coordination of the whole sequence. In this paper, we present an approach for
supporting multi-step user tasks by using a process-based application model,
called sentient processes. Along with the model, the paper introduces the
design of an execution engine for such processes.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-72&engl=1}
}
@inproceedings {INPROC-2006-62,
author = {Pedro Jos{\'e} Marr{\'o}n and Daniel Minder and Andreas Lachenmann and Olga Saukh and Matthias Gauger and Robert Sauter and Manuel Gonzalo},
title = {{Adaption and Cross-Layer Support for Sensor Networks}},
booktitle = {4. GMM-Workshop Energieautarke Sensorik},
publisher = {GMM},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
series = {Fachbericht},
volume = {51},
pages = {63--72},
type = {Conference Paper},
month = {September},
year = {2006},
isbn = {3-8007-2987-3},
keywords = {wireless sensor networks; adaptation; cross-layer},
language = {English},
cr-category = {D.4.7 Operating Systems Organization and Design,
C.2.1 Network Architecture and Design,
C.3 Special-Purpose and Application-Based Systems},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {-},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-62&engl=1}
}
@inproceedings {INPROC-2006-61,
author = {Pedro Jos{\'e} Marr{\'o}n and Robert Sauter and Olga Saukh and Matthias Gauger and Kurt Rothermel},
title = {{Challenges of Complex Data Processing in Real World Sensor Network Deployments}},
booktitle = {Proceedings of the ACM Workshop on Real-World Wireless Sensor Networks (REALWSN 2006)},
address = {Uppsala, Sweden},
publisher = {ACM},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
pages = {43--47},
type = {Conference Paper},
month = {June},
year = {2006},
keywords = {Sensor networks; data processing; challenges},
language = {English},
cr-category = {H.3.4 Information Storage and Retrieval Systems and Software,
C.2.4 Distributed Systems,
C.3 Special-Purpose and Application-Based Systems},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-61/INPROC-2006-61.pdf,
http://www.ipvs.uni-stuttgart.de/abteilungen/vs/forschung/projekte/tinycubus/start},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Long-term deployments of wireless sensor networks so far have been focused on
the periodic gathering of simple sensor readings. However, technological
advances allow working with more complex types of data that also create larger
data volumes. In this paper we use a real world engineering application to
identify a series of challenges related to complex data processing in sensor
networks. We present a classification of these challenges and outline a set of
preliminary solutions that we are currently in the process of developing for
our motivating application.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-61&engl=1}
}
@inproceedings {INPROC-2006-60,
author = {Matthias Gauger and Pedro Jos{\'e} Marr{\'o}n and Marcus Handte and Kurt Rothermel},
title = {{Routing in Sensor Networks based on Symbolic Coordinates}},
booktitle = {5. GI/ITG KuVS Fachgespr{\"a}ch ``Drahtlose Sensornetze''},
editor = {Pedro Marr{\'o}n},
address = {Stuttgart},
publisher = {Universit{\"a}t Stuttgart},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
series = {Technischer Bericht},
volume = {2006/07},
pages = {81--86},
type = {Conference Paper},
month = {July},
year = {2006},
language = {English},
cr-category = {C.2.3 Network Operations,
C.2.4 Distributed Systems,
C.3 Special-Purpose and Application-Based Systems},
contact = {Matthias.Gauger@informatik.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {The routing of messages between mobile nodes and a sensor network is an
important but challenging task. In this paper we present our approach for this
problem that is based on the use of symbolic coordinates and that divides the
task among client and sensor nodes.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-60&engl=1}
}
@inproceedings {INPROC-2006-55,
author = {Andreas Lachenmann and Pedro Jos{\'e} Marr{\'o}n and Kurt Rothermel},
title = {{Efficient Flash-based Virtual Memory for Sensor Networks}},
booktitle = {5. GI/ITG KuVS Fachgespr{\"a}ch ``Drahtlose Sensornetze''},
editor = {Pedro Jos{\'e} Marr{\'o}n},
publisher = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
series = {Technical Report},
volume = {2006/07},
pages = {27--31},
type = {Conference Paper},
month = {July},
year = {2006},
keywords = {Virtual Memory; Wireless Sensor Networks; Flash Memory; Memory Layout},
language = {English},
cr-category = {D.4.4 Operating Systems Communications Management,
D.3.4 Programming Languages Processors},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-55/INPROC-2006-55.pdf},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {In this paper we present a virtual memory system for sensor networks that uses
flash-memory to extend the amount of RAM available on each node. By analyzing
access traces from simulation tools it creates an efficient memory layout that
makes virtual memory viable despite the resource constraints typical for sensor
networks.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-55&engl=1}
}
@inproceedings {INPROC-2006-51,
author = {Frank D{\"u}rr and Kurt Rothermel},
title = {{An Overlay Network for Forwarding Symbolically Addressed Geocast Messages}},
booktitle = {Proceedings of the 15th International Conference on Computer Communications and Networks (ICCCN '06); Arlington, VA, October 9-11, 2006},
publisher = {IEEE},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
pages = {427--434},
type = {Conference Paper},
month = {October},
year = {2006},
isbn = {0-4244-0572-6},
keywords = {network protocols; communication protocols; geocast; location-based services},
language = {English},
cr-category = {C.2 Computer-Communication Networks},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-51/INPROC-2006-51.pdf,
http://dx.doi.org/10.1109/ICCCN.2006.286314},
contact = {frank.duerr@ipvs.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Geocast, which allows for forwarding messages to hosts residing at specified
geographic areas, is a promising communication paradigm with a wide range of
applications. Geocast target areas can be specified either by geometric figures
or symbolic addresses, such as /usa/fl/miami/market-street.
In this paper, we present a novel geocast routing protocol for symbolically
addressed messages. Compared to geocast protocols based on geometric
information, our protocol can operate on simple symbolic location models, and
message forwarding does not require costly geometric operations. The proposed
protocol is based on an overlay network that is mapped to an IP-based network
infrastructure. The overlay network is structured in a hierarchical fashion, to
ensure a scalable global geocast service supporting also large target areas.
Although our protocol does not rely on a layer 3 multicast protocol, we also
show how to improve the performance of message forwarding by integrating a
light-weight layer 3 multicast protocol. Our evaluations of the protocol
underline the scalability of our approach and show good routing quality leading
to short message paths.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-51&engl=1}
}
@inproceedings {INPROC-2006-50,
author = {Andreas Lachenmann and Pedro Jos{\'e} Marr{\'o}n and Daniel Minder and Matthias Gauger and Olga Saukh and Kurt Rothermel},
title = {{TinyXXL: Language and Runtime Support for Cross-Layer Interactions}},
booktitle = {Proceedings of the Third Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON 2006)},
publisher = {IEEE},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
pages = {178--187},
type = {Conference Paper},
month = {September},
year = {2006},
isbn = {1-4244-0626-9},
keywords = {wireless sensor networks; cross-layer interactions; TinyXXL; data exchange; data sharing; parametrization},
language = {English},
cr-category = {D.3.3 Programming Language Constructs and Features,
D.2.11 Software Engineering Software Architectures,
C.2.2 Network Protocols},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-50/INPROC-2006-50.pdf,
http://www.ipvs.uni-stuttgart.de/abteilungen/vs/forschung/projekte/tinycubus/start},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {In the area of wireless sensor networks, cross-layer interactions are often
preferred to strictly layered architectures. However, architectural properties
such as modularity and the reusability of components suffer from such
optimizations. In this paper we present TinyXXL that provides programming
abstractions for data exchange, a form of cross-layer interaction with a large
potential for optimizations. Our approach decouples components providing and
using data, and it allows for automatic optimizations of applications composed
of reusable components. Its runtime representation is efficient regarding
memory consumption and processing overhead.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-50&engl=1}
}
@inproceedings {INPROC-2006-46,
author = {Susanne B{\"u}rklen and Pedro Jos{\'e} Marr{\'o}n and Kurt Rothermel and Timo Pfahl},
title = {{Hoarding Location-Based Data Using Clustering}},
booktitle = {Proceedings of the 4-th ACM International Workshop on Mobility Management and Wireless Access Protocols (MobiWAC 2006); Torremolinos, Spain, Oct. 2, 2006},
publisher = {Sheridan Printing},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
pages = {1--1},
type = {Conference Paper},
month = {October},
year = {2006},
language = {English},
cr-category = {H.3 Information Storage and Retrieval},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {The proliferation of mobile devices and the fact that high-bandwidth and
continuous connectivity is not available everywhere, has led to the creation of
hoarding algorithms that attempt to mitigate the problems related with
disconnected operation and with the operation in areas where bandwidth is
either scarce or expensive. In this paper, we present a hoarding scheme for
location-based data in semi-structured information spaces, such as the World
Wide Web, which relies on clustering of semantically related data items. We
show by means of experimental evaluation that our clustering-based approach
outperforms existing hoarding techniques that do not make use of clustering by
a factor of more than 2 in terms of hoard cache hit ratio.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-46&engl=1}
}
@inproceedings {INPROC-2006-43,
author = {J{\"o}rg H{\"a}hner and Pedro Jos{\'e} Marr{\'o}n and Kurt Rothermel},
title = {{Maintaining Update-Linearizability for Replicated Information in MANETs}},
booktitle = {Proceedings of the First International Conference on Communication System Software and Middleware (COMSWARE 2006); New Delhi, India, January 2006},
publisher = {IEEE},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
type = {Conference Paper},
month = {January},
year = {2006},
keywords = {update consistency; MANET; dissemination; replication},
language = {German},
cr-category = {H.2 Database Management,
C.2 Computer-Communication Networks,
E.1 Data Structures},
contact = {joerg.haehner@ipvs.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {In the process of observing changes in our surroundings, the chronological
ordering of these observations plays a crucial role. The same holds for many
applications that employ sensors to gather information about their physical
environment in order to adapt to changes. In this paper, we present a data
replication algorithm for mobile ad hoc and sensor networks that guarantees
chronological ordering of update operations for information objects.
Information objects reflect the state of physical world objects and are updated
by devices equipped with appropriate sensors. Our algorithm allows for multiple
independent devices to update the same object and does not require synchronized
clocks. We describe the underlying consistency model called
update-linearizability and the design of the algorithm, and present simulations
that show its feasibility in practice.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-43&engl=1}
}
@inproceedings {INPROC-2006-42,
author = {Abdelmajid Khelil and Pedro Jos{\'e} Marr{\'o}n and Christian Becker and Kurt Rothermel},
title = {{Hypergossiping: A Generalized Broadcast Strategy for MANETs}},
booktitle = {Elsevier Ad Hoc Networks Journal},
publisher = {Elsevier},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
type = {Conference Paper},
month = {August},
year = {2006},
keywords = {mobile ad hoc network (MANET); adaptive broadcast; network partitioning},
language = {English},
cr-category = {C.2.1 Network Architecture and Design,
C.2.2 Network Protocols},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Broadcasting is a commonly used communication primitive needed by many
applications and protocols in mobile ad hoc networks (MANET). Unfortunately,
most broadcast solutions are tailored to one class of MANETs with respect to
node density and node mobility and are unlikely to operate well in other
classes. In this paper, we introduce hypergossiping, a novel adaptive broadcast
algorithm that combines two strategies. Hypergossiping uses adaptive gossiping
to efficiently distribute messages within single network partitions and
implements an efficient heuristic to distribute them across partitions.
Simulation results in ns-2 show that hypergossiping operates well for a broad
range of MANETs with respect to node densities, mobility levels and network
loads.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-42&engl=1}
}
@inproceedings {INPROC-2006-34,
author = {Abdelmajid Khelil},
title = {{Mobility-Aware Buffering for Delay-Tolerant Broadcasting in MANETs}},
booktitle = {to appear in Proceedings of The International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS'06), Calgary, Canada, July, 2006},
address = {Calgary, Canada},
publisher = {n/a},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
pages = {0--1},
type = {Conference Paper},
month = {July},
year = {2006},
keywords = {MANET, Delay-Tolerant Ad Hoc Networking, Broadcasting, Network Partitioning, Hypergossiping},
language = {English},
cr-category = {C.2.1 Network Architecture and Design,
C.2.2 Network Protocols,
I.6.5 Model Development},
contact = {khelil.informatik.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Mobility plays a major role in mobile ad hoc networks (MANETs), since it
stresses networking tasks such as routing on the one hand, but aids to increase
the network capacity and to overcome network partitioning on the other hand. To
benefit from node mobility, a new class of MANET protocols and applications are
designed to be delay-tolerant and mobility-aided. The main communication
paradigm here is store-and-forward. For delay-tolerant mobility-aided
networking, mobility on a large time-scale is a key feature. So far however, a
few work is done to adapt store-and-forward concepts to the large time-scale
mobility.
Our first step that simplifies the adaptation to node mobility, is a set of
novel mobility metrics. These metrics quantify the mobility on a large
time-scale and are based on the pair-wise contacts between mobile nodes. In
this paper, we show how to exploit these mobility metrics to design an
efficient buffering strategy for hypergossiping, a delay-tolerant
mobility-aided MANET broadcasting protocol. The novel buffering strategy
detects relevant mobility patterns at run-time, using contact-based mobility
metrics, and adapts the buffering decision to the detected mobility pattern.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-34&engl=1}
}
@inproceedings {INPROC-2006-29,
author = {Illya Stepanov and Kurt Rothermel},
title = {{Simulating Mobile Ad-Hoc Networks in City Scenarios}},
booktitle = {Proceedings of the 4th International Conference on Wired/Wireless Internet Communications (WWIC 2006), Bern, Switzerland, May 2006},
editor = {T. Braun and G. Carle and S. Fahmy and Y. Koucheryavy (Eds.)},
publisher = {Springer},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
pages = {1--12},
type = {Conference Paper},
month = {May},
year = {2006},
isbn = {3-540-34023-8},
keywords = {Communication systems; mobile communication; modeling; simulation},
language = {English},
cr-category = {C.2.1 Network Architecture and Design,
C.4 Performance of Systems,
I.6.3 Simulation and Modeling Applications},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-29/INPROC-2006-29.pdf},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Simulation tools are frequently used for performance evaluations of mobile
ad-hoc networks. Currently the tools poorly support urban scenarios, since they
do not take a spatial environment into account. In this paper, we describe a
platform for the modeling of city scenarios. We extend ns-2 with corresponding
mobility and wireless transmission models. By using its emulation facility, we
integrate unmodified applications and real implementations of network
protocols. We demonstrate the usefulness of the platform for performance
evaluations by modeling a mobile application in a simulated environment of
Stuttgart downtown. We show that it helps identifying application problems
before deployment.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-29&engl=1}
}
@inproceedings {INPROC-2006-27,
author = {Florian Bitzer and Dominique Dudkowski and Norbert Haala},
title = {{Investigation of Empirical Pedestrian Traces for Calibrating Microscopic Mobility Models}},
booktitle = {Proceedings of the International Symposium Networks for Mobility 2006, Stuttgart, Germany},
editor = {Wolfgang M{\"o}hlenbrink and Frank Englmann and Markus Friedrich and Ullrich Martin and Ulrich Hangleiter},
address = {Stuttgart},
publisher = {Eigenverlag},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
type = {Conference Paper},
month = {October},
year = {2006},
keywords = {pedestrian; microscopic; simulation; empirical data},
language = {German},
cr-category = {I.6.0 Simulation and Modeling General},
contact = {florian.bitzer@isv.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed High-Performance Systems, Distributed Systems;
Universit{\"a}t Stuttgart, Institut f{\"u}r Photogrammetrie (ifp);
Universit{\"a}t Stuttgart, Institut f{\"u}r Stra{\ss}en- und Verkehrswesen, Abteilung Stra{\ss}enplanung und Stra{\ss}enbau (ISV/SuS)},
abstract = {In the research field of microscopic simulation models for pedestrian mobility
substantial pro-gress was achieved in recent years. The ongoing strong growth
of computational power to-gether with new approaches founding on cellular
automata allows the microscopic simulation of large-scale scenarios like the
evacuation of whole soccer stadiums, as self-organization can be initiated by
using a relatively simple rule set. Recent developments at the Institute for
Road and Transportation Science will now ease the simulation of everyday
situations with multiple source-destination relations as they occur e.g. in
city centers, airport terminals and public transport interchange points.
Regardless of its level of detail, each mobility simulation model is in need of
comprehensive empirical data for validation and calibration purposes. Thereby
macroscopic mobility models, e.g. traffic assignment models, only need cross
sectional data like “vehicles per time seg-ment” for instance. Concerning
pedestrian mobility on the large scale, only macroscopic sur-veys like cordon
counting in a public transport system or traveler flow counting in an airport
terminal have been carried out up to now. However, the empirical data resulting
from these surveys is not suitable for calibrating and validating microscopic
simulation models for pedes-trian traffic, because they only deliver aggregated
traffic flow data. Therefore it was neces-sary to develop a new survey method
which allows the noninvasive recording and analysis of pedestrian traces. In
collaboration with the Institute of Transport Research of the German Aerospace
Center (DLR) a two-day video survey at the Campus Vaihingen of Universit{\"a}t
Stuttgart was carried out. By a network of four wide-angle cameras placed at
strategic viewpoints, a central area of the campus of about 20,000 sqm
incorporating the commuter railway station and the sur-rounding buildings was
recorded at a rate of five frames per second with a spatial resolution of
1024x786 pixels of each camera. In order to analyze the collected imagery of
some giga-bytes of raw data, solutions for several challenges had to be found.
First, suitable tie and control points for georeferencing of the respective
cameras had to be identified. This is re-quired to transform the pedestrians’
trajectories from the respective images to a common reference system. Second,
methods for deriving pedestrian trajectories from consecutive frames as well as
the distinction between pedestrians’ movements and the movement of all other
objects had to be improved. Third, unique tags had to be assigned to the
observed pe-destrians to trace them over the whole monitored area while they
are tracked by the different cameras. The resulting new and unique data set not
only consists of pedestrian traces with decided timestamps at each waypoint, it
also includes the resulting source-destination matrix on which the timestamp
for each pedestrian allows many kinds of statistical operations, e.g. the
computation of the average walking time and standard deviation on different
source-destination relations. The availability of these real traces will
finally enable extensive and high-quality calibration and validation operations
for microscopic simulation models. The dataset may even serve as input
information for simulation in the research field of communi-cation networks, in
particular, in mobile ad hoc networks. In the near future, the detailed
ex-amination of many other problems, such as counter flow, crossing behavior,
and path build-ing phenomena based on real microscopic mobility data will
become possible.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-27&engl=1}
}
@inproceedings {INPROC-2006-25,
author = {Susanne B{\"u}rklen and Pedro Jos{\'e} Marr{\'o}n and Kurt Rothermel},
title = {{Proactive Hoarding in Location-Based Systems}},
booktitle = {Proceedings of the Second Workshop on Context Awareness for Proactive Systems (CAPS 2006)},
publisher = {Springer-Verlag},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
pages = {1--11},
type = {Conference Paper},
month = {June},
year = {2006},
keywords = {Hoarding; location-based systems},
language = {English},
cr-category = {H.3 Information Storage and Retrieval},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {The proliferation of mobile devices and the fact that high-bandwidth
connectivity is not available everywhere, has led to the development of
hoarding algorithms. The aim of these algorithms is to select and prefetch
data, mobile users might access when they are weakly connected in the future.
The data is selected based on context information of users, such as their
location. In this paper, we present a hoarding approach for semi-structured
information items and introduce our Bounded Path Search algorithm (BPS) for the
computation of the hoard list. We show by means of experimental evaluation that
BPS outperforms existing hoarding techniques that use standard graph search
algorithms by a factor of 2.7 in terms of hoard cache hit ratio.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-25&engl=1}
}
@inproceedings {INPROC-2006-13,
author = {Tobias Drosdol and Dominique Dudkowski and Christian Becker and Kurt Rothermel},
title = {{Efficient Indexing of Symbolic Location Information}},
booktitle = {Proceedings of the Second Workshop on Context Awareness for Proactive Systems (CAPS 2006)},
address = {Kassel, Germany},
publisher = {---},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
type = {Conference Paper},
month = {June},
year = {2006},
language = {English},
cr-category = {C.2.4 Distributed Systems,
E.2 Data Storage Representations,
H.3 Information Storage and Retrieval},
contact = {Tobias.Drosdol@ipvs.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Providing context-awareness in future applications demands for accurate
information about the positions of a potentially large number of mobile
objects. This requires location management systems that are capable of coping
with a huge amount of such highly dynamic data. To efficiently retrieve
relevant information, e.g., all objects located inside a given area, these
systems must utilize adequate index structures. In the past, suitable indexes
have been explored for geometric representations of location information only.
The contribution of this paper is a generic index structure for the efficient
management of symbolic location information. Based on different index variants
an adaptive approach is derived that can be adjusted to accommodate different
ratios of update and retrieval load. Our experimental results show how this can
significantly increase the overall performance of a location management system.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-13&engl=1}
}
@inproceedings {INPROC-2006-08,
author = {Torben Weis and Marcus Handte and Mirko Knoll and Christian Becker},
title = {{Customizable Pervasive Applications}},
booktitle = {Proceedings of 4th IEEE International Conference on Pervasive Computing and Communications},
publisher = {-},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
pages = {1--6},
type = {Conference Paper},
month = {March},
year = {2006},
language = {English},
cr-category = {C.2 Computer-Communication Networks,
D.2 Software Engineering,
D.3 Programming Languages},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Human behavior and housing resist every stan-dardization effort. Many aspects
such as different technical equipment, furniture, and usage patterns make our
surroundings as individual as ourselves. Thus, the personalization of pervasive
applications is a fundamental requirement. To enable the development of custom
pervasive applications, we propose a soft-ware development process. This
process is based on the successful process for modern desktop applica-tions.
There, developers create extensible applications and components. Customizers
use the resulting arti-facts to develop custom applications. Finally, users
configure applications to their individual needs by adjusting predefined
settings. To adopt this process for Pervasive Computing, we present a component
system for developers, a graphical toolkit for customizers, and
self-configuration algorithms to ease the deployment.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-08&engl=1}
}
@inproceedings {INPROC-2006-06,
author = {Matthias Wieland and Frank Leymann and Lamine Jendoubi and Daniela Nicklas and Frank D{\"u}rr},
title = {{Task-orientierte Anwendungen in einer Smart Factory}},
booktitle = {Mobile Informationssysteme - Potentiale, Hindernisse, Einsatz. Proceedings MMS´06},
editor = {Thomas Kirste and Birgitta K{\"o}nig-Ries and Key Pousttchi and Klaus Turowski},
address = {Bonn},
publisher = {Gesellschaft f{\"u}r Informatik},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
series = {Lecture Notes in Informatics (LNI)},
volume = {P-76},
pages = {139--143},
type = {Conference Paper},
month = {February},
year = {2006},
isbn = {3-88579-170-6},
keywords = {Kontextbezogene Applikationen; Smart Factory; kontextbezogene Workflows},
language = {German},
cr-category = {H.4.2 Information Systems Applications Types of Systems},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-06/INPROC-2006-06.pdf,
http://www.nexus.uni-stuttgart.de/},
contact = {Matthias Wieland wieland@informatik.uni-stuttgart.de, Daniela Nicklas nicklas@ipvs.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Applications of Parallel and Distributed Systems;
Universit{\"a}t Stuttgart, Institut f{\"u}r Industrielle Fertigung und Fabrikbetrieb (IFF);
University of Stuttgart, Institute of Architecture of Application Systems;
University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {In diesem Beitrag wird aufgezeigt, welche M{\"o}glichkeiten sich durch den Einsatz
task-orientierter, explorativer Anwendungen im Umfeld einer Smart Factory
ergeben. Nach einer kurzen Charakterisierung dieser Anwendungsklasse wird ein
Szenario geschildert, das Wartungsaufgaben in einer Fabrik mit diesen Konzepten
l{\"o}st. Daraus ergibt sich die Vision einer Smart Factory, in der die
Gesch{\"a}ftsprozesse {\"u}ber ein Kontextmodell mit den technischen Prozessen der
Produktionsstra{\ss}e gekoppelt werden.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-06&engl=1}
}
@inproceedings {INPROC-2006-05,
author = {Dominique Dudkowski and Pedro Jos{\'e} Marr{\'o}n and Kurt Rothermel},
title = {{An Efficient Resilience Mechanism for Data Centric Storage in Mobile Ad Hoc Networks}},
booktitle = {Proceedings of the 7th International Conference on Mobile Data Management (MDM '06); Nara, Japan, May 2006.},
publisher = {IEEE},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
type = {Conference Paper},
month = {May},
year = {2006},
keywords = {Mobile Ad Hoc Networks; mobile Ad-hoc-Netze; Data Centric Storage; DCS; datenzentrische Speicherung; infrastrukturlose Systeme; MANETs; MANET},
language = {English},
cr-category = {C.2 Computer-Communication Networks},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-05/INPROC-2006-05.pdf},
contact = {dominique.dudkowski@informatik.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Data Centric Storage (DCS) is a powerful storage paradigm for wireless ad hoc
networks. In mobile ad hoc networks (MANETs), however, the mobility and varying
density of nodes may significantly impact the efficiency of data access and the
level of data consistency for existing DCS mechanisms. In this paper, we
propose an efficient resilience mechanism for data centric storage that
supports DCS in mobile environments. We introduce a novel indirection strategy
that enables us to distinguish the storage of data at dedicated server nodes
from the storage of additional information to locate these servers. Our
approach places server location information dynamically in strategic parts of
the network based on its current topology. Combining our server location
advertisement with any geographic routing protocol, we provide a robust data
update and query processing technique for data centric storage in MANETs. We
show analytically and by means of experimental evaluations that, despite the
additional indirection during packet forwarding, our approach provides superior
storage and retrieval performance than the original DCS algorithm even for
large amounts of dynamic data.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-05&engl=1}
}
@inproceedings {INPROC-2006-04,
author = {Dominique Dudkowski and Pedro Jos{\'e} Marr{\'o}n and Kurt Rothermel},
title = {{Efficient Algorithms for Probabilistic Spatial Queries in Mobile Ad Hoc Networks.}},
booktitle = {Proceedings of the First International Conference on Communication System Software and Middleware (COMSWARE 2006); New Delhi, India, January 2006.},
publisher = {IEEE},
institution = {University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems), Germany},
type = {Conference Paper},
month = {January},
year = {2006},
keywords = {Mobile Ad Hoc Networks; Mobile Ad-hoc-Netze; infrastrukturlose Systeme; probabilistische Anfragen; r{\"a}umliche Anfragen; spatial queries; probabilistic queries; Anfrageverarbeitung; query processing; data management; MANET},
language = {English},
cr-category = {C.2 Computer-Communication Networks},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-04/INPROC-2006-04.pdf},
contact = {dominique.dudkowski@informatik.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {With the proliferation of wireless communication and sensor technology, the
importance of location-based applications has tremendously increased. In order
to support these applications, services that implement algorithms for the
efficient processing of spatial queries, such as range and k-nearest neighbor
queries, are definitely beneficial. In this paper, we propose definitions of
probabilistic range and k-nearest neighbor query semantics that take into
account the inaccurate position information acquired from positioning systems.
We introduce efficient algorithms for distributed storage of the dynamic
information captured by positioning sensors on mobile network nodes, and for
processing the aforementioned queries in mobile ad hoc networks. We show by
evaluation that the studied algorithms incur small communication costs, and
that the query algorithms return accurate results in a timely manner.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-04&engl=1}
}
@inproceedings {INPROC-2006-02,
author = {Olga Saukh and Pedro Jos{\'e} Marr{\'o}n and Andreas Lachenmann and Matthias Gauger and Daniel Minder and Kurt Rothermel},
title = {{Generic Routing Metric and Policies for WSNs}},
booktitle = {Wireless Sensor Networks: Third European Workshop, EWSN 2006, Zurich, Switzerland, February 13-15, 2006. Proceedings},
editor = {Kay R{\"o}mer and Holger Karl and Friedemann Mattern},
publisher = {Springer-Verlag},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
series = {Lecture Notes in Computer Science},
volume = {3868},
pages = {99--114},
type = {Conference Paper},
month = {January},
year = {2006},
isbn = {3-540-32158-6},
keywords = {Wireless Sensor Network},
language = {English},
cr-category = {C.3 Special-Purpose and Application-Based Systems,
C.2.2 Network Protocols},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-02/INPROC-2006-02.pdf},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Energy-aware algorithms have proven to be a crucial part of sensor network
applications, especially if they are required to operate for extended periods
of time. Among these, efficient routing algorithms are of utter importance
since their effect can be experienced by all other layers. Thus, the
optimization and accurate prediction of the lifetime of the system can only be
performed in the presence of accurate execution models that take energy
consumption into account. In this paper, we propose a generic routing metric
and associated policies that encompass most other existing metrics in the
literature and use this model for the optimal construction of a routing tree to
the sink. We also provide experimental results that show the benefits of using
our novel metric.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-02&engl=1}
}
@inproceedings {INPROC-2006-01,
author = {Pedro Jos{\'e} Marr{\'o}n and Matthias Gauger and Andreas Lachenmann and Daniel Minder and Olga Saukh and Kurt Rothermel},
title = {{FlexCup: A Flexible and Efficient Code Update Mechanism for Sensor Networks}},
booktitle = {Wireless Sensor Networks: Third European Workshop, EWSN 2006, Zurich, Switzerland, February 13-15, 2006. Proceedings},
editor = {Kay R{\"o}mer and Holger Karl and Friedemann Mattern},
publisher = {Springer-Verlag},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
series = {Lecture Notes in Computer Science},
volume = {3868},
pages = {212--227},
type = {Conference Paper},
month = {January},
year = {2006},
isbn = {3-540-32158-6},
language = {English},
cr-category = {C.3 Special-Purpose and Application-Based Systems,
D.3.4 Programming Languages Processors,
D.4.9 Systems Programs and Utilities},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2006-01/INPROC-2006-01.pdf},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {The ability to update the program code installed on wireless sensor nodes plays
an import role in the highly dynamic environments sensor networks are often
deployed in. Such ode update mechanisms should support flexible reconfiguration
and adaptation of the sensor nodes but should also operate in an energy and
time efficient manner. In this paper, we present FlexCup, a flexible code
update mechanism that minimizes the energy consumed on each sensor node for the
installation of arbitrary code changes. We describe two different versions of
FlexCup and show, using a precise hardware emulator, that our mechanism is able
to perform updates up to 8 times faster than related code update algorithms
found in the literature, while consuming only an eighth of the energy.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2006-01&engl=1}
}
@article {ART-2006-20,
author = {Christian Becker and Frank D{\"u}rr and Mirko Knoll and Daniela Nicklas and Torben Weis},
title = {{Entwicklung ortsbezogener Anwendungen}},
journal = {Praxis der Informationsverarbeitung und Kommunikation (PIK)},
editor = {Hans G. Kruse},
publisher = {K. G. Saur Verlag},
volume = {29},
number = {1},
pages = {30--36},
type = {Article in Journal},
month = {January},
year = {2006},
doi = {10.1515/PIKO.2006.30},
keywords = {ortsbezogene Dienste; Anwendungsentwicklung},
language = {German},
cr-category = {D.2.2 Software Engineering Design Tools and Techniques},
contact = {Torben Weis torben.weis@informatik.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems;
University of Stuttgart, Institute of Parallel and Distributed Systems, Applications of Parallel and Distributed Systems},
abstract = {Ortsbezogene Anwendungen versorgen Benutzer mit Diensten und Informationen in
Abh{\"a}ngigkeit ihrer aktuellen Position. Beispiele sind im Bereich der
Telematikdienste, Touristenf{\"u}hrer und Informationsdienste zu finden.
Anwendungen k{\"o}nnen sich an den Ort oder ganz allgemein an den Kontext des
Benutzers anpassen, indem sie ortsspezifische Informationen anzeigen oder Daten
der jeweiligen Situation entsprechend pr{\"a}sentieren. Es existieren verschieden
Ans{\"a}tze und Architekturen, um ortsbezogene Anwendungen zu realisieren. In
diesem Beitrag stellen wir unterschiedliche Ans{\"a}tze vor, diskutieren deren Vor-
und Nachteile und leiten daraus ein abstraktes Anwendungsmodell f{\"u}r
ortsbezogene Anwendungen ab. Des Weiteren stellen wir Entwicklungswerkzeuge
vor, die wir auf Basis dieses Anwendungsmodells konzipiert haben. Die
Kombination aus Anwendungsmodell und spezialisierten Werkzeugen wird die
Entwicklung ortsbezogener Anwendungen systematisieren und wesentlich
vereinfachen.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2006-20&engl=1}
}
@article {ART-2006-13,
author = {Kurt Rothermel and Thomas Ertl and Fritsch Dieter and Paul J. K{\"u}hn and Bernhard Mitschang and Engelbert Westk{\"a}mper and Christian Becker and Dominique Dudkowski and Andreas Gutscher and Christian Hauser and Lamine Jendoubi and Daniela Nicklas and Steffen Volz and Matthias Wieland},
title = {{SFB 627 – Umgebungsmodelle f{\"u}r mobile kontextbezogene Systeme}},
journal = {Informatik - Forschung und Entwicklung},
publisher = {Springer-Verlag},
volume = {21},
number = {1-2},
pages = {105--113},
type = {Article in Journal},
month = {June},
year = {2006},
language = {German},
cr-category = {C.2.4 Distributed Systems,
H.2.4 Database Management Systems,
H.2.8 Database Applications,
H.3 Information Storage and Retrieval},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2006-13/ART-2006-13.pdf},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Applications of Parallel and Distributed Systems;
Universit{\"a}t Stuttgart, Institut f{\"u}r Industrielle Fertigung und Fabrikbetrieb (IFF);
University of Stuttgart, Institute of Visualisation and Interactive Systems, Visualisation and Interactive Systems;
Universit{\"a}t Stuttgart, Institut f{\"u}r Photogrammetrie (ifp);
University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems;
Universit{\"a}t Stuttgart, Institut f{\"u}r Kommunikationsnetze und Rechnersysteme (IKR)},
abstract = {Computersysteme, wie wir sie heute kennen, passen sich typischerweise nicht an
den Benutzer und dessen Situation an. Erste Beispiele von Systemen, die durch
den Bezug zur Realwelt den Kontext des Benutzers einbeziehen, sind
Navigationssysteme, die unter Ber{\"u}cksichtigung der Position eines Benutzers und
der Verkehrslage Richtungsanweisungen geben k{\"o}nnen. Damit innovative
kontextbezogene Anwendungen m{\"o}glich werden, muss der Kontext, also der Zustand
der Realwelt, durch Sensoren erfasst, in das Computersystem {\"u}bermittelt und
dort in Form dynamischer Umgebungsmodelle den Anwendungen zur Verf{\"u}gung
gestellt werden.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2006-13&engl=1}
}
@article {ART-2006-12,
author = {Illya Stepanov and Kurt Rothermel},
title = {{On the impact of a more realistic physical layer on MANET simulations results}},
journal = {Ad Hoc Networks. To appear.},
publisher = {Elsevier},
pages = {1--1},
type = {Article in Journal},
month = {September},
year = {2006},
doi = {10.1016/j.adhoc.2006.08.001},
keywords = {Communication systems; Mobile communication; UHF propagation; Geographic information systems; Simulation},
language = {English},
cr-category = {C.2.1 Network Architecture and Design,
C.4 Performance of Systems,
I.6.3 Simulation and Modeling Applications},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2006-12/ART-2006-12.pdf,
http://dx.doi.org/10.1016/j.adhoc.2006.08.001},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Network simulation tools are frequently used to analyze the performance of
MANET protocols and applications. Currently they offer only simple wireless
communication models that neglect many radio propagation effects. In this
paper, we integrate a more realistic physical layer model into a simulation
tool. It consists of a radio propagation model and a model of wireless
transmission errors. They have been evaluated against real-world measurements.
We prove that such more realistic models change simulation results
considerably. To the best of our knowledge, no other study of MANETs has been
performed so far with such a detailed physical layer model. Hence, this paper
also gives new insights on the performance of MANETs in real outdoor
environments.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2006-12&engl=1}
}
@article {ART-2006-01,
author = {Audun J{\o}sang and Elizabeth Gray and Michael Kinateder},
title = {{Simplification and Analysis of Transitive Trust Networks}},
journal = {Web Intelligence and Agent Systems: An International Journal},
address = {Amsterdam, The Netherlands},
publisher = {IOS Press},
volume = {4},
number = {2},
pages = {139--161},
type = {Article in Journal},
month = {May},
year = {2006},
issn = {1570-1263},
keywords = {trust, reputation, transitive, transitivity, trust-graph, trust-chains},
language = {English},
cr-category = {J.4 Social and Behavioral Sciences,
C.2.4 Distributed Systems,
H.3.5 Online Information Services},
ee = {http://unitec.informatik.uni-stuttgart.de},
contact = {Michael Kinateder Kinateder@informatik.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {When transacting and interacting through open computer networks, traditional
methods used in the physical world for establishing trust can no longer be
used. Creating virtual network substitutes with which people, organizations and
software agents can derive trust in other parties requires computerized
analysis of the underlying trust networks. This article describes an approach
to trust network analysis using subjective logic (TNA-SL), that consists of the
three following elements. Firstly it uses a concise notation with which trust
transitivity and parallel combination of trust paths can be expressed. Secondly
it defines a method for simplifying complex trust networks so that they can be
expressed in this concise form. Finally it allows trust measures to be
expressed as beliefs, so that derived trust can be automatically and securely
computed with subjective logic. We compare our approach with trust derivation
algorithms that are based on normalization such as PageRank and EigenTrust. We
also provide a numerical example to illustrates how TNA-SL can be applied.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2006-01&engl=1}
}
@inbook {INBOOK-2006-01,
author = {Kurt Rothermel},
title = {{Kontextbezogene Informationssysteme – von der Vision zur Anwendung}},
series = {Forschung st{\"a}rken - Produktion sichern},
publisher = {Springer-Verlag},
pages = {143--157},
type = {Article in Book},
month = {March},
year = {2006},
language = {German},
cr-category = {H.4 Information Systems Applications},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Die rasant fortschreitende Entwicklung der drahtlosen Kommunikation, der
Computertechnologie sowie der Sensorik f{\"u}hrt zu mobilen Endger{\"a}ten und
„intelligenten“ Alltagsgegenst{\"a}nde, die in Kommunikationsnetze eingebunden sind
und {\"u}ber sensorische F{\"a}higkeiten verf{\"u}gen. Vor dem Hintergrund dieser
Entwicklungen ist es absehbar, dass in wenigen Jahren Milliarden von Sensoren
existieren werden, die kontinuierlich den Zustand der Realwelt erfassen und
kommunizieren. F{\"u}hrt man die sensorisch gewonnen Informationen in einem
r{\"a}umlichen Modell zusammen, so entsteht ein digitales Abbild der Realwelt, also
ein digitales Weltmodell, das analog zum heutigen Web einen globalen
Informati-onsraum darstellt. Das digitale Weltmodell kann Grundlage f{\"u}r ein
breites Spekt-rum so genanter kontextbezogener Anwendungen sein, welche in der
Lage sind, sich bei einer {\"A}nderung des Kontexts dynamisch anzupassen. In diesem
Beitrag wird der Begriff der kontextbezogenen Anwendung erl{\"a}utert und es werden
Anwendungen dieser Art am Beispiel existierender Systeme be-schrieben und
klassifiziert. Au{\ss}erdem wird die Vision, Kontextinformationen in Form digitaler
Weltmodelle zu verwalten, dargelegt und motiviert. Schlie{\ss}lich werden die sich
aus dieser Vision ergebenden wissenschaftlichen Fragestellungen diskutiert.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INBOOK-2006-01&engl=1}
}
@proceedings {PROC-2006-02,
editor = {Pedro Jos{\'e} Marr{\'o}n and Thiemo Voigt and Christian Rohner},
title = {{Proceedings of the 2nd ACM Workshop on Real-World Wireless Sensor Networks}},
publisher = {ACM},
institution = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Germany},
pages = {1},
type = {Proceedings},
month = {June},
year = {2006},
keywords = {ACM Workshop on Real-World Wireless Sensor Networks; REALWSN'06; Wireless Sensor Networks; Real-world Experiments; Deployments},
language = {English},
cr-category = {C.3 Special-Purpose and Application-Based Systems,
C.2 Computer-Communication Networks},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Proceedings of the ACM Workshop on Real-World Wireless Sensor Networks
(REALWSN'06), held in conjunction with ACM MobiSys 2006 in Uppsala, Sweden.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=PROC-2006-02&engl=1}
}
@book {BOOK-2006-03,
editor = {Pedro Jos{\'e} Marr{\'o}n and Daniel Minder and Embedded WiSeNts Consortium},
title = {{Embedded WiSeNts Research Roadmap}},
address = {Berlin},
publisher = {Logos Berlin},
pages = {190},
type = {Book},
month = {November},
year = {2006},
isbn = {3-8325-1424-4},
keywords = {Cooperating Objects; Wireless Sensor Networks; Roadmap; State of the Art; Gap; Timeline; Roadblock; data-centric; market analysis},
language = {English},
cr-category = {C.2.2 Network Protocols,
C.2.3 Network Operations,
C.2.4 Distributed Systems,
C.3 Special-Purpose and Application-Based Systems,
C.4 Performance of Systems,
I.2.9 Robotics,
J.2 Physical Sciences and Engineering,
J.3 Life and Medical Sciences,
J.7 Computers in Other Systems,
K.5.2 Legal Aspects of Computing Governmental Issues},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/BOOK-2006-03/BOOK-2006-03.pdf,
http://www.embedded-wisents.org},
contact = {The corresponding editor is pedro.marron@ipvs.uni-stuttgart.de},
department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
abstract = {Wireless Sensor Networks are a canonical example of a wider field dealing with
Cooperating Objects that attempts to create the necessary technologies to make
Weiser's vision of the disappearing computer a reality. Cooperating Objects are
small computing devices equipped with wireless communication capabilities that
are able to cooperate and organise themselves autonomously into networks to
achieve a common task.
The book contains information about the research roadmap envisioned for
Cooperating Objects by the Embedded WiSeNts consortium and its associated
industrial and academic partners. The Embedded WiSeNts project started in
September 2004 as a Coordination Action funded by the European Commission under
IST/FP6 to create a series of studies on the state of the art of Cooperating
Objects and to devise a research roadmap to be used for the definition of
future research programs. This book is the final result of these two years of
work.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=BOOK-2006-03&engl=1}
}
