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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Security Enhancement in MANETS using the Concept of Leader Nodes

by Jatinder Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 105 - Number 3
Year of Publication: 2014
Authors: Jatinder Singh
10.5120/18360-9497

Jatinder Singh . Security Enhancement in MANETS using the Concept of Leader Nodes. International Journal of Computer Applications. 105, 3 ( November 2014), 30-34. DOI=10.5120/18360-9497

@article{ 10.5120/18360-9497,
author = { Jatinder Singh },
title = { Security Enhancement in MANETS using the Concept of Leader Nodes },
journal = { International Journal of Computer Applications },
issue_date = { November 2014 },
volume = { 105 },
number = { 3 },
month = { November },
year = { 2014 },
issn = { 0975-8887 },
pages = { 30-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume105/number3/18360-9497/ },
doi = { 10.5120/18360-9497 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:36:46.173436+05:30
%A Jatinder Singh
%T Security Enhancement in MANETS using the Concept of Leader Nodes
%J International Journal of Computer Applications
%@ 0975-8887
%V 105
%N 3
%P 30-34
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper is aimed to detect the malicious behavior of the nodes by first selecting some set of leader nodes. The leader nodes are those set of nodes in a network which monitor the whole network of nodes. The set of leader nodes is referred as the dominating set. A set is dominating if all the nodes of the network are either in the set or neighbors of nodes in the set. The efficiency of a commanding-set-based broadcasting or routing is mainly dependent on the overhead in constructing the dominating set and the size of the dominating set. The leader nodes are working in the promiscuous mode and they overhear traffic in its neighborhood. In promiscuous mode the system (NS-2) by-pass the MAC(Media Access Control) filtering procedure and the nodes working in promiscuous mode, receives the packets that are sent or received by any other node in its transmission range even if the packets were not intended for that node, this phenomenon is commonly known as packet overhearing. The leader nodes also monitor the topology of the network and reports if there are any changes in the network on the basis of a certain criteria, moreover they also detect if any packet is modified, and the snooping attack and calculate the forward packet ratio.

References
  1. S. Marti, T. J. Giuli, K. Lai, and M. Baker, "Mitigating routing misbehavior in mobile ad hoc networks," in the Proceedings of Sixth Ann. Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 255-265, 2000.
  2. D. B. Johnson and D. A. Maltz, "Dynamic Source Routing in Ad-Hoc Wireless Networks," Mobile Computing, T. Imielinski and H. Korth, Eds. , Kluwer, pp. 153-181, 1996.
  3. K. Park and H. Lee, On the effectiveness of route based packet filtering for distributed D DoS prevention in power law internets, In proceedings of ACM SIGCOMM, pages 15-26, 2001.
  4. S. K. Dhurandher and V. Mehra. Multi-path and message trust-based secure routing in ad hoc networks. Proc. Int. Conf. Advances in Computing, Control and Telecommunication Technologies (ACT 2009), Trivandrum, India (Dec. 28-29, 2009), 189-194.
  5. T. Ghosh, N. Pissinou and K. Makki. Towards Designing a Trusted Routing Solution in Mobile Ad Hoc Networks. Mobile Networks and Applications, Springer Science, 10, 2005, 985-995.
  6. A. A. Pirzada and C. McDonald. Deploying trust gateways to reinforce dynamic source routing. Proceedings of the 3rd International IEEE Conference on Industrial Informatics, IEEE Press, 2005, 779-784.
  7. A. A. Pirzada, A. Datta, C. McDonald. TRUST-BASED ROUTING FOR AD-HOC WIRELESS NETWORKS. IEEE, 2004, 326-330.
  8. A. A. Pirzada and C. McDonald. Dependable Dynamic Source Routing without a Trusted Third Party. Journal of Research and Practice in Information Technology, Vol. 39, Issue 1 (February 2007).
  9. A. A. Pirzada and C. McDonald. Trust Establishment In Pure Ad-hoc Networks. Wireless Personal Communications, Springer, 37, 2006, 139-163.
  10. Asad Amir Pirzada, AmitavaDatta, Chris McDonald. Incorporating trust and reputation in the DSR protocol for dependable routing. Computer Communications, Vol. 29, Issue 15 (5 September 2006), 2806-282.
  11. E. Ayday, F. Fekri. A protocol for data availability in Mobile Ad-Hoc Networks in the presence of insider attacks. Ad Hoc Networks, Vol. 8, Issue 2 (March 2010), 181-192.
  12. D. Fudenberg, J. Tirole, Game Theory, The MIT Press, Cambridge,MA,1991.
  13. Yamin Li, Shietung Peng, Wanming Chu. An Efficient Algorithm forFinding an Almost Connected Dominating Set of Small Size on WirelessAd Hoc Networks. IEEE, 2006.
Index Terms

Computer Science
Information Sciences

Keywords

DSR Malicious Leader security Mobile Ad Hoc Networks Routing Protocols

Powered by PhDFocusTM