Finding the Nearest Blood Donors using Dijkstra Algorithm

Now-a-days frequent mishaps like the road accident or other life-risking accident leading to operational emergencies are increasing day by day and the blood donor for such victims or patients are very hard to find in a short period. Sometimes it is really tough to collect the blood of the same group from the relatives of a patient in dying moments. The main objective of this work is to make a connection with these two groups who are in need of blood and who are willing to donate. We have determined the shortest distance between blood seeker and blood donors using the Dijkstra Algorithm. Anybody can contact the nearest blood donor of any group in a particular area quickly. By implementing this idea, the harassment of the victim can be lessened and so many lives can be saved. Keywords— Blood donor, Blood Seeker, Dijkstra’s algorithm, Shortest path, Nearest Donor


INTRODUCTION
According to the Global Health Observatory (GHO) data by WHO, there were 1.25 million road traffic deaths globally in 2013.The number is incessantly increasing with the increasing urbanization.Some of the victims of such mishaps who have plausibility of survival are in need of blood donation and these demands are growing continuously.On the other hand, the number of people interested in blood donation is not so small now-a-days.The main obstacle we face till now is to find the eligible donor nearest to the hospital so that no victim dies in need of blood.
The Dijkstra [1][2] is a graph search algorithm to find the shortest distance between nodes with non-negative edges of a graph.Usually, it checks the entire unvisited node from a single source to all other nodes and updates the information if the total distance is smaller than the previous record.Then it marks the particular node as visited.By using the theory of this algorithm, the shortest path can be determined among the donors.That's how the implementation can be done and the problem can be solved.

RELATED WORK
The application of Dijkstra algorithm is so broad.There are many instances of implementation based on this algorithm.Some related works based on this algorithm are described below: A. Risald, Antonio E. Mirino and Suyoto [5] In this work, they used

H. Yan Zhang and Jun Zhang [12] A robust
optimization method is applied to select the hub aerodromes in the airline network and the Dijkstra algorithm is to improve the solution.
Similar with this research and project, this algorithm can be used in different sector like composing way selection [13], VLSI routing [14], optimal path planning for aircraft carrier [15] and so on.

PROPOSED METHODOLOGY
Dijkstra algorithm is the solution of the optimal pathfinding to the single source.Both directed and undirected graph with nonnegative weight values is considered for the algorithm.The graphs must be connected to find the optimal result.It will check each unvisited node and update the optimal result.
If we consider a country or a city as a graph, for the victim in need of blood, the blood seeker will be the single source and the interested donors of the city will be the nodes.Now we have to find the distances between each of the interested donors from the victim and the minimal distance will be determined and shown as an output.We will also consider the status e.g.active or inactive in online to select the best possible users.
We have developed an android application to serve the purpose of our work.The main objective is to find the potential blood donors from a particular place.A user can search by their choice.This project can assist to save a life by managing potential donors effectively.It can considerably reduce the time of finding the donors.

Flow Chart of the proposed method
Outline of the proposed method is described:  At first, the users have to login to our system using their credentials.

Algorithm Used
We have calculated shortest distance between the blood seekers and donors using the Dijkstra algorithm.But we have to customize the classical algorithm to fulfill our purpose.We have applied single source all pairs Dijkstra algorithm to find minimum distance from blood seeker [16].

Algorithm's Step
We have to consider the following assumptions:  Node: The registered user in the system with active GPS  Edge: The relationships between the blood donors and seekers  Starting/Source Node: The blood seeker  Weight: The distance among the users

Steps of this algorithm are:
1. Set all donors distance with infinite and the seeker with zero.
2. Update the value of the distance of donor's distance by adding the distance with the weight of that specific donor.3. Update distance of a donor if the distance of a node is less than the current distance.4. Repeat steps 2 and 3 until all donor's distance reach its minimal distance from blood seekers. 5. Match the blood group of the donors with seeker's group 6.Show the blood donors with minimal distance from blood seeker of matched blood group

Complexity Analysis
The whole process needs O(|E|+|V|/log |V|) times [3][4] for the worst case to terminate the operation.

IMPLEMENTATION
From the app, a user can search the blood donor of any group.If the user wants to be the blood donor then he must have to register first.After completing the registration process a user must go through a login operation.By completing login operation, a user can donate blood in future.
The output will be shown on a map which will help the user to find the potential blood donors within a particular area [Fig .04].The user can contact the blood donors.Thus, the application will help the blood seeker to find out the nearest active blood donors.

CONCLUSION
Due to lessening the sufferings of people, this project will help them to find the nearest blood donor from a particular area.It makes the procedure easier and faster.Consequently, many seriously wounded people may survive if they are able to find donors timely.By implementing this work, the people will be benefitted and the rate of death can be reduced.Finding a suitable blood donor in the nearest area can be less time consume and will increase the survival rate of the dying patient.

Figure 01 :
Figure 01: Flow Chart of Proposed Architecture

Figure 02 :
Figure 02: Register Figure 03: Login Figure 04: Finding the nearest blood donors