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
Process of generating print pi from ri.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4226180&req=5

fig2: Process of generating print pi from ri.

Mentions: The selecting process of regular expression “a[bc]d : [bc]” with five atoms is shown in Figure 2. The parameter β = 256 is the boundary we define and the expression size of every print should be less than β. The selecting stage begins from the first atom. The curr pointer keeps moving to the next atom if ES(r) value of the regular expression print between the begin pointer and end pointer until the curr pointer arrives at the fourth atom “·”, ES(a[bc]d:) = 1∗2∗1∗256 = 512 > β. Condition ES(r) < β does not hold, and print a[bc]d is selected. Then a directed line from ri to Pi to mark the correlation relationship is constructed. Then, in step 2, it is included in the already selected print “a[bc]d”, although [bc]d satisfies the condition. According to section A, a[bc]d has higher matching probability (MP) than [bc]d; thus, [bc]d is not selected. The same criteria are processed in steps 3, 4, and 5 to select print.


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)

Process of generating print pi from ri.
© Copyright Policy - open-access
Related In: Results  -  Collection

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

fig2: Process of generating print pi from ri.
Mentions: The selecting process of regular expression “a[bc]d : [bc]” with five atoms is shown in Figure 2. The parameter β = 256 is the boundary we define and the expression size of every print should be less than β. The selecting stage begins from the first atom. The curr pointer keeps moving to the next atom if ES(r) value of the regular expression print between the begin pointer and end pointer until the curr pointer arrives at the fourth atom “·”, ES(a[bc]d:) = 1∗2∗1∗256 = 512 > β. Condition ES(r) < β does not hold, and print a[bc]d is selected. Then a directed line from ri to Pi to mark the correlation relationship is constructed. Then, in step 2, it is included in the already selected print “a[bc]d”, although [bc]d satisfies the condition. According to section A, a[bc]d has higher matching probability (MP) than [bc]d; thus, [bc]d is not selected. The same criteria are processed in steps 3, 4, and 5 to select print.

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