Predictability of Aggregated Traffic of Gateways in Wireless Mesh Network with AODV and DSDV Routing Protocols and RWP Mobility Model
When evaluating the performance of routing protocols in wireless mesh network (WMN), we need deeper analysis from the aspect of network traffic complexity to show how traffic characteristics are influenced by routing protocols and node mobility. The predictability of network traffic can be used as one metric of complexity and can be analyzed by multi-scale entropy (MSE) method. With 20 different random waypoint (RWP) mobility scenarios and with destination sequenced distance vector (DSDV), a typical proactive protocol, and Ad hoc on-demand distance vector (AODV), a typical reactive protocol, the predictabilities of aggregated traffic of gateway in WMN are analyzed using MSE method to show how different routing protocols bear different mobility scenarios. The MSE results show that the aggregated traffic of gateway with DSDV is more difficult to be predicted than that with AODV for different mobility scenarios. The maxspeed parameter of RWP dominates the traffic predictability for AODV. Both of the pause time and the maxspeed parameters, have great influence on the traffic predictability for DSDV. The reasons lie in the behaviors of routing protocols, i.e., AODV has up-to-date paths while DSDV does not.
wireless mesh network aodv dsdv multi-scale entropy complexity analysis random waypoint mobility