# Project Idea | Fast Transplant

**Project Title:** Fast Transplant

**Introduction:** Organ transplantation in India comes with a varied number of unwanted discrepancies. Lack of an efficiently centralized metadata to generate potential matches in real-time as well as transport issues and traffic congestions pose a major threat to successful transplantations in a diverse country like India. Efficient route tracking architectures coupled with proper statistical and data analysis systems can help generate a roughly accurate database with potential matches spontaneously to tackle these emergencies and thereby reduce fatalities.

- Living Donor – Kidney
- Brain or Cardiac death – Can donate all organ

**The goal of the project is to** locate cases of immediate transplantation due to accident or any other incident, search the database and a match which is the closest donor.

Our implementation is based on the following methodologies:

- To host an interlinked database of all the hospitals (data of donor and recipient).
- Statistical Data Analysis to sort out potential donor-recipient matches.
- A GPS system to track the possible routes among the potential matches.
- Real-time traffic signal optimization.
- Dijkstra’s Algorithm to find the shortest path from the donor hospital to acceptor hospital.

(As cadaveric donor can donate multiple organs and tissues so the searching will be done for multiple recipients’ needs.)**Implementation:**

**Hosting the Database:**The first step of our suggested model is about data collection and hosting on an interlinked database to genuinely registered hospitals having a sound history of successful transplantations. The database consists of medical data collected from all the possible hospitals. The various parameters necessary for a transplant is managed under a well organized constructed dataset with the scope of real-time update and modification of data based on fresh entries or unwanted scrap data. The centralized database is like a cloud storage that can be easily accessed from all the concerned hospitals in case of emergency and desired needs and updated under authorized access protocols. This dataset acts as a tool or a precursor to the step where the data is analyzed as required using various algorithms so as to ensure the best match with the most efficient techniques to ensure minimum casualties and successful and fast organ transplantation on a global scale.**Data Analysis using Machine Learning Algorithms:**This step is largely dependent on the database collected and maintained based on which various algorithms and optimization techniques can be incorporated so as to derive the best possible donor-recipient match in accordance to predefined results and outcomes. Our suggested method to perform such analysis is by using supervised learning algorithms and neural networks on the already present dataset and predicting the most accurate match for new cases. We divide the dataset under scrutiny into 60%, 20%, 20% subsets. The 60% of the dataset is our training set on which the algorithms like linear regression models and well as support vector machines, decision trees, AdaBoost classifiers and neural networks are used to train our system. Now the next 20% data is used as a cross-validation step to cross verify and perform required modifications on our used algorithm or approach. Finally, the remaining 20% is used as a test set. The prediction results of these test cases are closely monitored with the results with our train set and thereby respective accuracies with various classifiers are noted. Finally, the best possible approach with the most efficient time complexity is preferred that can be incorporated in the final model and can predict immediate and accurate donor-recipient matches in case of serious emergencies.**Tracking System based on GPS:**This step is the pivotal step after the data analysis is done and possible donor-recipient matches are located. The use of the Global Positioning System is made to track all possible routes to the selected hospitals with potential matches and create a virtual graph with several nodes. This derived weighed graph (with the weights denoting respective path lengths) is now processed through the shortest path algorithm to find the shortest possible route to the best match.**Dijkstra’s Algorithm for shortest path:**This step of our framework is utilized to determine the minimum and most effective route for organ transport. Suppose we find out that ‘n’ number of roads with minimum traffic congestion to the target hospitals is possible through data analysis and aforementioned VANET architecture. The task is to find the shortest route among the best possible ‘n’ options to reach the desired location with minimum delay.

To achieve this, Dijkstra’s algorithm is used.

We first construct a directed graph with the donor hospital marked as the source vertex. We then design the graph with each traffic signal and potential hospitals (with donation possible or not marked distinctly based on real-time analysis) as individual nodes by assigning each edge with their distances (extracted from GPS data). The hospitals are denoted by nodes represented by N_{i}and P_{i}. Based on data analysis and VANET routing architecture we find the hospitals denoted by P_{ I}as the potential donor hospitals. Finally, we apply Dijkstra’s Algorithm to find the shortest path from the potential donor hospitals to the recipient (source vertex) hospital and decide the fastest route to the nearest hospital.

Below is a sample implementation of our suggested idea:

After applying the algorithm to the following sample, we find that**Hospital: P3**has the fastest route to the recipient**Hospital: S**.

(The fastest route has been indicated by red colour)

(Mentioned weights/distances are just for representational purposes)**Real-time Traffic Signal Time reduction:**This step of our framework is a suggested modification to the already existing traffic system. It is based on the implementation of the previous step to obtain the shortest route among all possible hospitals. The main target is an attempt to dynamically optimize the traffic signalling through real-time vehicular tracking through GPS. As soon as the selected route is finalized, the transport is executed such that the traffic throughout the whole process stays green.

The suggested idea is that, as and when an ambulance reaches a specific distance (say, ‘D’) from a signal, two of the following cases may arise-- If the signal is already green and the ambulance being at a distance-‘d’ (d<D), the signal turns red; then the time elapsed for the red to revert back to green is reduced and the next green signal stays for a longer duration to ensure uninterrupted passage.
- If the signal is already red, the next green signal stays for a longer duration.
- The first ten columns, D
_{i}(i varies from 1 to 10, considering 10 signals) shows the distance from a particular signal ‘i’ from the ambulance at each instance. The next 10 columns D_{i}shows the signal state (green/red) and the corresponding signal durations for specific instants. The last column shows the time in seconds. - Assuming that 1400 is the predefined range from every signal to the ambulance distance at a concerned instant.
- The first highlighted box shows that the distance from the first signal is 1383 at time 6 secs. The distance is now clearly within the predefined range (1400), so the state of the first signal is modified accordingly. The signal before the ambulance reached within the range of 1400 was green; we the wait for the signal

to revert back to red within the time-frame before it crosses the signal. - Our suggested algorithm now reduces the signal duration of red (from 30 secs to 20 secs) accordingly

such that there is the minimum time lag for the ambulance waiting time at the signal under investigation shown in the second highlighted box. - The third highlighted box shows that after the red signal duration is reduced the following green signal elapsed time is increased (by 100 secs) so as to ensure uninterrupted passage with minimum time delay through the first signal.
- The first highlighted box shows that the distance from the sixth signal is 1398 at time 126 secs. The distance is now clearly within the predefined range (1400), so the state of the first signal is modified accordingly. The signal before the ambulance reached within the range of 1400 was red; the following green signal time elapsed will be increased (by 100 secs) such that the ambulance passes the sixth signal smoothly.

The suggested architecture can be incorporated real-time by replacing the present predefined timer based IC controlled traffic system with a microcontroller based system.

Following is an example to demonstrate the idea on a small dataset:**First case:****Second Case:**The simulation results analyzed above matches with our proposed model that as and when the ambulance traverses a particular signal; the algorithm ensures that it stays green and there’s no time delay as well as not compromising with the traffic hassles at that instant.

**Conclusion:** This type of traffic optimization technique can be incorporated to tackle for various day-to-day issues like firefighting and similar urgent situations requiring immediate maneuvering through the busy roads efficiently.

**Team Members:**

- Pratik Basu
- Sobhan Mondal

**Note:** This project idea is contributed for ProGeek Cup 2.0- A project competition by GeeksforGeeks.

## Please

Loginto comment...