Directional Shadow Registration Algorithm for Efficient Cluster Mobility in Ad Hoc Networks

This paper presents a novel relative mobility metric for MANETs. There have been many researches on providing mobility under mobile/wireless environment. However, previous researches had several problem as disruption and unnecessary traffic. Disruption happens when messages are exchanged between nodes as registration is made after handoff, and unnecessary traffic occurs because of the use of random-move model, in which the probability for node to move to the neighboring clusters is equal. In order to solve these problems, this study proposes a technique and algorithm for composing direction shadow registration (DSR) that provides seamless mobility. We are introduced a cluster division scheme and decided minimal DSR. DSR can sensed the optimal time for handoff through regional cluster division and applied direction vector (DV) obtained through directional cluster sectoring. According to the result of the experiment, the proposed DSR processes message exchange between nodes within the intracluster, the frequency of disruptions decreased significantly compared to that in previous researches held in interdomain environment. In addition, traffic that occurs at every handoff happened twice in DSR compared to n (the number of neighboring clusters) times in previous researches