Efficient path setup and recovery in wireless sensor networks by using the routing table

Interest for wireless sensor networks has being increased in ubiquitous environment. In wireless sensor networks, each node sets up self-organization network, transfer the sensing data to sink node. Sensor nodes that compose sensor network are small size, and their battery capacity is limited. So, each node also imposes a constraint on search and recovery of data-path. In this paper, we designed a method to build data-path, considering restrictive features of a sensor node. Each node uses the routing table which consists of state information of a node and neighbors, to set up the data-path. Using the routing table, they can efficiently transfer the sensing data from each node to a sink.