Description:
WSNs generate huge amount of data in the form of streams and mining useful knowledge from these streams is a challenging task. Existing works generate sensor association rules using occurrence frequency of patterns with binary frequency (either absent or present) or support of a pattern as a criterion. However, considering the binary frequency or support of a pattern may not be a sufficient indicator for finding meaningful patterns from WSN data because it only reflects the number of epochs in the sensor data which contain that pattern. The share measure of sensorsets could discover useful knowledge about numerical values associated with sensor in a sensor database. Therefore, in this paper, we propose a new type of behavioral pattern called share-frequent sensor patterns by considering the non-binary frequency values of sensors in epochs. To discover share-frequent sensor patterns from sensor dataset, we propose a novel parallel technique. In this technique, we develop a novel tree structure, called parallel share-frequent sensor pattern tree (PShrFSP-tree) that is constructed at each local node independently, by capturing the database contents to generate the candidate patterns using a pattern growth technique with a single scan and then merges the locally generated candidate patterns at the final stage to generate global share-frequent sensor patterns. Comprehensive experimental results show that our proposed model is very efficient for mining share-frequent patterns from WSN data in terms of time and scalability.
Description:
WSNs generate huge amount of data in the form of streams and mining useful knowledge from these streams is a challenging task. Existing works generate sensor association rules using occurrence frequency of patterns with binary frequency (either absent or present) or support of a pattern as a criterion. However, considering the binary frequency or support of a pattern may not be a sufficient indicator for finding meaningful patterns from WSN data because it only reflects the number of epochs in the sensor data which contain that pattern. The share measure of sensorsets could discover useful knowledge about numerical values associated with sensor in a sensor database. Therefore, in this paper, we propose a new type of behavioral pattern called share-frequent sensor patterns by considering the non-binary frequency values of sensors in epochs. To discover share-frequent sensor patterns from sensor dataset, we propose a novel parallel technique. In this technique, we develop a novel tree structure, called parallel share-frequent sensor pattern tree (PShrFSP-tree) that is constructed at each local node independently, by capturing the database contents to generate the candidate patterns using a pattern growth technique with a single scan and then merges the locally generated candidate patterns at the final stage to generate global share-frequent sensor patterns. Comprehensive experimental results show that our proposed model is very efficient for mining share-frequent patterns from WSN data in terms of time and scalability.
Description:
Wireless sensor networks promise to guarantee accurate, fault tolerant and timely detection of events in large scale sensor fields. To achieve this the notion of k-coverage is widely employed in WSNs where significant redundancy is introduced in deployment as an event is expected to be sensed by at least k sensors in the neighborhood. As sensor density increases significantly with k, it is imperative to find the optimal k for the underlying event detection system. In this work, we consider the detection probability, fault tolerance and latency as the Quality of Service (QoS) metrics of an event detection system employing k-coverage and present a probabilistic model to guarantee given QoS support with the minimum degree of coverage taking into account the noise related measurement error, communication interference and sensor fault probability. This work eventually resolves the problem of over or under deployment of sensors, increases scalability and provides a well defined mechanism to tune the degree of coverage according to performance needs.
Description:
Wireless sensor networks promise to guarantee accurate, fault tolerant and timely detection of events in large scale sensor fields. To achieve this the notion of k-coverage is widely employed in WSNs where significant redundancy is introduced in deployment as an event is expected to be sensed by at least k sensors in the neighborhood. As sensor density increases significantly with k, it is imperative to find the optimal k for the underlying event detection system. In this work, we consider the detection probability, fault tolerance and latency as the Quality of Service (QoS) metrics of an event detection system employing k-coverage and present a probabilistic model to guarantee given QoS support with the minimum degree of coverage taking into account the noise related measurement error, communication interference and sensor fault probability. This work eventually resolves the problem of over or under deployment of sensors, increases scalability and provides a well defined mechanism to tune the degree of coverage according to performance needs.
Description:
Spectrum allocation scheme in cognitive radio networks (CRNs) becomes complex when multiple CR users concomitantly need to be allocated new and suitable bands once the primary user returns. Most existing schemes focus on the gain of individual users, ignoring the effect of an allocation on other users and rely on the 'periodic sensing and transmission' cycle which reduces spectrum utilization. This paper introduces a scheme that exploits collaboration among users to detect PU's return which relieves active CR users from the sensing task, and thereby improves spectrum utilization. It defines a Capacity of Service (CoS) metric based on the optimal sensing parameters which measures the suitability of a band for each contending user and takes into consideration the impact of allocating a particular band on other band seeking users. The proposed scheme significantly improves capacity of service, reduces interference loss and collision, and hence, enhances dynamic spectrum access capabilities. (C) 2015 Elsevier Ltd. All rights reserved.
Description:
Group target tracking is a challenge for sensor networks. It occurs where large numbers of closely spaced targets move together in different groups. In these applications, the sensor selection scheme plays a vital role in extending network lifetime while providing high tracking accuracy. Existing schemes cause an extreme imbalance between energy usages and tracking accuracy. They are capable of tracking only individual groups and without using prior knowledge about the groups. These problems make them impractical for group target tracking. With the aim of balancing the trade-off between lifetime and accuracy, we present a novel Multi-Sensor Group Tracking (MSGT) scheme. MSGT comprises the following steps to accomplish concurrent tracking of multiple groups: (1) Clustering to capture changes in the behavioural properties of groups, such as formation, merging, and splitting; (2) Sensor selection to activate the contributory sensors for the estimated group regions; and (3) Group tracking using the activated sensors. We develop a probabilistic decision-making strategy that triggers the clustering step adaptively with any detected change in group behavioural patterns. The sensor selection step coordinates periodic selection of leader and tracking sensor nodes in a distributed manner. We introduce cost metrics that include sensor′s energy parameters in the selection of active sensors that fully cover the group regions. The tracking step is a Bayesian modelling of the target groups which uses particle filtering algorithm to estimate the group locations. Simulation results show that our scheme achieves substantial improvements over existing approaches in terms of network lifetime and tracking accuracy.
Description:
High density of coexisting networks in the Industrial, Scientific and Medical (ISM) band leads to static and self interferences among different communication entities. The inevitability of these interferences demands for interference avoidance schemes to ensure reliability of network operations. This paper proposes a novel Diversified Adaptive Frequency Rolling (DAFR) technique for frequency hopping in Bluetooth piconets. DAFR employs intelligent hopping procedures in order to mitigate self interferences, weeds out the static interferer efficiently and ensures sufficient frequency diversity. We compare the performance of our proposed technique with the widely used existing frequency hopping techniques, namely, Adaptive Frequency Hopping (AFH) and Adaptive Frequency Rolling (AFR). Simulation studies validate the significant improvement in goodput and hopping diversity of our scheme compared to other schemes and demonstrate its potential benefit in real world deployment.
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.
Description:
One primary goal of sensor networks is to guarantee robust and accurate event detection while reducing energy consumption for extended lifetime. To increase detection fidelity, recent literature introduces redundancy in the sensor field either by maintaining fixed k-coverage throughout lifetime or by providing dynamic k-coverage using mobile sensors after an event is detected. The former requires a large number of sensor nodes and the latter is costly and sometimes infeasible as mobile node deployment in inaccessible areas is difficult. Exploiting recent advances that allow adjustable sensing and transmission radius for sensors, we propose a scheme that ensures 1-coverage at deployment time, but on detection, extends to k-coverage to increase accuracy and robustness. Using an adjustable sensing model through power adjustment, we formulate an optimization problem that determines the optimal sensor set whose sensing and transmission radius are to be adjusted to provide expected coverage degree, through minimizing a cost function comprising energy consumption and achievable accuracy in detection. For a given sensing adjustability, a guideline for deterministic and random deployment is presented to ensure initial coverage. Detection performance and network lifetime are analyzed both theoretically and through simulation. Our approach avoids over-provisioning in sensor network, increases lifetime and scalability, and maintains detection performance in a cost effective way.