| Summary: | 碩士 === 玄奘大學 === 資訊科學學系碩士班 === 96 === Wireless sensor network is composed of many micro-sensor nodes deployed in a large area which can monitor and collect data. After the data is collected, sensor nodes send it to the base-station using a certain multi-hop routing protocol.
Wireless sensor route maintain protocol plays a very important role when the path was broken. A good maintaining protocol provides a mechanism for route path repairing, so data can be delivered to sinks successfully.
In this thesis, we construct a routing tree rooted in the sink. Each node in the routing tree forwards data to its upstream node, and the data can be delivered to the sink finally. When a sensor node fails, all of its downstream nodes have to be reassigned to other upstream nodes. If too many nodes are assigned to an upstream node, the upstream node will deplete its energy quickly and die. When the sensor nodes are equipped with neither GPS equipments nor power control components, we use M-ary tree to maintain the routing tree effectively. In addition, we try to equalize the degrees of nodes by using color notations.
With the simulation results, we find that the routing trees maintained by the proposed protocol would shorten the length of paths and decrease the degree of nodes in average.
|
|---|
