ENERGY EFFICIENT SECURE ROUTING IN
DELAY TOLERANT NETWORKS USING
DYNAMIC TRUST AWARE ROUTING
PROTOCOL
R. Mohan Kumar1, Dr. A. V. Ram prasad2
1
Department of ECE, K.L.N. College of Engineering, Sivagangai District India
2
Department of ECE, K.L.N. College of Engineering, Sivagangai District, India
[email protected]
Abstract— Trust management is challenging in wireless sensor networks due to dynamically
changing network environments and the lack of a centralized trusted authority for improving the
network security. Delay Tolerant Networks is distinguished by lack of continuous network
connectivity, resulting in a lack of instantaneous end to end paths, large end to end delays and
intermittent links. In earlier, even though the message delivery ratio and message delay is
efficient, but large amount of energy is used. To reduce energy usage and we further increase
the throughput and packet delivery ratio, we design and validate a Dynamic Trust Aware
Routing Protocol (DTARP) for energy efficient secure routing in Delay Tolerant Network
environments in the presence of selfish, well behaved and malicious nodes. To analyze and for
validation for the Trust Protocol (TP), we use a mathematical model based on stochastic petri net
(SPN). We propose to combine social trust which is derived from social networks and
traditional Quality of Service (QOS) trust which is derived from communication networks into a
composite trust based metric to assess the trust of a node in a Delay Tolerant Networks.
Keywords—Delay tolerant networks, Dynamic trust aware routing protocol, Secure routing,
Stochastic petri net, Quality of Service
I INTRODUCTION
Delay Tolerant Networks (DTN) consists of mobile nodes which experiences long queuing
delays, lack of end to end connection and low power requirements. As because of mobile nodes,
it uses store-carry-forward fashion. The intermediate nodes can hold the message until the next
communication opportunity is available which results in high delay. DTN is applied for wireless
sensor networks, rural communication, satellite communications and space communications.
Delay tolerant network is an approach to computer network architecture that seeks to address
the technical issues in heterogeneous networks that may lack continuous network connectivity.
Examples of such networks are those operating in mobile or extreme terrestrial environments or
planned networks in space, inter planetary networks. The routing in DTN depends on basic
network assumptions such as mobility, mobility patterns, node capacity and the routes are time
dependent.
In this paper we propose Dynamic trust aware routing protocol (DTARP) for secure routing.
By the use of a trust metric the trust values of neighbor nodes are evaluated. The misbehavior of
a node can lead to the drop of packets or delivered to wrong destinations. The characteristics of
our routing protocol are security will be inherently built into the network, messages are received
with a high level of confidence, it finds an optimal route that has highest level of security that the
current network can provide. The trust level of a node depends on the characteristics of trust
metric (i.e.) combination of QoS trust and social trust. The trust is computed dynamically within
the node’s cluster. In this protocol, the resource usage is optimized and it easily adapts to the
changes in the environment.
Secure routing is an important factor when transmitting the packets from source to destination
through intermediate nodes in the dynamic environment. Due to the mobility of nodes, some
nodes become malicious which drops the packets without reaching the desired destination. In this
paper, our aim is to identify the trust nodes and to establish the trust path for secure routing in
delay tolerant networks using DTARP. The trust level of a node can be determined by the
combination of QoS trust and social trust. We consider healthiness and unselfishness as social
trust metrics, energy and connectivity as QoS trust metrics.
In this paper , To reduce energy usage and we further increase the throughput and
packet delivery ratio, we design and validate a Dynamic Trust Aware Routing Protocol
(DTARP) for energy efficient secure routing in Delay Tolerant Network environments in the
presence of selfish, well behaved and malicious nodes
II RELATED WORK
E. Ayday, H. Lee, and F. Fekri [1], Efficient malicious node detection for DTNs is done,
the proposed algorithm in this paper is Iterative Trust and Reputation Mechanism (ITRM). It
detects the malicious node and isolates it from the network in a very short period. Based on the
past behavior of nodes, each node evaluates the other nodes in the network to detect a malicious
node. The proposed algorithm also consists of trust management mechanism which identifies the
trusted node based on direct transaction that it had previously. In the presence of Byzantine
attackers the resulting scheme provides high data availability and low latency. The performance
of this scheme is shown with availability and packet delivery ratio.
John Burgess [2], proposed Max-prop routing protocol for disruption tolerant networks.
It uses acknowledgments that are transmitted to the whole network not only to the source. It
prevents the data from transmitting the same information twice to the same node by storing the
list of previous intermediaries. The author assumed the disruption tolerant networks composed of
buses. To increase the delivery rate and reducing the latency for delivered packets, the protocol
transmits the packets based on scheduling that is it assumes the priority values to find which
packets are transmitted first and also which packets are to be deleted.
Anders Lindgren [3], proposed PROPHET, a probabilistic routing protocol for
intermittently connected networks. Routing in such networks is quiet difficult as the connection
between source and destination is lost frequently so routing is done by history of node
encounters and transitivity to maximize the performance of routing in intermittently connected
networks and to reduce the communication overhead. The author considered the simply
forwarding strategy. The parameters considered are initialization constant, aging constant and
scaling constant. Here the routing is done when two nodes encounter their history is shared
among them and they transfer the message to the neiboring node if the delivery predictability of
the destination of the message at the other node is higher. The limitation in this paper is the
author considered FIFO queue at the nodes (i.e.) the message is waiting for long time in the
queue is dropped whenever the new message arrives at the full queue.
Sacha Trifunovic and Franck Legendre [4], proposed social trust in Opportunistic
networks. Trust is the secure interactions between unknown nodes and the trust assigned to the
nodes is based on the direct observations. He proposed two approaches for social trust –explicit
social trust and implicit social trust that are robust to Sybil attacks. Sybil attack creates many
identities to gain large influence in reputation systems. To avoid creating many identities is to
establish trust in the identities being genuine. The limitation of this paper is weighting of explicit
and implicit trust is not done and the trust level is fundamental.
C.M.Chen [5], proposed algorithm in this paper is Admission control algorithm with
negotiation mechanism. It finds the best partitions and system performance optimization with
two classes of client requests and the analytical model. The performance of this scheme is based
on the objective function of the total reward minus total penalty. The Qos requirements of the
many low priority clients should be reduced by using negotiation mechanism. Under over
loaded system it accepts high priority request and lowering the low priority request. The
proposed system model adopts the reward and penalty to optimize the system performance. The
optimal threshold values can be found by using Stochastic Petri Net model and the sub optimal
settings are determined by using analytical method.
Q.Li, S.Zhu [6] proposed algorithm in this paper is Social Selfish Aware Routing
Algorithm. It allows user selfishness and efficiently provides better routing performance. In
order to select a forwarding node, the proposed algorithm considers the both users willingness to
forward and their contact opportunity resulting in efficient forwarding scheme than contact based
approaches. The SSAR allocates resources such as buffers and bandwidth based on priority to
maintain social selfishness. The proposed algorithm also considers Multiple Knack sack Problem
with Assignment Restrictions (MKPAR) to formulate the data forwarding process.
III PROPOSED WORK METHODOLOGIES
We have considered DTN which has no centralized authority. There are many
intermediate nodes between the source and destination so packets are transmitted via these
intermediate nodes. We find the trusted nodes among the network by combining Qos trust and
social trust. We propose energy efficient secure routing in delay tolerant networks using dynamic
trust aware routing protocol. Our aim is to design and validate a dynamic trust aware routing
protocol for DTN routing performance optimization in response to dynamically changing
conditions such as the population of misbehaving nodes. Here we minimize the large amount of
energy being used and to increase throughput and packet delivery ratio. .
DYNAMIC TRUST AWARE ROUTING PROTOCOL
In Dynamic Trust Aware Routing Protocol (DTARP), each node evaluates the trust of its
neighbor nodes which improves security. It selects the route to forward the packets to the
destination through shortest path but also some security oriented information’s so that it achieves
efficiency by controlling the overhead messages.
Our protocol involves in trust compositions, trust aggregates, trust formation and
application level trust optimization. It evaluates the trust level of a node based on direct trust and
indirect trust. We combine social trust and QoS trust as trust metric for the trust evaluation.
Fig: 1 Flowchart for trust evaluation for propose work
We consider the trust level of node as a real number in the range [0,1]. Here 0 indicates
complete no trust, 0.5 indicates ignorance and 1 indicates complete trust. We consider node i as
trust or node j as trustee, node m as newly encountered node, node k as recommender. We have
also considered the four trust components such as healthiness, unselfishness, connectivity and
energy.
Initially node i which is the source node encounters a new intermediate node m between
the source and destination. Both the nodes exchange their trust information, past history about
encounters, and their trusted node list etc. In the trust composition part, each node evaluates the
trust property X of node j. Now it checks whether the trust property of both the encountered node
and the trusted node is equal or not. If they are equal it calculates the trust using direct
observations and also by using past indirect trust. When they are not equal it is calculated by
using past direct trust. After that by the recommendations of the other nodes it evaluates the trust.
The calculated direct trust and indirect trust is combined which is explained in the equation later.
These calculations come under trust aggregation. Now the trust formation has to be done that is
we have four trust components that must be integrated to calculate the overall trust. Now all the
evaluations to compute trust have been done. By using these next trusted node is identified to
transmit the packet via that node.
IV TRUST CALCULATION
To calculate trust by using direct observations is given by,
Ti,jdirect, X (t+∆t) = Ti,jencounter, X(t+∆t) , if Ci,jdirect,X(t)=true
e-λd∆t x Ti,jdirect, X(t) , if Ci,jdirect,X(t)=false ------------ (1)
It is done when node i encounters node j directly at particular time t. Now the next step to
calculate the trust value is here there is no new indirect trust currently so we can update the trust
by the previous indirect trust which is given by,
Ti,jindirect, X (t+∆t) = e-λd∆t x Ti,jindirect, X(t)
------------- (2)
When both the information’s are not equal it carries two steps to evaluate the trust. When
both the nodes encounter and there is no direct trust node i just updates with its past experience
which is given by,
Ti,jdirect, X (t+∆t) = e-λd∆t x Ti,jdirect, X(t)
-------------- (3)
Node k provides recommendations about the encountered node and so node i updates the
trust by this recommendation because it considers node k as a trusted recommender. It considers
as a referral trust which is given in the equation,
Ti,jindirect,X(t+∆t)=e-λd∆tx Ti,jindirect,X(t), |Ri|=0
-------------- (4)
Now combine both direct trust and indirect trust when node i encounters node j at an
interval (t+∆t) where node i is the trustor and node j is the trustee and it is given in the equation
as,
Ti,jX(t+∆t)=βTi,jdirect,X(t+∆t)+ (1-β)Ti,jindirect,X (t+∆t) -------------- (5)
Finally the overall trust is computed in the following equation the weighted average of
healthiness, unselfishness, connectivity and energy when node j is encountered by node i at a
time t,
X
X
Ti,j(t) = ∑𝑎𝑙𝑙
𝑋 𝜔 × Ti,j (t)
---------------- (6)
Healthiness:
A node which is unhealthy is known as malicious node.
Unselfishness:
A node which is socially selfish drops the packets when the source or destination node or
the intermediate node is not in its friend list.
Connectivity:
The connectivity is measured by the probability that whether the node m and node d are
in the same location at a given time t.
Energy:
It is the energy status of a node that is the remaining energy present in the node currently.
Initially the energy of a node is assigned as 100
V ALGORITHM IMPLEMETATION PROCEDURE
Based on the dynamic trust aware routing algorithm, the procedure are as follows:
Step 1:
At first, 100 nodes are created and the positions are set.
Step 2:
Initially, a source node sends a Route Request (RREQ) message to all the neighbor nodes
for transmitting the packet.
Step 3:
All the neighbor nodes send a Route Reply (RREP) message to the source node.
Step 4:
Source node evaluates the trust value of all the nodes and it selects the node which has
higher trust value as the trusted node.
Step 5:
Then, the source node selects the trusted node to the destination with the smallest hop
count.
Step 6:
If the path meet the required limit and have the equal hope count, the route with the
maximum trust path will be selected as the routing path.
Step 7:
It then transmits the packet to the destination node via trusted node securely.
VI RESULTS AND DISCUSSIONS
We have analyze various QOS parameters like throughput, time, PDR an Energy using
our propose simulation works with help of network simulator version 2.34. The results are better
than existing methods as shown in following fig 2,3 & 4.
Fig.2 Throughput vs Time
Fig.3 Packet delivery ratio vs Time
Fig4 Energy Consumed vs Time
VII CONCLUSION
Trust management for a delay tolerant network is one of the main concerns in terms of
providing security. The dynamic trust aware routing scheme is validated and trust values of
trusted nodes are calculated and displayed in the terminal and secure routing is done via trusted
nodes using trust table which is defined with routing table for secure routing optimizations in
delay tolerant network. In our proposed work, we have increased the Throughput, Packet
Delivery Ratio when compared to the existing work and also we have achieved low energy
consumption using Gnuplot and the comparisons are shown. In future we can try with clustering
network dynamic trust aware routing protocol to improve the secure QOS and life time also.
REFERENCES:
E. Ayday, H. Lee, and F. Fekri, (2010) .Trust Management and Adversary Detection for Delay
Tolerant Networks. Proc. Military Comm. Conf., pp. 1788-1793.
J. Burgess, B. Gallagher, D. Jensen, and B.N. Levine,(2006).Maxprop: Routing for VehicleBased Disruption-Tolerant Networking. Proc. IEEE INFOCOM, pp. 1-11, Apr.
A. Lindgren, A. Doria, and O. Schelen,v(2003). Probabilistic Routing in Intermittently
Connected Networks. ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3,
pp. 19-20.
Trifunovic, F. Legendre, and C. Anastasiades, (2010). Social Trust in Opportunistic Network.
Proc. IEEE INFOCOM, pp. 1-6.
S.T. Cheng, C.M. Chen, and I.R. Chen, (2003). Performance Evaluation of an Admission
Control Algorithm: Dynamic Threshold with Negotiation. Performance Evaluation, vol. 52, no.
1, pp. 1- 13.
Q. Li, S.Zhu, and G.Cao, (2010). Routing in Socially Selfish Delay Tolerant Network. Proc.
IEEE INFOCOM, pp.1-9.