Sciweavers

528 search results - page 12 / 106
» Some problems of directional sensor networks
Sort
View
CN
2010
183views more  CN 2010»
13 years 6 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 6 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
IPSN
2007
Springer
14 years 26 days ago
Distributed consensus and linear functional calculation in networks: an observability perspective
We study the problem of performing sensor fusion and distributed consensus in networks, where the objective is to calculate some linear function of the initial sensor values at so...
Shreyas Sundaram, Christoforos N. Hadjicostis
GLOBECOM
2007
IEEE
14 years 1 months ago
A Steepest Descent Relocation Algorithm for Placement of Sinks in a Sensor Network
— In this paper we use an information flow model for placement of traffic sinks in a wireless sensor network. Our mathematical model translates a communication network composed...
Mehdi Kalantari, Mark A. Shayman
IJWIN
2006
209views more  IJWIN 2006»
13 years 6 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...