Dissertation · 2017 · Open access
A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks
Open Research Online (The Open University) · Published 1 January 2017 · DOI 10.21954/ou.ro.0000be03
In brief
“A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks” is a 2017 dissertation by Jonny Karlsson, published in Open Research Online (The Open University). OpenAlex counts 3 citations as of 19 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at Open Research Online (The Open University).
- Citations
- 3
- Most cited in
- 2018 (1)
- Authors
- 1
Abstract
The Internet is experiencing an evolution towards a ubiquitous network paradigm, via the so-called internet-of-things (IoT), where small wireless computing devices like sensors and actuators are integrated into daily activities. Simultaneously, infrastructure-less systems such as mobile ad hoc networks (MANET) are gaining popularity since they provide the possibility for devices in wireless sensor networks or vehicular ad hoc networks to share measured and monitored information without having to be connected to a base station. While MANETs offer many advantages, including self-configurability and application in rural areas which lack network infrastructure, they also present major challenges especially in regard to routing security. In a highly dynamic MANET, where nodes arbitrarily join and leave the network, it is difficult to ensure that nodes are trustworthy for multi-hop routing. Wormhole attacks belong to most severe routing threats because they are able to disrupt a major part of the network traffic, while concomitantly being extremely difficult to detect. This thesis presents a new unified wormhole attack detection framework which is effective for all known wormhole types, alongside incurring low false positive rates, network loads and computational time, for a variety of diverse MANET scenarios. The framework makes three original technical contributions: i) a new accurate wormhole detection algorithm based on packet traversal time and hop count analysis (TTHCA) which identifies infected routes, ii) an enhanced, dynamic traversal time per hop analysis (TTpHA) detection model which is adaptable to node radio range fluctuations, and iii) a method for automatically detecting time measurement tampering in both TTHCA and TTpHA. The thesis findings indicate that this new wormhole detection framework provides significant performance improvements compared to other existing solutions by accurately, efficiently and robustly detecting all wormhole variants under a wide range of network conditions.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Karlsson, J. (2017). A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks. Open Research Online (The Open University). https://doi.org/10.21954/ou.ro.0000be03
MLA 9
Karlsson, Jonny. “A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks.” Open Research Online (The Open University), 2017. https://doi.org/10.21954/ou.ro.0000be03.
Chicago
Karlsson, Jonny. 2017. “A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks.” Open Research Online (The Open University). https://doi.org/10.21954/ou.ro.0000be03.
Harvard
Karlsson, J. (2017) ‘A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks’, Open Research Online (The Open University). doi:10.21954/ou.ro.0000be03.
IEEE
J. Karlsson, “A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks,” Open Research Online (The Open University), 2017, doi: 10.21954/ou.ro.0000be03.
BibTeX
@phdthesis{karlsson2017unified,
title = {{A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks}},
author = {Karlsson, Jonny},
year = {2017},
doi = {10.21954/ou.ro.0000be03},
url = {https://doi.org/10.21954/ou.ro.0000be03}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 1 | |
| 2023 | 1 | |
| 2026 | 1 |
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- wormhole detection
- mobile ad hoc networks
- secure routing
- multi-hop routing
- false positive rate
- vehicular ad hoc networks
- wireless sensor networks
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Karlsson, J. (2017). A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks. Open Research Online (The Open University). https://doi.org/10.21954/ou.ro.0000be03
How many times has this paper been cited?
3 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Open Research Online (The Open University): sign in and open the full text from this page.
Who wrote this paper?
Jonny Karlsson.
What is the DOI of this paper?
10.21954/ou.ro.0000be03, permanently at https://doi.org/10.21954/ou.ro.0000be03. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.