Game theory-based IoT efficient power control in cognitive UAV
With the help of network densification, network coverage as well as the throughput can be improved via ultra-dense networks (UDNs). In tandem, Unmanned Aerial Vehicle (UAV) communications have recently garnered much attention because of their high agility as well as widespread applications. In this...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tech Science Press
2022
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/103266/1/NorafidaIthnin2022_GameTheoryBasedIoTEfficient.pdf http://eprints.utm.my/103266/ http://dx.doi.org/10.32604/cmc.2022.026074 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | With the help of network densification, network coverage as well as the throughput can be improved via ultra-dense networks (UDNs). In tandem, Unmanned Aerial Vehicle (UAV) communications have recently garnered much attention because of their high agility as well as widespread applications. In this paper, a cognitive UAV is proposed for wireless nodes power pertaining to the IoT ground terminal. Further, the UAV is included in the IoT system as the source of power for the wireless nodes as well as for resource allocation. The quality of service (QoS) related to the cognitive node was considered as a utility function based on pricing scheme that was modelled as a non-cooperative game theory in order to maximise users' net utility function. Moreover, an energy efficiency non-cooperative game theory power allocation with pricing scheme (EE-NGPAP) is proposed to obtain an efficient power control within IoT wireless nodes. Further, uniqueness and existence of the Nash equilibrium have been demonstrated mathematically and through simulation. Simulation results show that the proposed energy harvest algorithm demonstrated considerable decrease in transmitted power consumption in terms of average power reduction, which is regarded to be apt with the 5Gnetworks' vision. Finally, the proposed algorithm requires around 4 iterations only to converge to NE which makes the algorithm more suitable in practical heterogeneous scenarios. |
|---|