Improvement of Data Distribution in LGossiping with Choosing the Next Hop According to Its Chance

Afrancheh, Hamid Reza; Dabbaghian, Mehdi; Khodashahi, Mohammad Hasan; Amiri, Fatemeh Nasiri

doi:10.1109/icwmc.2010.50

Cited by 1 publication

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A chance-based gossiping protocol, CHGossiping, was proposed to overcome the delay problems of the LGossiping algorithm and to reduce the number of non-input events at the sink [ 23 ]. Similar to ELGossiping [ 22 ], this routing algorithm considers both a node’s energy and its distance to the sink.…”

Section: Related Workmentioning

confidence: 99%

“…Table 1 summarises the reviewed literature on gossiping protocol variants. For package dissemination, the majority of these works adopt various computations that utilise the distance to the sink and/or the residual energy as the primary parameter(s) for determining the next node for selection [ 22 , 23 , 24 , 25 , 28 , 30 ]. Other parameters examined include the distance to each neighbour node [ 29 ], the locations of the nodes [ 21 ], and the hop count to the sink [ 19 ].…”

Section: Related Workmentioning

confidence: 99%

“…These modified gossiping protocols have typically been evaluated in comparison with the conventional gossiping protocol or other modified gossiping protocols using various metrics. The energy consumption has been most commonly utilised to assess the performance of a proposed protocols against the performances of other protocols in a fixed-size network (100 nodes) [ 19 , 21 , 22 , 23 , 24 , 25 , 28 , 29 , 30 ], followed by the hop count [ 22 , 23 , 28 , 29 , 30 ], the number of live nodes [ 19 , 24 , 28 , 29 , 30 ], the packet loss [ 19 , 21 , 22 , 23 ], and the network lifetime [ 22 , 23 , 25 ]. The results of these works reflect the positive impact of utilising adjusted parameters and computations to enhance the performance of the original gossiping protocol.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Context-Aware Gossip-Based Protocol for Internet of Things Applications

Altoaimy

Alromih

Al-Megren

et al. 2018

Sensors

View full text Add to dashboard Cite

This paper proposes a gossip-based protocol that utilises a multi-factor weighting function (MFWF) that takes several parameters into account: residual energy, Chebyshev distances to neighbouring nodes and the sink node, node density, and message priority. The effects of these parameters were examined to guide the customization of the weight function to effectively disseminate data to three types of IoT applications: critical, bandwidth-intensive, and energy-efficient applications. The performances of the three resulting MFWFs were assessed in comparison with the performances of the traditional gossiping protocol and the Fair Efficient Location-based Gossiping (FELGossiping) protocol in terms of end-to-end delay, network lifetime, rebroadcast nodes, and saved rebroadcasts. The experimental results demonstrated the proposed protocol’s ability to achieve a much shorter delay for critical IoT applications. For bandwidth-intensive IoT application, the proposed protocol was able to achieve a smaller percentage of rebroadcast nodes and an increased percentage of saved rebroadcasts, i.e., better bandwidth utilisation. The adapted MFWF for energy-efficient IoT application was able to improve the network lifetime compared to that of gossiping and FELGossiping. These results demonstrate the high level of flexibility of the proposed protocol with respect to network context and message priority.

show abstract

Section: Related Workmentioning

confidence: 99%