The design of an efficient routing algorithm for Internet Vehicles (IoV) is a challenging research issue due to the inherent characteristics IoV network, such as high-speed mobility nodes, frequent topology change, link instability, and presence radio obstacles. Geographic protocols are promising solution IoV, since they based mainly on location information which can be easily obtained through ...

The growing interest in Mobile Ad Hoc Network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. In this paper, we will survey the routing protocols that address scalability. The routing protocols we intend to include in the survey fall into three categories: (1) flat routing protocols, (2) hierarchic...

One of the notoriously difficult problems in vehicular adhoc networks is to ensure that established paths do not break before the end of data transmission. This is a difficult problem because the network topology is changing constantly and the routing links are inherently unstable due to the high mobility of vehicles. This paper classified the existing routing protocols which are designed for v...

Location information is essential in many applications of WSNs,it is natural to use this information for routing as well. Location-based protocols or geographical routing protocols to exploit the location information of each node to provide efficient and scalable routing. Various routing algorithms that feat geographic information (e.g., GPSR) have been aimed to attain this goal. These algorith...

-Mobile Ad-hoc Network (MANET) is a wireless network with no infrastructure, used in vital places such as battle fields, disaster areas, remote areas etc. This emergency aiding network is formed ondemand by mobile nodes to accomplish communication and information sharing activities. Since there is no centralized control to oversee the ongoing activities, each node operates with the responsibili...

In vehicular ad hoc network, routing has become a critical issue in vehicle-to-vehicle communication. Therefore, there are several routing algorithms, which utilize topology information to make routing decisions at each node. We have proposed Angular GEographic DIstance-based Routing (A-GEDIR) protocol for packets transmission in high density urban area. In our protocol, a source node computes ...

The performance of geographic routing protocols is impacted by physical voids and localization errors. Traversing voids is carried out by a complimentary algorithm, which requires high overhead and results in lower quality paths. Furthermore, localization errors lead to inefficient routes or even misrouting of packets. Accordingly, virtual coordinate systems (VCS) were proposed to be an alterna...

Geographic routing has been widely advocated for use with multihop ad hoc and sensor networks because of its scalability and use of only local information. These types of networks typically have lossy links where the instantaneous quality of a wireless link can vary significantly presenting a trade-off between hop length and link quality. In this paper we revisit the question of energy efficien...

Several geographic (or position-based) routing protocols have been proposed for data dissemination in wireless sensor networks. In these protocols, routing is based on the positions of neighboring nodes. In particular, the next-hop node is selected according to either a distance-based strategy, which favors a neighbor with the largest distance progress toward the sink, or a direction-based stra...

Mobile Ad hoc networks are recent wireless networking model for cellular phone hosts. Ad hoc networks do not rely on any stable infrastructure because they are independent. In geographic routing, nodes need to maintain up-to-date positions of their immediate neighbors for making effective forwarding decisions. Beacon packets are broadcasted periodically with the geographic location coordinates ...