CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
Implementation of Feature Selection Using Correlation Matrix in Python

Ahmad Farhan AlShammari
Random Articles
Reseach Article

Design and Development of a Secured Routing Scheme for Mobile Adhoc Network

by Rakesh Kumar, Dr. Piush Verma, Dr. Yaduvir Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 13 - Number 2
Year of Publication: 2011
Authors: Rakesh Kumar, Dr. Piush Verma, Dr. Yaduvir Singh
10.5120/1751-2385

Rakesh Kumar, Dr. Piush Verma, Dr. Yaduvir Singh . Design and Development of a Secured Routing Scheme for Mobile Adhoc Network. International Journal of Computer Applications. 13, 2 ( January 2011), 31-36. DOI=10.5120/1751-2385

@article{ 10.5120/1751-2385,
author = { Rakesh Kumar, Dr. Piush Verma, Dr. Yaduvir Singh },
title = { Design and Development of a Secured Routing Scheme for Mobile Adhoc Network },
journal = { International Journal of Computer Applications },
issue_date = { January 2011 },
volume = { 13 },
number = { 2 },
month = { January },
year = { 2011 },
issn = { 0975-8887 },
pages = { 31-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume13/number2/1751-2385/ },
doi = { 10.5120/1751-2385 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:01:43.976150+05:30
%A Rakesh Kumar
%A Dr. Piush Verma
%A Dr. Yaduvir Singh
%T Design and Development of a Secured Routing Scheme for Mobile Adhoc Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 13
%N 2
%P 31-36
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The development of mobile ad hoc network advocates self-organized wireless interconnection of communication devices that would either extend or operate in concern with the wired networking infrastructure or, possibly, evolve to autonomous networks. Unlike traditional wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. One main challenge in design of these networks is their vulnerability to security attacks. Despite the existence of well-known security mechanisms, additional vulnerabilities and features pertinent to this new networking paradigm might render such traditional solutions inapplicable. In particular, the absence of a central authorization facility in an open and distributed communication environment is a major challenge, especially due to the need for cooperative network operation. In MANET, any node may compromise the routing protocol functionality by disrupting the route discovery process. In this paper, we understand the various security related issues related to mobile ad hoc network. The security to the network is provided by using cryptographic schemes to build a highly secure framework

References
  1. M. J. Neely.,2003 . Dynamic Power Allocation and Routing for Satellite and Wireless Networks with Time Varying Channels. PhD thesis, Massachusetts Institute of Technology, LIDS.
  2. M. J. Neely and E. Modiano., Oct. 2004 .Capacity and delay tradeoffs for ad-hoc mobile networks. (Invited Paper) IEEE BroadNets, San Jose, CA,.
  3. M. J. Neely and E. Modiano, March 2003 .Improving delay in ad-hoc mobile networks via redundant packet transfers. Proc. of the Conference on Information Sciences and Systems, Johns Hopkins University:.
  4. R.L. Cruz and A. V. Santhanam, Oct.2002. Hierarchical link scheduling and power control in multihop wireless networks. Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing,.
  5. M. J. Neely, E. Modiano, and C. E Rohrs, January 2005 Dynamic power allocation and routing for time varying wireless networks. IEEE Journal on Selected. Areas in Communications.
  6. M. Grossglauser and D. Tse, 2001. Mobility increases the capacity of ad-hoc wireless networks. Proceedings of IEEE INFOCOM.
  7. P. Gupta and P.R. Kumar,1998 . Critical power for asymptotic connectivity in wireless networks. IEEE Conference on Decision and Control.
  8. P. Gupta and P.R. Kumar, March2000. The capacity of wireless networks. IEEE Transactions on Information Theory, vol. 46, no. 2:pp. 388–404.
  9. N. Bansal and Z. Liu.,April 2003 .Capacity, delay and mobility in wireless ad-hoc networks. IEEE Proceedings of INFOCOM.
  10. M. Grossglauser and M. Vetterli.,April 2003. Locating nodes with ease: Last encounter routing in ad hoc networks through mobility diffusion. IEEE Proceedings of INFOCOM.
  11. Bruce Schneier,2000. Secrets and Lies: Digital Security in a Networked World. John Wiley $ Sons, Inc, 1st edition.
  12. Bruce Schneier, 2000. Semantic network attack’s. Communications of the ACM, 43(12):168.
  13. Bradley R. Smith, Shree Murthy, and J.J. Garcia-Luna-Aceves, February 1997. Securing distance-vector routing protocols. Proceedings of Internet Society Symposium on Network and Distributed System Security, San Diego, CA, pages 85–92,
  14. Po-Wah Yau and Chris J. Mitchell ,October 2003. Reputation methods for routing security for mobile ad hoc networks. Joint IST Workshop on Mobile Future and Symposium on Trends in Communications (SympoTIC ’03), Bratislava, Slovakia,.
  15. Seung Yi, Prasad Naldurg and Robin Kravets. , 2001. Security-aware ad-hoc routing for wireless networks .MobiHOC Poster Session.
  16. Bin Yu and Munindar P. Singh., 2003 Detecting deception in reputation management. In Proceedings of 2nd International Joint Conference on Autonomous. Agents and Multi-Agent Systems, pages 73–80.
  17. Yongguang Zhang and Wenke Lee, 2000. Intrusion detection in wireless ad-hoc networks. In Proceedings of MOBICOM 2000, pages 275–283.
  18. Yongguang Zhang and Wei Li, June 2002. An integrated environment for testing mobile ad-hoc networks.In Proceedings of IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC), Lausanne, CH.
  19. S. Zhong, Y. Yang, and J. Chen. Sprite,2003. A simple, cheat-proof, credit-based system for mobile ad hoc networks. Proceedings of Infocom.
  20. Lidong Zhou and Sigmund Haas, 1999. Securing ad hoc networks. In IEEE Network magazine, special issue on networking security, Vol. 13, No. 6, November/December, pages 24–30.
  21. L. Eschenauer and V.D. Gligor, November 2002 .A Key-Management Scheme for Distributed Sensor Networks. Proc. of the ACM Conference on Computer and Communications Security, Washington D.C, pp. 41-47.
  22. M. Franklin and R. Wright,2000. Secure Communication in Minimal Connectivity Models, J. Crypto 13(1): 9–30
  23. V.D. Gligor and S. Shattuck, September 1980. On Deadlock Detection in Distributed Systems, IEEE Transactions on Software Engineering, SE-6, Vol. 5.
  24. V. D. Gligor, May 1984.A note on Denial of Service in Operating Systems.IEEE Transactions on Software Engineering, SE-10, Vol. 3.
  25. V.D. Gligor and S. I. Gavrila, 1999. Application-Oriented Security Policies and Their Composition in Security Protocols, B. Christianson, B. Crispo, M.Roe (eds.), Lecture Notes in Computer Science 1550, Springer Verlag, pp. 67-75.
  26. V. D. Gligor, H. Khurana, R. K. Koleva, V. G. Bharadwaj, and J. S. Baras,2002. On the negotiation of access control policies. In B. Christianson et al., editors.Security Protocols in Lecture Notes in Computer Science, vol. 2467, pp. 188–201, Springer Verlag,. Also see transcript of discussion, pp. 202-212.
  27. Hinton, H.M., and E.S. Lee.,1994 .The Compatibility of Policies. Proc. ACM Conference on Computer and Communications Security, pp. 258-269.
  28. D. Johnson, and E.J. Thyer, June 1988.Security and the Composition of Machines.Proc. of the Computer security Foundations Workshop, Franconia, N.H., pp. 72-89.
  29. B.W. Lampson, M. Abadi, M. Burrows, and EdwardWobber, 1992. Authentication in Distributed Systems: Theory and Practice. ACM Transactions on Computer Systems, 10(4): 265–310,
  30. N. Lynch,1997. Distributed Algorithms, Morgan Kaufmann Publishers.
  31. P. MacKenzie and M. Reiter, May 2001. Network Cryptographic Devices Resilient to Capture.Proc. IEEE Security and Privacy Symposium, Berkeley, California, May 2001 (and updated version in DIMACS TR 2001-19).
  32. U. Maurer, 1996 .Modeling a Public-Key Infrastructure.In Proc. ESORICS ’96 (4th European Symposium on Research in Computer Security), Rome, LNCS 1146, Springer-Verlag, Berlin, 325–350.
  33. D. McCullough, 1987 .Specifications for Multilevel Security and a Hook-Up Property. Proc. IEEE symposium on Security and Privacy, pp. 161–166.
  34. D. McCullough,1988. Noninterference and Composability of Security Propertie. Proc. IEEE Symposium on Security and Privacy, pp. 177–186.
  35. J. McLean,1996. A General Theory of Composition for a Class of Possibilistic Properties. IEEE Transactions on Software Engineering 22(1): 53–66.
  36. H. Mehta, December 2002.Dynamic Adaptive Routing in Mobile AdHoc Networks. M.S. Thesis, University of Maryland, College Park.
  37. J. Millen, June 1990.Hookup Security for Synchronous Machines, Proc. of Computer Security Foundations Workshop, Franconia, New Hampshire, pp. 84-90.
  38. J. Millen,1992. A Resource Allocation Model for Denial of Service. Proc. IEEE Security and Privacy Symposium, pp. 137–147.
  39. J. H. Saltzer, D.P. Reed, and D.D. Clark, Nov. 1984.End-To-End Arguments in System Design.In ACM Transactions on Computer Systems, vol. 2, no. 4, pp. 277 - 288.
  40. R. Schoonderwoerd, O.E. Holland, J. Bruten, L. Rothkrantz, May 1996.Ant-based load balancing in telecommunications networks , HP Labs Technical Report, HPL-96-76
  41. K. Seamons, M. Winslett and T. Yu, April 2001.Limiting the Disclosure of Access Control Policies during Automated Trust Negotiation. In Proceedings of the Network and Distributed System Security Symposium, San Diego, CA.
  42. J. Spencer, 2000 .The Strange Logic of Random Graphs, Algorithms and Combinatorics .22 Springer-Verlag, ISBN 3-540-41654-4.
  43. E. Wobber, M. Abadi, M. Burrows and B. Lampson, Feb. 1994. Authentication in the Taos operating system, ACM Transactions on Computer Systems, 12(1):3–32,
  44. W. Winsborough, K. Seamons, and V. Jones, January 2000. Automated Trust Negotiation. DARPA Information Survivability Conference and Exposition (DISCEX ’2000).
  45. Zakinthinos, A., and E. S. Lee, May 1997.A General Theory of Security Properties. Proc. of 1997 IEEE Symposium on Security and Privacy, Oakland, California, pp. 94-100.
  46. C.-F. Yu and V.D. Gligor, June 1990.A specification and Verification Method for Preventing Denial of Service, IEEE Transactions on Software Engineering, Vol. SE-16, No. 6, pp. 581 - 592.
Index Terms

Computer Science
Information Sciences

Keywords

Cryptography Genetic Algorithm Mobile Ad hoc network Security

Powered by PhDFocusTM