Secured PARTY Protocol For Self-Organized Networks

PARTY is a new routing protocol developed for wireless self-organizing networks, to overcome many inherent routing problems, like the overhead, and the scalability. From the security point of view, it is impossible to deploy this protocol in its actual phase. Thus this paper will demonstrate the vulnerability of this protocol against various kinds of attacks, we propose a preventive and corrective mechanism based in the token solution to enforce the cooperation of nodes during both the routing process and data forwarding. The proposed solution takes in consideration the characteristics of a self organized network which pose challenges and opportunity to attain security purposes.