scholarly journals Throughput-optimal scheduler with tight delay upper bound for wireless networks

2014 ◽  
Vol 3 (3) ◽  
pp. 92-97
Author(s):  
Fan Zhang ◽  
Yewen Cao
Keyword(s):  
Wireless Networks ◽  
Upper Bound ◽  
Optimal Scheduler

scholarly journals Robust localization in wireless networks from corrupted signals

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Muhammad Osama ◽  
Dave Zachariah ◽  
Satyam Dwivedi ◽  
Petre Stoica
Keyword(s):  
Wireless Networks ◽  
Upper Bound ◽  
Numerical Experiments ◽  
Arrival Time ◽  
Time Difference ◽  
Time Of Arrival ◽  
Robust Method ◽  
Computationally Efficient ◽  
Time Difference Of Arrival ◽  
Accurate Localization

AbstractWe address the problem of timing-based localization in wireless networks, when an unknown fraction of data is corrupted by non-ideal propagation conditions. While timing-based techniques can enable accurate localization, they are sensitive to corrupted data. We develop a robust method that is applicable to a range of localization techniques, including time-of-arrival, time-difference-of-arrival and time-difference in schedule-based transmissions. The method is distribution-free, is computationally efficient and requires only an upper bound on the fraction of corrupted data, thus obviating distributional assumptions on the corrupting noise. The robustness of the method is demonstrated in numerical experiments.

Sign in / Sign up

Export Citation Format

Share Document