A geographic routing hybrid approach for void resolution in wireless sensor networks

Denardin, Gustavo Weber; Barriquello, Carlos Henrique; Campos, Alexandre; Prado, R.N. do

doi:10.1016/j.jss.2011.03.030

Cited by 21 publications

(13 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From Fig. 3 (b), when the density is low, the proposed algorithm (PViP(K)) shows better delay performance than Greedy-ViP(K) in the presence of routing holes, for K = [1,2,3]. Fig.…”

Section: Performance Evaluationmentioning

confidence: 98%

“…Fig. 3 compares the performance of the Greedy algorithm, Greedy-ViP(K) and Greedy-PViP(K), K = [1,2,3]. When the number of sensor nodes is small, nodes have relatively few neighbors.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…It is ideal to realize point-to-point routing in WSNs because packets can be delivered by only maintaining a small set of neighbors' information regardless of network size. Since the routing decisions depend, in part, on the locations of the receivers, there may be case where the packets reach local minima [1]. In other words, a node may not find any feasible nodes that are closer to the sink than itself.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Positive virtual based geographic routing for wireless sensor networks

Ghaffari

Bahanfar

2012

IEICE Electron. Express

View full text Add to dashboard Cite

Communications void in geographical routing protocols effects the performance of these routing protocols. A geographic routing protocol usually uses a greedy forwarding scheme with a recovery policy to solve the void problem. In this paper, we propose a new positive virtual position (PViP) scheme, for solving the local minimum problem. Positive virtual position of nodes are considered when selecting the next optimum neighbor node. Positive virtual position of a node is the average positions of node's itself position and all single-hop neighbor nodes that are closer to the sink than itself. Simulation results demonstrate that proposed scheme increases the success delivery rate compared with other schemes without any significant overhead.

show abstract

“…From Fig. 3 (b), when the density is low, the proposed algorithm (PViP(K)) shows better delay performance than Greedy-ViP(K) in the presence of routing holes, for K = [1,2,3]. Fig.…”

Section: Performance Evaluationmentioning

confidence: 98%

“…Fig. 3 compares the performance of the Greedy algorithm, Greedy-ViP(K) and Greedy-PViP(K), K = [1,2,3]. When the number of sensor nodes is small, nodes have relatively few neighbors.…”

Section: Performance Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Positive virtual based geographic routing for wireless sensor networks

Ghaffari

Bahanfar

2012

IEICE Electron. Express

View full text Add to dashboard Cite

show abstract

“…Due to the geographic routing algorithm boasting low overhead and high scalability features, in this case, it is one of the most suitable routing algorithms. The geographic routing is based on a greedy forwarding algorithm [2], [3]; each node selects the nearest neighbors to forward the packet to the destination node. As an effective energy-saving routing technology, geographic routing has been identified as the most promising solution, especially in the energy-limited WSNs [4], [5].…”

Section: Introductionmentioning

confidence: 99%

Applications for Improving Geographic Routing Paths in Wireless Sensor Networks

Chen¹,

Ding²,

Chang³

et al. 2014

JACN

View full text Add to dashboard Cite

Abstract-This paper proposes the Geographic Multicast Fermat Point (GMFP) architecture with an Inside Relay Node (IRN). We use Fermat Point architecture to find the relay Fermat Point node to reduce the distance between received nodes. We also use the Energy-Efficient Beaconless Geographic Routing (EBGR) method to effectively find the optimal relay node position and reduce energy consumption between source nodes and Fermat Points, so that packets are forwarded for all relay nodes. Simulation results show that total energy consumption of GMFP architecture with an IRN outperforms that of GMFP architecture, thereby extending the system lifetime.

show abstract

“…In the case of holes it is assumed to bypass perimeter empty right-hand rule (Zou & Chakrabarty, 2003). In order to solve the problem of local minimum different algorithms are offered (Wuu, Li, & Kuo, 2010;Xing, Xu, Zhao, & Harfoush, 2007), including those aimed at reducing the number of hops on the basis of the neighborhoods method (Denardin, Barriquello, Campos, & do Prado, 2011). But this method has never extended to entire route.…”

Section: Introductionmentioning

confidence: 99%

The Neighborhoods Method and Virtual Polar Coordinates in Wireless Sensor Networks

Sukhov¹,

Chemodanov²

2013

NCT

View full text Add to dashboard Cite

In this paper we propose the development of a neighborhoods method for finding the route with the least number of transitions. A double pass of neighborhoods allows the determination of the shortest routes, and also the solution to the local minima problem. The proposed algorithms are complemented by search algorithms for the central anchor of and rules for angle calculation, which automatically leads to the assignment of a virtual polar coordinate system. The problem of reconstruction maps for the sensors, on the basis of limited data about nodes and their immediate neighbors, is discussed. The possibility of generalizing the neighborhoods method for inter-domain routing is supposed.Keywords: neighborhoods method in sensor networks, double pass of neighborhoods, the local minima problem, virtual polar coordinates, inter-domain routing

show abstract

A geographic routing hybrid approach for void resolution in wireless sensor networks

Cited by 21 publications

References 16 publications

Positive virtual based geographic routing for wireless sensor networks

Positive virtual based geographic routing for wireless sensor networks

Applications for Improving Geographic Routing Paths in Wireless Sensor Networks

The Neighborhoods Method and Virtual Polar Coordinates in Wireless Sensor Networks

Contact Info

Product

Resources

About