References of "Ottersten, Björn 50002797"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailUser Scheduling for Precoded Satellite Systems With Individual Quality of Service Constraints
Trinh, van Chien UL; Lagunas, Eva UL; Tung, Ta Hai et al

in Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Virtual Conference, Sept. 2021 (2021)

Detailed reference viewed: 84 (8 UL)
Full Text
Peer Reviewed
See detailAn Overview of Information-Theoretic Secrecy Analysis over Classical Wiretap Fading Channels
Kong; Ai, Yun; Lei, Lei et al

in EURASIP Journal on Wireless Communications and Networking (2021)

An alternative or supplementary approach named as physical layer security has been recently proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an ... [more ▼]

An alternative or supplementary approach named as physical layer security has been recently proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance investigations over the classic Alice-Bob-Eve wiretap fading channels is conducted. On the basis of the classic wiretap channel model, we have comprehensively listed and thereafter compared the existing works on physical layer secrecy analysis considering the small-scale, large-scale, composite, and cascaded fading channel models. Exact secrecy metrics expressions, including secrecy outage probability (SOP), the probability of non-zero secrecy capacity (PNZ), and average secrecy capacity (ASC), and secrecy bounds, including the lower bound of SOP and ergodic secrecy capacity, are presented. In order to encompass the aforementioned four kinds of fading channel models with a more generic and flexible distribution, the mixture gamma (MG), mixture of Gaussian (MoG), and Fox’s H- function distributions are three useful candidates to largely include the above-mentioned four kinds of fading channel models. It is shown that all they are flexible and general when assisting the secrecy analysis to obtain closed-form expressions. Their advantages and limitations are also highlighted. Conclusively, these three approaches are proven to provide a unified secrecy analysis framework and can cover all types of independent wiretap fading channel models. Apart from those, revisiting the existing secrecy enhancement techniques based on our system configuration, the on-off transmission scheme, artificial noise (AN) & artificial fast fading (AFF), jamming approach, antenna selection, and security region are presented. [less ▲]

Detailed reference viewed: 23 (3 UL)
Full Text
See detailPrecoding-Aided Bandwidth Optimization for High Throughput Satellite Systems
Abdu, Tedros Salih UL; Lei, Lei UL; Kisseleff, Steven UL et al

Scientific Conference (2021)

Linear precoding boosts the spectral efficiency of the satellite system by mitigating the interference signal. Typically, all users are precoded and share the same bandwidth regardless of the user demand ... [more ▼]

Linear precoding boosts the spectral efficiency of the satellite system by mitigating the interference signal. Typically, all users are precoded and share the same bandwidth regardless of the user demand. This bandwidth utilization is not efficient since the user demand permanently varies. Hence, demand-aware bandwidth allocation with linear precoding is promising. In this paper, we exploited the synergy of linear precoding and flexible bandwidth allocation for geostationary (GEO) high throughput satellite systems. We formulate an optimization problem with the goal to satisfy the demand by taking into account that multiple precoded user groups can share the different bandwidth chunks. Hence, optimal beam groups are selected with minimum bandwidth requirement to match the per beam demand. The simulation results show that the proposed method of combining bandwidth allocation and linear precoding has better bandwidth efficiency and demand satisfaction than benchmark schemes. [less ▲]

Detailed reference viewed: 58 (9 UL)
Full Text
Peer Reviewed
See detailInterference Mitigation Methods for Coexistence of Radar and Communication
Kumar, Sumit UL; Mishra, Vijay Kumar; Mysore Rama Rao, Bhavani Shankar UL et al

in 15th European Conference on Antennas and Propagation (EuCAP) (2021)

We consider a communications-centric spectrum sharing scenario where the communications link has a minimum service constraint in throughput and the radar maximizes its receive signal-to-interference-plus ... [more ▼]

We consider a communications-centric spectrum sharing scenario where the communications link has a minimum service constraint in throughput and the radar maximizes its receive signal-to-interference-plus-noise ratio (SINR). Prior works on joint power, allocation indicate that, under a communication-centric scenario, radar transmit power is gradually reduced as the throughput demand for communications link increases. Such an approach results in severe degradation of radar SINR, especially when the communications link suffers an outage. We propose methods based on successive-interference-cancellation to improve the radar SINR. This comprises both coexistence and coordination approaches. Numerical experiments show significant improvement in radar SINR when communications throughput demand rises and eventually goes into the outage. [less ▲]

Detailed reference viewed: 26 (7 UL)
Full Text
Peer Reviewed
See detailStochastic-Geometry-Based Interference Modeling in Automotive Radars Using Matérn Hard-Core Process
Mishra, K. V.; R., B. Shankar M.; Ottersten, Björn UL

in 2020 IEEE Radar Conference (RadarConf20), Stochastic-Geometry-Based Interference Modeling in Automotive Radars Using Matérn Hard-Core Process (2020, December 04)

As the use of radars in autonomous driving systems becomes more prevalent, these systems are increasingly susceptible to mutual interference. In this paper, we employ stochastic geometry to model the ... [more ▼]

As the use of radars in autonomous driving systems becomes more prevalent, these systems are increasingly susceptible to mutual interference. In this paper, we employ stochastic geometry to model the automotive radar interference in realistic traffic scenarios and then derive trade-offs between the radar design parameters and detection probability. Prior works model the locations of radars in the lane as a homogeneous Poisson point process (PPP). However, the PPP models assume all nodes to be independent, do not account for the lengths of vehicles, and ignore spatial mutual exclusion. In order to provide a more realistic interference effect, we adopt the Matérn hardcore process (MHCP) instead of PPP, in which two vehicles are not closer than an exclusion radius from one another. We show that the MHCP model leads to more practical design trade-offs for adapting the radar parameters than the conventional PPP model. [less ▲]

Detailed reference viewed: 33 (2 UL)
Full Text
Peer Reviewed
See detailState Aggregation for Multiagent Communication over Rate-Limited Channels
Mostaani, Arsham UL; Vu, Thang Xuan UL; Chatzinotas, Symeon UL et al

in State Aggregation for Multiagent Communication over Rate-Limited Channels (2020, December)

A collaborative task is assigned to a multiagent system (MAS) in which agents are allowed to communicate. The MAS runs over an underlying Markov decision process and its task is to maximize the averaged ... [more ▼]

A collaborative task is assigned to a multiagent system (MAS) in which agents are allowed to communicate. The MAS runs over an underlying Markov decision process and its task is to maximize the averaged sum of discounted one-stage rewards. Although knowing the global state of the environment is necessary for the optimal action selection of the MAS, agents are limited to individual observations. The inter-agent communication can tackle the issue of local observability, however, the limited rate of the inter-agent communication prevents the agent from acquiring the precise global state information. To overcome this challenge, agents need to communicate their observations in a compact way such that the MAS compromises the minimum possible sum of rewards. We show that this problem is equivalent to a form of rate-distortion problem which we call the task-based information compression. State Aggregation for Information Compression (SAIC) is introduced here to perform the task-based information compression. The SAIC is shown, conditionally, to be capable of achieving the optimal performance in terms of the attained sum of discounted rewards. The proposed algorithm is applied to a rendezvous problem and its performance is compared with two benchmarks; (i) conventional source coding algorithms and the (ii) centralized multiagent control using reinforcement learning. Numerical experiments confirm the superiority and fast convergence of the proposed SAIC. [less ▲]

Detailed reference viewed: 50 (11 UL)
Full Text
Peer Reviewed
See detailConstant Envelope MIMO-OFDM Precoding for Low Complexity Large-Scale Antenna Array Systems
Domouchtsidis, Stavros UL; Tsinos, Christos UL; Chatzinotas, Symeon UL et al

in IEEE Transactions on Wireless Communications (2020)

Herein, we consider constant envelope precoding in a multiple-input multiple-output orthogonal frequency division multiplexing system (CE MIMO-OFDM) for frequency selective channels. In CE precoding the ... [more ▼]

Herein, we consider constant envelope precoding in a multiple-input multiple-output orthogonal frequency division multiplexing system (CE MIMO-OFDM) for frequency selective channels. In CE precoding the signals for each transmit antenna are designed to have constant amplitude regardless of the channel realization and the information symbols that must be conveyed to the users. This facilitates the use of power-efficient components, such as phase shifters (PS) and nonlinear power amplifiers, which are key for the feasibility of large-scale antenna array systems because of their low cost and power consumption. The CE precoding problem is firstly formulated as a least-squares problem with a unit modulus constraint and solved using an algorithm based on coordinate descent. The large number of optimization variables in the case of the MIMO-OFDM system motivates the search for a more computationally efficient solution. To tackle this, we reformulate the CE precoding design into an unconstrained nonlinear least-squares problem, which is solved efficiently using the Gauss-Newton algorithm. Simulation results underline the efficiency of the proposed solutions and show that they outperform state of the art techniques. [less ▲]

Detailed reference viewed: 42 (9 UL)
Full Text
Peer Reviewed
See detailJoint User Grouping, Scheduling, and Precoding for Multicast Energy Efficiency in Multigroup Multicast Systems
Bandi, Ashok UL; Mysore Rama Rao, Bhavani Shankar UL; Chatzinotas, Symeon UL et al

in IEEE Transactions on Wireless Communications (2020)

This paper studies the joint design of user grouping, scheduling (or admission control) and precoding to optimize energy efficiency (EE) for multigroup multicast scenarios in single-cell multiuser MISO ... [more ▼]

This paper studies the joint design of user grouping, scheduling (or admission control) and precoding to optimize energy efficiency (EE) for multigroup multicast scenarios in single-cell multiuser MISO downlink channels. Noticing that the existing definition of EE fails to account for group sizes, a new metric called multicast energy efficiency (MEE) is proposed. In this context, the joint design is considered for the maximization of MEE, EE, and scheduled users. Firstly, with the help of binary variables (associated with grouping and scheduling) the joint design problem is formulated as a mixed-Boolean fractional programming problem such that it facilitates the joint update of grouping, scheduling and precoding variables. Further, several novel optimization formulations are proposed to reveal the hidden difference of convex/ concave structure in the objective and associated constraints. Thereafter, we propose a convex-concave procedure framework based iterative algorithm for each optimization criteria where grouping, scheduling, and precoding variables are updated jointly in each iteration. Finally, we compare the performance of the three design criteria concerning three performance metrics namely MEE, EE, and scheduled users through Monte-Carlo simulations. These simulations establish the need for MEE and the improvement from the system optimization. [less ▲]

Detailed reference viewed: 155 (29 UL)
Full Text
Peer Reviewed
See detailOversampled DFT-Modulated Biorthogonal Filter Banks: Perfect Reconstruction Designs and Multiplierless Approximations
Alves Martins, Wallace UL; Shankar, Bhavani UL; Ottersten, Björn UL

in IEEE Transactions on Circuits and Systems. II, Express Briefs (2020), 67(11), 2777-2781

We propose a novel methodology for designing oversampled discrete Fourier transform-modulated uniform filter banks. The analysis prototype is designed as a Nyquist filter, whereas the synthesis prototype ... [more ▼]

We propose a novel methodology for designing oversampled discrete Fourier transform-modulated uniform filter banks. The analysis prototype is designed as a Nyquist filter, whereas the synthesis prototype is designed to guarantee perfect reconstruction (PR) considering oversampling. The resulting optimization problem fits into the disciplined convex programming framework, as long as some convex objective function is employed, as the minimization of either the stop-band energy or the maximum deviation from a desired response. The methodology also accounts for near-PR multiplierless approximations of the prototype analysis and synthesis filters, whose coefficients are obtained in the sum-of-power-of-two (SOPOT) space. The quantized coefficients are computed using successive approximation of vectors, which is able to yield filters with a reduced number of SOPOT coefficients in a computationally efficient manner. The proposed methodology is especially appealing for supporting actual hardware deployments, such as modern digital transparent processors to be used in next-generation satellite payloads. [less ▲]

Detailed reference viewed: 243 (25 UL)
Full Text
Peer Reviewed
See detailActive Popularity Learning with Cache Hit Ratio Guarantees using a Matrix Completion Committee
Bommaraveni, Srikanth UL; Vu, Thang Xuan UL; Chatzinotas, Symeon UL et al

Scientific Conference (2020, October 08)

Edge caching is a promising technology to facethe stringent latency requirements and back-haul trafficoverloading in 5G wireless networks. However, acquiringthe contents and modeling the optimal cache ... [more ▼]

Edge caching is a promising technology to facethe stringent latency requirements and back-haul trafficoverloading in 5G wireless networks. However, acquiringthe contents and modeling the optimal cache strategy is achallenging task. In this work, we use an active learningapproach to learn the content popularities since it allowsthe system to leverage the trade-off between explorationand exploitation. Exploration refers to caching new fileswhereas exploitation use known files to cache, to achievea good cache hit ratio. In this paper, we mainly focus tolearn popularities as fast as possible while guaranteeing anoperational cache hit ratio constraint. The effectiveness ofproposed learning and caching policies are demonstratedvia simulation results as a function of variance, cache hitratio and used storage. [less ▲]

Detailed reference viewed: 57 (4 UL)
Full Text
Peer Reviewed
See detailHybrid Analog-Digital Precoding for mmWave Coexisting in 5G-Satellite Integrated Network
Peng, D.; Li, Y.; Chatzinotas, Symeon UL et al

in 2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Communications, title=Hybrid Analog-Digital Precoding for mmWave Coexisting in 5G-Satellite Integrated Network (2020, October 08)

Integrating massive multiple-input multiple-output (MIMO) into satellite network is regarded as an effective strategy to improve the spectral efficiency as well as the coverage of satellite communication ... [more ▼]

Integrating massive multiple-input multiple-output (MIMO) into satellite network is regarded as an effective strategy to improve the spectral efficiency as well as the coverage of satellite communication. However, the inevitable intra-system and inter-system interference deteriorate the total performance of system. In this paper, we consider precoding in the 5G Satellite Integrated Network (5GSIN) with the deployment of Massive MIMO and propagation of shared millimeter-wave (mmWave) link. Taking the requirements of both frequency efficiency and energy assumption into account, a hybrid analog and digital pre-coding scheme in the specific scenario of 5GSIN is proposed. We model sum rate maximization problem for both of satellite and terrestrial system that incorporates maximum power constrains and minimum achievable rate requirements and formulate to a convex power allocation problem with Minimum Mean Square Error (MMSE) norm and Logarithmic Linearization method. In order to balance between performance and complexity, we propose an analog and digital separated hybrid precoding algorithm to mitigate intra-system interference. Moreover, an iterative power allocation with interference mitigation algorithm is also devised to mitigate interference from satellite to terrestrial link so that power allocation can be executed by generalized iterative algorithm. Simulation results show that our proposed hybrid precoding algorithm in 5GSIN can improve the overall spectral efficiency with a small amount of iterations. [less ▲]

Detailed reference viewed: 65 (1 UL)
Full Text
Peer Reviewed
See detailResource Allocation for UAV Relay-Assisted IoT Communication Networks
Tran Dinh, Hieu UL; Nguyen, van Dinh UL; Gautam, Sumit UL et al

Scientific Conference (2020, October 06)

This work studies unmanned aerial vehicle (UAV) relay-assisted Internet of Things (IoT) communication networks in which a UAV is deployed as an aerial base station (BS) to collect time-constrained data ... [more ▼]

This work studies unmanned aerial vehicle (UAV) relay-assisted Internet of Things (IoT) communication networks in which a UAV is deployed as an aerial base station (BS) to collect time-constrained data from IoT devices and transfer information to a ground gateway (GW). In this context, we jointly optimize the allocated bandwidth, transmission power, as well as the UAV trajectory to maximize the total system throughput while satisfying the user’s latency requirement and the UAV’s limited storage capacity. The formulated problem is strongly nonconvex which is very challenging to solve optimally. Towards an appealing solution, we first introduce new variables to convert the original problem into a computationally tractable form, and then develop an iterative algorithm for its solution by leveraging the inner approximation method. Numerical results are given to show [less ▲]

Detailed reference viewed: 199 (13 UL)
Full Text
Peer Reviewed
See detailSDR IMPLEMENTATION OF A TESTBED FOR SYNCHRONIZATION OF COHERENT DISTRIBUTED REMOTE SENSING SYSTEMS
Merlano Duncan, Juan Carlos UL; Querol, Jorge UL; Martinez Marrero, Liz UL et al

in Proceedings of IEEE International Geoscience and Remote Sensing Symposium 2020 (2020, September 26)

Remote Sensing from distributed platforms has become attractive for the community in the last years. Phase, frequency, and time synchronization are a crucial requirement for many such applications as ... [more ▼]

Remote Sensing from distributed platforms has become attractive for the community in the last years. Phase, frequency, and time synchronization are a crucial requirement for many such applications as multi-static remote sensing and also for distributed beamforming for communications. The literature on the field is extensive, and in some cases, the requirements an complexity of the proposed synchronization solution may surpass the ones set by the application itself. Moreover, the synchronization solution becomes even more challenging when the nodes are flying or hovering on aerial or space platforms. In this work, we discuss the synchronization considerations for the implementation of distributed remote sensing applications. The general framework considered is based on a distributed collection of autonomous nodes that synchronize their clocks with a common reference using inter-satellite links. For this purpose, we implement a synchronization link between two nodes operating in a full-duplex fashion. The experimental testbed uses commercially available SDR platforms to emulate two satellites, two targets, and the communication channel. The proposal is evaluated considering phase and frequency errors for different system parameters. [less ▲]

Detailed reference viewed: 55 (7 UL)
Full Text
Peer Reviewed
See detailActor-Critic Deep Reinforcement Learning for Energy Minimization in UAV-Aided Networks
Yuan, Yaxiong UL; Lei, Lei UL; Vu, Thang Xuan UL et al

in 2020 European Conference on Networks and Communications (EuCNC) (2020, September 21)

In this paper, we investigate a user-timeslot scheduling problem for downlink unmanned aerial vehicle (UAV)-aided networks, where the UAV serves as an aerial base station. We formulate an optimization ... [more ▼]

In this paper, we investigate a user-timeslot scheduling problem for downlink unmanned aerial vehicle (UAV)-aided networks, where the UAV serves as an aerial base station. We formulate an optimization problem by jointly determining user scheduling and hovering time to minimize UAV’s transmission and hovering energy. An offline algorithm is proposed to solve the problem based on the branch and bound method and the golden section search. However, executing the offline algorithm suffers from the exponential growth of computational time. Therefore, we apply a deep reinforcement learning (DRL) method to design an online algorithm with less computational time. To this end, we first reformulate the original user scheduling problem to a Markov decision process (MDP). Then, an actor-critic-based RL algorithm is developed to determine the scheduling policy under the guidance of two deep neural networks. Numerical results show the proposed online algorithm obtains a good tradeoff between performance gain and computational time. [less ▲]

Detailed reference viewed: 73 (7 UL)
Full Text
Peer Reviewed
See detailWeighted Sum-SINR and Fairness Optimization for SWIPT-Multigroup Multicasting Systems with Heterogeneous Users
Gautam, Sumit UL; Lagunas, Eva UL; Sharma, Shree Krishna UL et al

in IEEE Open Journal of the Communications Society (2020)

The development of next generation wireless communication systems focuses on the expansion of existing technologies, while ensuring an accord between various devices within a system. In this paper, we ... [more ▼]

The development of next generation wireless communication systems focuses on the expansion of existing technologies, while ensuring an accord between various devices within a system. In this paper, we target the aspect of precoder design for simultaneous wireless information and power transmission (SWIPT) in a multi-group (MG) multicasting (MC) framework capable of handling heterogeneous types of users, viz., information decoding (ID) specific, energy harvesting (EH) explicit, and/or both ID and EH operations concurrently. Precoding is a technique well-known for handling the inter-user interference in multi-user systems, however, the joint design with SWIPT is not yet fully exploited. Herein, we investigate the potential benefits of having a dedicated precoder for the set of users with EH demands, in addition to the MC precoding. We study the system performance of the aforementioned system from the perspectives of weighted sum of signal-to-interference-plus-noise-ratio (SINR) and fairness. In this regard, we formulate the precoder design problems for (i) maximizing the weighted sum of SINRs at the intended users and (ii) maximizing the minimum of SINRs at the intended users; both subject to the constraints on minimum (non-linear) harvested energy, an upper limit on the total transmit power and a minimum SINR required to close the link. We solve the above-mentioned problems using distinct iterative algorithms with the help of semi-definite relaxation (SDR) and slack-variable replacement (SVR) techniques, following suitable transformations pertaining the problem convexification. The main novelty of the proposed approach lies in the ability to jointly design the MC and EH precoders for serving the heterogeneously classified ID and EH users present in distinct groups, respectively. We illustrate the comparison between the proposed weighted sum-SINR and fairness models via simulation results, carried out under various parameter values and operating conditions. [less ▲]

Detailed reference viewed: 92 (17 UL)
Full Text
Peer Reviewed
See detailActive Content Popularity Learning and Caching Optimization with Hit Ratio Guarantees
Bommaraveni, Srikanth UL; Vu, Thang Xuan UL; Chatzinotas, Symeon UL et al

in Active Content Popularity Learning and Caching Optimization with Hit Ratio Guarantees (2020), 8

Edge caching is an effective solution to reduce delivery latency and network congestion by bringing contents close to end-users. A deep understanding of content popularity and the principles underlying ... [more ▼]

Edge caching is an effective solution to reduce delivery latency and network congestion by bringing contents close to end-users. A deep understanding of content popularity and the principles underlying the content request sequence are required to effectively utilize the cache. Most existing works design caching policies based on global content requests with very limited consideration of individual content requests which reflect personal preferences. To enable the optimal caching strategy, in this paper, we propose an Active learning (AL) approach to learn the content popularities and design an accurate content request prediction model. We model the content requests from user terminals as a demand matrix and then employ AL-based query-by-committee (QBC) matrix completion to predict future missing requests. The main principle of QBC is to query the most informative missing entries of the demand matrix. Based on the prediction provided by the QBC, we propose an adaptive optimization caching framework to learn popularities as fast as possible while guaranteeing an operational cache hit ratio requirement. The proposed framework is model-free, thus does not require any statistical knowledge about the underlying traffic demands. We consider both the fixed and time-varying nature of content popularities. The effectiveness of the proposed learning caching policies over the existing methods is demonstrated in terms of root mean square error, cache hit ratio, and cache size on a simulated dataset. [less ▲]

Detailed reference viewed: 213 (21 UL)
Peer Reviewed
See detailSHARP 2020: The 1st Shape Recovery from Partial Textured 3D Scans Challenge Results
Saint, Alexandre Fabian A UL; Kacem, Anis UL; Cherenkova, Kseniya UL et al

Scientific Conference (2020, August 23)

The SHApe Recovery from Partial textured 3D scans challenge, SHARP 2020, is the first edition of a challenge fostering and benchmarking methods for recovering complete textured 3D scans from raw ... [more ▼]

The SHApe Recovery from Partial textured 3D scans challenge, SHARP 2020, is the first edition of a challenge fostering and benchmarking methods for recovering complete textured 3D scans from raw incomplete data. SHARP 2020 is organized as a workshop in conjunction with ECCV 2020. There are two complementary challenges, the first one on 3D human scans, and the second one on generic objects. Challenge 1 is further split into two tracks, focusing, first, on large body and clothing regions, and, second, on fine body details. A novel evaluation metric is proposed to quantify jointly the shape reconstruction, the texture reconstruction, and the amount of completed data. Additionally, two unique datasets of 3D scans are proposed, to provide raw ground-truth data for the benchmarks. The datasets are released to the scientific community. Moreover, an accompanying custom library of software routines is also released to the scientific community. It allows for processing 3D scans, generating partial data and performing the evaluation. Results of the competition, analyzed in comparison to baselines, show the validity of the proposed evaluation metrics and highlight the challenging aspects of the task and of the datasets. Details on the SHARP 2020 challenge can be found at https://cvi2.uni.lu/sharp2020/ [less ▲]

Detailed reference viewed: 133 (7 UL)
Full Text
See detailUAV Relay-Assisted Emergency Communications in IoT Networks: Resource Allocation and Trajectory Optimization
Tran Dinh, Hieu UL; Nguyen, van Dinh UL; Gautam, Sumit UL et al

E-print/Working paper (2020)

Unmanned aerial vehicle (UAV) communication has emerged as a prominent technology for emergency communications (e.g., natural disaster) in Internet of Things (IoT) networks to enhance the ability of ... [more ▼]

Unmanned aerial vehicle (UAV) communication has emerged as a prominent technology for emergency communications (e.g., natural disaster) in Internet of Things (IoT) networks to enhance the ability of disaster prediction, damage assessment, and rescue operations promptly. In this paper, a UAV is deployed as a flying base station (BS) to collect data from time-constrained IoT devices and then transfer the data to a ground gateway (GW). In general, the latency constraint at IoT users and the limited storage capacity of UAV highly hinder practical applications of UAV-assisted IoT networks. In this paper, full-duplex (FD) technique is adopted at the UAV to overcome these challenges. In addition, half-duplex (HD) scheme for UAV-based relaying is also considered to provide a comparative study between two modes (viz., FD and HD). Herein, a device is successfully served iff its data is collected by UAV and conveyed to GW within the flight time. In this context, we aim at maximizing the number of served IoT devices by jointly optimizing bandwidth and power allocation, as well as the UAV trajectory, while satisfying the requested timeout (RT) requirement of each device and the UAV’s limited storage capacity. The formulated optimization problem is troublesome to solve due to its non-convexity and combinatorial nature. Toward appealing applications, we first relax binary variables into continuous values and transform the original problem into a more computationally tractable form. By leveraging inner approximation framework, we derive newly approximated functions for non-convex parts and then develop a simple yet efficient iterative algorithm for its solutions. Next, we attempt to maximize the total throughput subject to the number of served IoT devices. Finally, numerical results show that the proposed algorithms significantly outperform benchmark approaches in terms of the number of served IoT devices and the amount of collected data. [less ▲]

Detailed reference viewed: 58 (5 UL)