2013
DOI: 10.1007/s11277-013-1393-4
|View full text |Cite
|
Sign up to set email alerts
|

ISEFF: An ID-Based Scalable and EFficient Distributed File Sharing Technique in Vehicular Ad Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…N. Ahmadifard et al [163] propose a new file sharing protocol in the VANET (ISEFF) (i.e., Without infrastructure) using Bit torrent and consistent hashing to Improve sharing performance. This protocol is divided into five mechanisms: In terms of received file ratio, average download time, average file download, and control message overhead, this technique outperforms the P2P-based approach.…”
Section: One-tier Overlay Techniquesmentioning
confidence: 99%
See 2 more Smart Citations
“…N. Ahmadifard et al [163] propose a new file sharing protocol in the VANET (ISEFF) (i.e., Without infrastructure) using Bit torrent and consistent hashing to Improve sharing performance. This protocol is divided into five mechanisms: In terms of received file ratio, average download time, average file download, and control message overhead, this technique outperforms the P2P-based approach.…”
Section: One-tier Overlay Techniquesmentioning
confidence: 99%
“…A.A. Valibak el al [167] present a cooperative ITS in VANETs with the help of P2P communication (to improve [163]). This system has two purposes: finding the shortest path (i.e., time) for vehicles and routing the exchanged messages through the best-connected path simultaneously.…”
Section: Connectivity Probability Tablementioning
confidence: 99%
See 1 more Smart Citation
“…Note that the number of neighbor nodes is directly related to the communication range and traffic conditions in the roads. These parameters are widely overlooked in previous works in the area, for instance [10][11][12][13][14][15][16][17][18][19][20], but are crucial in the analysis presented in this paper.…”
Section: Introductionmentioning
confidence: 99%
“…A possibility for IDS establishment in adhoc networks would be a node that has generally vast number of neighboring nodes situated inside its corresponding range . There ought to be various needs to cover every single participating nodes in the system, and these nodes need to speak with each other to pass on the neighborhood intrusion‐related data . Finding such nodes and enabling them to exchange information productively is not simple .…”
Section: Introductionmentioning
confidence: 99%