Investigating and comparing safe routers in adhoc networks
Paper Details
Investigating and comparing safe routers in adhoc networks
Abstract
Adhoc networks are networks are nodes non-structurally related nodes with no consistent resource for organizing them. One of the most difficult problems in Ad-Hoc networks is rout finding. Since the nodes are displaced in Ad-Hoc networks, they get distant from adjacent boards and hence, the network topology changes all the time. Safety in Ad-hoc networks especially for military ones is very vital. As nodes don’t have constant position, any invading node can penetrate the network easily and gets the safety of information or rout finding of all or a part of the network disordered; especially giving the fact that most of the rout finding methods in the network tend to believe in all nodes. This survey investigates the pros and cons of three protocols of safe rout finding and we survey some of the main algorithms in this significant like SEAD and ARANA algorithms.
Chan H, Perrig A, Song D. 2003. Random Key Predistribution Schemes for Sensor Networks. In Proceedings of the IEEE Symposium on Security and Privacy.
Charles E, Perkins Elizabeth M, Belding-Royer, Samir R. 2003. Ad Hoc On Demand Distance Vector (AODV) Routing. Internet-Draft, draft-ietf-manetaodv-10 txt.
David B, Johnson David A, Maltz Yih-Chun Hu, Jorjeta G, Jetcheva. 2002. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR). Internet-Draft, draft-ietf-manet-dsr- 07.
Du W, Deng J, Han S, Varshney PK. 2003. Establishing Pairwise Keys in Distributed Sensor Networks. In Proceedings of the ACM Conference on Computer and Communications Security.
Hsiao HC, Studer A, Chen C, Perrig A, Bai F, Bellur B, Iyer A. 2011. Flooding-Resilient Broadcast Authentication for VANETs. In Proc of Mobi Com.
Jia L, Basescu C, Kim THJ, Perrig A, Hu YC, Zhang F. 2014. Mechanized network origin and path authenticity proofs. Technical Report CMU-CyLab-14-007. Carnegie Mellon University.
Kang MS, Lee SB, Gligor VD. 2013. The CrossfireAttack. In Proc of IEEE Security and Privacy.
LiJ, Sung M, Xu J, Li L. 2004. Large-Scale IP TracebackinHigh-Speed Internet: Practical Techniques and Theoretical Foundation. In Proc. of IEEE Security and Privacy.
Liu B, Chiang JT, Haas JJ, Hu YC. 2010. CowardAttacks in Vehicular Networks. Mobile Computing and Communications Review.
Liu X, Li A, Yang X, Wetherall D. 2008. Passport: Secureand Adoptable Source Authentication. In Proc.
Madhyastha HV, Katz-Bassett E, Anderson T, Krishnamurthy A, Venkataramani A. 2009. iPlane Nano: Path Prediction for Peer-to-peer Applications. In Proc.
Mitchell J. 2002. Security for Mobility. IEE Press January.
Mpitziopoulos A, Gavalas D, Konstantopoulos C, Pantziou G. 2009. JAID: analgorithm for data fusion and jamming avoidance on distributed sensornetworks, Pervasive Mobile Comput 5 (2), 135–147.
Oppermann I, Stoica L, Rabbachin A, Shelby Z, Haapola J. 2004. UWB wirelesssensor networks: UWEN-a practical example, IEEE Commun. Mag 42 (12).
Stallings W. 2002. Cryptography & Network Secu-rity, Prentice Hall.
Stutzman WL, Thiele GA. 1997. Antenna Theory and Design, second ed., J. Wiley, weN York.
Wood AD, Stankovic JA, Son SH. 2003. a jammed-area mapping service for sensor networks, in: Proceedings of the 24th IEEE International Real-Time Systems Symposium, RTSS 03, IEEE Computer Society. Washington. DC, USA p. 286.
Wood AD, Stankovic JA, Zhou G. 2007. DEEJAM: defeating energy-efficientjamming in IEEE 802.15.4-based wireless networks, in: 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad-Hoc Communications and Networks 60–69.
Xu W, Trappe W, Zhang Y, Wood T. 2005. The feasibility of launching and detecting jamming attacks in wireless networks, in: Proceedings of the 6th ACM International Symposium on Mobile Ad-Hoc Networ-king and Computing – Mobi Hoc 05.
Yih-Chun Hu, Adrian Perrig R, David B, Johnson A. 2002. A Secure On-Demand Routing Protocol for Ad Hoc Networks. In Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (Mobi Com 2002), pages 12–23.
Yih-Chun Hu, David B, Adrian Perrig J. 2002. Secure Effcient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA ’02) 3.13.
Yih-Chun Hu. 2003. Enabling Secure High-Performance Wireless Ad Hoc Networking. PHD thesis, School of Computer Science Computer Science Department Carnegie Mellon University (CMU-CS-03-144).
Somayyeh Haghtalabi, Mehdi Golshan, Mostafa Jahangir, Reza Saboor (2015), Investigating and comparing safe routers in adhoc networks; JBES, V6, N6, June, P589-595
https://innspub.net/investigating-and-comparing-safe-routers-in-adhoc-networks/
Copyright © 2015
By Authors and International
Network for Natural Sciences
(INNSPUB) https://innspub.net
This article is published under the terms of the
Creative Commons Attribution License 4.0