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.
In this paper, we consider the power allocation problem in a network coded multiuser two-way relaying network, where multiple pairs of users exchange information with the help of a relay node. An auction-based power allocation scheme is proposed to solve the power competition among multiple user pairs. To maximize the utility of the whole pair, each two users in the pair bid as a single player, with...
In this paper, we consider a two-way asymmetric relaying channel with unmatched traffics from two sources. Aiming at maximizing the sum rate under a minimum rate constraint, we address the optimization problem (in terms of time and power allocation) for two decode-and-forward (DF) strategies, namely, the decode-and-forward with joint modulation (DF-JM) and the decode-and-forward with network-superposition...
Due to higher peak-to-average power ratio and higher power backing-off in OFDM relaying systems, a cyclic prefixed single-carrier cooperative diversity system is considered in this paper. Under the transmission power constraint, the joint optimal power allocation to the source and relay node is investigated. For a two-hop decode-and-forward relaying protocol, the optimal power allocation is first...
We investigate physical-layer network coding for two-way relaying systems which employ multiple-input multiple-output (MIMO) techniques. For single-antenna cases, it has been previously verified that adaptive network coding, whose mapping rule is dependent on channel state information (CSI), can offer good performance for two-stage relaying protocols. In this paper, we evaluate gains achieved by adaptive...
This paper studies the performance limits of two-way relay channel (TWRC) at finite signal-to-noise ratio (SNR) in Rayleigh fading environment. A two-phase decode-and-forward (DF) protocol is considered. We first derive closed-form expressions for both outage probability and diversity-multiplexing tradeoff (DMT). Our results are general and suitable for any time sharing and any rate allocation in...
Fairness and system throughput, influenced by wireless interference, are major objectives of resource allocation in wireless networks. Whereas traditionally max-min fairness protocols have been developed for wired networks (where interference is not a factor for network performance), in this paper we investigate the problem of flow routing and fair bandwidth allocation under the constraints of the...
We study the problem of optimizing the symbol error probability (SEP) performance of cluster-based cooperative wireless sensor networks (WSNs). It is shown in the literature that an efficient relay selection protocol based on simple geographical information of the nodes to execute the cooperative diversity transmission, can significantly improve the SEP performance at the destination of such networks...
This paper considers a cooperative network in which binary frequency-shift-keying (BFSK) modulation is employed to facilitate noncoherent communications between a source and a destination with the help of K relays. Proposed is an adaptive cooperative scheme that employs two thresholds as follows. One threshold is used to select retransmitting relays: a relay retransmits to the destination if its decision...
In this paper, we address the incentive-based relay-selection problem over multi-source and multi-relay wireless networks. A two-side market game approach is employed to jointly consider the benefits of all sources and relays. The equilibrium concept in such games is called core. The outcomes in the core of the game cannot be improved upon by any subset of players. These outcomes correspond exactly...
In this paper, we consider a rural infostation system where power and bandwidth limited infostations are deployed in a large network area with sparsely populated mobile nodes. Direct transmission services are provided to each mobile node, whereas message dissemination services facilitated by relaying are provided to a subgroup of mobile nodes. We investigate radio resource allocation at infostations,...
We consider a multi-access two-way relay network where multiple pairs of users exchange information with their pre-assigned partners with the assistance of an intermediate relay node. Each pair is assumed to have a shared channel which is orthogonal to the channels used by the remaining pairs. We investigate the relay power allocation problem for two-way relaying protocols that allow a variety of...
In this paper, we address a sub-optimum distributed power allocation (SODPA) scheme for two-hop parallel relay networks, which includes a source-destination pair and multiple relay nodes. The system employs Decode-and-Forward (DF) as relaying protocol. In the proposed scheme, each relay is assumed to be able to decode the received signal if it satisfies the given SNR threshold and may make decision...
This paper focuses on subchannel and power allocation problem in OFDMA-based decode-and-forward (DF) cooperative relay networks. The objective of this problem is to maximize the total data rate under the constraints of joint total transmission power and subchannels occupation, while maintaining the maximum fairness among multiple relay nodes. We transform this mixed integer programming problem to...
We introduce a power allocation game in a four node relay network which consists of two source and two destination nodes. The sources employ a time sharing protocol such that in each discrete time instance one of the sources communicates with its destination while the other source aids this communication by acting as a relay. Each source uses some portion of its limited power for its own transmission...
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.