Related papers: Reliability Bounds for Delay-Constrained Multi-hop…
Real-time applications require latencies on the order of a millisecond with very high reliabilities, paralleling the requirements for high-performance industrial control. Current wireless technologies like WiFi, Bluetooth, LTE, etc. are…
The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver…
Multiclass FIFO is used in communication networks such as in input-queueing routers/switches and in wireless networks. For the concern of providing service guarantees in such networks, it is crucial to have analytical results, e.g. bounds,…
The paper studies distributed binary hypothesis testing over a two-hop relay network where both the relay and the receiver decide on the hypothesis. Both communication links are subject to expected rate constraints, which differs from the…
In overlay networks, both local and long-distance links appear as a single hop to a routing protocol. Traditional routing metrics (based on hop count or packet loss) fail to take the differences between such links into account. In this…
We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…
As a representative of a complex technological system, so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a…
We study error exponents for the problem of relaying a message over a tandem of two channels sharing the same transition law, in particular moving beyond the 1-bit setting studied in recent related works. Our main results show that the…
This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite…
We study a multihop "virtual" full-duplex relay channel as a special case of a general multiple multicast relay network. For such channel, quantize-map-and-forward (QMF) (or noisy network coding (NNC)) achieves the cut-set upper bound…
This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop…
Optimal queueing control of multi-hop networks remains a challenging problem even in the simplest scenarios. In this paper, we consider a two-hop half-duplex relaying system with random channel connectivity. The relay is equipped with a…
Existing models of Multi-Hop Wireless Networks (MHWNs) assume that interference estimators of link quality such as observed busy time predict the capacity of the links. We show that these estimators do not capture the intricate interactions…
Cooperative utilization of Unmanned Aerial Vehicles (UAVs) in public and military surveillance applications has attracted significant attention in recent years. Most UAVs are equipped with sensors that have bounded coverage and wireless…
Bounds on the reliability function for the discrete memoryless relay channel are derived using the method of types. Two achievable error exponents are derived based on partial decode-forward and compress-forward which are well-known…
In this letter, we present an end-to-end performance analysis of dual-hop project-and-forward relaying in a realistic scenario, where the source-relay and the relay-destination links are experiencing MIMO-pinhole and Rayleigh channel…
This paper develops a framework to study multi-hop relaying in a vehicular network consisting of vehicles and Road Side Units (RSUs), and the effect of this relaying on the network coverage and the communication delay. We use a stochastic…
To account for the randomness of propagation channels and interference levels in hierarchical spectrum sharing, a novel approach to multihop routing is introduced for cognitive random access networks, whereby packets are randomly routed…
We consider a single-source, multiple-relay, single-destination lossy network employing Random Linear Network coding at all transmitting nodes. We address the problem of calculating the probability of successful decoding at the destination…
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails…