The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Optimum transmission ranges in a direct-sequence spread-spectrum multihop packet radio network
Open accessAbstract
The authors obtain the optimum transmission ranges to maximize throughput for a direct-sequence spread-spectrum multihop packet radio network. In the analysis, they model the network self-interference as a random variable which is equal to the sum of the interference power of all other terminals plus background noise. The model is applicable to other spread-spectrum schemes where the interference of one user appears as a noise source with constant power spectral density to the other users. The network terminals are modeled as a random Poisson field of interference power emitters. The statistics of the interference power at a receiving terminal are obtained and shown to be the stable distributions of a parameter that is dependent on the propagation power loss law. The optimum transmission range in such a network is of the form CK/sup alpha / where C is a constant, K is a function of the processing gain, the background noise power spectral density, and the degree of error-correction coding used, and alpha is related to the power loss law. The results obtained can be used in heuristics to determine optimum routing strategies in multihop networks.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to Probability Theory and Its Applications.
Bharucha-Reid, A. T., & Feller, W. (1967) · The American Mathematical Monthly · doi:10.2307/2314609 · Cited by 6,066
Spatial reuse in multihop packet radio networks
Kleinrock, L., & Silvester, J. A. (1987) · Proceedings of the IEEE · doi:10.1109/proc.1987.13711 · Cited by 150
Self-citationCo-Channel Interference of Spread Spectrum Systems in a Multiple User Environment
Musa, S. A., & Wasylkiwskyj, W. (1978) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1978.1093993 · Cited by 69
Cited by
Stochastic Geometry for Wireless Networks
Haenggi, M. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139043816 · Cited by 2,438
Smart radio environments empowered by reconfigurable AI meta-surfaces: an idea whose time has come
Renzo, M. D., Debbah, M., Phan-Huy, D.-T., Zappone, A., Alouini, M.-S., Yuen, C., Sciancalepore, V., Alexandropoulos, G. C., Hoydis, J., Gacanin, H., et al. (2019) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-019-1438-9 · Cited by 1,717
Stochastic geometry and random graphs for the analysis and design of wireless networks
Haenggi, M., Andrews, J. G., Baccelli, F., Dousse, O., & Franceschetti, M. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090902 · Cited by 1,719
ElSawy, H., Hossain, E., & Haenggi, M. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.052213.00000 · Cited by 976
A Mathematical Theory of Network Interference and Its Applications
Win, M. Z., Pinto, P. C., & Shepp, L. A. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2008.2008764 · Cited by 640
Metadata
- Authors
- Sousa, E. S., & Silvester, J. A.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 1990-06
- Volume
- 8
- Issue
- 5
- Pages
- 762-771
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2171882038
- Cited by
- 452
- References
- 3
- FWCI
- 1.50
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.