Sciweavers

603 search results - page 105 / 121
» Position location by time reversal in communication networks
Sort
View
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 5 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
ICC
2007
IEEE
186views Communications» more  ICC 2007»
15 years 6 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
INFOCOM
2006
IEEE
15 years 5 months ago
Predictability of WLAN Mobility and Its Effects on Bandwidth Provisioning
— Wireless local area networks (WLANs) are emerging as a popular technology for access to the Internet and enterprise networks. In the long term, the success of WLANs depends on ...
Libo Song, Udayan Deshpande, Ulas C. Kozat, David ...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 5 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
GLOBECOM
2007
IEEE
15 years 3 months ago
Channel Measurements of an Indoor Office Scenario for Wireless Sensor Applications
Ad-hoc networks and sensor networks, where nodes communicate with each other without fixed infrastructure, are of great importance for many industrial, environmental, and safety-r...
Shurjeel Wyne, Telmo Santos, Fredrik Tufvesson, An...