Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
—Due to increase in demand for reconfigurability in embedded systems, real-time task scheduling is challenged by non-negligible reconfiguration overheads. If such overheads are n...
Reputation-based mechanisms and policies are vulnerable to the submission of untruthful ratings. In this paper, we define and analyze a game-theoretic model that captures the dyn...
Efficient discovery and resource allocation is one of the challenges of current Peer-to-Peer systems. In centralized approaches, the user requests can be matched to the fastest, ch...
Oscar Ardaiz, Pau Artigas, Torsten Eymann, Felix F...
Abstract--We present a new scheme to reduce the end-toend routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model. Whil...