47 search results - page 7 / 10 » Tighter Approximation Bounds for Minimum CDS in Wireless Ad ... |
ADHOC
2007
13 years 7 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
WONS
2005
IEEE
14 years 1 months ago
2005
IEEE
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
ICNP
2000
IEEE
13 years 12 months ago
2000
IEEE
Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as locat...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
ICDCS
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...