相关论文: Performance analysis of an opportunistic relay sel…
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters blindly broadcast without knowledge of the surrounding…
Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…
This letter studies distributed opportunistic channel access in a wireless network with decode-and-forward relays. All the sources use channel contention to get transmission opportunity. If a source wins the contention, the channel state…
In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…
We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source- destination pairs increases up to the operating maximum. Our opportunistic…
We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may…
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…
This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destination.…
It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission…
We propose a selection region based multi-hop routing protocol for random mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and a selection angle. At each hop, a relay is chosen as the…
In this paper, we investigate an opportunistic relaying scheme where the selected relay assists the source-destination (direct) communication. In our study, we consider a regenerative opportunistic relaying scheme in which the direct path…
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…
This paper investigates on the problem of combining routing scheme and physical layer security in multihop wireless networks with cooperative diversity. We propose an ad-hoc natured hop-by-hop best secure relay selection in a multihop…
In wireless communication networks, relays are required when the quality of the direct link between the source and the destination is not high enough to support reliable transmission because of long distances or obstacles. Selecting the…
In this paper, we study the problem of relaying a single bit of information across a series of binary symmetric channels, and the associated trade-off between the number of hops $m$, the transmission time $n$, and the error probability. We…
In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the…
In this paper, a cooperative protocol is investigated for a multi-hop network consisting of relays with buffers of finite size, which may operate in different communication modes. The protocol is based on the myopic decode-and-forward…
This paper introduces a protocol that distributively constructs a collision-free schedule for multi-hop packet radio networks in the presence of hidden terminals. As a preliminary step, each wireless station computes the schedule length…
Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks,…
This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this…