Pub Date : 2020-02-01DOI: 10.1109/NCC48643.2020.9056057
P. Das
Cooperative relaying and multiple-input multiple- output (MIMO) transmission technologies exploit spatial diversity to improve the performance of the secondary users in an underlay cognitive radio network. We consider a multiple-relay cognitive MIMO network that is subject to a peak interference power constraint and a peak transmit power constraint. We present an optimal relay and antenna selection scheme, which jointly selects a relay between a secondary source and a destination, a transmit antenna at the source, and a receive antenna at the destination to maximize the end-to-end signal-to-interference-plus-noise ratio (SINR) at the destination. To demonstrate the advantages of our proposed framework, we derive exact closed-form expression for the outage probability of the secondary network under non- identically distributed Rayleigh fading channels. We also derive insightful expressions for the asymptotic outage probability for high SINR. Several important design insights are reached when both fixed and proportional interference power constraints are employed to limit the interference at the primary user's receiver. Under the proportional interference power constraint, the full diversity order is achieved. Under the fixed interference power constraint, the diversity gain is lost. We then consider a practical scenario in which the secondary users have only the mean channel power gains of the interference links to the primary receiver. The secondary source and the selected relay control their transmit powers in order to satisfy an interference outage constraint. Under this scenario, we also provide an expression for the outage probability of the secondary network for the optimal relay and antenna selection scheme. Our analytical results, which are validated with simulations, show the effective impact of the proposed model on enhancing the overall system performance.
{"title":"Outage Performance of Cognitive Relay Networks with Optimal Relay and Antenna Selection","authors":"P. Das","doi":"10.1109/NCC48643.2020.9056057","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056057","url":null,"abstract":"Cooperative relaying and multiple-input multiple- output (MIMO) transmission technologies exploit spatial diversity to improve the performance of the secondary users in an underlay cognitive radio network. We consider a multiple-relay cognitive MIMO network that is subject to a peak interference power constraint and a peak transmit power constraint. We present an optimal relay and antenna selection scheme, which jointly selects a relay between a secondary source and a destination, a transmit antenna at the source, and a receive antenna at the destination to maximize the end-to-end signal-to-interference-plus-noise ratio (SINR) at the destination. To demonstrate the advantages of our proposed framework, we derive exact closed-form expression for the outage probability of the secondary network under non- identically distributed Rayleigh fading channels. We also derive insightful expressions for the asymptotic outage probability for high SINR. Several important design insights are reached when both fixed and proportional interference power constraints are employed to limit the interference at the primary user's receiver. Under the proportional interference power constraint, the full diversity order is achieved. Under the fixed interference power constraint, the diversity gain is lost. We then consider a practical scenario in which the secondary users have only the mean channel power gains of the interference links to the primary receiver. The secondary source and the selected relay control their transmit powers in order to satisfy an interference outage constraint. Under this scenario, we also provide an expression for the outage probability of the secondary network for the optimal relay and antenna selection scheme. Our analytical results, which are validated with simulations, show the effective impact of the proposed model on enhancing the overall system performance.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127308573","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056068
S. Padala, John D'Souza
Underwater acoustic (UWA) channel is complex because of its multipath environment, Doppler shift and rapidly changing characteristics. Many of the UWA communication- based applications demand high data rates and reliable communication. The orthogonal frequency division multiplexing (OFDM) system is very effective in UWA channels and provides high data rate with low equalization complexity. It is a challenging task to achieve reliability over these channels. The low-density parity-check (LDPC) codes give a better error performance than turbo codes, for UWA channels. The spatially-coupled low-density parity-check (SC-LDPC) codes have been shown to have the capacity-achieving performance over terrestrial communication. In this paper, we have studied by simulation, the performance of protograph based SC-LDPC codes over shallow water acoustic environment with a communication range of 1000 m and channel bandwidth of 10 KHz. Our results show that SC-LDPC codes give 1 dB performance improvement over LDPC codes at a Bit Error Rate (BER) of 10−3 for the same latency constraints.
{"title":"Performance of Spatially Coupled LDPC Codes over Underwater Acoustic Communication Channel","authors":"S. Padala, John D'Souza","doi":"10.1109/NCC48643.2020.9056068","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056068","url":null,"abstract":"Underwater acoustic (UWA) channel is complex because of its multipath environment, Doppler shift and rapidly changing characteristics. Many of the UWA communication- based applications demand high data rates and reliable communication. The orthogonal frequency division multiplexing (OFDM) system is very effective in UWA channels and provides high data rate with low equalization complexity. It is a challenging task to achieve reliability over these channels. The low-density parity-check (LDPC) codes give a better error performance than turbo codes, for UWA channels. The spatially-coupled low-density parity-check (SC-LDPC) codes have been shown to have the capacity-achieving performance over terrestrial communication. In this paper, we have studied by simulation, the performance of protograph based SC-LDPC codes over shallow water acoustic environment with a communication range of 1000 m and channel bandwidth of 10 KHz. Our results show that SC-LDPC codes give 1 dB performance improvement over LDPC codes at a Bit Error Rate (BER) of 10−3 for the same latency constraints.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126739538","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056045
Arun Varghese, G. Sreelekha
This paper presents a real-time video based vehicle counting system, the key feature of which is its low computational complexity. The counting algorithm is tailored to be able to run on a low cost hardware platform like Raspberry Pi as part of a smart camera system. Background subtraction forms the basis of day time vehicle counting while night time counting is based on headlight detection and pairing. Both operations are performed only on a pre-specified virtual detection region within each frame. When tested on public traffic datasets, the method outperforms other more complex algorithms under various weather and traffic conditions.
{"title":"A Robust, Low-Complexity Real-Time Vehicle Counting System For Automated Traffic Surveillance","authors":"Arun Varghese, G. Sreelekha","doi":"10.1109/NCC48643.2020.9056045","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056045","url":null,"abstract":"This paper presents a real-time video based vehicle counting system, the key feature of which is its low computational complexity. The counting algorithm is tailored to be able to run on a low cost hardware platform like Raspberry Pi as part of a smart camera system. Background subtraction forms the basis of day time vehicle counting while night time counting is based on headlight detection and pairing. Both operations are performed only on a pre-specified virtual detection region within each frame. When tested on public traffic datasets, the method outperforms other more complex algorithms under various weather and traffic conditions.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133994892","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056097
S. Arthi, T. Sreenivas
Localization of acoustic sources among hearing impaired (HI) listeners is known to be less satisfactory than normal hearing (NH) listeners and their performance worsens in the presence of interfering sources or noise. However new hearing aids are developed to provide speech enhancement using multi-channel signal processing to preserve spatial cues in binaural presentation. In this work, we propose a methodology to evaluate spatial perception of listeners using a novel MUSHRA-like (MUlti Stimulus test with Hidden Reference and Anchor) experimental setup using an Android mobile phone. We evaluate multiple pre-recorded stimuli, presented randomly for their perceptual localization accuracy, relative to explicitly presented spatial references. The test implemented on Android mobile platform and bluetooth earplugs, along with a variety of directional interference stimuli, provides for the test to be administered at any remote location, without the necessity of expensive clinical facilities. We also propose schemes for different methods of rendering binaural audio for further mobile phone based hearing assistance.
{"title":"Binaural Spatial Audiometry Screening Using Android Mobile Device Audio I/O Facility","authors":"S. Arthi, T. Sreenivas","doi":"10.1109/NCC48643.2020.9056097","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056097","url":null,"abstract":"Localization of acoustic sources among hearing impaired (HI) listeners is known to be less satisfactory than normal hearing (NH) listeners and their performance worsens in the presence of interfering sources or noise. However new hearing aids are developed to provide speech enhancement using multi-channel signal processing to preserve spatial cues in binaural presentation. In this work, we propose a methodology to evaluate spatial perception of listeners using a novel MUSHRA-like (MUlti Stimulus test with Hidden Reference and Anchor) experimental setup using an Android mobile phone. We evaluate multiple pre-recorded stimuli, presented randomly for their perceptual localization accuracy, relative to explicitly presented spatial references. The test implemented on Android mobile platform and bluetooth earplugs, along with a variety of directional interference stimuli, provides for the test to be administered at any remote location, without the necessity of expensive clinical facilities. We also propose schemes for different methods of rendering binaural audio for further mobile phone based hearing assistance.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133348733","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056015
P. Jain, K. Gurugubelli, A. Vuppala
Identifying language information from speech utterance is referred to as spoken language identification. Language Identification (LID) is essential in multilingual speech systems. The performance of LID systems have been studied for various adverse conditions such as background noise, telephonic channel, short utterances, so on. In contrast to these studies, for the first time in the literature, the present work investigated the impact of emotional speech on language identification. In this work, different emotional speech databases have been pooled to create the experimental setup. Additionally, state-of-art i-vectors, time-delay neural networks, long short term memory, and deep neural network x-vector systems have been considered to build the LID systems. Performance of the LID system has been evaluated for speech utterances of different emotions in terms of equal error rate and Cavg. The results of the study indicate that the speech utterances of anger and happy emotions degrades performance of LID systems more compared to the neutral and sad emotions.
{"title":"Study on the Effect of Emotional Speech on Language Identification","authors":"P. Jain, K. Gurugubelli, A. Vuppala","doi":"10.1109/NCC48643.2020.9056015","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056015","url":null,"abstract":"Identifying language information from speech utterance is referred to as spoken language identification. Language Identification (LID) is essential in multilingual speech systems. The performance of LID systems have been studied for various adverse conditions such as background noise, telephonic channel, short utterances, so on. In contrast to these studies, for the first time in the literature, the present work investigated the impact of emotional speech on language identification. In this work, different emotional speech databases have been pooled to create the experimental setup. Additionally, state-of-art i-vectors, time-delay neural networks, long short term memory, and deep neural network x-vector systems have been considered to build the LID systems. Performance of the LID system has been evaluated for speech utterances of different emotions in terms of equal error rate and Cavg. The results of the study indicate that the speech utterances of anger and happy emotions degrades performance of LID systems more compared to the neutral and sad emotions.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115954561","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056053
D. P. Jana, Sumanta Gupta
In this paper, we propose a Successive Interference Cancellation (SIC) technique which uses k-means clustering for a standard single mode fiber based non return to zero (NRZ)-quadrature phase shift keying (QPSK) transmission system that employs power division non-orthogonal multiple access (PD-NOMA) scheme to enhance the capacity. Results obtained from the numerical simulation confirm that for an aggregated transmission of 20 Gbps signal for two users, each transmitting a data rate of 10 Gbps over standard single mode fiber (SSMF), a BER value of 10−5 is achievable with an OSNR penalty of 2 dB for a far user, which is situated 100 km away from the transmitter and utilizes NOMA. The proposed system doesn't include any compensation technique for mitigating fiber induced impairments. Simulation results also reveal that, a 1:7 power division ratio is required between the two users for optimum performance.
{"title":"Machine Learning Enabled Detection for QPSK-PD-NOMA System Employing Single Mode Fiber","authors":"D. P. Jana, Sumanta Gupta","doi":"10.1109/NCC48643.2020.9056053","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056053","url":null,"abstract":"In this paper, we propose a Successive Interference Cancellation (SIC) technique which uses k-means clustering for a standard single mode fiber based non return to zero (NRZ)-quadrature phase shift keying (QPSK) transmission system that employs power division non-orthogonal multiple access (PD-NOMA) scheme to enhance the capacity. Results obtained from the numerical simulation confirm that for an aggregated transmission of 20 Gbps signal for two users, each transmitting a data rate of 10 Gbps over standard single mode fiber (SSMF), a BER value of 10−5 is achievable with an OSNR penalty of 2 dB for a far user, which is situated 100 km away from the transmitter and utilizes NOMA. The proposed system doesn't include any compensation technique for mitigating fiber induced impairments. Simulation results also reveal that, a 1:7 power division ratio is required between the two users for optimum performance.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115500463","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056077
R. Saini, Deepak Mishra
This paper presents a joint resource sharing and jammer placement problem for a simple four node system including a source, a jammer and two untrusted users. Observing that the resource allocation involving subcarrier allocation, power allocation and jammer placement is complex due to their interdependence on each other, this work attempts to solve the problem in parts. First of all, key insights on optimal subcarrier allocation which is simply based on channel conditions is presented. Since, jammer has been introduced for secrecy performance improvement, the need for optimal power sharing between source and jammer is highlighted. Due to the consideration of sum power budget, the fraction in which power should be shared between signal and noise for maximizing sum secure rate is an important decision. Utilizing some key concepts, optimal power allocation based on alternating optimization is presented. Further, insights on optimal placement of jammer are presented to highlight whether jammer should be placed near the users or somewhere in between on the line joining the two users. All analytical concepts have been numerically verified and performance gain against bench-mark has been highlighted through simulation results.
{"title":"Friendly Jammer Localization for Secrecy Enhancement","authors":"R. Saini, Deepak Mishra","doi":"10.1109/NCC48643.2020.9056077","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056077","url":null,"abstract":"This paper presents a joint resource sharing and jammer placement problem for a simple four node system including a source, a jammer and two untrusted users. Observing that the resource allocation involving subcarrier allocation, power allocation and jammer placement is complex due to their interdependence on each other, this work attempts to solve the problem in parts. First of all, key insights on optimal subcarrier allocation which is simply based on channel conditions is presented. Since, jammer has been introduced for secrecy performance improvement, the need for optimal power sharing between source and jammer is highlighted. Due to the consideration of sum power budget, the fraction in which power should be shared between signal and noise for maximizing sum secure rate is an important decision. Utilizing some key concepts, optimal power allocation based on alternating optimization is presented. Further, insights on optimal placement of jammer are presented to highlight whether jammer should be placed near the users or somewhere in between on the line joining the two users. All analytical concepts have been numerically verified and performance gain against bench-mark has been highlighted through simulation results.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116302281","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056006
S. Manna, Jessy Rimaya Khonglah, A. Mukherjee, G. Saha
Kernelized methods using multiple kernels have shown better performances in graph-based clustering. But those kernelized methods get affected by the noise present in the data set. Also, only a single view has been used in those kernelized graph-based clustering methods. To address those issues, a novel low-rank multi-view multi-kernel graph-based clustering framework (LRMVMKC) has been proposed in this paper. Where the similarity nature of kernel matrices are exploited by low-rank optimal kernel learning and the clustering performances are boosted by using multiple views that provide different partial information about a given data set. The use of the proposed LRMVMKC framework on different benchmark data sets demonstrates the better performances of the proposed framework over other existing methods.
{"title":"Low-Rank Kernelized Graph-based Clustering using Multiple Views","authors":"S. Manna, Jessy Rimaya Khonglah, A. Mukherjee, G. Saha","doi":"10.1109/NCC48643.2020.9056006","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056006","url":null,"abstract":"Kernelized methods using multiple kernels have shown better performances in graph-based clustering. But those kernelized methods get affected by the noise present in the data set. Also, only a single view has been used in those kernelized graph-based clustering methods. To address those issues, a novel low-rank multi-view multi-kernel graph-based clustering framework (LRMVMKC) has been proposed in this paper. Where the similarity nature of kernel matrices are exploited by low-rank optimal kernel learning and the clustering performances are boosted by using multiple views that provide different partial information about a given data set. The use of the proposed LRMVMKC framework on different benchmark data sets demonstrates the better performances of the proposed framework over other existing methods.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237173","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056071
Sadananda Behera, G. Das
Fragmentation is considered as a major bottleneck for Elastic Optical Networks (EON) resulting in poor spectrum utilization. A defragmentation scheme can be employed to tackle this fragmentation issue. Often defragmentation schemes involve complex procedures and disruption to existing connections. As disruption of connections is paramount for defragmentation schemes in flex-grid EONs, we propose a novel Routing and Spectrum Allocation (RSA) framework in EON that employs controlled disruption for dynamic traffic scenarios. First, we propose a Mixed Integer Linear Program (MILP) model for a sample network which jointly optimizes delay-bandwidth product, fragmentation, and link congestion. Then, a heuristic algorithm for realistic networks is also proposed. We show the benefits of our formulation with existing studies in terms of blocking probability and fragmentation.
{"title":"Dynamic Routing and Spectrum Allocation in Elastic Optical Networks with Minimal Disruption","authors":"Sadananda Behera, G. Das","doi":"10.1109/NCC48643.2020.9056071","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056071","url":null,"abstract":"Fragmentation is considered as a major bottleneck for Elastic Optical Networks (EON) resulting in poor spectrum utilization. A defragmentation scheme can be employed to tackle this fragmentation issue. Often defragmentation schemes involve complex procedures and disruption to existing connections. As disruption of connections is paramount for defragmentation schemes in flex-grid EONs, we propose a novel Routing and Spectrum Allocation (RSA) framework in EON that employs controlled disruption for dynamic traffic scenarios. First, we propose a Mixed Integer Linear Program (MILP) model for a sample network which jointly optimizes delay-bandwidth product, fragmentation, and link congestion. Then, a heuristic algorithm for realistic networks is also proposed. We show the benefits of our formulation with existing studies in terms of blocking probability and fragmentation.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121764579","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 : 2020-02-01DOI: 10.1109/NCC48643.2020.9056042
Anuj S. Vora, Ankur A. Kulkarni
We consider a communication problem over a noiseless rate limited channel where the sender and receiver have misaligned objectives - the receiver wants to compute a function of the source, but the sender acts to maximize its own utility function. This setting is distinct from source coding since the sender and receiver are strategic agents and hence Shannon theory does not apply. We show that despite this, under certain conditions, reliable communication can be ensured. We pose the problem as a leader-follower game between the sender and receiver. We show that when the receiver is the leader, and the function is incentive compatible, every equilibrium of this game is an optimal code for the source-coding problem. This shows that the Shannon rate is a fundamental threshold for this communication. We show that the incentive compatibility condition, which has its origin in mechanism design theory, is also necessary for reliability. We also show that to ensure reliable communication, it is essential that the receiver is the leader, since the same may not be ensured when the sender is the leader.
{"title":"Communicating with a Strategic Sender","authors":"Anuj S. Vora, Ankur A. Kulkarni","doi":"10.1109/NCC48643.2020.9056042","DOIUrl":"https://doi.org/10.1109/NCC48643.2020.9056042","url":null,"abstract":"We consider a communication problem over a noiseless rate limited channel where the sender and receiver have misaligned objectives - the receiver wants to compute a function of the source, but the sender acts to maximize its own utility function. This setting is distinct from source coding since the sender and receiver are strategic agents and hence Shannon theory does not apply. We show that despite this, under certain conditions, reliable communication can be ensured. We pose the problem as a leader-follower game between the sender and receiver. We show that when the receiver is the leader, and the function is incentive compatible, every equilibrium of this game is an optimal code for the source-coding problem. This shows that the Shannon rate is a fundamental threshold for this communication. We show that the incentive compatibility condition, which has its origin in mechanism design theory, is also necessary for reliability. We also show that to ensure reliable communication, it is essential that the receiver is the leader, since the same may not be ensured when the sender is the leader.","PeriodicalId":183772,"journal":{"name":"2020 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128260293","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
扫码关注我们
求助内容：
应助结果提醒方式：