Improvised tree selection algorithm in Greedy Distributed Spanning Tree Routing

doi:10.1109/RAECS.2014.6799506

Proceedings Article•DOI•

Improvised tree selection algorithm in Greedy Distributed Spanning Tree Routing

Debasis Das¹, Rajiv Misra²•Institutions (2)

NIIT¹, Indian Institute of Technology Patna²

06 Mar 2014-pp 1-6

TL;DR: A new tree selection algorithm is proposed in GDSTR which improves the performance in terms of path and hop stretch with the competitive schemes.

read less

Abstract: The Geographic Perimeter Stateless Routing (GPSR)use location information to forward packets greedily. Nodes need to keep only this local information, hence called as stateless. When Greedy Forwarding is fails, the algorithm recovers by switching to face routing, which is based on the right-hand rule in planarized node graph, to route around the void. The Gabriel Graph(GG) and the Relative Neighbourhood Graph (RNG) are the two graphs used for planarization but may lead to graph partitioning. Alternatively, instead of switching to face routing and planarizition, the existing Greedy Distributed Spanning Tree Routing(GDSTR) scheme enables nodes to continue routing by traversing on a spanning tree until it reaches a point where greedy forwarding can take place. GDSTR sometimes incorporates two spanning trees although it uses only one. So, in this work, we proposed new tree selection algorithm in GDSTR which improves the performance in terms of path and hop stretch with the competitive schemes.

...read moreread less

Citations

PDF

Open Access

More filters

Geographic Routing Made Practical - eScholarship

[...]

Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker

01 Jan 2005

4 citations

Other•DOI•

Autonomous System of Wireless Power Distribution for Static and Moving Nodes of Wireless Sensor Networks

[...]

Przemyslaw Kant, Karol Dobrzyniewicz, Jerzy Julian Michalski

04 Feb 2020

References

PDF

Open Access

More filters

Journal Article•DOI•

Wireless sensor networks: a survey

[...]

Ian F. Akyildiz¹, Weilian Su¹, Y. Sankarasubramaniam¹, Erdal Cayirci¹•Institutions (1)

Georgia Institute of Technology¹

15 Mar 2002-Computer Networks

TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.

...read moreread less

17,936 citations

"Improvised tree selection algorithm..." refers background in this paper

...For this reason, Greedy Forwarding is very effective in dense wireless sensor networks [4], [13]....
[...]
...However it is difficult to obtain the static connected plain graph in wireless network [4]....
[...]
...The adaptability of these to mobility of wireless sensor [4], [13] nodes is done in the following sections....
[...]

Proceedings Article•DOI•

GPSR: greedy perimeter stateless routing for wireless networks

[...]

Brad Karp¹, Hsiang-Tsung Kung¹•Institutions (1)

Harvard University¹

01 Aug 2000

TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.

...read moreread less

Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

...read moreread less

7,384 citations

"Improvised tree selection algorithm..." refers background or methods in this paper

...This approach requires a heuristic [10] called the no-crossing heuristic to force the right-hand rule [9] to find perimeters that enclose voids in regions where edges of the graph cross....
[...]
...The Geographic Perimeter Stateless Routing(GPSR)[5], [6], [7], [8], [9], [17], [18], [19], [20] makes extensive use of geography to achieve scalability in wireless routing protocols....
[...]
...3 depicts the rule for constructing the RNG [9]....
[...]
...In GPSR [9], packets are marked by their originator with the location of their destinations....
[...]
...The Gabriel Graph(GG) planarization technique, An edge (u,v) exists between vertices u and v if no other vertex w is present within the circle whose diameter is (u,v) [9]...
[...]

Proceedings Article•DOI•

Efficient geographic routing in multihop wireless networks

[...]

Seungjoon Lee¹, Bobby Bhattacharjee¹, Suman Banerjee²•Institutions (2)

University of Maryland, College Park¹, University of Wisconsin-Madison²

25 May 2005

TL;DR: The results show that NADV outperforms current schemes in many aspects: for example, in high noise environments with frequent packet losses, the use of NADV leads to 81% higher delivery ratio and when compared to centralized routing under certain settings, geographic routing using NADV finds paths whose cost is close to the optimum.

...read moreread less

Abstract: We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proximity and link cost. Coupled with the local next hop decision in geographic routing, NADV enables an adaptive and efficient cost-aware routing strategy. Depending on the objective or message priority, applications can use the NADV framework to minimize various types of link cost.We present efficient methods for link cost estimation and perform detailed simulations in diverse scenarios. Our results show that NADV outperforms current schemes in many aspects: for example, in high noise environments with frequent packet losses, the use of NADV leads to 81% higher delivery ratio. When compared to centralized routing under certain settings, geographic routing using NADV finds paths whose cost is close to the optimum.

...read moreread less

328 citations

"Improvised tree selection algorithm..." refers background in this paper

...The Geographic Perimeter Stateless Routing(GPSR)[5], [6], [7], [8], [9], [17], [18], [19], [20] makes extensive use of geography to achieve scalability in wireless routing protocols....
[...]

Proceedings Article•DOI•

On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks

[...]

Hannes Frey¹, Ivan Stojmenovic²•Institutions (2)

University of Southern Denmark¹, University of Ottawa²

29 Sep 2006

TL;DR: This article gives the first complete and formal proofs that several proposed face routing, and combined greedy-face routing schemes do guarantee delivery in specific graph classes or even any arbitrary planar graphs.

...read moreread less

Abstract: It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this article is to clarify that this is not the truth in general. We show that specifically in relative neighborhood and Gabriel graphs recovery from a greedy routing failure is always possible without changing between any adjacent faces. Guaranteed delivery then follows from guaranteed recovery while traversing the very first face. In arbitrary graphs, however, a proper face selection mechanism is of importance since recovery from a greedy routing failure may require visiting a sequence of faces before greedy routing can be restarted again. A prominent approach is to visit a sequence of faces which are intersected by the line connecting the source and destination node. Whenever encountering an edge which is intersecting with this line, the critical part is to decide if face traversal has to change to the next adjacent one or not. Failures may occur from incorporating face routing procedures that force to change the traversed face at each intersection. Recently observed routing failures which were produced by the GPSR protocol in arbitrary planar graphs result from incorporating such a face routing variant. They cannot be constructed by the well known GFG algorithm which does not force changing the face anytime. Beside methods which visit the faces intersected by the source destination line, we discuss face routing variants which simply restart face routing whenever the next face has to be explored. We give the first complete and formal proofs that several proposed face routing, and combined greedyface routing schemes do guarantee delivery in specific graph classes or even any arbitrary planar graphs. We also discuss the reasons why other methods may fail to deliver a message or even end up in a loop.

...read moreread less

276 citations

"Improvised tree selection algorithm..." refers background or methods in this paper

...For this reason, Greedy Forwarding is very effective in dense wireless sensor networks [4], [13]....
[...]
...The algorithm used to by pass the void [5] or the local maxima is called face routing [1], [13] or the perimeter routing....
[...]
...The adaptability of these to mobility of wireless sensor [4], [13] nodes is done in the following sections....
[...]
...The face routing or perimeter routing [1], [5], [11], [13] makes use of the Right Hand Rule [11]....
[...]

Journal Article•DOI•

A survey of void handling techniques for geographic routing in wireless networks

[...]

Dazhi Chen¹, Pramod K. Varshney•Institutions (1)

Syracuse University¹

01 Jan 2007-IEEE Communications Surveys and Tutorials

TL;DR: An overview of the void problem is presented and the currently available void-handling techniques (as of July 2006) for geographic routing are surveyed, each designed with a different approach.

...read moreread less

Abstract: Communications voids, where geographic greedy forwarding fails to move a packet further towards its destination, are an important issue for geographic routing in wireless networks. This article presents an overview of the void problem and surveys the currently available void-handling techniques (as of July 2006) for geographic routing. In the survey, we classify these void-handling techniques into six categories, each designed with a different approach, that is, planar-graph-based, geometric, flooding-based, costbased, heuristic, and hybrid. For each category, we present its basic principle and illustrate some classic techniques as well as the latest advances. We also provide a qualitative comparison of these techniques and discuss some possible directions of future research.

...read moreread less

233 citations

"Improvised tree selection algorithm..." refers background or methods in this paper

...For this reason, Greedy Forwarding is very effective in dense wireless sensor networks [4], [13]....
[...]
...The Greedy Forwarding never fails if for every node, there is at least one neighbour in every 2*π/3 sector of its area....
[...]
...The sequence of edges covered is called the perimeter [5]....
[...]
...The Greedy Forwarding tries to bring the message closer to the destination in each step based on only local information....
[...]
...The Geographic Perimeter Stateless Routing(GPSR)[5], [6], [7], [8], [9], [17], [18], [19], [20] makes extensive use of geography to achieve scalability in wireless routing protocols....
[...]

Improvised tree selection algorithm in Greedy Distributed Spanning Tree Routing

Citations

References

"Improvised tree selection algorithm..." refers background in this paper

"Improvised tree selection algorithm..." refers background or methods in this paper

"Improvised tree selection algorithm..." refers background in this paper

"Improvised tree selection algorithm..." refers background or methods in this paper

"Improvised tree selection algorithm..." refers background or methods in this paper

Related Papers (5)