As MANETs have limited bandwidth, it is important to reduce the number of routing packets exchanged to maintain the routing state information. To reduce the number of control packets, some expanding search algorithms limit the depth since they apply a network-wide dissemination. In this paper, two new expanding search algorithms are proposed to reduce the number of control packets. Our expanding search protocols are based on network-depth dissemination. The first algorithm is an optimal one, i.e. it only returns a route to the destination when it exists. The second algorithm is suboptimal, i.e. it doesn't always return a route to the destination but it uses low routing control information to find a route. Our algorithms significantly reduce routing control packets compared to the original AODV protocol. To show the efficiency of our algorithms, we present simulations using NS-2.