Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Ruei-Hong Yan"'
Autor:
Ruei-Hong Yan, 顏瑞宏
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,
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,
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/10094908362373064017
Publikováno v:
Materials
Volume 16
Issue 4
Pages: 1667
Volume 16
Issue 4
Pages: 1667
We report on the design of an attached guard ring (AGR) and a floating guard ring (FGR) in a planar separate absorption, grading, charge, and multiplication In0.53Ga0.47As/InP avalanche photodiode to prevent premature edge breakdowns. The depths of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdd261919c602e76ff9f9357450e6f76
https://doi.org/10.3390/ma16041667
https://doi.org/10.3390/ma16041667
Publikováno v:
ICSNC
A new distributed algorithm, called Crystal-Lattice Permutation (CLP) algorithm, is devised to approach the coverage problem in wireless sensor networks. All nodes are assumed as mobile and run the same CLP algorithm in . An initial seed triggers six
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28d1938711b244377f0ec8831d6e68db
https://doi.org/10.1109/icsnc.2006.53
https://doi.org/10.1109/icsnc.2006.53
Publikováno v:
2006 International Conference on Systems & Networks Communications (ICSNC'06); 2006, p42-42, 1p