The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A power controlled multiple access protocol for wireless packet networks
Abstract
Multiple access-based collision avoidance MAC protocols have typically used fixed transmission power, and have not considered power control mechanisms based on the distance of the transmitter and receiver in order to improve spatial channel reuse. This work proposes PCMA, a power controlled multiple access wireless MAC protocol within the collision avoidance framework. PCMA generalizes the transmit-or-defer "on/off" collision avoidance model of current protocols to a more flexible "variable bounded power" collision suppression model. The algorithm is provisioned for ad hoc networks and does not require the presence of base stations to manage transmission power (i.e. it is decentralized). The advantage of implementing a power controlled protocol in an ad-hoc network is that source-destination pairs can be more tightly packed into the network allowing a greater number of simultaneous transmissions (spectral reuse). Our initial simulation results show that the PCMA can improve the throughput performance of the non-power controlled IEEE 802.11 by a factor of 2 with potential for additional scalability as source-destination pairs become more localized, thus providing a compelling reason for migrating to a new power controlled multiple access wireless MAC protocol standard.
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
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Warnes, L. A. A. (1994) · Electronic and Electrical Engineering · doi:10.1007/978-1-349-13012-2_24 · Cited by 6,512
Bharghavan, V., Demers, A. J., Shenker, S. J., & Zhang, L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190334 · Cited by 1,771
Self-citationAlgebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Downlink power control and base station assignment
Rashid-Farrokhi, F., Liu, K. J. R., & Tassiulas, L. (1997) · IEEE Communications Letters · doi:10.1109/4234.602597 · Cited by 85
Cited by
Predictable 802.11 packet delivery from wireless channel measurements
Halperin, D., Hu, W., Sheth, A., & Wetherall, D. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851203 · Cited by 595
Joint scheduling and power control for wireless ad hoc networks
ElBatt, T., & Ephremides, A. (2004) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2003.819032 · Cited by 569
Real-time communication and coordination in embedded sensor networks
Stankovic, J. A., Abdelzaher, T. F., Lu, C., Sha, L., & Hou, J. C. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.814620 · Cited by 452
Fairness in wireless networks: Issues, measures and challenges
Shi, H., Prasad, R. V., Onur, E., & Niemegeers, I. G. M. M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.050113.00015 · Cited by 446
Predictable 802.11 packet delivery from wireless channel measurements
Halperin, D., Hu, W., Sheth, A., & Wetherall, D. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1851275.1851203 · Cited by 341
FlashLinQ: A Synchronous Distributed Scheduler for Peer-to-Peer Ad Hoc Networks
Wu, X., Tavildar, S., Shakkottai, S., Richardson, T., Li, J., Laroia, R., & Jovicic, A. (2013) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2264633 · Cited by 338
Principles and protocols for power control in wireless ad hoc networks
Kawadia, V., & Kumar, P. R. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837354 · Cited by 338
A survey on power control issues in wireless sensor networks
Pantazis, N. A., & Vergados, D. D. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4444752 · Cited by 287
Metadata
- Authors
- Monks, J. P., Bharghavan, V., & Hwu, W.-M. W.
- Venue
- Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 1
- Pages
- 219-228
- OpenAlex
- W2099471603
- Cited by
- 632
- References
- 7
- FWCI
- 33.55
- Type
- conference paper
- Language
- en
- Open access
- closed
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.