Sciweavers

263 search results - page 51 / 53
» Robust Multi-Hop Time Synchronization in Sensor Networks
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 5 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
IEEEARES
2010
IEEE
13 years 3 months ago
Using Smart Cards for Tamper-Proof Timestamps on Untrusted Clients
Online auctions of governmental bonds and CO2 certificates are challenged by high availability requirements in face of high peak loads around the auction deadline. Traditionally, t...
Guenther Starnberger, Lorenz Froihofer, Karl M. G&...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 5 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
MOBICOM
2004
ACM
13 years 11 months ago
Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks
One key usage of VANET is to support vehicle safety applications. This use case is characterized by the prominence of broadcasts in scaled settings. In this context, we try to ans...
Marc Torrent-Moreno, Daniel Jiang, Hannes Hartenst...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...