114 search results - page 12 / 23 » Approximation Algorithms for Unit Disk Graphs |
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
JEA
2010
13 years 6 months ago
2010
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...