The stateless, low overhead and distributed nature of the Geographic routing protocols attract a lot of research attentions recently. Since the geographic routing would face void problems, leading to complementary routing such as perimeter routing which degrades the performance of geographic routing, most research works are focus on optimizing this complementary part of geographic routing to im...

The unique anywhere, anytime wireless communication support offers, tremendous potential for the next generation of applications in a Mobile Ad-hoc Network (MANET). The Quality of Service (QoS) has been the ever demanding task of wireless communication to satisfy the application requirements. Geographical routing employs a greedy forwarding technique to deliver the packets to the destination an...

Large scale decentralized communication systems have introduced the new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. A perfect geometrical routing scheme is expected to deliver each packet to the point in the network that...

In recent years, intelligent transportation systems (ITS) applications e.g. active traffic management, safety application, etc. are gaining popularity. Again internet-based services are also emerging nowadays in vehicular communication networks. Therefore, a suitable routing mechanism is essential to support delay tolerant networking to ensure reliable information exchange. On the other hand, g...

Geographical Routing Technique is a new trend in Wireless Sensor Networks in which the sensor nodes are enabled using Global Positioning Systems (GPS). This helps to easily detect the position of their neighboring nodes. The power consumption is more in the existing routing algorithms, since the nodes build the routing tables and the neighboring node IDs are determined by searching the routing ...

Here we present performance evaluation of different routing protocols such as SIFT, GPSR and GOSR using different mobility models like Fluid Traffic Model (FTM), Intelligent Driver Model and Random Waypoint Model (RWM) with Intersection Management (IDM-IM). We present simulation results that demonstrate the importance of choosing a mobility model in the simulation of a Vehicular Network Protoco...

Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world networks. In each of these networks, a node has out-degree O(log n), where n denotes the total number of nodes, and greedy routing is known to take O(log n) hops on average. Our contribu...

Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...

Greedy routing has drawn a lot of attention in research community. To our best knowledge, stretch factor has not been studied for greedy routing algorithms. In this paper, we propose a new greedy routing algorithm and take the initiative to evaluate its stretch factor. Our algorithm generalizes the algorithm presented in [1]. It embeds an n-vertex connected graph G(V,E) in a semi-metric space. ...