GIS based systems can be optimized to work better than ever. And this PowerPoint presentation has a few of the ways to show the same

1. 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 Geographical Information Systems (GIS) http://www.adcorporations.com

4. Solution Geographical Information Systems (GIS) 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 http://www.adcorporations.com

5. CONFLATION Conflation Process Geographical Information Systems (GIS) http://www.adcorporations.com

6. Automatic Metro Map Layout using Multicriteria Optimization Geographical Information Systems (GIS) Fig. Metro map features. http://www.adcorporations.com

7. (a) optimal angular resolution and (b) poor angular resolution. Geographical Information Systems (GIS) http://www.adcorporations.com

8. Octilinearity Geographical Information Systems (GIS) http://www.adcorporations.com

9. Table: Octilinearity Criterion Geographical Information Systems (GIS) http://www.adcorporations.com

10. (a) poor line straightness and (b) improved line straightness. Geographical Information Systems (GIS) http://www.adcorporations.com

11. Enforcement of the relative positions when moving a station. Geographical Information Systems (GIS) The gray-shaded area shows the degree of freedom afforded to (a) station A and (b) station C. http://www.adcorporations.com

12. Preservation of edge ordering. Geographical Information Systems (GIS) Without preserving the ordering of edges, station C would be able to move as shown, changing the topology of the map. http://www.adcorporations.com

13. Label Criteria Geographical Information Systems (GIS) Search space for labeling the metro map. http://www.adcorporations.com

14. Label Criteria Geographical Information Systems (GIS) Label position consistency. Label position consistency. (Not Observed here) http://www.adcorporations.com

15. Label Criteria Geographical Information Systems (GIS) An example of ambiguous labeling. http://www.adcorporations.com

16. Label Criteria Geographical Information Systems (GIS) (a) perpendicular tick labels and (b) nonperpendicular tick labels. http://www.adcorporations.com

17. Clustering Geographical Information Systems (GIS) 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. http://www.adcorporations.com

18. Clustering Geographical Information Systems (GIS) Clustering stations to find nonstraight lines. Ultimately, six clusters will be identified in this graph: (BC), (CD), (DE), (GH), (HI), and (IJK). http://www.adcorporations.com

19. Example & Trial of the System Geographical Information Systems (GIS) 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) http://www.adcorporations.com

20. Example & Trial of the System Geographical Information Systems (GIS) Mexico City map: official layout. http://www.adcorporations.com

21. Example & Trial of the System Geographical Information Systems (GIS) Mexico City map: official layout, normalized to the layout software style. http://www.adcorporations.com

22. Example & Trial of the System Geographical Information Systems (GIS) Mexico City map: undistorted layout. http://www.adcorporations.com

23. Example & Trial of the System Geographical Information Systems (GIS) Mexico City map: Author`s Layout. http://www.adcorporations.com

24. Example & Trial of the System Geographical Information Systems (GIS) http://www.adcorporations.com

25. Geo-Opportunistic Routing for Vehicular Networks Geographical Information Systems (GIS) 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. http://www.adcorporations.com

28. Solution Geographical Information Systems (GIS) 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 http://www.adcorporations.com

29. Opportunistic Routing Geographical Information Systems (GIS) Dashed arrows are GpsrJ+ and solid arrows are GPCR. http://www.adcorporations.com

30. TO-GO DESIGN Geographical Information Systems (GIS) 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. http://www.adcorporations.com

31. FSS Geographical Information Systems (GIS) 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. http://www.adcorporations.com

32. FSS Analysis Geographical Information Systems (GIS) 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(n 2 ) where n is the number of C’s neighbours. http://www.adcorporations.com

35. References Geographical Information Systems (GIS) [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/ http://www.adcorporations.com

36. Any Questions? Geographical Information Systems (GIS) http://www.adcorporations.com

37. Thanks a lot ! For this Opportunity Geographical Information Systems (GIS) http://www.adcorporations.com