77 search results - page 12 / 16 » Ad-hoc networks beyond unit disk graphs |
145
Voted
DIALM
2008
ACM
15 years 3 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 ...
107
Voted
JEA
2010
15 years 7 days 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 ...
120
click to vote
AHSWN
2008
15 years 1 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
105
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
132
click to vote
DIALM
2003
ACM
15 years 7 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...