A Distributed Prioritized Multiple Access Scheme
for Ad Hoc Networks Using Time-Frequency
Hopping Communications
Ruonan Zhang
1
,MiaoLi
1
,LinCai
2
,andBinLi
1
1
Northwestern Polytechnical University, Xi’an, Shaanxi, China
2
University of Victoria, Victoria, British Columbia, Canada
Abstract—In the time-frequency h opping (TFH) communica-
tions, a terminal transmits data at pseudo-random time slots
and carrier frequencies, leading to high security against eaves-
dropping and anti-interference capability. However, in an ad
hoc network using the TFH communications, it is challeng-
ing to coordinate stations in a distributed manner to share
the time/frequency resources, avoid collision, and provide ser-
vice 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.
Index Terms: time-frequency hopping communications; media
access control; service differentiation; mean value analysis; ad
hoc networks
I. INTRODUCTION
The time-frequency hopping (TFH) technique has been
widely used in complicated environments such as military
communications [1]. In the TFH communications, terminals
are assigned pseudo-random (PN) time and frequency-hopping
sequences, resulting in good anti-interference ability and com-
munication concealment against eavesdropping. Meanwhile,
a time-frequency hopping pattern can be regarded as a sub-
channel. Th e spreading also creates multiple sub-ch annels in
the joint time-frequency domain and several transmissions can
take place with limited in ter-user interference. If the stream
through a TFH sub-channel has overlap with those in other
subchannels, the information in each individual stream may
be recovered using error correction coding. Hence, the TFH
communications can allow mu ltiple simultaneou s streams and
exploit the multiplexing gain.
However, there are several critical issues to be addressed
while designing wireless a d hoc network based on TFH and
multi-channel (MC) communications. First, the time-frequency
hopping sequences are randomly assigned or generated, the
full orthogonality among spreading patterns is not guaranteed.
A multiple access mechanism should be combined with the
hopping patterns to schedule the transmission/retransmission
of frames and resolve collisions. Second, traffic flows can
be differentiated and p riorities in channel access for different
traffic classes should be provided. Urgent messages and real-
time streams that need to be delivered before hard deadlines
should have higher priority in utilizing the time-frequency
channel resources. On the other hand, the delay-tolerant data
traffic can be served only when there are sufficient idle
channel resources. Third, the TFH pattern generation and
channel access coordination should be performed in a fully
distributed manner. Compared to the centralized mechanisms,
independent TFH and contention-based channel access have
favorable characteristics, such as dynamic self-organization,
easy maintenance, and high scalability.
Inspired by the attractive features and potential benefit of
MC networking, the MC media access control (MC MAC) has
been investigated extensively in recently years. The authors
in [2] proposed a dynamic switching protocol which provided
two interfaces. One interface followed fast hopping and was
primarily for transmission, while the oth er performed slow
hopping and was generally for reception. Wireless nodes
could dynamically switch among channels and did not need a
dedicated control channel for congestion avoidance. For time
division multiple access (TDMA)-based MC MAC, a dynamic
time slot assignment protocol with FH, named unifying slot
assignment protocol (UASP), was proposed in [1]. It was
desinged to ensure the inter-node time synchronization and
adaptation to a self-organized network using FH. In [3], a
new TDMA MAC protocol was proposed for diverse traffic in
hierarchical wireless sensor networks. The quality-of-service
(QoS) provisioning like loss and delay performance was
improved. The authors in [4] designed hopping sequences by
combining multiple difference sets, and proposed a difference-
set-based MC MAC to achieve high system throughput and
low delay by applying the hopping sequences to all users. The
communication channel recommendation MAC (CCR-MAC)
could recommend a better channel according to the channel
usage and topology information [5]. An analytical framework
for the MC cooperative MAC was proposed in [6], which
used two discrete-time Markov chains to separately model
2016 International Conference on Networking and Network Applications
978-1-4673-9803-9/15 $31.00 © 2015 IEEE
DOI 10.1109/NaNA.2016.88
41
2016 International Conference on Networking and Network Applications
978-1-4673-9803-9/15 $31.00 © 2015 IEEE
DOI 10.1109/NaNA.2016.88
41