Throughput Scaling in Cognitive Multiple Access With Average Power and Interference Constraints
نویسندگان
چکیده
منابع مشابه
Scaling constraints in nanoelectronic random-access memories.
Nanoelectronic molecular and magnetic tunnel junction (MTJ) MRAM crossbar memory systems have the potential to present significant area advantages (4 to 6F(2)) compared to CMOS-based systems. The scalability of these conductivity-switched RAM arrays is examined by establishing criteria for correct functionality based on the readout margin. Using a combined circuit theoretical modelling and simu...
متن کاملA Fair Power Allocation for Non-Orthogonal Multiple Access in the Power Domain
This paper presents an investigation on the performance of the Non-Orthogonal Multiple Access (NOMA) in the power domain scheme. A Power Allocation (PA) method is proposed from NOMA throughput expression analysis. This method aims to provide fair opportunities for users to improve their performance. Thus, NOMA users can achieve rates higher than, or equal to, the rates obtained with the convent...
متن کاملSensing Throughput Optimization in Fading Cognitive Multiple Access Channels With Energy Harvesting Secondary Transmitters
The paper investigates the problem of maximizing expected sum throughput in a fading multiple access cognitive radio network when secondary user (SU) transmitters have energy harvesting capability, and perform cooperative spectrum sensing. We formulate the problem as maximization of sumcapacity of the cognitive multiple access network over a finite time horizon subject to a time averaged interf...
متن کاملCognitive radio network with secrecy and interference constraints
In this paper, we investigate the physical-layer security of a secure communication in single-input multiple-output (SIMO) cognitive radio networks (CRNs) in the presence of two eavesdroppers. In particular, both primary user (PU) and secondary user (SU) share the same spectrum, but they face with different eavesdroppers who are equipped with multiple antennas. In order to protect the PU commun...
متن کاملNon-preemptive Throughput Maximization for Speed-Scaling with Power-Down
We consider the problem of scheduling a set of n jobs on a single processor. Each job is characterized by its release date rj , its deadline dj and its processing volume pj . The processor can vary its speed and can switch into a sleep state in order to reduce its energy consumption. No energy is consumed in this state, but a fixed amount of energy, equal to L, is required for a transition from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2012
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2011.2174054