東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A map-growing localization algorithm...

Li, Xiaoli.

FindBook

Google Book

Amazon

博客來

A map-growing localization algorithm for ad-hoc sensor networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A map-growing localization algorithm for ad-hoc sensor networks./
作者:	Li, Xiaoli.
面頁冊數:	36 p.
附註:	Source: Masters Abstracts International, Volume: 42-04, page: 1289.
Contained By:	Masters Abstracts International42-04.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1418044

A map-growing localization algorithm for ad-hoc sensor networks.
Li, Xiaoli.

A map-growing localization algorithm for ad-hoc sensor networks. - 36 p.

Source: Masters Abstracts International, Volume: 42-04, page: 1289.

Thesis (M.S.)--University of Missouri - Columbia, 2003.

The goal of this thesis research is to create a new algorithm for sensor network localization. Localization is an important process in deploying ad-hoc wireless sensor networks. Several localization algorithms have been developed. However, they do not achieve satisfactory performance on irregularly-shaped networks. In this thesis, I present a localization algorithm based on an idea of growing local maps. The simulation results show that this algorithm achieves better performance for well-connected but irregularly-shaped networks or networks with obstacles blocking connections between a node and some other nodes within its radio range. Compared with the popular localization algorithm APS [1], the map-growing algorithm is more accurate for C-shaped grid or hexagon networks with acceptable coverage (>%75) when the range error is less than or equal to 5%R, where R is the radio range.Subjects--Topical Terms:

626642
Computer Science.

A map-growing localization algorithm for ad-hoc sensor networks.
LDR:01697nmm 2200253 4500 001 1864758
005 20041216132644.5
008 130614s2003 eng d
035 $a (UnM)AAI1418044
035 $a AAI1418044
040 $a UnM $c UnM
100 1 $a Li, Xiaoli. $3 1952231
245 1 2 $a A map-growing localization algorithm for ad-hoc sensor networks.
300 $a 36 p.
500 $a Source: Masters Abstracts International, Volume: 42-04, page: 1289.
500 $a Supervisor: Hongchi Shi.
502 $a Thesis (M.S.)--University of Missouri - Columbia, 2003.
520 $a The goal of this thesis research is to create a new algorithm for sensor network localization. Localization is an important process in deploying ad-hoc wireless sensor networks. Several localization algorithms have been developed. However, they do not achieve satisfactory performance on irregularly-shaped networks. In this thesis, I present a localization algorithm based on an idea of growing local maps. The simulation results show that this algorithm achieves better performance for well-connected but irregularly-shaped networks or networks with obstacles blocking connections between a node and some other nodes within its radio range. Compared with the popular localization algorithm APS [1], the map-growing algorithm is more accurate for C-shaped grid or hexagon networks with acceptable coverage (>%75) when the range error is less than or equal to 5%R, where R is the radio range.
590 $a School code: 0133.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Missouri - Columbia. $3 1017522
773 0 $t Masters Abstracts International $g 42-04.
790 1 0 $a Shi, Hongchi, $e advisor
790 $a 0133
791 $a M.S.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1418044