2391 search results - page 21 / 479 » The Complexity of Connectivity in Wireless Networks |
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
63
Voted
ISPA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper, we investigate the fault tolerance of connectivity probability for CDMA-based wireless sensor networks with variations of nodes deployment. The variations ...
JPDC
2007
14 years 9 months ago
2007
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...