Dependable large scale behavioral patterns mining from sensor data using Hadoop platform
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2017
- Type: Text , Journal article
- Relation: Information Sciences Vol. 379, no. (2017), p. 128-145
- Full Text: false
- Reviewed:
- Description: Wireless sensor networks (WSNs) will be an integral part of the future Internet of Things (loT) environment and generate large volumes of data. However, these data would only be of benefit if useful knowledge can be mined from them. A data mining framework for WSNs includes data extraction, storage and mining techniques, and must be efficient and dependable. In this paper, we propose a new type of behavioral pattern mining technique from sensor data called regularly frequent sensor patterns (RFSPs). RFSPs can identify a set of temporally correlated sensors which can reveal significant knowledge from the monitored data. A distributed data extraction model to prepare the data required for mining RFSPs is proposed, as the distributed scheme ensures higher availability through greater redundancy. The tree structure for RFSP is compact requires less memory and can be constructed using only a single scan through the dataset, and the mining technique is efficient with low runtime. Current mining techniques in the literature on sensor data employ a single memory-based sequential approach and hence are not efficient. Moreover, usage of the. MapReduce model for the distributed solution has not been explored extensively. Since MapReduce is becoming the de facto model for computation on large data, we also propose a parallel implementation of the RFSP mining algorithm, called RFSP on Hadoop (RFSP-H), which uses a MapReduce-based framework to gain further efficiency. Experiments conducted to evaluate the compactness and performance of the data extraction model, RFSP-tree and RFSP-H mining show improved results. (C) 2016 Elsevier Inc. All rights reserved.
Periodic associated sensor patterns mining from wireless sensor networks
- Authors: Rashid, Mamunur , Kamruzzaman, Joarder , Gondal, Iqbal , Hassan, Rafiul
- Date: 2017
- Type: Text , Conference proceedings
- Relation: Proceedings of the 24th International Conference on Neural Information Processing (ICONIP 2017); Guangzhou, China; 14/11/2017-18/11/2017 p. 247-255
- Full Text: false
- Reviewed:
- Description: Mining interesting knowledge from the massive amount of data gathered in wireless sensor networks is a challenging task. Works reported in literature all-confidence measure based associated sensor patterns can captures association-like co-occurrences and the strong temporal correlations implied by such co-occurrences in the sensor data. However, when the user given all-confidence threshold is low, a huge amount of patterns are generated and mining these patterns may not be space and time efficient. Temporal periodicity of pattern appearance can be regarded as an important criterion for measuring the interestingness of associated patterns in WSNs. Associated sensor patterns that occur after regular intervals is called periodic associated sensor patterns. Even though mining periodic associated sensor patterns from sensor data stream is extremely important in many real-time applications, no such algorithm has been proposed yet. In this paper, we propose a compact tree structure called Periodic Associated Sensor Pattern-tree (PASP-tree) and an efficient mining approach for finding periodic associated sensor patterns (PASPs) from WSNs. Extensive performance analyses show that our technique is time and memory efficient in finding periodic associated sensor patterns.
An efficient data extraction framework for mining wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2016
- Type: Text , Conference paper
- Relation: 23rd International Conference, ICONIP 2016; Kyoto, Japan; 16th-21st October 2016; published in Neural Information Processing, Part III (Lecture Notes in Computer Science series) Vol. 9949, p. 491-498
- Full Text:
- Reviewed:
- Description: Behavioral patterns for sensors have received a great deal of attention recently due to their usefulness in capturing the temporal relations between sensors in wireless sensor networks. To discover these patterns, we need to collect the behavioral data that represents the sensor's activities over time from the sensor database that attached with a well-equipped central node called sink for further analysis. However, given the limited resources of sensor nodes, an effective data collection method is required for collecting the behavioral data efficiently. In this paper, we introduce a new framework for behavioral patterns called associated-correlated sensor patterns and also propose a MapReduce based new paradigm for extract data from the wireless sensor network by distributed away. Extensive performance study shows that the proposed method is capable to reduce the data size almost 50% compared to the centralized model.
Wake-up timer and binary exponential backoff for ZigBee-based wireless sensor network for flexible movement control system of a self-lifting scaffold
- Authors: Liang, Hua , Yang, Guangxiang , Xu, Ye , Gondal, Iqbal , Wu, Chao
- Date: 2016
- Type: Text , Journal article
- Relation: International Journal of Distributed Sensor Networks Vol. 12, no. 9 (2016), p. 1-12
- Full Text:
- Reviewed:
- Description: Synchronous movement of attached self-lifting scaffolds is traditionally monitored with wired sensors in high-rise building construction, which limits their flexibility of movements. A ZigBee-based wireless sensor system has been suggested in this article to prove the effectiveness of wireless sensor networks in actual implementation. Two optoelectronic sensors are integrated into a ZigBee node for measuring the displacement of attached self-lifting scaffolds. The proposed wireless sensor network combines an end device and a coordinator to allow easy replacement of sensors as compared to a wired network. A wake-up timer algorithm is proposed to reduce the transmitting power during continuous wireless data communication in the wireless sensor network. Furthermore, a variant binary exponential backoff transmission algorithm for data loss avoidance is proposed. The variant binary exponential backoff algorithm reduces packet collisions during simultaneous access by increasing the randomizing moments at nodes attempting to access the wireless channels. The performance of three of the proposed modules - a cable sensor, a 315-MHz sensor, and a ZigBee sensor - is evaluated in terms of packet delivery ratio and the end-to-end delay of a ZigBee-based wireless sensor network. The experimental results show that the proposed variant binary exponential backoff transmission algorithm achieves a higher packet delivery ratio at the cost of higher delays. The average cost of the developed ZigBee-based wireless sensor network decreased by 24% compared with the cable sensor. The power consumption of ZigBee is approximately 53.75% of the 315-MHz sensor. The average current consumption is reduced by approximately 1.5 mA with the wake-up timer algorithm at the same sampling rate. © The Author(s) 2016.
A mapreduce based technique for mining behavioral patterns from sensor data
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2015
- Type: Text , Conference paper
- Relation: 22nd International Conference on Neural Information Processing, ICONIP 2015; Istanbul, Turkey; 9th-12th November 2015 Vol. 9492, p. 145-153
- Full Text: false
- Reviewed:
- Description: WSNs generate a large amount of data in the form of streams, and temporal regularity in occurrence behavior is considered as an important measure for assessing the importance of patterns in WSN data. A frequent sensor pattern that occurs after regular intervals in WSNs is called regularly frequent sensor patterns (RFSPs). Existing RFSPs techniques assume that the data structure of the mining task is small enough to fit in the main memory of a processor. However, given the emergence of the Internet of Things (IoT), WSNs in future will generate huge volume of data, which means such an assumption does not hold any longer. To overcome this, a distributed solution using MapReduce model has not yet been explored extensively. Since MapReduce is becoming the de-facto model for computation on large data, an efficient RFSPs mining algorithm on this model is likely to provide a highly effective solution. In this work, we propose a regularly frequent sensor patterns mining algorithm called RFSP-H which uses MapReduce based framework. Extensive performance analyses show that our technique is significantly time efficient in finding regularly frequent sensor patterns. © Springer International Publishing Switzerland 2015.
ACSP-Tree: A tree structure for mining behavioral patterns from wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Conference paper
- Relation: IEEE Conference on Local Computer Networks (LCN 2013) (21 October 2013 to 24 October 2013) p. 691-694
- Full Text: false
- Reviewed:
- Description: WSNs generates a large amount of data in the form of stream and mining knowledge from the stream of data can be extremely useful. Association rules mining, from the sensor data, has been studied in recent literature. However, sensor association rules mining often produces a huge number of rules, but most of them either are redundant or fail to reflect the true correlation relationship among data objects. In this paper, we address this problem and propose mining of a new type of sensor behavioral pattern called associated-correlated sensor patterns. The proposed behavioral patterns capture not only association-like co-occurrences but also the substantial temporal correlations implied by such co-occurrences in the sensor data. Here, we also use a prefix tree-based structure called associated-correlated sensor pattern-tree (ACSP-tree), which facilitates frequent pattern (FP) growth-based mining technique to generate all associated-correlated patterns from WSN data with only one scan over the sensor database. Extensive performance study shows that our approach is time and memory efficient in finding associated-correlated patterns than the existing most efficient algorithms.
Regularly frequent patterns mining from sensor data stream
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Conference paper
- Relation: International Conference on Neural Information Processing (ICONIP 2013) p. 417-424
- Full Text: false
- Reviewed:
- Description: Mining interesting and useful knowledge from the huge amount of data gathered in wireless sensor networks is a challenging task. Works reported in literature use support metric-based sensor association rule which employs the occurrence frequency of patterns as criteria. Such criteria may not be appropriate for finding significant patterns. Moreover, temporal regularity in occurrence behavior should be considered as another important measure for assessing the importance of patterns in WSNs. Frequent sensor patterns that occur after regular intervals is called regularly frequent sensor patterns. Even though mining regularly frequent sensor patterns from sensor data stream is extremely important in many real-time applications, no such algorithm has been proposed yet. In this paper, we propose a novel tree structure called Regularly Frequent Sensor Pattern-tree (RSP-tree) and an efficient mining approach for finding regularly frequent sensor patterns from WSNs. Extensive performance analyses show that our technique is time and memory efficient in finding regularly frequent sensor patterns.