279 search results - page 55 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network...
KBS
2006
13 years 8 months ago
2006
We present a system for visual robotic docking using an omnidirectional camera coupled with the actor critic reinforcement learning algorithm. The system enables a PeopleBot robot...
ROBOCOMM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
JSAC
2008
13 years 8 months ago
2008
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...