Shaik Sahil Babu

A Direct Trust Dependent Link State Routing Protocol Using Route Trusts for WSNs (DTLSRP)

The traditional cryptographic security techniques are not sufficient for secure routing of message from source to destination in Wireless Sensor Networks (WSNs), because it requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth. It is not economic and feasible because, depending on the application, WSN nodes are high-volume in number (hence, limited resources at each node), deployment area may be hazardous, unattended and/or hostile and sometimes dangerous. As WSNs are characterized by severely constrained resources and requirement to operate in an ad-hoc manner, security functionality implementation to protect nodes from adversary forces and secure routing of message from source node to base station has become a challenging task. In this paper, we present a direct trust dependent link state routing using route trusts which protects WSNs against routing attacks by eliminating the un-trusted nodes before making routes and finding best trustworthy route among them. We compare our work with the most prevalent routing protocols and show its benefits over them.

Geometric mean based trust management system for WSNs (GMTMS)

The Wireless Sensor Network (WSN) nodes are high-volume in number, and their deployment environment may be hazardous, unattended and/or hostile and sometimes dangerous. The traditional cryptographic and security mechanisms in WSNs cannot detect the node physical capture, and due to the malicious or selfish nodes even total breakdown of network may take place. Also, the traditional security mechanisms in WSNs requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth at node. Hence, they are not sufficient for secure routing of message from source to destination in WSNs. Alternatively, trust management schemes consist a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). In this paper, we propose a new geometric mean based trust management system by evaluating direct trust from the QoS characteristics (trust metrics) and indirect trust from recommendations by neighbour nodes, which allows for trusted nodes only to participate in routing.

Trust integrated link state routing protocol for Wireless Sensor Networks (TILSRP)

Several methods exist for the assignment of trust to the nodes present in a Wireless Sensor Network (WSN). In this paper we develop a new algorithm for calculation of trust of individual nodes using both Direct and Indirect Trusts and thereby use the calculated trusts for determination of the different route trusts (RTs) to the Base Station. We present a link state routing protocol based on trust which protects the WSN against routing attacks by eliminating the un-trusted nodes beforehand. It then forms the routes and finds the best trustworthy route among them by comparing the values of all the calculated route trusts as for each and every route present in the network. This paper also shows the advantage of inclusion of Indirect Trusts in addition to the Direct Trusts. Finally, we compare our work with the most prevalent routing protocols and show its benefits over them.

Fuzzy Logic Election of Node for Routing in WSNs

Sensor nodes of Wireless Sensor Networks (WSNs) are resource constraints in energy, memory, processing and communication bandwidth. Since they are operated by battery, their life span is limited. Specially, energy conservation is very important issue in the WSN, because it directly affects the life of the node as well as the entire network. Here, we develop a new way of electing a node among many trustworthy nodes for routing processes. This method consumes the energies of network nodes based on Fuzzy logic applied on their residual energy, trust level and distance from the Base Station. The proposed method elects one indispensible node for participating in routing among many worthy nodes. Hence, this method of election of node for routing in WSN sees the conservation of nodes energies go by very smooth and justifying, thereby increasing the life of the WSN.

Trustworthy Route formation Algorithm for WSNs

paper introduces a new algorithm for the formation of trustworthy route from source node to Base Station (BS) for secure routing of messages in Wireless Sensor Networks (WSNs). This algorithm process the information given by the Trust dependent Link State Routing Protocol which is improved version of our Routing Protocol presented in (1) Direct Trust dependent Link State Routing Protocol based on Geometric M ean (GM ) of the QoS characteristics which allows the trusted nodes only to participate in the routing. Execution of this algorithm at any node, gives different trusted routes to the BS with different route trusts by filtering the un-trusted nodes on the basis of trust metrics levels. The source node selects the best trustworthy route among many trusted routes given by the neighbor nodes based on neighbor nodes trust levels and the route trust levels of different routes given by them. The newly formed trustworthy route from source node to BS will be the best trustworthy route without considering the malicious/selfish nodes.

Trust integrated node potential aware routing for WSNs

Wireless sensor networks (WSNs) are suffering from protocols requiring high energy for packet routing to base station. The nodes energy dissipation in communicating with base station plays major role while designing a routing protocol because it directly affects the life of the node as well as the entire network as nodes operate with battery that is not replaceable. Here, we develop a new routing method with innovative technique to eliminate energy inefficiencies that shorten the lifetime of the network, TINPAR: trust integrated node potential aware routing for wireless sensor networks. In this routing method, at every node in the route, a high potential node among its neighbours will be elected for forwarding the packet applying fuzzy logic on residual energy, trust and the distance from the base station. In this new way of routing, the election of next hop node is spread to all nodes in the radio range.