The importance of wireless ad hoc networks in community and commercial connectivity cannot be underestimated in view of the benefits associated with such networks. An ad hoc network must assemble itself from any devices that happen to be nearby, and adapt as devices move in and out of wireless range. High levels of self-organization will minimize the need for manual configuration. However, efficiently providing unique addresses in ad hoc networks is still an open research question. The goal of this paper was to develop algorithms for address auto-configuration. The paper addresses the following among other problems: Achieving high levels of address uniqueness without compromising on latency and communication overhead. The proposed protocol uses bloom filters to reduce the storage overhead and remove communication overhead.