International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9September 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3306

A Min-Max based approach for reliable routing in
congested network
Ekta
#1
, Gopal Sharma
*2

#
M.Tech Student( CSE) JCD College of Engineering, Affiliated to Guru Jambheshwar University,Hisar,India
*
Assistant Professor( CSE) JCD College of Engineering,Affiliated to Guru Jambheshwar University,Hisar,India


Abstract Security and efficiency are the basic requirement
of any user in any network.We are also presenting the work on
efficiency problem in wireless distributed network.Min-Max
based intelligent approach is presented here.
The presented work is based on nearest neighbour analysis
based on certain parameters like throughput,packet delay and
the data loss.
These parameters will be analyzed under the Min-Max
algorithm.Once the load factor will be identified,the next work
is to generate the path over these congestion free free nodes.It
is a host based approach that will convert each node as an
intelligent node that can perform the decesion regarding
congestion.
We are using Min-Max algorithm with priority based
approach and we will get the solution with in the polynomial
time.The approach will be independent to the protocoal as
well as to the topology.

Keywords AODV,Attacks,DOS,MANET,UDP,TCP

I. INTRODUCTION
Mobile Ad-Hoc Networks are autonomous and
decentralized wireless systems. MANETs consist of mobile
nodes that are free in moving in and out in the network. Nodes
are the systems or devices i.e. mobile phone, laptop, personal
digital assistance, MP3 player and personal computer that are
participating in the network and are mobile. These nodes can
act as host/router or both at the same time. They can form
arbitrary topologies depending on their connectivity with each
other in the network. Security in Mobile Ad-Hoc
Network is the most important concern for the basic
functionality of network. The availability of network services,
confidentiality and integrity of the data can be achieved by
assuring that security issues have been met.
MANETs often suffer fromsecurity attacks because of its
features like open medium, changing its topology
dynamically, lack of central monitoring and management,
cooperative algorithms and no clear defense mechanism. The
MANETs work without a centralized administration where the
nodes communicate with each other on the basis of mutual
trust. This characteristic makes MANETs more vulnerable to
be exploited by an attacker inside the network. MANETs must
have a secure way for transmission and communication and
this is a quite challenging and vital issue as there is increasing
threats of attack on the Mobile Networks. Security is the cry
of the day.
In order to provide secure communication and transmission,
the engineers must understand different types of attacks and
their effects on the MANETs. Wormhole attack, Black hole
attack, Denial of Service (DoS), are kind of attacks that a
MANET can suffer from.
A MANET is more open to these kinds of attacks because
communication is based on mutual trust between the nodes,
there is no central point for network management, no
authorization facility, vigorously changing topology and
limited resources.



Fig.1 MANET environment

II. DIFFERENT TYPES OF ATTACKS


Layer Attacks Solution
Application
Layer
Repudiation, data corruption Detecting and
preventing virus,
worms,
malicious
codes and
application
abuses by use of
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9September 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3307

Firewalls.
Transport
Layer
Session hijacking, SYN
Flooding
Authentication
and securing
end-to-end or
point-to-point
communication
use of public
cryptography
Network
Layer
Routing protocol attacks (e.g.
DSR, AODV),Wormhole,
blackhole, Byzantine, flooding
Protecting the ad
hoc routing and
forwarding
protocols
Data Link
Layer
Traffic analysis, monitoring,
disruption MAC(801.11), WEP
weakness etc.
Protecting the
wireless MAC
protocol and
providing link
layer security
support.
Physical
Layer
Eavesdropping, Jamming,
Interceptions.
Preventing signal
jamming denial-
of-service attacks
by using Spread
Spectrum
Mechanism.


III. HOW THE SCHEME WORK
































IV.Methodology of Min-Max approach
{
1. Define a Network with n nodes called
Node1,Node2.Noden.
2. Define m Source Nodes called
Src1,Src2.Srcm
3. Define Destination Nodes relative to
source node Dst1,Dst2.Dstm
4. Perform Communication over the
network between each pair of source
and destination
Start
Design the network along with network
area and the topology
Define the constraints in terms of
transmitting, receiving and forwarding
Define the source and destination node
Perform the authentication request to
neighbor nodes to verify node reliability
Send the communication parameters as
reply

Performthe Min Max based analysis to
identify attack over the node
Performthe communication over safe
End
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9September 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3308

Src1..Dst1,Src2..Dst2..Srcm..
Dstm.
5. Define the Thresholding parmaters for
loss, delay and transmission rate.
6. For i=1 to n


7. {
8. For j=1 to n
9. {
10. If(Neighbor(Node(i),Node(j))=True)
11. {
12. Performthe analysis on Node(j) under
three main parmaters called LossRate,
CommunicationRate and Delay
13. If(LossRate(Node(j))<LOSSTHRESHO
LD AND
DelayRate(Node(j))<DELAYTRHESH
OLD AND
TransmissionRate(Node(j))>RATETH
RESHOLD)
14. {
15. Set Node(j) Priority to High
16. }
17. Else
if(LossRate(Node(j))<LOSSTHRESHO
LD AND
DelayRate(Node(j))<DELAYTRHESH
OLD)
18. {
19. Set Node(j) Priority to Medium
20. }
21. Else if
(LossRate(Node(j))<LOSSTHRESHOL
D )
22. {
23. Set Node(j) priority to Low
24. }
25. If Node(j) priority is High, set it as next
HOP and perform communication on
that node
26. If No Node is of high priority, then
analyze the throughput on each
neighbor and if throughput >threshold,
increase the priority and repeat the
process
27. If All nodes are of Low priority then
find the node with highest throughput
and set it as current node.
28. }
29. }
IV.Simulation Results
For proof of our methodology we used NS-2.29
simulator to analyze the performance of proposed
scheme.For our simulation we used network layer
protocoal AODV. For transportation of important
packets transportation layer protocoal TCP is
used.Some non important communication are
developed with UDP.Our simulation is based on
parameters that is present in the following simulation
parameters table.



International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9September 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3309

A. Simulation environment:
In our simulation a node starts at random
position,waits for the pause time,and then moves to
other position.The simulation time is of 100 seconds.

B.Traffic Scanerio:
In our simulation result the total participating nodes
are 36. Node 20 is the source node and the
communication is performed over the network to
transfer large amount of data over the network. Node
24 is here defined as the receiver node on which
heavy load is given and the distribution of the load
will be done fromhere.

C.Simulation Parameters:
Parameters Values
Number of Nodes 36
Protocol AODV
Simulation Time 100 Sec
Packet Size 512
MAC protocol 802.11

D.Simulation Screen Capture:








E.PerformanceResult:



The above graph demonstrate the no. of packets lost
over the network.Here XAxis represents the simulation
time and the y axis represents the number of packets
transmitted over the network.The result shows that the
presented work has improved the network throughput
using Min-Max algorithm.





The figure is showing the comparison graph to represent the
number of packets lost over the network.The algorithmic
approach is implemented and the route reconfiguration is done,
after that no more data lost is there.


International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9September 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3310



The figure is showing the comparison graph to represent the
number of packets lost over the network. After applying the
algorithmic approach is implemented and the route
reconfiguration is done, after that no more data lost is there.

V. CONCLUSION AND FUTURE SCOPE
Indeed no one can deny the pivotal role of MANETs in
society despite of prevailing vulnerability of such
network.The proposed work is about the prevention of DOS
attack.
The Analysis on these all parameters is performed to identify
the critical node as well as the safe node. On each node, the
Min Max is implemented to identify the safe path. The process
is repeated on each node till the destination is not achieved.
The systemis providing better throughput and less packet loss
over the network. The systemis implemented in a wireless
network with AODV protocol.
In this systema neighbor node analysis is performed under
different parameters to provide the network security in case of
DOS attack.There is very scope for the future
work.Performance is done using DOS attack,clustered
approach,AODV protocoal,active attacks.Some other
approaches can be used for better performance.Also
robusteness of the proposed scheme can also be increased.


ACKNOWLEDGMENT
We would like to express our gratitude to all who gave
their support to complete this paper. We express our gratitude
to JCD college for providing us labs to complete our work and
all the faculty members who supported us.

REFERENCES

[1] L. Buttyan and J . Hubaux, Stimulating cooperation in
selforganizing mobile ad hoc networks, ACM/Kluwer
MobileNetworks and Applications (MONET) 8 (2003).
[2] M. Baker, E. Fratkin, D. Guitierrez, T. Li, Y. Liu and
V.Vijayaraghavan, Participation incentives for adhoc networks,
http://www.stanford.edu/~yl31/adhoc (2001).
[3] Y.C. Hu, A. Perrig, and D.B. J ohnson, Rushing Attacks and
Defense in Wireless Ad Hoc Network Routing Protocols,
Proceedings of ACM WiSe 2003, San Diego, CA, Sep. 2003.
[4] E.M. Royer and C.E. Perkins, Multicast Operation of the Ad Hoc
On-Demand Distance Vector Routing Protocol, Proceed- ings of
MobiCom99, Seattle, WA, Aug. 1999, pp. 207-218.
[5] J . G. J etcheva and D.B. J ohnson, AdaptiveDemand-Driven
Multicast Routing in Multi-Hop Wireless Ad Hoc Net
[6] M.S. Corson, J.P. Maker and J.H. Cernicione, Internet- based
Mobile Ad hoc Networking, IEEE Internet Computing, pages
63- 70, J uly- August 1999.
[7] A Mishra and K.M Nadkarni, security in wireless Ad hoc
network, in Book. The Hand book of Ad Hoc Wireless
Networks(chapter 30), CRC press LLC, 2003.
[8] Y. Haung and W. Lee, A Cooperative Intrusion Detection
system for Ad hoc Networks, in Proceedings of the1st ACM
Workshop on security of Ad hoc and sensor Networks, Fairfax,
Virgining 2003, pages 135-147.
[9] I. Aad, J.-P. Hubaux, and E. W. Knightly, Denial of Service
Resiliencein Ad Hoc Networks, in Proceedings of the 10
th

Annual International Conference on MobileComputing and
Networking. Philadelphia, PA, USA: ACM Press, Sep. 2004,
[10] M. Al-Shurman, S.-M. Yoo, and S. Park, Black Hole Attack in
Mobile Ad Hoc Networks, in Proceedings of the 42
nd
Annual
ACM Southeast Regional Conference. Huntsville, AL, USA:
ACM Press, Apr. 2004, pp. 9697.
[11] S. Marti, T. J . Giuli, K. Lai, and M. Baker, Mitigating Routing
Misbehavior in Mobile Ad Hoc Networks, in Proceedings of the
6th Annual International Conference on Mobilecomputing and
Networking. Boston, MA,
[12] B. Awerbuch, D. Holmer, C. NitaRotaru and Herbert Rubens. An
On-Demand Secure Routing Protocol Resilient to Byzantine
Failures. Proceedings of the ACM Workshop on Wireless
Security 2002, Pages 21-30, September 2002
[13] Y. Hu, A. Perrig, and D. B. J ohnson. Rushing Attacks and
Defense in Wireless Ad Hoc Network Routing Protocols.
Proceedings of the ACM Workshop on Wireless Security 2003,
Pages 30-40, September 2003
[14] Axel Krings," Neighborhood Monitoring in Ad Hoc Networks",
CSIIRW 10, April 21-23, 2010, Oak Ridge, Tennessee, USA
ACM 978-1-4503-0017-9
[15] Ying Li," Component-Based Track Inspection Using Machine-
Vision Technology", ICMR11, April 17-20, 2011, Trento, Italy
ACM 978-1-4503-0336-1/11/04
[16] Bogdan Carbunar," J ANUS: Towards Robust and Malicious
Resilient Routing in Hybrid Wireless Networks", WiSe04,
October 1, 2004, Philadelphia, Pennsylvania, USA. ACM 1-
58113-925-X/04/0010
[17] J ohann Schlamp," How to Prevent AS Hijacking Attacks",
CoNEXT Student12, December 10, 2012, Nice, France. ACM
978-1-4503-1779-5/12/12