DYNAMIC-ADDRESS-ALLOCATION BASED ROUTING FOR SCALABILITY SUPPORT IN WIRELESS MESH NETWORKS

Abstract

Ad hoc routing protocols cannot use efficiently because they don’t scale well as the network size increases more than few hundred nodes. The existing protocols rely on flat and static addressing to keep track of each node individually. So, dynamic address allocation can be used to solve the problem of scalability. “Party” is recently proposed dynamic address allocation routing protocol, but it has not efficient mechanism for dynamic allocation of address in case of address in case of node failure and node movements. Enhanced Mobile Party (EMP) is proposed to incorporate in party protocol to enhance it for dynamic address allocation in case of node failure and node movements. It provides better scalability as network size increases and as number of traffic flow increases. So, it can be better used for Wireless Mesh Network (WMN). With the help of Network Simulator (NS2) the performance of EMP is evaluated and compared with existing routing protocol AODV and DSDV. From simulation it is observed that EMP has better performance than AODV and DSDV in terms of signaling overhead as the network size and the number of traffic flow increases. In terms of packet delivery ratio, EMP performs better in static case and in case of mobility it provides PDR of more than 96.5%. External node and non-party can communicate with EMP which is more compatible and flexible in compared to exiting routing protocols, but EMP has high end to end delay. viii