• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A Framework for Dynamic Selection of Backoff Stages during Initial Ranging Process in Wireless Networks

Mufti, Muhammad R., Afzal, Humaira, Awan, Irfan U., Cullen, Andrea J. 06 August 2017 (has links)
Yes / The only available solution in the IEEE 802.22 standard for avoiding collision amongst various contending customer premises equipment (CPEs) attempting to associate with a base station (BS) is binary exponential random backoff process in which the contending CPEs retransmit their association requests. The number of attempts the CPEs send their requests to the BS are fixed in an IEEE 802.22 network. This paper presents a mathematical framework that helps the BS in determining at which attempt the majority of the CPEs become part of the wireless regional area network from a particular number of contending CPEs. Based on a particular attempt, the ranging request collision probability for any number of contending CPEs with respect to contention window size is approximated. The numerical results validate the effectiveness of the approximation. Moreover, the average ranging success delay experienced by the majority of the CPEs is also determined.
2

Modeling of initial contention window size for successful initial ranging process in IEEE 802.22 WRAN cell

Afzal, Humaira, Awan, Irfan U., Mufti, Muhammad R., Sheriff, Ray E. 20 December 2014 (has links)
No / Avoiding collision among contending customer premise equipments (CPEs) attempting to associate with a base station (BS) in a wireless regional area network (WRAN) is a challenging issue. The collision probability is highly dependent upon the size of the initial contention window and the number of contending CPEs. To reduce the collision probability among CPEs in order to start the ranging process in an IEEE 802.22 network, the BS needs to adjust the initial contention window size. This paper provides an analytical framework to estimate the ranging request collision probability depending upon the size of the initial contention window and the number of CPEs attempting to join the IEEE WRAN cell. The accuracy of the estimated curve is analyzed for various numbers of contention CPEs on the basis of the relative errors. The numerical results confirm that the approximation works reasonably well for finding the ranging request collision probability for any number of contention CPEs at a particular value of initial contention window size. Moreover, this approximation provides the threshold size for a contention window to start the initial ranging process for any number of CPEs in an IEEE 802.22 network. (C) 2014 Elsevier B.V. All rights reserved.

Page generated in 0.105 seconds