279 search results - page 40 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
The Location of nodes in sensor network is an important problem with application in resource allocation, location sensitive browsing, and emergency communications. A key problem i...
SIGMOBILE
2008
13 years 7 months ago
2008
In this article, we outline a research agenda for developing protocols and algorithms for densely populated RFID based systems covering a wide geographic area. This will need mult...
TPDS
2008
13 years 7 months ago
2008
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire...
OPODIS
2004
13 years 9 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
HICSS
2008
IEEE
13 years 7 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...