2020 Iran Workshop on Communication and Information Theory (IWCIT)最新文献

Cooperative Abnormality Detection in Fluidic Medium Molecular Communication 流体介质分子通信中的协同异常检测

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/iwcit50667.2020.9163534

Ladan Khaloopour, M. Mirmohseni, M. Nasiri-Kenari

{"title":"Cooperative Abnormality Detection in Fluidic Medium Molecular Communication","authors":"Ladan Khaloopour, M. Mirmohseni, M. Nasiri-Kenari","doi":"10.1109/iwcit50667.2020.9163534","DOIUrl":"https://doi.org/10.1109/iwcit50667.2020.9163534","url":null,"abstract":"In this paper, we study the problem of cooperative abnormality detection using mobile sensors in a fluidic medium, based on a molecular communication setup. The sensors are injected into the medium to search the environment for the abnormality. To reduce the effects of sensor imperfection, we propose a cooperative scheme where the sensors activate each other by releasing some molecules (i.e., markers), into the medium after they sense an abnormality. A number of fusion centers (FC) are placed at specific locations in the medium, which absorb all sensors arrived at their locations. By observing the states of the received sensors, each FC decides whether an abnormality exists in its corresponding region or not. Then, it resets the sensors’ activation flags and releases them again into the medium to proceed with the next regions. In our model, both sensors’ imperfection and markers’ background noise are taken into account. We consider two sensor types, the memoryless sensors that get active based on the number of received markers in each sampling time and the aggregate sensors that get active based on the summation of received markers in all sampling times, before they reach the FC. We analyze the related binary hypothesis testing problem and obtain the probabilities of false alarm and misdetection for the memoryless and aggregate sensors. Then, we obtain the probability of error. It is shown that using sensors with the ability of activating each other can significantly improves the performance in terms of probability of error.","PeriodicalId":360380,"journal":{"name":"2020 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130385118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Peak Age of Information Analysis for Virtual Reality in Terahertz Communications 太赫兹通信中虚拟现实信息分析的巅峰时代

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/IWCIT50667.2020.9163486

Yasaman Khorsandmanesh, M. Emadi

{"title":"Peak Age of Information Analysis for Virtual Reality in Terahertz Communications","authors":"Yasaman Khorsandmanesh, M. Emadi","doi":"10.1109/IWCIT50667.2020.9163486","DOIUrl":"https://doi.org/10.1109/IWCIT50667.2020.9163486","url":null,"abstract":"Virtual Reality (VR) is one of the new promising use cases of the next generation wireless communications which requires high-throughput, low-latency, and reliable communications. For such services, the freshness of data could be measured by the age of information (AoI) metric. In this paper, we assume indoor small-cell Terahertz communications to serve VR users. Taking into account the wave propagation characteristics of the Terahertz communications and interference modeling in the small-cell networks, average peak AoI (PAoI) is investigated to analyse downlink data transmission to the VR users. Each small base station (SBS) is modeled by two M/M/1 and M/G/1 queues; One for data processing of VR data and the other for storing and transmitting information over the Terahertz channel in presence of blockage probability. Then, the average PAoI is extended to simultaneously support multi VR users with an SBS, and for a special case of large signaling bandwidth, average PAoI is also discussed. Finally, numerical results are provided to investigate the effects of signaling bandwidth, blockage probability, cell-density, and interference coverage of SBSs on the average PAoI of the considered system.","PeriodicalId":360380,"journal":{"name":"2020 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"95 22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129169408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

IRS-based Secrecy Rate Analysis in Presence of an Energy Harvesting Eavesdropper 存在能量收集窃听器的基于irs的保密率分析

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/IWCIT50667.2020.9163399

Mohammad Amin Saeidi, M. Emadi

引用次数: 6

IWCIT 2020 List of Authors IWCIT 2020年作者名单

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/iwcit50667.2020.9163479

引用次数: 0

The Information & Mutual Information Ratio for Counting Image Features and Their Matches 图像特征计数及其匹配的信息互信息比

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/iwcit50667.2020.9163458

Ali Khajegili Mirabadi, S. Rini

引用次数: 1

IWCIT 2020 Table of Content IWCIT 2020目录

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/iwcit50667.2020.9163466

引用次数: 0

Private Information Retrieval from Non-Replicated Databases with Optimal Message Size 从具有最佳消息大小的非复制数据库中检索私有信息

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/IWCIT50667.2020.9163525

S. N. Keramaati, Sadaf Salehkalaibar

引用次数: 1

A Novel Algorithm for Comparison-limited Vector Quantization 一种新的比较受限矢量量化算法

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/IWCIT50667.2020.9163531

Joseph Chataignon, S. Rini

{"title":"A Novel Algorithm for Comparison-limited Vector Quantization","authors":"Joseph Chataignon, S. Rini","doi":"10.1109/IWCIT50667.2020.9163531","DOIUrl":"https://doi.org/10.1109/IWCIT50667.2020.9163531","url":null,"abstract":"In [1] we have introduced the comparison-limited vector quantization (CLVQ) problem as a variation of the classic vector quantization problem in which the analog-to-digital (A2D) conversion is not constrained by the cardinality of the output but rather by the number of comparators available for quantization. More precisely, we consider the problem of producing a bit-restricted representation of a random vector of dimension d so as to minimize a given distortion between the quantizer input and output. This bit-restricted representation is obtained through k comparators, each receiving a linear combination of the inputs and producing zero/one when this signal is above/below a threshold. This vector quantizer architecture naturally arises in many analog-to-digital conversion scenarios in which the A2D performance is not limited by the number of bits used to represent the quantizer output, but rather on the limited availability of comparators in the quantizer. In this paper, we focus on the design of quantizer for the CLVQ problem through a polynomial-time algorithm. The quantizer design problem has a super-exponential complexity and thus determining the optimal solution, even for moderate values of d, is computationally very challenging. For this reason, we develop a genetic algorithm for the optimization of the quantizer structure. This algorithm is aimed at producing a large number of quantizer designs to be used for initialization. For each candidate, the quantizer configuration is partially optimized using particle filters. After this optimization, quantizer configurations are again selected for fitness and recombined. Simulations are provided to numerically validate the proposed algorithm and compare the CLVQ performance to the classic Linde–Buzo–Gray algorithm.","PeriodicalId":360380,"journal":{"name":"2020 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131753255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

IWCIT 2020 Committees

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/iwcit50667.2020.9163452

引用次数: 0

Resource Allocation and User Association for Load Balancing in NOMA-Based Cellular Heterogeneous Networks 基于noma的蜂窝异构网络负载均衡的资源分配和用户关联

2020 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2020-05-01 DOI: 10.1109/IWCIT50667.2020.9163529

Sima Sobhi-Givi, M. Shayesteh, H. Kalbkhani, Nandana Rajatheva

引用次数: 1