{"id":"02d6fb45-ef15-4cc7-91bd-12429f095d1c","arxiv_id":"1908.05755","paper_version":2,"verdict":"REJECT","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"The paper proposes a closed-form power map that adapts a sensor's transmit power to its battery state and quantized channel gain to maximize J-divergence at a fusion center, but the battery-state update in the derivation neglects local detection errors.","lead":"A team at the University of Central Florida derives a transmit-power rule for wireless sensors that harvest energy into a finite battery, aiming to maximize a detection metric at a fusion center. The rule lets each sensor pick power from its battery level and a quantized channel-state report, but a key battery-modeling step ignores the sensors' detection error rates.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Eq. (7) weights battery transitions as if Pfn=0 and Pdn=1, so the steady-state ψ in the objective is not the battery distribution of the stated model, and Eq. (20) is not the claimed optimum.","rationale":"I re-derived the moment-matched Gaussian J-divergence in Eq. (12) and the KKT form in Eqs. (19)-(20); conditional on a fixed battery distribution ψ, the per-point min structure is coherent and the convexity region is inherited from [10]. The failure is at the boundary between the battery process and the detection process. Eq. (7) and Eq. (14) treat the event 'sensor transmits' as equivalent to H1, ignoring Pfn and Pdn that the paper itself defines and uses. Since ψ weights the objective and power constraint, the optimization in (18) is over the wrong stationary distribution; Algorithm 2 iterates on the wrong Markov chain. This is not an external modeling dispute: it is an internal inconsistency with the stated local decision model. The suggested test—recomputing the recursion with Pfn/Pdn included and comparing steady-state ψ or P_FC^D—would settle it. No other concern (e.g., lack of a baseline or the unproven fixed-point optimality) is as directly load-bearing as this. I therefore agree with the reader's weakest-assumption identification and see no reason to alter the REJECT verdict.","tokens_in":9662,"tokens_out":7898,"duration_ms":72694,"concrete_test":"Re-derive and implement the correct battery-state recursion with the local decision probabilities included: for each n,l,k,j, ψ'_n,j = Σ_{l,k} π_{n,l} ψ_{n,k} [ (Π_0(1-Pfn)+Π_1(1-Pdn)) Pr(k+β=j) + (Π_0 Pfn+Π_1 Pdn) Pr(k+β-α_{n,l,k}=j) ], with boundary terms for k=0 and k=K, and the corresponding corrected outage constraint Π_1 Pdn FEn(keu(η-1)+α) + Π_1(1-Pdn) FEn(keu(η-1)) ≤ 1-ζn plus the analogous Π_0 terms. Then re-run Algorithm 2 and the Neyman-Pearson simulation with the paper's own parameters (Pfn=[0.2,0.1], Pdn=[0.9,0.75], γe=3, K=100). If the steady-state ψ or P_FC^D shifts by more than the Monte Carlo error, the Eq. (20) map is not optimal for the stated model.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that the power map in Eq. (20), run with the fixed-point battery distribution from Algorithm 2, maximizes the approximate J-divergence in Eq. (18) for the stated energy-harvesting WSN. The load-bearing premise is the battery-state recursion in Eq. (7). That recursion reads ψ_t_{n,j} = Σ_l Σ_k π_{n,l} ψ_{t-1}_{n,k} [ Π_0 Pr(k+β_{t-1}_n = j) + Π_1 Pr(k+β_{t-1}_n - α_{t-1}_{n,l,k} = j) ], with analogous expressions for j=0 and j=K. This is exact only if the sensor never transmits under H0 and always transmits under H1. But the paper defines Pfn=Pr(u_n=1|H0) and Pdn=Pr(u_n=1|H1), uses Pfn>0, Pdn<1 in the simulation, and the J-divergence coefficients in Eq. (12) depend on these same probabilities. The correct transition must weight the no-transmission branch by Π_0(1-Pfn)+Π_1(1-Pdn) and the transmission branch by Π_0 Pfn+Π_1 Pdn. Eq. (7) instead uses weights Π_0 and Π_1, which is equivalent to forcing Pfn=0 and Pdn=1. Since ψ is used to weight the objective and the total average power constraint in Eq. (18), and also enters the battery outage bound via Eq. (14) (which has the same omission), the map from Eq. (20) is optimal for a different, effectively perfect-local-decision battery process, not for the model with false alarms and missed detections. The fixed-point iteration in Algorithm 2 therefore converges to the invariant distribution of the wrong Markov chain. This is an internal correctness problem, not a matter of disagreeing with a modeling convention.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper considers a wireless sensor network of N energy-harvesting sensors with finite-capacity batteries that perform binary distributed detection and send their local decisions to a fusion center over fading channels with quantized feedback. The authors approximate the J-divergence at the fusion center by moment-matching Gaussian densities, formulate an optimization problem for the transmit power map p_{n,l,k} as a function of each sensor's battery state and quantized channel gain, and derive the closed-form map in Eq. (20) subject to causality, battery outage, and total average power constraints. They propose a fixed-point iteration (Algorithm 2) to compute steady-state battery probabilities and evaluate the scheme via Neyman-Pearson simulations.","tokens_in":10054,"tokens_out":14144,"duration_ms":111595,"significance":"The paper addresses a relevant and timely problem: distributed detection in energy-harvesting WSNs with finite batteries and limited feedback. The proposed solution is attractively explicit: a closed-form power map, a concrete algorithm for steady-state battery probabilities, and simulation results with a Neyman-Pearson fusion rule. However, the central derivation contains load-bearing errors in the battery transition model and in the J-divergence objective. If these are corrected, the overall approach may be salvageable, but the numerical results and the claimed optimality in the present form do not follow from the stated model. The paper does not provide machine-checked proofs or code, so the correctness rests entirely on the derivations as written.","major_comments":[{"comment":"The battery state recursion in Eq. (7) conditions on the true hypothesis rather than on the local decision u_n. The no-transmission branch is weighted by Π0 and the transmission branch by Π1, which is exact only when Pfn=0 and Pdn=1. Since transmission occurs exactly when u_n=1, the correct weights are Π0(1-Pfn)+Π1(1-Pdn) for the no-transmission branch and Π0Pfn+Π1Pdn for the transmission branch. The paper defines Pfn and Pdn in Section II-A and uses Pfn=[0.2,0.1], Pdn=[0.9,0.75] in Section V, so the omission is material. Because ψ_n,k computed by Algorithm 2 is used to weight the objective and the total average power constraint in Eq. (18), the map in Eq. (20) is not optimal for the stated model; Algorithm 2 converges to the invariant distribution of a different Markov chain with perfect local decisions.","section":"II-B, Eq. (7)"},{"comment":"The battery outage constraint has the same structural error. Eq. (14) writes Pr(b^{t+1}>η b^t | b^t,l) = Π0 F_E(k e_u(η-1)) + Π1 F_E(k e_u(η-1)+α^t_{n,l,k}), which again assumes no transmission under H0 and transmission under H1. A correct expression must account for the local decision probabilities: under H0 the transmission branch has probability Pfn, and under H1 the no-transmission branch has probability 1-Pdn. Consequently, the derived upper bound Φ_n,k in Eq. (16) and constraint (ii) in Eq. (18) are not valid for the model with imperfect local decisions.","section":"IV, Eqs. (14)-(16)"},{"comment":"Substituting the stated means and variances m_n,H0, m_n,H1, Σ_n,H0, Σ_n,H1 into Eq. (11) gives first-term numerator coefficient Pdn(1-Pdn)+(Pdn-Pfn)^2 = Pdn -2PfnPdn + Pfn^2 and second-term coefficient Pfn(1-Pfn)+(Pdn-Pfn)^2 = Pdn^2 -2PfnPdn + Pfn. The paper's A_n and C_n are the reverse of these expressions (and equal only in the trivial limit). Since Eq. (12) is the objective maximized in Eq. (18), the power map in Eq. (20) does not solve the stated J-divergence maximization even leaving the battery issue aside.","section":"III, Eq. (12)"}],"minor_comments":[{"comment":"The J-divergence formula in Eq. (11) omits the factor 1/2 and the constant term involving ln(Σ0/Σ1); while this affine transformation does not change the argmax, the J values plotted in Figs. 7-8 are not the true J-divergence values.","section":"III, Eq. (11)"},{"comment":"The text contains numerous proofreading and typesetting artifacts, such as 'task ed', 'storin g', 'transmi t', and 'Jules' instead of 'Joules'.","section":"Throughout"},{"comment":"The paper does not specify how the local decision rule Γ_n and the probabilities Pfn and Pdn are chosen; they are treated as fixed parameters, but no relation to the observation model or thresholds is given.","section":"II-A"},{"comment":"The convergence of the fixed-point iteration to a steady-state distribution is asserted but not analyzed; a brief discussion of contraction or numerical evidence would improve the paper.","section":"Algorithm 2"},{"comment":"The caption of Fig. 3 is grammatically incomplete and would benefit from a full sentence describing the axes and the meaning of the plotted map.","section":"Figure 3"}],"recommendation":"major_revision","confidential_remarks":"The two errors in Eqs. (7) and (12) are serious and invalidate the reported optimality results, but both are local and correctable: the transition probabilities can be rewritten in terms of the local decision probabilities, and the J-divergence coefficients can be swapped/derived correctly. I therefore recommend major revision rather than outright rejection, provided the authors re-derive the affected equations, check the convexity and KKT steps with the corrected objective, and rerun all simulations."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper's combination is new - J-divergence power allocation with a finite-capacity energy harvesting battery - and the authors correctly transplant the convexity and KKT machinery from Zhang, Poor, and Chiang. The writing is clear, and the simulations use an actual Neyman-Pearson detector. Credit where due: this is a genuine extension of the known framework, not a trivial repackaging.\n\nThe load-bearing problem is Eq. (7). The battery-state recursion weights the no-transmission branch by Π_0 and the transmission branch by Π_1. That is exact only if the sensor transmits if and only if the true hypothesis is H1, i.e., Pfn=0 and Pdn=1. But the paper explicitly defines Pfn and Pdn, uses them in the Gaussian-mixture moments leading to Eq. (12), and simulates with Pfn>0, Pdn<1. The correct transition must weight the no-transmission branch by Π_0(1-Pfn)+Π_1(1-Pdn) and the transmission branch by Π_0 Pfn + Π_1 Pdn. Since the steady-state ψ enters the objective (18) and the average power constraint (17), the fixed-point iteration in Algorithm 2 converges to the invariant distribution of the wrong Markov chain. The resulting power map is not optimal for the stated model. The same omission appears in the outage constraint (14), which also mixes Π_0/Π_1 without the decision probabilities.\n\nThis is central, not cosmetic. It breaks the main claim. The rest of the optimization - convexity, KKT, the min-clamp in Eq. (20) - is coherent conditional on a correct ψ, but the input to that machinery is wrong.\n\nMinor issues: no comparison against any baseline policy, and the fixed-point convergence is only asserted, not proved. These would be fixable in revision; the Eq. (7) error is also fixable in principle, but it requires re-deriving the transition law and likely changes the numerical results.\n\nAs submitted, I would not let this through. I would, however, send it to peer review rather than desk reject: the defect is precise, the contribution is real, and an expert referee could help the authors repair the model. Not something I would cite until the transition probabilities are corrected and the results recomputed.","headline":"The power map in Eq. (20) is not optimal for the stated model, because Eq. (7) computes battery transitions as if the sensor's local decision always matches the true hypothesis (Pfn=0, Pdn=1).","tokens_in":10594,"tokens_out":2487,"would_cite":false,"duration_ms":25378,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper derives a lookup-table transmit power map that maximizes the approximate J-divergence at the fusion center of an energy-harvesting wireless sensor network, under battery causality, outage, and average-power constraints.","keywords":["energy harvesting","wireless sensor networks","distributed detection","J-divergence","power adaptation","finite-capacity battery","quantized channel feedback","battery state probabilities"],"falsifier":"Simulate the actual battery Markov chain with the same parameters but with local decisions made by flipping a coin: transmit with probability $P_{fn}$ under $H_0$ and with probability $P_{dn}$ under $H_1$, then compare the long-run battery distribution with the one from Eq. (7); any discrepancy beyond Monte Carlo error shows the map is not optimal for the model with imperfect local decisions.","tokens_in":9387,"feed_emoji":"🔋","tokens_out":8895,"duration_ms":73699,"temperature":0.7,"pith_summary":"This paper asks how energy-harvesting sensors with small batteries should spend their stored energy when reporting local decisions to a fusion center. It claims that a single offline-computed power map, depending only on each sensor's battery state and quantized channel gain, maximizes the approximate J-divergence of the received signal densities under the two hypotheses. The map respects three constraints: it cannot use more energy than the battery holds, it keeps the battery from draining below a safety level, and it obeys a network-wide average power budget. If the claim holds, each sensor can run the optimal policy locally from a lookup table, without per-slot coordination.","feed_headline":"A closed-form power map maximizes detection in energy-harvesting WSNs","feed_subtitle":"Sensors choose power from battery state and quantized channel gain; the map is computed offline and runs locally.","key_machinery":"The load-bearing object is the transmit-power map, a lookup table over sensor, channel-quantization bin, and battery state. The argument couples two computations: the per-sensor J-divergence $J_n(\\mu_{n,l}, p_{n,l,k})$ of (12), obtained by matching the mean and variance of the Gaussian-mixture received density, and the battery-state probabilities $\\psi_{n,k}$ of (7), which evolve under the energy arrival and consumption processes. The objective is convex when the local detection probabilities lie in the set $\\mathcal{S}$, so a multiplier method applies; the stationarity equation yields $p'_{n,l,k}$, and clamping by $k e_u/T_s$ and $\\Phi_{n,k}$ enforces the causality and outage constraints. The steady-state $\\psi$ is computed by a fixed-point iteration that alternates between solving for the map and updating the transition probabilities.","core_discovery":"The paper's central claim is that the optimal transmit power map has the explicit form $p^*_{n,l,k} = \\min\\{k e_u/T_s,\\, \\Phi_{n,k},\\, [p'_{n,l,k}]_+\\}$, where $p'_{n,l,k}$ is the power obtained from the stationarity equation of the J-divergence objective and $\\Phi_{n,k}$ is the closed-form battery-outage bound. This map solves the constrained problem of maximizing the sum over sensors, channel bins, and battery states of the approximate per-sensor J-divergence $J_n(\\mu_{n,l}, p_{n,l,k})$, weighted by the channel-bin probabilities $\\pi_{n,l}$ and the steady-state battery probabilities $\\psi_{n,k}$. The battery probabilities are not assumed known; they are obtained by iterating the transition law, recomputing the map, and repeating until convergence. Simulations show the fusion-center detection probability rises with the power budget and saturates when the budget exceeds what harvesting and battery capacity can support.","pith_inferences":["The battery transition law in Eq. (7) treats the H0 branch as never consuming energy and the H1 branch as always consuming one transmission; because local decisions are imperfect, the steady-state $\\psi$ used in the objective is only an approximation. Recomputing the map with the exact transition probabilities would be a direct test of how much the approximation costs.","The same three-way clamped map structure would carry over to non-exponential energy arrivals: only $\\Phi_{n,k}$ and the transition recursion change, so the approach is a template for other harvesting statistics.","Because the map is computed offline and depends only on steady-state statistics, it could be re-derived infrequently as channel or harvesting statistics drift, making it suitable for slowly varying environments."],"forward_implications":["Each sensor implements the optimal policy from a precomputed lookup table indexed by battery state and quantized channel gain; no per-slot centralized computation is needed.","Detection probability at the fusion center increases with the total power budget and saturates once the budget exceeds what the battery and energy arrivals can deliver.","Higher energy arrival rate or larger battery capacity push the saturation point to a larger power budget, meaning the system can use more average power before the constraint becomes inactive.","The results extend J-divergence power allocation from non-harvesting sensors with perfect channel state to energy-harvesting sensors with finite batteries and limited feedback."],"supporting_citations":[{"why":"Supplies the J-divergence formula for moment-matched Gaussian densities and the convexity theorem for the power optimization.","marker":"[10]"},{"why":"Supplies the energy causality constraint that caps consumed energy by the battery's available energy.","marker":"[13]"},{"why":"Models the energy arrival process as i.i.d. exponential, used in the battery transition probabilities and outage bound.","marker":"[8]"},{"why":"Provides the finite-state Markov/exponential energy arrival model underlying the battery state recursion.","marker":"[9]"},{"why":"Frames decentralized hypothesis testing in energy-harvesting WSNs, the setting this paper extends to J-divergence power adaptation.","marker":"[4]"}],"fun_headline_variants":["Closed-form power map boosts detection in energy-harvesting WSNs","Optimal power map for EH-WSNs with finite batteries","Energy-aware transmit power optimization for distributed detection","Maximize detection with a closed-form power map in WSNs","Battery-aware power adaptation for EH-WSN detection"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The battery transition probabilities in Eq. (7) assume each sensor's local decision always matches the true hypothesis, so the map is exactly optimal only when local detection errors are ignored.","fun_headline_variants_meta":{"raw":{"variants":["Closed-form power map boosts detection in energy-harvesting WSNs","Optimal power map for EH-WSNs with finite batteries","Energy-aware transmit power optimization for distributed detection","Maximize detection with a closed-form power map in WSNs","Battery-aware power adaptation for EH-WSN detection"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000488,"raw_usage":{"total_tokens":2400,"prompt_tokens":939,"completion_tokens":1461,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":555,"completion_tokens_details":{"reasoning_tokens":1391}},"tokens_in":555,"tokens_out":1461,"duration_ms":10203,"temperature":1.0,"reasoning_tokens":1391,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:05:50.914893+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate the actual battery Markov chain with the same parameters but with local decisions made by flipping a coin: transmit with probability $P_{fn}$ under $H_0$ and with probability $P_{dn}$ under $H_1$, then compare the long-run battery distribution with the one from Eq. (7); any discrepancy beyond Monte Carlo error shows the map is not optimal for the model with imperfect local decisions.","supporting_citations":[{"cited_title":"Optimal power alloc ation for distributed detection over mimo channels in wireless senso r networks,","cited_arxiv_id":null,"evidence_quote":"Supplies the J-divergence formula for moment-matched Gaussian densities and the convexity theorem for the power optimization."},{"cited_title":"Transmis- sion with energy harvesting nodes in fading wireless channe ls: Optimal policies,","cited_arxiv_id":null,"evidence_quote":"Supplies the energy causality constraint that caps consumed energy by the battery's available energy."},{"cited_title":"Throughput maxim ization for energy harvesting cognitive radio networks with finite hori zon,","cited_arxiv_id":null,"evidence_quote":"Models the energy arrival process as i.i.d. exponential, used in the battery transition probabilities and outage bound."},{"cited_title":"Finite-state markov channel b ased modeling of rf energy harvesting systems,","cited_arxiv_id":null,"evidence_quote":"Provides the finite-state Markov/exponential energy arrival model underlying the battery state recursion."},{"cited_title":"Decentralized hyp othesis testing in energy harvesting wireless sensor networks,","cited_arxiv_id":null,"evidence_quote":"Frames decentralized hypothesis testing in energy-harvesting WSNs, the setting this paper extends to J-divergence power adaptation."}],"review_version":1}