Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2206.12852

Spectrum Sharing Among Multiple-Seller and Multiple-Buyer Operators of A Mobile Network: A Stochastic Geometry Approach

Elaheh Ataeebojd·Mehdi Rasti·Hossein Pedram·Pedro H. J. Nardelli
View original source ↗Read source document ↗Export metadata ↓

Abstract

Sharing the spectrum among mobile network operators (MNOs) is a promising approach to improve the spectrum utilization and to increase the monetary income of MNOs. In this paper, we model a nonorthogonal spectrum sharing system for a large-scale cellular network where multiple seller MNOs lease their licensed sub-bands to several buyer MNOs. We first analyze the per-user expected rate and the per-MNO expected profit using stochastic geometry. Then, we formulate the joint problem of power control and licensed sub-band sharing to maximize the expected profit of all MNOs as a multiobjective optimization problem (MOOP) under the users' quality of service requirement and the nonnegative return on investment constraints. To transform the MOOP into a single objective form, we use a combination of the $\epsilon$-constraint and weighted sum methods. However, the transformed problem is nonconvex because of the presence of binary variables and nonconvex rate functions in the objective function and constraints. We address this problem by using a penalty function and approximating the nonconvex rate functions by a constrained stochastic successive convex approximation method. Finally, the numerical results show the correctness and performance of the proposed algorithm under various conditions.

Explore related subjects

cs.CGcs.NI

Keep this discovery

BibTeXRIS

Elaheh Ataeebojd, Mehdi Rasti, Hossein Pedram, Pedro H. J. Nardelli. 2022-06-26. Spectrum Sharing Among Multiple-Seller and Multiple-Buyer Operators of A Mobile Network: A Stochastic Geometry Approach. https://doi.org/10.1109/tccn.2022.3183898

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG↗
arXiv2026

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG↗
arXiv2026

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG↗