Party: Pastry-like multi-hop routing protocol for wireless self-organizing networks

In this paper we propose Party, a new routing protocol for wireless Self-Organizing Networks. This protocol is intended to be applied in environments with large number of nodes where the scalability of the routing protocols plays an important issue; it is well known that the current ad hoc routing protocols do not scale to work efficiently in networks of more than a few hundred nodes. In Party, nodes build, a network infrastructure which allocates each node a unique temporary address according to its current relative location, our routing is also unique and only depends on the current node's neighborhood, where in order to implement the routing table, each node needs only to exchange local information with its direct neighbors.