Trust is an important concept in human interactions which facilitates the formation and continued existence of functional human societies. In the first decade of the 21st century, computational trust models have been applied to solve many problems in wireless communication systems. This cross-disciplinary research has yielded many innovative solutions. In this paper, we examine the latest methods which have been proposed by researchers to manage trust and reputation in wireless communication systems. Specifically, we survey the state of the art in the application of trust models in the fields of mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), and cognitive radio networks (CRNs). We classify the mainstream methods into natural categories and illustrate how they complement each other in achieving design goals. Major research directions are also outlined.

A Survey of Trust and Reputation Management Systems in Wireless Communications

Mobile ad hoc networks (MANETs) are a set of mobile nodes which are self-configuring and connected by wireless links automatically as per the defined routing protocol. The absence of a central management agency or a fixed infrastructure is a key feature of MANETs. These nodes communicate with each other by interchange of packets, which for those nodes not in wireless range goes hop by hop. Due to lack of a defined central authority, securitizing the routing process becomes a challenging task thereby leaving MANETs vulnerable to attacks, which results in deterioration in the performance characteristics as well as raises a serious question mark about the reliability of such networks. In this paper we have attempted to present an overview of the routing protocols, the known routing attacks and the proposed countermeasures to these attacks in various works. ——————————  ——————————

A Survey of Routing Attacks and Security Measures in Mobile Ad-Hoc Networks

Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “Black Hole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.

http://www.airccse.org/journal/ijcsea/papers/2112ijcsea05.pdf

Black-Hole and Wormhole Attack in Routing Protocol AODV in MANET

Mobile Adhoc Network (MANET) is a group of wireless nodes that are distributed without relying on any standing network infrastructure. MANET routing protocols were designed to accommodate the properties of a self-organized environment without protection against any inside or outside network attacks. In this paper, we propose a Local Intrusion Detection (LID) security routing mechanism to detect Black Hole Attack (BHA) over Ad hoc On Demand Distance Vector (AODV) MANET routing protocol. In LID security routing mechanism, the intrusion detection is performed locally using the previous node of the attacker node instead of performing the intrusion detection via the source node as in Source Intrusion Detection (SID) security routing mechanism. By performing LID security routing mechanism, the security mechanism overhead would be decreased. Simulation results using the GloMoSim simulator show that the improvement ratio of the throughput gained by LID security routing mechanism and overall improvement reduction in the end-to-end delay and routing overhead.

A local intrusion detection routing security over MANET network

Mobile Ad hoc NETwork (MANET) is a collection of self-organizing mobile nodes without any help of centralized administration or established infrastructure. Due to this characteristic, MANETs are particularly vulnerable to various security threats. In addition, the design of most MANET routing protocols assumes that there is no malicious node in the network. Hence, several efforts and researches have been made toward the design of a secure and robust routing protocol for ad hoc networks. In this paper, we discuss the major attacks that can target the operation of ad hoc routing protocol. A detailed survey of the well-known secured ad hoc routing protocols for mobile ad hoc networks is presented. In order to analyze the existent solutions for securing ad hoc routing protocols in a structured manner, we have classified them into three categories: solutions based on cryptography, solutions based on one-way hash chain and hybrid solutions. This paper also gives a brief summary and comparison of various protocols available for secured routing in MANET.

Secure routing protocols for mobile ad hoc networks

Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes forward packets for each other, allowing communication among nodes outside wireless transmission range hop by hop. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. Attacks on ad hoc network routing protocols disrupt network performance and reliability. This paper attempts to provide a comprehensive overview of attacks and secure routing. It first analyzes the reason that ad hoc network is vulnerable to attacks. Then it presents the well known attacks and the popular secure protocols.

A Survey of Secure Routing in Ad Hoc Networks

Cooperation Enforcement Among Selfish Nodes in Ad Hoc Networks under Noise

The cooperative communication of distributed terminals has many performance advantages and wide application prospects. However, it lacks effective trust foundation between distributed terminals and lacks data security guarantee. Block chain naturally has the properties of transparency, tamper-proof, and full traceability. It can effectively solve the trust problem between untrusted terminals and ensure data security. Thus, we introduce block chain into the cooperative communication of large number terminals, propose a cooperative communication method based on block chain, design a multi-chain structure to reduce resource consumption, and give the detailed working procedure of the cooperative communication method. In the working procedure, we propose a source-relay pairing and pricing scheme based on Kuhn-Munkres algorithm (SRPP-KM) to solve the optimal source relay pairing and transaction price, and design a lightweight consensus mechanism based on intra-region dynamic delegated Byzantine fault tolerant (DDBFT) and interactive updates between regional chain and main chain to reduce resource waste and achieve fast consensus. Analyses show that the proposed method can establish trust foundation between terminals and promote cooperation between terminals. Simulation results show that the proposed method can obtain higher sum revenue of sources while satisfying relays’ expected revenue and achieve faster consensus when compared with other methods.

https://ieeexplore.ieee.org/ielx7/6287639/9668973/09690175.pdf

Cooperative communication method based on block chain for a large number of distributed terminals

The limited computation resource of the centralized controller and communication bandwidth between the control and data planes become the bottleneck in forwarding the packets in Software-Defined Networking (SDN). Denial of Service (DoS) attacks based on Transmission Control Protocol (TCP) can exhaust the resources of the control plane and overload the infrastructure of SDN networks. To mitigate TCP DoS attacks, DoSDefender is proposed as an efficient kernel-mode TCP DoS prevention framework in the data plane for SDN. It can prevent TCP DoS attacks from entering SDN by verifying the validity of the attempts to establish a TCP connection from the source, migrating the connection, and relaying the packets between the source and the destination in kernel space. DoSDefender conforms to the de facto standard SDN protocol, the OpenFlow policy, which requires no additional devices and no modifications in the control plane. Experimental results show that DoSDefender can effectively prevent TCP DoS attacks in low computing consumption while maintaining low connection delay and high packet forwarding throughput.

DoSDefender: A Kernel-Mode TCP DoS Prevention in Software-Defined Networking

Network moving target defense technology can effectively defend against attacker monitoring of the service. The technology makes it more difficult for attackers to attack and can ensure secure communication for services. However, there may be multiple network attacks in the network. As a result, there may be security problems with the trustworthiness of the network resource mutation space required for network moving target defense technology. The focus of current researches is mostly on the mutation timing and cost optimization of the resource mutation space. It may lead to the possibility that the resources in the resource mutation space have been already under network attacks. In this paper, we propose a hybrid routing mutation mechanism based on mutation cost and resource trustworthiness in SDN networks. The mechanism is able to evaluate the routing mutation space selected by the routing-based network moving target defense technology. In terms of both mutation cost and resource trustworthiness, the optimal weighting ratio of the two factors will be to discovered. Simulation results show that the proposed mechanism can effectively enhance the ability of the routing mutation space to avoid attacked nodes and links and improve the transmission success rate of services.

Hui Zhi

Papers

A Survey of Secure Routing in Ad Hoc Networks

Cooperation Enforcement Among Selfish Nodes in Ad Hoc Networks under Noise

Cooperative communication method based on block chain for a large number of distributed terminals

DoSDefender: A Kernel-Mode TCP DoS Prevention in Software-Defined Networking

A Hybrid Routing Mutation Mechanism based on Mutation Cost and Resource Trustworthiness in Network Moving Target Defense