Performance Evaluation of Party Protocol

Author

Al Sukkar, Ghazi ; Sabeur, Mehdi ; Afifi, Hossam ; Jouaber, Badii ; Zeghlache, Djamal ; Senouci, Sidi-Mohammed

Author_Institution

Inst. Nat. des Telecommun., Evry

fYear

2007

Firstpage

61

Lastpage

65

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.

Keywords

data communication; radiocommunication; routing protocols; Party protocol; distributed hash tables; dynamic address allocation; multi-hop routing; node neighborhood; routing protocol; self organizing network; Ad hoc networks; Network topology; Peer to peer computing; Research and development; Routing protocols; Scalability; Self-organizing networks; Spread spectrum communication; Telecommunications; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2007. VTC-2007 Fall. 2007 IEEE 66th

Conference_Location

Baltimore, MD

ISSN

1090-3038

Print_ISBN

978-1-4244-0263-2

Electronic_ISBN

1090-3038

Type

conf

DOI

10.1109/VETECF.2007.29

Filename

4349678