By Topic

Search-Oriented Deployment Strategies for Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jiun-Jian Chang ; Dept. of Comput. Sci. & Inf. Eng., National Taiwan Univ., Taipei ; Pi-Cheng Hsiu ; Tei-Wei Kuo

Wireless sensor networks have been widely considered as an effective tool in various application domains. One of the major implementation issues is on the network deployment problem. In this paper, we target issues in the deployment of wireless sensor nodes in three-dimensional indoor environments and with irregular radiation patterns for both message communicating and sensing. Our objective is to develop a more effective way to deploy sensor networks and to minimize the number of deployed nodes. We propose several search-oriented strategies to improve the performance of search algorithms, such as simulated annealing. The capability of the proposed strategies is demonstrated by real-case studies in the deployment of sensor networks in several office flats

Published in:

Object and Component-Oriented Real-Time Distributed Computing, 2007. ISORC '07. 10th IEEE International Symposium on

Date of Conference:

7-9 May 2007