A localization algorithm with learning-based distances for wireless Ad-Hoc sensor network

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 532
  • Download : 0
This thesis describes a new localization algorithm for multi-hop ad-hoc sensor networks. Existing localization algorithms, which use either range-free or range-based information, have the problem that they can work appropriately only in their preferred sensor network environments with either high or low distance measurement error. The working environment, however, may change unpredictably from time to time or from applications to applications, making the existing algorithm unsatisfactory for applications that require localization. To solve the problem, we propose a supervised loaming-based approach in which we define a distance function and a learning-based distance localization algorithm. Through simulation, we show that by more efficiently using available information, our algorithm, which has competitive overheads, produces more accurate positions than existing works. This thesis also introduces an extension of the localization algorithm for an Evolvable Sensor Network. We first examine the requirements that a localization algorithm must satisfy to work efficiently and effectively in the network. An extension of the localization algorithm is then proposed. The simulation results show that it works appropriately.
Advisors
Kim, Dae-Youngresearcher김대영researcher
Description
한국정보통신대학교 : 공학부,
Publisher
한국정보통신대학교
Issue Date
2005
Identifier
392468/225023 / 020034584
Language
eng
Description

학위논문(석사) - 한국정보통신대학교 : 공학부, 2005, [ vi, 41 p. ]

Keywords

Algorithm; Location Finding; Sensor Network; Localization

URI
http://hdl.handle.net/10203/55329
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392468&flag=dissertation
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0