<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Coping with Spoofed PS-Poll Based DoS Attack in IEEE 802.11 Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hocine Souilah</string-name>
          <email>hocinesouilah@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Abderrahmane Baadache</string-name>
          <email>abderrahmane.baadache@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Louiza Bouallouche-Medjkoune</string-name>
          <email>louiza medjkoune@yahoo.fr</email>
          <email>medjkoune@yahoo.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Laboratory of Modelling and Optimization of Systems, Faculty of exact science, University of Bejaia</institution>
          ,
          <country country="DZ">Algeria</country>
        </aff>
      </contrib-group>
      <fpage>57</fpage>
      <lpage>62</lpage>
      <abstract>
        <p>IEEE 802.11 networks are particularly vulnerable to DoS (Denial of Service) attacks targeting the network availability. In this paper, we focus on the PS-Poll based DoS attack, where the attacker spoofs the polling frame on behalf of the client in order to discard the client's buffered packets at the access point level. To cope with this attack, we propose a security solution called APSP (Authenticated Power Save Poll) and based on the integer prime factorization to authenticate PS-Poll frames. Our solution is both detective and preventive one and generates low communication, computing and storage overheads. It did not require any additional hardware and can be implemented via firmware upgrade. Simulation results show that the proposed solution is effective and robust to defend against the considered attack.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>IEEE 802.11 networks are extremely popular and
used in several civilian and military applications
to avoid the expenses and delays associated with
installing wired networks. They are deployed in
businesses, homes, communities, and open spaces
to provide the connectivity to anyone with a receiver
that is in radio range. IEEE 802.11 standards series
are providing increasingly higher access speeds and
offering some accommodations to users. However,
several security issues need to be taken into deeper
consideration in order to secure 802.11 wireless
communications.</p>
      <p>In this paper, we focus on vulnerabilities pronounced
in the Power Save Mode (PSM), where the client
is in sleep state and unaware to security threats.
One of DoS attacks that can be launched in PSM
is the spoofed PS-Poll attack, where the attacker
spoofs the client PS-Poll frame and sends it, on
behalf of the client, to the AP (Access Point). When
this spoofed frame is received by the AP, the latter
delivers the buffered packets (these packets are
intended to be delivered to the legitimate sleepy
client) to the attacker, then empties the buffer
as soon it receives an acknowledgment from the
attacker. This attack can be taken place because
PSPoll frames are neither protected nor authenticated.
To cope with this attack, we propose an integer
prime factorization based solution called APSP
(Authenticated Power Save Poll). To successfully
conduct its attack, the attacker should decompose
large integer numbers into non-trivial prime divisors.
No efficient integer prime factorization algorithm is
known when considered numbers are very large,
so, the attacker cannot never launch its attack.
Performed simulations prove that the proposed
solution is effective and robust to defend against
the spoof PS-Poll based DoS attack. Furthermore,
no important communication, computing or storage
overheads are generated by our solution, and it can
be easily implemented through a firmware upgrade,
without requiring any additional hardware.
The remainder of this paper is organized as follows.
Section 2 introduces IEEE 802.11 networks, Section
3 summarizes some related works and Section
4 describes how the spoofed PS-Poll based DoS
attack is launched. The proposal is presented and
discussed in Section 5. Simulation results are
analyzed and interpreted in Section 6. In Section
7, we conclude the paper and highlight some future
works.</p>
    </sec>
    <sec id="sec-2">
      <title>2. BACKGROUND</title>
      <p>
        The IEEE 802.11 standard defines the physical
and MAC layers of OSI model for ad hoc
and infrastructure modes. It uses three types of
frames, namely, data frames, control frames and
management frames. Data frames are used to send
the upper layer data, control frames are used to
arbitrate access to the medium and management
frames are used for network management tasks.
The PS-Poll frame considered in this paper is a
control frame used by a client in power save mode to
request pending frames buffered at the access point.
Some control and management frames enumerated
in Table 1 are usually exploited to launch DoS attacks
in IEEE 802.11 networks (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ).
      </p>
      <p>Management frames
Control frames</p>
      <p>Probe Request/Response Request to Send
Authentication/Deauthentication Clear to Send
Association /Disassociation Acknowledgement</p>
      <p>Reassociation Power Save Poll</p>
      <p>Table 1: Control and management frames
In order to identify APs within communication
range, a client listen to beacon frames periodically
transmitted by APs. After this, authentication request
and response frames are exchanged between
client and AP. Then, an association process takes
place in which the client learns the AP’s MAC
address and the AP assigns an association identifier
to the wireless client. An 802.11 client can be
authenticated by multiple APs, however it should be
associated with only one AP at a time. Once the
authentication and the association processes are
finished, the communication between the client and
AP can take place.</p>
    </sec>
    <sec id="sec-3">
      <title>3. RELATED WORK</title>
      <p>
        Usually, DoS attacks launched in IEEE 802.11
networks exploit vulnerabilities related to
unauthenticated management frames exchanged between
clients and the AP. In (2; 3), authors present
several denial of service attacks against 802.11-based
networks, and examine the 802.11 MAC layer in
order to identify a number of vulnerabilities that could
be exploited to deny service to legitimate users.
WEP (Wired Equivalent Privacy) (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) is the
popular security protocol that ensures security services
such as confidentiality, authentication and integrity.
This protocol did not provide solutions to already
discovered security weaknesses (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ). To remedy to
these security weaknesses, IEEE proposed Wi-Fi
Protected Access (WPA) and 802.11i (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) as the
security standards for WLANs. In (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ), authors proposed
an encryption based solution using pre-established
keys, in order to detect and prevent the spoofed
PS-Poll based DoS attacks. This solution does not
require any additional hardware and can be
implemented in both wireless clients and AP via firmware
upgrade. Authors in (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) presented a solution to
address vulnerabilities that exist in the exchange of
management frames, and employ a modified
DiffeHellman’s algorithm to ensure the authentication and
the integrity, and consequently prevent threats such
as active eavesdropping and DoS attacks.
Some commercial softwares such as AirDefense
Guard, Odyssey Server and SnifferWireless are
available and considered as intrusion detection
solutions that provide real-time network audits
and monitoring, in order to identify and respond
to hardware failures, network interferences and
performance degradation (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ). Authors of (
        <xref ref-type="bibr" rid="ref10">10</xref>
        )
proposed an intrusion detection system based on the
relationship that can be exist between a node and
the traffic it generates, in order to detect attacks that
target the MAC layer of 802.11 networks. General
approches (11; 12) for detecting MAC address
spoofing attacks are also proposed. This detection
can be achieved through the analysis of sequence
number patterns of the captured wireless traffic.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. ATTACK MODEL</title>
      <p>
        The Power Save Mode (PSM) (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ), defined in the
802.11 standard, allows stations to switch from
active mode to sleep mode when there are no
transmission in order to conserve their power. As
depicted in Figure 1, to enter into PSM, a client
sends a PS (Power Save) request to AP and a PS
response should be sent back by AP to the client
before it can enter into sleep mode. During the
sleep period, the AP buffers all packets addressed
to that client. The presence of buffered packets
is periodically indicated in the Traffic Indication
Map (TIM) contained in beacon frames. If there
is an indication of pending packets, the client can
choose to receive those frames at its convenience,
otherwise, it sleeps immediately (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ). To receive
pending data, the client asks the AP through the
Power Save Poll (PSP-oll) frame to get these
packets. After successful reception of data frames,
the client sends an acknowledgment (ACK) which
allows the AP to empty data buffer.
      </p>
      <p>The PS-Poll frame is neither protected nor
authenticated. An attacker can easily spoof PS-Poll frame
using tools such as SpoofMAC, Airsnarf and
NetStumbler. Therefore, it can simply launch a DoS
attack by sending spoofed PS-Poll frame on behalf
of the asleep client, thereby causing the destruction
of packets destined to the client. A generic PS-Poll
DoS attack scenario is shown in Figure 2.</p>
    </sec>
    <sec id="sec-5">
      <title>5. OUR PROPOSAL</title>
      <p>
        In order to cope with the spoofed PS-Poll based
DoS attack, we have proposed APSP (Authenticated
Power Save Poll). This solution exploits the principle
of the integer prime factorization, that consists to
decompose a large number N = p ∗ q (where p and
q are two positive large prime numbers) into
nontrivial prime divisors. When the number is very large,
no efficient integer prime factorization algorithm is
known (
        <xref ref-type="bibr" rid="ref13">13</xref>
        ). As depicted in Figure 3, APSP works
as follows :
1. Initially, when the client wants to switch to PSM,
it randomly generates two positive large prime
numbers p and q then computes N = p ∗ q.
2. During the PSM switching process, the client
sends a PS request containing N to the AP.
The AP stores N and sends a PS response to
the client.
3. When the sleepy client receives a beacon
frame from AP indicating that it has pending
frames in buffer, it sends the PS-Poll frame
to the AP, along with the p to get these
frames. If this number p corresponds to the
number N previously stored, i.e., p divides N ,
then the PS-Poll frame is authenticated and
will be processed accordingly. Consequently,
the AP delivers buffered frames to the client.
Otherwise, the frame is rejected assuming that
it is from the attacker.
4. After the reception of frames, the client renews
the parameters p, q and N . For this, it
sends an acknowledgment (ACK) containing
the newly calculated N , which will be used
to authenticate the PS-Poll subsequently
exchanged with the recent generated p.
      </p>
      <p>Since p and q are two large primes, even the attacker
can obtain N , it is difficult for it to generate the
same prime number p generated by the client due
to the intractable factorization problem. Also, while
the division N/p can be efficiently performed by
the AP, the spoofed PS-Poll will be easily detected.
Furthermore, the factorization of N is unique, so,
only the client who generated the number N can
prove that it is the legitimate owner of the challenge
p, and thus it alone can send the legitimate PS-Poll
frame.</p>
    </sec>
    <sec id="sec-6">
      <title>6. PERFORMANCE EVALUATION</title>
      <p>This section is devoted to evaluate the performance
of our security protocol (APSP). We have performed
series of simulations by implementing a prototype
in Maple modeling and development environment
(14). Our prototype has a modular design, which
allows parallel programming. We have used one
AP and one legitimate client operating in 802.11
PSM. Another client periodically sends packets to
the legitimate client and one attacker to launch
the spoofed PS-Poll based DoS attack. The source
node periodically and randomly sends data packets
to the client in PSM, while the AP sends beacon
frames with an average of 10 beacons/second.
The simulation duration is 3600 seconds. We
use different values of primes p and q in order
to determine the impact of the size of prime
numbers in our solution performance. Furthermore,
the simulation was performed without protection
constraints (i.e., without WEP or WPA/WPA2).
Additionally, we have ignored transmission errors
that can be occurred in the wireless channel.
The main goal of our solution is to ensure the
reliability of the buffering and subsequent delivery of
packets by the AP. Thus, following metrics have been
measured :
• Packet Delivery Ratio (PDR): denotes the ratio
between the number of delivered packets by
the AP that well received by the client in PSM
and the total number of packets generated by
the source node and buffered by in the AP.
• Packet Saving Ratio (PSR): is defined as
the ratio between the number of maintained
packets in the buffer during the client sleep
period and the total number of packets buffered
in the AP.
• Attack Success Ratio (ASR): represents the
ratio between the number of buffered packets
devastated because of the attack and the total
number of packets buffered in the AP. We can
consider this ratio as packets loss ratio.
• Attacker Efficiency: we define this metric as
the ratio between the number of spoofed
PSPoll successfully treated by the AP and the
total number of spoofed PS-Poll sent by the
attacker.</p>
      <p>Simulation results shown in Figure 4 represent PDR,
PSR and ASR with N equal to 512 bits. From Figure
4, we observe that the PDR increases, while the
PSR decreases. This means that the AP has kept
the buffered packets while the client sinks into a
deep sleep then buffered packets are well delivered
to the client. In other words, the client and the
AP have been fully mastered through our solution.
Additionally, ASR is kept at 0% during the simulation.
This means that all the spoofed PS-Poll sent by
the attacker were detected and ignored by the AP,
i.e., the adequate challenge p hasn’t discovered by
the attacker, hence the total failure of the attack.
These simulation results shows that our solution is
fully effective against the spoofed PS-Poll based DoS
attack.</p>
      <p>In order to determine the impact of the size of the
challenge p (or the size of the number N ) on PDR,
ASR and attacker efficiency, we have used different
sizes of N . Results are shown in Figure 5.
From Figure 5, we observe that the increasing of
PDR is the direct consequence of the increasing of
the size of N . More N is larger, more PDR becomes
closer to 100% with sizes less than 64-bits. PDR
reachs 100% with sizes equal to 64-bits and more.
Moreover, we observe that the increasing of the size
of N causes the decreasing of ASR and the attacker
efficiency. In other words, more N is larger; more
ASR and attacker efficiency become closer to 0% for
sizes less than 64-bits. These latter metrics reach
0% for sizes equal or more than 64-bits. We can
conclude also that sizes of N equal or less than
32bits are insufficient to prevent the attack, because it
is relatively easy for the attacker to find the challenge
p with small primes. On the contrary, with large sizes
of N , the attacker has any chance to find the correct
challenge p.</p>
      <p>In order to check the robustness of our solution, we
have modified the attack to launch a brute force
PSPoll DoS attack, this by testing a set of potential
numbers p to find the correct one. In this experiment,
N is equal to 512 bits. The obtained results are
depicted in Figure 6. Note that similar results were
obtained with N equal to 64, 128, 256 and 1024 bits.
From Figure 6, we can say that the AP has mastered
the legitimate trade in favor of the client, despite the
existence of a brute force PS-Poll based DoS attack.
Also, simulation results show that the brute force
PS-Poll based DoS attack has totally failed where
the ASR is kept at zero (0%) during the simulation.
This is due to the total prevention and protection
provided by our solution against the spoofed
PSPoll attack. All spoofed PS-Poll sent by the attacker
was detected and crushed. So, it is very difficult
for the attacker to find the correct number p within
a reasonable time. This justifies the result of the
attacker efficiency (0%).</p>
      <p>Note that the solution we propose is not only
detective but also preventive against the spoofed
PS-Poll based DoS attack, with low communication,
computing and storage overheads. Furthermore, it
can be easily implemented in wireless clients and
AP via firmware upgrade and without any additional
hardware.</p>
    </sec>
    <sec id="sec-7">
      <title>7. CONCLUSION</title>
      <p>In this paper, we have focused on the spoofed
PSPoll based DoS attack, where the attacker spoofs
the PS-Poll frame in the objective to destruct
buffered packets intended to be delivered to sleepy
clients. To cope with this attack, we have proposed
APSP (Authenticated Power Save Poll) in order to
authenticate PS-Poll frames. Our solution is based
on the integer prime factorization known as an
intractable problem to mitigate this DoS attack.
The solution we propose is both detective and
preventive one, with low communication, computing
and storage overheads, and it can be easily
implemented through a firmware upgrade without
requiring any additional hardware. Simulation results
show that the proposed solution is effective and
robust to defend against the considered attack. In
future work, we plan to compare our solution to
other reference works in order to assess further
its effectiveness and robustness, and extend it to
consider other DoS attacks.
[14] http://www.maplesoft.com/products/maple/</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Farooq</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Llewellyn-Jones</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Merabti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2010</year>
          )
          <article-title>MAC Layer DoS Attacks</article-title>
          in
          <source>IEEE 802.11 Networks. The 11th Annual Conference on the Convergence of Telecommunications</source>
          , Networking &amp; Broadcasting (PGNet
          <year>2010</year>
          ), Liverpool, UK.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Bellardo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Savage</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2003</year>
          )
          <volume>802</volume>
          .
          <article-title>11 denial-of-service attacks: real vulnerabilities and practical solutions</article-title>
          .
          <source>Proceedings of the 12th conference on USENIX Security Symposium</source>
          , vol.
          <volume>12</volume>
          of SSYM'03, Berkeley, CA, USA, USENIX Association, pp.
          <fpage>15</fpage>
          -
          <lpage>28</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Bernaschi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferreri</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Valcamonici</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          (
          <year>2008</year>
          )
          <article-title>Access points vulnerabilities to DoS attacks in 802.11 networks</article-title>
          .
          <source>Wireless Networks</source>
          , Vol.
          <volume>14</volume>
          , No.
          <issue>2</issue>
          , pp.
          <fpage>159</fpage>
          -
          <lpage>169</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4] (
          <year>1999</year>
          )
          <article-title>IEEE 802.11 Local and Metropolitan Area Networks: Wireless LAN Medium Acess Control (MAC) and Physical (PHY) Specifications</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Wong</surname>
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2007</year>
          )
          <article-title>The evolution of wireless security in 802.11 networks: WEP, WPA and 802.11 standards. GSEC Practical v1</article-title>
          .
          <year>4b</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Moffat</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hunt</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2007</year>
          )
          <article-title>Evolution of wireless LAN security architecture to IEEE 802.11i (WPA2)</article-title>
          .
          <source>AsiaCSN'07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks</source>
          , pp.
          <fpage>292</fpage>
          -
          <lpage>297</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Matthew</surname>
            <given-names>G.</given-names>
          </string-name>
          (
          <year>2002</year>
          )
          <volume>802</volume>
          .11
          <string-name>
            <given-names>Wireless</given-names>
            <surname>Networks: The Definitive Guide. O'Reilly</surname>
          </string-name>
          , pp.
          <fpage>122</fpage>
          -
          <lpage>133</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Qureshi</surname>
            ,
            <given-names>Z. I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aslam</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohsin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Javed</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2008</year>
          )
          <article-title>Using Randomized Association ID to Detect</article-title>
          and Prevent
          <string-name>
            <surname>Spoofed</surname>
          </string-name>
          PS-Poll
          <source>Based Denial of Service Attacks in IEEE 802.11 WLANs. WSEAS Transactions on Communications</source>
          , Vol.
          <volume>7</volume>
          , No.
          <issue>3</issue>
          , pp.
          <fpage>170</fpage>
          -
          <lpage>179</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Samad</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mahmood</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Umar Kaleem</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2006</year>
          )
          <article-title>Improved Security in IEEE802.11 Wireless LANs</article-title>
          .
          <source>Proceedings of the 5th WSEAS International Conference on Data Networks, Communications and Computers (DNCOCO'06)</source>
          , Bucharest, Romania.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>LaRoche</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Zincir-Heywood</surname>
            ,
            <given-names>A. N.</given-names>
          </string-name>
          (
          <year>2005</year>
          )
          <volume>802</volume>
          .11
          <string-name>
            <given-names>Network</given-names>
            <surname>Intrusion</surname>
          </string-name>
          <article-title>Detection using Genetic Programming</article-title>
          .
          <source>Proceedings of the 2005 Workshops on Genetic and Evolutionary Computation</source>
          , Washington, D.C, pp.
          <fpage>170</fpage>
          <lpage>171</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Chiueh</surname>
            ,
            <given-names>T. C.</given-names>
          </string-name>
          (
          <year>2005</year>
          )
          <article-title>Sequence Number-Based MAC address spoof Detection</article-title>
          .
          <source>Proceedings of 8th Recent Advances in Intrusion Detection Symposium (RAID</source>
          <year>2005</year>
          ), Location, Seattle, Washington, USA, pp.
          <fpage>309</fpage>
          -
          <lpage>329</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Toledo</surname>
            ,
            <given-names>A. L.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Xiaodong</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          (
          <year>2008</year>
          )
          <article-title>Robust Detection of MAC Layer Denial-ofService Attacks in CSMA/CA Wireless Networks</article-title>
          .
          <source>IEEE Transactions on Information Forensics and Security</source>
          , vol.
          <volume>3</volume>
          , No.
          <issue>3</issue>
          , pp.
          <fpage>347</fpage>
          -
          <lpage>358</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Hildebrand</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>1987</year>
          )
          <article-title>On the number of prime factors of integers without large prime divisors</article-title>
          .
          <source>Journal of Number Theory</source>
          . Vol.
          <volume>25</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>81106</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>