Search-Tree-Based Routing Algorithm on Wireless Sensor Networks

• Main Authors: Zhone-Chen Shu, 許仲辰
• Other Authors: Li-Der Chou
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/39216396216847683849

碩士 === 國立中央大學 === 資訊工程學系碩士在職專班 === 93 === For the progress in processing, memory, and radio techniques, sensor nodes with the integration of sensing, wireless communication, and computation have been developed. The network of such nodes can be coordinated to sense specific environmental phenomena such as thermo, light, and sound, etc. In this paper, a routing algorithm based on search tree is proposed to achieve efficient and real-time coordination. In general, the routing algorithm for sensor networks sends first query message from the sender to the data source node by flooding, for the lack of the location of the data source. Once the data source receives a message from the sender, the location information is generated in the sensor nodes among the sender and the data source. The data source then sends back the data with the location information to the sender. The proposed routing algorithm is able to support real-time transmissions for sensor networks. First, the tree-based sensor network is constructed. Then, a unique address is assigned to each node to build the tree as search tree. With the search tree architecture and the address assignment, sensor nodes decide the next hop for a message by node’s address information. The proposed routing algorithm does not need to build up location information for each message transmission from the source node to the sender and thus messages can be delivered efficiently. In the simulation, the proposed algorithm performs well in both different network size and workload. The proposed algorithm is also implemented in the automatic parking system which is an application designed in sensor network.