Pub Date : 2018-06-01DOI: 10.1109/SPAWC.2018.8445848
Leila Ben Saad, B. Beferull-Lozano
Wireless sensor networks (WSN s) are often characterized by random and asymmetric packet losses due to the wireless medium, leading to network topologies that can be modeled as random, time-varying and directed graphs. Most of existing works related to graph filtering in the context of WSNs assume that the probability of delivering an information from one node to a neighbor node is the same as in the reverse direction. This assumption is not realistic due to the typical link asymmetry in WSNs caused by interferences and background noise. In this work, we analyze the problem of applying stochastic graph filtering over random time-varying asymmetric network topologies. We show that it is possible to perform stochastic graph filtering under asymmetric links with node-variant graph filters, while optimizing a trade-off between the expected error (bias) and the variance of the error, with respect to performing graph filtering over a fixed static topology given by a certain connectivity radius of the nodes.
{"title":"Stochastic Graph Filtering Under Asymmetric Links in Wireless Sensor Networks","authors":"Leila Ben Saad, B. Beferull-Lozano","doi":"10.1109/SPAWC.2018.8445848","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445848","url":null,"abstract":"Wireless sensor networks (WSN s) are often characterized by random and asymmetric packet losses due to the wireless medium, leading to network topologies that can be modeled as random, time-varying and directed graphs. Most of existing works related to graph filtering in the context of WSNs assume that the probability of delivering an information from one node to a neighbor node is the same as in the reverse direction. This assumption is not realistic due to the typical link asymmetry in WSNs caused by interferences and background noise. In this work, we analyze the problem of applying stochastic graph filtering over random time-varying asymmetric network topologies. We show that it is possible to perform stochastic graph filtering under asymmetric links with node-variant graph filters, while optimizing a trade-off between the expected error (bias) and the variance of the error, with respect to performing graph filtering over a fixed static topology given by a certain connectivity radius of the nodes.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133610827","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8446043
Jianhao Huang, Dan Wang, Chuan Huang
This paper considers a compound multiple access channel (MAC), where two transmitters send two messages to two receivers respectively and each receiver decodes both the source messages. In particular, transmitter cooperations by utilizing in-band full-duplex (FD) amplify-and-forward (AF) scheme are deployed to enhance the system performance. Based on the proposed scheme, the equivalent channel model is analyzed, as well as the statistics of the accumulated residual self-interference and noise (ARIN). With the joint decoding scheme, the corresponding achievable rate region is derived by a two-step iterative algorithm. Simulation results reveal that the proposed scheme can significantly improve the achievable rate under several typical scenarios.
{"title":"Full-Duplex Amplify-and-Forward Transmitter Cooperations for Compound Multiple Access Channels","authors":"Jianhao Huang, Dan Wang, Chuan Huang","doi":"10.1109/SPAWC.2018.8446043","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446043","url":null,"abstract":"This paper considers a compound multiple access channel (MAC), where two transmitters send two messages to two receivers respectively and each receiver decodes both the source messages. In particular, transmitter cooperations by utilizing in-band full-duplex (FD) amplify-and-forward (AF) scheme are deployed to enhance the system performance. Based on the proposed scheme, the equivalent channel model is analyzed, as well as the statistics of the accumulated residual self-interference and noise (ARIN). With the joint decoding scheme, the corresponding achievable rate region is derived by a two-step iterative algorithm. Simulation results reveal that the proposed scheme can significantly improve the achievable rate under several typical scenarios.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114752253","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8446035
R. Guida, T. Melodia
In the near future, innovative medical therapies will be administered by means of intra-body wireless sensor networks of implantable medical devices (IMDs). However, realizing wireless networks with traditional implantable biosensors and actuators is challenging, because (i) they often rely on wired connections that are invasive and prone to infections; and (ii) they are powered by batteries that occupy most of the device volume and have a relatively short lifetime. This article reports on the design of a system of interconnected implantable nodes that leverage ultrasonic wireless propagation to (i) be remotely recharged, removing the need for batteries; (ii) to create wireless communication links avoiding wires or radio-frequency (RF) connections that have poor performance when operating in tissues. We illustrate the design of the core building blocks to realize ultrasonically rechargeable medical sensors and actuators equipped with ultrasonic connectivity. We further demonstrate their use in a practical implementation of a sensing/actuation closed-loop system with distributed sensor nodes. We also develop and experimentally validate a mathematical model to predict the system performance.
{"title":"Ultrasonically Rechargeable Platforms for Closed-Loop Distributed Sensing and Actuation in the Human Body","authors":"R. Guida, T. Melodia","doi":"10.1109/SPAWC.2018.8446035","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446035","url":null,"abstract":"In the near future, innovative medical therapies will be administered by means of intra-body wireless sensor networks of implantable medical devices (IMDs). However, realizing wireless networks with traditional implantable biosensors and actuators is challenging, because (i) they often rely on wired connections that are invasive and prone to infections; and (ii) they are powered by batteries that occupy most of the device volume and have a relatively short lifetime. This article reports on the design of a system of interconnected implantable nodes that leverage ultrasonic wireless propagation to (i) be remotely recharged, removing the need for batteries; (ii) to create wireless communication links avoiding wires or radio-frequency (RF) connections that have poor performance when operating in tissues. We illustrate the design of the core building blocks to realize ultrasonically rechargeable medical sensors and actuators equipped with ultrasonic connectivity. We further demonstrate their use in a practical implementation of a sensing/actuation closed-loop system with distributed sensor nodes. We also develop and experimentally validate a mathematical model to predict the system performance.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"31 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132791477","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445857
A. Zappone, M. Debbah, Z. Altman
The work describes how deep learning by artificial neural networks (ANNs) enables online power allocation for energy efficiency maximization in wireless interference networks. A deep ANN architecture is proposed and trained to take as input the network communication channels and to output suitable power allocations. It is shown that this approach requires a much lower computational complexity compared to traditional optimization-oriented approaches, dispensing with the need of solving the optimization problem anew in each channel coherence time. Despite the lower complexity, numerical results show that a properly trained ANN achieves similar performance as more traditional optimization-oriented methods.
{"title":"Online Energy-Efficient Power Control in Wireless Networks by Deep Neural Networks","authors":"A. Zappone, M. Debbah, Z. Altman","doi":"10.1109/SPAWC.2018.8445857","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445857","url":null,"abstract":"The work describes how deep learning by artificial neural networks (ANNs) enables online power allocation for energy efficiency maximization in wireless interference networks. A deep ANN architecture is proposed and trained to take as input the network communication channels and to output suitable power allocations. It is shown that this approach requires a much lower computational complexity compared to traditional optimization-oriented approaches, dispensing with the need of solving the optimization problem anew in each channel coherence time. Despite the lower complexity, numerical results show that a properly trained ANN achieves similar performance as more traditional optimization-oriented methods.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"255 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122064321","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445970
Wanshan Yang, Lijun Chen, Y. Liu
Channel state information at transmitter (CSIT) allows wireless communication systems to fully utilize the degree of freedom of the channel. Time division duplex (TDD) systems can take the advantage of channel reciprocity to obtain forward link CSIT from reverse link training. We tackle the seemingly impossible task of doing the same for frequency division duplex (FDD) systems, where the conventional method is to obtain CSIT from feedback from the receiver. Channel state feedback causes delay and consumes prohibitive amount of system resource, especially when the number of transmit antennas is large, such as in massive MIMO systems. However, if the channel parameters, such as the complex path gain, path delay, and angle of arrival/departure of each individual path, are accurately estimated from pilot signals in one frequency band, the channel state in another frequency band can be calculated from these parameters. Accuracy is the key because small estimation error will be magnified by the multiplication of the frequency difference between the bands. The required accuracy is not achievable for narrow band and single antenna systems. But current and future wireless systems have and will have increasingly large bandwidth and number of antennas, making the FDD channel reciprocity possible. To achieve the FDD channel reciprocity, we propose to employ super-resolution theory. Another possible compressed sensing approach is to put the channel parameters on a multi-dimensional grid and for each point of the grid, estimate the corresponding complex gain. We adapt both approaches for our problem and show that the compressed sensing approach is not well suited for this purpose and the super-resolution approach can achieve our goal.
{"title":"Super-Resolution for Achieving Frequency Division Duplex (FDD) Channel Reciprocity","authors":"Wanshan Yang, Lijun Chen, Y. Liu","doi":"10.1109/SPAWC.2018.8445970","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445970","url":null,"abstract":"Channel state information at transmitter (CSIT) allows wireless communication systems to fully utilize the degree of freedom of the channel. Time division duplex (TDD) systems can take the advantage of channel reciprocity to obtain forward link CSIT from reverse link training. We tackle the seemingly impossible task of doing the same for frequency division duplex (FDD) systems, where the conventional method is to obtain CSIT from feedback from the receiver. Channel state feedback causes delay and consumes prohibitive amount of system resource, especially when the number of transmit antennas is large, such as in massive MIMO systems. However, if the channel parameters, such as the complex path gain, path delay, and angle of arrival/departure of each individual path, are accurately estimated from pilot signals in one frequency band, the channel state in another frequency band can be calculated from these parameters. Accuracy is the key because small estimation error will be magnified by the multiplication of the frequency difference between the bands. The required accuracy is not achievable for narrow band and single antenna systems. But current and future wireless systems have and will have increasingly large bandwidth and number of antennas, making the FDD channel reciprocity possible. To achieve the FDD channel reciprocity, we propose to employ super-resolution theory. Another possible compressed sensing approach is to put the channel parameters on a multi-dimensional grid and for each point of the grid, estimate the corresponding complex gain. We adapt both approaches for our problem and show that the compressed sensing approach is not well suited for this purpose and the super-resolution approach can achieve our goal.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126159150","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445868
M. Kountouris, Apostolos Avranas
Low-latency communication is currently attracting significant attention due to the emergence of mission-critical Internet of Things (IoT) applications and content-centric services. A deep understanding of the delay performance is essential for efficient wireless system design and end-to-end latency guarantees. In this paper, we investigate the network-layer performance of physical layer multi-antenna multicasting, i.e., when the same data is simultaneously conveyed to multiple users. We provide a statistical characterization of the service process in terms of its Mellin transform and derive probabilistic delay bounds using tools from stochastic network calculus. Furthermore, using extreme value theory, we characterize the service process for very large number of users and derive scaling laws as the number of antennas an d/or users is taken to infinity. Our results can be used for system dimensioning to guarantee the delay requirements in wireless multicast networks.
{"title":"Delay Performance of Multi-Antenna Multicasting in Wireless Networks","authors":"M. Kountouris, Apostolos Avranas","doi":"10.1109/SPAWC.2018.8445868","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445868","url":null,"abstract":"Low-latency communication is currently attracting significant attention due to the emergence of mission-critical Internet of Things (IoT) applications and content-centric services. A deep understanding of the delay performance is essential for efficient wireless system design and end-to-end latency guarantees. In this paper, we investigate the network-layer performance of physical layer multi-antenna multicasting, i.e., when the same data is simultaneously conveyed to multiple users. We provide a statistical characterization of the service process in terms of its Mellin transform and derive probabilistic delay bounds using tools from stochastic network calculus. Furthermore, using extreme value theory, we characterize the service process for very large number of users and derive scaling laws as the number of antennas an d/or users is taken to infinity. Our results can be used for system dimensioning to guarantee the delay requirements in wireless multicast networks.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124321388","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445939
D. Cheliotis, Ioannis Kontoyiannis, M. Loulakis, S. Toumpis
The packet speed and transmission cost are examined, for a single packet traveling along a simple one-dimensional, continuous-time network, using a combination of wireless transmissions and physical transports. We assume that the network consists of two nodes moving at constant speed on a circle, and changing their direction of travel after independent exponential times. The packet wishes to travel in the clockwise direction as fast and as far as possible. It travels either by being physically transported on a node's buffer, or by being wirelessly transmitted to the other node when the two are in the same location. We derive exact, explicit expressions for the long-term average packet speed (in the clockwise direction), and also for the average wireless transmission cost. These results can be viewed as initial steps towards the development of analogous exact expressions for the speed and cost, in more realistic, two-dimensional wireless delay-tolerant network models.
{"title":"Analysis of a One-Dimensional Continuous Delay-Tolerant Network Model","authors":"D. Cheliotis, Ioannis Kontoyiannis, M. Loulakis, S. Toumpis","doi":"10.1109/SPAWC.2018.8445939","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445939","url":null,"abstract":"The packet speed and transmission cost are examined, for a single packet traveling along a simple one-dimensional, continuous-time network, using a combination of wireless transmissions and physical transports. We assume that the network consists of two nodes moving at constant speed on a circle, and changing their direction of travel after independent exponential times. The packet wishes to travel in the clockwise direction as fast and as far as possible. It travels either by being physically transported on a node's buffer, or by being wirelessly transmitted to the other node when the two are in the same location. We derive exact, explicit expressions for the long-term average packet speed (in the clockwise direction), and also for the average wireless transmission cost. These results can be viewed as initial steps towards the development of analogous exact expressions for the speed and cost, in more realistic, two-dimensional wireless delay-tolerant network models.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122723380","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445931
Thomas R. Dean, Mainak Chowdhury, A. Goldsmith
We present an extension of the FDM-FDCP waveform and demonstrate the performance of this waveform in underwater acoustic channels in the presence of AWGN. In this extension, we simply replace the frequency-domain cyclic prefix with guard bands, analogous to zero-padded OFDM. We argue and provide empirical evidence for that this approach in fact improves performance. FDM-FDCP is designed to operate in low-delay, high-Doppler environments; we discuss maximum delay spread that our waveform can tolerate. All modulation and demodulation operations used in this work are accomplished in O(N N) time complexity, implying that FDM-FDCP is suitable for real-time signal processing in underwater channels.
{"title":"Zero-Padded FDM-FDCP: Real-Time Signal Processing for Underwater Channels","authors":"Thomas R. Dean, Mainak Chowdhury, A. Goldsmith","doi":"10.1109/SPAWC.2018.8445931","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445931","url":null,"abstract":"We present an extension of the FDM-FDCP waveform and demonstrate the performance of this waveform in underwater acoustic channels in the presence of AWGN. In this extension, we simply replace the frequency-domain cyclic prefix with guard bands, analogous to zero-padded OFDM. We argue and provide empirical evidence for that this approach in fact improves performance. FDM-FDCP is designed to operate in low-delay, high-Doppler environments; we discuss maximum delay spread that our waveform can tolerate. All modulation and demodulation operations used in this work are accomplished in O(N N) time complexity, implying that FDM-FDCP is suitable for real-time signal processing in underwater channels.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132554422","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445917
S. Govindasamy, I. Bergel
We consider a cooperative cellular network where the signal from a mobile is detected jointly by base stations close to it using a minimum-mean-square-error (MMSE) estimator. We assume a network where different numbers of cooperating base stations can be used for the detection of each mobile. We also assume that all signals are delivered to a processing center which has limited computational capabilities. We present an upper bound on the achievable weighted sum rate for a given computational complexity. We also derive a simple and practical optimization scheme that is based on asymptotic results for the spectral efficiency of a typical link in a Poison point process model. The derived scheme results in a computational savings over schemes that use a fixed number of cooperating base stations for each mobile. The suggested scheme also enables an easy tuning of the computational complexity, according to system needs and energy requirements.
{"title":"Limited Complexity Optimization of the Uplink Performance in Cloud Cellular Networks","authors":"S. Govindasamy, I. Bergel","doi":"10.1109/SPAWC.2018.8445917","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445917","url":null,"abstract":"We consider a cooperative cellular network where the signal from a mobile is detected jointly by base stations close to it using a minimum-mean-square-error (MMSE) estimator. We assume a network where different numbers of cooperating base stations can be used for the detection of each mobile. We also assume that all signals are delivered to a processing center which has limited computational capabilities. We present an upper bound on the achievable weighted sum rate for a given computational complexity. We also derive a simple and practical optimization scheme that is based on asymptotic results for the spectral efficiency of a typical link in a Poison point process model. The derived scheme results in a computational savings over schemes that use a fixed number of cooperating base stations for each mobile. The suggested scheme also enables an easy tuning of the computational complexity, according to system needs and energy requirements.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"32 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132026147","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445910
Sebastian Baur, C. Deppe, H. Boche
Ahlswede and Dueck introduced identification via channels as a new paradigm in information theory. They showed that the number of messages that can reliably be identified over a noisy channel grows doubly exponentially with the block length. In this work we also consider identification, but we assume that messages are stored on a database such that they can be identified. Additionally the legitimate users have access to the output of a source. This source allows us to store messages securely. It is also used to increase the number of messages that can be stored securely on the database and identified reliably. We define a protocol for secure storage for identification such that the number of stored messages that can be identified grows doubly exponentially with the number of symbols read from the source and the number of storage cells available respectively. We also consider the privacy leakage of the protocols used for identification. As a by-product we also get new results on common randomness generation.
{"title":"Secure Storage for Identification","authors":"Sebastian Baur, C. Deppe, H. Boche","doi":"10.1109/SPAWC.2018.8445910","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445910","url":null,"abstract":"Ahlswede and Dueck introduced identification via channels as a new paradigm in information theory. They showed that the number of messages that can reliably be identified over a noisy channel grows doubly exponentially with the block length. In this work we also consider identification, but we assume that messages are stored on a database such that they can be identified. Additionally the legitimate users have access to the output of a source. This source allows us to store messages securely. It is also used to increase the number of messages that can be stored securely on the database and identified reliably. We define a protocol for secure storage for identification such that the number of stored messages that can be identified grows doubly exponentially with the number of symbols read from the source and the number of storage cells available respectively. We also consider the privacy leakage of the protocols used for identification. As a by-product we also get new results on common randomness generation.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131702886","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
扫码关注我们
求助内容：
应助结果提醒方式：