Pub Date : 2012-04-03DOI: 10.1109/NCC.2012.6176768
G. Aruna, P. R. Sahu
In this paper we have presented the outage probability of maximal ratio combining (MRC) receiver with imperfect channel estimation and co-channel interference (CCI) over Nakagami-m fading channels. The channel coefficients are modeled in terms of the estimated channel coefficients and the channel estimation error. Closed form expressions for probability density function (pdf) and outage probability are derived for the output signal-to-interference plus noise ratio (SINR).
{"title":"Performance analysis of MRC receiver with channel estimation error and CCI in Nakagami-m fading channels","authors":"G. Aruna, P. R. Sahu","doi":"10.1109/NCC.2012.6176768","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176768","url":null,"abstract":"In this paper we have presented the outage probability of maximal ratio combining (MRC) receiver with imperfect channel estimation and co-channel interference (CCI) over Nakagami-m fading channels. The channel coefficients are modeled in terms of the estimated channel coefficients and the channel estimation error. Closed form expressions for probability density function (pdf) and outage probability are derived for the output signal-to-interference plus noise ratio (SINR).","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123058908","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176911
G. Kamath, P. V. Kumar
In this paper, the storage-repair-bandwidth (SRB) trade-off curve of regenerating codes is reformulated to yield a tradeoff between two global parameters of practical relevance, namely information rate and repair rate. The new information-repair-rate (IRR) tradeoff provides a different and insightful perspective on regenerating codes. For example, it provides a new motivation for seeking to investigate constructions corresponding to the interior of the SRB tradeoff. Interestingly, each point on the SRB tradeoff corresponds to a curve in the IRR tradeoff setup. We characterize completely, functional repair under the IRR framework, while for exact repair, an achievable region is presented. In the second part of this paper, a rate-half regenerating code for the minimum storage regenerating point is constructed that draws upon the theory of invariant subspaces. While the parameters of this rate-half code are the same as those of the MISER code, the construction itself is quite different.
{"title":"Regenerating codes: A reformulated storage-bandwidth trade-off and a new construction","authors":"G. Kamath, P. V. Kumar","doi":"10.1109/NCC.2012.6176911","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176911","url":null,"abstract":"In this paper, the storage-repair-bandwidth (SRB) trade-off curve of regenerating codes is reformulated to yield a tradeoff between two global parameters of practical relevance, namely information rate and repair rate. The new information-repair-rate (IRR) tradeoff provides a different and insightful perspective on regenerating codes. For example, it provides a new motivation for seeking to investigate constructions corresponding to the interior of the SRB tradeoff. Interestingly, each point on the SRB tradeoff corresponds to a curve in the IRR tradeoff setup. We characterize completely, functional repair under the IRR framework, while for exact repair, an achievable region is presented. In the second part of this paper, a rate-half regenerating code for the minimum storage regenerating point is constructed that draws upon the theory of invariant subspaces. While the parameters of this rate-half code are the same as those of the MISER code, the construction itself is quite different.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127461996","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176797
S. Chatterjee, K. Hari, P. Händel, M. Skoglund
For compressive sensing, we endeavor to improve the atom selection strategy of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlying support set progressively through iterations, we use a least squares solution based atom selection method. From a set of promising atoms, the choice of an atom is performed through a new method that uses orthogonal projection along-with a standard matched filter. Through experimental evaluations, the effect of projection based atom selection strategy is shown to provide a significant improvement for the support set recovery performance, in turn, the compressive sensing recovery.
{"title":"Projection-based atom selection in orthogonal matching pursuit for compressive sensing","authors":"S. Chatterjee, K. Hari, P. Händel, M. Skoglund","doi":"10.1109/NCC.2012.6176797","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176797","url":null,"abstract":"For compressive sensing, we endeavor to improve the atom selection strategy of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlying support set progressively through iterations, we use a least squares solution based atom selection method. From a set of promising atoms, the choice of an atom is performed through a new method that uses orthogonal projection along-with a standard matched filter. Through experimental evaluations, the effect of projection based atom selection strategy is shown to provide a significant improvement for the support set recovery performance, in turn, the compressive sensing recovery.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126502329","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176839
N. Shende, B. Rajan
Achievable rate for a single-relay channel with finite input practical constellations like QAM and PSK, which operates under the decode and forward protocol, is studied. An achievable rate is computed for full duplex relay (FDR) channel and half duplex relay (HDR) channel. We consider the cases: (i) the source node's and relay node's signals can be correlated for the FDR channel, (ii) repetition coding scheme and (iii) independent symbol coding scheme for the HDR channels, and propose for both the FDR and the HDR channels a superposition coding scheme with finite alphabets. Through simulation results it is shown that for the FDR channels, the proposed superposition coding achieves higher rate than the correlated signaling scheme for the BPSK input alphabet and for the HDR channels, the superposition coding outperforms the independent symbol coding as well as the repetition codes.
{"title":"On the achievable rate of AWGN relay channel with finite input constellations","authors":"N. Shende, B. Rajan","doi":"10.1109/NCC.2012.6176839","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176839","url":null,"abstract":"Achievable rate for a single-relay channel with finite input practical constellations like QAM and PSK, which operates under the decode and forward protocol, is studied. An achievable rate is computed for full duplex relay (FDR) channel and half duplex relay (HDR) channel. We consider the cases: (i) the source node's and relay node's signals can be correlated for the FDR channel, (ii) repetition coding scheme and (iii) independent symbol coding scheme for the HDR channels, and propose for both the FDR and the HDR channels a superposition coding scheme with finite alphabets. Through simulation results it is shown that for the FDR channels, the proposed superposition coding achieves higher rate than the correlated signaling scheme for the BPSK input alphabet and for the HDR channels, the superposition coding outperforms the independent symbol coding as well as the repetition codes.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123824579","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176830
Prasenjit Mondal, K. P. Naveen, Anurag Kumar
The need for impromptu wireless networks arises in emergency situations where the team responding to the emergency, needs to deploy sensors (such as motion sensors, or even imaging sensors) and a wireless interconnection network, without any prior planning or knowledge of the terrain. In this paper, we consider a simple model for the sequential deployment of wireless relays as a person steps along a “corridor” of unknown length, so as to create a multihop network for interconnecting a sensor to be placed at the end of the corridor with a control truck standing near the entry to the corridor. Assuming low traffic and simple link-by-link scheduling, we consider the problem of minimising an end-to-end cost metric (e.g., delay or power from the sensor to the control centre) subject to a constraint on the number of relays. Two kinds of constraints are considered: the expected number of relays is bounded, or the actual number of relays is bounded. In each case, the problem is formulated as a Markov decision process. The problem of deciding whether or not to place a relay at each step is shown to be equivalent to a certain stochastic shortest path problem embedded at relay placement points. Numerical results are provided to illustrate the performance trade-offs.
{"title":"Optimal deployment of impromptu wireless sensor networks","authors":"Prasenjit Mondal, K. P. Naveen, Anurag Kumar","doi":"10.1109/NCC.2012.6176830","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176830","url":null,"abstract":"The need for impromptu wireless networks arises in emergency situations where the team responding to the emergency, needs to deploy sensors (such as motion sensors, or even imaging sensors) and a wireless interconnection network, without any prior planning or knowledge of the terrain. In this paper, we consider a simple model for the sequential deployment of wireless relays as a person steps along a “corridor” of unknown length, so as to create a multihop network for interconnecting a sensor to be placed at the end of the corridor with a control truck standing near the entry to the corridor. Assuming low traffic and simple link-by-link scheduling, we consider the problem of minimising an end-to-end cost metric (e.g., delay or power from the sensor to the control centre) subject to a constraint on the number of relays. Two kinds of constraints are considered: the expected number of relays is bounded, or the actual number of relays is bounded. In each case, the problem is formulated as a Markov decision process. The problem of deciding whether or not to place a relay at each step is shown to be equivalent to a certain stochastic shortest path problem embedded at relay placement points. Numerical results are provided to illustrate the performance trade-offs.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123977579","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176770
M. D. Selvaraj, R. Mallik
In this paper, a cooperative diversity system having a source, multiple relays, and a destination is considered. Conventional selection combining schemes failed to include the effect of source-to-relay channels in the error analysis of cooperative diversity systems; hence its performance is not optimum. In this paper, we have proposed a full channel state information (CSI) selection combining which effectively utilizes the CSI of all channels in the error analysis; thereby giving optimum performance. The end-to-end symbol error probability (SEP) of a full CSI selection combining scheme for such a system, with decode and forward relaying and binary phase-shift keying in a flat Rayleigh fading environment, is derived in closed form. This scheme has been compared with conventional selection combining scheme. Results show that proposed scheme offers a substantial signal-to-noise ratio gain over conventional selection combining.
{"title":"Full CSI selection combining for multi-relay cooperative diversity systems","authors":"M. D. Selvaraj, R. Mallik","doi":"10.1109/NCC.2012.6176770","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176770","url":null,"abstract":"In this paper, a cooperative diversity system having a source, multiple relays, and a destination is considered. Conventional selection combining schemes failed to include the effect of source-to-relay channels in the error analysis of cooperative diversity systems; hence its performance is not optimum. In this paper, we have proposed a full channel state information (CSI) selection combining which effectively utilizes the CSI of all channels in the error analysis; thereby giving optimum performance. The end-to-end symbol error probability (SEP) of a full CSI selection combining scheme for such a system, with decode and forward relaying and binary phase-shift keying in a flat Rayleigh fading environment, is derived in closed form. This scheme has been compared with conventional selection combining scheme. Results show that proposed scheme offers a substantial signal-to-noise ratio gain over conventional selection combining.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123590224","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176904
K. Keshav, V. Indukuri, P. Venkataram
With higher data rates becoming reality, there are quite a few Internet sharing applications that are increasingly becoming popular on present day smart phones. These applications are very useful and are widely popular by names such as Mobile Hotspot, Tethering, and MiFi etc. Using these applications, multiple users (such as friends, family members and colleagues in a limited area) can share Internet from a single high speed wireless network link. Typically in this method, a mobile device (smart phone or dongle) connects to backbone network using communication networks such as 4G/HSPA+ etc. which provides high speed data link and mobile phone in turn acts as a local Internet access point for other devices using communication technologies like Wi-Fi/Bluetooth. Wi-Fi access points were originally designed to be operated as standalone devices connected with a power supply and hence no specific care was taken to save power of base stations. Though subsequent enhancements were made in specifications to incorporate power saving mode in Wi-Fi Technology to optimize power consumption of the clients, Mobile Hotspot applications does not come under the purview of such enhancements. Due to this, present day Mobile phones which run on battery and host these applications for acting as Wi-Fi Hotspot, demonstrate very poor battery life. We have performed few experiments with commercially available products, which show that technologies like LTE (Long Term Evolution) which act as the backbone for these mobile hotspot applications consume very high power. Together LTE & Wi-Fi are draining Mobile Station current at alarming rate. Effort of this work is to strike a balance between maximum achievable QOS (Quality of Service) for end users and increased battery life of mobile phone which is acting as WiFi access point. This can be achieved by efficiently coordinating power saving techniques provided by LTE/3G wireless communication specifications and those provided by Wi-Fi specifications.
{"title":"Energy efficient scheduling in 4G smart phones for Mobile Hotspot application","authors":"K. Keshav, V. Indukuri, P. Venkataram","doi":"10.1109/NCC.2012.6176904","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176904","url":null,"abstract":"With higher data rates becoming reality, there are quite a few Internet sharing applications that are increasingly becoming popular on present day smart phones. These applications are very useful and are widely popular by names such as Mobile Hotspot, Tethering, and MiFi etc. Using these applications, multiple users (such as friends, family members and colleagues in a limited area) can share Internet from a single high speed wireless network link. Typically in this method, a mobile device (smart phone or dongle) connects to backbone network using communication networks such as 4G/HSPA+ etc. which provides high speed data link and mobile phone in turn acts as a local Internet access point for other devices using communication technologies like Wi-Fi/Bluetooth. Wi-Fi access points were originally designed to be operated as standalone devices connected with a power supply and hence no specific care was taken to save power of base stations. Though subsequent enhancements were made in specifications to incorporate power saving mode in Wi-Fi Technology to optimize power consumption of the clients, Mobile Hotspot applications does not come under the purview of such enhancements. Due to this, present day Mobile phones which run on battery and host these applications for acting as Wi-Fi Hotspot, demonstrate very poor battery life. We have performed few experiments with commercially available products, which show that technologies like LTE (Long Term Evolution) which act as the backbone for these mobile hotspot applications consume very high power. Together LTE & Wi-Fi are draining Mobile Station current at alarming rate. Effort of this work is to strike a balance between maximum achievable QOS (Quality of Service) for end users and increased battery life of mobile phone which is acting as WiFi access point. This can be achieved by efficiently coordinating power saving techniques provided by LTE/3G wireless communication specifications and those provided by Wi-Fi specifications.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129603286","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176783
P. Ghosh, S. Das, P. Chandhar
In this work Dynamic and Semi-Persistent (SP) scheduling strategies and their capacity limits for Voice over IP (VoIP) with 1×2 antenna configuration in 3rd Generation Partnership Project (3GPP)-Long Term Evolution (LTE) network are presented. A method to reduce Channel Quality Indicator (CQI) feedback and Modulation and Coding Scheme (MCS) signaling for VoIP service has been proposed which not only saves a significant amount of overhead bits but also increases the capacity in terms of VoIP users. A model for predicting the effective radio resource usage(Physical Resource Block (PRB)s) for a given number of VoIP users, as a function of the Signal to Interference plus Noise Ratio (SINR) of the users is developed. This is useful in estimating the average number of available PRBs per Transmit Time Interval (TTI) when there is fractional VoIP load. The predicted numbers of available PRBs are closely matching with the results obtained from simulation. The model can be used to find the allowable Best Effort (BE) traffic throughput for mixed traffic scheduling during fractional VoIP load. The capacity region for mixed VoIP and BE services is also presented here.
{"title":"VoIP scheduling with reduced overhead and radio resource usage estimation-effect on best effort capacity","authors":"P. Ghosh, S. Das, P. Chandhar","doi":"10.1109/NCC.2012.6176783","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176783","url":null,"abstract":"In this work Dynamic and Semi-Persistent (SP) scheduling strategies and their capacity limits for Voice over IP (VoIP) with 1×2 antenna configuration in 3rd Generation Partnership Project (3GPP)-Long Term Evolution (LTE) network are presented. A method to reduce Channel Quality Indicator (CQI) feedback and Modulation and Coding Scheme (MCS) signaling for VoIP service has been proposed which not only saves a significant amount of overhead bits but also increases the capacity in terms of VoIP users. A model for predicting the effective radio resource usage(Physical Resource Block (PRB)s) for a given number of VoIP users, as a function of the Signal to Interference plus Noise Ratio (SINR) of the users is developed. This is useful in estimating the average number of available PRBs per Transmit Time Interval (TTI) when there is fractional VoIP load. The predicted numbers of available PRBs are closely matching with the results obtained from simulation. The model can be used to find the allowable Best Effort (BE) traffic throughput for mixed traffic scheduling during fractional VoIP load. The capacity region for mixed VoIP and BE services is also presented here.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127917838","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176832
K. Ghosh, K. S. Rao
In this paper, we propose a subword based approach for grapheme-to-phoneme (G2P) conversion in a text-to-speech (TTS) synthesis system. The proposed method resolves the problems present in both the manual and rule-based approaches for G2P conversion. The subword method uses a segmentation procedure which chops a word into its main part (root word) and subword part (suffix). By proper segmentation of a word, this method efficiently offers insight into the basic morphological information of the word. The proposed method reduces the size of the pronunciation dictionary without affecting the vocabulary coverage. For the rule-based approach, the proposed method segments the word into two parts and predicts the pronunciation for both the word segments separately. The final pronunciation is achieved by concatenating pronunciations for both the word segments. The subword method improves the accuracy of the rule-based approach by resolving the ambiguity especially in case of the inflected or compound words.
{"title":"Subword based approach for grapheme-to-phoneme conversion in Bengali text-to-speech synthesis system","authors":"K. Ghosh, K. S. Rao","doi":"10.1109/NCC.2012.6176832","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176832","url":null,"abstract":"In this paper, we propose a subword based approach for grapheme-to-phoneme (G2P) conversion in a text-to-speech (TTS) synthesis system. The proposed method resolves the problems present in both the manual and rule-based approaches for G2P conversion. The subword method uses a segmentation procedure which chops a word into its main part (root word) and subword part (suffix). By proper segmentation of a word, this method efficiently offers insight into the basic morphological information of the word. The proposed method reduces the size of the pronunciation dictionary without affecting the vocabulary coverage. For the rule-based approach, the proposed method segments the word into two parts and predicts the pronunciation for both the word segments separately. The final pronunciation is achieved by concatenating pronunciations for both the word segments. The subword method improves the accuracy of the rule-based approach by resolving the ambiguity especially in case of the inflected or compound words.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121080822","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176761
N. Kashyap, Y. Sankarasubramaniam, A. Thangaraj
We consider key-less secure communication against a passive adversary, by allowing the legitimate receiver to selectively jam transmitted bits. The channel between the transmitter and legitimate receiver is assumed to be half-duplex (i.e., one cannot jam and receive simultaneously), while the only degradation seen by the eavesdropper is due to jamming done by the legitimate receiver. However, jamming must be done without knowledge of the transmitted sequence, and the transmitted sequence must be recovered exactly by the receiver from the unjammed bits alone. We study the resulting coding problem in this setup, both under complete equivocation (CE) and partial equivocation (PE) of the eavesdropper. For (CE), we give explicit code-constructions that achieve the maximum transmission rate, while for (PE) we compute upper and lower bounds on the maximum possible transmission rate.
{"title":"Jamming to foil an eavesdropper","authors":"N. Kashyap, Y. Sankarasubramaniam, A. Thangaraj","doi":"10.1109/NCC.2012.6176761","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176761","url":null,"abstract":"We consider key-less secure communication against a passive adversary, by allowing the legitimate receiver to selectively jam transmitted bits. The channel between the transmitter and legitimate receiver is assumed to be half-duplex (i.e., one cannot jam and receive simultaneously), while the only degradation seen by the eavesdropper is due to jamming done by the legitimate receiver. However, jamming must be done without knowledge of the transmitted sequence, and the transmitted sequence must be recovered exactly by the receiver from the unjammed bits alone. We study the resulting coding problem in this setup, both under complete equivocation (CE) and partial equivocation (PE) of the eavesdropper. For (CE), we give explicit code-constructions that achieve the maximum transmission rate, while for (PE) we compute upper and lower bounds on the maximum possible transmission rate.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126536645","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
扫码关注我们
求助内容：
应助结果提醒方式：