Soft Reservation Multiple Access with Priority Assignment
( S W P A ) : A Novel MAC Protocol for QoS-Guaranteed
Integrated Services in Mobile Ad-Hoc Networks’
Chang Wook Ahn*, C h u g Gu Kang*, and You Ze Cho**
* School of Electrical Engineering, Korea University
#1-5 Ka, Anam-dong, Sungbuk-ku, Seoul 136-701, KOREA
** School of Electrical Engineering, Kyungpook National University
Sangyukdong, BukgqTaegu 702-701, KOREA
E-mail: cc&ana@mail.korea.ac.kr
Absrruct - A new medium access control (MAC)protocol Soft -
Reservation Multiple Access with Priority Assignment (SRMAPA)
-
protoeol is introduced for supporting the integrated services of
real-time and non-real-time applications in mobile ad-hoc networks.
The SRMAPA protocol allows the distributed nodes to contend for
and reserve time slots with a RTS/CTS-like “collision-avoidance”
handshake and “soft reservation” mechanism augmented with
distributed and dynamic access priority control, which virtually
achieves capability of the distributed scheduling to guarantee the
QoS requirements of the integrated services. We have
demonstrated via simulation studies that the multiplexinggain can
be significantly improved without much compromising the system
complexity. We also have shown that the proposed back-off
mechanism designed for the delay-constrainedservices is useful for
further improving the channel utilization.
I. INTRODUCTION
Mobile ad-hoc networks are the multi-hop wireless packet
networks in which all nodes cooperatively maintain network
connectivity without aid of any infrastructure networks. In
other words, all nodes in the mobile ad-hoc networks can be
mobile and communicate with one another either directly or
through intermediate nodes with no fixed infkstructure. Since
nodes in the mobile ad-hoc networks communicate via multi-
hop radio, they suffer from the well-known hidden-texminal
problem (HTP) and less well-known exposed-terminal problem
(ETP), which severely affect the channel utilization.
There have been the numerous medium access control
(MAC) protocols that attempted to solve the HTP and ETP
problems. In addition to the Carrier Sensing Multiple Access
with Collision Avoidance (CSMNCA) scheme [l], many of
those including Busy Tone Multiple Access (BTMA) [2],
Multiple Access with Collision Avoidance (MACA) [3],
Multiple Access with Collision Avoidance for Wireless
networks (MACAW) [4], and Floor Acquisition Multiple
Access (FAMA) [5] are developed. Although these protocols
are considered as useful solutions against the conventional HTP
and ETP, they still suffer from the different types of HTP and
ETP [6]. Some different types of protocols, including Dual
Busy Tone Multiple Access (DBTMA) [7l, Multiple Access
with Collision Avoidance with Piggyback Reservation
(MACAPR) [SI are also developed as the advanced
technologies which are considered as an excellent solution to
the HTP and ETP.
We note that all the aforementioned protocols are based on
the totally asynchronous approach and thus, the network-wide
common frame structure to coordinate the medium access
among independent nodes is not defined. In these approaches,
’ This work was supported by grant no. 1999-2-303-004-3from the interdisciplinaryresearch program of the KOSEF.
0-7803-6507-0/00/$10.00 02000 IEEE
the battery power becomes wasteful and furthermore, the
integrated services cannot be efficiently supportd. So, several
authors have proposed the MAC protocols of synchronous
version to circumvent the disadvantages inherent in the
asynchronous approach. Examples of such protocols include
Five Phase Reservation Protocol (FPRP) [9], Hop Reservation
Multiple Access (HRMA) [lo], and Collision Avoidance Time
Allocation (CATA) [111. In these approaches, the HTP can be
handled by the RTS/CTS-like “collision-avoidance”
handshakes as in the asynchronous approach while the
exposed-terminal does not cause any problem.
While many years ago, most of researchers focused on the
design of MAC protocol to support the data services only,
recent developments have indicated the need for mobile ad-hoc
networks to support the integrated services, including both real-
time and non-real-time services [12]. Some of the
aforementioned protocols are based on a reservation scheme [S-
111 to support real-time applications. More specifically, once a
node succeeds in slot reservation, a transmitter can transmit
collision-free data packets on the reserved time slots until the
reservation is terminated. Especially under the integrated
service applications, however, most of these protocols do not
provide any means to guarantee the quality of service (QoS) in
an absolute manner. Such a limit is mainly attributed to the fact
that there is no proper means to realize the dynamic slot
reservation on demand without any centralized controller in the
mobile ad-hoc network, as opposed to the infiastmcture
network in which the radio resource can be allocated to meet
the QoS requirements with a proper mechanism of packet
scheduling if all nodes can successfully exchange the control
information with the centralized station. This issue becomes
more complicated for the integrated service applications,
including both real-time and non-real-time sessions. Up until
now, [121 is one of a few ideas that address this issue in detail.
A new medium access control (MAC) protocol - Soft
Reservation Multiple Access with Priority Assignment
(SRMAPA) protocol - is introduced for supporting the
integrated services of voice and data applications in mobile ad-
hoc networks. A main objective of this protocol is provision of
a means to guarantee the QoS requirements for the real time
services in a flexible and simple manner while maximizing the
statistical multiplexing gain in the integrated service
applications. The SRMAPA protocol adopts a unique, yet
simple frame structure that allows the distributed nodes to
contend for and reserve for time slots with a RTSICTS-like
handshake and soft reservation mechanism. Here, “soft
reservation” is a unique concept that allows for any urgent node
942 VTC 2000
of real-time application to snap the radio resource fiom other
node of the non-real-time application on a demand basis and it
plays an essential role of realizing the distributed scheduling
capability in the SRMA/PA protocol.
In the following section, we first discuss the system
architecture and requirement to support the integrated services
in the mobile ad-hoc networks. The proposed SRMA/PA
protocol is described in Section 111, including the frame
structure and operational procedure. Simulation and numerical
results are presented in Section IV to investigate the
performance of the proposed protocol. Finally, our concluding
remarks are presented in Section V.
XI. MOBILE AD-HOC NETWORKS SYSTEM
REQUIREMENTFOR INTEGRATED SERVICES
We consider a typical architecture of self-organizing multi-
hop wireless packet networks (mobile ad-hoc networks) in
which all mobile terminals (nodes) cooperatively maintain
network connectivity with each other. To facilitate the medium
access scheme for integrated services in mobile ad-hoc
networks, the following requirements must be taken into
consideration [121:
To handle hidden- and exposed- terminal problems
To deal with shadowing problem
0 To realize statistical multiplexing in a fully distributed
manner
0 To guarantee the QoS requirement with no centralized
station
The immediate problem in designing a MAC protocol for a
mobile ad-hoc networks is the existence of hidden and exposed
terminals. In general, the HTPiETP can be handled by the
simple RTS-CTS-DATA packet exchange using the
corresponding field defined in the h e - b a s e d synchronous
medium access approaches. Since the frequency band of
2.4GHz or 5GHz under consideration for the wireless LANs
has adverse penetration characteristics, the shadowing problem
must be handled by some relay functions between the available
nodes, which form a basis of the multi-hop connectivity in the
mobile ad-hoc network.
As the integrated services have severely different data rate
and traEic characteristics in nature, statistical multiplexing
among these services must be realized to use the wireless
resources efficiently. So a node needs to contend with other
nodes to reserve the slot dynamically without any coordination.
In other words, dynamic slot reservation becomes an essential
element to improve the statistical multiplexing gain among the
various types of service classes with different QoS
requirements. Without a centralized station, however, provision
of QoS to different services must be realized in a fully
distributed manner [12]. In other words, there must be some
distributed control schemes to give the relative urgent data
packet high priority to access the wireless medium. This is a
quite different issue against the infrastructure network in which
the radio resources can be efficiently allocated to meet the QoS
requirements with a proper mechanism of packet scheduling if
all nodes can successfully exchange the control information
with the centralized station. In the mobile ad-hoc networks,
therefore, it must be considered how distributed scheduling can
be realized without solely relying on the control information
from individual node.
111. SRMA/PA PROTOCOL
The SRMA/PA (Soft Reservation Multiple Access with
Priority Assignment) protocol is a TDMA h e - b a s e d MAC
protocol to allocate stations to different time slots in a way that
no collision occur in the mobile ad-hoc network. Its main
design objective is to maximize the statistical multiplexing gain
0-7803-6507-0/00/$10.00 02000 IEEE
while guaranteeing the delay-oriented QoS of the real time
services. In the current design, we consider the integrated
services of voice and data applications. The innovative features
of the S W A protocol include a unique fiame structure and
soft reservation capability to realize the distributed and
dynamic slot scheduling, dynamic & distributed access priority
assignmenthpdate policy, and time-constrained backoff
algorithm.
A . Frame Structure and Soft Reservation
We assume that the radios used are halfduplex and the
physical links are either uni-directional or bi-directional. The
transmission time scale is organized in periodic h e s , each
containing a fixed number of time slots. The SRMAlPA is a
contention-based access scheme with the basic fiame structure
shown in Figure 1. A slot is divided into six different fields:
SYNC, SR (Soft Reservation), RR (Reservation Request), RC
(Reservation Confirm), DS (Data Sending), and ACK fields.
The SYNC field is used for synchronization on a slot basis. The
SR, RR, RC, and ACK fields are intended for the
corresponding control packets while DS field is used for
transmission of data packets. In practice, the DS field should be
much longer than any other fields to minimize the signaling
overhead.
Signaling in the SR field plays a role of setting a busy tone to
clear up the neighbor nodes for collision avoidance, i.e., the
same role as the RTS (Ready-To-Send) [4,11], while indicating
that the corresponding slot is already reserved by some
transmitter. Furthermore, it carries the value of access priority
assigned to the reserved node.
When any idle node becomes active as a new packet anives
in the queue, it attempts to transmit the RR control packet for
reservation request over any idle slot (i.e., SR field indicates
that the slot is not reserved by any node). For the delay-
sensitive voice application, the voice terminals attempt to snap
the slots already reserved by data terminals via RR field when
their priorities are greater than those of data terminals. This is a
concept of “soft reservation,” which has been uniquely adopted
as a means of realizing the distributed scheduling capability in
the SRMA/PA protocol. It is the feature in constrast with the
other protocols such as [ll] and [12], in which any slot
reserved for a particular terminal, even if it has a lower access
priority than other terminals, is maintained until all packets in
the burst are transmitted.
The initial value of the priority level assigned to an
individual node is determined on a basis of the service classes,
e.g., the real time and non-real-time services, in a static manner.
Once the random access attempt becomes successful, the
corresponding slot is reserved solely for the node until its
packet flow (burst) is terminated. The reserved node will be
assigned a prespecified priority, p$R) or p i R ) ,respectively
for voice and data terminals. In general, it is required that
p:R) > p y ) to expedite the slot reservation for the delay-
sensitive voice applications. Whenever the random access fails
due to collision, access priority of the backlogged node is
updated depending on the urgency. A specific policy for
priority assignmenuupdate will be presented in Part B of this
section. The access priority levels given after n* collision are
denoted by p,,(n) and p d ( n ) , respectively for voice and
data terminals.
Depending on whether a terminal has a packet to transmit in
the queue, it can be either in an idle or active state. In the active
state, we consider two different states: access state and reserved
state (see Figure 2). These two states depend on whether a
terminal is backlogged for random access before reservation
or it has already reserved the slot for itself, respectively. When
access priority of the voice terminal in the access state becomes
943 VTC 2000
 larger than that of the data terminal in the reserved state, as
notified via SR field, the corresponding slot is yielded to the
prioritized voice terminal. Towards this end, the access
priorities must be set such that piR)> pv(n) > piR)> p d ( n ) .
In other words, a voice terminal can snap the slots already
reserved by a data terminal whenever it becomes urgent before
the voice packet must be dropped out due to the delay
constraint. This is the soft reservation feature in the S W A
protocol, which forms a basis of realizing the distributed
scheduling mechanism to maximize the statistical multiplexing
gain for the voice/data-integrated services.
Once the reservation request packet is successfully received
over the RR field, the receiver transmits the reservation
confirm packet over the RC field. We note that a role of
signaling on the RC field is similar to that of CTS (Clear-To-
Send) in [4,11]. Basically, RR-RC-DS-ACK exchange
procedure is similar to that in MACAW [4] and it eliminates
the HTP.Meanwhile, one major difference from CATA [111 is
that slot reservation (SR) field in [Ill is used by the receiver
rather than transmitter to set a busy tone and it does not have a
soft reservation feature.
B. Distributed & Dynamic Access Priority Assignmend
Update Policy
To support the integrated services, we define the QoS of real
time and non-real time services in terms of packet loss ratio and
packet transfer delay, respectively. As one of the unique
features in the S W A protocol, we consider distributed and
dynamic access priority assignmenthpdate policy, which
allows for dynamically sharing (reserving) the wireless
resources among all nodes in the same Tx-Rxrange. Figure 2
shows a state transition diagram for the access priority
assignment and update procedure.
When a node in idle state becomes active upon occurrence of
a new packet, transition to access state is made with the initial
access priority assigned ( p i o ) or p r ) ). In that state, the
terminal attempts slot reservation by transmitting the
reservation request packet over the RR field. Upon collision,
the voice or data terminal increases the access priority with the
following update rule:
pv(n+1)=pv(n)+&v, Pv(O)=P$O)
p d ( n + l ) = Pd (n>+&d pd (o)= p r )
9
where Apv and hpd are the incremental access priorities for
the voice and data services, which dynamically reflect their
performance objectives into relative urgency of packet transfer.
We note that the residual lifetime rR for the voice service and
the queue length le are two important variables that can be
used for assessing the relative urgency for the voice and data
services, respectively. Now, the incremental access priorities
are defined as follows:
where rs is the slot duration and a is the scaling
coefficient. To differentiatethe access priority between the real-
time and non-real-time services, the following constraint is
imposed:
pip‘ < pd (n)< piR’ = pi-) < pio) < p v ( n ) < p:R) = p$-)
C. lime-constrained Backof Algorithm & Permission
Probabilities
In spite of using the dynamic access priority assignment/
update policy, a collision on the RR field cannot be completely
avoided among the same type of services with the same priority.
0-7803-6507-0/00/%10.00 02000 IEEE
To avoid the repeated collisions, we employ a binary
exponential backoff algorithm [4] for the non-real-time services.
For the real-time services in the S W A , we consider a
slightly different type of binary exponential backoff algorithm,
which implements a prioritized access to meet the delay
constraint. Towards this end, the backoff window is divided
into two different regions, each one with a length of NB1 and
NB2 , respectively for real-time and non-real-time service
bamc. The sizes of sub-windows, N B ~and N B ,~will be the
design parameters.
Operation of the proposed algorithm is described by the
following procedure. First, every node checks the laxity time
(difference between the maximum allowable access delay and
residual lifetime) of the head-of-line (HOL) packet in the queue,
and if it exceeds Tima slots, one of the NB, slots will be
selected randomly: otherwise, one of the NBz slots will be
selected randomly to transmit the RR control packet. In other
words, if a node is repeatedly collided so as not to make a
reservation within a given time limit ( Tima slots), it is given
an access priority over any other non-urgent nodes. In case that
two or more nodes select the same slot and thus, their packets
are collided again, a new backoff window is specified over the
immediately following slots in which the backlogged nodes
retry the random access.
Since the above backoff mechanism consistently gives a
random access opportunity to the delay-sensitive nodes while
deferring it for the non-urgent nodes, it is an effective policy to
guarantee the stringent QoS requirement of the real-time
services. In this mechanism, the urgency is strictly controlled
by the design parameter Timir, which will directly affect the
system performance along with two other parameters NB,
and N B 2 . In the following section, we will search for the
proper values of these system parameters so as to maximize the
system efficiency. In general, these values will depend on the
W l C load.
In order to ensure the stability of random access over the
available RR field within the given backoff window, the
terminals under contention must be allowed for retransmission
with a given permission probability. Since the access priorities
closely reflect the urgency of packet transfer, the ermission
J 7 .
probabilities used for voice and data services after n colhsion,
&(n) and Pd(n), are specified in terms of them:
where eo) and Pio) are the initial permission probabilities
for voice and data services, respectively (31 general,
P:’) > PF) ). The initial permission probability assigned to an
individual node is determined on a basis of the service classes
in a static manner. Once the initial permission probability is
assigned, the initial priority must be determined so that the
permission probability may not exceed one at any instance of
collision.
.
IV.SIMULATION RESULTS AND ANALYSIS
We have used packet-level computer simulation to evaluate
performance of the proposed protocol. Simulation environment
has been implemented using the stochastic selfdriven discrete-
event models with BONeS (Block Oriented Networks
Simulator) Designer. To highlight the performance
944 VTC 2000
characteristics of the proposed protocol, we have chosen the
CATA protocol [ 111 as a comparative reference, which actually
forms a basis for the SRMA/PA protocol in terms of frame
structure, distributed reservation and handshake mechanism.
Toward the fair comparison, the priority update policy based on
the laxity time for the voice services and the number of packets
in queues for the data services is carried over to the CATA
protocol. Note that the CATA protocol referred in the following
discussion is corresponding to the accordingly modified version
of the original CATA protocol.
A . Simulation Model
To focus on the performance of access mechanism only, we
consider a cluster of the transmitters in a certain coverage area
such that one can hear the other, i.e., all the transmitters are
sharing the same time slot, and the wireless channel is ideal in
the sense that there is no distortion, noise, or any other
interference for packet transmission. The system parameters
used in the simulation are listed in Table 1.
A voice traffic is modeled with a random pattem of ON and
OFF bursts, identified by a “slow” voice activity detector [13].
The ON and OFF periods are assumed to have an exponential
distribution and they are statistically independent of one
another. During ON period only, the voice traffic stream is
generated at a constant bit rate of R, . On the other hand, a
data traffic is modeled by a Bemoulli process such that data
terminals generate a new packet in every slot according to a
Bemoulli experiment with a parameter c d [13]. If there are
N, slots per ftame, the average data rate is given by
Rd = c d R s N , bitdsec. The length of each field is fixed: 4
bytes for SYNC, 3 bytes for SR, RR, RC, and ACK, and 64
bytes for DS.
Voice packets belonging to the real time session are dropped
if not transmitted within 20msec. Meanwhile, data packets
belonging to the non-real-time session are not subject to any
loss as the infinite length of buffer is assumed. The focus of the
current study is to understand the service quality provided by
the proposed protocol while maximizing the multiplexing gain
among the different types of services. To this end, the
performance of main interest includes average voice packet
loss ratio, data packet delay, and channel utilization. Voice
packet loss ratio is defined as the number of voice packets
dropped out of all voice packets generated while data packet
delay is defined as the time between data packets generation
and transmission completion. Channel utilization, on the other
hand, is defined as the average number of slots used for
successful transmission among all the slots in a frame.
B. Simulation Results and Discussion
In Figures 4, 5 , and 6, solid and dotted lines denote the
performance of the SRMARA and CATA protocol, respectively.
In these results, the time-constrained back-off algorithm has not
been employed by the SRMAPA protocol. Figures 4 and 5
respectively show the average voice packet loss ratio and the
data packet delay for the different combination of data and
packet traffic loads offered, subject to 20ms delay constraint for
the voice traffic. In Figure 4, it is shown that a significant
improvement in the loss performance can be achieved by the
SRMAPA protocol. As compared with the CATA protocol,
furthermore, the SRMAPA is not much sensitive to the traffic
load of data traffic offered. It is due to the prioritized dynamic
slot assignment scheme with soft reservation, which allows for
maintaining the voice quality steadily in the SRMAPA
protocol. Assuming that a target value of the packet voice loss
ratio is 0.001, the SRMAPA protocol can support up to nine
voice users at the same time while system capacity of the
CATA protocol is limited to only two users.
0-7803-6507-0/00/$10.00 02000 IEEE
As shown in Figure 5, on the other hand, the SRMMA
protocol is still superior to the CATA protocol in delay
performance of the data traffic except when the system is
overloaded with the voice users. At heavy load of the voice
traffic, data users suffer from the higher delay with SRMAPA
protocol since they have to yield their resources to the urgent
voice users on demand. In other words, a trade-off between the
voice and data performance is expected to some extent.
These observations imply that the S W A protocol has
significantly improved the system capacity of the real-time
service without much compromising the delay performance of
non-real-time service.
Figure 6 examines channel utilization under the different
load offered. As observed in most of the contention-
based MAC protocols, the channel becomes under-utilized as
the traffic load increases. However, channel utilization
performance of the SRMA/PA protocol always outperforms
that of the CATA protocol and it becomes more dramatic as the
traffic load increases.
In Figures 7, 8, and 9, performance improvement achieved
by the time-constrained backoff algorithm (described in Section
111-C) has been assessed for the SRMA/PA protocol. All the
parameters used for obtaining those results are properly
selected by exhaustive search for the different traffic load and
they are summarized in Table 2. Figures 7, 8, and 9 show the
packet loss ratio, data packet delay, and channel utilization
performance respectively, with and without employing the
time-constrained backoff algorithm for the voice traffic. For the
data traffic, a binary exponential backoff algorithm is employed
[4]. Dotted and solid lines denote performance with and
without backoff mechanism, respectively. It is clearly shown
that the proposed backoff mechanism firther improves the
overall performance, amounting to roughly 10% in delay
reduction and 5% in channel utilization. More specifically, one
additional voice user can be supported with the time-
constrained backoff mechanism.
As opposed to observation made in Figure 6, channel
utilization performance of the SRMA/PA protocol is steadily
improved as the number of voice users increase. Its implication
is that the time-constrained backoff algorithm employed in the
S W A protocol may play an essential role of pushing
utilization of the scarce radio resources to its full capacity,
especially at heavy traffic load.
V. CONCLUSIONS
We have proposed here a new type of the distributed MAC
protocol - the Soft Reservation Multiple Access with Priority
Assignment ( S W A ) Protocol - which is a synchronous
version of the MAC protocol with the desirable features of
collision avoidance to eliminate the hidden-terminal and
exposed-terminal problems as well as dynamic slot assignment
to support both real-time and non-real-time services in mobile
ad-hoc networks. The objective of the proposed MAC protocol
is to maximize the statistical multiplexing gain over the
wireless link while guaranteeing the delay requirement of the
real-time service (in particular, variable bit rate voice traffic)
when integrated with the non-real-time data services. Attributes
in the SRMAFA protocol include the soft reservation and
prioritized access control features, which allow for flexible slot
assignment among the distributed nodes so as to virtually
implement the distributed scheduling.
We have demonstrated via simulation studies that the
multiplexing gain can be significantly improved without much
compromising the system complexity. We also have shown that
the proposed backoff mechanism considered for the delay-
constrained service is useful for further improving the channel
utilization.
Our future work will include performance comparison of the
945 VTC 2000
SRMA/PA protocol with the idealized conflict-fkee scheduling Table 1. Simulation Parameters
scheme to investigate its underlying performance limit, and
extension of its applicability to the ATM-based broadband
.. Parainet+
, -
Zr. 1 Notatiolj 1 ~ g h l u e . : 1
wireless network, in which a more flexible means to realize the Channel bit rate I R I 960 kbps
statistical multiplexing capability is required. Transmission rate of voice senice I Rv I 32.0kbps
Transmission rate of data service Rd 28.8kbps
REFERENCES
Frame length 7F 12 Ins
Institute of Electrical and Electronics Engineers, USA.
“Part 1 1 : Wireless LAN Medium Access Control (MAC) Slot duration 7s 1 0.667ms
and Physical Layer (PHY) specifications,” IEEE Std NumberofslotsperTDMAframe I N, I I8 I
802.1 1-1997. ~~

F. A. Tobagi and L. Kleinrock, “Packet Switching in

Maximum tolerable delay for voice traffic D,, 20 ms
Radio Channels: Part I1 - The Hidden Terminal Problem Average duration of talkspurt a, 1000 ms
in Carrier Sense Multiple-Access Modes and Busy-Tone Average duration of silence PV 1350 ms
Solution,” IEEE Transaction on Communications, vol.
COM-23, no. 12, pp. 1417-1433, 1975. Parameter of Bernoulli process
P. Kam, “MACA - A New Channel Access Method for
Packet Radio,” ARRUCRRL Amateur Radio 9*
Computer Networking Conference, pp. 134-140, 1990. Initial pemission prob. for data traffic
V. Bharghavan, A. Demers, S . Shenker, and L. Zhang,
“MACAW A Media Access Protocol for Wireless Scaling coefficient for priority update a 0.1
LAN’s,’’ Proceedings of ACM SIGCOMM’94, pp. 2 12- Initial priority for voice traffic Pv( 0 ) 91
225, 1994.
Chane L. Fullmer and J. J. Garcia-Luna-Aceves, “Floor
Acquisition Multiple Access (FAMA) for packet-radio
Maximumpriorityforvoicetraffic I p:””) I 200 I
networks,” Proceedings of ACM SIGCOMM’95, 1995. Initial priority for data traffic I PY) I 11 I
S . Singh and C. S . Raghavendra, “PAMAS - Power
Maximum priority for data traffic 100
Aware Multi-Access protocol with Signalling for Ad
Hoc Networks,” Number of simulated slots 1,000,000
Zygmunt J. Haas and Jing Deng, “Dual Busy Tone
Multiple Access (DBTMA) - A New Medium Access
Control for Packet Radio Networks,” Proceedings of
ICUPC’98, pp. 973-977, 1998. LF“ 1

C. R. Lin, “Multimedia transport in multihop wireless Slot1 Slot2 Slo13 ... SlotN Sbtl
networks,” IEE Proceedings - Communications, vol. 145,
no. 5, pp. 342-346, October 1998.
C. Zhu and M. Scott Corson, “A Five-Phase Reservation
Protocol (FPRP) for Mobile Ad-Hoc Networks“,
s m c s y a , SR sollncs5”
Proceedings of INFOCOM’98, pp. 322-331, 1998. RR RClirrvrmWRC Rcrcrvnmc“
DS WSmdml ACKMxm**dp”t
Z. Tang and J. J. Garcia-Luna-Aceves, “Hop
Reservation Multiple Access (HpMA) for Ad-Hoc . *
Networks,” Proceedings of MFOCOM’99, pp. 194-201, Figure 1. Frame structure of the SRMAPA protocol
1999.
Z. Tang and J. J. Garcia-Luna-Aceves, “A Protocol for
Topology Dependent Transmission Scheduling in
Wireless Networks,” Proceedings of WCNC’99, pp.
1333-1337, 1999.
B. Xu and B. Walke, “A Multiple Access Protocol for
Ad-Hoc Wireless ATM Multihop Networks,’’
Proceedings of VTC’99, pp. 1 141- 1145,1999.
A. E. Brand and A. H. Aghvami, “Performance of a Joint
CDMMRMA Protocol for Mixed VoiceJData
Transmission for Third Generation Mobile . .-

Communication,” IEEE Joumal on Selected Areas in

Communications, Vol. 14, No. 9, pp. 1698-1707, Figure 2. State transition diagram for priority assignment and
December, 1996. update policy

Table 2. Parameters selected for the time-constrained backoff

Parameters
NBI NB2 Timi,
(# of voice users:# of data-su
(2:5), (2:6), (2:7), (4:5), (4:6) 1 5 1
... I ... ...
(4:7), (6:5), (6:6), (6:7), (85) 3 3 1
(8:6), (8:7), (10:5), (10:6), (10:7) 5 3 5

0-7803-6507-0/00/$10.00 02000 IEEE 946 VTC 2000

 i i A ' ;I
.

10
I

The Number of Voice Usm (Nj

Figure 7. Performance of the S W A protocol with the time-

Figure 4. Voice packet loss ratio vs. the number of voice constrained backoff algorithm: voice packet loss ratio vs. the
users number of voice users

2 10-
2
CI
.
5-

I
2 4 6 8 10
2 4 6 8 10 The Number of Voice Usm (NJ
The Number of Voice Users (Nj

Figure 8. Performance of the S W A protocol with

Figure 5. Data packet delay vs. the number of voice users the time-constrained backoff a l g o r i k data packet
delay vs. the number of voice users

...... .....
1.0,
.. .....
&_.._.A.....
0.9 - 0.90 - ......

..........
.........
.......

0.6-
E 0.65 -
...... .....
0.60:
.....
+._..A .....
0.4
2 4 6 8 10
The Number of Voice Users (Nj

Figure 9. Performance of the SRMA/PA protocol with the

Figure 6. Channel utilization vs. the number of voice users time-constrained backoff algorithm: channel utilization vs. the
number of voice users

0-7803-6507-0/00/$10.00 02000 IEEE 947 VTC 2000