A Particle-Based Multiuser Communication with a Budget Limit

arXiv:2611.07171 · eess.SP · Submitted 2026-11-04 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.

Rosa: We're looking at the paper: "A Particle-Based Multiuser Communication with a Budget Limit".

Dev: Here's the gist of the paper. Multiuser networks can aggregate local observations through a shared receiver In this paper, we study the particle budget required to recover the exact sum of binary inputs in a multiuser network The minimum budget grows quadratically with the number of transmitters when the symbol duration and target error probability are fixed, even when the receiver observes all particle arrival times Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme Pruning redundant reasoning tokens The paper investigates the particle budget necessary for exact counting in a particle-based multiuser communication network where transmitters send independent bits, and the receiver needs to recover the exact sum of these inputs.

Rosa: The core finding is that for simultaneous OOK, the minimum budget scales quadratically with the number of transmitters when symbol duration and target error probability are fixed.

Dev: Furthermore, any budget growth slower than quadratic causes the error probability to approach one at a fixed symbol duration.

Rosa: How the training signal is built The analysis defines a model with K transmitters, each sending an independent input bit, and particles carrying this information through independent propagation delays.

Paper summary: Rosa: So wrapping up this discussion on "A Particle-Based Multiuser Communication with a Budget Limit," the authors are showing that for independent equiprobable bits under the stated arrival conditions, the minimum budget needed for exact counting is quadratic in network size when you fix the symbol duration and target error probability.

Dev: And they confirm that even if you observe all arrival times, that quadratic scaling still applies for simultaneous OOK. They also pointed out a critical constraint: any subquadratic budget growth makes your error probability approach one at a fixed symbol duration, regardless of the transmission or decoding method you choose.

Taro: It really boils down to this: for this specific setup, if you want reliability without needing an infinite particle budget, you’re locked into that quadratic scaling unless you are willing to grow your symbol duration or your observation intervals with the network size.

Rosa: They showed that their groupwise OOK counting scheme helps reduce that required budget by allowing longer symbol durations and more counting intervals, which is a practical way to manage the trade-off between observation frequency and bit accuracy.

Dev: The implication here for us is that when designing these particle systems, we can't just focus on the number of transmitters; we have to consider the timing constraints—the symbol duration and how often we check for arrivals—as essential design parameters.

Taro: And it shows that finding those optimal polynomial budget exponents depends entirely on whether you keep the symbol duration and counting intervals fixed or if they grow with the network size in a certain way. That's where future work needs to focus, I think.

Rosa: Right. The finite-network optimum and the leading constants in those scaling laws are still open questions for them, which means there’s still a lot of room to explore how these theoretical bounds translate into actual hardware or software limits.

Dev: So, "A Particle-Based Multiuser Communication with a Budget Limit" gives us the necessary mathematical foundation to understand the fundamental limits of particle-based communication in these scenarios.

Taro: It tells us what the inherent cost is for achieving exact sum recovery in a multiuser network when you have to keep things running within defined timing parameters.

Conclusion: Rosa: So we’re wrapping up "A Particle-Based Multiuser Communication with a Budget Limit" by Etemadi, Farahnak-Ghazani, Arjmandi, Mirmohseni and Nasiri-Kenari.

Dev: The main thing is they found that for these particle communication networks, the minimum budget needed to get an exact count of all the bits sent is quadratic in the number of transmitters when you keep your symbol duration and target error probability fixed.

Taro: That's what we talked about before, but this paper really hammers home that even if you see every single arrival time, that quadratic scaling stays true for simultaneous on-off keying.

Rosa: And they also show that if you use any budget smaller than quadratic growth, the error probability just hits one at a fixed symbol duration, no matter what your transmission or decoding scheme is.

Dev: That means if you want to be reliable in this setup, you’ve got that quadratic cost unless you change the symbol duration or the number of counting intervals as it scales with the network size.

Taro: It changes how we think about designing these systems; we can't just focus on having enough transmitters; we have to consider how long the signal lasts and how often we check for arrivals.

Rosa: They also mention their groupwise on-off keying scheme which helps cut down that budget by letting you use longer symbol durations and more counting intervals.

Dev: That’s a practical way to save particles, but they admit that finding the absolute best polynomial budget exponents still leaves some open questions.

Taro: Yeah, those finite network optimum numbers are still unknown, which means we don't have the perfect blueprint for how much budget you should actually spend.

Rosa: It just shows us where the math ends and where we need to go next in understanding these communication limits.

Shaojie Zhang, Ozgur B. Akan

Centre for neXt Communications · University of Cambridge · Koş University

eess.SP

Submitted: 2026-11-04

Updated: 2026-11-04

Comments: 13 pages, 3 figures

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 91/100

The gist: Multiuser networks can aggregate local observations through a shared receiver In this paper, we study the particle budget required to recover the exact sum of binary inputs in a multiuser network The…

Key concepts

Particle Budget
This refers to the total number of particles released across all transmitters that a receiver must observe or account for to determine the exact sum of binary inputs. The goal is to find the minimum required budget needed to achieve perfect accuracy in decoding, balancing observation limits with counting requirements.
Simultaneous OOK
This communication scheme involves multiple transmitters sending independent bits at the same time, using on-off keying modulation. The paper specifically analyzes how this simultaneous transmission affects the particle budget growth compared to other schemes.
Quadratic Scaling
The minimum particle budget needed grows by the square of the number of transmitters when symbol duration and target error probability are held fixed. This quadratic relationship is a fundamental finding for simultaneous OOK in this network setting, indicating a strong dependency on network size.
Groupwise OOK (GOC)
This is a counting scheme developed by the authors that uses staggered group releases and sequential estimation of input sums. It aims to reduce the required particle budget by optimizing how observations are made over time.

Terminology

Summary

Multiuser networks can aggregate local observations through a shared receiver In this paper, we study the particle budget required to recover the exact sum of binary inputs in a multiuser network The minimum budget grows quadratically with the number of transmitters when the symbol duration and target error probability are fixed, even when the receiver observes all particle arrival times Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme

Pruning redundant reasoning tokens

The paper investigates the particle budget necessary for exact counting in a particle-based multiuser communication network where transmitters send independent bits, and the receiver needs to recover the exact sum of these inputs. The core finding is that for simultaneous OOK, the minimum budget scales quadratically with the number of transmitters when symbol duration and target error probability are fixed. p. 0

Where the paper says it

We show that, for the considered model, the minimum budget grows quadratically with the number of transmitters when the symbol duration and target error probability are fixed, even when the receiver observes all particle arrival times. Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme.

Furthermore, any budget growth slower than quadratic causes the error probability to approach one at a fixed symbol duration. p. 0
Where the paper says it

We show that, for the considered model, the minimum budget grows quadratically with the number of transmitters when the symbol duration and target error probability are fixed, even when the receiver observes all particle arrival times. Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme.

How the training signal is built

The analysis defines a model with K transmitters, each sending an independent input bit, and particles carrying this information through independent propagation delays. The particle budget constraint is defined by the total number of particles released across all transmitters, constrained by the expected total number of particles released under release rules C. p. 1

Where the paper says it

First, the network is subject to a particle-budget constraint 𝑁tot such that ∑︁ 𝐾 𝑖=1 𝑁𝑖 ≤ 𝑁tot. (1) Alternatively, we constrain only the expected total number of particles released, with no maximum per symbol interval.

The receiver can observe either absorbed-particle counts over predetermined intervals or all absorption times by the deadline. p. 1
Where the paper says it

The model assigns an independent equiprobable input bit to each transmitter, while each transmitter chooses its releases based only on that bit and without feedback, and the receiver estimates the exact integer sum. The receiver observes either absorbed-particle counts over predetermined intervals or all absorption times by the deadline, with neither observation identifying the transmitters.

Where the gains come from

The authors develop a groupwise OOK counting (GOC) scheme with staggered group releases and sequential estimation of group input sums to account for delayed arrivals. This scheme allows for a reduction in the required particle budget by allowing longer symbol durations and more counting intervals. p. 0

Where the paper says it

Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme. We then examine how this particle requirement can be reduced by allowing longer symbol durations and more counting intervals.

When reception is based on interval counts, reducing the quadratic scaling requires both the symbol duration and the number of counting intervals to grow with network size. p. 0
Where the paper says it

We develop a groupwise OOK counting (GOC) scheme with staggered group releases and sequential estimation of group input sums, accounting for delayed arrivals. Our bounds show that, when reception is based on interval counts, reducing the quadratic scaling requires both the symbol duration and the number of counting intervals to grow with network size.

Tradeoffs among particle budget, duration, and counting intervals

The paper examines how longer symbol intervals and more counting intervals can reduce the required particle budget while imposing a lower bound from permanent nonabsorption. The analysis shows that for fixed symbol duration and error target, the minimum particle budget is quadratic in network size even when all arrival times are observed. p. 0

Where the paper says it

We show that, for the considered model, the minimum budget grows quadratically with the number of transmitters when the symbol duration and target error probability are fixed, even when the receiver observes all particle arrival times. Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme.

However, when considering both symbol duration and the number of counting intervals growing proportionally to network size, the minimum budget becomes proportional to the number of transmitters times its logarithm. p. 0
Where the paper says it

Our bounds show that, when reception is based on interval counts, reducing the quadratic scaling requires both the symbol duration and the number of counting intervals to grow with network size. When both grow in proportion to network size, the minimum budget becomes proportional to the number of transmitters times its logarithm.

Conclusion

For independent equiprobable bits under the stated arrival conditions, the minimum budget for exact counting is quadratic in network size at a fixed symbol duration and error target, even when all arrival times are observed. At fixed symbol duration, any subquadratic budget makes the error probability approach one for every allowed release rule and decoder. p. 1

Where the paper says it

For every fixed positive deadline, the minimum particle budget is quadratic in the number of transmitters even when all absorption times are observed, and simultaneous OOK attains this order. For every allowed release rule and decoder, any budget growing more slowly than quadratically makes the error probability tend to one.

p. 1
Where the paper says it

For every fixed positive deadline, the minimum particle budget is quadratic in the number of transmitters even when all absorption times are observed, and simultaneous OOK attains this order. For every allowed release rule and decoder, any budget growing more slowly than quadratically makes the error probability tend to one.

These results also hold with only the expected number of released particles constrained. p. 1
Where the paper says it

For a fixed error target, our lower bounds apply to every release rule allowed in Section II and every corresponding decoder. The scaling results and strong converse are derived under either a maximum particle budget or a constraint only on the expected total number released.

p. 1
Where the paper says it

For a fixed error target, our lower bounds apply to every release rule allowed in Section II and every corresponding decoder. The scaling results and strong converse are derived under either a maximum particle budget or a constraint only on the expected total number released.

The lower bounds and GOC determine the optimal polynomial budget exponents when the symbol duration and, for interval-count observations, the number of intervals are fixed or grow polynomially with network size. p. 1
Where the paper says it

We determine the growth of the required particle budget for the case when the symbol duration and, for interval-count observations, the number of counting intervals remain fixed or grow polynomially with network size. The lower and upper bounds have the same polynomial growth with network size but retain a logarithmic gap in intermediate regimes.

p. 1
Where the paper says it

We determine the growth of the required particle budget for the case when the symbol duration and, for interval-count observations, the number of counting intervals remain fixed or grow polynomially with network size. The lower and upper bounds have the same polynomial growth with network size but retain a logarithmic gap in intermediate regimes.

The numerical results show that GOC provides achievable budget savings and demonstrate that the selected group count depends on the symbol duration. p. 0
Where the paper says it

We develop a groupwise OOK counting (GOC) scheme with staggered group releases and sequential estimation of group input sums, accounting for delayed arrivals. Our bounds show that, when reception is based on interval counts, reducing the quadratic scaling requires both the symbol duration and the number of counting intervals to grow with network size.

p. 0
Where the paper says it

We develop a groupwise OOK counting (GOC) scheme with staggered group releases and sequential estimation of group input sums, accounting for delayed arrivals. Our bounds show that, when reception is based on interval counts, reducing the quadratic scaling requires both the symbol duration and the number of counting intervals to grow with network size.

The finite-network optimum, the leading constants in the scaling laws, and the intermediate logarithmic gaps in Subsection V-C remain open problems. p. 1
Where the paper says it

We determine the growth of the required particle budget for the case when the symbol duration and, for interval-count observations, the number of counting intervals remain fixed or grow polynomially with network size. The lower and upper bounds have the same polynomial growth with network size but retain a logarithmic gap in intermediate regimes.

References

[3] A Etemadi, M Farahnak-Ghazani, H Arjmandi, M Mirmohseni, and M Nasiri-Kenari, “Abnormality Detection and Localization Schemes Using Molecular Communication Systems: A Survey,” IEEE Access, vol. 11, pp. 1761–1792, 2023

[4] H B Yilmaz, A C Heren, T Tugcu, and C.-B Chae, “Threedimensional channel characteristics for molecular communications with an absorbing receiver,” IEEE Commun. p. 0

Where the paper says it

Molecular communication provides a physical motivation for this setting, with molecules used as information carriers [1], [2]. Diffusive channel models describe random arrival delays and possible nonarrival [4], [5].

p. 0
Where the paper says it

Molecular communication provides a physical motivation for this setting, with molecules used as information carriers [1], [2]. Diffusive channel models describe random arrival delays and possible nonarrival [4], [5].

p. 0
Where the paper says it

Molecular communication provides a physical motivation for this setting, with molecules used as information carriers [1], [2]. Diffusive channel models describe random arrival delays and possible nonarrival [4], [5].

Lett., vol. 18, no. 6, pp. 929–932, Jun. 2014

[5] V Jamali, A Ahmadzadeh, W Wicke, A Noel, and R Schober, “Channel Modeling for Diffusive Molecular Communication—A Tutorial Review,” Proc. IEEE, vol. 107, no. 7, pp. 1256–1301, Jul. 2019

[9] Y Fang, A Noel, N Yang, A W Eckford, and R A Kennedy, “Symbol-by-Symbol Maximum Likelihood Detection for Cooperative Molecular Communication,” IEEE Trans. Commun., vol. 67, no. 7, pp. 4885–4899, Jul. 2019

[33] S Boucheron, G Lugosi, and P Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford, U.K.: Oxford University Press, 2013

[45] Here is the required token list for the references based on the provided text structure and rules.

--- Page 8 ---

[3] A Etemadi, M Farahnak-Ghazani, H Arjmandi, M Mirmohseni, and M Nasiri-Kenari, “Abnormality Detection and Localization Schemes Using Molecular Communication Systems: A Survey,” IEEE Access, vol. 11, pp. 1761–1792, 2023 doi: 10.1109/ACCESS.2022.3228618

[4] H B Yilmaz, A C Heren, T Tugcu, and C.-B Chae, “Threedimensional channel characteristics for molecular communications with an absorbing receiver,” IEEE Commun. Lett., vol. 18, no. 6, pp. 929–932, Jun. 2014 doi: 10.1109/LCOMM.2014.2320917

[5] V Jamali, A Ahmadzadeh, W Wicke, A Noel, and R Schober, “Channel Modeling for Diffusive Molecular Communication—A Tutorial Review,” Proc. IEEE, vol. 107, no. 7, pp. 1256–1301, Jul. 2019 doi: 10.1109/JPROC.2019.29455

[6] R Mosayebi, V Jamali, N Ghoroghchian, R Schober, M Nasiri-Kenari, and M Mehrabi, “Cooperative Abnormality Detection via Diffusive Molecular Communications,” IEEE Trans. NanoBiosci., vol. 16, no. 8, pp. 828–842, Dec. 2017 doi: 10.1109/TNB.2017.2775704

[33] S Boucheron, G Lugosi, and P Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford, U.K.: Oxford University Press, 2013 doi: 10. p. 0

Where the paper says it

Such networks have been proposed for distributed sensing, including abnormality detection and localization [3]. The authors are with the Centre for neXt Communications (CXC), Department of Engineering, University of Cambridge, CB3 0FA Cambridge, UK.

p. 0
Where the paper says it

Such networks have been proposed for distributed sensing, including abnormality detection and localization [3]. The authors are with the Centre for neXt Communications (CXC), Department of Engineering, University of Cambridge, CB3 0FA Cambridge, UK.

1093/acprof:oso/9780199535255.001.0001

[46] Here is the required token list for the references based on the provided text structure and rules.

(Note: The actual reference list in the paper is numbered [1] through [32], but I have only included those explicitly cited in the text where a claim was made, following your strict referencing rules.)

For independent equiprobable bits under the stated arrival conditions, the minimum budget for exact counting is quadratic in network size at a fixed symbol duration and error target, even when all arrival times are observed. At fixed symbol duration, any subquadratic budget makes the error probability approach one for every allowed release rule and decoder. These results also hold with only the expected number of released particles constrained. The lower bounds and GOC determine the optimal polynomial budget exponents when the symbol duration and, for interval-count observations, the number of intervals are fixed or grow polynomially with network size. The numerical results show that GOC provides achievable budget savings and demonstrate that the selected group count depends on the symbol duration.

[3] A Etemadi, M Farahnak-Ghazani, H Arjmandi, M Mirmohseni, and M Nasiri-Kenari, “Abnormality Detection and Localization Schemes Using Molecular Communication Systems: A Survey,” IEEE Access, vol. 11, pp. 1761–1792, 2023 doi: 10.1109/ACCESS.2022.3228618

[4] H B Yilmaz, A C Heren, T Tugcu, and C.-B Chae, “Threedimensional channel characteristics for molecular communications with an absorbing receiver,” IEEE Commun. Lett., vol. 18, no. 6, pp. 929–932, Jun. 2014 doi: 10.1109/LCOMM.2014.2320917

[5] V Jamali, A Ahmadzadeh, W Wicke, A Noel, and R Schober, “Channel Modeling for Diffusive Molecular Communication—A Tutorial Review,” Proc. IEEE, vol. 107, no. 7, pp. 1256–1301, Jul. 2019 doi: 10.1109/JPROC.2019.29455

[6] R Mosayebi, V Jamali, N Ghoroghchian, R Schober, M Nasiri-Kenari, and M Mehrabi, “Cooperative Abnormality Detection via Diffusive Molecular Communications,” IEEE Trans. NanoBiosci., vol. 16, no. 8, pp. 828–842, Dec. 2017 doi: 10.1109/TNB.2017.2775704

[33] S Boucheron, G Lugosi, and P Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford, U.K.: Oxford University Press, 2013 doi: 10.1093/acprof:oso/9780199535255.001.0001

[46] Here is the required token list for the references based on the provided text structure and rules.

(Self-Correction Note: The instruction requires a token for every sentence, and I must ensure no sentence is missing a token, even if it's just one word. I will re-verify the final output against this strict requirement. p. 0

Where the paper says it

Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme. We then examine how this particle requirement can be reduced by allowing longer symbol durations and more counting intervals.

)


Multiuser networks can aggregate local observations through a shared receiver In this paper, we study the particle budget required to recover the exact sum of binary inputs in a multiuser network The minimum budget grows quadratically with the number of transmitters when the symbol duration and target error probability are fixed, even when the receiver observes all particle arrival times Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improve particle budget estimation for exact counting in multiuser networks by using Groupwise OOK counting (GOC) scheme with staggered group releases and sequential estimation of group input sums, accounting for delayed arrivals. This scheme allows reducing the quadratic scaling of the minimum particle budget when reception is based on interval counts.

  2. Develop a method to determine if observing all arrival times can change the growth order of required particle budget with network size at a fixed symbol duration by analyzing comparison distributions of arrival times using Lemma 1 and Hellinger triangle inequality. This analysis shows that for full-record decoders, the minimum particle budget is proportional to the number of transmitters times its logarithm.

  3. Create a resource allocation strategy that optimally balances particle budget, symbol duration, and counting intervals to achieve a target error probability epsilon. The optimal resource growth is determined by Theorem 3, which yields bounds showing that for interval-count observations, the required particle budget scales as max (K squared M F(T), K squared F(T) (1 + T/tau0), K ln K).

  4. Implement a dynamic group size selection mechanism based on symbol duration to minimize the required particle budget while maintaining a target error probability. Numerical results show that joint growth allows more groups while keeping selected counting intervals at least 0.05 seconds long, leading to budget savings of up to 79.6% compared to simultaneous OOK at certain conditions.

  5. Design a decoder that leverages the sequential estimation capability of GOC to recover the total input sum by subtracting estimated earlier-group mean contributions from all subsequent counts, thereby mitigating delayed-arrival fluctuations and improving error bounds.

Abstract

Multiuser networks can aggregate local observations through a shared receiver. In this paper, we study the particle budget required to recover the exact sum of binary inputs in a multiuser network. We show that, for the considered model, the minimum budget grows quadratically with the number of transmitters when the symbol duration and target error probability are fixed, even when the receiver observes all particle arrival times. Simultaneous on-off keying (OOK) achieves this quadratic scaling, while any slower budget growth makes the error probability approach one at a fixed symbol duration, regardless of the transmission and decoding scheme. We then examine how this particle requirement can be reduced by allowing longer symbol durations and more counting intervals. We develop a groupwise OOK counting (GOC) scheme with staggered group releases and sequential estimation of group input sums, accounting for delayed arrivals. Our bounds show that, when reception is based on interval counts, reducing the quadratic scaling requires both the symbol duration and the number of counting intervals to grow with network size. When both grow in proportion to network size, the minimum budget becomes proportional to the number of transmitters times its logarithm.

Related papers