279 search results - page 36 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
ADHOCNOW
2005
Springer
14 years 1 months ago
2005
Springer
— In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the...
MOBICOM
2005
ACM
14 years 1 months ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, We mathematically model the In-Range localization scheme in the presence of a Mobile Beacon. In the In-Range localization scheme, a sensor with unknown location is ...
EWSN
2007
Springer
14 years 7 months ago
2007
Springer
Duty-cycling in wireless sensor networks (WSNs) has both beneficial effects on network lifetime and negative effects on application performance due to the inability of a sensor to ...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...