The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Mitigating routing misbehavior in mobile ad hoc networks
Open accessAbstract
This paper describes two techniques that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this problem, we propose categorizing nodes based upon their dynamically measured behavior. We use a watchdog that identifies misbehaving nodes and a pathrater that helps routing protocols avoid these nodes. Through simulation we evaluate watchdog and pathrater using packet throughput, percentage of overhead (routing) transmissions, and the accuracy of misbehaving node detection. When used together in a network with moderate mobility, the two techniques increase throughput by 17% in the presence of 40% misbehaving nodes, while increasing the percentage of overhead transmissions from the standard routing protocol's 9% to 17%. During extreme mobility, watchdog and pathrater can increase network throughput by 27%, while increasing the overhead transmissions from the standard routing protocol's 12% to 24%.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
Highly 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
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
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
Cryptography: Theory and Practice
Stinson, D. R. (1995) · Cited by 2,743
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Location-aided routing (LAR) in mobile ad hoc networks
Ko, Y.-B., & Vaidya, N. H. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288252 · Cited by 2,005
Ousterhout, J. K. (1994) · Cited by 1,627
The 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
IEEE 802.11 Wireless Local Area Networks
Crow, B. P., Widjaja, I., Kim, J. G., & Sakai, P. T. (1997) · IEEE Communications Magazine · doi:10.1109/35.620533 · Cited by 1,111
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
Security protocol for IEEE 802.11 wireless local area network
Park, S. H., Ganz, A., & Ganz, Z. (1998) · Mobile Networks and Applications · doi:10.1023/a:1019180916909 · Cited by 26
Cited by
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00008-8 · Cited by 2,937
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
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
Denial of service in sensor networks
Wood, A. D., & Stankovic, J. A. (2002) · Computer · doi:10.1109/mc.2002.1039518 · Cited by 1,711
Core: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks
Michiardi, P., & Molva, R. (2002) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35612-9_9 · Cited by 1,625
Metadata
- Authors
- Marti, S., Giuli, T. J., Lai, K., & Baker, M.
- Venue
- Proceedings of the 6th annual international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 2000-08
- Pages
- 255-265
- ISSN
- 1543-5679 (ISSN-L)
- OpenAlex
- W2127699957
- Cited by
- 3,415
- References
- 13
- FWCI
- 40.66
- Type
- conference paper
- 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.