Summary: | 碩士 === 國立中正大學 === 通訊工程研究所 === 95 === In studies of wireless sensor networks (WSNs), routing in the network layer is an important topic. The performances of WSNs with different routing algorithms will be different. To date, many applications of WSNs have been developed for home automation. The networks in such applications are divided into many sectors for routing, e.g. relative direction-based sensor routing (RDSR). Although, such applications could simply reduce the number of routes as compared to the convention routing (CR) scheme, they have some disadvantages. In this thesis, we propose a less complex, more efficient routing algorithm with a longer lifetime. This algorithm not only solves the routing loop within the RDSR algorithm but also facilitates the direct selection of a shorter distance for routing by the sensor node; further, it saves energy and extends the lifetime of the nodes.
By employing our proposed routing algorithm, in the region of interest (ROI), we could extend the lifetime of the nodes that were far away from the manager nodes. We also propose a new energy-efficient algorithm for the nodes that are close to the manager nodes. This algorithm exploits a simple triangle rule to determine a node that can save more energy while relaying data between the transmitter and the receiver. This method could effectively economize the use of energy in near-sensor nodes to further extend the lifetime of the nodes. Finally, in the ROI, we combine two algorithms to form the enhanced relative identification and direction-based sensor routing (ERIDSR) algorithm.
Through simulation analyses, we verified that the lifetime, coverage, throughput and mean hops of our energy-efficient algorithm are better than those of the RDSR and CR algorithms. In addition, our proposed ERIDSR algorithm could save the total energy in near-sensor nodes more effectively. In the simulation analyses, we verified our methods to save energy efficiently, and hence achieved an algorithm that is less complex and uses energy more efficiently.
|