A wireless sensor network consists of many wireless sensor nodes that work together. Since communication between nodes depends on routing protocol, a portion of the required energy is consumed by periodic routing protocol or flooding. This research shows that the routing overhead can be reduced by making a virtual B-Tree topology out of these nodes through utilizing the characteristics of both a wireless network and a B-Tree, and thus the network can perform a self-routing characteristic. As soon as the topology is organized, paths between peers come out, and there is no need to wait to find path. During forwarding packets, the nodes can transmit packets through a better path. The results indicate that 35 unit times are required to organize 100 randomly deployed nodes and do not need periodic routing messages.