Date of Award

2009

Publisher

North Dakota State University

Document Type

Master's Paper

Degree Awarded

Master of Science (MS)

Program

Computer Science

Department

Computer Science

College

Science and Mathematics

Faculty Advisor

Nygard, Kendall

Description

Movement of mobile sensor nodes is an important aspect in wireless sensor networks, and there is considerable research underway into the design of mobile sensor movement algorithms for wireless sensor networks. Various mobile sensor movement algorithms have been proposed using different combinatorial optimization techniques such as Tahu Search, Ant Colony Optimization, and Genetic Algorithms. In this paper we present a mobile sensor movement Algorithm for Heterogenenous Sensor Networks using a Simulated annealing search technique. This paper also discusses the various factors that are taken into account while making a decision about the movement of a mobile sensor node in the event of a sensor node failure. With the help of Simulated annealing, a Movement Algorithm is proposed with an Annealing schedule that is suitable for Heterogeneous Sensor Networks, and its performance is evaluated for various sensor deployment scenarios in Heterogenenous Sensor Networks.

Rights

NDSU policy 190.6.2

Rights Link

https://www.ndsu.edu/fileadmin/policy/190.pdf

Handle Identifier

https://hdl.handle.net/10365/33809

Download

Share

COinS