Browse ORBilu by Open Access
- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?
ORBilu is a project developed by
   Throughput Enhancement in FD- and SWIPT-enabled IoT Networks over Non-Identical Rayleigh Fading Channel; Tran Dinh, Hieu  ; Chatzinotas, Symeon et alin IEEE Internet of Things Journal (2021) Simultaneous wireless information and power transfer (SWIPT) and full-duplex (FD) communications have emerged as prominent technologies in overcoming the limited energy resources in Internet-of-Things ... [more ▼] Simultaneous wireless information and power transfer (SWIPT) and full-duplex (FD) communications have emerged as prominent technologies in overcoming the limited energy resources in Internet-of-Things (IoT) networks and improving their spectral efficiency (SE). The article investigates the outage and throughput performance for a decode-and-forward (DF) relay SWIPT system, which consists of one source, multiple relays, and one destination. The relay nodes in this system can harvest energy from the source’s signal and operate in FD mode. A suboptimal, low-complexity, yet efficient relay selection scheme is also proposed. Specifically, a single relay is selected to convey information from a source to a destination so that it achieves the best channel from the source to the relays. An analysis of outage probability (OP) and throughput performed on two relaying strategies, termed static power splitting-based relaying (SPSR) and optimal dynamic power splitting-based relaying (ODPSR), is presented. Notably, we considered independent and non-identically distributed (i.n.i.d.) Rayleigh fading channels, which pose new challenges in obtaining analytical expressions. In this context, we derived exact closed-form expressions of the OP and throughput of both SPSR and ODPSR schemes. We also obtained the optimal power splitting ratio of ODPSR for maximizing the achievable capacity at the destination. Finally, we present extensive numerical and simulation results to confirm our analytical findings. Both simulation and analytical results show the superiority of ODPSR over SPSR. [less ▲] Detailed reference viewed: 50 (2 UL)Backscatter-Assisted Data Offloading inOFDMA-based Wireless Powered Mobile EdgeComputing for IoT Networks; Tran Dinh, Hieu ; et alin IEEE Internet of Things Journal (2021) Mobile edge computing (MEC) has emerged as a prominent technology to overcome sudden demands on computation-intensive applications of the Internet of Things (IoT) with finite processing capabilities ... [more ▼] Mobile edge computing (MEC) has emerged as a prominent technology to overcome sudden demands on computation-intensive applications of the Internet of Things (IoT) with finite processing capabilities. Nevertheless, the limited energy resources also seriously hinders IoT devices from offloading tasks that consume high power in active RF communications. Despite the development of energy harvesting (EH) techniques, the harvested energy from surrounding environments could be inadequate for power-hungry tasks. Fortunately, Backscatter communications (Backcom) is an intriguing technology to narrow the gap between the power needed for communication and harvested power. Motivated by these considerations, this paper investigates a backscatter-assisted data offloading in OFDMA-based wireless-powered (WP) MEC for IoT systems. Specifically, we aim at maximizing the sum computation rate by jointly optimizing the transmit power at the gateway (GW), backscatter coefficient, time-splitting (TS) ratio, and binary decision-making matrices. This problem is challenging to solve due to its non-convexity. To find solutions, we first simplify the problem by determining the optimal values of transmit power of the GW and backscatter coefficient. Then, the original problem is decomposed into two sub-problems, namely, TS ratio optimization with given offloading decision matrices and offloading decision optimization with given TS ratio. Especially, a closedform expression for the TS ratio is obtained which greatly enhances the CPU execution time. Based on the solutions of the two sub-problems, an efficient algorithm, termed the fast-efficient algorithm (FEA), is proposed by leveraging the block coordinate descent method. Then, it is compared with exhaustive search (ES), bisection-based algorithm (BA), edge computing (EC), and local computing (LC) used as reference methods. As a result, the FEA is the best solution which results in a near-globally-optimal solution at a much lower complexity as compared to benchmark schemes. For instance, the CPU execution time of FEA is about 0.029 second in a 50-user network, which is tailored for ultralow latency applications of IoT networks. [less ▲] Detailed reference viewed: 82 (4 UL) |
||
