A modified approach for secure routing and power aware in mobile ad hoc network
1. A
Presentation Of Dissertation
On
A Modified Approach For Secure Routing And Power Aware In
Mobile Ad Hoc Network (MANET)
Submitted by:
Diksha Katiyar
Roll No:15EREDC601
Digital Communication
Dept. of ECE
RIET, JAIPUR
Supervisor:
Mr. Gajendra Sujediya
Asst. Professor[ECE]
RIET, JAIPUR
1
2. Presentation Outline
Introduction
Types And Application Of MANET
Routing In MANET
Objective
Literature Survey
Ad-hoc On-demand Distance Vector(AODV)
Main features of AODV Protocol
Proposed Algorithm
Implementation Results
Conclusion
Future Scope
References
2
3. Introduction
Mobile Ad-hoc Networks(MANETs) show better and valuable
performance in the circumstances where the generally used wireless
networks fail to work.
Mobile ad-hoc networks are formed dynamically by an
autonomous system of mobile nodes that are connected via wireless
links.
The monitoring operation is distributed among a few set of nodes
called monitor nodes.
No existing fixed infrastructure or centralized administration.
No base station.
Mobile nodes are free to move randomly.
4. Cont...
Nodes in the MANET have very limited resources such as very
limited communication ranges, so some node in the network can not
communicates directly.
Mobile ad-hoc network Supports Multi-hop routing.
Network topology changes frequently.
May Operate as standalone fashion or also can be connected to the
larger internet.
Each node work as router.
4
6. Types of MANET
Vehicular Ad hoc Network
(VANETs)
Internet Based Mobile Ad hoc
Networks (iMANETs)
Smartphone Based Mobile Ad-
Hoc Networks(SPANs)
Used across vehicles and road safety devices
for communication purpose.
Used for link mobile nodes and fixed internet-
gateway nodes.
Used across mobile phone devices by
creating peer-to-peer network through the
help of Wi-Fi and Bluetooth technology.
6
8. Application of MANET
Military Battlefield
Sensor Networks
• The modern digital battlefield demands
robust and reliable communication.
• Needed by soldiers for relaying
information.
• Used to detect any number properties of
an area.
• Capabilities of each sensors are very
limited .
8
9. Cont…
Personal Area Network
Disaster Area Network
• Home/Office Wireless Network
• Multiuser Games
• Outdoor Internet Access
• Search And Rescue Operations
• Disaster Recovery –Flood,
Earthquakes, Hurricanes.
• Emergency Rescue Operation
9
10. Routing In MANETs
Proactive Protocol – Table-driven
Maintain routes between every host pair all the time.
Shortest-path protocols.
Frequently update routing table.
Reactive Protocols – On-Demand
Creates and maintains routes only when needed.
Source initiates route discovery.
Hybrid protocols
Combination of proactive and reactive.
10
11. Objective
• To reduce the packet dropping attack.
• To demonstrated an increase in packet delivery ratio.
• To increase throughput for attack free environment.
• To decrease end delay of the network for better packet
deliveries.
• To decrease routing overhead for better number of routing
nodes.
11
12. Literature Survey
K.V Arya Et Al “Power Aware and Secure Routing in Mobile
and Ad-hoc Networks” 2013 IEEE 8th International Conference
on Industrial and Information System.
In this research paper algorithm are proposed to improve the
energy consumption and security of MANET. The proposed
algorithms utilize the dynamic route shortening and local route
repair scheme to improve the reliable packet delivery and enhance
the route maintenance if route breaks occur due to less remaining
energy in the nodes.
12
13. Cont…
J. Von Mulert, I. Welch and W. K. Seah, et al “Security threats
and solutions in MANETs: A case study using AODV and
SAODV,” Journal of Network and Computer Applications.
In this paper focuses on networks using the popular Ad-hoc On-
demand Distance Vector(AODV) protocol and a secure extension
to AODV, the Secure AODV (SAODV) protocol. SAODV is
representative of a number of secure versions of the AODV
protocol in that it relies upon the use of cryptographic mechanisms
to protect the routing control messages of AODV from being
forged and/or altered by attackers.
13
14. Cont..
• M.Cheng, J.Shun, M.Min and W.Wu et al “Energy-Efficient
Broadcast and Multicast Routing in Multihop Ad-hoc Wireless
Networks”, International Conference of Wireless
Communication and Mobile Computing, 2006
• They proposed the Minimum Incremental Powers (MIP) algorithm
and it is known as the most energy-efficient heuristic in terms of
the total energy consumption among all the topology. MIP is
developed based on the Broadcast Incremental Power(BIP)
algorithm. The MIP algorithm is used as a comparison for the
solution to the Energy balanced topology control problem, which
instead of minimizing the total energy, minimizes the maximum
energy consumption at each node. 14
15. Cont…
J. Wang, Y. Liu, and Y. Jiao, et al “Building a trusted route in
a mobile ad hoc network considering communication
reliability and path length,” Journal of Network and
Computer Applications,2011
This paper proposes a novel trusted route that considers
communication reliability and length for a reliable and feasible
packet delivery in a MANET
15
16. Ad-Hoc on-Demand Distance Vector(AODV)
AODV is a packet routing protocol designed for use in mobile ad
hoc networks (MANET)
Intended for networks that may contain thousands of nodes.
Source, destination and next hop are addressed using IP addressing
Each node maintains a routing table that contains information
about reaching destination nodes.
16
17. Main Features of AODV Protocol
The packet size in AODV is uniform unlike DSR. there is no need
for system-wide broadcasts due to local changes.
AODV supports multicasting and unicasting within a uniform
framework.
The Ad hoc On-Demand Distance Vector protocol is both an on-
demand and a table- driven protocol
Each route has a lifetime after which the route expires if it is not
used.
A route is maintained only when it is used and hence old and
expired routes are never used.
17
18. Overview
The basic message set consists of:
RREQ – Route request
RREP – Route reply
RERR – Route error
HELLO – For link status monitoring
18
20. Proposed Algorithm
Algorithm 1: Computation of Flag values
1) Add the malicious nodes in the network.
2) Set all the nodes in to the promiscuous mode.
3) Generate the scene and connection pattern according to the simulation
parameters.
4) Write the TCL script for the AODV and for the proposed protocol.
5) Implement the Steps of the security algorithm in NS-2.
6) Run the simulation and generate the trace file.
7) Fetch Data from the trace file by using the appropriate AWK script.
8) Collect the data and form the results.
20
21. Algorithm 2: Computation route energy
1) If any node has the energy more than 70% it means it has sufficient energy
to take part in the routing process and it can take part for the longer time,
then assign the highest energy weight. If it has energy less than 30% then it
cannot take part in the routing process for the longer time.
2) When any route breaks during the data transmission then the upstream node
creates the route locally and sends the local route request message to all the
neighbouring node then
3) All the neighbouring nodes send the route reply message with its energy
weights and the upstream node selects the highest energy weight among
them.
21
25. Fig.4:Energy Consumption
The energy consumption with respect to the total number of nodes which are performing or
participating in the route and shows that the hybrid approach is able to achieve less energy
consumption which will increase the lifespan of the nodes.
25
26. Fig.5:Packet Delivery
The packet delivery of the network in terms of probability which shows that the proposed approach
is able to achieve high packet delivery in terms of successful packet deliveries and it is showing
closest to the 1 which shows that the proposed system is able to achieve high packet deliveries.
26
27. Fig.6:Routing Overhead
The routing overhead of the network which is one of the important parameter in the sensor network
which must be less for the low efficient overhead for the less collisions of the packets between the
nodes in the sensor networks. This parameters must be less as the number of routing nodes
increases.
27
28. Fig.7:Throughput
The throughput in kilobits per second and shows the proposed approach is able to achieve high
throughput of the network which shows the network is delivering packets from source to the
destination in attack free environment which is done in the efficient manner by our proposed approach.
28
29. Fig.8:End Delay
The end delay of the network which must be low for high packet deliveries and less packet losses which
shows that the proposed system is able to achieve less end delay from the source to the destination.
29
30. Conclusion
QoS-MAODV established a route to the destination satisfying the
QoS constraints delay, and bandwidth.
The QoS constraints are used to optimize the path. Depending on
the application, the application requirements could be transformed
to QoS requirements.
The performance is enhanced compared to the protocol MAODV.
Pocket delivery and throughputs is significantly increased.
Delay is reduced which is due to the selection of the path that
satisfies the QoS requirements.
30
31. Cont…
Routing Overhead is significantly reduced with number of route
nodes increased.
Delay is reduced which is due to the selection of the path that
satisfies the QoS requirements.
Thus, this thesis focused on the issues of energy efficiency in
multicast routing protocols for MANETs and successfully addressed
the following challenges, namely,
Energy drain reduction using multicast routings protocol.
Improved energy efficiency using distributed swarm intelligence
(DSI) in wireless mobile networks.
31
32. Cont…
Improved energy efficiency using distributed swarm intelligence
(DSI) in wireless mobile networks.
Design and implementation of a novel energy efficient multicast
routing protocol for MANET.
QoS enabled MAODV for Mobile ad-hoc network.
32
33. Future Scope
• In the future, the proposed protocols could be extended to analyze
the QoS metrics in an distributed network with increased numbers
of nodes.
• Additional QoS metrics could be analyzed based on the proposed
protocols and results could be observed for further improvement of
the protocols.
33
34. Reference
1) K.V. Arya, Kuldeep Narayan Thriphti ―Research on Power Aware and
Secure Routing in Mobile Ad hoc networks, International Conference on
industrial and information system ICIIS 2013 18-20 Aug 2013.
2) G. Varaprasad and R. Wahidabanu, “New power-aware multicast algorithm
for mobile ad hoc networks,” IEEE Potentials, vol. 32, no. 2, pp. 32– 35,
2013.
3) J. Von Mulert, I. Welch, and W. K. Seah, “Security threats and solutions in
MANETs: A case study using AODV and SAODV,” Journal of Network and
Computer Applications, vol. 35, no.4, pp. 1249–1259, 2012
4) J. Furthmuller and O. P. Waldhorst, “Energy-aware resource sharing with
mobile devices,” Computer Networks, vol. 56, no. 7, pp. 1920–1934, 2012.
5) X.Chen, J. Wu, Multicasting Techniques in Mobile Ad-hoc Networks,
Computer Science Department, South West Texas State University, San
Marcos, The Handbook of Ad-hoc Wireless Networks (2003) pp. 25–40.
6) W. Luo and Y. Fang, A Survey of Wireless Security in Mobile Ad hoc
Networks: Challenges and Available Solutions, Ad hoc wireless networking.
Dordrecht: Kluwer Academic Publishers; 2003. pp.319–64.
34
35. Cont…
7) M. Mohammed, Energy Efficient Location Aided Routing Protocol for
Wireless MANETs, International Journal of Computer Science and
Information Security, vol. 4, no.1 & 2, 2009.
8) M. Cheng, J. Shun, M. Min ,Y. Li ands W. Wu, Energy-Efficient Broadcast and
Multicast Routing in Multihop Ad Hoc Wireless Networks, Wireless
Communications ands Mobile Computing, vol. 6, no.2, pp. 213–223, 2006.
9) C.W Wu,Y.C TAY, C.K , Toh, Ad-hoc Multicast Routing Protocol Utilizing
Increasing Id-numbers(AMRIS) Functional Specification , Internet draft,
November1998.
10)J.J. Garcia-Luna-Aceves, E.L. Madruga, The core-asisted mesh protocol, IEEE
JSAC (1999) 1380–1394. August.
11)K.Chen, K.Nahrstedt, Effective location-guided tree construction algorithms
for small group multicast in MANET, Proceedings of these INFOCOM (2002)
1180–1189.
12)M. Gerla, S.J. Lee, W. Su, On-Demand Multicasts Routing Protocol (ODMRP)
for Ad-hoc Networks, Internet draft, draft-ietf-manet-odmrp-02.txt, 2000.35
36. Cont…
12) L. Ji, M.S. Corson, Differential destinations multicast-a MANET multicast
routing protocol for small groups, Proc. INFOCOM (2001) 1192–1201.
13)E. Bommaiah et al., AM Route: Ad-hoc Multicasts Routing Protocol, Internet
draft, August 1998.
14)C.C. Chiang, M. Gerla, L. Zhang, Forwarding group multicast protocol (FGMP)
for multi-hop, Mobile Wireless Networks, AJ. Cluster Comp, Special Issue on
Mobile Computing, vol. 1 (2), 1998, pp. 187–196.
15)P. Sinha, R. Sivakumar, V. Bharghavan, MCEDAR: multicast core-extraction
distributed ad-hoc routing, in: IEEEWireless Communications and Networking
Conference, September 1999, pp. 1313–1317.
16)L. Canourgues, J. Lephay, Soyer, ets al., STAMP: shared tree ad-hoc multicast
protocol, MILCOM 2006 (2006) 1–7, October.
36