| Summary: | 碩士 === 國立中央大學 === 資訊工程學系 === 104 === To reduce the operational cost of wireless sensor networks, nding the optimal deployment pattern to achieve a given connectivity requirement with the minimum
number of sensor nodes is important. Although the optimal k-connectivity deployment pattern (k<=25) for 3-D wireless sensor networks have been studied, there is
yet to have a general framework in identifying the optimal k-connectivity deployment pattern for an arbitrary k value. In this thesis, we assume that sensor nodes are homogeneous and deployed over an very large area symmetrically. As a result, the Voronoi diagram of sensor nodes will be one of the symmetric space-lling convex polyhedra, i.e., cube and rhombic dodecahedron. An algorithm, called Bound and Search (BS), is proposed to compute the transmission radius required for sensor nodes to achieve k connectivity. By comparing the transmission radius and node density resulted from the cube and rhombic dodecahedron patterns, our algorithm is able to discovers the optimal k-connectivity deployment pattern in 3-D wireless sensor networks. Moreover, our results indicate that, other than a small range of k (i.e., 15 <= k <= 25 ), the rhombic dodecahedron pattern requires a smaller node density to achieve the same k-connectivity requirement when compared with the cube pattern.
|
|---|
