Pith. sign in

REVIEW 1 cited by

D2D Multicast in Underlay Cellular Networks with Exclusion Zones

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.00300 v2 pith:F6ZKBU4E submitted 2019-05-01 cs.NI cs.ITmath.IT

classification cs.NIcs.ITmath.IT
keywords problemcellularchanneloptimalsubsetmulticastperformanceallocation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Underlay device-to-device (D2D) multicast communication has potential to improve performance of cellular networks. However, co-channel interference among cellular users (CUs) and D2D multicast groups (MGs) limits the gains of such communication. Allowing the CUs to have exclusion zones around them where no receiver of any MG can exist, is a realistic and pragmatic approach to reduce the co-channel interference of cellular transmission on D2D multicast reception. We use a stochastic geometry based approach to model this scenario. Specifically, we model the locations of CUs and D2D MG receivers with homogeneous Poisson Point Process (PPP), and Poisson Hole Process (PHP), respectively. We formulate the network sum throughput maximization problem in terms of a joint MG channel and power allocation problem with constraints on cellular and MG users maximum transmit and acceptable quality of service. We establish that the MG channel allocation problem has computational complexity that is exponential in both, the number of MGs and the number of available cellular channels. Then, we decompose this problem into two subproblems: subset selection problem and subset channel assignment problem. Based on observations and insights obtained from numerical analysis of the optimal solution of the subset selection problem in wide variety of scenarios, we propose a computationally efficient scheme that achieves almost optimal performance for the subset selection problem. We further provide a computationally efficient algorithm that achieves almost optimal performance for the subset channel assignment problem. Finally, combining these two schemes, we provide a computationally efficient and almost optimal scheme to solve the channel allocation problem, and various results and insights on the variation of the optimal system performance with respect to different system parameters

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multiple D2D Multicasts in Underlay Cellular Networks

    cs.NI 2019-08 reject novelty 4.0 of 10

    The authors propose a two-step channel and power allocation heuristic for underlay D2D multicasts and show via simulation that it outperforms several existing schemes in sum throughput.

Pith tools