Pub Date : 2013-10-10DOI: 10.1109/CISS.2013.6624262
H. Mahyar, Hamid R. Rabieey, Z. S. Hashemifar, Payam Siyari
In this paper, we propose a novel framework called UCS-WN in the context of compressive sensing to efficiently recover sparse vectors representing the properties of the links from weighted networks with n nodes. Motivated by network inference, we study the problem of recovering sparse link vectors with network topological constraints over weighted networks. We take sufficient number of collective additive measurements using this framework through connected paths for constructing a feasible measurement matrix. We theoretically show that only O(k log(n)) path measurements via UCS-WN are sufficient for uniquely recovering any k-sparse link vector with no more than k non-zero elements. Moreover, we demonstrate that this framework would converge to an accurate solution for a wide class of networks by experimental evaluations on both synthetic and real datasets.
{"title":"UCS-WN: An unbiased compressive sensing framework for weighted networks","authors":"H. Mahyar, Hamid R. Rabieey, Z. S. Hashemifar, Payam Siyari","doi":"10.1109/CISS.2013.6624262","DOIUrl":"https://doi.org/10.1109/CISS.2013.6624262","url":null,"abstract":"In this paper, we propose a novel framework called UCS-WN in the context of compressive sensing to efficiently recover sparse vectors representing the properties of the links from weighted networks with n nodes. Motivated by network inference, we study the problem of recovering sparse link vectors with network topological constraints over weighted networks. We take sufficient number of collective additive measurements using this framework through connected paths for constructing a feasible measurement matrix. We theoretically show that only O(k log(n)) path measurements via UCS-WN are sufficient for uniquely recovering any k-sparse link vector with no more than k non-zero elements. Moreover, we demonstrate that this framework would converge to an accurate solution for a wide class of networks by experimental evaluations on both synthetic and real datasets.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131902543","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 : 2013-07-08DOI: 10.1109/CISS.2013.6552335
Ahsan Ali, Shuangqing Wei
We explore the degrees-of-freedom and interference tradeoff for a simple cognitive radio system under an assumption that the secondary-user (SU) receiver operates incoherently with the primary-user (PU) transmitter. This assumption makes our system model practically more rigorous, as compared to the conventional studies where a coherent operation is assumed. Due to the incoherent operation of SU receiver, the resulting interference channel is mixture-Gaussian. Our objective is to find the optimal sensing threshold and sensing time, for the signal detector that is used by the SU, such that the SU performance is maximized while the PU performance degradation, caused by the interference due to SU, remains within a tolerable range. Also, we define the interference regimes for SU performances on the basis of PU transmission power level.
{"title":"Degrees-of-freedom and interference tradeoff for a mix-Gaussian cognitive radio channel","authors":"Ahsan Ali, Shuangqing Wei","doi":"10.1109/CISS.2013.6552335","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552335","url":null,"abstract":"We explore the degrees-of-freedom and interference tradeoff for a simple cognitive radio system under an assumption that the secondary-user (SU) receiver operates incoherently with the primary-user (PU) transmitter. This assumption makes our system model practically more rigorous, as compared to the conventional studies where a coherent operation is assumed. Due to the incoherent operation of SU receiver, the resulting interference channel is mixture-Gaussian. Our objective is to find the optimal sensing threshold and sensing time, for the signal detector that is used by the SU, such that the SU performance is maximized while the PU performance degradation, caused by the interference due to SU, remains within a tolerable range. Also, we define the interference regimes for SU performances on the basis of PU transmission power level.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123238676","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552303
Ke-Yao Wang, K. Petrillo, M. Foster, A. Foster
Utilizing a 6-mm-long hydrogenated amorphous silicon nanowaveguide, we demonstrate error-free (BER <; 10-9) 160-to-10 Gb/s OTDM demultiplexing using ultralow switching peak powers of 50 mW. This material is deposited at low temperatures enabling a path toward multilayer integration and therefore massive scaling of the number of devices in a single photonic chip.
{"title":"Ultralow-power 160-to-10Gb/s optical demultiplexing using four-wave mixing in deposited silicon waveguides","authors":"Ke-Yao Wang, K. Petrillo, M. Foster, A. Foster","doi":"10.1109/CISS.2013.6552303","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552303","url":null,"abstract":"Utilizing a 6-mm-long hydrogenated amorphous silicon nanowaveguide, we demonstrate error-free (BER <; 10-9) 160-to-10 Gb/s OTDM demultiplexing using ultralow switching peak powers of 50 mW. This material is deposited at low temperatures enabling a path toward multilayer integration and therefore massive scaling of the number of devices in a single photonic chip.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125222257","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552262
Yao Tang, M. Vu
We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N + 1 private parts, one intended for each relay. It encodes these message parts using Nth-order block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using simultaneous sliding window decoding, each relay fully recovers the common message and its intended private message with the same block index, then forwards them to the following nodes in the next block. This scheme can be applied to any network topology. We derive its achievable rate in a compact form. The result reduces to a known decode-forward lower bound for an N-relay network and partial decode-forward lower bound for a two-level relay network. We then apply the scheme to a Gaussian two-level relay network and obtain its capacity lower bound considering power constraints at the transmitting nodes.
{"title":"A partial decode-forward scheme for a network with N relays","authors":"Yao Tang, M. Vu","doi":"10.1109/CISS.2013.6552262","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552262","url":null,"abstract":"We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N + 1 private parts, one intended for each relay. It encodes these message parts using Nth-order block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using simultaneous sliding window decoding, each relay fully recovers the common message and its intended private message with the same block index, then forwards them to the following nodes in the next block. This scheme can be applied to any network topology. We derive its achievable rate in a compact form. The result reduces to a known decode-forward lower bound for an N-relay network and partial decode-forward lower bound for a two-level relay network. We then apply the scheme to a Gaussian two-level relay network and obtain its capacity lower bound considering power constraints at the transmitting nodes.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116888544","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552304
K. Petrillo, M. Foster
We experimentally demonstrate and analyze through simulation an OTDM→WDM serial to parallel converter that fully extracts all 1610-Gb/s WDM channels from a 160-Gb/s OTDM data stream in a single device using an optical Fourier processor. The device operates by dispersing a pump pulse across all OTDM channels and using the nonlinear optical process of four-wave mixing (FWM) to parallelize all channels simultaneously. The requisite temporal overlap of adjacent pump pulses gives rise to crosstalk from a non-degenerate FWM process. Decreasing the temporal overlap of the pump pulses, reduces this source of crosstalk but also decreases the channel power and spectral isolation at the edge of the generated WDM spectrum leading to increased crosstalk from adjacent channels in this region. We find that a balance between adjacent channel crosstalk and non-degenerate FWM crosstalk through optimization of the pump overlap is critical to ideal operation of the device.
{"title":"Full 16 channel OTDM-WDM conversion using a temporal optical Fourier processor","authors":"K. Petrillo, M. Foster","doi":"10.1109/CISS.2013.6552304","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552304","url":null,"abstract":"We experimentally demonstrate and analyze through simulation an OTDM→WDM serial to parallel converter that fully extracts all 1610-Gb/s WDM channels from a 160-Gb/s OTDM data stream in a single device using an optical Fourier processor. The device operates by dispersing a pump pulse across all OTDM channels and using the nonlinear optical process of four-wave mixing (FWM) to parallelize all channels simultaneously. The requisite temporal overlap of adjacent pump pulses gives rise to crosstalk from a non-degenerate FWM process. Decreasing the temporal overlap of the pump pulses, reduces this source of crosstalk but also decreases the channel power and spectral isolation at the edge of the generated WDM spectrum leading to increased crosstalk from adjacent channels in this region. We find that a balance between adjacent channel crosstalk and non-degenerate FWM crosstalk through optimization of the pump overlap is critical to ideal operation of the device.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127260025","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552306
Hossein Roufarshbaf, J. Nelson
A new discretization technique based on local maxima of the observation likelihood surface is proposed for tree-search based tracking of dim targets in heavy clutter. The joint likelihood of sensor observations over the target state space is evaluated in the vicinity of the previously estimated target state, and its local maxima are selected as new states for discretization. The discretized states are used to build a search tree, which is navigated using the stack algorithm to approximate the maximum a posteriori tracking solution. Simulation results on a benchmark active sonar data set reveal that the proposed algorithm is able to follow dim maneuvering targets without track fragmentation.
{"title":"Likelihood-surface based discretization for tracking via tree search","authors":"Hossein Roufarshbaf, J. Nelson","doi":"10.1109/CISS.2013.6552306","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552306","url":null,"abstract":"A new discretization technique based on local maxima of the observation likelihood surface is proposed for tree-search based tracking of dim targets in heavy clutter. The joint likelihood of sensor observations over the target state space is evaluated in the vicinity of the previously estimated target state, and its local maxima are selected as new states for discretization. The discretized states are used to build a search tree, which is navigated using the stack algorithm to approximate the maximum a posteriori tracking solution. Simulation results on a benchmark active sonar data set reveal that the proposed algorithm is able to follow dim maneuvering targets without track fragmentation.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124710731","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 : 2013-03-20DOI: 10.1109/CISS.2013.6624260
F. Moazzami, Yacob Astatke
In this work, a successive four-stage interference cancellation model to unwrap and remove two co-channel interference signals is introduced and successfully tested. This model utilizes the second order statistics of the cochannel interference signals in an interference limited communication environment for interference cancellation. In this model, interferers and the signal of interest (SOI) are considered as multiple inputs of a multiple-input multiple output (MIMO) system. Therefore, MIMO equalizers and blind MIMO channel estimator are employed for the corresponding tasks. At any stage of equalization in this model, a single signal is equalized and recovered. Later, a replica of the captured signal is cancelled from the received signal mixture. The remaining signal is fed to the next stage for equalization. The benefit of using this scheme is mainly improving the quality of the SOI by re-equalizing after interferers are completely removed. In the results section, 16 dB interference cancellation gain is shown where interferers are as strong as signal (SIR=O) and SNR is 30 dB. A Rayleigh fading (iid) channel is used for simulation.
{"title":"Unwrapping multiple co-channel interference signals","authors":"F. Moazzami, Yacob Astatke","doi":"10.1109/CISS.2013.6624260","DOIUrl":"https://doi.org/10.1109/CISS.2013.6624260","url":null,"abstract":"In this work, a successive four-stage interference cancellation model to unwrap and remove two co-channel interference signals is introduced and successfully tested. This model utilizes the second order statistics of the cochannel interference signals in an interference limited communication environment for interference cancellation. In this model, interferers and the signal of interest (SOI) are considered as multiple inputs of a multiple-input multiple output (MIMO) system. Therefore, MIMO equalizers and blind MIMO channel estimator are employed for the corresponding tasks. At any stage of equalization in this model, a single signal is equalized and recovered. Later, a replica of the captured signal is cancelled from the received signal mixture. The remaining signal is fed to the next stage for equalization. The benefit of using this scheme is mainly improving the quality of the SOI by re-equalizing after interferers are completely removed. In the results section, 16 dB interference cancellation gain is shown where interferers are as strong as signal (SIR=O) and SNR is 30 dB. A Rayleigh fading (iid) channel is used for simulation.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123880774","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 : 2013-03-20DOI: 10.1109/CISS.2013.6708144
Zhang Tao, Yuhan Dong, Xuedan Zhang
DC biased optical OFDM (DCO-OFDM) and asymmetrically clipped optical OFDM (ACO-OFDM) modulation schemes can be used for high data rate wireless optical communications. However they require relatively high bandwidth and/or transmit power. By combining OFDM and polarization shift keying (PolSK), we proposed a novel polarized OFDM (P-OFDM) scheme to improve bandwidth and/or power efficiencies and still preserve the benefits of OFDM and PolSK. Theoretical analyses and numerical results suggest that P-OFDM has improved power efficiency and/or bandwidth efficiency compared with DCO-OFDM and ACOOFDM and achieved better error performance than traditional on-off keying (OOK) scheme.
{"title":"Polarized OFDM for wireless optical communications","authors":"Zhang Tao, Yuhan Dong, Xuedan Zhang","doi":"10.1109/CISS.2013.6708144","DOIUrl":"https://doi.org/10.1109/CISS.2013.6708144","url":null,"abstract":"DC biased optical OFDM (DCO-OFDM) and asymmetrically clipped optical OFDM (ACO-OFDM) modulation schemes can be used for high data rate wireless optical communications. However they require relatively high bandwidth and/or transmit power. By combining OFDM and polarization shift keying (PolSK), we proposed a novel polarized OFDM (P-OFDM) scheme to improve bandwidth and/or power efficiencies and still preserve the benefits of OFDM and PolSK. Theoretical analyses and numerical results suggest that P-OFDM has improved power efficiency and/or bandwidth efficiency compared with DCO-OFDM and ACOOFDM and achieved better error performance than traditional on-off keying (OOK) scheme.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"32 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120906568","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 : 2013-03-20DOI: 10.1109/CISS.2013.6624263
J. Tripathi, J. de Oliveira
In many-to-one or many-to-few traffic scenarios, It is inevitable that `hot spots¿ will occur where traffic from a number of sources gets accumulated. While these hot spots can not be avoided, they can be mitigated by means of distributing the traffic across forwarders with load balancing techniques. In this paper, we define a load imbalance metric, which is applicable to any tree/hierarchy based data collection and/or dissemination.We show how current load balancing techniques existing in wireless sensor networks literature can not be applied to large scale Low Power Lossy Networks (LLNs) and the Internet of Things (IoT). We thus propose a greedy algorithm, that requires only partial topology knowledge, and works with the IETF standardized Routing Protocol for LLNs (RPL), without adding extra control overhead. By not requiring full topology information or all link states, this approach can work in highly varying link condition and large scale deployments. We also provide worst case run-time complexity of our heuristic and simulation results on realistic topology and traffic profiles to establish the validity of our approach.
{"title":"Quantifying load imbalance: A practical implementation for data collection in low power lossy networks","authors":"J. Tripathi, J. de Oliveira","doi":"10.1109/CISS.2013.6624263","DOIUrl":"https://doi.org/10.1109/CISS.2013.6624263","url":null,"abstract":"In many-to-one or many-to-few traffic scenarios, It is inevitable that `hot spots¿ will occur where traffic from a number of sources gets accumulated. While these hot spots can not be avoided, they can be mitigated by means of distributing the traffic across forwarders with load balancing techniques. In this paper, we define a load imbalance metric, which is applicable to any tree/hierarchy based data collection and/or dissemination.We show how current load balancing techniques existing in wireless sensor networks literature can not be applied to large scale Low Power Lossy Networks (LLNs) and the Internet of Things (IoT). We thus propose a greedy algorithm, that requires only partial topology knowledge, and works with the IETF standardized Routing Protocol for LLNs (RPL), without adding extra control overhead. By not requiring full topology information or all link states, this approach can work in highly varying link condition and large scale deployments. We also provide worst case run-time complexity of our heuristic and simulation results on realistic topology and traffic profiles to establish the validity of our approach.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395904","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552340
Khawla A. Alnajjar, Nicholas S. J. Pau, G. Woodward
In order to manage interference in Long Term Evolution (LTE) using single-input single-output (SISO) or multiuser multi-input multi-output systems (MIMO), we investigate interference alignment mitigation techniques for LTE systems and provide an analytic extension and new method. Although precoding generally is applied for each subcarrier, we observe that using a precoder in the output of OFDM signal will give no significant performance degradation. We validate the results by developing a MATLAB simulation model in order to evaluate the link-level performance.
{"title":"Aligned precoder in Long Term Evolution using SISO and MIMO","authors":"Khawla A. Alnajjar, Nicholas S. J. Pau, G. Woodward","doi":"10.1109/CISS.2013.6552340","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552340","url":null,"abstract":"In order to manage interference in Long Term Evolution (LTE) using single-input single-output (SISO) or multiuser multi-input multi-output systems (MIMO), we investigate interference alignment mitigation techniques for LTE systems and provide an analytic extension and new method. Although precoding generally is applied for each subcarrier, we observe that using a precoder in the output of OFDM signal will give no significant performance degradation. We validate the results by developing a MATLAB simulation model in order to evaluate the link-level performance.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125643959","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
扫码关注我们
求助内容：
应助结果提醒方式：