Wireless Sensor Network Data Storage Strategy Study

Wireless sensor network is a data-centric self-organizing network, users are interested in the data that generated by sensor networks, rather than a single sensor or sensor network itself. Therefore the research of Wireless sensor network database has important theoretical and practical significance. .In this paper, the research is mainly for TinyDB's data storage strategy. TinyDB system is a typical database of wireless sensor network database, Semantic routing tree as the TinyDB system storage strategies need to maintain a specific route structure, which will certainly add some extra data manipulation. This paper presents a red-black tree based storage strategy, as an organizational structure of TinyDB system, this red-black tree need not to maintain a specific route structure, but only requires nodes to achieve some balance, so it reduces the requirements on the node operation. For a red-black tree, all operations including adding, deleting, querying, and modifying, which need O (logn)'s time. With the increasing of the number of nodes, the tree can offer high-speed data manipulation, which improves the operational performance of the TinyDB.Finally, this paper establishes TinyDB system model which is based on red-black tree, and test the operation performance of data insertion, deletion, querying through this model. The experimental results show that the operational performance of TinyDB system based on red-black tree is better than the semantic routing tree storage strategy.