Pub Date : 2011-06-26DOI: 10.1109/SPAWC.2011.5990460
D. Samardzija, Andrej Domazetovic
In this paper we study the performance of coherent joint-processing coordinated multi-point (CoMP) transmission, also known as Network MIMO, in pico-cellular street deployments with lamp-post base station installation. Previously published and experimentally confirmed short-range wireless propagation models have been applied. The performance is compared against the equivalent case of macro-cellular deployment. In both deployments, we report significant Network MIMO gains compared to the conventional solution without coordination. Effects of the base station antenna elevation and transmit power are also analyzed. Greater benefit of Network MIMO is determined in pico- than in macro-cellular systems.
{"title":"Coherent joint-processing CoMP in pico-cellular lamp-post street deployment","authors":"D. Samardzija, Andrej Domazetovic","doi":"10.1109/SPAWC.2011.5990460","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990460","url":null,"abstract":"In this paper we study the performance of coherent joint-processing coordinated multi-point (CoMP) transmission, also known as Network MIMO, in pico-cellular street deployments with lamp-post base station installation. Previously published and experimentally confirmed short-range wireless propagation models have been applied. The performance is compared against the equivalent case of macro-cellular deployment. In both deployments, we report significant Network MIMO gains compared to the conventional solution without coordination. Effects of the base station antenna elevation and transmit power are also analyzed. Greater benefit of Network MIMO is determined in pico- than in macro-cellular systems.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126133325","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990393
A. Singh, P. Elia, K. Gowda, D. Gesbert
This work establishes the diversity-multiplexing tradeoff (DMT) of the four-phase decode-and-forward (DF) protocol in the half-duplex, non-separated two-way relay channel. We consider a fading channel model where the source relay links are Rayleigh distributed but the direct link between sources is left more general as Nakagami-m distributed and investigate for any possible gains in the achievable DMT using four-phase hybrid broadcast (HBC) protocol, as compared to three-phase time-division broadcast (TDBC) protocol. For the statistically symmetric case of Rayleigh fading and asymmetric fading with more stable direct link (m > 1), the optimal DMT of the HBC protocol is computed, and is shown to be achieved by a three-phase orthogonal variant, TDBC protocol. The operational meaning of this result is that the multiple access channel (MAC) phase of HBC protocol is not necessary to achieve optimal performance, this results in a simplification of the communication protocol. For less stable direct link (1 over 2 ≤ m < 1), the analysis establishes that the MAC phase of HBC protocol is necessary to achieve optimal DMT.
{"title":"Diversity-multiplexing tradeoff for the non-separated two-way relay DF channel","authors":"A. Singh, P. Elia, K. Gowda, D. Gesbert","doi":"10.1109/SPAWC.2011.5990393","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990393","url":null,"abstract":"This work establishes the diversity-multiplexing tradeoff (DMT) of the four-phase decode-and-forward (DF) protocol in the half-duplex, non-separated two-way relay channel. We consider a fading channel model where the source relay links are Rayleigh distributed but the direct link between sources is left more general as Nakagami-m distributed and investigate for any possible gains in the achievable DMT using four-phase hybrid broadcast (HBC) protocol, as compared to three-phase time-division broadcast (TDBC) protocol. For the statistically symmetric case of Rayleigh fading and asymmetric fading with more stable direct link (m > 1), the optimal DMT of the HBC protocol is computed, and is shown to be achieved by a three-phase orthogonal variant, TDBC protocol. The operational meaning of this result is that the multiple access channel (MAC) phase of HBC protocol is not necessary to achieve optimal performance, this results in a simplification of the communication protocol. For less stable direct link (1 over 2 ≤ m < 1), the analysis establishes that the MAC phase of HBC protocol is necessary to achieve optimal DMT.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123770533","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990401
Luxmiram Vijayandran, K. Kansanen, Maite Brandt-Pearcey, T. Ekman
We address the design of energy efficient state estimation in wireless sensor networks satisfying a desired average accuracy constraint over a time-varying channel. We propose a new radio resource allocation policy based on Lyapunov drift stochastic optimization to be used with a standard Kalman filter estimator. The salient feature of the framework is that it can achieve arbitrarily close to optimal power efficiency over time without requiring knowledge of the channel statistics or future events. Asymptotic optimal performance is achieved at the expense of an increase in latency for the system to converge to the desired estimation accuracy. The explicit trade-off is governed by a tunable parameter V. This work unifies notions of estimation and network control optimization.
{"title":"Energy efficient state estimation through stochastic optimization","authors":"Luxmiram Vijayandran, K. Kansanen, Maite Brandt-Pearcey, T. Ekman","doi":"10.1109/SPAWC.2011.5990401","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990401","url":null,"abstract":"We address the design of energy efficient state estimation in wireless sensor networks satisfying a desired average accuracy constraint over a time-varying channel. We propose a new radio resource allocation policy based on Lyapunov drift stochastic optimization to be used with a standard Kalman filter estimator. The salient feature of the framework is that it can achieve arbitrarily close to optimal power efficiency over time without requiring knowledge of the channel statistics or future events. Asymptotic optimal performance is achieved at the expense of an increase in latency for the system to converge to the desired estimation accuracy. The explicit trade-off is governed by a tunable parameter V. This work unifies notions of estimation and network control optimization.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"53 55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124655067","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990424
Màrius Caus, A. Pérez-Neira
In this paper we derive linear equalizers for FBMC systems. We focus on the multiple access channel where signals transmitted by different users may have different carrier frequency offsets and time delays. Aiming at reducing the bandwidth requirements of the periodic ranging messages we formulate two SIMO solutions that are tolerant to time and frequency misalignments. Simulation-based results show that the same performance can be achieved in the BER range [10−2, 10−4] in comparison to an OFDM multi-user minimum mean square error receiver. Considering a guard interval between users, the BER range in which FBMC and OFDM perform equally can be broadened. However, the OFDM solution requires a complexity 8.6 times higher and its spectral efficiency is reduced by 0.72 b/s/Hz due to the cyclic prefix.
{"title":"Interference mitigation techniques for asynchronous multiple access communications in SIMO FBMC systems","authors":"Màrius Caus, A. Pérez-Neira","doi":"10.1109/SPAWC.2011.5990424","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990424","url":null,"abstract":"In this paper we derive linear equalizers for FBMC systems. We focus on the multiple access channel where signals transmitted by different users may have different carrier frequency offsets and time delays. Aiming at reducing the bandwidth requirements of the periodic ranging messages we formulate two SIMO solutions that are tolerant to time and frequency misalignments. Simulation-based results show that the same performance can be achieved in the BER range [10−2, 10−4] in comparison to an OFDM multi-user minimum mean square error receiver. Considering a guard interval between users, the BER range in which FBMC and OFDM perform equally can be broadened. However, the OFDM solution requires a complexity 8.6 times higher and its spectral efficiency is reduced by 0.72 b/s/Hz due to the cyclic prefix.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124943249","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990435
B. Gopalakrishnan, N. Jindal
This paper considers a two-cell cellular system with multiple antennas at the base station (BS) and single antenna user terminals. In such a scenario, the presence of channel state information (CSI) at the BS is essential for efficient system performance. In reciprocal TDD systems, CSI can be obtained via uplink training. Since only finite time-frequency resources are available, such uplink training generally must be performed using non-orthogonal resources (for different users), leading to pilot contamination between users who train simultaneously. In particular, we analyze the rate of convergence of SINR (in presence of pilot contamination) as the number of antennas (M) at the BS increases to an infinite limit. The effect of SNR and the fading coefficients of the user channels on this rate of convergence is also determined.
{"title":"An analysis of pilot contamination on multi-user MIMO cellular systems with many antennas","authors":"B. Gopalakrishnan, N. Jindal","doi":"10.1109/SPAWC.2011.5990435","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990435","url":null,"abstract":"This paper considers a two-cell cellular system with multiple antennas at the base station (BS) and single antenna user terminals. In such a scenario, the presence of channel state information (CSI) at the BS is essential for efficient system performance. In reciprocal TDD systems, CSI can be obtained via uplink training. Since only finite time-frequency resources are available, such uplink training generally must be performed using non-orthogonal resources (for different users), leading to pilot contamination between users who train simultaneously. In particular, we analyze the rate of convergence of SINR (in presence of pilot contamination) as the number of antennas (M) at the BS increases to an infinite limit. The effect of SNR and the fading coefficients of the user channels on this rate of convergence is also determined.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125121468","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990438
Junghoon Lee, C. Tepedelenlioğlu
This paper addresses the performance of space-time coding over fading channels with impulsive noise which is known to accurately capture network interference. We use the symmetric alpha stable noise distribution and adopt two models which assume dependent and independent noise components across receive antennas. We derive pairwise error probability (PEP) of orthogonal space-time block codes (STBC) with a benchmark genie-aided receiver (GAR), or the minimum distance receiver (MDR) which is optimal in the Gaussian case. For general space-time codes we propose a maximum-likelihood (ML) receiver, and its approximation at high signal-to-noise ratio (SNR). The resulting asymptotically optimal receiver (AOR) does not depend on noise parameters and is computationally simple. Monte-Carlo simulations are used to supplement our analytical results and compare the performance of the receivers.
{"title":"Space-time coding over fading channels with alpha-stable noise","authors":"Junghoon Lee, C. Tepedelenlioğlu","doi":"10.1109/SPAWC.2011.5990438","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990438","url":null,"abstract":"This paper addresses the performance of space-time coding over fading channels with impulsive noise which is known to accurately capture network interference. We use the symmetric alpha stable noise distribution and adopt two models which assume dependent and independent noise components across receive antennas. We derive pairwise error probability (PEP) of orthogonal space-time block codes (STBC) with a benchmark genie-aided receiver (GAR), or the minimum distance receiver (MDR) which is optimal in the Gaussian case. For general space-time codes we propose a maximum-likelihood (ML) receiver, and its approximation at high signal-to-noise ratio (SNR). The resulting asymptotically optimal receiver (AOR) does not depend on noise parameters and is computationally simple. Monte-Carlo simulations are used to supplement our analytical results and compare the performance of the receivers.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125122305","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990432
Alan J. Michaels, D. Chester
Chaotic spread spectrum communication systems provide a number of advantages for secure communications due to the apparent randomness of the underlying spreading signal. Many of these chaotic signals exhibit colored spectra, providing discernible features that enable their detection independent of the transmitted data. A recent digital chaotic circuit [1] has been shown to exhibit a truly white spectrum in addition to apparent time-domain randomness. This maximal entropy characteristic supports Shannon's criteria for maximal channel capacity communication, low probability of interception/ detection (LPI/LPD), and a compact bandlimited white spectrum. Such a signal is featureless, susceptible only by energy detection. The disadvantage of such spread communication systems, one shared equally by all spread spectrum systems, is that the channel capacity is constrained by the bandwidth increases required for spreading gain. A traditional approach to increasing bandwidth efficiency is generalizing the modulated digital signaling constellation to include multiple levels of amplitude and phase modulation, which enhances exploitable cyclostationary features unless compensated. This paper presents a framework for adapting the maximal entropy digital chaotic signal to featureless chaotic spread spectrum modulation of arbitrary discrete-time discrete-amplitude data constellations, permitting higher throughputs in chaotic spread spectrum communication systems without sacrificing any of the maximum entropy characteristics that provide LPI/LPD.
{"title":"Featureless chaotic spread spectrum modulation of arbitrary data constellations","authors":"Alan J. Michaels, D. Chester","doi":"10.1109/SPAWC.2011.5990432","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990432","url":null,"abstract":"Chaotic spread spectrum communication systems provide a number of advantages for secure communications due to the apparent randomness of the underlying spreading signal. Many of these chaotic signals exhibit colored spectra, providing discernible features that enable their detection independent of the transmitted data. A recent digital chaotic circuit [1] has been shown to exhibit a truly white spectrum in addition to apparent time-domain randomness. This maximal entropy characteristic supports Shannon's criteria for maximal channel capacity communication, low probability of interception/ detection (LPI/LPD), and a compact bandlimited white spectrum. Such a signal is featureless, susceptible only by energy detection. The disadvantage of such spread communication systems, one shared equally by all spread spectrum systems, is that the channel capacity is constrained by the bandwidth increases required for spreading gain. A traditional approach to increasing bandwidth efficiency is generalizing the modulated digital signaling constellation to include multiple levels of amplitude and phase modulation, which enhances exploitable cyclostationary features unless compensated. This paper presents a framework for adapting the maximal entropy digital chaotic signal to featureless chaotic spread spectrum modulation of arbitrary discrete-time discrete-amplitude data constellations, permitting higher throughputs in chaotic spread spectrum communication systems without sacrificing any of the maximum entropy characteristics that provide LPI/LPD.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128859203","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990373
S. Chaudhari, J. Lundén, V. Koivunen
This paper focuses on the performance limitations for soft decision (SD) based cooperative spectrum sensing in cognitive radios. Cooperative sensing (CS) is formulated as a composite hypothesis problem where we assume that the distribution of the primary user signal is not known. CS suffers from the Bit Error Probability (BEP) wall phenomenon in the presence of reporting channel errors. If the BEP value of the reporting channels is greater than the so called BEP wall value, then it is impossible to satisfy the imposed performance constraints on the CS at the fusion center even if the sensed signal quality or the sensing time at the secondary user is increased. In this paper, we specifically analyze the effects of quantization on the BEP wall for the case of SD based CS. It is shown that the choice of quantization scheme significantly affects the BEP wall value and needs to be paid sufficient attention during the design of practical cooperative sensing schemes.
{"title":"Effects of quantization on bepwalls for soft decision based cooperative sensing","authors":"S. Chaudhari, J. Lundén, V. Koivunen","doi":"10.1109/SPAWC.2011.5990373","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990373","url":null,"abstract":"This paper focuses on the performance limitations for soft decision (SD) based cooperative spectrum sensing in cognitive radios. Cooperative sensing (CS) is formulated as a composite hypothesis problem where we assume that the distribution of the primary user signal is not known. CS suffers from the Bit Error Probability (BEP) wall phenomenon in the presence of reporting channel errors. If the BEP value of the reporting channels is greater than the so called BEP wall value, then it is impossible to satisfy the imposed performance constraints on the CS at the fusion center even if the sensed signal quality or the sensing time at the secondary user is increased. In this paper, we specifically analyze the effects of quantization on the BEP wall for the case of SD based CS. It is shown that the choice of quantization scheme significantly affects the BEP wall value and needs to be paid sufficient attention during the design of practical cooperative sensing schemes.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129981349","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990427
E. Ohlmer, U. Wachsmann, G. Fettweis
In this paper mutual information maximizing linear precoding for MIMO transmission using finite signal alphabets and a parallel layer MIMO detection scheme is derived. The derivation exploits that the mutual information of the parallel detection scheme can be expressed in terms of the mutual information associated with optimal maximum likelihood detection. Results show that the large performance gap between parallel layer detection and maximum likelihood detection in ill conditioned channels can be substantially alleviated by optimal precoding.
{"title":"Mutual information maximizing linear precoding for parallel layer MIMO detection","authors":"E. Ohlmer, U. Wachsmann, G. Fettweis","doi":"10.1109/SPAWC.2011.5990427","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990427","url":null,"abstract":"In this paper mutual information maximizing linear precoding for MIMO transmission using finite signal alphabets and a parallel layer MIMO detection scheme is derived. The derivation exploits that the mutual information of the parallel detection scheme can be expressed in terms of the mutual information associated with optimal maximum likelihood detection. Results show that the large performance gap between parallel layer detection and maximum likelihood detection in ill conditioned channels can be substantially alleviated by optimal precoding.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124306531","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990378
S. Aldalahmeh, M. Ghogho, A. Swami
We consider the problem of distributed detection in wireless sensor networks. The sensors are randomly deployed according to a Poisson point process. The received power of the signal emanating form an intruding target is assumed to follow the inverse power law. We propose the real-time counting rule (rt-CR) detector to endow the system with real-time detection delay capabilities. We show that the number of detecting sensor nodes, for any target type and any detector, follows a Poisson distribution. An exact expression for the average number of detecting sensor nodes is found. Simulation results support the accuracy of our theoretical prediction.
{"title":"Distributed detection of an unknown target in clustered wireless sensor networks","authors":"S. Aldalahmeh, M. Ghogho, A. Swami","doi":"10.1109/SPAWC.2011.5990378","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990378","url":null,"abstract":"We consider the problem of distributed detection in wireless sensor networks. The sensors are randomly deployed according to a Poisson point process. The received power of the signal emanating form an intruding target is assumed to follow the inverse power law. We propose the real-time counting rule (rt-CR) detector to endow the system with real-time detection delay capabilities. We show that the number of detecting sensor nodes, for any target type and any detector, follows a Poisson distribution. An exact expression for the average number of detecting sensor nodes is found. Simulation results support the accuracy of our theoretical prediction.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121046147","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
扫码关注我们
求助内容：
应助结果提醒方式：