2004
DOI: 10.1007/978-3-540-27796-5_3
|View full text |Cite
|
Sign up to set email alerts
|

Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2004
2004
2006
2006

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 23 publications
(14 citation statements)
references
References 7 publications
0
14
0
Order By: Relevance
“…We subdivide the area of the circle with diameter AB into four regions X 1 , X 2 , Y 1 and Y 2 (see Figure 6) as determined by an arc of radius R. Figure 7 depicts several scenarios being considered prior to determining whether or not an edge should be deleted. Details of the precise specification of the Morelia test applied to a link AB can be found in Boone et al [3].…”
Section: Morelia Testmentioning
confidence: 99%
See 1 more Smart Citation
“…We subdivide the area of the circle with diameter AB into four regions X 1 , X 2 , Y 1 and Y 2 (see Figure 6) as determined by an arc of radius R. Figure 7 depicts several scenarios being considered prior to determining whether or not an edge should be deleted. Details of the precise specification of the Morelia test applied to a link AB can be found in Boone et al [3].…”
Section: Morelia Testmentioning
confidence: 99%
“…In this section, we describe two procedures for constructing a geometric spanner in a given ad-hoc network: the Gabriel test is due to Bose et al [5] and the Morelia test is due to Boone et al [3].…”
Section: Tests For Preprocessing the Ad-hoc Networkmentioning
confidence: 99%
“…Since the path length depends on the planar subgraph extracted, we compared RPT with RNG [31], Gabriel Graph [13], Morelia Graph [4] and the virtual spanner [30,29]. Please note that GFG relies on an external location service like GPS.…”
Section: Routing Evaluationmentioning
confidence: 99%
“…For a given network topology, several distributed algorithms [17][18][19][20] are available to planarize a network topology. In these algorithms, each node autonomously eliminates its connections (i.e., edges) to its neighbors from the consideration of the routing based on the locations of the neighbors so that the network topology contains no cross edges.…”
Section: Dist(a D) < Dist(n D)mentioning
confidence: 99%
“…In the Relative Neighborhood Graph (RNG) [19], a node 11 eliminates a link to a neighbor v if there exists at least one node in the intersection of radio coverages of 11 and v. In the Gabriel Graph (GG) [17], a node 11 eliminates a link to a neighbor v if there exists at least one node in the circle with diameteruv. The Planar Spanner in [18] and the Morelia test in [20] employ more complicated algorithms to compute the planar graph so that a smaller number of edges are deleted from the original topology. Note that, the edge elimination process in graph planarization has two potentially negative impacts to the routing.…”
Section: Dist(a D) < Dist(n D)mentioning
confidence: 99%