{"id":"5b2e53e6-b073-4a32-abf1-4da8375713e7","arxiv_id":"1908.05857","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"The paper derives a successful edge computing probability for cell-free massive MIMO with MEC servers and a central cloud, then numerically shows that for fixed total antennas, spreading them over more access points is more energy efficient.","lead":"This paper builds a mathematical model of cell-free massive MIMO networks where small base stations also host edge computing servers, and computes the probability that a user's task is both transmitted successfully and computed on time. It then compares two ways of spending the same number of antennas, and finds that more access points with fewer antennas each is more energy efficient.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The SECP and energy results depend on the never-specified network area |A| via λ_c in Eq. (29); for any realistically sized network the central-server queue is unstable, so the claimed AP-density design rule is currently unreproducible and untested.","rationale":"The reader's weakest assumption already names |A|; I agree and elevate it to the primary concern because it enters the central-server queueing analysis, and because the paper's parameterization makes the central-server queue unstable for any realistically sized network. The queue-independence approximation under min-load routing is also unvalidated, but it is secondary: even if the M/G/1 independence were exact, the missing |A| would still prevent reproducibility of the SECP and energy curves. A sensitivity test over |A| directly settles whether the headline energy-efficiency ordering is robust or an artifact of the hidden area normalization. This is not an attack on the authors; it identifies a missing input parameter. The analytical framework may be sound, but the central numerical claim needs this check before it can be accepted, so the conditional verdict should stand.","tokens_in":24793,"tokens_out":17366,"duration_ms":173990,"concrete_test":"Recompute Section VI for both deployments (λ_b = 400/km², M = 4) and (λ_b = 1600/km², M = 1) using |A| in {0.005, 0.01, 0.02, 0.05, 0.1, 0.5, 1} km², all other parameters as in Tables II and III. For each |A|, check (i) whether ρ_c < 1 and the SECP constraint is feasible, and (ii) whether E(λ_b = 1600, M = 1) ≤ E(λ_b = 400, M = 4) for every ξ in [0.5, 0.8]. Report the largest |A| for which the central-server queue is stable and the |A|-range over which the claimed ordering holds; if no stable |A| yields a network with more than 100 APs, the design rule is an artifact of the unspecified small-area normalization.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing point is the dependence of the central-server arrival rate on the total network area, Eq. (29): λ_c = λ_d |A| ϑ (1 - p_o,ul(R)). The paper never specifies |A| in Table III or in the numerical section. Since P[T_c ≤ t] in Theorem 3 is the M/G/1 sojourn-time tail with load ρ_c = λ_c/µ_c, every SECP value, the feasible set of the energy problem (41), and the optimal (R*,ϑ*) are functions of |A|. With the stated parameters (λ_d = 100/km², L_u = 0.5 Mbits, ϑ around 0.2–0.7), stability ρ_c < 1 forces |A| below roughly 0.06 km², i.e. fewer than about 25 APs at λ_b = 400/km². That is far from a cell-free massive-MIMO regime and inconsistent with the infinite-plane PPP used for p_o,ul(R). Without |A|, Figs. 5–7 cannot be reproduced, and the abstract's claim that more APs is always more energy efficient for any desired SECP is not testable.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies an edge-computing-enabled cell-free massive MIMO system in which access points (APs) are modeled as a Poisson point process, each AP carries a MEC server, and a central server (CS) provides additional cloud processing. Users offload tasks to either a connected MEC server or the CS with probability ϑ. The authors derive an uplink outage probability (Theorem 1), a downlink outage probability using a Gamma interference approximation (Theorem 2), and a computation-latency success probability based on M/G/1 queueing (Theorem 3). These are combined into a successful edge computing probability (SECP) in Eq. (10), which is subsequently used in an energy-minimization problem in Eq. (41). The central numerical claim, stated in the abstract and conclusion, is that for any desired SECP level it is more energy efficient to deploy more APs with fewer antennas per AP than fewer APs with more antennas per AP, at fixed antenna density.","tokens_in":25060,"tokens_out":9576,"duration_ms":92364,"significance":"If the analysis were fully rigorous, this would be a valuable contribution: it provides a tractable stochastic-geometry and queueing framework for a timely system model, includes a detailed energy-consumption model, and yields a concrete, falsifiable antenna/AP-density design rule. I found no evidence of parameter fitting or circularity: the SECP and energy expressions are computed from the model inputs, and the design tradeoff is read off the derived formulas. The paper also includes a simulation check for the successful communication probability in Fig. 2, which is a strength. However, the central numerical results are not currently reproducible because the CS arrival rate depends on an unspecified total network area, and several load-bearing independence/approximation steps are either unstated or not validated. The design rule may be correct, but the present manuscript does not establish it to the standard expected for a journal publication.","major_comments":[{"comment":"The central-server arrival rate is λ_c = λ_d |A| ϑ (1 − p_o,ul(R)), but the total network area |A| is never specified in Table III or in the numerical section. Since λ_c enters ρ_c in Eq. (34), it controls the SCP in Eq. (33), the SECP in Eq. (10), the feasible set of the optimization in Eq. (41), the thresholds in Table I, and the energy curves in Fig. 7. The per-user task generation rate is also implicit rather than stated. With the parameters of Table III (μ_c ≈ 194 tasks/s for type-1 tasks) and λ_d = 100 users/km², stability ρ_c < 1 restricts |A| to roughly 10 km² for ϑ = 0.2 and even less for larger ϑ, so the choice of |A| is not innocuous. The authors must specify |A|, state the task-generation-rate model, verify stability, and either rerun Figs. 5–7 for the chosen area or reformulate λ_c as an independently specified parameter. As it stands, the abstract's design rule is not testable from the reported results.","section":"§IV-A, Eq. (29)"},{"comment":"The downlink outage probability in Eq. (25) is not an exact expression but a floor/ceil bound on an approximation: the interference is modeled as Gamma with a non-integer shape parameter ζ(R), and Remark 1 explicitly states that equality holds only when ζ(R) is an integer. Yet the SECP in Eq. (10) and all subsequent numerical results treat p_o,dl(R) as a definite number. The paper should state whether the plots use the floor or the ceil version, whether the SECP is therefore a lower/upper bound, and should validate the downlink outage approximation against simulation, as was done for the uplink in Fig. 2. Without this, the numerical SECP and energy-optimal design conclusions rest on an uncontrolled approximation.","section":"§III-B, Theorem 2 and Eq. (25)"},{"comment":"The uplink outage derivation assumes that the SIRs at different APs connected to the same user are independent and multiplies their outage probabilities in Eq. (49). These SIRs are statistically dependent because they share the same set of interfering users from the common Poisson process. This is an approximation that is not stated in the main model section. Since the uplink outage enters the SECP in Eq. (10) and the CS/MEC arrival rates in Eqs. (29)–(30), the error propagates to all performance and energy results. The authors should state this independence assumption explicitly and, ideally, provide a simulation-based check of Theorem 1 in the multi-AP setting.","section":"Appendix A, Eq. (49)"},{"comment":"The MEC queueing analysis derives the marginal queue-length distribution of a single M/G/1 server and then, in Eq. (69), multiplies the individual tail probabilities as if the queue lengths at different MEC servers were independent. This contradicts the minimum-load computation model (MLCM) in Eq. (6), under which each arriving task is routed to the server with the minimum instantaneous load, introducing dependence among the queues. The i.i.d. assumption is unstated and is load-bearing for P[T_mec ≤ t | N = n] and hence for the SECP and the energy comparison. The authors should state this approximation and provide a queueing-level simulation of the MLCM routing to quantify its effect.","section":"§IV-A, Eqs. (68)–(69)"}],"minor_comments":[{"comment":"In Table III, the entries for μ_m,2 and μ_c,2 appear to repeat f_mec,1 and f_cs,1 respectively; they should presumably use f_mec,2 and f_cs,2. Please correct this and check the resulting numerical values.","section":"Table III"},{"comment":"Equation numbers (37) and (38) are used twice: once in Theorem 3 and again in the proof of Corollary 1. Please renumber the equations in the corollary proof.","section":"Theorem 3 and Corollary 1"},{"comment":"The notation ∫_0^t L^{-1}_X[·] du is ambiguous: the inverse Laplace transform should be evaluated at the integration variable before integrating. Please make the argument of L^{-1} explicit.","section":"Eqs. (34)–(35)"},{"comment":"The condition f_cs,i / f_mec,i > (κ_m/κ_c)^{1/(δ−1)} for E_comp to increase with ϑ is asserted without derivation; a short derivation showing how the averaged service times in Eq. (43) lead to this inequality would make the monotonicity claim easier to verify.","section":"§VI-B"}],"recommendation":"major_revision","confidential_remarks":"The paper is within scope and the underlying idea is interesting. The main blocker is the unspecified network area |A| in Eq. (29), which affects the SECP and all energy results; this is fixable but requires the authors to define the network model carefully and rerun the numerical sections. I would also ask for explicit acknowledgment and simulation validation of the independence approximations in the uplink analysis and in the MEC queueing analysis before acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a real attempt to put MEC queueing and stochastic geometry into one cell-free massive MIMO model, and the communication-side analysis is a solid starting point. But the SECP and energy numbers are hostage to an unstated network area |A| in Eq. (29), so the headline energy design rule is not yet reproducible.\n\nWhat is new: the SECP decomposition in Eq. (10), the min-load MEC selection model with M/G/1-style queueing tails, and the energy-minimization framing that yields the more-APs/fewer-antennas tradeoff. The authors are not fitting parameters to force conclusions; the curves come from the model. The uplink outage derivation and the SCMP figure are checked against simulation, and the exposition is careful. The self-citation to the conference version is legitimate prior work.\n\nSoft spots, in order. First, Eq. (29) defines the central-server arrival rate through |A|, and Table III and the numerical section never give |A|. SECP, the feasible set of the energy problem, and Figs. 5–7 all shift with |A|. The stress-test note is right about that. I do not reproduce its instability arithmetic: with the table's service rates, stability at ϑ around 0.3 permits |A| on the order of several km², not 0.06 km². But absent |A|, no reader can get their numbers, and for large |A| the CS queue becomes overloaded. Second, the M/G/1 queue analysis for min-load routing assumes independent queues at the connected APs, and that approximation is not flagged. Third, Theorem 2 is a bound on a Gamma approximation of downlink interference, not an exact outage probability. Fourth, only SCMP has a simulation check; the SCP/SECP/energy curves have none.\n\nNone of this kills the paper. The framework is useful and the communication part is tested. A serious referee should push for |A| to be specified, for a simulation study of the computation queues, and for a clear statement of the independence assumption. I would send it to peer review, not desk reject, and my own verdict would be conditional until those numbers are pinned down.","headline":"A genuine modeling contribution combining stochastic geometry and M/G/1 queueing for cell-free massive MIMO MEC, but the SECP and energy claims are not reproducible until the network area |A| in Eq. (29) is specified.","tokens_in":25560,"tokens_out":3479,"would_cite":true,"duration_ms":37222,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60K25","60G55","94A05"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that in edge-computing cell-free massive MIMO, more access points with fewer antennas is the energy-efficient way to hit any target success probability.","keywords":["cell-free massive MIMO","mobile edge computing","successful edge computing probability","stochastic geometry","queueing theory","energy efficiency","task offloading","MRC/MRT beamforming"],"falsifier":"At a fixed antenna density ($M\\lambda_b = 1600$ per km$^2$), a Monte Carlo simulation with shortest-queue routing and a specified network area that finds a target SECP for which the high-AP-density design does not achieve the lower minimum energy would falsify the paper's design rule; reproducing Fig. 7 also requires the paper's unspecified $|A|$, so the simulation must fix it.","tokens_in":24585,"feed_emoji":"📡","tokens_out":8685,"duration_ms":77258,"temperature":0.7,"pith_summary":"This paper proposes a way to judge whether mobile edge computing works in a cell-free massive MIMO network, where many small access points (APs), each equipped with a server, jointly serve users and share a central cloud server. Its metric is the successful edge computing probability (SECP): the chance that a user's task is both transmitted to a server successfully in the uplink and downlink and computed within a target latency. The paper derives the SECP from stochastic-geometry expressions for uplink and downlink outage and queueing-theory expressions for computation delay at the edge servers and the central server. The design conclusion is concrete: for any desired SECP, it costs less energy to reach that target by deploying more APs with fewer antennas each than by deploying fewer APs with more antennas each. That turns the result into a deployment rule for where to put antennas and servers.","feed_headline":"More small access points beat fewer big ones for edge-computing energy","feed_subtitle":"In cell-free massive MIMO with edge servers, AP density, not antenna count, sets the energy cost of a target success rate","key_machinery":"The object that carries the argument is the SECP expression in Eq. (10), $$p_{\\mathrm{secp}}(R,\\vartheta,t)=\\sum_{n=1}^{\\infty}\\frac{(\\lambda_b\\pi $R^{2}$)^n}{n!}$e^{{-\\lambda_b\\pi R^2}}$\\mathbb{P}[T_{\\mathrm{comp}}\\le t\\mid N=n]\\{1-p_{o,\\mathrm{ul}}^{(n)}(R)\\}\\{1-p_{o,\\mathrm{dl}}(R)\\}.$$ It joins the Poisson-distributed number $N$ of connected APs (mean $\\lambda_b\\pi R^2$), the uplink outage term $(1-p_0(R))^n$ for the event that all $n$ connected APs fail, the downlink outage term from the Gamma interference approximation, and the computation latency probability from the M/G/1 queue analysis. Theorems 1 and 2 supply the outage probabilities; Theorem 3 and Corollary 1 supply the computation latency tails; Proposition 3 feeds the arrival rates into the queues; and the energy model in Section VI attaches an energy cost to every $(R,\\vartheta)$ choice. All of it exists to make Eq. (10) a function the paper can minimize under a SECP constraint.","core_discovery":"On the paper's own terms, the central discovery is a quantitative design rule for edge-computing-enabled cell-free massive MIMO. For a fixed total antenna density, replacing fewer high-antenna APs with more low-antenna APs lowers the minimum total energy needed to guarantee any given successful edge computing probability (SECP). This is shown by combining three pieces of analysis: an uplink outage probability in which transmission fails only if every connected AP fails (Theorem 1), a downlink outage probability based on a Gamma approximation of interference (Theorem 2), and a computation success probability obtained from M/G/1 queues with tasks routed to the least-loaded connected MEC server or to the central server with probability $\\vartheta$ (Theorem 3). These feed into the SECP expression in Eq. (10), which averages over the Poisson-distributed number $N$ of APs within coverage radius $R$. The paper also finds that the SECP is quasi-concave in $R$, giving an optimal coverage radius $R_{th}$, and that the optimal offloading probability to the central server decreases as $R$ grows.","pith_inferences":["A natural extension the paper leaves implicit: the SECP decomposition should carry over to other combining schemes (for example, MMSE) by replacing the Gamma gain distributions, so the AP-density energy rule may be more general than MRC/MRT.","The optimal-coverage-radius table suggests a deployment heuristic: choose the AP density first, then set $R$ and $\\vartheta$ from the SECP contour; the reported $R_{th}$ shrinks as the latency target or AP density grows.","A testable prediction of the energy model is that the energy gap between dense-AP and sparse-AP designs widens as the target SECP increases; a simulation or experimental campaign sweeping $\\xi$ could check this directly."],"forward_implications":["For a fixed antenna density, communication success favors dense AP deployment only for small coverage radii; at large radii, fewer APs with more antennas give higher communication success.","The SECP is quasi-concave in the coverage radius, so there is a unique optimal radius $R_{th}$ for given $\\lambda_b$, $t$, and $\\vartheta$.","The optimal probability of offloading to the central server decreases as the AP coverage radius grows; offloading to the cloud helps when few MEC servers are in range and hurts when many are.","The minimum energy needed to guarantee a target SECP first decreases and then increases with the target: computation energy dominates at low targets and communication energy at high targets.","For every SECP target considered, the minimum energy configuration is higher AP density with fewer antennas per AP, not lower AP density with more antennas per AP."],"supporting_citations":[{"why":"Defines the cell-free massive MIMO setup with distributed APs, the network model the whole paper builds on.","marker":"[19]"},{"why":"Supplies the Poisson point process model for AP locations and the stochastic-geometry treatment of distributed antennas.","marker":"[20]"},{"why":"Provides the Gamma approximation of aggregate interference that Theorem 2 relies on for downlink outage.","marker":"[28]"},{"why":"Supplies Campbell's theorem and stochastic-geometry tools used to compute interference moments in Proposition 2.","marker":"[29]"},{"why":"Gives the interference model for large wireless networks that underlies the Laplace-transform and Gamma approximations.","marker":"[30]"},{"why":"Provides the M/G/1 queueing (Pollaczek-Khinchin) formulas used for computation latency in Theorem 3.","marker":"[39]"},{"why":"Supplies the massive MIMO transceiver power-consumption model used in the communication energy expressions.","marker":"[42]"},{"why":"Provides receiver circuit-power and energy-efficiency formulations used in the energy minimization.","marker":"[43]"}],"fun_headline_variants":["AP density beats antenna count for edge-computing energy","More access points, fewer antennas: energy win in cell-free MIMO","Edge computing in cell-free MIMO: AP count trumps antenna count","Energy-efficient edge: more small APs than big ones","Optimal edge computing: AP density over antenna scale"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The calculation treats each MEC server's queue as an independent M/G/1 queue fed by Poisson arrivals, even though tasks are routed to whichever connected server currently has the smallest queue.","fun_headline_variants_meta":{"raw":{"variants":["AP density beats antenna count for edge-computing energy","More access points, fewer antennas: energy win in cell-free MIMO","Edge computing in cell-free MIMO: AP count trumps antenna count","Energy-efficient edge: more small APs than big ones","Optimal edge computing: AP density over antenna scale"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000637,"raw_usage":{"total_tokens":2953,"prompt_tokens":982,"completion_tokens":1971,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":598,"completion_tokens_details":{"reasoning_tokens":1885}},"tokens_in":598,"tokens_out":1971,"duration_ms":12889,"temperature":1.0,"reasoning_tokens":1885,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:03:45.002848+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"At a fixed antenna density ($M\\lambda_b = 1600$ per km$^2$), a Monte Carlo simulation with shortest-queue routing and a specified network area that finds a target SECP for which the high-AP-density design does not achieve the lower minimum energy would falsify the paper's design rule; reproducing Fig. 7 also requires the paper's unspecified $|A|$, so the simulation must fix it.","supporting_citations":[{"cited_title":"Cell-free massive mimo: Uniformly great service for every one,","cited_arxiv_id":null,"evidence_quote":"Defines the cell-free massive MIMO setup with distributed APs, the network model the whole paper builds on."},{"cited_title":"Channel hardening and favorab le propagation in cell-free massive MIMO with stochastic geometry,","cited_arxiv_id":null,"evidence_quote":"Supplies the Poisson point process model for AP locations and the stochastic-geometry treatment of distributed antennas."},{"cited_title":"Modeling het erogeneous network interference using poisson point processes,","cited_arxiv_id":null,"evidence_quote":"Provides the Gamma approximation of aggregate interference that Theorem 2 relies on for downlink outage."},{"cited_title":"Haenggi, Stochastic Geometry for Wireless Networks","cited_arxiv_id":null,"evidence_quote":"Supplies Campbell's theorem and stochastic-geometry tools used to compute interference moments in Proposition 2."},{"cited_title":"Interference in large wirel ess networks,","cited_arxiv_id":null,"evidence_quote":"Gives the interference model for large wireless networks that underlies the Laplace-transform and Gamma approximations."},{"cited_title":"Kleinrock, Queueing Systems, Volume I: Theory","cited_arxiv_id":null,"evidence_quote":"Provides the M/G/1 queueing (Pollaczek-Khinchin) formulas used for computation latency in Theorem 3."},{"cited_title":"Impact of transceiver power consumpti on on the energy efficiency of zero-forcing detector in massive MIMO s ystems,","cited_arxiv_id":null,"evidence_quote":"Supplies the massive MIMO transceiver power-consumption model used in the communication energy expressions."},{"cited_title":"Optimal design of energy-efficient multi-user MIMO systems: Is massive MIM O the answer?","cited_arxiv_id":null,"evidence_quote":"Provides receiver circuit-power and energy-efficiency formulations used in the energy minimization."}],"review_version":1}