85 search results - page 14 / 17 » Distance Hijacking Attacks on Distance Bounding Protocols |
ICDCS
2003
IEEE
14 years 20 days ago
2003
IEEE
With the proliferation of wireless devices, mobile ad hoc networking (MANET) has become a very exciting and important technology due to its characteristics of open medium and dyna...
MOBIHOC
2001
ACM
14 years 7 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...
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...
WCNC
2008
IEEE
14 years 1 months ago
2008
IEEE
—This paper presents a novel ring-based approach to analyze the inter-flow capacity of a backhaul wireless mesh networks (WMNs) with centralized scheduling. Based on the property...
MOBIHOC
2004
ACM
14 years 7 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...