A piece of Hovering Information is a geo-localized information residing in a highly dynamic environment such as a mobile ad hoc network. This information is attached to a geographical point, called the anchor location, and to its vicinity area, called anchor area. A piece of hovering information is responsible for keeping itself alive, available and accessible to other devices within its anchor area. Hovering information uses mechanisms such as active hopping, replication and dissemination among mobile nodes to satisfy the above requirements. It does not rely on any central server. This paper defines the hovering information concept in a formal way and presents the results of simulations performed for two algorithms aiming to ensure the availability of a piece of hovering information at its anchor area. The first algorithm is called Attractor Point: the anchor location acts as an attractor for the pieces of hovering information attached to it. The second algorithm is a Broadcast algorithm and is used as a benchmark for comparing the performances of the Attractor Point. The results of the simulations demonstrate that the Broadcast algorithm performs slightly better than the Attractor Point in terms of availability, while the Attractor Point algorithm outperforms the Broadcast algorithm in bandwidth and memory consumption. It also allows a better concentration of hovering information around the anchor location. Current assumptions, such as unlimited memory of mobile devices, or random way point mobility model need to be dropped in future simulations in order to obtain results closer to real-life scenarios.