2018
DOI: 10.1109/access.2018.2808356
|View full text |Cite
|
Sign up to set email alerts
|

A Neighbor-Based Probabilistic Broadcast Protocol for Data Dissemination in Mobile IoT Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0
1

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(19 citation statements)
references
References 23 publications
0
18
0
1
Order By: Relevance
“…There are three types of transmission in the packet forwarding process: source to relay (S-R), relay to relay (R-R), and source to destination (S-D). The S-R transmission is designed for the start of multiple hop scheduling [28] and is used to share control information in the local area or collect monitored data at the sink node, using its ZigBee. A relay could refuse the transmission if that node was selfish enough (e.g., energy-hungry or experiencing a full relay queue).…”
Section: Selectable Transmission Modelmentioning
confidence: 99%
“…There are three types of transmission in the packet forwarding process: source to relay (S-R), relay to relay (R-R), and source to destination (S-D). The S-R transmission is designed for the start of multiple hop scheduling [28] and is used to share control information in the local area or collect monitored data at the sink node, using its ZigBee. A relay could refuse the transmission if that node was selfish enough (e.g., energy-hungry or experiencing a full relay queue).…”
Section: Selectable Transmission Modelmentioning
confidence: 99%
“…Both schemes determine rebroadcast probability as a function of the Jaccard distance. Other than neighbor information [23], [24], [30], node density [30], [31], mobility level [32] and remain energy [4] are also used to derive rebroadcast probability.…”
Section: Related Workmentioning
confidence: 99%
“…In [13], dynamically adjusting the probability of rebroadcast depending on the density of the nodes (i.e., the number of adjacent nodes) was suggested; the node in a dense area rebroadcasts frames with a low probability to mitigate the redundancy whereas a high value of probability is used in a sparse area to improve the reachability of frames. According to [14,15,16], the probability of rebroadcasting is calculated by considering the additional coverage due to it as well as the degree of connectivity, which is analogous to the number of adjacent nodes. Subsequently, if a frame can be delivered to more adjacent nodes, it is preferentially transmitted.…”
Section: Statement Of the Problemmentioning
confidence: 99%