Bo Sheng

Prof. Bo Sheng


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2010
Verified
Conference Paper
Closed access
HHHao Han
Hao Han
BSBo Sheng
Bo Sheng
CTChiu C. Tan
Chiu C. Tan
QLQun Li
Qun Li
WMWeizhen Mao
Weizhen Mao
SLSanglu Lu
Sanglu Lu
Radio Frequency IDentification (RFID) technology has attracted much attention due to its variety of applications, e.g., inventory control and object tracking. One important problem in RFID systems is how to quickly estimate the number of distinct tags without reading each tag individually. This problem plays a crucial role in many real-time monitoring and privacy-preserving applications. In this paper, we present an efficient and anonymous scheme for tag population estimation. This scheme leverages the position of the first reply from a group of tags in a frame. Results from mathematical analysis and extensive simulation demonstrate that our scheme outperforms other protocols proposed in the previous work.

9 September 2007
Verified
Conference Paper
Open access
PDF file
BSBo Sheng
Bo Sheng
QLQun Li
Qun Li
WMWeizhen Mao
Weizhen Mao
WJWen Jin
Wen Jin

1 June 2008
Verified
Conference Paper
Closed access
CTChiu C. Tan
Chiu C. Tan
BSBo Sheng
Bo Sheng
QLQun Li
Qun Li
As RFID tags become more widespread, new approaches for managing larger numbers of RFID tags will be needed. In this paper, we consider the problem of how to accurately and efficiently monitor a set of RFID tags for missing tags. Our approach accurately monitors a set of tags without collecting IDs from them. It differs from traditional research which focuses on faster ways for collecting IDs from every tag. We present two monitoring protocols, one designed for a trusted reader and another for an untrusted reader.

1 September 2011 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
HHHao Han
Hao Han
BSBo Sheng
Bo Sheng
CTChiu C. Tan
Chiu C. Tan
QLQun Li
Qun Li
SLSanglu Lu
Sanglu Lu
This paper considers a category of rogue access points (APs) that pretend to be legitimate APs to lure users to connect to them. We propose a practical timing-based technique that allows the user to avoid connecting to rogue APs. Our detection scheme is a client-centric approach that employs the round trip time between the user and the DNS server to independently determine whether an AP is a rogue AP without assistance from the WLAN operator. We implemented our detection technique on commercially available wireless cards to evaluate their performance. Extensive experiments have demonstrated the accuracy, effectiveness, and robustness of our approach. The algorithm achieves close to 100 percent accuracy in distinguishing rogue APs from legitimate APs in lightly loaded traffic conditions, and larger than 60 percent accuracy in heavy traffic conditions. At the same time, the detection only requires less than 1 second for lightly-loaded traffic conditions and tens of seconds for heavy traffic conditions.

1 March 2010
Verified
Conference Paper
Closed access
BSBo Sheng
Bo Sheng
QLQun Li
Qun Li
WMWeizhen Mao
Weizhen Mao
RFID is an emerging technology with many potential applications such as inventory management for supply chain. In practice, these applications often need a series of continuous scanning operations to accomplish a task. For example, if one wants to scan all the products with RFID tags in a large warehouse, given a limited reading range of an RFID reader, multiple scanning operations have to be launched at different locations to cover the whole warehouse. Usually, this series of scanning operations are not completely independent as some RFID tags can be read by multiple processes. Simply scanning all the tags in the reading range during each process is inefficient because it collects a lot of redundant data and consumes a long time. In this paper, we develop efficient schemes for continuous scanning operations defined in both spatial and temporal domains. Our basic idea is to fully utilize the information gathered in the previous scanning operations to reduce the scanning time of the succeeding ones. We illustrate in the evaluation that our algorithms dramatically reduce the total scanning time when compared with other solutions.

26 May 2008
Verified
Conference Paper
Open access
PDF file
BSBo Sheng
Bo Sheng
CTChiu Chiang Tan
Chiu Chiang Tan
QLQun Li
Qun Li
WMWeizhen Mao
Weizhen Mao