Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054801
N. Farsad, A. Eckford
Wireless sensor networks, which consist of numerous devices that take measurements of a physical phenomenon, are commonly used to observe phenomena that are correlated in space. In this paper, we devise a low-complexity coding scheme for correlated sources based on Slepian-Wolf compression, and analyze its performance in terms of diversity order. The main idea of this scheme is to use the correlated measurements as a substitute for relay links. Although we show that the asymptotic diversity order is limited by the constant correlation factor, we give experimental results that show excellent performance over practical ranges of SNR.
{"title":"Low-complexity cooperation with correlated sources: Diversity order analysis","authors":"N. Farsad, A. Eckford","doi":"10.1109/CISS.2009.5054801","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054801","url":null,"abstract":"Wireless sensor networks, which consist of numerous devices that take measurements of a physical phenomenon, are commonly used to observe phenomena that are correlated in space. In this paper, we devise a low-complexity coding scheme for correlated sources based on Slepian-Wolf compression, and analyze its performance in terms of diversity order. The main idea of this scheme is to use the correlated measurements as a substitute for relay links. Although we show that the asymptotic diversity order is limited by the constant correlation factor, we give experimental results that show excellent performance over practical ranges of SNR.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122803112","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054722
Ashok Sundaresan, P. Varshney, N. Rao
The problem of source localization using a network of sensors is considered. A maximum likelihood estimation (MLE) based approach is adopted. The measurements received at the sensors due to the random phenomenon are spatially correlated and are characterized by a multivariate distribution. Using the theory of copulas, the joint parametric density of sensor observations is obtained assuming only the knowledge of their marginal densities. An example showing the efficiency of the proposed approach is presented.
{"title":"On localizing the source of random signals using sensor networks","authors":"Ashok Sundaresan, P. Varshney, N. Rao","doi":"10.1109/CISS.2009.5054722","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054722","url":null,"abstract":"The problem of source localization using a network of sensors is considered. A maximum likelihood estimation (MLE) based approach is adopted. The measurements received at the sensors due to the random phenomenon are spatially correlated and are characterized by a multivariate distribution. Using the theory of copulas, the joint parametric density of sensor observations is obtained assuming only the knowledge of their marginal densities. An example showing the efficiency of the proposed approach is presented.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132504393","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054795
J. Ahmad, Hassan Khan, S. A. Khayam
Wireless video sensor networks are anticipated to be deployed to monitor remote geographical areas. To save energy in bit transmissions/receptions over a video sensor network, the captured video content needs to be encoded before its transmission to the base station. However, video encoding is an inherently complex operation that can cause a major energy drain at battery-constrained sensors. Thus a systematic evaluation of different video encoding options is required to allow a designer to choose the most energy-efficient compression technique for a given video sensing application scenario. In this paper, we empirically evaluate the energy efficiencies of predictive and distributed video coding paradigms for deployment on real-life sensor motes. For predictive video coding, our results show that despite its higher compression efficiency, inter video coding always depletes much more energy than intra coding. Therefore, we propose to use image compression based intra coding to improve energy efficiency in the predictive video coding paradigm. For distributed video coding, our results show that the Wyner-Ziv encoder has consistently better energy efficiency than the PRISM encoder. We propose minor modifications to PRISM and Wyner-Ziv encoders which significantly reduce the energy consumption of these encoders. For all the video encoding configurations evaluated in this paper, our results reveal the counter-intuitive and important finding that the major source of energy drain in WSNs is local computations performed for video compression and not video transmission.
{"title":"Energy efficient video compression for wireless sensor networks","authors":"J. Ahmad, Hassan Khan, S. A. Khayam","doi":"10.1109/CISS.2009.5054795","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054795","url":null,"abstract":"Wireless video sensor networks are anticipated to be deployed to monitor remote geographical areas. To save energy in bit transmissions/receptions over a video sensor network, the captured video content needs to be encoded before its transmission to the base station. However, video encoding is an inherently complex operation that can cause a major energy drain at battery-constrained sensors. Thus a systematic evaluation of different video encoding options is required to allow a designer to choose the most energy-efficient compression technique for a given video sensing application scenario. In this paper, we empirically evaluate the energy efficiencies of predictive and distributed video coding paradigms for deployment on real-life sensor motes. For predictive video coding, our results show that despite its higher compression efficiency, inter video coding always depletes much more energy than intra coding. Therefore, we propose to use image compression based intra coding to improve energy efficiency in the predictive video coding paradigm. For distributed video coding, our results show that the Wyner-Ziv encoder has consistently better energy efficiency than the PRISM encoder. We propose minor modifications to PRISM and Wyner-Ziv encoders which significantly reduce the energy consumption of these encoders. For all the video encoding configurations evaluated in this paper, our results reveal the counter-intuitive and important finding that the major source of energy drain in WSNs is local computations performed for video compression and not video transmission.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131280843","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054745
P. Vouras, T. Tran
Designing paraunitary filter banks (PUFBs) that minimize a mean squared error (MMSE) design criterion and are globally optimal is a difficult problem in nonlinear optimization. Many techniques have been proposed to simplify this problem including the use of reduced parameter PUFB decompositions to reduce the complexity of the nonlinear program. In this paper, a simple yet effective method is presented for designing PUFBs that satisfy an approximated MMSE criterion with the caveat that the paraunitary condition is satisfied only on a discrete set of frequencies. No statement can be made about the performance or the losslessness of the designed filter bank between selected frequency points, but for a sufficiently large grid with a dense distribution of points, the proposed design method may yield adequate performance in practical situations.
{"title":"Design of pointwise-in-frequency paraunitary filter banks","authors":"P. Vouras, T. Tran","doi":"10.1109/CISS.2009.5054745","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054745","url":null,"abstract":"Designing paraunitary filter banks (PUFBs) that minimize a mean squared error (MMSE) design criterion and are globally optimal is a difficult problem in nonlinear optimization. Many techniques have been proposed to simplify this problem including the use of reduced parameter PUFB decompositions to reduce the complexity of the nonlinear program. In this paper, a simple yet effective method is presented for designing PUFBs that satisfy an approximated MMSE criterion with the caveat that the paraunitary condition is satisfied only on a discrete set of frequencies. No statement can be made about the performance or the losslessness of the designed filter bank between selected frequency points, but for a sufficiently large grid with a dense distribution of points, the proposed design method may yield adequate performance in practical situations.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125339784","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054773
Kyungchul Kim, Kyungjun Ko, Jungwoo Lee
Antenna grouping algorithms are hybrids of beamforming and spatial multiplexing. With antenna grouping, we can achieve diversity gain through beamforming, and high spectral efficiency through spatial multiplexing simultaneously. In an IID channel, at a fixed transmission rate, we can get better BER performance by antenna grouping compared with beamforming. But if the channel is ill-conditioned or there is some correlation between transmit or receive antennas, the BER performance of antenna grouping is significantly degraded. In that case, beamforming is better than antenna grouping algorithm. We introduced existing antenna grouping algorithms and proposed our new simple antenna grouping algorithms in our previous paper. In this paper, we investigate mode selection algorithms which select antenna grouping or beamforming mode. By selecting a suitable mode for instantaneous channel, we can prevent fluctuation of BER performance caused by channel variation and antenna correlation. We introduce some existing mode selection criteria and also propose a new criterion which is derived from the simple antenna grouping algorithm in the previous paper. This proposed mode selection criterion requires little additional calculations. By comparing with existing mode selection criteria, we verify the performance of our criterion.
{"title":"Mode selection between antenna grouping and beamforming for MIMO communication systems","authors":"Kyungchul Kim, Kyungjun Ko, Jungwoo Lee","doi":"10.1109/CISS.2009.5054773","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054773","url":null,"abstract":"Antenna grouping algorithms are hybrids of beamforming and spatial multiplexing. With antenna grouping, we can achieve diversity gain through beamforming, and high spectral efficiency through spatial multiplexing simultaneously. In an IID channel, at a fixed transmission rate, we can get better BER performance by antenna grouping compared with beamforming. But if the channel is ill-conditioned or there is some correlation between transmit or receive antennas, the BER performance of antenna grouping is significantly degraded. In that case, beamforming is better than antenna grouping algorithm. We introduced existing antenna grouping algorithms and proposed our new simple antenna grouping algorithms in our previous paper. In this paper, we investigate mode selection algorithms which select antenna grouping or beamforming mode. By selecting a suitable mode for instantaneous channel, we can prevent fluctuation of BER performance caused by channel variation and antenna correlation. We introduce some existing mode selection criteria and also propose a new criterion which is derived from the simple antenna grouping algorithm in the previous paper. This proposed mode selection criterion requires little additional calculations. By comparing with existing mode selection criteria, we verify the performance of our criterion.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116926366","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054852
Jun Peng, Ying Zhao, J. Sánchez
One-to-one (unicast) and one-to-many (multicast and broadcast) communications are the communication scenarios that are widely investigated at the medium access control sub-layer in distributed wireless networks. Another communication scenario that receives much less attention in such networks is many-to-one communications. In distributed wireless networks, efficient and time-constrained many-to-one communications is needed in many applications and protocol designs but is a challenging topic at the medium access control sub-layer. This paper proposes a new scheme to address this topic and investigates some of the design issues associated with the proposed scheme.
{"title":"Many-to-one simultaneous communications in distributed wireless networks","authors":"Jun Peng, Ying Zhao, J. Sánchez","doi":"10.1109/CISS.2009.5054852","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054852","url":null,"abstract":"One-to-one (unicast) and one-to-many (multicast and broadcast) communications are the communication scenarios that are widely investigated at the medium access control sub-layer in distributed wireless networks. Another communication scenario that receives much less attention in such networks is many-to-one communications. In distributed wireless networks, efficient and time-constrained many-to-one communications is needed in many applications and protocol designs but is a challenging topic at the medium access control sub-layer. This paper proposes a new scheme to address this topic and investigates some of the design issues associated with the proposed scheme.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114597647","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054803
Gang Xiong, S. Kishore
This paper presents cooperative spectrum sensing in cognitive radio networks under Gaussian fusion channels. The global detection performance is evaluated based on Neyman-Pearson (NP) detection and using equal gain combining (EGC) fusion rule. It is shown that, under a global signal to noise ratio (SNR) constraint, the global detection performance can be maximized by choosing an appropriate local energy threshold. Furthermore, asymptotic performance is investigated assuming large numbers of secondary users and samples used for local energy calculation.
{"title":"Cooperative spectrum sensing in cognitive radio networks under Gaussian fusion channels","authors":"Gang Xiong, S. Kishore","doi":"10.1109/CISS.2009.5054803","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054803","url":null,"abstract":"This paper presents cooperative spectrum sensing in cognitive radio networks under Gaussian fusion channels. The global detection performance is evaluated based on Neyman-Pearson (NP) detection and using equal gain combining (EGC) fusion rule. It is shown that, under a global signal to noise ratio (SNR) constraint, the global detection performance can be maximized by choosing an appropriate local energy threshold. Furthermore, asymptotic performance is investigated assuming large numbers of secondary users and samples used for local energy calculation.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121567612","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054821
T. Goodman, M. Aburdene
The problem of converting a digital prototype filter, Hp (z), to a filter with specified cutoff parameters involves computing a new filter, H (z), from the prototype filter. A new recursive matrix approach for the conversion is presented. This simpler and more direct method is used to convert digital lowpass-to-digital lowpass filters and digital lowpass-to-digital highpass filters.
{"title":"A recursive matrix approach to spectral transformations for digital filters","authors":"T. Goodman, M. Aburdene","doi":"10.1109/CISS.2009.5054821","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054821","url":null,"abstract":"The problem of converting a digital prototype filter, Hp (z), to a filter with specified cutoff parameters involves computing a new filter, H (z), from the prototype filter. A new recursive matrix approach for the conversion is presented. This simpler and more direct method is used to convert digital lowpass-to-digital lowpass filters and digital lowpass-to-digital highpass filters.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121568653","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054719
Syed Ali Raza Zaidi, M. Hafeez, S. A. Khayam, D. McLernon, M. Ghogho, Kwangjo Kim
A solution to the coverage problem in wireless sensor networks provides the total number of sensors that are required to cover a given area of deployment. While prior studies have proposed different formulations and solutions to this problem, these studies have not addressed the problem of minimum cost coverage in which full coverage is achieved by using the minimum number of sensor nodes for an arbitrary geometric shape region. In this paper, we present a geometric solution to the minimum cost coverage problem under a deterministic deployment. Furthermore, we present a probabilistic coverage solution which provides a relationship between the probability of coverage and the number of randomly deployed sensors in an arbitrarily-shaped region. We demonstrate that for virtually 100% probability of coverage, random deployment needs approximately seven times more sensors as compared to a deterministic setup.
{"title":"On minimum cost coverage in wireless sensor networks","authors":"Syed Ali Raza Zaidi, M. Hafeez, S. A. Khayam, D. McLernon, M. Ghogho, Kwangjo Kim","doi":"10.1109/CISS.2009.5054719","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054719","url":null,"abstract":"A solution to the coverage problem in wireless sensor networks provides the total number of sensors that are required to cover a given area of deployment. While prior studies have proposed different formulations and solutions to this problem, these studies have not addressed the problem of minimum cost coverage in which full coverage is achieved by using the minimum number of sensor nodes for an arbitrary geometric shape region. In this paper, we present a geometric solution to the minimum cost coverage problem under a deterministic deployment. Furthermore, we present a probabilistic coverage solution which provides a relationship between the probability of coverage and the number of randomly deployed sensors in an arbitrarily-shaped region. We demonstrate that for virtually 100% probability of coverage, random deployment needs approximately seven times more sensors as compared to a deterministic setup.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129379742","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054774
Jun Xiao, Y. Liu, Wen Gao, An Liu
Multiple antennas and relay can improve spectral efficiency of a network. Half duplex relay channels employing decode-and-forward and total power constraint are considered in this work. The resource includes power and time for the receive and transmit stages of the relay. Resource allocation algorithm is designed in order to maximize an achievable rate. The source and the relay nodes are assumed to have partial channel state information (CSI) obtained through finite-rate feedback from relay and/or destination. The full-blown problem is stated and the result of a special case of orthogonal transmission is presented. The transmitters use the simple power on/off precoding with constant number of on-beams while the precoding matrices are chosen according to quantization on Grassmann manifolds. An earlier analytical result on finite rate feedback is employed in the resource allocation algorithm. The complicated expressions of the achievable rates and the non-convexity of the problem make the optimal resource allocations hard to obtain and analyze. Iterative and near optimal resource allocation algorithm is presented. Numerical results are provided to show the benefits of finiterate feedback by comparison of the achievable rates of the relay channel, two-hop transmission and the direct transmission.
{"title":"Resource allocation for MIMO orthogonal relay channels with finite-rate feedback","authors":"Jun Xiao, Y. Liu, Wen Gao, An Liu","doi":"10.1109/CISS.2009.5054774","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054774","url":null,"abstract":"Multiple antennas and relay can improve spectral efficiency of a network. Half duplex relay channels employing decode-and-forward and total power constraint are considered in this work. The resource includes power and time for the receive and transmit stages of the relay. Resource allocation algorithm is designed in order to maximize an achievable rate. The source and the relay nodes are assumed to have partial channel state information (CSI) obtained through finite-rate feedback from relay and/or destination. The full-blown problem is stated and the result of a special case of orthogonal transmission is presented. The transmitters use the simple power on/off precoding with constant number of on-beams while the precoding matrices are chosen according to quantization on Grassmann manifolds. An earlier analytical result on finite rate feedback is employed in the resource allocation algorithm. The complicated expressions of the achievable rates and the non-convexity of the problem make the optimal resource allocations hard to obtain and analyze. Iterative and near optimal resource allocation algorithm is presented. Numerical results are provided to show the benefits of finiterate feedback by comparison of the achievable rates of the relay channel, two-hop transmission and the direct transmission.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129632821","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
扫码关注我们
求助内容：
应助结果提醒方式：