Optimizing GIS Based Systems

Geographical Information Systems (GIS)
http://www.adcorporations.com
OPTIMIZING CONFLATION,
AUTOMATIC MAP LAYOUT AND
GEO-OPPORTUNISITIC ROUTING
IN VEHICULAR NETWORKS
Submitted by:
Ajinkya Deshpande | R No. 3519
Guided by:
Prof. G. P. Potdar
1
Topics Covered
1. Conflation of Vector Buildings with Imagery
2. Automatic Metro Map Layout using Multicriteria
Optimization
3. Geo-Opportunistic Routing for Vehicular Networks
2
Conflation of Vector Buildings

with Imagery
1. Conflation:-
• Literal Meaning: The process or result of fusing items into one
entity; fusion; amalgamation.
• Verb: to combine or blend (two things, esp. two versions of a
text or two images) so as to form a whole
2. Clique:- here means to be looking as a single unit but which is

not.
3. Solution:- Mathematics can solve this problem!

3
http://www.adcorporation
s.com
Solution
Solution:- Mathematics can solve this problem!
A large solution set is provided here,
We will use,
ArcView by ESRI (I used ArcGIS Desktop 10)
&
MapMerger
As our tools to apply the Mathematical solutions for the
Conflation Process
The above two softwares are capable of using a large set

MATLAB code and also C Codes with the help
of VB.Net and other support tools as Python
4
http://www.adcorporat
ions.com
CONFLATION
Conflation Process
5
Automatic Metro Map Layout

using Multicriteria Optimization
6
Fig. Metro map features.
(a) optimal angular resolution

and (b) poor angular resolution.
7
Octilinearity
8
Table: Octilinearity Criterion
9
(a) poor line straightness and (b)

improved line straightness.
10 http://www.adcorporations.com
Enforcement of the relative positions

when moving a station.
http://www.adcor
porations.com
The gray-shaded area shows the degree of

freedom afforded to (a) station A and (b) station C.
11
Preservation of edge ordering.
Without preserving the ordering of edges, station C

would be able to move as shown, changing the
12 topology of the map.
Label Criteria
Search space for labeling the metro map.
13
Label Criteria
Label position consistency. Label position

consistency.
(Not Observed here)

14
Label Criteria
An example of ambiguous labeling.

15
Label Criteria
(a) perpendicular tick labels and (b) nonperpendicular tick labels.

16
Clustering
Clustering multiple overlength edges. The edges AE and BC

are (a) too long and it is only possible to reduce the length of these
edges by moving stations C, D, and E (b) at the same time.
17
Clustering
Clustering stations to find nonstraight lines. Ultimately, six

clusters will be identified in this graph: (BC), (CD), (DE), (GH),
(HI), and (IJK).
18
http://www.ad Example & Trial of the System
corporations.
com
The time taken to generate the automatically generated maps
discussed in this paper is given in Table. These timings were
performed in Java 1.6, on a computer with a 1.4 GHz Celeron M
processor, 1.5 GB RAM, and running Windows XP. The values
are the average of three runs. All maps (automatically
generated, published, and undistorted)
19
Example & Trial of the System
20 Mexico City map: official layout.

Mexico City map: official layout, normalized to the layout

21 software style.
Mexico City map: undistorted layout.

22
Mexico City map: Author`s Layout.

23
24
http://www.adcorporations
Geographical Information Systems (GIS) .com
Geo-Opportunistic Routing for

Vehicular Networks
One of the recent outcomes is a novel wireless
architecture called Wireless Access for the
Vehicular Environment (WAVE) that provides
short-range intervehicular communications to
enable fast dissemination of emergency related
messages.
25
http://www.adcorpor
Geographical Information Systems (GIS) ations.com
Geo-Opportunistic Routing for
Vehicular Networks
So Called Efficient multihop routing in a Vehicular Ad hoc Network
(VANET) Fails for following reasons
1.It is a highly distributed self-organizing network formed by
moving vehicles that are characterized by very high mobility yet
constrained by roads.
2.Its size can scale up to hundreds of thousands of nodes.
3.Nodes could suffer from severe wireless channel fading due
to motion and obstructions in urban environments (e.g., building,
trees, and vehicles).
4. The vehicle density changes over time (rush hours), and the
distribution of vehicles is non-uniform due to various road widths
and skewed popularity of roads. Under this circumstance, most ad
hoc routing protocols that discover and maintain end-to-end paths
(e.g., Ad Hoc On Demand Vector [AODV], Dynamic Source
Routing [DSR]) are less preferable due to high protocol
overheads.
Therefore, we cannot directly use those protocols to support

such emerging vehicular applications. 26
http://www.adcorp
orations.com
Solution
Geographic routing is preferable in a VANET for the following reasons,
1.Geographic routing is stateless; it neither exchanges link state information
nor maintains established routes as in conventional mobile ad hoc routing
protocols. The exchange and route maintenance are very costly in highly mobile
vehicular environments.
2.It is becoming easier to support geographic routing as GPS-based navigation
systems are getting cheaper and becoming a common add-on.
Existing geographic routing protocols such as GPCR(Geographic

Perimeter Coordinate Routing) & GPSR(Geographic
Perimeter Stateless Routing) that address the unreliable
channels using
opportunistic forwarding (GeRaF) & (CBF)

To remedy this problem, The Authors propose
TOpology-assisted Geo-Opportunistic routing
(TO-GO), that incorporates road topology information
into the forwarding set selection to better exploit the
benefit of opportunistic forwarding.
27
http://www.adcorpora
tions.com
Solution
One of the popular routing protocols in a VANET is geographic
routing.
A packet is greedily forwarded to a neighbouring node whose

distance toward the packet’s destination is closer than that of the
current node
28
http://www.adcorpor
ations.com
Opportunistic Routing
Dashed arrows are GpsrJ+ and solid arrows are

29 GPCR.
http://www.adcorpora
tions.com
TO-GO DESIGN
The Next-hop Prediction Algorithm (NPA), which determines a
packet’s target node; the Forwarding Set Selection (FSS)
algorithm, which finds a set of candidate forwarding nodes; and the
priority scheduling method, which suppresses redundant packet
transmissions based on a distance based timer.
The lens shaped area is the forwarding region established between source and
destination nodes in existing schemes, and between the source and the furthest
node on the current road segment (called target node) in TO-GO: a) existing
schemes; b) TO-GO. 30
FSS
Forwarding set selection approximation: a) shaded

region contains neighbors of C that can hear both C
and T; b) shaded region contains neighbors of C that
can hear both M and T, and can also hear each other.
31
FSS Analysis
A brute force algorithm to find a forwarding set in which nodes hear
one another is analogous to finding a maximal clique in which every
node has a connection to every other node. Such a problem is NP-
complete.
SOLUTION:-
By continue adding N until all the neighbours of C have been
checked, we can find a opportunistic forwarding set. The
algorithm takes,
O(n2)
where n is the number of C’s neighbours.
32
http://www.adcorpor
ations.com
Uses & Applications

• Oceania engineers in coastal calculations,
• Sewage System Planning, and Civil Engineering Applications.
• 50 Year future Planning,
• Architectural Development,
• Map corrections and Improvements.
o Vehicular Networks,
o Traffic Management,
o Emergency Alerts,
o Dynamic & Automatic Map Creation,
o Information Exchange,
o Tracking of the Race tracks by Co-Pilot.
All the above mentioned uses and Applications can be

implemented to provide Output better than the desired
one by a small change in the Algorithm. The system
33 will work in an Optimized manner.
http://www.adcorporat
ions.com
Conclusions
A. Conflation
• Conflation is a Prior requisite to clear the issues like errors in
the maps and cliques to be removed.
B. Automatic Metro Map Layout using Multicriteria Optimization

• Optimizing Multiple Criterion in Metro Map Layout as well as
any other Automatic Mapping System can lead to best formed
Maps those could be understood and used accurately.
C. Geo-Opportunistic Routing for Vehicular Networks

• This is just the beginning in Vehicular Networks a large
development is yet to come a no. of Protocols are being
exploited to give rise to better protocols.
― I hereby Conclude that these systems we have seen

until now is just a beginning and a lot of development
can be done in the area. The authors have come up
34 with intuitive and exceptional new ideas and have
also implemented them.
References
[01] Jonathan Stott, Peter Rodgers, Juan Carlos Martı´nez-Ovando, and
Stephen G. Walker – “Automatic Metro Map Layout Using Multicriteria
Optimization”
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS,
VOL. 17, NO. 1, JANUARY 2011 Pages: 101-114
1077-2626/11/

[02] Isaac Sledge, Student Member, IEEE, James Keller, Fellow, IEEE, Wenbo
Song, and Curt Davis, Fellow, IEEE – “Conflation of Vector Buildings With
Imagery”
IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, VOL. 8, NO. 1
JANUARY 2011 Pages: 83-87.
1545-598X/

[03] Kevin C. Lee, Uichin Lee, Mario Gerla – “Geo-Opportunistic Routing for
Vehicular Networks” IEEE Communications Magazine • May 2010
Pages: 164-170
0163-6804/10/
Any Questions?
Thanks a lot !
For this Opportunity

37

Optimizing GIS Based Systems

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Optimizing GIS Based Systems

Uploaded by

Copyright:

Available Formats

Geographical Information Systems (GIS)

1. Conflation of Vector Buildings with Imagery

2. Automatic Metro Map Layout using Multicriteria

3. Geo-Opportunistic Routing for Vehicular Networks

Conflation of Vector Buildings

2. Clique:- here means to be looking as a single unit but which is

3. Solution:- Mathematics can solve this problem!

ArcView by ESRI (I used ArcGIS Desktop 10)

The above two softwares are capable of using a large set

Automatic Metro Map Layout

(a) optimal angular resolution

Table: Octilinearity Criterion

(a) poor line straightness and (b)

Enforcement of the relative positions

The gray-shaded area shows the degree of

Preservation of edge ordering.

Without preserving the ordering of edges, station C

Search space for labeling the metro map.

Label position consistency. Label position

(Not Observed here)

An example of ambiguous labeling.

(a) perpendicular tick labels and (b) nonperpendicular tick labels.

Clustering multiple overlength edges. The edges AE and BC

Clustering stations to find nonstraight lines. Ultimately, six

20 Mexico City map: official layout.

Mexico City map: official layout, normalized to the layout

Mexico City map: undistorted layout.

Mexico City map: Author`s Layout.

Geo-Opportunistic Routing for

Therefore, we cannot directly use those protocols to support

Existing geographic routing protocols such as GPCR(Geographic

opportunistic forwarding (GeRaF) & (CBF)

A packet is greedily forwarded to a neighbouring node whose

Dashed arrows are GpsrJ+ and solid arrows are

Forwarding set selection approximation: a) shaded

where n is the number of C’s neighbours.

Uses & Applications

All the above mentioned uses and Applications can be

B. Automatic Metro Map Layout using Multicriteria Optimization

C. Geo-Opportunistic Routing for Vehicular Networks

― I hereby Conclude that these systems we have seen

For this Opportunity

You might also like