|
|
Research on reference nodes placement and selection of ubiquitous computing locating service |
ZHAO Hai1, ZHANG Wenbo1, YIN Zhenyu1, ZHAO Ming1, SUN Peigang2 |
1.School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; 2.School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; Shenyang Artillery Academy, Shenyang 110162, China; |
|
|
Abstract Obtaining the location of an unknown node accurately is a key problem of a locating service under a ubiquitous computing environment. The paper proposes and proves three theorems of location reference node placement according to the analysis of the location error produced during location using a polygon location method and three important characteristics of chaos dynamics. Based on the three theorems, the location reference node selection (LRNS) algorithm is proposed by improving on the traditional polygon location algorithm. The simulation results indicate that the reference node placement theorems and the LRNS algorithm can meet the requirements of a ubiquitous terminal s real-time location and possess a preferable precision in location.
|
Issue Date: 05 March 2007
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|