Area coverage based domain division in wireless sensor network

Authors:
Bao Xi-Rong;Sun Xue-Yun;Zhang Shi;Zhang Xue-Feng
Affiliations:
School of Information Science and Engineering, Northeastern University, Shenyang, China;Institute of System Science and Engineering, Northeastern University, Shenyang, China;School of Information Science and Engineering, Northeastern University, Shenyang, China;Institute of System Science and Engineering, Northeastern University, Shenyang, China
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Year:
2009

Citing 10
Cited 0

Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
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
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

IEEE Transactions on Computers
Sensor deployment and target localization in distributed sensor networks

ACM Transactions on Embedded Computing Systems (TECS)
A Coverage and Connectivity Method to Cluster Topology in Wireless Sensor Networks

AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete

IEEE Transactions on Computers
Review: Coverage and connectivity issues in wireless sensor networks: A survey

Pervasive and Mobile Computing
Wireless sensor network survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless Sensor Networks for Cultural Property Protection

AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
Unreliable sensor grids: coverage, connectivity and diameter

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless sensor networks (WSNs), extending networks lifetime is one of the fundamental and important issues. One of the ways is to choose the fewest number of sensors and maintains the coverage of domain. In this paper a new way of dividing domain into regular hexagon is presented, which is the dividing domain algorithms (DDA). And the simple procedure runs in a short time and the coverage sensor number is not larger than the procedure. At last, the simulation verifies the procedure is better than the other procedures.