Hamid R. Sadjadpour

Hamid R. Sadjadpour


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2017 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
JOJose Armando Oviedo
Jose Armando Oviedo
HSHamid R. Sadjadpour
Hamid R. Sadjadpour
A nonorthogonal multiple access (NOMA) approach that always outperforms orthogonal multiple access (OMA) called Fair-NOMA is introduced. In Fair-NOMA, each mobile user is allocated its share of the transmit power such that its capacity is always greater than or equal to the capacity that can be achieved using OMA. For any slow-fading channel gains of the two users, the set of possible power allocation coefficients is derived. For the infimum and supremum of this set, the individual capacity gains and the sum-rate capacity gain are derived. It is shown that the ergodic sum-rate capacity gain approaches 1 b/s/Hz when the transmit power increases for the case when pairing two random users with independent identically distributed channel gains. The outage probability of this approach is derived and shown to be better than OMA. The Fair-NOMA approach is applied to the case of pairing a near base-station user and a cell-edge user and the ergodic capacity gap is derived as a function of total number of users in the cell at high SNR. This is then compared to the conventional case of fixed-power NOMA with user pairing. Finally, Fair-NOMA is extended to $K$ users and it is proven that the capacity can always be improved for each user, while using less than the total transmit power required to achieve OMA capacities per user.

11 November 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MKMohsen Karimzadeh Kiskani
Mohsen Karimzadeh Kiskani
HSHamid R. Sadjadpour
Hamid R. Sadjadpour
Decentralized coded content caching for next generation cellular networks is studied. The contents are linearly combined and cached in under-utilized caches of user terminals and its throughput capacity is compared with decentralized uncoded content caching. In both scenarios, we consider multihop device-to-device communications and the use of femtocaches in the network. It is shown that decentralized coded content caching can increase the network throughput capacity compared to decentralized uncoded caching by reducing the number of hops needed to deliver the desired content. Furthermore, the throughput capacity for Zipfian content request distribution is computed and it is shown that the decentralized coded content cache placement can increase the throughput capacity of cellular networks by a factor of (log (n))2 where n is the number of nodes served by a femtocache.

26 September 2017 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
MKMohsen Karimzadeh Kiskani
Mohsen Karimzadeh Kiskani
HSHamid R. Sadjadpour
Hamid R. Sadjadpour
Caching aims to store data locally in some nodes within the network to be able to retrieve the contents in shorter time periods. However, caching in the network did not always consider secure storage (due to the compromise between time performance and security). In this paper, a novel decentralized secure coded caching approach is proposed. In this solution, nodes only transmit coded files to avoid eavesdropper wiretappings and protect the user contents. In this technique random vectors are used to combine the contents using XOR operation. We modeled the proposed coded caching scheme by a Shannon cipher system to show that coded caching achieves asymptotic perfect secrecy. The proposed coded caching scheme significantly simplifies the routing protocol in cached networks while it reduces overcaching and achieves a higher throughput capacity compared to uncoded caching in reactive routing. It is shown that with the proposed coded caching scheme any content can be retrieved by selecting a random path while achieving asymptotic optimum solution. We have also studied the cache hit probability and shown that the coded cache hit probability is significantly higher than uncoded caching. A secure caching update algorithm is also presented.

6 October 2016 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
BABita Azimdoost
Bita Azimdoost
CWCedric Westphal
Cedric Westphal
HSHamid R. Sadjadpour
Hamid R. Sadjadpour
Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and latency in an information-centric network when the data cached in each node has a limited lifetime. The results show that with some fixed request and cache expiration rates, the order of the data access time does not change with network growth, and the maximum throughput order is not changing with the network growth in grid networks and is inversely proportional to the number of nodes in one cell in random networks. Comparing these values with the corresponding throughput and latency with no cache capability (throughput inversely proportional to the network size, and latency of order √n and the inverse of the transmission range in grid and random networks, respectively), we can actually quantify the asymptotic advantage of caching. Moreover, we compare these scaling laws for different content discovery mechanisms and illustrate that not much gain is lost when a simple path search is used.

20 December 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JOJose Armando Oviedo
Jose Armando Oviedo
HSHamid R. Sadjadpour
Hamid R. Sadjadpour
For downlink multi-user non-orthogonal multiple access (NOMA) systems with successive interference cancellation (SIC) receivers, and a base-station not possessing the instantaneous channel gains, the fundamental relationship between the target rates and power allocation is investigated. It is proven that the total interference from signals not removed by SIC has a fundamental upper limit which is a function of the target rates, and the outage probability is one when exceeding this limit. The concept of well-behaved power allocation strategies is defined, and its properties are proven to be derived solely based on the target rates. The existence of power allocation strategies that enable NOMA to outperform OMA in per-user outage probability is proven, and are always well-behaved for the case when the outage probability performance of NOMA and OMA are equal for all users. The proposed SIC decoding order is then shown to the most energy efficient. The derivation of well-behaved power allocation strategies that have improved outage probability performance over OMA for each user is outlined. Simulations validate the theoretical results, demonstrating that NOMA systems can always outperform OMA systems in outage probability performance, without relying on the exact channel gains.

8 September 2016
Verified
Conference Paper
Closed access
MKMohsen Karimzadeh Kiskani
Mohsen Karimzadeh Kiskani
HSHamid R. Sadjadpour
Hamid R. Sadjadpour
The capacity of next generation of cellular networks using femtocaches is studied when multihop communications and decentralized cache placement are considered. We show that the storage capability of future network User Terminals (UT) can be effectively used to increase the capacity in random decentralized uncoded caching. We further propose a random decentralized coded caching scheme which achieves higher capacity results than the random decentralized uncoded caching. The result shows that coded caching which is suitable for systems with limited storage capabilities can improve the capacity of cellular networks by a factor of log(n) where n is the number of nodes served by the femtocache.