LORA: Load-Balanced Opportunistic Routing for Asynchronous Duty-Cycled WSN

Hawbani, Ammar; Wang, Xingfu; Sharabi, Yaser; Ghannami, Aiman; Kuhlani, Hassan; Karmoshi, Saleem

doi:10.1109/tmc.2018.2865485

Cited by 57 publications

(58 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Of 22mentioning

confidence: 99%

“…The set of candidate parents of the node need new-parent n np ; CP np = C np , is defined by Equation (17).…”

Section: Cp Npmentioning

confidence: 99%

“…The nodes of the Sub-tree ( ), sub-tree rooted at the node , is defined by Equation (16). The set of candidate parents of the node need new-parent ; = , is defined by Equation (17).…”

Section: Radio Model Used For Pdtrmentioning

confidence: 99%

“…Hence, the importance of the last factor, the residual energy, for the lifetime extension is demonstrated here. The authors in [11,16,17] also considered this factor in their presented protocols.The main purpose of tree-based protocols is to ensure that no loops will be created when we have redundant paths in the network; with tree-based protocols, it is possible to avoid packet collisions. In [18], the authors proposed a new tree-based routing algorithm that reduces energy consumption.…”

mentioning

confidence: 99%

See 3 more Smart Citations

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

Ghoul

Djaidja

et al. 2020

Sensors

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: Of 22mentioning

confidence: 99%

“…The set of candidate parents of the node need new-parent n np ; CP np = C np , is defined by Equation (17).…”

Section: Cp Npmentioning

confidence: 99%

“…The nodes of the Sub-tree ( ), sub-tree rooted at the node , is defined by Equation (16). The set of candidate parents of the node need new-parent ; = , is defined by Equation (17).…”

Section: Radio Model Used For Pdtrmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

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

Ghoul

Djaidja

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…Opportunistic Routing (OR) [7][8][9][10] is a promising technology for improving routing performance through using the broadcast nature of wireless medium. In OR, a node broadcasts a packet to its neighbors, the node's neighbors then have the chance to receive/hear the packet, and hence, they can cooperate in packet forwarding.…”

Section: Introductionmentioning

confidence: 99%

OODT: Obstacle Aware Opportunistic Data Transmission for Cognitive Radio Ad Hoc Networks

Zhong

Yuan

et al. 2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

In recent years, a large number of smart devices will be connected in Internet of Things (IoT) using an ad hoc network, which needs more frequency spectra. The cognitive radio (CR) technology can improve spectrum utilization in an opportunistic communication manner for IoT, forming a promising paradigm known as cognitive radio ad hoc networks, CRAHNs. However, dynamic spectrum availability and mobile devices/persons make it difficult to develop an efficient data transmission scheme for CRAHNs under an obstacle environment. Opportunistic routing can leverage the broadcast nature of wireless channels to enhance network performance. Inspired by this, in this paper, we propose an Obstacle aware Opportunistic Data Transmission scheme (OODT) in CRAHNs from a computational geometry perspective, considering energy efficiency and social features. In the proposed scheme, we exploit a new routing metric, which is based on an obstacle avoiding algorithm using a polygon boundary 1-searcher technology, and an auction model for selecting forwarding candidates. In addition, we prove that the candidate selection problem is NP-hard and propose a heuristic algorithm for candidate selection. The simulation results show that the proposed scheme can achieve better performance than existing schemes.

show abstract