47 search results - page 5 / 10 » Tighter Approximation Bounds for Minimum CDS in Wireless Ad ... |
ADHOCNOW
2003
Springer
14 years 22 days ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
COMCOM
2004
13 years 7 months ago
2004
Bandwidth-delay product (BDP) and its upper bound (BDP-UB) have been well-understood in wireline networks such as the Internet. However, they have not been carefully studied in th...
ADHOCNOW
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...
ICDCS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—Wireless ad hoc networks require bidirectional data transmission to support two-way traffic and control functions like packet acknowledgement. Most prior work on the capacity o...