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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
Self-citationZhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
SPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
Self-citationA highly adaptive distributed routing algorithm for mobile wireless networks
Park, V. D., & Corson, M. S. (2002) · Proceedings of INFOCOM '97 · doi:10.1109/infcom.1997.631180 · Cited by 2,234
THE ALOHA SYSTEM: another alternative for computer communications
Abramson, N. (1970) · Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall) · doi:10.1145/1478462.1478502 · Cited by 2,029
Optimized Link State Routing Protocol
Jacquet, P., Mühlethaler, P., Qayyum, A., Laouiti, A., Viennot, L., & Clausen, T. (2000) · Cited by 1,907
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
Self-citationProtocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
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
Theory of Spread-Spectrum Communications - A Tutorial
Pickholtz, R., Schilling, D., & Milstein, L. (1982) · IEEE Transactions on Communications · doi:10.1109/tcom.1982.1095533 · Cited by 1,370
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-citationThe Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Stajano, F., & Anderson, R. (2000) · Lecture Notes in Computer Science · doi:10.1007/10720107_24 · Cited by 1,160
Hedrick, C. L. (1988) · doi:10.17487/rfc1058 · Cited by 765
The quest for security in mobile ad hoc networks
Hubaux, J., Buttyán, L., & Capkun, S. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501436.501437 · Cited by 730
A new routing protocol for the reconfigurable wireless networks
Haas, Z. J. (2002) · IEEE International Conference on Universal Personal Communications (ICUPC) · doi:10.1109/icupc.1997.627227 · Cited by 695
Efficient and Secure Source Authentication for Multicast.
Perrig, A., Canetti, R., Song, D. X., & Tygar, J. D. (2001) · Cited by 622
Self-citationRivest, R. L. (1990) · doi:10.17487/rfc1186 · Cited by 607
The quest for security in mobile ad hoc networks
Hubaux, J.-P., Buttyán, L., & Capkun, S. (2001) · Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '01 · doi:10.1145/501416.501437 · Cited by 453
Secure Ad hoc On-Demand Distance Vector (SAODV) Routing
Zapata, M. G. (2006) · Cited by 297
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying
Reyzin, L., & Reyzin, N. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45450-0_11 · Cited by 295
Goldwasser, S., & Bellare, M. (1996) · Cited by 258
A reliable, efficient topology broadcast protocol for dynamic networks
Bellur, B., & Ogier, R. G. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749266 · Cited by 184
Protection of BGP Sessions via the TCP MD5 Signature Option
Heffernan, A. (1998) · doi:10.17487/rfc2385 · Cited by 162
Securing distance-vector routing protocols
Smith, B. R., Murthy, S., & Garcia-Luna-Aceves, J. J. (2002) · doi:10.1109/ndss.1997.579225 · Cited by 150
An adaptive distance vector routing algorithm for mobile, ad hoc networks
Boppana, R. V., & Konduru, S. P. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916673 · Cited by 138
An efficient message authentication scheme for link state routing
Cheung, S. (2002) · Annual Computer Security Applications Conference · doi:10.1109/csac.1997.646178 · Cited by 127
Reducing the cost of security in link-state routing
Hauser, R. C., Przygienda, T., & Tsudik, G. (2002) · doi:10.1109/ndss.1997.579226 · Cited by 105
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
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.