2016
DOI: 10.1007/978-981-287-990-5_18
|View full text |Cite
|
Sign up to set email alerts
|

Maximizing QoS in Heterogeneous Wireless Sensor Networks Using Game Theory and Learning Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…On the basis of predictability of TDMA schedule, the authors in [16] proposed a self-stabilizing hopconstrained energy-efficient (SHE) protocol for constructing minimum energy networks for hard real-time routing, which helped to meet the QoS requirements while prolonging the network lifetime. In [17], El Hammouti et al presented a game theory based approach to maximize quality of service of the aggregate frame success rate, while optimizing power allocation. In [9], Deepa and Suguna proposed a routing protocol RPAR (Greedy Realtime Power Aware Routing) that was adaptive to the QoS optimization in terms of end-to-end delay, packets delivery ratio and energy conservation.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…On the basis of predictability of TDMA schedule, the authors in [16] proposed a self-stabilizing hopconstrained energy-efficient (SHE) protocol for constructing minimum energy networks for hard real-time routing, which helped to meet the QoS requirements while prolonging the network lifetime. In [17], El Hammouti et al presented a game theory based approach to maximize quality of service of the aggregate frame success rate, while optimizing power allocation. In [9], Deepa and Suguna proposed a routing protocol RPAR (Greedy Realtime Power Aware Routing) that was adaptive to the QoS optimization in terms of end-to-end delay, packets delivery ratio and energy conservation.…”
Section: Related Workmentioning
confidence: 99%
“…For the rest of the neighbor nodes, such as node w, its path ETT value P ett (v, w) is compared with that of minimum variable P min ett (line 15). If P ett (v, w) is less than P min ett , P min ett will be updated and node w is temporarily recognized as the best candidate (lines [16][17][18]. With the execution of this phase, node v can select a reasonable candidate parent node based on a comprehensive consideration of the expected transmission cost and the expected transmission delay under asynchronous duty-cycled LPL modes.…”
Section: Qos Aware Routing Metrics and Algorithmmentioning
confidence: 99%
See 1 more Smart Citation