3130 search results - page 471 / 626 » Collusion without communication |
185
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
215
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised...
200
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
211
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
152
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...