A Secure Routing Protocol with Trust and Energy Awareness for Wireless Sensor Network

Nodes in most of the deployments of Wireless Sensor Networks (WSNs) remain un-administered and exposed to variety of security attacks. Characterized by constrained resources and dynamically changing behavior of sensor nodes, reliable data delivery in WSNs is nontrivial. To counter node misbehavior attacks, traditional cryptographic and authentication based solutions have proved to be inappropriate due to high cost and incapability factors. Recently, trust based solutions have appeared to be viable solutions to address nodes’ misbehavior attacks. However, the existing trust based solutions incur high cost in trust estimation and network-wide dissemination which significantly increases traffic congestion and undermines network lifetime. This paper presents a Trust and Energy aware Secure Routing Protocol (TESRP) for WSN that exploits a distributed trust model for discovering and isolating misbehaving nodes. TESRP employs a multi-facet routing strategy that takes into consideration the trust level, residual energy, and hop-counts of neighboring nodes while making routing decisions. This strategy not only ensures data dissemination via trusted nodes but also balances out energy consumption among trusted nodes while traversing through shorter paths. Demonstrated by simulation results in NS-2, TESRP achieves improved performance in terms of energy consumption, throughput and network lifetime as compared to existing solutions.     

MANET 中基于信任的安全位置辅助路由模型

In view of the security weakness in resisting the active attacks by malicious nodes in mobile ad hoc networks, the trust metric is introduced to defend those attacks by loading a trust model on the previously proposed Distance Based LAR. The improved Secure Trust based Location Aided Routing algorithm utilizes direct trust and recommendation trust to prevent malicious nodes with low trust values from joining the forwarding. Simulation results reveal that ST LAR can resist attacks by malicious nodes effectively; furthermore, it also achieves better performance than DBLAR in terms of average end to end delay, packet delivery success ratio and throughput.     

Secured routing in wireless sensor networks using fault‐free and trusted nodes

Wireless sensor network (WSN) should be designed such that it is able to identify the faulty nodes, rectify the faults, identify compromised nodes from various security threats, and transmit the sensed data securely to the sink node under faulty conditions. In this paper, we propose an idea of integrating fault tolerance and secured routing mechanism in WSN named as fault tolerant secured routing: an integrated approach (FASRI) that establishes secured routes from source to sink node even under faulty node conditions. Faulty nodes are identified using battery power and interference models. Trustworthy nodes (non‐compromised) among fault‐free nodes are identified by using agent‐based trust model. Finally, the data are securely routed through fault‐free non‐compromised nodes to sink. Performance evaluation through simulation is carried out for packet delivery ratio, hit rate, computation overhead, communication overhead, compromised node detection ratio, end‐to‐end delay, memory overhead, and agent overhead. We compared simulation results of FASRI with three schemes, namely multi‐version multi‐path (MVMP), intrusion/fault tolerant routing protocol (IFRP) in WSN, and active node‐based fault tolerance using battery power and interference model (AFTBI) for various measures and found that there is a performance improvement in FASRI compared with MVMP, IFRP, and AFTBI. Copyright © 2014 John Wiley & Sons, Ltd.     

Energy efficient secured routing protocol for MANETs

The design of routing protocol with energy efficiency and security is a challenging task. To overcome this challenge, we propose energy-efficient secured routing protocol. The objective of our work is to provide a secured routing protocol, which is energy efficient. To provide security for both link and message without relying on the third party, we provide security to the protocol by choosing a secure link for routing using Secure Optimized Link State Routing Protocol. Each node chooses multipoint relay nodes amongst the set of one-hop neighbors, so as to reach all two-hop neighbors. The access control entity authorizes nodes announcing the node identification to the network. In addition, the access control entity signs a public key Ki, a private key ki, and the certificate Ci required by an authorized node to obtain the group key. Each node maintains a route table with power status as one of its entry. After selecting the link, on requirement of a new route, we check nodes’ power status in its routing table and then accordingly arise a route. Then, we perform group key distribution using the generated keys using a small number of messages which helps reducing energy consumption. The group key can be altered periodically to avoid nonauthorized nodes and to avoid the use of the same group key in more than some amount of data. Then, we provide communication privacy for both message sender and message recipient using Secure Source Anonymous Message Authentication Scheme. Thereby, the message sender or the sending node generates a source anonymous message authentication for message for releasing each message based on the MES scheme. Hence, our approach will provide message content authenticity without relying on any trusted third parties.     

A Cross-Layer Channel Access and Routing Protocol for Medical-Grade QoS Support in Wireless Sensor Networks

One of principal design issues of a Wireless Sensor Network (WSN) for medical information systems is to classify received packets based on their priorities and guarantees so that they can be transmitted reliably, thus satisfying QoS requirements. In addition, when the target WSN requires multi-hop communications and the traffic load increases significantly, it is challenging to support both load balancing and suitable QoS at the same time. In this paper, we propose a new reliable protocol termed Cross-layer Channel Access and Routing (CCAR), which simultaneously supports both MAC and routing operations for medical-grade QoS provisions. CCAR initially determines the routing path with the lowest traffic load and low latency using newly defined channel quality factors. Concurrently, the source node allocates the predefined QoS Access Category to each packet and reserves the channel along the route. In addition, CCAR introduces an effective route maintenance scheme to avoid link failures in bottlenecked intermediate nodes, which prevents unnecessary packet drops and route rediscovery evocations. Finally, through both simulation studies and real test-bed experiments, we evaluate the performance of CCAR by comparing it with other conventional protocols, demonstrating that the proposed protocol can more efficiently support medical-grade QoS packets, especially when the network is heavily loaded.     

ON/OFF Markov Model Based Energy-Delay Aware MAC Protocol for Wireless Sensor Network

Today, the Wireless Sensor Networks (WSNs) are increasingly used in many applications, and in parallel the scientific researches to improve the features of such networks are accelerated. As the nodes are small components that suffer from very limited energy resources, several researches carried out at the MAC layer in order to minimize energy costs. The techniques based on periodic active/passive mode are energy efficient, but the node can not adapt the behavior of the transceiver according to the network traffic. Our approach aims to reduce the latency without increasing energy consumption. We propose to manage the radio in a dynamic way according to ON/OFF Markov model. The passage from passive to active mode is set according to the transition probability from OFF to ON state. Based on this probability, we give the period that the transceiver can stay in sleep mode. Through simulation we show that the proposed technique outperforms the well known MAC protocol for WSN.     

A Risk-Aware Reputation-Based Trust Management in Wireless Sensor Networks

Wireless sensor networks (WSNs) are susceptible to many security threats and are specifically prone to physical node capture in which the adversary can easily launch the so-called insider attacks such as node compromise, bypassing the traditional security mechanisms based on cryptography primitives. So, the compromised nodes can be modified to misbehave and disrupt the entire network and can successfully perform the authentication process with their neighbors, which have no way to distinguish fraudulent nodes from trustworthy ones. Trust and reputation systems have been recently suggested as a powerful tools and an attractive complement to cryptography-based schemes in securing WSNs. They provide ability to detect and isolate both faulty and malicious nodes. Considerable research has been done on modeling and managing trust and reputation. However, trust topic issue in WSNs remains an open and challenging field. In this paper, we propose a Risk-aware Reputation-based Trust (RaRTrust) model for WSNs. Our novel framework uses both reputation and risk to evaluate trustworthiness of a sensor node. Risk evaluation is used to deal with the dramatic spoiling of nodes, which makes RaRTrust robust to on–off attack and differ from other trust models based only on reputation. This paper contributes to model the risk as opinion of short-term trustworthiness combining with traditional reputation evaluation to derive trustworthiness in WSNs.

     

Self-attention based generative adversarial network with Aquila optimization algorithm espoused energy aware cluster head selection in WSN

WSNs have a wide range of applications, and the effective Wireless Sensor Network (WSN) design includes the best energy optimization techniques. The nodes in wireless sensor networks run on batteries. The existing cluster head selection methods do not take into account the latency and rate of wireless network traffic when optimizing the node's energy constraints. To overcome these issues, a self-attention based generative adversarial network (SabGAN) with Aquila Optimization Algorithm (AqOA) is proposed for Multi-Objective Cluster Head Selection and Energy Aware Routing (SabGAN-AqOA-EgAwR-WSN) for secured data transmission in wireless sensor network. The proposed method implements the routing process through cluster head. SabGAN classifiers are utilized to select the CH based on firm fitness functions, including delay, detachment, energy, cluster density, and traffic rate. After the selection of the cluster head, the malicious node gains access to the cluster. Therefore, the ideal path selection is carried out by three parameters: trust, connectivity, and degree of amenity. These three parameters are optimized under proposed AqOA. The data are transferred to the base station with the support of optimum trust path. The proposed SabGAN-AqOA-EgAwR-WSN method is activated in NS2 simulator. Finally, the proposed SabGAN-AqOA-EgAwR-WSN method attains 12.5%, 32.5%, 59.5%, and 32.65% higher alive nodes; 85.71%, 81.25%, 82.63%, and 71.96% lower delay; and 52.25%, 61.65%, 37.83%, and 20.63% higher normalized network energy compared with the existing methods.     

A Novel Heuristic Approach Based Trust Worthy Architecture for Wireless Sensor Networks

A Wireless Sensor Networks (WSNs) consist of spatially distributed autonomous sensors to cooperatively monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants. WSNs are more vulnerable to attacks and failures due to the involvement of many numbers of tiny sensor nodes. As the technology is tremendously increasing in the recent past, the implementation of this for various time critical applications is quite interesting and challenging. Moreover, WSNs have no specific hierarchical structures, leads to security and maintenance problems. Trust in WSN is defined as the degree of belief or confidence about the nodes based on the past interactions and observations has which become a mandatory requirement for reliable communication in WSN under security constraints. In this paper, we propose a Heuristic Approach based Trust Worthy Architecture for WSN that considers the challenges of the system and focus on the collaborative mechanism for trust evaluation and maintenance. Our proposed Architecture could also be capable of fulfilling critical security, reliability, mobility and performance requirements for reliable communication while being readily adaptable to different applications. The simulation results of the proposed architecture outperformed the recent trust worthy architecture using the analysis of the performance requirements such as communication overhead, memory requirements and energy consumption.     

E2EACK: an end-to-end acknowledgment-based scheme against collusion black hole and slander attacks in MANETs

Mobile ad hoc networks (MANETs) rely on the benevolence of nodes within the network to forward packets from a source node to a destination node. This network construction allows for the forwarding nodes, whether they are selfish or malicious, to drop packets hindering end-to-end communication. In this paper, a new scheme is proposed against collusion black hole and slander attacks in MANETs, named E2EACK. A novel method is used to detect collusion attacks due to collusive malicious nodes which cooperate in the route discovery, but refuse to forward data packets and do not disclose the misbehavior of each other. Contrary to existing methods that detect only collusion black hole attacks, the E2EACK also detects slander attacks and framing attacks. Moreover, the E2EACK uses ACKnowledgment packet to detect malicious nodes on the path and Message Authentication Code (MAC) to authenticate the sender of each data packet. Analytical and simulation results show that the proposed scheme considerably decreases the routing overhead and increases the packet delivery ratio compared to the existing methods.     

Security and performance enhancement of AODV routing protocol

A mobile ad hoc networks (MANET) is a decentralized, self‐organizing, infrastructure‐less network and adaptive gathering of independent mobile nodes. Because of the unique characteristics of MANET, the major issues to develop a routing protocol in MANET are the security aspect and the network performance. In this paper, we propose a new secure protocol called Trust Ad Hoc On‐demand Distance Vector (AODV) using trust mechanism. Communication packets are only sent to the trusted neighbor nodes. Trust calculation is based on the behaviors and activities information of each node. It is divided in to trust global (TG) and trust local (TL). TG is a trust calculation based on the total of received routing packets and the total of sending routing packets. TL is a comparison between total received packets and total forwarded packets by neighbor node from specific nodes. Nodes conclude the total trust level of its neighbors by accumulating the TL and TG values. The performance of Trust AODV is evaluated under denial of service/distributed denial of service (DOS/DDOS) attack using network simulator NS‐2. It is compared with the Trust Cross Layer Secure (TCLS) protocol. Simulation results show that the Trust AODV has a better performance than TCLS protocol in terms of end‐to‐end delay, packet delivery ratio, and overhead. Next, we improve the performance of Trust AODV using ant algorithm. The proposed protocol is called Trust AODV + Ant. The implementation of ant algorithm in the proposed secure protocol is by adding an ant agent to put the positive pheromone in the node if the node is trusted. Ant agent is represented as a routing packet. The pheromone value is saved in the routing table of the node. We modified the original routing table by adding the pheromone value field. The path communication is selected based on the pheromone concentration and the shortest path. Trust AODV + Ant is compared with simple ant routing algorithm (SARA), AODV, and Trust AODV under DOS/DDOS attacks in terms of performance. Simulation results show that the packet delivery ratio and throughput of the Trust AODV increase after using ant algorithm. However, in terms of end‐to‐end delay, there is no significant improvement. Copyright © 2014 John Wiley & Sons, Ltd.     

Q-MOHRA: QoS Assured Multi-objective Hybrid Routing Algorithm for Heterogeneous WSN

Quality of Service (QoS) assurance in Wireless Sensor Network (WSN) is a tough task, and it is more exciting due to the scarcity of resources. The requirement of different WSN applications running over has different constraints. In QoS, routing protocol the network has to balance the traffic. This paper presents a novel heuristic routing algorithm known as QoS assured Multi-objective Hybrid Routing Algorithm (Q-MOHRA) for Heterogeneous WSN. Q-MOHRA takes into account the link (energy, hop count, link quality indicator etc.) and path (jitter) metrics for optimal path selection. The performance of Q-MOHRA is evaluated through intensive simulation and equated with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-objective Routing Algorithm (DyMORA). The metrics such as average energy consumption, residual energy, packet delivery ratio, jitter, and normalized routing load are used for comparison. The performance of Q-MOHRA has been observed to outclass SHRP and DyMORA. It improves the packet delivery ratio by 24.31% as compared to SHRP and 11.86% as compared to DyMORA. Q-MOHRA outperforms DyMORA in terms of average energy consumption by a factor of 8.27%.     

Spatial correlation-based collaborative medium access control in wireless sensor networks

Wireless Sensor Networks (WSN) are mainly characterized by dense deployment of sensor nodes which collectively transmit information about sensed events to the sink. Due to the spatial correlation between sensor nodes subject to observed events, it may not be necessary for every sensor node to transmit its data. This paper shows how the spatial correlation can be exploited on the Medium Access Control (MAC) layer. To the best of our knowledge, this is the first effort which exploits spatial correlation in WSN on the MAC layer. A theoretical framework is developed for transmission regulation of sensor nodes under a distortion constraint. It is shown that a sensor node can act as a representative node for several other sensor nodes observing the correlated data. Based on the theoretical framework, a distributed, spatial Correlation-based Collaborative Medium Access Control (CC-MAC) protocol is then designed which has two components: Event MAC (E-MAC) and Network MAC (N-MAC). E-MAC filters out the correlation in sensor records while N-MAC prioritizes the transmission of route-thru packets. Simulation results show that CC-MAC achieves high performance in terms energy, packet drop rate, and latency.     

基于云模型的无线传感器网络恶意节点识别技术的研究

 无线传感器网络(Wireless Sensor Network,简称WSN)是一种没有基础设施的自组织无线网络.和其它网络一样,WSN需要安全措施来保证网络通信的安全.但是,在无线传感器网络中,基于密码的安全体系不能有效处理来自网络内部的攻击,识别出恶意节点.因此,信任模型被用于无线传感器网络恶意节点识别.在信任模型和云理论的研究基础上,本文构建了一个基于云理论的无线传感器网络信任模型——云信任模型(CTM,Cloud-based Trust Model).实验结果表明,云信任模型能够有效识别恶意节点.     

Agent‐based secure routing for underwater acoustic sensor networks

The underwater networks have severe security implications and are vulnerable to various types of attacks such as selective forwarding, wormhole, and sinkhole. Neighbor discovery, a fundamental requirement for routing is vulnerable to wormhole attack, which enables false neighbor acceptance, thereby degrading the routing performance. The proposed agent‐based secured routing scheme enhances the quality of service by discovering the wormhole resilient secure neighbors and route the information through the secure path. This scheme uses 4 agencies, namely, security, routing, underwater gateway, and vehicle, which are embedded with static and mobile agents. (1) Agents in security agency of a node discover secured neighbors by using the direction of arrival estimation and authentication, (2) agents in routing agency of a node establish secured routes from source to surface gateway, (3) agents in Underwater Gateway Agency communicate with Autonomous Underwater Vehicles (AUVs) and underwater nodes for key distribution, and (4) vehicle traversing agency in AUV coordinates with Underwater Gateway Agency for changing AUVs traversal to cover the isolated network area. The proposed scheme depicts the improved performance compared to basic neighbor discovery and channel aware routing protocol in terms of failure detection, energy consumption, and overheads.     

无线传感器网络MAC层协议的分析比较

无线传感器网络是一种由大量廉价微型传感器节点组成,并通过无线通信方式形成的多跳自组织网络,可用于对其部署区域的某些物理量进行智能监测。由于传感器节点数目较大,MAC协议是保证无线传感器网络高效通信的关键网络协议之一。另一方面,因为传感器节点受到电源能量有限、通信能力有限、计算和存储能力有限等现实条件的限制,传感器网络中的MAC协议又具有一些独特之处。对无线传感器网络MAC协议的研究现状进行较全面的考察,分析比较其中的几种典型MAC协议,并提出了该领域的发展趋势和未来工作的一些思路。     

基于深度强化学习的无人机可信地理位置路由协议

针对无人机(UAV)通信过程中存在的高移动性和节点异常问题,该文提出一种基于深度强化学习的无人机可信地理位置路由协议(DTGR)。引入可信第三方提供节点的信任度,使用理论与真实的时延偏差和丢包率作为信任度的评估因子,将路由选择建模为马尔可夫决策过程(MDP),基于节点信任度、地理位置和邻居拓扑信息构建状态空间,然后通过深度Q网络(DQN)输出路由决策。在奖励函数中结合信任度调整动作的价值,引导节点选择最优下一跳。仿真结果表明,在包含异常节点的无人机自组网(UANET)中,DTGR与现有方案相比具有更低的平均端到端时延和更高的包递交率。当异常节点数量或者比例变化时,DTGR能感知环境并高效智能地完成路由决策,保障网络性能。     

A trust enhanced secure clustering framework for wireless ad hoc networks

Secure clustering in Wireless Ad Hoc Networks is a very important issue. Traditional cryptographic solution is useless against threats from internal compromised nodes. In light of this, we propose a novel distributed secure trust aware clustering protocol that provides secure solution for data delivery. A trust model is proposed that computes the trust of a node using self and recommendation evidences of its one-hop neighbors. Therefore, it is lightweight in terms of computational and communication requirements, yet powerful in terms of flexibility in managing trust. In addition, the proposed clustering protocol organizes the network into one-hop disjoint clusters and elects the most qualified, trustworthy node as a Clusterhead. This election is done by an authenticated voting scheme using parallel multiple signatures. Analysis of the protocol shows that it is more efficient and secure compared to similar existing schemes. Simulation results show that proposed protocol outperforms the popular ECS, CBRP and CBTRP in terms of throughput and packet delivery ratio with a reasonable communication overhead and latency in presence of malicious nodes.     

Wheel Based Event Triggered Data Aggregation and Routing in Wireless Sensor Networks: Agent Based Approach

Event triggered data aggregation and routing minimizes the amount of energy and bandwidth required to transmit the data from the event affected area. This paper proposes a Wheel based Event Triggered data aggregation and routing (WETdar) scheme in Wireless Sensor Networks (WSNs) by employing a set of static and mobile agents. A wheel with spokes is constructed by WSN nodes around an event node (a sensor node where an event occurs). Gathering and aggregation of the information is performed along the spokes of a wheel in Spoke Aggregator (SA) nodes and sent to an event node, which routes to a sink node. Spoke generation and identification of SA nodes along the spokes is performed by using a mobile agent, based on parameters such as Euclidean distance, residual energy, spoke angle and connectivity. Mobile agent and its clones discover multiple paths to a sink node from an event node. The scheme is simulated in various WSN scenarios to evaluate the effectiveness of the approach. The performance parameters analyzed are number of SAs, SA selection time, aggregation time, aggregation energy, energy consumption, number of isolated nodes and network life time. We observed that proposed scheme outperforms as compared to the existing aggregation scheme.