Table-driven geographical routing using aggregate areas

International audienceGeographical routing protocols scale well in large ad-hoc and sensor networks but fall short with some topologies. This causes packet losses and a drop in network performance. In this paper, we propose to introduce topological information aiming to improve the quality of routing decision while keeping the protocol scalable. Every node maintains precise information for nearby nodes and aggregated information for farther nodes by means of aggregate areas. Evaluation demonstrates the scalability of the proposition and its efficiency compared to a pure geographical routing protocol