77 search results - page 4 / 16 » Ad-hoc networks beyond unit disk graphs |
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
— The proliferation of wireless and mobile devices has fostered the demand of context aware applications, in which location is often viewed as one of the most significant context...
COLOGNETWENTE
2007
13 years 10 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...
DC
2010
13 years 8 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
DIALM
1999
ACM
14 years 27 days ago
1999
ACM
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...