| Summary: | 碩士 === 朝陽科技大學 === 網路與通訊研究所 === 97 === Wireless sensor network (WSN) consists large number of sensor nodes. The nodes collect the sensed data and transmit to the base station (BS) by wireless communication. When the sensor nodes are deployed, the batteries of sensor nodes are difficult to replace. Therefore, minimizing the energy consumption for maximizing the batteries lifetime becomes a key challenge to design the WSN protocols.
Cluster is the one of energy-efficient schemes for WSN. In the cluster scheme, several nodes are elected as cluster head (CH). And then CHs aggregate the data from the nodes of their respective cluster and forward the fusion data to BS. The most popular routing protocol based on cluster scheme is called LEACH, which is proposed for CH selection by probability. However, LEACH selects the CHs by probability in each round, the actual number of CHs with the expected number maybe different.
SGCH (Steady Group Clustering Hierarchy) is based on LEACH to improve the CH selection algorithm by grouping the nodes. In SGCH, the number of groups is equal to the number of expected CHs and the energy of each group is the same to balancing the energy load of WSN. But the initial energy of groups in SGCH are the same, therefore the nodes of farther group from BS be die soon. Because of the energy consumption in WSN is relation to the transmission distance, which nodes cost more energy to transmit the data for farther distance.
In this paper, we propose a method to improve the grouping algorithm for SGCH. We consider the ration of energy for groups is according to the distance of each group between BS. So, the farther group from BS has more initial energy to balance the energy load of group in WSN.
Finally, we simulate the propose method to compare LEACH, SGCH and other protocols in different environment of WSN. The simulation results show that our propose method is better than other protocols and more suitably for heterogeneous WSN
|
|---|
