2,721 research outputs found
Cooperative medium access control based on spectrum leasing
Based on cooperative spectrum leasing, a distributed “win–win” (WW) cooperative framework is designed to encourage the licensed source node (SN) to lease some part of its spectral resources to the unlicensed relay node (RN) for the sake of simultaneously improving the SN’s achievable rate and for reducing the energy consumption (EC). The potential candidate RNs carry out autonomous decisions concerning whether to contend for a cooperative transmission opportunity, which could dissipate some of their battery power, while conveying their traffic in light of their individual service requirements. Furthermore, a WW cooperative medium-access-control (MAC) protocol is designed to implement the proposed distributed WW cooperative framework. Simulation results demonstrate that our WW cooperative MAC protocol is capable of providing both substantial rate improvements and considerable energy savings for the cooperative spectrum leasing system
Partner selection in indoor-to-outdoor cooperative networks: an experimental study
In this paper, we develop a partner selection protocol for enhancing the
network lifetime in cooperative wireless networks. The case-study is the
cooperative relayed transmission from fixed indoor nodes to a common outdoor
access point. A stochastic bivariate model for the spatial distribution of the
fading parameters that govern the link performance, namely the Rician K-factor
and the path-loss, is proposed and validated by means of real channel
measurements. The partner selection protocol is based on the real-time
estimation of a function of these fading parameters, i.e., the coding gain. To
reduce the complexity of the link quality assessment, a Bayesian approach is
proposed that uses the site-specific bivariate model as a-priori information
for the coding gain estimation. This link quality estimator allows network
lifetime gains almost as if all K-factor values were known. Furthermore, it
suits IEEE 802.15.4 compliant networks as it efficiently exploits the
information acquired from the receiver signal strength indicator. Extensive
numerical results highlight the trade-off between complexity, robustness to
model mismatches and network lifetime performance. We show for instance that
infrequent updates of the site-specific model through K-factor estimation over
a subset of links are sufficient to at least double the network lifetime with
respect to existing algorithms based on path loss information only.Comment: This work has been submitted to IEEE Journal on Selected Areas in
Communications in August 201
Beacon-Assisted Spectrum Access with Cooperative Cognitive Transmitter and Receiver
Spectrum access is an important function of cognitive radios for detecting
and utilizing spectrum holes without interfering with the legacy systems. In
this paper we propose novel cooperative communication models and show how
deploying such cooperations between a pair of secondary transmitter and
receiver assists them in identifying spectrum opportunities more reliably.
These cooperations are facilitated by dynamically and opportunistically
assigning one of the secondary users as a relay to assist the other one which
results in more efficient spectrum hole detection. Also, we investigate the
impact of erroneous detection of spectrum holes and thereof missing
communication opportunities on the capacity of the secondary channel. The
capacity of the secondary users with interference-avoiding spectrum access is
affected by 1) how effectively the availability of vacant spectrum is sensed by
the secondary transmitter-receiver pair, and 2) how correlated are the
perceptions of the secondary transmitter-receiver pair about network spectral
activity. We show that both factors are improved by using the proposed
cooperative protocols. One of the proposed protocols requires explicit
information exchange in the network. Such information exchange in practice is
prone to wireless channel errors (i.e., is imperfect) and costs bandwidth loss.
We analyze the effects of such imperfect information exchange on the capacity
as well as the effect of bandwidth cost on the achievable throughput. The
protocols are also extended to multiuser secondary networks.Comment: 36 pages, 6 figures, To appear in IEEE Transaction on Mobile
Computin
Transmission Capacity of Full-Duplex MIMO Ad-Hoc Network with Limited Self-Interference Cancellation
In this paper, we propose a joint transceiver beamforming design to
simultaneously mitigate self-interference (SI) and partial inter-node
interference for full-duplex multiple-input and multiple-output ad-hoc network,
and then derive the transmission capacity upper bound (TC-UB) for the
corresponding network. Condition on a specified transceiver antenna's
configuration, we allow the SI effect to be cancelled at transmitter side, and
offer an additional degree-of-freedom at receiver side for more inter-node
interference cancellation. In addition, due to the proposed beamforming design
and imperfect SI channel estimation, the conventional method to obtain the
TC-UB is not applicable. This motivates us to exploit the dominating interferer
region plus Newton-Raphson method to iteratively formulate the TC-UB. The
results show that the derived TC-UB is quite close to the actual one especially
when the number of receive-antenna is small. Moreover, our proposed beamforming
design outperforms the existing beamforming strategies, and FD mode works
better than HD mode in low signal-to-noise ratio region.Comment: 7 pages, 4 figures, accepted by Globecom 201
Multi-Antenna Assisted Virtual Full-Duplex Relaying with Reliability-Aware Iterative Decoding
In this paper, a multi-antenna assisted virtual full-duplex (FD) relaying
with reliability-aware iterative decoding at destination node is proposed to
improve system spectral efficiency and reliability. This scheme enables two
half-duplex relay nodes, mimicked as FD relaying, to alternatively serve as
transmitter and receiver to relay their decoded data signals regardless the
decoding errors, meanwhile, cancel the inter-relay interference with
QR-decomposition. Then, by deploying the reliability-aware iterative
detection/decoding process, destination node can efficiently mitigate
inter-frame interference and error propagation effect at the same time.
Simulation results show that, without extra cost of time delay and signalling
overhead, our proposed scheme outperforms the conventional selective
decode-and-forward (S-DF) relaying schemes, such as cyclic redundancy check
based S-DF relaying and threshold based S-DF relaying, by up to 8 dB in terms
of bit-error-rate.Comment: 6 pages, 4 figures, conference paper has been submitte
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
- …