Show simple item record

dc.contributor.authorYamparala, Sri Harsha
dc.description.abstractMovement 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.en_US
dc.publisherNorth Dakota State Universityen_US
dc.rightsNDSU policy 190.6.2en_US
dc.titleMobile Sensor movement using Simulated Annealingen_US
dc.typeMaster's Paperen_US
dc.date.accessioned2024-05-07T20:14:45Z
dc.date.available2024-05-07T20:14:45Z
dc.date.issued2009
dc.identifier.urihttps://hdl.handle.net/10365/33809
dc.subject.lcshWireless sensor networks.en_US
dc.subject.lcshSimulated annealing (Mathematics).en_US
dc.subject.lcshHeterogeneous computing.en_US
dc.rights.urihttps://www.ndsu.edu/fileadmin/policy/190.pdfen_US
ndsu.degreeMaster of Science (MS)en_US
ndsu.collegeScience and Mathematicsen_US
ndsu.departmentComputer Scienceen_US
ndsu.programComputer Scienceen_US
ndsu.advisorNygard, Kendall


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record