Limits...
Based on regular expression matching of evaluation of the task performance in WSN: a queue theory approach.

Wang J, Cui K, Zhou K, Yu Y - ScientificWorldJournal (2014)

Bottom Line: Due to the limited resources of wireless sensor network, low efficiency of real-time communication scheduling, poor safety defects, and so forth, a queuing performance evaluation approach based on regular expression match is proposed, which is a method that consists of matching preprocessing phase, validation phase, and queuing model of performance evaluation phase.Experiments show that our approach ensures accurate matching and computational efficiency of more than 70%; it not only effectively detects data packets and access control, but also uses queuing method to determine the parameters of task scheduling in wireless sensor networks.The method for medium scale or large scale distributed wireless node has a good applicability.

View Article: PubMed Central - PubMed

Affiliation: School of Software Technology, Dalian University of Technology, Dalian 116620, China.

ABSTRACT
Due to the limited resources of wireless sensor network, low efficiency of real-time communication scheduling, poor safety defects, and so forth, a queuing performance evaluation approach based on regular expression match is proposed, which is a method that consists of matching preprocessing phase, validation phase, and queuing model of performance evaluation phase. Firstly, the subset of related sequence is generated in preprocessing phase, guiding the validation phase distributed matching. Secondly, in the validation phase, the subset of features clustering, the compressed matching table is more convenient for distributed parallel matching. Finally, based on the queuing model, the sensor networks of task scheduling dynamic performance are evaluated. Experiments show that our approach ensures accurate matching and computational efficiency of more than 70%; it not only effectively detects data packets and access control, but also uses queuing method to determine the parameters of task scheduling in wireless sensor networks. The method for medium scale or large scale distributed wireless node has a good applicability.

Show MeSH
Matching process of ad hoc packages.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4226180&req=5

fig3: Matching process of ad hoc packages.

Mentions: The package matching process is demonstrated in Figure 3. Taking the limited computing power of each wireless node into consideration, the calculation of F(gi; p[1;…;m]) is simplified to be addition only. At first, the feature vector pi needs to be stored so that the sum of pi can be calculated to get F(gi; p[1;…;m]). The profiteered correlation sequence p[1⋯m] will be generated in node 2 after profiteering stage in node 1. Then, if p[1⋯m] is not empty, the F(gi; p[1;…;m]) is calculated in node 2 by adding the feature vector pi. Verifying process will continue in node 2 using the group gi in its memory when F(gi; p[1;…;m]) is larger than ψ. Otherwise, the package will be transmitted to the next hop and gj will be matched continually.


Based on regular expression matching of evaluation of the task performance in WSN: a queue theory approach.

Wang J, Cui K, Zhou K, Yu Y - ScientificWorldJournal (2014)

Matching process of ad hoc packages.
© Copyright Policy - open-access
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4226180&req=5

fig3: Matching process of ad hoc packages.
Mentions: The package matching process is demonstrated in Figure 3. Taking the limited computing power of each wireless node into consideration, the calculation of F(gi; p[1;…;m]) is simplified to be addition only. At first, the feature vector pi needs to be stored so that the sum of pi can be calculated to get F(gi; p[1;…;m]). The profiteered correlation sequence p[1⋯m] will be generated in node 2 after profiteering stage in node 1. Then, if p[1⋯m] is not empty, the F(gi; p[1;…;m]) is calculated in node 2 by adding the feature vector pi. Verifying process will continue in node 2 using the group gi in its memory when F(gi; p[1;…;m]) is larger than ψ. Otherwise, the package will be transmitted to the next hop and gj will be matched continually.

Bottom Line: Due to the limited resources of wireless sensor network, low efficiency of real-time communication scheduling, poor safety defects, and so forth, a queuing performance evaluation approach based on regular expression match is proposed, which is a method that consists of matching preprocessing phase, validation phase, and queuing model of performance evaluation phase.Experiments show that our approach ensures accurate matching and computational efficiency of more than 70%; it not only effectively detects data packets and access control, but also uses queuing method to determine the parameters of task scheduling in wireless sensor networks.The method for medium scale or large scale distributed wireless node has a good applicability.

View Article: PubMed Central - PubMed

Affiliation: School of Software Technology, Dalian University of Technology, Dalian 116620, China.

ABSTRACT
Due to the limited resources of wireless sensor network, low efficiency of real-time communication scheduling, poor safety defects, and so forth, a queuing performance evaluation approach based on regular expression match is proposed, which is a method that consists of matching preprocessing phase, validation phase, and queuing model of performance evaluation phase. Firstly, the subset of related sequence is generated in preprocessing phase, guiding the validation phase distributed matching. Secondly, in the validation phase, the subset of features clustering, the compressed matching table is more convenient for distributed parallel matching. Finally, based on the queuing model, the sensor networks of task scheduling dynamic performance are evaluated. Experiments show that our approach ensures accurate matching and computational efficiency of more than 70%; it not only effectively detects data packets and access control, but also uses queuing method to determine the parameters of task scheduling in wireless sensor networks. The method for medium scale or large scale distributed wireless node has a good applicability.

Show MeSH