Release Time:2019-03-11  Hits:

Indexed by:Journal Article

Date of Publication:2009-08-01

Journal:Journal of Information and Computational Science

Included Journals:Scopus、EI

Volume:6

Issue:4

Page Number:1723-1728

ISSN:15487741

Summary:Wireless sensor networks (WSNs) can be viewed as a distributed database. In order to detect event early and provide information and spatial query timely in WSNs, an efficient spatial-based event query processing algorithm called SEQP is proposed. In SEQP, sensor nodes that are near to the boundary of events are selected for monitoring. SEQP extends range nearest neighbor (RNN) query to select surrounding nodes and then to identify the gaps and it will select proper sensor nodes to enclose the event. An improved greedy-based SEQP algorithm called GSEQP is also proposed, which selects those are nearest neighbors to the event as surrounding nodes every time. Detailed experimental results and comparisons with existed RNN algorithm prove that the proposed SEQP and GSEQP algorithms outperforms in terms of time cost and average number of surrounding nodes selected. ? 2009 Binary Information Press.