2017
DOI: 10.1007/s11277-017-4586-4
|View full text |Cite
|
Sign up to set email alerts
|

Link Quality Based Opportunistic Routing Algorithm for QOS: Aware Wireless Sensor Networks Security

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 21 publications
0
7
0
Order By: Relevance
“…But this process is slightly different in the QoS method [7]. In QoS routing protocol the route from the source node A and the destination node G the route selection will be based on minimum bandwidth [10]. The route here is from A,B,G.…”
Section: A Related Workmentioning
confidence: 99%
“…But this process is slightly different in the QoS method [7]. In QoS routing protocol the route from the source node A and the destination node G the route selection will be based on minimum bandwidth [10]. The route here is from A,B,G.…”
Section: A Related Workmentioning
confidence: 99%
“…The main aim of such sensors is observing the targeting object and sending the information toward network users for necessary actions. However, smart sensors have very limited capabilities and with time, they degrade the network performance especially in terms of energy and computational power [27][28][29]. Furthermore, due to the unpredictable behavior of sensors and some external sources, the conditions of WSNs are changed promptly.…”
Section: Related Workmentioning
confidence: 99%
“…In [18], an Optimized QoS-based Clustering with Multipath Routing Protocol (OQoS-CMRP) was proposed for WSNs to reduce the energy consumption in sink coverage area by applying the Modified Particle Swarm Optimization (PSO)-based clustering algorithm. El Hammouti et al [19] proposed a novel link quality based opportunistic routing method, where its algorithm selected the relay nodes based on OR theory to enhance the lifetime of whole network and feasibly create the ideal transmission distance for energy saving. In [20], multi-hop gateway node was implemented with both protocol to achieve maximum lifetime and energy efficiency, whereby the optimal algorithm respectively computed least possible adequate dominating sets and constantly preserved QoS requirements across iterations.…”
Section: Related Workmentioning
confidence: 99%
“…In phase 1 (lines 1-19), node v firstly initializes some variables with certain values (lines 1-2). For each entry entry in node v's routing table, ETX and ETT are calculated by Equation (18) and Equation (19), respectively (lines 5-6). Then node v calculates its path ETT value P ett (v, w) by adding the ETT v,w value with the path ETT value P ett (w, k) of its neighbor w, where P ett (w, k) can be obtained from the state exchange using beacon and saved in the routing table (line 7).…”
Section: Qos Aware Routing Metrics and Algorithmmentioning
confidence: 99%