The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
LITEWORP: A Lightweight Countermeasure for the Wormhole Attack in Multihop Wireless Networks
Abstract
In multihop wireless systems, such as ad-hoc and sensor networks, the need for cooperation among nodes to relay each other's packets exposes them to a wide range of security attacks. A particularly devastating attack is known as the wormhole attack, where a malicious node records control and data traffic at one location and tunnels it to a colluding node, which replays it locally. This can have an adverse effect in route establishment by preventing nodes from discovering routes that are more than two hops away. In this paper, we present a lightweight countermeasure for the wormhole attack, called LITEWORP, which does not require specialized hardware. LITEWORP is particularly suitable for resource-constrained multihop wireless networks, such as sensor networks. Our solution allows detection of the wormhole, followed by isolation of the malicious nodes. Simulation results show that every wormhole is detected and isolated within a very short period of time over a large range of scenarios. The results also show that the fraction of packets lost due to the wormhole when LITEWORP is applied is negligible compared to the loss encountered when the method is not applied.
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
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
Performance analysis of the IEEE 802.11 distributed coordination function
Bianchi, G. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.840210 · Cited by 8,651
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
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345920 · Cited by 5,393
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
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
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
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
Performance analysis of the CONFIDANT protocol
Buchegger, S., & Le Boudec, J.-Y. (2002) · Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/513800.513828 · Cited by 1,495
Protocols 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
Establishing pairwise keys in distributed sensor networks
Liu, D., & Ning, P. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948119 · Cited by 1,354
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
Rumor routing algorthim for sensor networks
Braginsky, D., & Estrin, D. L. (2002) · doi:10.1145/570738.570742 · Cited by 1,295
Secure Routing in Mobile Ad hoc Networks
(2022) · doi:10.22271/ed.book.2027 · Cited by 1,227
A pairwise key pre-distribution scheme for wireless sensor networks
Du, W., Deng, J., Han, Y. S., & Varshney, P. K. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948118 · Cited by 1,107
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003. · doi:10.1109/snpa.2003.1203362 · Cited by 1,001
Rumor Routing Algorithm For Sensor Networks
Braginsky, D., & Estrin, D. L. (2002) · Cited by 905
Using directional antennas for medium access control in ad hoc networks
Choudhury, R. R., Yang, X., Ramanathan, R., & Vaidya, N. H. (2002) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/570645.570653 · Cited by 702
Medium access control protocols using directional antennas in ad hoc networks
Ko, Y.-B., Shankarkumar, V., & Vaidya, N. H. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832169 · Cited by 691
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
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.2002.1017480 · Cited by 636
Using Directional Antennas to Prevent Wormhole Attacks.
Hu, L., & Evans, D. (2004) · Cited by 532
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
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
Zhu, S., Xu, S., Setia, S., & Jajodia, S. (2004) · 11th IEEE International Conference on Network Protocols, 2003. Proceedings. · doi:10.1109/icnp.2003.1249782 · Cited by 344
Detection and handling of MAC layer misbehavior in wireless networks
Kyasanur, P., & Vaidya, N. H. (2004) · 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings. · doi:10.1109/dsn.2003.1209928 · Cited by 285
Liu, D., & Ning, P. (2002) · NCSU Libraries Repository (North Carolina State University Libraries) · Cited by 242
Rushing attacks and defense in wireless ad hoc network routing protocols
Hu, Y., Perrig, A., & Johnson, D. B. (2003) · doi:10.1145/941315.941317 · Cited by 227
Feng, K.-T. (2007) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2007.906874 · Cited by 203
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
Cited by
Vehicular networks and the future of the mobile internet
Gerla, M., & Kleinrock, L. (2011) · Computer Networks · doi:10.1016/j.comnet.2010.10.015 · Cited by 290
Sedjelmaci, H., Senouci, S. M., & Ansari, N. (2018) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2017.2681698 · Cited by 282
Bhushan, B., & Sahoo, G. (2018) · Wireless Personal Communications · doi:10.1007/s11277-017-4962-0 · Cited by 181
Survey of wormhole attack in wireless sensor networks
Ghugar, U., & Pradhan, J. (2021) · Computer Science and Information Technologies · doi:10.11591/csit.v2i1.p33-42 · Cited by 13
Metadata
- Authors
- Khalil, I., Bagchi, S., & Shroff, N. B.
- Venue
- 2005 International Conference on Dependable Systems and Networks (DSN'05)
- Publisher
- IEEE
- Published
- 2005-07-27
- Pages
- 612-621
- OpenAlex
- W2105543555
- Cited by
- 284
- References
- 30
- FWCI
- 11.16
- 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.