25,647 research outputs found
Path Selection for Quantum Repeater Networks
Quantum networks will support long-distance quantum key distribution (QKD)
and distributed quantum computation, and are an active area of both
experimental and theoretical research. Here, we present an analysis of
topologically complex networks of quantum repeaters composed of heterogeneous
links. Quantum networks have fundamental behavioral differences from classical
networks; the delicacy of quantum states makes a practical path selection
algorithm imperative, but classical notions of resource utilization are not
directly applicable, rendering known path selection mechanisms inadequate. To
adapt Dijkstra's algorithm for quantum repeater networks that generate
entangled Bell pairs, we quantify the key differences and define a link cost
metric, seconds per Bell pair of a particular fidelity, where a single Bell
pair is the resource consumed to perform one quantum teleportation. Simulations
that include both the physical interactions and the extensive classical
messaging confirm that Dijkstra's algorithm works well in a quantum context.
Simulating about three hundred heterogeneous paths, comparing our path cost and
the total work along the path gives a coefficient of determination of 0.88 or
better.Comment: 12 pages, 8 figure
Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems
In this paper, we consider a cognitive multi-hop relay secondary user (SU)
system sharing the spectrum with some primary users (PU). The transmit power as
well as the hop selection of the cognitive relays can be dynamically adapted
according to the local (and causal) knowledge of the instantaneous channel
state information (CSI) in the multi-hop SU system. We shall determine a low
complexity, decentralized algorithm to maximize the average end-to-end
throughput of the SU system with dynamic spatial reuse. The problem is
challenging due to the decentralized requirement as well as the causality
constraint on the knowledge of CSI. Furthermore, the problem belongs to the
class of stochastic Network Utility Maximization (NUM) problems which is quite
challenging. We exploit the time-scale difference between the PU activity and
the CSI fluctuations and decompose the problem into a master problem and
subproblems. We derive an asymptotically optimal low complexity solution using
divide-and-conquer and illustrate that significant performance gain can be
obtained through dynamic hop selection and power control. The worst case
complexity and memory requirement of the proposed algorithm is O(M^2) and
O(M^3) respectively, where is the number of SUs
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection
This paper develops upper bounds on the end-to-end transmission capacity of
multi-hop wireless networks. Potential source-destination paths are dynamically
selected from a pool of randomly located relays, from which a closed-form lower
bound on the outage probability is derived in terms of the expected number of
potential paths. This is in turn used to provide an upper bound on the number
of successful transmissions that can occur per unit area, which is known as the
transmission capacity. The upper bound results from assuming independence among
the potential paths, and can be viewed as the maximum diversity case. A useful
aspect of the upper bound is its simple form for an arbitrary-sized network,
which allows insights into how the number of hops and other network parameters
affect spatial throughput in the non-asymptotic regime. The outage probability
analysis is then extended to account for retransmissions with a maximum number
of allowed attempts. In contrast to prevailing wisdom, we show that
predetermined routing (such as nearest-neighbor) is suboptimal, since more hops
are not useful once the network is interference-limited. Our results also make
clear that randomness in the location of relay sets and dynamically varying
channel states is helpful in obtaining higher aggregate throughput, and that
dynamic route selection should be used to exploit path diversity.Comment: 14 pages, 5 figures, accepted to IEEE Transactions on Information
Theory, 201
MH-REACH-Mote: supporting multi-hop passive radio wake-up for wireless sensor network
A passive wake-up radio in a wireless sensor network (WSN) has the advantage of increasing network lifetime by using a wake-up radio receiver (WuRx) to eliminate unnecessary idle listening. A sensor node equipped with a WuRx can operate in an ultra-low-power sleep mode, waiting for a trigger signal sent by the wake-up radio transmitter (WuTx). The passive WuRx is entirely powered by the energy harvested from radio transmissions sent by the WuTx. Therefore, it has the advantage of not consuming any energy locally, which would drain the sensor node's battery. Even so, the high amount of energy required to wake up a passive WuRx by a WuTx makes it difficult to build a multi-hop passive wake-up sensor network. In this paper, we describe and discuss our implementation of a battery-powered sensor node with multi-hop wake-up capability using passive WuRxs, called MH-REACH-Mote (Multi-hop-Range EnhAnCing energy Harvester-Mote). The MH-REACH-Mote is kept in an ultra-low-power sleep mode until it receives a wake-up trigger signal. Upon receipt, it wakes up and transmits a new trigger signal to power other passive WuRxs. We evaluate the wake-up range and power consumption of an MH-REACH-Mote through a series of field tests. Results show that the MH-REACH-Mote enables multi-hop wake-up capabilities for passive WuRxs with a wake-up range of 9.4m while requiring a reasonable power consumption for WuTx functionality. We also simulate WSN data collection scenarios with MH-REACH-Motes and compare the results with those of active wake-up sensor nodes as well as a low power listening approach. The results show that the MH-REACH-Mote enables a longer overall lifetime than the other two approaches when data is collected infrequently.Peer ReviewedPostprint (author's final draft
- …