Sciweavers

289 search results - page 18 / 58
» Simple COMA Node Implementations
Sort
View
ICAC
2005
IEEE
14 years 2 months ago
Self-Configuring and Optimizing Mobile Ad Hoc Networks
We present the design and implementation of a working system that enables self-configuration and self-optimization in mobile ad hoc networks (MANETs) by exploiting context awarene...
Apostolos Malatras, George Pavlou, Stylianos Gouve...
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 6 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
MSWIM
2004
ACM
14 years 2 months ago
Exploring long lifetime routing (LLR) in ad hoc networks
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
Zhao Cheng, Wendi Beth Heinzelman
FPL
2007
Springer
126views Hardware» more  FPL 2007»
14 years 3 months ago
A Time-Triggered Network-on-Chip
In this paper we propose a time-triggered network-onchip (NoC) for on-chip real-time systems. The NoC provides time predictable on- and off-chip communication, a mandatory feature...
Martin Schoeberl
CAV
2006
Springer
141views Hardware» more  CAV 2006»
14 years 16 days ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...