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 studies the problem of task distribution and proactive edge caching in fog networks with latency and reliability constraints. In the proposed approach, user nodes (UNs) offload their computing tasks to edge computing servers (cloudlets). Cloudlets leverage their computing and storage capabilities to proactively compute and store cacheable computing results. In this regard, a task popularity...
In this paper, the problem of uplink (UL) and downlink (DL) resource optimization, mode selection, and power allocation is studied for wireless cellular networks under the assumption of in-band full duplex base stations, non-orthogonal multiple access (NOMA) operation, and queue stability constraints. The problem is formulated as a network utility maximization problem for which a Lyapunov framework...
In this paper, the fundamental problem of distribution and proactive caching of computing tasks in fog networks is studied under latency and reliability constraints. In the proposed scenario, computing can be executed either locally at the user device or offloaded to an edge cloudlet. Moreover, cloudlets exploit both their computing and storage capabilities by proactively caching popular task computation...
User association is a key factor that affects the performance of wireless cellular small cell networks. In this paper, the problem of decoupled uplink (UL) and downlink (DL) in time division duplexing (TDD)-based small cell networks is studied. In particular, a dynamic user association scheme is proposed to dynamically balance the UL and DL loads in different small cell base stations (SCBSs). Using...
Dynamic Time-division duplex (TDD) can provide efficient and flexible splitting of the common wireless cellular resources between uplink (UL) and downlink (DL) users. In this paper, the UL/DL optimization problem is formulated as a noncooperative game among the small cell base stations (SCBSs) in which each base station aims at minimizing its total UL and DL flow delays. To solve this game, a self-organizing...
In this paper, the problem of content-aware user clustering and content caching in wireless small cell networks is studied. In particular, a service delay minimization problem is formulated, aiming at optimally caching contents at the small cell base stations (SCBSs). To solve the optimization problem, we decouple it into two interrelated subproblems. First, a clustering algorithm is proposed grouping...
We propose a resource allocation scheme based on the auction algorithm that aims at minimizing inter-cell interference (ICI) in multi-carrier LTE-A systems. The prices paid for resources by cell-edge users are infrequently exchanged between adjacent cells to help deciding who needs a specific resource the most. Furthermore, the Relative Narrowband Transmit Power (RNTP) indicator that is exchanged...
Carrier aggregation is one of the promising features that expands the bandwidth of the Long Term Evolution-Advanced (LTE-A) system through aggregating multiple carriers to support high data rate up to 1 Gbit/s. When considering a multi-cell scenario, an appropriate resource allocation method that takes the inter-cell interference into account should be used. We investigate different soft frequency...
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.