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

arXiv 2025年

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

Reconfigurable intelligent surfaces (RISs) offer a viable way to improve the performance of the multi-hop device-to-device (D2D) communication. However, due to the substantial propagation and penetration losses of the millimeter waves (mmWaves), a direct line of sight (LoS) link and close proximity of a device pair are required for a high data rate. Static obstacles like trees and buildings can easily impede the direct LoS connectivity between a device pair. Hence, RIS placement plays a crucial role in establishing an indirect LoS link between them. Therefore, in this work, we propose a set cover-based RIS deployment strategy for both single and double RIS-assisted D2D communication. In particular, we have demonstrated that permitting reflections via two consecutive RISs can greatly lower the RIS density in the environment, preventing resource waste and enabling the service of more obstructed device pairs. After the RIS deployment, for information transfer, we also propose an energy-efficient group selection criteria. Moreover, we prove that sometimes double reflections are more beneficial than single reflection, which is counter-intuitive. Numerical results show that our approach outperforms a random and a recent deployment strategy. © 2025, CC BY-NC-SA.

关键词： Clutter (information theory)

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient UAV movement and user-UAV association in multi-UAV networks

arXiv

引用

arXiv 2025年

作者： Ghosh, Subhadip Mukherjee, Priyadarshi Ghosh, Sasthi C. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

These days, unmanned aerial vehicle (UAV)-based millimeter wave (mmWave) communication systems have drawn a lot of attention due to the increasing demand for faster data rates. Given the susceptibility of mmWave signals to obstacles and high propagation loss of mmWaves, ensuring line-of-sight (LoS) connectivity is critical for maintaining robust and efficient communication. Furthermore, UAVs have limited power resource and limited capacity in terms of number of users it can serve. Most significantly different users have different delay requirements and they keep moving while interacting with the UAVs. In this paper, first, we have provided an efficient solution for the optimal movement of the UAVs, by taking into account the energy efficiency of the UAVs as well as the mobility and delay priority of the users. Next, we have proposed a greedy solution for the optimal user-UAV assignment. After that, the numerical results show how well the suggested solution performs in comparison to the current benchmarks in terms of delay suffered by the users, number of unserved users, and energy efficiency of the UAVs. © 2025, CC BY-NC-SA.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Constructing Rectilinear Steiner Minimum Tree with Conditional Generative Adversarial Network 38

Constructing Rectilinear Steiner Minimum Tree with Condition...

引用

38th International Conference on VLSI Design, VLSID 2025

作者： Saha, Kritanta Banerjee, Pritha Sur-Kolay, Susmita Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India Sister Nivedita University Department of Computer Science and Engineering Kolkata India University of Calcutta Department of Computer Science and Engineering Kolkata India

ISBN: (纸本)9798331522445

Given n points in the 2D plane which are the pins of a net, a Rectilinear Steiner Minimum Tree (RSMT) which consists only of vertical and horizontal line segments is the shortest network to interconnect the pins along with a few extra (Steiner) points. An RSMT for a net has a minimum total wirelength in Manhattan distance and acts as a backbone to many state-of-the-art global routers. However, finding an RSMT is NPcomplete. In this work, we propose a method for constructing an RSMT with an image-to-image translation using a conditional generative adversarial network (cGAN) based model. Images of RSMTs with optimal wirelength for randomly generated nets form our training dataset. Experimental results show that, after training, our model generates RSMTs with = 0.348% wirelength error on average compared with the optimal solution for nets with degrees up to 50. This is the first successful attempt to solve the RSMT construction problem as an image-to-image translation problem using a cGAN based model. © 2025 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Constructing Rectilinear Steiner Minimum Tree with Conditional Generative Adversarial Network

Constructing Rectilinear Steiner Minimum Tree with Condition...

引用

International Conference on VLSI Design

作者： Kritanta Saha Pritha Banerjee Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science and Engineering Sister Nivedita University Kolkata India Department of Computer Science and Engineering University of Calcutta Kolkata India

ISBN: (数字)9798331522445

ISBN: (纸本)9798331522452

Given n points in the 2D plane which are the pins of a net, a Rectilinear Steiner Minimum Tree (RSMT) which consists only of vertical and horizontal line segments is the shortest network to interconnect the pins along with a few extra (Steiner) points. An RSMT for a net has a minimum total wirelength in Manhattan distance and acts as a backbone to many state-of-the-art global routers. However, finding an RSMT is NPcomplete. In this work, we propose a method for constructing an RSMT with an image-to-image translation using a conditional generative adversarial network (cGAN) based model. Images of RSMTs with optimal wirelength for randomly generated nets form our training dataset. Experimental results show that, after training, our model generates RSMTs with $\leq 0.348\%$ wirelength error on average compared with the optimal solution for nets with degrees up to 50. This is the first successful attempt to solve the RSMT construction problem as an image-to-image translation problem using a cGAN based model.

关键词： Training Steiner trees Translation Computational modeling Machine learning Very large scale integration Generative adversarial networks Generators Pins Testing

来源：评论

学校读者我要写书评

暂无评论

Efficient and Fault-Tolerant Memristive Neural Networks with In-Situ Training

SSRN

引用

SSRN 2025年

作者： Prajapati, Santlal Mondal, Manobendra Nath Sur-Kolay, Susmita Indian Statistical Institute Advanced Computing and Microelectronics Unit West Bengal Kolkata700108 India UPES School of Computer Science Uttarakhand Dehradun248007 India Ashoka University Department of Computer Science Haryana Sonipat131029 India

In an artificial neural network (ANN), the most frequent and demanding operations are matrix-vector multiplication, vector-vector outer product, and weight matrix updates. These operations require parallel and in-memory processing hardware architectures to accelerate the training of the ANN. This article introduces a novel memristor-based multi-layer neural network (memristive MLNN) architecture featuring an efficient in-situ supervised training method based on gradient descent backpropagation. The proposed memristive MLNN can execute the aforementioned operations in O(1) time by leveraging in-memory and parallel computing capabilities. A single memristor without transistors is sufficient to realize a synapse. The performance of our architecture is evaluated by training and testing the memristive MLNN using the LTspice simulator, which achieved accuracies of 98.22%, 90.43%, and 98.59% on the IRIS, NASA asteroid, and Breast Cancer Wisconsin data sets respectively. The resilience of the architecture to memristor faults owing to a stuck-at-a-conducting state is assessed by injecting faults at certain percentages of randomly chosen memristors. The impact of nonlinearity, present in the memristor's conductance, on the accuracy of memristive MLNN is analyzed. We also evaluate the memristive MLNN's performance with a 10% variation in memristors. The simulation results establish that the network's performance is not affected significantly by non-linearity, device variation, and faulty memristors. © 2025, The Authors. All rights reserved.

关键词： NASA

来源：评论

学校读者我要写书评

暂无评论

Time varying channel estimation for RIS assisted network with outdated CSI: Looking beyond coherence time

引用

Computer Communications 2025年 240卷

作者： Souvik Deb Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata 700108 West Bengal India

The channel estimation (CE) overhead for unstructured multipath-rich channels increases linearly with the number of reflective elements of reconfigurable intelligent surface (RIS). This results in a significant portion of the channel coherence time being spent on CE, reducing data communication time. Furthermore, due to the mobility of the user equipment (UE) and the time consumed during CE, the estimated channel state information (CSI) may become outdated during actual data communication. In recent studies, the timing for CE has been primarily determined based on the coherence time interval, which is dependent on the velocity of the UE. However, the effect of the current channel condition and pathloss of the UEs can also be utilized to control the duration between successive CE to reduce the overhead while still maintaining the quality of service. Furthermore, for multi-user systems, the appropriate coherence time intervals of different users may be different depending on their velocities. Therefore CE carried out ignoring the difference in coherence time of different UEs may result in the estimated CSI being detrimentally outdated for some users. In contrast, others may not have sufficient time for data communication. To this end, based on the throughput analysis on outdated CSI, an algorithm has been designed to dynamically predict the next time instant for CE after the current CSI acquisition. In the first step, optimal RIS phase shifts to maximize channel gain is computed. Based on this and the amount of degradation of signal to interference plus noise ratio due to outdated CSI, transmit powers and bandwidth are allocated for the UEs and finally the next time instant for CE is predicted such that the aggregated throughput is maximized. Simulation results confirm that our proposed algorithm outperforms the coherence time-based strategies and an existing algorithm that adaptively changes inter CE duration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Growth rates of the number of empty triangles and simplices

引用

Computational Geometry 2026年 130卷

作者： Bhaswar B. Bhattacharya Sandip Das Sk Samim Islam Saumya Sen Department of Statistics and Data Science University of Pennsylvania USA Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Given a set P of n points in R 2 , in general position, denote by N 2 ( P ) the number of empty triangles with vertices in P . In this paper we investigate by how much N 2 ( P ) changes if a point x is removed from P . By constructing a graph G 2 ( x , P ) based on the arrangement of the empty triangles incident on x , we transform this geometric problem to the problem of counting triangles in the graph G 2 ( x , P ) . We study properties of the graph G 2 ( x , P ) and, in particular, show that it is diamond-free. This relates the growth rate of the number of empty triangles to the famous Ruzsa–Szemerédi problem. We also derive similar bounds for the growth rate of the number of empty simplices for point sets in R d .

关键词： Discrete geometry Empty triangles and simplices Extremal combinatorics Diamond-free graphs

来源：评论

学校读者我要写书评

暂无评论

On L(k, k-1, ..., 1) labeling of triangular lattice

引用

Electronic Notes in Discrete Mathematics 2015年 48卷 281-288页

作者： Nandi, Soumen Sen, Sagnik Ghosh, Sasthi C. Das, Sandip Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

An n - L(k, k-1, ..., 1) labeling of a simple graph G is a mapping f: V(G) → {0, 1, ..., n} such that |f(u) - f(v)| ≥ k+1 - d(u,v), for all u,v∈V(G), where d(u,v) is the length of the shortest path connecting u and v. The L(k, k-1, ..., 1) labeling span λk(F) of a family of graphs F is the minimum n for which each G∈F admits an n - L(k, k-1, ..., 1) labeling. For the family L3 of all subgraphs of an infinite triangular lattice we provide upper and lower bounds of λk(L3) for general k and show that the ratio of the upper and lower bound is at most 43. The upper bound is given by providing an assignment algorithm to the vertices of the infinite triangular lattice. © 2015 Elsevier B.V.

关键词： Approximation ratio Assignment algorithm Distance k - clique L(k, k-1, ..., 1) labeling span Triangular lattice

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：