919,845 research outputs found

    Adaptive Beamforming and Adaptive Modulation-Assisted Network Performance of Multiuser Detection-Aided FDD and TDD CDMA Systems

    No full text
    The network performance of a frequency division duplex and time division duplex (TDD) code division multiple access (CDMA)-based system is investigated using system parameters similar to those of the Universal Mobile Telecommunication System. The new call blocking and call dropping probabilities, the probability of low-quality access, and the required average transmit power are quantified both with and without adaptive antenna arrays (AAAs), as well as when subjected to shadow fading. In some of the scenarios investigated, the system’s user capacity is doubled with the advent of adaptive antennas. The employment of adaptive modulation techniques in conjunction with AAAs resulted in further significant network capacity gains. This is particularly so in the context of TDD CDMA, where the system’s capacity becomes poor without adaptive antennas and adaptive modulation owing to the high base station (BS) to BS interference inflicted as a consequence of potentially using all time slots in both the uplink and downlink of the emerging wireless Internet. Index Terms—Adaptive beamforming, adaptive modulation, code division multiple access (CDMA) systems, Universal Mobile Telecommunication System Terrestrial Radio Access (UTRA), wireless network performance

    Measurement-Adaptive Cellular Random Access Protocols

    Get PDF
    This work considers a single-cell random access channel (RACH) in cellular wireless networks. Communications over RACH take place when users try to connect to a base station during a handover or when establishing a new connection. Within the framework of Self-Organizing Networks (SONs), the system should self- adapt to dynamically changing environments (channel fading, mobility, etc.) without human intervention. For the performance improvement of the RACH procedure, we aim here at maximizing throughput or alternatively minimizing the user dropping rate. In the context of SON, we propose protocols which exploit information from measurements and user reports in order to estimate current values of the system unknowns and broadcast global action-related values to all users. The protocols suggest an optimal pair of user actions (transmission power and back-off probability) found by minimizing the drift of a certain function. Numerical results illustrate considerable benefits of the dropping rate, at a very low or even zero cost in power expenditure and delay, as well as the fast adaptability of the protocols to environment changes. Although the proposed protocol is designed to minimize primarily the amount of discarded users per cell, our framework allows for other variations (power or delay minimization) as well.Comment: 31 pages, 13 figures, 3 tables. Springer Wireless Networks 201

    Adaptive delayed channel access for IEEE 802.11n WLANs

    Get PDF
    Abstract— In this paper we investigate potential benefits that an adaptive delayed channel access algorithm can attain for the next-generation wireless LANs, the IEEE 802.11n. We show that the performance of frame aggregation introduced by the 802.11n adheres due to the priority mechanism of the legacy 802.11e EDCA scheduler, resulting in a poor overall performance. Because high priority flows have low channel utilization, the low priority flows throughputs can be amerced further. By introducing an additional delay at the MAC layer, before the channel access scheduling, it will retain aggregate sizes at higher numbers and consequently a better channel utilization. Also, in order to support both UDP and TCP transport layer protocols, the algorithm’s operational conditions are kept adaptive. The simulation results demonstrate that our proposed adaptive delayed channel access outperforms significantly the current 802.11n specification and non-adaptive delayed channel access

    Exploiting Regional Differences: A Spatially Adaptive Random Access

    Full text link
    In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access (SARA) scheme in which the transmitters in the network utilize different transmit probabilities depending on the local situation. In our proposed scheme, the transmit probability is adaptively updated by the ratio of the received SINR and the target SINR. We investigate the performance of the spatially adaptive random access scheme. For the comparison, we derive an optimal transmit probability of ALOHA random access scheme in which all transmitters use the same transmit probability. We illustrate the performance of the spatially adaptive random access scheme through simulations. We show that the performance of the proposed scheme surpasses that of the optimal ALOHA random access scheme and is comparable with the CSMA/CA scheme.Comment: 10 pages, 10 figure

    Adaptive Channel Recommendation For Opportunistic Spectrum Access

    Full text link
    We propose a dynamic spectrum access scheme where secondary users recommend "good" channels to each other and access accordingly. We formulate the problem as an average reward based Markov decision process. We show the existence of the optimal stationary spectrum access policy, and explore its structure properties in two asymptotic cases. Since the action space of the Markov decision process is continuous, it is difficult to find the optimal policy by simply discretizing the action space and use the policy iteration, value iteration, or Q-learning methods. Instead, we propose a new algorithm based on the Model Reference Adaptive Search method, and prove its convergence to the optimal policy. Numerical results show that the proposed algorithms achieve up to 18% and 100% performance improvement than the static channel recommendation scheme in homogeneous and heterogeneous channel environments, respectively, and is more robust to channel dynamics

    Analytical evaluation of adaptive-modulation-based opportunistic cognitive radio in Nakagami-m fading channels

    Get PDF
    The performance of adaptive modulation for cognitive radio with opportunistic access is analyzed by considering the effects of spectrum sensing, primary user (PU) traffic, and time delay for Nakagami- m fading channels. Both the adaptive continuous rate scheme and the adaptive discrete rate scheme are considered. Numerical examples are presented to quantify the effects of spectrum sensing, PU traffic, and time delay for different system parameters

    Adaptive Modulation in Multi-user Cognitive Radio Networks over Fading Channels

    Full text link
    In this paper, the performance of adaptive modulation in multi-user cognitive radio networks over fading channels is analyzed. Multi-user diversity is considered for opportunistic user selection among multiple secondary users. The analysis is obtained for Nakagami-mm fading channels. Both adaptive continuous rate and adaptive discrete rate schemes are analysed in opportunistic spectrum access and spectrum sharing. Numerical results are obtained and depicted to quantify the effects of multi-user fading environments on adaptive modulation operating in cognitive radio networks

    An efficient data transmission policy in an integrated voice-data ds-cdma network

    Get PDF
    CDMA schemes appear to be promising access techniques for coping with the requirements of third-generation mobile systems, mainly because of their flexibility. This paper proposes an adaptive S-ALOHA DS-CDMA access scheme as a method for integrating non-real time (i.e. Internet applications) and real-time (i.e. voice) services, by exploiting the potentials of CDMA under time-varying conditions. The adaptive component terminals autonomously change their transmission rate according to the total (voice+data) channel occupancy, so that the minimum possible data delay is almost always achieved.Peer ReviewedPostprint (published version

    Self-Adaptive Role-Based Access Control for Business Processes

    Get PDF
    © 2017 IEEE. We present an approach for dynamically reconfiguring the role-based access control (RBAC) of information systems running business processes, to protect them against insider threats. The new approach uses business process execution traces and stochastic model checking to establish confidence intervals for key measurable attributes of user behaviour, and thus to identify and adaptively demote users who misuse their access permissions maliciously or accidentally. We implemented and evaluated the approach and its policy specification formalism for a real IT support business process, showing their ability to express and apply a broad range of self-adaptive RBAC policies
    • 

    corecore