Lightweight blockchain fuzzy decision scheme through MQTT and Fibonacci for sustainable transport

Zhongxue Yang; Yiqin Bao; Yuan Liu; Qiang Zhao; Hao Zheng; Wenbin Xu; Zhongxue Yang; Yiqin Bao; Yuan Liu; Qiang Zhao; Hao Zheng; Wenbin Xu

doi:10.3934/mbe.2022556

Mathematical Biosciences and Engineering

2022, Volume 19, Issue 12: 11935-11956. doi: 10.3934/mbe.2022556

Previous Article Next Article

Research article Special Issues

Lightweight blockchain fuzzy decision scheme through MQTT and Fibonacci for sustainable transport

1.
School of information engineering, Nanjing XiaoZhuang University, Nanjing 211171, China
2.
Business School, Jinling University of Science and Technology, Nanjing 211199, China
3.
Department of Information Systems Schulich School of Business, Toronto 416647, Canada
4.
Nanjing Huazhu Industrial Intelligent Equipment Co., Ltd., Nanjing 211175, China

Academic Editor: Jong Hyuk Park

Received: 24 June 2022 Revised: 01 August 2022 Accepted: 04 August 2022 Published: 17 August 2022

The unprecedented progress in field of IoT enabled rapid developments in the vehicle intelligent transportation systems and most of these provide services in a centralized way. However, the centralized system architecture is vulnerable to the external attacks as a result both information and equipment are prone to eavesdropping and destruction. Therefore, there is a trend to apply blockchain technology to the vehicle intelligent transportation systems in order to achieve sustainable transportation. Nevertheless, the system is so great and very sophisticated and the ultimate task will be harder to implement. In view of this, an attempt is made in this paper to propose a lightweight fuzzy decision blockchain scheme through MQTT and Fibonacci, and through this scheme, the extent of blockchain server can be scaled and easy to deploy. Also through MQTT, reliable communication and transmission of blockchain can be realized. LF-BC is formed by using DH and Fibonacci transformation to enhance security, and F-PBFT consensus algorithm can reduce the communication overhead and improve the fault tolerance tremendously. Using LF-BC scheme, the experimental results show that the fault tolerance rate is significantly improved by 22.3%, and the sustainable safety and reliability of the vehicle intelligent transportation system is increased consumedly. At the same time, the feasibility of the scheme is also verified by taking specific cases.

Keywords:

Citation: Zhongxue Yang, Yiqin Bao, Yuan Liu, Qiang Zhao, Hao Zheng, Wenbin Xu. Lightweight blockchain fuzzy decision scheme through MQTT and Fibonacci for sustainable transport[J]. Mathematical Biosciences and Engineering, 2022, 19(12): 11935-11956. doi: 10.3934/mbe.2022556

Related Papers:

[1]	Yunqian Yu, Zhenliang Hao, Guojie Li, Yaqing Liu, Run Yang, Honghe Liu . Optimal search mapping among sensors in heterogeneous smart homes. Mathematical Biosciences and Engineering, 2023, 20(2): 1960-1980. doi: 10.3934/mbe.2023090
[2]	Ray-Ming Chen . Extracted features of national and continental daily biweekly growth rates of confirmed COVID-19 cases and deaths via Fourier analysis. Mathematical Biosciences and Engineering, 2021, 18(5): 6216-6238. doi: 10.3934/mbe.2021311
[3]	Sakorn Mekruksavanich, Anuchit Jitpattanakul . RNN-based deep learning for physical activity recognition using smartwatch sensors: A case study of simple and complex activity recognition. Mathematical Biosciences and Engineering, 2022, 19(6): 5671-5698. doi: 10.3934/mbe.2022265
[4]	Keruo Jiang, Zhen Huang, Xinyan Zhou, Chudong Tong, Minjie Zhu, Heshan Wang . Deep belief improved bidirectional LSTM for multivariate time series forecasting. Mathematical Biosciences and Engineering, 2023, 20(9): 16596-16627. doi: 10.3934/mbe.2023739
[5]	Xiaoguang Liu, Meng Chen, Tie Liang, Cunguang Lou, Hongrui Wang, Xiuling Liu . A lightweight double-channel depthwise separable convolutional neural network for multimodal fusion gait recognition. Mathematical Biosciences and Engineering, 2022, 19(2): 1195-1212. doi: 10.3934/mbe.2022055
[6]	Wajid Aziz, Lal Hussain, Ishtiaq Rasool Khan, Jalal S. Alowibdi, Monagi H. Alkinani . Machine learning based classification of normal, slow and fast walking by extracting multimodal features from stride interval time series. Mathematical Biosciences and Engineering, 2021, 18(1): 495-517. doi: 10.3934/mbe.2021027
[7]	Tianjun Lu, Xian Zhong, Luo Zhong, RuiqiLuo . A location-aware feature extraction algorithm for image recognition in mobile edge computing. Mathematical Biosciences and Engineering, 2019, 16(6): 6672-6682. doi: 10.3934/mbe.2019332
[8]	Shangbin Li, Yu Liu . Human motion recognition based on Nano-CMOS Image sensor. Mathematical Biosciences and Engineering, 2023, 20(6): 10135-10152. doi: 10.3934/mbe.2023444
[9]	Xihe Qiu, Xiaoyu Tan, Chenghao Wang, Shaotao Chen, Bin Du, Jingjing Huang . A long short-temory relation network for real-time prediction of patient-specific ventilator parameters. Mathematical Biosciences and Engineering, 2023, 20(8): 14756-14776. doi: 10.3934/mbe.2023660
[10]	Xiaoguang Liu, Yubo Wu, Meng Chen, Tie Liang, Fei Han, Xiuling Liu . A double-channel multiscale depthwise separable convolutional neural network for abnormal gait recognition. Mathematical Biosciences and Engineering, 2023, 20(5): 8049-8067. doi: 10.3934/mbe.2023349

Abstract

1. Introduction

Smart homes aim to provide a comfortable, convenient, and efficient living environment and effectively alleviate the impact of the functional decline ^[1,2]. Besides, smart home is also designed to improve energy management ^[3,4,5]. The premise of achieving the goal is to accurately recognize daily activities, which take place in smart homes. To achieve good activity recognition performance, several approaches have been proposed. Existing approaches focus on different stages of the process of activity recognition ^[6]. Some approaches focus on stages such as, segmenting sensor event streams ^[7,8,9,10], extracting and selecting daily activity features ^{[11,12,13,14,15]}, and developing recognition models ^{[16,17,18,19]}. In this paper, the proposed approach focuses on extracting and selecting daily activity features.

The primary task of extracting and selecting daily activity features is to establish a feature space and generate a sample space. Daily activity features are divided into temporal and sensor features. Temporal features include the start time, end time, and duration of the daily activity. For the sensor features, while some approaches take all smart home sensors as the feature space, others take the sets or sequences of frequency sensors as the feature space. For a given sensor feature and daily activity, most of the approaches take the frequency activated in the daily activity as the value of the sensor feature. The existing common practice for extracting daily activity features is discretizing sensor event streams. This widespread practice leads to the character loss of the time series of sensor event streams and limits the improvement of activity recognition performance.

To utilize the character of the time series of sensor event streams to improve activity recognition performance, this paper proposes a novel approach for extracting daily activity features. As compared with existing approaches, the proposed approach achieves better activity recognition performance. The main contributions of this paper are as follows.

(1) An algorithm that serves to extract time series data from sensor event streams is proposed.

(2) Several common statistic formulas are proposed to establish an initial feature space.

(3) A feature selection algorithm is employed to generate final daily activity features.

(4) The proposed approach is evaluated on two common datasets. The experiment results show that the proposed approach achieves better performance than previous approaches for solving daily activity features.

The rest of this paper is arranged as follows: First, related work is introduced; the proposed approach is then introduced; the proposed approach is validated and results discussed. Finally, we summarize our findings.

2. Related work

Approaches for activity recognition in smart homes can be divided into knowledge-driven and data-driven approaches. For knowledge-driven approaches, an activity model is developed as a reusable context model, which associates objects, space, and time with activities. The knowledge driven model is semantically clear and follows an agreed indication. Logic language and ontology are the two most common models representing domain knowledge ^{[20,21,22,23,24,25,26]}. After the knowledge model is established, logical reasoning is employed to perform activity recognition. Knowledge-driven approaches are robust but face limitations in the case of uncertain data.

Data-driven approaches adopt data mining and machine learning techniques to develop the activity recognition model. Conventional classification algorithms e. g. Naive Bayesian (NB) ^{[27,28,29,30]}, Hidden Markov Model (HMM) ^[31,32], Dynamic Bayesian Network (DBN) ^[33], Support Vector Machine (SVM) ^[34], Conditional Random Field (CRF) ^[35], and Recursive Neural Network (RNN) ^[36] have been widely used in activity recognition tasks. Besides conventional classification algorithms, some specialized algorithms were invented. Wan et al. proposed a novel activity recognition model called COBRA. COBRA mixed the combined sliding window with a logistic regression model for near-real-time activity recognition ^[37]. To deal with the problem of class imbalance and improve the performance of the model, Medina-Quero et al. developed an integrated classifier based on long short-term memory (LSTM) to recognize daily activities ^[38].

Besides classification algorithms, the fine features of daily activities are equally vital to activity recognition performance. Daily activity features can be divided into temporal and sensor features. The temporal features space usually includes the time when a daily activity starts, its duration, and when it ends. The sensor features space is generated directly or indirectly from the set of initial sensors. Liu et al. take the set of initial sensors as the sensor features space and a sensor as a daily activity feature ^[39]. Because the relationship between sensors is lost when a sensor is taken as a daily activity feature, daily activities which activate similar sensors are hard to differentiate. To improve activity recognition performance, the frequent items mining method ^[40], frequent periodic pattern mining method ^[41], and activity modelling based on a low-dimensional feature space ^[42] were proposed. In addition, Wen et al. and Nasreen et al. used the association rules mining method to mine frequent sensor combinations, to conduct activity modelling for the low-dimensional feature space ^[43,44]. Twomey proposed an unsupervised method to learn the topology structure of sensors in a smart home and mined effective combinations of sensor events as daily behaviour characteristics, according to the topology structure ^[45]. Yatbaz et al. ^[46] used a Scanpath Trend Analysis (STA) method to set a priority for sensors to obtain sensor combinations that represent daily activity features, to improve the evaluation standard of the model. Compared to the approach where a sensor is taken as a daily activity feature, these approaches consume more computing resources, even if activity recognition performance is slightly improved.

For sensor features, truth value, frequency, and density of the activated sensors are the most common eigenvalues ^[47]. In addition, the term frequency-inverse document frequency (TF-IDF) formula ^[8], mutual information formula ^[48], deep learning technology ^[49], and differential representation between different activities were employed to compute these eigenvalues ^[50]. However, these above mentioned strategies for estimating the eigenvalues generate only shallow features, which are far from adequate when describing the nature of the time series of sensor event streams. This paper performs an in-depth feature mining on the time series data, which can preserve the essential information of the time itself. Consequently, the proposed approach can be extended to promote the user activity recognition model.

3. The proposed approach

In a smart home, different types of non-invasive sensors e.g. infrared motion sensors, and temperature sensors, are deployed in different parts of the house. When residents carry on daily activities e.g. sleeping, and bathing, corresponding sensor readings are generated accordingly. Figure 1 shows a sequence of sensors triggered by cooking breakfast as a daily activity. Each line denotes a sensor event. Each activated sensor is recorded as a sensor event se, denoted as a four tuple; se = (D, T, I, R). D and T are the date and the time when the se is generated, respectively; I is the identification of the activated sensor, and R is the sensor reading. For example, the sensor event shown in line 1 is generated at 07:58:39.655022 on 2011-06-15. The activated sensor is M007 with a reading ON.

Figure 1. Sequence of activated sensors by daily activity, cooking breakfast.

DownLoad: Full-Size Img PowerPoint

3.2. Feature category

Based on the nature time series of sensor events, 6 categories of common daily activity features are proposed in form of statistic formulas. Each statistic formula corresponds to a given time series. Throughout this section, T = < t₁, t₂, …, t_n > denotes a time series, where t_iis the ith time value of a given time series.

(1) Mean: µ(T) returns the mean of T. µ(T) is defined in formula (1).

$\mu (T) = \frac{{\sum {{t_i}} }}{n}$

(1)

(2) Standard Deviation: σ(T) returns the standard deviation of T. σ(T) is defined in formula (2).

$\sigma (T) = \sqrt {\frac{{\sum {{{({t_i} - \mu )}^2}} }}{{n - 1}}}$

(2)

(3) Skewness: Skew(T) returns the skewness of T. Skew(T) is defined in formula (3).

$Skew(T) = \frac{{{\mu ^3}}}{{{\sigma ^3}}}$

(3)

(4) Slope: Slope(T) returns the slope of the linear least-squares regression for the values of T. Slope(T) is defined in formula (4).

$Slope\left( T \right) = slope\left( {llsr(T)} \right)$

(4)

Where llsr returns the linear least-squares regression for the values of T.

(5) Wave: Wave(T) returns the number of troughs and peaks and of T. Wave(T) is defined in formula (5).

$Wave(T) = peaks(T) + troughs(T)$

(5)

Where peaks returns the number of peaks of T. troughs returns the number of troughs of T.

(6) Wavelet Transform Coefficients: For two specified parameters w and t∈T, CWTC(t, w) returns continuous wavelet transform coefficients. CWTC(t, w) is defined in formula (6). cwt(t, w) returns a continuous wavelet transform for the ricker wavelet of the wavelet function.

$CWTC{\rm{(}}t{\rm{, }}w{\rm{)}} = wavelettransformcoefficients{\rm{(}}t{\rm{, }}w, cwt(t, w){\rm{)}}$

(4.1)

$cwt(t, w) = \frac{2}{{\sqrt {3 \cdot w} \cdot {\pi ^{\frac{1}{4}}}}}(1 - \frac{{{t^2}}}{{{w^2}}})exp( - \frac{{{t^2}}}{{2 \cdot {w^2}}})$

(6.2)

Where w is the width parameter in the wavelet transform function, which is 2 in the experiment.

3.2. Feature extraction

For a sequence of sensor events activated by a daily activity, time series data which is input to each feature category. Feature space is generated by Algorithm 1. Algorithm 1 can be divided into two stages. In the first stage (lines 4-12), the identification and times of each activated sensor are extracted. Activated times form time series data. In the second stage (lines 13-22), features are extracted using feature formulas with extracted time series data.

3.2. Feature selection

One drawback to the features of daily activity is the high dimension of feature set. To obtain the strong ability features and eliminate the weak ability ones, we need to use feature selection technique to optimize feature subset. In this paper, the SDSFS algorithm ^[51] is used to evaluate the activity recognition capability of these features.

In the initial phase, each agent is assigned to combine the features subset in their respective search spaces (all possible combinations of the features). Each agent will use an independent random split to divide the dataset into training and testing subsets according to a ratio of 4:1. The hypothesis is a binary string that represents the feature subset within the subset size. In the string, if the bit is 1, it contains its corresponding feature, if 0, it is not.

In the test phase, these activities of the agent are determined according to the average F-score of multiple classifiers in their fitness function, where the agent selects another random agent and compares them. If the F-score of the selected agent is more than that of the random agent, then the selected agent is set to active, otherwise it is set to inactive. The agents will repeat this process to determine their respective states. After that, the diffusion phase would ideally begin.

In the diffusion phase, both inactive and active agents choose other agents. If the randomly selected agent is active, it will offset the hypothesis (the feature subset), which will be shared with an inactive agent. Instead, the selected agents choose the new random hypothesis (the feature subset) from its search space (all feature combinations in the subset size). For offsetting, one of the features is randomly removed (by changing 1 to 0) with another randomly added one (by changing 0 to 1). This keeps the size of the subset. Besides, when the active agent picks another active agent that maintains a similar hypothesis, the selected agent will be set to inactive and assigned to a random hypothesis. This frees up all agents and increases diversity. Algorithm 2 is repeatedly executed until the maximum number of iterations (numIterations) is reached.

Algorithm 1. featureExtraction

Input: S, deployed sensor identifications in smart house
     Φ, set of the proposed feature categories
      E, a sequence of sensor events activated by a daily activity a
Output: F
1. F←Ø;
2. TS←Ø;
3. IS←Ø; // set of sensor identifications activated by a
4. while(true)
5.      e←getNextSensorEvent(E); //Get next sensor event e in E.
6.      (t, s)←extractTime & Sensor(e)//Extract T and I of e.
7.      TS←TS∪{(T, I)};
8.      IS←IS∪{I};
9.      if(e is last traversed sensor event in E) then
10.        break;
11.      end if
12. end for
13. for each I in S
14.      for each φ in Φ
15.        if I∈IS then
16.          T_I← {T|(T, I)∈TS};
17.          F←F∪{(I, j(T_I))};
18.        else
19.          F←F∪{(I, 0)};
20.         end if
21.       end for
22. end for
23. return F

Algorithm 2. Description of SDSFS algorithm

Input: numIterations, the number of iterations
     numAgents, the number of agents
Output: Optimal feature subset
1.    //Initialisation phase
2.    Assign numAgents agents to random hypotheses with inactive states, each agent represents a set of features.
3.   while less than numIterations do
4.      //Evaluation phase
5.      for each agent in agents
6.       Evaluate the fitness value;
7.       Find the maximum fitness value;
8.     end for
9.      //Test phase
10.      for each agent in agents
11.       if Agent’s fitness > random agent’s fitness then
12.         Set agent as active;
13.       end if
14.     end for
15.      //Diffusion phase
16.      for each agent in agents
17.        if agent is inactive then
18.         Select a random agent;
19.          if selected agent is active then
20.            Copy its hypothesis & offset it;
21.            Evaluate the fitness value;
22.         else
23.           Pick a random hypothesis;
24.         Evaluate the fitness value;
25.          end if
26.         end if
27.     end for
28.    end for
29. return Optimal feature subset

4. Evaluation

Activity recognition performance depends on the daily activity feature. We use two common datasets “Cairo” and “Tulum2009” to evaluate the approaches for solving activity recognition performance of daily activity features. “Cairo” and “Tulum2009” are provided by the Washington State University ^[52]. The involved sensors and daily activities are listed in Table 1.

Table 1. Involved sensors and daily activities.

Dataset	Residents and pets	Sensor Categories	Number of sensors	Activity Categories	Number of Activity instances	Measurement Time
“Cairo”	2 residents and 1 pet	“Motion sensors” (M001-M027)	27	“Night_wandering”	67	57 days
				“Bed_to_toilet”	30
				“R1_wake”	53
				“R2_wake”	52
				“R2_take_medicine”	44
				“Breakfast”	48
		“Temperature sensors ”(T001-T005)	5	“Leave_home”	69
				“Lunch”	37
				“Dinner”	42
				“R2_sleep”	52
				“R1_sleep”	50
				“R1_work_in_office”	46
				“Laundry”	10
“tulum2009”	2 residents	“Motion sensors” (M001-M018)	18	“Cook_Breakfast”	80	84 days
				“R1_Eat_Breakfast”	66
				“Cook_Lunch”	71
				“Leave_Home”	75
				“Watch_TV”	528
		“Temperature sensors ”(T001-T002)	2	“R1_Snack”	491
				“Enter_Home”	73
				“Group_Meeting”	11
				“R2_Eat_Breakfast”	47
				“Wash_Dishes”	71

| Show Table

DownLoad: CSV

4.1. Experiment setup

For daily activity feature solving approaches, we use Jupyter Notebook to carry out experimental comparison of four methods. First, the proposed method is called "SR", and the second is called "FR". FR is an extraction approach of daily activity feature. For FR method, frequency of activated sensor is extracted as daily activity feature. “FR” and its variants have been be used most extensively as daily activity feature. Feature spaces of the approach are composed of “st”, “et”, “du” and sensor features ^[53]. The other two are the combination of SR and FR with SDSFS algorithm respectively, called "SR+FS" and "FR+FS". FR+FS (FR+FS) means that SDSFS is employed to select features of daily activity after features are extracted.

For a given daily activity, the values of st, et, and du refer to the start time, end time, and duration of the daily activity, respectively. Sensor features, each of which corresponds to a sensor are mapped to all deployed sensors in the smart home. For FR, the value of a sensor feature is the frequency that activates the corresponding sensor in the given daily activity. For the SDSFS algorithm, the parameters involved are listed in Table 2.

Table 2. Parameter Interpretation of SDSFS algorithm.

Configuration Name	Parameter Interpretation
the number of iterations	numIterations←150
the number of agents	numAgents←30
the minimum number of features included in an agent	lowerLim←5
the maximum number of features included in an agent	upperLim←30

| Show Table

DownLoad: CSV

For data-driven approaches, activity recognition is usually treated as a classification problem. Without loss of generality, Logistic Regression (LR), Naive Bayesian (NB), Decision Tree (DT) and LSTM are used to evaluate the proposed approach. The parameters involved are listed in Table 3. The rest of the parameters are default. A leave-one-day-out cross validation is taken to evaluate the proposed approach. The performance indicators used are the Recall, Precision, and F-score, which are defined in formula (7), (8) and (9), respectively, where Q is the number of activity labels; TP_i is the number of true positives; FP_i is the number of false positives; FN_i is the number of false negatives; TN_i is the number of true negatives.

$Recall = \frac{{\sum\limits_{i = 1}^Q {\frac{{T{P_i}}}{{T{P_i} + F{N_i}}}} }}{Q}$

(7)

$Precision = \frac{{\sum\limits_{i = 1}^Q {\frac{{T{P_i}}}{{T{P_i} + F{P_i}}}} }}{Q}$

(8)

$F - score = \frac{{2*Precision*\operatorname{Re} call}}{{Precision + \operatorname{Re} call}}$

(9)

Table 3. Parameter Settings of Classifiers.

Classifiers Name	Parameter Name	Parameter Settings
LR	regularization intensity, random number seed	C←1.0, random_state←2018
DT	random number seed	random_state←2018
NB	/	/
LSTM	The number of units	16
	Gradient descent algorithm	AdamOptimizar
	Learning rate	1e-3
	Batch size	100
	Epoch number	100

| Show Table

DownLoad: CSV

4.2. Results

Recall, Precision, and F-measure are listed in Tables 4-9 and Figures 3, 5.

Table 4. Precision of activity recognition in different classifiers of “Cairo”. The best-performing tests by the metric are shown in underline.

Approaches	LR	NB	DT	LSTM
FR	79.263%	72.207%	84.346%	81.021%
SR	70.900%	70.775%	79.358%	88.152%
FR + FS	83.112%	81.334%	87.379%	/
SR + FS	87.006%	83.958%	89.511%	/

| Show Table

DownLoad: CSV

Table 5. Recall of activity recognition in different classifiers of “Cairo”. The best-performing tests by the metric are shown in underline.

Approaches	LR	NB	DT	LSTM
FR	74.776%	70.225%	85.018%	75.2693%
SR	66.043%	68.411%	78.236%	88.268%
FR + FS	81.310%	79.023%	86.295%	/
SR + FS	82.918%	80.634%	87.114%	/

| Show Table

DownLoad: CSV

Table 6. . F-score of activity recognition in different classifiers of “Cairo”. The best-performing tests by the metric are shown in underline.

Approaches	LR	NB	DT	LSTM
FR	75.603%	69.265%	84.280%	76.321%
SR	66.254%	67.167%	78.074%	87.748%
FR + FS	81.021%	78.589%	86.189%	/
SR + FS	84.133%	80.214%	87.529%	/

| Show Table

DownLoad: CSV

Table 7. Precision of activity recognition in different classifiers of “Tulum2009”. The best-performing tests by the metric are shown in underline.

Approaches	LR	NB	DT	LSTM
FR	72.627%	58.688%	84.993%	85.907%
SR	77.075%	73.139%	80.689%	88.8%
FR + FS	81.864%	65.650%	86.122%	/
SR + FS	90.844%	81.221%	85.329%	/

| Show Table

DownLoad: CSV

Table 8. Recall of activity recognition in different classifiers of “Tulum2009”. The best-performing tests by the metric are shown in underline.

Approaches	LR	NB	DT	LSTM
FR	64.540%	72.008%	79.591%	76.256%
SR	74.478%	75.513%	78.609%	86.716%
FR + FS	65.519%	75.564%	81.985%	/
SR + FS	86.101%	87.574%	84.771%	/

| Show Table

DownLoad: CSV

Table 9. F-score of activity recognition in different classifiers of “Tulum2009”. The best-performing tests by the metric are shown in underline.

Approaches	LR	NB	DT	LSTM
FR	65.912%	58.368%	81.628%	80%
SR	75.543%	71.112%	79.265%	86.909%
FR + FS	68.535%	66.448%	83.669%	/
SR + FS	88.205%	83.562%	84.727%	/

| Show Table

DownLoad: CSV

Figure 3. Performance comparison of the different daily activity feature solving approaches on three classifiers.

DownLoad: Full-Size Img PowerPoint

Figure 5. Performance comparison of the different daily activity feature solving approaches on three classifiers.

DownLoad: Full-Size Img PowerPoint

(1) Results on Dataset “Cairo”

After feature selection, the scores of each agent are shown in Figure 2. FR+FS and SR+FS have the highest average F-score in the 14th and 3rd agents respectively. Based on the above results, we conduct the following experiments using the features in the best agents respectively.

Figure 2. The average F-score of the extracted features in each agent.

DownLoad: Full-Size Img PowerPoint

The Precision obtained using SR+FS is higher than that obtained using the other three methods for all classifiers. The Recall and F-score obtained using SR+FS are higher than those obtained using FR, SR and FR+FS for LR and NB. The highest Precision (89.511%), Recall (87.114%) and F-score (87.529%) are obtained using SR+FS for DT. Besides, the first three classifiers, their average Precision value obtained using SR+FS improves by at least 2.883% compared with the performance of other tests. And the average Recall value of the SR+FS is 83.555%. There is 1.346% improvement over the best outcomes of the first three methods. Similarly, the average F-score of the SR+FS achieves at least 7.574%, 13.459% and 2.024% improvements over other benchmark methods. Finally, SR also beats FR in every metric of the LSTM.

(2) Results on Dataset “Tulum2009”

After feature selection, the scores of each agent are shown in Figure 4. FR+FS and SR+FS have the highest average F-score in the 5th and 22nd agents respectively. Based on the above results, we conduct the following experiments using the features in the best agents respectively.

Figure 4. The average F-score of the extracted features in each agent.

DownLoad: Full-Size Img PowerPoint

The dataset also gets the same result pattern. The Precision obtained using SR+FS is also higher than that obtained using the other three methods for all classifiers. The Recall and F-score obtained using SR+FS are higher than those obtained using FR, SR and FR+FS for LR and NB. Although SR+FS lags behind FR + FS in the Precision of DT. Besides, the first three classifiers, their average Precision value obtained using SR+FS improves by at least 7.919% compared with the performance of other tests. Besides, the average Recall value of the SR+FS is 86.148%. There is 9.948% improvement over the best outcomes of the first three methods. Similarly, the average F-score of the SR+FS achieves at least 16.862%, 10.192% and 12.614% improvements over other benchmark methods. Finally, SR also beats FR in every metric of the LSTM.

4.3. Discussion

We discuss few crucial observations from our experiments. As shown in Figures 3, 5, SR+FS performs better than the other three groups. First, this gain may be due to feature selection. There are inevitably redundant features in the original data. These features are not sensitive to the classification label, but they can disturb the classifier's correct judgment of the sample. Therefore, the performance of SR is low in some classifiers.

In addition, it may be that the traditional method only counts the frequency of the sensor and loses the time information of the sensor. In contrast, our method extracts the trigger time of the sensor in the activity in turn, and then carries out feature calculation. Such different feature computing methods increase the diversity of features. In this way, the frequency information and the time information of the time series data are retained.

We note that there are imbalances of categories in daily activities, but this paper does not do the corresponding processing when modeling. Excessive differences between categories may make the model biased towards more categories, which may affect the performance evaluation of the model to some extent. Consequentially, it may be worthwhile to perform further studies to determine how such problems impact performance, especially in smart home environment.

5. Conclusion

Daily activity features have a significant influence on activity recognition performance. To improve activity recognition performance, we proposed a statistic representation of daily activity features based on the time series nature of sensor event streams. We utilized four classifiers to compare the proposed approach with approaches based on the frequency and truth of sensor events on two common datasets. The results showed that the proposed approach can significantly improve activity recognition performance.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 61976124); the Open Project Program of Artificial Intelligence Key Laboratory of Sichuan Province (Nos. 2018RYJ09, 2019RZJ01); the Opening Project of Key Laboratory of Higher Education of Sichuan Province for Enterprise Informationalization and Internet of Things(No. 2019WZY03); the Major Frontier Project of Science and Technology Plan of Sichuan Province (No. 2018JY0512).

Conflict of interest

The authors declare no conflicts of interest.

References

[1]	Z. Wang, Y. Zhou, C. D. Huang, Q. Q. Miao, Survey on blockchain solution for big data, Comput. Sci., 46 (2019), 6-10.
[2]	K. Salah, M. A. Khan, IoT security: Review, blockchain solutions, and open challenges, Future Gener. Comput. Syst., 82 (2017), 395-411. https://doi.org/10.1016/j.future.2017.11.022 doi: 10.1016/j.future.2017.11.022
[3]	A. Azaria, A. Ekblaw, T. Vieira, A. Lippman, MedRec: Using blockchain for medical data access and permission management, in 2016 2nd international conference on open and big data (OBD), 8 (2016), 25-30. https://doi.org/10.1109/OBD.2016.11
[4]	C. C. Agbo, Q. H. Mahmoud, J. M. Eklund, Blockchain technology in healthcare: A systematic review, Healthcare, 7 (2019), 56-65. https://doi.org/10.3390/healthcare7020056 doi: 10.3390/healthcare7020056
[5]	C. Mirabelli, Blockchain-based solutions for agri-food supply chains: A survey, Int. J. Simul. Process Model., 17 (2021), 1-15. https://doi.org/10.1504/IJSPM.2021.120838 doi: 10.1504/IJSPM.2021.120838
[6]	M. Andoni, V. Robu, D. Flynn, S. Abram, D. Geach, D. Jenkins, et al., Blockchain technology in the energy sector: A systematic review of challenges and opportunities, Renewable Sustainable Energy Rev., 100 (2019), 143-174. https://doi.org/10.1016/j.rser.2018.10.014 doi: 10.1016/j.rser.2018.10.014
[7]	V. Plevris, N. D. Lagaros, A. Zeytinci, Blockchain in civil engineering, architecture and construction industry: State of the art, evolution, challenges and opportunities, Front. Built Environ, 8 (2022). https://doi.org/10.3389/fbuil.2022.840303
[8]	T. Bakogiannis, I. Mytilinis, K. Doka, G. Goumas, Leveraging blockchain technology to break the cloud computing market monopoly, Computers, 9 (2020), 9-15. https://doi.org/10.3390/computers9010009 doi: 10.3390/computers9010009
[9]	S. Tuli, R. Mahmud, S. Tuli, R. Buyya, FogBus: A blockchain-based lightweight framework for edge and fog computing, J. Syst. Software, 154 (2019), 22-36. https://doi.org/10.1016/j.jss.2019.04.050 doi: 10.1016/j.jss.2019.04.050
[10]	D. Khan, L. T. Jung, M. A. Hashmani, Systematic literature review of challenges in blockchain scalability, Appl. Sci., 11 (2021), 9372-9378. https://doi.org/10.3390/app11209372 doi: 10.3390/app11209372
[11]	Y. Zhu, G. Gan, D. Deng, F. Ji, A. Chen, Security research in key technologies of blockchain, Inf. Secur. Res., 2 (2016), 1090-1097.
[12]	J. Wang, L. Li, Y. Yan, W. Zhao, Y. Xu, Security incidents and solutions of blockchain technology application, Comput. Sci., 45 (2018), 352-355.
[13]	S. A. Bhat, N. F. Huang, I. B. Sofi, M. Sultan, Agriculture-food supply chain management based on blockchain and IoT: A narrative on enterprise blockchain interoperability, Agriculture, 12 (2022), 40-47. https://doi.org/10.3390/agriculture12010040 doi: 10.3390/agriculture12010040
[14]	J. H. Huh, S. K. Kim, The blockchain consensus algorithm for viable management of new and renewable energies, Sustainability, 11 (2019), 3184-3193. https://doi.org/10.3390/su11113184 doi: 10.3390/su11113184
[15]	V. Astarita, V. P. Giofrè, G. Mirabelli, V. Solina, A review of blockchain-based systems in transportation, Information, 11 (2020), 21-28. https://doi.org/10.3390/info11010021 doi: 10.3390/info11010021
[16]	F. Chen, Y. Huo, K. Liu, W. Tang, J. Zhu, Z. Sui, A study on MQTT node selection, in 2020 16th International Conference on Mobility, Sensing and Networking (MSN), 16 (2020), 622-623. https://doi.org/10.1109/MSN50589.2020.00101
[17]	A. Chaturvedi, N. Srivastava, V. Shukla, A Secure wireless communication protocol using Diffie-Hellman key exchange, Int. J. Comput. Appl., 126 (2015), 126-132. https://doi.org/10.5120/ijca2015906060 doi: 10.5120/ijca2015906060
[18]	J. Athena, V. Sumathy, Survey on public key cryptography scheme for securing data in cloud computing, Circuits Syst., 8 (2017), 77-92. https://doi.org/10.4236/cs.2017.83005 doi: 10.4236/cs.2017.83005
[19]	J. L. Herrera, J. J. Bravo, C. A. Gómez, Curious generalized Fibonacci numbers, Mathematics, 9 (2021), 2588-2598. https://doi.org/10.3390/math9202588 doi: 10.3390/math9202588
[20]	M. Akbiyik, J. Alo, On third-order bronze Fibonacci numbers, Mathematics, 9 (2021), 2606-2612. https://doi.org/10.3390/math9202606 doi: 10.3390/math9202606
[21]	D. Eridani, E. D. Widianto, Performance of sensors monitoring system using raspberry Pi through MQTT protocol, in 2018 International Seminar on Research of Information Technology and Intelligent Systems (ISRITI), 2018 (2018), 587-590. https://doi.org/10.1109/ISRITI.2018.8864473
[22]	N. Tantitharanukul, K. Osathanunkul, K. Hantrakul, P. Pramokchon, P. Khoenkaw, MQTT-Topics management system for sharing of open data, in 2017 International Conference on Digital Arts, Media and Technology (ICDAMT), 2017 (2017), 62-65. https://doi.org/10.1109/ICDAMT.2017.7904935
[23]	R. Bryce, T. Shaw, G. Srivastava, MQTT-G: A publish/subscribe protocol with geolocation, in 2018 41st International Conference on Telecommunications and Signal Processing (TSP), 41 (2018), 1-4. https://doi.org/10.1109/TSP.2018.8441479
[24]	F. Chen, Y. Huo, K. Liu, W. Tang, J. Zhu, Z. Sui, A study on MQTT node selection, in 2020 16th International Conference on Mobility, Sensing and Networking (MSN), 16 (2020), 622-623. https://doi.org/10.1109/MSN50589.2020.00101
[25]	G. Y. Lee, S. H. Cho, The generalized pascal matrix via the generalized Fibonacci matrix and generalized pell matrix, Korean Math. Soc., 45 (2018), 479-491. https://doi.org/10.4134/JKMS.2008.45.2.479 doi: 10.4134/JKMS.2008.45.2.479
[26]	S. Chen, W. Zhu, The general term and property of the five order Fibonacci series, Hainan Daxue Xuebao, 2014 (2014), 241-244.
[27]	X. Xie, Discussion and application of Fibonacci matrix, Sci. Technol. Inf., 24 (2008), 2-7.
[28]	L. Peng, Properties and applications of third-order Fibonacci sequence, J. Putian Univ., 5 (2006), 5-8.
[29]	Z. Chen, Q. Li, Improved PBFT consensus mechanism based on K-medoids, Comput. Sci., 46 (2019), 101-107.
[30]	F. Chao, Z. Quan, J. T. Chao, A reliable Diffie-Hellman key exchange protocol automatic proof, J. Commun., 2011 (2011), 119-123.
[31]	S. Pohlig, M. Hellman, An improved algorithm for computing logarithm over GF(p) and its Cryptographic significance, IEEE Trans. Inf. Theory, 1998 (1998), 458-471. https://doi.org/10.1109/TIT.1978.1055817 doi: 10.1109/TIT.1978.1055817
[32]	P. Kocher, Timing attacks on implementations of Diffie-Hellman, RSA DSS and other systems, Adv. Cryptology, 1996 (1996), 104-113. https://doi.org/10.1007/3-540-68697-5_9
[33]	M. Chen, A composable authentication key exchange scheme with post-quantum forward secrecy, J. Comput. Res. Dev., 57 (2020), 2158-2176.
[34]	S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system, 2008. Available from: https://bitcoin.org/bitcoin.pdf.
[35]	Y. Yuan, F. Wang, Development status and prospect of blockchain technology, J. Autom., 4 (2016), 481-494.
[36]	A. E. Aadroul, Y. Manevich, Hyperledger fabric: a distributed operating system for permissioned blockchains, in Proceedings of the thirteenth EuroSys conference, (2018), 1-15. https://doi.org/10.1145/3190508.3190538
[37]	A. Dorri, S. Kanhere, R. Jurdak, Blockchain for IoT security and privacy: The case study of smart home, in 2017 IEEE International Conference on Pervasive Computing and Communications Workshops, (2017), 5-17. https://doi.org/10.1109/PERCOMW.2017.7917634
[38]	D. Magazzeni, P. McBurney, W. Nash, Validation and verification of smart contracts: Are search agenda, Computer, 9 (2017), 50-57. https://doi.org/10.1109/MC.2017.3571045 doi: 10.1109/MC.2017.3571045
[39]	M. Castro, B. Liskov, Practical Byzantine fault tolerance and proactive recovery, ACM Trans. Comput. Sys., 20 (2002), 398-161. https://doi.org/10.1145/571637.571640 doi: 10.1145/571637.571640
[40]	W. Zhou, M. Long, Secure transmission scheme of environmental monitoring data based on blockchain, Comput. Sci., 47 (2020), 315-320.
[41]	J. Fan, Y. Li, W. Wu, Y. Feng, Base station dynamic ring information monitoring system based on dual blockchain, Comput. Sci., 46 (2019), 155-164.
[42]	S. Figueroa-Lorenzo, J. Añorga Benito, S. Arrizabalaga, Modbus access control system based on SSI over hyperledger Fabric blockchain, Sensors, 21 (2021), 5438. https://doi.org/10.3390/s21165438 doi: 10.3390/s21165438

This article has been cited by:

1.	Sakorn Mekruksavanich, Anuchit Jitpattanakul, RNN-based deep learning for physical activity recognition using smartwatch sensors: A case study of simple and complex activity recognition, 2022, 19, 1551-0018, 5671, 10.3934/mbe.2022265
2.	Keruo Jiang, Zhen Huang, Xinyan Zhou, Chudong Tong, Minjie Zhu, Heshan Wang, Deep belief improved bidirectional LSTM for multivariate time series forecasting, 2023, 20, 1551-0018, 16596, 10.3934/mbe.2023739

Reader Comments

Your name:*

Email:*
© 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)