Queens Presbyterian Church

Displaying 1-29 of 29 results

  • White Papers // Jan 2014

    Maximizing the Lifetime of a Sensor Network Through Domatic Partition

    Distributing sensing and data gathering tasks to a dominating set is an attractive choice in wireless sensors networks since it helps prolong network lifetime by engaging such a subset of nodes for these tasks and letting other nodes go into energy-efficient sleep mode. Because they are busy all the time...

    Provided By Queens Presbyterian Church

  • White Papers // Jan 2014

    A Constant Factor Distributed Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks

    A wireless sensor network is composed of a set of battery-powered sensors which communicate with one another over wireless links directly if they are within their transmission ranges, otherwise they rely on other sensors to establish a connection between them. Connected Dominating Sets (CDSs) are probably the most common way...

    Provided By Queens Presbyterian Church

  • White Papers // Jan 2014

    A Distributed Constant Factor Self-Protection Algorithm for Wireless Sensor Networks

    Wireless sensor networks have drawn a lot of attention owing to their potential use in different surveillance applications including object monitoring, path protection, area coverage, and so on. Since sensors provide monitoring to other objects, it is often necessary to give them a level of protection such that sensors can...

    Provided By Queens Presbyterian Church

  • White Papers // Nov 2013

    Estimating Resource Costs of Executing Data-Intensive Workloads in Public Clouds

    The promise of \"Infinite\" resources given by the cloud computing paradigm has led to recent interest in exploiting clouds for large-scale data-intensive computing. In this paper, the authors present an analytical model to estimate the resource costs for executing data-intensive workloads in a public cloud. The cost model quantifies the...

    Provided By Queens Presbyterian Church

  • White Papers // Nov 2012

    A Fairness-Based Preemption Algorithm for LTE-Advanced

    In this paper, the authors propose a fairness-based preemption algorithm for 3GPP LTE-Advanced. It considers bearers' priorities as well as their QoS over-provisioning with respect to their minimum QoS needs into the partial preemption decision. They define a preemption contribution metric for each established bearer and they evaluate the proposed...

    Provided By Queens Presbyterian Church

  • White Papers // Nov 2012

    Opportunistic Relaying With Time-Division Broadcast in Bidirectional Cooperative Networks

    The authors propose a reactive Opportunistic Relaying (OR) scheme for Time-Division BroadCast (R-TDBC) in a bidirectional cooperative network. In the proposed R-TDBC, a subset of relays that reliably decode both signals from the sources is determined reactively after two source-transmissions; then a single relay among the determined set is selected...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    A Consensus-Based Protocol for Spectrum Sharing Fairness in Cognitive Radio Ad Hoc & Sensor Networks

    Spectrum sharing is an important topic in Cognitive Radio Ad Hoc Networks (CRAHNs) and Cognitive Radio Sensor Networks (CRSNs). Bio-inspired consensus-based protocols can provide light-weight and efficient solutions for CRAHNs and CRSNs but the theoretical ground should be investigated for spectrum sharing fairness. In this paper, the authors investigate the...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    Towards a Wireless Sensor Network Platform for the Internet of Things

    This paper describes a WSN platform architecture uniquely designed and implemented for the Internet of Things (IoTs). The paper elaborates on all the architectural design decisions and challenges across the three major divisions of the platform, that is, the middleware, hardware, and network layer. The result of this research is...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    Secrecy Capacity Over Correlated Log-Normal Fading Channel

    This paper is concerned with the study of secrecy capacity for the log-normal fading channel in which the main channel is correlated with the eavesdropper channel. Perfect secrecy is achieved when the transmitter and legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    ITACA: Flexible, Scalable Network Analysis

    Real-time analysis is vital to network security and management. Solutions are required that are scalable to modern network speeds while remaining flexible to ensure the latest analysis techniques can be implemented. This paper presents the Internet Traffic And Content Analyzer (ITACA), an extendable general analysis tool that enables the implementation...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    Enhanced Outage Performance With Adaptive Linear Precoding in Cognitive Radio Downlink

    In this paper, the authors investigate the outage performance of interference aided adaptive linear precoding in the downlink of a multiuser Multiple-Input-Single-Output (MISO) overlay Cognitive Radio (CR) network. While previous research studies on linear precoding techniques in CR network aim to limit or completely cancel the interference to the primary...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    MAP Decoding of Quantized Sources Over Soft-Decision Fading Channels With Memory

    The authors study a joint source-channel decoding scheme that exploits the channel's statistical memory and soft-decision information in fading channels. The channel considered is a recently introduced binary input 2q-ary output channel with Markovian ergodic noise based on a finite queue (called NBNDCQB). This model has been shown to effectively...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    Multiple Access Channel with Various Degrees of Asymmetric State Information

    The authors consider the problem of reliable communication over Multiple-Access Channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees of asymmetric (noisy or partial) Channel State Information (CSI). Namely, they provide a single...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2012

    Utilizing Transient Resources in Dynamic Wireless Sensor Networks

    In a technology where multiple networks are often deployed in concurrency, significant resource underutilization is witnessed in Wireless Sensor Networks (WSNs). As the manufacturing and deployment costs drop, multiple networks are introduced in overlapping vicinities to satisfy new functional requirements. Mostly with dedicated goals and deterministic operation schemes, practitioners seldom...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2012

    Robust Joint Signal and Interference Alignment for MIMO Cognitive Radio Network

    In this paper, a robust joint signal and interference alignment is designed for cognitive Multiple-Input Multiple-Output (MIMO) interference channel in which single primary link coexists with multiple secondary links. Considering channel imperfections and finite Signal-to-Noise Ratio (SNR) in practice, they propose a worst-case joint design to not only minimize the...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2012

    Power-Constrained Bandwidth-Reduction Source-Channel Mappings for Fading Channels

    The authors consider the transmission of a memoryless Gaussian source over a power-constrained Rayleigh fading channel with additive White Gaussian Noise. They propose the use of low-delay joint source-channel mappings and consider optimizing the non-parametric mappings through an iterative process. A design algorithm for joint source-channel mapping is proposed and...

    Provided By Queens Presbyterian Church

  • White Papers // Sep 2011

    On the Capacity of Memoryless Finite-State Multiple Access Channels with Asymmetric Noisy State Information at the Encoders

    Modeling communication channels with a state process fits well for many physical scenarios. For single-user channels, the characterization of the capacity with various degrees of Channel State Information at the Transmitter (CSIT) and at the Receiver (CSIR) is well understood. The authors consider the capacity of memoryless Finite-State Multiple Access...

    Provided By Queens Presbyterian Church

  • White Papers // Jun 2011

    Compressed Sensing with Shannon-Kotelnikov Mapping in the Presence of Noise

    The authors propose a low delay/complexity sensor system based on the combination of Shannon-Kotel'nikov mapping and Compressed Sensing (CS). The proposed system uses a 1:2 nonlinear analog coder on the CS measurements in the presence of channel noise. It is shown that the purely-analog system, used in conjunction with either...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2011

    Exploiting Memory and Soft-Decision Information in Channel Optimized Quantization for Correlated Fading Channels

    A Channel Optimized Vector Quantizer (COVQ) scheme is studied and evaluated for a recently introduced discrete binary-input 2q-ary-output channel with Markovian ergodic noise based on a finite queue. This channel can effectively model binary-modulated correlated Rayleigh fading channels with output quantization of resolution q. It is shown that the system...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2011

    Hybrid Digital-Analog Source-Channel Coding with One-to-Three Bandwidth Expansion

    The traditional approach for analog source transmission is to use separate source and channel coders. This separation is optimal given infinite delay and complexity in the coders. In practice, Joint Source-Channel Coding (JSCC) can achieve better performance when delay and complexity are constrained. The authors consider the problem of bandwidth...

    Provided By Queens Presbyterian Church

  • White Papers // Oct 2010

    Pairwise Optimization of Modulation Constellations for Non-Uniform Sources

    The design of two-dimensional signal constellations for the transmission of binary non-uniform memoryless sources over additive white Gaussian noise channels is investigated. The main application of this problem is the implementation of improved constellations where transmitted data is highly non-uniform. A simple algorithm, which optimizes a constellation by re-arranging its...

    Provided By Queens Presbyterian Church

  • White Papers // Apr 2010

    Synchronization in Cooperative Networks: Estimation of Multiple Carrier Frequency Offsets

    The distributed nature of cooperative networks may result in multiple Carrier Frequency Offsets (CFOs), which make the channel time-varying and overshadow the performance gains promised by collaborative communications. However, much of the analysis in the area of cooperative communications assumes perfect synchronization. This paper seeks to address frequency synchronization in...

    Provided By Queens Presbyterian Church

  • White Papers // Feb 2010

    Bounds on Timing Jitter Estimation in Cooperative Networks

    Successful collaboration and resource sharing in cooperative networks require accurate estimation of multiple timing jitters. When combined with signal processing algorithms the estimated timing jitters can be applied to mitigate the resulting Inter-Symbol Interference (ISI) and improve performance. In this paper, the authors seek to derive the Cramer-Rao Lower Bounds...

    Provided By Queens Presbyterian Church

  • White Papers // Oct 2009

    Parallel Singulation in RFID Systems

    Tag collisions can impose a major delay in Radio Frequency IDentification (RFID) systems. Such collisions are hard to overcome with passive tags due to their limited capabilities. In this paper, the authors look into the problem of minimizing the time required to read a set of passive tags. They propose...

    Provided By Queens Presbyterian Church

  • White Papers // Oct 2009

    Feedback Capacity of a Class of Symmetric Finite-State Markov Channels

    Although feedback does not increase the capacity of Discrete Memoryless Channels (DMCs), it generally increases the capacity of channels with memory and the feedback capacity for a wide class of channels still encapsulates many open problems. Among them, the authors herein study Finite-State Markov (FSM) channels. In this paper, they...

    Provided By Queens Presbyterian Church

  • White Papers // Apr 2009

    On Decoding Binary Perfect and Quasi-Perfect Codes Over Markov Noise Channels

    The authors study the decoding problem when a binary linear perfect or quasi-perfect code is transmitted over a binary channel with additive Markov noise. After examining the properties of the channel block transition distribution, they derive sufficient conditions under which strict maximum-likelihood decoding is equivalent to strict minimum Hamming distance...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2009

    On the Feedback Capacity of a Discrete Non-Binary Noise Channel with Memory

    The authors study the feedback capacity of a discrete binary-input non-binary output channel with memory recently introduced to model soft-decision demodulated time-correlated fading channels. The channel, whose output process can be explicitly expressed in terms of its binary input process and a non-binary noise process, encompasses modulo-additive noise binary channels...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2009

    Does Analog Transmission Achieve OPTA in an Asymmetric Gaussian Sensor Network ?

    The authors consider the estimation of a Gaussian source by a Gaussian sensor network where L distributed sensors transmit noisy observations of the source through a Gaussian multiple access channel to a fusion center. In a recent work, Gastpar showed that for a symmetric sensor network with no fading, analog...

    Provided By Queens Presbyterian Church

  • White Papers // Jul 2007

    A Business-Process-Driven Approach for Generating E-Commerce User Interfaces

    A business process contains a set of interdependent activities that describe operations provided by an organization. E-commerce applications are designed to automate business processes. A business process specification (i.e., a workflow) is defined by a business analyst from the viewpoint of the end-users. The process encapsulates the knowledge related to...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    A Consensus-Based Protocol for Spectrum Sharing Fairness in Cognitive Radio Ad Hoc & Sensor Networks

    Spectrum sharing is an important topic in Cognitive Radio Ad Hoc Networks (CRAHNs) and Cognitive Radio Sensor Networks (CRSNs). Bio-inspired consensus-based protocols can provide light-weight and efficient solutions for CRAHNs and CRSNs but the theoretical ground should be investigated for spectrum sharing fairness. In this paper, the authors investigate the...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    Towards a Wireless Sensor Network Platform for the Internet of Things

    This paper describes a WSN platform architecture uniquely designed and implemented for the Internet of Things (IoTs). The paper elaborates on all the architectural design decisions and challenges across the three major divisions of the platform, that is, the middleware, hardware, and network layer. The result of this research is...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    Secrecy Capacity Over Correlated Log-Normal Fading Channel

    This paper is concerned with the study of secrecy capacity for the log-normal fading channel in which the main channel is correlated with the eavesdropper channel. Perfect secrecy is achieved when the transmitter and legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    ITACA: Flexible, Scalable Network Analysis

    Real-time analysis is vital to network security and management. Solutions are required that are scalable to modern network speeds while remaining flexible to ensure the latest analysis techniques can be implemented. This paper presents the Internet Traffic And Content Analyzer (ITACA), an extendable general analysis tool that enables the implementation...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    Enhanced Outage Performance With Adaptive Linear Precoding in Cognitive Radio Downlink

    In this paper, the authors investigate the outage performance of interference aided adaptive linear precoding in the downlink of a multiuser Multiple-Input-Single-Output (MISO) overlay Cognitive Radio (CR) network. While previous research studies on linear precoding techniques in CR network aim to limit or completely cancel the interference to the primary...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    MAP Decoding of Quantized Sources Over Soft-Decision Fading Channels With Memory

    The authors study a joint source-channel decoding scheme that exploits the channel's statistical memory and soft-decision information in fading channels. The channel considered is a recently introduced binary input 2q-ary output channel with Markovian ergodic noise based on a finite queue (called NBNDCQB). This model has been shown to effectively...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2012

    Utilizing Transient Resources in Dynamic Wireless Sensor Networks

    In a technology where multiple networks are often deployed in concurrency, significant resource underutilization is witnessed in Wireless Sensor Networks (WSNs). As the manufacturing and deployment costs drop, multiple networks are introduced in overlapping vicinities to satisfy new functional requirements. Mostly with dedicated goals and deterministic operation schemes, practitioners seldom...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2012

    Robust Joint Signal and Interference Alignment for MIMO Cognitive Radio Network

    In this paper, a robust joint signal and interference alignment is designed for cognitive Multiple-Input Multiple-Output (MIMO) interference channel in which single primary link coexists with multiple secondary links. Considering channel imperfections and finite Signal-to-Noise Ratio (SNR) in practice, they propose a worst-case joint design to not only minimize the...

    Provided By Queens Presbyterian Church

  • White Papers // Nov 2012

    A Fairness-Based Preemption Algorithm for LTE-Advanced

    In this paper, the authors propose a fairness-based preemption algorithm for 3GPP LTE-Advanced. It considers bearers' priorities as well as their QoS over-provisioning with respect to their minimum QoS needs into the partial preemption decision. They define a preemption contribution metric for each established bearer and they evaluate the proposed...

    Provided By Queens Presbyterian Church

  • White Papers // Nov 2012

    Opportunistic Relaying With Time-Division Broadcast in Bidirectional Cooperative Networks

    The authors propose a reactive Opportunistic Relaying (OR) scheme for Time-Division BroadCast (R-TDBC) in a bidirectional cooperative network. In the proposed R-TDBC, a subset of relays that reliably decode both signals from the sources is determined reactively after two source-transmissions; then a single relay among the determined set is selected...

    Provided By Queens Presbyterian Church

  • White Papers // Oct 2009

    Parallel Singulation in RFID Systems

    Tag collisions can impose a major delay in Radio Frequency IDentification (RFID) systems. Such collisions are hard to overcome with passive tags due to their limited capabilities. In this paper, the authors look into the problem of minimizing the time required to read a set of passive tags. They propose...

    Provided By Queens Presbyterian Church

  • White Papers // Apr 2010

    Synchronization in Cooperative Networks: Estimation of Multiple Carrier Frequency Offsets

    The distributed nature of cooperative networks may result in multiple Carrier Frequency Offsets (CFOs), which make the channel time-varying and overshadow the performance gains promised by collaborative communications. However, much of the analysis in the area of cooperative communications assumes perfect synchronization. This paper seeks to address frequency synchronization in...

    Provided By Queens Presbyterian Church

  • White Papers // Feb 2010

    Bounds on Timing Jitter Estimation in Cooperative Networks

    Successful collaboration and resource sharing in cooperative networks require accurate estimation of multiple timing jitters. When combined with signal processing algorithms the estimated timing jitters can be applied to mitigate the resulting Inter-Symbol Interference (ISI) and improve performance. In this paper, the authors seek to derive the Cramer-Rao Lower Bounds...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2009

    Does Analog Transmission Achieve OPTA in an Asymmetric Gaussian Sensor Network ?

    The authors consider the estimation of a Gaussian source by a Gaussian sensor network where L distributed sensors transmit noisy observations of the source through a Gaussian multiple access channel to a fusion center. In a recent work, Gastpar showed that for a symmetric sensor network with no fading, analog...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2009

    On the Feedback Capacity of a Discrete Non-Binary Noise Channel with Memory

    The authors study the feedback capacity of a discrete binary-input non-binary output channel with memory recently introduced to model soft-decision demodulated time-correlated fading channels. The channel, whose output process can be explicitly expressed in terms of its binary input process and a non-binary noise process, encompasses modulo-additive noise binary channels...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2011

    Exploiting Memory and Soft-Decision Information in Channel Optimized Quantization for Correlated Fading Channels

    A Channel Optimized Vector Quantizer (COVQ) scheme is studied and evaluated for a recently introduced discrete binary-input 2q-ary-output channel with Markovian ergodic noise based on a finite queue. This channel can effectively model binary-modulated correlated Rayleigh fading channels with output quantization of resolution q. It is shown that the system...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2011

    Hybrid Digital-Analog Source-Channel Coding with One-to-Three Bandwidth Expansion

    The traditional approach for analog source transmission is to use separate source and channel coders. This separation is optimal given infinite delay and complexity in the coders. In practice, Joint Source-Channel Coding (JSCC) can achieve better performance when delay and complexity are constrained. The authors consider the problem of bandwidth...

    Provided By Queens Presbyterian Church

  • White Papers // Jun 2011

    Compressed Sensing with Shannon-Kotelnikov Mapping in the Presence of Noise

    The authors propose a low delay/complexity sensor system based on the combination of Shannon-Kotel'nikov mapping and Compressed Sensing (CS). The proposed system uses a 1:2 nonlinear analog coder on the CS measurements in the presence of channel noise. It is shown that the purely-analog system, used in conjunction with either...

    Provided By Queens Presbyterian Church

  • White Papers // May 2012

    Multiple Access Channel with Various Degrees of Asymmetric State Information

    The authors consider the problem of reliable communication over Multiple-Access Channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees of asymmetric (noisy or partial) Channel State Information (CSI). Namely, they provide a single...

    Provided By Queens Presbyterian Church

  • White Papers // Sep 2011

    On the Capacity of Memoryless Finite-State Multiple Access Channels with Asymmetric Noisy State Information at the Encoders

    Modeling communication channels with a state process fits well for many physical scenarios. For single-user channels, the characterization of the capacity with various degrees of Channel State Information at the Transmitter (CSIT) and at the Receiver (CSIR) is well understood. The authors consider the capacity of memoryless Finite-State Multiple Access...

    Provided By Queens Presbyterian Church

  • White Papers // Mar 2012

    Power-Constrained Bandwidth-Reduction Source-Channel Mappings for Fading Channels

    The authors consider the transmission of a memoryless Gaussian source over a power-constrained Rayleigh fading channel with additive White Gaussian Noise. They propose the use of low-delay joint source-channel mappings and consider optimizing the non-parametric mappings through an iterative process. A design algorithm for joint source-channel mapping is proposed and...

    Provided By Queens Presbyterian Church

  • White Papers // Oct 2009

    Feedback Capacity of a Class of Symmetric Finite-State Markov Channels

    Although feedback does not increase the capacity of Discrete Memoryless Channels (DMCs), it generally increases the capacity of channels with memory and the feedback capacity for a wide class of channels still encapsulates many open problems. Among them, the authors herein study Finite-State Markov (FSM) channels. In this paper, they...

    Provided By Queens Presbyterian Church

  • White Papers // Apr 2009

    On Decoding Binary Perfect and Quasi-Perfect Codes Over Markov Noise Channels

    The authors study the decoding problem when a binary linear perfect or quasi-perfect code is transmitted over a binary channel with additive Markov noise. After examining the properties of the channel block transition distribution, they derive sufficient conditions under which strict maximum-likelihood decoding is equivalent to strict minimum Hamming distance...

    Provided By Queens Presbyterian Church

  • White Papers // Oct 2010

    Pairwise Optimization of Modulation Constellations for Non-Uniform Sources

    The design of two-dimensional signal constellations for the transmission of binary non-uniform memoryless sources over additive white Gaussian noise channels is investigated. The main application of this problem is the implementation of improved constellations where transmitted data is highly non-uniform. A simple algorithm, which optimizes a constellation by re-arranging its...

    Provided By Queens Presbyterian Church

  • White Papers // Nov 2013

    Estimating Resource Costs of Executing Data-Intensive Workloads in Public Clouds

    The promise of \"Infinite\" resources given by the cloud computing paradigm has led to recent interest in exploiting clouds for large-scale data-intensive computing. In this paper, the authors present an analytical model to estimate the resource costs for executing data-intensive workloads in a public cloud. The cost model quantifies the...

    Provided By Queens Presbyterian Church

  • White Papers // Jul 2007

    A Business-Process-Driven Approach for Generating E-Commerce User Interfaces

    A business process contains a set of interdependent activities that describe operations provided by an organization. E-commerce applications are designed to automate business processes. A business process specification (i.e., a workflow) is defined by a business analyst from the viewpoint of the end-users. The process encapsulates the knowledge related to...

    Provided By Queens Presbyterian Church

  • White Papers // Jan 2014

    Maximizing the Lifetime of a Sensor Network Through Domatic Partition

    Distributing sensing and data gathering tasks to a dominating set is an attractive choice in wireless sensors networks since it helps prolong network lifetime by engaging such a subset of nodes for these tasks and letting other nodes go into energy-efficient sleep mode. Because they are busy all the time...

    Provided By Queens Presbyterian Church

  • White Papers // Jan 2014

    A Constant Factor Distributed Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks

    A wireless sensor network is composed of a set of battery-powered sensors which communicate with one another over wireless links directly if they are within their transmission ranges, otherwise they rely on other sensors to establish a connection between them. Connected Dominating Sets (CDSs) are probably the most common way...

    Provided By Queens Presbyterian Church

  • White Papers // Jan 2014

    A Distributed Constant Factor Self-Protection Algorithm for Wireless Sensor Networks

    Wireless sensor networks have drawn a lot of attention owing to their potential use in different surveillance applications including object monitoring, path protection, area coverage, and so on. Since sensors provide monitoring to other objects, it is often necessary to give them a level of protection such that sensors can...

    Provided By Queens Presbyterian Church