Pub Date : 2022-05-11DOI: 10.1109/IWCIT57101.2022.10206813
M. Rashid, Elahe Ghasemi, J. Ebrahimi
It is known that the entropy function over a set of jointly distributed random variables is a submodular set function. However, not any submodular function is of this form. In this paper, we consider a family of submodular set functions, called weighted rank functions of matroids, and study the necessary or sufficient conditions under which they are entropic. We prove that weighted rank functions are located on the boundary of the submodularity cone. For the representable matroids over a characteristic 2 field, we show that the integer valued weighted rank functions are entropic. We derive a necessary condition for constant weight rank functions to be entropic and show that for the case of graphic matroids, this condition is indeed sufficient. Since these functions generalize the rank of a matroid, our findings generalize some of the results of Abbe et. al. in [1] about entropic properties of the rank function of matroids.
{"title":"Entropic Weighted Rank Function","authors":"M. Rashid, Elahe Ghasemi, J. Ebrahimi","doi":"10.1109/IWCIT57101.2022.10206813","DOIUrl":"https://doi.org/10.1109/IWCIT57101.2022.10206813","url":null,"abstract":"It is known that the entropy function over a set of jointly distributed random variables is a submodular set function. However, not any submodular function is of this form. In this paper, we consider a family of submodular set functions, called weighted rank functions of matroids, and study the necessary or sufficient conditions under which they are entropic. We prove that weighted rank functions are located on the boundary of the submodularity cone. For the representable matroids over a characteristic 2 field, we show that the integer valued weighted rank functions are entropic. We derive a necessary condition for constant weight rank functions to be entropic and show that for the case of graphic matroids, this condition is indeed sufficient. Since these functions generalize the rank of a matroid, our findings generalize some of the results of Abbe et. al. in [1] about entropic properties of the rank function of matroids.","PeriodicalId":446341,"journal":{"name":"2022 10th Iran Workshop on Communication and Information Theory (IWCIT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123982213","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}
Pub Date : 2022-05-11DOI: 10.1109/IWCIT57101.2022.10206548
Seyed Reza Hoseini Najarkolaei, M. Aref
In this paper we consider a multi-party private set intersection system consisting of N source nodes, each has access to a private set, and a master who has access to a public set $mathcal{A}$. In this system we assume that up to T of the sources are semi-honest, i.e., they follow the protocol but they may share their private data with each other to gain some information about the private set of the other nodes. The master is interested in finding the elements of $mathcal{A}$ which appeared in at least K of the private set. First, the master sends the public set to the source nodes, and then each source sends a randomized function of its private set and the public set to each of the other sources, called its share. After that, the nodes start communicating with each other and processing their shares, and finally send some results to the master. In this paper, we propose a secure private set intersection scheme that orderwise reduces the communication and computation complexity compared to the conventional information-theoretic private set intersection schemes.
{"title":"Secure Multi-Party Private Set Intersection with Semi-Honest Nodes","authors":"Seyed Reza Hoseini Najarkolaei, M. Aref","doi":"10.1109/IWCIT57101.2022.10206548","DOIUrl":"https://doi.org/10.1109/IWCIT57101.2022.10206548","url":null,"abstract":"In this paper we consider a multi-party private set intersection system consisting of N source nodes, each has access to a private set, and a master who has access to a public set $mathcal{A}$. In this system we assume that up to T of the sources are semi-honest, i.e., they follow the protocol but they may share their private data with each other to gain some information about the private set of the other nodes. The master is interested in finding the elements of $mathcal{A}$ which appeared in at least K of the private set. First, the master sends the public set to the source nodes, and then each source sends a randomized function of its private set and the public set to each of the other sources, called its share. After that, the nodes start communicating with each other and processing their shares, and finally send some results to the master. In this paper, we propose a secure private set intersection scheme that orderwise reduces the communication and computation complexity compared to the conventional information-theoretic private set intersection schemes.","PeriodicalId":446341,"journal":{"name":"2022 10th Iran Workshop on Communication and Information Theory (IWCIT)","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126025240","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}
Pub Date : 2022-05-11DOI: 10.1109/IWCIT57101.2022.10206634
Farshad Rostami Ghadi, F. J. López-Martínez, G. Hodtani
In this paper, we investigate the impact of fading correlation on the performance of interference channels. To this end, we exploit the Copula theory as a flexible approach to model the dependence structure between channel fading coefficients. We determine a general closed-form expression of the outage probability (OP) for any choice of fading distributions under correlated conditions. In addition, for exemplary purposes, we obtain the closed-form expression of the OP under correlated/independent Rayleigh fading channels by exploiting the lower/upper Fréchet-Hoeffding and product Copulas, which provide the negative/positive perfect correlations and the independent case, respectively. Results show that the OP performance improves under the positive dependence structure compared with the independent case.
{"title":"Copula-based Analysis of Interference Channels: Outage Probability","authors":"Farshad Rostami Ghadi, F. J. López-Martínez, G. Hodtani","doi":"10.1109/IWCIT57101.2022.10206634","DOIUrl":"https://doi.org/10.1109/IWCIT57101.2022.10206634","url":null,"abstract":"In this paper, we investigate the impact of fading correlation on the performance of interference channels. To this end, we exploit the Copula theory as a flexible approach to model the dependence structure between channel fading coefficients. We determine a general closed-form expression of the outage probability (OP) for any choice of fading distributions under correlated conditions. In addition, for exemplary purposes, we obtain the closed-form expression of the OP under correlated/independent Rayleigh fading channels by exploiting the lower/upper Fréchet-Hoeffding and product Copulas, which provide the negative/positive perfect correlations and the independent case, respectively. Results show that the OP performance improves under the positive dependence structure compared with the independent case.","PeriodicalId":446341,"journal":{"name":"2022 10th Iran Workshop on Communication and Information Theory (IWCIT)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115694081","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}
Pub Date : 2022-05-11DOI: 10.1109/IWCIT57101.2022.10206659
A. Abdollahi, J. Bagherian, F. Jafari, M. Khatami, F. Parvaresh, R. Sobhani
In order to overcome the challenges posed by flash memories, the rank modulation scheme was proposed. In the rank modulation the codewords are permutations. In this paper, we study permutation codes with a specified length and minimum Kendall $tau$-distance, and with as many codewords (permutations) as possible. We managed to make many significant improvements in the size of the best known codes. In particular, we show that for all $ngeq 6$ and for all $displaystyle frac{3}{5}begin{pmatrix}n2end{pmatrix}lt dleqfrac{2}{3}begin{pmatrix}n2end{pmatrix}$ the largest size of a permutation code of length n and minimum distance at least d under Kendall $tau$-metric is 4.
{"title":"New table of Bounds on Permutation Codes under Kendall τ-Metric","authors":"A. Abdollahi, J. Bagherian, F. Jafari, M. Khatami, F. Parvaresh, R. Sobhani","doi":"10.1109/IWCIT57101.2022.10206659","DOIUrl":"https://doi.org/10.1109/IWCIT57101.2022.10206659","url":null,"abstract":"In order to overcome the challenges posed by flash memories, the rank modulation scheme was proposed. In the rank modulation the codewords are permutations. In this paper, we study permutation codes with a specified length and minimum Kendall $tau$-distance, and with as many codewords (permutations) as possible. We managed to make many significant improvements in the size of the best known codes. In particular, we show that for all $ngeq 6$ and for all $displaystyle frac{3}{5}begin{pmatrix}n2end{pmatrix}lt dleqfrac{2}{3}begin{pmatrix}n2end{pmatrix}$ the largest size of a permutation code of length n and minimum distance at least d under Kendall $tau$-metric is 4.","PeriodicalId":446341,"journal":{"name":"2022 10th Iran Workshop on Communication and Information Theory (IWCIT)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123298247","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}
Pub Date : 2022-05-11DOI: 10.1109/IWCIT57101.2022.10206797
Sahar Shahbaz, M. Mirmohseni, M. Nasiri-Kenari
The importance of molecular communication (MC) security, due to its sensitive in vivo applications necessitates investigating adversarial activities in MC systems. In this paper, we study the problem of jamming attacks in MC. In our model, a biological/engineered concentration transmitter releases a particular type of molecule to send its message over a diffusive channel to a transparent receiver. However, the jammer tries to disrupt regular communication and prevent the receiver from receiving a reliable message either by transmitting the same molecule type or a molecule type able to react with the date carrier molecule. We propose a jamming-resistant coding scheme to counteract this attack. Our approach is based on splitting each symbol’s time slot into subslots where a random pre-shared pattern is used to determine the transmit strategy in these subslots. Two decision rules at the decoder are characterized and a sub-optimal threshold is computed for them. To analyse the performance of the proposed scheme, we derive the probability of error at the receiver. As the jammer can choose different types of molecules in each subslots according to its strategy, an optimal jamming strategy that maximizes the error probability of the message is derived numerically. The numerical results for the proposed scheme confirm the effectiveness of the scheme in protecting against jamming attacks.
{"title":"A Jamming Resistant Molecular Communication Scheme","authors":"Sahar Shahbaz, M. Mirmohseni, M. Nasiri-Kenari","doi":"10.1109/IWCIT57101.2022.10206797","DOIUrl":"https://doi.org/10.1109/IWCIT57101.2022.10206797","url":null,"abstract":"The importance of molecular communication (MC) security, due to its sensitive in vivo applications necessitates investigating adversarial activities in MC systems. In this paper, we study the problem of jamming attacks in MC. In our model, a biological/engineered concentration transmitter releases a particular type of molecule to send its message over a diffusive channel to a transparent receiver. However, the jammer tries to disrupt regular communication and prevent the receiver from receiving a reliable message either by transmitting the same molecule type or a molecule type able to react with the date carrier molecule. We propose a jamming-resistant coding scheme to counteract this attack. Our approach is based on splitting each symbol’s time slot into subslots where a random pre-shared pattern is used to determine the transmit strategy in these subslots. Two decision rules at the decoder are characterized and a sub-optimal threshold is computed for them. To analyse the performance of the proposed scheme, we derive the probability of error at the receiver. As the jammer can choose different types of molecules in each subslots according to its strategy, an optimal jamming strategy that maximizes the error probability of the message is derived numerically. The numerical results for the proposed scheme confirm the effectiveness of the scheme in protecting against jamming attacks.","PeriodicalId":446341,"journal":{"name":"2022 10th Iran Workshop on Communication and Information Theory (IWCIT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114682979","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}
Pub Date : 2022-05-11DOI: 10.1109/IWCIT57101.2022.10206884
Saleheh Poursheikhali, Fatemeh Ghanami
In this paper, we address the smart NOMA-HARQ with a one-allowed re-transmission scheme in a two-user uplink scenario to improve users’ fairness. Each user is allowed to re-transmit once provided that its previous packet was not successfully decoded and the BS performs in a smart way during transmission. In the proposed scheme, NOMA-HARQ offers a chance to decrease the number of re-transmissions, and the system throughput is improved compared to conventional NOMAHARQ. Furthermore, the fairness between users increases due to the remarkable reduction in the required number of retransmissions of the far user. In our model, the users’ power allocation is performed via an optimization problem in that the packet error rate is minimized under power constraints. To analyze the system’s dynamics, a Markov model is first proposed. Then, the power splitting ratios are obtained based on the optimization problem results. The simulation results verify that smart NOMA-HARQ outperforms conventional NOMA-HARQ in terms of the PER, fairness, and throughput under the same rate and total received power at the BS.
{"title":"Smart NOMA-HARQ for Short Packet Communications","authors":"Saleheh Poursheikhali, Fatemeh Ghanami","doi":"10.1109/IWCIT57101.2022.10206884","DOIUrl":"https://doi.org/10.1109/IWCIT57101.2022.10206884","url":null,"abstract":"In this paper, we address the smart NOMA-HARQ with a one-allowed re-transmission scheme in a two-user uplink scenario to improve users’ fairness. Each user is allowed to re-transmit once provided that its previous packet was not successfully decoded and the BS performs in a smart way during transmission. In the proposed scheme, NOMA-HARQ offers a chance to decrease the number of re-transmissions, and the system throughput is improved compared to conventional NOMAHARQ. Furthermore, the fairness between users increases due to the remarkable reduction in the required number of retransmissions of the far user. In our model, the users’ power allocation is performed via an optimization problem in that the packet error rate is minimized under power constraints. To analyze the system’s dynamics, a Markov model is first proposed. Then, the power splitting ratios are obtained based on the optimization problem results. The simulation results verify that smart NOMA-HARQ outperforms conventional NOMA-HARQ in terms of the PER, fairness, and throughput under the same rate and total received power at the BS.","PeriodicalId":446341,"journal":{"name":"2022 10th Iran Workshop on Communication and Information Theory (IWCIT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114474445","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：