Sciweavers

5 search results - page 1 / 1
» Convergence of Distributed WSN Algorithms: The Wake-Up Scatt...
Sort
View
HYBRID
2009
Springer
13 years 11 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
EWSN
2009
Springer
14 years 4 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
IPSN
2003
Springer
13 years 9 months ago
A Distributed Algorithm for Waking-up in Heterogeneous Sensor Networks
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
Akis Spyropoulos, Cauligi S. Raghavendra, Viktor K...
ICIP
2006
IEEE
14 years 6 months ago
Omnidirectional Views Selection for Scene Representation
This paper proposes a new method for the selection of sets of omnidirectional views, which contribute together to the efficient representation of a 3D scene. When the 3D surface i...
Ivana Tosic, Pascal Frossard
JSAC
2008
140views more  JSAC 2008»
13 years 4 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