Sciweavers

1716 search results - page 104 / 344
» Approximation Algorithms for Data Broadcast in Wireless Netw...
Sort
View
JCO
2006
153views more  JCO 2006»
13 years 9 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
APSEC
2004
IEEE
14 years 24 days ago
Dynamic Enclose Cell Routing in Mobile Sensor Networks
Many routing protocols for wireless sensor network have been proposed, with the purpose of achieving efficient routing. However, when the mobility increases rapidly and the networ...
Yuan Yang, Dong-hyun Lee, Myong-Soon Park, Hoh Pet...
ICDCS
2006
IEEE
14 years 3 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
ADHOCNOW
2004
Springer
14 years 2 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
IWCMC
2006
ACM
14 years 3 months ago
A distributed load-based transmission scheduling protocol for wireless ad hoc networks
This paper presents a load-based transmission scheduling (LoBaTS) protocol for wireless ad hoc networks. Since terminals in these networks may be required to forward unequal amoun...
Brian J. Wolf, Joseph L. Hammond, Harlan B. Russel...