295 search results - page 10 / 59 » An approximation algorithm for the wireless gathering proble... |
222
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
84
Voted
EWSN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
106
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
132
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...