Search results for "Names"
showing 10 items of 6843 documents
Throughput and delay analysis of HARQ with code combining over double Rayleigh fading channels
2018
This paper proposes the use of hybrid automatic repeat request (HARQ) with code combining (HARQ-CC) to offer reliable communications over double Rayleigh channels. The double Rayleigh fading channel is of particular interest to vehicleto-vehicle communication systems as well as amplify-and-forward relaying and keyhole channels. This paper studies the performance of HARQ-CC over double Rayleigh channels from an information theoretic perspective. Analytical approximations are derived for the ϵ-outage capacity, the average number of transmissions, and the throughput of HARQ-CC. Moreover, we evaluate the delay experienced by Poisson-arriving packets for HARQ-CC. We provide analytical expression…
Modeling and Performance Analysis of Channel Assembling in Multichannel Cognitive Radio Networks With Spectrum Adaptation
2012
[EN] To accommodate spectrum access in multichannel cognitive radio networks (CRNs), the channel-assembling technique, which combines several channels together as one channel, has been proposed in many medium access control (MAC) protocols. However, analytical models for CRNs enabled with this technique have not been thoroughly investigated. In this paper, two representative channel-assembling strategies that consider spectrum adaptation and heterogeneous traffic are proposed, and the performance of these strategies is evaluated based on the proposed continuous-time Markov chain (CTMC) models. Moreover, approximations of these models in the quasistationary regime are analyzed, and closed-fo…
From user-generated data to data-driven innovation: A research agenda to understand user privacy in digital markets
2021
Abstract In recent years, strategies focused on data-driven innovation (DDI) have led to the emergence and development of new products and business models in the digital market. However, these advances have given rise to the development of sophisticated strategies for data management, predicting user behavior, or analyzing their actions. Accordingly, the large-scale analysis of user-generated data (UGD) has led to the emergence of user privacy concerns about how companies manage user data. Although there are some studies on data security, privacy protection, and data-driven strategies, a systematic review on the subject that would focus on both UGD and DDI as main concepts is lacking. There…
Performance analysis of user-centric SBS deployment with load balancing in heterogeneous cellular networks: A Thomas cluster process approach
2020
Abstract In conventional heterogeneous cellular networks (HCNets), the locations of user equipments (UEs) and base stations (BSs) are modeled randomly using two different homogeneous Poisson point processes (PPPs). However, this might not be a suitable assumption in case of UE distribution because UE density is not uniform everywhere in HCNets. Keeping in view the existence of nonuniform UEs, the small base stations (SBSs) are assumed to be deployed in the areas with high UE density, which results in correlation between UEs and BS locations. In this paper, we analyse the performance of HCNets with nonuniform UE deployment containing a union of clustered and uniform UE sets. The clustered UE…
Doppler Shift Characterization of Wideband Mobile Radio Channels
2019
The prevailing approach for characterizing the Doppler shift (DS) of mobile radio channels assumes the transmission of an unmodulated carrier. This consideration is valid for the analysis of narrowband channels, but its pertinence is questionable in regards to the modeling of wideband channels. In this correspondence, we redefine the DS from a time-frequency analysis perspective that does not depend on the aforementioned assumption. We systematically demonstrate that the DS can be characterized by the instantaneous frequency of the channel transfer function. This generic definition makes evident a fundamental aspect of the DS that is seldom acknowledged, namely, the DS is a frequency-varyin…
The generalized method of equal areas for the design of sum-of-cisoids simulators for mobile Rayleigh fading channels with arbitrary Doppler spectra
2011
We present in this paper a generalized version of the method of equal areas (MEA) that is well suited for the design of sum-of-cisoids (SOC) simulators for narrowband mobile Rayleigh fading channels characterized by any type of Doppler power spectral densities (DPSDs). Unlike the original MEA, the generalized MEA (GMEA) can be applied to the simulation of fading channels with asymmetrical DPSDs. This is an important feature because the simulation of such channels is of great interest for the laboratory analysis of mobile communication systems under non-isotropic scattering conditions. We show that irrespective of the underlying DPSD, the GMEA results in a very good approximation to the auto…
An optimized mass storage FFT for vector computers
1995
Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
Collusion constrained equilibrium
2018
We study collusion within groups in non-cooperative games. The primitives are the preferences of the players, their assignment to non-overlapping groups and the goals of the groups. Our notion of collusion is that a group coordinates the play of its members among different incentive compatible plans to best achieve its goals. Unfortunately, equilibria that meet this requirement need not exist. We instead introduce the weaker notion of collusion constrained equilibrium. This allows groups to put positive probability on alternatives that are suboptimal for the group in certain razor's edge cases where the set of incentive compatible plans changes discontinuously. These collusion constrained e…
On the Coincidence of the Feedback Nash and Stackelberg Equilibria in Economic Applications of Differential Games
2002
In this paper the scope of the applicability of the Stackelberg equilibrium concept in differential games is investigated. Firstly, conditions for obtaining the coincidence between the Stackelberg and Nash equilibria are defined in terms of the instantaneous pay-off function and the state equation of the game. Secondly, it is showed that for a class of differential games with state-interdependence both equilibria are identical independently of the player being the leader of the game. A survey of different economic models shows that this coincidence is going to occur for a good number of economic applications of differential games. This result appears because of the continuous-time setting i…