Geographic routing

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

Robust cooperative routing protocol in mobile wireless sensor networks

Abstract: In wireless sensor networks, path breakage occurs frequently due to node mobility, node failure, and channel impairments It is challenging to combat path breakage with minimal control overhead, while adapting to rapid topological changes Due to the Wireless Broadcast Advantage (WBA), all nodes inside the transmission range of a single transmitting node may receive the packet, hence naturally they can serve as cooperative caching and backup nodes if the intended receiver fails to receive the packet In this paper, we present a distributed robust routing protocol in which nodes work cooperatively to enhance the robustness of routing against path breakage We compare the energy efficiency of cooperative routing with noncooperative routing and show that our robust routing protocol can significantly improve robustness while achieving considerable energy efficiency

HYMN: A Novel Hybrid Multi-Hop Routing Algorithm to Improve the Longevity of WSNs

Abstract: Power-aware routing in Wireless Sensor Networks (WSNs) is designed to adequately prolong the lifetime of severely resource-constrained ad hoc wireless sensor nodes}. Recent research has identified the energy hole problem in single sink-based WSNs, a characteristic of the many-to-one (convergecast) traffic patterns. In this paper, we propose HYbrid Multi-hop routiNg (HYMN) algorithm, which is a hybrid of the two contemporary multi-hop routing algorithm architectures, namely, flat multi-hop routing that utilizes efficient transmission distances, and hierarchical multi-hop routing algorithms that capitalizes on data aggregation. We provide rigorous mathematical analysis for HYMN-optimize it and model its power consumption. In addition, through extensive simulations, we demonstrate the effective performance of HYMN in terms of superior connectivity.

Hypercube message routing in the presence of faults

Abstract: We discuss the problem of routing messages on hypercubes which have faulty processors and/or communication links. We are motivated by the belief that simple algorithms, operating under simple assumptions, can ensure high probabilities of successful message routing. In this paper, we consider the basic problem of routing a single message from an arbitrary source to an arbitrary destination. In our study, a fault is assumed to render the processor or link non-functional for purposes of communicating messages. As such, we may also consider communications hot spots as node faults, and our results also apply to routing in congested hypercubes.A framework for the analysis of fault tolerant routing schemes on a hypercube is presented. This framework includes differing routing schemes, routing information models and fault distribution models. The a priori probabilities of successful routing of a single, indivisible message under each of our possible sets of assumptions are calculated. Using random routing, under the one-step local information routing model, we show that the a priori probability of successful message routing is high even for an exceedingly large number of faults. We also analyze the behavior of sidetracking, a routing method which combines the concepts of local information and randomization. Using sidetracking, and in the one-step local information routing model, a message will be routed forward using random routing. If the message reaches a blocked processor (no non-faulty neighbors along a minimal path to the destination) it will be sent to a non-faulty neighbor, chosen uniformly at random from the set of non-faulty neighbors. We use simulation experiments to determine the performance of this routing scheme, analyzing the probability of successful routing and the expected path length of a routed message. The empirical performance of the sidetracking algorithms indicates strongly that, in the limit as the cube dimension grows larger and for a fixed probability of node failure, the probability of successful message routing is 100%.

Multi-Constrained QoS Geographic Routing for Heterogeneous Traffic in Sensor Networks

Abstract: Sensor networks that carry heterogeneous traffics and are responsible for reporting very time-critical important events necessitate an efficient and robust data dissemination framework. Designing such a framework, that can achieve both the reliability and delay guarantee while preserving the energy efficiency, namely multi-constrained QoS (MCQoS), is a challenging problem. Although there have been many research works on QoS routing for sensor networks, to the best of our knowledge, no one addresses the above three service parameters all together. In this paper, we propose a new aggregate routing model and a distributed aggregate routing algorithm (DARA) that implements the model for achieving MCQoS. DARA is designed for multi-sink, multipath and location aware network architecture. We develop probabilistic models for multipath reliability constraint, sojourn time of a packet at an intermediary node and node energy consumption. Delay-differentiated multi-speed packet forwarding and in-node packet scheduling mechanisms are also incorporated with DARA. The results of the simulations demonstrate that DARA effectively improves the reliability, delay guarantee and energy efficiency.