A Study on High-Performance Data Aggregation with Data Correlate-Based Routing Protocols in wireless Sensor Networks

• Main Authors: Yung-Ting Chang, 張詠庭
• Other Authors: Pi-rong Sheu
• Format: Others
• Language: zh-TW
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/75471970097890264078

碩士 === 國立雲林科技大學 === 電機工程系碩士班 === 93 === The wireless sensor networks are quite popular in recent years. The rapid progress of the sensor technology promotes the vigorous development of the wireless sensor networks. The wireless sensor networks are generally used in lots of applications of different fields, like the military of the national defense, the habitat monitoring of animals and plants, and the consumer applications. Though the wireless sensor networks can offer many valuable applications, it still suffers many problems needed to be overcome. One of the most important problems is how to transmit those detected data to the base station more efficiently in the wireless sensor networks. The data transmission mode in the wireless sensor networks can be divided into four types: (1) tree-based (2) chain-based (3) mobile agent-based and (4) cluster-based. Among them, besides the mobile agent-based, they all transmit data of sensors in the networks to the base station. This data transmission method may cause the reiterations of the same area in the higher density networks. That result in the power consuming and the network lifetime decreasing indirectly. In this thesis, we utilize the characteristic that the reiteration data detected by different sensors must have certain correlation to decrease the data repetitions in the base station and use it to improve the ordinary cluster-based data transmission. As we know, the traditional cluster-based mode utilizes the clusterhead to collect all data detected from sensors then transmit to the base station. However, in our proposed method, we only use one cluseterhead which changes each time to detect the information in this cluster and transmit to the base station. In this way, we could avoid the data redundency in the high density networks, reduce the power consuming and collecting time of the clusterhead, and prolong the lifetime of networks. For the above issue, we try to make a comparison by solving it with the heuristic algorithm, the genetic algorithm, and the mixed-integer programming. The comparison result shows that though the heuristic algorithm does not have a optimal solution like what is obtained by the mixed-integer programming, it still can find a feasible one. However when we compare the heuristic algorithm with the method proposed by [WRBIVQC04], we can find that the heuristic algorithm can have longer data transmission distance among sensors in the network. It indicates that these sensors can detect more extensive data from the target than the mobile agent-based method which help the base station to receive less reiterated data.