.png){kind=icon}
Return
A distributed query protocol in wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s11277-006-9152-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In wireless sensor networks, query execution over a specific geographical region is an essential function for collecting sensed data. However, sensor nodes deployed in sensor networks have limited battery power. Hence, the minimum number of connected sensor nodes that covers the queried region in a sensor network must be determined. This paper proposes an efficient distributed protocol to find a subset of connected sensor nodes to cover the queried region. Each node determines whether to be a sensing node to sense the queried region according to its priority. The proposed protocol can efficiently construct a subset of connected sensing nodes and respond the query request to the sink node. In addition, the proposed protocol is extended to solve the k-coverage request. Simulation results show that our protocol is more efficient and has a lower communication overhead than the existing protocol.
Keywords:
wireless sensor networks
coverage problem
query execution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.2
Papers:
742
Citations:
1.2W
Organization
No organization information available
Cited Papers
Tracking Hydroplasticization by DSC: Movement of Water Domains Bound to Poly(Meth)Acrylates during Latex Film Formation.png)
Polymers
OAAI
PolymersIF0
OAAIShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave
View more