Related papers: Simplifying Wireless Social Caching
We study the demand-robust fleet size vehicle routing problem with time windows and compatibility constraints. Unlike traditional robust optimization, which considers uncertainty in the data, demand-robust optimization considers uncertainty…
The classic online stochastic matching problem typically requires immediate and irrevocable matching decisions. However, in many modern decentralized systems such as real-time ride-hailing and distributed cloud computing, the primary…
This paper considers a broadcast multiple-input multiple-output (MIMO) network with multiple users and simultaneous wireless information and power transfer (SWIPT). In this scenario, it is assumed that some users are able to harvest power…
Many networks including social networks, computer networks, and biological networks are found to divide naturally into communities of densely connected individuals. Finding community structure is one of fundamental problems in network…
Relay nodes are used to improve the throughput, delay and reliability performance of energy harvesting networks by assisting both energy and information transfer between information nodes and access point. Previous studies on radio…
This paper investigates a wireless powered communication network (WPCN) under the protocol of harvest-then-transmit,where a hybrid access point with constant power supply replenishes the passive user nodes by wireless power transfer in the…
The facility location problem is widely used for summarizing large datasets and has additional applications in sensor placement, image retrieval, and clustering. One difficulty of this problem is that submodular optimization algorithms…
While next-generation wireless communication networks intend leveraging edge caching for enhanced spectral efficiency, quality of service, end-to-end latency, content sharing cost, etc., several aspects of it are yet to be addressed to make…
We consider a single-hop data gathering sensor cluster consisting of a set of sensors that need to transmit data periodically to a base-station. We are interested in maximizing the lifetime of this network. Even though the setting of our…
Coded caching has been shown to result in significant throughput gains, but its gains were proved only by assuming a placement phase with no transmission cost. A free placement phase is, however, an unrealistic assumption that could stand…
The problems of energy harvesting in wireless com- munication systems have recently drawn much attention. In this paper, we focus on the investigation of energy harvesting maximization (EHM) in the important secrecy multi-input multi-…
We consider two capacity problems in P2P networks. In the first one, the nodes have an infinite amount of data to send and the goal is to optimally allocate their uplink bandwidths such that the demands of every peer in terms of receiving…
This paper investigates optimal caching placement for wireless femto-caching network. The average bit error rate (BER) is formulated as a function of caching placement under wireless fading. To minimize the average BER, we propose a greedy…
In this paper, we consider the problem of optimal scalable video delivery to mobile users in wireless networks given arbitrary Quality Adaptation (QA) mechanisms. In current practical systems, QA and scheduling are performed independently…
In our paper we consider the Cell Formation Problem in Group Technology with grouping efficiency as an objective function. We present a heuristic approach for obtaining high-quality solutions of the CFP. The suggested heuristic applies an…
Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…
We extend the problem of optimizing user association for load balancing in cellular networks along two dimensions. First, we consider joint transmission (JT), which is one of the coordinated multipoint (CoMP) techniques, with which a user…
We propose a cache-enabled opportunistic cooperative MIMO (CoMP) framework for wireless video streaming. By caching a portion of the video files at the relays (RS) using a novel MDS-coded random cache scheme, the base station (BS) and RSs…
A fundamental challenge in wireless heterogeneous networks (HetNets) is to effectively utilize the limited transmission and storage resources in the presence of increasing deployment density and backhaul capacity constraints. To alleviate…
Cache-enabled device-to-device (D2D) networks turn memory of the devices at the network edge, such as smart phones and tablets, into bandwidth by enabling asynchronous content sharing directly between proximate devices. Limited storage…