SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Capacity improvement is one of the principal challenges in wireless networking. We present a link-layer protocol called Slotted Seeded Channel Hopping, or SSCH, that increases the capacity of an IEEE 802.11 network by utilizing frequency diversity. SSCH can be implemented in software over an IEEE 802.11-compliant wireless card. Each node using SSCH switches across channels in such a manner that nodes desiring to communicate overlap, while disjoint communications mostly do not overlap, and hence do not interfere with each other. To achieve this, SSCH uses a novel scheme for distributed rendezvous and synchronization. Simulation results show that SSCH significantly increases network capacity in several multi-hop and single-hop wireless networking scenarios.
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
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
A high-throughput path metric for multi-hop wireless routing
De Couto, D. S. J., Aguayo, D., Bicket, J., & Morris, R. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939000 · Cited by 3,356
Routing in multi-radio, multi-hop wireless mesh networks
Draves, R., Padhye, J., & Zill, B. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023732 · Cited by 2,456
Fine-grained network time synchronization using reference broadcasts
Elson, J., Girod, L., & Estrin, D. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844143 · Cited by 2,396
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?
Xu, S., & Saadawi, T. (2001) · IEEE Communications Magazine · doi:10.1109/35.925681 · Cited by 909
A multi-radio unification protocol for IEEE 802.11 wireless networks
Adya, A., Bahl, P., Padhye, J., Wolman, A., & Zhou, L. (2004) · First International Conference on Broadband Networks · doi:10.1109/broadnets.2004.8 · Cited by 701
Self-citationOn the scalability of IEEE 802.11 ad hoc networks
Huang, L., & Lai, T. (2002) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/513800.513822 · Cited by 176
Cited by
Wireless mesh networks: a survey
Akyildiz, I. F., Wang, X., & Wang, W. (2005) · Computer Networks · doi:10.1016/j.comnet.2004.12.001 · Cited by 4,007
Alicherry, M., Bhatia, R., & Li, L. E. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.881641 · Cited by 384
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
Subramanian, A. P., Gupta, H., Das, S. R., & Cao, J. (2008) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2008.70 · Cited by 377
Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions
Skalli, H., Ghosh, S., Das, S., & Lenzini, L. (2007) · IEEE Communications Magazine · doi:10.1109/mcom.2007.4378326 · Cited by 299
Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks
Subramanian, A. P., Gupta, H., & Das, S. R. (2007) · 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks · doi:10.1109/sahcn.2007.4292860 · Cited by 267
A New Anti-Jamming Strategy Based on Deep Reinforcement Learning for MANET
Xu, Y., Lei, M., Li, M., Zhao, M., & Hu, B. (2019) · 2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring) · doi:10.1109/vtcspring.2019.8746494 · Cited by 14
“Spread spectrum [2] and channel hopping [3] techniques are traditional techniques used as countermeasures against jamming attacks for decades in the physical layer and link layer, respectively.”
Method
Metadata
- Authors
- Bahl, P., Chandra, R., & Dunagan, J.
- Venue
- Proceedings of the 10th annual international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 2004-09-26
- Pages
- 216-230
- ISSN
- 1543-5679 (ISSN-L)
- OpenAlex
- W2115467602
- Cited by
- 863
- References
- 7
- FWCI
- 25.22
- 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.