The document is a thesis submitted by Devdutta Chakrabarti to the department of computer science and engineering at Gurunanak Institute of Technology. The thesis proposes secure and reliable routing protocols for heterogeneous multihop wireless networks. It presents E-STAR, a payment and trust-based routing architecture, and two routing protocols - shortest reliable route and best available route. E-STAR aims to enhance route reliability and stability by rewarding nodes for forwarding packets and punishing nodes that report incorrect energy levels. The document outlines the network and adversary models, payment and trust systems, route establishment phase, security analysis and concludes that E-STAR can secure payment/trust calculations and stimulate nodes to maintain route stability.

1. GURUNANAK INSTITUTE OF TECHNOLOGY
SODEPUR -700114
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING(MTECH.)
Thesis on:-
“Secure and Reliable Routing Protocols
for Heterogeneous Multihop Wireless
Networks”
Under The Guidance Of
Mrs. SRABANI KUNDU
BY:- DEVDUTTA CHAKRABARTI
Roll No-14311214001

2. Contents
 Wireless Ensor networks
 Advantage and Disadvantage of WSN
 Java
 Literature Survey
 Introduction
 E-Star Architecture
 Related Works
 Comparison
 Existing System
 Proposed System
 System Models
 Security Analysis
 Route Establishment Phase
 Test Cases
 Advantages
 Conclusion
References
6/17/2016
2
GNIT_CSE(M.TECH)

3. Wireless Sensor Networks
 A wireless sensor network (WSN) are spatially distributed
autonomous sensors to monitor physical conditions such as
temperature, sound, pressure etc. and to cooperatively pass
their data through the network to a main location.
 A collection of sensing devices that can communicate
wirelessly.
6/17/20163 GNIT_CSE(M.TECH)

4. Advantages of WSN
 It avoids a lot of wiring .
 It can accommodate new devices at any time .
 It's flexible to go through physical partitions .
 It can be accessed through a centralized
monitor
6/17/20164 GNIT_CSE(M.TECH)

5. Disadvantages of WSN
 Lower speed compared to wired network.
 Still Costly at large.
 More complex to configure than wired network.
 It does not reduce costs for installation of
sensors.
6/17/20165 GNIT_CSE(M.TECH)

6. Introduction to Java
 Java
 Features of Java
6/17/20166 GNIT_CSE(M.TECH)

7. Literature Survey
 An Efficient Anonymous Communication Protocol for
Wireless Sensor Networks
 A Survey on Various Manet Routing Protocols Based on
Anonymous Communication
 Selective Acknowledgement Scheme to Mitigate Routing
Misbehavior in Mobile Ad Hoc Network
 LogitTrust: A Logit Regression-based Trust Model for
Mobile Ad Hoc Networks
 Performance of Swarm Based Intrusion Detection System
Under Different Mobility Conditions in MANET
 The Role of Trust Management in Distributed Systems
Security
 An Acknowledgement-Based Approach for the Detection
of Routing Misbehaviour in MANETS 6/17/20167 GNIT_CSE(M.TECH)

8. Introduction
 In multihop wireless networks, when a mobile node
wants to communicate with a destination, it relies on the
other nodes to forward the packets. This multihop
packet transmission can extend the network coverage
area using limited power and improve area distance
efficiency.
 E-STAR integrates the payment and trust systems with
the routing protocol with the goal of enhancing route
reliability and stability.
 The payment system describes to charge the nodes that
send packets and reward those forwarding packets.6/17/20168 GNIT_CSE(M.TECH)

9. E-Star Architecture
6/17/20169
GNIT_CSE(M.TECH)

10. E-Star
 E-STAR has three main phases.
1. Data Transmission phase:- the source node
sends messages to the destination node.
2. Update Credit-Account and Trust Values
phases:- TP determines the charges and
rewards of the nodes and updates the node’s
trust values.
3. Route Establishment phase:- Trust-based and
energy-aware routing protocol establishes
stable communication routes.
6/17/201610 GNIT_CSE(M.TECH)

11. Related works
Reputation-Based Schemes
 Reputation-based schemes attempt to identify the malicious nodes that drop packets with
a rate more than a predefined threshold in order to avoid them in routing. these schemes
cannot guarantee route stability or reliability in HMWNs.
Payment Schemes
 Payment schemes use credits to encourage the nodes to relay others’ packets . Since
relaying packets consumes energy and other resources, packet relaying is treated as a
service which can be charged. The nodes earn credits for relaying others’ packets and
spend them to get their packets delivered.
Trust system
 The main goal is to enable the nodes to indirectly build trust relationships using
exclusively monitored information.
Comparison
 Different from reputation-based schemes that aim to identify the malicious nodes, E-
STAR does not suffer from false accusations because it aims to identify the competent
nodes in packet relaying and select them in routing.
6/17/2016
11
GNIT_CSE(M.TECH)

12. 6/17/2016
12
GNIT_CSE(M.TECH)

13. Existing System
 The multihop wireless network implemented in
many useful applications such as data sharing
and multimedia data transmission. It can
establish a network to communicate, distribute
files, and share information.
 Disadvantages of Existing System:
 Less security.
 Probability of breaking the route is highly
possible.
 Nodes do not have sufficient energy. 6/17/201613 GNIT_CSE(M.TECH)

14. Proposed System
 We develop two routing protocols to direct traffic through
those highly-trusted nodes having sufficient energy to
minimize the probability of breaking the route. By this
way, E-STAR can stimulate the nodes not only to relay
packets, but also to maintain route stability and report
correct battery energy capability.
Advantages of Proposed System:
 Reduce the probability of breaking the routes.
 E-STAR integration can deliver messages through
reliable routes and allow the source nodes to prescribe
their required level of trust.
6/17/201614 GNIT_CSE(M.TECH)

15. SYSTEM MODELS
 Network Model
The considered HMWN has mobile nodes and offline
trusted party whose public key is known to all the
nodes. The mobile nodes have different hardware
and energy capabilities.
 Adversary Model
The adversaries have full control on their nodes.
They can change the node’s normal operation and
obtain the cryptographic credentials.
6/17/201615 GNIT_CSE(M.TECH)

16. Route Establishment Phase
 In this section, we present two routing protocols
called the shortest reliable route and the best
available route. SRR establishes the shortest
route that can satisfy the source node’s trust,
energy, and route-length requirements, but the
destination node selects the best route in the
BAR protocol.
 The routing protocols have three processes:
1) route request packet (RREQ) delivery
2) Route selection and 6/17/201616 GNIT_CSE(M.TECH)

17. Srr
 RREQ :It contains the packet type identifier “RREQ”, the
identities of the source and destination nodes IDS and
IDD, the maximum number of intermediate nodes (Hmax),
the time stamp of the route establishment (ts), the trust
and energy requirements ðTr ¼ ½tð1Þ; tð2Þ; tð3Þ; tð4Þ
and ErÞ, and the source node’s signature and certificate.
Hmax can limit the propagation area of the packet and ts
can ensure the freshness of the request.
 Route selection: If there is a route that can satisfy the
source node’s requirements, the destination node receives
at least one RREQ packet.
 RREP: The RREP packet contains the packet type
identifier “RREP”, the identities of the nodes in the route
ðRÞ, h0, the destination node’s certificate, and the nodes’
authentication code.h0 is the root of the hash chain
created by the destination node 6/17/201617 GNIT_CSE(M.TECH)

18. BAR Routing Protocol
RREQ: The RREQ packet contains IDS; IDD;
ts;Hmax, the source node’s certificate and
signature ðSigSÞ, and the number of messages it
needs to send ðErðSÞÞ.
Route selection. After receiving the first RREQ
packet, the destination node waits for a while to
receive more RREQ packets if there are. Then, it
selects the best available route if a set of feasible
routes are found.
RREP: This phase is identical to that of the SRR
routing protocol 6/17/201618 GNIT_CSE(M.TECH)

19. SECURITY ANALYSIS
 Securing the payment and trust calculation are based
on the following well known cryptographic properties:
1) forging or modifying a signature without knowing the
private key is infeasible
2) deriving the private keys from the public ones is
infeasible
3) computing the hash value of a signature without
computing the signature is infeasible.
4) computing the hash function’s input from its output is
infeasible.
6/17/201619 GNIT_CSE(M.TECH)

20. 6/17/201620
GNIT_CSE(M.TECH)

21. Cont..
6/17/201621 GNIT_CSE(M.TECH)

22. Advantages
 Data is fully secure
 Can not be hacked by hacker
6/17/201622 GNIT_CSE(M.TECH)

23. Conclusion
We have proposed E-STAR that uses payment/trust systems with trust-
based and energy-aware routing protocol to establish stable/reliable routes in
HMWNs. E-STAR stimulates the nodes not only to relay other’s packets but
also to maintain the route stability. It also punishes the nodes that report
incorrect energy capability by decreasing their chance to be selected by the
routing protocol. We have proposed SRR and BAR routing protocols and
evaluated them in terms of overhead and route stability. Our protocols can
make informed routing decisions by considering multiple factors, including
the route length, the route reliability based on the node’s past behavior, and
the route lifetime based on the node’s energy capability. SRR establishes
routes that can meet source node’s trust/energy requirements. It is useful in
establishing routes that avoid the low-trust nodes, e.g., malicious nodes, with
low overhead. For BAR, destination nodes establish the most reliable routes
but with more overhead comparing to SRR. The analytical results have
demonstrated that E-STAR can secure the payment and trust calculation
without false accusations. Moreover, the simulation results have
6/17/201623 GNIT_CSE(M.TECH)

24. References
[1] G. Shen, J. Liu, D. Wang, J. Wang, and S. Jin, “Multi-Hop Relay for Next-
Generation Wireless Access Networks,” Bell Labs Technical J., vol. 13, no. 4,
pp. 175-193, 2009.
[2] C. Chou, D. Wei, C. Kuo, and K. Naik, “An Efficient Anonymous
Communication Protocol for Peer-to-Peer Applications over Mobile Ad-Hoc
Networks,” IEEE J. Selected Areas in Comm., vol. 25, no. 1, Jan. 2007.
[3] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in
Mobile Ad Hoc Networks,” Proc. ACM MobiCom’00, pp. 255-265, Aug. 2000.
[4] X. Li, Z. Li, M. Stojmenovic, V. Narasimhan, and A. Nayak, “Autoregressive
Trust Management in Wireless Ad Hoc Networks,” Ad Hoc & Sensor Wireless
Networks, vol. 16, no. 1-3, pp. 229-242, 2012.
[5] G. Indirania and K. Selvakumara, “A Swarm-Based Efficient Distributed
Intrusion Detection System for Mobile Ad Hoc Networks (MANET),” Int’l J.
Parallel, Emergent and Distributed Systems, vol. 29, pp. 90-103, 2014.
[6] H. Li and M. Singhal, “Trust Management in Distributed Systems,” Computer,
vol. 40, no. 2, pp. 45-53, Feb. 2007.
6/17/201624 GNIT_CSE(M.TECH)

25. Thank
you!!
6/17/201625 GNIT_CSE(M.TECH)