A Distributed Query Protocol in Wireless Sensor Networks

Authors:
Jang-Ping Sheu;Shin-Chih Tu;Chia-Hao Yu
Affiliations:
Department of Computer Science and Information Engineering, National Central University, Jhongli, Taiwan, R.O.C 32054;Department of Computer Science and Information Engineering, National Central University, Jhongli, Taiwan, R.O.C 32054;Department of Computer Science and Information Engineering, National Central University, Jhongli, Taiwan, R.O.C 32054
Venue:
Wireless Personal Communications: An International Journal
Year:
2007

Citing 9
Cited 2

Embedding the Internet: introduction

Communications of the ACM
Wireless integrated network sensors

Communications of the ACM
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Connected sensor cover: self-organization of sensor networks for efficient query execution

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Efficient broadcasting protocols for regular wireless sensor networks: Research Articles

Wireless Communications & Mobile Computing
Location tracking in a wireless sensor network by mobile agents and its data fusion strategies

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks

Minimum perimeter coverage of query regions in a heterogeneous wireless sensor network

Information Sciences: an International Journal
Minimum connected cover of a query region in heterogeneous wireless sensor networks

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.