检索结果-内蒙古大学图书馆

Communications and Networking (MeditCom), IEEE International Mediterranean Conference on

作者： Subhojit Sarkar Rathindra Nath Dutta Sasthi C. Ghosh Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Unmanned Aerial Vehicles (UAVs) are a potential platform for deploying millimeter wave (mmWave) base stations. Their high spatial flexibility makes them an attractive choice for the deployment in disaster management scenarios, and for offloading in crowded areas. Apart from the stringent propagation requirements of mmWaves, one challenge that has to be addressed is the limited power onboard a UAV, which is used to hover and move the device, and of course, to transmit data. In this paper, we deal with the deployment of UAVs with an aim to minimising their displacement in subsequent time. We take into consideration user mobility, and propose LazyUAV, a Set-Cover based geometric approach to minimise UAV displacement, while maintaining maximal coverage. Via extensive simulations, we demonstrate the effectiveness of our approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Non-optimal is Good! Resource Allocation in Presence of Dynamic Obstacles in D2D Networks

Non-optimal is Good! Resource Allocation in Presence of Dyna...

引用

Conference on Local Computer Networks (LCN)

作者： Rathindra Nath Dutta Sasthi C. Ghosh Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

To cope with high bandwidth demands of modern applications, device-to-device (D2D) communications using millimeter-wave (mmWave) signals are being harnessed. The major challenge of mmWave signals is that they require a strict, obstacle-free line-of-sight communication. Static obstacles are easier to avoid; dynamic obstacles pose the main hurdle, their movement not being known. In this work, we propose a way to learn link blockages due to dynamic obstacles, using the link activation history. For this, one might have to explore non-optimal link activations. This ensures that all links are tried a sufficient number of times, ensuring adequate knowledge about link failures, thus creating an exploration-exploitation dilemma. To this end, we propose a systematic way of exploring such non-optimal channel allocations, so that the number of link failures is minimized. Given the hardness of this problem, we devise a greedy solution, and show its effectiveness over existing strategies through simulations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Resource Allocation for D2D Communications using Reinforcement Learning

Energy Efficient Resource Allocation for D2D Communications ...

引用

Conference on Local Computer Networks (LCN)

作者： Rathindra Nath Dutta Sasthi C. Ghosh Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

The millimeter-wave (mmWave) device-to-device (D2D) communication is already being employed to satisfy the high datarate demand of the internet-of-things nodes. Using mmWave signals has its own challenges as it suffers from high penetration losses. Therefore, presence of dynamic obstacles further complicates the already hard problem of allocation of channel resources to the demanding nodes. In this work, we have proposed a reinforcement learning (RL) based framework to jointly allocate the frequency channels as well as assign the transmit-powers to the demanding D2D pairs in order to maximize the energy-efficiency in presence of dynamic obstacles. We justify our choice of reward function through a formal proof and also ensure the convergence of the algorithm. Through extensive simulations, we show that our proposed RL framework not only converges, but also outperforms an existing approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimized QAOA ansatz circuit design for two-body Hamiltonian problems

Optimized QAOA ansatz circuit design for two-body Hamiltonia...

引用

International Conference on VLSI Design

作者： Ritajit Majumdar Dhiraj Madan Debasmita Bhoumik Dhinakaran Vinayagamurthy Shesha Raghunathan Susmita Sur-Kolay IBM Quantum IBM India Research Lab Advanced Computing & Microelectronics Unit Indian Statistical Institute

Quantum Approximate Optimization Algorithm (QAOA) is a prospective candidate for providing quantum advantage in finding approximate solutions to optimization problems using near-term quantum devices. In this paper, the goal is to reduce the number of CNOT gates and the depth of quantum ansatz circuits for QAOA. First, we present a generalized QAOA formulation for any Hamiltonian that involves upto two-body interactions, as a graph. The circuit realization of the depth-p QAOA requires $2mp$ CNOT gates where the graph for the Hamiltonian has n vertices and m edges. Presently, a CNOT gate is one of the primary sources of error. We propose a graph-theoretic algorithm which can eliminate $n-1$ CNOTs from the QAOA ansatz while retaining functional equivalence with the original circuit. This improves upon previously proposed Depth First Search (DFS) method by restricting the increase in depth of the circuit, which was a drawback of the method, by $\simeq 84.8\%$ for Erdős-Renyi graphs. Finally, if the underlying connectivity (hardware coupling map) and the initial qubit placement for a hardware are known, then we present how to extend the greedy heuristic method in order to obtain a functionally equivalent circuit with $\simeq 5\%$; fewer SWAP gates for Erdős-Renyi graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DRAMS: Double-RIS Assisted Multihop Routing Scheme for Device-to-Device Communication

arXiv

引用

arXiv 2023年

作者： Sau, Lakshmikanta Mukherjee, Priyadarshi Ghosh, Sasthi C. The Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata700108 India

Reconfigurable intelligent surfaces (RISs) is a promising solution for enhancing the performance of multihop wireless communication networks. In this paper, we propose a double-RIS assisted multihop routing scheme for a device-to-device (D2D) communication network. Specifically, the scheme is dependent on the already deployed RISs and users in the surroundings. Besides the RISs, the emphasis of this work is to make more use of the existing intermediate users (IUs), which can act as relays. Hence, the density of RIS deployment in the surroundings can be reduced, which leads to the avoidance of resource wastage. However, we cannot solely depend on the IUs because this implies complete dependence on their availability for relaying and as a result, the aspect of reliability in terms of delay-constrained information transfer cannot be guaranteed. Moreover, the IUs are considered capable of energy harvesting and as a result, they do not waste their own energy in the process of volunteering to act as a relay for other users. Numerical results demonstrate the advantage of the proposed scheme over some existing approaches and lastly, useful insights related to the scheme design are also drawn, where we characterize the maximum acceptable delay at each hop under different set-ups. © 2023, CC BY-NC-ND.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

DCSK-based Waveform Design for Self-sustainable RIS-aided Noncoherent SWIPT

引用

IEEE Transactions on Communications 2025年

作者： Mukherjee, Priyadarshi Psomas, Constantinos Krikidis, Ioannis Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India University of Cyprus Department of Electrical and Computer Engineering Nicosia1678 Cyprus

This paper investigates the problem of transmit waveform design in the context of a chaotic signal-based self-sustainable reconfigurable intelligent surface (RIS)-aided system for simultaneous wireless information and power transfer (SWIPT). Specifically, we propose a differential chaos shift keying (DCSK)-based RIS-aided point-to-point set-up, where the RIS is partitioned into two non-overlapping surfaces. The elements of the first sub-surface perform energy harvesting (EH), which in turn, provide the required power to the other sub-surface operating in the information transfer (IT) mode. In this framework, by considering a generalized frequency-selective Nakagami-m fading scenario as well as the nonlinearities of the EH process, we derive closed-form analytical expressions for both the bit error rate (BER) at the receiver and the harvested power at the RIS. Our analysis demonstrates, that both these performance metrics depend on the parameters of the wireless channel, the transmit waveform design, and the number of reflecting elements at the RIS, which switch between the IT and EH modes, depending on the application requirements. Moreover, we show that, having more reflecting elements in the IT mode is not always beneficial and also, for a given acceptable BER, we derive a lower bound on the number of RIS elements that need to be operated in the EH mode. Furthermore, for a fixed RIS configuration, we investigate a trade-off between the achievable BER and the harvested power at the RIS and accordingly, we propose appropriate transmit waveform designs. Finally, our numerical results illustrate the importance of our intelligent DCSK-based waveform design on the considered framework. © 1972-2012 IEEE.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Modeling and Verification of Service Allocation Policies for Multi-Access Edge computing Using Probabilistic Model Checking

Modeling and Verification of Service Allocation Policies for...

引用

作者： Ray, Kaustabha Banerjee, Ansuman Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In recent times, Multi-Access Edge computing (MEC) has emerged as a new paradigm allowing low-latency access to services deployed on edge nodes offering computation, storage and communication facilities. Vendors deploy their services on MEC servers to improve performance and mitigate network latencies often encountered in accessing cloud services. An allocation policy determines how to allocate service requests from users to MEC servers. A number of proposals for binding user service requests to nearby edge servers enroute have been proposed in literature. However, none of these proposals, to the best of our knowledge, provide quantitative guarantees on performance metrics. Indeed, the evolving environment, along with a large allocation configuration space makes proving performance guarantees for such allocation policies a challenging task. Further, the implications of MEC server failures on allocation policies have been relatively unexplored. To address such issues, we propose a trace driven approach to derive a formal model of allocation policies and perform quantitative verification to produce probabilistic guarantees on performance metrics. We use the San Francisco taxi dataset, the LDNS availability dataset and allocation policies from recent literature to validate our approach. Experimental results demonstrate how our model can be utilized to quantitatively compare performance metrics of service allocation policies in MEC systems. © 2004-2012 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Pre-emptive Spectrum Access in Cognitive Radio for Better QoS 4th

Pre-emptive Spectrum Access in Cognitive Radio for Better Q...

引用

4th International Conference on advanced computing and Intelligent Engineering, ICACIE 2019

作者： Das, Avirup Karar, Sandip Das, Nabanita Ghosh, Sasthi C. Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9789811565830

Cognitive radio techniques are becoming very popular to overcome the spectrum scarcity. For dynamic channel access, spectrum latency is a major bottleneck to achieve good QoS. In this paper, we have proposed distributed proactive channel scanning for different channel assignment policies of primary users (PUs). From periodic channel scanning, secondary users (SUs) store recent history of channel occupancy, and based on that decide the order of channel selection when demand comes, and switch channels proactively, if any better channel appears. For various channel allocation strategies of primary users, different channel selection algorithms are presented for secondary users to improve the spectrum latency as well as the channel switching overhead per call. Through simulation, the performance of the proposed strategies is compared with that of conventional cognitive radio. Results show that by the proposed scheme, the call drop/block rate decreases by more than 30 % with significant reduction in interference, and hence improving the QoS of the system. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Query complexity of global minimum cut 24

Query complexity of global minimum cut

引用

24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021 and 25th International Conference on Randomization and Computation, RANDOM 2021

作者： Bishnu, Arijit Ghosh, Arijit Mishra, Gopinath Paraashar, Manaswi Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783959772075

In this work, we resolve the query complexity of global minimum cut problem for a graph by designing a randomized algorithm for approximating the size of minimum cut in a graph, where the graph can be accessed through local queries like Degree, Neighbor, and Adjacency queries. Given ϵ ∈ (0, 1), the algorithm with high probability outputs an estimate t satisfying the following (1 − ϵ)t ≤ t ≤ (1 + ϵ)t, where t is the size of minimum cut in the graph. The expected number of local queries used by our algorithm is min {m + n, mt poly (log n, 1ϵ) where n and m are the number of vertices and edges in the graph, respectively. Eden and Rosenbaum showed that Ω(m/t) local queries are required for approximating the size of minimum cut in graphs, but no local query based algorithm was known. Our algorithmic result coupled with the lower bound of Eden and Rosenbaum [APPROX 2018] resolve the query complexity of the problem of estimating the size of minimum cut in graphs using local queries. Building on the lower bound of Eden and Rosenbaum, we show that, for all t ∈ N, Ω(m) local queries are required to decide if the size of the minimum cut in the graph is t or t − 2. Also, we show that, for any t ∈ N, Ω(m) local queries are required to find all the minimum cut edges even if it is promised that the input graph has a minimum cut of size t. Both of our lower bound results are randomized, and hold even if we can make Random Edge queries in addition to local queries. © Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar;licensed under Creative Commons License CC-BY 4.0

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Machine Learning based Decoding of Heavy Hexagonal QECC for Asymmetric Quantum Noise

Machine Learning based Decoding of Heavy Hexagonal QECC for ...

引用

IEEE Computer Society Annual Symposium on VLSI

作者： Debasmita Bhoumik Ritajit Majumdar Dhiraj Madan Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute India IBM Quantum IBM India Research Lab

ISBN: (数字)9798350354119

ISBN: (纸本)9798350354126

Decoding error syndromes for topological quantum error correcting codes, such as surface and heavy hexagonal codes, is computationally expensive. While minimum weight perfect matching (MWPM) algorithms have been commonly used for decoding, recent works have demonstrated the efficacy of machine learning (ML), particularly neural networks, in decoding syndromes for these codes. In this study, we introduce a ML-based decoder tailored to heavy hexagonal code to address asymmetric noise channels which reflect real-world scenario better than the depolarization model considered in previous works. Our proposed decoder shows $\sim 5\times$ and $\sim 22\times$ improvements in the threshold values for amplitude and amplitude-phase damping noise models respectively over MWPM methods. Our decoder is also robust to changes in asymmetry, with the threshold reducing by only ~ 3.6% for a $10\times$ change in asymmetry.

关键词： Damping Quantum computing Machine learning algorithms Noise Neural networks Machine learning Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：