MFMingqiu Fan

Mingqiu Fan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Mingqiu Fan has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Game-Theoretic Market Mechanism for Dynamic Wireless Resource Allocation

    by Mingqiu Fan, Yongxu Zhu, Qin Wang, Qinran Hu, Shi Jin

    Spectrum scarcity in 5G and beyond (B5G) poses a major challenge to wireless resource allocation. Existing spectrum allocation frameworks, however, often struggle to jointly capture heterogeneous user equipment (UE) demand, economic incentives, and real-time implementability. To address this challenge, this paper proposes a utility-aware, market-driven framework for dynamic pricing and bandwidth allocation. Specifically, we formulate a two-stage Stackelberg game, in which the mobile network operator (MNO) acts as the leader and sets user-specific prices to enable effective price discrimination, while each UE acts as a follower and determines its bandwidth demand by maximizing individual utility. We establish the existence and uniqueness of the Stackelberg equilibrium and derive tractable closed-form expressions for the corresponding pricing and band width strategies under both general and high-SNR regimes, with an extension to reuse-enabled spectrum sharing. Numerical results validate the analytical equilibrium and show that the proposed mechanism effectively regulates strategic UE demand while achieving a more favorable trade-off between MNO utility and UE satisfaction compared with conventional baselines.

  • A Collision Reconciling-Based B-Ary Tree-Splitting Missing Tag Identification Protocol

    by Mingqiu Fan, Lijuan Zhang, Lei Lei, Chunni Yu

    Radio frequency identification technology has been widely used in various fields, including manufacturing, retail, and smart cities. This article proposes an innovative protocol called collision reconciling-based B -ary tree splitting missing tag identification (CTMTI) protocol for large-scale RFID systems. The proposed CTMTI protocol uses an optimal B -ary tree splitting assignment, leveraging information from collisions. In addition, a three-bit collision reconciling strategy is developed to resolve collision elements. Further, a bit-tracking response strategy that allows multiple tags to respond with different binary strings within one slot is introduced. Both theoretical analysis and simulations unequivocally confirm that the proposed CTMTI protocol can enhance time efficiency, outperforming the state-of-the-art protocols by at least 200.7%.


  • Open Access

    An Efficient Early-breaking-estimation and Tree-splitting Missing RFID Tag Identification Protocol

    by Mingqiu Fan, Lijuan Zhang, Lei Lei, Chunni Yu

    Retailers grapple with inventory losses primarily due to missing items, prompting the need for efficient missing tag identification methods in large-scale RFID systems. Among them, few works considered the effect of unexpected unknown tags on the missing tag identification process. With the presence of unknown tags, some missing tags may be falsely identified as present. Thus, the system’s reliability is hardly guaranteed. To resolve these challenges, we propose an efficient early-breaking-estimation and tree-splitting-based missing tag identification (ETMTI) protocol for large-scale RFID systems. ETMTI employs innovative early-breaking-estimation and deactivation methods to swiftly handle unknown tags. Subsequently, a tree-splitting-based missing tag identification method is proposed, employing a B-ary splitting tree, to rapidly identify missing tags. Additionally, a bit-tracking response strategy is implemented to reduce processing time. Theoretical analysis is conducted to determine optimal parameters for ETMTI. Simulation results illustrate that our proposed ETMTI protocol significantly outperforms benchmark methods, offering a shorter processing time and a lower false negative rate.


  • Open Access

    An Admission-Control-Based Dynamic Query Tree Protocol for Fast Moving RFID Tag Identification

    by Jiabin Peng, Lijuan Zhang, Mingqiu Fan, Nan Zhao, Lei Lei, Qirui He, Jiangcheng Xia

    As one of the key techniques used in the perception layer of the Industrial Internet of Things (IIoT), radio frequency identification (RFID) has been widely applied for object tracing, smart warehouse management, product line monitoring, etc. In most applications, conveyor belts are prevalently implemented to accelerate the sorting efficiency for goods management. However, in such a system, tags quickly go through the reader’s reading range resulting in constant changing of the tag set and limited participating time of moving tags. As a result, it poses more challenges to the tag identification problem in mobile systems than in traditional static applications. In this work, a novel admission-control-based dynamic query tree (ACDQT) protocol is proposed for fast-moving tag identification. In ACDQT, two main strategies are developed, i.e., multi-round admission control (MRAC) and dynamic query tree recognition (DQTR). In MRAC, the reading process of multiple rounds is analyzed, and the number of admitted tags in each round is optimized. Thus, the tag lost ratio is guaranteed, and the identification process can be effectively accelerated. In DQTR, colliding tags are grouped into multiple subsets with the help of consecutive colliding bits in tag responses. By constructing a dynamic query tree, the number of collision slots is greatly reduced, and the identification efficiency in a single round is improved significantly. With MRAC and DQTR, ACDQT can support higher tag flow rate in mobile systems than existing works. Both theoretical analyses and simulation results are presented to demonstrate the effectiveness of ACDQT.