An Efficient Identification of Malicious Node in Top-k Query Processing

IJCSEC Front Page

Abstract:
In mobile ad hoc networks (MANETs), data items can be retrieved effectively by using top-k query processing method. The environment which contains malicious nodes cannot provide an accurate result. This paper assumes that the malicious node tries to attempt an attack called data replacement attack in which the necessary data sets are replaced by unnecessary data sets. The proposed work includes node grouping method in top-k query processing for detecting the malicious node. The accuracy of the query result can be maintained by forwarding the data sets along multiple routes and based on the information attached to the reply message the query-issuing node can detect the attack. By exchanging the message, single malicious node can be identified. To identify multiple malicious nodes, it’s necessary to share the information of identified malicious node to other nodes. In this method, nodes are grouped based on the similarity of the identified malicious node. Simulation experiments are conducted by using a network simulator, NS2, to verify that this method provides high accuracy and identifies multiple malicious nodes.

Keywords: Mobile ad hoc networks, query processing, routing, traffic, data replacement attack, node grouping.

References:

  1. R. Hagihara, M. Shinohara, T. Hara, and S. Nishio, A message processing method for top-k query for traffic reduction in ad hoc networks, in Proc. MDM, May 2009, pp. 11-20.
  2. D. Amagata, Y. Sasaki, T.Hara, and S.Nishio, A robust routing method for top-k queries processing in mobile ad hoc networks, in Proc. MDM, Jun. 2013, pp. 251-256.
  3. K. Liu, J. Deng, P. K. Varshney, and K. Balakrishnan, An acknowledgement-based approach for the detection of routing misbehavior in MANETs, IEEE Trans. Mobile Comput., vol. 6, no. 5, pp. 536-550, May 2007.
  4. Y. Sasaki, T. Hara, and S. Nishio, Two-phase top-k query processing in mobile ad hoc networks, in Proc. NBiS, Sep. 2011, pp. 42-49.
  5. C.-M. Yu, G.-K. Ni, I.-Y. Chen, E. Gelenbe, and S.-Y. Kuo,Top-k query result completeness verification in tiered sensor networks, IEEE Trans. Inf. Forensics Security, vol. 9, no. 1, pp. 109-124, Jan. 2014.
  6. R. Zhang, J. Shi, Y. Liu, and Y. Zhang, Verifiable fine-grained top-k queries in tiered sensor networks, in Proc. INFOCOM, Mar.2010, pp. 1-9.
  7. B. Chen, W. Liang, R. Zhou, and J. X.Yu, Energy-efficient top-k query processing in wireless sensor networks, in Proc. CIKM, 2010, pp. 329-338.
  8. S. J. Lee and M. Gerla, Spilt multipath routing with maximally disjoint paths in ad hoc networks, in Proc. ICC, vol. 10. Jun. 2001, pp. 3201-3205.
  9. T. Tsuda, Y.Komai, Y. Sasaki, T. Hara, and S. Nishio, Top-k query processing and malicious node identification against data replacement attack in MANETS, in Proc. MDM, Jul. 2014, pp. 279-288.
  10. Y. Sasaki, R. Hagihara, T. Hara, M. Shinohara, and S.Nishio, A top-k query method by estimating score distribution in mobile ad hoc networks, in Proc. DMWPC, Apr. 2010, pp. 944-949.
  11. B. Malhotra, M. A. Nascimento, and I. Nikolaidis, Exact top-k queries in wireless sensor networks, IEEE Trans. Knowl. Data Eng., vol. 23, no. 10,pp. 1513_1525, Oct. 2011.
  12. M. Wu, J. Xu, X. Tang, and W. C. Lee, Top-k monitoring in wire-less sensor networks, IEEE Trans. Knowl. Data Eng., vol. 19, no. 7,pp. 962_976, Jul. 2007.
  13. Y.-C. Hu, D. B. Johnson, and A. Perrig, SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks, Ad Hoc Netw., vol. 1,no. 1, pp. 175_192, Jul. 2003.
  14. X. Liu, J. Xu, and W. C. Lee, A cross pruning framework for top-kdata collection in wireless sensor networks, in Proc. MDM, May 2010,pp. 157_166.
  15. S. Kurosawa, H. Nakayama, N. Kato, A. Jamalipour, and Y. Nemoto,Detecting blackhole attack on AODV-based mobile ad hoc networks bydynamic learning method, Int. J. Netw. Secur., vol. 5, no. 3, pp. 338_346,2007.
  16. H. Chan, A. Perrig, and D. Song, Secure hierarchical in-network aggregation in sensor networks, in Proc. CCS, 2006, pp.278_287.
  17. S. Chen, Y. Zhang, Q. Liu and J. Feng, Dealing with dishonest recommendation: The trials in reputation management court, Ad Hoc Netw., vol. 10, no. 8, pp. 1603-1618, Nov.2012.
  18. P. Dewan and P. Dasgupta, P2P reputation management using distributed identities and decentralized recommendation chains, IEEE Trans. Knowl. Data Eng., vol. 22, no. 7, pp. 1000-1013, Jul. 2010.
  19. S. Buchegger and J.-Y. Le Boudec, Performance analysis of the CONFIDANT protocol, in Proc. MobiHoc, 2002, pp. 226-236.
  20. S. Marti, T. J. Giuli, K.Lai, and M. Baker, Mitigating routing misbehavior in mobile ad hoc networks, in Proc. MobiCom. 2000, pp. 225-265.