Analytical modeling of self-pruning and an improved probabilistic broadcast for wireless multihop networks

Rab, Raqeebir; Rahman, Ashikur; Zohra, Fatema Tuz

doi:10.1016/j.adhoc.2016.08.007

Cited by 4 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At the same time, the algorithm does not give a specific scheme to obtain the information of neighbor nodes. Raqeebir Rab et al [19]. proposed a new heuristic algorithm called dynamic probabilistic broadcast (DPB) algorithm.…”

mentioning

confidence: 99%

A Rapid Flooding Approach Based on Adaptive Delay and Low-Power Sleep for BLE Mesh Networks

Wang,

Li,

2024

IEEE Access

View full text Add to dashboard Cite

Bluetooth Low Energy Mesh (BLE Mesh) is a promising protocol to interconnect massive transceivers in a low-power, high-flexibility and wide-coverage way. It applies managed flooding to realize efficient many-to-many communication, especially in the small packet scenario. However, the traditional approaches usually generate too much redundant packets, resulting in severe collision and even broadcast storm. Related works deal with this problem mainly from the aspects of transmission mode, probabilistic broadcast and node selection. These algorithms decrease the redundancy a lot but often come at a considerable delay. In this paper, we propose a rapid flooding approach based on adaptive delay and low-power sleep(FADLS) for BLE Mesh, which adjusts the maximum random delay and relay sleep time adaptively, based on a lightweight neighbor information acquisition mechanism. The simulation results show that the FADLS algorithm reduces the broadcast collision and transmission delay effectively. In addition, the adaptability enables the algorithm more suitable for changing scales of BLE Mesh networks.

show abstract

mentioning

confidence: 99%

A Rapid Flooding Approach Based on Adaptive Delay and Low-Power Sleep for BLE Mesh Networks

Wang,

Li,

2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The neighbor-based, self-pruning scheme in [21] is mathematically analyzed in [80,81] to quantify the forwarding probability (p f ) of a node located at a certain distance from its previous forwarder. The theoretical expression found for p f requires nodes to know the distance to the previous forwarder, the average node density of the network and the transmission range.…”

Section: Studies With Analytical Modelsmentioning

confidence: 99%

Geografia e Inovação

Rodríguez¹

View full text Add to dashboard Cite

This thesis addresses the problem of disseminating broadcast packets in a multi-hop wireless ad hoc network. Specifically, it focuses on broadcasting protocols in which nodes make probabilistic decisions to forward packets. In connected multi-hop ad hoc networks, this type of protocol produces a broadcasting process that saves energy and bandwidth while offering a natural rotation of the subset of forwarders over time, yet it entails minimum overhead.

show abstract

On the goodput of flows in heterogeneous mobile networks

Seetharam

Ramesh

2018

Computer Networks

View full text Add to dashboard Cite

Analytical modeling of self-pruning and an improved probabilistic broadcast for wireless multihop networks

Cited by 4 publications

References 20 publications

A Rapid Flooding Approach Based on Adaptive Delay and Low-Power Sleep for BLE Mesh Networks

A Rapid Flooding Approach Based on Adaptive Delay and Low-Power Sleep for BLE Mesh Networks

Geografia e Inovação

On the goodput of flows in heterogeneous mobile networks

Contact Info

Product

Resources

About