CFP last date
01 November 2024
Reseach Article

Performance Analysis of Neighbor Discovery and Location Verification (NDLV) Scheme in Mobile Ad Hoc Networks against Adversarial Nodes

by E. Gnanamanoharan, R. Bensraj
Communications on Applied Electronics
Foundation of Computer Science (FCS), NY, USA
Volume 4 - Number 4
Year of Publication: 2016
Authors: E. Gnanamanoharan, R. Bensraj
10.5120/cae2016652069

E. Gnanamanoharan, R. Bensraj . Performance Analysis of Neighbor Discovery and Location Verification (NDLV) Scheme in Mobile Ad Hoc Networks against Adversarial Nodes. Communications on Applied Electronics. 4, 4 ( February 2016), 19-25. DOI=10.5120/cae2016652069

@article{ 10.5120/cae2016652069,
author = { E. Gnanamanoharan, R. Bensraj },
title = { Performance Analysis of Neighbor Discovery and Location Verification (NDLV) Scheme in Mobile Ad Hoc Networks against Adversarial Nodes },
journal = { Communications on Applied Electronics },
issue_date = { February 2016 },
volume = { 4 },
number = { 4 },
month = { February },
year = { 2016 },
issn = { 2394-4714 },
pages = { 19-25 },
numpages = {9},
url = { https://www.caeaccess.org/archives/volume4/number4/535-2016652069/ },
doi = { 10.5120/cae2016652069 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-09-04T19:53:30.742794+05:30
%A E. Gnanamanoharan
%A R. Bensraj
%T Performance Analysis of Neighbor Discovery and Location Verification (NDLV) Scheme in Mobile Ad Hoc Networks against Adversarial Nodes
%J Communications on Applied Electronics
%@ 2394-4714
%V 4
%N 4
%P 19-25
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A mobile ad hoc network (MANET) is a continuously self-configuring, infrastructure-less network of mobile devices connected without wires. Each node supports the routing process of the communication to improve the overall throughput in entire network. Due random movement neighbor nodes comes into the coverage area of a base station and leaves at every fraction of time, which must be trusted for service handling. Adversary nodes replies with the route discovery phase using false location information with the intension to get participate in the routing process. After gets selected it simply discard the packets received, or manipulate the packets, or else it will never receive the packets because of the false location. This makes considerable amount of performance degradation. Routing algorithms for MANETs usually assume that nodes are cooperative and non-malicious. Hence a adversary or malicious node can easily become an important routing agent and disrupt network operations by disobeying the protocol specifications. The “Neighbor Discovery and Location Verification (NDLV) is a scheme utilized to protect the network from adversary nodes by verifying the location of neighbor nodes to improve performance and efficiency in MANET's. The NDLV Scheme identifies a trusted neighbor nodes by extracting timing, finding location and computing the distance between each pair of nodes. The scheme adapts quickly to location changes when node movement is frequent, yet requires little or no overhead during the periods in which hosts move less frequently. The performance analysis and simulation are carried out to compare with un trusted system based on existing AODV based on the quantitative metrics packet delivery ratio, routing overhead and end-to-end delay. The simulated result helps to understand the performance of NDLV in two different scenarios.

References
  1. P. Papadimitratos, M. Poturalski, P. Schaller, P. Lafourcade, D. Basin, S.Capkun, J.-P. Hubaux, “ Secure Neighborhood Discovery: A Fundamental Element for Mobile Ad Hoc Networks,” IEEE Comm. Mag., vol. 46, no. 2,Feb. 2008.
  2. M. Fiore, C. Casetti, C.-F. Chiasserini, P. Papadimitratos, “Secure Neighbor Position Discovery in Vehicular Networks,” IEEE/IFIP Med-Hoc-Net, Favignana, Italy, June 2011.
  3. T. Ghosh, N. Pissinou, and K. Makki, "Collaborative trust-based secure routing against colluding malicious nodes in multi-hop ad hoc networks," Annual Conference on Local Computer Networks (LCN), pp.224-231, Tampa, USA, 2004.
  4. T. Ghosh, N. Pissinou, and K. Makki, "Towards designing a trusted routing solution in Mobile Ad Hoc networks," ACM Journal, Mobile Networks and Applications (MONET), Special issue on NonCooperativeWirelessNetworking and Computing,2005.
  5. E. Ekici, S. Vural, J. McNair, D. Al-Abri, “Secure Probabilistic Location Verification in Randomly Deployed Wireless Sensor Networks,” Elsevier Ad Hoc Networks, vol. 6, no. 2, pp. 195-209, 2008.
  6. J. Chiang, J. Haas, Y. Hu, “Secure and Precise Location Verification Using Distance Bounding and Simultaneous Multilateration,” ACM WiSec, Zurich, Switzerland, Mar. 2009.
  7. S. Capkun, K. Rasmussen, M. Cagalj, M. Srivastava, “Secure Location Verification with Hidden and Mobile Base Stations,” IEEE Trans. on Mobile Computing, vol. 7, no. 4, pp. 470–483, 2008.
  8. S. Capkun, J.-P. Hubaux, “Secure Positioning in Wireless Networks,” IEEE JSAC, vol. 24, no. 2, pp. 221–232, 2006.
  9. T. Leinmuller, C. Maih¨ofer, E. Schoch, F. Kargl, “Improved Security in Geographic Ad Hoc Routing through Autonomous Position Verification,” ACM VANET, Los Angeles, CA, Sept. 2006.
  10. A. A. Pirzada, and C. McDonald, "Establishing trust in pure Ad-hoc networks," The 27th Australasian Computer Science Conference, Dunedin, New Zealand, 2004.
  11. N. Pissinou, T. Ghosh, and K. Makki, "Collaborative trust-based secure routing in multihop Ad Hoc networks," The Third IFIP-TC6 Networking Conference (Networking '04), Athens, Greece, 2004.
  12. S. Yi, P. Naldurg, and R. Kravets, Security- Aware Ad hoc Routing for Wireless Networks, UIUCDCS-R-2001-2241, Aug. 2001.
  13. M. Poturalksi, P. Papadimitratos, J.-P. Hubaux, “Towards Provable Secure Neighbor Discovery in Wireless Networks,” Workshop on Formal Methods in Security Engineering, Alexandria, VA, Oct. 2008.
  14. E. Ekici, S. Vural, J. McNair, D. Al-Abri, “Secure Probabilistic Location Verification in Randomly Deployed Wireless Sensor Networks,” Elsevier Ad Hoc Networks, vol. 6, no. 2, pp. 195-209, 2008.
  15. J. Chiang, J. Haas, Y. Hu, “Secure and Precise Location Verification Using Distance Bounding and Simultaneous Multilateration,” ACM WiSec, Zurich, Switzerland, Mar. 2009.
  16. Y.-C. Hu, A. Perrig, D. B. Johnson, “Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks,” IEEE Infocom, S. Francisco,CA, Apr. 2003.
  17. R. Maheshwari, J. Gao, S. Das, “Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information,” IEEE Infocom,Anchorage, AK, Apr. 2007.
  18. R. Shokri, M. Poturalski, G. Ravot, P. Papadimitratos, J.-P. Hubaux,“A Practical Secure Neighbor Verification Protocol for Wireless Sensor Networks,” ACM WiSec, Zurich, Switzerland, Mar. 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Critical node adversary node neighbor attack reliability location verification MANET's performance Neighbor discovery.