Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Next Article in Journal
Static Electromechanical Characteristic of a Three-Layer Circular Piezoelectric Transducer
Next Article in Special Issue
Enhancing the Sensor Node Localization Algorithm Based on Improved DV-Hop and DE Algorithms in Wireless Sensor Networks
Previous Article in Journal
Thermal Infrared Imagery Integrated with Terrestrial Laser Scanning and Particle Tracking Velocimetry for Characterization of Landslide Model Failure
Previous Article in Special Issue
Self-Adaptive Filtering Approach for Improved Indoor Localization of a Mobile Node with Zigbee-Based RSSI and Odometry
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

Towards Security Joint Trust and Game Theory for Maximizing Utility: Challenges and Countermeasures

1
College of Physics and Electronic Information Engineering, Qinghai University for Nationalities, Xining 810007, China
2
Shanghai Research Center for Wireless Communication, Shanghai 201899, China
3
Key Laboratory of Wireless Sensor Network & Communication, Shanghai Institute of Micro-System and Information Technology, Chinese Academy of Sciences, Shanghai 201800, China
4
School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China
5
State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang 110819, China
*
Author to whom correspondence should be addressed.
Sensors 2020, 20(1), 221; https://doi.org/10.3390/s20010221
Submission received: 26 November 2019 / Revised: 23 December 2019 / Accepted: 27 December 2019 / Published: 30 December 2019

Abstract

:
The widespread application of networks is providing a better platform for the development of society and technology. With the expansion of the scope of network applications, many issues need to be solved. Among them, the maximization of utility and the improvement of security have attracted much attention. Many existing attacks mean the network faces security challenges. The concept of trust should be considered to address these security issues. Meanwhile, the utility of the network, including efficiency, profit, welfare, etc., are concerns that should be maximized. Over the past decade, the concepts of game and trust have been introduced to various types of networks. However, there is a lack of research effort on several key points in distributed networks, which are critical to the information transmission of distributed networks, such as expelling malicious nodes quickly and accurately and finding equilibrium between energy assumption and high transmission rate. The purpose of this paper is to give a holistic overview of existing research on trust and game theory in networks. We analyzed that network utility can be maximized in terms of effectiveness, profits, and security. Moreover, a possible research agenda is proposed to promote the application and development of game theory and trust for improving security and maximizing utility.

1. Introduction

Our demand for network performance is growing. In common networks, such as distributed networks, social networks, and centralized networks, they usually have several common goals: Maximum efficiency, profit maximization, and network security improvement. There are often some risks in the normal information transmission or interaction process. For instance, malicious attacks or deceit will reduce the security of the network and even destroy the availability of the network. In this scenario, it is of utmost importance to improve the reliability of the communication link and maximize the utility of the network. In the current big data environment, the application of sensor-cloud has higher requirements for maximizing utility [1]. In recent years, some researchers have tried to improve network reliability by establishing trust models, schemes, or mechanisms, and have achieved some research results [2].
Trust concept has been widely applied in the field of network technology. Different researchers have different definitions and understandings of trust based on the different purposes and perspectives. Trust is a very broad concept, which is connected with the concepts of reliance, security, and accountability. Therefore, trust is introduced into the networks, which provides new ideas to solve the problems of network security and reliability. The application of trust in networks usually appears in the form of trust models and mechanisms. By calculating the trust value, the reliability of the network is evaluated. After determining the reliability of the network, how to choose a more efficient transmission path or information sharing party is also crucial. As a result, the application of decision mechanism has been expanded.
As a decision-making theory, game theory has been introduced in networks. The game takes place under the constraints of certain game rules, based on direct interaction of environmental conditions. Each player chooses their own strategies/actions based on the information they have in order to maximize their own profit. Game theory, as a mathematical modeling method to help rational decision makers choose conflict or cooperation in order to find an optimal behavior strategy, is widely used in various fields [3], such as biology, computer science, military strategy, sociology, etc.
There are some basic elements in the game, including player, strategy, payoff, outcome, and equilibrium. The basic assumption of game theory is that the decision-making subject is rational. Rationality refers to the strategy that players choose to maximize their returns, in order to maximize their payoff functions. The classification of game has different classification according to different benchmarks. According to whether a binding agreement is reached between the players, the game can be divided into cooperative game and non-cooperative game. It can be divided into static game and dynamic game according to whether the actions of the players are in order. In a static game, the latter does not know what strategy the first player has adopted. In a dynamic game, the latter can observe the choices made by the first player. According to the players’ full understanding of the game strategy and other players, the game is divided into complete information game and incomplete information game. In a complete information game, each player has precise information about other players, such as the strategy space and payoff function. In an incomplete information game, at least one player does not have accurate enough information about the other players. Different types of games can be used to represent different game models.
In order to have better utility, researchers have introduced the concepts of trust and game in different application scenario. By investigating the literature over the past 10 years, we have learned some of the current research status of game theory and trust. Through analysis, the application scenarios are roughly classified. In this literature, the author introduces game models into network/system to achieve specific goals. These goals can be roughly divided into the following categories: (1) Improve the network security. The improvements of network security include data protection, prevention attacks, and eliminating of malicious nodes. Game theory is used to establish an attack defense system to prevent attacks [4]. Game and trust are applied to the network at the same time, and related mechanisms are established to eliminate malicious nodes to protect the security of data [5]. (2) Maximizing utility, such as improving social efficiency and maximizing the profits of players. In the power network, the profits of suppliers and customers are often improved through games. In some networks, players’ profits are maximized through resource allocation [6]. It is also used to establish a routing mechanism or incentive to select strategies through games and improve the performance of the network [7,8,9]. Especially in the process of data transmission, the selection of sensors or nodes has a good application prospect [10,11].
In the network, not all players to which game theory is applied are perfectly rational. Thus, evolutionary game theory has been proposed. In terms of methodology, it differs from game theory’s emphasis on static equilibrium, which emphasizes a dynamic equilibrium [12]. In the application of games, in order to achieve equilibrium, players usually face the choice of competition or cooperation. Similarly, in systems with agents, competitiveness strongly increases cooperation [13]. Cooperation in the network is based on trust. As the application scenarios of games and trust, networks can be divided into various forms. Typical networks are distributed networks, centralized networks, and social networks. In a distributed network, the number of nodes is large, the structure is complex, and the connections are diverse. Centralized networks are prone to network congestion. The relationships of players in social networks are complex and dynamic. All three networks can be called complex networks. The study of complex network models has a certain guiding role in dealing with the problems existing in real networks. The structure of a system and the structure of a network are closely related to its functions. Each of the three networks covered in this paper has its own topology. The change of the topology structure affects the utility and security in the network. The relationship between trust, game theory, and networks is shown in Figure 1.
Social network refers to a relatively stable relationship system formed by the interaction between individual members of society. Social networks represent a variety of social relationships. Trust and trustworthiness are very important in social and human systems, especially when considering human and economic decisions. Therefore, the design of the game model in these studies is based on the trust relationship of the players in application scenarios [14,15,16,17,18,19].
Distributed networks are interconnected by nodes at multiple terminal distributed in different locations. Reliability is a key characteristic of distributed networks and a key factor in ensuring network availability [20]. In distributed networks, networks are often subject to malicious attacks. These attacks can disrupt the transmission link of the network, which in turn disrupts network availability. How to choose a reliable node for transmission, and how to isolate malicious nodes out from the network quickly and accurately, are crucial [21,22,23]. To find the optimal choice in distributed network, game theory is an effective solution [24,25,26]. Combining a trust relationship between nodes and games can solve problems such as path selection in distributed networks.
A centralized network is a large central system. In a centralized network, all data are stored in a central system and the terminal is the client [27]. Its main advantage is that it is convenient for centralized management, but it also causes information congestion. In centralized networks, we often see the concept of agents. During the centralized management or acquisition of information, trust between agents and agents or agents and clients is especially important. Similarly, combining game theory and trust can well maintain normal interaction in centralized network [28].
The improvement of network utility is the improvement of various performance metrics in the network. Only when the various performance metrics are improved simultaneously can the utility of the network be maximized [29]. As a tool for strategy selection and conflict resolution, game theory can solve the problem of simultaneous improvement of network performance metrics well. At the same time, the improvement of network security is also crucial. Game theory and trust can be used to evaluate the trust of network players, thereby helping the network resist security issues such as malicious attacks [30,31]. Therefore, we believe that the introduction of game theory and trust can maximize the utility of the network.
In this paper, we offer a review of the research literature based on the type of game, trust, and application scenarios, studying their applications in maximizing utility and security. The rest of the paper is organized as follow: In Section 2, we review related works. In Section 3, the literature is classified by the type of game, and analyzed and compared. In Section 4, the literature is categorized based on trust-based applications. In Section 5, the application scenarios of game and trust are classified and summarized. In Section 6, the possible future research directions are proposed. In Section 7, this paper is summarized.

2. Relate Summarized Works

In this section, we briefly describe our research work from three aspects: The application of game theory, the application of trust, and the application of joint game theory and trust; and give some examples in the literature. Through the investigation of literature, we have concluded that most researchers use the following types of games: Dynamic game [32,33,34,35,36,37,38,39,40,41,42,43,44,45], static game [46], non-cooperative game [47,48,49,50,51], cooperative game [52,53,54,55,56,57,58,59], security game [60,61,62,63,64], and trust game [65,66,67,68,69].
Researchers using the dynamic game have established some mechanisms or solutions for application scenarios, solving the issues of maximizing utility in the networks/systems. The dynamic game also has some applications in solving problems related to network security [35], gaining a higher network lifetime in wireless sensor network, and obtaining higher secure caching ratio of heterogeneous networks [38,42], such as improving the bandwidth utilization, network throughput, and other performance [32,34,36]. In some application scenarios, the main purpose of the game is to make an optimal pricing strategy to achieve higher utility of the system [39,40]. In some application scenarios, players choose to cooperate and ultimately achieve a win–win situation. In device-to-device (D2D) communication, cooperative game theory can promote effective cooperation between devices and improve overall performance [53,56]. Players in non-cooperative games are in a competitive relationship and are very common in many applications. In mobile cloud computing, a non-cooperative game model is established based on the competition behavior of multiple clients to maximize mobile terminal energy efficiency [50]. The key factor in the security game and the trust game is trust [66]. In some cases, only when the players trust each other can they get the best results. The purpose of the security game is to improve the security of the system and promote information sharing [60,61,62,63,64]. In addition to the explicit type of game model, researchers have established some game models based on different application scenarios [70,71,72,73,74]. Most of these game models are established with the following objectives as the ultimate goal: To establish trust relationships and increase the credibility of data, to defend against malicious attacks in the network, to help the system by choosing a better strategy, and to maximize network utility by achieving these goals [75,76,77,78,79,80,81].
From the perspective of game theory, we can get the above types. We can also analyze and summarize the research literature from the perspective of trust and application scenarios. In this literature, researchers use trust relationships, trustworthiness, and other factors for decision-making. Based on trust, the researchers proposed some trust models [34,40,49,52,53,58,59,64,69,75,79], trust mechanisms [32,42,43,78,82], and trust frameworks [57]. They provide a better selection scheme for players in the network/system through trust evaluation. In mobile social networks, researchers have used trust evaluation to propose a reliable secure caching scheme, which saves cache time and improves secure caching ratio [49,51]. In terms of network security, researchers have established intrusion detection systems through games and trust management to improve the security network [47].
The concept of trust and game has been introduced into various fields. By introducing a dynamic game model, some researchers use trust relationships to build a game model, improving the security of the networks. They establish a strategic trust mechanism in the internet of things and cyber-physical systems and use game theory to capture the adversarial and strategic nature of cyber-physical systems security [37,43]. In sensor networks, cooperative game and trust model are also combined, improving network security and enhancing the accuracy of data transmission [52,58,59]. Through the analysis of these literature, we can conclude that there are three main types of application scenarios: Centralized networks, distributed networks, and social networks. In these networks, specific objectives are achieved using trust and game. Trust games are mostly used in systems with agents, providing solutions for trust decision-making and trust management and establishing a trust relationship between all players to maximize the utility of all players [66,68,69]. In cloud services, the number of malicious services is reduced through cooperative game and trust evaluation, improving service performance in terms of response time and throughput [57].
To the best of our knowledge, there are no review articles that use our classification criteria. Therefore, this paper will review this literature from the perspective of game type, trust, and application scenarios. Based on the results of the investigation, the future research directions are put forward. The research direction we have proposed is helpful in improving the security and utility of sensor networks.

3. Game Theory in Networks

Decision-making is a behavior that is prevalent in politics, economy, technology, and daily life. It can achieve specific objectives and make decisions on future behaviors by analyzing, calculating, and judging the achievement of the target. In the literature that we have researched, researchers have introduced game theory into the network to improve network utility in various aspects. In this section, we analyze and summarize the types of game cited in this literature. We divide the types of game into seven categories, as shown in Table 1.
By introducing a dynamic game, the researchers proposed solutions for several aspects of the network/system. In terms of strategy selection, they proposed introducing the game theory into the peer-to-peer (P2P) energy trading problem in industrial Internet of things (IIoT), proposing an optimal pricing strategy using Stackelberg game for credit-based loans in [39]. In the vehicular networks, the optimal strategies of energy entities are analyzed by using the game theory [40]. In the process of strategy selection, in order to jointly improve the network utility from multiple angles, we are often looking for equilibrium. To improve the network utility, it is necessary to introduce dynamic game into the key factors in the network and calculate the equilibrium between them. In a military tactical network, in resource-restricted tactical environment, the equilibrium between group trust and system lifetime is achieved, and mission effectiveness is improved [34]. Based on game theory, a dynamic behavior monitoring scheme for evidences collection in wireless sensor networks is proposed. Equilibrium between network security and energy conservation can be achieved [38]. Game theory as a strategy selection scheme has also been introduced into the intrusion response systems [29]. The game theory is used to investigate the interactions among edge computing-enabled small cell base stations (ECSBSs) and mobile users, and the Nash equilibrium is calculated to jointly maximize the utilities of ECSBSs and mobile users [42]. To improve network performance, we need to use game theory to capture the interaction between devices and the cloud and calculate Nash equilibrium [43]. In the context of big data, game theory is used to analyze the profits between doctors and patients, and thus improve the total benefit of the medical system [44].
In some networks/systems, the introduction of dynamic game promotes network security and resource sharing efficiency. In cognitive multi-hop cellular networks, a new cognitive radio bandwidth-sharing scheme is proposed based on game theory, and the bandwidth utilization is improved [32]. In the spectrum sharing scheme, using game theory to quantitatively analyze the interaction between the primary users and secondary users, it can promote spectrum sharing in a tiered manner [36]. Game theory is introduced into the network to perform modeling analysis to prevent malicious node attacks or leaky deception in the network and improve the secrecy rate in the network, thereby improving the security of the network [33,35,37,45]. In device-to-device communication, the introduction of game theory has increased the utility of operators [31]. In the smart grid in a large population regime, the introduction of game theory has maximized the profit of providers and users [18]. Contrary to dynamic game, static game is less used. In the literature [46], static game is introduced into cloud radio access network (C-RAN). Researchers analyzed whether the operators would like to collaborate with each other by applying game theory and improve the utility between operators. In [19], the problem of efficiently coordinating price-responsive appliances operating in the electricity market is tackled within a game theoretical framework.
According to whether the players cooperate, the game is divided into cooperative game and non-cooperative game. The common goal of both games can maximize network utility and improve network security. Combining the non-cooperative game model with trust management enables peers in the intrusion detection network to collaborate truthfully and actively [47]. In wireless sensor networks, the introduction of game theory improves the defense’s strategy and helps the network against malicious nodes [30]. In a network with mobile users/terminals, the introduction of a game model can improve the utility of mobile users [49,50]. In merchant transmission planning, the introduction of game theory can improve social efficiency [20,22]. In [24], a resource scheduling method for guaranteeing resource utilization and service performance is presented, maximizing the profits of players. The cooperative game is introduced into the network, which enables the network to maintain high security against malicious attacks and reduce malicious services [52,57,58,59]. In device-to-device communication, game theory is combined with social ties or social trust. It is used to promote efficient cooperation among devices in the network to improve network performance [53,54,56].
In some servers or authentication protocols, a security game is often introduced. The introduction of game theory improves security in systems or protocols [60,61,64]. In the system with information exchange, the establishment of the game model ensures the safe and reliable transmission of information [62,63].
In multi-agent systems, the trust issues of all parties are often involved. Finding a reliable agent in the system is crucial. The introduction of trust games into these systems has greatly helped the trust decisions in the system [66,68,69]. The introduction of trust game has provided dynamic decision-making for network proactive defense [6].
Some researchers have proposed specific game models for corresponding systems. Combining the game model with the trust relationship improves the reliability of the data in the network [75,76,80]. The introduction of the game model improves the security of the network and against external and internal attacks [14,70,72,74,77]. There are also some game models that provide great help for network or system strategy selection [27,71,78,79,81], or addressed the problem of resource allocation [26]. In [28], the introduction of game theory optimizes the probability of successful transmission probabilities of data and the caching probabilities in some networks.
By analyzing this literature, we can obtain the following conclusions. The introduction of game theory provides a new solution for improving network security and maximizing utility. The dynamic game model is used most widely in the use of game theory. This is because, in some networks/systems, players usually have some knowledge of the information and decisions of other players. Therefore, modeling it as a dynamic game is more appropriate. Cooperative game, non-cooperative game, and security game also occupy a certain proportion. When two or more metrics in the network are optimized for conflict, the introduction of game theory solves the problem. Researchers use equilibrium to solve multi-metric optimization conflicts, thereby maximizing network utility. In some networks, information or resources need to be shared. The introduction of game theory provides a good strategy for resource sharing. When there is a malicious attack in the network, whether it is an external attack or an internal attack, the combination of game theory and trust relationship provides a solution to solve the security problem.
In general, the introduction of game theory has maximized utility from the following aspects. (1) It improves the security and secrecy rate of the network, against malicious attacks, and reduce malicious services; (2) it maximizes the profits of players in the network, thereby maximizing network utility; and (3) it promotes information/resource sharing to provide network players with better strategy selection.

4. Trust Model, Trust Mechanism, and Trust Framework in Networks

The concept of trust has been widely introduced into networks. When there are multiple players in the network, trust becomes a key evaluation metric for each player’s decision-making [25]. Many scholars have introduced trust and reputation into the network, and improved network utility through trust management against various malicious attacks [65,67], improving network security. In the literature that we researched, the introduction of the concept of trust provides better performance for the network. Some researchers have evaluated key factors in the network by using trustworthiness or trust value [83,84]. Some researchers have introduced the trust model, trust mechanism, or trust framework in the network [85,86]. Here, we only classify and elaborate the trust model, trust mechanism, and trust framework, as shown in Table 2.
The trust model is introduced into the wireless sensor network, by using trust evaluation to improve the security of the network [52,58,64,87]. There are fixed relationships in some networks, such as social trust or social reciprocity. Modeling trust models based on these social relationships improves the data rate in D2D communications [53,79]. It can also improve social welfare in social networks [69]. For some networks with operators or mobile users, the introduction of the trust model provides good help for users’ choice [40,49]. In military tactical network and multi-agent systems, there are often multiple players. The introduction of the trust model promotes the trust relationship between players, thereby improving mission effectiveness [34,75]. The introduction of the trust mechanism is often to solve the problem of security and efficiency in the network [42,43]. For example, in a P2P network, the trust mechanism can help peers make interaction decisions and prevent malicious peers [82]. Trust mechanisms can also increase the efficiency of spectrum and bandwidth sharing in the network [32,78]. The information sharing and interaction in the network are carried out normally, and the overall efficiency of the network is improved [17]. In the fight against collusion attacks in the cloud service community, the introduction of a trust framework minimizes the number of malicious services [57]. In [15], researchers have proposed a dynamic trust framework to detect selfish and malicious nodes, and the entire network utility has been improved. Not only for the network, but the routing protocols also improve their security due to the introduction of trust [21].
The introduction of trust provides a solution to maximizing network utility from another perspective. Different from the introduction of game theory, the introduction of trust is more targeted. Trust is introduced in networks that have trust relationships. In these networks, trust is an important metric for information interaction [73]. The introduction of the trust model mainly solved the problems of social welfare and social efficiency. The introduction of trust mechanism and trust framework solved the problem of resource sharing and malicious attacks. Therefore, the use of trust to solve problems in the network has broad research prospects.

5. Analysis and Comparison Based on Application Scenarios

We have classified the scenarios of game theory and trust application. It is mainly divided into three types of application scenarios: Centralized network, distributed network, and social network. We refined the metrics involved in evaluating network utility for different application scenarios, as shown in Figure 2 and Table 3. We have summarized it in the first subsection. The second subsection discussed the differences between the application of game theory to different types of networks (i.e., social networks, centralized networks, distributed networks).

5.1. Application Scenarios

A centralized network facilitates data management. In a centralized network, data are processed centrally and all information is managed by a database. The terminal is only used for input and output. In our research literature, researchers combine game theory and trust to optimize networks or systems, including wireless network, cyber-physical systems, multi-agent system, and other application scenarios. In a centralized network, utility is typically evaluated by using the following metrics: Secure caching ratio and average saved time [42,49,51]; service cost, service quality, or transmission overhead [54,70,74]; social welfare [68,83]; network throughput or total amount of data transferred [32,78]; energy efficiency or operation efficiency [46,50]; or detecting the network’s against attack ability and defense costs through simulation experiments [37,43,81].
Distributed networks have high reliability. All nodes are randomly distributed in the network and there is no management of the central node. There are many path selections during information transmission, and resource sharing is easy, but it is vulnerable to malicious nodes. In a distributed network, network performance is often evaluated through security and efficiency [52,55,82,84], or metrics based on energy efficiency, trustworthiness of data transmission, and cost-efficiency [38,39,47,58,59].
In social networks, each member of the society has formed a relatively stable relationship system due to interaction. Social networks often represent a variety of social relationships. The social network can be either an individual or an organization. In social networks, network throughput and data storage rate are often used as evaluation metrics [15,57,79,85]; or energy efficiency, information transmission rate, and social welfare are used as metrics [48,53,69]. There are also some social networks that protect players’ privacy through trust evaluation [16].
In summary, different networks have different metrics. Centralized networks are prone to network congestion, so their metrics are often related to transmission efficiency or time overhead. Distributed networks are vulnerable to various attacks, so their metrics are often related to security and accuracy. Social networks are most concerned with social efficiency, therefore often assessed on the basis of throughput and social welfare. The introduction of game theory and trust provides a good solution for improving these metrics in the network.

5.2. Differences in Applying Game Theory in Different Networks

Different types of networks have different topologies and therefore face different problems. The three networks discussed in this paper are members of complex networks, and their network characteristics determine the different applications of game theory in networks. The characteristics of centralized data management in a centralized network cause problems such as being prone to network congestion and slow processing speed. The application of game theory in centralized networks can ensure convenient data processing in the network while improving the efficiency of the network (that is, maximizing the network utility in terms of transmission overhead and effectiveness). The combination of trust and game theory can better ensure the security and reliability of information storage. In a distributed network (such as a typical wireless sensor network), a large number of nodes are randomly distributed in the network, and the structure of the network is complex and changeable. The application of game theory and trust in distributed networks can help the network form reliable transmission links. While ensuring the reliability of the network, it also ensures the security of information transmission, resists malicious attacks, and maximizes the utility of the network. In social networks, the relationships between players are complex and dynamically changing, especially the trust relationships between players. The introduction of game theory and trust helps players in social networks to better cooperation and maximize network utility.

6. Future Research Direction

In the literature we researched, we analyzed that the structure of the network is basically fixed in centralized networks and social networks. Once these fixed links have problems, it is hard to solve them quickly. It may cause the network to be unavailable in a short time. Especially when the management node fails, it will affect the working efficiency of the whole network. In the case of large network traffic, it may affect data transmission efficiency. Thus, the distributed network reflects its own advantages. The main feature of the distributed network is that there is no central node in the network, and the communication control functions are distributed on each node. The reliability of the distributed network is high, and the nodes in the network share the resources conveniently, and it can also improve the information flow distribution of the line. The sensor network is the main representative of the current distributed network. However, in the literature that we researched, fewer researchers have introduced game theory and trust into sensor networks.
In the existing literature, the researchers only considered part of the network performance; for example, network security, network lifetime, and data forwarding rate [38,58]. It does not consider how to choose a reliable node for data transmission. Nor did it suggest how to expel a malicious node from the network as soon as possible to ensure the security of the network. There is also no better strategy between network energy consumption and higher transmission efficiency. In future research work, we can introduce the concepts of game theory and trust into sensor networks. According to the characteristics of the sensor network, relevant mechanisms/strategies can be formulated to improve the transmission efficiency and security of the network and to select the security node and expel malicious nodes quickly and accurately. It is also possible to find equilibrium between low power consumption and high transmission efficiency through game theory. The network security, reliability, and other metrics can be optimized.

7. Conclusions

This paper starts from the perspective of game theory and trust and classifies and compares the research literature. The results of research on maximizing utility and improving security were studied. The application scenarios of these game theories are analyzed. Through analysis, most researchers have cited dynamic game and non-cooperative game. Trust is also widely used in the network, trust value, and trust account for the majority. Some literature use trust for modeling to form the trust model, trust mechanism, or trust framework. The concepts of game theory and trust have been introduced into various networks in the literature of research. It can be roughly divided into social networks, centralized networks, and distributed networks. However, no researchers have applied the combination of game theory and trust to sensor networks.
Our contribution mainly involves two aspects: (1) Through the work of Section 3, Section 4, and Section 5, the combination of trust and game theory can improve network utility from three aspects: Against malicious attacks, maximizing the profits of players, and improving resource efficiency, especially in terms of security. (2) We point out potential research directions based on the overall trends observed from the survey results. We believe that game theory as a theory to resolve conflict situations can solve some conflict situations in sensor networks: Trustworthiness and efficiency. The concept of trust can also be used as an effective evaluation metric when the network node selects the next node. Trust can also be used for network security evaluation: To discover malicious nodes and expel them from the network as soon as possible. We believe that the combination of game theory and trust can simultaneously improve the overall network utility and network security. Overcoming the shortcomings of vulnerability and energy limitation in sensor networks makes sensor networks run more efficiently. Therefore, in future research, we can introduce game theory and trust into the sensor network to maximizing utility and improving network security.

Author Contributions

The five authors of the paper have extensively participated in all of the paper writing. L.H. mainly worked on the researched. W.F. and W.Z. revised this paper. G.J. and W.C. mainly added to and revised the related works. All of the authors equally contributed to reviewing the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This work is partially supported by the National Natural Science Foundation of China (No. 51874300, No. 61571004), the National Natural Science Foundation of China and Shanxi Provincial People’s Government Jointly Funded Project of China for Coal Base and Low Carbon (No. U1510115), the Shanghai Sailing Program (No. 19YF1455800), the Shanghai Natural Science Foundation (No. 17ZR1428900), National Key Research and Development Program of China (No. 2019YFB2101602), and the Science and Technology Innovation Program of Shanghai (No. 17DZ1200302, No. 17DZ2292000).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zhu, C.S.; Shu, L.; Leung, V.C.M.; Guo, S.; Zhang, Y.; Yang, L.T. Secure Multimedia Big Data in Trust-Assisted Sensor-Cloud for Smart City. IEEE Commun. Mag. 2017, 55, 24–30. [Google Scholar] [CrossRef]
  2. Zhu, C.S.; Leung, V.C.M.; Rodrigues, J.J.P.C.; Shu, L.; Wang, L.; Zhou, H. Social Sensor Cloud: Framework, Greenness, Issues, and Outlook. IEEE Netw. 2018, 32, 100–105. [Google Scholar] [CrossRef]
  3. John, L.; McCormick, P.; McCormick, T.; McNeill, G.R.; Boardman, J. Working to Understand Cooperative Forces in Government Extended Enterprises: Concepts and Methodology. IEEE Syst. J. 2012, 6, 675–687. [Google Scholar] [CrossRef]
  4. Lian, B.; Chen, G.L.; Ma, M.D.; Li, J.H. Periodic K-Times Anonymous Authentication with Efficient Revocation of Violator’s Credential. IEEE Trans. Inf. Foren. Sec. 2015, 10, 543–557. [Google Scholar] [CrossRef]
  5. Zeng, P.; Choo, K.R. A New Kind of Conditional Proxy Re-Encryption for Secure Cloud Storage. IEEE Access 2018, 6, 70017–70024. [Google Scholar] [CrossRef]
  6. Hu, H.; Liu, Y.L.; Zhang, H.Q.; Pan, R.X. Optimal Network Defense Strategy Selection Based on Incomplete Information Evolutionary Game. IEEE Acess 2018, 6, 29806–29821. [Google Scholar] [CrossRef]
  7. Wu, Y.W.; Tang, S.J.; Xu, P.; Li, X.Y. Dealing with Selfishness and Moral Hazard in Noncooperative Wireless Networks. IEEE Trans. Mob. Comput. 2010, 9, 420–434. [Google Scholar]
  8. Haruna, K.; Ismail, M.A.; Suyanto, M.; Gabralla, L.A.; Bichi, A.B.; Danjuma, S.; Kakudi, H.A.; Haruna, M.S.; Zerdoumi, S.; Abawajy, J.H.; et al. A Soft Set Approach for Handling Conflict Situation on Movie Selection. IEEE Access 2019, 7, 116179–116194. [Google Scholar] [CrossRef]
  9. Pan, H.Y.; Song, F.; Cao, Y.Z.; Qian, J.Y. Fuzzy Pushdown Termination Games. IEEE Trans. Fuzzy Syst. 2019, 27, 760–774. [Google Scholar] [CrossRef]
  10. Zhu, C.S.; Leung, V.C.M.; Wang, K.; Yang, L.T.; Zhang, Y. Multi-Method Data Delivery for Green Sensor-Cloud. IEEE Commun. Mag. 2017, 55, 176–182. [Google Scholar] [CrossRef]
  11. Zhu, C.S.; Li, X.H.; Leung, V.C.M.; Yang, L.T.; Ngai, E.C.-H.; Shu, L. Towards Pricing for Sensor-Cloud. IEEE Trans. Cloud. Comput. 2017. [Google Scholar] [CrossRef]
  12. Javarone, M.A.; Atzeni, A.E. The role of competitiveness in the Prisoner’s Dilemma. Comput. Soc. Netw. 2015. [Google Scholar] [CrossRef] [Green Version]
  13. Javarone, M.A. Statistical Physics and Computational Methods for Evolutionary Game Theory; Springer: Berlin/Heidelberg, Germany, 2018. [Google Scholar]
  14. Li, Y.Z.; Quevedo, D.E.; Dey, S.; Shi, L. A Game-Theoretic Approach to Fake-Acknowledgment Attack on Cyber-Physical Systems. IEEE Trans. Signal. Inf. Pr. 2017, 3, 1–11. [Google Scholar] [CrossRef] [Green Version]
  15. Wang, E.K.; Li, Y.P.; Ye, Y.M.; Yiu, S.M.; Hui, L.C.K. A Dynamic Trust Framework for Opportunistic Mobile Social Networks. IEEE Trans. Netw. Serv. 2018, 15, 319–329. [Google Scholar] [CrossRef]
  16. Yan, Z.; Wang, H.G.; Yang, L.T.; Niemi, V. IEEE Access Special Section Editorial: Trust Management in Pervasive Social Networking (TruPSN). IEEE Access 2018, 6, 16851–16854. [Google Scholar] [CrossRef]
  17. Fang, W.D.; Xu, M.; Zhu, C.S.; Han, W.L.; Zhang, W.X.; Rodrigues, J.J.P.C. FETMS: Fast and Efficient Trust Management Scheme for Information-Centric Networking in Internet of Things. IEEE Access 2019, 7, 13476–13485. [Google Scholar] [CrossRef]
  18. Maharjan, S.; Zhu, Q.Y.; Zhang, Y.; Gjessing, S.; Başar, T. Demand Response Management in the Smart Grid in a Large Population Regime. IEEE Trans. Smart Grid 2016, 7, 189–199. [Google Scholar] [CrossRef]
  19. Paola, A.D.; Angeli, D.; Strbac, G. Price-Based Schemes for Distributed Coordination of Flexible Demand in the Electricity Market. IEEE Trans. Smart Grid 2017, 8, 3104–3116. [Google Scholar] [CrossRef]
  20. Paola, A.D.; Papadaskalopoulos, D.; Angeli, D.; Strbac, G. Investigating the Social Efficiency of Merchant Transmission Planning Through a Non-cooperative Game-Theoretic Framework. IEEE Trans. Power Syst. 2018, 33, 4831–4841. [Google Scholar]
  21. Fang, W.D.; Zhang, W.X.; Chen, W.; Liu, Y.; Tang, C.G. TMSRS: Trust management-based secure routing scheme in industrial wireless sensor network with fog computing. Wirel. Netw. 2019. [Google Scholar] [CrossRef]
  22. Gong, X.; Paola, A.D.; Angeli, D.; Strbac, G. Distributed Coordination of Flexible Loads Using Locational Marginal Prices. IEEE Trans. Control Netw. 2019, 6, 1097–1110. [Google Scholar] [CrossRef] [Green Version]
  23. Huang, W.; Zhang, L.; Huang, Y.; Lou, J. Allocating Indivisible Objects with a Parallel Method Insensitive to Identities. IEEE Access 2017, 5, 22880–22891. [Google Scholar] [CrossRef]
  24. Borjigin, W.; Ota, K.; Dong, M.X. In Broker We Trust: A Double-Auction Approach for Resource Allocation in NFV Markets. IEEE Trans. Netw. Serv. 2018, 15, 1322–1333. [Google Scholar] [CrossRef] [Green Version]
  25. Zhu, C.S.; Rodrigues, J.J.P.C.; Leung, V.C.M.; Shu, L.; Yang, L.T. Trust-Based Communication for the Industrial Internet of Things. IEEE Commun. Mag. 2018, 56, 16–22. [Google Scholar] [CrossRef]
  26. Yin, F.F.; Wang, A.Y.; Liu, D.P.; Zhang, Z.L. Energy-Aware Joint User Association and Resource Allocation for Coded Cache-Enabled HetNets. IEEE Access 2019, 7, 94128–94142. [Google Scholar] [CrossRef]
  27. Chen, J.; He, K.; Yuan, Q.; Xue, G.L.; Du, R.Y.; Wang, L. Batch Identification Game Model for Invalid Signatures in Wireless Mobile Networks. IEEE Trans. Mob. Comput. 2017, 16, 1530–1543. [Google Scholar] [CrossRef]
  28. Cui, Y.; Wang, Z.T.; Yang, Y.; Yang, F.; Ding, L.H.; Qian, L. Joint and Competitive Caching Designs in Large-Scale Multi-Tier Wireless Multicasting Networks. IEEE Trans. Commun. 2018, 66, 3108–3121. [Google Scholar] [CrossRef] [Green Version]
  29. Zonouz, S.A.; Khurana, H.; Sanders, W.H.; Yardley, T.M. RRE: A Game-Theoretic Intrusion Response and Recovery Engine. IEEE Trans. Parall. Distr. 2014, 25, 395–406. [Google Scholar] [CrossRef]
  30. Basilico, N.; Gatti, N.; Monga, M.; Sicari, S. Security Games for Node Localization through Verifiable Multilateration. IEEE Trans. Depend. Secure 2014, 11, 72–85. [Google Scholar] [CrossRef] [Green Version]
  31. Shi, L.Q.; Zhao, L.Q.; Zheng, G.; Han, Z.; Ye, Y.H. Incentive Design for Cache-Enabled D2D Underlaid Cellular Networks Using Stackelberg Game. IEEE Trans. Veh. Technol. 2019, 68, 765–779. [Google Scholar] [CrossRef]
  32. Kim, S. Reversed Stackelberg bandwidth-sharing game for cognitive multi-hop cellular networks. IET Commun. 2012, 6, 2907–2913. [Google Scholar] [CrossRef]
  33. Ho, J.; Wright, M.; Das, S.K. ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Wireless Sensor Networks Using Sequential Hypothesis Testing. IEEE Trans. Depend. Secure 2012, 9, 494–511. [Google Scholar] [CrossRef]
  34. Cho, J. Tradeoffs Between Trust and Survivability for Mission Effectiveness in Tactical Networks. IEEE Trans. Cybern. 2015, 45, 754–766. [Google Scholar] [CrossRef] [PubMed]
  35. Al-Talabani, A.; Deng, Y.S.; Nallanathan, A.; Nguyen, H.X. Enhancing Secrecy Rate in Cognitive Radio Networks via Multilevel Stackelberg Game. IEEE Commun. Lett. 2016, 20, 1112–1115. [Google Scholar] [CrossRef]
  36. Muthukumar, V.; Sahai, A. Fundamental Limits onEx-Post Enforcement and Implications for Spectrum Rights. IEEE Trans. Cogn. Commun. Netw. 2017, 3, 491–504. [Google Scholar] [CrossRef]
  37. Pawlick, J.; Zhu, Q.Y. Strategic Trust in Cloud-Enabled Cyber-Physical Systems with an Application to Glucose Control. IEEE Trans. Inf. Foren. Sec. 2017, 12, 2906–2919. [Google Scholar] [CrossRef]
  38. Yang, L.; Lu, Y.Z.; Liu, S.; Guo, T.; Liang, Z.F. A Dynamic Behavior Monitoring Game-Based Trust Evaluation Scheme for Clustering in Wireless Sensor Networks. IEEE Access 2018, 6, 71404–71412. [Google Scholar] [CrossRef]
  39. Li, Z.T.; Kang, J.W.; Yu, R.; Ye, D.D.; Deng, Q.Y.; Zhang, Y. Consortium Blockchain for Secure Energy Trading in Industrial Internet of Things. IEEE Trans. Ind. Inform. 2018, 14, 3690–3700. [Google Scholar] [CrossRef] [Green Version]
  40. Wang, Y.T.; Su, Z.; Xu, Q.C.; Yang, T.T.; Zhang, N. A Novel Charging Scheme for Electric Vehicles with Smart Communities in Vehicular Networks. IEEE Trans. Veh. Technol. 2019, 68, 8487–8501. [Google Scholar] [CrossRef]
  41. Gao, H.M.; Ma, Z.F.; Luo, S.S.; Wang, Z. BFR-MPC: A Blockchain-Based Fair and Robust Multi-Party Computation Scheme. IEEE Access 2019, 7, 110439–110450. [Google Scholar] [CrossRef]
  42. Xu, Q.C.; Su, Z.; Zheng, Q.H.; Luo, M.N.; Dong, B.; Zhang, K. Game Theoretical Secure Caching Scheme in Multihoming Edge Computing-Enabled Heterogeneous Networks. IEEE Internet Things 2019, 6, 4536–4546. [Google Scholar] [CrossRef]
  43. Pawlick, J.; Chen, J.T.; Zhu, Q.Y. iSTRICT: An Interdependent Strategic Trust Mechanism for the Cloud-Enabled Internet of Controlled Things. IEEE Trans. Inf. Foren. Sec. 2019, 14, 1654–1669. [Google Scholar] [CrossRef]
  44. Niu, W.J.; Huang, J.Y.; Xing, Z.; Chen, J.B. Knowledge Spillovers of Medical Big Data Under Hierarchical Medical System and Patients’ Medical Treatment Decisions. IEEE Access 2019, 7, 55770–55779. [Google Scholar] [CrossRef]
  45. Pawlick, J.; Colbert, E.; Zhu, Q.Y. Modeling and Analysis of Leaky Deception Using Signaling Games with Evidence. IEEE Trans. Inf. Foren. Sec. 2019, 14, 1871–1886. [Google Scholar] [CrossRef] [Green Version]
  46. Tian, F.Y.; Yan, Z.; Liang, X.Q.; Zhang, P. Trusted Cooperation among Virtual Base Stations in C-RAN. IEEE Access 2018, 6, 57787–57801. [Google Scholar] [CrossRef]
  47. Zhu, Q.Y.; Fung, C.; Boutaba, R.; Basar, T. GUIDEX: A Game-Theoretic Incentive-Based Mechanism for Intrusion Detection Networks. IEEE J. Sel. Area Comm. 2012, 30, 2220–2230. [Google Scholar] [CrossRef]
  48. Anand, S.; Subbalakshmi, K.P.; Chandramouli, R. A Quantitative Model and Analysis of Information Confusion in Social Networks. IEEE Trans. Multimed. 2013, 15, 207–223. [Google Scholar] [CrossRef]
  49. Xu, Q.C.; Su, Z.; Wang, Y.T.; Dai, M.H. A Trustworthy Content Caching and Bandwidth Allocation Scheme with Edge Computing for Smart Campus. IEEE Access 2018, 6, 63868–63879. [Google Scholar] [CrossRef]
  50. Ahn, S.; Lee, J.; Park, S.; Newaz, S.H.S.; Choi, J.K. Competitive Partial Computation Offloading for Maximizing Energy Efficiency in Mobile Cloud Computing. IEEE Access 2018, 6, 899–912. [Google Scholar] [CrossRef]
  51. Xu, Q.C.; Su, Z.; Zheng, Q.H.; Luo, M.N.; Dong, B. Secure Content Delivery with Edge Nodes to Save Caching Resources for Mobile Users in Green Cities. IEEE Trans. Ind. Inform. 2018, 14, 2550–2559. [Google Scholar] [CrossRef]
  52. Duan, J.Q.; Gao, D.Y.; Yang, D.; Foh, C.H.; Chen, H. An Energy-Aware Trust Derivation Scheme with Game Theoretic Approach in Wireless Sensor Networks for IoT Applications. IEEE Internet Things 2014, 1, 58–69. [Google Scholar] [CrossRef]
  53. Chen, X.; Proulx, B.; Gong, X.W.; Zhang, J.S. Exploiting Social Ties for Cooperative D2D Communications: A Mobile Social Networking Case. IEEE ACM Trans. Netw. 2015, 23, 1471–1484. [Google Scholar] [CrossRef]
  54. Cao, Y.; Jiang, T.; Chen, X.; Zhang, J.S. Social-Aware Video Multicast Based on Device-to-Device Communications. IEEE Trans. Mob. Comput. 2016, 15, 1528–1539. [Google Scholar] [CrossRef]
  55. Cho, J.; Wang, Y.T.; Chen, I.; Chan, K.S.; Swami, A. A Survey on Modeling and Optimizing Multi-Objective Systems. IEEE Commun. Surv. Tut. 2017, 19, 1867–1901. [Google Scholar] [CrossRef]
  56. Waqas, M.; Ahmed, M.; Li, Y.; Jin, D.P.; Chen, S. Social-Aware Secret Key Generation for Secure Device-to-Device Communication via Trusted and Non-Trusted Relays. IEEE Trans. Wirel. Commun. 2018, 17, 3918–3930. [Google Scholar] [CrossRef] [Green Version]
  57. Wahab, O.A.; Bentahar, J.; Otrok, H.; Mourad, A. Towards Trustworthy Multi-Cloud Services Communities: A Trust-Based Hedonic Coalitional Game. IEEE Trans. Serv. Comput. 2018, 11, 184–201. [Google Scholar] [CrossRef]
  58. Abdalzaher, M.S.; Samy, L.; Muta, O. Non-zero-sum game-based trust model to enhance wireless sensor networks security for IoT applications. IET Wirel. Sens. Syst. 2019, 9, 218–226. [Google Scholar] [CrossRef]
  59. Rani, R.; Kumar, S.; Dohare, U. Trust Evaluation for Light Weight Security in Sensor Enabled Internet of Things: Game Theory Oriented Approach. IEEE Internet Things 2019, 6, 8421–8432. [Google Scholar] [CrossRef]
  60. Wu, Q.H.; Qin, B.; Zhang, L.; Domingo-Ferrer, J.; Farràs, O.; Manjón, J.A. Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts. IEEE Trans. Comput. 2016, 65, 466–479. [Google Scholar] [CrossRef]
  61. Ruan, O.; Chen, J.; Zhang, M.W. Provably Leakage-Resilient Password-Based Authenticated Key Exchange in the Standard Model. IEEE Access 2017, 5, 26832–26841. [Google Scholar] [CrossRef]
  62. John, L.; John, G.B.; Parker, M.; Sauser, B.J.; Wade, J.P. Self-Organizing Cooperative Dynamics in Government Extended Enterprises. IEEE Syst. J. 2018, 12, 2905–2916. [Google Scholar] [CrossRef]
  63. Wu, Y.Z.; Lyu, Y.Q.; Shi, Y.C. Cloud storage security assessment through equilibrium analysis. Tsinghua Sci. Technol. 2019, 24, 6. [Google Scholar] [CrossRef]
  64. Jin, C.L.; Dijk, M.V. Secure and Efficient Initialization and Authentication Protocols for SHIELD. IEEE Trans. Depend. Secure 2019, 16, 156–173. [Google Scholar] [CrossRef]
  65. Fang, W.D.; Zhang, W.X.; Yang, Y.; Yang, L.; Wei, C. A resilient trust management scheme for defending against reputation time-varying attacks based on BETA distribution. Sci. China Inform. Sci. 2017, 60. [Google Scholar] [CrossRef]
  66. Yu, H.; Shen, Z.Q.; Leung, C.; Miao, C.Y.; Lesser, V.R. A Survey of Multi-Agent Trust Management Systems. IEEE Access 2013, 1, 35–50. [Google Scholar]
  67. Fang, W.D.; Zhang, C.L.; Shi, Z.D.; Zhao, Q.; Shan, L.H. BTRES: Beta-based Trust and Reputation Evaluation System for Wireless Sensor Networks. J. Netw. Comput. Appl. 2016, 59, 88–94. [Google Scholar] [CrossRef]
  68. Abbass, H.; Greenwood, G.; Petraki, E. The N-Player Trust Game and its Replicator Dynamics. IEEE Trans. Evolut. Comput. 2016, 20, 470–474. [Google Scholar] [CrossRef] [Green Version]
  69. Chica, M.; Chiong, R.; Kirley, M.; Ishibuchi, H. A Networked N-Player Trust Game and Its Evolutionary Dynamics. IEEE Trans. Evolut. Comput. 2018, 22, 866–878. [Google Scholar] [CrossRef]
  70. Zhu, H.J.; Du, S.G.; Gao, Z.Y.; Dong, M.X.; Cao, Z.F. A Probabilistic Misbehavior Detection Scheme toward Efficient Trust Establishment in Delay-Tolerant Networks. IEEE Trans. Parall. Distr. 2014, 25, 22–32. [Google Scholar] [CrossRef]
  71. Ding, W.P.; Wang, J.D.; Guan, Z.J.; Shi, Q. Ensemble feature selection integrating elitist roles and quantum game model. J. Syst. Eng. Electron. 2015, 26, 584–594. [Google Scholar] [CrossRef]
  72. Zhang, X.; Xue, G.L.; Yu, R.Z.; Yang, D.J.; Tang, J. Keep Your Promise: Mechanism Design against Free-Riding and False-Reporting in Crowdsourcing. IEEE Internet Things 2015, 2, 562–572. [Google Scholar] [CrossRef]
  73. Fang, W.D.; Zhang, W.X.; Shan, L.H.; Ji, X.H.; Jia, G.Q. DDTMS: Dirichlet-Distribution-Based Trust Management Scheme in Internet of Things. Electronics 2019, 8, 744. [Google Scholar] [CrossRef] [Green Version]
  74. Aloqaily, M.; Kantarci, B.; Mouftah, H.T. Multiagent/multiobjective interaction game system for service provisioning in vehicular cloud. IEEE Access 2016, 4, 3153–3168. [Google Scholar] [CrossRef]
  75. Rishwaraj, G.; Ponnambalam, S.G.; Loo, C.K. Heuristics-Based Trust Estimation in Multiagent Systems Using Temporal Difference Learning. IEEE Trans. Cybern. 2017, 47, 1925–1935. [Google Scholar] [CrossRef]
  76. Pouryazdan, M.; Fiandrino, C.; Kantarci, B.; Soyata, T.; Kliazovich, D.; Bouvry, P. Intelligent Gaming for Mobile Crowd-Sensing Participants to Acquire Trustworthy Big Data in the Internet of Things. IEEE Access 2017, 5, 22209–22223. [Google Scholar] [CrossRef]
  77. Chen, Y.; Wu, S.N.; Li, J.; Fu, X.M. NCShield: Protecting Decentralized, Matrix Factorization-Based Network Coordinate Systems. IEEE Trans. Serv. Comput. 2017, 10, 244–257. [Google Scholar] [CrossRef]
  78. Lorenzo, B.; Shafigh, A.S.; Liu, J.Q.; González-Castaño, F.J.; Fang, Y.G. Data and Spectrum Trading Policies in a Trusted Cognitive Dynamic Network Architecture. IEEE ACM Trans. Netw. 2018, 26, 1502–1516. [Google Scholar] [CrossRef]
  79. Li, Y.; Zhang, Z.F.; Wang, H.G.; Yang, Q. SERS: Social-Aware Energy-Efficient Relay Selection in D2D Communications. IEEE Trans. Veh. Technol. 2018, 67, 5331–5345. [Google Scholar] [CrossRef]
  80. Aroyo, A.M.; Rea, F.; Sandini, G.; Sciutti, A. Trust and Social Engineering in Human Robot Interaction: Will a Robot Make You Disclose Sensitive Information, Conform to Its Recommendations or Gamble? IEEE Robot. Autom. Lett. 2018, 3, 3701–3708. [Google Scholar] [CrossRef]
  81. Moghadam, R.; Modares, H. Resilient Autonomous Control of Distributed Multiagent Systems in Contested Environments. IEEE Trans. Cybern. 2019, 49, 3957–3967. [Google Scholar] [CrossRef] [Green Version]
  82. Wu, X.; He, J.S.; Xu, F.; Zhang, X. A distributed decision-making mechanism for wireless P2P networks. J. Commun. Netw. 2009, 11, 359–367. [Google Scholar] [CrossRef]
  83. Xu, J.L.; Wang, S.G.; Bhargava, B.K.; Yang, F.C. A Blockchain-Enabled Trustless Crowd-Intelligence Ecosystem on Mobile Edge Computing. IEEE Trans. Ind. Inform. 2019, 15, 3538–3547. [Google Scholar] [CrossRef] [Green Version]
  84. Kang, J.W.; Xiong, Z.H.; Niyato, D.; Ye, D.D.; Kim, D.I.; Zhao, J. Toward Secure Blockchain-Enabled Internet of Vehicles: Optimizing Consensus Management Using Reputation and Contract Theory. IEEE Trans. Veh. Technol. 2019, 68, 2906–2920. [Google Scholar] [CrossRef] [Green Version]
  85. Zhang, Q.P.; DiFranzo, D.; Gloria, M.J.K.; Makni, B.; Hendler, J.A. Analyzing the Flow of Trust in the Virtual World with Semantic Web Technologies. IEEE Trans. Comput. Soc. Syst. 2018, 5, 807–815. [Google Scholar] [CrossRef]
  86. Wang, P.W.; Meng, J.; Chen, J.C.; Liu, T.; Zhan, Y.; Tsai, W.; Jin, Z. Smart Contract-Based Negotiation for Adaptive QoS-Aware Service Composition. IEEE Trans. Parall. Distr. 2019, 30, 1403–1420. [Google Scholar] [CrossRef]
  87. Zhang, L.; Wu, Q.H.; Domingo-Ferrer, J.; Qin, B.; Dong, Z.M. Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications. IEEE Trans. Inf. Foren. Sec. 2015, 10, 2352–2364. [Google Scholar] [CrossRef]
Figure 1. The relations between complex network, trust, and game theory.
Figure 1. The relations between complex network, trust, and game theory.
Sensors 20 00221 g001
Figure 2. Some performance metrics related to utility.
Figure 2. Some performance metrics related to utility.
Sensors 20 00221 g002
Table 1. Examples of games based on their types.
Table 1. Examples of games based on their types.
Dynamic GameStatic GameNon-Cooperative GameCooperative Game
Kim [32]
Ho et al. [33]
Cho [34]
Al-Talabani et al. [35]
Muthukumar and Sahai [36]
Pawlick and Zhu [37]
Yang et al. [38]
Li et al. [39]
Wang et al. [40]
Gao et al. [41]
Xu et al. [42]
Pawlick et al. [43]
Niu et al. [44]
Pawlick et al. [45]
Shi et al. [31]
Maharjan et al. [18]
Zonouz et al. [29]
Tian et al. [46]
De Paola et al. [19]
Zhu et al. [47]
Anand et al. [48]
Xu et al. [49]
Ahn et al. [50]
Xu et al. [51]
Borjigin et al. [24]
De Paola et al. [20]
Gong et al. [22]
Basilico et al. [30]
Duan et al. [52]
Chen et al. [53]
Cao et al. [54]
Cho et al. [55]
Waqas et al. [56]
Wahab et al. [57]
Abdalzaher et al. [58]
Rani et al. [59]
Security GameTrust GameOthers
Wu et al. [60]
Ruan et al. [61]
John et al. [62]
Wu et al. [63]
Jin and van Dijk [64]
Yu et al. [66]
Abbass et al. [68]
Chica et al. [69]
Hu et al. [6]
Zhu et al. [70]
Ding et al. [71]
Zhang et al. [72]
Aloqaily et al. [74]
Rishwaraj et al. [75]
Pouryazdan et al. [76]
Chen et al. [77]
Lorenzo et al. [78]
Li et al. [79]
Aroyo et al. [80]
Moghadam and Modares [81]
Cui et al. [28]
Yin et al. [26]
Chen et al. [27]
Li et al. [14]
Table 2. Classification of trust applications.
Table 2. Classification of trust applications.
Trust ModelTrust MechanismTrust Framework
Duan et al. [52]
Chen et al. [53]
Cho et al. [34]
Rishwaraj et al. [75]
Chica et al. [69]
Xu et al. [49]
Li et al. [79]
Wang et al. [40]
Abdalzaher et al. [58]
Jin and Van Dijk [64]
Rani et al. [59]
Wu et al. [82]
Kim [32]
Lorenzo et al. [78]
Xu et al. [42]
Pawlick et al. [43]
Wahab et al. [57]
Wang et al. [15]
Table 3. Classification of application scenarios.
Table 3. Classification of application scenarios.
Distributed NetworkCentralized NetworkSocial Network
Wu et al. [82]
Zhu et al. [47]
Ho et al. [33]
Duan et al. [52]
Cho et al. [56]
Yang et al. [38]
Li et al. [39]
Gao et al. [41]
Abdalzaher et al. [58]
Wang et al. [86]
Kang et al. [84]
Rani et al. [59]
Kim [32]
Yu et al. [66]
Zhu et al. [70]
Aloqaily et al. [74]
Cao et al. [54]
Abbass et al. [68]
Rishwaraj et al. [75]
Pawlick and Zhu [37]
Xu et al. [49]
Ahn et al. [50]
Lorenzo et al. [78]
Xu et al. [51]
Tian et al. [46]
Xu et al. [83]
Xu et al. [42]
Pawlick et al. [43]
Moghadam and Modares [81]
Anand et al. [48]
Chen et al. [53]
Chica et al. [69]
Zhang et al. [85]
Li et al. [79]
Wahab et al. [57]
Wang et al. [15]
Yan et al. [16]

Share and Cite

MDPI and ACS Style

Huang, L.; Jia, G.; Fang, W.; Chen, W.; Zhang, W. Towards Security Joint Trust and Game Theory for Maximizing Utility: Challenges and Countermeasures. Sensors 2020, 20, 221. https://doi.org/10.3390/s20010221

AMA Style

Huang L, Jia G, Fang W, Chen W, Zhang W. Towards Security Joint Trust and Game Theory for Maximizing Utility: Challenges and Countermeasures. Sensors. 2020; 20(1):221. https://doi.org/10.3390/s20010221

Chicago/Turabian Style

Huang, Libingyi, Guoqing Jia, Weidong Fang, Wei Chen, and Wuxiong Zhang. 2020. "Towards Security Joint Trust and Game Theory for Maximizing Utility: Challenges and Countermeasures" Sensors 20, no. 1: 221. https://doi.org/10.3390/s20010221

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop