Geographic routing

About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.

A Scalable Quorum Based Location Service in Ad Hoc and Sensor Networks

Abstract: Location service provides position of mobile destination to source node to enable geo-routing. Previous location service protocols suffer from partial flooding overhead, and/or location failures in group movement scenarios. To overcome those deficiencies, we propose a quorum-based location service. The basic idea is that destination node registers its location along a `column' to form an update quorum. Source node makes a query along a `row' to form a search quorum. The destination location is found at the intersection between the update and search quorums. Four strategies are proposed to adjust the quorum system. To guarantee the success of location retrieval, both search and update quorums are extended by face routing which traverses outer network boundary.

A Routing Strategy for Metropolis Vehicular Communications

Abstract: One of the major issues that affect the performance of mobile ad hoc networks (MANET) is routing. Recently, position-based routing for MANET is found to be a very promising routing strategy for inter-vehicular communication systems (IVCS). However, position-based routing for IVCS in a built-up city environment faces greater challenges because of potentially more uneven distribution of vehicular nodes, constrained mobility, and difficult signal reception due to radio obstacles such as high-rise buildings. This paper proposes a new position-based routing scheme called Anchor-based Street and Traffic Aware Routing (A-STAR), designed specifically for IVCS in a city environment. Unique to A-STAR is the usage of information on city bus routes to identify an anchor path with high connectivity for packet delivery. Along with a new recovery strategy for packets routed to a local maximum, the proposed protocol shows significant performance improvement in a comparative simulation study with other similar routing approaches.

Automatic routing using multiple prefix labels

Abstract: We present Multi-label Automatic Routing (MAR), the first compact routing protocol that attains a low path stretch (ratio of selected path length to the optimal path length) while maintaining a low routing state for mobile networks. MAR is resilient to node movements in the network. In MAR, nodes assign themselves labels based on their location in the network through a distributed algorithm. Distributed Hash Tables (DHTs) for the node to label mappings are established in some anchor nodes. Once the labels are established, the routing is automatic based on the positional labels of the nodes and DHT lookups. This eliminates flooding completely. Unlike traditional routing protocols MAR does not need destinations-based routing tables. Hence, MAR has a small routing state. With the use of multiple labels per node, the average path length is close to the shortest path and there are multiple paths between source and destination nodes. In Qualnet simulations MAR shows a path stretch close to or better than traditional table-driven and on-demand protocols like OLSR and AODV. Simulation results also show shorter end-to-end delays due to the automatic routing. The delivery ratio of MAR is comparable to these traditional protocols but with a significantly lower network overhead.

A scalable logical coordinates framework for routing in wireless sensor networks

Abstract: Routing is one of the key challenges in sensor networks that directly affects the information throughput and energy expenditure. Geographic routing is the most scalable routing scheme for statically placed nodes in that it uses only a constant amount of per-node state regardless of network size. The location information needed for this scheme, however, is not easy to compute accurately using current localization algorithms. In this paper, we propose a novel logical coordinate framework that encodes connectivity information for routing purposes without the benefit of geographic knowledge, while retaining the constant-state advantage of geographic routing. In addition to efficiency in the absence of geographic knowledge, our scheme has two important advantages: (i) it improves robustness in the presence of voids compared to other logical coordinate frameworks, and (ii) it allows inferring bounds on route hop count from the logical coordinates of the source and destination nodes, which makes it a candidate for use in soft real-time systems. The scheme is evaluated in simulation demonstrating the advantages of the new protocol.

Opportunistic Routing in Wireless Networks: Models, Algorithms, and Classifications

Abstract: Opportunistic Routing (OR) is a new promising paradigm that has been proposed for wireless networks OR has gained a lot of attention from the research communities for its ability to increase the performance of wireless networks It benefits from the broadcast characteristic of wireless mediums to improve network performance The basic function of OR is its ability to overhear the transmitted packet and to coordinate among relaying nodes In OR, a candidate set is a potential group of nodes that is selected as the next-hop forwarders Hence, each node in OR can use different potential paths to send packets toward the destination Any of the candidates of a node that have received the transmitted packet may forward it The decision of choosing the next forwarder is made by coordination between candidates that have successfully received the transmitted packet In OR, by using a dynamic relay node to forward the packet, the transmission reliability and network throughput can be increased In this article, we explain the fundamental idea of OR and its important issues by providing some examples We then categorize each of the important issues and explain them in detail Furthermore, we illustrate different protocols from each category and compare their benefits and drawbacks Finally, some potential directions for future research in OR is explained