2009 43rd Annual Conference on Information Sciences and Systems最新文献_第10页

Sharp upper bound on error probability of exact sparsity recovery 精确稀疏恢复误差概率的尖锐上界

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054681

Kamiar Rahnama Rad

引用次数: 5

Preliminary results in comparing the expected and observed Fisher information for maximum likelihood estimates 对最大似然估计的预期和观察费雪信息进行比较的初步结果

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054760

X. Cao, J. Spall

引用次数: 0

Using adaptive lossless compression to characterize network traffic 使用自适应无损压缩来表征网络流量

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054730

K. Benson, L. Marvel

引用次数: 0

Secondary user friendly TDMA scheduling for primary users in cognitive radio networks 认知无线网络中主用户的辅助用户友好TDMA调度

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054788

Hang Su, Xi Zhang

{"title":"Secondary user friendly TDMA scheduling for primary users in cognitive radio networks","authors":"Hang Su, Xi Zhang","doi":"10.1109/CISS.2009.5054788","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054788","url":null,"abstract":"Cognitive radio technology is widely accepted as an efficient approach to solve the problem that the wireless spectrum has been getting scarcer and scarcer due to the rapid growth in the ubiquitous wireless applications. Several cognitive medium access control (MAC) protocols have been proposed for the secondary users (non-licensed users) to take advantage of the vacant channels whenever they are not occupied by the primary users (licensed users) in the wireless time division multiple access (TDMA)-based networks. In this paper, by exploiting the unique property of the wireless fading channel and cross-layer design technique, we develop a packets scheduling scheme for the primary users in the context of wireless TDMA networks, which is set up to operate friendly towards the secondary users in terms of vacant-channel probability. Our proposed scheme can be implemented with just slight modification on the traditional TDMA scheduling algorithm. We develop a rigorous queuing model and then quantitatively analyze the tradeoff among multiple performance metrics to identify when and where the cost for favoring the secondary users is worthy. The analytical results show that our proposed scheme can generate more vacant-channel opportunities for secondary users, at the expense of little increasing packet delay, as compared with the traditional wireless TDMA scheduling algorithm. In addition, since the implementation of our proposed scheme only needs little modification on the existing TDMA scheduling algorithm, our proposed scheme is a practical and cost-effective approach to increase the wireless spectrum utilization.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120842426","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}

引用次数: 8

Sleeping policy cost analysis for sensor nodes collecting heterogeneous data 采集异构数据的传感器节点睡眠策略成本分析

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054796

Zhen Zhao, A. Elancheziyan, J. D. Oliveira

{"title":"Sleeping policy cost analysis for sensor nodes collecting heterogeneous data","authors":"Zhen Zhao, A. Elancheziyan, J. D. Oliveira","doi":"10.1109/CISS.2009.5054796","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054796","url":null,"abstract":"Sleeping policies are widely used in many contexts to reduce energy consumption in sensor nodes, ad-hoc terminals or mobile cell phones. Although there is extensive literature on energy saving in sensor networks, little has been done with respect to comparing additional costs, such as packet drop probability and buffer occupancies of sleeping versus non-sleeping policies, especially for multiple classes of data. In this paper, we employ discrete time vacation modeling results from queueing theory to obtain the quantities of interest, i.e., blocking probabilities, and queue lengths incurred by sleeping policies for a sensor node with a finite buffer.We propose a 2-class Geo/G/1/K vacation model, where two classes of data, each with its own buffer, are collected by a sensor node following a sleeping policy. At any time instant, only one packet can be transferred and the transmission order is selected by a scheduling function. The sleeping, transfer and selection processes have general distributions. To the best of our knowledge, this is the first work on modeling and analyzing the performance characteristics of a sensor node with a sleeping policy, collecting heterogeneous data. First, we present a Markov renewal process embedded at the time instant of transfer completion and then obtain the marginal occupancy distributions at an arbitrary time instant. Simulation results validate our theoretical derivation and demonstrate how the results can be applied to understand the behavior of sensor nodes with heterogeneous data.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"34 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":"129351463","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}

引用次数: 1

Optimal power allocation for achieving perfect secrecy capacity in MIMO wire-tap channels 实现MIMO线接信道完美保密能力的最优功率分配

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054790

Jia Liu, Yiwei Thomas Hou, H. Sherali

引用次数: 18

Performance evaluation: Priority transmission using network coding with multi-generation mixing 性能评价:采用多代混音网络编码优先传输

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054758

Mohammed D. Halloush, H. Radha

{"title":"Performance evaluation: Priority transmission using network coding with multi-generation mixing","authors":"Mohammed D. Halloush, H. Radha","doi":"10.1109/CISS.2009.5054758","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054758","url":null,"abstract":"In this paper, we evaluate the priority transmission characteristic of Network Coding (NC) with Multi-Generation Mixing (MGM). MGM supports priority transmission by providing enhanced reliability for delivering different groups of sender packets. MGM is a generalized approach for practical network coding that enhances its performance. With MGM, sender packets are grouped in generations that constitute mixing sets. By employing the novel inter-generation network coding approach, each generation within a mixing set can be considered as a priority layer. This is due to the varying levels of data protection provided to the different generations within a mixing set. Traditionally, priority transmission is done by increasing the level of FEC protection assigned to sender data of higher priority. This incurs transmission overhead that consumes bandwidth. MGM supports priority transmission by network encoding data of higher priority in more sender packets so that more packets support its recovery. At the same time there is no increase in the total number of packets transmitted and hence no additional transmission overhead.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"5 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":"115409649","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}

引用次数: 7

Iteratively re-weighted least squares for sparse signal reconstruction from noisy measurements 基于迭代加权最小二乘的噪声测量稀疏信号重构

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054762

R. Carrillo, K. Barner

引用次数: 34

Recursive least-squares doubly-selective MIMO channel estimation using exponential basis models 基于指数基模型的递归最小二乘双选择MIMO信道估计

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054772

Hyosung Kim, Jitendra Tugnait

引用次数: 0

2—Sector interference channel communication for sum rates and minimum rate maximization 用于和速率和最小速率最大化的2扇区干扰信道通信

2009 43rd Annual Conference on Information Sciences and Systems Pub Date : 2009-03-18 DOI: 10.1109/CISS.2009.5054854

M. Charafeddine, A. Paulraj

{"title":"2—Sector interference channel communication for sum rates and minimum rate maximization","authors":"M. Charafeddine, A. Paulraj","doi":"10.1109/CISS.2009.5054854","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054854","url":null,"abstract":"This paper applies recent advances in communicating over the interference channel while treating the interference as noise. Two maximization utilities are considered: maximizing the sum rates and maximizing the minimum rate. The channel model is based on a 2—sector interference channel within a single cell. The utilities maximization is presented from the perspective of the interference channel's achievable rates region. Maximizing the minimum rate parts from the traditional problem formulation of casting it as a pure power control problem. Instead, the problem is presented as maximization over the convex hull of the rates region, therefore employing both power control and time-sharing strategies. For maximizing the minimum rate, it is shown that optimal communication over a 2—sector channel is not homogenous, and an interplay of different time-sharing types and/or power control is required to achieve optimality. Systems results are presented together with the gains achieved by using the proposed techniques over the traditional paradigms used in communicating over the 2—sector channel. Finally, insights and the contextualization of the aforementioned techniques within an information theoretic perspective are discussed.","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":"116629899","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}

引用次数: 13