Performance Evaluation of Party Protocol

Abstract

In this paper we study a self organizing network architecture, party. Party is a new routing protocol intended to be applied in environments with large number of nodes where the scalability of the routing protocol plays an important role. Party's routing is unique and only depends on the current node's neighborhood. Routing tables are created on the basis of the first hop neighborhood only. We will show the protocol performance with a large number of nodes in the network, and compare it to the legacy ad hoc routing protocols. Results show a large improvement in terms of overhead and throughput.