Energy Efficient Balanced Tree-Based Routing Protocol for Wireless Sensor Network (EEBTR)

Ghoul, Rafia; He, Jing; Hawbani, Ammar; Djaidja, Sana

doi:10.1007/978-3-030-32523-7_59

Cited by 2 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed PDTR uses First Order Radio Model with asymmetric channel to run the radio as depicted in Figure 2, such that it uses the same energy, to transmit the data from x to y, and to transmit the same data from y to x, this energy is denoted by E elec , and has the value of E elec = 50 nJ bit . E elec depends on filtering, modulation, digital coding and signal spreading [26]. In this model, two channel models are used.…”

Section: Radio Model Used For Pdtrmentioning

confidence: 99%

“…The Free space channel model of transmitter amplifier is denoted by ε fs , and has the value of ε fs = 10 pJ/bit/m 2 . The Multi-path channel model of transmitter amplifier is denoted by ε mp and has the value ε mp = 0.0013 pJ/bit/m 4 [26]. Let d (n i ,n j ) be the distance between the transmitter n i and the receiver n j .…”

Section: Radio Model Used For Pdtrmentioning

confidence: 99%

“…depends on filtering, modulation, digital coding and signal spreading [26]. In this model, two channel models are used.…”

Section: Radio Model Used For Pdtrmentioning

confidence: 99%

“…The values of the control parameters should be selected in order to keep the influence of the three distributions. After intensive experimental work, it was concluded that to maintain this objective, the upper bound of control-parameters denoted by U b , has a strong relation with the network density deployment; this relation is defined by Equation (26). In the homogeneous network, sensors are deployed at the interest network area Ω, and they have the same communication radius, denoted by δ.…”

Section: Control Parameters Upper Boundmentioning

confidence: 99%

See 3 more Smart Citations

PDTR: Probabilistic and Deterministic Tree-based Routing for Wireless Sensor Networks

Ghoul

Djaidja

et al. 2020

Sensors

Self Cite

View full text Add to dashboard Cite

This paper proposed a "Probabilistic and Deterministic Tree-based Routing for WSNs (PDTR)". The PDTR builds a tree from the leaves to the head (sink), according to the best elements in the initial probabilistic routing table, measured by the product of hops-count distribution, and transmission distance distribution, to select the best tree-paths. Each sender node forwards the received data to the next hop via the deterministic built tree. After that, when any node loses of its energy, PDTR updates the tree at that node. This update links probabilistically one of that node's children to a new parent, according to the updated probabilistic routing table, measured by the product of the updated: Hops-count distribution, transmission distance distribution, and residual energy distribution at the loss of e energy. By implementing the control parameters in each distribution, PDTR shows the impact of each distribution in the routing path. These control parameters are oriented by the user for different performances. The simulation results prove that selecting the initial best paths to root the packets via unicast, then improving the tree at the node with loss of energy by rooting the packets via anycast, leads to better performance in terms of energy consumption and network lifetime. of 22positions, through other localization technologies [2,3]. Other proposed WSN localization technologies are based on different measurement techniques such as the time-of-arrival (TOA), angle-of-arrival (AOA), and received signal strength indicator (RSSI) [4][5][6][7]. Later,in [8,9], the cooperative localization technology was developed for hybrid networks containing mobile and static sensors. Recently,in [10], the authors proposed a centralized expectation maximization-based passive localization technology for asynchronous receivers (EMplLaR). Being aware of the nodes' location allows the use of many power control techniques to reduce energy consumption.Data forwarding toward the sink via deterministic protocols may cause quick energy depletion for some nodes, due to the sender node's forwarder unique choice, which causes a topology disruption, thus a quick network death. Meanwhile, the probabilistic routing approach came with the improvement, such that each sensor has to select its forwarder from a set of its candidates according to their routing probabilities, based on its neighborhood knowledge, thus providing a longer network lifetime.From the existing probabilistic and deterministic protocols, we concluded that to minimize the energy consumption and prolong the network lifetime, the protocol should depend on three factors. Reference [11] proposed a Hop-based Routing Protocol based on an Energy Efficient Minimum Spanning Tree for WSN. From the simulation results, it was proved that the proposed protocol improved the network in terms of energy consumption and lifetime extension, hence the importance of the hop-count factor. Article [12] also considered this factor in the presented protocol called (STDD). The authors in [13] showed tha...

show abstract

Section: Radio Model Used For Pdtrmentioning

confidence: 99%

Section: Radio Model Used For Pdtrmentioning

confidence: 99%

“…depends on filtering, modulation, digital coding and signal spreading [26]. In this model, two channel models are used.…”

Section: Radio Model Used For Pdtrmentioning

confidence: 99%

Section: Control Parameters Upper Boundmentioning

confidence: 99%

See 2 more Smart Citations