Sciweavers

448 search results - page 23 / 90
» On Multi-robot Area Coverage
Sort
View
CN
2010
183views more  CN 2010»
13 years 10 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
WINET
2011
13 years 4 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu
SECON
2007
IEEE
14 years 4 months ago
Coverage Problem for Sensors Embedded in Temperature Sensitive Environments
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
Arunabha Sen, Nibedita Das, Ling Zhou, Bao Hong Sh...
WCNC
2010
IEEE
14 years 1 months ago
Frequency Reuse Techniques for Attaining Both Coverage and High Spectral Efficiency in OFDMA Cellular Systems
—Inter-cell interference (ICI) is always a big obstacle to attain wide area coverage and high spectral efficiency in cellular systems. In this work we make a study of two well-kn...
Zheng Xie, Bernhard Walke
COMPGEOM
2006
ACM
14 years 3 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...