IRJET - Coarse Grain Load Balance Algorithm for Detecting

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 07 Issue: 03 | Mar 2020 www.irjet.net p-ISSN: 2395-0072
© 2020, IRJET | Impact Factor value: 7.34 | ISO 9001:2008 Certified Journal | Page 3793
Coarse Grain Load Balance Algorithm for Detecting
S.GAYATHRI1, J.KAVITHA2, V.LEENA3
1Assistant Professor, Department of CSE, Jeppiaar SRR Engineering College, Padur, Chennai.
2,3 Department of CSE, Jeppiaar SRR Engineering College, Padur, Chennai.
----------------------------------------------------------------------***--------------------------------------------------------------------
Abstract – DNA information addresses the matter of
sharing person-specific genomic sequences while not
violating the privacy of their information subjects to
support large-scale medical specialty analysis comes.
The projected technique builds on the framework
however extends the leads to variety of the way. One
improvement is that our theme is settled, with zero
chance of a wrong answer. We have a tendency to
additionally offer a brand new in operation purpose
within the reference frame tradeoff, by giving a theme
that’s doubly as quick as theirs however this time is
intended by the very fact that storage is cheaper than
computation in current cloud computing evaluation
plans. Moreover, our cryptography of the information
makes it attainable for us to handle a richer set of
queries than precise matching between the question
and every sequence of the information.
Index terms: DNA Databases, Cloud Security, Secure
Outsourcing.
1. INTRODUCTION
DNA or Polymer is the medium of longtermstorageand
transmission of genetic information for all modern
living organism. Human polymer information (DNA
sequences among the 23 chromosome pairs) are
personal and sensitivepersonalinformation.However,
such information is crucial for conducting medicine
analysis and studies, for instance, diagnosing of pre-
disposition to develop a particular sickness, drug
hypersensitivity reaction, or prediction of success rate
in response to a selected treatment. Providing a
publiclally offered polymer information for fostering
analysis during this field is especially confronted by
privacy considerations. Today, the plethoric
computation and storage capability of cloud services
permits sensible hosting and sharing of polymer
databases and economical process of genomic
sequences, like acting sequence comparison, precise
and approximate sequence search and varied tests
(diagnosis, identity, ancestr0y and paternity). What is
missing is an economical security layer that preserves
the privacy of individuals’ records and assigns the
burden of question processing to the cloud. Whereas
anonymization techniques like de-identification [2],
information augmentation [3], or information
partitioning [4] solve this drawback partly, they're not
adequate as a result of several cases, re-identification
of persons is feasible [5]. It follows that the DNA
information should be protected, not simply unlinked
from the correspondingpersons.Inthispaper,wehave
a tendency to take into account the framework
projected in [1] wherever the DNA records returning
from many hospitals are encrypted and keep at a
knowledge storage site, and medical researchers are
able to submit aggregate count queries to the current
website. Count queries are significantly attention-
grabbing for applied mathematics analysis. The paper
provides a new technique thataddressesabiggersetof
issues and provides a quicker question latent period
than the technique introduced in [1].
The approach is predicated on the very fact that,given
current valuation plans at several cloud services
suppliers, storage is cheaper than computing.
Therefore, we have a tendency to favor storage over
computingresourcestooptimizevalue.Moreover,from
a user expertise purpose of read, latent period is that
the most tangible indicator of performance; therefore
it's natural to aim at reducing it. Our technique
enhances the state of the art at each abstract level and
also the implementation level.
2. RELATED WORKS
There is no universal methodology to make a protocol for
secure multi-party computation and handling mixture
queries on encrypted information isn’t an exception. Many
holomorphic systems solely support a set of mathematical
operations, like addition, or exclusive- From a security
perspective, solely the additive and also the increasing are
classified to be IND-CPA (stands for in distinguishability
underneath chosen plaintext attack). Partly holomorphic
cryptosystems areadditional fascinatingfroma performance
purpose of readthansomewhatholomorphic cryptosystems,
that support a restricted operation depth. Totally
holomorphic systems have a large price and can’t be
deployed in follow.

2.1 SECURING AGGREGATE QUERIES FOR DNA
DATABASES
The Securing aggregate queries for deoxyribonucleic acid
databases designed with the methodology of Smith worker
ordering sequence comparison algorithmic program. The
galore computation and storage capability of cloud services
allows sensible hosting and sharing ofdeoxyribonucleicacid
databases. we've got conferred 2 new in operation points
within the reference system trade-off of the non-public
question drawback.
2.2 DESIGN OF CAPACITY APPROACHING CONSTRAINED
CODES FOR DNA-BASED STORAGE SYSTEMS
The Design of Capacity-Approaching Constrained Codes for
DNA-based Storage Systems. It is necessary for the third
party to ensure that query results, or the combination of a
series of query results issued by a researcher, do not permit
the triangulation of an individual’s record. The
trustworthiness of the system is completely dependent on
our ability to trust the third parties.
2.3 SECURE DYNAMIC SEARCHABLE SYMMETRIC
ENCRYPTION WITH CONSTANT DOCUMENT
UPDATE COST
The Secure Dynamic Searchable Symmetric Encryptionwith
Constant Document Update Cost is based on the
methodology of symmetric Encryption Algorithm. Which
achieves validity, privacy and fairness as stated under the
assumption that factoring large integers is computationally
intractable. It deals with the same general problem, the
addition of the fairness property is the new motive which
leads to the present work.
2.4 SCALABLE ANDSECURESHARINGOFPERSONAL
HEALTH RECORDS IN CLOUD COMPUTING USING
ATTRIBUTE-BASED ENCRYPTION
The Scalable and Secure Sharing of Personal Health Records
in Cloud Computing Using Attribute-Based Encryption is
based on the methodology of Attribute-based Algorithm
(ABE). This model guarantees that parties who correctly
follow the protocol do not have to fear seeing data they are
not supposed to. A formal definition can be found. They
developed a framework for secure multiparty computation
and proved that computing a function privatelyisequivalent
to computing it securely.
3. EXISTING SYSTEM
Human Deoxyribonucleic Acid information (DNA sequences
inside the twenty three body pairs) are non-public and
sensitive personal data. However,suchinformationiscrucial
for conducting medicine analysis and studies,asanexample,
designation of pre-disposition to develop a selected
unwellness, drug allergic reaction, or prediction of success
rate in response to a selected treatment. Providing a public
obtainable deoxyribonucleic acid information for fostering
analysis in this field is principally confronted by privacy
issues. Today, the extensive computation and storage
capability of cloud services permits sensible hosting and
sharing of deoxyribonucleic acid databases and economical
process of genomic sequences, like acting sequence
comparison, precise and approximate sequence search and
numerous tests (diagnosis, identity, ancestryandpaternity).
What’s missing is a cost-effective security layer that
preserves the privacy of individuals’ records and
assigns the burden of question process to the cloud.
Whereas anonymization techniques like de-
identification [2], data augmentation [3], or data
partitioning [4] solve this downside part, they don’t
seem to be adequate as a results of many cases, re-
identification of persons is possible
3.1 PROPOSED SYSTEM
The system provides a brand new technique that addresses
a bigger set of issues and provides a quicker questionlatency
than the technique introduced. Our approach is predicated
on the actual fact that, given current rating plans at several
cloud services suppliers, storage is cheaper than computing.
Therefore, we tend to favor storage over computing
resources to optimize value. Moreover,froma userexpertise
purpose of read, latency is that the mosttangibleindicatorof
performance; hence it’s natural to aim at reducing it. Our
technique enhances the state of the art at each the abstract
level and the implementation level. Moreover, our
encryption of the information makes to handlea richersetof
queries than actual matching between the question and
every sequence of the information.

Figure :Architecture diagram
4. MODULES
Privacy preserving
Secure Outsourcing
Aggregate queries
Sequence testing
Set match query
Hiding from the decrypting server
4.1 PRIVACY PRESERVING
Hospitals need to safeguard the confidentiality of the
deoxyribonucleic acid sequences that they own and no
external party has the proper to access these
deoxyribonucleic acid sequences for privacy reasons. Thus,
alternatives parties (be it the server or the clients) ought to
solely work on encrypted sequences and never have access
to the deoxyribonucleic acid. In this, modules the file that is
hold on by the hospital are going to be encrypted and so
keep in clouds.
DFD FOR SUPPLIER RAW MATERIAL
Figure 4.1 Privacy Preserving
4.2 SECURE OUTSOURCING
The encrypted file will be outsourced to the clouds. The
result direct not only to provide private and access
controllability of outsourced data with strong coding
guarantee, but, more importantly, to attain specific security
requirements from different cloud services with effective
systematic way.
DFD FOR SECURE OUTSOURCING
Figure 4.2 Secure Outsourcing
4.3 AGGREGATE QUERIES
In this modules, vital queries have ousually within the type
of what number records contain a diagnosing of illness and
cistron variant. Secure outsourcing of the information base
and permitting such style of queries while not requiring the
server to decode the data. In this hospital can set the
deoxyribonucleic acid by an overloadsequenceofcharacters
from the alphabet representing the four ester varieties.This
alphabet will be combined with additional characters
representing increased within the sequence.
DFD FOR AGGREGATE QUERIES
Figure 4.3 Aggregate Queries

4.4 SEQUENCE TESTING
In Sequence Testing, the queries on DNA need to take into
account various errors such as irrelevant mutations,
incomplete specifications and sequencing errors.Clientsare
authorized entities in which they are allowed to perform
queries on the encrypted DNA sequences.
4.5 SET MATCH QUERY
In Set match Query, it will authenticate that the query which
is asked by the researcher match with the query which is
given by the cloud. The hospital will set the alphabetical
sequence of DNA, and the same the Alphabetic sequence
have to be given by the researchers.
4.6 HIDING FROM THE DECRYPTING SERVER
In this modules, the hospital will store the encrypted file to
the cloud. The cloud will internally make cloud1 as a key
holder and cloud2 has a data holder. In which every timethe
researcher will query the file initially the cloud1 will return
the key and if it matches with the hospital secret key then
cloud2 will return the decrypted data.
OVERALL DFD
5. HARDWARE AND SOFTWARE SPECIFICATION
5.1 Hardware Requirements
Processor - Intel Pentium
RAM - 4 GB
Hard Disk - 500 GB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA
5.2 Software Requirements
Operating System - Windows 7/8/10
Front End - HTML, Java, Jsp
Scripts - JavaScript.
Server side Script - Java Server Pages.
Database - My sql
Database Connectivity - JDBC.
5.3 Technologies Used
J2EE (JSP, Servlet)
JavaScript
HTML
CSS
6. DATA FLOW DIAGRAM
This is the entire activitydiagramfortheentireproject.
7. CONCLUSIONS
In this paper, a completely unique authorized accessible
privacy model (AAPM) and a patient self-controllable multi-
level privacy protective cooperative authentication theme
(PSMPA) realizing 3 completely different levels of security
and privacy demand within the distributed m-healthcare

cloud computer system areprojected,followedbytheformal
security proof and potency evaluations that illustrate our
PSMPA will resist numerous varieties of malicious attacks
and much outperforms previous schemes in terms of
storage, machine and communication overhead.
8. REFERENCES
[1] T. Hara, V. I. Zadorozhny, and E. Buchmann, Wireless
Sensor Network Technologies for the InformationExplosion
Era, Stud. Comput. Intell. Springer-Verlag, 2010, vol. 278.
[2] Y. Wang, G. Attebury, and B. Ramamurthy, “A Survey of
Security IssuesinWirelessSensorNetworks,”IEEECommun.
Surveys Tuts., vol. 8,no. 2, pp. 2–23, 2006.
[3] A. A. Abbasi and M. Younis, “A survey on clustering
algorithms forwirelesssensornetworks,”Comput.Commun.,
vol. 30, no. 14-15, pp.2826–2841, 2007.
[4] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan,
“AnApplication-Specific Protocol Architecture for Wireless
MicrosensorNetworks,” IEEE Trans. Wireless Commun.,vol.
1, no. 4, pp. 660–670,2002.
[5] A. Manjeshwar, Q.-A.Zeng, and D. P. Agrawal, “An
Analytical ModelforInformationRetrieval inWirelessSensor
Networks Using EnhancedAPTEEN Protocol,” IEEE Trans.
Parallel Distrib. Syst., vol. 13, pp.1290–1302, 2002.
[6] S. Yi, J. Heo, Y. Cho et al., “PEACH: Power-efficient and
adaptiveclustering hierarchy protocol for wireless sensor
networks,” Comput.Commun., vol. 30, no. 14-15, pp. 2842–
2852, 2007.
[7] K. Pradeepa, W. R. Anne, and S. Duraisamy, “Design and
Implementation Issues of Clustering in Wireless Sensor
Networks,” Int. J. Comput.Applications, vol. 47, no. 11, pp.
23–28, 2012.
[8] L. B. Oliveira, A. Ferreira, M. A. Vilac¸a et al., “SecLEACH-
On thesecurity of clustered sensor networks,” Signal
Process., vol. 87, pp. 2882–2895, 2007.
[9] P. Banerjee, D. Jacobson, and S. Lahiri, “Security and
performance analysis of a secure clustering protocol for
sensor networks,” in Proc. IEEE NCA, 2007, pp. 145–152.
[10] K. Zhang, C. Wang, and C. Wang, “A Secure Routing
Protocol for Cluster-Based Wireless Sensor Networks Using
Group Key Management,” in Proc. WiCOM, 2008, pp. 1–5.

IRJET - Coarse Grain Load Balance Algorithm for Detecting

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Similar to IRJET - Coarse Grain Load Balance Algorithm for Detecting

Similar to IRJET - Coarse Grain Load Balance Algorithm for Detecting (20)

More from IRJET Journal

More from IRJET Journal (20)

Recently uploaded

Recently uploaded (20)

IRJET - Coarse Grain Load Balance Algorithm for Detecting