385 search results - page 24 / 77 » Contour Approximation in Sensor Networks |
77
Voted
COMCOM
2006
14 years 9 months ago
2006
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
75
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
93
Voted
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
TPDS
2008
14 years 9 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...