Relative relation discovery in sensor networks

• Main Authors: Shih-wei Hung, 洪士為
• Other Authors: Tien-Ruey Hsiang
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/79738386637890833587

碩士 === 國立臺灣科技大學 === 資訊工程系 === 96 === It is often useful to know the geographic positions of nodes in a commu- nications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. We present an algorithm that uses connectivity information: who is within communications range of whom, to derive the rel- ative relation of the nodes in the network. The method can take advantage of additional information, such relative neighbourhood graph, if it is available. Di?erent fromordinary position algorithmwith nodes of known coordinates, the position method without sensors of known nodal coordinates is just in its beginning status. So far as we know, the existed related algorithms all focus on measuring distance to estimate relative relation of sensors. In this thesis, we propose a technique that uses RSS and Voronoi diagram to derive the relative relation of the nodes in the network. The integration of these two methods is to estimate connectivity between sensor nodes. We try to get a more ideal result. All details are explained on following pages.