By Topic

Optimal movement-assisted sensor deployment and its extensions in 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

2 Author(s)
Jie Wu ; Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL ; Shuhui Yang

In wireless sensor networks (WSNs), a good sensor deployment method is vital to the quality of service (QoS) provided by WSNs. This QoS depends on the coverage of the monitoring area. In WSNs with locomotion facilities, sensors can move around and self-deploy to ensure coverage and load balancing. In SMART by J. Wu and S. Yang (2005), various optimization problems are defined to minimize different parameters. In this paper, we focus on minimizing total moving distance and propose an optimal, but centralized solution, based on the Hungarian method. We then propose several efficient, albeit non-optimal, distributed solutions based on the scan-based solution by J. Wu and S. Yang (2005). Extensive simulations have been done to verify the effectiveness of the proposed solutions

Published in:

Parallel and Distributed Systems, 2006. ICPADS 2006. 12th International Conference on  (Volume:1 )

Date of Conference:

0-0 0