A survey on trust management for Internet of Things

Intrusion detection systems in the Internet of things: A comprehensive investigation

Wireless sensor networks (WSNs) are prone to propagating malware because of special characteristics of sensor nodes. Considering the fact that sensor nodes periodically enter sleep mode to save energy, we develop traditional epidemic theory and construct a malware propagation model consisting of seven states. We formulate differential equations to represent the dynamics between states. We view the decision-making problem between system and malware as an optimal control problem; therefore, we formulate a malware-defense differential game in which the system can dynamically choose its strategies to minimize the overall cost whereas the malware intelligently varies its strategies over time to maximize this cost. We prove the existence of the saddle-point in the game. Further, we attain optimal dynamic strategies for the system and malware, which are bang–bang controls that can be conveniently operated and are suitable for sensor nodes. Experiments identify factors that influence the propagation of malware. We also determine that optimal dynamic strategies can reduce the overall cost to a certain extent and can suppress the malware propagation. These results support a theoretical foundation to limit malware in WSNs.

Differential Game-Based Strategies for Preventing Malware Propagation in Wireless Sensor Networks

https://northumbria-test.eprints-hosting.org/id/document/269516

Trust and reputation for Internet of Things: Fundamentals, taxonomy, and open research challenges

With rapid advances in satellite technology, space information network (SIN) has been proposed to meet the increasing demands of ubiquitous mobile communication due to its advantages in providing extensive access services. However, due to satellites’ resource constraint and SIN’s highly dynamic topology, it poses a challenge on management and resource utilization in the development of SIN. There have been some works integrating the software defined network (SDN) into SIN, defined as software defined space information network (SD-SIN), so as to simplify the management and improve resource utilization in SIN. However, these works ignore the security issue in SD-SIN. Meanwhile, the existing security mechanisms in SDN are still unable to cope with the uniqueness of satellite network, and some other critical security issues still haven’t yet been well addressed. In this paper, based on $(t,n)$ secret sharing, an SIN-specific lightweight group key agreement protocol is proposed for SD-SIN to ensure both the security and applicability. Moreover, considering the highly dynamic network topology, we also design a group key-based secure handover authentication scheme to reduce the overhead of handover authentication. Security analysis shows that the handover authentication protocol can resist to various known attacks. In addition, further performance evaluation shows its efficiency in terms of computation and communication overheads. Finally, the simulation results of computing overhead to the network entities demonstrate that our protocol is feasible in practical implementation.

A Lightweight and Secure Group Key Based Handover Authentication Protocol for the Software-Defined Space Information Network

A particular challenging problem in designing Internet of Things is that how to detect and prevent internal attacks, because all nodes try their best to save their limited network resource. So it is difficult to achieve optimal objectives simultaneously, game theory provides an appropriate tool. In this paper, we propose a non-cooperative differential game model, which allows all nodes to choose the optimal amount of network resource to invest in information security contingent upon the state of game. In our model, we specifically consider how the vulnerability of information and the potential loss from such vulnerability affects the optimal amount of resources that should be devoted to securing that information. In the paper, the optimal strategies of selfish nodes and malicious nodes are obtained respectively. The simulation results show that our game model has a good performance in stability of the probability that the selfish nodes discover the malicious nodes under the optimal strategies of the selfish and the malicious nodes.

A Security Differential Game Model for Sensor Networks in Context of the Internet of Things

Most of the existing authentication and key agreement protocols for delay tolerant networks are not designed for protecting privacy. In this paper, an authentication and key agreement protocol with anonymity based on combined public key is proposed. The proposed protocol eliminates the need of public key digital certificate on-line retrieval, so that any on-line trusted third party is no longer required, only needs an off-line public information repository and key generation center; and realizes mutual authentication and key agreement with anonymity between two entities. We show that the proposed protocol is secure for all probabilistic polynomial-time attackers, and achieves good security properties, including authentication, anonymity, and confidentiality and so on.

Efficient Authentication and Key Agreement Protocol with Anonymity for Delay Tolerant Networks

This paper presents a novel based-knowledge dynamic routing model with rate allocation for delay-tolerant networks (DTNs). The objectives are how to embody knowledge about destination offered by joint nodes and how to apply knowledge about destination to transfer data when the instantaneous end-to-end paths do not exist in DTNs. The first problem is addressed through a rate allocation model. For rate allocation, taking into account the dynamic feature of rate control as well as the selfish nature of joint nodes, we design a non-cooperative differential game model to offer efficient rate allocation scheme with the constraint of limited bandwidth, and obtain a feedback Nash equilibrium solution of the game. In this study, knowledge is valued information and provides advisable solutions to problems. For the second problem, assuming that the obtained value function in rate allocation model is the available knowledge about destination of joint node; with this assumption, a polynomial time routing algorithm is proposed to describe the procedure of the routing model.

Dynamic DTN Routing Strategies Based on Knowledge

A optimal power control strategy based on network wisdom in wireless networks

This paper presents a transmission power control model for wireless networks. The objective is to guarantee energy efficiency in packet delivery and reduce mutual interference, finally improves network performance. The problem is addressed through a cooperative differential game model, which takes more consideration on the interaction between the sources' strategic behaviors, fairness among sources and the dynamic evolution of interference level.

Yan Ding

Papers

A Security Differential Game Model for Sensor Networks in Context of the Internet of Things

Efficient Authentication and Key Agreement Protocol with Anonymity for Delay Tolerant Networks

Dynamic DTN Routing Strategies Based on Knowledge

A optimal power control strategy based on network wisdom in wireless networks

A Cooperative Differential Game of Transmission Power Control in Wireless Networks