Managing trust in a distributed Mobile Ad Hoc Network (MANET) is challenging when collaboration or cooperation is critical to achieving mission and system goals such as reliability, availability, scalability, and reconfigurability. In defining and managing trust in a military MANET, we must consider the interactions between the composite cognitive, social, information and communication networks, and take into account the severe resource constraints (e.g., computing power, energy, bandwidth, time), and dynamics (e.g., topology changes, node mobility, node failure, propagation channel conditions). We seek to combine the notions of "social trust" derived from social networks with "quality-of-service (QoS) trust" derived from information and communication networks to obtain a composite trust metric. We discuss the concepts and properties of trust and derive some unique characteristics of trust in MANETs, drawing upon social notions of trust. We provide a survey of trust management schemes developed for MANETs and discuss generally accepted classifications, potential attacks, performance metrics, and trust metrics in MANETs. Finally, we discuss future research areas on trust management in MANETs based on the concept of social and cognitive networks.

/pdf/a-survey-on-trust-management-for-mobile-ad-hoc-networks-2gs07mjtah.pdf

A Survey on Trust Management for Mobile Ad Hoc Networks

Game theory (GT) is a mathematical method that describes the phenomenon of conflict and cooperation between intelligent rational decision-makers. In particular, the theory has been proven very useful in the design of wireless sensor networks (WSNs). This article surveys the recent developments and findings of GT, its applications in WSNs, and provides the community a general view of this vibrant research area. We first introduce the typical formulation of GT in the WSN application domain. The roles of GT are described that include routing protocol design, topology control, power control and energy saving, packet forwarding, data collection, spectrum allocation, bandwidth allocation, quality of service control, coverage optimization, WSN security, and other sensor management tasks. Then, three variations of game theory are described, namely, the cooperative, non-cooperative, and repeated schemes. Finally, existing problems and future trends are identified for researchers and engineers in the field.

https://www.mdpi.com/1424-8220/12/7/9055/pdf

Game theory for Wireless Sensor Networks: a survey.

Trust is one of the most important means to improve security and enable interoperability of current heterogeneous independent cloud platforms. This paper first analyzed several trust models used in large and distributed environment and then introduced a novel cloud trust model to solve security issues in cross-clouds environment in which cloud customer can choose different providers' services and resources in heterogeneous domains can cooperate. The model is domain-based. It divides one cloud provider's resource nodes into the same domain and sets trust agent. It distinguishes two different roles cloud customer and cloud server and designs different strategies for them. In our model, trust recommendation is treated as one type of cloud services just like computation or storage. The model achieves both identity authentication and behavior authentication. The results of emulation experiments show that the proposed model can efficiently and safely construct trust relationship in cross-clouds environment.

Trust Model to Enhance Security and Interoperability of Cloud Environment

Routing protocols are the binding force in mobile ad hoc network (MANETs) since they facilitate communication beyond the wireless transmission range of the nodes. However, the infrastructure-less, pervasive, and distributed nature of MANETs renders them vulnerable to security threats. In this paper, we propose a novel cluster-based trust-aware routing protocol (CBTRP) for MANETs to protect forwarded packets from intermediary malicious nodes. The proposed protocol organizes the network into one-hop disjoint clusters then elects the most qualified and trustworthy nodes to play the role of cluster-heads that are responsible for handling all the routing activities. The proposed CBTRP continuously ensures the trustworthiness of cluster-heads by replacing them as soon as they become malicious and can dynamically update the packet path to avoid malicious routes. We have implemented and simulated the proposed protocol then evaluated its performance compared to the clustered based routing protocol (CBRP) as well as the 2ACK approach. Comparisons and analysis have shown the effectiveness of our proposed scheme.

A cluster-based trust-aware routing protocol for mobile ad hoc networks

Recently, trust has been recognized as an important factor for grid computing security. We develop a trust management architecture for trust enhanced grid security incorporating a novel trust model which is capable of capturing various types of trust relationships that exist in a grid system and providing mechanisms for trust evaluation, recommendations and update for trust decisions. The outcomes of the trust decisions can then be employed by the grid security system to formulate trust enhanced security solutions. We design several algorithms to demonstrate how one can derive the trust enhanced security solutions for both user and resource provider protection with the proposed trust management architecture. Leveraging on trust knowledge and forming it as part of the security decisions, the proposed architecture possesses several desirable emerging properties that enable it to provide an improved level of security for grid computing systems.

Enhancing grid security with trust management

Security issues have been emphasized when mobile ad hoc networks (MANETs) are employed into military and aerospace fields. We design a novel secure routing protocol for MANETs. This protocol TAODV (Trusted AODV) extends the widely used AODV (ad hoc on-demand distance vector) routing protocol and employs the idea of a trust model to protect routing behaviors in the network layer of MANETs. In the TAODV, trust among nodes is represented by opinion, which is an item derived from subjective logic. The opinions are dynamic and updated frequently as our protocol specification: if one node performs normal communications, its opinion from other nodes' points of view can be increased; otherwise, if one node performs some malicious behaviors, it is ultimately denied by the whole network. A trust recommendation mechanism is also designed to exchange trust information among nodes. The salient feature of TAODV is that, using trust relationships among nodes, there is no need for a node to request and verify certificates all the time. This greatly reduces the computation overheads. Meanwhile, with neighbors' trust recommendations, a node can make objective judgement about another node's trustworthiness to maintain the whole system at a certain security level.

/pdf/a-trust-model-based-routing-protocol-for-secure-ad-hoc-3lizwp1x0r.pdf

A trust model based routing protocol for secure ad hoc networks

In this paper, we propose a novel coalitional game model for security issues in wireless networks. The model can be applied to not only mobile ad hoc networks but also wireless sensor networks. We define a new throughput characteristic function, on the basis of which nodes are enforced to cooperate and form coalitions. This function implies the maximal throughput and the most reliable traffic that a coalition can achieve. The fair payoff share inside the coalition is given by Shapley value after proving the feasibility of this method. Then a set of game rules is presented to establish a threatening mechanism to all players. We then describe the coalition formation procedure and explain how to integrate this game theoretic model with available wireless routing protocols. Finally, a theoretical analysis is conducted to illustrate the convergence situation and verify the correctness of the formulation.

/pdf/a-novel-coalitional-game-model-for-security-issues-in-267a0gcqrl.pdf

A Novel Coalitional Game Model for Security Issues in Wireless Networks

We propose an incentive routing and forwarding scheme that integrates a reputation system into a monetary payment mechanism to encourage nodes cooperation in wireless ad hoc networks. For the first time in the literature, we build our reputation system based on a heat diffusion model. The heat diffusion model provides us a way of combining the direct and indirect reputation together and propagating the reputa- tion from locally to globally. Further, we model and analyze our incentive scheme using a coalitional game, which is not the usual non-cooperative game like others. We further prove that under a proper condition this game has a non-empty stable core. From the evaluation we can see that the cumulative utility of nodes increases when nodes stay in the core.

A Coalitional Game Model for Heat Diffusion Based Incentive Routing and Forwarding Scheme (Work in Progress)

We propose an incentive routing and forwarding scheme that integrates a reputation system into a monetary payment mechanism to encourage nodes cooperation in wireless ad hoc networks. For the first time in the literature, we build our reputation system based on a heat diffusion model. The heat diffusion model provides us a way of combining the direct and indirect reputation together and propagating the reputation from locally to globally. Further, we model and analyze our incentive scheme using a coalitional game, which is not the usual non-cooperative game like others. We further prove that under a proper condition this game has a non-empty stable core. From the evaluation we can see that the cumulative utility of nodes increases when nodes stay in the core.

/pdf/a-coalitional-game-model-for-heat-diffusion-based-incentive-35emdbrc48.pdf

Xiaoqi Li

Papers

A trust model based routing protocol for secure ad hoc networks

A Novel Coalitional Game Model for Security Issues in Wireless Networks

A Coalitional Game Model for Heat Diffusion Based Incentive Routing and Forwarding Scheme (Work in Progress)

A Coalitional Game Model for Heat Diffusion Based Incentive Routing and Forwarding Scheme