816 search results - page 109 / 164 » Simulation Distances |
86
Voted
PERCOM
2008
ACM
15 years 11 months ago
2008
ACM
Abstract--Analytical models to evaluate and predict "precision" performance of indoor positioning systems based on location fingerprinting are lacking. Such models can be...
111
click to vote
MOBIHOC
2001
ACM
15 years 11 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
105
click to vote
EWSN
2007
Springer
15 years 11 months ago
2007
Springer
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
MOBIHOC
2004
ACM
15 years 11 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
88
Voted
MOBIHOC
2003
ACM
15 years 11 months ago
2003
ACM
It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. W...