You limited your search to:
Partner:
UNT College of Engineering
Collection:
UNT Scholarly Works
WiFi and WCDMA Network Design
Date: April 2005
Creator: Akl, Robert G.
Description: This presentation discusses WiFi access point selection and traffic balancing, multi-cell wideband code division multiple access (WCDMA) with multiple classes, user modeling using 2D Gaussian distribution, and intra-cell and inter-cell interference and capacity.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30935/
Dynamic Channel Assignment in IEEE 802.11 Networks
Date: March 2007
Creator: Akl, Robert G. & Arepally, Anurag
Description: This paper discusses dynamic channel assignment in IEEE 802.11 networks. Abstract: We design a dynamic channel assignment algorithm for IEEE 802.11 wireless networks. Our algorithm assigns channels dynamically in a way that minimizes channel interference generated by neighboring access points (APs) on a reference access point, resulting in higher throughput. We implement and simulate their algorithm using two versions (1: pick randomly 2: pick first) and different number of APs (4, 9, 16, and 25). Analysis of this algorithm shows an improvement by a factor of 4 (by lowering the total interference on an AP by 6 dBm on average) over default settings of having all APs use the same channel. As the number of APs is increased in a given service area, dynamic channel assignment becomes crucial; otherwise overlapping channel interference becomes a limiting factor.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30837/
Simulation of Throughput in UMTS Networks with Different Spreading Factors
Date: September 2006
Creator: Akl, Robert G. & Arepally, Anurag
Description: The authors design and implement a local session admission control (SAC) algorithm for third-generation wireless networks which allows for the simulation of network throughput for different spreading factors and various mobility scenarios. The design of the SAC algorithm uses global information; it incorporates the session arrival rates and the user mobilities across the network and guarantees the users' quality of service as well as pre-specified blocking probabilities. On the other hand, its implementation in each cell uses local information; it only requires the number of sessions currently active in that cell. A global SAC algorithm is also implemented and used as a benchmark since it is inherently optimized and uses global information in making every session admission decision; it yields the best possible performance but has an intensive computational complexity. Using simulation, we determine the network throughput, and show that our optimized local SAC algorithm achieves almost the same performance as our global SAC algorithm at a fraction of the computational cost for pre-specified blocking probabilities and quality of service r4equirements and spreading factor values of 256, 64, 16, and 4.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30832/
Retention and Recruitment of Women in Computer Engineering
Date: July 2006
Creator: Akl, Robert G. & Garlick, Ryan
Description: This presentation discusses strategies and goals for recruiting more women to Computer Science and Engineering degree (CSE) programs at the University of North Texas (UNT). It also describes a series of activities aimed at improving retention rates of women students already in our programs. Such recruitment and retention of women is critical to the country's efforts to increase the number of engineering professionals, and is a priority for the CSE Department at UNT.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30938/
Retention and Recruitment of Women in Computer Engineering
Date: July 2006
Creator: Akl, Robert G. & Garlick, Ryan
Description: This paper describes the efforts and results of a plan for actively recruiting women students to undergraduate computer engineering programs at the University of North Texas (UNT). It also describes a series of activities aimed at improving retention rates of women students already in our programs. Such recruitment and retention of women is critical to the country's efforts to increase the number of engineering professionals, and is a priority for the Computer Science and Engineering (CSE) Department at UNT.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30831/
Modeling and Analysis Using Computational Tools
Date: 2007
Creator: Akl, Robert G. & Kavi, Krishna
Description: This book chapter presents two special algorithms, Mean Value Analysis and Convolution Algorithm, for the analysis of closed queuing networks, and an introduction to simulation techniques that are widely used in analyzing queuing systems in general. In the illustration of special algorithms, the authors use simplifying assumptions that also show how they provide practical solutions to systems that are interactable or when their behaviors cannot be easily modeled using simple probability distributions.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30841/
Robocamp: Encouraging Young Women to Embrace STEM
Date: February 2009
Creator: Akl, Robert G. & Keathly, David
Description: This paper describes the efforts and results of a plan for actively recruiting students to undergraduate computer science and engineering programs at the University of North Texas (UNT). Such recruitment of students is critical to the country's efforts to increase the number of engineering professionals, and is a priority for the Computer Science and Engineering (CSE) Department at UNT.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30849/
Capacity Allocations in Multi-cell UMTS Networks for Different Spreading Factors with Perfect and Imperfect Power Control
Date: January 2006
Creator: Akl, Robert G. & Nguyen, Son
Description: This presentation discusses user and interference models, wideband code division multiple access (WCDMA) capacity with perfect and imperfect power control, and spreading factors with numerical results.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30937/
Capacity Allocations in Multi-cell UMTS Networks for Different Spreading Factors with Perfect and Imperfect Power Control
Date: January 2006
Creator: Akl, Robert G. & Nguyen, Son
Description: This paper discusses capacity allocation in multi-cell UMTS networks. Abstract: An analytical model for calculating capacity in multi-cell UMTS networks is presented. Capacity is maximized for different spreading factors and for perfect and imperfect power control. An analytical model is presented for approximating the user distributions in multi-cell third generation WCDMA networks using 2-dimensional Gaussian distributions by determining the means and the standard deviations of the distribution for every cell. This allows for the calculation of the inter-cell interference and the reverse-link capacity of the network. The capacity was determined for signal-to-interference threshold from 5 dB to 10 dB and spreading factor values of 256, 64, 16, and 4.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30825/
UMTS Capacity and Throughput Maximization for Different Spreading Factors
Date: July 2006
Creator: Akl, Robert G. & Nguyen, Son
Description: This article discusses UMTS capacity and throughput maximization for different spreading factors. An analytical model for calculating capacity in multi-cell UMTS networks is presented. Capacity is maximized for different spreading factors and for perfect and imperfect power control. The authors also design and implement a local call admission control (CAC) algorithm which allows for the simulation of network throughput for different spreading factors and various mobility scenarios. The design of the CAC algorithm uses global information ; it incorporates the call arrival rates and the user mobilities across the network and guarantees the users' quality of service as well as pre-specified blocking probabilities. On the other hand, its implementation in each cell uses local information; it only requires the number of calls currently active in that cell. The capacity and network throughput were determined for signal-to-interference threshold from 5 dB to 10 dB and spreading factor values of 256, 64, 16, and 4.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30833/