Pith. sign in

REVIEW 4 major objections 5 minor 52 references

Optimizing Global Quantum Communication via Satellite Constellations

T0 review · 4 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims that a constellation with equatorial quantum relays and Molniya-orbit relays can provide continuous, lower-latency global QKD coverage.

desk verdict Interesting Molniya-relay idea, but the central claims are asserted rather than demonstrated and the one quantitative result rests on a two-point fit and an impossible elevation angle. read the letter →

arxiv 2501.00280 v1 pith:NWCNMMFW submitted 2024-12-31 quant-ph cs.ET

Yichen Gao , Guanqun Song , Ting Zhu This is my paper · ORCID
classification quant-phcs.ET
keywords quantumkeydistributionsatelliteconstellationMolniyaorbitrelaylinkefficiencymodelglobalnetworkorbitalmechanicsphotontransmissionoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that satellite constellation design, not just per-link physics, is what determines whether global quantum key distribution can work in practice. The authors propose a small equatorial ring of two to three quantum relay satellites so at least one relay is always well positioned for any ground station, and they argue that placing relays in Molniya orbits makes each satellite linger over a targeted hemisphere, extending the network's reach. They also propose judging a satellite's usefulness by total photons delivered over one full orbit rather than peak instantaneous rate, and their fitted model indicates that in the 400–1200 km range lower altitudes give more total transmission. A sympathetic reader would care because, if true, global secure communication would need only a handful of satellites, and the choice of orbit would become a first-order design lever.

What carries the argument

The central objects are the Molniya orbit, a highly eccentric orbit whose long apogee dwell keeps a relay over one hemisphere for most of its period, and the quantum relay satellite, which forwards photons between orbits and is therefore not constrained by atmospheric loss. The quantitative machinery is a linear fit to two published satellite-to-ground link-efficiency measurements, used to convert slant distance into a key-generation rate $T(t)=T_0 10^{(s D(t)-D_0)/10}$, integrated over the time window when the elevation angle falls in the claimed effective range of 20 to 160 degrees to give total photon pairs per orbit. This integral is what produces the paper's altitude-versus-total-transmission result.

What would settle it

Compare the paper's linear link-efficiency model against a third independent satellite-to-ground QKD measurement at an intermediate altitude, say 800 km. The model predicts a specific key rate; if the measured rate deviates by more than the model's stated fit error, the central quantitative claim fails. A simpler check: the paper states an effective elevation-angle range of 20 to 160 degrees, but elevation angle from a ground station cannot exceed 90 degrees, so demonstrating a real link at any angle above 90 would refute the geometric setup directly.

Watch

Extended reading notes

Core claim

The central claim is that a global QKD network can be made continuous and low-latency by separating two roles: service satellites that fly low for efficient ground links, and relay satellites that carry photons between orbits. The paper asserts that two to three equatorial relay satellites provide continuous coverage, so a ground station never waits for a satellite to come back around, and that Molniya-orbit relays, by dwelling over one hemisphere, maximize the time the network is present over that hemisphere. It further claims that total photon pairs transmitted per orbital period falls as altitude rises from 400 to 1200 km, and this is presented as the basis for choosing where to place the service satellites.

Load-bearing premise

The argument rests on assuming that the link efficiency measured at two published satellite altitudes (645 km and 1200 km) can be extended as a single linear relation to every distance and altitude used in the simulations; if that extrapolation is wrong, the computed transmission trends and the altitude recommendation collapse.

Editorial extensions

If this is right

  • A global QKD service could be built with only a handful of satellites: two or three equatorial relays plus a few Molniya-orbit relays, instead of a large low-Earth-orbit constellation.
  • Transmission delays between distant ground stations would drop from minutes-to-hours to the time needed for an inter-satellite relay hop, because a relay is always in view.
  • Satellite operators would optimize for total key material per orbit rather than peak instantaneous rate, changing how constellation altitudes and phases are chosen.
  • Lower-altitude satellites, near 400 km, would be preferred for ground-facing QKD links within the model's assumed range, which affects drag and station-keeping requirements.
  • Intersatellite links between relay and service satellites would carry most of the distance, where atmospheric losses do not apply, potentially making the global network's loss budget more favorable.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural test of the Molniya proposal would be a simulation comparing total daily key material for a Molniya relay versus a circular orbit at the same apogee; the paper does not provide that comparison, but the dwell-time argument suggests the Molniya design should win by hours of extra contact per day.
  • The same high-eccentricity strategy could be applied to entanglement distribution or measurement-device-independent QKD protocols, where the relay stores one half of an entangled pair until the second ground station comes into view.
  • If the model's elevation-angle range is corrected (angles above 90 degrees are geometrically impossible), the effective time window and the altitude-versus-total-photon trade-off would need recomputation; the qualitative preference for lower altitudes might survive, but the exact recommendation would change.
  • The paper's clustering step could be extended to dynamic ground-station traffic, where satellites are assigned to clusters based on demand rather than fixed geography, potentially reducing the number of required relay satellites further.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes an architecture for global quantum key distribution using satellite constellations, centered on two ideas: clustering ground cities with DBSCAN to position satellites, and using quantum relay satellites in Molniya orbits (plus 2-3 equatorial relays) to improve coverage and reduce latency. The quantitative part of the paper models satellite-to-ground link efficiency with a linear fit to two measurements from the Micius experiment, integrates the resulting generation rate over one circular orbital pass, and reports that total transmitted bits decrease with altitude. The central architectural claims about Molniya orbits and relay constellations, however, are stated qualitatively.

Significance. If the claimed constellation benefits were quantitatively established, the proposed design would be a useful contribution to satellite-based QKD network planning. The paper, however, provides no reproducible simulation, no code, no machine-checked derivations, and no validated link model. Its only numerical result is built on a two-point linear extrapolation and appears to rely on a geometrically impossible elevation-angle range. The manuscript is best read as a qualitative architectural proposal; the load-bearing quantitative and network-level claims are not supported in the present form.

major comments (4)
  1. [§II-C, Eq. (1)] The link-efficiency model is fitted to only two data points from Liao et al. [10] (12 kbits at 645 km and 1 kbit at 1200 km) and is then used to compute T(t) and the total photon transmission for all altitudes and slant ranges in the simulation. Two points cannot constrain a linear model, no uncertainty or validation is provided, and the model omits relevant physical factors such as atmospheric turbulence, pointing error, background noise, and pass geometry. The numerical result in Fig. 3 is therefore determined by an unvalidated extrapolation. In addition, the parameters 'slope efficiency', D, D0, and T0 are never given numerical values, so Eq. (1) is not reproducible.
  2. [§II-D, §II-E, Eq. (2)] The paper defines the effective elevation-angle communication range as 20 to 160 degrees, but the elevation angle of a ground station observing a satellite is bounded above by 90 degrees. This makes the integration limits t1 and t2 in Eq. (2) geometrically ill-defined. The statement in §II-E that the satellite 'invariably passes directly above the ground station' applies only to a special pass geometry and is not connected to the actual city clusters or to the Molniya-orbit analysis, so the computed total photon count cannot be interpreted as a general coverage metric.
  3. [§III and Abstract] The paper's central architectural claims—that Molniya-orbit relay satellites extend operational presence over targeted hemispheres and that 2-3 equatorial relay satellites provide continuous coverage and significantly reduce transmission delays—are stated without any supporting orbital propagation, coverage-interval calculation, elevation-angle time series, intersatellite link budget, or latency model. Section III only asserts these benefits qualitatively; the quantitative model in Section II is for a single circular-orbit pass over one ground station and is never linked to the proposed relay network. The main claimed advantages of the constellation are therefore not demonstrated.
  4. [§II-A] The clustering section reports that DBSCAN with eps=400 km 'successfully grouped' 15 cities into 12 clusters with 'each city within a 250 km radius of every other city,' but no city list, coordinates, min_samples value, or cluster output is provided. With 15 cities and 12 clusters, most clusters are singletons, which does not support the stated motivation of using fewer satellites to cover multiple ground stations, and the inconsistency between eps=400 km and the claimed 250-km radius is unexplained.
minor comments (5)
  1. [§I] Reference [9] appears twice in succession ('[9], [9]'), and the phrase 'secret key shengcheng' should be 'secret key generation.'
  2. [§II-D] Figures 1 and 2 are referenced and described, but no actual plots or numerical values are included in the manuscript text, so the claimed experimental analysis cannot be independently checked.
  3. [§II-C] The sentence 'D is the original data points in the Micius Satellite's experiment data' is unclear, and the equation LE = slope efficiency × (distance − D) mixes units if LE is expressed in dB; all symbols and units should be defined explicitly.
  4. [§IV] The 'Future Work' section contains a large block of references to wireless networking and security papers that are not connected to the presented technical content; the manuscript should either tie this material to the proposed work or remove it.
  5. [§I] The reference to 'Nitish' should use a formal surname or citation consistent with the bibliography, and 'Nitish's work' is too informal for a journal submission.

Circularity Check

1 steps flagged · score 6.0 of 10

Total-photon trend is just the two-point linear fit; Molniya/relay claims are asserted, not derived.

  1. fitted input called prediction [Section II-C (Channel Loss and Quantum Generation Rate Models); Section II-E (Eqs. (1)-(2), Fig. 3)]
    "Liao et al [10].'s work indicates that the communication efficiency of satellites varies linearly with altitude, with recorded efficiencies of 12 Kbits at 645 km and 1 Kbit at 1200 km. Utilizing this data, we can fit a model to predict the QKD link efficiency (in dB) for any given distance... The instantaneous transmission rate, T (t), depends on the time-variable distance between the satellite and the ground station, D(t), and is given by: T (t) = T0 × 10^{s·D(t)−D0}/10 (1)... Total Photon Pairs = Z t2 t1 T (t) dt (2)"

    The model in Eq. (1) is the same two-point linear fit from Section II-C, with T0, D0, and slope s obtained from the two Micius data points (12 kbit at 645 km, 1 kbit at 1200 km). Section II-E integrates exactly this T(t) over an orbital period to produce 'Total Transmission Bits vs Altitudes' (Fig. 3) and concludes that 'there is a notable decrease in total transmitted bits with increasing altitude.' That decrease is not an independent prediction of the orbital model; it is the monotonic decrease of the fitted line evaluated at larger slant ranges. No new data, physics, or benchmark enters between the fit and the conclusion, so the reported altitude trend reduces by construction to the fitted input.

full rationale

The paper contains one clear circular step: the quantitative result of Section II-E, the decrease of total transmitted photons with altitude, is obtained by integrating Eq. (1), which is exactly the linear link-efficiency model fitted to two experimental points in Section II-C. Thus the 'prediction' is the fit. The paper's central constellation claims (Molniya orbits extending operational presence; 2-3 equatorial relays ensuring continuous coverage and reduced latency) are not circular: they are unsupported assertions without orbital propagation, coverage, or latency analysis, which is a correctness/evidence failure rather than a circularity under the rubric. The extensive self-citations [21]-[52] appear only in Future Work and are not load-bearing. Score 6 rather than higher because the fitted-input circularity affects the paper's secondary numerical trend, while the headline architecture claim is merely unsubstantiated, not self-referential.

Assumptions & free parameters 5 free parameters · 6 assumptions · 1 invented entities

The analysis rests on a two-point linear fit for link efficiency, an ad hoc and geometrically impossible elevation-angle range, and a simplifying assumption that satellites pass directly over ground stations. The Molniya relay constellation is proposed without an orbiting model. The cluster analysis is under-specified. These commitments are not validated by independent data.

free parameters (5)
  • link_efficiency_slope (slope efficiency) = not reported (derived from 12 kbits at 645 km and 1 kbit at 1200 km)
    Linear slope in the link efficiency equation in Section II-C; fitted from two data points from Liao et al. [10] and used in Eq. (1) to compute generation rates.
  • reference_distance D0 (D in the paper) = not reported (reference distance of Micius experiment)
    Reference distance used in the link efficiency formula in Section II-C and Eq. (1); determined from the cited experiment, not from independent first principles.
  • baseline generation rate T0 = not reported
    Baseline key generation rate when the satellite is at the reference distance D0; taken from Liao et al. [10] and used in Eq. (1).
  • effective elevation angle thresholds (20 and 160 degrees) = 20 to 160 degrees
    Chosen by hand after inspecting the model output in Section II-D; the upper bound 160 degrees is geometrically impossible for a ground-station elevation angle, indicating an ad hoc definition.
  • DBSCAN eps (400 km) and claimed cluster radius (250 km) = 400 km / 250 km
    Distance threshold for city clustering in Section II-A; chosen by hand and inconsistent between the algorithm parameter and the reported cluster property.
assumptions (6)
  • domain assumption The link efficiency varies linearly with distance from the ground station over the whole range of altitudes and geometries considered (400-1200 km).
    Stated in Section II-C: 'the communication efficiency of satellites varies linearly with altitude', fitted from two points and extrapolated without supporting evidence.
  • ad hoc to paper A satellite can effectively communicate with a ground station when the elevation angle is between 20 and 160 degrees.
    Defined in Section II-D after observing low key rates below 20 degrees; the range is not physically derived and the upper bound is geometrically impossible.
  • ad hoc to paper The satellite passes directly above the ground station, so the elevation angle reaches 90 degrees, and the integration bounds t1 to t2 are well-defined.
    Assumed in Section II-E to compute total transmitted photons over one orbital period; not true for arbitrary ground station satellite geometries.
  • domain assumption Quantum relay satellites can perform inter-satellite photon transmission with negligible atmospheric loss, so higher altitude is beneficial for relay links.
    Asserted in Section III without quantitative modeling of inter-satellite links, pointing losses, or quantum repeater performance.
  • domain assumption Ground stations and the satellite network can be synchronized for precise timing, which is needed for efficient QKD.
    Stated in Section I as an assumption, but no synchronization error budget or clock model is provided.
  • standard math The orbital period formula T = 2π sqrt((R+h)^3/GM) describes the satellite dynamics.
    Kepler's third law applied in Section II-B; standard and correct for circular orbits.
invented entities (1)
  • Molniya-orbit quantum relay satellite constellation
    purpose: To extend operational presence over targeted hemispheres and relay photons between quantum satellites on different orbits, reducing inter-satellite latency and ground-station wait times.
    Introduced as the paper's core contribution (Section I and Section III), but no orbital simulation, feasibility study, or quantitative performance analysis is provided.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Optimizing Global Quantum Communication via Satellite Constellations." pith.science (2026). https://pith.science/paper/NWCNMMFW

@misc{pith2026250100280,
  author       = {Pith},
  title        = {Pith review of: Optimizing Global Quantum Communication via Satellite Constellations},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NWCNMMFW}},
  note         = {Machine review of arXiv:2501.00280}
}
read the original abstract

In this paper, we investigate the optimization of global quantum communication through satellite constellations. We address the challenge of quantum key distribution (QKD) across vast distances and the limitations posed by terrestrial fiber-optic networks. Our research focuses on the configuration of satellite constellations to improve QKD between ground stations and the application of innovative orbital mechanics to reduce latency in quantum information transfer. We introduce a novel approach using quantum relay satellites in Molniya orbits, enhancing communication efficiency and coverage. The use of these high eccentricity orbits allows us to extend the operational presence of satellites over targeted hemispheres, thus maximizing the quantum network's reach. Our findings provide a strategic framework for deploying quantum satellites and relay systems to achieve a robust and efficient global quantum communication network.

Figures

Figures reproduced from arXiv: 2501.00280 by the authors.

Figure 2
Figure 2. Key Generation Rate vs Slant Range [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 1
Figure 1. Key Generation Rate vs Elevation Angle As depicted in [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 3
Figure 3. Total Transmission Bits vs Altitudes As shown in [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

52 extracted references · 50 canonical work pages

  1. [10]

    Satellite- to-ground quantum key distribution

    Sheng-Kai Liao, Wen-Qi Cai, Wei-Yue Liu, Liang Zhang, Yang Li, Ji- Gang Ren, Juan Yin, Qi Shen, Yuan Cao, Zheng-Ping Li, et al. Satellite- to-ground quantum key distribution. Nature, 549(7670):43–47, 2017

    work page 2017

  2. [1]

    C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing , page 175, India, 1984

    work page 1984

  3. [2]

    Simple proof of security of the bb84 quantum key distribution protocol

    Peter W Shor and John Preskill. Simple proof of security of the bb84 quantum key distribution protocol. Physical review letters , 85(2):441, 2000

    work page 2000

  4. [3]

    Ground- to-satellite quantum teleportation

    Ji-Gang Ren, Ping Xu, Hai-Lin Yong, Liang Zhang, Sheng-Kai Liao, Juan Yin, Wei-Yue Liu, Wen-Qi Cai, Meng Yang, Li Li, et al. Ground- to-satellite quantum teleportation. Nature, 549(7670):70–73, 2017

    work page 2017

  5. [4]

    Quantum communication

    Nicolas Gisin and Rob Thew. Quantum communication. Nature photonics, 1(3):165–171, 2007

    work page 2007

  6. [5]

    Quantum cryptography based on bell’s theorem

    Artur K Ekert. Quantum cryptography based on bell’s theorem. Physical review letters, 67(6):661, 1991

    1991

  7. [6]

    Overcoming the rate–distance limit of quantum key distribution without quantum repeaters

    Marco Lucamarini, Zhiliang L Yuan, James F Dynes, and Andrew J Shields. Overcoming the rate–distance limit of quantum key distribution without quantum repeaters. Nature, 557(7705):400–403, 2018

    2018

  8. [7]

    Gaussian quantum information

    Christian Weedbrook, Stefano Pirandola, Ra ´ul Garc´ıa-Patr´on, Nicolas J Cerf, Timothy C Ralph, Jeffrey H Shapiro, and Seth Lloyd. Gaussian quantum information. Reviews of Modern Physics , 84(2):621, 2012

    work page 2012

Show all 52 references
  1. [8]

    Quantum cryptography

    Nicolas Gisin, Gr ´egoire Ribordy, Wolfgang Tittel, and Hugo Zbinden. Quantum cryptography. Reviews of modern physics , 74(1):145, 2002

    2002

  2. [9]

    Measurement-device-independent quantum key distribution over 200 km

    Yan-Lin Tang, Hua-Lei Yin, Si-Jing Chen, Yang Liu, Wei-Jun Zhang, Xiao Jiang, Lu Zhang, Jian Wang, Li-Xing You, Jian-Yu Guan, et al. Measurement-device-independent quantum key distribution over 200 km. Physical review letters, 113(19):190501, 2014

    2014

  3. [11]

    Satellite-based en- tanglement distribution over 1200 kilometers

    Juan Yin, Yuan Cao, Yu-Huai Li, Sheng-Kai Liao, Liang Zhang, Ji-Gang Ren, Wen-Qi Cai, Wei-Yue Liu, Bo Li, Hui Dai, et al. Satellite-based en- tanglement distribution over 1200 kilometers. Science, 356(6343):1140– 1144, 2017

    2017

  4. [12]

    Satellite-relayed intercontinental quantum network

    Sheng-Kai Liao, Wen-Qi Cai, Johannes Handsteiner, Bo Liu, Juan Yin, Liang Zhang, Dominik Rauch, Matthias Fink, Ji-Gang Ren, Wei-Yue Liu, et al. Satellite-relayed intercontinental quantum network. Physical review letters, 120(3):030501, 2018

    2018

  5. [13]

    An integrated space-to-ground quantum communication network over 4,600 kilometres

    Yu-Ao Chen, Qiang Zhang, Teng-Yun Chen, Wen-Qi Cai, Sheng-Kai Liao, Jun Zhang, Kai Chen, Juan Yin, Ji-Gang Ren, Zhu Chen, et al. An integrated space-to-ground quantum communication network over 4,600 kilometres. Nature, 589(7841):214–219, 2021

    2021

  6. [14]

    Blockwise key distillation in satellite-based quantum key distribution

    Minu J Bae, Nitish K Panigrahy, Prajit Dhara, Walter O Krawec, Alexander Russell, Don Towsley, and Bing Wang. Blockwise key distillation in satellite-based quantum key distribution. arXiv preprint arXiv:2307.04300, 2023

    2023 arXiv

  7. [15]

    Satellite-based quantum information networks: use cases, architecture, and roadmap

    Laurent de Forges de Parny, Olivier Alibart, Julien Debaud, Sacha Gressani, Alek Lagarrigue, Anthony Martin, Alexandre Metrat, Matteo Schiavon, Tess Troisi, Eleni Diamanti, et al. Satellite-based quantum information networks: use cases, architecture, and roadmap. Communi- cati...

    2023

  8. [16]

    Fea- sibility of satellite-to-ground continuous-variable quantum key distribu- tion

    Daniele Dequal, Luis Trigo Vidarte, Victor Roman Rodriguez, Giuseppe Vallone, Paolo Villoresi, Anthony Leverrier, and Eleni Diamanti. Fea- sibility of satellite-to-ground continuous-variable quantum key distribu- tion. npj Quantum Information , 7(1):3, 2021

    2021

  9. [17]

    Optimal entanglement distribution using satellite based quantum networks

    Nitish K Panigrahy, Prajit Dhara, Don Towsley, Saikat Guha, and Leandros Tassiulas. Optimal entanglement distribution using satellite based quantum networks. In IEEE INFOCOM 2022-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pages 1–6. IEEE, 2022

    2022

  10. [18]

    Spooky action at a global distance: analysis of space-based entanglement distribution for the quantum internet

    Sumeet Khatri, Anthony J Brady, Ren ´ee A Desporte, Manon P Bart, and Jonathan P Dowling. Spooky action at a global distance: analysis of space-based entanglement distribution for the quantum internet. npj Quantum Information, 7(1):4, 2021

    2021

  11. [19]

    Quantum repeaters based on entanglement purification

    Wolfgang D ¨ur, H-J Briegel, J Ignacio Cirac, and Peter Zoller. Quantum repeaters based on entanglement purification. Physical Review A , 59(1):169, 1999

    1999

  12. [20]

    A networking perspective on starlink’s self-driving leo mega-constellation

    Yuanjie Li, Hewu Li, Wei Liu, Lixin Liu, Wei Zhao, Yimei Chen, Jian- ping Wu, Qian Wu, Jun Liu, Zeqi Lai, et al. A networking perspective on starlink’s self-driving leo mega-constellation. In Proceedings of the 29th Annual International Conference on Mobile Computing and Netwo...

    2023

  13. [21]

    Key establishment for secure asymmetric cross-technology communication

    Wei Wang, Xin Liu, Zicheng Chi, Stuart Ray, and Ting Zhu. Key establishment for secure asymmetric cross-technology communication. In Proceedings of the 19th ACM Asia Conference on Computer and Communications Security , ASIA CCS ’24, page 412–422, New York, NY , USA, 2024. Asso...

    2024

  14. [22]

    Ml-based secure low-power communica- tion in adversarial contexts, 2022

    Guanqun Song and Ting Zhu. Ml-based secure low-power communica- tion in adversarial contexts, 2022

    2022

  15. [23]

    A secured protocol for iot devices in tactical networks

    Wei Wang, Zicheng Chi, Xin Liu, Ananth Vishnu Bhaskar, Ankit Baingane, Ryan Jahnige, Qingquan Zhang, and Ting Zhu. A secured protocol for iot devices in tactical networks. In MILCOM 2022 - 2022 IEEE Military Communications Conference (MILCOM) , pages 43–48, 2022

    2022

  16. [24]

    Collision-free dynamic convergecast in low-duty-cycle wireless sensor networks

    Long Cheng, Linghe Kong, Yu Gu, Jianwei Niu, Ting Zhu, Cong Liu, Shahid Mumtaz, and Tian He. Collision-free dynamic convergecast in low-duty-cycle wireless sensor networks. IEEE Transactions on Wireless Communications, 21(3):1665–1680, 2022

    2022

  17. [25]

    Simultaneous bi-directional communications and data forwarding using a single zigbee data stream

    Zicheng Chi, Yan Li, Hongyu Sun, Zhichuan Huang, and Ting Zhu. Simultaneous bi-directional communications and data forwarding using a single zigbee data stream. IEEE/ACM Transactions on Networking , 29(2):821–833, 2021

    2021

  18. [26]

    Leveraging ambient lte traffic for ubiquitous passive communication

    Zicheng Chi, Xin Liu, Wei Wang, Yao Yao, and Ting Zhu. Leveraging ambient lte traffic for ubiquitous passive communication. In Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Pro...

    2020

  19. [27]

    Cdd: Coordinating data dissemination in heterogeneous iot networks

    Yan Pan, Shining Li, Bingqi Li, Yu Zhang, Zhe Yang, Bin Guo, and Ting Zhu. Cdd: Coordinating data dissemination in heterogeneous iot networks. IEEE Communications Magazine , 58(6):84–89, 2020

    2020

  20. [28]

    Wire: Security bootstrapping for wireless device-to- device communication

    Yinrong Tao, Sheng Xiao, Bin Hao, Qingquan Zhang, Ting Zhu, and Zhuo Chen. Wire: Security bootstrapping for wireless device-to- device communication. In 2020 IEEE Wireless Communications and Networking Conference (WCNC) , pages 1–7, 2020

    2020

  21. [29]

    Parallel inclusive communication for connecting heterogeneous iot devices at the edge

    Zicheng Chi, Yan Li, Xin Liu, Yao Yao, Yanchao Zhang, and Ting Zhu. Parallel inclusive communication for connecting heterogeneous iot devices at the edge. In Proceedings of the 17th Conference on Embedded Networked Sensor Systems , SenSys ’19, page 205–218, New York, NY , USA,...

    2019

  22. [30]

    Crf: Coexistent routing and flooding using wifi packets in heterogeneous iot networks

    Wei Wang, Xin Liu, Yao Yao, Yan Pan, Zicheng Chi, and Ting Zhu. Crf: Coexistent routing and flooding using wifi packets in heterogeneous iot networks. In IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, pages 19–27, 2019

    2019

  23. [31]

    Concur- rent cross-technology communication among heterogeneous iot devices

    Zicheng Chi, Yan Li, Hongyu Sun, Yao Yao, and Ting Zhu. Concur- rent cross-technology communication among heterogeneous iot devices. IEEE/ACM Transactions on Networking , 27(3):932–947, 2019

    2019

  24. [32]

    Passive-zigbee: Enabling zigbee communication in iot networks with 1000x+ less power con- sumption

    Yan Li, Zicheng Chi, Xin Liu, and Ting Zhu. Passive-zigbee: Enabling zigbee communication in iot networks with 1000x+ less power con- sumption. In Proceedings of the 16th ACM Conference on Embedded Networked Sensor Systems , SenSys ’18, page 159–171, New York, NY , USA, 2018. ...

    2018

  25. [33]

    Chiron: Concurrent high throughput communication for iot devices

    Yan Li, Zicheng Chi, Xin Liu, and Ting Zhu. Chiron: Concurrent high throughput communication for iot devices. In Proceedings of the 16th Annual International Conference on Mobile Systems, Applications, and Services, MobiSys ’18, page 204–216, New York, NY , USA, 2018. Associat...

    2018

  26. [34]

    Ect: Exploiting cross- technology concurrent transmission for reducing packet delivery delay in iot networks

    Wei Wang, Tiantian Xie, Xin Liu, and Ting Zhu. Ect: Exploiting cross- technology concurrent transmission for reducing packet delivery delay in iot networks. In IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, pages 369–377, 2018

    2018

  27. [35]

    Pmc: Parallel multi- protocol communication to heterogeneous iot radios within a single wifi channel

    Zicheng Chi, Yan Li, Yao Yao, and Ting Zhu. Pmc: Parallel multi- protocol communication to heterogeneous iot radios within a single wifi channel. In 2017 IEEE 25th International Conference on Network Protocols (ICNP), pages 1–10, 2017

    2017

  28. [36]

    Emf: Embedding multiple flows of information in existing traffic for concurrent communication among heterogeneous iot devices

    Zicheng Chi, Zhichuan Huang, Yao Yao, Tiantian Xie, Hongyu Sun, and Ting Zhu. Emf: Embedding multiple flows of information in existing traffic for concurrent communication among heterogeneous iot devices. In IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, pages...

    2017

  29. [37]

    Enabling lte and wifi coexisting in 5ghz for efficient spectrum utilization

    Hongyu Sun, Zhiyi Fang, Qun Liu, Zheng Lu, and Ting Zhu. Enabling lte and wifi coexisting in 5ghz for efficient spectrum utilization. Journal of Computer Networks and Communications , 2017(1):5156164, 2017

    2017

  30. [38]

    High-granularity modulation for ofdm backscatter

    Xin Liu, Zicheng Chi, Wei Wang, Yao Yao, Pei Hao, and Ting Zhu. High-granularity modulation for ofdm backscatter. IEEE/ACM Transac- tions on Networking , 32(1):338–351, 2024

    2024

  31. [39]

    LightThief: Your optical communication information is stolen behind the wall

    Xin Liu, Wei Wang, Guanqun Song, and Ting Zhu. LightThief: Your optical communication information is stolen behind the wall. In 32nd USENIX Security Symposium (USENIX Security 23) , pages 5325–5339, Anaheim, CA, August 2023. USENIX Association

    2023

  32. [40]

    Interference-negligible privacy- preserved shield for rf sensing

    Yao Yao, Yan Li, and Ting Zhu. Interference-negligible privacy- preserved shield for rf sensing. IEEE Transactions on Mobile Com- puting, 23(5):3576–3588, 2024

    2024

  33. [41]

    PhyAuth: Physical-Layer message authentication for ZigBee networks

    Ang Li, Jiawei Li, Dianqi Han, Yan Zhang, Tao Li, Ting Zhu, and Yanchao Zhang. PhyAuth: Physical-Layer message authentication for ZigBee networks. In 32nd USENIX Security Symposium (USENIX Secu- rity 23), pages 1–18, Anaheim, CA, August 2023. USENIX Association

    2023

  34. [42]

    Countering cross-technology jamming attack

    Zicheng Chi, Yan Li, Xin Liu, Wei Wang, Yao Yao, Ting Zhu, and Yanchao Zhang. Countering cross-technology jamming attack. In Proceedings of the 13th ACM Conference on Security and Privacy in Wireless and Mobile Networks , WiSec ’20, page 99–110, New York, NY , USA, 2020. Assoc...

    2020

  35. [43]

    I can see the light: Attacks on autonomous vehicles using invisible lights

    Wei Wang, Yao Yao, Xin Liu, Xiang Li, Pei Hao, and Ting Zhu. I can see the light: Attacks on autonomous vehicles using invisible lights. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security , CCS ’21, page 1930–1944, New York, NY , USA, 2021...

    2021

  36. [44]

    Mailleak: Obfuscation-robust character extraction using transfer learning

    Wei Wang, Zeyu Ning, Hugues Iradukunda, Qingquan Zhang, Ting Zhu, and Ping Yi. Mailleak: Obfuscation-robust character extraction using transfer learning. In 2021 IEEE/ACM Symposium on Edge Computing (SEC), pages 459–464, 2021

    2021

  37. [45]

    Deep learning-guided jamming for cross-technology wireless networks: Attack and defense

    Dianqi Han, Ang Li, Lili Zhang, Yan Zhang, Jiawei Li, Tao Li, Ting Zhu, and Yanchao Zhang. Deep learning-guided jamming for cross-technology wireless networks: Attack and defense. IEEE/ACM Transactions on Networking , 29(5):1922–1932, 2021

    1922

  38. [46]

    Benchmarking machine learning: How fast can your algorithms go?, 2021

    Zeyu Ning, Hugues Nelson Iradukunda, Qingquan Zhang, and Ting Zhu. Benchmarking machine learning: How fast can your algorithms go?, 2021

    2021

  39. [47]

    Genpass: A multi-source deep learning model for password guessing

    Zhiyang Xia, Ping Yi, Yunyu Liu, Bo Jiang, Wei Wang, and Ting Zhu. Genpass: A multi-source deep learning model for password guessing. IEEE Transactions on Multimedia , 22(5):1323–1332, 2020

    2020

  40. [48]

    Detection for pulmonary nodules using rgb channel superposition method in deep learning framework

    Yishuang Meng, Ping Yi, Xuejun Guo, Wen Gu, Xin Liu, Wei Wang, and Ting Zhu. Detection for pulmonary nodules using rgb channel superposition method in deep learning framework. In 2018 Third International Conference on Security of Smart Cities, Industrial Control System and Com...

    2018

  41. [49]

    Genpass: A general deep learning model for password guessing with pcfg rules and adversarial generation

    Yunyu Liu, Zhiyang Xia, Ping Yi, Yao Yao, Tiantian Xie, Wei Wang, and Ting Zhu. Genpass: A general deep learning model for password guessing with pcfg rules and adversarial generation. In 2018 IEEE International Conference on Communications (ICC) , pages 1–6, 2018

    2018

  42. [50]

    Computer vision based parking optimization system, 2022

    Siddharth Chandrasekaran, Jeffrey Matthew Reginald, Wei Wang, and Ting Zhu. Computer vision based parking optimization system, 2022

    2022

  43. [51]

    Machine learning and artificial intelligence in next-generation wireless network, 2021

    Wafeeq Iqbal, Wei Wang, and Ting Zhu. Machine learning and artificial intelligence in next-generation wireless network, 2021

    2021

  44. [52]

    Endogenous security defense against deductive attack: When artificial intelligence meets active defense for online service

    Yan Pan, Shining Li, Bingqi Li, Yu Zhang, Zhe Yang, Bin Guo, and Ting Zhu. Endogenous security defense against deductive attack: When artificial intelligence meets active defense for online service. IEEE Communications Magazine, 58(6):84–89, 2020

    2020

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.