International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 4 Issue: 4 627 - 630

_______________________________________________________________________________________________
Avoiding Traffic Congestion Based on MHR tree in Carpool Services

R. Prasanthini1, M.Phil., Scholar Dr. K. Kavitha2,Asst.professor

Department of Computer Science Department of Computer Science
Mother Teresa Womens University Mother Teresa womens University
Kodaikanal, India. Kodaikanal, India.
Prasanthiniravi14@gmail.com

Abstract Modern economic development has resulted in urban and industrial growth, leading to rapid increases in the number of vehicles on
roadways and, thus, severe traffic congestion problems in large cities around the world. Carpooling is one of the most valuable solutions to
traffic congestion. Carpooling is the sharing of car journeys so that more than one person travels in a car. In this paper, an advanced carpool
system is described in detail and called the intelligent carpool system (ICS), which provides carpoolers the make use of the carpool services via
a smart handheld device anywhere and at any time. It is critical to develop algorithmic methods for optimally matching drivers and passengers
on the service agency of the ICS system. To give system users the opportunity to obtain carpool matches anywhere and at any time, drivers and
passengers similar can use the MC module to perform carpool operations (e.g., requesting and offering rides) via their mobile devices. MHR
tree, for efficiently answering approximate string match queries in large spatial databases.

Keywords- Intelligent carpool service(ICS), Mobile Clients (MC)

__________________________________________________*****_________________________________________________

participation rates are relatively small [1]. A ride-share

I. INTRODUCTION
The main aim of carpooling is to provide an effective
solution to a traffic congestion problem by allocate their vehicle
with one or more drivers whose destinations are identical. It
helps environment by decreasing the rate of vacant seats by
increasing the rate of occupation. There are a small number of
carpooling systems which are already present in the World but
they are web based and simply have choice to send a request
option for a specific date and time and give a exact result.
Some of the carpool use the aspect of several systems
feature a digital GIS mapping facility by which to provide
a visual tool with exact location information to users.
Unfortunately, these systems are neither efficient nor suitable
for users who want real-time carpool matches and no
security present. An intelligent carpool system which gives
proper algorithm using MHR-Tree.Drivers and passengers can
immediately access real time carpool service via the structure of
ICS, with their current location and other necessary information
input by their smart phone or other devices. The mobile
computing module is used to perform carpool operations (e.g,
requesting and offering rides) via their mobile devices.
II. RELATED WORKS
Smartphone technology enables dynamic ride-sharing
systems that bring together people with similar journey and
time schedules to share rides on short-notice. Increasing the
number of travelers per vehicle trip by effective usage of empty
car seats by ride-sharing may of course enhance the efficiency
of private transportation, and contribute to reducing traffic
congestion, fuel consumption, and pollution. Moreover, ride-
sharing allows users to share car-related expenses such as fuel
costs. The simulation results suggest that dynamic ride-sharing
may represent a useful option to reduce system-wide vehicle
miles, reduce trips and save travel costs, even when
IJRITCC | April 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
provider, either private or public, helps people to establish ride-
shares on short-notice by automatically matching up drivers and
riders. The objectives of the ride-share provider and ride-share
users are aligned because both the total travel costs of the users
and the external costs to society relate to the total system-wide
vehicle-mile[2].
III. PROPOSED SYSTEM
This paper presents a novel index structure, MHR-
tree, for professionally answering approximate string match
query in large spatial database. The MHR-tree is based on the
R-tree increased with the min-wise signature and the linear
hashing technique. For a range query r, start from the root and
check the MBR of each of its children, then recursively visit
any node u whose minimum bounding rectangle (MBR)
intersects or falls inside r. When a leaf node is reached, all the
points that are inside r are return. R*-trees achieve better
performance in general than the original R-trees. This is general
view of MHR tree. MHR tree is created using whole dataset
given for searching and arranged depending on their ranges. For
searching it takes leaves keywords and then search within them
(keywords). Here we are using hashing for searching the
keywords. For each source passed same key and whenever we
give any keyword query then flag values (number of times
keywords find out) along with their key values get displayed.
Introduces a new index for answering ESAS queries powerfully
which embeds min-wise signatures of q-grams from sub trees
into the R-tree nodes. The RSASSOL method separates the road
network, adaptively search relevant sub graph, and prune
candidate points using both the string identical index and the
spatial reference nodes. By using the MHR-Tree is able to find
the optimum carpool route and matching results both accurately
627
 International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 4 627 - 630
_______________________________________________________________________________________________
and quickly in accordance with the optimization of all
A QUERY
objectives[18]

Spatial Approximate String Search

Step 1 : Find all the sub graphs that

intersect with the query range

MHR-tree

Step 2 : Use the Filter trees to retrieve the

points with strings that are potentially similar
RSASSOL to the query string
Algorithm

Location Based Search Step 3 : Prune away the candidate points by

calculating the lower and upper bounds of their
Fig 1. ARCHITECTURAL DIAGARM distances to the query point
A. RSASSOL ALGORITHM
The paper on spatial approximate string search
presents a comprehensive study for spatial approximate string
queries in road networks. We use the edit distance, cosine Step 4 : Prune away the candidate points using
similarity as the similarity measurement for the string predicate the exact edit distances between the query string
and candidate string
and focus on the range queries as the spatial predicate. Given a
query, the RSASSOL algorithm on road network returns the
best objects with shortest path to the query location and textual
relevance to the query keyword. [3]
Step 5 : check the exact distances of the
B. LOCATION BASED SEARCH remaining candidate points to the query point
The location based search is based on the distance
between a user specified location and locations that are based
on the maps available in the web. The passenger can give the
latitude & longitude details that location also viewed by map. Query result
The location based search consists of Information Platform it
has Information Retrieval, Information Matching, Mutual FIG 2.RSASSOL ALGORITHM
Selection.
E. MUTUAL SELECTION
C. INFORMATION RETRIEVAL Drivers (passengers) choose passengers (drivers)
Drivers contact the information platform, release according to their own requirements and the initial matching
carpooling information such as vehicle running time and routes, details; if they select each other, then the matching will be
and query the passenger details. Passengers login the system, successful. Otherwise, the system will maintain matching
submit carpooling applications, namely journey time, location, details. The carpooling information will be processed by the
and route information, and verify the driver information. platform once released by both sides. The system will send the
matching details to drivers and passengers for mutual selection.
D. INFORMATION MATCHING
Passengers judge the drivers driving skill and the vehicle
The information system summarize drivers time, condition. Drivers check the number of passengers, the working
routes information, and passengers carpooling require information place, and time. If fulfilling mutual selection cannot be reach,
and match them reasonably. Then the matching result will be feed the system will match information again until both sides are
back to both sides in time so as to complete the next step. satisfy with the matching results so as to understand the
humanized carpooling and improve the carpooling efficiency.
628
IJRITCC | April 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
 International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 4 627 - 630
_______________________________________________________________________________________________
5. if (u is a leaf node)
6. for (every point p up)
INFORMATION 7. if (p is contained in r)
PLATFORM 8. if (|Gp G| max(|p|, ||) 1 ( 1) q)
9. if ((p, ) < ) Insert p in A;
10. else
11. for (every child entry ci of u)
12. if (r and MBR(wi) intersect)
Information Information Mutual 13. Calculate s(G = Gwi G) based on s(Gwi ), s(G) and
Retrieval Matching Selection Equation 4.1;
14. Calculate |Gwi G| using Equation 8 in [37];
FIG 3.LOCATION BASED SEARCH 15. if (|Gwi G| || 1 ( 1) q)
16. Read node wi and insert wi into B;
F. MC Module
The MC module is a mobile application built on Objects Spatial Data
sophisticated mobile operating system such as ios, Android,
Windows Phone, and so on. It features an included GPS receiver Road &
and capability for mobile communication. Because of this, users Distance
can obtain information about their present locations by
Query Updates
automatically accessing the GPS signals of satellites and can also
retrieve geo resource map images over the Web Map Service
(WMS) application programming interface (API) to precisely
pinpoint their pickup and destination location. Using the MC Database and
Data source
module, users can both offer carpool rides as drivers and send RSAS
carpool requests as passenger. When drivers and passenger are in
the same regional range, a group of users offers and requests will
help them find proper carpool partners[17]. PREPROCESS

IV. METHODOLOGY Sub String

A. The query algorithm for the MHR-tree Select Range Data

The query algorithms for the MHR-tree generally follow the same
principles as the related algorithms for the spatial query
component. However, we would like to incorporate the pruning R-tree
method based on q-grams and set resemblance estimation without
the explicit knowledge of Gu for a given R-tree node u. We need to Eliminates the
achieve this with the help of s(Gu). Thus, the key issue boils down Unwanted Results
to estimating |Gu G| using s(Gu) and . The details of
estimating |Gu G| is demonstrated in Section in [4].The SAS Sub tree and Indexing
range query algorithm is presented in. One can also modify the
KNN algorithm for the normal R-tree to derive the KNN-MHR
Calculate Distance
algorithm. The basic idea is to use a priority queue that commands According to
objects in the queue with respect to the query point using the Results Select data By Distance
MinDist metric. However, only nodes or data point that can pass
the string pruning test will be inserted into the queue. Whenever a
point is detached from the head of the queue, it is inserted in A.
The search terminates when A has k points or the priority queue
becomes empty[16]. Results
Range- MHR(MHR-tree R, Range r, String , int )
1. Let B be a FIFO queue initialized to , let A = ;
FIG 4.WORK FLOW DIAGRAM
2. Let u be the root node of R; insert u into B;
3. while (B 6= )
4. Let u be the head element of B; pop out u;
629
IJRITCC | April 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 4 627 - 630
_______________________________________________________________________________________________
V. CONCLUSION
In this paper carpooling Services based on fixed time and
routes. The MC module enables the drivers and the passengers
to respectively send their carpooling requests via a mobile
application on their mobile devices. MHR-Tree is to control an
adaptive algorithm that discover reasonable partitions of nodes
from R-tree-based index based on spatial as well as string
information in R-tree nodes. To support well-organized
approximate string search on a gathering of strings, which is
employed as a module in query algorithm. The drivers and
passengers also have the option of rating each other after their
ride is over to share their experiences with each other and such
ratings can also viewed by future potential carpooling partners.
VI. REFERENCES
[1] AlanErera, Dynamic Ride-Sharing: a Simulation Study in
Metro Atlanta.
[2] Xing Wang, Optimizing Ride Matches For Dynamic Ride-
Sharing Systems
[3] BinYao ,Mingwang Tang,MariosHadjieleftheriou. Spatial
Approximate String Search; IEEE TRANSACTIONS ON
KNOWLEDGE AND DATA ENGINEERING VOL:25
NO:6 AYEAR 2013
[4] B. Yao, F. Li, M. Hadjieleftheriou, and K. Hou. Approximate
string search in spatial databases. In ICDE, 2010
[5] EDITDISTANCEMETRICBASEDAPPROXIMATESTRI
NG SEARCH author M.Shashidhar1, J.Sudhakar.
[6] Location Based services ByUusing RSASSOL Agorithm For
Time Consumption In Mobile Computing.
[7] Z. Qinghe, Design and implementation of mobile
carpooling system based on web service, Geospatial
Information, no. 4, pp. 8587, 2013. View at Google Scholar
[8] Carmas Home Carmas, Carmas Corporation, accessed
April 22, 2014.[Online]. Available:
https://carmacarpool.com/
[9] Sidecars Home, Sidecars Corporation, accessed April 22,
2014. [Online]. Available: http://www.side.cr/
[10] Flincs Home, Flincs Corporation, accessed April 22,
2014. [Online].Available: https://flinc.org/
[11] Zimrides Home, Zimrides Corporation, accessed April
22, 2014.[Online]. Available: http://www.zimride.com/
[12] go2gethers Home, go2gethers Corporation, accessed
April 22, 2014. [Online]. Available:
http://www.go2gether.ca/
[13] N. Agatz, A. L. Erera, M. W. P. Savelsbergh, and X. Wang,
Optimization for dynamic ridesharing: A review, Eur. J.
Oper. Res., vol. 223, no. 2,pp. 295 303, Dec. 2012.
[14] P. Bianco, R. Kotermanski, and P. Merson, Evaluating a
ServiceOriented Architecture, Software Engineering
Institute, Pittsburgh, PA,USA, CMU/SEI- 2007-TR-015,
Sep. 200
[15] Range query Group In Spatial Networks Using Dual
Distance Measurement .
[16] Survey on Spatial Keyword Search Author by Bin
YaoDepartment of Computer Science Florida State
University.
[17] A Genetic-Algorithm-Based Approach to Solve Carpool
Service Problems in Cloud Computing Author by
Shih-Chia Huang, Ming-Kai Jiau, and Chih-Hsiang Lin.
[18] Keyword Query Routing Using MHR Tree Prachi Karale1
, Natikar S. available at: www.researchpublish.com.

630
IJRITCC | April 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________