{"id":"5d4e6012-ac2b-4c3e-8aba-dceb68fcf4e2","arxiv_id":"2506.00766","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":3,"one_line_summary":"A RSSI angle-inferred localization algorithm with bounding-box constraints reports large error reductions over Min-Max and RSSI DV-Hop in ideal simulations.","lead":"This paper proposes RAIL, a wireless localization method that estimates the angle to a target from received signal strength across multi-hop paths and then combines the angles with a bounding box to locate wireless sensor nodes. In noise-free simulations with three anchors, it reports substantially lower localization error than Min-Max and RSSI-based DV-Hop, though the 72.4% headline figure is only accurate against Min-Max.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Eq. (6) rests on an undefined 'c edge'; without a computable c-edge definition the angle inference mechanism is not well defined, so the accuracy improvement in Table III is unsupported as stated.","rationale":"The reader identified the same load-bearing concern: the angle-inference step in Eq. (6) depends on a c edge that is never precisely defined. My reading agrees and goes one step further. Even granting zero RSSI noise, exact one-hop ranging, and perfect knowledge of anchor positions, the c edge is not a well-defined network quantity. The relay nodes on the shortest paths to A2 and T are not anchors, so the WSN does not know their coordinates or necessarily have RSSI links between them; if c is instead the measured A2–T distance, Eq. (6) is only a transformation of the same distance estimates, not an independent angular observation. The single-hop correction e·n is also applied to all three edges without specifying each edge's hop count. This is not merely a missing proof or a tuning gap; it is an undefined quantity at the center of the algorithm. The zero-noise simulation setting and the 72.4% improvement claim (which Table III supports only against Min-Max, not against RSSI-based DV-Hop) are additional concerns, but the undefined c edge is the most load-bearing. Because the mechanism cannot be evaluated as written, the REJECT verdict stands. A revision that gives an unambiguous, computable c edge, validates Eq. (6) against ground-truth angles, and releases simulation code could justify reconsideration.","tokens_in":8789,"tokens_out":5800,"duration_ms":60144,"concrete_test":"Run a reproduction of the 100-node scenario (σ=0, R=10 m, 50×50 m). For each target, record the actual shortest paths from A1 to A2 and A1 to T; for each hop index, identify the c-edge nodes and check whether their RSSI distance is measurable from the network (are they within one hop, and is the measurement actually available?). Compute ∠A2A1T from Eq. (6) with the corrected lengths and compare with the true angle. If the c edge cannot be uniquely identified from RSSI data, or if the average angle error substantially exceeds the localization error reported in Table III, the central mechanism of RAIL is not supported as written.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central mechanism of RAIL is the angle estimate in Eq. (6), and that equation is not well defined in Section III-B. A law-of-cosines computation needs the side lengths a, b, and c of one triangle, but the paper defines c only as 'the connection of nodes on a edge and b edge, the nodes located at the same hop distance from A1 via different routes to A2 and T' (Fig. 3). This is not a measurable edge: the relay nodes involved are non-anchor nodes, so their pairwise RSSI distance is not generally available, and the phrase 'for each hop index' implies multiple c edges rather than the single c used in Eq. (6). If c is instead meant to be the A2–T distance, then the angle formula merely re-expresses already-estimated distances and adds no independent angular information. Eq. (6) also uses one hop count n for the e·n correction on a, b, and c without specifying the hop count of each edge. Thus the angle-inference step cannot be computed from data the WSN actually has, and the reported accuracy improvement is not tied to a well-defined mechanism.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes RAIL, a received-signal-strength (RSSI) localization method for UAV/WSN nodes that requires no additional hardware. Distances on multi-hop paths are estimated from RSSI and accumulated (Eqs. (2)-(3)); each anchor constructs a bounding box for the unknown node (Eq. (4)); an average per-hop path excess e is calibrated from anchor-to-anchor paths (Eq. (5)); the corrected path lengths are entered into a law-of-cosines formula (Eq. (6)) to infer the angle between the anchor-to-anchor line and the anchor-to-target line; and the final position is obtained by intersecting three directional rays with the bounding box. Simulations over three node densities (100, 200, and 500 nodes) with three anchors and zero RSSI noise report a mean error of 4.0478 m and an overall 72.4% improvement over Min-Max and RSSI-based DV-Hop.","tokens_in":9029,"tokens_out":8452,"duration_ms":83541,"significance":"If the angle-inference step were well-defined and the performance held under realistic RSSI noise, RAIL would be a useful low-cost localization baseline: it needs only three anchors, no extra hardware, and the inferred bearings could be combined with bounding-box constraints. The paper also argues that the method can adapt to other ranging techniques and could generate training data for AI-based localization, which is a plausible application. However, the current manuscript does not establish these claims: the central geometry in Eq. (6) is not fully specified, and the numerical evaluation removes the RSSI noise term that the introduction identifies as a key challenge. Because the same multi-hop RSSI distances are reused as the arguments of Eq. (6), it is unclear whether the angle estimate adds independent information beyond the corrected distances. The comparisons against Min-Max and an RSSI-DV-Hop baseline are reasonable in spirit, but without noise robustness tests, confidence intervals, or an independent check of the angle estimates, the quantitative claims are not yet supported.","major_comments":[{"comment":"The c edge is not a well-defined measurable quantity. The text defines c as 'the connection of nodes on a edge and b edge, the nodes located at the same hop distance from A1 via different routes to A2 and T' and says this is done 'for each hop index,' which yields multiple candidate c values, while Eq. (6) uses a single c. Moreover, the relay nodes on the two paths are arbitrary non-anchor nodes; their pairwise distance is not in general available from RSSI unless they are one-hop neighbors, and the hop count n used for the e·n correction on each of a, b, and c is never specified. As written, the angle-inference mechanism cannot be computed from data the network actually has, so the accuracy gain in Table III is not tied to a well-defined mechanism.","section":"III-B, Fig. 3, Eq. (6)"},{"comment":"The law of cosines is applied to quantities a, b, and c that, according to Fig. 3 and its caption, are multi-hop path lengths ('the segment formed by the first three nodes along the shortest path'), not straight-line Euclidean distances. For a law-of-cosines computation, the three quantities must be side lengths of a Euclidean triangle; path lengths generally do not form such a triangle. Even if the e·n correction is intended to turn path lengths into chord lengths, the paper does not derive this approximation or identify which physical nodes form the triangle vertices. This is a load-bearing gap in the derivation.","section":"III-B, Eq. (6), Fig. 3"},{"comment":"The RSSI noise variance σ² in Eq. (1) is set to zero for all experiments. This removes the very imperfection that makes RSSI localization challenging and that motivates the paper's introduction. No experiments with noise, no sensitivity analysis, and no confidence intervals or statistical tests (e.g., paired comparisons over the 50 runs) are reported; Fig. 5 and Table III therefore establish only that the algorithm works for deterministic path-loss measurements on random topologies, not that it is accurate for WSNs with noisy RSSI. In addition, the angle estimates produced by Eq. (6) are never compared against true angles, so the proposed angle-inference mechanism is not validated on its own.","section":"IV.A, Table II"},{"comment":"The average per-hop excess e is calibrated from anchor-to-anchor shortest paths and then applied, via e·n, to anchor-to-unknown edges in Eq. (6). The paper states that this transfer is suitable for nodes 'close to the anchor nodes' but gives no theoretical or empirical justification. Since per-hop excess depends on the local node distribution and the detour of each shortest path, a constant e estimated from three anchor pairs need not equal the excess on paths to arbitrary unknown nodes; a biased e would directly distort the corrected side lengths and the inferred angle.","section":"III-B, Eq. (5)"}],"minor_comments":[{"comment":"The text uses inconsistent spacing 'UA V' instead of 'UAV' in the abstract, title, and body; please standardize the notation.","section":"Throughout"},{"comment":"The sentence 'For example, the maximum observed error for Min-Max is 44.7166 meters. Its largest error reaches 36.8491 meters' is ambiguous: the second sentence appears to refer to RAIL rather than Min-Max, but the antecedent is unclear.","section":"IV-B"},{"comment":"The statement that RAIL's average error 'decreases by 47.16% as node count rises' is not directly visible in Table III; the rows used for this computation should be specified.","section":"IV-B"},{"comment":"The claimed 'overall performance improvement of 72.4%' is ambiguous: averaging Table III across the three node counts gives about 72.9% against Min-Max and 55.9% against DV-Hop, so the exact comparison underlying the 72.4% figure should be stated.","section":"V"},{"comment":"Eq. (1) is a standard log-distance path-loss model but has no citation, and the value of the reference distance d0 (presumably 1 m) is never stated explicitly for the simulations.","section":"II-A, Eq. (1)"},{"comment":"The text says 'The average of the three angles calculated using (6)' but only two angles, ∠A2A1T and ∠A3A1T, are explicitly described; the three angle computations should be enumerated.","section":"III-B"},{"comment":"The caption refers to 'the first three nodes' along each shortest path, while the text refers to 'for each hop index'; the description of which nodes define a, b, and c should be aligned.","section":"Fig. 3 caption"}],"recommendation":"reject","confidential_remarks":"The central difficulty is not a set of local presentation issues: the angle-inference step, which is the paper's main novelty, is under-specified to the point that the reported improvement in Table III cannot be traced to a computable mechanism. The zero-noise simulation design further removes the phenomenon the method is meant to address. If the authors can provide a precise algorithmic specification for the angle estimate, a derivation or validation of the per-hop correction transfer, and realistic noisy-channel experiments with proper statistical reporting, a substantially revised submission could be worth reconsidering."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear —,\n\nYou asked about RAIL (2506.00766). The paper proposes an RSSI-based localization method that infers angles from multi-hop distances, then uses those angles to reduce the uncertainty of a bounding-box estimate. In the zero-noise simulations it does beat Min-Max and RSSI-based DV-hop, and the per-hop error correction derived from anchor-to-anchor paths is a sensible idea. The tables are internally consistent, which is more than many papers offer.\n\nThe load-bearing flaw is the angle step. Eq. (6) applies the law of cosines with sides a, b, and c, but the c edge is not defined in a measurable way. The text describes it as the connection between nodes on the a path and the b path at the same hop distance from A1. Those two relay nodes may be many hops apart and have no direct link, so their RSSI distance is not available. If instead c is meant to be the A2–T distance, then the angle is just a re-encoding of distances already used in the bounding box, adding no independent information. Either reading leaves Eq. (6) uncomputable from the data a WSN can collect.\n\nOther soft spots: the noise variance is set to zero, so the test only measures path-bending error, not RSSI variability. The abstract's 72.4% improvement is true only versus Min-Max; against DV-hop the table says roughly 56%. The hop count n in Eq. (6) is applied to all three edges without explaining how each edge's hop count is obtained. No code, data, or confidence intervals are included.\n\nThe paper is not nonsense. The bounding-box part is standard, the writing is clear, and the reported numbers look like honest simulations. But the central mechanism is undefined, so the claimed gain is not anchored to a reproducible method.\n\nI would send this to peer review, because the flaw is fixable and a revised version could be a modest contribution. As it stands, I wouldn't cite it.\n\nRegards,","headline":"RAIL's headline accuracy gain rests on an angle-inference step that is not actually defined, so the paper's main claim is unsupported as written.","tokens_in":9542,"tokens_out":6430,"would_cite":false,"duration_ms":57640,"reading_group":"no","serious_thinker":"unclear","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"RAIL: an RSSI-only localization algorithm that infers angles from multi-hop distances and a bounding box, reporting a 72.4% average error reduction over Min-Max and RSSI-based DV-Hop.","keywords":["Unmanned Aerial Vehicle","UAV localization","Wireless Sensor Networks","RSSI ranging","Angle inference","Bounding box","Min-Max","DV-Hop"],"falsifier":"A direct test would be to run RAIL in a network where the unknown node lies behind an obstacle that forces a long detour, making its path from an anchor much more tortuous than the anchor-to-anchor paths. If the per-hop correction e from anchor paths does not transfer, the estimated angle at the anchor should deviate from the true bearing by more than the reported error distribution, and localization error should grow sharply with the detour asymmetry.","tokens_in":8548,"feed_emoji":"📡","tokens_out":3613,"duration_ms":30690,"temperature":0.7,"pith_summary":"The paper proposes RAIL, a localization algorithm for UAV and wireless sensor networks that estimates the angle between an unknown node and an anchor node using only RSSI distance measurements over multi-hop paths, then combines these angle estimates with a bounding box to determine the node's position. Without adding any hardware, RAIL is claimed to reduce average localization error by 72.4% compared to Min-Max and RSSI-based DV-Hop in a 50-by-50-meter area with only three anchor nodes, across three different node densities. The central claim is that the angle of a node relative to an anchor can be recovered from multi-hop RSSI distances by subtracting an average per-hop bending error, which makes the method both accurate and fast. A sympathetic reader would care because RSSI-only localization is widely deployable in hardware-constrained UAV swarms, where vision or LiDAR systems are expensive and fragile.","feed_headline":"RSSI angle inference shrinks UAV localization error by 72.4%","feed_subtitle":"An RSSI-only algorithm infers node angles from multi-hop paths and pinpoints nodes with a bounding box, no extra hardware.","key_machinery":"The central object is the average per-hop path-bending error e, defined in Equation (5) as the average excess of anchor-to-anchor shortest multi-hop distances over their true Euclidean distances, divided by the total hop count. This e is subtracted from each measured edge length before applying the law of cosines in Equation (6) to infer the angle. The resulting angular rays are then combined with the intersection bounding box from Equation (4) to produce the final position estimate.","core_discovery":"The paper's central discovery is that the angle between an unknown node T and an anchor A1 can be approximated by treating the shortest multi-hop RSSI paths from A1 to A2 and from A1 to T as sides a and b of a triangle, with the third side c connecting nodes at equal hop distances from A1 on the two paths. After subtracting an average per-hop error e (computed from anchor-to-anchor paths) from each edge length, the law of cosines yields the angle at A1. Repeating this for two anchors disambiguates the orientation, and the resulting three rays from the anchors toward T are intersected with the bounding box formed by the multi-hop distance ranges, giving the final position. The paper reports that RAIL reaches an average localization error of 4.0478 meters and outperforms both benchmarks by an overall 72.4%.","pith_inferences":["If the per-hop correction transfers reliably beyond the tested topologies, RAIL could be extended to three dimensions by replacing the anchor triangle with a tetrahedron and adding an elevation angle estimate.","A testable consequence of the method's assumption is that error should grow when anchor-to-unknown paths are much more tortuous than anchor-to-anchor paths; measuring this in obstacle-rich environments would bound the claim.","The reported 72.4% improvement is an average across three densities and would likely shrink in sparser networks or under realistic shadowing; testing in such conditions would clarify the practical range of the method."],"forward_implications":["RAIL's localization error decreases as node density increases: 5.77 meters at 100 nodes, 3.33 meters at 200 nodes, and 3.05 meters at 500 nodes.","RAIL requires no additional hardware on nodes and works with RSSI alone, making it compatible with any distance-based ranging method.","The bounding-box constraint keeps the estimate within physical communication range, limiting the large outliers seen with Min-Max when all anchors are on the same side of the unknown node.","RAIL can extract directional information from RSSI, which the paper says is useful for AI model training, data generation, and baseline evaluation."],"supporting_citations":[{"why":"Supplies the RSSI path-loss model used to estimate one-hop distances between nodes.","marker":"[15]"},{"why":"Frames the range-free versus range-based distinction that motivates combining hop counts with RSSI.","marker":"[14]"},{"why":"Is the RSSI-based DV-Hop baseline that RAIL improves on.","marker":"[21]"},{"why":"Provides a weighted bounding-box Min-Max variant whose bounding-box idea RAIL refines.","marker":"[20]"}],"fun_headline_variants":["RSSI angles cut UAV localization error by 72.4%","No extra hardware: RAIL slashes UAV location error","RAIL: infer angles, shrink UAV location error","RSSI-only angle trick improves UAV localization 72%"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The angle correction assumes that the average per-hop path-bending error e, measured between anchor nodes, applies equally to the paths from anchors to the unknown node, and that the corrected edge lengths form a triangle whose angle matches the true angle to the target; the paper states this rather than deriving it.","fun_headline_variants_meta":{"raw":{"variants":["RSSI angles cut UAV localization error by 72.4%","No extra hardware: RAIL slashes UAV location error","RAIL: infer angles, shrink UAV location error","RSSI-only angle trick improves UAV localization 72%"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000742,"raw_usage":{"total_tokens":3273,"prompt_tokens":869,"completion_tokens":2404,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":485,"completion_tokens_details":{"reasoning_tokens":2334}},"tokens_in":485,"tokens_out":2404,"duration_ms":16461,"temperature":1.0,"reasoning_tokens":2334,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T11:58:21.570836+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct test would be to run RAIL in a network where the unknown node lies behind an obstacle that forces a long detour, making its path from an anchor much more tortuous than the anchor-to-anchor paths. If the per-hop correction e from anchor paths does not transfer, the estimated angle at the anchor should deviate from the true bearing by more than the reported error distribution, and localization error should grow sharply with the detour asymmetry.","supporting_citations":[{"cited_title":"& Pei, C","cited_arxiv_id":null,"evidence_quote":"Supplies the RSSI path-loss model used to estimate one-hop distances between nodes."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Frames the range-free versus range-based distinction that motivates combining hop counts with RSSI."},{"cited_title":"Peyvandi and A","cited_arxiv_id":null,"evidence_quote":"Is the RSSI-based DV-Hop baseline that RAIL improves on."},{"cited_title":"Shi and L","cited_arxiv_id":null,"evidence_quote":"Provides a weighted bounding-box Min-Max variant whose bounding-box idea RAIL refines."}],"review_version":1}