TY - GEN
T1 - A distributed prioritized multiple access scheme for Ad Hoc networks using time-frequency hopping communications
AU - Zhang, Ruonan
AU - Li, Miao
AU - Cai, Lin
AU - Li, Bin
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/9/9
Y1 - 2016/9/9
N2 - In the time-frequency hopping (TFH) communications, a terminal transmits data at pseudo-random time slots and carrier frequencies, leading to high security against eavesdropping and anti-interference capability. However, in an ad hoc network using the TFH communications, it is challenging to coordinate stations in a distributed manner to share the time/frequency resources, avoid collision, and provide service differentiation. In this paper, we propose a distributed, prioritized multiple access control (MAC) protocol for TFH-based ad hoc networks, named TFH-MAC. In this scheme, the channel occupancy ratio (COR) is introduced to indicate the transmission of stations in a matrix of time-frequency resource blocks. By assigning different predetermined COR thresholds and contention window sizes to traffic classes, the priorities in channel access can be provided. Furthermore, the low-complexity random linear coding (RLC) is employed to repair frames from time-frequency spread segments with partial collision. In particular, the segments correctly received in previous transmissions can be combined with newly successfully received segments for decoding. Thus, the transmission efficiency is increased. An analytical model using mean value analysis is proposed to study the performance of saturated TFH-MAC theoretically, and the transmission probability, collision probability, throughout, and frame service time are derived. Extensive simulation results have verified the analytical model and demonstrated the optimal traffic load and resource matrix dimension to maximize the network throughput.
AB - In the time-frequency hopping (TFH) communications, a terminal transmits data at pseudo-random time slots and carrier frequencies, leading to high security against eavesdropping and anti-interference capability. However, in an ad hoc network using the TFH communications, it is challenging to coordinate stations in a distributed manner to share the time/frequency resources, avoid collision, and provide service differentiation. In this paper, we propose a distributed, prioritized multiple access control (MAC) protocol for TFH-based ad hoc networks, named TFH-MAC. In this scheme, the channel occupancy ratio (COR) is introduced to indicate the transmission of stations in a matrix of time-frequency resource blocks. By assigning different predetermined COR thresholds and contention window sizes to traffic classes, the priorities in channel access can be provided. Furthermore, the low-complexity random linear coding (RLC) is employed to repair frames from time-frequency spread segments with partial collision. In particular, the segments correctly received in previous transmissions can be combined with newly successfully received segments for decoding. Thus, the transmission efficiency is increased. An analytical model using mean value analysis is proposed to study the performance of saturated TFH-MAC theoretically, and the transmission probability, collision probability, throughout, and frame service time are derived. Extensive simulation results have verified the analytical model and demonstrated the optimal traffic load and resource matrix dimension to maximize the network throughput.
KW - ad hoc networks
KW - mean value analysis
KW - media access control
KW - service differentiation
KW - time-frequency hopping communications
UR - http://www.scopus.com/inward/record.url?scp=84991200662&partnerID=8YFLogxK
U2 - 10.1109/NaNA.2016.88
DO - 10.1109/NaNA.2016.88
M3 - 会议稿件
AN - SCOPUS:84991200662
T3 - Proceedings - 2016 International Conference on Networking and Network Applications, NaNA 2016
SP - 41
EP - 47
BT - Proceedings - 2016 International Conference on Networking and Network Applications, NaNA 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 International Conference on Networking and Network Applications, NaNA 2016
Y2 - 23 July 2016 through 25 July 2016
ER -