The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The social behavior in cognitive radio networks is studied using analysis tools in social networks. A recommendation system is proposed for cognitive radio, thus incurring the channel preference propagation in the corresponding random geometric network. A mean field based ordinary differential equation is used to describe the dynamics of the channel preference propagation in cognitive radio networks...
In this paper, we propose a novel MIMO transmission scheme, called trellis coded spatial modulation (TC-SM) in which the trellis (convolutional) encoder and the spatial modulation (SM) mapper are jointly designed similar to the conventional trellis coded modulation (TCM). A soft decision Viterbi decoder, which is fed with the soft information supplied by the optimal SM decoder, is used at the receiver...
Recently, there has been growing interest in secure communication via multi-antenna physical-layer designs. In this paper, we consider a transmit covariance design for a secrecy rate maximization problem under a multicast scenario, where a multi-antenna transmitter delivers a common confidential message to multiple single-antenna receivers in the presence of multiple multi-antenna eavesdroppers. This...
The probability of instantaneous accepted packet error outage (IAPEO) is proposed as a performance measure for packet transmission with automatic-repeat-request (ARQ) schemes over wireless channels. It is defined as the probability that the instantaneous accepted packet error probability (IAPEP) exceeds an IAPEP threshold. We obtain a closed-form upper bound expression for IAPEO of a pure ARQ over...
In contrast to the outage analysis, the packet error rates (PERs) of two types of cooperative automatic retransmission request (ARQ) protocols with opportunistic selective amplified-and-forward (OSAF) relaying are investigated from the perspective of the maximum likelihood sequence detection (MLSD). The results show that PERs with the threshold requirements derived from the outage analysis cannot...
This paper proposes a location-based MAC (LMAC) scheme for wireless networks with randomly placed nodes. This scheme regulates channel access by sharing local location information among transmitters. A lattice approximation approach is used to derive upper and lower bound for the success probability for a typical transmission attempt. Numerical results show that with the node density and link distance...
Multi-Packet Reception (MPR) enables simultaneous receptions from different transmitters to a single receiver, which has been demonstrated to bring capacity improvement in wireless network. However, MPR does not improve the transmission capability of intermediate relay nodes in a multi-hop routing and thus these nodes may become the bottlenecks for increasing throughput despite of great reception...
During the last decade of P2P research a lot of attention has been given to incentive mechanisms. While centralized incentive mechanisms are straightforward in their design, a long term challenge has been to create a decentralized incentive mechanism that can be used to effectively induce cooperation and reduce freeriding. While there have been many proposals of such mechanisms based on the spreading...
A significant amount of the analysis of protograph-based low-density parity-check (LDPC) codes has been devoted to the subclass of quasi-cyclic (QC) LDPC codes. Despite their implementation advantages and algebraic properties that make them easy to analyze, protograph-based QC-LDPC codes have undesirable fixed upper limits on important code parameters. This implies that picking a QC code from an asymptotically...
The average symbol error rate (ASER) for the single-input multiple-output (SIMO) cyclically prefixed single-carrier (CP-SC) system with best terminal selection (BTS) is considered. Using derived closed-form expressions for the ASER and an upper bound on it, an asymptotic diversity gain is derived. Based on this result, it is shown that a QR decomposition (QRD)-based receiver and BTS are both needed...
Recently, the OFDM-based Spectrum-sliced Elastic Optical Path (SLICE) network attracts significant interests due to its elastic band-width allocation. The OFDM technology, on one hand, enables both sub-wavelength and super-wavelength traffic accommodation by allocating appropriate number of sub-carriers. On the other hand, it can provide high signal quality by overcoming various impairments. In SLICE...
Motivated by the noncoherent subspace coding approach and the low-complexity sparse coding approach to realize random linear network coding, we consider the problem of characterizing the probability of having a full rank (or nonsingular) square transfer matrix over a finite field, for which the probability of choosing the zero element is different from that of choosing a nonzero element. We found...
Base station cooperation requires knowledge of the users' channel state information (CSI) at the transmitter side to manage co-channel interference. Users in a multicell cooperative system have to feedback the CSI of desired and interfering channels using finite-bandwidth links. Hence, the available feedback resources need to be partitioned efficiently between the multiple channels. In this paper,...
We study the spectrum access problem in cognitive networks consisting of several frequency channels, each characterized by a channel availability probability due to the activity of the licensed primary users. The key challenge for the unlicensed secondary users to opportunistically access the unused spectrum of the primary users is to learn the channel availabilities and coordinate with others in...
Ad hoc networks rely on the mutual cooperation among individual nodes to achieve network-wide objectives. However, individual nodes may behave selfishly in order to maximize their own benefits without considering the global benefits of the network. One approach to incentivize nodes cooperation for better global benefits is to establish trust relations among nodes to guide their decision making. In...
In this paper, we consider the BER analysis of the constellation rearrangement (CoRe), which is not subject to the Gray-encoding constraint for the first transmission. This type of CoRe can be applied in a parallel transmission system such as cooperative relaying networks. Furthermore, it allow us to construct the accumulate constellation, which obtained by separating and rearranging the received...
We consider a phase based maximum likelihood (ML) approach for identifying the modulation format of a linearly modulated signal. Since the optimal ML scheme is computationally intensive, we propose two approximate ML alternatives derived from Gauss quadrature rules. The proposed approximate ML schemes can offer virtually optimal performance with reduced complexity. We then present a general performance...
In this paper, two particular instances of LT codes with short message blocklength and maximum likelihood (ML) decoding are investigated, i.e., random linear fountain (RLF) codes and (nearly) check-concentrated LT codes. Both show an almost equally good performance. The focus of this paper will be on RLF codes, a type of LT codes whose generator matrices are constructed from independent Bernoulli...
In this paper, we discuss the opportunistic multicast scheduling (OMS) in a wireless network using erasure codes. Originally proposed for channels with erasures such as internet, erasure codes are found useful in wireless multicast to achieve better tradeoff between multiuser diversity and the multicast gain. In this work we investigated how to design an opportunistic multicast scheduling scheme which...
For single-user MIMO channels with partial receiver CSI, we study the difference between inner and outer bounds of the mutual information achieved with Gaussian codebooks, as well as a related difference between capacity inner and outer bounds. In contrast to previous studies, we assume that the channel estimation error statistics are not given a priori, but depend on the parameters of a training...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.