Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jianmin Gong

dblp:69/5369 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-4417-8065ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 91% Wireless networking · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › RFID systems
anti-collision protocol
0.712023
Multiple Resolution Bit Tracking for Continuous Reliable RFID Tag Identification · IEEE Trans. Mob. Comput. 2023
Internet of things and sensor networks
RFID systems
0.712023
Multiple Resolution Bit Tracking for Continuous Reliable RFID Tag Identification · IEEE Trans. Mob. Comput. 2023
Internet of things and sensor networks › RFID systems
tag identification
0.712023
Multiple Resolution Bit Tracking for Continuous Reliable RFID Tag Identification · IEEE Trans. Mob. Comput. 2023
Wireless networking
unreliable channel
0.212023
Multiple Resolution Bit Tracking for Continuous Reliable RFID Tag Identification · IEEE Trans. Mob. Comput. 2023

Methods — techniques the papers use, named apart from their topics

simulation · 0.7multiple resolution bit tracking · 0.7bit tracking · 0.7
YearPublicationVenuePosition
2023 Multiple Resolution Bit Tracking for Continuous Reliable RFID Tag Identification
abstract
In recent years, radio frequency identification (RFID) technology has been applied in various fields to efficiently identify objects. Considering that identification is usually performed continuously, the latest RFID approaches use previous identification results for subsequent identifications and can identify two tags per unit time. However, these approaches have not utilized bit-level collision information in ID transmissions, which can facilitate the identification. Moreover, the assumption of reliable communication is not always valid in real-world applications. In this article, we propose a new approach called the multiple resolution bit tracking (MRB) to further improve the identification performance. This approach dynamically computes a tag set that can be unambiguously identified irrespective of any missing subset. These tags are requested to transmit their IDs in the same timeslot. Strategies to handle unreliable communication have also been proposed and optimized for MRB. We performed extensive simulations to validate the performance of our proposed approach. The results show that MRB can achieve 3.7 tags per unit time, which is 1.85 times the number achieved using the existing approaches. Furthermore, MRB handles unreliable communications well and achieves a small given tag missing rate.
Weiping Zhu 0004, Jianmin Gong, Jiannong Cao 0001, Zongjian He
IEEE Trans. Mob. Comput.2