Proceedings of the 12th International Conference on Management of Digital EcoSystems 2020
DOI: 10.1145/3415958.3433074
|View full text |Cite
|
Sign up to set email alerts
|

A Secure Tracing Method in Fog Computing Network for the IoT Devices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 36 publications
0
7
0
Order By: Relevance
“…However, if nodes exchange all CS information with neighbor nodes, it leads to another efficient issue. In this subsection, we describe our efficient design for CS information transmission using a counting Bloom filter (CBF) [13].…”
Section: An Efficient Design For Cs Information Transmissionmentioning
confidence: 99%
See 2 more Smart Citations
“…However, if nodes exchange all CS information with neighbor nodes, it leads to another efficient issue. In this subsection, we describe our efficient design for CS information transmission using a counting Bloom filter (CBF) [13].…”
Section: An Efficient Design For Cs Information Transmissionmentioning
confidence: 99%
“…Due to resource-constrained storage, this property is necessary in IoT because content objects can be deleted or added to a CS. We use CBF as a data structure to summarize a compact name set of content objects being cached in the content store of a node [13]. As a result, we only need to use CBF for storing and exchanging CS information among nodes in the network.…”
Section: An Efficient Design For Cs Information Transmissionmentioning
confidence: 99%
See 1 more Smart Citation
“…For that, we use the counting bloom filter (CBF) [24] in our design. A bloom filter is a space-efficient probabilistic data structure consisting of an m-bit array that is used to test whether an element is a member of a set.…”
Section: An Efficient Design For Cs Information Transmissionmentioning
confidence: 99%
“…We use CBF for storing and exchanging content name lists, instead of the full lists of content names because bloom filter (BF) is a space-efficient random data structure supporting the membership queries. In addition, we use CBF instead of the standard BF because CBF are represented by an array of m-bit counters supporting the deletion of elements as discussed in detail in [24]. This means that, compared to the bloom filter, to enable deletion of elements, the counting bloom filter uses an array of m counters instead of bits.…”
Section: An Efficient Design For Cs Information Transmissionmentioning
confidence: 99%