Efficient broadcast in opportunistic networks using optimal stopping theory

Borrego, Carlos; Borrell, Joan; Robles, Sergi

doi:10.1016/j.adhoc.2019.01.001

Cited by 23 publications

(21 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rebroadcast probability and rebroadcast delay are related to a node's trustworthiness. Optimal stopping theory is applied to conserve energy consumption for wireless networks [22]. The selected nodes for forwarding messages are mainly based on energy instead of reachability, whereas the network still holds a high broadcast efficiency.…”

Section: A Probability-based Floodingmentioning

confidence: 99%

See 1 more Smart Citation

Probabilistic Second-Chance Broadcasting With/Without Global Positioning System Information in Wireless Ad Hoc Networks

Lai

Chiu²

2020

IEEE Access

View full text Add to dashboard Cite

A flooding algorithm aims to distribute messages to all nodes within the mobile environment. In a simple flooding scheme, every node broadcasts a newly received message. However, this simple mechanism generates massive redundant messages, which is referred to as the broadcast storm problem. To ease the negative effect of the broadcast storm problem, we proposed a novel scheme, Probabilistic Second-chance broadcasting with/without Global positioning system information (PSG) in wireless ad hoc networks, which amalgamates the merits of probability-based and location-based flooding algorithms. PSG eases the broadcast storm problem by reducing the total number of transmissions and does not require hello messages from neighboring nodes, yet achieves better results than Multipoint Relaying Flooding (MPR), a neighbor-knowledgebased flooding scheme, by accurately determining whether subsequent forwarding is advantageous while a node receives a broadcasting message. We also discuss the advantages of a two-phase/second-time algorithm and utilize a simplified topology to further explain and demonstrate the merits of second-time broadcasting. We compare our PSG scheme with the simple flooding scheme, the probabilistic schemes with different preassigned probabilities, and the MPR schemes with or without the overhead of hello messages. The simulation results show that our scheme demands fewer forwarding nodes to rebroadcast messages and therefore lowers the total number of transmissions. PSG scales down a large number of collisions and attains high delivery ratios compared to other flooding algorithms. INDEX TERMS Ad hoc networks, broadcasting, global positioning system, flooding, probabilistic.

show abstract

Section: A Probability-based Floodingmentioning

confidence: 99%

“…Since for each period , in each node, there are two messages transmitted in each node. The percentage of transmission time to the period for one-time broadcasting in the first phase, , is regarded as the transmission probability of a neighboring node within a period (22)…”

mentioning

confidence: 99%

Probabilistic Second-Chance Broadcasting With/Without Global Positioning System Information in Wireless Ad Hoc Networks

Lai

Chiu²

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The [9] refer to an OST-based solution to deliver messages in highly connected networks. However, the proposed solutions are based on metrics like low latency, while the authors in [8] proposed a solution of broadcast protocols for OppNet based on efficiency, preventing unrestrained propagation of messages.…”

Section: Related Work and Contribution 21 Related Workmentioning

confidence: 99%

To Transmit or Not to Transmit

Panagidi

Anagnostopoulos

Chalvatzaras

et al. 2020

ACM Trans. Internet Technol.

View full text Add to dashboard Cite

show abstract

“…For example, in [6], the authors propose an OppNet routing protocol that uses an ewma-based scheme in order to keep nodal contact probabilities updated. Additionally, in [7,8], the authors use ewma to estimate future times between forwarding actions.…”

Section: Moving Averagesmentioning

confidence: 99%

General and mixed linear regressions to estimate inter-contact times and contact duration in opportunistic networks

2019

Self Cite

View full text Add to dashboard Cite

In the context of Opportunistic Networking (OppNet), routing and delivery algorithms used for content dissemination employ different metrics to perform accurate decisions. It has been shown that of these metrics, the inter-contact time and the contact duration are very useful for characterising OppNet scenarios. In this article, we show that the exponential moving averages of the historical values of these metrics are correlated with future observed values, in addition to also being good estimators for them. Moreover, we go a step further to investigate how to locally, from the OppNet node perspective, improve the estimations for these metrics by defining two novel estimation functions. These estimation functions are based on two different linear models: a general regression model and a mixed regression model, where future values of the studied metrics are explained in terms of their corresponding exponential moving averages. Experimentation using real mobility traces from well-known OppNet scenarios show that our estimation functions greatly reduce the estimation error of the future values of both metrics when compared to representative state of the art proposals.

show abstract

Efficient broadcast in opportunistic networks using optimal stopping theory

Cited by 23 publications

References 35 publications

Probabilistic Second-Chance Broadcasting With/Without Global Positioning System Information in Wireless Ad Hoc Networks

Probabilistic Second-Chance Broadcasting With/Without Global Positioning System Information in Wireless Ad Hoc Networks

To Transmit or Not to Transmit

General and mixed linear regressions to estimate inter-contact times and contact duration in opportunistic networks

Contact Info

Product

Resources

About