Next Article in Journal
Improvement of Fast Simplified Successive-Cancellation Decoder for Polar Codes
Previous Article in Journal
Integration of Context Information through Probabilistic Ontological Knowledge into Image Classification
Open AccessArticle

Group Buying-Based Data Transmission in Flying Ad-Hoc Networks: A Coalition Game Approach

1
The College of Communications Engineering, Army Engineering University of PLA, Nanjing 210000, China
2
Key Embedded Technology and Intelligent System Laboratory, College of Information Science and Engineering, Guilin University of Technology, Guilin 541006, China
3
PLA 75836 Troops, Guangzhou 510400, China
*
Author to whom correspondence should be addressed.
Information 2018, 9(10), 253; https://doi.org/10.3390/info9100253
Received: 13 September 2018 / Revised: 4 October 2018 / Accepted: 11 October 2018 / Published: 15 October 2018
(This article belongs to the Section Information and Communications Technology)
In scenarios such as natural disasters and military strikes, it is common for unmanned aerial vehicles (UAVs) to form groups to execute reconnaissance and surveillance. To ensure the effectiveness of UAV communications, repeated resource acquisition issues and transmission mechanism designs need to be addressed urgently. Since large-scale UAVs will generate high transmission overhead due to the overlapping resource requirements, in this paper, we propose a resource allocation optimization method based on distributed data content in a Flying Ad-hoc network (FANET). The resource allocation problem with the goal of throughput maximization is constructed as a coalition game framework. Firstly, a data transmission mechanism is designed for UAVs to execute information interaction within the coalitions. Secondly, a novel mechanism of coalition selection based on group-buying is investigated for UAV coalitions to acquire data from the central UAV. The data transmission and coalition selection problem are modeled as coalition graph game and coalition formation game, respectively. Through the design of the utility function, we prove that both games have stable solutions. We also prove the convergence of the proposed approach with coalition order and Pareto order. Based on simulation results, coalition order based coalition selection algorithm (CO-CSA) and Pareto order based coalition selection algorithm (PO-CSA) are proposed to explore the stable coalition partition of system model. CO-CSA and PO-CSA can achieve higher data throughput than the contrast onetime coalition selection algorithm (Onetime-CSA) (at least increased by 34.5% and 16.9%, respectively). Besides, although PO-CSA has relatively lower throughput gain, its convergence times is on average 50.9% less than that of CO-CSA, which means that the algorithm choice is scenario-dependent. View Full-Text
Keywords: coalition formation game; coalition graph game; data transmission; Nash equilibrium; resource allocation; unmanned aerial vehicle (UAV) coalition formation game; coalition graph game; data transmission; Nash equilibrium; resource allocation; unmanned aerial vehicle (UAV)
Show Figures

Figure 1

MDPI and ACS Style

Ruan, L.; Chen, J.; Guo, Q.; Zhang, X.; Zhang, Y.; Liu, D. Group Buying-Based Data Transmission in Flying Ad-Hoc Networks: A Coalition Game Approach. Information 2018, 9, 253.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop