In the years, routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches Most state-ofthe-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN) and also provide a qualitative comparison of them. KeywordsWireless Sensor Network, Sensor...

Geographic routing uses the physical locations of devices for routing purposes instead of the conventional routing protocols which make use of logical addressing schemes representing an abstract hierarchy. Greedy geographic routing is a popular method favoured for its efficiency and its simplicity that considers only one hop neighbours. Greedy routing needs only minimal network information and ...

Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. However, the performance of geographic routing is impacted by physical voids, and localization errors. Accordingly, virtual coordinate systems (VCS) were proposed as an alternative approach that is resilient to localization errors...

In this paper we present an algorithm for a location based adaptive routing protocol that uses both geographic routing and reinforcement learning to maximize throughput in our mobile vehicle network. We use reinforcement learning to determine the correct direction to forward a packet and then use geographic routing to forward a packet toward the network sink. We use an extension of the q-routin...

In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose ...

Well-known ‘routing hole’ problem of geographic routing is hardly avoided in wireless sensor networks because of various actual geographical environments. Existing geographic routing protocols use perimeter routing strategies to find a detour path around the boundary of holes when they encounter the localminimum during greedy forwarding. However, this solution may lead to uneven energy consumpt...

Geographic routing is attractive because the routing state needed per node is independent of network size. We present a novel geographic routing protocol with several major advances over previous geographic protocols. First, our protocol achieves an average routing stretch close to 1. Second, our protocol can be used for nodes located in d-dimensional Euclidean spaces (d ≥ 2). Third, node locat...

Typical communication patterns within a sensor network are data delivery from sensor nodes to one of selected information sinks, and information sinks requesting a certain physical phenomenon or requesting sensor nodes lying within a sensed area. In general, addressing is achieved by utilizing sensor locations. Geographic routing algorithms allow routers to be nearly stateless since packet forw...

In geographic routing, nodes to theirinstantaneous neighbors call for to maintain up-to-date positions for making successfulforwarding decisions. The geographic location coordinates of the nodes by the periodic broadcasting of beacon packetsis atrendy method used by the majority geographic routing protocols to preserve neighbor positions. We contend and display that periodicbeaconing apart from...

In this paper, we propose a new geographic routing algorithm that alleviates the effect of location errors on routing in wireless ad hoc networks. In most previous work, geographic routing has been studied assuming perfect location information. However, in practice there could be significant errors in obtaining location estimates, even when nodes use GPS. Hence, existing geographic routing sche...