Friend based Ad-hoc routing using Challenges to Establish Security (FACES) is an algorithm to provide secure routing in ad-hoc mobile networks. The scheme proposed has been drawn from a network of friends in real life scenarios. The algorithm is divided into four stages, viz. Challenge your neighbour, Rate Friends, Share Friends and Route through Friends. One of the major advantages of this scheme is that the nodes do not need to promiscuously listen to the traffic passing through their neighbours. The information about the malicious nodes is gathered effectively by using Challenges, which reduces the overhead on networks. As a result of this scheme of operation, the network is able to effectively isolate the malicious nodes which are left with no role to play in the ad-hoc network. One major benefit of this scheme is that the nodes do not need to promiscuously listen to the traffic passing through their neighbours. The information about the malicious nodes is gathered effectively by using Challenges. This reduces the overhead on the network significantly. Through extensive simulation analysis it was inferred that this scheme provides an efficient approach towards security and easier detection of malicious nodes in the mobile ad-hoc network.

[1] D. P. Agrawal and Q.-A. Zeng, Introduction to Wireless and Mobile Systems. Pacific Grove, CA: Brooks/Cole, Thomson, 2002.
[2] I. Chlamtac, M. Conti, and J.-N. Liu, “Mobile ad-hoc networking: Imperatives and challenges,” in Ad-Hoc Networks. New York: Elsevier, 2003, vol. 1, pp. 13–64, No. 1.
[3] L.Wang and N.-T. Zhang, “Locally forwarding management in ad-hoc networks,” in Proc. IEEE Int. Conf. Communications, Circuits and Systems and West Sino Expositions, Jun./Jul. 2002, pp. 160–164.
[4] D. Johnson and D. Maltz, “Dynamic source routing in ad-hoc wireless networks,” in Book Chapter in Mobile Computing, T. Imielinskiand H.Korth, Eds. Dordrecht, The Netherlands: Kluwer, 1996, pp. 131–181.
[5] A. Wood and J. A. Stankovic, “A taxonomy for denial-of-service attacks in wireless sensor networks,” in Handbook of Sensor Networks:ll
[6] C. Perkins, E. Royer, and S. Das, Ad-Hoc on Demand Distance Vector (AODV) Routing Jul. 2003, Internet experimental RFC 3561.
[7] W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Inform. Theory, vol. IT-22, no. 6, pp. 644–654, 1976.
[8] M. S. Obaidat and N. Boudriga, Security of e-Systems and Computer Networks. Cambridge, U.K.: Cambridge Univ. Press, 2007.
[9] K. Sanzgiri, B. N. Levine, C. Shields, B. Dahill, and E. M. Belding-Royer, “A secure routing protocol for ad-hoc networks,” in Proc. 10thIEEE Int. Conf. Network Protocols (ICNP), Paris, France, Nov. 12–15,2002, pp. 78–89.
[10] Y. Hu, A. Perrig, and D. B. Johnson, “Ariadne: A secure on-demand routing protocol for ad-hoc networks, ”WirelessNetw., vol. 11, no. 1–2, pp. 21–38, Jan. 2005.
[11] S. Marti, T. J. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehavior in mobile ad hoc networks,” in Proc. MobiCom 2000, Boston, MA, Aug. 2000, pp. 255–265.
[12] M. G. Zapata and N. Asokan, “Securing ad-hoc routing protocols,” in WiSe’02: Proc. of 1st ACM Workshop on Wireless Security, Atlanta, GA, Sep. 28, 2002, pp. 1–10.
[13] P. Papadimitratos and Z. J. Haas, “Secure link state routing for mobile ad-hoc networks,” in IEEE International Symposium on Applications and the Internet-Workshop on Security and Assurance in Ad-Hoc Networks, Orlando, FL, Jan. 2003, p. 379.
[14] T.Haniotakis, S. Tragoudas, and C. Kalapodas, “Security enhancement through multiple path transmission in ad-hoc networks,” in 2004 IEEE Int. Conf. Communications, Jun. 2004, vol. 7, pp. 4187–4191.
[15] P. Narula, S. K. Dhurandher, S. Misra, and I. Woungang, “Security in mobile ad-hoc networks using soft encryption and trust based multipath routing,” Sci. Direct Comput. Commun., vol. 31, pp. 760–769, 2008.
[16] S. K. Dhurandher and V. Mehra, “Multi-path and message trust-based secure routing in ad-hoc networks,” in Proc. Int. Conf. Advances in Computing, Control and Telecommunication Technologies (ACT 2009), Trivandrum, India, Dec. 28–29, 2009, pp. 189–194.
[17] A. Abdul-Rahman and S. Hailes, “A distributed trust model,” in Proc. 1997Workshop on New Security Paradigms, Langdale, Cumbria, U.K., Sept. 23–26, 1997, pp. 48–60, NSPW’97. ACM Press, New York.
[18] A. A. Pirzada, A. Datta, and C. McDonald, “Propagating trust in ad-hoc networks for reliable routing,” in Proc. 2004 Int. Workshop on Wireless Ad-Hoc Networks, May–Jun. 2004, pp. 58–62.
[19] Z. Liu, A. W. Joy, and R. A. Thompson, “A dynamic trust model for mobile ad-hoc networks,” in Proc. 10th IEEE Int. Workshop on Future Trends of Distributed Computing Systems, May 2004, pp. 80–85.
[20] W. Stalling, “Cryptography and network security, principles and practice,” in Book Chapter in Block Ciphers and Data Encryption Standard, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 2006, pp. 62–94.
[21] M. S. Obaidat and N. Boudriga, Security of e-Systems and Computer Networks. Cambridge, U.K.: Cambridge Univ. Press, 2007.
[22] P. J. Rousseeuw and C. Croux, “Alternatives to the median absolute deviation,” J. Amer. Statist. Assoc., vol. 88, no. 424, pp. 1273–1283, Dec. 1993.

@article{manivannan02041002,
title = "Security Establishment in MANET Systems using FACES ",
journal = "International Journal of Science and Engineering Applications (IJSEA)",
volume = "2",
number = "3",
pages = "60 - 66",
year = "2013",
author = "P.Manivannan, J.Shakila ",
}