47 search results - page 2 / 10 » Tighter Approximation Bounds for Minimum CDS in Wireless Ad ... |
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
COLOGNETWENTE
2007
13 years 6 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
MOBIHOC
2002
ACM
14 years 4 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
ADHOCNOW
2004
Springer
13 years 10 months ago
2004
Springer
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...
ISCC
2003
IEEE
13 years 10 months ago
2003
IEEE
In previous work, we thoroughly studied the intricate problem of energy conservation in wireless ad hoc networks. Consequently, we proposed a novel framework, namely Quasi-Guarante...