Comparison of DP Effects in MANET AAPs with Link Error
Sang‐Chul Kim · InTech eBooks · 2010
The wireless communication environment and the mobility of the nodes destabilize links. This results in link errors. Based on the link error probability, this chapter proposes two novel algorithms where the broadcasting redundancy was noticeably decreased using the DP algorithm and different messages used in MANET AAPs and routing algorithms are combined using Hello and TU messages. The proposed algorithm can save the total number of control messages, compared to the conventional algorithm, due to the reduced number of TU messages generated in AAP and routing. The simulation shows the proposed algorithm saves 39.8%, 37.3%, 37.0% and 28.4% of message complexity compared to the conventional Strong DAD, WDP, WDO and MANETconf. Several characteristics of AAPs are found. First, since Strong DAD uses more recursive broadcast mechanisms to resolve duplicated IP addresses compared to other AAPs, the reduction rate of Strong DAD is greater than the reduction rate of other AAPs. Second, it is shown in MANETconf that as node number increases, the reduction rate of message complexity rapidly decreases. Since in MANETconf in the main operation all nodes unicasts, as node number increases, the reduction rate of message complexity affected by broadcasting reduces, while the reduction rate of message complexity affected by unicasting by all nodes increases.