908 search results - page 144 / 182 » Modeling vulnerabilities of ad hoc routing protocols |
104
click to vote
MOBICOM
2004
ACM
15 years 5 months ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
140
click to vote
MOBIHOC
2004
ACM
15 years 11 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
105
click to vote
MSWIM
2006
ACM
15 years 5 months ago
2006
ACM
As mobile devices, such as laptops, PDAs or mobile phones, are getting more and more ubiquitous and are able to communicate with each other via wireless technologies, the paradigm...
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...