The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Abstract
An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. We design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol (DSDV). In order to support use with nodes of limited CPU processing capability, and to guard against denial-of-service (DoS) attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the 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
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
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
Self-citationHighly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Optimized Link State Routing Protocol (OLSR)
(2003) · doi:10.17487/rfc3626 · Cited by 4,880
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
Self-citationMitigating 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
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190336 · Cited by 2,914
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
Cited by
Mobile ad hoc networking: imperatives and challenges
Chlamtac, I., Conti, M., & Liu, J. J.-N. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00013-1 · Cited by 1,349
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Self-citationAriadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2005) · Wireless Networks · doi:10.1007/s11276-004-4744-y · Cited by 1,033
Self-citationSEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00019-2 · Cited by 830
Self-citationSelf-organized public-key management for mobile ad hoc networks
Capkun, S., Buttyan, L., & Hubaux, J. (2003) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2003.1195151 · Cited by 826
Rushing attacks and defense in wireless ad hoc network routing protocols
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2003) · Proceedings of the 2nd ACM workshop on Wireless security · doi:10.1145/941311.941317 · Cited by 638
Self-citationA 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
SeRLoc: secure range-independent localization for wireless sensor networks
Lazos, L., & Poovendran, R. (2004) · Proceedings of the 3rd ACM workshop on Wireless security · doi:10.1145/1023646.1023650 · Cited by 423
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Čapkun, S., Buttyán, L., & Hubaux, J.-P. (2003) · Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/986858.986862 · Cited by 411
A survey on peer-to-peer key management for mobile ad hoc networks
Merwe, J. V. D., Dawoud, D., & McDonald, S. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216371 · Cited by 343
URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks
Luo, H., Kong, J., Zerfos, P., Lu, S., & Zhang, L. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838598 · Cited by 294
LITEWORP: A Lightweight Countermeasure for the Wormhole Attack in Multihop Wireless Networks
Khalil, I., Bagchi, S., & Shroff, N. B. (2005) · 2005 International Conference on Dependable Systems and Networks (DSN'05) · doi:10.1109/dsn.2005.58 · Cited by 284
A Survey on Intrusion Detection in Mobile Ad Hoc Networks
Anantvalee, T., & Wu, J. (2007) · Signals and Communication Technology · doi:10.1007/978-0-387-33112-6_7 · Cited by 269
Mobility helps security in ad hoc networks
Čapkun, S., Hubaux, J.-P., & Buttyán, L. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778422 · Cited by 257
Metadata
- Authors
- Hu, Y.-C., Johnson, D. B., & Perrig, A.
- Venue
- Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-25
- Pages
- 3-13
- OpenAlex
- W2131595204
- Cited by
- 636
- References
- 37
- FWCI
- 30.99
- 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.