Random Access: Packet-Based or Connection-Based?

被引:17
|
作者
Gao, Yayu [1 ]
Dai, Lin [2 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Hubei, Peoples R China
[2] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Random access; packet-based; connection-based; grant-free; grant-based; effective throughput; machine-to-machine (M2M) communications; SENSE MULTIPLE-ACCESS; INTERACTING QUEUES; PERSISTENT CSMA; STABILITY; THROUGHPUT; DELAY; PROTOCOLS; INTERNET;
D O I
10.1109/TWC.2019.2906596
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Different from the conventional packet-based random access schemes where each data packet needs to contend for channel access, with connection-based random access, a connection is first established before data packet transmission. Despite the consensus that there exists a critical threshold of the data packet transmission time, only above which establishing a connection is beneficial, characterization of such a threshold has received little attention. In this paper, a comparative study will be presented on the optimal throughput performance of the packet-based random access and the connection-based random access to characterize criteria for beneficial connection establishment. Based on a unified channel-centric model, explicit expressions of the maximum effective throughput are obtained for both packet-based and connection-based Aloha and Carrier Sense Multiple Access (CSMA). The analysis shows that whether connection establishment is beneficial crucially depends on the sensing capability of nodes. The threshold of data packet transmission time with Aloha is found to be much lower than that with CSMA, indicating that the throughput gain brought by connection establishment is more significant when sensing is absent. The analysis sheds important light on the access design of machine-to-machine (M2M) communications.
引用
收藏
页码:2664 / 2678
页数:15
相关论文
共 50 条
  • [1] Timely Random Access: Packet-based or Connection-based?
    Feng, Jian
    Pan, Haoyuan
    Chan, Tse-Tin
    2023 IEEE 98TH VEHICULAR TECHNOLOGY CONFERENCE, VTC2023-FALL, 2023,
  • [2] Low-power timely random access: Packet-based or connection-based?
    Chan, Tse-Tin
    Feng, Jian
    Pan, Haoyuan
    COMPUTER COMMUNICATIONS, 2024, 222 : 108 - 117
  • [3] Energy-Aware Random Access Networks: Connection-Based Versus Packet-Based
    Yuan, Anshan
    Zhao, Fangming
    Sun, Xinghua
    IEEE COMMUNICATIONS LETTERS, 2024, 28 (09) : 2216 - 2220
  • [4] Packet-Based Preamble Design for Random Access in Massive IoT Communication Systems
    Zou, Jun
    Yu, Hai
    Miao, Weiwei
    Jiang, Chengling
    IEEE ACCESS, 2017, 5 : 11759 - 11767
  • [5] Packet-based control
    Georgiev, D
    Tilbury, DM
    PROCEEDINGS OF THE 2004 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2004, : 329 - 336
  • [6] Packet-based scheduling for ATM networks based on comparing a packet-based queue and a virtual queue
    Nabeshima, M
    IEICE TRANSACTIONS ON COMMUNICATIONS, 1999, E82B (06) : 958 - 961
  • [7] Packet-based scheduling for ATM networks based on comparing a packet-based queue and a virtual queue
    NTT Network Service Systems Lab, Musashino-shi, Japan
    IEICE Trans Commun, 6 (958-961):
  • [8] SIMPLIFYING CONNECTION-BASED COMMUNICATION
    HINRICHS, S
    IEEE PARALLEL & DISTRIBUTED TECHNOLOGY, 1995, 3 (01): : 25 - 36
  • [9] Connection-based packet discarding scheme for best effort services and its evaluation
    Tode, H
    Yotsui, S
    Ikeda, H
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2000, E83B (12) : 2685 - 2693
  • [10] A Connection-based Router for FPGAs
    Vansteenkiste, Elias
    Bruneel, Karel
    Stroobandt, Dirk
    PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (FPT), 2013, : 326 - 329