2009 WRI International Conference on Communications and Mobile Computing 2009
DOI: 10.1109/cmc.2009.349
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Gossiping Data Distribution Technique with Emphasis on Reliability and Resource Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 4 publications
0
10
0
Order By: Relevance
“…The Location-based Gossiping (LGossiping) protocol was developed as an improved gossiping-based method of message distribution that is based on the locations of all nodes in the network [ 21 ]. This means that nodes reliably forward messages to known neighbours using the Global Positioning System (GPS).…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The Location-based Gossiping (LGossiping) protocol was developed as an improved gossiping-based method of message distribution that is based on the locations of all nodes in the network [ 21 ]. This means that nodes reliably forward messages to known neighbours using the Global Positioning System (GPS).…”
Section: Related Workmentioning
confidence: 99%
“…This approach decreases the delay and consumes energy more efficiently. The performance of CHGossiping was comparatively assessed against the performances of the original gossiping protocol and LGossiping [ 21 ] with regard to the network lifetime, energy consumption, and packet loss. The findings showed that CHGossiping performs better than the other two routing protocols; it proved to be more reliable and energy efficient, with an increased network lifetime.…”
Section: Related Workmentioning
confidence: 99%
“…LGOSSIPING Protocol [15] In Location based Gossiping protocol, when a node has an event to send, it randomly chooses a neighbour node in its transmission radius. Once the neighbour node receives this event, it, in turn, randomly chooses another node within its transmission radius and sends it.…”
Section: 633mentioning
confidence: 99%
“…As a result, the delay problem has been solved to some extent. Figure 3 shows the main objective of LGossiping [18].…”
Section: K: Number Of Nodes That Forward the Packet L: Number Of Hopmentioning
confidence: 99%