We present a distributed energy-efficient routing algorithm — local neighborhood broadcast routing (LNBR) algorithm. LNBR use a local scanner to scan all one node's neighborhoods. The nodes need only to know its neighborhoods in its transmission range instead of the whole topology information in as hoc networks. LNBR maintain a minimal energy routing in which nodes visited by scanner until find the destination node. The nodes compare the energy cost and select the smaller energy consumption routing when the same identification scanner reaches it. Furthermore, LNBR let the node send the scanner exceeding one time. When scanner reach one node's all neighborhoods, the neighborhoods can forward it to their own neighborhoods, this will make the LNBR distribute in ad hoc network. In the end, we compare our algorithm to other algorithms, the results show that better network performance may be achieved according to LNBR and the minimal energy consumption routing can be find. The correlative conclusion and future research work are given.