Papers published on a yearly basis
Papers
More filters
••
TL;DR: The UAV-enabled relay communication is investigated, where the UAV relay forwards the information received from the ground source node to the ground destination node under malicious jamming, and an efficient algorithm is proposed based on the block coordinate descent (BCD) and successive convex approximation techniques.
Abstract: In this letter, the UAV-enabled relay communication is investigated, where the UAV relay forwards the information received from the ground source node to the ground destination node under malicious jamming. We aim to maximize the end-to-end throughput by optimizing the trajectory of UAV and transmit power of both UAV and source node jointly. However, the formulated problem is intractable due to the non-convex objective function and constraints. Thus, with the aid of slack variables, we propose an efficient algorithm to solve it based on the block coordinate descent (BCD) and successive convex approximation (SCA) techniques. Numerical results are provided to show that the joint design of trajectory and power control improves the throughput significantly.
22 citations
••
TL;DR: In this article, superhydrophobic conjugated microporous polymer-coated sponges (CMP@sponges) were synthesized by the in-situ Sonogashira polymerization of monomers with multiple carboxyl or hydroxy functional groups in the presence of melamine sponge in a one-pot synthesis.
22 citations
••
TL;DR: A substantial body of scholarship has long explored the ways emerging media may foster and also hamper an informed and engaged citizenry as mentioned in this paper, and it is worth noting that, individually, digital media have become an integral part of...
Abstract: A substantial body of scholarship has long explored the ways emerging media may foster and also hamper an informed and engaged citizenry. Individually, digital media have become an integral part of...
22 citations
••
TL;DR: This paper examines the connection outage probability and secrecy outage probability to investigate the reliability and security performance in two cases, where the secondary destination exploits the maximum ratio combining (MRC) scheme or the selection combining (SC) scheme, and investigates the effective secrecy throughput performance by including the COP and SOP in a unified manner.
Abstract: In this paper, we consider the secure communications in a cognitive untrusted relay network, where the secondary source intends to communicate with a secondary destination through an untrusted relay in the presence of the direct source–destination link. Specifically, we first examine the connection outage probability (COP) and secrecy outage probability (SOP) to investigate the reliability and security performance in two cases, where the secondary destination exploits the maximum ratio combining (MRC) scheme or the selection combining (SC) scheme. To characterize the tradeoff between reliability and security, we then investigate the effective secrecy throughput (EST) performance by including the COP and SOP in a unified manner. In order to gain additional insights from the performance evaluation, we also provide the asymptotic expressions for the COP, SOP, and EST in high signal-to-noise ratio region. It is demonstrated that the interference temperature constraint incurred from the primary network enables a tradeoff between reliability and security of the secondary network. Moreover, the resulting analysis shows that using the untrusted relay to forward the transmitted message is unnecessary when the secondary destination employs the SC scheme and the untrusted relay operates in half-duplex mode.
22 citations
••
TL;DR: The distributed cooperative hybrid caching problem based on content-awareness in device-to-device networks is studied and the modified log-linear learning algorithm achieves better performance compared with other algorithms, and the content-aware hybrid caching reduces the cost.
Abstract: The distributed cooperative hybrid caching problem based on content-awareness in device-to-device networks is studied in this letter. Besides caching from the base station, nodes also can cache files from nearby nodes. We also consider the content similarity between caching nodes, which would reduce the cost further through caching similar traffic from one source cooperatively. We model the cost reducing problem as a local cooperative game, and prove it to be an exact potential game, which has at least one pure Nash equilibrium (NE). Fortunately, the potential function is just the aggregate cost of the network, which means the NE point minimizes the total cost. We modified the log-linear learning algorithm and designed a half-fixed action to reduce the strategy space, and with random action to pursue better performance. The simulation results show that the modified log-linear learning algorithm achieves better performance compared with other algorithms, and the content-aware hybrid caching reduces the cost.
22 citations
Authors
Showing all 2106 results
Name | H-index | Papers | Citations |
---|---|---|---|
Xiang-Gen Xia | 72 | 744 | 20563 |
Wei Xiong | 58 | 364 | 10835 |
S. Shyam Sundar | 53 | 210 | 10261 |
Mary Beth Oliver | 40 | 151 | 6854 |
James E. Katz | 39 | 152 | 8957 |
Qihui Wu | 39 | 295 | 7001 |
Timothy L. Sellnow | 37 | 137 | 5557 |
Homero Gil de Zúñiga | 37 | 134 | 8158 |
J. David Johnson | 31 | 100 | 3924 |
Zizi Papacharissi | 30 | 63 | 9078 |
Guoru Ding | 30 | 155 | 4729 |
Jinlong Wang | 29 | 127 | 3201 |
Yueming Cai | 29 | 206 | 3198 |
Yuhua Xu | 29 | 170 | 4196 |
Panlong Yang | 27 | 191 | 2374 |