Channel state dependent resource scheduling for wireless message transport with framed ALOHA-reservation access protocol

被引:0
|
作者
Inoue, M [1 ]
机构
[1] Minist Posts & Telecommun, Commun Res Lab, Yokosuka, Kanagawa 2390847, Japan
关键词
resource scheduling; channel state information; burst error; access protocol;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Channel-state-dependent (CSD) radio-resource scheduling algorithms for wireless message transport using a framed ALOHA-reservation access protocol are presented. In future wireless systems that provide Mbps-class high-speed wireless links using high frequencies, burst packet errors, which last a certain number of packets in time, would cause serious performance degradation. CSD resource scheduling algorithms utilize channel-state information for increasing overall throughput. These algorithms were comparatively evaluated in terms of aver age allocation plus transfer delay, average throughput., variance in throughput, and utilization of resources. Computer simulation results showed that the CSD mechanism has a good effect, especially on equal sharing (ES)-based algorithms, and also CSD-ES provides low allocation plus transfer delay, high average throughput, low variance in throughput, and efficient utilization of radio resources.
引用
收藏
页码:1338 / 1346
页数:9
相关论文
共 3 条
  • [1] Optimal channel-aware ALOHA protocol for random access in WLANs with multipacket reception and decentralized channel state information
    Ngo, Minh Hanh
    Krishnamurthy, Vikram
    Tong, Lang
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (06) : 2575 - 2588
  • [2] Using channel state dependent packet scheduling to improve TCPthroughput over wireless LANs
    Pravin Bhagwat
    Partha Bhattacharya
    Arvind Krishna
    Satish K. Tripathi
    Wireless Networks, 1997, 3 : 91 - 102
  • [3] Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs
    Bhagwat, Pravin
    Bhattacharya, Partha
    Krishna, Arvind
    Tripathi, Satish K.
    WIRELESS NETWORKS, 1997, 3 (01) : 91 - 102