Summary: | 碩士 === 國立交通大學 === 資訊科學與工程研究所 === 105 === There are a lot of diverse applications in wireless sensor networks (WSNs). Requirements of these applications might be quite different. How to select the best neighbor to be the preferred parent will greatly affect the performance of final network topology. Most of the devices are battery-powered in wireless sensor networks, thus energy efficiency is a key issue in WSN. In this thesis, we proposed an objective function, Highly Adjustable Dual Thresholds Object Function (HADTOF), which accounts energy consumption and link quality to be the main factor and the second factor, respectively for routing decision. In our proposed scheme, we classify each routing metric to multiple levels and in each level we can use different rank calculation formula to calculate the rank increment value. In this rank calculation mechanism, when the quality of a specified routing metric becomes poor, we will add a penalty value to make the candidate parent become worse than the others. And the rank increment of each routing metric will accumulate to reflect the comprehensive score of the candidate parent. With this mechanism, we can quickly adjust our objective function to make it appropriate to another different application. (No matter adding a new routing metric or adjusting the original routing metric considerations to avoid some situations which must be avoided in the routing path.) Finally, we evaluate the performance of our proposed scheme by simulation and compare it with OF0 and MRHOF. The result shows that our approach can extend network lifetime substantially while still keep high delivery ratio and low end-to-end delay.
|