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
Relationship between profiteering stage set and match items.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4226180&req=5

fig1: Relationship between profiteering stage set and match items.

Mentions: For instance, there is a regular expression set called R; another set R′ is constructed so that any unmatched item of R′ is also an unmatched item of R. An item that does not match any regular expression in the set [15] is unmatched item of a regular expression set. Given an item i, it will match against R′ to get set O(R′; i) firstly. If O(R′; i) is empty, it does not obviously match any member in R and therefore this item can be skipped safely; otherwise, matching it against T  (R; O(R′; i)) will continue, where O(R; i)⊆T  (R; O(R′; i))⊆R. Figure 1 shows the relationship between match items and print (R′). Because most items are unmatched and the match cost of R0 is much less than that of R, the overall throughput of this approach can be much higher than directly matching against R.


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)

Relationship between profiteering stage set and match items.
© Copyright Policy - open-access
Related In: Results  -  Collection

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

fig1: Relationship between profiteering stage set and match items.
Mentions: For instance, there is a regular expression set called R; another set R′ is constructed so that any unmatched item of R′ is also an unmatched item of R. An item that does not match any regular expression in the set [15] is unmatched item of a regular expression set. Given an item i, it will match against R′ to get set O(R′; i) firstly. If O(R′; i) is empty, it does not obviously match any member in R and therefore this item can be skipped safely; otherwise, matching it against T  (R; O(R′; i)) will continue, where O(R; i)⊆T  (R; O(R′; i))⊆R. Figure 1 shows the relationship between match items and print (R′). Because most items are unmatched and the match cost of R0 is much less than that of R, the overall throughput of this approach can be much higher than directly matching against R.

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