Sciweavers

528 search results - page 15 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs
—Abstract—In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challen...
Yigal Bejerano, Dongwook Lee, Prasun Sinha, Lisa Z...
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
14 years 2 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza
ICDCS
2006
IEEE
14 years 1 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
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...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
TPDS
2008
136views more  TPDS 2008»
13 years 7 months ago
Data Gathering with Tunable Compression in Sensor Networks
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 ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
JCO
2006
153views more  JCO 2006»
13 years 7 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong