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 investigate the optimal power and time allocation for a wireless relay network, called BCFR (Broadcasting Channel with Fixed Relay), where the relay node is limited by the half-duplex operation. Introducing a relay in two-node broadcasting channel for a node which has a link of bad quality or requires higher transmission rate enlarges the rate region with well-designed power and...
Distributed and efficient relay selection and resource allocation are critical for large scale cooperative communication networks. To stimulate a potential relay station to cooperate with the source, a bargaining based relay selection and power allocation (BBRSPA) scheme is proposed. In this paper, Rubinstein-Stahl bargaining game is introduced to provide a possible solution to share the increased...
In this paper, we study the scheduling of periodic messages in the static segment of the FlexRay protocol. Our approach is based on two performance metrics. Similar to previous work, we seek to allocate a minimum number of frame IDs (FIDs) in the static segment. In addition, different from existing work, we want to minimize the message jitter, i.e., the deviation of the message transmission from the...
In this paper, we consider a four-node relay-based OFDMA system. The expression of the upper bound for the achievable rate in Successive Relaying (SUR) protocol is derived by using the cut-set theorem for half-duplex systems. Based on this expression, the near-optimal solution of the achievable rate is obtained in the joint power and subcarrier allocation constraint, according to the dual problem...
Incremental selection amplify-and-forward relaying (ISAF) has the best performance of outage probability among relaying strategies and has been identified as the best protocol. This paper proposes to jointly optimize power allocation (PA) and best-relay position based on cooperative diversity for ISAF in order to minimize outage probability. The closed-form solution to the adaptive allocation algorithm...
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.