Sciweavers

60 search results - page 5 / 12
» k-Center Problems with Minimum Coverage
Sort
View
ESCIENCE
2006
IEEE
14 years 7 days ago
A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
Silvio Priem-Mendes, Juan Antonio Gómez Pul...
JSAC
2010
120views more  JSAC 2010»
13 years 3 months ago
Simple movement control algorithm for bi-connectivity in robotic sensor networks
Robotic sensor networks are more powerful than sensor networks because the sensors can be moved by the robots to adjust their sensing coverage. In robotic sensor networks, an impor...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Rui Du
SECON
2008
IEEE
14 years 2 months ago
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
14 years 2 months ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 8 months ago
On the Capacity of Wireless Multicast Networks
The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information ...
Seyed Reza Mirghaderi, Alireza Bayesteh, Amir K. K...