{"title":"Alternating cooperative transmissions for a strip-shaped sensor network","authors":"A. Kailas, M. A. Ingram","doi":"10.1109/CISS.2010.5464732","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464732","url":null,"abstract":"We analyze a medium access control (MAC)-free ¿alternating sets¿ transmission strategy for a two-dimensional strip-shaped network. This may be viewed as a broadcast strategy if the entire network has a strip shape, or it may be viewed as a unicast strategy if there is a set of pre-designated cooperators along a conventional multi-hop route, which we refer to as a cooperative route. When there are repeated transmissions, the key advantage of the approach is that it drains the energies of the participating nodes uniformly and in an energy efficient fashion, thereby increasing the network longevity for energy constrained networks. The strategy is based on a very low-overhead form of cooperative diversity called the Opportunistic Large Array (OLA). In the initial transmission, an SNR (¿transmission¿) threshold is used to define mutually exclusive sets of nodes, such that the union of the sets includes all the nodes in the network or cooperative route. Only one of the sets is used for the first transmission. The next transmission uses the next set, and so on. In other words, for two sets, the proposed Alternating OLA with Transmission Threshold (A-OLA-T) basically alternates the transmitting set of nodes (or OLAs) during each transmission cycle. Previously, we analyzed A-OLA-T under the continuum assumption (very high node density) for disc-shaped networks. In this paper, we analyze the performance of the two-set A-OLA-T for strip-shaped networks.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039833","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}
{"title":"Connectivity in random graphs induced by a key predistribution scheme - small key pools","authors":"Osman Yağan, A. Makowski","doi":"10.1109/CISS.2010.5464934","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464934","url":null,"abstract":"We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity, and provide simple proofs for small key pools.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126569408","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}
{"title":"High-resolution 4-D imaging using fringe analysis","authors":"Nikolaus Karpinsky, Song Zhang","doi":"10.1109/CISS.2010.5464817","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464817","url":null,"abstract":"Real-time 3-D imaging, otherwise known as 4-D imaging, is becoming increasingly important in areas such as medical science, entertainment, homeland security, and manufacturing. Numerous 3-D imaging techniques have been developed, but only a few of them have the potential to achieve realtime. Of these few, fringe analysis based techniques stand out, having many advantages over the rest. This paper will explain the principles behind fringe analysis based techniques, and will provide experimental results from systems using these techniques.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116097556","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}
{"title":"Message passing Bayesian Compressed Sensing for UWB pulse acquisition","authors":"Depeng Yang, Husheng Li, G. D. Peterson","doi":"10.1109/CISS.2010.5464905","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464905","url":null,"abstract":"The theory of compressed sensing has been applied to UWB systems for acquisition of UWB signals at a sub-Nyquist sampling rate. The UWB echo signal has lots of template redundancy which can be exploited to make the sparse UWB signal even sparser. This paper proposes a message passing Bayesian Compressed Sensing (BCS) algorithm to utilize the template redundancy for reducing the number of measurements and improving the capability of combating noise. Simulation results show the proposed massage passing BCS algorithm outperforms the original BCS and Orthogonal Matching Pursuit (OMP) algorithms.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123118172","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}
{"title":"Quality versus intelligibility: Evaluating the coding trade-offs for American Sign Language video","authors":"Frank M. Ciaramello, Jung Ko, S. Hemami","doi":"10.1109/CISS.2010.5464827","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464827","url":null,"abstract":"Real-time videoconferencing using cellular devices provides natural communication to the Deaf community. Compressed American Sign Language video must be evaluated in terms of the intelligibility of the conversation and not in terms of the overall aesthetic quality of the video. This work studies the trade-offs between intelligibility and quality when varying the proportion of the rate allocated explicitly to the signer. An intelligibility distortion measure and a quality measure (PSNR) are applied in a rate-distortion optimization framework and a novel encoding technique controls the degree to which intelligibility is emphasized over quality. Understanding the relationship between intelligibility and quality allows the encoder to identify operating points that maximize PSNR while maintaining a minimal level of intelligibility. At fixed bitrates, PSNR can be increased on average by 5 dB with little penalty in intelligibility by providing a nominal amount of rate to the background region. Further increases in PSNR can be achieved at the price of reduced intelligibility.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121124273","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}
{"title":"Enhancing the reliability of cognitive radio networks via channel assignment: risk analysis and redundancy allocation","authors":"Husheng Li, Lijun Qian","doi":"10.1109/CISS.2010.5464726","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464726","url":null,"abstract":"A key challenge in cognitive radio networks is the unreliability of cognitive radio links due to the interruptions from primary users. To enable reliable data transmission over cognitive radio networks, the large available bandwidth obtained from cognitive radio can be used to improve the system redundancy in order to guarantee the system reliability. Using the terminology in the theory of optimal reliability design in industrial engineering, a single path data flow can be considered as a parallel-series system, in which each cut set represents a secondary user and contains several assigned channels. A heuristic algorithm is proposed to assign the channels in the licensed spectrum band to different cut sets in the parallel-series system to minimize the overall risk. By adopting the concept of cut set hazard, the algorithm is applied in both single path and multiple path situations. It is also extended to the decentralized scenario. Channel reuse, which incurs the correlation of failures in the system, is also considered for the channel assignment. Simulation shows that the proposed algorithms can significantly improve the reliability of cognitive radio networks.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125000636","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}
{"title":"Adaptive beamforming in interference networks via bi-directional training","authors":"Changxin Shi, R. Berry, M. Honig","doi":"10.1109/CISS.2010.5464742","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464742","url":null,"abstract":"We study distributed algorithms for adjusting beamforming vectors and receiver filters in multiple-input multiple-output (MIMO) interference networks, with the assumption that each user uses a single beam and a linear filter at the receiver. In such a setting there have been several distributed algorithms studied for maximizing the sum-rate or sum-utility assuming perfect channel state information (CSI) at the transmitters and receivers. The focus of this paper is to study adaptive algorithms for time-varying channels, without assuming any CSI at the transmitters or receivers. Specifically, we consider an adaptive version of the recent Max-SINR algorithm for a time-division duplex system. This algorithm uses a period of bi-directional training followed by a block of data transmission. Training in the forward direction is sent using the current beam-formers and used to adapt the receive filters. Training in the reverse direction is sent using the current receive filters as beams and used to adapt the transmit beamformers. The adaptation of both receive filters and beamformers is done using a least-squares objective for the current block. In order to improve the performance when the training data is limited, we also consider using exponentially weighted data from previous blocks. Numerical results are presented that compare the performance of the algorithms in different settings.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125028589","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}
{"title":"MIMO power strategies for limited transmitter CSI","authors":"Yi-Lin Tsai, C. Rose","doi":"10.1109/CISS.2010.5464877","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464877","url":null,"abstract":"MIMO system capacity depends on the assumptions about what channel information is known at the transmitters and receivers; i.e., channel state information (CSI) and/or channel distribution information (CDI). We investigate three simple power allocation strategies for improving the maximum possible signaling rate (ergodic capacity) in MIMO systems with complete CSI at the receiver and periodically updated CSI at the transmitter.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122726137","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}
{"title":"Seidel's legacy and the existence of complex equiangular Parseval frames","authors":"B. Bodmann, Helen J. Elwood","doi":"10.1109/CISS.2010.5464808","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464808","url":null,"abstract":"Seidel's combinatorial approach to the construction of real, symmetric matrices with unimodular entries and two eigenvalues has produced many equiangular Parseval frames for real Hilbert spaces. We follow Seidel's footsteps and develop a corresponding combinatorial characterization of complex Seidel matrices belonging to equiangular Parseval frames. We deduce necessary conditions for the existence of complex Seidel matrices containing pth roots of unity and having exactly two eigenvalues, under the assumption that p is prime. Explicitly examining the necessary conditions for p = 5, for example, rules out the existence of many such frames with a number of vectors less than 50. Nevertheless, there are examples, which we confirm by constructing p2 × p2 Seidel matrices containing pth roots of unity and having two eigenvalues. and thus the existence of the associated complex equiangular Parseval frames, for any p ≥ 2","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122513843","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}
{"title":"Optimal fusion scheme in wireless sensor networks under sum-rate capacity constraint","authors":"Fang Yi, Y. Yi, Lingjia Liu","doi":"10.1109/CISS.2010.5464969","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464969","url":null,"abstract":"In this paper, we investigate optimal fusion schemes for decentralized detection problems in which a network of wireless sensors provides relevant information about the state of nature to a fusion center. Upon independent reception of the signal, each sensor performs distributed binary detection and sends the decision as well as the reliability of the decision to the fusion center. The capacity region of the corresponding multi-access channel (MAC) from wireless sensors to the fusion center is identified and the sum-rate capacity is characterized. Further-more, it can be shown that when the number of wireless sensors is big enough, the sum-rate capacity of the corresponding MAC channel converges to a constant due to “channel-hardening”. Based on this result, we analyze the performance of quantizing the reliability of the decentralized decision under the sum-rate capacity constraint. The corresponding optimal fusion scheme is derived and the analysis is conducted under the low signal-to-noise (SINR) regime to better reflect the reality.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129808064","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}