TY - GEN
T1 - Performance evaluation of party protocol
AU - Al Sukkar, Ghazi
AU - Sabeur, Mehdi
AU - Afifi, Hossam
AU - Jouaber, Badii
AU - Zeghlache, Djamal
AU - Senouci, Sidi Mohannned
PY - 2007/12/1
Y1 - 2007/12/1
N2 - 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.
AB - 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.
KW - Distributed hash tables
KW - Dynamic address allocation
KW - Multi-hop routing
KW - Self organizing networks
UR - https://www.scopus.com/pages/publications/47649120052
U2 - 10.1109/VETECF.2007.29
DO - 10.1109/VETECF.2007.29
M3 - Conference contribution
AN - SCOPUS:47649120052
SN - 1424402646
SN - 9781424402649
T3 - IEEE Vehicular Technology Conference
SP - 61
EP - 65
BT - 2007 IEEE 66th Vehicular Technology Conference, VTC 2007-Fall
T2 - 2007 IEEE 66th Vehicular Technology Conference, VTC 2007-Fall
Y2 - 30 September 2007 through 3 October 2007
ER -