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.
This paper is concerned with the problem of relay assignment in cooperative wireless networks having multiple sources, multiple relays, and a single destination. With the objective of maximizing the minimum capacity among all sources in the network, a mixed-integer linear programming (MILP) problem is formulated, which can be solved by standard branch-and-bound algorithms. To reduce computational...
This paper studies multiple relay selection schemes in two-hop cognitive relay networks to maximize the signal-to-noise ratio (SNR) of the secondary receiver. We first formulate the relay selection as a nonlinear integral programming, and then propose two suboptimal methods, greedy scheme and hybrid scheme. Based on the sorted efficiency function, the greedy scheme selects the secondary relay nodes...
In this paper, we present a low-complexity Interference Aware Multiple Relay Selection (IAMRS) scheme for cognitive radio system. The main objective in selecting multiple relays is to maximize the SNR at the destination under the constraint of acceptable interference to the primary users (PU). The computational complexity of finding an optimal IAMRS by exhaustive search grows exponentially with the...
In this paper, we investigate efficient scheduling algorithms in OFDMA multihop relaying networks. The scheduling scheme is modeled as a multiple objective programming problem to maximize the overall capacity and the number of satisfied users under the minimum rate constraint per user. An improved priority (IPRI) algorithm is exploited with novel opportunistic function, which relies on capacity gain,...
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.