Neighbor Trigger for Hovering Information

Hovering information is generated by specific area in a mobile ad hoc network(MANET) to be attached to the anchor area for some time. MANET is a self-organizing and dynamic topology network without infrastructure. Some nodes maybe not receive the hovering information due to possible partitioning of the network in some areas with sparse nodes, on the other hand broadcast packets lead to broadcast storm problem and high latency in high traffic density network. To improve the reachability and deduce the number of broadcast of hovering information, the adaptive probabilistic flooding scheme is proposed by Andreas Xeros. But the calculation of probability p is too complex. So, this paper proposes a new adaptive probability flooding scheme based on random graph and neighbour trigger (algorithm of neighbour trigger, ANT) for floating the information in the hovering area. When a new node enters the range of hovered node and become a neighbour of the node that has received the hovering information, the informed node checks its neighbour list to decide whether to trigger the broadcast program with probability p. I analyse the performance of the proposed algorithm. The results show that the ANT outperforms other candidate hovering information algorithms in terms of the number of broadcast messages.