scispace - formally typeset
B

Bowen Li

Researcher at Tsinghua University

Publications -  11
Citations -  112

Bowen Li is an academic researcher from Tsinghua University. The author has contributed to research in topics: Communication channel & Throughput. The author has an hindex of 6, co-authored 10 publications receiving 105 citations.

Papers
More filters
Journal ArticleDOI

Almost Optimal Dynamically-Ordered Channel Sensing and Accessing for Cognitive Networks

TL;DR: This work forms the online sequential channel sensing and accessing problem as a sequencing multi-armed bandit problem, and proposes a novel policy whose regret is in optimal logarithmic rate in time and polynomial in the number of channels.
Proceedings ArticleDOI

RollCaller: User-friendly indoor navigation system using human-item spatial relation

TL;DR: This study proposes to utilize existing indoor objects attached RFID tags and the reader to navigate the user to the destination, without need of any extra hardware.
Journal ArticleDOI

Optimal Frequency-Temporal Opportunity Exploitation for Multichannel Ad Hoc Networks

TL;DR: This paper considers opportunistic channel accessing/releasing scheme in multichannel system with Rayleigh fading channels and proves that the two-dimensional optimal stopping rule can be reduced to a simple threshold-based policy.
Journal ArticleDOI

Online Sequential Channel Accessing Control: A Double Exploration vs. Exploitation Problem

TL;DR: This paper investigates online learning of optimal control in s-SPA systems, where both statistics learning and temporary opportunity utilization are jointly considered, and proposes an effective and efficient online policy, so called IE-OSP, which theoretically guarantees system converges to the optimal s -SPA strategy with bounded probability.
Proceedings ArticleDOI

Almost optimal dynamically-ordered multi-channel accessing for cognitive networks

TL;DR: This work forms the online sequential channel sensing and accessing problem as a sequencing multi-armed bandit problem, and proposes a novel policy whose regret is in optimal logarithmic rate in time and polynomial in the number of channels.