Deployment method for wireless sensor networks on weighted fields

Authors:
Wei-Chei Ko;Ying-Chin Chao;Ming-Jer Tsai
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsing Chu, Taiwan, ROC;Department of Computer Science, National Tsing Hua University, Hsing Chu, Taiwan, ROC;Department of Computer Science, National Tsing Hua University, Hsing Chu, Taiwan, ROC
Venue:
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Year:
2006

Citing 7
Cited 0

An Incremental Self-Deployment Algorithm for Mobile Sensor Networks

Autonomous Robots
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)
Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks

IEEE Transactions on Computers
Soft Tamper-Proofing via Program Integrity Verification in Wireless Sensor Networks

IEEE Transactions on Mobile Computing
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The deployment of sensors on a given field is an important issue that affects wireless sensor networks. Traditionally, all areas of a sensor field are equivalent, and multiple deployment algorithms are used to maximize the area covered by a given number of sensors or a certain budget. However, in many applications, such as fire control system, battlefield surveillance, detection of nuclear, biological, or chemical (NBC) attack, and other things, the areas must be weighted based on priority of deployment: the more critical the area, the higher the weight and the higher the priority. In this paper, we introduce the problem of the weighted field sensor: and determine the maximum weight of the coverage area by deploying a given number of sensors on a given weighted field. Then an algorithm is proposed to find a near-optimal solution for the weighted field sensor covering problem.