Smart curiosity sink node prediction mining algorithm for path optimization in wireless sensor network

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    engineering, for example, the dispersed frameworks, the database frameworks, and the data mining. Dealing with the extensive sums of information and efficiently using this information in improved path optimization has become increasingly challenging. In this paper, we will demonstrate how sink node predicted and integrated for path relationships and patterns in linked data, i.e., the interdependencies between data items at the lowest elemental level. The problem of path optimization has been approached using various techniques. The path selection plays the vital role in achieving the quality of service parameter and secure communication. Considering multiple routing, the security can be enforced with various strategies. Using few parameters namely the congestion, delay and hop count would support improve the performance of the network as well as lifetime. With the motivation, an efficient smart curiosity sink node prediction mining algorithm has been presented in this paper. First, both the source and destination nodes maintain information about the routes and network conditions. Based on that a single efficient path has been selected for data transmission. On the other side, the receiver verifies the path being followed, the route available and their conditions. Using this information the delay approximation is performed to decide the legitimate of the path being selected and the traffic incur in the way. The proposed method identifies several network threats and detects the presence of the node in the route. The proposed plan improves the performance of mining data efficiency as well as increases the throughput.

     

     


  • Keywords


    Sink node, path optimization, mining, route estimation, WSN

  • References


      [1] Li L, Li X, Lu Z, Lloret J & Song H, “Sequential Behavior Pattern Discovery with Frequent Episode Mining and Wireless Sensor Network”, IEEE Communications Magazine, Vol.55, No.6, (2017), pp.205-211.

      [2] Kim H, Kim HS, Lee SK, Park EC & Park KJ, “Enabling location-aware quality-controlled access in wireless networks”, EURASIP Journal on Wireless Communications and Networking, (2011).

      [3] Rao BT & Reddy BS, “Mining of High Dimensional Data using Efficient Feature Subset Selection Clustering Algorithm (WEKA)”, International Journal of Computer Applications, Vol.107, No.6, (2014).

      [4] Loseu V, Ghasemzadeh H & Jafari R, “A Mining Technique Using $ N $ n-Grams and Motion Transcripts for Body Sensor Network Data Repository”, Proceedings of the IEEE, Vol.100, No.1, (2012), pp.107-121.

      [5] Phung ND, Gaber MM & Rohm U, “Resource-aware online data mining in wireless sensor networks”, IEEE Symposium on Computational Intelligence and Data Mining, (2007), pp. 139-146.

      [6] Yuehua H, Shuang X & Huajian, W, “Study on distributed data mining model in Wireless Sensor Networks”, IEEE International Conference on Intelligent Computing and Integrated Systems (ICISS), (2010), pp. 866-869.

      [7] Ye XG, He YH & Wu L, “Service Oriented Distributed Data Mining System in Sensor Network”, IEEE Third International Conference on Information and Computing (ICIC), (2010), pp.225-228.

      [8] Wang B, Wang T & Mikou N, “An Efficient Data Streams Mining Method for Wireless Sensor Network's Data Aggregation”, IEEE First International Workshop on Education Technology and Computer Science, Vol.3, (2009), pp.1016-1020.

      [9] Ren SQ & Park JS, “Density mining based resilient data aggregation for wireless sensor network”, IEEE Fourth International Conference on Networked Computing and Advanced Information Management, Vol.1, (2008), pp.261-266.

      [10] Perolle G., Fraisse P, Mavros M., & Etxeberria I, “Automatic fall detection and activity monitoring for elderly”, Proceedings of Medetel., (2006), pp. 65–70

      [11] Lee Y, Kim J, Son M & Lee, M, “Implementation of accelerometer sensor module and fall detection monitoring system based on wireless sensor network”, IEEE 29th Annual International Conference of the Engineering in Medicine and Biology Society, (2007), pp.2315-2318.

      [12] Cantoni V, Lombardi L & Lombardi P, “Challenges for data mining in distributed sensor networks”, IEEE 18th International Conference on Pattern Recognition, Vol.1, (2006), pp.1000-1007.

      [13] Olfati-Saber R & Murray RM, “Consensus problems in networks of agents with switching topology and time-delays”, IEEE Transactions on automatic control, Vol.49, No.9, (2004), pp.1520-1533.

      [14] Kiziroglou ME, Boyle DE, Yeatman EM & Cilliers JJ, “Opportunities for sensing systems in mining”, IEEE Transactions on Industrial Informatics, Vol.13, No.1, (2017), pp.278-286.

      [15] Lian J, Naik K & Agnew GB, “Data capacity improvement of wireless sensor networks using non-uniform sensor distribution”, International Journal of Distributed Sensor Networks, Vol.2, No.2, (2006), pp.121-145.

      [16] Huang CJ, Chuang YT & Hu KW, “Using particle swam optimization for QoS in ad-hoc multicast”, Engineering Applications of Artificial Intelligence, Vol.22, No.8, (2009), pp.1188-1193.

      [17] Bari A, Wazed S, Jaekel A & Bandyopadhyay S, “A genetic algorithm based approach for energy efficient routing in two-tiered sensor networks”, Ad Hoc Networks, Vol.7, No.(4), (2009), pp.665-676.

      [18] Araújo AFR & Garrozi C, “MulRoGA: A multicast routing genetic algorithm approach considering multiple objectives”, Applied Intelligence, Vol.32, (2010), pp.330-345.

      [19] Lindsey S & Raghavendra CS, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems”, SIGMOD Record, Vol.32, No.4, (2003), pp.66-71.

      [20] Jeong JK, Kim SO & Song CH, “A solution of search multicast routing tree based on extended simulated annealing algorithm”, WSEAS Transactions on Mathematics, Vol.4, (2005), pp. 218-223.


 

View

Download

Article ID: 12167
 
DOI: 10.14419/ijet.v7i2.21.12167




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.