arXiv subjects

Swades De

Publications and source records attributed to Swades De.

13 recordsLinked to original sources

arXiv2026

Adaptive Multi-UAV Relay Deployment Framework in Satellite Aerial Ground Integrated Systems

The sixth generation (6G) communication networks are expected to provide high data rates, ultra-reliable communication, and massive connectivity, especially in challenging environments such as dense urban areas and disaster-affected regions. However, traditional terrestrial-only networks face significant challenges in these scenarios, including signal blockages from high-rise buildings, traffic congestion, and dynamic user distributions. To address these limitations, we propose the adaptive multi-UAV deployment (AMUD) framework within satellite air-ground integrated networks (SAGINs). The AMUD framework dynamically deploys amplify-and-forward multiple unmanned aerial vehicle relay (UAVr) in with low Earth orbit (LEO) satellites to improve coverage, alleviate congestion, and ensure reliable communication in non-line-of-sight and high-demand conditions. We formulate an optimization problem that aims to jointly maximize the energy efficiency of the total network and the total capacity while ensuring the fairness of the total capacity and satisfying the users' requirements. The simulation results demonstrate that AMUD improves the total capacity of the network, improves the total energy efficiency, and increases the fairness of the capacity compared to traditional LEO satellite and ground base station (LEO-GBS) only systems.

eess.SP↗

arXiv2024

Cooperative UAV-Relay based Satellite Aerial Ground Integrated Networks

In the post-fifth generation (5G) era, escalating user quality of service (QoS) strains terrestrial network capacity, especially in urban areas with dynamic traffic distributions. This paper introduces a novel cooperative unmanned aerial vehicle relay-based deployment (CUD) framework in satellite air-ground integrated networks (SAGIN). The CUD strategy deploys an unmanned aerial vehicle-based relay (UAVr) in an amplify-andforward (AF) mode to enhance user QoS when terrestrial base stations fall short of network capacity. By combining low earth orbit (LEO) satellite and UAVr signals using cooperative diversity, the CUD framework enhances the signal to noise ratio (SNR) at the user. Comparative evaluations against existing frameworks reveal performance improvements, demonstrating the effectiveness of the CUD framework in addressing the evolving demands of next-generation networks.

eess.SY↗

arXiv2023

Joint Optimization of IRS Deployment and Passive Beamforming to Enhance the Received Power

Intelligent reflecting surface (IRS) has recently emerged as a promising technology for beyond fifth-generation (B5G) and 6G networks conceived from metamaterials that smartly tunes the signal reflections via a large number of low-cost passive reflecting elements. However, the IRS-assisted communication model and the optimization of available resources needs to be improved further for more efficient communications. This paper investigates the enhancement of received power at the user end in an IRS assisted wireless communication by jointly optimizing the phase shifts at the IRS elements and its location. Employing the conventional Friss transmission model, the relationship between the transmitted power and reflected power is established. The expression of received power incorporates the free space loss, reflection loss factor, physical dimension of the IRS panel, and radiation pattern of the transmit signal. Also, the expression of reflection coefficient of IRS panel is obtained by exploiting the existing data of radar communications. Initially exploring a single IRS element within a two-ray reflection model, we extend it to a more complex multi-ray reflection model with multiple IRS elements in 3D Cartesian space. The received power expression is derived in a more tractable form, then, it is maximized by jointly optimizing the underlying underlying variables, the IRS location and the phase shifts. To realize the joint optimization of underlying variables, first, the phase shifts of the IRS elements are optimized to achieve constructive interference of received signal components at the user. Subsequently, the location of the IRS is optimized at the obtained optimal phase shifts. Numerical insights and performance comparison reveal that joint optimization leads to a substantial 37% enhancement in received power compared to the closest competitive benchmark scheme.

cs.IT↗

arXiv2021

Data Trading with a Monopoly Social Network: Outcomes are Mostly Privacy Welfare Damaging

This paper argues that data of strategic individuals with heterogeneous privacy valuations in a distributed online social network (e.g., Facebook) will be under-priced, if traded in a monopoly buyer setting, and will lead to diminishing utilitarian welfare. This result, for a certain family of online community data trading problems, is in stark contrast to a popular information economics intuition that increased amounts of end-user data signals in a data market improves its efficiency. Our proposed theory paves the way for a future (counter-intuitive) analysis of data trading oligopoly markets for online social networks (OSNs).

cs.SI↗

arXiv2021

Aggregate Cyber-Risk Management in the IoT Age: Cautionary Statistics for (Re)Insurers and Likes

In this paper, we provide (i) a rigorous general theory to elicit conditions on (tail-dependent) heavy-tailed cyber-risk distributions under which a risk management firm might find it (non)sustainable to provide aggregate cyber-risk coverage services for smart societies, and (ii)a real-data driven numerical study to validate claims made in theory assuming boundedly rational cyber-risk managers, alongside providing ideas to boost markets that aggregate dependent cyber-risks with heavy-tails.To the best of our knowledge, this is the only complete general theory till date on the feasibility of aggregate cyber-risk management.

cs.PF↗

arXiv2020

Preference-Based Privacy Trading

The question we raise through this paper is: Is it economically feasible to trade consumer personal information with their formal consent (permission) and in return provide them incentives (monetary or otherwise)?. In view of (a) the behavioral assumption that humans are `compromising' beings and have privacy preferences, (b) privacy as a good not having strict boundaries, and (c) the practical inevitability of inappropriate data leakage by data holders downstream in the data-release supply-chain, we propose a design of regulated efficient/bounded inefficient economic mechanisms for oligopoly data trading markets using a novel preference function bidding approach on a simplified sellers-broker market. Our methodology preserves the heterogeneous privacy preservation constraints (at a grouped consumer, i.e., app, level) upto certain compromise levels, and at the same time satisfies information demand (via the broker) of agencies (e.g., advertising organizations) that collect client data for the purpose of targeted behavioral advertising.

cs.CY↗

arXiv2019

Utility Regions for DF Relay in OFDMA-based Secure Communication with Untrusted Users

This paper investigates the utility of a trusted decode-and-forward relay in OFDMA-based secure communication system with untrusted users. For deciding whether to use the relay or not, we first present optimal subcarrier allocation policies for direct communication (DC) and relayed communication (RC). Next we identify exclusive RC mode, exclusive DC mode, and mixed (RDC) mode subcarriers which can support both the modes. For RDC mode we present optimal mode selection policy and a suboptimal strategy independent of power allocation which is asymptotically optimal at both low and high SNRs. Finally, via numerical results we present insights on relay utility regions.

cs.IT↗

arXiv2019

OFDMA-based DF Secure Cooperative Communication with Untrusted Users

In this letter we consider resource allocation for OFDMA-based secure cooperative communication by employing a trusted Decode and Forward (DF) relay among the untrusted users. We formulate two optimization problems, namely, (i) sum rate maximization subject to individual power constraints on source and relay, and (ii) sum power minimization subject to a fairness constraint in terms of per-user minimum support secure rate requirement. The optimization problems are solved utilizing the optimality of KKT conditions for pseudolinear functions.

cs.IT↗

arXiv2019

Jammer-Assisted Resource Allocation in Secure OFDMA With Untrusted Users

In this paper, we consider the problem of resource allocation in the orthogonal frequency division multiple access system with single source and M untrusted users in presence of a friendly jammer. The jammer is used to improve either the weighted sum secure rate or the overall system fairness. The formulated optimization problem in both the cases is a mixed integer non-linear programming problem, belonging to the class of NP-hard. In the sum secure rate maximization scenario, we decouple the problem and first obtain the subcarrier allocation at source and the decision for jammer power utilization on a per-subcarrier basis. Then, we do joint source and jammer power allocation using primal decomposition and alternating optimization framework. Next, we consider fair resource allocation by introducing a novel concept of subcarrier snatching with the help of jammer. We propose two schemes for jammer power utilization, called proactively fair allocation (PFA) and on-demand allocation (ODA). PFA considers equitable distribution of jammer power among the subcarriers, while ODA distributes jammer power based on the user demand. In both cases of jammer usage, we also present suboptimal solutions that solve the power allocation at a highly reduced complexity. Asymptotically optimal solutions are derived to benchmark optimality of the proposed schemes. We compare the performance of our proposed schemes with equal power allocation at source and jammer. Our simulation results demonstrate that the jammer can indeed help in improving either the sum secure rate or the overall system fairness.

cs.IT↗

arXiv2019

Subcarrier Pairing as Channel Gain Tailoring: Joint Resource Allocation for Relay-Assisted Secure OFDMA with Untrusted Users

Joint resource allocation involving optimization of subcarrier allocation, subcarrier pairing (SCP), and power allocation in a cooperative secure orthogonal frequency division multiple access (OFDMA) communication system with untrusted users is considered. Both amplify and forward (AF), and decode and forward (DF) modes of operations are considered with individual power budget constraints for source and relay. After finding optimal subcarrier allocation for an AF relayed system, we prove the joint power allocation as a generalized convex problem, and solve it optimally. Compared to the conventional channel gain matching view, the optimal SCP is emphasized as a novel concept of channel gain tailoring. We prove that the optimal SCP pairs subcarriers such that the variance among the effective channel gains is minimized. For a DF relayed system, we show that depending on the power budgets of source and relay, SCP can either be in a subordinate role where it improves the energy efficiency, or in a main role where it improves the spectral efficiency of the system. In an AF relayed system we confirm that SCP plays a crucial role, and improves the spectral efficiency of the system. The channel gain tailoring property of SCP, various roles of SCP in improving the spectral and the energy efficiency of a cooperative communication system are validated with the help of simulation results.

cs.IT↗

arXiv2018

VNF Placement and Resource Allocation for the Support of Vertical Services in 5G Networks

One of the main goals of 5G networks is to support the technological and business needs of various industries (the so-called verticals), which wish to offer to their customers a wide range of services characterized by diverse performance requirements. In this context, a critical challenge lies in mapping in an automated manner the requirements of verticals into decisions concerning the network infrastructure, including VNF placement, resource assignment, and traffic routing. In this paper, we seek to make such decisions jointly, accounting for their mutual interaction, and efficiently. To this end, we formulate a queuing-based model and use it at the network orchestrator to optimally match the vertical's requirements to the available system resources. We then propose a fast and efficient solution strategy, called MaxZ, which allows us to reduce the solution complexity. Our performance evaluation, carried out accounting for multiple scenarios representative of real-world services, shows that MaxZ performs substantially better than state-of-the-art alternatives and consistently close to the optimum.

cs.NI↗

arXiv2018

Energy Sustainable IoT with Individual QoS Constraints Through MISO SWIPT Multicasting

Enabling technologies for energy sustainable Internet of Things (IoT) are of paramount importance since the proliferation of high data communication demands of low power network devices. In this paper, we consider a Multiple Input Single Output (MISO) multicasting IoT system comprising of a multiantenna Transmitter (TX) simultaneously transferring information and power to low power and data hungry IoT Receivers (RXs). Each IoT device is assumed to be equipped with Power Splitting (PS) hardware that enables Energy Harvesting (EH) and imposes an individual Quality of Service (QoS) constraint to the downlink communication. We study the joint design of TX precoding and IoT PS ratios for the considered MISO Simultaneous Wireless Information and Power Transfer (SWIPT) multicasting IoT system with the objective of maximizing the minimum harvested energy among IoT, while satisfying their individual QoS requirements. In our novel EH fairness maximization formulation, we adopt a generic Radio Frequency (RF) EH model capturing practical rectification operation, and resulting in a nonconvex optimization problem. For this problem, we first present an equivalent semi-definite relaxation formulation and then prove it possesses unique global optimality. We also derive tight upper and lower bounds on the globally optimal solution that are exploited in obtaining low complexity algorithmic implementations for the targeted joint design. Analytical expressions for the optimal TX beamforming directions, power allocation, and IoT PS ratios are also presented. Our representative numerical results including comparisons with benchmark designs corroborate the usefulness of proposed framework and provide useful insights on the interplay of critical system parameters.

cs.IT↗

arXiv2017

Energy-aware Mode Selection for Throughput Maximization in RF-Powered D2D Communications

Doubly-near-far problem in RF-powered networks can be mitigated by choosing appropriate device-to-device (D2D) communication mode and implementing energy-efficient information transfer (IT). In this work, we present a novel RF energy harvesting architecture where each transmitting-receiving user pair is allocated a disjoint channel for its communication which is fully powered by downlink energy transfer (ET) from hybrid access point (HAP). Considering that each user pair can select either D2D or cellular mode of communication, we propose an optimized transmission protocol controlled by the HAP that involves harvested energy-aware jointly optimal mode selection (MS) and time allocation (TA) for ET and IT to maximize the sum-throughput. Jointly global optimal solutions are derived by efficiently resolving the combinatorial issue with the help of optimal MS strategy for a given TA for ET. Closed-form expressions for the optimal TA in D2D and cellular modes are also derived to gain further analytical insights. Numerical results show that the joint optimal MS and TA, which significantly outperforms the benchmark schemes in terms of achievable RF-powered sum-throughput, is closely followed by the optimal TA scheme for D2D users. In fact, about $2/3$ fraction of the total user pairs prefer to follow the D2D mode for efficient RF-powered IT.

cs.IT↗