Selfish Node Detection and Prevention Based on SDSR in Infrastructure-Less Networks
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract Wireless mesh network formed temporarily by using mobile hosts (nodes) without the help of any centralized and cooperate to dispatch the data packets through wireless links over the network. Due to this decentralization, each node act as both router as well as host for dispatching packets in the network. Because of a dynamic nature that is the mobility nature of the node in a network is vulnerable to various types of attacks. Some of the attacks are gray and black hole attacks. These attacks are advertised incorrect information regarding the shortest path to the sink node. This paper proposes a secure Dynamic Source Routing (SDSR) for providing a secure and safe route between the origin and sink nodes which identify and remove the gray and black hole nodes in the network. The proposed work is simulated by using the NS2 simulator tool and got the better performance for considered performance variables such as packet delivery ratio, throughput and node overhead. The simulation results give better performance compared to normal DSR and selfish DSR with increased packet delivery ratio and throughput and with decreased overhead of the network.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-06-02T02:00:03.124865+00:00
License: CC-BY-4.0