Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054682
Yichuan Hu, Zhongmin Wang, J. Garcia-Frías, G. Arce
We propose a system based on the combination of compressive sensing and non-linear processing that shows excellent robustness against noise. The key idea is the use of nonlinear mappings that act as analog joint source-channel encoders, processing the compressive sensing measurements proceeding from an analog source and producing continuous amplitude samples that are transmitted directly through the noisy channel. As we will show in our simulation results, the proposed framework is readily applicable in practical systems such as imaging, and clearly outperforms systems based on stand-alone compressive sensing.
{"title":"Non-linear coding for improved performance in compressive sensing","authors":"Yichuan Hu, Zhongmin Wang, J. Garcia-Frías, G. Arce","doi":"10.1109/CISS.2009.5054682","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054682","url":null,"abstract":"We propose a system based on the combination of compressive sensing and non-linear processing that shows excellent robustness against noise. The key idea is the use of nonlinear mappings that act as analog joint source-channel encoders, processing the compressive sensing measurements proceeding from an analog source and producing continuous amplitude samples that are transmitted directly through the noisy channel. As we will show in our simulation results, the proposed framework is readily applicable in practical systems such as imaging, and clearly outperforms systems based on stand-alone compressive sensing.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"14 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":"116430331","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.5054812
A. Balasubramanian, Scott L. Miller
A wireless communication system, where a common base station (BS) is scheduled to transmit information to mobile users on a time division (TD) basis, under quality of service (QoS) constraints is considered. The QoS requirement is specified in terms of asymptotic decay rate of buffer occupancy. The optimal scheduling scheme for this system is found, which is then used to characterize the effective capacity. Furthermore, it is shown that the optimal scheduling schemes without QoS constraints and the opportunistic scheduling scheme fall out as special cases of a more generalized class of scheduling schemes derived in this paper.
{"title":"On optimal scheduling for time-division systems with quality of service constraints","authors":"A. Balasubramanian, Scott L. Miller","doi":"10.1109/CISS.2009.5054812","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054812","url":null,"abstract":"A wireless communication system, where a common base station (BS) is scheduled to transmit information to mobile users on a time division (TD) basis, under quality of service (QoS) constraints is considered. The QoS requirement is specified in terms of asymptotic decay rate of buffer occupancy. The optimal scheduling scheme for this system is found, which is then used to characterize the effective capacity. Furthermore, it is shown that the optimal scheduling schemes without QoS constraints and the opportunistic scheduling scheme fall out as special cases of a more generalized class of scheduling schemes derived in this paper.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"45 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120810624","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.5054850
João Almeida, G. Maierbacher, J. Barros
Focusing on the design of scalar quantizers for secure communication in a wiretap environment we propose a low-complexity encoding method that minimizes the end-to-end distortion between legitimate terminals while maximizing the distortion at the eavesdropping receiver. The key idea is to generate confusion by means of randomized index assignments. A simple iterative optimization scheme is shown to yield low distortion mappings with noticeable privacy benefits.
{"title":"Low-complexity index assignments for secure quantization","authors":"João Almeida, G. Maierbacher, J. Barros","doi":"10.1109/CISS.2009.5054850","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054850","url":null,"abstract":"Focusing on the design of scalar quantizers for secure communication in a wiretap environment we propose a low-complexity encoding method that minimizes the end-to-end distortion between legitimate terminals while maximizing the distortion at the eavesdropping receiver. The key idea is to generate confusion by means of randomized index assignments. A simple iterative optimization scheme is shown to yield low distortion mappings with noticeable privacy benefits.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"29 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":"127105970","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.5054824
S. Jana
In a variety of decision systems, processing is performed not on the underlying signal but on a quantized version. Accordingly, assuming fine quantization, Poor observed a quadratic variation in f-divergences with smooth f. In contrast, we derive a quadratic behavior in the Bayesian probability of error, which corresponds to a nonsmooth f, thereby advancing the state of the art. Unlike Poor's purely variational method, we solve a novel cube-slicing problem, and convert a volume integral to a surface integral in the course of our analysis. In this paper, we elaborate our method, and sharpen our result, a preliminary version of which were outlined in our previous work.
{"title":"Asymptotic performance loss in bayesian hypothesis testing under data quantization","authors":"S. Jana","doi":"10.1109/CISS.2009.5054824","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054824","url":null,"abstract":"In a variety of decision systems, processing is performed not on the underlying signal but on a quantized version. Accordingly, assuming fine quantization, Poor observed a quadratic variation in f-divergences with smooth f. In contrast, we derive a quadratic behavior in the Bayesian probability of error, which corresponds to a nonsmooth f, thereby advancing the state of the art. Unlike Poor's purely variational method, we solve a novel cube-slicing problem, and convert a volume integral to a surface integral in the course of our analysis. In this paper, we elaborate our method, and sharpen our result, a preliminary version of which were outlined in our previous work.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"14 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":"129106757","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.5054712
Marco F. Duarte, C. Hegde, V. Cevher, Richard Baraniuk
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals; instead of taking periodic samples, we measure inner products with M ≪ N random vectors and then recover the signal via a sparsity-seeking optimization or greedy algorithm. Initial research has shown that by leveraging stronger signal models than standard sparsity, the number of measurements required for recovery of an structured sparse signal can be much lower than that of standard recovery. In this paper, we introduce a new framework for structured compressible signals based on the unions of subspaces signal model, along with a new sufficient condition for their recovery that we dub the restricted amplification property (RAmP). The RAmP is the natural counterpart to the restricted isometry property (RIP) of conventional CS. Numerical simulations demonstrate the validity and applicability of our new framework using wavelet-tree compressible signals as an example.
{"title":"Recovery of compressible signals in unions of subspaces","authors":"Marco F. Duarte, C. Hegde, V. Cevher, Richard Baraniuk","doi":"10.1109/CISS.2009.5054712","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054712","url":null,"abstract":"Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals; instead of taking periodic samples, we measure inner products with M ≪ N random vectors and then recover the signal via a sparsity-seeking optimization or greedy algorithm. Initial research has shown that by leveraging stronger signal models than standard sparsity, the number of measurements required for recovery of an structured sparse signal can be much lower than that of standard recovery. In this paper, we introduce a new framework for structured compressible signals based on the unions of subspaces signal model, along with a new sufficient condition for their recovery that we dub the restricted amplification property (RAmP). The RAmP is the natural counterpart to the restricted isometry property (RIP) of conventional CS. Numerical simulations demonstrate the validity and applicability of our new framework using wavelet-tree compressible signals as an example.","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":"130516966","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.5054832
Ying Lin, Mingyan Li
We consider in this paper a single-channel wireless sensor network (WSN) where communication among sensor nodes are subject to jamming by an attacker. In particular, we address the detection of a jamming event, and investigate the optimal network defense strategy to mitigate jamming effects. A multiple-monitor distributed detection structure is considered. The optimal detection scheme is developed under the Bayesian criterion, with the goal of minimizing the error probability of detection at a fusion center. For the optimal network defense strategy, we formulate and solve the design problem using a constrained maximization problem by jointly considering Quality-of-Service and resource constraints of WSNs such as communication throughput, energy, and delay.
{"title":"Distributed detection of jamming and defense in wireless sensor networks","authors":"Ying Lin, Mingyan Li","doi":"10.1109/CISS.2009.5054832","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054832","url":null,"abstract":"We consider in this paper a single-channel wireless sensor network (WSN) where communication among sensor nodes are subject to jamming by an attacker. In particular, we address the detection of a jamming event, and investigate the optimal network defense strategy to mitigate jamming effects. A multiple-monitor distributed detection structure is considered. The optimal detection scheme is developed under the Bayesian criterion, with the goal of minimizing the error probability of detection at a fusion center. For the optimal network defense strategy, we formulate and solve the design problem using a constrained maximization problem by jointly considering Quality-of-Service and resource constraints of WSNs such as communication throughput, energy, and delay.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"18 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":"132426755","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.5054829
Qing Chen, M. C. Gursoy
1 In this paper, we have considered the optimization of the M-ary quadrature amplitude modulation (MQAM) constellation size to minimize the bit energy consumption under average bit error rate (BER) constraints. In the computation of the energy expenditure, the circuit, transmission, and retransmission energies are taken into account. A combined log-normal shadowing and Rayleigh fading model is employed to model the wireless channel. The link reliabilities and retransmission probabilities are determined through the outage probabilities under log-normal shadowing effects. Both single-hop and multi-hop transmissions are considered. Through numerical results, the optimal constellation sizes are identified. Several interesting observations with practical implications are made. It is seen that while large constellations are preferred at small transmission distances, constellation size should be decreased as the distance increases. Similar trends are observed in both fixed and variable transmit power scenarios. We have noted that variable power schemes can attain higher energy-efficiencies. The analysis of energy-efficient modulation design is also conducted in multi-hop linear networks. In this case, the modulation size and routing paths are jointly optimized, and the analysis of both the bit energy and delay experienced in the linear network is provided.
{"title":"Energy-efficient modulation design for reliable communication in wireless networks","authors":"Qing Chen, M. C. Gursoy","doi":"10.1109/CISS.2009.5054829","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054829","url":null,"abstract":"1 In this paper, we have considered the optimization of the M-ary quadrature amplitude modulation (MQAM) constellation size to minimize the bit energy consumption under average bit error rate (BER) constraints. In the computation of the energy expenditure, the circuit, transmission, and retransmission energies are taken into account. A combined log-normal shadowing and Rayleigh fading model is employed to model the wireless channel. The link reliabilities and retransmission probabilities are determined through the outage probabilities under log-normal shadowing effects. Both single-hop and multi-hop transmissions are considered. Through numerical results, the optimal constellation sizes are identified. Several interesting observations with practical implications are made. It is seen that while large constellations are preferred at small transmission distances, constellation size should be decreased as the distance increases. Similar trends are observed in both fixed and variable transmit power scenarios. We have noted that variable power schemes can attain higher energy-efficiencies. The analysis of energy-efficient modulation design is also conducted in multi-hop linear networks. In this case, the modulation size and routing paths are jointly optimized, and the analysis of both the bit energy and delay experienced in the linear network is provided.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"9 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":"126801728","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.5054684
Dongming Zhao, Fei Tao
Multi-objective combinatorial optimization (MOCO) problem is investigated in this paper. Combining the characters of agent and quantum-bit, a new idea, i.e., Quantum multi-agent evolutionary algorithms (QMAEA), for addressing MOCO problem is proposed. In QMAEA, each agent represented with quantum-bit is defined as a solution. Several operations such as evaluation-operation, competition-operation, mutation-operation, and local-evolution-Operation are introduced in QMAEA. The working flow of QMAEA is presented.
{"title":"A new idea for addressing multi-objective combinatorial optimization: Quantum multi-agent evolutionary algorithms","authors":"Dongming Zhao, Fei Tao","doi":"10.1109/CISS.2009.5054684","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054684","url":null,"abstract":"Multi-objective combinatorial optimization (MOCO) problem is investigated in this paper. Combining the characters of agent and quantum-bit, a new idea, i.e., Quantum multi-agent evolutionary algorithms (QMAEA), for addressing MOCO problem is proposed. In QMAEA, each agent represented with quantum-bit is defined as a solution. Several operations such as evaluation-operation, competition-operation, mutation-operation, and local-evolution-Operation are introduced in QMAEA. The working flow of QMAEA is presented.","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":"122332028","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.5054720
S. K. Khandani, M. Kalantari
Distributed sensing and data acquisition in field applications is a labor intensive and expensive process. In such applications, measurements need to be performed in thousands of points. To design a sensor network for soil moisture measurement, we introduce a two step design procedure; in the first step, the data of soil moisture experiments known as SMEX03 (in Little Washita watershed, Oklahoma) is used to approximate the spatial variability of moisture data. Based on the numerical data of SMEX03, the spatial correlation of soil moisture is approximated. Our numerical analysis shows that the spatial correlation of moisture measurements of two points behaves similar to an exponentially decaying function of the distance of those points. The analysis also shows that the moisture measurements for the points with distance up to 150m show a high correlation, while the spatial correlation is practically zero for points that are more than 400m apart. In the second step, we use the spatial correlation of soil moisture to design a sensor network. It is assumed that the sensors are placed sparsely in the field, but it is desirable to estimate the soil moisture at any arbitrary point of the field based on the measurements of the nearby sensors. We use a linear estimator, and give the coefficients that minimize its variance. The value of the minimum variance of the linear estimator depends on the location. We give a closed form formula for the coefficients of the linear minimum variance estimator and the upper bound for the its variance as a function of spatial separation of sensors. Assuming a known value for the maximum allowable moisture estimation variance, we find the optimal placement of the sensors. The results show that in a grid like placement of the sensors in the field, with average separation of distance of 50-100m between neighboring sensor pairs, the soil moisture can be approximated with a good accuracy at any arbitrary point of the field, while increasing the distance of neighboring senors beyond 200m degrades the performance significantly.
{"title":"Using field data to design a sensor network","authors":"S. K. Khandani, M. Kalantari","doi":"10.1109/CISS.2009.5054720","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054720","url":null,"abstract":"Distributed sensing and data acquisition in field applications is a labor intensive and expensive process. In such applications, measurements need to be performed in thousands of points. To design a sensor network for soil moisture measurement, we introduce a two step design procedure; in the first step, the data of soil moisture experiments known as SMEX03 (in Little Washita watershed, Oklahoma) is used to approximate the spatial variability of moisture data. Based on the numerical data of SMEX03, the spatial correlation of soil moisture is approximated. Our numerical analysis shows that the spatial correlation of moisture measurements of two points behaves similar to an exponentially decaying function of the distance of those points. The analysis also shows that the moisture measurements for the points with distance up to 150m show a high correlation, while the spatial correlation is practically zero for points that are more than 400m apart. In the second step, we use the spatial correlation of soil moisture to design a sensor network. It is assumed that the sensors are placed sparsely in the field, but it is desirable to estimate the soil moisture at any arbitrary point of the field based on the measurements of the nearby sensors. We use a linear estimator, and give the coefficients that minimize its variance. The value of the minimum variance of the linear estimator depends on the location. We give a closed form formula for the coefficients of the linear minimum variance estimator and the upper bound for the its variance as a function of spatial separation of sensors. Assuming a known value for the maximum allowable moisture estimation variance, we find the optimal placement of the sensors. The results show that in a grid like placement of the sensors in the field, with average separation of distance of 50-100m between neighboring sensor pairs, the soil moisture can be approximated with a good accuracy at any arbitrary point of the field, while increasing the distance of neighboring senors beyond 200m degrades the performance significantly.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"23 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":"115260189","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.5054763
Bob L. Sturm, J. Shynk, Dae Hong Kim
Previous work on sparse approximations has shown that in the pursuit of a signal model using greedy iterative algorithms, the efficiency of the representation can be increased by considering the interference between selected atoms. However, in such interference-adaptive algorithms, atoms are still often selected that necessitate correction by subsequently chosen atoms. It is thus logical to remove these atoms from the representation so that they do not diminish the efficiency of the pursued signal model. In this paper, we propose to prune atoms from the model based on the degree and type of interference, and test its effectiveness in an interference-adaptive orthogonal matching pursuit algorithm.
{"title":"Pruning sparse signal models using interference","authors":"Bob L. Sturm, J. Shynk, Dae Hong Kim","doi":"10.1109/CISS.2009.5054763","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054763","url":null,"abstract":"Previous work on sparse approximations has shown that in the pursuit of a signal model using greedy iterative algorithms, the efficiency of the representation can be increased by considering the interference between selected atoms. However, in such interference-adaptive algorithms, atoms are still often selected that necessitate correction by subsequently chosen atoms. It is thus logical to remove these atoms from the representation so that they do not diminish the efficiency of the pursued signal model. In this paper, we propose to prune atoms from the model based on the degree and type of interference, and test its effectiveness in an interference-adaptive orthogonal matching pursuit algorithm.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"65 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":"116544689","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
扫码关注我们
求助内容：
应助结果提醒方式：