24 September 2014 in IEEE Transactions on Wireless Communications
Cooperation in cellular networks is a promising scheme to improve system performance, especially for cell-edge users. In this work, stochastic geometry is used to analyze cooperation models where the positions of base stations follow a Poisson point process distribution and where Voronoi cells define the planar areas associated with them. For the service of each user, either one or two base stations are involved. If two, these cooperate by exchange of user data and channel related information with conferencing over some backhaul link. Our framework generally allows for variable levels of channel information at the transmitters. This paper is focused on a case of limited information based on Willems' encoding. The total per-user transmission power is split between the two transmitters and a common message is encoded. The decision for a user to choose service with or without cooperation is directed by a family of geometric policies, depending on its relative position to its two closest base stations. An exact expression of the network coverage probability is derived. Numerical evaluation shows average coverage benefits of up to 17% compared to the non-cooperative case. Various other network problems of cellular cooperation, like the fully adaptive case, can be analyzed within our framework.
7 June 2018 in IEEE Journal on Selected Areas in Communications
Caching popular content at the wireless edge promises performance benefits as well as business perspectives. In this work we study the following arrangement: a Mobile Network Operator (MNO) pre-installs memory on its wireless equipment, sets a price, and invites a unique Content Provider (CP) to invest. The CP leases memory space and places its content; the MNO then associates network users to stations, aiming for offloading CP traffic or not. We formulate an optimization problem, which maximizes offloading with minimum leasing costs for the CP. This is an NP-hard mixed-integer non-linear optimization problem. We present an iterative exact solution using Generalized Benders decomposition into a content-related Master problem and a user-association Slave problem. Master is integer linear. Slave is convex for various association policies, including (1) join-the-closest-cache, and (2) cache-aware association. For Slave, we introduce a distributed exact solution, named Generalized Bucket-filling. Extensive simulations illustrate the performance benefits under different association policies. The solution helps to determine the optimal leasing price for the MNO, and the optimal investment budget for the CP. As a general conclusion, both actors profit when the MNO association supports CP decisions.
8 June 2021 in IEEE/ACM Transactions on Networking
We introduce an original mathematical model to analyze the diffusion of posts within a generic online social platform. The main novelty is that each user is not simply considered as a node on the social graph, but is further equipped with his/her own Wall and Newsfeed, and has his/her own individual self-posting and re-posting activity. As a main result using our developed model, we derive in closed form the probabilities that posts originating from a given user are found on the Wall and Newsfeed of any other. These are the solution of a linear system of equations, which can be resolved iteratively. In fact, our model is very flexible with respect to the modeling assumptions. Using the probabilities derived from the solution, we define a new measure of per-user influence over the entire network, the $\Psi $ -score, which combines the user position on the graph with user (re-)posting activity. In the homogeneous case where all users have the same activity rates, it is shown that a variant of the $\Psi $ -score is equal to PageRank. Furthermore, we compare the new model and its $\Psi $ -score against the empirical influence measured from very large data traces (Twitter, Weibo). The results illustrate that these new tools can accurately rank influencers with asymmetric (re-)posting activity for such real world applications.
14 June 2016 in ACM SIGMETRICS Performance Evaluation Review
This article introduces a novel family of decentralised caching policies for wireless networks, referred to as spatial multi-LRU. Based on these, cache inventories are updated in a way that provides content diversity to users that are covered by, and thus have access to, more than one station. Two variations are proposed, the multi-LRU-One and -All, which differ in the number of replicas inserted in the involved edge caches. Che-like approximations are proposed to accurately predict their hit probability under the Independent Reference Model (IRM). For IRM traffic multi-LRU-One outperforms multi-LRU-All, whereas when the traffic exhibits temporal locality the -All variation can perform better.