A Distributed Routing Algorithm for Internet-wide Geocast

Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations

Improving Spatial Indexing and Searching for Location-Based DNS Queries

Part 5: Network ProtocolsInternational audienceIn the domain of vehicular networking, it is of significant relevance to be able to address vehicles based on their geographical position rather than the network address. The integration of geocasting (i.e. the dissemination of messages to all nodes within a specific geographical region) into the existing addressing scheme of the Internet is challenging, due to its logical hierarchy. One solution to Internet-based geographical addressing is eDNS, an extension to the DNS protocol. It adds support for querying geographical locations as a supplement to logical domain names. In this work, eDNS is extended with nearest neighbor resolution support, and further, a prototype server is developed that uses bounding box propagation between servers for delegation. Our experiments confirm that distributing location records over multiple servers improves performance