| Summary: | 碩士 === 國立雲林科技大學 === 電機工程系碩士班 === 101 === Wireless Sensor/Mesh Networks (WSN/WMN) have high reliability, low cost, scalability and channel usage characteristics, such that scholars great importance to the internet technology more and more, it involves applications and that growing popularity; Clustering and connected dominating set (CDS) these two methods, which can establish a virtual backbone on the WSN/WMN. Clustering would divide node into their cluster, then choose the cluster head (CH). Cluster head is responsible for the data transfer between the clusters, this transfer can be one-hop or multi-hop. Each cluster and its neighbor nodes can form a dominating set (DS). Then when several bridge nodes are selected, the cluster head through the bridge nodes to connect with each other to form a connected dominating set. This paper explores two simple weakly connected dominating set (WCDS) algorithm on the wireless sensor / mesh network at first, which we call Choice-Neighbor algorithm, and Two-Hop algorithm. We discussed that divided the wireless sensor/mesh networks into several areas, let each area according to the above two algorithms to construct regional WCDS, and completed the interconnection regional WCDS. Then we added disjoint WCDS concept, which can find sets of connected dominating set in the network nodes. In order to extend wireless sensor/mesh networks lifetime, the operation of the network, can have a different virtual backbone(VB) to be used as replacement. Finally, we added the pruning concept, which would remove the unsuitable cluster head''s nodes, and then combined two simple algorithms of the previously mentioned and the disjoint concept to find sets of connected dominating set. This method is also to extend the wireless sensor/mesh networks lifetime.
|
|---|
