{"title":"Conferencing on trees","authors":"A. Jalali, D. Love, S. Sanghavi, B. Hochwald","doi":"10.1109/CISS.2009.5054820","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054820","url":null,"abstract":"In this paper, we develop an optimal scheme for conferencing (i.e. all-to-all communication), in communication networks. Our scheme uses the minimum sum rate. First we state a lower bound on sum rate and show how to achieve it on networks with tree topology. This result can be used on general networks considering the spanning tree which connects the conferencing nodes.","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":"122048876","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":"Joint channel and power allocation based on user satisfaction for cognitive radio","authors":"Qi Cheng, Bhargav Kollimarla","doi":"10.1109/CISS.2009.5054786","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054786","url":null,"abstract":"The concept of spectrum sharing has received increasing interest in an attempt to alleviate the spectrum scarcity issue. In this paper, the problem of K pairs of cognitive radios sharing N available channels and its associated problem of optimal power allocation across users and channels are studied. A new metric indicating user satisfaction in both data rate and power consumption is formulated. Joint channel and power allocation algorithms are designed for both orthogonal transmission and interference transmission. These algorithms are then extended for cognitive radios equipped with multiple antennas. Numerical results demonstrate the efficiency of the proposed algorithms. The performance comparison is conducted for orthogonal and interference transmissions under different interference scenarios. The performance gains by allowing interference transmission and by using multiple antennas at transceivers are demonstrated.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"43 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":"121793223","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":"On unequal error protection with low density parity check codes in scalable video coding","authors":"Yong Liu, Saad B. Qaisar, H. Radha, Aidong Men","doi":"10.1109/CISS.2009.5054826","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054826","url":null,"abstract":"In this work, we propose an unequal error protection (UEP) scheme for scalable video coding using Low Density Parity Check (LDPC) codes. LDPC codes are renowned for their near-capacity performance. In the proposed framework, a video sequence is coded based on Scalable Video Coding (SVC) H.264/AVC standard document. We divide the SVC coded video stream into different sub-streams in terms of time and quality scalability. These sub-streams are channel-coded using Low Density Parity Check (LDPC) codes for robustness against channel impairments. LDPC codes with different coding rates are applied for different sub-streams according to the significance level of each sub-stream in order to provide UEP. We develop a probability model for decoding failure using LDPC codes in order to evaluate the bit error rate under different signal-to-noise ratios and delay constraints for an AWGN channel. Further motivated by optimally allocating the bits to maximize the quality of reconstructed video at the decoder against channel induced corruptions, we propose an Optimal Bit Allocation Algorithm (OBAA) that optimally allocates the channel coding rates using a dynamic programming approach. We use the proposed probability model in OBAA in order to obtain rate-distortion characteristics of LDPC coded SVC video. The results achieved clearly establish that the proposed UEP scheme can optimally allocate LDPC codes with different coding rates to different sub-streams that significantly decreases the end-to-end distortion of the system as compared to equal error protection (EEP) scheme resulting in greater system throughputs","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"90 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":"121952106","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":"Near-capacity performance soft output sphere decoding based on short list detection and metrics combining","authors":"Jinhong Wu, B. Vojcic","doi":"10.1109/CISS.2009.5054776","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054776","url":null,"abstract":"We introduce a low complexity iterative soft output sphere decoding algorithm for coded transmissions over multiple antenna channels. Before the iterative detection and decoding starts, a modified hard decision sphere decoder produces a short (base) list of vectors with maximum likelihood metrics. In subsequent iterative soft detections, two competing lists with a small number of vectors are further generated for each coded bit, by utilizing the base list vectors and a priori information from the channel decoder. The corresponding likelihood metrics of the vectors in each competing list are combined to produce soft detection output that approximates the optimal maximum a posteriori (MAP) solution. The performance improves as the base list size increases and a short list (hence a low number of competing vectors) can provide near-capacity performance after a few iterations. Compared with existing methods that adopt the max-log approximation and select only a single best competing vector, the proposed algorithm approaches the optimal performance better with significantly lower complexity requirements.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"2017 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":"128037645","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":"Nested erasure codes to achieve the singleton bounds","authors":"Phisan Kaewprapha, N. Puttarak, Jing Li","doi":"10.1109/CISS.2009.5054697","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054697","url":null,"abstract":"This paper presents innovative ideas to construct maximum distance separable (MDS) codes, optimal error correction codes that achieve the singleton bounds. The proposed codes are based on a circularly symmetric construction applied to a novel class of nested graphs, referred to as complete-graph-of-rings (CGR). We demonstrate the general idea of transforming graphs to array codes, provide the sufficient conditions for achieving MDS, and present the specific algorithms to construct CGR graphs and MDS-CGR codes. The new codes require minimal encoding and decoding complexity that is theoretically possible, and are particularly useful for disk array applications.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"20 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":"126913723","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":"A new scheme for energy-efficient estimation in a sensor network","authors":"Xun Chen, Rick S. Blum, Brian M. Sadler","doi":"10.1109/CISS.2009.5054827","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054827","url":null,"abstract":"In this paper, energy efficient estimation of an unknown parameter in Gaussian noise is studied in a sensor networking context. A new approach is suggested to obtain a good approximation to the traditional maximum likelihood (ML) estimate, which can save energy by reducing the number of sensor transmissions. Specifically, we describe a new and simple transmission scheme in which the sensor transmissions are ordered according to the magnitude of their measurements, and the sensors with small magnitude measurements, smaller than a threshold, do not transmit. A bound on the error of approximation is derived, which can be utilized to dynamically determine the threshold such that a trade-off between the accuracy of the approximation and the energy savings can be maintained. Through the numerical results, we show that our approach can be very energy efficient with only a negligible estimation error introduced.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"124 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":"132645311","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":"A color detection glove with haptic feedback for the visually disabled","authors":"H. Schwerdt, J. Tapson, R. Etienne-Cummings","doi":"10.1109/CISS.2009.5054804","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054804","url":null,"abstract":"The following paper describes the design and preliminary results of a compact color detecting and feedback system. The device is intended for use by those with vision-loss or disabilities who may benefit by a means of perceiving color. The device consists of a glove incorporating optical color sensors along with tactile switches affixed to the fingertips, a haptic feedback interface wrapped around the fore arm, and a microprocessor unit to control communication between sensing and feedback. The color data and finger selection is encoded to spatial and temporal parameters on tactors. The study extends on earlier investigations by Tapson et. al. that have successfully demonstrated the capability of accurately identifying colors through haptic feedback. To further extend the field, the present research attempts to characterize color information in a temporally and spatially continuous representation to more realistically map the features of color space, and allow higher resolution of color perception.","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":"129691420","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":"Real-time pulse arrival detection in the presence of white Gaussian noise","authors":"A. Komaee","doi":"10.1109/CISS.2009.5054764","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054764","url":null,"abstract":"A stochastic model is considered in which the observable signal is a stochastic process defined as the additive combination of a pulse with a random arrival time and a white Gaussian process. It is assumed that the probability density function of the arrival time is known. The concern is to detect the arrival of the pulse based on an observation set which terminates as soon as the arrival of the pulse is announced. A technique for achieving this goal is to apply the observed signal to an appropriate nonlinear filter and monitor its output until a certain criterion is met. Two such criteria are proposed and expressions for their associated filtering schemes are determined. In general, it is difficult to obtain exact implementable filters to recursively determine these expressions, thus under certain assumptions, an approximate filtering scheme is proposed.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"36 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":"130492945","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 content delivery with network coding","authors":"Derek Leong, T. Ho, R. Cathey","doi":"10.1109/CISS.2009.5054756","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054756","url":null,"abstract":"We present a unified linear program formulation for optimal content delivery in content delivery networks (CDNs), taking into account various costs and constraints associated with content dissemination from the origin server to storage nodes, data storage, and the eventual fetching of content from storage nodes by end users. Our formulation can be used to achieve a variety of performance goals and system behavior, including the bounding of fetch delay, load balancing, and robustness against node and arc failures. Simulation results suggest that our formulation performs significantly better than the traditional minimum k-median formulation for the delivery of multiple content, even under modest circumstances (small network, few objects, low storage budget, low dissemination costs).","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":"117351052","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":"Impact of secondary MAC cooperation on spectrum sharing in cognitive readio networks","authors":"Tariq Elkourdi, O. Simeone","doi":"10.1109/CISS.2009.5054785","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054785","url":null,"abstract":"In this paper, the impact of secondary MAC cooperation on the sum-throughput of multichannel cognitive radio networks is studied. The main goal is twofold: Given the primary and secondary users' duty cycle, (i) investigate the amount of spectrum sharing (i.e., number of secondary users) that maximizes the sum-throughput in the presence of secondary MAC cooperation; (ii) assess the performance gains attainable with cooperation. First, analysis is provided for the idealistic case of perfect sensing, with a simple model for secondary cooperation. Then, for the more strategies case of imperfect sensing, novel cooperative secondary strategies are proposed that are shown to provide relevant performance gains in terms of sum-throughput. Finally, numerical simulation results are provided to evaluate the performance of the cooperative schemes relative to other non-cooperative schemes.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"118 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":"114975687","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}