Geographic routing

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

A Predictive Cross-Layered Interference Management in a Multichannel MAC with Reactive Routing in VANET

Abstract: Vehicular ad hoc networks (VANETs) represent a particular mobile technology that permits communication between vehicles, offering security and comfort. Nowadays, distributed mobile wireless computing is becoming a very important communication paradigm, due to its flexibility to adapt to different mobile applications. In this work, an interference aware metric is proposed in order to reduce the level of interference between each pair of nodes at the MAC and routing layer. In particular, this metric with a prediction algorithm is proposed to work in a cross-layered MAC and an on-demand routing scheme in multi-radio vehicular networks, wherein each node is equipped with two multi-channel radio interfaces. The proposed metric is based on the maximization of the average signal-to-interference ratio (SIR) level of the connection between source and destination. In order to relieve the effects of the co-channel interference perceived by mobile nodes, transmission channels are switched on a basis of a periodical SIR evaluation. Our solution has been integrated with an on-demand routing scheme but it can be applied to other routing strategies. Three on-demand interference aware routing schemes integrating IEEE 802.11p Multi-channel MAC have been tested to assess the benefits of the novel metric applied to a vehicular context. NS-3 has been used for implementing and testing the proposed idea, and significant performance improvements were obtained: in particular, the proposed policy has resulted in an enhancement of network performance in terms of throughput and packet delivery ratio.

Hole Avoiding in Advance Routing in Wireless Sensor Networks

Abstract: Energy consumption is a major issue when designing routing protocols in wireless sensor networks. We propose a novel hole avoiding in advance routing protocol (HAIR) to address this issue. In the proposed protocol, a data packet can avoid meeting a "hole" in advance instead of bypassing a hole when it meets the hole as existing hole avoiding re-routing protocols (HARR) do. We prove that the proposed protocol can always find a routing path between a given source node and the sink if such a routing path does exist in the network. Simulation studies show that the proposed HAIR protocol constructs routing paths with shorter routing distance and less energy consumption in comparison with the existing HARR protocols. The proposed protocol can be used in large-scale wireless sensor networks.

Density controlled divide-and-rule scheme for energy efficient routing in Wireless Sensor Networks

Abstract: Cluster based routing technique is most popular routing technique in Wireless Sensor Networks (WSNs). Due to varying need of WSN applications efficient energy utilization in routing protocols is still a potential area of research. In this research work we introduced a new energy efficient cluster based routing technique. In this technique we tried to overcome the problem of coverage hole and energy hole. In our technique we controlled these problems by introducing density controlled uniform distribution of nodes and fixing optimum number of Cluster Heads (CHs) in each round. Finally we verified our technique by experimental results of MATLAB simulations.

Routing in wireless mesh networks

Abstract: A method, apparatus and system for communicating in a wireless mesh network may entail using a Viterbi routing algorithm to determine a multi-hop path between a source node and a destination node having a lowest cost metric. In one example, the cost , metric, may be inversely proportional in the achievable transmission rate in the links of each potential multi-hop path. A next hop node in two or more potential multi- hop paths for routing a wireless communication to a destination node may be determined by each node based on the multi-hop path having a lowest cost metric associated with communicating to the destination node. Other embodiments and variations are described in the detailed description.

GeoCross: A geographic routing protocol in the presence of loops in urban scenarios

Abstract: In this paper,we propose GeoCross, a simple, yet novel, event-driven geographic routing protocol that removes cross-links dynamically to avoid routing loops in urban Vehicular Ad Hoc Networks (VANETs). GeoCross exploits the natural planar feature of urban maps without resorting to cumbersome planarization. Its feature of dynamic loop detection makes GeoCross suitable for highly mobile VANET. We have shown that in pathologic cases, GeoCross's packet delivery ratio (PDR) is consistently higher than Greedy Perimeter Stateless Routing's (GPSR's) and Greedy Perimeter Coordinator Routing's (GPCR's). We have also shown that caching (GeoCross+Cache) provides the same high PDR but uses fewer hops.