The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks
Open accessAbstract
Restricting network access of routing and packet forwarding to well-behaving nodes and denying access from misbehaving nodes are critical for the proper functioning of a mobile ad-hoc network where cooperation among all networking nodes is usually assumed. However, the lack of a network infrastructure, the dynamics of the network topology and node membership, and the potential attacks from inside the network by malicious and/or noncooperative selfish nodes make the conventional network access control mechanisms not applicable. We present URSA, a ubiquitous and robust access control solution for mobile ad hoc networks. URSA implements ticket certification services through multiple-node consensus and fully localized instantiation. It uses tickets to identify and grant network access to well-behaving nodes. In URSA, no single node monopolizes the access decision or is completely trusted. Instead, multiple nodes jointly monitor a local node and certify/revoke its ticket. Furthermore, URSA ticket certification services are fully localized into each node's neighborhood to ensure service ubiquity and resilience. Through analysis, simulations, and experiments, we show that our design effectively enforces access control in the highly dynamic, mobile ad hoc network.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“sharing [36] and additive secret sharing [13].”
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
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
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Mitigating routing misbehavior in mobile ad hoc networks
Marti, S., Giuli, T. J., Lai, K., & Baker, M. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345955 · Cited by 3,415
Wireless LAN medium access control (MAC) and physical layer (PHY) specifications
Piscataway, N. (1996) · Medical Entomology and Zoology · Cited by 2,999
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Capacity of Ad Hoc wireless networks
Li, J., Blake, C., Couto, D. S. J. D., Lee, H. I., & Morris, R. (2001) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/381677.381684 · Cited by 1,760
Packet leashes: a defense against wormhole attacks in wireless networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209219 · Cited by 1,513
A secure routing protocol for ad hoc networks
Sanzgiri, K., Dahill, B., Levine, B. N., Shields, C., & Belding-Royer, E. M. (2003) · 10th IEEE International Conference on Network Protocols, 2002. Proceedings. · doi:10.1109/icnp.2002.1181388 · Cited by 1,410
Cited by
A Survey on Trust Management for Mobile Ad Hoc Networks
Cho, J.-H., Swami, A., & Chen, I.-R. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.092110.00088 · Cited by 664
Sensor network security: a survey
Chen, X., Makki, K., Yen, K., & Pissinou, N. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090205 · Cited by 599
A Survey of Attacks and Countermeasures in Mobile Ad Hoc Networks
Wu, B., Chen, J., Wu, J., & Cardei, M. (2007) · Signals and Communication Technology · doi:10.1007/978-0-387-33112-6_5 · Cited by 588
Denial of service resilience in ad hoc networks
Aad, I., Hubaux, J.-P., & Knightly, E. W. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023741 · Cited by 279
Metadata
- Authors
- Luo, H., Kong, J., Zerfos, P., Lu, S., & Zhang, L.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2004-12
- Volume
- 12
- Issue
- 6
- Pages
- 1049-1063
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2161496718
- Cited by
- 294
- References
- 40
- FWCI
- 23.96
- Type
- journal article
- Language
- en
- Open access
- bronze
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.