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 study the resource allocation for an orthogonal frequency division multiple access (OFDMA) radio system employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. The resource allocation design objective is the maximization of the weighted system throughput while limiting the information leakage to guarantee secure simultaneous...
In this paper, we investigate optimal resource allocation for multicarrier (MC) multiple-input single-output non-orthogonal multiple access (MISO-NOMA) downlink systems. The resource allocation design for the maximization of the weighted system throughput is formulated as a non-convex optimization problem taking into account the quality-of-service requirements of the downlink receivers. We employ...
In this paper, we investigate resource allocation for multicarrier communication systems employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. We study the joint power and subcarrier allocation design for the maximization of the weighted sum throughput of the system. The algorithm design is formulated as a mixed combinatorial non-convex optimization...
In this paper, we investigate resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems employing a full-duplex (FD) base station for serving multiple half-duplex (HD) downlink and uplink users simultaneously. The proposed algorithm is obtained from the solution of a non-convex optimization problem for the maximization of the weighted sum system throughput...
In this paper, we investigate the resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The proposed algorithm is obtained from the solution of a non-convex optimization problem for the maximization of the weighted system throughput. We employ monotonic optimization to develop the optimal joint power and subcarrier allocation policy. The optimal resource...
This paper proposes an adaptive packet aggregation scheme with QoS awareness in CR (Cognitive Radio) enabled Mobile Ad Hoc Networks (CRMANET). Instead of directly introducing the aggregation scheme from the 802.11n standard into CRMANET, the proposed adaptive scheme inherits the design advantages from the work given in [1] in regard to packet scheduling to further utilize each sub-channel before every...
This paper proposes a cross layer routing protocol which operates with Cognitive Radio (CR) Ad Hoc Networks. The new routing protocol exploits the passage of CR performance information from the Physical/MAC layers up to Network layer as contributing factors within the route selection algorithms. The performance of the proposed protocol is investigated via simulations and the results confirm its favorable...
This paper proposes an improved QoS scheduling scheme, called the Modified Proportional Fairness with Multi-Hop (MPF-MH) algorithm for Cognitive Radio Mobile Ad Hoc Networks (CR MANET). Within the context of multi-channel MAC enabled networks, mobile nodes can experience simultaneous transmission across multiple channels. Benefiting from the proposed cross layer design, the real-time channel conditions...
In this paper, we present a fast cyclic redundancy check (CRC) algorithm that performs CRC computation for any length of message in parallel. For a given message with any length, the algorithm first chunks the message into blocks, each of which has a fixed size equal to the degree of the generator polynomial. Then it performs CRC computation using only lookup tables among the chunked blocks in parallel...
We present a fast cyclic redundancy check (CRC) algorithm that performs CRC computation for any length of message in parallel. Traditional CRC implementations have feedbacks, which make pipelining problematic. In the proposed approach, we eliminate feedbacks and implement a pipelined calculation of 32-bit CRC in the SMIC 0.13 ??m CMOS technology. For a given message, the algorithm first chunks the...
Ternary Content Addressable Memories (CAMs) are widely used in high-speed routers. They allow a longest-prefix matching operation to complete within a single clock cycle. However, TCAMs are costly and their power consumption is very high. In this paper, we identify two kinds of redundancy in the usage of TCAMs in IP route lookup, and propose a hybrid scheme which combines Binary CAMs and Ternary CAMs...
The multiple backhaul mobile access router (MAR) can provide high capacity and high performance Internet access for emerging mobile wireless applications. In this paper we improve the MAR with the capability to stripe traffic from clients over multiple available network devices. The MAR allows different backhauls to be used simultaneously and accommodates diverse policies. We present experimental...
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.