Channel reliability

About: Channel reliability is a research topic. Over the lifetime, 214 publications have been published within this topic receiving 3729 citations.

Discriminative Correlation Filter with Channel and Spatial Reliability

Abstract: Short-term tracking is an open and challenging problem for which discriminative correlation filters (DCF) have shown excellent performance. We introduce the channel and spatial reliability concepts to DCF tracking and provide a novel learning algorithm for its efficient and seamless integration in the filter update and the tracking process. The spatial reliability map adjusts the filter support to the part of the object suitable for tracking. This allows tracking of non-rectangular objects as well as extending the search region. Channel reliability reflects the quality of the learned filter and it is used as a feature weighting coefficient in localization. Experimentally, with only two simple standard features, HOGs and Colornames, the novel CSR-DCF method – DCF with Channel and Spatial Reliability – achieves state-of-the-art results on VOT 2016, VOT 2015 and OTB. The CSR-DCF runs in real-time on a CPU.

Time division protocol for an ad-hoc, peer-to-peer radio network having coordinating channel access to shared parallel data channels with separate reservation channel

Abstract: A novel protocol for an ad-hoc, peer-to-peer radio network that provides collision-free channel access with an emphasis on improving geographic reuse of the frequency spectrum. The protocol of the invention is executed on the reservation or control channel, and provides a method for allocating data transactions on the data channels. The system of the invention utilizes multiple parallel data channels that are coordinated by a single reservation channel. The transceiver of the system employs two modems to solve the channel reliability issues with multiple channel designs, where one is dedicated as a receive-only modem for gathering channel usage information on the reservation channel. High quality voice, video and data may be transmitted. The reservation channel implements a time division multiple access algorithm with dynamic slot allocation. In a distributed manner, nodes determine geographic reuse of slots based on channel quality extracted from the modem. Signal quality calculations are used to determine the likelihood of a slot reuse causing destructive interference within a node's neighborhood. Requests for slot usage are compared with the known traffic pattern and accepted or rejected by nodes within RF signal range based on the signal quality calculations.

A Theory of QoS for Wireless

Abstract: Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control, which consists of determining whether it is possible to fulfill the demands of a set of clients. The other is finding an optimal scheduling policy to meet the demands of all clients. In this paper, we propose a framework for jointly addressing three QoS criteria: delay, delivery ratio, and channel reliability. We analytically prove the necessary and sufficient condition for a set of clients to be feasible with respect to the above three criteria. We then establish an efficient algorithm for admission control to decide whether a set of clients is feasible. We further propose two scheduling policies and prove that they are feasibility optimal in the sense that they can meet the demands of every feasible set of clients. In addition, we show that these policies are easily implementable on the IEEE 802.11 mechanisms. We also present the results of simulation studies that appear to confirm the theoretical studies and suggest that the proposed policies outperform others tested under a variety of settings.

Discriminative Correlation Filter Tracker with Channel and Spatial Reliability

Abstract: Short-term tracking is an open and challenging problem for which discriminative correlation filters (DCF) have shown excellent performance. We introduce the channel and spatial reliability concepts to DCF tracking and provide a learning algorithm for its efficient and seamless integration in the filter update and the tracking process. The spatial reliability map adjusts the filter support to the part of the object suitable for tracking. This both allows to enlarge the search region and improves tracking of non-rectangular objects. Reliability scores reflect channel-wise quality of the learned filters and are used as feature weighting coefficients in localization. Experimentally, with only two simple standard feature sets, HoGs and colornames, the novel CSR-DCF method--DCF with channel and spatial reliability--achieves state-of-the-art results on VOT 2016, VOT 2015 and OTB100. The CSR-DCF runs close to real-time on a CPU.

Optimal backpressure routing for wireless networks with multi-receiver diversity

Abstract: We consider the problem of optimal scheduling and routing in an ad-hoc wireless network with multiple traffic streams and time varying channel reliability. Each packet transmission can be overheard by a subset of receiver nodes, with a transmission success probability that may vary from receiver to receiver and may also vary with time. We develop a simple backpressure routing algorithm that maximizes network throughput and expends an average power that can be pushed arbitrarily close to the minimum average power required for network stability, with a corresponding tradeoff in network delay. When channels are orthogonal, the algorithm can be implemented in a distributed manner using only local link error probability information, and supports a ''blind transmission'' mode (where error probabilities are not required) in special cases when the power metric is neglected and when there is only a single destination for all traffic streams. For networks with general inter-channel interference, we present a distributed algorithm with constant-factor optimality guarantees.