1,131 research outputs found
A Simple Cooperative Diversity Method Based on Network Path Selection
Cooperative diversity has been recently proposed as a way to form virtual
antenna arrays that provide dramatic gains in slow fading wireless
environments. However most of the proposed solutions require distributed
space-time coding algorithms, the careful design of which is left for future
investigation if there is more than one cooperative relay. We propose a novel
scheme, that alleviates these problems and provides diversity gains on the
order of the number of relays in the network. Our scheme first selects the best
relay from a set of M available relays and then uses this best relay for
cooperation between the source and the destination. We develop and analyze a
distributed method to select the best relay that requires no topology
information and is based on local measurements of the instantaneous channel
conditions. This method also requires no explicit communication among the
relays. The success (or failure) to select the best available path depends on
the statistics of the wireless channel, and a methodology to evaluate
performance for any kind of wireless channel statistics, is provided.
Information theoretic analysis of outage probability shows that our scheme
achieves the same diversity-multiplexing tradeoff as achieved by more complex
protocols, where coordination and distributed space-time coding for M nodes is
required, such as those proposed in [7]. The simplicity of the technique,
allows for immediate implementation in existing radio hardware and its adoption
could provide for improved flexibility, reliability and efficiency in future 4G
wireless systems.Comment: To appear, IEEE JSAC, special issue on 4
Cooperative Cognitive Relaying Under Primary and Secondary Quality of Service Satisfaction
This paper proposes a new cooperative protocol which involves cooperation
between primary and secondary users. We consider a cognitive setting with one
primary user and multiple secondary users. The time resource is partitioned
into discrete time slots. Each time slot, a secondary user is scheduled for
transmission according to time division multiple access, and the remainder of
the secondary users, which we refer to as secondary relays, attempt to decode
the primary packet. Afterwards, the secondary relays employ cooperative
beamforming to forward the primary packet and to provide protection to the
secondary destination of the secondary source scheduled for transmission from
interference. We characterize the diversity-multiplexing tradeoff of the
primary source under the proposed protocol. We consider certain quality of
service for each user specified by its required throughput. The optimization
problem is stated under such condition. It is shown that the optimization
problem is linear and can be readily solved. We show that the sum of the
secondary required throughputs must be less than or equal to the probability of
correct packets reception.Comment: This paper was accepted in PIMRC 201
Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks
Distributed opportunistic scheduling (DOS) protocols are proposed for
multiple-input multiple-output (MIMO) ad-hoc networks with contention-based
medium access. The proposed scheduling protocols distinguish themselves from
other existing works by their explicit design for system throughput improvement
through exploiting spatial multiplexing and diversity in a {\em distributed}
manner. As a result, multiple links can be scheduled to simultaneously transmit
over the spatial channels formed by transmit/receiver antennas. Taking into
account the tradeoff between feedback requirements and system throughput, we
propose and compare protocols with different levels of feedback information.
Furthermore, in contrast to the conventional random access protocols that
ignore the physical channel conditions of contending links, the proposed
protocols implement a pure threshold policy derived from optimal stopping
theory, i.e. only links with threshold-exceeding channel conditions are allowed
for data transmission. Simulation results confirm that the proposed protocols
can achieve impressive throughput performance by exploiting spatial
multiplexing and diversity.Comment: Proceedings of the 2008 IEEE International Conference on
Communications, Beijing, May 19-23, 200
Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks
A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-mfading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics
Optimal Cooperative MAC Protocol with Efficient Selection of Relay Terminals
A new cooperative protocol is proposed in the context of wireless mesh networks. The protocol implements ondemand
cooperation, i.e. cooperation between a source terminal
and a destination terminal is activated only when needed. In that case, only the best relay among a set of available terminals is re-transmitting the source message to the destination terminal. This typical approach is improved using three additional features. First, a splitting algorithm is implemented to select the best relay. This ensures a fast selection process. Moreover, the duration of the selection process is now completely characterized.
Second, only terminals that improve the outage probability of the direct link are allowed to participate to the relay selection. By this means, inefficient cooperation is now avoided. Finally, the destination terminal discards the source message when it fails to decode it. This saves processing time since the destination terminal does not need to combine the replicas of the source message: the one from the source terminal and the one from the best relay. We prove that the proposed protocol achieves an optimal performance in terms of Diversity-Multiplexing Tradeoff
(DMT)
DMT Optimal Cooperative Protocols with Destination-Based Selection of the Best Relay
We design a cooperative protocol in the context of wireless mesh networks in order to increase the reliability of wireless links. Destination terminals ask for cooperation when they fail in decoding data frames transmitted by source terminals. In that case, each destination terminal D calls a specific relay terminal B with a signaling frame to help its transmission with source terminal S. To select appropriate relays, destination terminals maintain tables of relay terminals, one for each possible source address. These tables are constituted by passively overhearing ongoing transmissions. Hence, when cooperation is needed between S and D, and when a relay B is found by terminal D in the relay table associated with terminal S, the destination terminal sends a negative acknowledgment frame that contains the address of B. When the best relay B has successfully decoded the source message, it sends a copy of the data frame to D using a selective decode-andforward transmission scheme. The on-demand approach allows maximization of the spatial multiplexing gain and the cooperation of the best relay allows maximization of the spatial diversity order. Hence, the proposed protocol achieves optimal diversitymultiplexing trade-off performance. Moreover, this performance is achieved through a collision-free selection process
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
In cognitive radio (CR) networks, there are scenarios where the secondary
(lower priority) users intend to communicate with each other by
opportunistically utilizing the transmit spectrum originally allocated to the
existing primary (higher priority) users. For such a scenario, a secondary user
usually has to trade off between two conflicting goals at the same time: one is
to maximize its own transmit throughput; and the other is to minimize the
amount of interference it produces at each primary receiver. In this paper, we
study this fundamental tradeoff from an information-theoretic perspective by
characterizing the secondary user's channel capacity under both its own
transmit-power constraint as well as a set of interference-power constraints
each imposed at one of the primary receivers. In particular, this paper
exploits multi-antennas at the secondary transmitter to effectively balance
between spatial multiplexing for the secondary transmission and interference
avoidance at the primary receivers. Convex optimization techniques are used to
design algorithms for the optimal secondary transmit spatial spectrum that
achieves the capacity of the secondary transmission. Suboptimal solutions for
ease of implementation are also presented and their performances are compared
with the optimal solution. Furthermore, algorithms developed for the
single-channel transmission are also extended to the case of multi-channel
transmission whereby the secondary user is able to achieve opportunistic
spectrum sharing via transmit adaptations not only in space, but in time and
frequency domains as well.Comment: Extension of IEEE PIMRC 2007. 35 pages, 6 figures. Submitted to IEEE
Journal of Special Topics in Signal Processing, special issue on Signal
Processing and Networking for Dynamic Spectrum Acces
DMT Optimal On-Demand Relaying for Mesh Networks
This paper presents a new cooperative MAC (Medium Access Control) protocol called BRIAF (Best Relay based Incremental Amplify-and-Forward). The proposed protocol presents two features: on-demand relaying and selection of the best relay terminal. âOn-demand relayingâ means that a cooperative transmission is implemented between a source terminal and a destination terminal only when the destination terminal fails in decoding the data transmitted by the source terminal. This feature maximizes the spatial multiplexing gain r of the transmission. âSelection of the best relay terminalâ means that a selection of the best relay among a set of (m-1) relay candidates is implemented when a cooperative transmission is needed. This feature maximizes the diversity order d(r) of the transmission. Hence, an optimal DMT (Diversity Multiplexing Tradeoff) curve is achieved with a diversity order d(r) = m(1-r) for 0 †r †1
- âŠ