295 search results - page 31 / 59 » An approximation algorithm for the wireless gathering proble... |
MDM
2009
Springer
15 years 4 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
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...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— We consider energy efficient packet forwarding with quality-of-service (QoS) guarantee for wireless sensor networks (WSNs). In most existing wireless network protocols, route ...
79
Voted
APSCC
2007
IEEE
14 years 9 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
149
click to vote
TON
2010
14 years 4 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...