Security in MANET through Alternate Path Routing
Keywords:
MANET, Preventive, Predictive, SecureAbstract
Mobile ad hoc networks (MANETs) generally consist of a group of
wireless mobile nodes that are self-configuring, infrastructure with no
network. The meaning of accountability is quite understandable: there
is no kind of a clear assured boundary in the mobile ad hoc network,
which can be combined or relatable to the clear line for the classic
wired network. Today the invader attack in these ad hoc networks is
increasing rapidly. To avoid the occurrence of these attacks there are
various algorithmic implementations are done to transfer the data
over the network to make avoid the data breach. There are various
issues in the designing of MANETs. For secured communication we
have to provide maximum ability as well as security to theses ad hoc
networks. To provide these measures, the shortest path algorithm is
used, but there occur various other issues and the reason for that is less
security and efficiency because of this algorithm, like invader attack and
consolidated load. We are working on a search to find the Invader Safe
path which is closer to the shortest not shortest. These networks are
highly dynamic networks, mobile, and large scale as well as provides
static coercion that is power sources.
References
Wireless Sensor Network Routing Protocols on an
Experimental Testbed. in Proc. Of the IEEE International
Conference on Sensor Networks, 2006; 35-42
2. Karlof C, Wagner D. Secure Routing in Wireless Sensor
Networks: Attacks and Countermeasures. University of
California at Berkeley, Tech. Rep. F33615-01-C-1895.
3. Perrig A, Szewczyk R, Wen V et al. SPINS: Security
Protocols for sensor networks”, International
Conference on Mobile Computing and Networking
(Mobicom 2001), 2001: 189-199.
4. Wood AD, Stankovic JA. Denial of service in sensor
networks”, IEEE Computer 2002; 35(10): 54-62.
5. Dijkstra E. A note on two problems in connection with
graphs. Numerical Mathematics 1959; 1:269-271.
6. Korkmaz T, Krunz M, Tragoudas S. An efficient algorithm
for finding a path subject to two additive constraints,
in Proceedings of the ACM SIGMETRICS ’00 Conference
2000; 1: 318-327.
7. Rakotoarivelo T, Senac P, Seneviratne A et al.Enhancing
QoS through Alternate Path: An End-to-End Framework.
in Proc. of the IEEE INFOCOM, Conference on Computer
Communications, 2000; 14-22.
8. Sami S, Al-Wakeel, Saad A et al. PRSA: A Path
Redundancy Based Security Algorithm for Wireless
Sensor Networks. in Proc. of the IEEE Communications
Society 2007; 4159-4163.
9. Akyildiz IF, Weilian Su, Sankarasubramaniam Y et al.
A Survey on Sensor Networks”, in Proc. of the IEEE
Communications Magazine 2002; 40(8): 102-114.
10. Jiang Q, Manivannan D. Routing Protocols for Sensor
Networks”, in Proc. of the IEEE Conference 2004; 93-98.
11. Lewis FL. Wireless Sensor Networks Smart Environments:
Technologies, Protocols, and Applications”, New York:
ed. D.J. Cook and S.K. Das, John Wiley, 2004; 1-18.
12. Deng J, Han R, Mishra S. INSENS: Intrusion-Tolerant
Routing in WSN”, in Proc. Of the Second International
Workshop on Information Processing in Sensor
Networks (IPSN 03), April 2003; 349-364
