Dependable Crystal-Lattice Permutation (CLP) Algorithm in WSN

Autor:	Ruei-Hong Yan, 顏瑞宏
Rok vydání:	2005
Druh dokumentu:	學位論文 ; thesis
Popis:	93 In this thesis, we consider the coverage problem in wireless sensor networks. Each node is assumed to have the same mobility, sensing ability, communication ability, and battery. We use a greedy method to select proper mobile nodes as seeds, which trigger neighboring mobile nodes to exact positions. These nodes then become new seeds to trigger other nodes. The progressive process is named the Crystal-Lattice Permutation (CLP) algorithm. The Crystal-Lattice Permutation (CLP) algorithm is distributed, which means it doesn’t need to have all nodes’ positions. It obtains maximal coverage with minimal average moving distance. The process of handling faulty nodes during CLP algorithm’s operating is also discussed.
Databáze:	Networked Digital Library of Theses & Dissertations
Externí odkaz:	http://ndltd.ncl.edu.tw/handle/10094908362373064017 Zobrazit plný text záznamu