Sciweavers

231 search results - page 39 / 47
» Joint time synchronization and localization of an unknown no...
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
JSAC
2008
140views more  JSAC 2008»
13 years 8 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
SECON
2008
IEEE
14 years 3 months ago
Coordinated Locomotion of Mobile Sensor Networks
Stationary wireless sensor networks (WSNs) fail to scale when the area to be monitored is open (i.e borderless) and the physical phenomena to be monitored may migrate through a la...
Seokhoon Yoon, Onur Soysal, Murat Demirbas, Chunmi...
IPSN
2007
Springer
14 years 2 months ago
A compact, high-speed, wearable sensor network for biomotion capture and interactive media
In this paper, we present a wireless sensor platform designed for processing multipoint human motion with low latency and high resolution. One application considered here is inter...
Ryan Aylward, Joseph A. Paradiso
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 13 days ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...