JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 2151-9617

HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 47

A CDMA Based MAC Protocol for Ad Hoc

Networks with Directional Antennas

Vahid Pourgolzari, Seyed Ali Ghorashi

Abstract—IEEE 802.11 DCF (Distributed Coordination Function) is one of the basic MAC protocols used in wireless ad hoc
networks. The DCF allows nodes to access the medium without any centralized unit and primarily assumes that omni-directional
antennas are used for packet transmission at nodes. One of the main challenges in DCF is silent area which yields to channel
spatial reuse reduction. This problem can be compensated by utilization of directional antennas. However, using directional
antennas itself leads to other problems such as new hidden terminal and deafness problems. In this paper, we propose a new
MAC protocol based on CDMA technique in which directional antennas are used. In our proposed multichannel protocol,
channels are specified by CDMA codes. One of the channels which is common in the network and called control channel is
used for RTS/CTS handshaking and other channels are used for data transmission. In the proposed protocol fewer codes are
used compaired to other CDMA based protocols and simulation results in different network topologies show that network
throughput is improved and spatial reuse of wireless channel is higher compaired to 802.11 DCF, DMAC (basic Directional
MAC) and conventional CDMA based MAC protocols based on IEEE 802.11 DCF.

Keywords— Ad hoc networks, directional antennas, medium access control, CDMA.

——————————  ——————————

1 INTRODUCTION

W ireless ad hoc networks include a number of nodes

spread out in an area which are connected by wire-
less channels without any infrastructure. Tradi-
tional MAC protocols such as IEEE 802.11 are used for
several years for controlling of multiple access at such
networks. IEEE 802.11 MAC is a carrier sense multiple
accesses protocol with collision avoidance (CSMA/CA)
mechanism. This protocol is based on utilization of omni-
directional antennas for packet transmission. At this pro-
tocol, while two nodes are communicating with each oth-
er, the vicinity neighbor nodes have to stay silent. Due to
the silent area created around the communicating nodes,
using this protocol wastes a large portion of channel ca-
pacity and leads to low throughput in the network. Direc-
tional antennas are proposed in ad hoc networks to com-
pensate this problem. Using directional antennas allows
several nodes communicate with each other simulta-
neously without interfering; since packets are sent in a
particular direction, a neighbor node at the same direc-
tion may only has to defer its transmission and other
beams of nodes are still permitted to transmit without
making interference. Thus, the spatial reuse of wireless
————————————————
 Vahid Pourgolzari is with the Cognitive Telecommunications Research
Group, Department of Electrical Engineering, Shahid Beheshti University
G.C., Evin 1983963113, Tehran, IRAN.
 Seyed Ali Ghorashi is Assistant Professor of the Department of Electrical
Engineering, Cognitive Telecommunications Research Group, Shahid Be-
heshti University G.C., Evin 1983963113, Tehran, IRAN.
channel increases. Additionally, directional antennas
have greater transmission range and higher gain than
omnidirectional antennas. However, directional antennas
in MAC protocols face new challenges including new
hidden terminal and deafness problems. These problems
basically occur when a transmitter is not aware of the
neighbor node’s activities and is investigated extensively
in [3].
Another method to combat the channel capacity was-
tage problem in common MAC protocols with omnidirec-
tional antennas, is based on Code Division Multiple
Access (CDMA) techniques. Multichannel MAC protocols
may use CDMA or FDMA techniques to improve the spa-
tial reuse of wireless channel. Using CDMA technique in
order to specify different channels, spreading codes are
used and the antennas are omnidirectional. The main
challenges in this case are code allocation mechanism and
the number of codes used in the network which may lead
to complexities in designing MAC protocols.
In this paper we propose a new multichannel MAC
protocol for ad hoc networks using directional antennas
based on CDMA techniques. We improve the network
performance in term of throughput and try to eliminate
the problems caused by using directional antennas. In the
proposed MAC protocol, wireless channel is divided into
sub channels by using CDMA codes. RTS/CTS packets
are sent on a common channel (code) called control chan-
nel, while data transmission occurs on different data
channels. Channel reservation for each transmission is
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
done on the control channel. Neighbor nodes monitor the
control channel which is common in the whole network,
and identify the code used in a communication between
two nodes. Our main idea is based on using fewer codes
and a simple way for code allocation in the network. We
focus on improving the spatial reuse of wireless channel
and try to obtain the maximum throughput, using mini-
mum possible number of codes. By extensive simulations
we show that proposed protocol outperforms traditional
MAC protocols using directional antennas, DMAC, IEEE
802.11 DCF, and a new CDMA based MAC protocol pro-
posed in [10] in terms of throughput and special reuse,
particularly in condensed networks.
The rest of the paper is organized as follow: In sec-
tion 2 the related works about directional and CDMA
based MAC protocols are reviwed and a brief descrip-
tion of IEEE 802.11 DCF and basic directional MAC
protocols are discussed. In section 3, the proposed
multichannel MAC protocol is described and simula-
tion results are explained in section 4. Then, section 5
concludes the paper.
2 RELATED WORKS
Using directional antennas in ad hoc networks has
been investigated in many researches. Nasipuri et al. in
[1] proposed a MAC protocol using directional antennas
in IEEE 802.11. In their method, the gain of directional
and omnidirectional antennas is the same and also
RTS/CTS packets are transmitted omnidirectionally. In
[2], Ko et al. offer another MAC protocol using directional
antennas in which RTS packet is transmitted directionally
and CTS is sent in omni mode. In their proposed protocol,
the transmitter knows the receiver’s location. Takai et al.
[3] are proposed a directional virtual carrier sensing me-
chanism which uses DNAV mechanism in which direc-
tional RTS and CTS transmission is used. In [4] choud-
hury et al. offer DMAC protocol in which all packets are
transmitted directionally. They also propose directional
multihop RTS transmission. New hidden terminal and
deafness problems are studied extremely in their paper.
ToneDMAC protocol is proposed in [5] to handle the
deafness problem. In this protocol, control and data
channels are used and RTS, CTS, data, and ACK packets
are transmitted on the data channel. Control channel is
used for tones assignment. Tones must be transmitted in
a allocated control channel as well as a data channel that
may lead to complexity in the protocol. Korakis et al. in
[6] propose CDR-MAC protocol in which the RTS is
transmitted directionally sequentially in a circular man-
ner until it scans all the area around the transmitter, but it
suffer from the large amount of overhead due to circular
transmission of packets. In [7], a code allocation scheme is
proposed for CDMA based radio networks in which
codes are assigned to each transceiver pair. According to
this mechanism, each node has to maintain a list of
neighbours codes. Fantacci et al. propose a CDMA based
MAC protocol in [8] in which data is transmitted with the
receiver’s code. The major disadvantage of this kind of proto-
cols is that they cannot support multicast services [10]. A dual
48
reservation MAC protocol with (N+2) codes (N codes for
data, one common code for control messages and one
code for broadcasting) is proposed in [9]. The code is allo-
cated to each node after compromise using control pack-
ets. In [10] a new CDMA-Based MAC protocol with (N+1)
codes is proposed in which the number of codes to have a
pairwise transmission in the network are at least equal to
half of the number of nodes. Chan et al. in [12] offer a
MAC protocol based on IEEE 802.11 DCF. They use DS
CDMA technique and nodes can access the channel, using
three states defaind for channel. They eliminate the interfe-
rence using limited simultaneous communication between
nodes.
2.1 IEEE 802.11 DCF
IEEE 802.11 DCF (Distributed Coordination Function)
is a carrier sense based multiple access method with colli-
sion avoidance mechanism. When a packet is ready to be
sent, transmitter has to listen to channel before sending its
packet. If the channel is idle, transmitter waits for a time
interval called DIFS and chooses a random backoff inter-
val. Backoff interval is used for channel contention resolu-
tion and is selected from a range of [0, CW] where CW is
the contention window. After waiting for DIFS, the node
stars to decrement its backoff counter slot by slot. If the
channel becomes busy while backoff process is in
progress, the backoff counting is stopped. When channel
is idle once again, the node restarts counting after a DIFS
time from its previous stopped value. When the counter
value reaches 0, the node sends its packet.
In order to prevent hidden terminal problem before
sending DATA and ACK packets, 802.11 uses RTS and
CTS handshaking mechanism. With this scheme, trans-
mitter informs its intended receiver and the neighbor
nodes about ongoing transmission. RTS, CTS, and DATA
packets also include the remaining time value of ongoing
transmission. When a neighbor node receives any of these
packets, it has to avoid starting new transmission during
this time period. This is called virtual carrier sensing and
each node has a variable called NAV (Network Allocation
Vector). When a node receives any of RTS, CTS and DA-
TA packets, it updates the value of NAV with the remain-
ing time value particularized in the received packet. Col-
lision is detected when transmitter doesn’t receive CTS
packet. If a collision is detected, the node doubles its CW
and chooses a new backoff interval to restart its transmis-
sion. On each collision, CW is doubled until reaches its
maximum threshold, called CWmax. Fig. 1 summarizes
part of IEEE 802.11 MAC protocol. This figure represents
the MAC process in a network of three nodes. Sender
node has a frame to send. As the medium is free, it can
transmit its RTS frame after a DIFS, which is answered by
the CTS from B after a SIFS. The sender receives CTS from
the receiver and after a SIFS sends its data packet. The
receiver receives the data packet successfully and re-
sponds with ACK after SIFS and communication finishes,
successfully. Neighbor nodes also receive RTS/CTS pack-
ets. If any of these nodes would like to start transmission
with one of the transmitter or receiver, it has to defer its
transmission and update its NAV table with the time spe-
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
cified in RTS/CTS packets. After finishing the ongoing
transmission, a random backoff interval is selected after a
DIFS time and then, the neighbor node sends its packet.
Fig. 1. Channel access mechanism in IEEE 802.11 MAC protocol.
2.2 Directional MAC Protocol
Directional MAC or DMAC protocol is used in ad hoc
networks in which directional antennas are used for data
transmission. In this protocol, the information about vi-
cinity nodes is received from upper layers, while receiv-
ing the packet to be transmitted. In this protocol, packets
are transmitted directionally but listening to the channel
is done omnidirectionally.Sending RTS/CTS omnidirec-
tionally, reduces the communication range of directional
antennas. Also, omnidirectional transmission of RTS/CTS
packets may decrease the spatial reuse of wireless chan-
nel. Directional transmission of RTS/CTS packets allows
for long distance transmission but may cause deafness
problem. Fig. 2 shows a topology in which omnidirec-
tionally and directionally transmission of RTS/CTS pack-
ets are compared. Suppose that A and B are communicat-
ing with each other while RTS/CTS packets are sent om-
nidirectionally. If C has a packet to send and starts to
communicate with E, for example, it may interfere with
B’s reception. In order to avoid this situation, C has to
defer its transmission. Now, assume that RTS/CTS pack-
ets are sent directionally. E is going to start a communica-
tion with A while A is transmitting to B, therefore E sends
an RTS to A. Node A has formed its beam towards B’s
direction, therefore, A doesn’t receive E’s RTS and it
doesn’t reply with a CTS, consequently. This is an exam-
ple of deafness problem and it occurs in DMAC protocol
when RTS/CTS packets are transmitted directionally.
Fig. 2. Comparison between omnidirectionally and directionally
transmission of RTS/CTS packets.
Similar to 802.11, when the sender finds that the channel
© 2011 Journal of Computing Press, NY, USA, ISSN 2151-9617
http://sites.google.com/site/journalofcomputing/
49
is idle to transmit, using a specified beam, it chooses a
random backoff value. When the backoff counter reaches
zero, RTS packet is sent to the receiver. The receiver lis-
tens to the channel in its omnidirectional mode and de-
termines the direction of arrival of receiving signal.
Neighbor nodes that receive the RTS, update their DNAV
tables [4] to defer their transmition at that direction. The
receiver determines its direction of arrival while receives
the RTS, in order to reply the CTS at that direction. Then
the receiver checks the DNAV table to see if it is safe, if
the channel remains free during SIFS time interval, the
CTS is transmitted to sender. The sender waits for the
CTS and if CTS is received, it initiates the transmission of
DATA. The receiver transmits an ACK on receiving the
DATA, successfully. Other nodes that receive one of these
packets, update their DNAV table, accordingly. To de-
scribe the channel capacity wastage due to utilizing direc-
tional antennas, we use the linear scenario shown in Fig. 3
[3]. In this scenario, nodes A, B, and C are transmitter
nodes and nodes D, E, and F are the receiver ones. We
assume that all nodes share the same channel and the
sensing area is also the same. Using directional MAC pro-
tocol, just one of the three transmissions can occur and
the network losses a high capacity of wireless channel.
Fig. 3. Example of linear topology to describe channel capacity was-
tage using directional antennas (first scenario).
3 PROPOSED PROTOCOL
In this paper, we propose a new CDMA based MAC
protocol, for ad hoc networks in which directional anten-
nas are used. In our protocol similar to DMAC, each node
has an antenna with M beams. We assume there are M+1
codes (or channels) in the network; a common code is
used for RTS and CTS handshaking between nodes, and
other M codes are used for data and ACK transmission.
Similar to IEEE 802.11, RTS/CTS handshaking occurs in
omnidirectional mode, and data and ACK packets are
transmitted in directional mode. In our proposed proto-
col, we assume that each node knows its neighbors’ loca-
tions as well as their beam number in which communica-
tion to each neighbor takes place. Such information can
receive from upper layers. As in DMAC protocol, the
DNAV variable at each node, (Network Allocation Vector
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
that involves the duration of ongoing transmission), will
be updated at each transmission. Here, because of send-
ing RTS/CTS packets omnidirectionally in a common
code, we do not have deafness problem.
3.1 Information Table
At each node the information of neighbor nodes are
stored in a table called information table [6]. Each row in
the information table of a node comprises four fields. The
first field is the neighbor’s ID. The second one is the beam
number of itself and the third one contains neighbors
beam number by which this beam of the node and its
neighbor may communicate. The last field in the table is
the code number of the received packet from its neighbor
(if it has any). RTS/CTS packets include the code number
which is going to be used for the ongoing data transmis-
sion. When a node transmits an RTS or CTS to another
station, the frame header comprises the corresponding
beam pairs. Each neighbor node that receives one of these
frames checks out its information table to find the beams
through which it can receive packets from two communi-
cating nodes. If one of these beams coincides with the
respective beam of the RTS and CTS frames, then the
neighbor defers its transmission by this beam using the
same code. The code number field in the information ta-
ble of each node is updated whenever the neighbor node
receives a control packet with a specified code number of
an ongoing transmission. Fig. 3 shows an example of de-
scribed mechanism. Node A is communicating with B
using the code No.1, and nodes C and D are neighbor
nodes that receive the control packets from A and B.
Nodes D and B know the beam numbers of both A and B
by which they communicate with each other. Their in-
formation table is shown in Table 1.
Fig. 3. An example of two communicating nodes and neighbor’s
information table.
TABLE 1
INFORMATION TABLES OF NODES C AND D IN FIG. 3
Node C
Neighbor Node Node’s Beam Neighbor’s Beam Code number
A 1 3 1
B 3 1 1
50
Node D
Neighbor Node Node’s Beam Neighbor’s Beam Code number
A 4 2 1
B 3 1 1
For example as for C’s table, A and C can communicate
with beams 3 and 1 respectively. Node C receives the
code No. 1 from A with mentioned beams.
3.2 RTS/CTS Transmission
Each node has to check its information table before
starts any communication in a specified direction. If the
code number field is set to 0, node can send its packet
using code No.1. If it’s set to n (the number of received
code from two other nodes), the node must use the
(n+1)th code in its RTS to prevent collision at that direc-
tion. When the receiver receives the RTS packet, it checks
the received code number at the RTS. The receiver checks
out its information table in a similar way. If it hasn’t re-
ceived any RTS/CTS packet at that direction, it is possible
to use this code and CTS packet which includes the same
code that is placed into RTS is sent to the transmitter to
start data transmission. If the code inserted in the RTS
packet is not allowed to be used by the receiver, the re-
ceiver replies its CTS packet with another suitable code
number. While a neighbor node receives the Mth code in
which M is the number of beams, the next permissible
code for this neighbor node is the first code if it has any
packet to transmit. The advantage of this process is to
allow neighbor nodes to be informed about codes used in
the round neighbor nodes. Therefore, neighbor nodes
avoid using the same code in one direction. With this ar-
chitecture, the channel is reserved for ongoing data
transmission while RTS/CTS handshaking occurs over
the common code. The code number field is reset after
finishing the time duration specified in the DNAV varia-
ble. It is set with the last received control packet. A code
allocation example is shown in Fig. 4.
Fig. 4. An example of code allocation
Fig. 4 shows an example of code assignment in a topology
with 5 nodes. Suppose that A and B are communicating
with each other using code No.3. Nodes C, D and E can
hear this communication. While communication between
A and B is in progress, C can’t use code No. 3 in its first
beam if has a packet to transmit at that direction. With the
same way, D and E cannot communicate using the same
code with forth and first beam for D and the forth beam
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 51

for E. Now assume that D is going to send data to C while municate pairwise. The simulation parameters are shown
the communication between A and B is emerging. The in Table 3.
communication between nodes D and C is performed
using beams 4 and 1, respectively. They must use the
code No. 4 to communicate at this direction. Note that
node E first receives CTS from B and knows their code
number and then receives RTS from D. Now if node E is
going to send data, using its beam No. 4 while both nodes
A and B, and C and D are communicating with each oth-
er, it must put the code No.1 in its RTS packet to commu-
nicate at that direction. Table 2 shows the comparison
between the proposed protocol and Directional MAC pro-
tocol. The tables show the beam numbers of three neigh-
bor nodes by which they are allowed to transmit at the
same time with A and B. Notice that by using IEEE 802.11
while communication between A and B is in progress, all
three neighbor nodes must stay in silent mode. For exam-
ple using directional MAC node C cannot use its first
beam while communication between A and B is in
progress. D must defer any transmission with its first and
forth beam as well.
TABLE 2
COMPARISON BETWEEN THE PROPOSED PROTOCOL AND DI-
RECTIONAL MAC PROTOCOL IN THE EXAMPLE OF FIG. 4

Fig. 5. Simulation scenarios.

TABLE 3
SIMULATION PARAMETERS
Parameter Value
Time slot 9µs
RTS length 20 bytes
CTS length 14 bytes
Data length 1024 bytes
ACK length 14 bytes
DIFS 34µs
SIFS 16µs
Sending Rate 5.5 Mbps (variable)
4 PERFORMANCE EVALUATION
Packet Arrival rate 100~200 Packets/s (variable)
In this section, we evaluate our proposed protocol in
Simulation Time 180 s
comparison with Directional MAC, IEEE 802.11 DCF, and
a new CDMA based MAC technique proposed in [10]. In
our simulations, we assume that the channel is error free, 4.1 Scenario (a)
the propagation delay is zero, nodes in the network are This scenario is a linear topology in which λ is set to 300
all in the same sensing area. We also assume that packets packet/s and transmitter nodes, A and C communicate
arrive in a Poisson process with packet arrival rate of λ. with B and D, respectively and we assume that nodes are
The measured metric is the aggregate throughput of the in their coverage range. Fig. 6 shows the aggregate
network and. we consider four topologies. The first three throughputs versus sending rate in the scenario (a). While
considered topologies are shown in Fig. 5. The first one is one of A or C obtains the channel to communicate with B
a linear topology which also shows hidden terminal prob- or D, the rest of nodes defer their transmission. This hap-
lem due to asymmetry in gain [4]. The second scenario is pens when we use DMAC and 802.11 DCF protocols, but
a topology with 6 nodes to describe spatial reuse of wire- by using the proposed protocol as well as the considered
less channel using IEEE 802.11 DCF. The third scenario is CDMA based MAC protocol, we get similar results as
a topology with 4 nodes to show the spatial reuse of they both use only two channels and nodes A and C can
channel using DMAC and IEEE 802.11 DCF. the fourth communicate simultaneously without interfering. As-
scenario is a random scenario in which nodes are com- sume that node A is far enough from C and D, therefore it
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 52

cannot sense the communication between nodes C and D

for a similar reason. If A has a packet to send to B since A
cannot sense the existing transmission, A senses the
channel as idle and starts to transmit. When DMAC pro-
tocol is used, a collision happens at D due to the fact that
D is receiving data with high directional gain with a beam
directed toward C and also A. Using our protocol, while
C and D are communicating with each other, this never
happens. Note that RTS/CTS handshakings occur on dif-
ferent channel.

Fig. 8. Aggregate throughput versus the packet arrival rate in scena-

rio (b)

4.3 Scenario (c)

Fig. 6. Aggregate throughput versus sending rate in the scenario (a)
4.2 Scenario (b)
This scenario shows spatial reuse more visibly. Nodes A and
C are independent and whenever two packets are transmit-
ted simultaneously, both transmissions are supposed to be
successful. When node B wishes to transmit a packet, it
should wait for both A and C to leave the medium free, at
the same time. Since A and C are independent, their silence
times almost never coincide, and B senses the medium as
busy rather than A and C. Fig. 7 shows the throughput of
each sender versus the packet size in IEEE 802.11 DCF pro-
tocol. Aggregate throughput versus the packet arrival rate is
shown in Fig. 8. When packet arrival rate increases until
gaining network packet rate value, the total throughput of
network falls down, because in this point traffic is going to
become heavy and some packets should be dropped to
avoid this issue. Using the proposed protocol and DMAC
protocol in this scenario lead to same results because three
communications can occur at the same time without any
interference.
Fig. 7. the throughput of each sender versus the packet size using
IEEE 802.11 DCF protocol in scenario (b)
In this scenario we evaluate the aggregate throughput
of the proposed protocol as a function of transmission
rate. Similar to scenario (a), the spatial reuse of channel is
maximum due to the fact that nodes A and B as well as
nodes C and D can communicate simultaneously. Fig. 9
shows the results with different traffic loads. With fewer
traffic loads, throughput becomes greater while transmis-
sion rate is less. Network throughput is maximum under
high traffic load with high data rate.
Fig. 9. Aggregate throughput versus sending rate with different traf-
fic loads in scenario (c)
4.4 Random Scenario
In this scenario, first we consider 40 nodes randomly
spread out in an area and 10 transmitters and receivers
are selected randomly among them. Fig. 10 shows the
simulation results using our proposed protocol with 4
and 6 channels, the CDMA based MAC protocol pro-
posed in [10], and DMAC protocol. Our proposed proto-
col has maximum throughput while the number of chan-
nels is less. We achieve high throughput in our proposed
protocol with more number of beams. In a specified direc-
tion it is possible to have more communications than the
number of beams at each node (which equals the number
of codes). For this reason, increasing the number if beams
lead to higher throughput in the condensed networks. To
have a pairwise communication between ten node pairs
using the CDMA based MAC protocol, the protocol has to
use at least ten channels. As we see from Fig. 10, the con-
ventional CDMA based MAC protocol with 4 channels
has the minimum throughput. By using 4 channels, only 4
simultaneous communications may occur. Using DMAC
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
protocol may make some nodes in some directions defer
their transmission in order to prevent collision. As we see
in Fig. 10, it has lower throughput than proposed protocol
as well as the conventional CDMA based MAC protocol
with ten channels.
In the next step of random scenario, we assume a net-
work with 20 and 50 nodes in which the maximum pair-
wise communications occur. Again, the transmitters and
receivers are selected randomly. We set the arrival packet
rate to 50 (Packets/s). As can be seen in Fig. 11, in a net-
work with 50 nodes, a high throughput can be obtained
using 6 channels. Whereas to have a maximum transmis-
sion between nodes (25 simultaneous transmissions) in a
network using conventional CDMA based one, 25 codes
(channels) are needed. Fig. 11 shows the results of our
proposed protocol and the CDMA based MAC protocol
using 4 and 6 channels.
Fig. 10. Aggregate throughput as a function of transmission rate in
random scenario.
Fig. 11. Aggregate throughput as a function of transmission rate in
random scenario.
5 CONCLUSION
In this paper, a multichannel MAC protocol with direc-
tional antennas is proposed. The most important feature
of the proposed protocol is the capability of communicat-
ing more nodes at the same time using lower number of
codes. Less complexity in Code assignment and channel
reservation is another advantage of the proposed proto-
col. In this protocol, code allocation mechanism and
53
channel reservation is obtained by RTS/CTS handshaking
in the control channel, using information table main-
tained by each node. Control packets are transmitted om-
nidirectionally and deafness problem is eliminated. We
compare the proposed protocol with 802.11 DCF, DMAC,
and new CDMA based MAC protocol and show that it
outperforms them in term of throughput. Different para-
meters such as traffic load, transmission rate and number
of codes are evaluated and compared for different scena-
rios. Our simulation results show that using the proposed
protocol improves the network throughput by fewer
codes and less complexity.
ACKNOWLEDGMENT
This work is supported by Iranian education and Re-
search Institute for Information and Communication
Technology (ERICT) under grant number 8974/500.
REFERENCES
[1] A. Nasipuri, S. Ye, J. You, and R.E. Hiromoto, “A MAC Protocol
for Mobile Ad-Hoc Networks Using Directional Ante nas,”
Proc.IEEE Wireless Comm. and Networking Conf. (WCNC ’00),
vol. 3, pp. 1214-1219, 2000.
[2] Y.B. Ko, V. Shankarkumar, and N.H. Vaidya, “Medium Access
Control Protocols Using Directional Antennas in Ad Hoc Net-
works,” Proc. IEEE INFOCOM, vol. 1, pp. 13-21, Mar 2000.
[3] M. Takai, J. Martin, A. Ren, and R. Bagrodia, “Directional Vir-
tual Carrier Sensing for Directional Antennas in Mobile Ad Hoc
Networks,” Proc. ACM MobiHoc, 2002.
[4] R. R. Choudhury, X. Yang, R. Ramanathan and N. H. Vaidya,
“Using Directional Antennas for Medium Access Control in Ad
Hoc Networks,” Proc. of ACM MobiCom, Atlanta, USA, pp: 59-
69, Sep. 2002.
[5] R. Choubhury and N. Vaidya, “Deafness: A MAC Problem in
Ad Hoc Networks When Using Directional Antennas,” Proc.
12th IEEE Int’l Conf. Network Protocols (ICNP ’04), pp. 283-292,
Oct. 2004
[6] T. Korakis, G. Jakllari and L. Tassiulas, “CDR-MAC: A Protocol
for Full Exploitation of Directional Antennas in Ad Hoc Wire-
less Networks,” IEEE Transaction on Mobile Computing, Vol. 7,
No. 2, pp: 145-155, Feb. 2008.
[7] L. Hu, “Distributed Code Assignements for CDMA Packet
Radio Networks,” IEEE/ACM Transactions on Networking, Vol.
1, No. 6, December 1993.
[8] R. Fantacci, A. Ferri and D. Tarchi, “A MAC technique for
CDMA based Ad-Hoc network,” IEEE Wireless Communications
and Networking Conference, pp: 645-650, March 2005.
[9] M. Jia, H. Chen and Y. Yuan, “A Dual Reservation MAC Proto-
col based on CDMA for Ad hoc Networks, ” Asia-Pacific Confe-
rence on Communications, pp: 53-56, October 2005.
[10] T. Meshhadany and W. Ajib, “New CDMA-Based MAC Proto-
col for Ad Hoc Networks,” Vehicular Technology Conference, pp:
91-95, fall 2007.
[11] Y. Su, K. Fakih, J. Diouris, and Y. Zhang, “Modeling and
Throughput Analysis for Wireless Ad hoc Networks,” Vehicular
Technology Conference, pp: 88-92, May 2008.
[12] H. Chan, C. Wong, and R. Hsieh, " A new multiple code chan-
nels MAC protocol in DS-CDMA wireless networks ," in Radio
and Wireless Symposium, Jan. 2009, pp. 687-690.
Vahid Pourgolzari is a M.Sc. student in Cognitive Telecommunica-
tions Research Group, at the Department of Electrical Engineering,
Shahid Beheshti University, Tehran, IRAN. His research is focused
on wireless ad hoc networks, MAC protocols and directional anten-
nas in ad hoc networks.
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 54

Seyed Ali Ghorashi Received his B.Sc. and M.Sc. Degrees in elec-
trical engineering from the university of Tehran, Iran, in 1992 and
1995, respectively. Then, he joined SANA Pro. Inc., where he worked
on modeling and simulation of OFDM based wireless LAN systems
and interference cancellation methods in WCDMA systems. Since
2000, he worked as a research associate at King’s College London
on “Capacity enhancement methods in Multi-leyer WCDMA systems”
sponsored by Mobile VCE. In 2003 he received his PHD at King’s
College and since then he worked at King’s College as a research
fellow. In 2006 he joined Samsung Electronics (UK) Ltd as a senior
researcher and now he is a faculty member of Cognitive Telecom-
munications Research Group, Department of Electrical Engineering,
Shahid Beheshti University G.C., at Tehran, Iran, working on wire-
less communications.