A Markov chain model for securing link layer in mobile ad hoc networks
Bibliographic record
Abstract
The increased usage of wireless ad-hoc networks (MANET), which is a collection of wireless mobile nodes that form a dynamic network without the need for infrastructure or centralized points, in many different applications has opened the door for many security challenges. In recent years, securing and protecting communications between mobile nodes in MANETs have become an active research field. The vast majority has only focused on providing authenticity of the route and mostly ignored the availability of malicious nodes in the environment. The aim of this work is to explore the effectiveness of the Request-to-Send (RTS) / Clear-to-Send (CTS) protocol in securing MANETs by avoiding such a node's communication with malicious nodes. It is assumed that a certain node is not listening to any RTS messages until it has a specific number of nodes within its range, and, it will have a fixed period of time before it replays a CTS message. In this paper, specific attention was paid to the security issues of a mobile single hop ad hoc network. We propose a general Markov chain model that satisfies the basic mobility requirements of a MANET and define the requirements for securing communication in this model. We perform MATLAB analysis for RTS/CTS handshake in IEEE 802.11 in order to secure link layer, which would protect the networks from malicious nodes. Our results show that the probability for a node to communicate with pernicious nodes is low.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".