The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Self-organized network-layer security in mobile ad hoc networks
Abstract
Protecting the network layer in a mobile ad hoc network is an important research topic in wireless security. This paper describes our unified network-layer security solution in ad hoc networks, which protects both routing and packet forwarding functionalities in the context of the AODV protocol. To address the unique characteristics of ad hoc networks, we take a self-organized approach by exploiting full localized design, without assuming any a priori trust or secret association between nodes. In our design, each node has a token in order to participate in the network operations, and its local neighbors collaboratively monitor it to detect any misbehavior in routing or packet forwarding services. Upon expiration of the token, each node renews its token via its multiple neighbors. The period of the validity of a node's token is dependent on how long it has stayed and behaved well in the network. A well-behaving node accumulates its credit and renews its token less and less frequently as time evolves. In essence, our security solution exploits collaboration among local nodes to protect the network layer without completely trusting any individual node.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“This is realized by employing the polynomial secret sharing scheme [9, 17], in which each node shares the SK by a polynomial of order k − 1.”
MethodA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · cited 1×
“The neighbor verification mechanism is based on tokens and employs the asymmetric cryptographic primitives, specifically the de facto standard RSA [16].”
Cited by
Security in mobile ad hoc networks: challenges and solutions
Yang, H., Luo, H., Ye, F., Lu, S., & Zhang, L. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1269716 · Cited by 879
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
A survey of security issues in mobile ad hoc and sensor networks
Djenouri, D., Khelladi, L., & Badache, A. N. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1593277 · Cited by 492
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
Self-citationDetection 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
Metadata
- Authors
- Yang, H., Meng, X., & Lu, S.
- Venue
- Proceedings of the 1st ACM workshop on Wireless security
- Publisher
- ACM
- Published
- 2002-09-28
- Pages
- 11-20
- OpenAlex
- W2073075740
- Cited by
- 224
- References
- 2
- FWCI
- 10.38
- 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.