Issues [Year wise]

Year Wise :


Paper Title : ICUP: Privacy Preserving Public Auditing Mechanism for Cloud Data
Authors : B. Seetharamulu, Dr.G.V. Uma,
Affiliations :
Abstract :

af

Cloud services are used to store and sharing the information, where we can store huge volume of data as well can share among multiple users. While sharing the data among multiple users privacy of the users and data and also provide data integrity it’s a challenging issue with the present system. In order address the above issues we proposed ICUP Mechanism which performs public auditing on shared data stored in the cloud by this first privacy preserving mechanism. For auditing the integrity of shared data it utilizes the ring signature to compute the verification information. The third party auditor is able to verify the integrity of shared data in the cloud. Hence, this is the mechanism who kept the identity of signer in shared data private from third party auditor. By utilizing the auditing shared data it demonstrates efficacy and efficiency.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud computing, Public auditing, Privacy-preserving, Shared data, Third Party Auditor.

B. Seetharamulu,Dr.G.V. Uma."ICUP: Privacy Preserving Public Auditing Mechanism for Cloud Data". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.597-600, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I640.pdf,

[1]M. Armbrust , A. Fox, R. Griffith ,A.D.Joseph,R.H.Katz, A.
Konwinski, G.Lee,D. A.Patterson, A.Rabkin, I. Stoica, and
M.Zaharia, ―A View of Cloud Computing,‖ Communication softhe
ACM, vol. 53, no. 4, pp. 50–58, Apirl 2010.
[2]G.Ateniese,R.Burns,R.Curtmola,J.Herring,L.Kissner,Z.Peterson,
andD.Song,―ProvableDataPossessionatUntrustedStores,inProc.A
CMConferenceonComputer and Communications Security(CCS),
2007,pp. 598–610.
[3]C.Wang, Q.Wang, K.Ren, andW.Lou,―Privacy-Preserving
Public Auditing for Data Storage Security in Cloud Computing, in
Proc. IEEE International Conference on Computer
Communications (INFOCOM), 2010, pp. 525–533.
[4] R. L. Rivest, A. Shamir, and Y. Tauman, ―How to Leak a
Secret, in Proc. International Conference on the Theory and
Application of Cryptology and Information
Security(ASIACRYPT).Springer Verlag, 2001, pp. 552–565.
[5]D. Boneh, C. Gentry, B.Lynn, and H.Shacham, ―Aggregate and
Verifiably Encrypted Signatures from Bilinear Maps, in Proc.
International Conference on the Theory and Applications of Cryptographic Techniques(EUROCRYPT).SpringerVerlag,2003,pp.416–432.
[6] H.Shachamand, B.Waters,―Compact Proofs of Retrievability in
Proc. International Conference on theTheory and Application of
Cryptology and Information Security (ASIACRYPT). Springer
Verlag, 2008, pp. 90–107.
[7]Y.Zhu, H.Wang,Z.Hu, G.-J.Ahn, H.Hu, andS.S.Yau,―Dynamic
Audit Services for Integrity Verification of Outsourced Storage in
Clouds ,in Proc. ACM Symposium on Applied Computing(SAC),
2011, pp. 1550–1557.
[8] R. Gellman, ―Privacy in the clouds: Risks to privacy and
confidentiality from cloud computing‖, Prepared for the World
Privacy Forum, online at
http://www.worldprivacyforum.org/pdf/WPF Cloud Privacy
Report.pdf, Feb 2009.
[9] W. Itani, A. Kayssi, A. Chehab, ―Privacy as a Service: PrivacyAware Data Storage and Processing in Cloud Computing
architectures,‖ Eighth IEEE International Conference on
Dependable, Autonomic and SecureComputing, Dec 2009.
[10] Cloud Security Alliance, ―Security guidance for critical areas of
focus in cloud computing,‖ 2009, online at
http://www.cloudsecurityalliance.org.

Currently there are no Refbacks

Paper Title : Novel Decoupling Design for Voltage Control of Wind-Driven IG System
Authors : V. SRIKANTH REDDY, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

This paper addresses a systematic approach based on Eigen structure assignment to determine the mode shape and transient response of a STATCOM utilized as an exciter for induction generators (IG). A physical control scheme, including four control loops: ac voltage, dc voltage, ac active current and ac reactive current controllers, is pre-specified for the STATCOM. A synthetic algorithm is proposed to embed these physical control loops in the output feedback path. With appropriate oscillation mode design (Eigen structure) in each state variable, the STATCOM active current and reactive current will no longer be governed by the same mode but driven by new respective modes. The simulation and experimental results demonstrated that under various system disturbances, the proposed mode decoupling STATCOM is effective in regulating IG terminal voltage.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Eigen structure assignment, induction generator (IG), static synchronous compensator (STATCOM), voltage- sourced inverter (VSI).

V. SRIKANTH REDDY,G. RAVI KUMAR."Novel Decoupling Design for Voltage Control of Wind-Driven IG System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.592-596, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I639.pdf,

[1]. E. S. Abdin and W. Xu, “Control design and
dynamic performance analysis of a wind turbine
induction generator unit,” IEEE Trans. Energy
Convers., vol. 15, no. 1, pp. 91–96, 2000.
[2]. R. Cardenas, R. Pena, G. Asher, and J. Clare,
“Control strategies for enhanced power smoothing
in wind energy systems using a flywheel driven by
a vector-controlled induction machine,” IEEE Trans.
Ind. Electron. vol. 48, no. 3, pp. 625–635, 2001.
[3]. G. O. Cimuca, C. Saudemont, B. Robyns, and M.
M. Radulescu, “Control and performance
evaluation of a flywheel energy-storage system
associated to a variable-speed wind generator,”
IEEE Trans. Ind. Electron., vol. 53, no. 4, pp. 1074–
1085, 2006.
[4]. E. G. Marra and J. A. Pomilio, “Inductiongenerator-based system pro- viding regulated voltage with constant frequency,” IEEE Trans. Ind.
Electron., vol. 47, no. 4, pp. 908–914, 2000.
[5]. W. L. Chen, Y.-H. Lin, H.-S. Gau, and C.-H. Yu,
“STATCOM controls for a self-excited induction
generator feeding random load,” IEEE Trans. Power
Del., vol. 23, no. 4, pp. 2207–2215, 2008.
[6]. W. L. Chen and Y. Y. Hsu, “Controller design
for an induction generator driven by a
variablespeed wind turbine,” IEEE Trans. Energy
Convers., vol. 21, no. 3, pp. 625–635, 2006.
[7]. N. S. Wani and W. Z. Gandhare, “Voltage
Recovery of Induction Generator using Indirect
Torque Control Method”, International Journal of
Electrical Engineering & Technology (IJEET),
Volume 3, Issue 3, 2012, pp. 146 - 155, ISSN Print :
0976-6545, ISSN Online: 0976-6553.
[8]. Ameer H. Abd and D.S.Chavan, “Impact of
Wind Farm of Double-Fed Induction Generator
(Dfig) on Voltage Quality”, International Journal of
Electrical Engineering & Technology (IJEET),
Volume 3, Issue 1, 2012, pp. 235 - 246, ISSN Print :
0976-6545, ISSN Online: 0976- 6553.
[9]. Youssef A. Mobarak, “Svc, Statcom, and
Transmission Line Rating Enhancments on
Induction Generator Driven by Wind Turbine”,
International Journal of Electrical Engineering &
Technology (IJEET), Volume 3, Issue 1, 2012, pp. 326
- 343, ISSN Print : 0976-6545, ISSN Online: 0976-
6553. 

Currently there are no Refbacks

Paper Title : A Seven-Level Grid Connected Inverter for Photovoltaic system
Authors : SATHISH KUMAR, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

This paper proposes fuzzy logic controller based a single-phase seven-level inverter for grid-connected photovoltaic systems, with a novel pulse width-modulation (PWM) control scheme. Three reference signals produces from fuzzy logic controller which are identical to each other are going to compare with the amplitude of the triangular carrier signal. The inverter is capable of producing seven levels( Vab = Vdc Vab = 2Vdc/3 Vab = Vdc/3 Vab = 0 Vab =−V dc/3 Vab= − 2Vdc/3 Vab = −V dc )of output-voltage levels from the dc supply voltage. The total harmonic distortion is reduces by this control strategy. The proposed system was verified through simulation.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fuzzy logic Controller, Grid connected, modulation index, multilevel inverter, photovoltaic (PV) system, pulse width-modulated (PWM), total harmonic distortion (THD).

SATHISH KUMAR,G. RAVI KUMAR."A Seven-Level Grid Connected Inverter for Photovoltaic system". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.586-591, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I638.pdf,

[1] Nabae.A., Takahashi.I., and Akagi. H., “A new
neutral-point clamped PWM inverter”, IEEE
transactions on Industrial Applications, Vol.IA-17,
pp. 518-523, September/October 1981.
[2] Siriroj Sirisukprasert, Jih-Sheng Lai and TianHua Liu, “Optimum harmonic reduction with a sied
range of modulation indexes for multilevel
converters”, IEEE Transactions on Industrial on
Electronics, Vol.49,Issue 4, pp.875-881,August-2002.
[3] Brendan Peter McGrath and Donald Grahame
Holmes, “Multicarrier PWM strategies for
multilevel inverters”, IEEE Transactions on
Industrial Electronics, Vol.49, Issue4, pp.858-867,
August 2002.
[4] Lai.J.S., and Peng, F.Z., “Multilevel converter- a
new breed of power converters, “IEEE Transactions
on Industrial Applications, vol.32,Issue3. Pp.509-
517, May/Jun 1996.
[5] Villanueva. F, Correa, P, Rodriguez. J, Paca. M,
“Single-phase Cascaded H-bridge Multilevel
inverter for Grid connected hotovoltaic systems:,
IEEE Transactions on Industrial Electronics, Vol.56,
Issue 11,2009,pp 4399-4406.
*6+ Lee, S.J.; Bae, H.S.; Cho, B.H., “Modeling and
control of the single phase photovoltaic gridconnected cascaded H-bridge multilevel inverter”,
IEEE on Energy Conversion Congress and
Exposition (ECCE), 2009, pp. 43-47.
[7] José Rodríguez, Jih-Sheng Lai and Fang Zheng
Peng, "Multilevel inverters: a survey of topologies,
controls, and applications",IEEETransactions on
Industrial Electronics, Vol. 49, Issue 4, pp. 724-738,
August 2002.
[8] Sung-Jun, Park,Feel-Soon Kang, Man Hyung
Lee, and Cheul-U Kim,"A New Single-Phase FiveLevel PWM Inverter Employing a Deadbeat Control
Scheme", IEEE Transactions on power
electronics,Vol. 18, No. 3, May 2003, pp: 831-843
[9] Agelidis, V. G., Baker, D. M., Lawrance, W. B.,
andNayar, C.V.,“A multilevel PWM inverter
topology for photovoltaic applications,”Proceedings
of the IEEE International symposium on Industrial
Electronics, Vol. 2, pp. 589-594, July 1997, Portugal,
Guimaraes.
[10] Gui-Jia Su, “Multilevel DC-Link Inverter”, IEEE
Transactions on Industry Applications, Vol. 41, No.
3, May/June 2005, pp. 848-854.
[11] U. Indoo Niehaarika, P. Alekya Rani, K.
Lakshmi Ganesh “A NewHybrid Multilevel Inverter
with Reduced Number of Switches” in the journal
of IJIRD, Vol 2 Issue 3, March, 2013.
[12] K.Lakshmi Ganesh, U.Chandra Rao,
“Performance of Symmetrical andAsymmetrical
Multilevel inverters”, IJMER, vol.2,issue.2,MarApril 2012, pp-1819-1827.

Currently there are no Refbacks

Paper Title : Intend of Battery-Super Capacitors Arrangement in UPS
Authors : B. NAGARJUNA REDDY, SHAIK. MABHU JANI,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Assistant Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

This paper presents a study of the reduction in battery stresses by using Super capacitors (SCs) in UPS. We aim at investigating the optimal Super capacitors-battery combination versus the SCs cost. This investigation is threefold; first, super capacitors and battery models developed using MATLAB/ Simulink are presented and validated. Second, the architecture and the simulation of the designed system that combines the SCs and the battery are shown. The Super capacitors are used as high-power storage devices to smooth the peak power applied to the battery during backup time and to deliver full power during short grid outages. By charging the SCs through the battery at a suitable rate, all impulse power demands would be satisfied by the Super capacitors. Third, extensive simulations are carried out to determine the gain in battery RMS current, the gain in energy losses, the energy efficiency and the elimination rate of surge load power. These four performance parameters are determined by simulation and then analyzed.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Capacitors, Simulink, power, storage, energy, supply, energy loss

B. NAGARJUNA REDDY,SHAIK. MABHU JANI."Intend of Battery-Super Capacitors Arrangement in UPS". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.548-551, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I637.pdf,

[1] P. Mars, “A survey of super capacitors, their
applications, power designwith supercapacitors, and
future directions,” in Proc. IEEE Technol.
TimeMach.Symp. Technol. Beyond 2020, pp. 1–2,
Jun.1–3, 2011.
[2] Stepanov, I. Galkin, and L. Bisenieks,
“Implementation of supercapacitorsin uninterruptible
power supplies,” in Proc. Eur. Conf. Power
Electr.Appl., Aalborg, Denmark, Sep. 2–5, 2007.
[3] J. M. Gurrero, L. G. De Vicuna, and J.
Uceda,“Uninterruptible powersupply systems provide
protection,” IEEE Ind. Electron. Mag., vol. 1,no. 1,
pp.28–38, 2007.
[4] H. Markiewicz, A. Klajn. (2004, Jul.). “Voltage
disturbances, standard EN50160 - voltage
characteristics in public distribution systems,”
LeonardoPower Qual.Initiative (LPQI). [Online].
Available: www.lpqi.org
[5] W. Choi, J. W. Howze, and P. Enjeti, “Fuelcellpowered uninterruptiblepower supply systems:
Design
considerations,” J. Power Sources,vol. 157, no. 1,
pp.311–317, 2006.
[6] L. Zubieta and R. Bonert, “Characterization of
doublelayer capacitors forpower electronics
applications,”IEEE Trans. Ind. Appl., vol. 36, no. 1,pp.
199–205,Jan./Feb. 2000.
[7] H. Gualous, D. Bouquain, A. Bertbon, and
J.M.Kauffinann, “Experimentalstudy of supercapacitor
serial resistance and capacitance variations
withtemperature,”J. Power Sources, vol. 123, pp. 86–93,
2003.
[8] D. Rakhmatov, S. Vrudhula, and D. A. Wallach, “A
model for batterylifetime analysis for organizing
applications on a pocket computer,” IEEETrans. Very
Large Scale Integr. (VLSI) Syst., vol. 11, no. 6, pp.1019–
1030,Jun. 2003.
[9] B. S. Bhangu, P. Bentley, D. A. Stone, and C.
M.Bingham, “Nonlinearobservers for predicting stateofcharge and state-of-health of lead-acidbatteries for
hybrid-electric vehicles,” IEEE Trans. Veh.
Technol.,vol. 54,no. 3, pp. 783–794, May 2005.
[10]J. Chiasson and B. Vairamohan, “Estimating the
state of charge of abattery,” IEEE Trans. Control Syst.
Technol.,vol. 13, no. 3, pp. 465–470,May 2005.

Currently there are no Refbacks

Paper Title : Upgrading Power Quality of a Distributed Generation Power System
Authors : T. RAVI BABU, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

This paper presents analysis and improvement of power quality (voltage sag, voltage swell) performance of grid connected inverter used in distributed generation. The developed controller controls power supplied by the DGs at the PCC. The controller is designed to deliver current at unity power factor at PCC. An increase in reactive power demand and harmonics at PCC due to change of load and grid impedance variation, would affect the system voltage at PCC.This paper proposes the structure of the designed controller consists of output power with voltage control.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Point of common coupling (PCC), Distributed generation (DG), Voltage Source Inverter (VSI)

T. RAVI BABU,G. RAVI KUMAR."Upgrading Power Quality of a Distributed Generation Power System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.581-586, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I636.pdf,

[1]. John 1. Bzura, Senior Member, "Performance
Of Grid-Connected photovoltaic Systems on
residences and Commercial Buildings in New
England," IEEE Transactions on Energy
Conversion, Vol. 7. No.1, March 1992.
[2]. N. Hamrouni-, M. Jraidi, A. Che' rif "New
control strategy for 2- stage grid-connected
photovoltaic power system," Renewable Energy 33
(2008) 2212-2221
[3]. Wu Libo, Zhao Zhengming, Senior Member,
IEEE, and Liu Jianzheng "A Single-Stage ThreePhase GridConnected Photovoltaic System With
Modified MPPT Method and Reactive Power
Compensation," IEEE Transactions On Energy
Conversion, vol. 22, no. 4, pp.88-886, December
2007
[4]. Jose M. Espi Huerta, Member, IEEE, Jaime
Castello-Moreno, Student Member, IEEE, Jonatan
Roberto Fischer,and Rafael Garcia-Gil, "A
Synchronous Reference Frame Robust Predictive
Current Control for ThreePhase GridConnected
Inverters," IEEE Transactions on Industrial
[5]. Electronics, Vol. 57, NO, 3 MARCH 2010,
[6]. Freed Blaabjerg,remus Teodorescu,Adrian
V.Timbus, "Overview of control and grid
synchronization for distributed power generation
systems",IEEE Transactions on Industrial
Electronics VoI.53.NO.5.0CT.2006.
[7]. Ms.Aruna Garipelly ,“Improvement of power
quality of a distributed generation power system”,
Electrical and Electronics Engineering, Aurora’s
Engineering College (Affiliated to JNTUH)
Bhuvanagiri, Nalgonda, Andhra Pradesh, India,
Nov. 2012.
[8].Muralekrishnen.R, Mr.Sivakumar.P,“Improving
the Power Quality Performance for Distributed
Power Generation.”,IEEE Transactions on
Industrial Electronics . 2012.
[9]. Umar Naseem Khan, “Distributed Generation
and Power Quality”
[10]. Moreno-Munoz, J.J.G. De-La-Rosa, M.A.
Lopez-Rodriguez, J.M. Flores-Arias, F.J. BellidoOuterino,M.RuizDe-Adana,“Improvement Of
Power Quality Using Distributed Generation”,
Electrical Power and Energy Systems 32 ,2010.

Currently there are no Refbacks

Paper Title : A Single-Stage Power Conversion PV-Battery System
Authors : T. GOPALA KRISHNA, A. VYSHNAVI,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Assistant Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

The main concept of the new converter is to use a Single stage three phase grid ties solar PV converter to perform dc/dc and dc/ac operations. This converter solution is appealing for PV-battery applications, because it minimizes the number of conversion stages, improving efficiency and reducing cost, weight and volume.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Converter, Energy Storage, Photovoltaic (PV), Solar

T. GOPALA KRISHNA,A. VYSHNAVI."A Single-Stage Power Conversion PV-Battery System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.541-547, DECEMBER - 2019, URL :https://ijcert.org/ems/ijcert_papers/V1I635.pdf,

1. U.S. Department of energy, “Solar energy grid
integration systems – energy storage (SEGIS-ES),” may
2008.
2. D. Bundestag, “Gesetz zur Neuregelung des Rechts
der erneuerbaren Energien im Strombereich und zura
“nderung damit zusammenha” ngender Vorschirften,”
Bundesgesetzbltt, 2008.
3. H. Konishi, T. Iwato, and M. Kudo, “Development
of large scale power conditioning system in Hukuto
mega solar power project,” in proc. Int. Power
electron, Conf. 2010, pp. 1975-1979.
4. J.H. Ensilin and D.B. Snyman, “Combined low cost,
high efficient inverter, peak power tracker and
regulator for PV application ns,” IEEE Trans. power
electron. Vol 6, no. 1, pp. 73-82, Jan, 1991.
5. H. Ertl, J.W. Kolar, and F. Zach, “A novel multicoil
dc-ac converter for application in renewable energy
system,”IEEE Trans. Ind. Electron. Vol.49, no 5, pp
1048-1057 Oct, 2002.
6. C. Zhao, S. D. Round, and J. W. Kolar, “an isolated
three-port bidirectional dc/dc converter with
decoupled power flow management,” IEEE Trans.
Power Electron, vol, 23 no, 5 pp, 2443-2453, Sep, 2008.
7. M. Bragard, N. Soltau, R.W. De Doncker, and A.
Schiemgel, “Design and implementation of 5 kw
photovoltaic system with Li-ion battery and additional
dc/dc converter” in Proc. IEEE Energy Conveyor
Congr. Expo, 2010,pp, 2944-2949.
8. W. Li, J. Xiao, Y. Zhao, and X. He, PWM plus phase
angle shift control scheme for combined multiport
dc/dc converters, IEEE Trans. Power Electron vol, 27,
no.3, pp. 1479-1489, Mar, 2012.
9. N. Benavidas and P.Chapman, “power budgeting of
a multiple –input buck –boost converter,” IEEE Trans.
Power Electron, vol.20, no.6, pp.1303-1309, Nov, 2005.
10. P. Barrade, S. Delalay, and A. Rufar, “Direct
connection of super capacitors to PV panels with onoff maximum power point tracking,” IEEE Trans.
Sustainable energy, vol.3, no.2, pp. 283-294, Apr, 2012.

Currently there are no Refbacks

Paper Title : Linear Modeling of STATCOM with Design of Current and Voltage Controllers with Variation of DC-Link Voltage
Authors : P. LAXMI NARAYANA, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

The STATCOM is a shunt connected voltage source converter using self-commutating device and can be effectively used for reactive power control. Its principle of operation is similar to that of a synchronous condenser. This paper describes the linear modeling of STATCOM along with design of current and voltage controllers. The designed controllers with variation of DC-link voltage have been applied to the STATCOM and suitable DC-link voltage has been selected on basis of spike and over shoot of the responses. The values of the passive parameters decided on basis of selected DC-link voltage are used for the design and fabrication of a STATCOM. All responses are obtained through MATLAB SIMULINK tool box and presented here for clarity of the control strategy.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Linear model, Controller design, PI Controller, STATCOM

P. LAXMI NARAYANA,G. RAVI KUMAR."Linear Modeling of STATCOM with Design of Current and Voltage Controllers with Variation of DC-Link Voltage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.586-591, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I634.pdf,

[1] C.L.Wadhwa, “Electrical Power Systems”, W.
Eastern Ltd,New Delhi.
[2] P.Kundur, “Power System Stability and
Control”, EPRI,P.Engineering Series, 1994.
[3] M.K.Pal, “Voltage Stability Conditions
Considering Load Characteristic”, IEEE
Transactions on Power Systems, Vol.7,No.1,
pp.243-249, Feb.1992.
[4] T.V.Cutsem and C.D.Vournas, “Voltage
Stability analysis in transient and mid-term time
scales”, IEEE Transactions on Power Systems,
Vol.11, No.1, pp.146-154, Feb.1994.
[5] T.J.E.Miller, “Reactive Power Control in Electric
Systems”J.W, 1982.
[6] K.R.Padiyar, “Power System DynamicsStability and Control”, Interline Publishing Ltd,
Bangalore, 1996.
[7] C.W.Taylor and A.L.V.Leuven, “CAPS:
Improving Power System Stability Using the TimeOver voltage Capability of Large shunt Capacitor
Banks”, IEEE Transactions on Power Delivery,
Vol.11, No.2, pp.783-792, April 1996.
[8] Y.H. Song and A.T.John “Flexible AC
Transmission Systems (FACTS)”IEE Power and
Energy series Inc. 1999.
[9] N.G.Hingorani and L.Gyugyi, “Understanding
FACTS”, IEEE PES, Sponsor, Standard Publishers
Distributors New Delhi,1999.
[10] R.M.Mathur and R.K.Varma, “Thyristor based
FACTS Controllers for Electrical Transmission
Systems”, IEEE Power Engineering Society,
Sponsored, Wiley Interscience, 2002.
[11] A.T. Johns, A.Ter-Gazarian and
D.F.Wame,”Flexible ac transmission systems
(FACTS)”, IEE Power and Energy Series, London,
U.K.
[12] R.M.Mathur and R.K. Varma, “Thyristorsbased FACTS Controller for Electrical
Transmission Systems, IEEE Press”, WileyInterscience Publication.
[13] L.T. Moran, P.D.Ziogas and G.Joos, “Analysis
and Design of a Three Phase Synchronous SolidState Var Compensator”,IEEE Trans. Industry
Application, Vol. 25, No. 4, 1989, pp.598-608.
[14] C.Shauder and H.Mehta, “Vector analysis and
control of advanced static VAR compensators”,
IEE Proc, 140, No. 4,July 1993.
[15] A. Draou, M. Benghanem and A. Tahiri,
“Multilevel Converter and VAR Compensation”,
Power Electronics Handbook”, pp.599-611,
Academic Press, 2001.
[16] M.Sengupta,J.K Moharana and A.Sengupta,“
Study on an Advanced Static VAR Compensator
switched from a Space Vector PWM inverter
Analysis, simulation and comparison with the
conventional sinusoidal PWM, NPEC 2003, IIT
Bombay,16-17 Oct 03 pp 72-78.
[17] D.M.Brod and D.W.Novotny, “Current control
of VSIPWMinverter”IEEETrans.Industrial Appl,
Vol.IA-21,pp.562-570,July/Aug.1985.
[18] S.Buso, L.Malesani and P.Mattavelli,
“Comparison of Current Control Techniques for
Active Filter Application”IEEETrans.Industrial
Electronics, Vol.45, No.5,pp.722-729, October 1998.
[19] P.S.sensarma, K.R.Padiyar and
V.Ramnarayanan, “Analysis and Performance
Evaluation of a Distribution STATCOM for
Compensating Voltage Fluctuations”, IEEE
Transaction on Power Delivery, Vol.16, No.2,
pp.259- 264, April 2001 .
[20] A.M. Kulkarni and K.R. Padiyara, “Design of
Reactive Current and Voltage Controllers of Static
Condenser”, Power and Energy System, Vol.19,
No.6, pp.397-410, 1997.
[21] S.K.Sethy and J.K.Moharana, “Modeling,
Design and Simulation of Current and Voltage
Linear Controller of a STATCOM for Reactive
Power Compensation”, NSPEES-12,Sept.29-30,
GIET, BBSR, pp-37-44, 2012.

Currently there are no Refbacks

Paper Title : Benefits of HVDC and FACTS Devices Applied in Power Systems
Authors : P. SURESH KUMAR, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

The progress of electrical power provisions began more than hundred years ago. At the launching stage, there were only small DC networks within the local limitations, which were able to cover of industrial plants. A growing stipulates on energy, technology changed to be transmitted from DC to AC power and voltage levels. The driving force for the development of power systems is the increase of electrical power demand. Therefore, power system developed from the regional to national systems. To achieve technical and economic advantages, extend further to large continental systems by applying interconnections to the neighboring systems. This paper will treat benefits of HVDC and FACTS devices applied in power systems such as increased power transmission capability, improved static and dynamic stability, an increase of a availability and a decrease of transmission losses by using power Electronics techniques.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Development of HVDC & FACTS, Current status of power electronics techniques, Future development of HVDC & FACTS.

P. SURESH KUMAR,G. RAVI KUMAR."Benefits of HVDC and FACTS Devices Applied in Power Systems". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.575-580, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I633.pdf,

[1] V. Sitnikov, W. Breuer, D. Povh, D. Retzmann,
E.Teltsch, “Benefits of Power Electronics for
Transmission Enhancement”, [Russia Power
Conference, 10-11. March 2004, Moscow]
[2] D. Povh*, D. Retzmann, E. Teltschu. Kerin, R.
Michalic,” Advantages of Large AC/DC System
Interconnections” Siemens AG University of
LjubljanaGermany
[3] “Economic Assessment of HVDC links”, [CIGRE
BrochureNr.186 (Final Report of WG 14-20)]
[4] H.-C. Müller, H.-J. Haubrich, J. Schwartz,
“Technical Limits of Interconnected Systems”, [Cigré
Report 37-301, Paris, Session 1992]
[5] D. Povh, “Use of HVDC and FACTS”, IEEE, SEP
2000
[6] John J. Paserba,” FACTS Controllers Benefits AC
Transmission Systems” IEEE, 2000
[7] N. G. Hingorani, “Flexible AC Transmission”,
[IEEE Spectrum, , April 1993]
[8] N.G. Hingorani, L. Gyugyi, "Understanding
FACTS,“New York: IEEE Press, 2000
[9] Rolf Grünbaum, Bruno Halvarsson,
AleksanderWilkWilczynski,“FACTS and HVDC Light
for power system interconnections”, ABB Power
Systems AB, Sweden
[10]Edris, “Technology Developments Applications of
power electronics-Based controller on transmission
grid,”[Online]
vailable.http://www.electricity.doe.gov/documents/gri
d works_wshop

Currently there are no Refbacks

Paper Title : A Novel Control Strategy of PV making System with LPC for Loading Balance of Distribution Feeders
Authors : N. MAHESH, A. VYSHNAVI,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Assistant Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

At Present days solar power plants are more dependable, because no fuel and reduced CO2 emission. But the solar power generation system do not work in all weather conditions, it is power generated only solar radiation time .To overcome this problem by using fuel cell (FC). In fuel cell power generation there will be no problems, where as in fuel cell power distribution systems have some problems like overloading the distribution feeders. In this project to overcome this overloading by using Loop Power Controller (LPC) and also photovoltaic (PV) power generation is incorporated in balancing the feeder loading..The loop power controller to control real power and reactive power flow by adjusting voltage ratio and phase shift. Daily loading unbalance is determined by analyzing fuel cell (FC) power generation recording by using SCADA system and load profile based on Data Automation System (DAS).The loop power controller can improve controllability, operational flexibility and reduce power loss of the distribution system. The Loop Power Controller (LPC) is based on the MATLAB/ SIMULINK
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Distribution system, Fuel cell, Loop power controller.

N. MAHESH,A. VYSHNAVI."A Novel Control Strategy of PV making System with LPC for Loading Balance of Distribution Feeders". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.570-574, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I632.pdf,

[1]. Jin-Woo Jung,1 Ali Keyhani,2 Modeling and Control
of Fuel Cell Based Distributed Generation Systems in a
Standalone AC Power Supply
[2]. Y. Zhu and K. Tomsovic, “Adaptive power flow
method for distribution systems with dispersed
generation,” IEEE Trans. Power Del., vol. 17, no. 3, pp.
822–827, Jul. 2002.
[3]. 2008 Report of Long-Term Load Forecasting and
Energy Development, Bureau of Energy, Ministry of
Economic Affairs,Taiwan, Dec. 2008.
[4]. N. Okada, “A method to determine the distributed
control setting of looping devices for active distribution
systems,” in Proc.2009 IEEE Bucharest Power Tech
(POWERTECH), Bucharest, Romania, Jun. 2009, pp. 1–6.
[5]. S. A. Farouji, E. Bakhshizadeh, R. Kazemzadeh, and
R. Ghazi, “The static VAR compensator equations
development for loading balance at desired power
factor based on load admittance parameters and
instantaneous voltage and current values,” in Proc. 2009
Int. Conf. Elect. Power Energy Conversion Syst.,
Sharjah, United Arab Emirates, Nov. 10–12, 2009, pp. 1–
6.
[6]. C. H. Lin, “Distribution network reconfiguration for
loading balance with a coloured petri net algorithm,”
Proc. Inst. Elect. Eng.,Gen., Transm., Distrib., vol. 150,
no. 3, pp. 317–324, May 2003.
[7]. N. Okada, “Verification of control method for a loop
distribution system using loop power flow controller,” in Proc. 2006 IEEE PES Power Syst. Conf. Expo., Atlanta,
GA, Oct./Nov. 2006, pp. 2116–2123.

Currently there are no Refbacks

Paper Title : Investigation of Dynamic Voltage Restorer for Compensation of Voltage Sag and Swell
Authors : M. SURESH, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

The power quality (PQ) requirement is one of the most important issues for power companies and their customers. The power quality disturbances are voltage sag, swell, notch, spike and transients etc. The voltage sag and swell is very severe problem for an industrial customer which needs urgent attention for its compensation. There are various methods for the compensation of voltage sag and swell. One of the most popular methods of sag and swell compensation is Dynamic Voltage Restorer (DVR), which is used in both low voltage and medium voltage applications. In this paper, the comprehensive reviews of various articles, the advantages and disadvantages of each possible configuration and control techniques pertaining to DVR are presented. The compensation strategies and controllers have been presented in literature, aiming at fast response, accurate compensation and low costs. This review will help the researchers to select the optimum control strategy and power circuit configuration for DVR applications. This will also very helpful in finalizing the method of analysis and recommendations relating to the power quality problems.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Power quality, dynamic voltage restorer, control strategies, compensation techniques, control algorithm.

M. SURESH,G. RAVI KUMAR."Investigation of Dynamic Voltage Restorer for Compensation of Voltage Sag and Swell". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.534-540, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I631.pdf,

[1] Chellali Benachaiba, Brahim Ferdi “Voltage Quality
Improvement Using DVR” Electrical Power Quality and
Utilization, Journal Vol. XIV, No. 1, 2008.
[2] Dash P.K., Panigrahi B.K., and Panda G., “Power
quality analysis using S-transform”, IEEE Trans. On
Power Delivery, vol. 18, no. 2, pp. 406–411, 2003.
[3] Dash P.K., Swain D.P., Liew A.C. and Raman S., “An
adaptive linear combiner for on-line tracking of power
system harmonics”, IEEE Trans. on Power Systems, vol.
11, no.4, pp.1730-1736, 1996.
[4] Amit Kumar Jena, Bhupen Mohapatra, Kalandi
Pradhan, “Modeling and Simulation of a Dynamic
Voltage Restorer (DVR)”, Project Report,Bachelor of
Technology in Electrical Engineering, Department of
Electrical Engineering, National Institute of Technology,
Rourkela, Odisha-769008
[5] Rosli Omar, N.A. Rahim and Marizan Sulaiman,
“Dynamic Voltage Restorer Application for Power
Quality Improvement in Electrical Distribution System:
An Overview”, Australian Journal of Basic and Applied
Sciences, 5(12): 379-396, ISSN 1991-8178, 2011.
[6] Margo P., M. Heri P., M. Ashari, Hendrik M. and T.
Hiyama, “Compensation of Balanced and Unbalanced
Voltage Sags using Dynamic Voltage Restorer Based on
Fuzzy Polar Control”, International Journal of Applied
Engineering Research, ISSN 0973-4562 Volume 3,
Number 3, pp. 879–890, 2008.
[7] M.V.Kasuni Perera, “Control of a Dynamic Voltage
Restorer to compensate single phase voltage sags”,
Master of Science Thesis, Stockholm, Sweden, 2007.
[8] N. Hamzah, M. R. Muhamad, and P. M. Arsad,
“Investigation on the effectiveness of dynamic voltage
restorer for voltage sag mitigation”, the 5th scored,
Malaysia, pp 1-6, Dec 2007.
[9] Rosli Omar, Nasrudin Abd Rahim, Marizan
Sulaiman, “Modeling and simulation for voltage
sags/swells mitigation using dynamic voltage restorer
(dvr)”, Journal of Theoretical and Applied Information
Technology, JATIT, 2005 - 2009.
[10] J. G. Nielsen, M. Newman, H. Nielsen, and F.
Blaabjerg, “Control and testing of a dynamic voltage
restorer (DVR) at medium voltage level”, IEEE Trans.
Power Electronics, vol. 19, no. 3, p.806, May 2004.
[11] A. Ghosh and G. Ledwich, “Power Quality
Enhancement Using Custom Power Devices”, Kluwer
Academic Publishers, 2002.
[12] P. Boonchiam and N. Mithulananthan,
“Understanding of Dynamic Voltage Restorers through
MATLAB Simulation”, Thammasat Int. J. Sc. Tech., Vol.
11, No. 3, July-Sept 2006.
[13] Ghosh, A. and G. Ledwich, 2002. Compensation of
Distribution System Voltage Using DVR, IEEE Trans on
Power Delivery, 17(4): 1030-1036.
[14] Rosli Omar, Nasrudin Abd rahim, Marizan
Sulaiman “Modeling and Simulation for Voltage
Sags/Swells Mitigation using Dynamic Voltage Restorer
(dvr)”, journal of theoretical and applied information
technology: 2005 – 2009.
[15] A. Ghosh and G. Ledwich, “Power Quality
Enhancement Using Custom Power Devices”, Kluwer
Academic Publishers, 2002.
[16] S. Chen, G. Joos, L. Lopes, and W. Guo, “A
nonlinear control method of dynamic voltage restorers”,
IEEE 33rd Annual Power Electronics Specialists
Conference, pp. 88- 93, 2002.
[17] Wang, B., G. Venkataramanan, and M. Illindala,
2006. “Operation and control of a dynamic voltage
restorer using transformer coupled H-bridge
converters,” IEEE Trans. Power Electron., 21(4): 1053-
1061.
[18] Chris Fitzer, Mike Barnes, Peter Green “ Voltage
Sag Detection Technique for a Dynamic Voltage
Restorer”, IEEE Transactions on Power Delivery, Vol.
40, No. 1, pp. 203-212, January/February 2004.

Currently there are no Refbacks

Paper Title : Performance Estimation of Five Level Inverter for Solar Grid Connected System
Authors : SHEKAR BABU, SHAIK. MABHU JANI,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Assistant Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

Reformations in electricity sector along with various renewable energy promotion policies have increased the importance of small grid connected photovoltaic (PV) systems utilizing single-stage single-phase inverters. To improve the performance multilevel inverter are preferred over two levels. This paper proposes a single-stage five level inverter for grid connected (PV) system. The output current of the inverter can be adjusted according to the voltage of the photovoltaic (PV) array. This control scheme is based on SPWM topology. Schemes based on SPWM which do not require the service of a phase locked loop for interfacing the inverter to the grid are increasingly being employed for such applications. Performance evaluation of the five-level inverter is done on MATLAB platform. The viability of the proposed scheme is confirmed by performing simulation and results validation.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Five level inverter, Cascaded H-bridge inverter, SPWM, Solar PV array

SHEKAR BABU,SHAIK. MABHU JANI."Performance Estimation of Five Level Inverter for Solar Grid Connected System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.529-533, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I630.pdf,

[1] J. Rodriguez, J. S. Lai and F. Z. Peng,Multilevel
Inverters: Survey of Topologies,Controls, and
Applications,‖ IEEE Transactions on Industry
Applications, vol.49, no. 4, Aug. 2002, pp. 724-738.
[2] A. Bendre and G. Venkataramanan, Neutral
current ripple minimization in a three-level rectifier,‖
IEEE Trans. Ind. Applicat. , vol.42, no. 2, pp. 582–590,
Mar. 2006.
[3] Baoming Ge, Fang Zheng Peng, Aníbal T.de
Almeida, and Haitham Abu-Rub, An Effective Control
Technique for MediumVoltage High-Power Induction
Motor Fed by Cascaded Neutral-Point- Clamped
Inverter‖, IEEE Trans On Industrial Electronics, Vol.
57, No. 8, pp. 2659-2668,Aug 2010.
[5] Arash A. Boora, Alireza Nami, Firuz Zare,Arindam
Ghosh, and Frede Blaabjerg,Voltage-Sharing
Converter to Supply Single-Phase Asymmetrical FourLevel Diode-Clamped Inverter With High Power
Factor Loads, IEEE Trans On Power Electronics, Vol.
25, No. 10, Pp. 2507-2520, Oct 2010.
[6] C. Attaianese, M. Di Monaco, and G.Tomasso,
Three-Phase Three- Level Active NPC Converters for
High Power System,International Symposium on
Power Electronics, Electrical Drives, Automation and
Motion, pp. 204-209, Speedam 2010.
[7] Amit Kumar Jain, and V. T. Ranganatha VCE
Sensing for IGBT Protection in NPC Three Level
Converters—Causes For Spurious Trippings and
Their Elimination,IEEE Trans On Power Electronics,
Vol. 26,No. 1, pp. 298-307, Jan 2011.
[8] Jun Li, Subhashish Bhattacharya, and Alex Q.
Huang, A New Nine- Level Active NPC (ANPC)
Converter for Grid Connection of Large Wind
Turbines for Distributed Generation‖, IEEE Trans On
Power

Currently there are no Refbacks

Paper Title : Power Quality Step Up In Distribution System Using D-STATCOM
Authors : K. NARENDRA BABU, A. VYSHNAVI,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Assistant Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

solid state power converters are widely used in applications such as Adjustable speed drives (ASD), Static power supplies. Hence it affects the power quality (i.e.) related to non-standard voltage, current and frequency at the load side. In this paper an attempts has been to analyses the role of D-STATCOM (Distribution static compensator) and located at load side in the distribution system, which can to eliminating or overcome the problems of source side like voltage sag and interruption etc... In order to maintain the power system quality the D-STATCOM will absorb and provide reactive power to mitigate voltage sag, swell, interruption and improve powerfacor in various conditions. Utility distribution network, sensitive industrial load and critical commercial operation suffer from various type of outage and service interruption, which can cost significant financial losses. Here in this paper the work has been carried out by various techniques with D-STATCOM to minimize the problem associated in distribution system such as voltage sag, swell, interruption and low power factor in power system with different condition. D-STATCOM used to supply the reactive power and absorb the real power to maintain power quality as well.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


D-STATCOM, Voltage source converter, Hysteresis current controller, Voltage sag, Interruption, Voltage swell.

K. NARENDRA BABU,A. VYSHNAVI."Power Quality Step Up In Distribution System Using D-STATCOM". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.565-569, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/c,

[1] V.Malathi, “Power quality improvement of grid
interconnected distribution system FSS-LMS
algorithm”, VOL.02, Issue.06, ISSN: 2319-1163,
Jun.2013.
[2] D.Bhanumurthy and Prashanth, “Power quality
improvement at distribution
level”,Proc.IJERA,vol.2,Issue.3,pp.970-975,Jun.2012
[3] Dr.S.R.Paranjothi and A.Selvaraj “Voltage Sag
Mitigation on ASD”, Proc.IJEST,vol.3,no.02,ISSN:0975-
5462,Feb.2011
[4] R Chiumeo and C Gandolfi, “Simulations of a
possible configuration of Premium Power Park”,
International Conference on Renewable Energies and
Power Quality (ICREPQ’10) Granada (Spain), 23-25th
March, 2010.
[5] Pinaki Mitra and Ganesh Kumar Venayagamoorthy,
“An Adaptive Control Strategy For DSTATCOM
Application in an Electric Ship power System”, IEEE
Transaction on Power Electronics, vol25, no1,January
2010, pp95-104.
[6] Sunil Kumar and Bhim Singh, “Modified Power
Balance Theory for Control of DSTATCOM”, IEEE
Press, 2010, pp1-8.
[7] RS Bajpai and Rajesh Gupta, “Sliding Mode Control
of Converter in Distributed Generation Using
DSTATCOM”, IEEE Press 2010.
[8] Juan Segundo-Ramirez, Aurelio Medina and
Arindam Ghosh, “Stability Analysis Based on
Bifurcation Theory of the DSTATCOM Operating in
Current control Mode”, IEEE Transaction on Power
Delivery, vol24, no3, July 2009, pp.1670-1678.
[9] Zhang Dongliang, Li Guoxin,Wang Chonglin and
Tang jieJie, “Modeling and Simulation of DSTATCOM
Based on Switch Function”,IEEE Press (ICIEA) 2009,
pp2297-2301.
[10] Hendri Masdi, Norman Marium and SMBashi,
“Design of a Prototype DSTATCOM for Voltage Sag
Mitigation”. European Journal of Scientific Research
ISSN 1450- 216X vol30, no1, 2009, pp112-127.

Currently there are no Refbacks

Paper Title : Single-Phase To Three-Phase Drive System Composed of Two Parallel Single-Phase Rectifiers
Authors : G. ANIL KUMAR, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

This paper proposes a single-phase to three-phase drive system composed of two parallel single-phase rectifiers, a three-phase inverter, and an induction motor. The proposed topology permits to reduce the rectifier switch currents, the harmonic distortion at the input converter side, and presents improvements on the fault tolerance characteristics. Even with the increase in the number of switches, the total energy loss of the proposed system may be lower than that of a conventional one. The model of the system is derived, and it is shown that the reduction of circulating current is an important objective in the system design. A suitable control strategy, including the pulse width modulation technique (PWM), is developed. Experimental results are presented as well.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


AC-DC-AC power converter, drive system, parallel Converter, Fault Identification System (FIS).

G. ANIL KUMAR,G. RAVI KUMAR."Single-Phase To Three-Phase Drive System Composed of Two Parallel Single-Phase Rectifiers". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.552-558, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I628.pdf,

[1] J.-K. Park, J.-M. Kwon, E.-H. Kim, and B.H.
Kwon, “High-performance transformer less online
UPS,” IEEE Trans.Ind. Electron., vol. 55, no. 8,
2943–2953,Aug. 2008.
[2] Z. Ye, D. Boroyevich, J.-Y. Choi, and F. C.Lee,
“Control of circulating current in two parallel
three-phase boost rectifiers,” IEEE Trans. Power
Electron., vol. 17, no. 5, pp.609–615, Sep. 2002.
[3] S. K. Mazumder, “Continuous and discrete
variable-structure controls for parallel threephase
boost rectifier,” IEEE Trans. Ind. Electron., vol. 52,
no. 2, pp. 340–354, Apr.2005.
[4] X. Sun, L.-K. Wong, Y.-S. Lee, and D.
Xu,“Design and analysis of an optimal controller
for parallel multi-inverter systems,” IEEE Trans.
Circuits Syst. II, vol.53, no. 1, pp. 56– 61, Jan. 2006.
[5] Z. Ye, P. Jain, and P. Sen, “Circulating current
minimization in high-frequency AC power
distribution architecture with multiple inverter
mod-ules operated in parallel,”IEEE Trans. Ind.
Electron., vol. 54, no. 5,2673–2687, Oct. 2007.
[6] P.-T. Cheng, C.-C. Hou, and J.-S. Li, “Design of
an auxiliary converter for the diode rectifier and
the analysis of the circulating current,”IEEE Trans.
Power Electron., vol. 23, no. 4, pp.1658–1667, Jul.
2008.
[7] H. Cai, R. Zhao, and H. Yang, “Study on ideal
operation status of parallel inverters,” IEEE Trans.
Power Electron., vol. 23, no. 6, pp.2964–2969, Nov.
2008.
[8] P. Enjeti and A. Rahman, “A new single phase
to three phase converter with active input current
shaping for low cost AC motor drives,”IEEE Trans.
Ind. Appl., vol. 29, no. 2, pp. 806–813, Jul./Aug.
1993.
[9] J. Itoh and K. Fujita, “Novel unity power factor
circuits using zero-vector control for single-phase
input systems,” IEEE Trans. Power Electron., vol.
15, no. 1, pp. 36–43, Jan. 2000.
[10] B. K. Lee, B. Fahimi, and M. Ehsani,“Overview
of reduced parts converter topologies for AC
motor drives,” in Proc. IEEE PESC, 2001, pp. 2019–
2024.
[11] C. B. Jacobina, M. B. de R. Correa, A. M.
N.Lima, and E. R. C. da Silva, “AC motor
drivesystems with a reduced switch count
converter,”IEEE Trans. Ind. Appl., vol. 39, no. 5,
pp.1333–1342, Sep./Oct. 2003.
[12] R. Q. Machado, S. Buso, and J. A. Pomilio, “A
line-interactive single-phase to three-phase
converter system,” IEEE Trans. Power Electron.,
vol. 21, no. 6, pp. 1628–1636, May 2006.
[13] O. Ojo, W. Zhiqiao, G. Dong, and S.
Asuri,“High-performance speed-sensorless control
of an induction motor drive using a minimalist
single-phase PWM converter,” IEEE Trans.Ind.
Appl., vol. 41, no. 4, pp. 996– 1004,Jul./Aug. 2005.
[14] J. R. Rodr´ıguez, J. W. Dixon, J. R. Espinoza,
J.Pontt, and P. Lezana, “PWM regenerative
rectifiers: State of the art,” IEEE Trans.
Ind.Electron., vol. 52, no. 1, pp. 5–22, Feb. 2005.
[15] M. N. Uddin, T. S. Radwan, and M.
A.Rahman, “Fuzzy-logic-controller-based
costeffective four-switch three-phase inverter-fed
IPM synchronous motor drive system,” IEEE
Trans. Ind. Appl., vol. 42, no. 1,21–30, Jan./Feb.
2006.
[16] D.-C. Lee and Y.-S. Kim, “Control of
singlephase-to-three-phase AC/DC/AC PWM
converters for induction motor drives,” IEEE
Trans. Ind. Electron., vol. 54, no. 2, pp. 797–804,
Apr. 2007.
[17] J. Holtz, “Pulsewidth modulation for
electronic power conversion,” Proc. IEEE, vol. 82,
no. 8,pp. 1194–1214, Aug. 1994.
[18] A. M. Trzynadlowski, R. L. Kirlin, and S.
F.Legowski, “Space vector PWM technique with
minimum switching losses and a variable pulse G.
Sudhir Kumar, G. Kumaraswamy, Dr. K. Sri Gowri
/ International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622
www.ijera.com Vol. 3, Issue 4, Jul-Aug 2013,
pp.1821-1827

Currently there are no Refbacks

Paper Title : Power Quality Step up Using Modular Multilevel Converter for Renewable Energy Source
Authors : G. SIVA NAGESWARA RAO, SHAIK. MABHU JANI,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Assistant Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

Multilevel inverters have received more attention in industrial application, such as motor drives, FACTS devices and renewable energy systems, etc.Primarily multilevel inverters are known to have output voltages with more than two levels. A modular multilevel converter (MMC) is one of the next-generation multilevel converters intended for high or medium-voltage power conversion without transformers. Compared with the existing multilevel converters, one of the most desirable advantages offered by MMC may be its ability to process both active power and reactive power with its terminals directly connected to high-voltage networks. D-STATCOM (Distribution Static Compensator) is a shunt device which is generally used to solve power quality problems in distribution systems. D-STATCOM is used in correcting power factor, maintaining constant distribution voltage and mitigating harmonics in a distribution network. In this paper MMC D-STATCOM inverter controls the DC link voltage as well as the active and reactive power transferred between the renewable energy source, specifically wind turbine, and the grid in order to regulate the power factor (PF) of the grid regardless of the input active power from wind turbine. In this concept in future by increasing the levels of Multilevel Inverter we improve the power quality.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Bidirectional switch, Total Harmonic Distortion (THD), D-STATCOM, Modular Multi-level Converter, Renewable Energy Source.

G. SIVA NAGESWARA RAO,SHAIK. MABHU JANI."Power Quality Step up Using Modular Multilevel Converter for Renewable Energy Source". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.520-523, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I627.pdf,

[1] J.T. Bialasiewicz, “Renewable energy systems with
photovoltaic power generators: Operation and
Modeling”, Ind. Electronics, IEEE Trans. on, vol. 55,
pp. 2752-2758, 2008
[2] AWEA, “AWEA U.S. wind industry annual market
report year ending 2010,” American Wind Energy
Association, Washington DC,2011
[3] SEIA, “U.S. solar market insight, 2010 year end
review executive summary,” Solar Energy Industries
Association, Washington DC, 2011
[4] J. Rodriguez, J. S. Lai and F. Z. Peng, “Multilevel
inverters: Survey of topologies, controls, and
applications,” Industry Applications, IEEE
Transactions on, vol. 49, no. 4, pp. 724-738, 2002
[5] F. Z. Peng, J. S. Lai, J. W. McKeever, J.
VanCoevering, “A multilevel voltage-source inverter
with separate DC sources for static var generation,”
Industry Applications, IEEE Transactions on, vol.
32,no. 5, pp. 1130-1138, 1996
[6] L. M. Tolbert, F. Z. Peng, “Multilevel converters as
a utility interface for renewable energy systems,” in
Proceedings of 2000 IEEE Power Engineering Society
Summer Meeting, pp. 1271-1274, 2000
[7] Kouro, S., Malinowski, M., Gopakumar, K., Pou, J.,
Franquelo, L.G., Bin Wu, Rodriguez, J., Pérez, M.A.,
Leon, J.I., “Recent advances and industrial
applications of multilevel converters”, IEEE
Electronics,IEEE Transaction on, vol. 57 , no.: 8, pp.
2553 – 2580, 2010
[8] C. Tareila, P. Sotoodeh, R. D. Miller., “Design and
control of a singlephase D-STATCOM inverter for
wind application”, Power Electronics and Machines in
Wind Application PEMWA 2012, Denver,Co, 2012
[9] M. Davies, M. Dommaschk, J. Dorn, J. Lang, D.
Retzmann, and D.Soerangr, “HVDC PLUS nasic and
principle of operation,” Siemens AG Energy Sector,
Erlandgen, Germany, 2009
[10] B. Gemmell, Siemens USA, J. Dorn, D. Retzmann,
D. Soerangr,Siemens Germany, “Prospects of
multilevel VSC technologies for power transmission,”
in Proc. IEEE Transmission and Distribution
Conference and Exposition, pp. 1-16, 2008
[11] R. Marquardt and A. Lesnicar, "New concept for
high voltage –modular multilevel converter," Power
Electronics Specialists
Conference,Aachen,Germany,2004.

Currently there are no Refbacks

Paper Title : Enhance Power Quality of 1-Φ Grid-connected PWM Inverter using Fuzzy with Hysteresis Current Controller
Authors : E. PRAVEEN KUMAR, A. VYSHNAVI,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Assistant Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

Continuously rising demand of electrical energy and the insufficiency of conventional energy sources lead to the development of distributed generation (DG) system. The main difficulty is the harmonization of the DG to the utility grid. Usually current regulated PWM voltage-source inverters (VSI) are used for synchronizing the utility grid with DG source in order to meet the following objectives like: to ensure grid stability, active and reactive power control through voltage and frequency control and power quality improvement (i.e. harmonic elimination) etc. In our paper we proposed hysteresis current control technique will be used as inverter control technique, which is one of the feedback control scheme. In addition to hysteresis current controller fuzzy will be used in order to improve performance.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Hysteresis current controller, Fuzzy logic controller, distributed generation (DG), utility grid, Power quality.

E. PRAVEEN KUMAR,A. VYSHNAVI."Enhance Power Quality of 1-Φ Grid-connected PWM Inverter using Fuzzy with Hysteresis Current Controller". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.559-564, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I626.pdf,

[1] Satyaranjan Jena , B.Chitti Babu, “Power Quality
Improvement of 1-Φ Grid-connected PWM Inverter
using Fuzzy with Hysteresis Current Controller” IEEE
transactions 2011.
[2] M.M.P.Kazmierkowaski, L.Malesani: “PWM Current
Control Techniques of voltage source converters-A
Survey” IEEE Trns. On Industrial Electronics,Vol.45,
no.5, oct.1998.
[3] Krismadinata,Rahim
N.A.,Selvaraj,J.,”Implementation of Hysteresis Current
Control for Single-Phase Grid Connected Inverter”
International.Conference on Power Electronics and
Drive Systems,2007. PEDS '07., pp: 1097
[4] Hilloowala, R.M.; Sharaf, A.M.; "A rule-based fuzzy
logic controller for a PWM inverter in a standalone
wind energy conversion scheme," IEEE Trans. On
Industrial Applications, vol.32, no.1, pp.57-65, Jan/Feb
1996.
[5] O. Ojo, W. Zhiqiao, G. Dong, and S. Asuri, “Highperformance speed sensorless control of
an induction motor drive using a minimalist single
phase PWM converter,” IEEE Trans. Ind.
Appl., vol. 41, no. 4, pp. 996–1004, Jul./Aug. 2005.
[6] J. R. Rodr´ıguez, J. W. Dixon, J. R. Espinoza, J. Pontt,
and P. Lezana, “PWM regenerative rectifiers: State of the art,” IEEE Trans. Ind. Electron., vol. 52, no. 1, pp. 5–
22, Feb. 2005.
[7] D.-C. Lee and Y.-S. Kim, “Control of single-phase-tothree-phase AC/DC/AC PWM converters for induction
motor drives,” IEEE Trans. Ind. Electron., vol. 54, no. 2,
pp. 797–804,Apr. 2007.
[8] J. Guerrero, J. Vasquez, J. Matas, M. Castilla, and L.
de Vicuna, “Control strategy for flexible microgrid
based on parallel line-interactive UPS systems,”IEEE
Trans. Ind. Electron., vol. 56, no. 3, pp. 726–736, Mar.
2009.
[9] L. Asiminoaei, E. Aeloiza, P. N. Enjeti, F. Blaabjerg,
and G. Danfoss, “Shunt active-powerfilter topology
based on parallel interleaved inverters,” IEEE Trans.
Ind. Electron., vol. 55, no. 3,pp. 1175–1189, Mar. 2008.
[10] T. A. Chaer, J.-P. Gaubert, L. Rambault, and M.
Najjar, “Linear feedback control of a parallel active
harmonic conditioner in power systems,” IEEE Trans.
Power Electron., vol. 24, no. 3, pp. 641–653, M
ar. 2009. 

Currently there are no Refbacks

Paper Title : Function of Distribution Power Electronic Transformer for Medium Voltage
Authors : B. KALYANI, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

In this paper a distribution power electronic transformer (DPET) for feeding critical loads is presented. The PE based transformer is a multi-port converter that can connect to medium voltage levels on the primary side. Bidirectional power flow is provided to the each module. The presented structure consists of three stages: an input stage, an isolation stage, and an output stage. The input current is sinusoidal, and it converts the high AC input voltage to low DC voltages. The isolated DC/DC converters are then connected to the DC links and provide galvanic isolation between the HV and LV sides. Finally, a three-phase inverter generates the AC output with the desired amplitude and frequency. The proposed DPET is extremely modular and can be extended for different voltage and power levels. It performs typical functions and has advantages such as power factor correction, elimination of voltage sag and swell, and reduction of voltage flicker in load side.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Flexible Power Electronic Transformer (FPET), Matrix Converter, Bidirectional Power Flow Control.

B. KALYANI,G. RAVI KUMAR."Function of Distribution Power Electronic Transformer for Medium Voltage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.524-528, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I625.pdf,

[1] ER Ronan, SD Sudhoff, SF Glover, DL Galloway. A
powerelectronic-based distribution transformer. IEEE
Trans.Power Delivery. 2002; 17: 537– 543.
[2] Proof of the principle of the solid state transformer
and the AC/AC switch mode regulator. San Jose State
Univ.,SanJose, CA, EPRITR-105067, 1995.
[3] L Li and D Chen, “Phase-shifted controlled forward
mode AC/AC converters with high frequency AClinks.
IEEE PEDS conf., vol.1, pp. 172- 177,Nov.2003.
[4] M Kang, PN Enjeti, IJ Pitel. Analysis and design of
electronic transformers for electric power distribution
system.Proc. IEEE Industry Applicat. Soc. Annu. Meet.
1997.
[5] H Iman-Eini, Sh Farhangi. Analysis and Design of
Power Electronic Transformer for Medium Voltage
Levels. IEEE PESCconf., 2006: 843-847.
[6] JS Lai, A Maitra, A Mansoor, F Goodman. Multilevel
intelligent universal transformer for medium voltage
applications. Proc. IEEEIAC conf., 2005; 3: 1893-1899.
[7] S Srinivasan, G Venkataramanan. Comparative
evaluation of PWMAC-AC converters.
Proceedingsofthe1995IEEE PESC Conference. 1995; 1:
529–535.
[8] K Harada, F Anan, K Yamasaki, M Jinno, Y Kawata,
T Nakashima. Intelligent transformer. Proceedings of
the 1996 IEEEPESC Conference. 1996; 2; 1337–1341.
[9] H Krishnaswami, V Ramanarayanan. Control of
high frequency ac link electronic transformer. IEE
Electric Power Appl. 2005; 152(3): 509–516.
[10] ER Ronan, SD Sudhoff, SF Glover, DL Galloway. A
power electronic-based distribution transformer. IEEE
Trans.Power Deliv,. 2002; 17(2): 537–543.
[11] D Gerry, P Wheeler, J Clare. Power flow
considerations in multi-cellular, multilevel converters.
International Conference on Power Electronics
Machines and Drives. 2002; 487: 201–205.
[12] M Glinka, R Marquardt. Anewac/ac multilevel
converter family. IEEE Trans. Ind. Electron. 2005; 52(3):
662–669.
[13] A Rufer, N Schibli, C Chabert, C Zimmermann.
Configurable front end converters for multi current
locomotive soperatedon 162/3Hzacand3kVdc systems.
IEEE Trans. Power Electron. 2003; 18(5): 1186–1193.
[14] Heinemann. Anactively cooled high power high
frequency transformer with high insulation capability.
Proceedings of the 2002 IEEE APEC Conference. 2002; 1:
352–357.
[15] AJ Watson, PW Wheeler, JC Clare. A complete
harmonic elimination approach to DC link voltage
balancing for a cascaded multilevel rectifier. IEEE
Trans. Ind. Electron. 2007; 54(6): 2946–2953.
[16] V Vorperian. Simplified analysis of PWM
converters using model of PWM switch. Continuous
conduction mode. IEEE Trans. Aerospace Electron. Syst.
1990; 26(3): 490–496

Currently there are no Refbacks

Paper Title : DVR Scheme for Recompense of Voltage Sags, State-of-The-Art Review
Authors : B. GOPAIAH, G. RAVI KUMAR,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Associate Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

The problem of voltage sags and its severe impact on sensitive loads is well known. To solve this problem, The DVR is a modern and important custom power device for compensation voltage sags in power distribution systems. The Dynamic Voltage Restorer (DVR) is fast, flexible and efficient solution to voltage sag problem. The DVR is a series compensator used to mitigate voltage sags and to restore load voltage to its rated value. In this paper, an overview of the DVR, its functions, configurations, components, operating modes, voltage injection methods and closed -loop control of the DVR output voltage are reviewed along with the device capabilities and limitations.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Power Quality, Voltage Sag, Dynamic Voltage Restorer (DVR), Control Strategy, Voltage Source Converter

B. GOPAIAH,G. RAVI KUMAR."DVR Scheme for Recompense of Voltage Sags, State-of-The-Art Review". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.513-519, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I624.pdf,

[1] M. Izhwan M, N. Mariun, and M. Amran M. Radzi,
“The effect of Power Quality to the industries”, The
5th SCORED, Dec. 2007,Malaysia, pp. 1- 4.
[2] R. Ibrahim, A. M. Haidar, M. Zahim “The Effect of
DVR Location for Enhancing Voltage Sag”
Proceedings of the 9th WSEAS International
Conference on A pplications of Electrical Engineering,
pp. 92-98.
[3] P. T. Nguyen, Tapan. K. Saha, “Dynamic Voltage
Restorer against Balanced and Unbalanced Voltage
Sags: Modelling and Simulation,” IEEE Power
Engineering Society General Meeting, vol. 1, pp. 639-
644, June 2004.
[4] E. Babaei, M. F. Kangarlu,”A New Topology for
Dynamic Voltage Restorers without dc Link” IEEE
Symposium on Industrial Electronics and
Applications (ISIEA 2009), October 4-6, 2009, Kuala
Lumpur, Malaysia.
[5] V. S. Mallela, P. S. Solanki, and A. Chaturvedi
“Role of a Dynamic Voltage Restorer in Mitigation of
Power Quality Problems”International Conference on
Communication, Computer & Power (ICCCP'05), Feb.
2005, pp. 161- 166.
[6] P. Boonchiam, and N. Mithulananthan
“Understanding of Dynamic Voltage Restorers
through MATLAB Simulation” Thammasat I nt. J.
Sc.Tech., Vol. 11, No. 3, pp. 1-6, July-September 2006.
[7] C. Benachaiba, and B. Ferdi “Voltage quality
improvement using DVR”, Electrical Power Quality
and Utilization, Journal Vol. XIV,No. 1, pp. 39-45,
2008.
[8] M. F. Kangarlu, S. H. Hosseini, A. K. Sadigh
“Transformerless DVR topology based on multilevel
inverter with reduced number of switches” 1st Power
Electronic & Drive Systems & Technologies
Conference,IEEE,pp. 371-375,2010
[9] P. Roncero-Sánchez, E. Acha, J. E. Ortega-Calderon
Vicente Feliu, A. García-Cerrada, “A versatile control
scheme for a dynamic voltage restorer for powerquality improvement”, IEEE Trans., Power Del., vol.
24, no. 1, pp. 277-284, Jan. 2009.
[10] R.Omar, and N.A.Rahim “power quality
improvement in low voltage distribution system using
dynamic voltage restorer (DVR)”Industrial Electronics
and Applications (ICIEA), 2010 the 5th IEEE
Conference, pp. 973-978, 2010.
[11] R.Omar, N. A. Rahim, and M. Sulaiman “New
control technique applied in dynamic voltage restorer
for voltage sag mitigation”,American J. of Engineering
and Applied Sciences 3 (1): pp.42-48, 2010.
[12] P. R. Sanchez, and E. Acha “Dynamic voltage
restorer based on flying capacitor multilevel
converters operated by repetitive control”,IEEE
Transactions on power delivery, Vol.24, No.2, pp. 951-
960, April 2009.
[13] R. Amrita, and A. K. Nadir “Modeling &
Simulation of dynamic voltage restorer (DVR) forenhancing voltage sag”, Sensors & Transducers
Journal, Vol. 87, Issue 1, January 2008, pp. 85-93, 2008.
[14] R. Omar, and N. A. Rahim “Modeling and
simulation for voltage sags/swells mitigation using
dynamic voltage restorer (DVR)”,Power Engineering
Conference, 2008. AUPEC '08. Dec.2008, pp. 1-5.
[15] M. A. Bhaskar, S. S. Dash, C. Subramani, M. J.
Kumar, P. R. Giresh, M. V. Kumar “Voltage quality
improvement using DVR”, 2010 International
Conference on Recent Trends in Information,
Telecommunication and Computing, pp. 378-380,
IEEE,2010.
[16] Wang Kai, “Analysis of a dynamic voltage
regulator”, Master of Science Thesis. Stockholm,
Sweden 2009, XR-EE-EME 2009:010.
[17] A. Almeida, L. Moreira, J. Delgado, “Power
quality problems and new solutions”, The electrical
and computer engineering,pp. 1-9,2003.
[18] M. V. Kasuni Perera, “Control of a dynamic
voltage restorer to compensate single phase voltage
sags” Master of Science Thesis, KTH Electrical
Engineering, Stockholm, Sweden, 2007.
[19] Ray Arnold “Solutions to Power Quality
Problems” power engineering journal pages: 65-73.
2001.
[20] T. Devaraju, V. C. Veera Reddy, and M. V. Kumar
“Role of custom power devices in power quality
enhancement: A Review”,International Journal of
Engineering Science and Technology, Vol.2 (8), 2010,
pp. 3628-3634. 

Currently there are no Refbacks

Paper Title : A Grid-Connected Hybrid Generation System with Multilevel Inverter Using SVM Technique.
Authors : B. MAHESH, SHAIK. MABHU JANI,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology & Management
Assistant Professor, Priyadarshini Institute of Technology & Management
Abstract :

af

:NOT ASSIGNED
DOI Link : NOT ASSIGNED


DC/AC Power Conversion, Multilevel Inverter.

B. MAHESH,SHAIK. MABHU JANI."A Grid-Connected Hybrid Generation System with Multilevel Inverter Using SVM Technique.". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06, December - 2014,

[1] Y. Li, D. M. Vilathgamuwa, and P. C. Loh, Design,
analysis, and real-time testing of a controller for multi
bus microgrid system,‖ IEEE Trans. Power Electronics,
vol. 19,no. 5, pp. 1195-1204, Sept. 2004.
[2] N. Hatziargyriou, H. Asano, R. Iravani, and C.
Marnay,Micro grids,‖ IEEE Power and Energy
Magazine, vol. 5,no. 4, pp. 78-94, Jul./Aug. 2007.
[3] F. Katiraei, R. Iravani, N. Hatziargyriou, and A.
Dimeas,Microgrids management,‖ IEEE Power and
Energy Magazine, vol. 6, no. 3, pp. 54-65, May/Jun.,
2008.
[4] C. L. Chen, Y. Wang, J. S. Lai, Y. S. Lee, and
D.Martin, Design of parallel inverters for smooth mode
transfer microgrid applications,‖ IEEE Trans. Power
Electronics, vol. 25, no. 1, pp. 6-15, Jan. 2010.
[5] C. T. Pan, C. M. Lai, and M. C. Cheng, A novel high
step-up ratio inverter for distributed energy resources
(DERs),‖ IEEE International Power Electronics
ConferenceECCE Asia, pp.1433-1437, 2010.
[6] C. T. Pan, C. M. Lai, and M. C. Cheng A novel
integrated single-phase inverter with an auxiliary stepup circuit for low-voltage alternative energy source
application,‖ IEEE Trans. Power Electronics, vol. 25, no.
9,pp. 2234-2241, Sep. 2010.
[7] F. Blaabjerg, Z. Chen, and S. B. Kjaer, Power
electronics as efficient interface in dispersed power
generation systems,‖ IEEE Trans. Power Electronics,
vol.19, no. 5, pp. 1184-1194, Sep. 2004.
[8] D. G. Infield, P. Onions, A. D. Simmons, and G.
A.Smith, Power quality from multiple grid-connected
singlephase inverters,‖ IEEE Trans. Power Delivery, vol.
19, no.4, pp. 1983-1989, Oct. 2004.
[9] S. B. Kjaer, J. K. Pedersen, and F. Blaabjerg A review
of single-phase grid-connected inverters for
photovoltaic modules,‖ IEEE Trans. Industry
Applications, vol. 41, no. 5,pp. 1292-1306, Sep./Oct. 2005.
[10] O. Lopez, R.Teodorescu, and J. DovalGandoy,Multilevel transformer less topologies for
single-phase grid-connected converters‖ IEEE Industrial
Electronics Conference, pp. 5191-5196, 2006.
[11] T. Kerekes, R. Teodorescu, and U. Borup,
―Transformer less photovoltaic inverters connected to
the grid,‖ IEEE Applied Power Electronics Conference,
pp. 1733-1737,2007.
[12] G. Ceglia, V. Guzman, C. Sanchez, F. Ibanez, J.
Walter,and M. I. Gimenez, A new simplified multilevel
inverter topology for DC-AC conversion,‖ IEEE Trans.
Power Electronics, vol. 21, no. 5, pp. 1311- 1319, Sep.
2006
[13] N. A. Rahim and J. Selvaraj, Multi string five-level
inverter with novel PWM control scheme for PV
application,‖ IEEE Trans. Power Electronics, vol. 57, no.
6,pp. 2111-2123, Jun. 2010
[14] C. T. Pan, W. C. Tu, and C. H. Chen, A novel
GZVbased multilevel single phase inverter,‖ Taiwan
Power Electronics conference, pp. 1391-1396, Sep. 2010.
[15] W. Yu, J. S. Lai, H. Qian, C. Hutchens, J. Zhang,
G.Lisi, A. Djabbari, G. Smith, and T. Hegarty,
Highefficiency inverter with H6-type configuration for
photovoltaic non-isolated AC module applications,‖ IEEE Applied Power Electronics Conference and
Exposition, pp. 1056-1061, 2010.
[16] S. Vazquez, J. I. Leon, J. M. Carrasco, L. G.
Franquelo,E. Galvan, M. Reyes, J. A. Sanchez, and E.
Dominguez,―Analysis of the power balance in the cells
of a multilevel cascaded H-bridge converter,‖ IEEE
Trans. Industrial Electronics, vol. 57, no. 7, pp. 2287-
2296, Jul. 2010.
[17] S. Daher, J. Schmid, and F. L.M. Antunes,
―Multilevel inverter topologies for stand-alone PV
systems,‖ IEEE Trans. Industrial Electronics, vol. 55, no.
7, pp. 2703-2712,Jul. 2008.

Currently there are no Refbacks

     

Paper Title : A Logic-based Friend Reference Semantic System for an online Social Networks
Authors : A.Kirankumar, P.Ganesh Kumar Reddy, A.Ram Charan Reddy
Affiliations : Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Outstanding achievement of rising Web 2.0, and distinctive informal community (social network) Sites, for example, Amazon and motion picture lens, recommender frameworks are making remarkable chances to help individuals scanning the web when searching for pertinent data, and settling on decisions. By and large, these recommender frameworks are arranged in three classifications: content based, collaborative separating, and cross breed based suggestion frameworks. As a rule, these frameworks utilize standard suggestion routines, for example, counterfeit neural networks, nearest neighbor, or Bayesian systems. Be that as it may, these methodologies are constrained contrasted with systems focused around web applications, for example, informal communities or semantic web. In this paper, we propose a novel methodology for suggestion frameworks called semantic social proposal frameworks that improve the assessment of informal communities (social network) abusing the force of semantic interpersonal organization investigation. Investigates true information from Amazon look at the nature of our suggestion system and additionally the execution of our proposal calculations.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Semantic System, Social Networks, Recommendation systems

A.Kirankumar,P.Ganesh Kumar Reddy,A.Ram Charan Reddy,Baneti Shivaji,D.Jayanarayan Reddy."A Logic-based Friend Reference Semantic System for an online Social Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.501-506, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I622.pdf,

[1] Adam Rae, Börkur Sigurbjörnsson, Roelof van
Zwol.Improving tag recommendation using social
networks Proceeding RIAO '10 Adaptivity,
Personalization and Fusion of Heterogeneous
Information. Paris France. 2010.
[2] G. Adomavicius and A. Tuzhilin. Toward the next
generation of recommender systems: A survey of the
state-of-the-art and possible extensions. Knowledge
and Data Engineering, IEEE Transactions on,
17(6):734-749, 2005.
[3] C. C. Aggarwal, J. L. Wolf, K. Wu, and P. S. Yu.
Horting Hatches an Egg: A New Graph-Theoretic
Approach to Collaborative Filtering. In KDD '99:
Proceedings of the fifth ACM SIGKDD international
conference on Knowledge discovery and data mining,
pp 201-212, San Diego, California,United States, 1999.
ACM.
[4] E.-A. Baatarjav, S. Phithakkitnukoon, and R.
Dantu. Group recommendation system for facebook.
Pp 221-219. 2008.
[5] Balabanovic, M., and Shoham, Y., 1997. Fab:
Content-based,collaborative recommendation.
Communications of the ACM,40:66-72, 1997
[6] S. D. Bedrick and D. F. Sittig. A scientific
collaboration tool built on the facebook platform.
AMIA ... Annual Symposium proceedings / AMIA
Symposium. (2008):41-45, 2008.
[7] Berners-Lee, T., Hendler, J. y Lassila, O. "The
Semantic Web: A new form of Web content that is
meaningful to computers will unleash a revolution of
new possibilities". (2001) scientific American, May.
[8] Boutilier, C., Zemel, R.S. y Marlin, B. (2003).
"Active collaborative filtering". Proc. Of the 19th
Annual Conference on Uncertainty in Artificial
Intelligence, pp. 98-106.
[9] A. Byde, H. Wan, and S. Cayzer. personalized tag
recommendations via tagging and content-based
similarity metrics. Proceedings of the International
Conference on Weblogs and Social Media, (March
2007)
[10] P. Cano, O. Celma, M. Koppenberger, and M.
J.Buldu.Topology of music recommendation
networks. Chaos An Interdisciplinary Journal of
Nonlinear Science, 16, 2006.
[11] M. Claypool, A. Gokhale, T. Miranda, P.
Murnikov, D.Netes, and M. Sartin. Combining content-based and collaborative filters in an online
newspaper, 1999.
[12] Cantador, I. y Castells, P. Multilayered Semantic
Social Network Modeling by Ontology-Based User
Profiles Clustering:Application to Collaborative
Filterin. In Managing Knowledge in a World of
Networks, pp. 334-34, 2006
[13] S. Downes. The semantic social network,
February 2004,http://www.downes.ca/post/46 ,
published in The Learning Organization: An
International Journal, Emerald Group Publishing
Limited, Vol. 12 (2005) 411-417
[14] G. Erétéo, F. L. Gandon, O. Corby, and M. Buffa.
Semantic social network analysis. CoRR,
abs/0904.3701, 2009.
[15] J. Golbeck and M. Rothstein. Linking social
networks on the web with foaf: A semantic web case
study. In AAAI, pages 1138–1143, 2008.
[16] Henry M.Kim. Ontologies for the semantic web:
Can social network analysis be used to develop them?
Proceedings of the Conference on Computational
Analysis of Social and Organizational Systems
(CASOS), Pittsburgh, PA, June 21-3,2002.
[17] J. A. Konstan, B. N. Miller, D. Maltz, J. L.
Herlocker, L. R.Gordon, and J. Riedl. Grouplens:
Applying collaborative filtering to Usenet news.
Communications of the ACM, 40(3):77-87,1997.
[18] J. L. Herlocker, J. A. Konstan, A. Borchers, and J.
Riedl. An algorithmic framework for performing
collaborative filtering. In SIGIR '99: Proceedings of the
22nd annual international ACM SIGIR conference on
Research and development in information etrieval,
pages 230-237, New York, NY, USA, 1999. ACM.
[19] T. Hofmann. Latent Class Models for
Collaborative Filtering. In In Proceedings of the
Sixteenth International Joint Conference on Artificial
Intelligence, pages 688-693, 1999.
[20] B. Hoser, A. Hotho, R. Jäschke, C. Schmitz, and
Stumme,Gerd. Semantic Network Analysis of
Ontologies, 3rd European Semantic Web Conference,
ESWC 2006, Budva, Montenegro,June 11-14, 2006,
Proceedings Series: Lecture Notes in Computer
Science, Vol. 4011 Subseries: Information Systems and
Applications.

Currently there are no Refbacks

Paper Title : Design and Performance of Automatic Vending Machine using VHDL
Authors : UPIRTHI VIJITHA, A SOMASEKAR,
Affiliations : M.Tech, Priyadarshini Institute of Technology and Science for Women
Associate Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

At the present days, Vending Machines are well known among Japan, Malaysia and Singapore. The quantity of machines in these countries is on the top worldwide. This is due to the modern lifestyles which require fast food processing with high quality. This paper describes the designing of multi select machine using Finite State Machine Model with Auto-Billing Features. Finite State Machine (FSM) modeling is the most crucial part in developing proposed model as this reduces the hardware. In this paper the process of four state (user Selection, Waiting for money insertion, product delivery and servicing) has been modeled using MEALY Machine Model. The proposed model is tested using Spartan three development board and its performance is compared with CMOS based machine.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


FSM; VHDL; Vending Machine; FPGA Spartan 3 development board;

UPIRTHI VIJITHA,A SOMASEKAR."Design and Performance of Automatic Vending Machine using VHDL". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.485-493, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I620.pdf,

[1]FauziahZainuddin, NorlinMohd Ali,
RoslinaMohdSidek, AwanisRomli,
NooryatiTalib&Mohd.Izham Ibrahim (2009)
“Conceptual Modeling for Simulation: Steaming
frozen Food Processing in Vending Machine”
International Conference on Computer Science and
Information Technology, University Malaysia Pahang,
pp.145-149.
[2]Xilinx Inc., Spartan 3 Data sheet: http://ww
w.xilinx.com. 
[3] Bhaskar “VHDL primer” Second
Edition,
[4 Peter Minns& Ian Elliott, “FSM-based Digital Design
using Verilog HDL”, John Wiley & Sons Ltd 2008.
[5] Zhang Wen & Zhang Xin Long (2010) “Design and
Implementation of automatic vending machine
Based on the short massage payment” International
Conference on Information and Communication
technology in Electrical Sciences, Neijiang, Sichuan,
China.pp.978-981.
[6] B. Caulfield & M.O Mahony (2005) “Passenger
Requirements of a Public Transport Ticketing
System” Proceedings of the 8th International IEEE
Conference on Intelligent Transportation Systems
Vienna, Austria, pp-32-37.
[7] M. Zhou, Q. Zhang & Z. Chen (2006), “What
Can Be Done to Automate Conceptual Simulation
Modelling?” Proceedings of the 2006 Winter
Simulation Conference, pp. 809 – 814.
[8]Biplab Roy &Biswarup Mukherjee (2010)
“Design of Coffee Vending Machine using Single
Electron Devices” Proceedings of 2010 International
Symposium on Electronic System Design. Pp 38-43.
[9]C. J Clement Singh, K Senthil Kumar, JayantoGope,
SumanBasu&Subir Kumar Sarkar (2007) “ Single
Electron Device based Automatic Tea Vending
Machine” proceedings of International Conference
on Information and Communication Technology in
Electrical Sciences (ICTES 2007) , pp 891-896.
[10] P. Smith (1997) “Automatic Hot-food Vending
Machine,” Trends in Food Science & Technology
October 1997, Vol. 81, and pp. 349.

Currently there are no Refbacks

Paper Title : Design of Low Power TPG with LP-LFSR
Authors : VINUKONDA SRILATHA, RAKESH K,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Assistant Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

This paper presents a novel test pattern generator which is more suitable for built in self test (BIST) structures used for testing of VLSI circuits. The objective of the BIST is to reduce power dissipation without affecting the fault coverage. The proposed test pattern generator reduces the switching activity among the test patterns at the most. In this approach, the single input change patterns generated by a counter and a gray code generator are Exclusive-O Red with the seed generated by the low power linear feedback shift register [LP-LFSR]. The proposed scheme is evaluated by using, a synchronous pipelined 4x4 and 8x8 Braun array multipliers. The System-On-Chip (SOC) approach is adopted for implementation on Altera Field Programmable Gate Arrays (FPGAs) based SOC kits with Nios soft-core processor. From the implementation results, it is verified that the testing power for the proposed method is reduced by a significant percentage.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


FPGA, BIST, LP-LFSR, Switching activity

VINUKONDA SRILATHA,RAKESH K."Design of Low Power TPG with LP-LFSR". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.480-484, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I619.pdf,

[1]BalwinderSingh, Arunkhosla and SukhleenBindra
"Power Optimization of linear feedback shift
register(LFSR) for low power BIST" , 2009 IEEE
international Advance computing conference(IACC
2009) Patiala,India 6-7 March 2009.
[2]Y.Zorian, "A Distributed BIST control scheme for
complex VLSI devices," Proc. VLSI Test Symp., P.4-
9,1993.
[3]P.Girard," survey of low-power testing of VLSI
circuits," IEEE design and test of computers, Vol.
19,no.3,PP 80-90,May-June 2002.
[4]MechrdadNourani,"Low-transition test pattern
generation for BIST- Based Applications", IEEE
TRANSACTIONS ON COMPUTERS, Vol 57,No.3
,March 2008.
[5]BOYE and Tian-Wang Li," A novel BIST scheme
for low power testing," 2010 IEEE.
[6]R.S.Katti,X.Y.Ruan , and H.Khattri," MultipleOutput Low-Power Linear feedback shift register
design," IEEE Trans.circuitsSyst.I,Vol.53,No.7,pp1487-1495,July 2006.
[7]P.Girard, L.Guiller, C.Landrault, S.Pravossoudovitch,andH.J.Wunderlich," A
modified clock scheme for a low power BIST test
pattern generator," 19th IEEE proc. VLSI test
Symp.,CA,pp-306- 311,Apr-May 2001.
[8]S.Wang and S.K.Gupta," DS-LFSR: a BIST TPG for
low switching activity," IEEE Trans.computer-aided
design of Integrated circuits and systems, Vol.
21,No.7,pp.842-851,July 2002.
[9]I.Voyiatzis,A.paschalis,D.Nikolos and C.Halatsis,
"An efficient built-in self test method for robust path
delay fault testing," Journal of electronic testing:
Theory and applications Vol.8,No.2,pp-219-222,Apr1996.
[10]S.C.Lei, J.Guo, L.Cao, Z.Ye.Liu, and
X.M.Wang,"SACSR: A low power BIST method for
sequential circuits,: Academic Journal of XI'AN
jiaotong university(English
Edition),Vol.20,no.3,pp.155- 159,2008.
[11]R.H.He,X.W.Li and Y.Z.Gong," A scheme for low
power BIST test pattern generator," micro
electronics& computer,no.2,pp.36-39 Feb.2003.
[12]S.C. Lei, X.Y.Hou ,Z.B.Shao and F.Liang," A class
of SIC circuits: theory and application in BIST
design," IEEE trans. circuits syst. II,
vol.55,no.2,pp.161-165,Feb.2008.

Currently there are no Refbacks

Paper Title : Robust Model-Based Data Management
Authors : B.ASWINI, B.RANJITH,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women</br>HOD-CSE, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

Making new connections according to personal preferences is a crucial service in mobile social networking, where the initiating user can find matching users within physical proximity of him/her. In existing systems for such services, usually all the users directly publish their complete profiles for others to search. However, in many applications, the users’ personal profiles may contain sensitive information that they do not want to make public. In this paper, we propose Find U, the first privacy-preserving personal profile matching schemes for mobile social networks. In Find U, an initiating user can find from a group of users the one whose profile best matches with his/her; to limit the risk of privacy exposure, only necessary and minimal information about the private attributes of the participating users is exchanged. Matching user profiles using their physical proximity via mobile social networking is a critical thing. We propose Find U, the concept used to limit the privacy levels and also to find the best matching profiles. To realize the user privacy levels here we are using secure multiparty computation (SMC) techniques. We also propose protocols such as PSI, PCSI to prove their security proofs. We evaluate the efficiency of the protocols by adopting the total run time and energy consumption.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Private profile matching, Shamir secret sharing algorithm, Secure multi-party computation, set inflation attack, Honest but curious model, Blind and permute model.

B.ASWINI,B.RANJITH."Robust Model-Based Data Management". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.453-460, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I616.pdf,

[1] The Description Logic Handbook: Theory,
Implementation, and Applications, F. Baader, D.
Calvanese, D. McGuinness, D. Nardi, P.F. PatelSchneider, eds. Cambridge Univ. Press, 2003.
[2] Modular Ontologies: Concepts, Theories and
Techniques for Knowledge Modularization, H.
Stuckenschmidt, C. Parent, S. Spaccapietra, eds.
Springer, 2009.
[3] S. Ghilardi, C. Lutz, and F. Wolter, “Did I Damage
My Ontology? A Case for Conservative Extensions in
Description Logics,” Proc.10th Int’l Conf. Principles of
Knowledge Representation and Reasoning
(KR), 2006.
[4] R. Kontchakov, L. Pulina, U. Sattler, T. Schneider, P.
Selmer, F.Wolter, and M. Zakharyaschev, “Minimal
Module Extraction from DL-Lite Ontologies Using QBF
Solvers,” Proc. 21st Int’l Joint Conf.Artificial
Intelligence (IJCAI), 2009.
[5] Z. Wang, K. Wang, R.W. Topor, and J.Z. Pan,
“Forgetting concepts in DL-Lite,” Proc. Fifth European
Semantic Web Conf. Semantic Web:Research and
Applications (ESWC), 2008.
[6] B. Konev, D. Walther, and F. Wolter, “Forgetting
and Uniform Interpolation in Extensions of the
Description Logic EL,” Proc.22nd Int’l Workshop
Description Logics, 2009.
[7] B. Konev, C. Lutz, D. Walther, and F. Wolter,
“Semantic Modularity and Module Extraction in
Description Logics,” Proc.18th European Conf.
Artificial Intelligence (ECAI), 2008.
[8] B. Konev, D. Walther, and F. Wolter, “Forgetting
and Uniform Interpolation in Large-Scale Description
Logic Terminologies,” Proc. 21st Int’l Joint Conf.
Artifical intelligence (IJCAI), 2009.
[9] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler, “Just the Right Amount: Extracting Modules
from Ontologies,” Proc. 16th Int’l Conf. World Wide
Web (WWW), 2007.
[10] K. Wang, Z. Wang, R.W. Topor, J.Z. Pan, and G.
Antoniou, “Concept and Role Forgetting in ALC
Ontologies,” Proc.Eighth
Int’l Semantic Web Conf. (ISWC), 2009.
[11] D. Calvanese, G.D. Giacomo, D. Lembo, M.
Lenzerini, and R.Rosati, “Tractable Reasoning andEfficient Query Answering in Description Logics: The
DL-Lite Family,” J. Automated Reasoning,vol. 39, no. 3,
pp. 385-429, 2007.
[12] O. Palombi, G. Bousquet, D. Jospin, S. Hassan, L.
Reve´ret, and F.Faure, “My Corporis Fabrica: A Unified
Ontological, Geometrical and Mechanical View of
Human Anatomy,” Proc. Second Workshop
3D Physiological Human (3DPH), 2009.
[13] S. Abiteboul, R. Hull, and V. Vianu, Foundations of
Databases. Addison-Wesley, 1995.
[14] M.Y. Vardi, “The Complexity of Relational Query
Languages,” Proc. 14th Ann. ACM Symp. Theory of
Computing (STOC), 1982.
[15] A. Cali, G. Gottlob, and T. Lukasiewicz, “Datalog+-
: A UnifiedApproach to Ontologies and Integrity
Constraints,” Proc. Int’l Conf. Database Theory (ICDT),
2009.
[16] R. Cattell, “Scalable Sql and Nosql Data Stores,”
SIGMOD Record,vol. 39, no. 4, pp. 12-27, 2010.
[17] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler,“Extracting Modules from Ontologies: A LogicBased Approach,” Proc. Third Int’l Workshop OWL
Experiences and Directions(OWLED), 2007
[18] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler, “Modular
Reuse of Ontologies: Theory and Practice,” J. Artificial
Intelligence Research, vol. 31, pp. 273-318, 2008. 

Currently there are no Refbacks

Paper Title : EAACK: Secure IDS for Wireless Sensor Networks
Authors : JALAGAM NAGAMANI, K.SUMALATHA,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Assistant Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

The migration to wireless network from wired network has been a global trend in the past few decades.The open medium and wide distribution of nodes make MANET vulnerable to malicious attackers. A new technique EAACK (Enhanced Adaptive Acknowledgement) method designed for MANET was proposed for intrusion detection.EAACK demonstrates higher malicious-behavior-detection rates in certain circumstances while does not greatly affect the network performances.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Keywords- EAACK (Enhanced Adaptive Acknowledgement), IBOOS (Identity Based Online/Offline Signature),SACK (Selective Acknowledgement), Packet dropping, Watchdog scheme.

JALAGAM NAGAMANI,K.SUMALATHA."EAACK: Secure IDS for Wireless Sensor Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.461-469, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I617.pdf,

[1] K. Al Agha, M.-H. Bertin, T. Dang, A. Guitton, P. Minet, T. Val, and J.-B.‖Viollet,‖“Which‖wireless‖ technology for industrial wireless sensor networks?‖ The‖ development‖ of‖ OCARI‖ technol,”‖ IEEE Trans. Ind. Elec- tron., vol. 56, no. 10, pp. 4266–4278, Oct. 2009. 
[2] R. Akbani, T. Korkmaz, and G. V. S. Raju, “Mobile‖ Ad‖ hoc‖ Net- work‖ Security,”‖ in‖ Lecture‖ Notes in Electrical Engineering, vol. 127. New York: Springer-Verlag, 2012, pp. 659–666. 
[3]‖R.‖H.‖Akbani,‖S.‖Patel,‖and‖D.‖C.‖Jinwala,‖“DoS‖ attacks‖ in‖ mobile‖ ad‖ hoc‖ networks:‖ A‖ survey,”‖ in‖ Proc. 2nd Int. Meeting ACCT, Rohtak, Haryana, India, 2012, pp. 535–541. 
[4]‖ T.‖ Anantvalee‖ and‖ J.‖ Wu,‖ “A‖ Survey‖ on‖ Intrusion‖Detection‖in‖Mobile‖Ad‖Hoc‖Networks,”‖ in Wireless/Mobile Security. New York: SpringerVerlag, 2008. 
[5] L. Buttyan and J. P. Hubaux, Security and Cooperation in Wireless Networks. Cambridge, U.K.: Cambridge Univ. Press, Aug. 2007.
 [6] D. Dondi, A. Bertacchini, D. Brunelli, L. Larcher,‖ and‖ L.‖ Benini,‖ “Model- ing and optimization of a solar energy harvester system for self-powered‖ wireless‖ sensor‖ networks,”‖ IEEE‖ Trans. Ind. Electron., vol. 55, no. 7, pp. 2759–2766, Jul. 2008. 
[7]‖ V.‖ C.‖ Gungor‖ and‖ G.‖ P.‖ Hancke,‖ “Industrial‖ wireless sensor networks: Challenges, design principles,‖ and‖ technical‖ approach,”‖ IEEE‖ Trans.‖ Ind. Electron., vol. 56, no. 10, pp. 4258–4265, Oct. 2009. 
[8] Y. Hu, D. Johnson, and A. Perrig,‖ “SEAD:‖ Secure‖ efficient‖ distance‖ vector‖ routing‖ for‖mobile‖ wireless‖ ad‖ hoc‖ networks,”‖ in‖ Proc.‖ 4th‖ IEEE‖ Workshop Mobile Comput. Syst. Appl., 2002, pp. 3–13. 
[9]‖Y.‖Hu,‖A.‖Perrig,‖ and‖D.‖ Johnson,‖ “ARIADNE:‖ A secure on-demand rout- ing protocol for ad hoc networks,”‖in‖Proc.‖8th‖ACM‖Int.‖Conf.‖MobiCom,‖ Atlanta, GA, 2002, pp. 12–23. 
[10]‖ G.‖ Jayakumar‖ and‖ G.‖ Gopinath,‖ “Ad‖ hoc‖ mobile wireless networks rout- ing protocol—A review,”‖J.‖Comput.‖Sci.,‖vol.‖3,‖no.‖8,‖pp.‖574–582, 2007. 
[11] D. Johnson and D. Maltz,‖ “Dynamic‖ Source‖ Routing‖ in‖ ad‖ hoc‖ wireless‖ networks,”‖ in‖ Mobile‖ Computing. Norwell, MA: Kluwer, 1996, ch. 5, pp. 153–181. 
[12] N. Kang, E. Shakshuki, and T. Sheltami, “Detecting‖ misbehaving‖ nodes‖ in‖ MANETs,”‖ in‖ Proc. 12th Int. Conf. iiWAS, Paris, France, Nov. 8– 10, 2010, pp. 216–222. 
[13] N. Kang, E. Shakshuki, and T. Sheltami, “Detecting‖ forged‖ acknowl- edgements in MANETs,”‖ in‖ Proc.‖ IEEE‖ 25th‖ Int.‖ Conf.‖ AINA,‖ Biopolis, Singapore, Mar. 22–25, 2011, pp. 488–494. 
[14] K. Kuladinith, A. S. Timm-Giel, and C. Görg, “Mobile‖ ad-hoc commu- nications in AEC industry,”‖ J.‖ Inf.‖ Technol.‖ Const.,‖ vol.‖ 9,‖ pp.‖ 313– 323, 2004. 
[15] J.-S.‖ Lee,‖ “A‖ Petri‖ net‖ design‖ of‖ command‖ filters‖ for‖ semiautonomous‖ mobile‖ sensor‖ networks,”‖ IEEE‖ Trans.‖ Ind.‖ Electron.,‖ vol.‖ 55,‖ no.‖ 4, pp. 1835–1841, Apr. 2008. 
[16] K. Liu, J. Deng, P. K. Varshney, and K. Balakrishnan,‖ “An‖ acknowledgment-based approach for the detection of routing misbehaviour‖ in‖ MANETs,”‖ IEEE‖ Trans.‖ Mobile‖ Comput., vol. 6, no. 5, pp. 536–550, May 2007. 
[17] S. Marti, T. J. Giuli, K. Lai, and M. Baker, “Mitigating‖ routing‖ misbe- haviour in mobile ad hoc‖ networks,”‖ in‖ Proc.‖ 6th‖ Annu.‖ Int.‖ Conf.‖ Mobile Comput. Netw., Boston, MA, 2000, pp. 255– 265. 
[18] A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC, 1996, T-37. 
[19]‖ N.‖ Nasser‖ and‖ Y.‖ Chen,‖ “Enhanced‖ intrusion‖ detection systems for dis- covering malicious nodes in mobile ad hoc‖network,”‖in‖Proc.‖IEEE‖Int.‖ Conf. Commun., Glasgow, Scotland, Jun. 24–28, 2007, pp. 1154–1159. 
[20] J. Parker, J. Undercoffer, J. Pinkston, and A. Joshi,‖ “On‖ intrusion‖ detection‖ and‖ response‖ for‖ mobile‖ ad‖hoc‖networks,”‖in‖Proc.‖ IEEE‖ Int.‖Conf.‖ Perform., Comput., Commun., 2004, pp. 747–752. 
[21]‖ A.‖ Patcha‖ and‖ A.‖ Mishra,‖ “Collaborative‖ security architecture for black hole attack prevention‖ in‖ mobile‖ ad‖ hoc‖ networks,”‖ in‖ Proc.‖ Radio Wire- less Conf., 2003, pp. 75–78. 
[22] A. Patwardhan, J. Parker, A. Joshi, M. Iorga, and‖T.‖Karygiannis,‖“Secure‖routing‖and‖intrusion‖ detection‖ in‖ ad‖ hoc‖ networks,”‖ in‖ Proc.‖ 3rd‖ Int.‖ Conf. Pervasive Comput. Commun., 2005, pp. 191– 199. 
[23]‖ R.‖ Rivest,‖ A.‖ Shamir,‖ and‖ L.‖ Adleman,‖ “A‖ method for obtaining digital signatures and publickey‖cryptosystems,”‖Commun.‖ACM,‖vol.‖21,‖no.‖2,‖ pp. 120–126, Feb. 1983. 
[24] J. G. Rocha, L. M. Goncalves, P. F. Rocha, M. P. Silva, and S. Lanceros- Mendez,‖ “Energy‖ harvesting from piezoelectric materials fully integrated‖in‖footwear,”‖IEEE‖Trans. Ind. Electron., vol. 57, no. 3, pp. 813–819, Mar. 2010. 
[25] T. Sheltami, A. Al-Roubaiey, E. Shakshuki, and A.‖ Mahmoud,‖ “Video‖ transmissionenhancementinpresenceofmisbehavin gnodesinMANETs,”‖ Int.‖ J.‖ Multimedia‖ Syst.,‖ vol.‖ 15, no. 5, pp. 273–282, Oct. 2009. 
[26] A. Singh, M. Maheshwari, and N. Kumar, “Security‖ and‖ trust‖ management‖ in‖ MANET,”‖ in‖ Communications in Computer and Information Science, vol. 147. New York: Springer-Verlag, 2011, pt. 3, pp. 384–387. 
[27]‖ B.‖ Sun,‖ “Intrusion‖ detection‖in‖mobile‖ ad hoc networks,”‖Ph.D.‖disserta- tion, Texas A&M Univ., College Station, TX, 2004. 
[28] K. Stanoevska-Slabeva and M. Heitmann, “Impact‖of‖mobile‖ad-hoc net- works on the mobile value‖system,”‖in‖Proc.‖ 2nd‖Conf.‖m-Bus., Vienna, Austria, Jun. 2003. 
[29] A. Tabesh‖ and‖L.‖G.‖Frechette,‖ “A‖low-power stand-alone adaptive circuit for harvesting energy from‖ a‖ piezoelectric‖micropower‖ generator,”‖ IEEE‖ Trans. Ind. Electron., vol. 57, no. 3, pp. 840–849, Mar. 2010. 
[30]‖ M.‖ Zapata‖ and‖ N.‖ Asokan,‖ “Securing‖ ad‖ hoc‖ routing‖ protocols,”‖ in‖ Proc.‖ ACM‖ Workshop‖ Wireless Secur., 2002, pp. 1–10. 
[31]‖ L.‖ Zhou‖ and‖ Z.‖ Haas,‖ “Securing‖ ad-hoc networks,”‖ IEEE‖ Netw.,‖ vol.‖ 13,‖ no.‖ 6,‖ pp.‖ 24–30, Nov./Dec. 1999. 
[32] Botan, A Friendly C ++ Crypto Library. [Online]. Available: http:// botan.randombit.net/1098 IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, VOL. 60, NO. 3, MARCH 2013

Currently there are no Refbacks

Paper Title : Robust Model-Based Data Management
Authors : B.ASWINI, B.RANJITH,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
HOD-CSE, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

Making new connections according to personal preferences is a crucial service in mobile social networking, where the initiating user can find matching users within physical proximity of him/her. In existing systems for such services, usually all the users directly publish their complete profiles for others to search. However, in many applications, the users’ personal profiles may contain sensitive information that they do not want to make public. In this paper, we propose Find U, the first privacy-preserving personal profile matching schemes for mobile social networks. In Find U, an initiating user can find from a group of users the one whose profile best matches with his/her; to limit the risk of privacy exposure, only necessary and minimal information about the private attributes of the participating users is exchanged. Matching user profiles using their physical proximity via mobile social networking is a critical thing. We propose Find U, the concept used to limit the privacy levels and also to find the best matching profiles. To realize the user privacy levels here we are using secure multiparty computation (SMC) techniques. We also propose protocols such as PSI, PCSI to prove their security proofs. We evaluate the efficiency of the protocols by adopting the total run time and energy consumption.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Private profile matching, Shamir secret sharing algorithm, Secure multi-party computation, set inflation attack, Honest but curious model, Blind and permute model.

B.ASWINI,B.RANJITH."Robust Model-Based Data Management". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.453-460, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I616.pdf,

[1] The Description Logic Handbook: Theory,
Implementation, and Applications, F. Baader, D.
Calvanese, D. McGuinness, D. Nardi, P.F. PatelSchneider, eds. Cambridge Univ. Press, 2003.
[2] Modular Ontologies: Concepts, Theories and
Techniques for Knowledge Modularization, H.
Stuckenschmidt, C. Parent, S. Spaccapietra, eds.
Springer, 2009.
[3] S. Ghilardi, C. Lutz, and F. Wolter, “Did I Damage
My Ontology? A Case for Conservative Extensions in
Description Logics,” Proc.10th Int’l Conf. Principles of
Knowledge Representation and Reasoning
(KR), 2006.
[4] R. Kontchakov, L. Pulina, U. Sattler, T. Schneider, P.
Selmer, F.Wolter, and M. Zakharyaschev, “Minimal
Module Extraction from DL-Lite Ontologies Using QBF
Solvers,” Proc. 21st Int’l Joint Conf.Artificial
Intelligence (IJCAI), 2009.
[5] Z. Wang, K. Wang, R.W. Topor, and J.Z. Pan,
“Forgetting concepts in DL-Lite,” Proc. Fifth European
Semantic Web Conf. Semantic Web:Research and
Applications (ESWC), 2008.
[6] B. Konev, D. Walther, and F. Wolter, “Forgetting
and Uniform Interpolation in Extensions of the
Description Logic EL,” Proc.22nd Int’l Workshop
Description Logics, 2009.
[7] B. Konev, C. Lutz, D. Walther, and F. Wolter,
“Semantic Modularity and Module Extraction in
Description Logics,” Proc.18th European Conf.
Artificial Intelligence (ECAI), 2008.
[8] B. Konev, D. Walther, and F. Wolter, “Forgetting
and Uniform Interpolation in Large-Scale Description
Logic Terminologies,” Proc. 21st Int’l Joint Conf.
Artifical intelligence (IJCAI), 2009.
[9] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler, “Just the Right Amount: Extracting Modules
from Ontologies,” Proc. 16th Int’l Conf. World Wide
Web (WWW), 2007.
[10] K. Wang, Z. Wang, R.W. Topor, J.Z. Pan, and G.
Antoniou, “Concept and Role Forgetting in ALC
Ontologies,” Proc.Eighth
Int’l Semantic Web Conf. (ISWC), 2009.
[11] D. Calvanese, G.D. Giacomo, D. Lembo, M.
Lenzerini, and R.Rosati, “Tractable Reasoning and Efficient Query Answering in Description Logics: The
DL-Lite Family,” J. Automated Reasoning,vol. 39, no. 3,
pp. 385-429, 2007.
[12] O. Palombi, G. Bousquet, D. Jospin, S. Hassan, L.
Reve´ret, and F.Faure, “My Corporis Fabrica: A Unified
Ontological, Geometrical and Mechanical View of
Human Anatomy,” Proc. Second Workshop
3D Physiological Human (3DPH), 2009.
[13] S. Abiteboul, R. Hull, and V. Vianu, Foundations of
Databases. Addison-Wesley, 1995.
[14] M.Y. Vardi, “The Complexity of Relational Query
Languages,” Proc. 14th Ann. ACM Symp. Theory of
Computing (STOC), 1982.
[15] A. Cali, G. Gottlob, and T. Lukasiewicz, “Datalog+-
: A UnifiedApproach to Ontologies and Integrity
Constraints,” Proc. Int’l Conf. Database Theory (ICDT),
2009.
[16] R. Cattell, “Scalable Sql and Nosql Data Stores,”
SIGMOD Record,vol. 39, no. 4, pp. 12-27, 2010.
[17. ] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler,“Extracting Modules from Ontologies: A LogicBased Approach,” Proc. Third Int’l Workshop OWL
Experiences and Directions(OWLED), 2007
[18] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler, “Modular
Reuse of Ontologies: Theory and Practice,” J. Artificial
Intelligence Research, vol. 31, pp. 273-318, 2008.

Currently there are no Refbacks

Paper Title : Privacy Preserving Transitional Data Set Using Heuristic Approach
Authors : K.SANDHYA, K.SUMALATHA,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Assistant Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

In this paper, we propose a upper-bound privacy leakage constraint based approach to identify which intermediate datasets need to be encrypted and which do not, so that privacy preserving cost can be saved while the privacy requirements of data holders can still be satisfied. To identify and encrypt all functionally encrypt able data, sensitive data that can be encrypted without limiting the functionality of the application on the cloud. However, preserving the privacy of intermediate datasets becomes a challenging problem because adversaries may recover privacy-sensitive information by analyzing multiple intermediate datasets. Encrypting all datasets in cloud is widely adopted in existing approaches to address this challenge. But we argue that encrypting all intermediate datasets are neither efficient nor cost-effective because it is very time consuming and costly for data-intensive applications to encrypt/decrypt datasets frequently while performing any operation on them.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Data Storage Privacy, Encryption and Decryption, Privacy Preserving, Intermediate Dataset, Privacy Upper Bound, Economics of scale.

K.SANDHYA,K.SUMALATHA."Privacy Preserving Transitional Data Set Using Heuristic Approach". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.447-452, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I615.pdf,

[1] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R. Katz,
A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica,
and M.
Zaharia, “A View of Cloud Computing,” Comm. ACM,
vol. 53,no. 4, pp. 50-58, 2010.
[2] R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, and I.
Brandic, “Cloud Computing and Emerging It Platforms:
Vision, Hype, and Reality for Delivering Computing as
the Fifth Utility,” Future Generation Computer Systems,
vol. 25, no. 6, pp. 599-616, 2009.
[3] L. Wang, J. Zhan, W. Shi, and Y. Liang, “In Cloud,
Can Scientific Communities Benefit from the Economies
of Scale?,” IEEE Trans. Parallel and Distributed Systems,
vol. 23, no. 2, pp. 296-303, Feb.
2012.
[4] H. Takabi, J.B.D. Joshi, and G. Ahn, “Security and
Privacy Challenges in Cloud Computing Environments,”
IEEE Security
& Privacy, vol. 8, no. 6, pp. 24-31, Nov./Dec. 2010.
[5] D. Zissis and D. Lekkas, “Addressing Cloud
Computing Security Issues,” Future Generation
Computer Systems, vol. 28, no. 3, pp. 583-592, 2011.
[6] D. Yuan, Y. Yang, X. Liu, and J. Chen, “On-Demand
Minimum Cost Benchmarking for Intermediate Data Set
Storage in Scientific Cloud Workflow Systems,” J. Parallel
Distributed Computing, vol. 71, no. 2, pp. 316-332, 2011.
[7] S.Y. Ko, I. Hoque, B. Cho, and I. Gupta, “Making
Cloud Intermediate Data Fault-Tolerant,” Proc. First
ACM Symp. Cloud
Computing (SoCC ’10), pp. 181-192, 2010.
[8] H. Lin and W. Tzeng, “A Secure Erasure Code-Based
Cloud Storage System with Secure Data Forwarding,”
IEEE Trans.
Parallel and Distributed Systems, vol. 23, no. 6, pp. 995-
1003, June 2012.
[9] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “PrivacyPreserving Multi-Keyword Ranked Search over
Encrypted Cloud Data,” Proc.IEEE INFOCOM ’11, pp.
829-837, 2011.
[10] M. Li, S. Yu, N. Cao, and W. Lou, “Authorized
Private Keyword
Search over Encrypted Data in Cloud Computing,” Proc.
31st Int’l Conf. Distributed Computing Systems (ICDCS
’11), pp. 383-392, 2011.
[11] C. Gentry, “Fully Homomorphic Encryption Using
Ideal Lattices,”
Proc. 41st Ann. ACM Symp. Theory of Computing (STOC
’09), pp. 169-178, 2009.
[12] B.C.M. Fung, K. Wang, and P.S. Yu, “Anonymizing
Classification
Data for Privacy Preservation,” IEEE Trans. Knowledge
and Data Eng., vol. 19, no. 5, pp. 711-725, May 2007.
[13] B.C.M. Fung, K. Wang, R. Chen, and P.S. Yu,
“Privacy-Preserving Data Publishing: A Survey of Recent
Developments,” ACM Computing Survey, vol. 42, no. 4,
pp. 1-53, 2010.
[14] X. Zhang, C. Liu, J. Chen, and W. Dou, “An UpperBound Control Approach for Cost-Effective Privacy
Protection of Intermediate Data Set Storage in Cloud,”
Proc. Ninth IEEE Int’l Conf. Dependable,
Autonomic and Secure Computing (DASC ’11), pp. 518-
525, 2011.
[15] I. Roy, S.T.V. Setty, A. Kilzer, V. Shmatikov, and E.
Witchel, “Airavat: Security and Privacy for Mapreduce,”
Proc. Seventh USENIX Conf. Networked Systems Design
and Implementation (NSDI’10), p. 20, 2010.
[16] K.P.N. Puttaswamy, C. Kruegel, and B.Y. Zhao,
“Silverline:Toward Data Confidentiality in StorageIntensive Cloud Applications,” Proc. Second ACM Symp.
Cloud Computing (SoCC ’11), 2011.
[17] K. Zhang, X. Zhou, Y. Chen, X. Wang, and Y. Ruan,
“Sedic:Privacy-Aware Data Intensive Computing on
Hybrid Clouds,”
Proc. 18th ACM Conf. Computer and Comm. Security
(CCS ’11),pp. 515-526, 2011.
[18] V. Ciriani, S.D.C.D. Vimercati, S. Foresti, S. Jajodia, S.
Paraboschi, and P. Samarati, “Combining Fragmentation
and Encryption to Protect Privacy in Data Storage,” ACM
Trans. Information and
System Security, vol. 13, no. 3, pp. 1-33, 2010.
[19] S.B. Davidson, S. Khanna, T. Milo, D. Panigrahi, and
S. Roy, “Provenance Views for Module Privacy,” Proc.
30th ACM
SIGMOD-SIGACT-SIGART Symp. Principles of Database
Systems (PODS ’11), pp. 175-186, 2011.
[20] S.B. Davidson, S. Khanna, S. Roy, J. Stoyanovich, V.
Tannen, and Y. Chen, “On Provenance and Privacy,”
Proc. 14th Int’l Conf. Database Theory, pp. 3-10, 2011.
[21] S.B. Davidson, S. Khanna, V. Tannen, S. Roy, Y.
Chen, T. Milo, and J.Stoyanovich, “Enabling Privacy in
Provenance-Aware Workflow Systems,” Proc. Fifth
Biennial Conf. Innovative Data Systems Research (CIDR
’11), pp. 215-218, 2011.
[22] P. Samarati, “Protecting Respondents’ Identities in
Microdata Release,” IEEE Trans. Knowledge and Data
Eng., vol. 13, no. 6, pp. 1010-1027, Nov. 2001.
[23] A. Machanavajjhala, D. Kifer, J.ehrke, and M.
Venkitasubramaniam, “L-Diversity: Privacy Beyond KAnonymity,” ACM Trans. Knowledge Discovery from
Data, vol. 1, no. 1, article 3, 2007.
[24] G. Wang, Z. Zutao, D. Wenliang, and T. Zhouxuan,
“Inference Analysis in Privacy-Preserving Data RePublishing,” Proc. Eighth IEEE Int’l Conf. Data Mining
(ICDM ’08), pp. 1079-1084, 2008.
[25] W. Du, Z. Teng, and Z. Zhu, “Privacy-Maxent:
Integrating Background Knowledge in Privacy
Quantification,” Proc. ACM
SIGMOD Int’l Conf. Management of Data (SIGMOD ’08),
pp. 459-472, 2008.
[26] E.T. Jaynes, “Information Theory and Statistical
Mechanics,”Physical Rev., vol. 106, no. 4, pp. 620-630,
1957.
[27] Microsoft HealthVault,
http://www.microsoft.com/health/ww/
products/Pages/healthvault.aspx, July 2012.
[28] K.-K. Muniswamy-Reddy, P. Macko, and M. Seltzer,
“Provenance for the Cloud,” Proc. Eighth USENIX Conf.
File and Storage Technologies (FAST ’10), pp. 197-210,
2010.
[29] Amazon Web Services, “Aws Service Pricing
Overview,” http://aws.amazon.com/pricing/, July 2012.
[30] KVM, http://www.linux-kvm.org/page/Main_Page,
July 2012.
[31] OpenStack, http://openstack.org/, July 2012.
[32] Hadoop, http://hadoop.apache.org, June 2012.

Currently there are no Refbacks

Paper Title : Mobile Transmission Using Rigorous Data for Wireless Sensor Networks
Authors : K.MANIMALA, B.RANJITH,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
HOD-CSE, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

Wireless Sensor Networks (WSNs) are progressively more used in data-intensive applications such as micro-climate monitor, exactitude agriculture, and audio/video supervision. A key dispute faced by data-intensive WSNs is to convey all the data generated within an application's duration to the base station regardless of the fact that antenna nodes have restricted power supplies. We recommend using low-cost not reusable mobile transmissions to concentrate the energy expenditure of data-intensive WSNs. Our advance differs from preceding work in two main aspects. First, it does not require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor platforms. Second, we incorporate the energy exploitation due to both mobility and wireless transmissions into a holistic optimization framework. Our framework consists of three main algorithms. The first algorithm computes an optimal routing tree pretentious no nodes can move. The second algorithm improves the topology of the routing tree by tightfistedly adding new nodes exploiting mobility of the newly added nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology. This iterative algorithm converges on the optimal position for each node given the restriction that the routing tree topology does not change. We present professional distributed implementations for each algorithm that require only inadequate, confined to a small area bringing together. Because we do not automatically calculate an optimal topology, our ending routing tree is not automatically optimal. However, our simulation results show that our algorithms significantly surpass the best presented solutions.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Wireless sensor networks, energy optimization, mobile nodes, wireless steering

K.MANIMALA,B.RANJITH."Mobile Transmission Using Rigorous Data for Wireless Sensor Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.436-446, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I614.pdf,

[1] R. Szewczyk, A. Mainwaring, J. Polastre, J.
Anderson, and
D. Culler, “An analysis of a large scale habitat
monitoring application,” in SenSys, 2004.
[2] L. Luo, Q. Cao, C. Huang, T. F. Abdelzaher, J.
A. Stankovic, and M. Ward, “Enviromic: Towards
cooperative storage and retrieval in audio sensor
networks,” in ICDCS, 2007, p. 34.
[3] D. Ganesan, B. Greenstein, D. Perelyubskiy,
D. Estrin, and
J. Heidemann, “An evaluation of multi-resolution
storage for sensor networks,” in SenSys, 2003.
[4] S. R. Gandham, M. Dawande, R. Prakash, and S.
Venkatesan, “Energy efficient schemes for wireless
sensor networks with multiple mobile base
stations,” in Globecom, 2003.
[5] J. Luo and J.-P. Hubaux, “Joint mobility and
routing for life-time elongation in wireless sensor
networks,” in INFOCOM, 2005.
[6] Z. M. Wang, S. Basagni, E. Melachrinoudis, and
C. Petrioli, “Exploiting sink mobility for maximizing
sensor networks lifetime,” in HICSS, 2005.
[7] A. Kansal, D. D. Jea, D. Estrin, and M. B.
Srivastava, “Con-trollably mobile infrastructure for
low energy embedded net-works,” IEEE
Transactions on Mobile Computing, vol. 5, pp. 958–
973, 2006.
[8] G. Xing, T. Wang, W. Jia, and M. Li,
“Rendezvous design algorithms for wireless sensor
networks with a mobile base station,” in MobiHoc,
2008, pp. 231–240.
[9] D. Jea, A. A. Somasundara, and M. B.
Srivastava, “Multiple controlled mobile elements
(data mules) for data collection in sensor networks,”
in DCOSS, 2005.
[10] R. Shah, S. Roy, S. Jain, and W. Brunette, “Data
mules: Modeling a three-tier architecture for sparse
sensor networks,” in IEEE SNPA Workshop, 2003.
[11] S. Jain, R. Shah, W. Brunette, G. Borriello, and S.
Roy, “Exploiting mobility for energy efficient data
collection in wireless sensor networks,” MONET,
vol. 11, pp. 327–339, 2006.
[12] W. Wang, V. Srinivasan, and K.-C. Chua,
“Using mobile re-lays to prolong the lifetime of
wireless sensor networks,” in MobiCom, 2005.
[13] D. K. Goldenberg, J. Lin, and A. S. Morse,
“Towards mobility as a network control primitive,”
in MobiHoc, 2004, pp. 163–174.
[14] A. A. Somasundara, A. Ramamoorthy, and M.
B. Srivastava, “Mobile element scheduling with
dynamic deadlines,” IEEE Transactions on Mobile
Computing, vol. 6, pp. 395–410, 2007.
[15] Y. Gu, D. Bozdag, and E. Ekici, “Mobile element
based differentiated message delivery in wireless
sensor networks,” in
[16] K. Dantu, M. Rahimi, H. Shah, S. Babel, A.
Dhariwal, and G. S. Sukhatme, “Robomote:
enabling mobility in sensor networks,” in IPSN,
2005.
[17] http://www.kteam.com/robots/khepera/index.html.
[18] J.-H. Kim, D.-H. Kim, Y.-J. Kim and K.-T. Seow,
Soccer Robotics. Springer, 2004.
[19] G. Xing, T. Wang, Z. Xie, and W. Jia,
“Rendezvous planning in wireless sensor networks
with mobile elements,” IEEE Transactions on
Mobile Computing, vol. 7, pp. 1430–1443, 2008.
[20] “Rendezvous planning in mobility-assisted
wireless sensor networks,” in RTSS ’07: Proceedings
of the 28th IEEE Inter-national Real-Time Systems
Symposium, 2007, pp. 311–320. 

Currently there are no Refbacks

Paper Title : Secure Data Sharing for Dynamic Groups in the Public Cloud
Authors : S.L.SOWJANYA, D.RAVIKIRAN,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

-Cloud computing is an emerging computing paradigm in which resources of the computing infrastructure are provided as services over the Internet. Sharing group resource among cloud users is a major problem, so cloud computing provides an economical and efficient solution. Mona, secure data sharing in a multi-owner manner for dynamic groups preserves data, identity privacy from an unfrosted cloud and allows frequent change of the membership. In this project, we propose a secure multi owner data sharing scheme, for dynamic groups in the cloud. By leveraging group signature and dynamic broadcast encryption techniques, any cloud user can anonymously share data with others. Proposing a new model for Sharing Secure Data in the Cloud for the Dynamic Group.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud computing, data sharing, privacy-preserving, access control, dynamic groups.

S.L.SOWJANYA,D.RAVIKIRAN."Secure Data Sharing for Dynamic Groups in the Public Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.428-435, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/c,

[1] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H.
Katz, A.Konwinski, G. Lee, D.A. Patterson, A. Rabkin, I.
Stoica, and M.Zaharia, “A View of Cloud Computing,”
Comm. ACM, vol. 53,no. 4, pp. 50-58, Apr. 2010.
[2] S. Kamara and K. Lauter, “Cryptographic Cloud
Storage,” Proc.Int’l Conf. Financial Cryptography and
Data Security (FC), pp. 136-149, Jan. 2010.
[3] S. Yu, C. Wang, K. Ren, and W. Lou,Achieving
Secure, Scalable, and Fine-Grained Data Access Control
in Cloud Computing,”Proc. IEEE INFOCOM, pp. 534-
542, 2010.
[4] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang,
and K. Fu,“Plutus: Scalable Secure File Sharing on
Untrusted Storage,” Proc.
USENIX Conf. File and Storage Technologies, pp. 29-42,
2003.
[5] E. Goh, H. Shacham, N. Modadugu, and D. Boneh,
“Sirius:Securing Remote Untrusted Storage,” Proc.
Network and Distributed
Systems Security Symp. (NDSS), pp. 131-145, 2003.
[6] G. Ateniese, K. Fu, M. Green, and S. Hohenberger,
“Improved Proxy Re-Encryption Schemes with
Applications to Secure Distributed Storage,” Proc.
Network and Distributed Systems Security Symp.
(NDSS), pp. 29-43, 2005.
[7] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure
Provenance: The Essential of Bread and Butter of Data
Forensics in Cloud Computing,” Proc. ACM Symp.
Information, Computer and Comm. Security, pp. 282-
292, 2010.
[8] B. Waters, “Ciphertext-Policy Attribute-Based
Encryption: An Expressive, Efficient, and Provably
Secure Realization,” Proc. Int’l Conf. Practice and
Theory in Public Key Cryptography Conf. Public Key
Cryptography, http://eprint.iacr.org/2008/290.pdf, 2008.
[9] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
“Attribute-Based Encryption for Fine-Grained Access
Control of Encrypted Data,” Proc. ACM Conf.
Computer and Comm. Security (CCS),pp. 89-98, 2006.
[10] D. Naor, M. Naor, and J.B. Lotspiech, “Revocation
and Tracing Schemes for Stateless Receivers,” Proc.
Ann. Int’l Cryptology Conf.Advances in Cryptology
(CRYPTO), pp. 41-62, 2001.
[11] D. Boneh and M. Franklin, “Identity-Based
Encryption from the Weil Pairing,” Proc. Int’l
Cryptology Conf. Advances in Cryptology
(CRYPTO), pp. 213-229, 2001.
[12] D. Boneh, X. Boyen, and H. Shacham, “Short Group
Signature,” Proc. Int’l Cryptology Conf. Advances in
Cryptology (CRYPTO), pp. 41-55, 2004.
[13+] D. Boneh, X. Boyen, and E. Goh, “Hierarchical
Identity Based Encryption with Constant Size
Ciphertext,” Proc. Ann. Int’l Conf.Theory and
Applications of Cryptographic Techniques
(EUROCRYPT), pp. 440-456, 2005.
[14] C. Delerablee, P. Paillier, and D. Pointcheval, “Fully
Collusion Secure Dynamic Broadcast Encryption with
Constant-Size Ciphertexts or Decryption Keys,” Proc.
First Int’l Conf. Pairing-Based Cryptography, pp. 39-59,
2007.
[15] D. Chaum and E. van Heyst, “Group Signatures,”
Proc. Int’l Conf.Theory and Applications of Cryptographic Techniques (EUROCRYPT),pp. 257-265,
1991.
[16] A. Fiat and M. Naor, “Broadcast Encryption,” Proc.
Int’l Cryptology Conf. Advances in Cryptology
(CRYPTO), pp. 480-491, 1993.
[17] B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large
Groups in the Cloud,” Proc. 10th Int’l Conf. Applied
Cryptography and Network Security, pp. 507-525, 2012.

Currently there are no Refbacks

Paper Title : Entrustment of Access Control in Public Clouds
Authors : A.NAGA BALA, D.RAVIKIRAN,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

Cloud computing, as an emerging computing standard. Cloud computing enables users to remotely store their data in a cloud and also benefit from services on-demand. With rapid development of cloud computing, more enterprises will outsource their sensitive data for sharing in a cloud. Delegation is a process of sharing access rights by users of an access control model. It facilitates the distribution of authorities in the model. It is also useful in collaborative environments. Delegation may also result in privacy violations if it allows accessing data without the data provider’s consent. Even Though the consent is taken, the privacy can still be violated if the data is used differently than the data provider agreed. Our work investigates data privacy in delegation. Based on this setting, a delegation model is designed to consider the privacy policies in taking delegation decisions and also, to set the data usage criteria for the access right receivers
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Delegation, privacy, access control, security, policy.

A.NAGA BALA,D.RAVIKIRAN."Entrustment of Access Control in Public Clouds". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.421-427, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I612.pdf,

[1]M. Nabeel and E. Bertino, ‚Privacy preserving
delegated access control in the storage as a service
model,‛ in EEE International Conference on
Information Reuse and Integration (IRI), 2012.
[2] E. Bertino and E. Ferrari, ‚Secure and selective
dissemination of XML documents,‛ ACM Trans.
Inf. Syst. Secur., vol. 5, no. 3, pp. 290–331, 2002.
[3] G. Miklau and D. Suciu, ‚Controlling access to
published data using cryptography,‛ in VLDB
’2003: Proceedings of the 29th international
conference on Very large data bases. VLDB
Endowment, 2003, pp. 898–909.
[4]N. Shang, M. Nabeel, F. Paci, and E. Bertino, ‚A
privacy- preserving approach to policy-based
content dissemination,‛ in ICDE ’10: Proceedings
of the 2010 IEEE 26th International Conference on
Data Engineering, 2010.
[5] M. Nabeel, E. Bertino, M. Kantarcioglu, and B.
M. Thurais­ ingham, ‚Towards privacy preserving
access control in the cloud,‛ in Proceedings of the
7th International Conference on Col- laborative
Computing: Networking, Applications and Worksharing, ser. CollaborateCom ’11, 2011, pp.
172–180.
[6] M. Nabeel, N. Shang, and E. Bertino, ‚Privacy
preserving pol- icy based content sharing in public
clouds,‛ IEEE Transactions on Knowledge and
Data Engineering, 2012.
[7] S. D. C. di Vimercati, S. Foresti, S. Jajodia, S.
Paraboschi, and P. Samarati, ‚Over-encryption:
Management of access control evolution on
outsourced data,‛ in Proceedings of the 33rd
International Conference on Very Large Data
Bases, ser. VLDB ’07. VLDB Endowment, 2007, pp.
123–134.
[8] M. Nabeel and E. Bertino, ‚Towards attribute
based group key management,‛ in Proceedings of
the 18th ACM conference on Computer and
communications security, Chicago, Illinois, USA,
2011.
[9]A. Fiat and M. Naor, ‚Broadcast encryption,‛ in
Proceedings of the 13th Annual International
Cryptology Conference on Advances in
Cryptology, ser. CRYPTO ’93. London, UK:
Springer-Verlag, 1994, pp. 480–491.
[10] D. Naor, M. Naor, and J. B. Lotspiech,
‚Revocation and tracing schemes for stateless
receivers,‛ in Proceedings of the 21st Annual
International Cryptology Conference on Advances
in Cryptology, ser. CRYPTO ’01. London, UK:
Springer-Verlag, 2001, pp. 41–62.
[11] J. Li and N. Li, ‚OACerts: Oblivious attribute
certificates,‛ IEEE Transactions on Dependable and
Secure Computing, vol. 3, no. 4, pp. 340–352, 2006.
[12]T. Pedersen, ‚Non-interactive and informationtheoretic secure verifiable secret sharing,‛ in
CRYPTO ’91: Proceedings of the 11th Annual
International Cryptology Conference on Advances
in Cryptology. London, UK: Springer-Verlag, 1992,
pp. 129–140.
[13] M. Nabeel and E. Bertino, ‚Attribute based
group key manage­ ment,‛ IEEE Transactions on
Dependable and Secure Computing, 2012.
[14] A. Shamir, ‚How to share a secret,‛ The
Communication of ACM, vol. 22, pp. 612–613,
November 1979.
[15] V. Shoup, ‚NTL library for doing number
theory,‛ http://www.shoup.net/ntl/.
[16] ‚OpenSSL the open source toolkit for
SSL/TLS,‛ http://www.openssl.org/.
*17+ ‚boolstuff a boolean expression tree toolkit,‛
http://sarrazip.com/dev/boolstuff.html.
[18] A. Schaad, J. Moffett, and J. Jacob, ‚The rolebased access con- trol system of a european bank: a
case study and discussion,‛ in Proceedings of the
sixth ACM symposium on Access control models
and technologies, ser. SACMAT ’01. New York,
NY, USA: ACM, 2001, pp. 3–9.
[19] K. Fisler, S. Krishnamurthi, L. A. Meyerovich,
and M. C. Tschantz, ‚Verification and changeimpact analysis of access- control policies,‛ in
Proceedings of the 27th international confer- ence
on Software engineering, ser. ICSE ’05. New York,
NY, USA: ACM, 2005, pp. 196–205.
[20] S. Coull, M. Green, and S. Hohenberger,
‚Controlling access to an oblivious database using
stateful anonymous credentials,‛ in Irvine:
Proceedings of the 12th International Conference
on Prac- tice and Theory in Public Key
Cryptography. Berlin, Heidelberg: SpringerVerlag, 2009, pp. 501–520.
[21] J. Camenisch, M. Dubovitskaya, and G.
Neven, ‚Oblivious transfer with access control,‛ in
CCS ’09: Proceedings of the 16th ACM conference
on Computer and communications security. New
York, NY, USA: ACM, 2009, pp. 131–140.
[22] K. P. N. Puttaswamy, C. Kruegel, and B. Y.
Zhao, ‚Silverline: toward data confidentiality in
storage-intensive cloud appli­ cations,‛ in
Proceedings of the 2nd ACM Symposium on
Cloud Computing, ser. SOCC ’11. New York, NY,
USA: ACM, 2011, pp. 10:1–10:13.
[23] A. Sahai and B. Waters, ‚Fuzzy identity-based
encryption,‛ in Eurocrypt 2005, LNCS 3494.
Springer-Verlag, 2005, pp. 457– 473.
[24] M. Pirretti, P. Traynor, P. McDaniel, and B.
Waters, ‚Secure attribute-based systems,‛ in CCS
’06: Proceedings of the 13th ACM conference on
Computer and communications security. New
York, NY, USA: ACM, 2006, pp. 99–112.
[25] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
‚Attribute-based encryption for fine-grained access
control of encrypted data,‛ in CCS ’06: Proceedings
of the 13th ACM conference on Computer and communications security. New York, NY, USA:
ACM, 2006, pp. 89–98.
[26] J. Bethencourt, A. Sahai, and B. Waters,
‚Ciphertext-policy attribute-based encryption,‛ in
SP ’07: Proceedings of the 2007 IEEE Symposium
on Security and Privacy. Washington, DC, USA:
IEEE Computer Society, 2007, pp. 321–334. 

Currently there are no Refbacks

Paper Title : New Design and achievement of IPTV Service Delivery through Virtualizationv
Authors : RATNAKUMARI M, D.RAVIKIRAN,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

Usage of IPTV Service conveyance through Virtualization is of pragmatic enthusiasm toward numerous applications, for example, locating an IPTV Service conveyance disappointment. The interruption location is characterized as an instrument for an IPTV Service conveyance through virtualization to discover the presence of immoral, mistaken, or atypical moving assailant (intruder)s. In this examination IPTV conveys the television content over a web Convention foundation. Virtualized cloud-based Services will advantage of statically multiplexing crosswise over applications to yield paramount expense reserve funds to the administrator the cloud based IPTV give bring down a supplier's expenses of constant IPTV benefits through a virtualized IPTV structural planning and through sagacious time moving of Service conveyance. It exploits the distinctions in the due dates connected with Live television versus Video-on-Demand (VoD) to successfully multiplex these Services.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Orchestrator, Set Top Box, Video on Demand, Interactive TV, Live TV, D-Server

RATNAKUMARI M,D.RAVIKIRAN."New Design and achievement of IPTV Service Delivery through Virtualizationv". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.414-420, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I611.pdf,

*1+ “Optimizing Cloud Resources for Delivering IPTV
Services through Virtualization”,Vaneet Aggarwal,
Vijay Gopalakrishnan, Rittwik Jana, K. K.
Ramakrishnan, Vinay A. Vaishampayan AT&T Labs –
Research, 180 Park Ave, Florham Park, NJ, 07932
[2] D.Banodkar, K..K. Ramakrishnan, S.
Kalyanaraman, A. Gerber, and O. Spatscheck,
“Multicast instant channel change in IPTV system,” in
Proceedings of IEEE COMSWARE, January 2008.
*3+ “Microsoft tv: Iptv edition,” http:// www.
microsoft. com/tv/IPTVEdition .mspx.
[4] H. A. Lagar-Cavilla, J. A. Whitney, A. Scannell, R.
B. P. Patchin, S.M.Rumble, E. de Lara, M. Brudno, and
M. Satyanarayanan, “SnowFlock:Virtual Machine
Cloning as a First Class Cloud Primitive,” ACM
Transactions on Computer Systems (TOCS), 2011.
[5] V. Aggarwal, V. Gopalakrishnan, R. Jana, K. K.
Ramakrishnan, and V. Vaishampayan, “Exploiting
Virtualization for Delivering Cloud-based IPTV
Services,” in Proc. of IEEE INFOCOM (miniconference), Shanghai, April 2011.
[6] R. Urgaonkar, U. Kozat, K. Igarashi, and M. J.
Neely, “Dynamic resource allocation and power
management in virtualized data centers,”in
Proceedings of IEEE IFIP NOMS, March 2010.
[7] P. Ning, S. D. C. di Vimercati, and P. F. Syverson
(2007), Eds. ACM,pp. 598–609.
[8] A. Juels and B. S. K. Jr. (2007), Pors: proofs of
retrievability for large files, in ACMConference on
Computer and Communications Security
[9] G. Ateniese, R. D. Pietro, L. V. Mancini, and G.
Tsudik (2008), Scalable and efficient provable data
possession, in Proceedings of the 4th international
conference on Security and privacy in communication
netowrks, SecureComm, pp. 1–10.
[10] C. C. Erway, A. K¨upc¸ ¨u, C. Papamanthou, and
R. Tamassia (2009), Dynamic provable data
possession, in ACM Conference on Computer and
Communications Security, pp. 213–222.
[11] H. Shacham and B. Waters (2008), Compact
proofs of retrievability, in ASIACRYPT, ser. Lecture
Notes in Computer Science, J. Pieprzyk, Ed., vol. 5350.
Springer, pp. 90–107.
[12] Q. Wang, C.Wang, J. Li, K. Ren, and W. Lou
(2009), Enabling public verifiability and data
dynamics for storage security in cloud computing, in
ESORICS, ser. Lecture Notes in Computer Science,
vol. 5789. Springer, pp. 355–370.
[13] Y. Zhu, H. Wang, Z. Hu, G.-J. Ahn, H. Hu, and S.
S. Yau (2011), Dynamic audit services for integrity
verification of outsourced storages in clouds, in SAC,
pp. 1550–1557.
[14] K. D. Bowers, A. Juels, and A. Oprea (2009), Hail:
a high-availability and integrity layer for cloud storage, in ACM Conference on Computer and
Communications Security, pp. 187–198.
[15] Y. Dodis, S. P. Vadhan, and D. Wichs (2009),
Proofs of retrievability via hardness amplification, in
TCC, ser. Lecture Notes in Computer Science, vol.
5444. Springer, pp. 109–127.
[16] L. Fortnow, J. Rompel, and M. Sipser (1988), On
the power of multiprover interactive protocols, in
Theoretical Computer Science, pp. 156–161.
[17] Y. Zhu, H. Hu, G.-J. Ahn, Y. Han, and S. Chen
(Oct 2011), Collaborative integrity verification in
hybrid clouds, in IEEE Conference on the 7th
International Conference on Collaborative
Computing: Networking, Applications and
Worksharing, CollaborateCom, Orlando, Florida,
USA, 15-18, pp. 197–206.
[18] D. Boneh and M. Franklin (2001), Identity-based
encryption from the weil pairing, in Advances in
Cryptology (CRYPTO’2001), vol. 2139 of LNCS, , pp.
213–229..
[19]O. Goldreich (2001), Foundations of
Cryptography: Basic Tools. Cambridge University
Press.

Currently there are no Refbacks

Paper Title : SOT Model towards Peer to Peer System
Authors : S JOHN BEE, B.RANJITH,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
HOD-CSE, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

In a peer-to-peer (P2P) network, each device assumes the part of Client and server in the meantime. In P2p framework, a standout amongst the most essential issues is trust administration. P2P frameworks depend on different companions to finish the undertakings. Companions need to trust one another for fruitful operation of the framework. While imparting in the middle of companions trust development is paramount to take administration from the obscure asset. In this paper we think over for four trust models focused around different methodologies, for example, by approaches, by notoriety and so forth. Presently a large portion of models for trust administration are focused around notoriety. There are numerous models which meets expectations under aforementioned methodologies out of these we have examined Eigen trust, SORT, Worldwide Trust model and NICE. We have likewise analyzed four trust models in P2P frameworks. The examination is focused around the profits and their properties.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Peer-to-peer systems, trust management, reputation, and security

S JOHN BEE,B.RANJITH."SOT Model towards Peer to Peer System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.409-413, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I610.pdf,

[1]Ahmet Burak Can, and Bharat Bhargava, (2013)
SORT: A SelfORganizing Trust Model for Peer-to-Peer
Systems,IEEE Transactions On Dependable And Secure
Computing, Vol. 10, No. 1.
[2]Chen Ding, Chen Yueguo, Cheng Weiwei(2012), EBook Of Trust Management in P2P Systems.Jussi
Kangasharju(2011), E-Book OfIntroduction Peer-toPeer
Networks.
[3] Gupta(2011). Peer-To-Peer Networks And
Computation:Current Trends And Future
Perspectives,Computing And Informatics, Vol. 30, 559–
594
[4]Stefan Saroiu, P. Krishna Gummadi, Steven
D.Gribble(2013) A Measurement Study of Peer-to-Peer
File Sharing Systems Dept. of Computer Science and
Engineering, Univ. of Washington, Seattle, WA, 98195-
2350
[5]Loubna Mekouar(2005) Reputation-based Trust
Management in Peer-to-Peer File Sharing
Systems,University of Waterlo IEEE Consumer
Communications and Networking Conference (CCNC)
[6].Hai Ren(2006), Comparison of Trust Model in Peer
to Peer System, Helsinki University of Technology,
TKK T-110.5290 Seminar on Network Security.
[7] F. Cornelli, E. Damiani, S.D.C. di Vimercati, S.
Paraboschi,and P. Samarati, “Choosing Reputable
Servents in a P2P Network,” Proc. 11th World Wide
Web Conf. (WWW), 2002.
[8] K. Aberer and Z. Despotovic, “Managing Trust in a
Peer-2-Peer Information System,” Proc. 10th Int‟ l Conf.
Information and Knowledge Management (CIKM),
2001.
[9] S. Marsh, Formalising Trust as a Computational
Concept.PhD thesis, Department of Mathematics and
Computer Science,University of Stirling, 1994.
[10] B. Ooi, C. Liau, and K. Tan, “Managing trust in
peer-topeer systems using reputation-based
techniques,” in Proceedings of the 4th International
Conference on Web Age Information Management,
2003.
[11] E. Terzi, Y. Zhong, B. Bhargava, Pankaj, and S.
Madria,“An Algorithm for Building User-Role Profiles
in a Trust Environment,” Proc. Fourth Int‟ l Conf. Data
Warehousing and Knowledge Discovery (DaWaK), vol.
2454, 2002.
[12] A. Jøsang, R. Ismail, and C. Boyd, “A Survey of
Trust and Reputation Systems for Online Service
Provision,” Decision Support Systems, vol. 43, no. 2,
pp. 618-644, 2007.
[13] P. Victor, C. Cornelis, M. De Cock, and P. Pinheiro
da Silva, “Gradual Trust and Distrust in Recommender
Systems,” Fuzzy Sets Systems, vol. 160, no. 10, pp.
1367-1382, 2009.
[14] M. Gupta, P. Judge, and M. Ammar, “A Reputation
System for Peer-to-Peer Networks,” Proc. 13th Int‟ l
Workshop Network and Operating Systems Support
for Digital Audio and Video (NOSSDAV), 2003.
[15] B. Yu, M.P. Singh, and K. Sycara, “Developing
Trust in Large- Scale Peer-to-Peer Systems,” Proc. IEEE
First Symp.Multi-Agent Security and Survivability,
2004.

Currently there are no Refbacks

Paper Title : Extracting Spread-Spectrum Hidden Data from Picture Representation
Authors : R NEELIMA DEVI, B.RANJITH,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
HOD-CSE, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

In this paper, we introduce a novel high bit rate LSB Picture information concealing system. The fundamental thought of the proposed LSB computation is information installing that causes negligible implanting contortion of the host picture. Utilizing the proposed two-stage result, information concealing bits are inserted into higher LSB layers, resulting in expanded vigor against clamor expansion or picture layering. Listening tests demonstrated that the perceptual nature of information hided picture is higher on account of the proposed technique than in the standard LSB strategy.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Higher LSB, Guard Pixels, Stegnography,Multi- carrier, Information hiding, Data Encryption.

R NEELIMA DEVI,B.RANJITH."Extracting Spread-Spectrum Hidden Data from Picture Representation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.405-408, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I69.pdf,

[1] F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn,
“Information hiding: A survey,” Proc. IEEE (SpecialIssue on Identification and Protection of Multimedia
Information), vol. 87, pp. 1062-1078, July 1999.
[2] I. J. Cox, M. L. Miller, and J. A. Bloom, Digital
Watermarking. San Francisco, CA: Morgan-Kaufmann,
2002.
[3] F. Hartung and M. Kutter, “Multimedia
watermarking techniques,” Proc. IEEE (Special Issue on
Identification and Protection of Multimedia
Information), vol. 87, pp. 1079-1107, July 1999.
[4] G. C. Langelaar, I. Setyawan, and R. L. Lagendijk,
“Watermarking digital image and video data: A stateof-the-art overview,” IEEE Signal Processing Magazine,
vol. 17, pp. 20-46, Sept. 2000.
[5] N. F. Johnson and S. Katzenbeisser, “A survey of
steganographic techniques,” in Information Hiding, S.
Katzenbeisser and F. Petitcolas Eds. Norwood, MA:
Artech House, 2000, pp. 43-78.
[6] S. Wang and H. Wang, “Cyber warfare:
Steganography vs. steganalysis,” Communications of
the ACM, vol. 47, pp. 76-82, Oct. 2004.
[7] C. Cachin, “An information-theoretic model for
steganography,” in Proc. 2nd Intern. Workshop on
Information Hiding, Portland, OR, Apr. 1998, pp. 306-
318.
[8] G. J. Simmons, “The prisoner’s problem and the
subliminal channel,” in Advances in Cryptology: Proc.
CRYPTO’83. New York, NY: Plenum, 1984, pp. 51-67.
[9] J. Fridrich, Steganography in Digital Media,
Principles, Algorithms, and Applications. Combridge,
UK: Combridge Univeristy Press, 2010.
[10] Y. Wang and P. Moulin, “Perfectly secure
steganography: Capacity, error exponents, and code
constructions,” IEEE Trans. Inform. Theory, vol. 54, pp.
2706-2722, June 2008.
[11] Federal plan for cyber security and information
assurance research and development, Interagency
Working Group on Cyber Security and Information
Assurance, Apr. 2006.
[12] R. Chandramouli, “A mathematical framework for
active steganalysis,” ACM Multimedia Systems Special
Issue on Multimedia Watermarking, vol. 9, pp. 303-311,
Sept. 2003.
[13] H. S. Malvar and D. A. Florencio, “Improved
spread spectrum: A new modulation technique for
robust watermarking,” IEEE Trans. Signal Proc., vol.
51, pp. 898-905, Apr. 2003.
[14] I. J. Cox, J. Kilian, F. T. Leighton, and T. Shannon,
“Secure spread spectrum watermarking for
multimedia,” IEEE Trans. Image Proc., vol. 6, pp. 1673-
1687, Dec. 1997.
[15] J. Hernandez, M. Amado, and F. Perez-Gonzalez,
“DCT-domain water- marking techniques for still
images: Detector performance analysis and a new
structure,” IEEE Trans. Image Proc., vol. 9, pp. 55-68,
Jan. 2000.
[16] C. Qiang and T. S. Huang, “An additive approach
to transform-domain information hiding and optimum
detection structure,” IEEE Trans. Multimedia, vol. 3,
pp. 273-284, Sept. 2001.
[17] C. Fei, D. Kundur, and R. H. Kwong, “Analysis
and design of wa- termarking algorithms for improved
resistance to compression,” IEEE Trans. Image Proc.,
vol. 13, pp. 126-144, Feb. 2004.
[18] M. Gkizeli, D. A. Pados, and M. J. Medley, “SINR,
bit error rate, and Shannon capacity optimized spreadspectrum steganography,” in Proc. IEEE Intern. Conf.
Image Proce. (ICIP), Singapore, Oct. 2004, pp. 1561-
1564.
[19] M. Gkizeli, D. A. Pados, S. N. Batalama, and M. J.
Medley, “Blind iterative recovery of spread-spectrum
steganographic messages,” in Proc. IEEE Intern. Conf.
Image Proc. (ICIP), Genova, Italy, Sept. 2005, vol. 2, pp.
11-14.
[20] M. Gkizeli, D. A. Pados, and M. J. Medley,
“Optimal signature design for spread-spectrum
steganography,” IEEE Trans. Image Proc., vol. 16, pp.
391-405, Feb. 2007.

Currently there are no Refbacks

Paper Title : Exigent Life from Wireless ad-hoc Signal Networks
Authors : J.JAYASANTHI, K.SUMALATHA,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Assistant Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

An ad hoc sensor wireless network has been drawing interest among the researches in the direction sensing and pervasive computing. The security work in this area is priority and primarily focusing on denial of communication at the routing or medium access control levels. In this paper the attacks which are mainly focusing on routing protocol layer that kind of attacker is known as resource depletion attacks. These “Vampire” attacks are not impacting any specific kind of protocols. Finding of vampire attacks in the network is not a easy one. It’s very difficult to detect, devastating .A simple vampire presenting in the network can increasing network wide energy usage. We discuss some methods and alternative routing protocols solution will be avoiding some sort of problems which causing by vampire attacks.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Sensor Networks; Wireless Networks; Ad hoc Networks; Routing Protocols.

J.JAYASANTHI,K.SUMALATHA."Exigent Life from Wireless ad-hoc Signal Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.397-404, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I68.pdf,

[1] The network simulator — ns-2.
http://www.isi.edu/nsnam/ns/.
[2] Imad Aad, Jean-Pierre Hubaux, and Edward W.
Knightly, Denial of service resilience in ad hoc networks, MobiCom, 2004.
[3] Gergely Acs, Levente Buttyan, and Istvan Vajda,
Provably secure on-demand source routing in mobile ad hoc networks, IEEE Transactions on Mobile
Computing 05 (2006), no. 11.
[4] Tuomas Aura, Dos-resistant authentication with
client puzzles, International workshop on security
protocols, 2001.
[5] John Bellardo and Stefan Savage, 802.11 denial-ofservice attacks: real vulnerabilities and practical solutions, USENIX security, 2003.
[6] Daniel Bernstein and Peter Schwabe, New AES
software speed records, INDOCRYPT, 2008.
[7] Daniel J. Bernstein, Syn cookies, 1996.
http://cr.yp.to/syncookies.html.
[8] I.F. Blake, G. Seroussi, and N.P. Smart, Elliptic
curves in cryptography, Vol. 265, Cambridge University Press, 1999.
[9] Joppe W. Bos, Dag Arne Osvik, and Deian Stefan,
Fast implementations of AES on various platforms,
2009.
[10]Haowen Chan and Adrian Perrig, Security and privacy in sensor net-works, Computer 36 (2003), no.
10.
[11]Jae-Hwan Chang and Leandros Tassiulas, Maximum lifetime routing in wireless sensor networks,
IEEE/ACM Transactions on Networking 12 (2004),
no. 4.
[12]Thomas H. Clausen and Philippe Jacquet, Optimized link state routing protocol (OLSR), 2003.
[13]Jing Deng, Richard Han, and Shivakant Mishra, Defending against path-based DoS attacks in wireless
sensor networks, ACM workshop on security of ad
hoc and sensor networks, 2005.
[14] , INSENS: Intrusion-tolerant routing for wireless sensor net-works, Computer Communications
29 (2006), no. 2.
[15]Sheetalkumar Doshi, Shweta Bhandare, and Timothy X. Brown, An on-demand minimum energy
routing protocol for a wireless ad hoc network,
ACM SIGMOBILE Mobile Computing and Communications Review 6 (2002), no. 3.
[16]John R. Douceur, The Sybil attack, International
workshop on peer-to-peer systems, 2002.
[17]Hans Eberle, Arvinderpal Wander, Nils Gura,
Sheueling Chang-Shantz, and Vipul Gupta, Architectural extensions for elliptic curve cryptography
over GF(2m) on 8-bit microprocessors, ASAP, 2005.
[18]T. English, M. Keller, Ka Lok Man, E. Popovici, M.
Schellekens, and W. Marnane, A low-power pairingbased cryptographic accelerator for embedded security applications, SOCC, 2009.
[19]Laura M. Feeney, An energy consumption model for
performance anal-ysis of routing protocols for mobile ad hoc networks, Mobile Networks and Applications 6 (2001), no. 3.
[20]Martin Feldhofer, Sandra Dominikus, and Johannes Wolkerstorfer,
Strong authentication for RFID systems using the
AES algorithm, CHES, 2004.
[21]Rodrigo Fonseca, Sylvia Ratnasamy, Jerry Zhao,
Cheng T. Ee, David Culler, Scott Shenker, and Ion Stoica, Beacon vector routing: Scalable point-to-point
routing in wireless sensornets, NSDI, 2005.
[22]Steven Galbraith, Keith Harrison, and David Soldera, Implementing the tate pairing, Algorithmic
number theory, 2002.
[23]Sharon Goldberg, David Xiao, Eran Tromer, Boaz
Barak, and Jennifer Rexford, Path-quality monitoring in the presence of adversaries, SIG-METRICS,
2008.
[24]Andrea J. Goldsmith and Stephen B. Wicker, Design
challenges for energy-constrained ad hoc wireless
networks, IEEE Wireless Communications 9 (2002),
no. 4.
[25]R. Govindan and A. Reddy, An analysis of internet
inter-domain topology and route stability, INFOCOM, 1997.
[26]Mina Guirguis, Azer Bestavros, Ibrahim Matta, and
Yuting Zhang,
Reduction of quality (RoQ) attacks on Internet endsystems, INFOCOM, 2005. 
[27]J.L. Hill and D.E. Culler, Mica: a wireless platform
for deeply embedded networks, IEEE Micro 22
(2002), no. 6.
[28]Yih-Chun Hu, David B. Johnson, and Adrian Perrig,
SEAD: secure efficient distance vector routing for
mobile wireless ad hoc networks, IEEE workshop on
mobile computing systems and applications, 2002.
[29]Yih-Chun Hu, Adrian Perrig, and David B. Johnson,
Ariadne: A secure on-demand routing protocol for
ad hoc networks, MobiCom, 2002.

Currently there are no Refbacks

Paper Title : Revolution of Storms from Vendor lock-in to the Data storage
Authors : Y.ANITHA, D.RAVIKIRAN,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

The open stack-based private cloud can help mitigate vendor lock-in and promises transparent use of cloud computing services. Most of the basic technologies necessary to realize the open stack-based private cloud already exist, yet lack integration. Thus, integrating these state-of-the-art tools promises a huge leap toward the open stackbased private cloud. To avoid vendor lock-in, the community must drive the ideas and create a truly open stack-based private cloud with added value for all customers and broad support for different providers and implementation technologies.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Open stack-based private cloud, privacy preserving, Integrity, Cloud Storage

Y.ANITHA,D.RAVIKIRAN."Revolution of Storms from Vendor lock-in to the Data storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.391-396, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I67.pdf,

[1] A. Lenk, M. Klems, J. Nimis, S. Tai, and T.
Sandholm, “What’s inside the Cloud? An architectural map of the Cloud landscape,” in
Software Engineering Challenges of Cloud
Computing, 2009. CLOUD’09. ICSE Workshop on.
IEEE, 2009, pp. 23–31.
[2] C. Baun, M. Kunze, J. Nimis, and S. Tai,Cloud
Computing: Web-basierte dynamische IT-Services,
ser. Informatik im Fokus. Berlin:Springer, 2010.
[3] G. DeCandia, D. Hastorun, M. Jampani, G.
Kakulapati, A. Lakshman,A. Pilchin, S.
Sivasubramanian, P. Vosshall, and W. Vogels,
“Dynamo:amazon’s highly available key value
store,” inProc. SOSP, 2007
[4] M. Welsh, D. Culler, and E. Brewer, “SEDA:
architecture forwell-conditioned, scalable Internet
services,”ACM SIGOPS OperatingSystems Review,
vol. 35, no. 5, pp. 230–243, 2001.
[5] S. Garfinkel, “An Evaluation of Amazon’s Grid
Computing Services:EC2, S3, and SQS,” inCenter for.
Citeseer, 2007
[6] A. T. Velte, T. J. Velte, and R. Elsenpeter,Cloud
Computing: A Practical Approach. Upper Saddle
River, NJ: McGraw-Hill, 2010.
[7] D. Nurmi, R. Wolski, C. Grzegorczyk, G.
Obertelli, S. Soman, L. Yous-eff, and D. Zagorodnov,
“The eucalyptus open-source cloud-computing
system,” in Proceedings of the 2009 9th IEEE/ACM
International Symposium on Cluster Computing and
the Grid. IEEE, 2009, pp.124–13
[8] N. Chohan, C. Bunch, S. Pang, C. Krintz, N.
Mostafa, S. Soman,and R. Wolski, “Appscale:
Scalable and open appengine
applicationdevelopment and deployment,”First
International Conference on CloudComputing, 2009.
[9] A. Lakshman and P. Malik, “Cassandra: a
decentralized structuredstorage system,”ACM
SIGOPS Operating Systems Review, vol. 44, no. 2,pp.
35–40, 2010.
[10] R. Thomas, “A majority consensus approach to
concurrency controlfor multiple copy databases,”
ACM Transactions on Database Systems(TODS), vol.
4, no. 2, pp. 180–209, 1979
[11] D. Karger, E. Lehman, T. Leighton, R. Panigrahy,
M. Levine, andD. Lewin, “Consistent hashing and
random trees: Cloud cachingprotocols for relieving
hot spots on the World Wide Web,” in Proceedings
of the twenty-ninth annual ACM symposium on
Theory ofcomputing. ACM, 1997, pp. 654–663.
[12] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and
H. Balakrishnan,“Chord: A scalable peer-to-peer
lookup service for internet applications, “in
Proceedings of the 2001 conference on Applications,
technologies, architectures, and protocols for
computer communications. ACM, 2001,pp. 149–160.
[13] J. Elson and J. Howell, “Handling flash crowds
from your garage,”in USENIX 2008 Annual Technical
Conference on Annual TechnicalConference.
USENIX Association, 2008, pp. 171–184.
[14] S. Bourne, “A conversation with Bruce
Lindsay,”Queue, vol. 2, no. 8,pp. 22–33, 2004.
[15] T. Chandra, R. Griesemer, and J. Redstone,
“Paxos made live: anengineering perspective,”
inProceedings of the twenty-sixth annual
ACMsymposium on Principles of Cloud computing.
ACM, 2007, pp.398–407
[16] L. Lamport, “The part-time parliament,”ACM
Transactions on ComputerSystems (TOCS), vol. 16,
no. 2, pp. 133–169, 1998
[17] H. Weatherspoon, P. Eaton, B. Chun, and J.
Kubiatowicz, “Antiquity:exploiting a secure log for
wide-area Cloud storage,”ACM SIGOPSOperating
Systems Review, vol. 41, no. 3, pp. 371–384, 2007.
[18] M. Burrows, “The Chubby lock service for
loosely-coupled Cloudsystems,” in Proceedings of
the 7th symposium on Operating systemsdesign and
implementation. USENIX Association, 2006, pp. 335–
350.
[19] A. Adya, W. Bolosky, M. Castro, G. Cermak, R.
Chaiken, J. Douceur,J. Howell, J. Lorch, M. Theimer,
and R. Wattenhofer, “FARSITE:Federated, available,
and reliable storage for an incompletely
trustedenvironment,”ACM SIGOPS Operating
Systems Review, vol. 36, no. SI, pp. 1–14, 2002
[20] K. Bowers, A. Juels, and A. Oprea, “HAIL: A
high-availability andintegrity layer for cloud
storage,” in Proceedings of the 16th ACMconference
on Computer and communications security. ACM,
2009,pp. 187–198.
[21] J. Kubiatowicz, D. Bindel, Y. Chen, S.
Czerwinski, P. Eaton, D. Geels,R. Gummadi, S. Rhea,
H. Weatherspoon, C. Wellset al., “Oceanstore: An
architecture for global-scale persistent storage,”ACM
SIGARCH Computer Architecture News, vol. 28, no.
5, pp. 190–201, 2000
[22] Google, Datastore Performance Growing Pains.
Google, Jun.2010, (accessed on December 4, 2010).
[Online]. Available:
http://googleappengine.blogspot.com/2010/06/datast
ore-perfor mance-growing-pains.html
[23] C. Bunch, N. Chohan, C. Krintz, J. Chohan, J.
Kupferman, P. Lakhina,Y. Li, and Y. Nomura, “An
evaluation of Cloud datastores using the appscale
cloud platform,” in Cloud Computing (CLOUD),
2010 IEEE3rd International Conference on, 2010, pp.
305 –312
[24] Broberg, Buyya, and Tari, “Creating a Cloud
Storage Mashup forHigh Performance, Low CostContent Delivery,” inService-OrientedComputing–
ICSOC 2008 Workshops. Springer, 2009, pp. 178–183.
[25] J. Broberg, R. Buyya, and Z. Tari, “MetaCDN:
Harnessing ’StorageClouds’ for high performance
content delivery,”Journal of Network andComputer
Applications, vol. 32, no. 5, pp. 1012–1022, 2009
[26] H. Abu-Libdeh, L. Princehouse, and H.
Weatherspoon, “RACS: a casefor cloud storage
diversity,” in Proceedings of the 1st ACM
symposiumon Cloud computing. ACM, 2010, pp.
229–240.
[27] H. Weatherspoon and J. Kubiatowicz, “Erasure
coding vs. replication:A quantitative
comparison,”Peer-to-Peer Systems, pp. 328–337,
2002. 

Currently there are no Refbacks

Paper Title : Mobile Social Networks for Flattering Unsigned Profile Matching
Authors : ANUSHA.V, K.SUMALATHA,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Assistant Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

Social networking makes digital communication technologies sharpening tools for extending the social circle of people. Privacy preservation is a significant research issue in social networking. Here user Profile matching with privacy preservation in mobile social networks (MSNs) is studied and a family of Profile matching protocols is introduced. An explicit Comparison-based Profile matching protocol (eCPM) which runs between two parties, an initiator and a responder is proposed which enables the initiator to obtain the comparison-based matching result about a specified attribute in their Profiles, while preventing their attribute values from disclosure. An implicit Comparison-based Profile matching protocol (iCPM) is then proposed which allows the initiator to directly obtain some messages instead of the comparison result from the responder. The messages unrelated to user Profile can be divided into multiple categories by the responder. The initiator implicitly chooses the interested category which is unknown to the responder. Two messages in each category are prepared by the responder, and only one message can be obtained by the initiator according to the comparison result on a single attribute. iCPM is further generalized into an implicit Predicate-based Profile matching protocol (iPPM) which allows complex comparison criteria spanning multiple attributes.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Mobile social network, Profile matching, privacy preservation, Homomorphic encryption, oblivious transfer

ANUSHA.V,K.SUMALATHA."Mobile Social Networks for Flattering Unsigned Profile Matching". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.384-390, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I66.pdf,

[1]‚Comscore,‛ http://www.comscoredatamine.com/.
[2] A. G. Miklas, K. K. Gollu, K. K. W. Chan, S. Saroiu, P.
K. Gummadi, and E. de Lara, ‚Exploiting social
interactions in mobile systems,‛ in Ubicomp, 2007, pp.
409–428.
[3] S. Ioannidis, A. Chaintreau, and L. Massouli´e,
‚Optimal and scalable distribution of content updates
over a mobile social network,‛ in Proc. IEEE INFOCOM,
2009, pp. 1422–1430.
[4] R. Lu, X. Lin, and X. Shen, ‚Spring: A social-based
privacy-preserving packet forwarding protocol for
vehicular delay tolerant networks,‛ in Proc. IEEE
INFOCOM, 2010, pp. 632–640.
[5] W. He, Y. Huang, K. Nahrstedt, and B. Wu,
‚Message propagation in ad- hoc-based proximity
mobile social networks,‛ in PERCOM workshops, 2010,
pp. 141–146.
[6] D. Niyato, P. Wang, W. Saad, and A. Hjørungnes,
‚Controlled coalitional games for cooperative mobile social networks,‛ IEEE Transactions on Vehicular
Technology, vol. 60, no. 4, pp. 1812–1824, 2011.
[7] M. Motani, V. Srinivasan, and P. Nuggehalli,
‚Peoplenet: engineering a wireless virtual social
network,‛ in MobiCom, 2005, pp. 243–257.
[8] M. Brereton, P. Roe, M. Foth, J. M. Bunker, and L.
Buys, ‚Designing participation in agile ridesharing with
mobile social software,‛ in OZCHI, 2009, pp. 257–260.
[9] E.Bulut and B.Szymanski, ‚Exploiting friendship
relations for efficient routing in delay tolerant mobile
social networks,‛ IEEE Transactions on Parallel and
Distributed Systems, vol. 23, no. 12, pp. 2254–2265, 2012.
[10] Z. Yang, B. Zhang, J. Dai, A. C. Champion, D. Xuan,
and D. Li, ‚E-smalltalker: A distributed mobile system
for social networking in physical proximity,‛ in ICDCS,
2010, pp. 468–477.
[11] Q. Li, S. Zhu, and G. Cao, ‚Routing in socially
selfish delay tolerant networks,‛ in Proc. IEEE
INFOCOM, 2010, pp. 857–865.
[12] X. Liang, X. Li, T. H. Luan, R. Lu, X. Lin, and X.
Shen, ‚Morality- driven data forwarding with privacy
preservation in mobile social networks,‛ IEEE
Transactions on Vehicular Technology, vol. 7, no. 61, pp.
3209–3222, 2012.
[13] R. Gross, A. Acquisti, and H. J. H. III, ‚Information
revelation and privacy in online social networks,‛ in
WPES, 2005, pp. 71–80.
[14] F. Stutzman, ‚An evaluation of identity-sharing
behavior in social network communities.‛ iDMAa
Journal, vol. 3, no. 1, pp. 10–18, 2006.
[15] K. P. N. Puttaswamy, A. Sala, and B. Y. Zhao,
‚Starclique: guaranteeing user privacy in social
networks against intersection attacks,‛ in CoNEXT,
2009, pp. 157–168.
[16] E. Zheleva and L. Getoor, ‚To join or not to join: the
illusion of privacy in social networks with mixed public
and private user profiles,‛ in WWW, 2009, pp. 531–540.
[17] G. Chen and F. Rahman, ‚Analyzing privacy
designs of mobile social networking applications,‛
IEEE/IFIP International Conference on Em- bedded and
Ubiquitous Computing, vol. 2, pp. 83–88, 2008. 
[18] D.
Balfanz, G. Durfee, N. Shankar, D. K. Smetters, J.
Staddon, and H.- C. Wong, ‚Secret handshakes from
pairing-based key agreements,‛ in IEEE Symposium on
Security and Privacy, 2003, pp. 180–196. 
[19] M. J.
Freedman, K. Nissim, and B. Pinkas, ‚Efficient private
matching and set intersection,‛ in EUROCRYPT, 2004,
pp. 1–19.
[20] R. Lu, X. Lin, X. Liang, and X. Shen, ‚A secure
handshake scheme with symptoms-matching for
healthcare social network,‛ ACM Mobile Networks and
Applications (MONET), vol. 16, no. 6, pp. 683–694, 2011.
[21] M. Li, N. Cao, S. Yu, and W. Lou, ‚Findu: Privacypreserving personal profile matching in mobile social
networks,‛ in Proc. IEEE INFOCOM, 2011, pp. 2435–
2443.
[22] R. Zhang, Y. Zhang, J. Sun, and G. Yan, ‚Finegrained private matching for proximity-based mobile
social networking,‛ in Proc. IEEE INFO- COM, 2012, pp.
1969–1977.
[23] W. Dong, V. Dave, L. Qiu, and Y. Zhang, ‚Secure
friend discovery in mobile social networks,‛ in Proc.
IEEE INFOCOM, 2011, pp. 1647– 1655.
[24] J. Freudiger, M. H. Manshaei, J.-P. Hubaux, and D.
C. Parkes, ‚On non- cooperative location privacy: a
game-theoretic analysis,‛ in ACM CCS, 2009, pp. 324–
337.
[25] R. Lu, X. Lin, H. Luan, X. Liang, and X. Shen,
‚Pseudonym changing at social spots: An effective
strategy for location privacy in vanets,‛ IEEE
Transactions on Vehicular Technology, vol. 61, no. 1, pp.
86 – 96, 2011.
[26] J. Katz, A. Sahai, and B. Waters, ‚Predicate
encryption supporting dis- junctions, polynomial
equations, and inner products,‛ in EUROCRYPT, 2008,
pp. 146–162.
[27] N. Eagle and A. Pentland, ‚Social serendipity:
mobilizing social soft- ware,‛ IEEE Pervasive
Computing, vol. 4, no. 2, pp. 28–34, 2005.
[28] J. Teng, B. Zhang, X. Li, X. Bai, and D. Xuan, ‚Eshadow: Lubricating social interaction using mobile
phones,‛ in ICDCS, 2011, pp. 909–918. 
[29] B. Han and A. Srinivasan, ‚Your friends have more
friends than you do: identifying influential mobile users
through random walks,‛ in MobiHoc, 2012, pp. 5–14.
[30] Z. Yang, B. Zhang, J. Dai, A. C. Champion, D. Xuan,
and D. Li, ‚E-smalltalker: A distributed mobile system
for social networking in physical proximity,‛ in ICDCS,
2010, pp. 468–477.
[31] L. Kissner and D. X. Song, ‚Privacy-preserving set
operations,‛ in CRYPTO, 2005, pp. 241–257. 
[32] Q. Ye,
H. Wang, and J. Pieprzyk, ‚Distributed private
matching and set operations,‛ in ISPEC, 2008, pp. 347–
360.
[33] D. Dachman-Soled, T. Malkin, M. Raykova, and M.
Yung, ‚Efficient robust private set intersection,‛ in
ACNS, 2009, pp. 125–142.
[34] S. Jarecki and X. Liu, ‚Efficient oblivious
pseudorandom function with applications to adaptive ot
and secure computation of set intersection,‛ in TCC,
2009, pp. 577–594.
[35] C. Hazay and Y. Lindell, ‚Efficient protocols for set
intersection and pattern matching with security against
malicious and covert adversaries,‛ Journal of
Cryptology, vol. 23, no. 3, pp. 422–456, 2010.
[36] B. Goethals, S. Laur, H. Lipmaa, and T.
Mielik¨ainen, ‚On private scalar product computation
for privacy-preserving data mining,‛ in ICISC, 2004, pp.
104–120. 

Currently there are no Refbacks

Paper Title : High Dimensional Data Clustering Based On Feature Selection Algorithm
Authors : K.SWATHI, B.RANJITH,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
HOD-CSE, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

Feature selection is the process of identifying a subset of the most useful features that produces compatible results as the original entire set of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. While the efficiency concerns the time required to find a subset of features, the effectiveness is related to the quality of the subset of features. Based on these criteria, a FAST clustering-based feature Selection algorithm (FAST) is proposed and experimentally evaluated. The FAST algorithm works in two steps. In the first step, features are divided into clusters by using graph-theoretic clustering methods. In the second step, the most representative feature that is strongly related to target classes is selected from each cluster to form a subset of features. Features in different clusters are relatively independent; the clustering-based strategy of FAST has a high probability of producing a subset of useful and independent features. The MinimumSpanning Tree (MST) using Prim’s algorithm can concentrate on one tree at a time. To ensure the efficiency of FAST, adopt the efficient MST using the Kruskal’s Algorithm clustering method.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Feature subset selection, filter method, feature clustering, graph-based clustering, Kruskal’s algorithm.

K.SWATHI,B.RANJITH."High Dimensional Data Clustering Based On Feature Selection Algorithm". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.379-383, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I65.pdf,

[1] Almuallim H. and Dietterich T.G., Algorithms
for Identifying Relevant Features, In Proceedings
of the 9th Canadian Conference on AI, pp 38-45,
1992.
[2] Almuallim H. and Dietterich T.G., Learning
boolean concepts in the presence of many
irrelevant features, Artificial Intelligence, 69(1-2),
pp 279- 305, 1994.
[3] Arauzo-Azofra A., Benitez J.M. and Castro J.L.,
A feature set measure based on relief, In
Proceedings of the fifth international conference on
Recent Advances in Soft Computing, pp 104-109,
2004.
[4] Baker L.D. and McCallum A.K., Distributional
clustering of words for text classification, In
Proceedings of the 21st Annual international ACM
SIGIR Conference on Research and Development
in information Retrieval, pp 96- 103, 1998.
[5] Battiti R., Using mutual information for
selecting features in supervised neural net
learning, IEEE Transactions on Neural Networks,
5(4), pp 537- 550, 1994.
[6] Bell D.A. and Wang, H., formalism for
relevance and its application in feature subset
selection, Machine Learning, 41(2), pp 175-195,
2000.
[7] Biesiada J. and Duch W., Features election for
high-dimensionaldatała Pearson redundancy
based filter, AdvancesinSoftComputing, 45, pp
242C249, 2008.
[8] Butterworth R., Piatetsky-Shapiro G. and
Simovici D.A., On Feature Selection through
Clustering, In Proceedings of the Fifth IEEE
international Conference on Data Mining, pp 581-
584, 2005.
[9] Cardie, C., Using decision trees to improve
case-based learning, In Proceedings of Tenth
International Conference on Machine Learning, pp
25-32, 1993.
[10] Chanda P., Cho Y., Zhang A. and Ramanathan
M., Mining of Attribute Interactions Using
Information Theoretic Metrics, In Proceedings of
IEEE international Conference on Data Mining
Workshops, pp 350-355, 2009.
[11] Chikhi S. and Benhammada S., ReliefMSS: a
variation on a feature ranking ReliefF algorithm.
Int. J. Bus. Intell. Data Min. 4(3/4), pp 375-390, 2009.
[12] Cohen W., Fast Effective Rule Induction, In
Proc. 12th international Conf. Machine Learning
(ICML’95), pp 115-123, 1995.
[13] Dash M. and Liu H., Feature Selection for
Classification, Intelligent Data Analysis, 1(3), pp
131-156, 1997.
[14] Dash M., Liu H. and Motoda H., Consistency
based feature Selection, In Proceedings of the
Fourth Pacific Asia Conference on Knowledge
Discovery and Data Mining, pp 98-109, 2000.
[15] Das S., Filters, wrappers and a boosting-based
hybrid for feature Selection, In Proceedings of the
Eighteenth International Conference on Machine
Learning, pp 74-81, 2001.
[16] Dash M. and Liu H., Consistency-based search
in feature selection. Artificial Intelligence, 151(1-2),
pp 155-176, 2003.
[17] Demsar J., Statistical comparison of classifiers
over multiple data sets, J. Mach. Learn. Res., 7, pp
1-30, 2006.
[18] Dhillon I.S., Mallela S. and Kumar R., A
divisive information theoretic feature clustering
algorithm for text classification, J. Mach. Learn.
Res., 3, pp 1265-1287, 2003.
[19] Dougherty, E. R., Small sample issues for
microarray-based classification. Comparative and
Functional Genomics, 2(1), pp 28-34, 2001.
[20] Fayyad U. and Irani K., Multi-interval
discretization of continuous-valued attributes for
classification learning, In Proceedings of the
Thirteenth International Joint Conference on
Artificial Intelligence, pp 1022-1027, 1993.

Currently there are no Refbacks

Paper Title : Security Enhancement for Enabling Dynamic Data and Mutual Trust in Public Cloud
Authors : K.NAGA SANDHYA, D.RAVIKIRAN,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

In Cloud Computing, Storage as a Service is one of the most required services, but the security of the data stored in the cloud using these services is the key issue. The outsourced data in the cloud has to be guaranteed with confidentiality, integrity and access control. In this work, we device a mechanism of cloud data storage based on indirect mutual trust between the Cloud Service Provider (CSP) and the cloud users through Trusted Third Party Auditor (TTPA). This work facilitates the user to store their data as blocks and enables them to perform dynamic operations on blocks. The stored data can be accessed by a group of users authorized by the data owner. The owner has the privilege to grant or revoke access of the stored data in the cloud. The present system is providing a good security mechanism for stored data and proper sharing of keys among authorized users, and data owner for the cryptographic mechanism.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Mutual trust, access control, dynamic environment, outsourcing data storage

K.NAGA SANDHYA,D.RAVIKIRAN."Security Enhancement for Enabling Dynamic Data and Mutual Trust in Public Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.373-378, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I64.pdf,

[1] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L.
Kissner, Z. Peterson, and D. Song, ‚Provable data
possession at untrusted stores,‛ in Proceedings of
the 14th ACM Conference on Computer and
Communications Security, ser. CCS ’07, 2007, pp.
598–609.
[2] F. Sebe,´ J. Domingo-Ferrer, A. Martinez-Balleste,
Y. Deswarte, and J.-J. Quisquater, ‚Efficient
remote data possession checking in critical
information infrastructures,‛ IEEE Trans. on
Knowl. and Data Eng., vol. 20, no. 8, 2008.
[3] G. Ateniese, R. D. Pietro, L. V. Mancini, and G.
Tsudik, ‚Scalable and efficient provable data
possession,‛ in Proceedings of the 4th
International Conference on Security and Privacy
in Communication Netowrks, 2008, pp. 1–10.
[4] C. Erway, A. Kupc¸¨u,¨ C. Papamanthou, and R.
Tamassia, ‚Dynamic provable data possession,‛
in Proceedings of the 16th ACM Confer-ence on
Computer and Communications Security, 2009,
pp. 213–222.
[5] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou,
‚Enabling public verifiability and data dynamics
for storage security in cloud computing,‛ in Proceedings of the 14th European Conference on
Research in Computer Security, 2009, pp. 355–370.
[6] A. F. Barsoum and M. A. Hasan, ‚Provable
possession and replication of data over cloud
servers,‛ Centre For Applied Cryp-tographic
Research, Report 2010/32, 2010,
http://www.cacr.math.
uwaterloo.ca/techreports/2010/cacr2010-32.pdf.
[7] R. Curtmola, O. Khan, R. Burns, and G. Ateniese,
‚MR-PDP: multiple-replica provable data
possession,‛ in 28th IEEE ICDCS, 2008, pp. 411–
420.
[8] A. F. Barsoum and M. A. Hasan, ‚On verifying
dynamic multi-ple data copies over cloud
servers,‛ Cryptology ePrint Archive, Report
2011/447, 2011, 2011, http://eprint.iacr.org/.
[9] K. D. Bowers, A. Juels, and A. Oprea, ‚HAIL: a
high-availability and integrity layer for cloud
storage,‛ in CCS ’09: Proceedings of the 16th
ACM conference on Computer and
communications security. New York, NY, USA:
ACM, 2009, pp. 187–198.
[10] Y. Dodis, S. Vadhan, and D. Wichs, ‚Proofs of
retrievability via hardness amplification,‛ in
Proceedings of the 6th Theory of Cryptography
Conference on Theory of Cryptography, 2009.
[11] A. Juels and B. S. Kaliski, ‚PORs: Proofs of
Retrievability for large files,‛ in CCS’07:
Proceedings of the 14th ACM conference on
Computer and communications security. ACM,
2007, pp. 584–597.
[12] H. Shacham and B. Waters, ‚Compact proofs of
retrievability,‛ in ASIACRYPT ’08, 2008, pp. 90–
107.
[13] M. Kallahalla, E. Riedel, R. Swaminathan, Q.
Wang, and K. Fu, ‚Plutus: Scalable secure file
sharing on untrusted storage,‛ in Proceedings of
the FAST 03: File and Storage Technologies, 2003.
[14] E.-J. Goh, H. Shacham, N. Modadugu, and D.
Boneh, ‚Sirius: Securing remote untrusted
storage,‛ in Proceedings of the Network and
Distributed System Security Symposium, NDSS,
2003.
[15] G. Ateniese, K. Fu, M. Green, and S. Hohenberger,
‚Improved proxy re-encryption schemes with
applications to secure distributed storage,‛ in
NDSS, 2005.
[16] S. D. C. di Vimercati, S. Foresti, S. Jajodia, S.
Paraboschi, and P. Samarati, ‚Over-encryption:
Management of access control evolution on
outsourced data,‛ in Proceedings of the 33rd
International Conference on Very Large Data
Bases. ACM, 2007, pp. 123–134.
[17] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
‚Attribute-based encryption for fine-grained
access control of encrypted data,‛ in CCS ’06,
2006, pp. 89–98.
[18] S. Yu, C. Wang, K. Ren, and W. Lou, ‚Achieving
secure, scalable, and fine-grained data access
control in cloud computing,‛ in INFOCOM’10,
2010, pp. 534–542.
[19] R. A. Popa, J. R. Lorch, D. Molnar, H. J. Wang,
and L. Zhuang, ‚Enabling security in cloud
storage SLAs with cloud proof,‛ in Proceedings of
the 2011 USENIX conference, 2011.
[20] K. E. Fu, ‚Group sharing and random access in
cryptographic storage file systems,‛ Master’s
thesis, MIT, Tech. Rep., 1999.
[21] W. Wang, Z. Li, R. Owens, and B. Bhargava,
‚Secure and efficient access to outsourced data,‛
in Proceedings of the 2009 ACM workshop on
Cloud computing security, 2009, pp. 55–66.
[22] M. Backes, C. Cachin, and A. Oprea, ‚Secure keyupdating for lazy revocation,‛ in 11th European
Symposium on Research in Computer Security,
2006, pp. 327–346.
[23] D. Boneh, C. Gentry, and B. Waters, ‚Collusion
resistant broadcast encryption with short
ciphertexts and private keys,‛ in Advances in
Cryptology - CRYPTO, 2005, pp. 258–275.
[24] D. Boneh, B. Lynn, and H. Shacham, ‚Short
signatures from the weil pairing,‛ in ASIACRYPT
’01: Proceedings of the 7th International
Conference on the Theory and Application of
Cryptology and Information Security, London,
UK, 2001, pp. 514–532.
[25] P. S. L. M. Barrio and M. Naehrig, ‚IEEE P1363.3
submission: Pairing-friendly elliptic curves of
prime order with embedding degree 12,‛ New
Jersey: IEEE Standards Association, 2006.
[26] Amazon Web Service, http://aws.amazon.com/.
[27] P. S. L. M. Barreto and M. Naehrig, ‚Pairingfriendly elliptic curves of prime order,‛ in
Proceedings of SAC 2005, volume 3897 of LNCS.
Springer-Verlag, 2005, pp. 319–331.
[28] D. L. G. Filho and P. S. L. M. Barreto,
‚Demonstrating data possession and uncheatable data transfer,‛ Cryptology ePrint Archive, Report
2006/150, 2006.
[29] D. Naor, M. Naor, and J. B. Lotspiech,
‚Revocation and tracing schemes for stateless
receivers,‛ in Proceedings of the 21st Annual
International Cryptology Conference on
Advances in Cryptology, ser. CRYPTO ’01.
Springer-Verlag, 2001, pp. 41–62.
[30] M. Blaze, G. Bleumer, and M. Strauss, ‚Divertible
protocols and atomic proxy cryptography,‛ in
EUROCRYPT, 1998, pp. 127–144.
[31] M. J. Atallah, K. B. Frikken, and M. Blanton,
‚Dynamic and efficient key management for
access hierarchies,‛ in Proceedings of the 12th
ACM Conference on Computer and
Communications Security, ser. CCS ’05. ACM,
2005, pp. 190–202.
[32] J. Fangs, Y. Chen, W.-S. Ku, and P. Liu, ‚Analysis
of integrity vulnerabilities and a non-repudiation
protocol for cloud data storage platforms,‛ in
Proceedings of the 2010 39th International
Conference on Parallel Processing, 2010, pp. 251–
258.
[33] J. Fangs, Y. Chen, and D. H. Summerville, ‚A fair
multi-party non-repudiation scheme for storage
clouds,‛ in 2011 International Conference on
Collaboration Technologies and Systems, 2011,
pp. 457– 465.

Currently there are no Refbacks

Paper Title : Cloud Partitioning of Load Balancing Using Round Robin Model
Authors : M.V.L.SOWJANYA, D.RAVIKIRAN,
Affiliations : M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Professor, Priyadarshini Institute of Technology and Science for Women
Abstract :

af

The purpose of load balancing is to look up the performance of a cloud environment through an appropriate circulation strategy. Good load balancing will construct cloud computing for more stability and efficiency. This paper introduces a better round robin model for the public cloud based on the cloud partitioning concept with a switch mechanism to choose different strategies for different situations. Load balancing is the process of giving out of workload among different nodes or processor. It will introduces a enhanced approach for public cloud load distribution using screening and game theory concept to increase the presentation of the system.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


load balancing model; public cloud; cloud partition; game theory

M.V.L.SOWJANYA,D.RAVIKIRAN."Cloud Partitioning of Load Balancing Using Round Robin Model". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.367-372, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I63.pdf,

[1] R. Hunter, The why of cloud,
http://www.gartner.com/DisplayDocument?doc
cd=226469&ref= gnoreg, 2012.
[2] M. D. Dikaiakos, D. Katsaros, P. Mehra, G. Pallis,
and A. Vakali, Cloud computing: Distributed
internet computing for IT and scientific research,
Internet Computing, vol.13, no.5, pp.10-13, Sept.-
Oct. 2009.
[3] P. Mell and T. Grance, The NIST definition of
cloud computing, http://csrc.nist.gov/
publications/nistpubs/800-145/SP800-145.pdf,
2012.
[4] Microsoft Academic Research, Cloud computing,
http:// libra.msra.cn/Keyword/6051/cloudcomputing? query = cloud%20computing, 2012.
[5] Google Trends, Cloud computing,
http://www.google.com/trends/explore#q=cloud
%20computing, 2012.
[6] N. G. Shivaratri, P. Krueger, and M. Singhal, Load
distributing for locally distributed systems,
Computer, vol. 25, no. 12, pp. 33-44, Dec. 1992.
[7] B. Adler, Load balancing in the cloud: Tools, tips
and techniques, http://www.rightscale. com/info
center/white-papers/Load-Balancing-in-theCloud.pdf, 2012
[8] Z. Chaczko, V. Mahadevan, S. Aslanzadeh, and C.
Mcdermid, Availability and load balancing in
cloud computing, presented at the 2011
International Conference on Computer and
Software Modeling, Singapore, 2011.
[9] K. Nishant, P. Sharma, V. Krishna, C. Gupta, K. P.
Singh, International Conference on Computer
Modeling and Simulation (UKSim), Cambridge
shire, United Kingdom, Mar. 2012, pp. 28-30.
[10] M. Randles, D. Lamb, and A. Taleb-Bendiab, A
comparative study into distributed load balancing
algorithms for cloud computing, in Proc. IEEE
24th International Conference on Advanced
Information Networking and Applications, Perth,
Australia, 2010, pp. 551-556.
[11] A. Rouse, Public cloud,
http://searchcloudcomputing.techtarget.com/defi
nition/public-cloud, 2012.
[12] D. MacVittie, Intro to load balancing for
developers — the algorithms,
https://devcentral.f5.com/blogs/us/intro-to-loadbalancing-for-developers-ndash-the-algorithms,
2012.
[13] S. Penmatsa and A. T. Chronopoulos, Gametheoretic static balancing for distributed systems,
load journal of Distributed computing pp.502-11-
42.
[14] D. Grosu, A. T. Chronopoulos, and M. Y. Leung,
Load balancing in distributed systems: An
approach using cooperative games, in Proc. 16th
IEEE Intl. Parallel and Distributed Processing
Symp., Florida, USA, Apr. 2002, pp. 52-61.
[15] S. Aote and M. U. Kharat, A game-theoretic
model for dynamic load balancing in distributed
systems, in Proc. the International Conference on
Advances in Computing, Communication and
Control (ICAC3 ’09), New York, USA, 2009, pp.
235-238. 

Currently there are no Refbacks

Paper Title : Role of Open Source Software in E-Governance
Authors : S. Prem Kumar, Archana Thakur, C. Umashankar
Affiliations : Dr S. Prem Kumar, Prof & Head, Dept. of CSE, G. Pullaiah College of Engg & Technology, Kurnool, India
Deputy Secretary, UGC, New Delhi
Prof. C. Umashankar, Registrar, Rasthriya Sanskrit Vidhya Peetha, Tirupathi, India, [email protected]
Senior Technical Director, NIC, Hyderabad, India.
Abstract :

af

In day to day activities, e-Governance applications are becoming part of every citizen’s life. The models of eGovernance are G2C, G2G, G2B with which the respective stake holders are enjoying the benefits. In the wide spread of eGovernance, it is quite obvious to notice that there are innumerable applications of e-Governance which help the human race for quality life. The major ingredients of e-Governance are Connectivity, Information, Skill set, Budget. The cost of software is the major hurdle in introducing novel beneficial e-Governance applications. This can be mitigated using free and Open Source Software(OSS). Improper implementation of e-Governance activities leads to problems which can be controlled by eGovernance frame work elements like planning, audit on services, social audit, infra structure audit, professional audit, software audit, software down time, budgeting the total projects under the umbrella activities of free and Open Source Software(FOSS). International organizations such as UNESCO, IOSN etc are promoting free and open source software because of its benefits of savings, security, scalability, reliability, precession, interoperability and globalization. The return on investment is the major focus of the governments which is possible with OSS and also this in turn reduces the financial burden on public and makes them enjoy the real fruits of e-Governance applications.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


e-Governance, Open Source, Free ware, Security, Scalability, Reliability, Interoperability

S. Prem Kumar,Archana Thakur,C. Umashankar,V.V.Venkata Ramana."Role of Open Source Software in E-Governance". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.357-366, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I62.pdf,

[1] Rehema Baguma, ‚Affordable E-governance Using
Free and Open Source Software‛, Measuring
Computing Research Excellence and Vitality, 2010
[2] Nikita Yadav, Research Scholar, Singhania
University, Pacheri Bari, Rajasthan, V. B. Singh, Delhi
College of Arts & Commerce, University of Delhi,
Delhi, ‚ E-Governance: Past, Present and Future in
India‛, International Journal of Computer Applications
(0975 – 8887) Volume 53– No.7, September 2012
[3] Tanushree Bhatnagar, A.N. Jha, H.K. Singh, ‚Use Of
Information & Communication Technologies (Ict’s) In
E-Governance‛: A Review, International Journal Of
Emerging Technologies And Applications In
Engineering, Technology And Sciences (IJ-ETAETS),2011
[4] Dr. V.V.Venkata Ramana, Dr. C. Umashankar, Dr.S.
Prem Kumar, ‚e-Governance Applications for citizens
- Issues and Framework‛, International Journal on
Computer Science and Engineering, 2012
[5] Walt Scacchi, Institute for Software Research,
University of California, Irvine, ‚Understanding the
Potential for Open Government: Open Source
Processes for E-Government‛, a Presentation, 2010
[6] Enterprise application and Open source system for
e-Governance implementation, Introduction to Open
Source System, a Presentation, 2009
[7] Planning commission, Government of India, Social
Audit Grama sabha & Panchayat Raj, a Report Oct.
2005
[8] Dr. V.V. Venkata Ramana, Senior Technical
Director, National Informatics Centre, Hyderabad,
‚Open Source Technologies‛, a presentation at
SPMVV, Tirupati, 2014

Currently there are no Refbacks

Paper Title : Enhance the QoS capability of Hybrid Networks using QoS-Oriented Distributed Routing Protocol
Authors : N.Asha Jyothi, G.Ramya, G.Mounika
Affiliations : Department of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

With the expanding interest for constant applications in the Wireless Senor Network (WSN), ongoing discriminating occasions suspect a proficient quality-of-service (QoS) based Routing for information conveyance from the Network foundation. Outlining such QoS based Routing convention to meet the unwavering quality and postponement certification of discriminating occasions while protecting the vitality effectiveness is a testing assignment. Impressive exploration has been centred on creating hearty vitality productive QoS based Routing conventions. In this paper, we tended to a remote crossover arrange that incorporates a mobile wireless ad hoc network (MANET) and a wireless infrastructure network has been turned out to be a finer option for the cutting edge remote Networks. By straight forwardly embracing asset reservation-based QoS Routing for MANETs, half breeds Networks inherit invalid reservation and race condition issues in MANETs. Instructions to ensure the QoS in cross breed Networks remains an open issue. In this paper, we propose QoS-Oriented Distributed routing protocol (QOD) to upgrade the QoS help capacity of hybrid Networks.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


quality-of-service (QoS), QoS-Oriented Distributed routing protocol (QOD), access points (APs), Mobile Ad-hoc Networks (MANET)

N.Asha Jyothi,G.Ramya,G.Mounika,R.Sandeep Kumar."Enhance the QoS capability of Hybrid Networks using QoS-Oriented Distributed Routing Protocol". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.178-182, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I41.pdf,

[1] I.Akyildiz,W.Su, Y.Sankarasubramaniam, and E.
Cayirci, ‚A survey on sensor networks,‛ IEEE
Communications Magazine, Volume: 40 Issue: 8, August,
2002, pp.102-114.
[2] Tian He, Sudha Krishnamurthy, John A. Stankovic,
Tarek Abdelzaher, Liqian Luo, Radu Stoleru,Ting Yan,
Lin Gu ‚Energy-Efficient Surveillance System Using
Wireless Sensor Networks‛ MobiSYS’04, June 6-9, 2004,
Boston, Massachusetts, USA.
[3] A. Cerpa, J. Elson, D. Estrin, L. Girod, M. Hamilton,
and J. Zhao, ‚Habitat Monitoring: Application Drive for
Wireless Communications Technology,‛ Proc. ACM
SIGCOMM Workshop Data Comm.In Latin Am. and the
Caribbean, April, 2001.
[4] E. Biagioni and K. Bridges, ‚The Applications of
Remote Sensor Technology to Assist the Recovery of Rare
and Endangered Species,‛ Int’l J. High Performance
Computing Applications, special issue on distributed
sensor networks, April, 2003.
[5] H.T. Kung and D. Vlah, ‚Efficient Location Tracking
Using Sensor Networks,‛ Proc. IEEE Wireless Comm. and
Networking Conf. (WCNC), March, 2003.
[6] R. Brooks, P. Ramanathan, and A. Sayeed,
‚Distributed Target Classification and Tracking in Sensor
Networks,‛ Proc. IEEE, Vol.91, No.8, 2003, pp.1163-1171.
[7] Jamal N. Al-Karaki, Ahmed E. Kamal, Routing
techniques in wireless sensor networks: a survey,IEEE
Journal of Wireless Communications 11 (6) (2004) 6-28.
[8] Anahit Martirosyan, Azzedine Boukerche, Richard
Werner, Nelem Pazzi, A taxonomy of clusterbased
routing protocols for wireless sensor networks, in: The
Proceedings of International Symposium on Parallel
Architectures, Algorithms, and Networks, ISPAN-2008,
Sydney, Australia, May, 7-9,2008, pp.247-253.
[9] Shah R, Rabaey J. Energy aware routing for low energy
ad hoc sensor networks. Proceedings of IEEE
WCNC’02,Orlando, FL, March, 2002; 350-355.
[10] Ganesan D, Govindan R, Shenker S, Estrin D. Highlyresilient, energy-efficient multipath routing in wireless
sensor networks. Proceedings of ACM MobiHoc’01, Long
Beach, CA, U.S.A., October,2001.
[11] Ye Ming Lu, Vincent W.S. Wong, An energy efficient
multipath routing protocol for wireless sensor networks,
International Journal of Communication System 20 (7)
(2007) 

Currently there are no Refbacks

 


Paper Title : A Fault Node Recovery Algorithm to Improve the Life Span of WSNs
Authors : K.Bichya , ,
Affiliations : Assistant Professor, Telangana, India
Abstract :

af

This paper proposes a fault node recovery algorithm to enhance the lifetime of WSNs when a rate of the sensor node shuts down. This algorithm is concentrated around the assessment spread algorithm solidified with the inherited figuring. The algorithm can realize less substitution of sensor nodes and more reused guiding ways. In this proposed algorithm assembles the amount of element nodes up to 8.7 times, diminishes the rate of data adversity by pretty about 99%, and abatements the rate of essentialness usage by pretty much 32%. Sensors in WSNs are having inclination to fail, in light of the imperativeness weariness, fittings disillusionments, regular conditions etc. Inadequacy strength is one of the essential issues in WSNs. The current inadequacy safety instruments either consume immense extra essentialness to distinguish and recover from the disillusionments or need to use additional fittings and programming resources. The proposed algorithm enhances the lifetime of a sensor nodes close down and it depends on after venturing stool dispersal Algorithm joined with the inherited computation. It can achieve less supplanting of sensor nodes with more reused guiding ways moreover manufactures the amount of element nodes, diminish the rate of data disaster with diminished imperativeness use.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Genetic algorithm, hierarchal gradient diffusion, grade diffusion, wireless sensor networks, Grade diffusion algorithm.

K.Bichya ."A Fault Node Recovery Algorithm to Improve the Life Span of WSNs". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.6, Issue 04,pp.289-297 , April - 2019, URL :https://ijcert.org/ems/ijcert_papers/V1I55.pdf,

[1] Sony Jia, Wang Bailing, Ping Xiyar, Li Jianfeng and Zhong cheng, “A Recovery Based on Minimum Distance redundant Nodes Fault Management in WSNs,” International Journal of control and automation, vol 6,No.2 April 2013. 
[2] Muhammed Asim, Hala Mokhtar and Madjid Merabti, “A self-managing fault management mechanism for wireless sensor networks,” International Journal of Wirele& Mobile Networks (IJWMN) Vol.2, No.4, November 2010 
[3]  C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed diffusion for wireless sensor networking,” IEEE/ACM Trans.Netw., vol. 11, no. 1, pp. 2–16, Feb. 2003.  
[4] D. Desovski, Y. Liu, and B. Cukic. Linear randomized voting algorithm for fault tolerant sensor fusion and the corresponding reliability model. In IEEE International Symposium on Systems Engineering, pages 153–162, October 2005. 
[5] M. Ding, D. Chen, K. Xing, and X. Cheng. Localized fault-tolerant event boundary detection in sensor networks. In INFOCOM, 2005. 
[6] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar. Next century challenges: scalable coordination in sensor networks. In MobiCom ’99: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pages 263– 270,New York, NY, USA, 1999. ACM Press. 
[7] C.-L. Fok, G.-C. Roman, and C. Lu. Mobile Agent Middleware for Sensor Networks: an Application Case Study. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN), 2005. 
[8] C. Frank and K. Romer. Algorithms for Generic Role Assignment ¨in Wireless Sensor Networks. In Proceedings of the 3rd international conference on Embedded networked sensor systems, pages 230–242, 2005. 
[9] D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. HighlyResilient,Energy-Efficient Multipath Routing in Wireless Sensor Networks. Mobile Computing and Communications Review, 1(2),1997. 
[10] R. Guerraoui and A. Schiper. Fault-Tolerance by Replication in Distributed Systems. In Proceedings of the 1996 Ada-Europe International Conference on Reliable Software Technologies, pages 38–57, 1996. 
[11] G. Gupta and M. Younis. Fault-Tolerant Clustering of Wireless Sensor Networks. Wireless Communications and Networking, 3:1579–1584, 2003. 
[12] I. Gupta, D. Riordan, and S. Sampalli. ClusterHead Election Using Fuzzy Logic for Wireless Sensor Networks. In Proceedings of the 3rd Annual Communication Networks and Services Research Conference, pages 255–260, 2005. 
[13] S. Harte and A. Rahman. Fault Tolerance in Sensor Networks Using Self-Diagnosing Sensor Nodes. In The IEE International Workshop on Intelligent Enviroment, pages 7–12, June 2005. 
[14] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan.Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In Proceedings of the 33rd Hawaii International Conference on System Sciences, volume 8, page 8020, 2000. 
[15] C.-Y. Koo. Broadcast in Radio Networks Tolerating Byzantine Adversarial Behavior. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 
275–282, 2004.  
[16] F. Koushanfar, M. Potkonjak, and A. SangiovanniVincentell. Faul Tolerance Techniques for Wireless Ad hoc Sensor Networks. In Proceedings of IEEE Sensors, volume 2, pages 1491–1496, 2002. 
[17] B. Krishnamachari and S. Iyengar. Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks. IEEE Transactions on Computers, 53:241–250,March 2004. 
[18] L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4:382–401, 1982. 
[19] K. Langendoen, A. Baggio, and O. Visser. Murphy loves potatoes: experiences from a pilot sensor network deployment in precision agriculture. In IPDPS 20th International Parallel and Distributed Processing Symposium, 2006.

Currently there are no Refbacks

Paper Title : Offering Secure Information in the Cloud for the Dynamic Group
Authors : Venkata Sujan, Ch.Shashikala, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Cloud computing is a developing processing ideal model in which assets of the registering framework are given as administrations over the Web. Offering gathering asset among cloud clients is a real issue, so Cloud computing gives an efficient and effective compact. Mona, secure information imparting in a multi-manager way for element gatherings preserve information, identity protection from an untrusted cloud and permits successive change of the participation. In this paper, we propose a confined multi manager information offering scheme, for element amasses in the cloud. By leveraging group signature and dynamic show encryption systems, any cloud client can secretly impart information to others. Proposing another model for offering Secure Information in the Cloud for the dynamic group.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud computing, data sharing, privacy-preserving, access control, dynamic groups.

Venkata Sujan,Ch.Shashikala,Dr.S.Prem Kumar."Offering Secure Information in the Cloud for the Dynamic Group". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 05,pp.277-284, NOVEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I53.pdf,

[1] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H.
Katz, A.Konwinski, G. Lee, D.A. Patterson, A. Rabkin,
I. Stoica, and M.Zaharia, “A View of Cloud
Computing,” Comm. ACM, vol. 53,no. 4, pp. 50-58,
Apr. 2010.
[2] S. Kamara and K. Lauter, “Cryptographic Cloud
Storage,” Proc.Int’l Conf. Financial Cryptography and
Data Security (FC), pp. 136-149, Jan. 2010.
[3] S. Yu, C. Wang, K. Ren, and W. Lou,Achieving
Secure, Scalable, and Fine-Grained Data Access Control
in Cloud Computing,”Proc. IEEE INFOCOM, pp. 534-
542, 2010.
[4] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang,
and K. Fu,“Plutus: Scalable Secure File Sharing on
Untrusted Storage,” Proc.USENIX Conf. File and
Storage Technologies, pp. 29-42, 2003.
[5] E. Goh, H. Shacham, N. Modadugu, and D. Boneh,
“Sirius:Securing Remote Untrusted Storage,” Proc.
Network and Cloud Systems Security Symp. (NDSS),
pp. 131-145, 2003.
[6] G. Ateniese, K. Fu, M. Green, and S. Hohenberger,
“Improved Proxy Re-Encryption Schemes with
Applications to Secure Cloud Storage,” Proc. Network
and Cloud Systems Security Symp. (NDSS), pp. 29-43,
2005.
[7] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure
Provenance: The Essential of Bread and Butter of Data
Forensics in Cloud Computing,” Proc. ACM Symp.
Information, Computer and Comm. Security, pp. 282-
292, 2010.
[8] B. Waters, “Ciphertext-Policy Attribute-Based
Encryption: An Expressive, Efficient, and Provably
Secure Realization,” Proc. Int’l Conf. Practice and Theory in Public Key Cryptography Conf. Public Key
Cryptography, http://eprint.iacr.org/2008/290.pdf, 2008.
[9] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
“Attribute-Based Encryption for Fine-Grained Access
Control of Encrypted Data,” Proc. ACM Conf.
Computer and Comm. Security (CCS),
pp. 89-98, 2006.
[10] D. Naor, M. Naor, and J.B. Lotspiech, “Revocation
and Tracing Schemes for Stateless Receivers,” Proc.
Ann. Int’l Cryptology Conf.Advances in Cryptology
(CRYPTO), pp. 41-62, 2001.
[11] D. Boneh and M. Franklin, “Identity-Based
Encryption from the Weil Pairing,” Proc. Int’l
Cryptology Conf. Advances in Cryptology
(CRYPTO), pp. 213-229, 2001.
[12] D. Boneh, X. Boyen, and H. Shacham, “Short Group
Signature,” Proc. Int’l Cryptology Conf. Advances in
Cryptology (CRYPTO), pp. 41-55, 2004.
[13] D. Boneh, X. Boyen, and E. Goh, “Hierarchical
Identity Based Encryption with Constant Size
Ciphertext,” Proc. Ann. Int’l Conf.Theory and
Applications of Cryptographic Techniques
(EUROCRYPT), pp. 440-456, 2005.
[14] C. Delerablee, P. Paillier, and D. Pointcheval, “Fully
Collusion Secure Dynamic Broadcast Encryption with
Constant-Size Ciphertexts or Decryption Keys,” Proc.
First Int’l Conf. Pairing-Based Cryptography, pp. 39-59,
2007.
[15] D. Chaum and E. van Heyst, “Group Signatures,”
Proc. Int’l Conf.Theory and Applications of
Cryptographic Techniques (EUROCRYPT),pp. 257-265,
1991.
[16] A. Fiat and M. Naor, “Broadcast Encryption,” Proc.
Int’l Cryptology Conf. Advances in Cryptology
(CRYPTO), pp. 480-491, 1993.
[17] B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large
Groups in the Cloud,” Proc. 10th Int’l Conf. Applied
Cryptography and Network Security, pp. 507-525,
2012.
[18] C. Wang, Q. Wang, K. Ren, and W. Lou, “PrivacyPreserving Public Auditing for Data Storage Security
in Cloud Computing,”Proc. IEEE INFOCOM, pp. 525-
533, 2010.
[19] B. Sheng and Q. Li, “Verifiable Privacy-Preserving
Range Query in Two-Tiered Sensor Networks,” Proc.
IEEE INFOCOM, pp. 46-50, 2008.
[20] D. Boneh, B. Lynn, and H. Shacham, “Short
Signature from the Weil Pairing,” Proc. Int’l Conf.
Theory and Application of Cryptology and Information
Security: Advances in Cryptology, pp. 514-532,2001

Currently there are no Refbacks

Paper Title : Network Life Time Prolonged Energy Efficient Routing In Adhoc Networks
Authors : Barma Udayashanth Kumar, Dr.S.Prem Kumar,
Affiliations : M.Tech Research Scholar
Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

– Energy aware routing algorithms called Reliable Minimum Energy Cost Routing and Reliable Minimum Energy Routing (RMER) are proposed for wireless adhoc networks. RMECR defines the requirements of adhoc networks like energy-efficiency, reliability, reliability and prolonging the network lifetime. It consider energy consumption and the remaining battery energy of the nodes. RMER finds routes minimizing the total energy required for end to end packet traversal. RMECR and RMER both ensure reliability using hop by hop or end to end packet retransmission. Energy consumed by processing elements of transceivers, limited no of transmission allowed per packet, packet size, the impact of acknowledgement packet are considered in wireless adhoc network.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Energy-aware routing, battery-aware routing, end-to-end and hop-by-hop retransmission, reliability, wireless ad hoc network

Barma Udayashanth Kumar,Dr.S.Prem Kumar."Network Life Time Prolonged Energy Efficient Routing In Adhoc Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 05,pp.285-288, NOVEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I54.pdf,

[1] M. Senel, K. Chintalapudi, D. Lal, A.
Keshavarzian, and E. Coyle, “A Kalman Filter
Based Link Quality Estimation Scheme for
Wireless Sensor Networks,” Proc. IEEE Global
Telecomm. Conf. (GlobeCom ’07), pp. 875-880,
Nov. 2007.
[2] Q. Wang, M. Hempstead, and W. Yang, “A
Realistic Power Consumption Model for Wireless
Sensor Network Devices,” Proc. Third Ann. IEEE
Comm. Soc. Sensor and Ad Hoc Comm. and
Networks (SECON ’06), pp. 286-295, Sept. 2006.
[3] A. Misra and S. Banerjee, “MRPC: Maximizing
Network Lifetime for Reliable Routing in Wireless
Environments,” Proc. IEEE Wireless Comm. and
Networking Conf. (WCNC ’02), pp. 800-806, 2002.
[4] C. Perkins, P. Bhagwat: Highly dynamic
Destination-Sequenced Distance-Vector routing
(DSDV) for mobile computers. Proceedings of
ACM SIGCOMM, August 1994.
[5] K. Fall, K. Varadhan: The ns Manual (formerly
ns Notes and Documentation). The VINT Project,
A Collaboration between researchers at UC
Berkeley, LBL, USC/ISI and Xerox PARC.
[6] X.-Y. Li, Y. Wang, H. Chen, X. Chu, Y. Wu, and
Y. Qi, “Reliable and Energy-Efficient Routing for
Static Wireless Ad Hoc Net- works with Unreliable
Links,” IEEE Trans. Parallel and Distributed
Systems, vol. 20, no. 10, pp. 1408-1421, Oct. 2009.
[7] A. El Gamal, C. Nair, B. Prabhakar, E. UysalBiyikoglu, and S. Zahedi. Energy-effcient
Scheduling of Packet Transmissions over Wireless
Networks. In Proceedings of IEEE Infocom, June
2002
[8]Dinesh
RatanGautam,SanjeevSharma,SantoshSahu,”
Enhanced Transmission Power Control Mechanism
based on RSSI for MANET” International Journal
of Computer Applications (0975 – 8887) Volume
28– No.1, August 2011 25.
*9+ C. Toh, “Maximum Battery Life Routing to
Support Ubiquitous Mobile Computing in Wireless
Ad Hoc Networks,” IEEE Comm. Magazine, vol.
39, no. 6, pp. 138-147, June 2001.
[10] Woesner H, Ebert J-P, Schlager M, Wolisz A.
Power-Saving Mechanisms in Emerging Standards
for Wireless LANs: The MAC Level Perspective.
IEEE Personal Communications 1998; 5(3): 40-48
[11] J.-H. Chang and L. Tassiulas, “Maximum
Lifetime Routing in Wireless Sensor Networks,”
IEEE/ACM Trans. Networking, vol. 12, no. 4, pp.
609-619, Aug. 2004.
[12] A. Michail and A. Ephremides, “A distributed
routing algorithm for supporting connectionoriented service in wireless networks with timevarying connectivity,” in Proceedings Third IEEE
Symposium on Com- puters and Communications,
ISCC’98, Athens, Greece, June 1998, pp. 587–591.

Currently there are no Refbacks

Paper Title : PABKE: Provable Attribute-based Keyword explore over Outsourced Encrypted Data
Authors : G Pavan Kumar, Korathala Sreekanth Reddy, Chittem Raviteja
Affiliations : Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Cloud Computing has changed the phenomena of IT industry completely. It allows access to highly scalable, inexpensive, on demand computing resources that can execute the code and store data that are provided. But adoption and approach to cloud computing applies only if the security is ensured. Cloud computing is lacking in security, confidentiality and visibility. Secure the cloud means to secure the storage. Security is achieved by the encryption. There are various encryption standards to ensure the cloud security. Attribute-based encryption (ABE) is public key encryption technique that allows users to encrypt and decrypt messages based on user attributes. In a typical implementation, the size of the cipher text is proportional to the number of attributes associated with it and the decryption time is proportional to the number of attributes used during decryption. To reduce the decryption time in cloud outsourced decryption technique is used. By providing a transformation key to the cloud ABE cipher text is converted into simple cipher text and it only incurs a small computational overhead for the user to recover the plaintext from the transformed ciphertext.. To ensure that transformation performed by cloud server is correct and the data is not modified by the untrusted servers proposed system is introduced. This provides secured and Verifiable Outsourced decryption.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Attribute Based Encryption, Ciphertext Policy Attribute Based Encryption, Cloud Computing, Key Policy Attribute Based Encryption.

G Pavan Kumar,Korathala Sreekanth Reddy,Chittem Raviteja,Shaik Mohammed Arif."PABKE: Provable Attribute-based Keyword explore over Outsourced Encrypted Data". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 05,pp.271-276, NOVEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I52.pdf,

1. Kui Ren, Cong Wang, and Qian Wang, “Security
Challenges for the Public Cloud”, Internet Computing,
IEEE, Vol. 16, Issue 1,Jan.-Feb. 2012.
2. Y. Lu and G. Tsudik, “Privacy-Preserving Cloud
Database Querying”, Journal of Internet Services and
Information Security (JISIS), Vol. 1, No. 4, November
2011.
3. Siani Pearson, Yun Shen, Miranda Mowbray, “A
Privacy Manager for Cloud Computing”, First
International Conference, CloudCom 2009, Beijing,
China, December 1-4, 2009. Proceedings
4. Jian Wang, Yan Zhao, Shuo Jiang, Jiajin Le,
“Providing privacy preserving in cloud computing”,
Test and Measurement, vol. 2, ICTM '09, International
Conference, 2009.
5. Miao Zhou , Yi Mu , Willy Susilo , Jun Yan , Liju
Dong, “Privacy enhanced data outsourcing in the cloud,
Journal of Network and Computer Applications”, vol.
35, issue 4, pp. 1367–1373, 2012.
6. Qin Liu, Guojun Wang, Jie Wu, “Secure and privacy
preserving keyword searching for cloud storage
services”, Journal of Network and Computer
Applications, vol. 35, pp. 927–933, 2012.
7. Haibo Hu, Jianliang Xu , Chushi Ren , Byron Choi,
“Processing private queries over untrusted data cloud
through privacy homomorphism” , Data Engineering
(ICDE), 2011.
8. Marten Van Dijk, Ari Juels, “On the Impossibility of
Cryptography Alone for Privacy-Preserving Cloud
Computing”, IACR Cryptology eprint Archive, 2010.
9. Dr. Alexander Benlian, Prof. Dr. Thomas Hess, Prof.
Dr. Peter Buxmann, “Drivers of SaaS-Adoption – An
Empirical Study of Different Application Type”,
Business & Information Systems Engineering, Vol. 1,
Issue 5, pp 357-369, October 2009.
10. Shucheng Yu Cong Wang, Kui Ren , Wenjing Lou,
“Achieving Secure, Scalable, and Fine-grained Data
Access Control in Cloud Computing”, INFOCOM, 2010
Proceedings IEEE.
11. Vipul Goyal,Omkant Pandey, Amit Sahai, Brent
Waters , “Attribute-Based Encryption for Fine-Grained
Access Control of Encrypted Data”, Proceeding CCS '06
Proceedings of the 13th ACM conference on Computer
and communications security Pages 89 - 98 ,ACM New
York, NY
12. John Bethencourt, Amit Sahai, Brent Waters,
“Ciphertext-Policy Attribute-Based Encryption, Security
and Privacy”, 2007.
13. M. Green, S. Hohenberger, and B. Waters,
“Outsourcing the decryptionof ABE ciphertexts,” in
Proc. USENIX Security Symp., San Francisco, CA, USA,
2011.
14. Junzuo Lai, Robert H. Deng, Chaowen Guan, and
Jian Weng, “Attribute-Based Encryption With Verifiable
Outsourced Decryption”, IEEE Transaction on
Information Forensics and Security, vol. 8, no. 8, August
2013

Currently there are no Refbacks

Paper Title : Two Layer Encryption be Imminent to Protected Data Sharing in Cloud Computing
Authors : V.VIDYA, K.PADMA KIRAN, C.VANI
Affiliations : Department of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Cloud computing is a emerging paradigm of computing in IT because of its performance ,low cost ,availability accessibility ,economy of scale, on-demand and other luxuries. Data is the most valuable of clients (or) company’s asset; it must be protected with much vigilance than any other. Data Security in cloud is one of the big issue which acts as obstacle in the implementation of cloud computing. In this paper we proposed scheme is „Two Layer Encryption‟ means Double Encryption for securely outsourcing the data in cloud. This scheme solves key escrow problem and Data Reveal problem by RSA algorithm of asymmetric key approach. In existing mCL-PKE scheme there is Certificate-less Encryption and also single encryption. In our proposed scheme we have two layer encryption schemes by this approach the data/information will be highly secured while preserving and sharing in cloud environment.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud computing, Data security, Decryption center, RSA algorithm, cloud computing, Asymmetric key, Two Layer Encryption.

V.VIDYA,K.PADMA KIRAN,C.VANI,K.TARAKESWAR."Two Layer Encryption be Imminent to Protected Data Sharing in Cloud Computing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 05,pp.266-270, NOVEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I51.pdf,

[1]. Mohamed Nabeel, Elisa Bertino, Seung-Hyun Seo,
Xiaoyu‖ Ding‖ Members‖ of‖ IEEE‖ ‚An‖ Efficient‖
Certificate-less Encryption for Secure Data Sharing in
Public‖Clouds‛‖June‖2013.‖
[2]. Zhiguo Wan, Jun‟ e Liu and Robert H. Deng.
Senior‖ Member,‖ IEEE‖ ‚HASBE:‖ A‖ Hierarchical‖
Attribute-Based Solution for Flexible and Scalable
Access‖Control‖in‖Cloud‖Computing‛‖April‖2012.‖
[3]. Mohamed Nabeel, Student Member, IEEE, Ning
Shang, Elisa Bertino‖Fellow,‖ IEEE‖‚Privacy‖Preserving‖
Policy‖Based‖Content‖Sharing‖in‖Public‖Clouds‛‖2013.‖
[4]. Mohamed Nabeel, Elisa Bertino Fellow, IEEE
‚Privacy‖ Preserving‖ Delegated‖ Access‖ Control‖ in‖
Public‖Clouds‛‖2013.‖
[5]. Yang Tang, Patrick P.C. Lee, Member, IEEE, John
C.S. Lui, Fellow, IEEE, and Radia Perlman, Fellow,
IEEE‖ ‚Secure‖ Overlay‖ Cloud‖ Storage‖ With‖ Access‖
Control‖ and‖ Assured‖ Deletion‛‖ November/December‖
2012.
[6]. Sushmita Ruj, CSE, Indian Institute of Technology,
Indore, India, Milos Stojmenovic, Singidunum
University, Belgrade, Serbia, Amiya Nayak, SEECS,
University‖ of‖ Ottawa,‖ Canada,‖ ‚Decentralized‖ Access‖
Control with Anonymous Authentication of Data
Stored‖in‖Clouds‛‖2013.‖
[7]. Smitha Sundareswaran, Anna C. Squicciarini,
Member,‖ IEEE,‖ and‖ Dan‖ Lin,‖ ‚Ensuring Distributed
Accountability‖ for‖ Data‖ Sharing‖in‖ the‖ Cloud‛‖March‖
2012.
[8]. Junzuo Lai, Robert H. Deng, Chaowen Guan, and
Jian‖ Weng‖ ‚Attribute- Based Encryption with
Verifiable‖Outsourced‖Decryption‛‖2013.
[9] Veerraju Gampala, Srilakshmi Inuganti, Satish
Muppidi‖ ―Data‖ Security‖ in‖ Cloud‖ Computing‖ with‖
Elliptic‖Curve‖Cryptography‖‖ International‖ Journal‖of‖
Soft Computing and Engineering (IJSCE) ISSN: 2231-
2307, Volume-2, Issue-3, July 2012. [11] N. Koblitz.
Elliptic curve cryptosystems. Mathematics of
Computation, 48:203–209,1987.
[10] V. Miller. Use of elliptic curves in cryptography.
Advances in Cryptology—CRYPTO‖ ‘85‖ (LNCS‖ 218)‖
[483], 417– 426, 1986.

Currently there are no Refbacks

 


Paper Title : Advance EMAP for Vehicular Ad Hoc Networks
Authors : Pocha Nageswara Reddy , I.S.Raghuram, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

A Vehicular Ad hoc Network (VANET) is a sort of mobile Peer-To-Peer wireless network that permits giving communication among adjacent vehicles and in the middle of vehicles and close-by settled roadside gear. The absence of concentrated framework, high node portability and expanding number of vehicles in VANET bring about a few issues examined in this paper, for example, interfering with associations, troublesome routing, security of correspondences and adaptability. Existing framework for VANET correspondence is demonstrated to have a few disadvantages. We have proposed a component so as to give secure and effective communication in VANET environment. We conquer the disadvantages of the current framework by utilizing Malicious Vehicular Analyzer algorithm and Elliptic Curve Cryptography (ECC). Utilizing these algorithms, vindictive messages are recognized. It likewise recognizes the mishap and different issues in the way of the vehicles. Elliptic Curve Cryptography (ECC) calculation is utilized for stronger security amid correspondence.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


emergency messages, VANET security, vehicular analyzer, warning messages.

Pocha Nageswara Reddy ,I.S.Raghuram,Dr.S.Prem Kumar."Advance EMAP for Vehicular Ad Hoc Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.253-258, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I415.pdf,

[1] P. Papadimitratos, A. Kung, J. P. Hubaux, and F.
Kargl, “Privacy and identity management for
vehicular communication systems: a position paper,”
Proc. Workshop on Standards for Privacy in UserCentric Identity Management, Zurich, Switzerland,
July 2006.
[2] K. Sampigethaya, L. Huang, M. Li, R. Poovendran,
K. Matsuura, and K. Sezaki, “CARAVAN: Providing
location privacy for VANET,” Proc. Embedded
Security in Cars (ESCAR), November 2005.
[3] A. Wasef, Y. Jiang, and X. Shen, “DCS: An efficient
distributed certificate service scheme for vehicular
networks,” IEEE Trans. on Vehicular Technology, vol.
59, pp. 533–549, 2010.
[4] M. Raya and J.-P. Hubaux, “Securing vehicular ad
hoc networks,” Journal of Computer Security, vol. 15,
no. 1, pp. 39–68, 2007.
[5] “US bureau of transit statistics.” *Online+.
Available: http://en.wikipedia.org/wiki/Passenger
vehicles in the United States
[6] J. J. Haas, Y. Hu, and K. P. Laberteaux, “Design
and analysis of a lightweight certificate revocation
mechanism for VANET,” Proc. 6th ACM international
workshop on VehiculAr InterNETworking, pp. 89–98,
2009.
[7] “IEEE trial-use standard for wireless access in
vehicular environments - security services for
applications and management messages,” IEEE Std
1609.2-2006, 2006.
[8] “5.9 GHz DSRC.” *Online+. Available:
http://grouper.ieee.org/groups/scc32/dsrc/index.html.
[9]A. Wasef and X. Shen, “MAAC: Message
authentication acceleration protocol for vehicular ad
hoc networks,” Proc. IEEE GLOBECOM’09, 2009.
[10] J. P. Hubaux, “The security and privacy of smart
vehicles,” IEEE Security and Privacy, vol. 2, pp. 49–55,
2004.
[11] A. Studer, E. Shi, F. Bai, and A. Perrig, “TACKing
together efficient authentication, revocation, and
privacy in VANETs,” Proc. SECON ’09, pp. 1–9, 2009.
[12] M. Raya, P. Papadimitratos, I. Aad, D. Jungels,
and J.-P. Hubaux, “Eviction of misbehaving and
faulty nodes in vehicular networks,” IEEE Journal on
Selected Areas in Communications, vol. 25, pp. 1557–
1568, 2007.
[13] P. P. Papadimitratos, G. Mezzour, and J. Hubaux,
“Certificate revocation list distribution in vehicular
communication systems,” Proc. 5th ACM
international workshop on VehiculAr InterNETworking, pp. 86–87, 2008.
[14] K. P. Laberteaux, J. J. Haas, and Y. Hu, “Security
certificate revocation list distribution for VANET,”
Proc. 5th ACM international workshop on VehiculAr
Inter-NETworking, pp. 88–89, 2008.
[15] H. Chan, A. Perrig, and D. Song, “Random key
predistribution schemes for sensor networks,” Proc.
2003 IEEE Symposium on Security and Privacy, pp.
197–213, 2003.

Currently there are no Refbacks

Paper Title : An authority: Merchant Lock in to Meta storage
Authors : Shaik Murthujavali, P.Kiranrao, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

-Expense and versatility advantages of Cloud storage administrations are evident. Notwithstanding, selecting a solitary storage service provider limits accessibility and versatility to the chose supplier and may further cause a merchant lock basically. In this paper, we introduce Meta Storage Capacity, an unified Cloud storage framework that can incorporate differing Cloud storage suppliers. Meta storage Capacity is a very accessible and versatile circulated hash table that imitates information on top of assorted storage service. Meta Capacity reuses instruments from Amazon's Dynamo for cross-supplier replication and thus acquaints a novel methodology with oversee consistency-inactivity tradeoffs by amplifying the customary majority (N; R; W) configurations to an (np; R; W) conspire that incorporates distinctive providers as an extra measurement. With Metastorage, new means to control consistency-inertness tradeoffs are presented.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Merchant Lock, Meta storage, Meta Storage Nodes

Shaik Murthujavali,P.Kiranrao,Dr.S.Prem Kumar."An authority: Merchant Lock in to Meta storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.245-252, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I414.pdf,

[1] A. Lenk, M. Klems, J. Nimis, S. Tai, and T.
Sandholm, “What’s inside the Cloud? An
architectural map of the Cloud landscape,” in
Software Engineering Challenges of Cloud
Computing, 2009. CLOUD’09. ICSE Workshop on.
IEEE, 2009, pp. 23–31.
[2] C. Baun, M. Kunze, J. Nimis, and S. Tai,Cloud
Computing: Web-basierte dynamische IT-Services,
ser. Informatik im Fokus. Berlin:Springer, 2010.
[3] G. DeCandia, D. Hastorun, M. Jampani, G.
Kakulapati, A. Lakshman,A. Pilchin, S.
Sivasubramanian, P. Vosshall, and W. Vogels,
“Dynamo:amazon’s highly available key value store,”
inProc. SOSP, 2007
[4] M. Welsh, D. Culler, and E. Brewer, “SEDA:
architecture forwell-conditioned, scalable Internet services,”ACM SIGOPS OperatingSystems Review,
vol. 35, no. 5, pp. 230–243, 2001.
[5] S. Garfinkel, “An Evaluation of Amazon’s Grid
Computing Services:EC2, S3, and SQS,” inCenter for.
Citeseer, 2007
[6] A. T. Velte, T. J. Velte, and R. Elsenpeter,Cloud
Computing: A Practical Approach. Upper Saddle
River, NJ: McGraw-Hill, 2010.
[7] D. Nurmi, R. Wolski, C. Grzegorczyk, G. Obertelli,
S. Soman, L. Yous-eff, and D. Zagorodnov, “The
eucalyptus open-source cloud-computing system,” in
Proceedings of the 2009 9th IEEE/ACM International
Symposium on Cluster Computing and the Grid.
IEEE, 2009, pp.124–13
[8] N. Chohan, C. Bunch, S. Pang, C. Krintz, N.
Mostafa, S. Soman,and R. Wolski, “Appscale: Scalable
and open appengine applicationdevelopment and
deployment,”First International Conference on
CloudComputing, 2009.
[9] A. Lakshman and P. Malik, “Cassandra: a
decentralized structuredstorage system,”ACM
SIGOPS Operating Systems Review, vol. 44, no. 2,pp.
35–40, 2010.
[10] R. Thomas, “A majority consensus approach to
concurrency controlfor multiple copy databases,”
ACM Transactions on Database Systems(TODS), vol.
4, no. 2, pp. 180–209, 1979
[11] D. Karger, E. Lehman, T. Leighton, R. Panigrahy,
M. Levine, andD. Lewin, “Consistent hashing and
random trees: Cloud cachingprotocols for relieving
hot spots on the World Wide Web,” in Proceedings of
the twenty-ninth annual ACM symposium on Theory
ofcomputing. ACM, 1997, pp. 654–663.
[12] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and
H. Balakrishnan,“Chord: A scalable peer-to-peer
lookup service for internet applications, “in
Proceedings of the 2001 conference on Applications,
technologies, architectures, and protocols for
computer communications. ACM, 2001,pp. 149–160.
[13] J. Elson and J. Howell, “Handling flash crowds
from your garage,”in USENIX 2008 Annual Technical
Conference on Annual TechnicalConference. USENIX
Association, 2008, pp. 171–184.
[14] S. Bourne, “A conversation with Bruce
Lindsay,”Queue, vol. 2, no. 8,pp. 22–33, 2004.
[15] T. Chandra, R. Griesemer, and J. Redstone,
“Paxos made live: anengineering perspective,”
inProceedings of the twenty-sixth annual
ACMsymposium on Principles of Cloud computing.
ACM, 2007, pp.398–407
[16] L. Lamport, “The part-time parliament,”ACM
Transactions on ComputerSystems (TOCS), vol. 16,
no. 2, pp. 133–169, 1998
[17] H. Weatherspoon, P. Eaton, B. Chun, and J.
Kubiatowicz, “Antiquity:exploiting a secure log for
wide-area Cloud storage,”ACM SIGOPSOperating
Systems Review, vol. 41, no. 3, pp. 371–384, 2007.
[18] M. Burrows, “The Chubby lock service for
loosely-coupled Cloudsystems,” in Proceedings of the
7th symposium on Operating systemsdesign and
implementation. USENIX Association, 2006, pp. 335–
350.
[19] A. Adya, W. Bolosky, M. Castro, G. Cermak, R.
Chaiken, J. Douceur,J. Howell, J. Lorch, M. Theimer,
and R. Wattenhofer, “FARSITE:Federated, available,
and reliable storage for an incompletely
trustedenvironment,”ACM SIGOPS Operating
Systems Review, vol. 36, no. SI, pp. 1–14, 2002
[20] K. Bowers, A. Juels, and A. Oprea, “HAIL: A
high-availability andintegrity layer for cloud
storage,” in Proceedings of the 16th ACMconference
on Computer and communications security. ACM,
2009,pp. 187–198.
[21] J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski,
P. Eaton, D. Geels,R. Gummadi, S. Rhea, H.
Weatherspoon, C. Wellset al., “Oceanstore: An
architecture for global-scale persistent storage,”ACM
SIGARCH Computer Architecture News, vol. 28, no.
5, pp. 190–201, 2000
[22] Google, Datastore Performance Growing Pains.
Google, Jun.2010, (accessed on December 4, 2010).
[Online]. Available:
http://googleappengine.blogspot.com/2010/06/datasto
re-perfor mance-growing-pains.html
[23] C. Bunch, N. Chohan, C. Krintz, J. Chohan, J.
Kupferman, P. Lakhina,Y. Li, and Y. Nomura, “An
evaluation of Cloud datastores using the appscale
cloud platform,” in Cloud Computing (CLOUD),
2010 IEEE3rd International Conference on, 2010, pp.
305 –312
[24] Broberg, Buyya, and Tari, “Creating a Cloud
Storage Mashup forHigh Performance, Low Cost
Content Delivery,” inService-OrientedComputing–
ICSOC 2008 Workshops. Springer, 2009, pp. 178–183.
[25] J. Broberg, R. Buyya, and Z. Tari, “MetaCDN:
Harnessing ’StorageClouds’ for high performance
content delivery,”Journal of Network andComputer
Applications, vol. 32, no. 5, pp. 1012–1022, 2009
[26] H. Abu-Libdeh, L. Princehouse, and H.
Weatherspoon, “RACS: a casefor cloud storage
diversity,” in Proceedings of the 1st ACM
symposiumon Cloud computing. ACM, 2010, pp.
229–240.
[27] H. Weatherspoon and J. Kubiatowicz, “Erasure
coding vs. replication:A quantitative
comparison,”Peer-to-Peer Systems, pp. 328–337, 2002.
[28] W. Vogels, Eventually Consistent - Revisited,
Dec. 2008,(accessed on October 19, 2010). [Online].
Available:http://www.allthingsCloud.com/2008/12/ev
entually _consistent.html

Currently there are no Refbacks

Paper Title : Well-Organized Security Solution for Privacy Preserving Cloud Services
Authors : M.Asma Farheen, M.Manasa, B.Ragalatha
Affiliations : Department of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

The cloud computing could be a new computing model that comes from grid computing, distributed computing, parallel computing, virtualization technology, utility computing and alternative laptop technologies during this paper, we have a tendency to present a unique privacy-preserving security resolution for cloud services. We have a tendency to wear down user identification and secure communication. Our resolution provides solely registered users to access cloud services. Our resolution offers anonymous authentication. This implies that users’ personal attributes (age, valid registration, and successful payment) may be proved while not revealing users’ identity. Our resolution offers secure communication of transmitted information.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud Service Provider, RSA public key, privacy-enhancing technologies (PET’s), standards development organizations (SDOs)

M.Asma Farheen,M.Manasa,B.Ragalatha,Ms. K.Lakshmi."Well-Organized Security Solution for Privacy Preserving Cloud Services". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.240-244, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I413.pdf,

[1] Y. Chen and R. Sion, ‚On securing untrusted clouds
with cryptography,‛ in Proceedings of the 9th annual
ACM workshop on Privacy in the electronic society.
ACM, 2010, pp. 109–114.
[2] R. Laurikainen, ‚Secure and anonymous
communication in the cloud,‛ Aalto University School of
Science and Technology, Department of Computer
Science and Engineering, Tech. Rep. TKK-CSE-B10, 2010.
[3] Sushmita Ruj, Milos Stojmenovic and Amiya Nayak,
‚Privacy Preserving Access Control with Authentication
for Securing Data in Clouds‛in proceedings of the 12th
IEEE/ACM International Symposium on Cluster, Cloud
and Grid Computing 
[4] Debajyoti Mukhopadhyay, Gitesh Sonawane, Parth
Sarthi Gupta,Sagar Bhavsar, Vibha Mittal.‛ Enhanced
Security for Cloud Storage using File Encryption‛
Department of Information Technology Maharashtra
Institute of Technology
[5] Kawser Wazed Nafi1,2, Tonny Shekha Kar2, Sayed
Anisul Hoque3,Dr. M. M. A Hashem4, ‚ A Newer User
Authentication, File encryption and Distributed Server
Based Cloud Computing security architecture‛in
proceeding of the (IJACSA) International Journal of
Advanced Computer Science and Applications, Vol. 3,
No. 10, 2011
[6] Du meng.‛ Data security in cloud computing‛ in yhe
proceeding of the The 8th International Conference on
Computer Science & Education (ICCSE 2013) April 26-28,
2013. Colombo, Sri Lanka
[7] Hamid Banirostam, Alireza Hedayati, Ahmad
Khadem Zadeh and Elham Shamsinezhad.‛ A Trust
Based Approach for Increasing ecurity in Cloud
Computing Infrastructure‛ 2013 UKSim 15th
International Conference on Computer Modelling and
Simulation

Currently there are no Refbacks

Paper Title : Cloud-Based Novel Mobile Social TV (CloudmoV)
Authors : M.Sri Devi, G.Sushmitha Vardana, C.Kavitha
Affiliations : Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

In this era of information and technology, two technologies became integral part of our lives, well at least for the younger or tech savvy generation, mobile phones and social media. Such is the power of these two, that business were forces to integrate these in their marketing and customer support strategies. Social media has become a place for today’s customer to hangout, so it has also become a place for today’s enterprises to advertise their products. From cosmetics to films everyone has a presence on the social network. In this paper, we propose the design of a Cloud-based, novel Mobile social TV system (CloudMoV). The system effectively utilizes both PaaS (Platform-as-a-Service) and IaaS (Infrastructureas-a- Service) cloud services to offer These various designs for flexible transcoding capabilities, battery efficiency of mobile devices and spontaneous social interactivity together provide an ideal platform for mobile social TV services. These various designs for flexible transcoding capabilities, battery efficiency of mobile devices and spontaneous social interactivity together provide an ideal platform for mobile social TV services.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud-based novel Mobile social TV, SMAC, Transcoding, Encoding flexibility.

M.Sri Devi,G.Sushmitha Vardana,C.Kavitha,P.Rama Rao."Cloud-Based Novel Mobile Social TV (CloudmoV)". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 04,pp.235-239, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I412.pdf,

[1] M. Satyanarayanan, P. Bahl, R. Caceres, and N.
Davies, “The case for VM-based Cloudlets in mobile
computing,” IEEE Pervasive Comput., vol. 8, pp. 14–23,
2009.
[2] S. Kosta, A. Aucinas, P. Hui, R. Mortier, and X.
Zhang, “Thinkair: Dynamic resource allocation and
parallel execution in the cloud for mobile code
offloading,” in Proc. IEEE INFOCOM, 2012.
[3] Z. Huang, C. Mei, L. E. Li, and T. Woo,
“Cloudstream: Delivering high-quality streaming
videos through a cloud-based SVC proxy,” in Proc.
INFOCOM‟ 11, 2011, pp. 201–205.W.-K. Chen, Linear
Networks and Systems (Book style). Belmont, CA:
Wadsworth, 1993, pp. 123–135.
[4] T. Coppens, L. Trappeniners, and M. Godon,
“AmigoTV: Towards a social TV experience,” in Proc.
EuroITV, 2004.
[5] N. Ducheneaut, R. J. Moore, L. Oehlberg, J. D.
Thornton, and E.Nickell, “Social TV: Designing for
distributed, sociable television viewing,” Int. J. HumanComput. Interaction, vol. 24, no. 2, pp.136–
154, 2008.
[6] A. Carroll and G. Heiser, “An analysis of power
consumption in as smartphone,” in Proc. USENIXATC,
2010.
[7] What is 100% Pure Java. [Online]. Available:
http://www.javacoffeebreak. com/faq/faq0006.html.
[8] J. Santos, D. Gomes, S. Sargento, R. L. Aguiar, N.
Baker, M. Zafar, and A. Ikram, “Multicast/broadcast
network convergence in next generation mobile
networks,” Comput. Netw., vol. 52, pp. 228–247, Jan.
2008.
[9] DVB-H. [Online]. Available: http://www.dvb-h.org/.
[10] K. Chorianopoulos and G. Lekakos, “Introduction
to social TV: Enhancing the shared experience with
interactive TV,” Int. J. Human- Comput. Interaction,
vol. 24, no. 2, pp. 113–120, 2008.
[11] M. Chuah, “Reality instant messaging: Injecting a
dose of reality into online chat,” in CHI ‟ 03 Extended
Abstracts on Human Factors in Computing Syst., 2003,
ser. CHI EA ‟ 03, pp. 926–927.

Currently there are no Refbacks

Paper Title : Cloud Supported Personal Health Records with Security and Audit ability
Authors : Sree Sai Rajesh C, Syed Mohammed Nadeem, Vajjala Revanth Kumar
Affiliations : Department Of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

convinced by the security issues, checking the selection of online medicinal services frameworks and the wild achievement of cloud administration models, we propose to incorporate security with mobile healthcare frameworks with the assistance of the private cloud. Our framework offers notable peculiarities including productive key administration, security protecting information storage, and recovery, particularly for recovery at crises, and review capacity for abusing wellbeing information. Particularly, we propose to incorporate key administration from pseudorandom number generator for unlink capacity, a safe indexing system for protection protecting pivotal word seek which conceals both pursuit and access examples focused around repetition, and coordinate the idea of trait based encryption with limit marking for giving part based access control with review capacity to avoid potential mischief, in both ordinary and crisis cases.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


-Individual health records; cloud computing; data privacy; fine-grained access control; attribute-based encryption, secure sharing, Searchable Symmetric Encryption.

Sree Sai Rajesh C,Syed Mohammed Nadeem,Vajjala Revanth Kumar,R.Varaprasad."Cloud Supported Personal Health Records with Security and Audit ability". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.230-234, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I411.pdf,

[1] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
“Attribute-Based Encryption for Fine-Grained Access
Control of Encrypted Data,”Proc. 13th ACM Conf.
Computer and Comm. Security (CCS ‟ 06),pp. 89-98,
2006.
[2] Ming LiShucheng Yu, Yao Zheng,Kui Ren, and
Wenjing Lou, “Scalable and Secure Sharing of Personal
Health Records in Cloud Computing Using AttributeBased Encryption”, IEEE transactions on parallel and
distributed systems, vol. 24, no. 1, january 2013.
[3] Y. Zheng, “Privacy-Preserving Personal Health
Record System Using Attribute-Based Encryption”,
master‟ s thesis, Worcester Polytechnic Inst., 2011.
[4] L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, and W.
Jonker, “Ciphertext-Policy Attribute-Based Threshold
Decryption with Flexible Delegation and Revocation of
User Attributes”, 2009.
[5] S. Yu, C. Wang, K. Ren, and W. Lou, “Attribute
Based Data Sharing with Attribute Revocation,” Proc.
Fifth ACM Symp. Information, Computer and Comm.
Security (ASIACCS ‟ 10), 2010.
[6] S. Narayan, M. Gagne´, and R. Safavi-Naini,
“Privacy Preserving EHR System Using AttributeBased Infrastructure”, Proc. ACM Cloud Computing
Security Workshop (CCSW ‟ 10), pp. 47-52, 2010.
[7] J. Bethencourt, A. Sahai, and B. Waters, “CiphertextPolicy Attribute-Based Encryption”, Proc. IEEE Symp.
Security and Privacy (SP ‟ 07), pp. 321-334, 2007.
[8] Q.Wang et al.,“Enabling Public Verifiability and
Data Dynamics for Storage Security in Cloud
Computing,” Proc. ESORICS „09, Sept. 2009, pp. 355–
70.
[9] S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving
secure, scalable, and fine-grained data access control in
cloud computing,” in IEEE INFOCOM‟ 10, 2010.
[10] A. Boldyreva, V. Goyal, and V. Kumar, “Identitybased encryption with efficient revocation,” in ACM
CCS, ser. CCS ‟ 08, 2008, pp.417–426.
[11] J. Hur and D. K. Noh, “Attribute-based access
control with efficient revocation in data outsourcing
systems,” IEEE Transactions on Parallel and
Distributed Systems, vol. 99, no. PrePrints, 2010
[12] J. Bethencourt, A. Sahai, and B.
Waters,“Ciphertext-policy attribute-based encryption,”
in IEEE S& P ’07, 2007, pp. 321–334.
[13] Melissa Chase “Multi-authority Attribute based
Encryption,” Computer Science Department Brown
University Providence, RI 02912 

Currently there are no Refbacks

Paper Title : Data sets preparing for Data mining analysis by SQL Horizontal Aggregation
Authors : V.Nikitha, P.Jhansi, K.Neelima
Affiliations : Department Of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Data mining is essentially employed in getting ready information sets for data processing analysis. However it's most time overwhelming method. It needs great deal of manual effort. Data processing is essentially used domain for obtaining the patterns from historical info or keep info. Great deal of effort is needed to arrange datasets that will be input for data processing algorithmic program. As we tend to have already got some aggregation operate easy lay, MIN, SUM, COUNT, AVG that aren't economical for creating datasets in data processing analysis. This combination operate have disadvantage as they come single price single price per mass cluster in this table. In data processing analysis when we tend to needs information in horizontal layout that prong we need arduous effort. therefore we tend to are developing straightforward however powerful tool to urge SQL code to come combined columns in horizontal layout type, that returns cluster of varieties rather than one number per row. This new cluster of tool or operate is claimed to be horizontal aggregation. From third queries we'll get output information that is appropriate for varied data processing operations. It means that this paper provides horizontal aggregation victimization some constructs that embody SQL queries. Here we tend to are victimization 3 functions that is Grouping column, Horizontal column, combination column. Users need to provide this as input. So user gets the output that is appropriate for data processing analysis.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


PaaS, Private Cloud, Middleware, load balancing, resumption of work, E-learning.

V.Nikitha,P.Jhansi,K.Neelima,D.Anusha."Data sets preparing for Data mining analysis by SQL Horizontal Aggregation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.225-229, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I410.pdf,

[1]. PradeepKumar, Dr.R.V.Krishnaiah, IEEE,
”Horizontal Aggregations in SQL to Prepare Data Sets for
Data Mining Analysis” vol.2, ISSN: 2278-0661, ISBN:
2278-8727 Volume 6,PP 36-41,Nov - Dec. 2012.
[2]. Mohd Abdul Samad,Md. Riazur Rahman,Syed
Zahed,Mohd Abdul Fattah, International Journal of
Computer Applications in Engineering Sciences,
”Creation of Datasets for Data Mining Analysis by Using
Horizontal Aggregation in SQL” VOL III,ISSN: 2231-
4946, pp.46-51, March.2013
[3]. Karana Hanirex.D,Durka.C,International Journal of
Advanced Research in Computer Science and Software
Engineering, ”An Efficient Approach for Building
Dataset in Data Mining” Volume 3,ISSN: 2277,pp.156-
160,128X Issue 3, March 2013.
[4]. Carlos Ordonez, Zhibo Chen, University of
Houston”Horizontal Aggregations in SQL to Prepare
Data Sets for Data Mining Analysis”, pp.1-14.
[5]. Carlos Ordonez and Zhibo Chen, IEEE,”Horizontal
Aggregations in SQL to Prepare Datasets for Data
MiningAnalysis” VOL. 24, NO. 4, pp.678-691, APRIL
2012.
[6]. Mr.Prasanna M.Rathod Prof. Mrs. Karuna G.
Bagde,IJARCET”Workload Optimization by Horizontal
Aggregation in SQL for Data Mining Analysis” Volume
1, pp.144-147, Issue 8,October 2012.
[7]. Mrs Krishna Veni,Mr Ranjith Kumar
K,Int.J.Computer Technology Applications,, ”PREPARE
DATASETS FOR DATA MINING ANALYSIS BY USING

Currently there are no Refbacks

Paper Title : Privacy-Preserving Optimal Convention site Grit on Mobile Devices
Authors : Nadir Zeeshan, Y.Praveen Kumar, G.Arun Kumar
Affiliations : Department Of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

-Readied with dynamic sensible telephones and cell phones, today's greatly interconnected urban populace is more energetic about these gadgets to get ready and organize their day by day lives. Location-Sharing-Based Services (LSBS) supplement Area Based Administrations by exploitation areas from a gathering of clients, and not just people, to create some contextualized administration upheld the areas inside the group. Notwithstanding, there is a unit developing issues concerning the abuse of area data by outsiders that fills the need for a considerable measure of security controls in such administrations. We have a tendency to address the important disadvantage of protection LSBSs by giving sensible and elective answers for the security downside in one such administration, especially the fair rendezvous purpose (FRVP) determination administration. The privacy protective FRVP (PPFRVP) disadvantage is general enough and pleasantly catches the calculations and security necessities in LSBs. Among this paper; we have a tendency to propose privacy-preserving algorithms for significant Partner in nursing ideal gathering area for a gaggle of clients. We have a tendency to perform a radical security investigation by formally measuring protection loss of the planned methodologies.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Location-Sharing-Based Services, fair rendezvous’ purpose (FRVP), privacy protective FRVP (PPFRVP).

Nadir Zeeshan,Y.Praveen Kumar,G.Arun Kumar,P.Madhu Sudhan."Privacy-Preserving Optimal Convention site Grit on Mobile Devices". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.220-224, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I49.pdf,

1. F. Berger, R. Klein, D. Nussbaum, J.-R. Sack, and J. Yi.
A meeting scheduling problem respecting time and
space. GeoInformatica, 2009.
2. D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-dnf
formulas on ciphertexts. In Theory of Cryptography.
2005.
3. C. Cachin and R. Strobl. Asynchronous group key
exchange with failures. In ACM PODC '04, 2004.
4. C.-H. O. Chen, C.-W. Chen, C. Kuo, Y.-H. Lai, J. M.
McCune, A. Studer, A. Per-rig, B.-Y. Yang, and T.-C. Wu.
Gangs: Gather, authenticate 'n group securely. In ACM
MobiCom '08, 2008.
5. M. Chignell, A. Quan-Haase, and J. Gwizdka. The
privacy attitudes questionnaire (paq): initial
development and validation. In Human Factors and
Ergonomics Society Annual Meeting Proceedings, 2003.
6. T. ElGamal. A public key cryptosystem and a
signature scheme based on discrete logarithms. IEEE
Transactions on Information Theory, 31, 1985.
7.FacebookDeals. http://www.facebook.com/deals/.
8.FacebookStatistics.
http://www.facebook.com/press/info.php?statistics9.Fou
rsquareforBusiness.
http://foursquare.com/business/,Lastvisited 04.02.2011.
10. K. B. Frikken and M. J. Atallah. Privacy preserving
route planning. In WPES '04, 2004.
11. O. Goldreich. Foundations of cryptography: Basic
applications. Cambridge University Press, 2004.
12. J. Krumm. A survey of computational location
privacy. Personal and Ubiquitous Computing,
13(6):391{399, 2009.
13. J. Lewis. IBM computer usability satisfaction
questionnaires: psychometric evaluations and
instructions for use. International Journal of HumanComputer Inter-action, 7, 1995.

Currently there are no Refbacks

Paper Title : Securing Personal Health Records in Cloud Utilizing Multi Authority Attribute Based Encryption
Authors : Meghana A, Gaddam Gowthami, Mahendrakar Kavitha Bai
Affiliations : Department of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Personal health record is keep up in the bring together server to keep up patient’s personal and diagnosis information Personal health record (PHR) is a developing patient-driven model of wellbeing data trade, which is regularly outsourced to be put away at an outsider, for example, cloud providers. Nonetheless, there have been wide security concerns as personal health data could be presented to those outsider servers and to unapproved gatherings. The security plans are utilized to ensure individual information from free. To guarantee the patients' control over access to their PHRs, it is a swearing up and down to method to scramble the PHRs before outsourcing .In this paper we propose novel patient-driven framework and suite of component for information access control to PHR's put away in semi trusted servers. To accomplish fine-grained and versatile information access control for PHRs, we influence attribute based encryption (ABE) methods to scramble each patient’s PHR record. Information holder redesigns the Personal information into outsider cloud server farms. Various information managers can get to the same information values. Our scheme helps effective on-interest client/attribute renouncement
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Attribute-based encryption, cloud computing, data privacy, fine-grained access control, Personal health records, revocation

Meghana A,Gaddam Gowthami,Mahendrakar Kavitha Bai,M.Srilakshmi."Securing Personal Health Records in Cloud Utilizing Multi Authority Attribute Based Encryption". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.214-219, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I48.pdf,

[1] Boldyreva, V. Goyal, and V. Kumar, “Identity-based
encryption with efficient revocation,” in ACM CCS,
ser.CCS ’08, 2008, pp. 417–426.
[2] Dong, G. Russello, and N. Dulay, “Shared and
searchable encrypted data for untrusted servers,” in
Journal of Computer Security, 2010.
[3] M. Li, S. Yu, N. Cao, and W. Lou, “Authorized private
keyword search over encrypted personal health records
in cloud computing,” in ICDCS ’11, Jun. 2011.
[4] H. L ¨ohr, A.-R. Sadeghi, and M. Winandy, “Securing
the e-health cloud,” in Proceedings of the 1st ACM
International Health Informatics Symposium , ser. IHI
’10, 2010, pp. 220–229.
[5] J. Bethencourt, A. Sahai, and B. Waters,
“Ciphertextpolicy attribute-based encryption,” in IEEE
S& P ’07,2007, pp. 321–334
[6] X. Liang, R. Lu, X. Lin, and X. S. Shen, “Ciphertext
policy attribute based encryption with efficient
revocation,” Technical Report, University of
Waterloo,2010.
[7] L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, and W.
Jonker, “Ciphertext-policy attribute-based threshold
decryption with flex- ible delegation and revocation of
user attributes,” 2009.
[8] M. Li, S. Yu, K. Ren, and W. Lou, “Securing personal
health records in cloud computing: Patient-centric and
fine-grained data access control in multi-owner settings,”
in SecureComm’10, Sept. 2010, pp. 89–106.
[9]S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving
secure, scalable, and fine-grained data access control in
cloud computing,” in IEEE INFOCOM’10, 2010.
[10] S. Yu, C. Wang, K. Ren, and W. Lou, “Attribute
based data sharing with attribute revocation,” in
ASIACCS’10, 

Currently there are no Refbacks

Paper Title : Encouraging Effective Client System by Enhanced Website Structure
Authors : P.Bindu Sarika, Kodila Kavya, Bannela.Kuruva Revathi
Affiliations : Department of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

website outline is simple assignment yet, to explore client productively is enormous test, one of the reason is client conduct is continue changing and web developer or architect not think as indicated by client's behavior. Planning well structured websites to encourage powerful client itinerary designs has long been a test in web use mining with different applications like path expectation and change of site administration. Instructions to enhance a website without presenting generous progressions. Particularly, we propose a scientific programming model to enhance the client route on a site while minimizing modifications to its present structure. Results from broad tests led on an openly accessible genuine information set show that our model not just fundamentally enhances the client path with not very many progressions, additionally can be viably explained. Additionally tried the model on extensive engineered information sets to show that it scales up extremely well. Likewise, we characterize two assessment measurements and use them to survey the execution of the enhanced site utilizing the genuine information set. Assessment results affirm that the client route on the enhanced structure is to be sure incredibly upgraded. More interestingly, we find that vigorously bewildered clients are more prone to profit from the enhanced structure than the less perplexed clients.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Website Design, User Navigation, Web Mining, Mathematical Programming

P.Bindu Sarika,Kodila Kavya,Bannela.Kuruva Revathi,R.Anil Kumar."Encouraging Effective Client System by Enhanced Website Structure". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.209-213, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I47.pdf,

[1] Robert Cooley, Bamshad Mobasher, and Jaideep
Srivastava‛ Data Preparation for Mining World Wide
Web Browsing Patterns‛.
[2] Mike Perkowitz and Oren Etzioni ‚Towards
adaptive Web sites: Conceptual framework and case
study‛ Artificial Intelligence 118 (2000) 245–275, 1999.
[3] Joy Shalom Sona, Asha Ambhaikar ‚Reconciling the
Website Structure to Improve the Web Navigation
Efficiency‛ June 2012.
[4] C.C. Lin, ‚Optimal Web Site Reorganization
Considering Information Overload and Search Depth,‛
European J. Operational Research.
[5] R. Gupta, A. Bagchi, and S. Sarkar, ‚Improving
Linkage of Web Pages,‛ INFORMS J. Computing, vol.
19, no. 1, pp. 127-136, 2007.
[6] Y. Fu, M.Y. Shih, M. Creado, and C. Ju,
‚Reorganizing Web Sites Based on User Access
Patterns,‛ Intelligent Systems in Accounting, Finance
and Management.
[7] Min Chen and young U. Ryu ‚Facilitating Effective
User Navigation through Website Structure
Improvement‛ IEEE KDD vol no. 25. 2013.
[8] Yitong wang and Masaru Kitsuregawa ‚Link Based
Clustering of Web Search Results‛ Institute of
Industrial Science, The University of Tokyo.
[9] Bamshad Mobasher,Robert Cooley, Jaideep
Srivastava ‚Creating Adaptive Web Sites Through
Usage-Based Clustering of URLs‛.
[10] Bamshad Mobasher,Robert Cooley, Jaideep
Srivastava‛Automatic Personalization Based on Web
Usage Mining‛.
[11] Bamshad Mobasher, Honghua Dai, Tao Luo, Miki
Nakagawa‛ Discovery and Evaluation of Aggregate
Usage Profiles for Web Personalization‛

Currently there are no Refbacks

Paper Title : A Hybrid Cloud Move Toward For Certified Deduplication
Authors : E.Mounika, P.Manvitha, U.Shalini
Affiliations : Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

-Information deduplication is one of critical information packing strategies for wiping out copy duplicates of rehashing information, and has been broadly utilized as a part of Cloud storage to diminish the measure of storage room and spare data transfer capacity. To secure the secrecy of delicate information while supporting deduplication, the merged encryption system has been proposed to encode the information before outsourcing. To better secure information security, this paper makes the first endeavor to formally address the issue of approved information deduplication. Not the same as customary deduplication frameworks, the differential benefits of clients are further considered in copy check other than the information itself. We additionally show a few new deduplication developments supporting approved copy weigh in a half and half cloud building design. Security dissection exhibits that our plan is secure regarding the definitions defined in the proposed security model.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Deduplication, Hybrid Cloud, Authentication, Traffic Spikes, SQLFabric

E.Mounika,P.Manvitha,U.Shalini,Mrs. K.Lakshmi."A Hybrid Cloud Move Toward For Certified Deduplication". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.204-208, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I46.pdf,

[1]. Li, Yan Kit Li, Xiaofeng Chen, Patrick P. C. Lee,
Wenjing Lou, ‚A Hybrid Cloud Approach for Secure
Authorized Deduplication‛, IEEE Transactions on
Parallel and Cloud Systems, 2014.
[2] P. Anderson and L. Zhang. Fast and secure laptop
backups with encrypted de-duplication. In Proc. of
USENIX LISA, 2010.
[3] M. Bellare, S. Keelveedhi, and T. Ristenpart.
Dupless: Serveraided encryption for deduplicated
storage. In USENIX Security Symposium, 2013.
[4] M. Bellare, S. Keelveedhi, and T. Ristenpart.
Message-locked encryption and secure deduplication.
In EUROCRYPT, pages 296–312, 2013.
[5] M. Bellare, C. Namprempre, and G. Neven. Security
proofs for identity-based identification and signature
schemes. J. ryptology,22(1):1–61, 2009.
[6] M. Bellare and A. Palacio. Gq and schnorr
identification schemes:Proofs of security against
impersonation under active and concurrent attacks. In
CRYPTO, pages 162–177, 2002.
[7] S. Bugiel, S. Nurnberger, A. Sadeghi, and T.
Schneider. Twin clouds: An architecture for secure
cloud computing. In Workshop on Cryptography and
Security in Clouds (WCSC 2011), 2011.
[8] J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon,
and M. Theimer.Reclaiming space from duplicate files
in a serverless distributed file system. In ICDCS, pages
617–624, 2002.
[9] D. Ferraiolo and R. Kuhn. Role-based access
controls. In 15th NIST-NCSC National Computer
Security Conf., 1992.
[10]GNULibmicrohttpd.
http://www.gnu.org/software/libmicrohttpd/.[11] S.
Halevi, D. Harnik, B. Pinkas, and A. Shulman-Peleg.
Proofs of ownership in remote storage systems. In Y.
Chen, G. Danezis,and V. Shmatikov, editors, ACM
Conference on Computer and Communications
Security, pages 491–500. ACM, 2011.
[11] J. Li, X. Chen, M. Li, J. Li, P. Lee, andW. Lou.
Secure deduplication with efficient and reliable
convergent key management. In IEEE Transactions on
Parallel and Distributed Systems, 2013.
[12] libcurl. http://curl.haxx.se/libcurl/.[14] C. Ng and P.
Lee. Revdedup: A reverse deduplication storage
system optimized for reads to latest backups. In Proc.
of APSYS,Apr 2013.12
[13] W. K. Ng, Y. Wen, and H. Zhu. Private data
deduplication protocols in cloud storage. In S.
Ossowski and P. Lecca, editors,Proceedings of the 27th
Annual ACM Symposium on Applied Computing,
pages 441–446. ACM, 2012.
[14] R. D. Pietro and A. Sorniotti. Boosting efficiency
and security in proof of ownership for deduplication.
In H. Y. Youm and Y. Won, editors, ACM Symposium
on Information, Computer and Communications
Security, pages 81–82. ACM, 2012.

Currently there are no Refbacks

Paper Title : An Impeccable Key Aggregate Framework with Adaptable Offering of Information in Cloud
Authors : V.Teja Rani, N.Soujanya, G.Nikhila
Affiliations : Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Cloud computing gives the adaptable structural planning to impart the applications and the other system assets. Cloud storage empowers arranged online Storage when information is put away on various virtual servers for the most part facilitated by third parties despite being facilitated on committed servers. We propose an impeccable key aggregate framework with adaptable offering of information in cloud. This proposal gives secure information Storage and recovery. Alongside the security the right to gain entrance arrangement is additionally stowed away for concealing the client's personality. This plan is so influential since we utilize total encryption and string matching calculations in a solitary plan. The curiosity is that one can total any set of secret keys and make them as minimal as a single key, yet finishing up the force of every last one of keys being collected. The plan catches any change made to the first document and if discovered clear the error's. The calculation utilized here are exceptionally basic so expansive number of information can be put away in cloud without any issues. The security, verification, privacy are equivalent to the unified methodologies.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Aggregate key cryptosystem, Cloud storage, data sharing, key-aggregate encryption.

V.Teja Rani,N.Soujanya,G.Nikhila,K.Harika."An Impeccable Key Aggregate Framework with Adaptable Offering of Information in Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.199-203, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I45.pdf,

[1] C. Wang, S. S. M. Chow, Q. Wang, K. Ren, and W.
Lou, Privacy- Preserving Public Auditing for Secure
Cloud Storage, IEEE Trans. Computers, vol. 62, no. 2,
pp. 362–375, 2013.
[2] S.Kamara and K.Lauter,―Cryptographic Cloud
Storage,Proc.Int’l Conf. Financial Cryptography and
Data Security (FC), pp. 136-149, Jan. 2010
[3] D. Boneh, C. Gentry, B. Lynn, and H. Shacham,
Aggregate and Verifiably Encrypted Signatures from
Bilinear Maps, in Proceedings of Advances in
Cryptology - EUROCRYPT ’03, ser. LNCS, vol. 2656.
Springer, 2003, pp. 416–432.
[4] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
Attribute-Based Encryption for Fine-Grained Access
Control of Encrypted data, in Proceedings of the 13th
ACM Conference on Computer and Communications
Security (CCS ’06). ACM, 2006, pp. 89–98.
[5] S. Yu, C. Wang, K. Ren, and W. Lou, Achieving
Secure, Scalable, and Fine-Grained Data Access
Control in Cloud Computing, Proc. IEEE INFOCOM,
pp. 534-542, 2010.
[6] M. Chase and S. S. M. Chow, Improving Privacy
and Security in Multi-Authority Attribute-Based
Encryption, in ACM Conference on Computer and
Communications Security, 2009, pp. 121–130
[7] M. J. Atallah, M. Blanton, N. Fazio, and K. B.
Frikken, “Dynamic and Efficient Key Management for
Access Hierarchies,” ACM Transactions on
Information and System Security (TISSEC), vol. 12, no.
3, 2009.
[8] J. Benaloh, M. Chase, E. Horvitz, and K. Lauter,
“Patient Controlled Encryption: Ensuring Privacy of
Electronic Medical Records,” in Proceedings of ACM
Workshop on Cloud Computing Security (CCSW ’09).
ACM, 2009, pp. 103–114.
[9] F. Guo, Y. Mu, Z. Chen, and L. Xu, “Multi-Identity
Single-Key Decryption without Random Oracles,” in
Proceedings of Information Security and Cryptology
(Inscrypt ’07), ser. LNCS, vol. 4990. Springer, 2007, pp.
384–398.
[10] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
“Attribute-Based Encryption for Fine-Grained Access
Control of Encrypted data,” in Proceedings of the 13th
ACM Conference on Computer and Communications
Security (CCS ’06). ACM, 2006, pp.89–98. 

Currently there are no Refbacks

Paper Title : Anonymous Authentication of data storage in cloud computing administration with Decentralized Access
Authors : G.Gayathri Nikhila, A.Bhuvana Pramida, P.Jyothsna
Affiliations : Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Cloud computing is a climbing processing standard in which stakes of the registering schema are given as an organization over the Web. As ensuring as it might be, this standard furthermore conveys quite a few people new difficulties for information security and access control when customers outsource touchy information for offering on cloud servers, which are not inside the same trusted domain as information owners. Regardless, in finishing hence, these results unavoidably display a considerable preparing overhead on the information owner for key dissemination and information organization when fine grained information access control is popular, and in this manner don't scale well. The issue of in the meantime achieving fine-graininess’, versatility, and information classifiedness of access control truly still stays questionable. This paper addresses this open issue by, on one hand, describing and actualizing access approaches focused around information qualities, and, of course, allowing the information manager to delegate most of the figuring endeavors included in fine-grained information access control to un-trusted cloud servers without disclosing the underlying information substance. We fulfill this objective by misusing and joining methods of decentralized key policy Attribute Based Encryption (KP-ABE). Far reaching examination demonstrates that the proposed methodology is exceptionally productive and secure.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access Control, Cloud Computing, Key Policy Attribute Based Encryption (KP-ABE)

G.Gayathri Nikhila,A.Bhuvana Pramida,P.Jyothsna,K.Lavanya."Anonymous Authentication of data storage in cloud computing administration with Decentralized Access". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.195-198, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I44.pdf,

[1] S Sushmita Ruj, Milos Stojmenovic and Amiya
Nayak,“Decentralized Access Control with
Anonymous Authentication of Data Stored in
Clouds”, IEEE TRANSACTIONS ON PARALLEL
AND CLOUD SYSTEMS
[2] Yang Tang, Patrick P.C. Lee, John C.S. Lui and
Radia Perlman,“Secure Overlay Cloud Storage with
Access Control and Assured Deletion”, IEEE
Transcations on dependable and secure computing,
VOL. 9, NO. 6, NOVEMBER/DECEMBER 2012
[3] G. Wang, Q. Liu, and J. Wu, “Hierarchical
attribute-based encryption for fine-grained access
control in cloud storage services,” in ACM CCS, , pp.
735–737, 2010
[4] Y. Tang, P.P.C. Lee, J.C.S. Lui, and R. Perlman,
“FADE: Secure Overlay Cloud Storage with File
Assured Deletion,” Proc. Sixth Int’l ICST
Conf.Security and Privacy in Comm. Networks
(SecureComm), 2010
[5] R. Perlman, “File System Design with Assured
Delete,” Proc. Network and Cloud System Security
Symp. ISOC (NDSS), 2007
[6] Ruj, A. Nayak, and I. Stojmenovic, “DACC: Cloud
access control in clouds,” in IEEE TrustCom, 2011
[7] S. Yu, C. Wang, K. Ren, and W. Lou, “Attribute
Based Data Sharing with Attribute Revocation,” Proc.
Fifth ACM Symp. Information, Computer and Comm.
Security (ASIACCS), Apr. 2010
[8] W. Wang, Z. Li, R. Owens, and B. Bhargava,
“Secure and Efficient Access to Outsourced Data,”
Proc. ACM Workshop Cloud Computing Security
(CCSW), Nov. 2009
[9] J. Bethencourt, A. Sahai, and B. Waters,
“Ciphertext-Policy Attribute-Based Encryption,” Proc.
IEEE Symp. Security and Privacy, May 2006
[10] R. Geambasu, J.P. John, S.D. Gribble, T. Kohno,
and H.M. Levy, “Keypad: Auditing File System for
Mobile Devices,” Proc. Sixth Conf. Computer Systems
(EuroSys), Apr. 2011

Currently there are no Refbacks

Paper Title : A LocX Unique Approach for Location-Based Social Applications
Authors : P Chinna Masumanna, G.Vijay Subramanyam, B.Sharath Kumar Reddy
Affiliations : Department of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

The limitation capacity of Smartphone’s has given a gigantic help to the ubiquity of geosocial applications, which encourage social connection between clients geologically near one another. Nonetheless, today's geosocial applications raise security concerns because of use suppliers putting away a lot of data about clients (e.g., profile information) and locations (e.g., user’s gift at a location). We tend to propose Zerosquare and Foursquare, a privacy-friendly location hub that encourages the event of privacy-preserving geosocial applications. In this paper, we tend to introduce LocX, an exceptional different that gives altogether enhanced area security while not including instability into inquiry comes about or trusting on durable suspicions with respect to server security. Our key knowledge is to utilize secure client particular, separation safeguarding direction changes to any or all area learning imparted to the server.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Geosocial applications, Zerosquare and Foursquare, LocX, Virtual Individual Server (VIS). Location-based social applications

P Chinna Masumanna,G.Vijay Subramanyam,B.Sharath Kumar Reddy,I.S.Raghuram."A LocX Unique Approach for Location-Based Social Applications". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.188-194, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I43.pdf,

[1] M. Motani, V. Srinivasan, and P. S. Nuggehalli,
“Peoplenet: engineering a wireless virtual social
network,” in Proc. of MobiCom, 2005.
[2] M. Hendrickson, “The state of location-based social
networking,” 2008.
[3] P. Mohan, V. N. Padmanabhan, and R. Ramjee,
“Nericell: rich monitoring of road and traffic conditions
using mobile smartphones,” in Proc.of SenSys, 2008.
[4] G. Ananthanarayanan, V. N. Padmanabhan, L.
Ravindranath, and C. A.Thekkath, “Combine:
leveraging the power of wireless peers through
collaborative downloading,” in Proc. of MobiSys, 2007.
[5] M. Siegler, “Foodspotting is a location-based game
that will make your mouth water,”
http://techcrunch.com/2010/03/04/foodspotting/.
[6] http://www.scvngr.com.
[7] B. Schilit, J. Hong, and M. Gruteser, “Wireless
location privacy protection,”Computer, vol. 36, no. 12,
pp. 135–137, 2003.
[8] F. Grace, “Stalker Victims Should Check For GPS,”
Feb. 2003,www.cbsnews.com.
[9] DailyNews, “How cell phone helped cops nail key
murder suspect secret ’pings’ that gave bouncer away,”
Mar. 2006.
[10] “Police: Thieves robbed homes based on
facebook,social media sites,” WMUR News, September
010,http://www.wmur.com/r/24943582/detail.html.
[11] M. Gruteser and D. Grunwald, “Anonymous usage
of location-based service through spatial and temporal
cloaking,” in Proc. of Mobisys,
2003

Currently there are no Refbacks

Paper Title : Public Reviewing for Imparted Information to Effective Client Repudiation in Cloud Computing
Authors : P Baziga Tabassum, Varada Sravani, Katrimala Sahaja
Affiliations : Department of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

With promotion of cloud administrations, different clients effectively impart and overhaul their information through distributed storage. For information uprightness and consistency in the distributed storage, the review mechanisms were proposed. Be that as it may, existing methodologies have some security vulnerabilities and oblige a ton of computational overheads. This paper proposes a protected and proficient review mechanism for element imparted information in distributed storage. The proposed plan keeps vindictive cloud service providers from misleading an examiner. In addition, with information storing and offering administrations in the cloud, clients can without much of a stretch alter and offer information as a gathering to guarantee offer information uprightness can be checked openly, clients in the gathering need to process marks on all the squares in imparted information. Distinctive pieces in imparted information are for the most part marked by diverse clients because of information alterations performed by distinctive clients. For security reasons, once a client is disavowed from the gathering, the squares which were awhile ago marked by this denied client must be re-marked by a current client. The straight forward system, which permits a current client to download the comparing piece of imparted information and re-sign it amid client repudiation, is wasteful because of the expansive size of imparted information in the cloud. In this paper, we propose a novel open evaluating mechanism for the uprightness of imparted information to proficient client repudiation at the top of the priority list.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud Service Provider (CSP), Public Auditing, Trusted Third party (TPA), Client Repudiation.

P Baziga Tabassum,Varada Sravani,Katrimala Sahaja,V Jhansi Rani."Public Reviewing for Imparted Information to Effective Client Repudiation in Cloud Computing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.183-187, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I42.pdf,

[1] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L.
Kissner, Z. Peterson,and D. Song, “Provable Data
Possession at Untrusted Stores,” in the Proceedings of
ACM CCS 2007, 2007, pp. 598–610.
[2] H. Shacham and B. Waters, “Compact Proofs of
Retrievability,” in the Proceedings of ASIACRYPT
2008. Springer-Verlag, 2008, pp. 90–107.
[3] C. Wang, Q. Wang, K. Ren, and W. Lou, “Ensuring
Data Storage Security in Cloud Computing,” in the
Proceedings of ACM/IEEE IWQoS 2009, 2009, pp. 1–9.
[4] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou,
“Enabling Public Veri-fiability and Data Dynamic for
Storage Security in Cloud Computing,”in the
Proceedings of ESORICS 2009. Springer-Verlag, 2009,
pp. 355–370
[5] C. Wang, Q. Wang, K. Ren, and W. Lou, “PrivacyPreserving Public Auditing for Data Storage Security
in Cloud Computing,” in the proceedings of IEEE
infocom 2010,pp355-370.
[6] Y. Zhu, H. Wang, Z. Hu, G.-J. Ahn, H. Hu, and S. S.
Yau, “Dynamic Audit Services for Integrity
Verification of Outsourced Storage in Clouds,” in n
the Proceedings of ACM SAC 2011, 2011, pp. 1550–
1557.
[7] B. Wang, B. Li, and H. Li, “Oruta: PrivacyPreserving Public Auditing for Shared Data in the
Cloud,” in the Proceedings of IEEE Cloud 2012,2012,
pp. 295–302.
[8] N. Cao, S. Yu, Z. Yang, W. Lou, and Y. T. Hou, “LT
Codes-based Secure and Reliable Cloud Storage
Service,” in the Proceedings of IEEE INFOCOM 2012,
2012, pp. 693–701.
[9] B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large
Groups in the Cloud,” in the Proceedings of ACNS
2012, June 2012, pp. 507–525

Currently there are no Refbacks

Paper Title : Enhance the QoS capability of Hybrid Networks using QoS-Oriented Distributed Routing Protocol
Authors : N.Asha Jyothi, G.Ramya, G.Mounika
Affiliations : Department of IT, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

With the expanding interest for constant applications in the Wireless Senor Network (WSN), ongoing discriminating occasions suspect a proficient quality-of-service (QoS) based Routing for information conveyance from the Network foundation. Outlining such QoS based Routing convention to meet the unwavering quality and postponement certification of discriminating occasions while protecting the vitality effectiveness is a testing assignment. Impressive exploration has been centred on creating hearty vitality productive QoS based Routing conventions. In this paper, we tended to a remote crossover arrange that incorporates a mobile wireless ad hoc network (MANET) and a wireless infrastructure network has been turned out to be a finer option for the cutting edge remote Networks. By straight forwardly embracing asset reservation-based QoS Routing for MANETs, half breeds Networks inherit invalid reservation and race condition issues in MANETs. Instructions to ensure the QoS in cross breed Networks remains an open issue. In this paper, we propose QoS-Oriented Distributed routing protocol (QOD) to upgrade the QoS help capacity of hybrid Networks.
:10.22362/ijcert/2019/v6/i04/v6i04
DOI Link : https://doi.org/10.22362/ijcert/2019/v6/i04/v6i04



N.Asha Jyothi,G.Ramya,G.Mounika,R.Sandeep Kumar."Enhance the QoS capability of Hybrid Networks using QoS-Oriented Distributed Routing Protocol". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.178-182, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I41.pdf,


Currently there are no Refbacks

 


Paper Title : To a Measurable Statistical Framework for Source Haziness in Sensor Networks
Authors : Zunaira Begum, K.Tarakeswar, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

-In specific applications, the areas of events reported by a sensor networks need to stay unnamed .The fundamental point of the paper is the Source Haziness in Sensor Network .i.e. Unapproved Eyewitnesses must be not able to locate the inception of occasions by judging the network movement. This Exploration shows another framework for, investigating and assessing obscurity in sensor network .Paper is isolated into twofold: to begin with, it presents the idea of "interim lack of definition" and gives a quantitative measure to model Anonymity in remote sensor network; second, it maps source secrecy to the factual issue of double speculation testing with annoyance parameters. We then dissect existing answers for planning unnamed sensor network utilizing the proposed model. By changing over it to paired codes. At last writing demonstrates how lack of clarity can be enhanced utilizing the portrayed framework.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Wireless Sensor Networks (WSN), source location, privacy, Source Haziness, nuisance parameters, coding theory.

Zunaira Begum,K.Tarakeswar,Dr.S.Prem Kumar."To a Measurable Statistical Framework for Source Haziness in Sensor Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.172-177, SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I39.pdf,

[1] B. Alomair, A. Clark, J. Cuellar, and R. Poovendran, “On Source
Anonymity in Wireless Sensor Networks,” Proc. IEEE/IFIP 40th Int‟ l
Conf. Dependable Network and Networks (DSN ‟ 10), 2010.
[2] K. Mehta, D. Liu, and M. Wright, “Location Privacy in Sensor
Networks Against a Global Eavesdropper,” in ICNP 2007. IEEE
International Conference on Network Protocols. , 2007.
[3] B. Alomair, A. Clark, J. Cuellar, and R. Poovendran, “Statistical
Framework for Source Anonymity in Sensor Networks,” Proc. IEEE
GlobeCom, 2010.
[4] P. Kamat, Y. Zhang, W. Trappe, and C. Ozturk, “Enhanc-ing SourceLocation Privacy in Sensor Network Routing,” ICDCS 2005. The 25th
IEEE International Conference on Distributed Computing Network.
[5] C. Ozturk, Y. Zhang, and W. Trappe, “Source-location privacy in
energy-constrained sensor network routing,” in Proceedings of the 2nd
ACM workshop on Security of ad hoc and sensor networks, 2004.
[6] Y. Xi, L. Schwiebert, and W. Shi, “Preserving source location privacy
in monitoring-based wireless sensor net-works,” in IPDPS 2006. The
20th International Parallel and Distributed Processing Symposium, 2006.
[7] B. Hoh and M. Gruteser, “Protecting Location Privacy Through Path
Confusion,” in Secure Comm 2005. First Inter-national Conference on
Security and Privacy for Emerging Areas in Communications
Networks., 2005.

Currently there are no Refbacks

Paper Title : Dynamic Query Structures for Database Exploration
Authors : Alisam Pavan Kumar, I.S.Raghuram, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

-In New exploratory databases and web databases keep up tremendous and heterogeneous information. These cement world databases incorporate over such a variety of relations and properties. Noteworthy predefined query structures are not ready to answer diverse advertisement ad-hoc query’s from clients on those databases. This paper proposes Dynamic Query structures, an inquisitive database query structure interface, which has the capacity powerfully make query structures. The importance of DQS is to catch a client's decision and group inquiry structure parts, help him/her to make conclusion. The making of query structure is a monotonous methodology and is led by the clients. In every redundancy, the framework naturally makes order arrangements of structure segments and the client then includes the craved structure parts into the inquiry structure. The grouping of structure segments is focused around the caught client decision. A client might likewise top off the inquiry structure and convey query’s to view the query yield at each one stage. Consequently, a query structure could be alertly refined till the client answer with the inquiry yield. A probabilistic model is produced for assessing the incredibleness of a query structure in DQS. I have examined assessment and client study ensures the adequacy and productivity of the framework.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Form creation, Query Form, User Interaction, Efficiency of the system, Dynamic Query Structures (DQS)

Alisam Pavan Kumar,I.S.Raghuram,Dr.S.Prem Kumar."Dynamic Query Structures for Database Exploration". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.165-171 , SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I38.pdf,

[1]. M. Jayapandian and H. V. Jagadish. Automated creation of a formsbased database query interface. In proceedings of the VLDB
Endowment, pages 695-709, August 2008.
[2]. M. Jayapandian and H. V. Jagadish. Expressive query specification
through form customization. In proceedings of International Conference
on Extending Database Technology(EDBT), pages 416-427, Nantes,
France, March 2008.
[3]. M. Jayapandian and H. V. Jagadish. Automating the design and
construction of query forms. IEEE TKDE, 21(10): 1389-1402,2009.
[4]. E.Chu, A. Baid, X. Chai, A. Doan and J. F. Naughton. Combaining
keyword search and form for ad hoc querying of databases. In
proceedings of ACM SIGMOD Conference, pages 349-360, providence,
Rhode IsLand, USA, June 2009.
[5] G. Chatzopoulou, M. Eirinaki and N. Polyzotis. Query
recommendations for interactive database exploration. In proceedings of
SSDBM, pages 3-18, New Orleans, LA, USA, June 2009.
[6]. S. B. Roy, H. Wang, U. Nambiar, G. Das and M. K. Mohsnia.
Dynacet: Building faceted search systems over databases. In proceedings
of ICDE Conference, pages 1463-1466, Shanghai, China, March 2009.
[7]. K. Chen, H. Chen, N. Conway, J. M. Hellerstein and T. S. Parikh.
Usher: Improving data quality with dynamic forms. Im proceedings of
ICDE conference, pages 321-332, Long Beach, California, USA, March
2010.
[8]. GODBmanual.http://docs.mongodb.org/v2.4/mongodb_manual.pdf

Currently there are no Refbacks

Paper Title : Encouraging Viable Client System through Website Structure Change
Authors : B.Kundan, Dr.S.Prem Kumar,
Affiliations : M.Tech Research Scholar
Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Outlining overall organized sites to encourage viable client route has long been a test. An essential reason is that the web designers understanding of how a site ought to be organized can be respectably not quite the same as that of the clients. While different routines have been proposed to relink site pages to enhance safety utilizing client route information, the totally revamped new structure can be exceptionally unusual, and the expense of bewildering clients after the progressions stays unanalyzed. This paper delivers how to enhance a site without presenting considerable progressions. Particularly, we propose a numerical programming model to enhance the client route on a site while minimizing changes to its present structure. Results from broad tests directed on a freely accessible true information set demonstrate that our model not just altogether enhances the client route with not very many progressions, additionally can be successfully illuminated. Assessment results affirm that the client route on the enhanced structure is undoubtedly enormously improved. All the more interestingly, we find that intensely confused clients are more prone to profit from the enhanced structure than the less perplexed clients.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Website Design, User Navigation, Web Mining, Mathematical Programming

B.Kundan,Dr.S.Prem Kumar."Encouraging Viable Client System through Website Structure Change". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.158-164, SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I37.pdf,

[1]Pingdom,“Internet 2009 in Numbers”, [Online]
Available:http://royal.pingdom.com/2010/01/22/internet-2009-
innumbers/,2010.
[2] J. Grau,“US Retail e-Commerce: Slower But Still Steady Growth”,
[Online]Available:http://www.emarketer.com/
Report.aspx?code=emarketer_ 2000492, 2008.
[3] Internet retailer, “Web Tech Spending Static-But High-for the Busiest
E-Commerce Sites”, [Online] Available:
http://www.internetretailer.com/ dailyNews.asp?id = 23440, 2007.
[4] D. Dhyani, W.K. Ng, S.S. Bhowmick,“A Survey of Web Metrics”,
ACM Computing Surveys, Vol. 34, No. 4, pp. 469-503, 2002.
[5] X. Fang, C. Holsapple,“An Empirical Study of Web Site Navigation
Structures’ Impacts on Web Site Usability”,Decision Support Systems,
Vol. 43, No. 2, pp. 476-491,2007.
[6] J. Lazar,"Web Usability: A User-Centered Design Approach",Addison
Wesley, 2006.
[7] D.F. Galletta, R. Henry, S. McCoy, P. Polak,“When the Wait Isn’t So
Bad: The Interacting Effects of Website Delay,Familiarity, and Breadth”,
Information Systems Research,Vol. 17, No. 1, pp. 20-37, 2006.
[8] J. Palmer,“Web Site Usability, Design, and Performance Metrics”,
Information Systems Research, Vol. 13, No.2,pp. 151-167, 2002.
[9] V. McKinney, K. Yoon, F. Zahedi,“The Measurement of WebCustomer Satisfaction: An Expectation and Disconfirmation Approach”,
Information Systems Research, Vol. 13, No. 3,pp. 296-315, 2002.
Computer Networks, Vol. 33, pp. 811-822,2000.

Currently there are no Refbacks

Paper Title : Transfer Reliability and Clogging Control Procedures in Pioneering Networks
Authors : Surya pogu Jayanna, N.Poorna Chandra Rao, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Pioneering networks are a class of mobile ad hoc networks (MANETs) where contacts between versatile hubs happen erratically and where a complete end-toend way in the middle of Source and goal once in a while exists at one time. Two critical capacities, generally gave by the Transport layer, are guaranteeing the unwavering quality of information transmission in the middle of source and terminus, and guaranteeing that the system does not get to be congested with movement. Notwithstanding, altered variants of TCP that have been proposed to help these capacities in MANETs are inadequate in artful networks. Moreover, artful networks require distinctive methodologies to those received in the more basic discontinuously associated networks, e.g. profound space networks. In this article we catch the state of the craft of suggestions for exchange unwavering quality and stockpiling blockage control networks in pioneering networks. We examine potential networks for exchange dependability administration, i.e. bounce by-jump care exchange and end-to-end return receipt. We likewise recognize the necessities for capacity clogging control and sort these issues focused around the quantity of message duplicates dispersed in the networks. For single-duplicate sending, stockpiling clogging administration and blockage shirking component are talked about. For different duplicate sending, the primary stockpiling clogging control components are replication administration and drop strategy. At long last, we distinguish open exploration issues in the field where future examination could conveniently be centered.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Pioneering networks, connection data, setting mindful directing, steering in portable networks, delay-tolerant networks, directing in versatile sensor networks, portability design.

Surya pogu Jayanna,N.Poorna Chandra Rao,Dr.S.Prem Kumar."Transfer Reliability and Clogging Control Procedures in Pioneering Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.152-157, SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I36.pdf,

[1] Delay Tolerant Networking Research Group, available online:
htp:/www.dtnrg.org
[2] Y. Hu, V.O.K. Li, “Satelite-based Internet: a Tutorial”, IEEE
Communication Mag., vol. 39, no. 3, p. 154-162, March 201.
[3] M. Marchese, M. Rosei, G. Morabito, “PETRA: Performance
Enhancing Transport Architecture for Satelite Communications”, IEEE
J.Sel. Areas Commun., vol. 2, no. 2, p. 320-32, Feb. 204.
[4] P. Szczytowski, A. Kheli, A. Ali, N. Suri, “TOM: Topology Oriented
Maintenance in Sparse Wireles Sensor Networks”, Proc. 8th IEEE
SECON, Salt Lake City, Utah, USA, June 201.
[5] P. Juang, H. Oki, Y. Wang, “Energy-Eficient Computing for Wildlife
Tracking: Design Tradeofs and Early Experiences with Zebranet”, Proc.
ASPLOS, Oct. 202.
[6] A.K. Pietilainen, C. Diot, “Social Pocket Switched Networks”, Proc.
9th INFOCOM Workshops, Rio de Janeiro, April 209.
[7] P. Jacquet, P. Muhlethaler, T. Clausen, A.Laouit, A. Qayum, L.
Vienot, “Optimized Link State Routing Protocol for Ad Hoc Networks”,
Proc. IEEE INMIC, Lahore, Pakistan, Dec. 201.
[8] C.E. Perkins, E.M. Royer, “Ad-Hoc On-Demand Distance Vector
Routing”, Proc. 2nd IEEE Workshop on Mobile Computing Networks
and Aplication, New Orleans, Louisiana, USA, Feb. 199.

Currently there are no Refbacks

Paper Title : Moderating vampire attacks in Wireless Sensor Network
Authors : Kuruva Laxmanna, N.Poorna Chandra Rao, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Ad-hoc sensor system and steering information in them is a noteworthy examination zone. There are a ton of conventions created to ensure from DOS assault, yet it is not totally conceivable. One such DOS assault is Vampire attack emptying of hub life out of remote adhoc sensor systems. In this paper, introduces a system to endure the assault by utilizing the PLGP strategy. On the off chance that this, any Vampire assault, the PLGP system takes part in the circumstances and conveys the parcel to goal without dropping the bundle. In this way giving a most extreme lifetime of the battery and solid message conveyance even if there should be an occurrence of Vampire attack
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Ad hoc sensor network, Energy consumption, Routing, Security, DOS. Parno,Luk, Gaustad and Perrig (PLGP).

Kuruva Laxmanna,N.Poorna Chandra Rao,Dr.S.Prem Kumar."Moderating vampire attacks in Wireless Sensor Network ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.143-151, SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I35.pdf,

[1] Michael Brownfield,Yatharth Gupta, ”Wireless Sensor Network
Denial of Sleep Attack”, Proceedings of 2005 IEEE workshop on
information assurance,June 2005.
[2] Jing Deng, Richard Han, Shivakanth mishra,
”INSENS:IntrusionTolerant routing in Wireless Sensor
Networks”,University of Colorado, Department of computer science
Technical report,June 2006 .
[3].A.Rebekah Johnson, N.Parashuram, Dr.S. Prem Kumar,
Organizing of Multipath Routing For Intrusion Lenience in Various
WSNs, International Journal of Computer Engineering In Research
Trends , Volume 1, Issue 2, PP 104-110, August 2014.
[4] Fatma Bouabdullah, Nizar Bouabdullah,Raouf Bouabdullah
”Cross-layer Design for Energy Conservation in Wireless Sensor
Networks”, IEEE GLOBECOM 2008,New Orleans,USA,December
2008.
[5] Xufei Mao,Shaojie Tang, Xiahua Xu, ”Energy efficient
Opportunistic Routing in Wireless Sensor Networks”, IEEE
transactions on parellel and distributed systems, VOL. 12, NO.2,
February 2011
[6] Tapaliana Bhattasali,Rituparna Chaki,Sugata Sanyal ”Sleep
Deprivation Attack Detection in Wireless Sensor
Networks”,International journal of computer applications(0975-
8887)vol
40- No: 15,February 2012 [7] Eugene Y. Vasserman, Nicholas
Hopper, ” Vampire Attacks: Draining Life from Wireless Ad Hoc
Sensor Networks”, IEEE transactions onmobile computing, VOL. 12,
NO. 2, February 2013
[8] Yazeed Al-Obaisat,Robin Braun, ”On Wireless Sensor Networks:
Architectures, Protocols,Applications and Management”, Institute of
Information and Communication Technologies,May 2004
[9] B.Prano, M.Luk, E.Gustad, A.Perrig, ”Secur Sensor Network
Routing: A Clean-state Approach”,CoNEXT:Proc.ACM CoNEXT
Conf.,2006
[10] D.B. Johnson, D.A Maltz, J.Broch, ”DSR: The Dynamic Source
Routing Protocol for Multihop Wireless Adhoc Networks”, Adhoc
Networking, Addison Wesley, 2001
[11] K.Premkumar and Anurag Kumar, ”Optimal sleep-wake
scheduling for quickest intrusion detection using sensor networks ”,
IEEE explore, February, 2008

Currently there are no Refbacks

Paper Title : Novel Method For Examine Progress in Cloud Environment Using Secure Cloud Forensic Structure
Authors : Vankam Anil Madhava, P.Kiran Rao, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Cloud computing signifying a noticeably new innovation and an alternate ideal model in the field of Cloud computing that include more researchers. We can see in this context the need to know precisely where, when and how a bit of information is transformed or put away. Contrasted and excellent digital forensic, the field of cloud legal represents a considerable measure of troubles since information is not put away on a solitary stockpiling unit and moreover it includes the utilization of virtualization advances. In this paper we will introduce in detail another and novel method for observing movement in cloud situations and datacenters utilizing a safe cloud forensic structure. We discuss the building design of such schema and in what manner would it be able to be connected on top of new or existing Cloud computing arrangements. Additionally, for testing and results gathering we have executed this answer for our past created Cloud computing framework.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


cloud computing; data forensics; logging framework; Cloud computing; binary diff.

Vankam Anil Madhava,P.Kiran Rao,Dr.S.Prem Kumar."Novel Method For Examine Progress in Cloud Environment Using Secure Cloud Forensic Structure". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.137-142, SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I34.pdf,

[1] A. Amarilli, D. Naccache, P. Rauzy and E. Simion, “Can a program
reverse-engineer itself?”, in Proceedings of the Thirteenth IMA
International Conference on Cryptography and Coding, 2011.
[2] A. Atanasiu, R.F. Olimid and E. Simion, “On the Security of BlackBox Implementation of Visual Secret Sharing Schemes”, in Journal of
Mobile, Embedded and Cloud Systems, 2012.
[3] A. Pătrașcu and V. Patriciu, “Beyond Digital Forensics. A Cloud
Computing Perspective Over Incident Response and Reporting”, in IEEE
8th International Symposium on Applied Computational Intelligence
and Informatics (SACI), 2013
[4] A. Pătrașcu, C. Leordeanu, C. Dobre and V. Cristea, “ReC2S:Reliable
Cloud Computing System”, in European Concurrent Engineering
Conference, Bucharest, 2012.
[5] B. Grobauer and T. Schreck, “Towards incident handling in the
cloud: challenges and approaches”, in Proceedings of the 2010 ACM
workshop on Cloud computing security workshop, New York, 2010
[6] G. Chen, “Suggestions to digital forensics in Cloud computing ERA”,
in Third IEEE International Conference on Network Infrastructure and
Digital Content (IC-NIDC), 2012 G. Sibiya, H. Venter and T. Fogwill,
“Digital forensic framework for a cloud environment”, Proceedings of
the 2012 Africa Conference, 2012
[7] http://cee.mitre.org/language/1.0-beta1/cls.html
[8] http://uw714doc.sco.com/en/UDI_spec/m_mgmt.html
[9] M. Al-Fares, A. Loukissas and A. Vahdat, “A Scalable,Commodity
Data Center Network Architecture”, in Proceedings of the ACM
SIGCOMM 2008 conference on Data communication, 2008

Currently there are no Refbacks

Paper Title : Security Saving Open Examining for Secure Cloud storage
Authors : D.Farooq Basha, P Suman Prakash, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar
Assistant Professor
Head of the Department
Department of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Cloud computing is a sort of registering that depends on offering processing assets instead of having nearby servers or individual gadgets to handle applications. Cloud information stockpiling has numerous focal points over neighborhood information stockpiling. Client can transfer their information on cloud and can get to that information whenever anyplace without any hurdle. Cloud computing decreases cost by apportion figuring and stockpiling assets, unpredictable with an on interest provisioning instrument depending on a pay for every utilization plan of action. The Client doesn't need to stress over capacity and upkeep of cloud information. As the information is put away at the remote place how clients will get the affirmation about put away information. Thus Cloud information stockpiling ought to have some system which will determine capacity rightness and uprightness of information put away on cloud. Clients can fall back on third-party auditor (TPA) to check the trustworthiness of outsourced information and be straightforward. TPA ought to have the capacity to effectively review the cloud information stockpiling without requesting the neighborhood duplicate of information. Particularly, our commitment in this work could be outlined as the accompanying perspectives: Empower general society inspecting arrangement of information stockpiling security in Cloud computing and give a protection safeguarding examining convention, i.e., our proposal backings an outer evaluator to review client's outsourced information in the cloud without learning data on the information content. In Our Scheme is the first to backing versatile and proficient open reviewing in the Cloud computing. In demanding, our plan attains clump examining where a few designated evaluating undertakings from distinctive clients could be performed simultaneously by the TPA.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud Computing, Cloud Storage, Privacy Preserving, Public Auditing, TPA, Batch Auditing.

D.Farooq Basha,P Suman Prakash,Dr.S.Prem Kumar."Security Saving Open Examining for Secure Cloud storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.131-136 , SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I33.pdf,

[1] C. Wang, Q. Wang, K. Ren, and W. Lou,” Ensuring data storage
security in cloud computing,” in Proc. of IWQoS’09, July 2009,pp.1–9.
[2] C Wang, Sherman S. M. Chow, Q. Wang, K Ren and W. Lou,
“Privacy-Preserving Public Auditing for Secure Cloud Storage”, IEEE
Transaction on Computers I, vol. 62, no. 2, pp.362-375 , February 2013.
[3]0Samunnisa,Tarak,Dr.S.Premkumar,” Privacy Preserving Information
Brokering for Data Handling Frameworks”, International Journal of Computer Engineering In Research Trends,Volume 1,Issue 2,pp 84-
89,August 2014.
[4] P. Mell and T. Grance, “Draft NIST working definition of Cloud
Computing”.
[5] Pearson, S. 2012. Privacy, Security and Trust in Cloud Computing.
Privacy and Security for Cloud Computing, 3-42.
[6] Q. Wang, C. Wang, Kui Ren, W.Lou and Jin Li, “Enabling Public
Auditability and Data Dynamics for Storage Security in Cloud
Computing”, in IEEE transaction on parallel and Cloud system May
2011.
[7] C. Wang, Q. Wang and K. Ren, “Ensuring Data Storage security in
Cloud Computing”, IEEE Conference Publication, 17th International
Workshop on Quality of Service (IWQoS), 2009
[8] Balkrishnan. S, Saranya. G, Shobana . S and Karthikeyan .S,
“Introducing Effective Third Party Auditing (TPA) for Data Storage
Security in Cloud”,International Journal of computer science and
Technology, vol. 2, no. 2, ISSN 2229-4333 (Print) | ISSN: 0976-
8491(Online), June 2012
[9] Maha TEBAA, Saïd EL HAJJI, Abdellatif EL GHAZI “Homomorphic
Encryption Applied to the Cloud Computing Security” Proceedings of
the World Congress on Engineering 2012 Vol I WCE 2012, July 4 - 6,
2012, London, U.K.
[10] AbhishekMohta, Lalit Kumar Awasti, “Cloud Data Security while
using Third Party Auditor”, International Journal of Scientific &
Engineering Research, Volume 3, Issue 6, ISSN 2229-8 June 2012.

Currently there are no Refbacks

Paper Title : The Use of Heuristics in Decision Tree Learning Optimization
Authors : Elma Kolçe (Çela), Neki Frasheri ,
Affiliations :
Abstract :

af

— Decision tree algorithms are among the most popular techniques for dealing with classification problems in different areas. Decision tree learning offers tools to discover relationships, patterns and knowledge from data in databases. As the volume of data in databases is growing up very quickly, the process of building decision trees on such databases becomes a quite complex task. The problem with decision trees is to find the right splitting criterion in order to be more efficient and to get the highest accuracy. Different approaches for this problem have been proposed by researchers, using heuristic search algorithms. Heuristic search algorithms can help to find optimal solutions where the search space is simply too large to be explored comprehensively. This paper is an attempt to summarize the proposed approaches for decision tree learning with emphasis on optimization of constructed trees by using heuristic search algorithms. We will focus our study on four of the most popular heuristic search algorithms, such as hill climbing, simulated annealing, tabu search and genetic algorithms.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


decision trees, genetic algorithms, heuristics, hill-climbing, simulated annealing, tabu search

Elma Kolçe (Çela),Neki Frasheri."The Use of Heuristics in Decision Tree Learning Optimization". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.127-130, SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I32.pdf,

[1] V. Mohan, ―Decision Trees:A comparison of various algorithms for building
Decision Trees‖, 2013
[2] W.S.Alsharafat ―Steady State Genetic Algorithm in University Admission
Decision‖, Contemporary Engineering Sciences, Vol. 6, 2013, no. 5, pp.245 -
254
[3] D.Sh. Liu et al. ―A Modified Decision Tree Algorithm Based on Genetic Algorithm for Mobile User Classification Problem‖, The Scientific World Journal
Volume 2014, Article ID 468324 2014
[4] R.C.Barros et al. ―Automatic Design of Decision-Tree Algorithms with Evolutionary Algorithms‖ Massachusetts Institute of Technology 2013
[5] M.Khanbabaei, M.Alborzi ―The Use Of Genetic Algorithm, Clustering And
Feature Selection Techniques In Construction Of Decision Tree Models For
Credit Scoring‖. International Journal of Managing Information Technology
(IJMIT) Vol.5, No.4, 2013 DOI : 10.5121/ijmit.2013.5402
[6] T. de la Rosa et al. ―Learning Relational Decision Trees for Guiding
Heuristic Planning Association for the Advancement of Artificial
Intelligence‖ (www.aaai.org). 2008
[7] Y.Cai et al. ―A Tree-Based Tabu Search Algorithm for the Manpower
Allocation Problem with TimeWindows and Job-Teaming Constraints‖,
Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence 2013 pp.496-502
[8] Y.Madadi et al. ―An Accurate Classification Algorithm with Genetic
Algorithm Approach‖, International Journal of Computer & Information
Technologies (IJOCIT) 2013 ISSN: 2345-3877 Vol 1, Issue 3 pp.198-210
[9] ―A Bank Customer Credit Evaluation Based on the Decision Tree and the
Simulated Annealing Algorithm‖ 2007
[10] C.J.Hinde et al. ―Evolving the input space for decision tree building‖ 2005
[11] R.Ahmed et al ―Induction of Better Decision Trees Using Population
Oriented Multi-Objective Simulated Annealing‖, 7th International
Conference on Computer and Information Technology 2004
[12] Fu Et Al. ―A Genetic Algorithm-Based Approach For Building Accurate
Decision Trees Informs‖ Journal On Computing 2003 Vol. 15, No.1,
ISSN:1526-5528
[13] J.Dvoˇr´Ak , P.Savick´Y ―Softening Splits In Decision Trees Using
Simulated Annealing‖ 2006
[14] A.M.Mahmood et al. ―A New Decision Tree Induction Using Composite
Splitting Criterion‖ Journal Of Applied Computer Science & Mathematics,
No. 9 (4) /2010
[15] S.H. Cha, Ch.Tappert ―A Genetic Algorithm For Constructing Compact
Binary Decision Trees‖ Journal Of Pattern Recognition Research 1 (2009)
pp.1-13
[16] K.B. Bennett, J.A.Blue ―An Extreme Point Tabu Search Method For Data
Mining‖ 2007
[17] N.Mishra et al., ―Hybrid Tabu-Simulated annealing based approach to solve
multi-constraint product mix decision problem‖ Expert Systems with
Applications 2005 Volume 29, Issue 2, pp.446-454
[18] Yi Jiang ―Credit Scoring Model Based on the Decision Tree and the
Simulated Annealing Algorithm‖ Computer Science and Information
Engineering, 2009 WRI World Congress Vol.4, pp. 18 – 22, ISBN: 978-0-
7695-3507-4
[19] Glover, F. & Laguna, M. 1997. Tabu search. Boston: Kluwer Academic
Publishers.
[20] J. Han, Data Mining: Concepts and Techniques, Morgan Kaufmann
Publishers Inc., San Francisco, CA, USA, 2001.
[21] M. E. Aydin, T. C. Fogarty. ‖A Distributed Evolutionary Simulated
Annealing Algorithm for Combinatorial Optimization Problems‖, in Journal
of Heuristics 2004, vol. 24, no. 10, pp. 269–292.
[22] R. Battiti. ‖Reactive search: towards self-tuning heuristics‖, in Modern
heuristic search methods. Wiley&Sons, 1996, pp. 61-83.
[23] Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and
Machine Learning. Addison-Wesley Publishing Company, Inc., Reading,
MA

Currently there are no Refbacks

Paper Title : Secure Information Recovery for Decentralized Interruption Tolerant Defense Data Network
Authors : Korra Bichya, ,
Affiliations :
Abstract :

af

Portable nodes in military environments, for example, a front line or an antagonistic area are prone to experience the undergo of irregular system network and frequent partitions. Interruption tolerant network (ITN) innovations are getting to be fruitful results that permit remote device conveyed by officers to speak with one another and access the secret data or summon dependably by abusing outside capacity nodes. Probably the most difficult issues in this situation are the requirement of approval arrangements and the strategies redesign for secure information recovery. Ciphertext-policy attribute-based encryption (CP-ABE) is a guaranteeing cryptographic answer for the right to gain entrance control issues. In any case, the issue of applying CP-ABE in decentralized DTNs presents a few securities and protection challenges as to the property disavowal, key escrow, and coordination of characteristics issued from distinctive powers. In this paper, we propose a safe information recovery plan utilizing CP-ABE for decentralized DTNs where numerous key powers deal with their qualities autonomously. We show how to apply the proposed mechanism to safely and proficiently deal with the classified information dispersed in the. Interruption tolerant network (ITN)
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Interruption tolerant network (ITN), Ciphertext-policy attribute-based encryption (CP-ABE), Information Recovery.

Korra Bichya."Secure Information Recovery for Decentralized Interruption Tolerant Defense Data Network". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 03,pp.119-126, SEPTEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I31.pdf,

[1]. Junbeom Hur and Kyungtae Kang, Member, IEEE, ACM “Secure
Data Retrieval for Decentralized Disruption-Tolerant Military
Networks”-IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 22,
NO. 1, FEBRUARY 2014.
[2]. S. Rafaeli and D. Hutchison, “A survey of key management for
secure group communication,” Comput. Surv., vol. 35, no. 3, pp. 309–
329,2003.
[3] S. Mittra, “Iolus: A framework for scalable secure multicasting,” in
Proc. ACM SIGCOMM, 1997, pp. 277–288.
[4] P. Golle, J. Staddon, M. Gagne, and P. Rasmussen, “A content-driven
access control system,” in Proc. Symp. Identity Trust Internet, 2008,pp.
26–35.
[5] L. Cheung and C. Newport, “Provably secure ciphertext policy
ABE,”in Proc. ACM Conf. Comput. Commun. Security, 2007, pp. 456–
465.
[6] V. Goyal, A. Jain, O. Pandey, and A. Sahai, “Bounded ciphertext
policy attribute-based encryption,” in Proc. ICALP, 2008, pp. 579–591.
[7] X. Liang, Z. Cao, H. Lin, and D. Xing, “Provably secure and efficient
bounded ciphertext policy attribute based encryption,” in Proc. ASI
ACCS, 2009, pp. 343–352.
[8] S. S. M. Chow, “Removing escrow from identity-based encryption,”
in Proc. PKC, 2009, LNCS 5443, pp. 256–276.
[9] C. K. Wong, M. Gouda, and S. S. Lam, “Secure group
communications using key graphs,” in Proc. ACM SIGCOMM, 1998, pp.
68–79.
[10] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K.
Fu,“Plutus: Scalable secure file sharing on untrusted storage,” in
Proc.Conf. File Storage Technol., 2003, pp. 29–42

Currently there are no Refbacks

 


Paper Title : Offloading Mobile Computation to Save Energy in Cloud Computing
Authors : Nagaraj Meghashree, M.Sri Lakshmi, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br>Head of the Department, Department of CSE, G.Pullaiah College of Engineering and Technology, Kurnool, JNTU Anatapur, Andhra Pradesh, India.
Abstract :

af

The movement in the Technology has made exceptionally fundamental gadgets of, for example, ethereal telephones of late 80's and Pentium 4 processor into today's stock. No one is tantamount to the power of advanced cells of this era whose current market has been arrived at its unfathomable stature. We search the Web, send emails, organize our lives, watch features, transfer information on informal communities, use web keeping money, find our path by utilizing GPS and online maps, and impart in progressive courses through advanced cells. A lot of people new applications are developing at an extraordinary way. We felt excited while utilizing advanced cells by introducing and taking care of new applications, however less content with the battery lifetime. Vitality effectiveness is the key thought for the portable framework. Cloud computing can possibly spare portable customer vitality. Be that as it may the investment funds from offloading the computation need to surpass the vitality expense of the extra correspondence. In the event that the applications are more computationally escalated they could be offloaded or else they might be run in the versatile framework itself. Offloading is possible from portable framework to lattice field servers where computation is performed. Offloading relies on upon different parameters, for example, vitality utilization and bandwidth. Offloading, in any case, causes protection concerns on the grounds that delicate information may be sent to servers. The protection might be secured by utilizing two methods, for example, Encryption of information and Steganography in processing offloading.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Bandwidth, Battery lifetime, Cloud Computing, Computations, Encryption, Offloading, Smart Phones, Steganography.

Nagaraj Meghashree,M.Sri Lakshmi,Dr.S.Prem Kumar."Offloading Mobile Computation to Save Energy in Cloud Computing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 02,pp.111-118, August - 2014, URL :https://ijcert.org/ems/ijcert_papers/volume_1_Issue_2_paper_6.pdf,

[1]K. Kumar and Y. H. Lu, “Cloud computing for
mobile users: Can offloading computation save
energy?” IEEE Computer, vol. 43, no. 4, pp. 51–
56,April 2010
[2]A. Miettinen and J. Nurminen, “Energy efficiency
of mobile clients incloud computing,” in Proc. of Hot
Cloud, pp 27-56,2010
[3]Hong et al. Energy Efficient Content-Based Image
Retrieval for Mobile Systems. In ISCAS, pages1673-
1676, 2009
[4]T-Mobile Forums, “A Message from Our Chief
Operations Officer, Jim Alling,” 6 Oct. 2009;
http://forums.t-mobile.com/t5/Previous-Sidekick Models/A-Message-From-Our-Chief-OperationsOfficer-Jim-Alling/m-p/200661.
[5]J. Paczkowski, “Iphone Owners Would Like to
Replace Battery,” All Things Digital, 21 Aug.
2009;
[6]Datta et al. Image Retrieval: Ideas,
Infuences, and Trends of the New Age. In ACM
Computing Surveys,pp{34-94} 2008.
[7]R. Wolski et al., “Using Bandwidth Data to Make
Computation Offloading Decisions,” Proc. IEEE Int’l
Symp. Parallel and Cloud Processing (IPDPS 08),
2008, pp.{ 1-8}
[8]R. McMillan, “Salesforce.com Warns Customers
of Phishing Scam,” PCWorld, 6 Nov. 2007;
http://www.pcworld.com/businesscenter/article/1393
53/salesforcecom_warns_customers_of_phishing_sca
m.html.
[9]C. Wang and Z. Li, “Parametric Analysis for
Adaptive Computation Offloading,” ACM SIGPLAN
Notices, vol. 39, no. 6, 2004, pp. {119-130}
[11]Zhang et al. Steganography with Least Histogram
Abnormality. In Computer Network Security, pp
{395-406}, 2003.
[10]Fridrich et al. Detecting LSB Steganography in
Colorand Gray-scale Images. In IEEE
Multimedia,volume 8, pages 22{28, 2001.

Currently there are no Refbacks

Paper Title : Organizing of Multipath Routing For Intrusion Lenience in Various WSNs
Authors : A.Rebekah Johnson, N.Parashuram, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br>Head of the Department, Department of CSE, G.Pullaiah College of Engineering and Technology, Kurnool, JNTU Anatapur, Andhra Pradesh, India.
Abstract :

af

In this paper we propose Organizing of Multipath Routing for Intrusion Lenience in Various WSNs sent in unattended environmental vitality reviving is troublesome. WSN fulfils application particular QoS necessities i.e., dependability, convenience, security and minimize vitality utilization to drag out framework valuable lifetime with restricted assets. The burdens of existing work incorporate repetition administration conspires that did not address overwhelming question movement. Uncertainty in multipath steering choice is because of the more elevated amount of interruption tolerance rate. The proposed work introduced Trust Based Neighbor Weighted Voting Plan to fortify interruption identification in WSN. It assesses the element radio scope of neighbor hubs. Weight limit is assessed for denoting the sensor hub as typical hub and noxious hub. It tosses the correspondence of interior malevolent hub by recognizing lower weight votes of relating sensor hub. It oversees the best WSN settings regarding the excess level utilized for an outsource multipart directing number of weighted votes interruption summon interim. WSN lifetime is boosted with a trust based weighted voting and handles simultaneous higher question movement.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


selective capture, multipath routing, intrusion detection, lifetime Maximization Wireless Sensor Network,

A.Rebekah Johnson,N.Parashuram,Dr.S.Prem Kumar."Organizing of Multipath Routing For Intrusion Lenience in Various WSNs". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 02,pp.104-110, August - 2014, URL :https://ijcert.org/ems/ijcert_papers/volume_1_Issue_2_paper_5.pdf,

[1]Hamid Al-Hamadi and Ing-Ray Chen (2013)
„Redundancy Management of Multipath Routing for
Intrusion Tolerance in Heterogeneous Wireless
Sensor Networks‟ Vol 10.
[2] V. Bhuse and A. Gupta, "Anomaly intrusion
detection in wireless sensor networks," J. High Speed
Netw.,vol. 15, no. 1, pp. 33-51, 2006.
[3] G. Bravos and A. G. Kanatas, "Energy
consumption and trade -offs on wireless sensor
networks," 16th IEEE Int. Symp. on Perso nal, Indoor
and Mobile Radio Communications , pp. 1279-1283,
2005.
[4] A. P. R. da Silva, M. H. T. Martins, B. P. S.
Rocha, A. A. F. Loureiro, L. B. Ruiz, and H. C. Wo
ng, "Decentralized intrusion detection in wireless
sensor networks," 1st ACM Workshop on Quality of
Service & Security in Wireless and Mobile Networks
, Montreal, Quebec, Canada, 2005.
[5] I.R. Chen, F. Bao, M. Chang, and J.H. Cho,
"Trust management for encounter -based routing in
delay tolerant networks" IEEE Globecom 2010
Miami, FL, Dec. 2010.
[6] W. B. Heinzelman, A. P. Chandrakasan, and H.
Balakrishnan, "An application -specific protocol
architecture for wireless microsensor networks,"
IEEE Trans. Wireless Commun., vol. 1, no. 4, pp.
660 -670, 2002.
[7] C. Karlof and D. Wagner, "Secure routing in
wireless sensor networks: attacks and
countermeasures,"IEEE Int. Workshop on Sensor
NetworkProtocols and Applications , pp. 113 -127,
2003.
[8] Y. Lan, L. Lei, and G. Fuxiang , "A multipath
secure routing protocol based on malicious node
detection,"
Control and Decision Conference , pp. 4323 -4328,
2009.

Currently there are no Refbacks

Paper Title : IP Fast Rerouting framework with Backup Topology
Authors : Laddagiri Kiranmai, K.Lakshmi, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br>Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology, Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

This paper portrays the distinctive IP quick rerouting plans utilizing reinforcement topology. This paper portrays the plan which goes under complete IPFRR casing function as per IETF (Internet engineering task force).the first segment gives the fundamental thought regarding the IPFRR utilized for the rerouting reason. The second area bargains about the diverse strategies utilized under IPFRR with ideas and illustrations. The third area depicts the essential three design situation for IPFRR. The fourth area gives the conclusion on the premise of the relative hypothetical studies made in the above segments and tries to discover the best for rerouting. The conclusion proposes that any of the single plan is not fit for expert voiding full scope, thus it demonstrates that to acquire a full scope of 100% these plans must be utilized as a part of a blend with alternate plans.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


IP Fast Reroute, Equal Cost Multiple Path, Congestion Avoidance, Special Node, And Backup Topology.

Laddagiri Kiranmai,K.Lakshmi,Dr.S.Prem Kumar."IP Fast Rerouting framework with Backup Topology". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 02,pp.96-103, August - 2014, URL :https://ijcert.org/ems/ijcert_papers/volume_1_Issue_2_paper_4.pdf,

[1] AudunFosselie Hansen “Fast Reroute in IP
Networks,” Doctoral Dissertation at the University of
Oslo, May 2007.
[2]PeterSzilagyi,ZoltanToth,”Design,Implementation
and Evaluation of an IP Fast ReRoute Prototype,”
Budapest University of Technology and Economics,
Faculty of Electrical Engineering and Informatics,
Dept. of Telecommunications and Media Informatics,
2008.
[3] Simon Tembo, Ken-ichiYukimatsu, Ryota
Takahashi, ShoeiKamamura, Takashi Miyamura,
KoheiShiomoto, ”A New Backup Topology Design
Method for Congestion Avoidance in IP Fast
Reroute,” International Journal of Net-works and
Communications 2012, 2(5): 123-131. 
[4] Wouter Tavernier,Dimitri Papadimitriou, Didier
Colle, Mario Pickavet, Piet Demeester, ” Automated
Learning of Loop-Free Alternate Paths for Fast ReRouting,” Department of Information Technology
(INTEC), Ghent University – IBBT, Gaston
Crommenlaan 8, 9050 Gent, Belgium,2011.
[5] S. Bryant, C. Filsfils, S.Previdi, M. Shand, “IP
Fast Reroute using tunnels”, internet-Draft Internet
Engineering Task Force, November 16, 2007.
[6] S. Bryant, M. Shand,”IP Fast Reroute
Framework,” internet-Draft , Internet Engineering
Task Force, January, 2010.
[7] S. Bryant, S. Previdi, M. Shand, ”IP Fast Reroute
Using Not-via Addresses”, internet-Draft , Internet
Engineering Task Force, December 21, 2011.

Currently there are no Refbacks

Paper Title : Messaging Among Mobility Groups in MANET
Authors : Jollu Jayachandrudu, K.Lakshmi, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br> Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology, Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Mobility in mobile ad hoc network (MANET) is chargeable for augmenting the overheads. MANET is assortment of multi-hop wireless mobile nodes that communicate with one another while not centralized management or established infrastructure. The present literature relies on single node’s mobility. During this paper, a replacement idea of cluster mobility is planned. Each node uses mobile Internet Protocol (IP) practicality. MANET is split into teams. Each cluster includes a cluster representative (CR). The CR could be a central purpose in a very cluster and chargeable for communication with different cluster. Once a cluster moves and joins different group, CR registers the full cluster itself. CR is assigned a Virtual Address (VA). Our intended premise saves network information measure by reducing the quantity of message changed. It conjointly reduces the routing table updates.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Mobile Ad HOC networks, Group Mobility, Cluster Registration, Group Representative and Virtual Address.

Jollu Jayachandrudu,K.Lakshmi,Dr.S.Prem Kumar."Messaging Among Mobility Groups in MANET". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 02,pp.90-95, August - 2014, URL :https://ijcert.org/ems/ijcert_papers/volume_1_Issue_2_paper_3.pdf,

[1] Breed,G,2007 Wireless ad hoc networks:
basicconcepts. High frequency electronics. pp 44-47.
[2] Grady, J. P. et al, 2003, influence of network
merger on address assignment strategies. Adaptive
Wireless System Group.
[3] Henemann, S. et al, 2004 Distributed IP address
assignment in wireless ad hoc network using distance
vector routing. Adaptive Wireless System Group.
[4] Koch, B. A. and Schmidt, J. R. 2004. Dynamic
mobile IP routers in ad hoc networks. Ad hoc
networks (IWWAN) OULU.
[5] Manner, M, 2006. Table driven routing protocols
in mobile. Wireless networks. Seminar on ad hoc
networks.
[6] Mohsin, M. and Parkash R, 2002. IP address
assignment in mobile ad hoc networks. Proceedings
of the Military Communication Conference 1002
MILCOM: 856-861.
[7] Tseng, C. et al, 2003 integrating mobile IP with
ad hoc networks. In IEEE Computer, pp 48-55.
[8] Zhao, L. et al, 1989. Secure dynamic gateway to
internet connectivity for ad hoc networks. NIST pp
305-319.

Currently there are no Refbacks

Paper Title : Privacy Preserving Information Brokering for Data Handling Frameworks
Authors : K.Samunnisa, K.Tarakeswar, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br>Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology, Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

In recent year’s organizations heave rising require for data imparting through oninterest access. Data handling frameworks have been proposed to associate vast scale inexactly unified information sources through a facilitating overlay, in which the intermediaries settle on steering choices to regulate customer questions to the asked for information servers. Numerous existing data handling frameworks expect that agents are trusted and accordingly just embrace server-side access control for information privacy. Notwithstanding, security of information area and informed buyer can even now be derived from metadata, (for example, inquiry and access control guidelines) traded inside the DHS, yet little consideration has been put on its assurance. In this paper, we propose a novel methodology to save protection of numerous stakeholders included in the data expediting procedure. We are among the first to formally characterize two security attacks, namely attribute-correlation attack and inference attack, and propose two countermeasure plans automaton segmentation and query segment encryption to safely impart the directing choice making obligation among a chose set of expediting servers. With extensive security investigation and trial results, we indicate that our methodology flawlessly incorporates the security requirement with question steering to give framework wide security with inconsequential overhead.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access control, data offering, Privacy Preserving information brokering, Automaton segmentation, Commutative encryption

K.Samunnisa,K.Tarakeswar,Dr.S.Prem Kumar."Privacy Preserving Information Brokering for Data Handling Frameworks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 02,pp.84-89, August - 2014, URL :https://ijcert.org/ems/ijcert_papers/volume_1_Issue_2_paper_2.pdf,

[1] F. Li, B. Luo, P. Liu, D. Lee, and C.-H.
Chu,‖Enforcing Secure and Privacy-Preserving
Information Brokering in Distributed Information
Sharing,‖ IEEE Transaction 2013.
[2] F. Li, B. Luo, P. Liu, D. Lee, and C.-H. Chu,
―Automaton segmentation:A new approach to
preserve privacy in XML information brokering,‖in
Proc. ACM CCS’07, 2007, pp. 508–518.
[3] E. Damiani, S. di Vimercati, S. Paraboschi, and
P.Samarati, ―Securing{XML} documents,‖ in Proc.
EDBT 2000, 2000, pp. 121–135.
[4] A. Carzaniga, M. J.Rutherford, andA.
L.Wolf,―Arouting scheme forcontent-based
networking,‖ in Proc.INFOCOM, Hong Kong,
2004,pp. 918–928
[5] Bart Kuijpers, Vanessa Lemmens, Bart Moelans,
―Privacy Preserving ID3 over Horizontally,
Vertically and Grid Partitioned Data‖, avrxi0803.155v1 [cs.db], 11 march 2008. Online:
http://arxiv.org/pdf/0803.1555.pdf
[6] Yaping Li, Minghua Chen, Qiwei Li, And Wei
Zhang ―Enabling Multilevel Trust In Privacy
Preserving Data Mining‖ , IEEE Transactions On
Knowledge And Data Engineering, Vol. 24, No.
9,September 2012.
[7] Kawatghare, Mr Mukesh, and Ms Pradnya
Kamble. "Review on Enforcing Secure And Privacy
Preserving Information Brokering In Distributed
Information Sharing", International Conference on
Advances in Engineering & Technology (ICAET),
ISSN: 2278 -0661, pp. 45-40, 2014.
[8] Srinivas, D. "Privacy-Preserving Public Auditing
In Cloud Storage Security." International Journal of
computer science and Information
Technologies,ISSN: 0975-9646, vol. 2, no. 6, pp.
2691-2693, 2011.
[9] Li, Fenjun, Bo Luo, Peng Liu, Dongwon Lee,
Prasenjit Mitra,Wang-Chien Lee, and Chao-Hsien
Chu "In-broker access control:Towards efficient endto-end performance of information brokerage
systems", In IEEE International Conference on
Sensor Networks,Ubiquitous, and Trustworthy
Computing, vol. 1, pp. 1-8-, 2006.
[10] Snoeren, Alex C., Kenneth Conley, and David
K. Gifford. "Meshbased content routing using XML."
ACM SIGOPS OperatingSystems Review 35, no. 5,
pp. 160-173, 2001.
[11] Koudas, Nick, Michael Rabinovich, Divesh
Srivastava, and Ting Yu. "Routing XML queries." In
Proceedings of IEEE 20th International Conference
on Data Engineering, pp. 844, 2004.
[12] Koloniari, Georgia, and Evaggelia Pitoura.
"Content-based routing of path queries in peer-topeer systems." In proceedings of Advances in
Database Technology-EDBT-2004, pp. 29-47,
Springer Berlin Heidelberg, 2004.
[9] A. Yao, ―Protocols for secure computations,‖ in
Proc. 23rd Ann. IEEE Symp. Foundations of
Computer Science, 1982, pp.160–164, IEEE
Computer Society.
[10] C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin,
and M. Y. Zhu, ―Tools for privacy preserving
distributed data mining,‖ ACM SIGKDD Expl

Currently there are no Refbacks

Paper Title : Intensification of Information safety by Cryptography in Cloud Computing
Authors : K.Sivanagalakshmi, R.Anil Kumar, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br> Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology, Kurnool JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Cloud computing security challenges and it’s additionally an issue to numerous analysts; first necessity was to concentrate on security which is the greatest concern of associations that are considering a move to the cloud. The points of interest of Cloud computing incorporate decreased expenses, simple upkeep and re-provisioning of assets, and consequently expanded benefits. Yet the appropriation and the section to the Cloud computing applies just if the security is guaranteed. Instructions to surety a finer information security furthermore in what manner would we be able to keep the customer private data secret? There are two real inquiries that present a test to Cloud computing suppliers. At the point when the information exchanged to the Cloud we utilize standard encryption routines to secure the operations and the stockpiling of the information. Anyhow to process information placed on a remote server, the Cloud suppliers need to get to the basic information. In this paper we are proposing Homomorphic encryption algorithm to execute operations on encoded information without decoding them which will give us the same comes about after computations as though we have worked straightforwardly on the basic information
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Homomorphic Encryption, Cloud Computing, Cryptography, Information Security

K.Sivanagalakshmi,R.Anil Kumar,Dr.S.Prem Kumar."Intensification of Information safety by Cryptography in Cloud Computing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 02,pp.77-82, August - 2014, URL :https://ijcert.org/ems/ijcert_papers/volume_1_Issue_2_paper_7.pdf,

[1]Vic (J.R.) Winkler, ”Securing the Cloud, Cloud
Computer Security, Techniques and Tactics”,
Elsevier, 2011.
[2] Pascal Paillier. Public-key cryptosystems based
on composite degree residuosity classes. In 18th
Annual Eurocrypt Conference (EUROCRYPT'99),
Prague, Czech Republic , volume 1592, 1999
[3] Julien Bringe and al. An Application of the
Goldwasser-Micali Cryptosystem to Biometric
Authentication, Springer-Verlag, 2007.
[4] R. Rivest, A. Shamir, and L. Adleman. A method
for obtaining digital signatures and public key
cryptosystems. Communications of the ACM, 21(2)
:120-126, 1978. Computer Science, pages 223-238.
Springer, 1999.
[5] Taher ElGamal. A public key cryptosystem and a
signature scheme based on discrete logarithms. IEEE
Transactions on Information Theory, 469-472, 1985.
[6] Craig Gentry, A Fully Homomorphic Encryption
Scheme, 2009. 

Currently there are no Refbacks

 


Paper Title : Higher Infer the Structures and Textures of the Missing Region through Examplar-Based Image Inpainting Algorithm
Authors : M.Sravana Sandhya, Shasikala.Ch, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br> Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Even though fabulous development happens in image process province, still “filling the missing spaces” is area of concern in it. Although mass of progress has been created within the past years, still lot effort to be done. A distinctive algorithmic rule is given for examplarbased inpainting. within the estimated algorithmic rule inpainting is applied on the coarse version of the input image, latter stratified primarily based super resolution algorithmic rule is employed to seek out the data on the missing areas. The distinctive issue of the projected technique is less complicated to inpaint low resolution than its counter half. To create inpainting image less sensitive to the parameter projected examplar-based patch propagation algorithmic rule on a spread of natural pictures. We tend to apply our algorithmic rule to the applications of text removal, object removal and block completion. We tend to compare our algorithmic rule with the previous diffusion-based, examplar-based, and sparsity-based inpainting algorithms. With the assistance of Comparisons, we'll show that the projected examplar-based patch propagation algorithmic rule will higher infer the structures and textures of the missing region, and manufacture sharp inpainting results per the encompassing textures.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Examplar-based, Filling-in, Image Inpainting, Patch-based Inpainting, super-resolution based inpainting.

M.Sravana Sandhya,Shasikala.Ch,Dr.S.Prem Kumar."Higher Infer the Structures and Textures of the Missing Region through Examplar-Based Image Inpainting Algorithm". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.54-60, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P8.pdf,

[1] M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester, “Image inpainting,” in Proc. SIGGRAPH, 2000, pp.
417–424.
[2] M. Bertalmio, A. L. Bertozzi, and G. Sapiro, “Navier–Strokes, fluid dynamics, and image and video inpainting,”
in Proc. IEEE Computer Society Conf. Computer Vision and Pattern Recognition, 2001,pp.417–424.
[3] T. Chan and J. Shen, “Local inpainting models and tv inpainting,”SIAM J. Appl. Math., vol. 62, no. 3, pp.
1019–1043, 2001.
[4] T. Chan and J. Shen, “Non-texture inpainting by curvature-driven diffusions,” J. Vis. Commun. Image
Represent., vol. 4, no. 12, pp.436–449, 2001.
[5] C. Bertalmio, M. Bertalmio, V. Caselles, G. Sapiro, and J. Verdera,“Filling-in by joint interpolation of vector
fields and gray levels,”IEEE Trans. Image Process., vol. 10, pp. 1200–1211, 2001.
[6] A. Levin, A. Zomet, and Y. Weiss, “Learning how to inpaint from global image statistics,” in Proc. Int. Conf.
Comp. Vision, pp.305–313.
[7] A. Criminisi, P. Perez, and K. Toyama, “Region filling and object removal by examplar- based image
inpainting,” IEEE Trans. Image Process., vol. 13, pp. 1200–1212, 2004.
[8] A. Buades, B. Coll, and J.-M. M orel, “Image denoising by non-local averaging,” in Proc. IEEE ICASSP, 2005,
vol. 2, pp. 25–28.
[9] K. Dabov, A. Foi, V. Katkovnik, and K. O.Egiazarian, “Image denoising by sparse 3-d transform-domain
collaborative filtering.,” IEEE rans. Image Process. , vol. 16, no. 8, pp. 2080–2095, Aug. 2007.
[10] J. Yang, J. Wright, T. Huang, and Y. Ma, “Image super resolution as sparse representation of raw image
patches,” in Proc. IEEE CVPR, 2008, pp.1–8.

Currently there are no Refbacks

Paper Title : Consistent Data Release in MANET Using Light Weight Verification Algorithm with High Node Mobility
Authors : B.Natraj Kumar, M.Sri Lakshmi, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br>Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

This paper addresses data aggregation and data packets problems for extremely dynamic mobile temporary networks and Wireless sensor Networks thereby resulting in a timely and reliable reduction in each communication and energy consumption. However there may be node failures in existing systems Associate in an aggregation framework doesn't address problems with false sub-aggregate values down to compromised nodes resulting in massive errors in base station computed aggregates once data is transferred through mobile device nodes. It cannot conjointly transfer data when nodes fail at the intermediate level. This paper proposes a completely unique light-weight verification rule and Position primarily based timeserving Routing (PTR) protocol that reduces node failure and knowledge loss problems. Theoretical analysis and simulation prove that PTR and also the novel light-weight verification rule succeed glorious performance below high node quality with acceptable overhead. Conjointly the new void handling theme performs expeditiously.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Geographic routing, opportunistic forwarding, reliable data delivery, void handling, mobile ad hoc network, Base station, data aggregation, hierarchical aggregation, in-network aggregation, sensor network security, synopsis diffusion

B.Natraj Kumar,M.Sri Lakshmi,Dr.S.Prem Kumar."Consistent Data Release in MANET Using Light Weight Verification Algorithm with High Node Mobility". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.44-53, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P7.pdf,

[1] Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W.(2002). TAG: A tiny aggregation service for ad-hoc
sensor networks. ACM SIGOPS Operating Systems Review, 36(SI),131-146.
[2] Law, Y. W., Palaniswami, M., &Phan, R. C. W. (2009). Secure Data Aggregation in Wireless Sensor Networks.
Guide to Wireless Sensor Networks, 533-559.
[3] Considine, J., Li, F., Kollios, G., & Byers, J. (2004, March). Approximate aggregation techniques for sensor
databases. In Data Engineering, 2004. Proceedings. 20th International Conference on (pp. 449-460). IEEE.
[4] Garofalakis, M., Hellerstein, J. M., &Maniatis, P. (2007,April). Proof sketches: Verifiable in-network
aggregation. In Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on (pp. 996-1005). IEEE.
[5] Yu, H. (2011). Secure and highly-available aggregation queries in large-scale sensor networks via set
sampling.Distributed Computing, 23(5), 373-394.
[6] Frikken, K. B., & Dougherty IV, J. A. (2008, March). An efficient integrity-preserving scheme for hierarchical
sensor aggregation. In Proceedings of the first ACM conference on Wireless network security (pp. 68-76). ACM.
[7] Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y. C., &Jetcheva, J. (1998, October). A performance comparison of
multi-hop wireless ad hoc network routing protocols. In Proceedings of the 4th annual ACM/IEEE international
conference on Mobile computing and networking (pp. 85-97). ACM.
[8] Karp, B., & Kung, H. T. (2000, August). GPSR: Greedy perimeter stateless routing for wireless networks. In
Proceedings of the 6th annual international conference on Mobile computing and networking (pp. 243-254). ACM.
[9] Arad, N., &Shavitt, Y. (2009). Minimizing recovery state in geographic ad hoc routing. Mobile Computing,
IEEE Transactions on, 8(2), 203-217.
[10] Ganesan, D., Govindan, R., Shenker, S., &Estrin, D. (2001).Highly-resilient, energy-efficient multipath routing
in wireless sensor networks. ACM SIGMOBILE Mobile Computing and Communications Review, 5(4), 11-25.
[11] Ye, Z., Krishnamurthy, S. V., &Tripathi, S. K. (2003, March). A framework for reliable routing in mobile ad hoc networks. In INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies (Vol. 1, pp. 270-280). IEEE.

Currently there are no Refbacks

Paper Title : An Enhanced Predictive Proportion using TMP Algorithm in WSN Navigation
Authors : Tekur Vijetha, M.Sri Lakshmi, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br>Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Numerous organizing toward oneself sensor nodes may work together and build a disseminated monitoring, wireless Sensor Network (WSN) later on. Recently, various WSN applications have been utilizing GPS gadgets to track and place the position of the remote sensor nodes. Because of costly hardware assets and power requirements of the sensor nodes, the use of GPS equipment in WSN application is still unattainable. The target following frameworks which are as of now being used assessing the position of moving target focused around estimations on Received Signal Strength (RSS), Time of Arrival (TOA), Angle of Arrival (AOA) and Time Difference of Arrival (TDOA). These estimations are less judicious for the application, which requires exceedingly exact target following. This paper proposes a Target Movement Prediction Algorithm (TMPA) focused around topological directions. TMPA utilizes Topological Preserving Maps (TPM) to track and explore the area of the target and Adaptive Weighted Target Tracking (AWTT) procedure consolidates blame and enhances the precision in the expectation. Our reenactment results indicate that the time taken to distinguish the target developments is impressively low and change in forecast degree.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Wireless Sensor Networks, Time Difference of Arrival ,Target Movement Prediction Algorithm, Topological Preserving Maps,Adaptive Weighted Target Tracking. Angle of Arrival,

Tekur Vijetha,M.Sri Lakshmi,Dr.S.Prem Kumar."An Enhanced Predictive Proportion using TMP Algorithm in WSN Navigation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.37-43, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P6.pdf,

[1]. A.H. Sayed, A. Tarighat, and N. Khajehnouri, “Network-Based Wireless Location: Challenges Faced in
Developing Techniques for
Accurate Wireless Location Information,” IEEE Signal Processing Magazine, vol. 22, no. 4, pp. 24-40, July 2005.
[2]. N. Patwari, J.N. Ash, S. Kyperountas, A. Hero, R.L. Moses, and N.S. Correal, “Locating the Nodes:
Cooperative Localization in Wireless Sensor Networks,” IEEE Signal Processing Magazine, vol. 22, no. 4, pp. 54-
69, July 2005.
[3]. P.H. Tseng, K.T. Feng, Y.C. Lin, and C.L. Chen, “Wireless Location Tracking Algorithms for Environments
with Insufficient Signal Sources,” IEEE Trans. Mobile Computing, vol. 8, no. 12, pp. 1676- 1689, Dec. 2009.
[4]. Y. Zou and K. Chakrabarty, “Distributed Mobility Management for Target Tracking in Mobile Sensor
Networks,” IEEE Trans. Mobile Computing, vol. 6, no. 8, pp. 872-887, Aug. 2007.
[5]. Enyang Xu and Zhi Ding, “ Target Tracking and Mobile Sensor Navigation in Wireless Sensor Networks,”
IEEE Trans.Mobile Computing, vol.12, no. 1, pp. 177-195, Jan. 2013.
[6]. D. C. Dhanapala and A. P. Jayasumana, “Topology Preserving Maps from Virtual Coordinates for Wireless
Sensor Networks,” Proc. 35th IEEE Conf. on Local Computer Networks, 2010, pp. 136–143.
[7] Asis Nasipuri and Kai Li. A Directionality based Location Discovery Scheme for Wireless Sensor Networks.
WSNA ‟02 Atlanta, Georgia, September 28, 2002.
[8] R.R. Brooks, P. Ramanathan and A.M. Sayeed. Distributed Target Classification and Tracking in Sensor
Networks. Special Issue in Sensor Networks, Revision, January 2003.
[9] Nirupama Bulusu, Deborah Estrin, Lewis Girod and John Heidemann. Scalable Coordination for Wireless
Sensor Networks: Self-Configuring Localization Systems. Proceedings of ISCTA 2001, Lake Ambleside, UK, July
2001. Invited Paper.
[10] R. Olfati-Saber and N. F. Sandell, “Distributed tracking in sensor networks with limited sensing range,” in
Proc. of American Control Conference, 2008, pp. 3157–3161. 

Currently there are no Refbacks

Paper Title : Price Discrimination in Communication Networks
Authors : B.Asha Singh, M.Sri Lakshmi, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>M.Tech Research Scholar</br>Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

We study the best usage-based rating downside in an incredibly resource-constrained network with one increasing service supplier and multiple teams of surplus-maximizing users. With the idea that the service supplier is aware of the utility operate of every user (thus complete information), we discover that the entire value differentiation theme can do an over sized revenue gain (e.g., 50%) compared to no value differentiation, once the entire network resource is comparably restricted and therefore the high-willingness-to-pay users are minorities. However, the entire value differentiation theme could result in a high implementation quality. To trade off the revenue against the implementation complexity; we tend to any study the partial value differentiation theme and style a polynomial-time formula which will cipher the best partial differentiation costs. We tend to additionally think about the unfinished data case wherever the service supplier doesn't understand to that cluster every user belongs. We tend to show that it's still doable to comprehend value differentiation beneath this situation and supply the sufficient and necessary condition under that an incentive-compatible differentiation theme can do similar revenue as beneath complete data.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Network pricing, price differentiation, resource allocation, revenue management.

B.Asha Singh,M.Sri Lakshmi,Dr.S.Prem Kumar."Price Discrimination in Communication Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.30-36, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P5.pdf,

[1] S. Li, J.Huang, and S-YR.Li, “Revenuemaximization for communication networks with usage-based pricing,” in
Proc. IEEE GLOBECOM,2009, pp. 1–6.
[2] F. Kelly, “Charging and rate control for elastic traffic,” Eur. Trans. Telecommun., vol. 8, no. 1, pp. 33–37, 1997.
[3] F. Kelly, A. Maulloo, and D. Tan, “Rate control for communication networks: shadow prices, proportional
fairness and stability,” J. Oper.Res. Soc., vol. 49, no. 3, pp. 237–252, 1998
[4] S. Low and D. Lapsley, “Optimization flow control: basic algorithm and convergence,” IEEE/ACMTrans.Netw.,
vol. 7, no. 6, pp. 861–874,Dec. 1999.
[5] Basar, T. and Srikant R., “Revenue-maximizing pricing and capacity expansion in a many-users regime,”
Proceedings of INFOCOM, 2002.
[6] Beckmann, M., Mcguire, C. B., and Winsten, C. B., Studies in the Economics of Transportation. Yale University
Press, 1956.
[7] Correa, J. R., Schulz, A. S., and Stier Moses, N., “Selfish routing in capacitated networks,” Mathematics of
Operations Research, 29:4, pp. 961-976, Nov. 2004.
[8] Dafermos, S. and Sparrow F. T., “The traffic assignment problem for a general network,” Journal of Research of
the National Bureau of Standards-B. Mathematical Sciences, vol. 73(2), pp.91-118, 1969.
[9] Dasgupta, P. and Maskin E., “The existence of equilibrium in discontinuous economic games. 2: Theory,”
Review of Economic Studies, vol. 53, pp. 1-26, 1986.
[10] Friedman, E., “A Generic Analysis of Selfish Routing,”Proceedings of the 43rd IEEE Conference on Decision
and Control, 2004.
[11] Fudenberg, D. and Tirole J., Game Theory. The MIT Press,1991.
[12] Harsanyi, J., “Games with Randomly Distributed Payoffs: a New Rationale for Mixed Strategy Equilibrium
Points” International Journal of Game Theory, vol. 1, pp. 1-23.
[13] Hayrapetyan, A., Tardos, E., and Wexler T., “A network pricing game for selfish traffic,” Journal of
Distributed Computing,2005.
[14] He, L. and Walrand, J., “Pricing internet services with multiple providers,” Proceedings of Allerton
Conference, 2003.
[15] Huang, X., Ozdaglar, A., and Acemoglu, D., “Efficiency and Braess’ paradox under pricing in general
networks,” forthcoming JSAC Special issue: Price-Based Access Control and Economics for Communication
Networks.

Currently there are no Refbacks

Paper Title : Privacy Preserving Data Sharing With Anonymous ID Assignment Using AIDA Algorithm
Authors : Allam.Jyothi, A.Kusuma, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br> Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

In contemporary world web has created a leeway into daily lives with all information being hold on during a server of some type so spread or employed in the style required. this can be confined to multiple applications like patient medical records, balloting details, banking, social networking, email, analysis etc. however the identity has to be preserved for each the information and therefore the owner because the case is also that is more and {more} turning into a drag with additional and more identities allotted to the information particularly just in case of distributed server sharing. Existing solutions target the central server model that is computationally costly, includes a immense information measure exchange, information security is compromised and therefore not fitted to the distributed model hip currently. The proposed work focuses on the distributed side of computing wherever the IDs are anonymous employing a distributed computation with no central authority and such IDs will be used as a part of schemes for sharing or dividing communications information measure, information storage, and alternative resources anonymously and while not convict. it's doable to use secure add to permit one to opt-out of a computation beforehand on the premise of sure rules in applied mathematics revealing limitation. These model suites for the distributed computing model with Anonymous ID assignment wherever procedure overhead is low, information measure consumption is additionally less. The AIDA algorithm is applied serially and therefore is secure, however chiefly the distributed nature of the information sharing system is sustained. The protocol for privacy conserving mistreatment anonymous id assignment is no-hit.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Privacy, Anonymity, Distributed Computing Systems, secure multiparty computation, Anonymization, Deanonymization, privacy preserving data mining, privacy protection.

Allam.Jyothi,A.Kusuma,Dr.S.Prem Kumar."Privacy Preserving Data Sharing With Anonymous ID Assignment Using AIDA Algorithm". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.23-29, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P4.pdf,

[1] Sarbanes–Oxley Act of 2002, Title 29, Code of Federal Regulations, Part 1980, 2003.
[2] White Paper—The Essential Guide to Web Analytics Vendor Selection, IBM [Online]. Available:
http://measure.coremetrics.com/corem/getform/reg/wp-evaluation-guide
[3] A. Shamir, ―How to share a secret,‖ Commun. ACM, vol. 22, no. 11, pp. 612–613, 1979.
[4] A. Friedman, R. Wolff, and A. Schuster, ―Providing k-anonymity in data mining,‖ VLDB Journal, vol. 17, no. 4,
pp. 789–804, Jul. 2008.
[5] F. Baiardi, A. Falleni, R. Granchi, F. Martinelli, M. Petrocchi, and A. Vaccarelli, ―Seas, a secure e-voting
protocol: Design and implementation,‖ Comput. Security, vol. 24, no. 8, pp. 642–652, Nov. 2005.
[6] D. Chaum, ―Untraceable electronic mail, return address and digital pseudonyms,‖ Commun. ACM, vol. 24, no.
2, pp. 84–88,Feb. 1981.
[7] Q. Xie and U. Hengartner, ―Privacy-preserving matchmaking for mobile social networking secure against
malicious users,‖ in Proc. 9th Ann. IEEE Conf. Privacy, Security and Trust, Jul. 2011, pp. 252–259.
[8] O. Goldreich, S. Micali, and A. Wigderson, ―How to play any mental game,‖ inProc. 19th Ann. ACM Conf.
Theory of Computing, Jan. 1987, pp. 218–229, ACM Press
[9] A. Yao, ―Protocols for secure computations,‖ in Proc. 23rd Ann. IEEE Symp. Foundations of Computer Science,
1982, pp.160–164, IEEE Computer Society.
[10] C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M. Y. Zhu, ―Tools for privacy preserving distributed data
mining,‖ ACM SIGKDD Expl

Currently there are no Refbacks

Paper Title : Ontology Based PMSE with Manifold Preference
Authors : Mubasheera Tazeen, Shasikala.Ch, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br> Assistant Professor</br>Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

Data mining is a framework utilizing for more machine learning strategy to naturally examine and Extricating learning from data put away in the database. The objective of data mining is to concentrate concealed prescient Data from the database. This paper makes utilization of data mining idea for gathering client's numerous inclinations from navigates data. The gathering client inclination is focused around the substance and the area ideas. In the existing system, RSVM calculation doesn’t perform re-positioning for various inclinations. To defeat this inconvenience, the proposed work is focused around PRRA calculation. This calculation is utilized to discover the most limited ways which help us to show signs of improvement result. PMSE think all the more about security which focused around client and in the addition area by leveraging the measure of substance. To portray the assorted qualities of the ideas connected with an inquiry and their significance's to the client's need, four entropies are acquainted with offset the weights between the substance and area features [11].
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Click through, Multiple preference, Search engine

Mubasheera Tazeen,Shasikala.Ch,Dr.S.Prem Kumar."Ontology Based PMSE with Manifold Preference". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.15-21, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P3.pdf,

[1] Y.-Y. Chen, T. Suel, and A. Markowetz, “Efficient Query Processing in Geographic Web Search Engines,” Proc.
Int’l ACMSIGIR Conf. Research and Development in Information Retrieval(SIGIR), 2006.
[2] E. Agichtein , E. Brill, and S. Dumais, “Improving Web Search Ranking by Incorporating User Behavior
Information,” Proc. 29thAnn. Int’l ACM SIGIR Conf. Research and Development in InformationRetrieval (SIGIR),
2006.
[3] T. Joachims, “Optimizing Search Engines Using ClickthroughData,” Proc. ACM SIGKDD Int’l Conf.
Knowledge Discovery and DataMining, 2002.
[4] K.W.-T. Leung, W. Ng, and D.L. Lee, “Personalized Concept-Based Clustering of Search Engine Queries,”
IEEE Trans. Knowledge and Data Eng., vol. 20, no. 11, pp. 1505-1518, Nov.2008.
[5] B. Liu, W.S. Lee, P.S. Yu, and X. Li, “Partially Supervised Classification of Text Documents,” Proc. Int’l Conf.
Machine Learning (ICML), 2002.
[6] J. Teevan, M.R. Morris, and S. Bush, “Discovering and Using Groups to Improve Personalized Search,” Proc.
ACM Int’l Conf. Web Search and Data Mining (WSDM), 2009.
[7] S. Yokoji, “Kokono Search: A Location Based Search Engine,”Proc. Int’l Conf. World Wide Web (WWW),
2001.
[8] Fang Liu, Clement Yu, and Weiyi Meng “Personalized Web Search for Improving Retrieval Effectiveness”
IEEE Trans. Knowledge and Data Eng., Vol. 16, No. 1, January 2004
[9]http://www.chennaisunday.com/IEEE%202013%20Java/PMSE%20A%20Personalized%20Mobile%20Search%2
0Engine.doc
[10] http:/ /neuron.csie.ntust.edu.tw/homework/ 99/ NN/ homework3/ M9915908-hw3-1/ Approaches.htm
[11] http://www.anderson.ucla.edu/faculty/jason.frand/teacher/technologies/palace/datamining.htm
[12] http://www.thearling.com/text/dmwhite/dmwhite.htm
[13] http://www.jfsowa.com/ontology/
[14] http://www.irma-international.org/book/data-mining-ontologies/234/
[15] http://www.kresttechnology.com/krest-academicprojects/krestmtech projects/ CSE/ abstracts/ data%20mining/
21.doc
[16] http://en.wikipedia.org/wiki/Knowledge_discovery

Currently there are no Refbacks

Paper Title : Green Computing: A Methodology of Saving Energy by Resource Virtualization.
Authors : V.Rohini, R. Sandeep Kumar, Dr.S.Prem Kumar
Affiliations : M.Tech Research Scholar</br>Assistant Professor</br>Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology JNTU Anatapur, Andhra Pradesh, India
Abstract :

af

In the past a couple of years computer standard was moved to remote data farms and the software and hardware services accessible on the premise of pay for utilize .This is called Cloud computing, In which client needs to pay for the Services .Cloud give the Services – Programming as a Service ,stage as a Service and foundation as a Service .These Services gave through the remote server farms (since the information is scattered/disseminated over the web.), as Programming requisition and different Services relocated to the remote server farm ,Service of these server farm in the imperative. Server farm Service confronts the issue of force utilization. At present Cloud computing based framework squander an extraordinary measure of force and produces co2. Since numerous servers don't have a decent quality cooling framework. Green Computing can empower more vitality proficient utilization of computing power .This paper indicates the prerequisite of Green Computing and methods to spare the vitality by distinctive methodologies
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud Computing, Green computing; N-Computing; Save Energy; Future computers; Virtualization; Computer Virtualization

V.Rohini,R. Sandeep Kumar,Dr.S.Prem Kumar."Green Computing: A Methodology of Saving Energy by Resource Virtualization.". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.6, Issue 04,pp.8-14, April - 2019, URL :https://ijcert.org/ems/ijcert_papers/P2.pdf,

[1] Zhiwu Liu, Ruhui Ma, Fanfu Zhou, Yindong Yang, Zhengwei Qi, Haibing Guan” Power-aware I/OIntensive and CPU-Intensive Applications Hybrid Deployment within Virtualization Environments” IEEE
2010.
[2] R.Yamini, Assistant Professor “Power Management in Cloud Computing Using Green Algorithm”
(ICAESM-2012) MARCH 2012.
[3] Wang, D., “Meeting Green Computing Challenges,” Proceeding of the International Symposium on
High Density Packaging and Microsystem Integration, 2007 (HDP ’07), IEEE, 2007.
[4] R. Bianchini and R.Rajamony, "power and energy management for server systems," IEEE Computer,
voI.37, no. ll,pp.68-74, 2004.
[5] http://www.wisegeek.com/what-is-green-computing.htm.
[6] http://bipublication.com “.GREEN COMPUTING SAVES GREEN”.
[7] “Green Computing: Go Green and Save Energy” International Journal of Advanced Research in
Computer Science and Software Engineering, Volume 3, Issue 7, July 2013 ISSN: 2277 128X
[8] Zhiwu Liu, Ruhui Ma, Fanfu Zhou, Yindong Yang, Zhengwei Qi, Haibing Guan” Power-aware I/OIntensive and CPU-Intensive Applications Hybrid Deployment within Virtualization Environments” IEEE
2010.
[9] “A Study about Green Computing” International Journal of Advanced Research in Computer Science
and Software Engineering, Volume 3, Issue 6, June 2013 ISSN: 2277 128X
[10] Prof. Riyaz A. Sheikh and Dr. U.A. Lanjewar.” Green Computing- Embrace a Secure Future”
International Journal of computer Applications (0975-8887) vol-10-N4 November 2010. 

Currently there are no Refbacks

Paper Title : User Adaptive Mobile Video Streaming and Resourceful Video Sharing in Cloud
Authors : Kamarthi Rekha, R. Vara Prasad, Dr. S. Prem kumar
Affiliations : M.Tech Research scholar, Department of CSE G. Pullaiah College of Engineering & Technology</br>M.Tech, Asst.Professor Department of CSE G. Pullaiah College of Engineering & Technology</br>Head of the Department Department of Computer Science & Engineering G. Pullaiah College of Engineering & Technology
Abstract :

af

Over the past decade The mobile phones breed to be a necessary part of our daily life, Smartphone uses more than basic phones much and also user demands to run lots of applications have improved The conquest of next design mobile phone communication based on the capability of service suppliers to engineer. The Streams are programmed by the Scalable Video Coding expansion of the H.264/AVC model. Adding or removing the layer is determined on the basis of the user behavior environment of the mobile system. The current advances in the mobile video streams greater than mobile networks have been souring more than these new trends, increasingly more traffic is accounted by video streaming and downloading. While the video streaming is not so demanding in wired networks, mobile networks have been misery from video traffic transmissions ended scarce bandwidth of wireless links instead of network operators frantic hard work to augment the wireless link bandwidth (e.g., 3G and LTE), elevated video transfer load from mobile users are quickly vast the wireless connection capacity. Though receiving video streaming transfer via 3G/4G mobile networks, mobile users regularly undergo from lengthy buffering time and irregular disruptions due to the restricted bandwidth and connection stipulation variation caused by multi-path vanishing and user mobility. Thus, it is vital to advance the service excellence of mobile video streaming while using the networking and computing assets resourcefully.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Adaptive mobile video streaming, Cloud Computing, Scalable Video Coding,H.264/AVC.model,Scalable video coding

Kamarthi Rekha,R. Vara Prasad,Dr. S. Prem kumar."User Adaptive Mobile Video Streaming and Resourceful Video Sharing in Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.1-7, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P1.pdf,

[1] Y. Li, Y. Zhang, and R. Yuan,” Measurement and analysis of a large scale commercial mobile Internet TV
system,” in Proc. ACM Internet Meas. Conf., 2011, pp.209-224.
[2] T. Taleb and K. Hashimoto, “MS2: A novel multisource mobile streaming architecture,” IEEE
Trans.Broadcasting, vol. 57, no.
[3] X. Wang, S. Kim, T. Kwon, H. Kim, and Y. choi,“Unveiling the bit torrent performance in mobile WiMAX
networks,” in Proc. Passive Active Meas.Conf., 2011, pp.184-193.
[4] A. Nafaa, T. Taleb, and L. Murphy, “Forward error correction adaptation strategies for media streaming over
wireless networks,” IEEE Commun, Mag., vol. 46, no. 1,pp. 72-79, Jan. 2008.
[5] A. Nafaa, T. Taleb, and L. Murphy, “Forward error correction adaptation strategies for media streaming over
wireless networks,” IEEE Commun. Mag., vol. 46, no. 1, pp. 72–79, Jan. 2008.
[6] J. Fernandez, T. Taleb, M. Guizani, and N. Kato, “Bandwidth aggregation-aware dynamic QoS negotiation for
real-time video applications in next-generation wireless networks,” IEEE Trans. Multimedia, vol.11, no. 6, pp.
1082–1093, Oct. 2009.
[7] T. Taleb, K. Kashibuchi, A. Leonardi, S. Palazzo, K. Hashimoto, N. Kato, and Y. Nemoto, “A cross-layer
approach for an efficient delivery of TCP/RTP-based multimedia applications in heterogeneous wireless networks,”
IEEE Trans. Veh. Technol., vol. 57, no. 6, pp. 3801–3814,Jun. 2008
[8] K. Zhang, J. Kong, M. Qiu, and G. L. Song,“Multimedia layout adaptation through grammatical specifications,”
ACM/SpringerMultimedia Syst., vol. 10, no. 3, pp. 245–260, 2005.
[9] M. Wien, R. Cazoulat, A. Graffunder, A. Hutter, and P. Amon, “Real-time system for adaptive video streaming
based on SVC,” IEEE Trans. Circuits Syst. Video Technol., vol. 17, no. 9,pp.1227–1237, Sep. 2007.
[10] H. Schwarz, D. Marpe, and T. Wiegand, “Overview of the scalable video coding extension of the H.264/AVC
standard,”IEEE Trans. Circuits Syst. Video Technol., vol. 17, no. 9,pp. 1103–1120, Sep. 2007.
[11] H. Schwarz and M. Wien, “The scalable video coding extension of the H. 264/AVC standard,” IEEE Signal
Process. Mag., vol. 25, no. 2, pp. 135–141, Feb. 2008.
[12] P. McDonagh, C. Vallati, A. Pande, and P. Mohapatra, “Quality-oriented scalable video delivery using H. 264
SVC on an LTE network,” in Proc. WPMC, 2011.
[13] Q. Zhang, L. Cheng, and R. Boutaba, “Cloud computing: State-oftheart and research challenges,” J. Internet
Services Applic., vol. 1, no. 1, pp. 7–18, Apr. 2010.
[14] D. Niu, H. Xu, B. Li, and S. Zhao, “Quality-assured cloud bandwidth auto-scaling for video-on-Demand
applications,” in Proc.IEEE INFOCOM,2012, pp. 460–468.
[15] Y. G. Wen, W. W. Zhang, K. Guan, D. Kilper, and H. Y. Luo, “Energyoptimal execution policy for a Cloudassisted mobile application platform,” Sep. 2011.

Currently there are no Refbacks

 


Paper Title : A Survey: Query Processing Techniques for Secure Cloud Databases
Authors : N.Swetha,, Prof. S Ramachandram,
Affiliations : Research Scholar, Dept. of CSE, Osmania University, Hyderabad
Principal, Dept. of CSE, Osmania University, Hyderabad.
Abstract :

af

The Major challenge in cloud computing is to manage distributed cloud. Traditional relational database management systems (RDBMS) are a choice but they are not compatible to measure crossways large clusters of distributed servers. Therefore changeovers to RDBMS have been developed. The development of new database management systems (DBMS) for the cloud computing environment or flexibility of the existing systems to the cloud computing environment is a critical component of cloud computing research. This paper focuses on the study of a relational database system based on holomorphic encryption schemes to preserve the integrity and confidentiality of the data. And also examines various SQL queries over encrypted data. And this paper helps in focusing where research is needed.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


database management systems, relational database management systems, Homomorphic encryption, Cloud Data bases.

N.Swetha,,Prof. S Ramachandram."A Survey: Query Processing Techniques for Secure Cloud Databases". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1257-1262, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1283.pdf,

[1] Wiggins, A. (2009), SQL Databases Don't Scale.
http://adam.heroku.com/past/2009/7/6/sql_databases_d
ont_scale/
[2] Abadi, D. J. (2009), Data Management in the Cloud:
Limitations and Opportunities. IEEE Data Engineering
Bulletin, Volume 32, Number 1, March 2009, pp. 3-12
[3] Garret (2010), What is a Column Oriented Database?
http://www.columnorienteddatabase.com/
[4] DeCandia, G., D. Hastorun, M. Jampani, G.
Kakulapati, A. Lakshman, A. Pilchin, S.
Sivasubramanian, P. Vosshall, and W. Vogels(2007)
Dynamo: Amazon’s highly available key-value store, In
SOSP, pp. 205–220
[5] Dean, J. and S. Ghemawat (2004) Mapreduce:
Simplified data processing on large clusters.
Proceedings of the 6th conference on Symposium on
Opearting Systems Design & Implementation ACM pp.
137–150
[6] C. Gentry, Computing arbitrary functions of
encrypted data, Commun. ACM, Vol. 53, No. 3., pp. 97-
105, March 2010.
[7] C. Gentry, A fully homomorphic encryption
scheme. PhD thesis, Stanford University, 2009.
[8] M. Raykova, B. Vo, and S. Bellovin, Secure
Anonymous Database Search, CCSW’09, pp. 115-126,
Chicago, Illinois, USA, November 13, 2009. 
[9] N. Shang, G. Ghinita, Y. Zhou, and E. Bertino,
Controlling Data Disclosure in Computational PIR
Protocols. ASIACCS’10, pp. 310- 313, Beijing, China,
April 13–16, 2010.
[10] T. Nakamura, S. Inenaga, D. Ikeda, K. Baba, H.
Yasuura, Anonymous Authentication Systems Based
on Private Information Retrieval. Networked Digital
Technologies. NDT '09, pp.53-58, 28- 31 July 2009.
[11] S. Yinan and Z. Cao, Extended Attribute Based
Encryption for Private Information Retrieval. Mobile
Adhoc and Sensor Systems, 2009. MASS '09, pp. 702-
707, 12-15 Oct. 2009.
[12] C. Gentry and Z. Ramzan, Single-Database Private
Information Retrieval with Constant Communication
Rate. ICALP 2005, LNCS 3580, pp. 803–815, 2005.
[13] C. A. Melchor and P. Gaborit, A Fast Private
Information Retrieval Protocol. ISIT 2008, pp. 1848-
1852, Toronto, Canada, July 6 - 11, 2008.

Currently there are no Refbacks

Paper Title : Enhancing CAPTCHA based Image Authentication for E-mail ID and Password
Authors : MACHARLA BHANU KUMAR, K.KRANTHI KUMAR,
Affiliations : Pursuing M.Tech, CSE Branch,Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
NRI Institute of Technology, Guntur, Andhra Pradesh, India
Abstract :

af

-In this paper we survey the current Captcha password schemes furthermore exhibit the significance of Email authentication over cutting edge Captcha Advancements where Captcha and Its graphical password it can addresses various security issues out and out. CAPTCHA is accomplished by revision of letters in order arbitrarily on the catches and it is anything but difficult to baffle by straightforward key loggers .In data security, client authentication is a noteworthy issue in each framework. What's more, for authentication reason each framework relies on upon password whether it is literary password or graphical password. CAPTCHA is a test work by computer programs which human can pass however computer programs can't pass .The thought process of incorporating so as to enhance Email authentication is finished visual authentication instruments. This is ensured to the regular assaults endured by other authentication schemes.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Graphical Password, CaRP, CAPTCHA, Authentication, Security, E-mail, Hacker Attack, Keyloggers

MACHARLA BHANU KUMAR,K.KRANTHI KUMAR."Enhancing CAPTCHA based Image Authentication for E-mail ID and Password". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1251-1256, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1282.pdf,

[1] Shraddha S.Banne, Prof. K.N.Shedge,”A Review
Graphical password Based Authentication
Scheme”,International Journal of Science &
Research(IJSR), Volume 3 Issue 10, October 2014.
[2] Shraddha S.Banne, Prof. K.N.Shedge,” A Novel
Graphical Password Based Authentication Method
Using CAPTCHA”, International Journal of
Informative & Futuristic Research (IJIFR), Volume 2
Issue 11 July 2015
[3] Bin B. Zhu, Je Yan, Guanbo Bao, Maowei Yang,
and Ning Xu,``Captcha as a Graphical Passwords A
New Security Primitive Based on Hard AI
Problems",IEEE Trans, Vol. 9, No. 6, pp 891- 904,
June 2014.
[4] S. Chiasson, A. Forget, R. Biddle, and P. C. van
Oorschot, ``Inuencing users towards better
passwords: Persuasive cued clickpoints", in Proc.
HCI, British Computer Society, Liverpool, U.K., pp
121-130, 2008. [5] S. Chiasson, A. Forget, R. Biddle,
and P. C. van Oorschot, ``User interface design
affects security: Patterns in click-based graphical
passwords", Int. J. Inf. Security, vol. 8, no. 6, pp. 387-
398, 2009.
[6] G. Blonder, Graphical Passwords, U.S. Patent
5559961, 1996.
[7] Xiaoyuan Suo, Ying Zhu, G. Scott. Owen,
“Graphical Passwords: A Survey”, Department of
Computer Science Georgia State University.
[8] A. Dirik, N. Memon, and J.-C. Birget, “Modeling
User choice in the Pass-Points graphical password
scheme", in 3rd Symp. Usable Privacy and
Security(SOUPS), Pittsburgh, PA, pp. 20-28, 2007.
[9] Chippy. T and R. Nagendran, Defences Against
Large Scale Online Password Guessing Attacks By
Using Persuasive Click Points, International Journal
of Communications and Engineering, Volume 03
No.3, Issue: 01 March2012 .
[10] D. Davis, F. Monrose, and M. K. Reiter, “On
user choice in graphical pass-word schemes", in
Proc. 13th USENIX Security Symp., San Diego, CA,
pp. 151-164, 2004.
[11] Robert Biddle, Sonia Chiasson and P.C.van
Oorschot. Graphical Passwords: Learning from the
First Twelve Year. School of Computer Science,
Carleton University, Jan 4, 2012.
[12] Liming Wang, Xiuling Chang, Zhongjie Ren,
Haichang Gao, Xiyang Liu, Uwe Aickelin, “Against
Spyware Using CAPTCHA in Graphical Password
Scheme”
[13] Luis von Ahn, Manuel Blum, Nicholas J.
Hopper, and John Langford, “CAPTCHA: Using
Hard AI Problems For Security”
[14] S. Wiedenbeck, J. Waters, J.C. Birget, A.
Brodskiy, N. Memon, ``PassPoints: Design and
longitudinal evaluation of a graphical password
system'', International J. of Human-Computer
Studies (Special Issue on HCI Research in Privacy
and Security), 63 (2005) 102-127.
[15] Xiaoyuan, S., Z. Ying, et al. (2005). “Graphical
passwords: a survey”, Computer Security
Applications Conference, 21st Annual.
[16] H. Gao, X. Liu, S.Wang, and R. Dai, “A new
graphical password scheme against spyware by
using CAPTCHA,” in Proc. Symp. Usable Privacy
Security, 2009, pp. 760–767.
[17] M. Alsaleh, M. Mannan, and P. C. van Oorschot,
“Revisiting defenses against large-scale online
password guessing attacks,” IEEE Trans.
Dependable Secure Comput., vol. 9, no. 1, pp. 128–
141, Jan./Feb. 2012.

Currently there are no Refbacks

Paper Title : Performance of AHB Bus Tracer with Dynamic Multiresolution and Lossless Real Time Compression
Authors : VELLANKI SATHEESH BABU, B.N. SRINIVASA RAO,
Affiliations : Pursuing M.Tech, VLSI DESIGN, Dept of ECE
Assistant Professor, Department of Electronics and Communication Engineering Avanthi Institute of Engineering and Technology, Visakhapatnam, Andhra Pradesh, India.
Abstract :

af

In this paper we demonstrate the On-Chip bus SoC(system-on-chip) infrastructure that connects major hardware components. Monitoring the on-chip bus signals is crucial to the SoC debugging and performance analysis/optimization. The past two decades of SoC evolution have seen an exponential increase in complexity. Today’s devices have multiple processing units, CPUs, GPUs, DSPs, DMAs, third-party IP blocks and custom logic. As if the hardware is not complicated enough, there will of course be substantial amounts of sophisticated software code running on the SoC hardware/software integration, and testing are made very much harder. The commercial consequences of problems in the development flow are potentially dire: since the debugging / analysis needs are adaptable: some designers need all signals at cycle-level, while some others only care about the transactions. For the latter case, tracing all signals at cycle-level wastes a lot of trace memory. Thus, there must be a way to capture traces at different abstraction levels based on the specific debugging/analysis need.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


SoC(system-on-chip), bus tracer, On-Chip, SoC debugging and analysis.

VELLANKI SATHEESH BABU,B.N. SRINIVASA RAO."Performance of AHB Bus Tracer with Dynamic Multiresolution and Lossless Real Time Compression". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1245-1250, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1280.pdf,

[1+ ARM Ltd., San Jose, CA, “Embedded trace
macrocellarchitecture specification,” 2006.
*2+ B. Tabara and K. Hashmi, “Transaction-level
modeling and debug of SoCs,” presented at the IP SoC
Conf., France, 2004
*3+ ARM Ltd., San Jose, CA, “AMBA Specification (REV
2.0) ARMIHI0011A,” 1999.
*4+ ARM Ltd., San Jose, CA, “ARM. AMBA AHB Trace
Macrocell (HTM) technical reference manual ARM DDI
0328D,” 2007.
[5] J. Gaisler, E. Catovic, M. Isomaki, K. Glembo, and S.
Habinc, “GRLIB IP core user’s manual, gaisler
research,” 2009.
[6+ E. Rotenberg, S. Bennett, and J. E. Smith, “A trace
cache microarchitecture and evaluation,” IEEE Trans.
Comput., vol. 48, no. 1, pp. 111–120, Feb. 1999.
[7] A. B. T. Hopkins and K. D. Mcdonald-Maier,
“Debug support strategy for systems-on-chips with
multiple processor cores,” IEEE Trans. Comput., vol.
55, no. 1, pp. 174–184, Feb. 2006.
[8] B. Vermeulen, K. Goosen, R. van Steeden, and M.
Bennebroek, “Communication-centric SoC debug using
transactions,” in Proc. 12th IEEE Eur. Test Symp., May
20–24, 2007, pp. 69–76.
[9] Y.-T. Lin, C.-C. Wang, and I.-J. Huang, “AMBA
AHB bus protocol checker with efficient debugging
mechanism,” in Proc. IEEE Int. Symp. Circuits Syst.,
Seattle, WA, May 18–21, 2008, pp. 928–931

Currently there are no Refbacks

Paper Title : An Effective Supermodularity Based Approach for Data Privacy at Storage Level
Authors : Annamneni Soujanya, Baburao Kopuri,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Associate Professor, Department of Computer Science & Engineering, NRI Institute of Technology.
Abstract :

af

In this paper we presented a supermodulaity based approach for data privacy using noval encryption mechanisum in this conncetion the seviority of data privacy at storage level is most considerable so in our presented system lack of data privacy , scalability due to low security algorithm while data transformation so in our proposed system Scalability and privacy risk of data anonymization can be addressed by using differential privacy. Differential privacy provides a theoretical formulation for privacy. A scalable algorithm is use to find the differential privacy when applying specific random sampling. The risk function can be employ through the supermodularity properties.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Supermodularity, Differential privacy, Scalability, privacy.

Annamneni Soujanya,Baburao Kopuri."An Effective Supermodularity Based Approach for Data Privacy at Storage Level ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1240-1244, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1279.pdf,

[1] Mohamed R. Fouad, Khaled Elbassioni, ―A Supermodularity-Based Differential Privacy Preserving Algorithm for Data Anonymization‖, IEEE transaction on
Knowledge and Data Engineering July 2014.
[2] M. R. Fouad, K. Elbassioni, and E. Bertino, ―Towards
a differentially private data anonymization,‖ Purdue
Univ., West Lafayette, IN, USA, Tech. Rep. CERIAS
2012-1, 2012.
[3] N. Mohammed, R. Chen, B. C. Fung, and P. S. Yu,
―Differentially prívate data release for data mining,‖ in
Proc. 17th ACM SIGKDD,New York,NY, USA, 2011, pp.
493–501.
[4] M. R. Fouad, G. Lebanon, and E. Bertino, ―ARUBA:
A risk-utility based algorithm for data disclosure,‖ in
Proc. VLDB Workshop SDM, Auckland, New Zealand,
2008, pp. 32–49.
[5] K. M. Elbassioni, ―Algorithms for dualization over
products of partially ordered sets,‖ SIAM J. Discrete
Math., vol. 23, no. 1,pp. 487–510, 2009.
[6] C. Dwork, ―Differential privacy: A survey of results,‖ in Proc. Int.Conf. TAMC, Xiˇ San, China, 2008,
pp. 1–19.
[7] G. Lebanon, M. Scannapieco, M. R. Fouad, and E.
Bertino,―Beyond kanonymity:A decision theoretic
framework for assessing Privacy risk,‖ in Privacy in Statistical Databases. Springer LNCS 4302:217U 232, 2006.
[8] C. Dwork, ―Differential privacy,‖ in Proc. ICALP,
Venice, Italy,2006, pp.1–12.
[9] C. C. Aggarwal, ―On k-anonymity and the curse of
dimensionality,‖in Proc. Int. Conf. VLDB, Trondheim,
Norway, 2005,pp. 901–909.
[10] C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov,
and M. Naor,―Our data, ourselves: Privacy via distributed noise generation,‖in Proc. 25th EUROCRYPT,
Berlin, Germany, 2006, pp. 486–503,LNCS 4004.
[11] A. Frieze, R. Kannan, and N. Polson, ―Sampling
from log-concave distributions,‖ Ann. Appl. Probab.,
vol. 4, no. 3, pp. 812–837, 1994.
[12] B. C. M. Fung, K. Wang, and P. S. Yu, ―Top-down
specialization for information and privacy preservation,‖ in Proc. IEEE ICDE, Washington, DC, USA, 2005,
pp. 205–216.
[13] G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis,
―Fast data anonymization with low information loss,‖ in
Proc. Int. Conf.VLDB, Vienna, Austria, 2007, pp. 758–
769.
[14] G. A. Gratzer, General Lattice Theory, 2nd ed. Basel, Switzerland:Birkh¨auser, 2003.
[15] M. Grotschel, L. Lovasz, and A. Schrijver, ―Geometric algorithms and combinatorial optimization,‖ in Algorithms and Combinatorics, vol. 2, 2nd ed. Berlin,
Germany: Springer, 1993.
[16] J. Cao, P. Karras, P. Kalnis, and K.-L. Tan, ―SABRE:
A sensitive attribute bucketization and redistribution
framework for t-closeness,‖ J. VLDB, vol. 20, no. 1, pp.
59–81, 2011.
[17] C. M. Fung, K. Wang, and P. S. Yu, ―Top-down
specialization for information and privacy preservation,‖ in Proc. IEEE ICDE, Washington, DC, USA, 2005,
pp. 205–216.

Currently there are no Refbacks

Paper Title : SYSTEM EVALUATION OF 32 BIT UNNSIGNED MULTIPLER USING CLAA AND CSLA.
Authors : SIVASANKAR RAO.Y, SOMASEKHAR .A,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

- In this paper deals with the comparison of the VLSI design of the carry look-ahead adder (CLAA) based 32- bit signed and unsigned integer multiplier. Multiplication is a fundamental operation in most signal processing algorithms. Multipliers have large area, long latency and consume considerable power. Therefore low-power multiplier design has been an important part in low- power VLSI system design. In computational circuits the adders plays a key role in arithmetic operations. Adders like Ripple carry adder, Carry look ahead adder, Carry select adder, Carry skip adder and carry save adder etc. In this paper, a high performance and low power 32bit unsigned multiplier is proposed using adders. The CLAA based multiplier and CSLA based multiplier uses the same delay for multiplication operation.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


CLAA,CSLA,Delay,Area, Array Multiplier

SIVASANKAR RAO.Y,SOMASEKHAR .A."SYSTEM EVALUATION OF 32 BIT UNNSIGNED MULTIPLER USING CLAA AND CSLA.". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1236-1239, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1278.pdf,

[1] J. Bedrij, “Carry-select adder,” IRE Trans. Electron,
pp. 340–344, 1962.
[2] B. Rajkumar, .M. Kittur, and P. Kanna, “ASIC
implementation of modified faster carry select adder,”
Eur. J. Sci.Res., vol. 42, no. 1, pp.53–58, 2010.
[3] Ceiang.T.Y and M. J. Hsiao, “Carry-select adder
using ripple Carry adder,” Electron. Lett, vol. 34, no.
22, pp.2101–2103, Oct. 1998.
[4] Y. Kim and L.-S. Kim, “carry-select adder with
reduced area,” Electron. Lett. vol. 37, no. 10, pp. 614–
615, May2001.
[5] J. M. Rabaeay, Integrated Circuits—A Design
Perspective.Upper Saddle River, NJ: Prentice-Hall, 2001
[6] Y. He, C. H. Chang, and J. Gu, “low power & area
efficient 64-bit square Root carry-select adder for low
powerapplications,” in Proc. IEEE Int. Symp.Circuits
Syst., vol. 4, pp. 4082–4085, 2005.
[7]Rado Zlatanovici, Borivoje Nikolic, “Energy-Delay
of Optimization 64-Bit Carry- Lookahead Adders,”
IEEE J.Solid State circuits,vol.44, no. 2, pp. 569-583, Feb.
2009.
[8] Navi.K , Kavehei.O, Rouholamini.M , Sahafi.A,
“Low-Power and High-Performance 1-bit CMOS
Full.Adder Cell,”Journal of Computers, Academy
Press, vol. 3, no. 2,Feb. 2008.

Currently there are no Refbacks

Paper Title : Square and Cube Architecture using Less Complex and Low Power Architectures
Authors : BELLAM SREEKANYA, K.RAKESH,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Science for Women
Abstract :

af

In this paper we are going to explore the importance of the design of a Low power and less area square and cube architectures using Vedic sutra , the optimized multiplier are having regular, less complex and parallel structure in design thus this kind of algorithm and its designs used to design square and cube circuit using Vedic sutras over and over again times square and cube are the most sustained on operations in several digital signal processing applications and computation can be condensed using Radix8 and the overall processor performance can be improved for numerous applications.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


DWT, Radix8, Parallel Structure, VEDIC, Urdhva Tiryagbhyam, Anurupyena Sutra, Modified Booth,

BELLAM SREEKANYA,K.RAKESH."Square and Cube Architecture using Less Complex and Low Power Architectures". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1232-1235 , December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1277.pdf,

[1] Y.Yu Fengqi and A. N.Willson,“Multirate digital
squarer architectures,” in Proc. 8th IEEE Int. conf on
Electronics, Circuits and Systems (ICECS 2001), Malta,
Sept. 2–5, 2001 
[2] Swami Bharati Krisna Tirtha, “Vedic
Mathematics,” Motilal Banarsidass Publishers, Delhi
1965
[3] Performance analysis of multipliers for powerspeed trade-off in VLSI designs Sumit R. VaidyaD. R.
Dandekar, ISSN: 1790-5117
[4] Implementation of Multiplier using Vedic
Algorithm. ISSN: 2278- 3075, Volume-2, Issue- 6, May
2013

Currently there are no Refbacks

Paper Title : Investigation on Performance of high speed CMOS Full adder Circuits
Authors : KATTUPALLI KALYANI, G.VASANTH RAO,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Science for Women
Abstract :

af

- In this paper we demonstrate the performance analysis of CMOS Full adder circuits in this connection the full Adder is designed using CMOS logic style by dividing it in three modules so that it can be optimized at various levels. First module is an XOR-XNOR circuit, which generates full swing XOR and XNOR outputs simultaneously and have a good driving capability. The objective this concept is identified the comparison of power, surface area and complexity of Full adder designs using CMOS Logic Styles. Full adder Design is better compared to conventional design. Transistor Design with respect to power, delay, Power Delay Product Comparison. It is observed that less power is consumed in the Transmission based full adder than the Convention full adder and Pass Transistor full adder.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


High speed, low power. CMOS logic style, full adder.

KATTUPALLI KALYANI,G.VASANTH RAO."Investigation on Performance of high speed CMOS Full adder Circuits ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1228-1231, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1276.pdf,

[1] N. Weste, and K. Eshranghian, “Principles of
CMOS VLSI Design: A System Perspective,” Reading
MA: Wesley, 1993.
[2] Sanjeev Kumar and Manoj Kumar “4-2
Compressor design with New XOR-XNOR Module”,
4th International Conference on Advanced Computing
and Communication technologies, pp. 106-111, 2014.
[3] Meher, P.; Mahapatra, K.K. "Low power noise
tolerant domino 1-bit full adder", International
Conference on Advances in Energy Conversion
Technologies (ICAECT), pp. 125 – 129, 2014
[4] Vojin G. Oklobdzija, “Simple and Efficient Circuit
for Fast VLSI Adder Realization,” IEEE International
Symposium on Circuits and Systems Proceedings,
1988, pp. 1-4.
[5] J.Rabaey, “Digital Integrated Circuits: A Design
Prospective,” Prentice- Hall, Englewood Cliffs, NJ,
1996.
[6] R. Zimmermann and W. Fichtner, “Low-power
logic styles: CMOS versus pass-transistor logic,” IEEE
Journal of Solid–State Circuits, vol.32, pp.1079-1090,
July 1997.
[7] http://en.wikipedia.org/wiki/CMOS
[8] Devi, Padma, Ashima Girdher, and Balwinder
Singh. "Improved carry select adder with reduced
area and low power consumption." International
Journal of Computer Applications 3.4 (2010): 14-18.
[9] D. Radhakrishnan, “Low-voltage low-power
CMOS full adder,” IEEE Proc. Circuits Devices Syst.,
vol. 148, no. 1, pp. 19–24, Feb. 2001.

Currently there are no Refbacks

Paper Title : IMPLEMENTATION OF HARDWARE IP ROUTER BASED ON VLSI
Authors : KARLAPUDI SRAVANI, P T BALAKRISHNA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Science for Women
Abstract :

af

A Network-on-chip is a new paradigm in complex system-on-chip designs that provide efficient on chip communication networks. It allows scalable communication and allows decoupling of communication and computation. The data is routed through the networks in terms of packets. We attempts to overcome latency and time reduction issue and can provide multipurpose networking router by means of verilog and it was synthesized in Xilinx 13.2 version, simulated Modelsim 10.0 version. In this paper our attempt is to provide a multipurpose networking router by means of Verilog code, by this we can maintain the same switching speed with more secured way of approach we have even the packet storage buffer on chip being generated by code in our design in the so we call this as the self-independent router called as the VLSI Based router. The three architectures were analyzed for their performance in terms of delay, throughput and latency and we concluded that CDMA router performs better than the other two.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fictional Coverage, assertions, Randomization, Network-On-Chip,, Register blocks.

KARLAPUDI SRAVANI,P T BALAKRISHNA."IMPLEMENTATION OF HARDWARE IP ROUTER BASED ON VLSI". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1222-1227, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1275.pdf,

[1]Channamallikarjuna Mattihalli, Suprith Ron,Naveen
Kolla ” VLSI Based Robust Router Architecture” Third
International Conference on Intelligent Systems
Modelling and Simulation,2012.
[2]Feng Liang, Luwen Zhang, Shaochong Lei, Guohe
Zhang, Kaile Gao, and Bin Liang” Test Patterns of
Multiple SIC Vectors: Theory and Application in BIST
Schemes” ieee transactions on very large scale
integration (vlsi) systems, vol. 21, no. 4, april 2013. 
[3]James Aweya “IP Router Architectures: An
Overview”.
[4]M. SOWMYA C. SHIREESHA G. SWETHA
PRAKASH J. PATIL” VLSI Based Robust Router
Architecture” .
[5] M. Waldvogel, G. Varghese, J. Turner, and B.
Plattner, “Scalable High Speed IP Routing Lookup,”
Proc. ACM SIGCOMM’97, Cannes, France, Sept. 1997.
[6] V. Srinivasan and G. Varghese, “Faster IP Lookups
using Controlled Prefix Expansion,” Proc. ACM
SIGMETRICS, May 1998.
[7] S. Nilsson and G. Karlsson, “Fast Address Look-Up
for Internet Routers,” Proc. Of IEEE Broadband
Communications’98, April 1998.
[8]E. Filippi, V. Innocenti, and V. Vercellone, “Address
Lookup Solutions for Gigabit Switch/Router,” Proc.
Globecom’98, Sydney, Australia, Nov. 1998.
[9]M. Thottethodi, A. R. Lebeck, and S. S. Mukherjee,
"BLAM: ahigh performance routing algorithm for
virtual cut-through networks," in Proceedings of the
International Parallel and Distributed Processing
Symposium
[10] L. S. Peh and W. J. Dally, "A delay model and
speculative architecture for pipelined routers," in
Proceedings of the 7thInternational Symposium on
High Performance Computer Architecture (HPCA).
[11] A. V. Yakovlev, A. M. Koelmans, and L. Lavagno,
"High-level modeling and design of asynchronous
interface logic," IEEEDesign & Test of Computers.
[12] H. Jingcao and R. Marculescu, "Energy- and
performance aware mapping for regular NoC
architectures," IEEE Transactions on Computer-Aided
Design of Integrated Circuits and Systems, vol. 24, pp.
551-562, 2005.
[13] W. Hangsheng, L. S. Peh, and S. Malik, "A
technology-aware and energy oriented topology
exploration for on-chip Networks," in Proceedings of
the Design, Automation and Test in Europe Conference
and Exhibition .
[14] J. Duato, "A new theory of deadlock-free adaptive
routing in wormhole networks," IEEE Transactions on
Parallel and Distributed Systems, vol. 4.
[15] S. Arjun, W. J. Dally, A. K. Gupta, and B. Towles,
"GOAL: aload-balanced adaptive routing algorithm for
torus networks," in Proceedings of the International
Symposium on ComputerArchitecture.

Currently there are no Refbacks

Paper Title : Circuit for Revisable Quantum Multiplier Implementation of Adders with Reversible Logic
Authors : KONDADASULA VEDA NAGA SAI SRI, M.SAI RAMA KRISHNA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Science For Women
Abstract :

af

Programmable reversible logic is gain wide consideration as a logic design style for modern nanotechnology and quantum computing with minimal impact on circuit heat generation in improved computer architecture and arithmetic logic unit designs. In this paper, a 2*2 Swap gate which is a reduced implementation in terms of quantum cost and delay to the previous Swap gate is presented. Then, a novel 3*3 programmable UPG gate capable of calculating the universal logic calculations is presented and verified, and its advantages over the Toffoli and Peres gates are discussed. The UPG is then implemented in a reduced design for calculating n-bit AND, n-bit OR and n-bit ZERO calculations. Then, two 3*3 RMUX gates capable of multiplexing two input values with reduced quantum cost and delay compared to the previously existing Fredkin gate is presented and verified. Next, a novel 4*4 reversible programmable RC gate capable of nine unique logical calculations at low cost and delay is presented and verified. The UPG and RC are implemented in the design of novel sequential and tree-based comparators. These designs are compared to previously existing designs, and their advantages in terms of cost and delay are analyzed.Then, the RMUX is used to improve a reversible SRAM cell we previously presented. The memory cell and comparator are implemented in the design of a Min/Max Comparator device.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Reversible Logic, Quantum cost, Garbage output, Xilinx ISE 14.7

KONDADASULA VEDA NAGA SAI SRI,M.SAI RAMA KRISHNA."Circuit for Revisable Quantum Multiplier Implementation of Adders with Reversible Logic". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1216-1221, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1274.pdf,

[1] C. Bennett, "Logical Reversibility of Computation,"
IBM Journal of Research and Development, vol. 17,
1973, pp. 525-532.
[2] E. Fredkin and T. Toffoli, "Conservative Logic,"
International Journal of Theoretical Physics, vol. 21,
1980, pp. 219-53.
[3] T. Toffoli, "Reversible Computing," Technical Report
MIT/LCS/TM- 151, 1980.
[4] A. Peres, “Reversible Logic and Quantum
Computers,” Physical Review, vol. 32, iss. 6, 1985, pp.
3266-3267.
[5] A. N. Al-Rabadi, “Closed-system quantum logic
network implementation of the viterbi algorithm,”
Facta universitatis-Ser.: Elec. Energy., vol. 22, no. 1, pp.
1–33, April 2009.
[6] H. Thapliyal, N. Ranganathan, and R. Ferreira,
"Design of a Comparator Tree Based on Reversible
Logic," 10th Proceedings of the IEEE International
Conference on Nanotechnology, 2010, pp 1113-6.
[7] M. Morrison, M. Lewandowski, R. Meana and N.
Ranganathan, "Design of Static and Dynamic RAM
Arrays Using a Novel Reversible LogicGate and
Decoder," IEEE NANO, Aug. 2011.
[8] M. Morrison, M. Lewandowski, R. Meana and N.
Ranganathan, "Design of a Novel Reversible ALU with
Enhanced Carry Look-Ahead Adder," IEEE NANO,
Aug. 2011.
[9] N. Weste and D. Harris, CMOS VLSI Design: A
Circuits and Systems Perspective, 3 ed., Boston:
Addison Wesley, 2005, pp. 715-738.
[10] J. Smolin and D. Divincenzo, "Five Two-bit
Quantum Gates Are Sufficient to Implement the
Quantum Fredkin Gate," Physical Review A, vol. 53,
1996, pp 2855-6
[11] H. Thapliyal and N. Ranganathan, "Design of
Efficient Reversible Binary Subtractors Based on A New
Reversible Gate," Proc. of the IEEE Computer Society
Annual Symposium on VLSI, 2009, pp 229-234.
[12] M. Morrison and N. Ranganathan, "Design of a
Reversible ALU Based on Novel Programmable
Reversible Logic Gate Structures," ISVLSI, Jul. 2011, pp.
126-131.
[13] D. Deustch, "Quantum Computational Networks,"
Proceedings of the Royal Society of London. Series A,
Mathematical and Physical Sciences, vol. 425, iss. 1868,
1989, pp. 73-90
[14] R. Feynman, "Simulating Physics with
Computers," International Journal of Theoretical
Physics, 1982.
[15] R. Feynman, "Quantum Mechanical Computers,"
Foundations of Physics, vol. 16, iss. 6, 1986

Currently there are no Refbacks

Paper Title : Enable Batch Auditing for Secure Cloud Storage Using TPA
Authors : PRATHIBHA MAGULURI, B.RANJITHKUMAR,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science for women’s
Associate Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science for women’s
Abstract :

af

In this paper we used cloud storage servers remotely in order to store and share the data and enjoy the ondemand high-quality applications and services from a shared pool of configurable computing resources, without communication challenges However, the fact that users no longer have physical control over outsourcing data in this connection data integrity over public cloud is a challenging task, thus this integrity will audited by trusted third party behalf of cloud without reviling any user privacy and also TPA executes multiple task simultaneously i.e batch auditing our proposed framework provides high security and high performance.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



PRATHIBHA MAGULURI,B.RANJITHKUMAR."Enable Batch Auditing for Secure Cloud Storage Using TPA". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1212-1216, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1273.pdf,

[1] R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, ‘‘Cloud Computing and Emerging IT Platforms: Vision, Hype, Reality for Delivering Computing as the 5th Utility,’’ Future Gen. Comput. Syst., vol. 25, no. 6, pp. 599-616, June 2009.
 [2]M.Armbrust,A.Fox,R.Griffith,A.D.Jose ph,R.Katz,A.Konwinski,G.Lee,D.Patterso n,A.Rabkin,I.Stoica,andM.Zaharia,‘‘AVie wof Cloud Computing,’’ Commun. ACM, vol. 53, no. 4, pp. 50-58, Apr. 2010. 
[3] Customer Presentations on Amazon Summit Australia, Sydney, 2012, accessed on: March 25, 2013. [Online]. Available: http:// aws.amazon.com/apac/awssummitau/. 
[4] J. Yao, S. Chen, S. Nepal, D. Levy, and J. Zic, ‘‘TrustStore: Making Amazon S3 Trustworthy With Services Composition,’’ in Proc. 10th IEEE/ACM Int’l Symposium on Cluster, Cloud and Grid Computing (CCGRID), 2010, pp. 600-605. 
[5] D. Zissis and D. Lekkas, ‘‘Addressing Cloud Computing Secu- rity Issues,’’ Future Gen. Comput. Syst., vol. 28, no. 3, pp. 583-592, Mar. 2011. 
[6] Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, ‘‘Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing,’’ IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 5, pp. 847-859, May 2011. 
[7] C. Wang, Q. Wang, K. Ren, and W. Lou, ‘‘PrivacyPreserving Public Auditing for Data Storage Security in Cloud INTERNATIONAL JOURNAL OF ADVANCE RESEARCH, IJOAR .ORG ISSN 2320-9194 12 IJOAR© 2015 http://www.ijoar.org Computing,’’ in Proc. 30st IEEE Conf. on Comput. and Commun. (INFOCOM), 2010, pp. 1-9. 
[8] G. Ateniese, R.D. Pietro, L.V. Mancini, and G. Tsudik, ‘‘Scalable and Efficient Provable Data Possession,’’ in Proc. 4th Int’l Conf. Security and Privacy in Commun. Netw. (SecureComm), 2008, pp. 1-10.
 [9] G. Ateniese, R. Burns, R. Curtmola, J. Herring, O. Khan, L. Kissner, Z. Peterson, and D. Song, ‘‘Remote Data Checking Using Provable Data Possession,’’ ACM Trans. Inf. Syst. Security, vol. 14, no. 1, May 2011, Article 12. 
[10]G.Ateniese,R.B.Johns, R.Curtmola,J.Herring,L.Kissner, Z.Peterson, and D. Song, ‘‘Provable Data Possession at Untrusted Stores,’’ in Proc. 14th ACM Conf. on Comput. and Commun. Security (CCS), 2007, pp. 598- 609.

Currently there are no Refbacks

Paper Title : Recommender Systems for e-commerce application using CF
Authors : SIVA KALYANI, S NAGA LAKSHMI,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Assistant Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

Collaborative filtering (CF) is a very important and common technology for recommender systems. Recommender systems are evidenced to be valuable means that for internet on-line users to deal with the data overload and became one amongst the foremost powerful and common tools in e-commerce. However, current CF ways suffer from such issues as knowledge sparseness, recommendation quality and big-error in predictions with lack of user privacy. There are 3 common approaches to determination the suggestion problem: ancient cooperative filtering, cluster models, and search-based ways and a completely unique rule to advocate things to users supported a hybrid technique. Initial we have a tendency to use cluster to create the user clusters supported the similarity of users. We’ve got taken users look history for similarity calculation. Second we have a tendency to be getting to realize the things that are powerfully related to one another by victimization association rule mining. Finally we'll be victimization these robust association rules in recommendation of things. In ordered to supply the protection we have a tendency to used onion routing algorithms.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Collaborative filtering, e-commerce, cluster models.

SIVA KALYANI,S NAGA LAKSHMI."Recommender Systems for e-commerce application using CF". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1207-1211, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1272.pdf,

[1] K.M. Galotti, Cognitive Psychology In and Out of
the Laboratory, third ed. Wadsworth, 2004.
[2] G.L. Murphy, The Big Book of Concepts. MIT
Press, 2002.
[3] L.W. Barsalou, Cognitive Psychology: An Overview for Cognitive Scientists. Lawrence Erlbaum Assoc., 1992.
[4] S. Schiffer and S. Steele, Cognition and Representation. Westview Press, 1988.
[5] D.L. Medin and E.E. Smith, ―Concepts and Concept Formation,‖ Ann. Rev. of Psychology, vol. 35, pp.
113-138, 1984.
[6] W. Vanpaemel, G. Storms, and B. Ons, ―A Varying
Abstraction Model for Categorization,‖ Proc. Cognitive Science Conf. (CogSci’05), pp. 2277-2282, 2005.
[7] Z. Huang, H. Chen, and D. Zeng, ―Applying Associative Retrieval Techniques to Alleviate the Sparsity
Problem in Collaborative Filtering,‖ ACM Trans. Information Systems, vol. 22, no. 1, pp. 116- 142, 2004.
[8] G. Adomavicius and A. Tuzhilin, ―Toward the
Next Generation of Recommender Systems: A Survey
of the State-of-the-Art and Possible Extensions,‖ IEEE
Trans. Knowledge and Data Eng., vol. 17, no. 6, pp.
734-749, June 2005.
[9]Tekur Vijetha, M.Sri lakshmi, Dr.S.Prem Kumar ,"
Survey on Collaborative Filtering and Content-Based
Recommending " International Journal Of Computer
Engineering In Research Trends. Volume 2, Issue 9,
September 2015, Pp 594-599, ISSN (Online): 2349-7084.
www.ijcert.org.

Currently there are no Refbacks

Paper Title : Privacy Preserving of Data Retrieval for Decentralized Disruption-Tolerant Military Networks
Authors : K Naga Brahma Chari, Dr G Rama swamy,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

Disruption-tolerant network advancements are becoming to be a productive provision that enable remote device passed on by officers to articulate with one another and access the classified information or secret information by abusing outside storage nodes. This framework provides the effective state of associations to approval methods and therefore the solutions overhaul for secure information recovery in most troublesome cases. The foremost encouraging scientific discipline solutions are at home with management the access problems known as Cipher text-Policy AttributeBased encoding (CP-ABE). Indisputably the foremost troublesome problems during this state are the requirement of endorsement arrangements and therefore the methodologies design for secure information recovery. Then again, the problem of applying CP-ABE in suburbanized DTNs presents a handful of securities and insurance challenges on the property denial, key escrow, and coordination of characteristics issued from explicit forces. During this paper, we have a tendency to propose a protected information recovery arrangement mistreatment CP-ABE for suburbanized DTNs wherever varied key forces manage their properties freely. We have a tendency to show the way to apply the projected half to firmly and proficiently touch upon the delineate information speckled within the information scattered within the Interference or disruption tolerant network.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access control, attribute-based encryption, disruption-tolerant network, multiauthority, secure data retrieval.

K Naga Brahma Chari,Dr G Rama swamy."Privacy Preserving of Data Retrieval for Decentralized Disruption-Tolerant Military Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1203-1206, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1271.pdf,

[1] L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, and
W. Jonker, ―Mediated ciphertext-policy attributebased encryption and its application,‖ in Proc. WISA,
2009, LNCS 5932, pp. 309–323.
[2] A. Lewko and B. Waters, ―Decentralizing attributebased encryption,‖ Cryptology ePrint Archive: Rep.
2010/351, 2010.
[3] A. Sahai and B. Waters, ―Fuzzy identity-based
encryption,‖ in Proc. Eurocrypt, 2005, pp. 457–473.
[4] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
―Attribute-based encryption for fine-grained access
control of encrypted data,‖ in Proc. ACM Conf. Comput. Commun. Security, 2006, pp. 89–98.
[5] S. Roy and M. Chuah, ―Secure data retrieval based
on ciphertext policy attribute-based encryption (CPAttribute-Based Encryption) system for the Disruption-Tolerant Network’s,‖ Lehigh CSE Tech. Rep.,
2009.
[6] M. Chuah and P. Yang, ―Performance evaluation
of content-based information retrieval schemes for
DTNs,‖ in Proc. IEEE MILCOM, 2007, pp. 1–7.
[7] M. Kallahalla, E. Riedel, R. Swaminathan, Q.
Wang, and K. Fu, ―Plutus: Scalable secure file sharing
on untrusted storage,‖ in Proc. Conf. File Storage
Technol., 2003, pp. 29–42.
[8] A. Harrinton and C. Jensen. Cryptographic access
control in a distributed file system. In Proceedings of
ACM SACMAT, 2003. 

Currently there are no Refbacks

Paper Title : Cooperative Provable Data Possession for Multi-Cloud Server Storage
Authors : VIJAY KUMAR, CH.HARIKA,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Assistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

— Provable data possession (PDP) is a strategy for guaranteeing the trustworthiness of information away outsourcing. In this paper, we address the construction of a proficient PDP scheme for disseminated distributed storage to bolster the versatility of administration and information migration, in which we consider the presence of different cloud administration providers to agreeably store and keep up the customers' information. We display an cooperative PDP (CPDP) scheme based on homomorphic verifiable response and hash file indexing order. We demonstrate the security of our scheme based on multi-proven zeroknowledge proof system, which can fulfill culmination, information soundness, and zero-information properties. In addition, we verbalize execution optimization instruments for our scheme, and specifically exhibit a proficient technique for selecting ideal parameter qualities to minimize the computation expenses of customers and capacity administration providers. Our examinations demonstrate that our solution presents lower computation and communication overheads in comparison with non-helpful methodologies
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Storage Security, Provable Data Possession, Interactive Protocol, Zero-knowledge, Multiple Cloud, Cooperative

VIJAY KUMAR,CH.HARIKA."Cooperative Provable Data Possession for Multi-Cloud Server Storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1192-1202, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1270.pdf,

[1] B. Sotomayor, R. S. Montero, I. M. Llorente, and I. T. Foster, “Virtual infrastructure management in private and hybrid clouds,” IEEE Internet Computing, vol. 13, no. 5, pp. 14–22, 2009. 
[2] G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner, Z. N. J. Peterson, and D. X. Song, “Provable data possession at untrusted stores,” in ACM Conference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 598– 609. 
[3] A. Juels and B. S. K. Jr., “Pors: proofs of retrievability for large files,” in ACMConference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 584–597. 
[4] G. Ateniese, R. D. Pietro, L. V. Mancini, and G. Tsudik, “Scalable and efficient provable data possession,” in Proceedings of the 4th international conference on Security and privacy in communication netowrks, SecureComm, 2008, pp. 1–10. 
[5] C. C. Erway, A. K¨upc¸ ¨u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 213–222. 
[6] H. Shacham and B. Waters, “Compact proofs of retrievability,” in ASIACRYPT, ser. Lecture Notes in Computer Science, J. Pieprzyk, Ed., vol. 5350. Springer, 2008, pp. 90–107. .
[7] Q. Wang, C.Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in ESORICS, ser. Lecture Notes in Computer Science, M. Backes and P. Ning, Eds., vol. 5789. Springer, 2009, pp. 355–370. 
[8] Y. Zhu, H. Wang, Z. Hu, G.-J. Ahn, H. Hu, and S. S. Yau, “Dynamic audit services for integrity verification of outsourced storages in clouds,” in SAC, W. C. Chu, W. E. Wong, M. J Palakal, and C.-C. Hung, Eds. ACM, 2011, pp. 1550–1557. 
[9] K. D. Bowers, A. Juels, and A. Oprea, “Hail: a highavailability and integrity layer for cloud storage,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 187–198. 
[10] Y. Dodis, S. P. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in TCC, ser. Lecture Notes in Computer Science, O. Reingold, Ed., vol. 5444. Springer, 2009, pp. 109–127. 
[11] L. Fortnow, J. Rompel, and M. Sipser, “On the power of multiprover interactive protocols,” in Theoretical Computer Science, 1988, pp. 156–161. 
[12] Y. Zhu, H. Hu, G.-J. Ahn, Y. Han, and S. Chen, “Collaborative integrity verification in hybrid clouds,” in Applications and Worksharing, CollaborateCom, Orlando, Florida, USA, October 15-18, 2011, pp. 197–206. 
[13] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “Above the clouds: A berkeley view of cloud computing,” EECS Department, University of California, Berkeley, Tech. Rep., Feb 2009. 
[14] D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” in Advances in Cryptology (CRYPTO’2001),vol. 2139 of LNCS, 2001, pp. 213–229.

Currently there are no Refbacks

Paper Title : In Service-Oriented MSN Providing Trustworthy Service Evaluation
Authors : D.RAMANJANEYULU, U.USHA RANI ,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Associate Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

In this paper, we are going to propose survey based administration assessment to empower clients to share administration audit in administration situated versatile interpersonal organization. Every administration supplier freely keeps up a TSE for itself, which gathers and stores clients' surveys about its administrations without requiring any third trusted power. The administration surveys can then be made accessible to intrigued clients in settling on savvy administration choice choices. This paper portrays how the audit related normal dangers are destroyed and makes these surveys more fitting and valid. It portrays two frameworks bTSE and SrTSE, these frameworks are depicted to survey related issues and their suitable arrangements. The regular dangers of audits are Linkability, survey dismissal and change which are evacuated by utilizing bTSE; which makes utilization of tokens give incorporated surveys and the framework is progressed and the most vital risk called as Sybil assault is uprooted by utilizing SrTSE; which makes utilization of pseudonyms. Through execution assessment, we demonstrate that the bTSE accomplishes better execution as far as accommodation rate and defer than an administration audit framework that does not receive client collaboration.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Mobile Social Networks, Trust Evaluation, Sybil Attack, Distributed System

D.RAMANJANEYULU,U.USHA RANI."In Service-Oriented MSN Providing Trustworthy Service Evaluation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1192-1197, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1269.pdf,

[1] W. Dong, V. Dave, L. Qiu, and Y. Zhang, “Secure
Friend Discovery in Mobile Social Networks,” IEEE,
2011.
[2] X. Liang, X. Li, R. Lu, X. Lin, and X. Shen, “Seer: A
Secure and Efficient Service Review System for
ServiceOriented Mobile Social Networks,” IEEE, 2012.
[3] X. Liang, X. Li, T. Luan, R. Lu, X. Lin, and X. Shen,
“Morality- Driven Data Forwarding with Privacy
Preservation in Mobile Social Networks,” IEEE, 2012.
[4] T.H. Luan, L.X. Cai, J. Chen, X. Shen, and F. Bai,
“VTube: Towards the Media Rich City Life with
Autonomous Vehicular Content Distribution,” IEEE,
2011.
[5] J.R. Douceur, “The Sybil Attack,” Proc. Revised
Papers First Int’l Workshop IPTPS, 2002.
[6] J. Newsome, E. Shi, D.X. Song, and A. Perrig, “The
Sybil Attack in Sensor Networks: Analysis & Defenses,”
IPSN, 2004.
[7] D. Quercia and S. Hailes, “Sybil Attacks Against
Mobile Users: Friends and Foes to the Rescue,” IEEE,
2010.
[8] D. Quercia and S. Hailes, “Sybil Attacks Against
Mobile Users: Friends and Foes to the Rescue,” Proc.
IEEE INFOCOM, pp. 336- 340, 2010.
[9] R. Lu, X. Lin, X. Liang, and X. Shen, “A Dynamic
Privacy-Preserving Key Management Scheme for
LocationBased Services in VANETs,” IEEE Trans.
Intelligent Transportation Systems, vol. 13, no. 1, pp.
127-139, Mar. 2012.
[10] R. Lu, X. Lin, T. Luan, X. Liang, and X. Shen,
“Pseudonym Changing at Social Spots: An Effective
Strategy for Location Privacy in VANETs,” IEEE Trans.
Vehicular Technology, vol. 61, no. 1, pp. 86-96, Jan.
2012.
[11] X. Boyen and B. Waters, “Full-Domain Subgroup
Hiding and Constant-Size Group Signatures,” Proc.
10th Int’l Conf. Practice and Theory Public Key
Cryptography, pp. 1- 15, 2007.
[12] X. Liang, Z. Cao, J. Shao, and H. Lin, “Short Group
Signature without Random Oracles,” Proc. Ninth Int’l
Conf. Information and Comm. Security (ICICS), pp. 69-
82, 2007.

Currently there are no Refbacks

Paper Title : Recommendation System for Find Friend on Social Networks.
Authors : B.NAGESH, CH.HARIKA,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Assistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

Social networks have become an unlimited source of information, for that several applications have been proposed to mine information from social networks such as: recommender systems. The rapidity and scalability of such a recommender algorithm is as important as the actual logic behind the algorithm because such algorithms generally run over a "huge" graph and implementing these normally would probably take a lot of time for recommending items even if there is one user. The basic idea of recommendation system is to recommend items to users. In this paper various recommender systems are classified are discussed. This paper focuses on providing the overview about the various categories of recommendation techniques developed till now. This paper we present review on recommendation system for find friend on social networks..
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Social networks, Recommender system, user interest, personalized recommendation.

B.NAGESH,CH.HARIKA."Recommendation System for Find Friend on Social Networks.". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1188-1191 , December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1268.pdf,

[1] Prem Melville and Vikas Sindhwani,
Recommendation Systems, In Encyclopedia of
Machine Learning, Claude Sammut and Geoffrey
Webb (Eds), Springer, 2010 Chapter No: 00338, Pg
829-838
[2] W. H. Hsu, A. King, M. Paradesi, T. Pydimarri,
and T. Weninger. Collaborative and structural
recommendation of friends using weblog-based
social network analysis. Proc. Of AAAI Spring
Symposium Series, 2006.
[3] Zhibo Wang, Jilong Liao, Qing Cao, Hairong Qi,
and Zhi Wang, “Friendbook: A Semantic-based
Friend Recommendation System for Social
Networks”IEEE TRANSACTIONS ON MOBILE
COMPUTING, VOL. 13, NO. 99, MAY2014
[4] J. Kwon and S. Kim. Friend recommendation
method using physical and social context.
International Journal of Computer Science and
Network Security, 10(11):116-120, 2010.
[5] A.Kirankumar, P.Ganesh Kumar Reddy, A.Ram
Charan Reddy” A Logic-based Friend Reference
Semantic System for an online Social Networks”,
International Journal Of Computer Engineering In
Research Trends Volume 1, Issue 6, December 2014,
PP 501-506,www.ijcert.org.
[6] D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent
Dirichlet Allocation. Journal of Machine Learning
Research, 3:993- 1022, 2003.
[7] L. Bian and H. Holtzman. Online friend
recommendation through personality matching and
collaborative filtering. Proc. of UBICOMM, pages
230-235, 2011.
[8] K. Farrahi and D. Gatica-Perez. Probabilistic
mining of sociogeographic routines from mobile
phone data. Selected Topics in Signal Processing,
IEEE Journal of, 4(4):746-755, 2010.
[9] K. Farrahi and D. Gatica-Perez. Discovering
Routines from Largescale Human Locations using
Probabilistic Topic Models. ACM Transactions on
Intelligent Systems and Technology (TIST), 2(1), 2011.
[10] L. Gou, F. You, J. Guo, L. Wu, and X. L. Zhang.
Sfviz: Interestbased friends exploration and
recommendation in social networks. Proc. of VINCI,
page 15, 2011.

Currently there are no Refbacks

Paper Title : Efficient Data Access Control for Multi-Authority Cloud Storage using CP-ABE.
Authors : PRAVEEN KUMAR, S.NAGA LAKSHMI,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Assistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

Security and data privacy is paramount to cloud users seeking to protect their gigabytes of vibrant business data from the inquisitive eyes of unauthorized users who are attempting to exceed their authority and also it becomes a challenging issue in cloud storage systems. Ciphertext-Policy Attribute-based Encryption (CP-ABE) is observed as one of the most seemly technologies for data access control in cloud storage, because it gives more direct control access strategies to the cloud data owners. This CP-ABE scheme provides intrinsic security mechanisms designed to minimize the security attacks and threats in cloud system. In this paper, we design a Fortified Access control for Multi-Authority Cloud Storage Systems, where the process of data access control is strengthened to ensure the safety of the cloud data. Fortified access control to discourse not only the data privacy difficulties in existing control scheme, by using multiple authorities in the cloud storage system, the proposed scheme can efficiently reaches the tenable access control and revokes the anonymous access to the cloud data. The study and simulation analysis illustrates that proposed well organized Fortified Access Control is both secure and efficient for Cloud Storage Systems.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


access control; multi-authority; security; cloud storage

PRAVEEN KUMAR,S.NAGA LAKSHMI."Efficient Data Access Control for Multi-Authority Cloud Storage using CP-ABE. ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1182-1187, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1267.pdf,

1. J. Bethencourt, A. Sahai, and B. Waters, “CiphertextPolicy AttributeBased Encryption,” Proc. IEEE Symp.
Security and Privacy (SP ’07), pp. 321-334, 2007.
2. P. Mell and T. Grance, „„The NIST Definition of Cloud
Computing,‟ ‟ National Institute of Standards and
Technology, Gaithersburg, MD, USA, Tech. Rep., 2009.
3. A.B. Lewko, T. Okamoto, A. Sahai, K. Takashima, and
B.Waters, „Fully Secure Functional Encryption: AttributeBased Encryption and (Hierarchical) Inner Product
Encryption,‟ ‟ in Proc. Advances in cryptologyEUROCRYPT’10, 2010, pp. 62-91.
4. M. Li, S. Yu, Y. Zheng, K. Ren, andW. Lou, „„Scalable
and Secure Sharing of Personal Health Records in Cloud
Computing Using Attribute-Based Encryption,‟ ‟ IEEE
Trans. Parallel Distributed Systems, vol. 24, no. 1, pp.
131-143, Jan. 2013.
5. S. Yu, C. Wang, K. Ren, and W. Lou, “Attribute Based
Data Sharing with Attribute Revocation,” Proc. Fifth
ACM Symp. Information, Computer and Comm. Security
(ASIACCS ’10), 2010.
6. J. Hur and D. Noh, “Attribute-based access control
with efficient revocation in data outsourcing systems,”
IEEE Transactions on Parallel and Distributed Systems,
2010.
7. S. Ruj, A. Nayak, and I. Stojmenovic, „„DACC:
Distributed Access Control in Clouds,‟ ‟ in Proc. 10th
IEEE Int’l Conf. TrustCom, 2011, pp. 91-98
8. G. Wang, Q. Liu, and J. Wu, “Hierarchical attributebased encryption for fine-grained access control in cloud
storage services,” in ACM Conference on Computer and
Communications Security, E. Al-Shaer, A. D. Keromytis,
and V. Shmatikov, Eds. ACM, 2010, pp. 735–737. 
9. C. Dong, G. Russello, and N. Dulay, “Shared and
Searchable Encrypted Data for Untrusted Servers,” J.
Computer Security, vol. 19, pp. 367- 397, 2010.
10. D. Boneh and M.K. Franklin, „„Identity-Based
Encryption from the Weil Pairing,‟ ‟ in Proc. 21st Ann.
Int’l Cryptology Conf.: Advances in Cryptology -
CRYPTO’01, 2001, pp. 213-229.

Currently there are no Refbacks

Paper Title : Privacy Preserving with Anonymous Authentication using Decentralized Access Control
Authors : M.Rajesh, Dr G Rama swamy,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

— the spearheading decentralized access control plan for vulnerable data storage in Cloud that backings unidentified confirmation. In the proposed plan, the Cloud checks the validness of the server without knowing the client's uniqueness before putting away data. The proposed outline concentrates on the full cycle access controlling plan wherein the displayed framework it was overlooked. Keeping in mind the end goal to accomplish secure access controlling plan we proposed fine-grained approach at cloud level, it keeps unapproved access controlling from clients or foes adequately our validation and access control plan is decentralized and solid, not at all like different access control plans intended for Cloud which are unified. The correspondence, calculation overheads are like unified methodologies. In addition, our proposed plan demonstrates that our framework has secure crypto instrument towards accomplishing data integrity and security.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Decentralized access Controlling, Coarse-grained Approach, Fine-grained Approach

M.Rajesh,Dr G Rama swamy."Privacy Preserving with Anonymous Authentication using Decentralized Access Control". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1178-1181, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1266.pdf,

[1] S Sushmita Ruj, Milos Stojmenovic and Amiya Nayak, ―Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds‖, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 
[2] C. Wang, Q. Wang, K. Ren, N. Cao, and W. Lou, ―Toward Secure and Dependable Storage Services in Cloud Computing,‖ IEEE Trans. Services Computing, Apr.- June 2012. 
[3] H. Li, Y. Dai, L. Tian, and H. Yang, ―IdentityBased Authentication for Cloud Computing,‖ Proc. First Int’l Conf. Cloud Computing, 2009. 
[4] C. Gentry, ―A Fully Homomorphic Encryption Scheme,‖ PhD dissertation, Stanford Univ., 2009. 
[5] A.-R. Sadeghi, T. Schneider, and M. Winandy, ―Token-Based Cloud Computing,‖ Proc. Third Int’l Conf. Trust and Trustworthy Computing (TRUST), 2010. 
[6] M. Li, S. Yu, K. Ren, and W. Lou, ―Securing Personal Health Records in Cloud Computing: PatientCentric and Fine-Grained Data Access Control in Multi-Owner Settings,‖ Proc. Sixth Int’l ICST Conf. Security and Privacy in Comm. Networks (SecureComm), 2010. 
[7] S. Yu, C. Wang, K. Ren, and W. Lou, ―Attribute Based Data Sharing with Attribute Revocation,‖ Proc. ACM Symp. Information, Computer and Comm. Security (ASIACCS), 2010.
 [8] G. Wang, Q. Liu, and J. Wu, ―Hierarchical Attribute-Based Encryption for Fine-Grained Access Control in Cloud Storage Services,‖ Proc. 17th ACM Conf. Computer and Comm. Security (CCS), 2010. 
[9] F. Zhao, T. Nishide, and K. Sakurai, ―Realizing Fine-Grained and Flexible Access Control to Outsourced Data with Attribute-Based Cryptosystems,‖ Proc. Seventh Int’l Conf. Information Security Practice and Experience (ISPEC), 2011. 
[10] S. Ruj, A. Nayak, and I. Stojmenovic, ―DACC: Distributed Access Control in Clouds,‖ Proc. IEEE 10th Int’l Conf. Trust, Security and Privacy in Computing and Communications (TrustCom), 2011. 
[11] S.SeenuIropia, R.Vijayalakshmi, ―Decentralized Access Control Of Data Stored In Clouds Using Key Policy Attribute Based Encryption‖, International Journal Of Invention In Computer Science And Engineering, 2014.

Currently there are no Refbacks

Paper Title : Automatic and Systematic Methodology for Test Packet Generation
Authors : Prasanna, CH.Harika,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Assistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

As of late systems are becoming wide and more complex. In any case, managers use devices like ping and trace route to investigate issues. Consequently, we proposed a programmed and Systematic methodology for testing and investigating systems called Automated Test Packet Generation (ATPG). This methodology gets switch designs and creates a device autonomous model. ATPG create a couple set of Packet Generation to discover each connection in the system. Test bundles are sent as often as possible and it recognize disappointments to limit the issue. ATPG can distinguish both practical and execution (throughput, inertness) issues. We found, less number of Packet Generation is sufficient to test all principles in systems. For case, 4000 parcels can cover all tenets in Stanford spine system while 53 are sufficiently much to cover all connections.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fault Localization, Test Packet Selection, Network Debugging, Automatic Test packet Generation (ATPG).

Prasanna,CH.Harika."Automatic and Systematic Methodology for Test Packet Generation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1173-1177, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1265.pdf,

[1] Hongyi Zeng, Peyman Kazemian, George Varghese, ACM, and Nick McKeown, ACM,“Automatic Test Packet Generation”. 
[2] M. Jain, C. Dovrolis,“End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput”, IEEE/ACM Trans. Netw., Vol. 11, No. 4, pp. 537–549, Aug. 2003. 
[3] Kompella, R. R., Greenberg, A., Rexford, J., Snoeren, A. C., Yates, J. Cross-layer Visibility as a Service", In Proc. of fourth workshop on Hot Topics in Networks (HotNet-IV) (2005) 
[4] D. Maltz, G. Xie, J. Zhan, H. Zhang, G. Hjalmtysson, A. Greenberg,"Routing design in operational networks: A look from the inside", In Proc. ACM SIGCOMM, 2004. 
[5] Mark Stemm, Randy Katz, Srinivasan Seshan,“A network measurement architecture for adaptive applications”, In Proceedings of the nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 285 - 294, 2000. 
[6] Verma, D.,"Simplifying Network Administration using Policy based Management". 
[7] P. Yalagandula, P. Sharma, S. Banerjee, S. Basu, S.-J. Lee, “S3: A scalable sensing service for monitoring large networked systems". 
[8] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,"Introduction To Algorithms", Eastern Economy Edition.New Delhi: Prentice-Hall of India Private Limited 1998. 
[9] E Balagurusamy,"Programming in ANSI C", Second edition. New Delhi: Tata McGraw-Hill, 1997. 
[10] Deitel & Deitel, C++ How To Program, Second Edition, New Jersey, NJ Prentice Hall, 1997
 [11] Tom Christiansen, Nathn Torkington,"Perl Cookbook: Solutions and Examples For Perl Programmers", 1st Edition, Sebastopol, CA: O’Reilly & Associates, Inc., 1999. 
[12] Nathan Patwardhan, Ellen Siever and Stephen Spainhour, PERL In A Nutshell, 2nd Edition, Sebastopol, CA: O’Reilly & Associates, Inc., 2002. 
[13] Tom Milligan, “Using Perl With Rational ClearCase Automation Library”, 2004Retrieved Nov10, 2010 from

Currently there are no Refbacks

Paper Title : Low Cost Multipurpose Camera
Authors : shahil tp, deepak joseph, sharon TOM
Affiliations : B-Tech (Electronics and Communication Engineering) , Vimal Jyothi Engg. College Chemperi , Kannur ,Kannur university (AICTE)
Abstract :

af

today we are facing many problems with shortage of electricity, so we should develop new systems which use less electricity. Presently we have many security system which consumes electricity in large amount, also they are costly. To overcome this problem we developed a low cost multipurpose camera. With the invention of Raspberry pi, it’s easy to develop low cost multi –Purpose security camera. While compared to ordinary system our system has many advantages, this system has reduced power consumption, less memory is used, and any system can be changed into our system.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Multipurpose camera, raspberry pi, PIR sensor.

shahil tp,deepak joseph,sharon TOM."Low Cost Multipurpose Camera". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1170-1172, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1264.pdf,

[1] Gustavo A. Pelaez C., “Driver Monitoring Based
On Low Cost 3-D Sensors,” IEEE Trans. Intell.
Transp. Syst., vol. 15, no. 4, pp. 1855-1860, Aug. 2014.
[2] T. Wakita et al., “Driver identification using
driving behavior signals,” in Proc. IEEE Intell.
Transp. Syst., 2005, pp. 396-401.
[3] C. Papadelis et al., “Monitoring sleepiness onboard logical recordings for preventing sleepdeprived traffic accidents,” Clin. Neurophysiol., vol.
118, no. 9, pp. 1906-1922, Sep. 2007.
[4] C. Papadelis et al., “Monitoring driver’s
sleepiness on-board for preventing road accidents,”
Stud. Health Technol. Inf., vol. 150, pp. 485-489, 2009.
[5] G Fanelli, T. Weise, J. Gall, and L. Van Gool, “Real
time head pose estimation from consumer depth cameras,” in Proc. Int. Conf. Pattern Recog., 2011, pp.
101-110.
[6] J. Sherrah, S. Gong, and E. J. Ong, “Face
distributions in similarity space under varying head
pose,” Image Vis. Comput., vol. 19, no. 12, pp. 807-
819, Oct. 2001.
[7] P. Viola and M. J. Jones, “Robust real-time face
detection,” Int. J. Comput. Vis., vol. 57, no. 2, pp. 137-
154, May 2004.

Currently there are no Refbacks

Paper Title : BUS PASSENGER ALERT SYSTEM
Authors : Jerrin Yomas, Maneesha Unnikrishnan, Anju C. Justin
Affiliations : Vimal Jyothi Engineering College, Chemperi
Abstract :

af

This is microcontroller based project. In this project we introduce a new system for bus passenger alert. The device that we make will automatically produce a sound message when we reach each bus station. It will also monitor the speed of the vehicle. If the speed exceeds a particular limit a message will be passed to the RTO office to take the necessary actions.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



Jerrin Yomas,Maneesha Unnikrishnan,Anju C. Justin."BUS PASSENGER ALERT SYSTEM". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1166-1169 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1263.pdf,

[1] "ZigBee Specification FAQ". Zigbee Alliance.
Retrieved 14 June 2013.
[2] "ZigBee Wireless Networking", Drew Gislason
(via EETimes) ZigBee Document 053474r06, Version
1.0, ZigBee Specification. ZigBee Alliance. 2004.
[3] "IEEE 802.15.4". Ieee802.org. Retrieved 2012- 10-
18.
[4] Bellido-Outeirino, Francisco J. (February 2012).
"Building lighting automation through the
integration of DALI with wireless sensor networks".
IEEE Transactions on Consumer Electronics 58 (1):
47–52 doi: 10.1109/TCE.2012.61
[5] "Wireless Sensor Networks Research Group".
Sensor-networks.org. 2008-11-17. Retrieved 2012- 10-
18.
[6] Oleg Artamonov (2004-10-26)."X-bit’s Guide:
Contemporary LCD Monitor. Parameters and
Characteristics". Xbitlabs.com. Retrieved 2009-08- 05.

Currently there are no Refbacks

Paper Title : Ultra Stable Flying Robo
Authors : Anoop B K, Manoj K C, Antony Sebastian
Affiliations : ASSISTANT PROFESSOR, VIMAL JYOTHI ENGINEERING COLLEGE, CHEMPERI KANNUR
VIMAL JYOTHI ENGINEERING COLLEGE, CHEMPERI KANNUR
Abstract :

af

— Today we are running out of energy, out of resources, space, etc. high competition in the field for giving more service with lowest cost and maximizing the service. Innovations and inventions are taking place all over the world for delivering the service at lowest cost. The man mobility is decreasing and the work he can do from one place is increasing day by day. Here we are describing a flying object which can fly through the sky for multiple tasks with cheap maintaining costs. For example giving internet, television channels, parcel service, Traffic monitoring etc. are little while we consider the whole scenario. About the device, this device works with the solar energy incorporated with Lithium cells / NiCd Battery chemistries.. Idea by Bionic imitations. And this device has 8 legs which will be used for float movement. It also has gyroscope and accelerometer for steady movements. The attached GPS will enable the device positioning on to deferent geo locations. Communicating with the device is another crucial factor. So far we have two options for the movement. One is the pre allocated trip route set by GPS co-ordinates. Another one is that to establish a wireless RF connection with the device or using the available mobile networks.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Flying object, Arduino, Xbee, GPS, Servo Motor, Communication, Shield

Anoop B K,Manoj K C,Antony Sebastian,Jinu Jose,Jithin M."Ultra Stable Flying Robo". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1162-1165 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1262.pdf,

1. Arduino website: http//www. Arduino.cc/
2. Robort Electronics: http//www,robort-electronics
.co.uk/
3. www.instructables.com
4. www.intorobotics.com
5. www.sparkfun.com
6. http://www.wikipedia.com

Currently there are no Refbacks

Paper Title : Smart Restaurant
Authors : Mrs. Bindu Sebastian, Athira Varghese, Megha Merin Jose
Affiliations : ECE Department, Vimal Jyothi Engineering College,Kannur
Abstract :

af

Smart Restaurant is concept to realize the automation in restaurants or hotels. In this restaurant the kitchen people can get orders from each table through voice alert. This project consists of two sections one is transmitter section and other is receiver section. In our project we have designed an electronic system to order through RF based wireless communication using a menu card provided on each table. Touch panel is used here, which offers simple and multiple menus driven control panel. Mainly touch screen technology is used where control or settings of different parameters in wide manner. We can select the items shown in its display along with its price and can order the selected items through touch panel. The total cost of the items is also displayed. This order details are collected by wireless receiver placed in the kitchen and will display the items in its display along with the voice announcement through speaker. Each table has its own unique digital code. So the kitchen people can supply those items to that table after preparing it. This will give advantage to avoid the time delay usually experienced during bearer coming, collecting order and finally passes to the kitchen manually.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Radio frequency, automation, microcontroller unit, liquid crystal display, transceiver

Mrs. Bindu Sebastian,Athira Varghese,Megha Merin Jose."Smart Restaurant". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1158-1161, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1261.pdf,

1. LINEAR INTEGRATED CIRCUITS:- Dr.
ROY CHOUDHARY, SHAIL .D. JAIN
2. ELECTRONIC CIRCUITS & DEVICES:- J.B
GUPTA
3. SOLID STATE ELECTRONIC DEVICES:-
DENU STREETMAN, SANJAY BANERJEE 

Currently there are no Refbacks

Paper Title : TSUNAMI DETECTION SYSTEM
Authors : Mrs.Grace John , Athira P I, Sreedevi K
Affiliations : ECE Department, Vimal Jyothi Engineering College,Kannur
Abstract :

af

The Tsunami waves cause considerable destruction and kills people . The detection section of the proposed system consists of a microcontroller, a vibration sensor to detect the Tsunami occurrence and a tilt sensor to monitor the sea waves. The principle is as follows, on the onslaught of Tsunami or any other natural calamity of this type , there is an abnormal pressure changes in the sea floor producing vibrations. Here a piezoelectric vibration sensor is used which gives an output depending on variations, and a microcontroller is used to announce the oncoming of Tsunami event to a concerned person, through the mobile computing. Mobile is used to give warning calls or send warning messages.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Peripheral Interface Controller

Mrs.Grace John ,Athira P I,Sreedevi K."TSUNAMI DETECTION SYSTEM". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1153-1157 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1260.pdf,

[1] Kenneth Jamaal,“8051 Microcontroller “, West Publishing Company, 1991. 
[2] R.S.Sedha, B.L.Theraja, ”Principles of Electronics Devices and Circuits”, International Book distributing CO, India, 1998. 
[3] Steven Roman, Ron Petrusha, Paul Lomax, “VB.Net Language In a nutshell”, O’Reilly, 2002. 
[4] F.I.Gonneuman, Jalez, H.B.milburn, E.N.Bernard, Journalfrom “Oceanic and Atmospheric Administration”, WA98115, 2003. 
[5] Wayne, A.Morrissey, Journal from “Science and Technology Information Resources, Science and Industry Division”, 2005. 
[6] Macrander , ”PACT-a bottom pressure based .Compact Deep ocean Tsunameter with Acoustic surface Coupling.” 2009 IEEE.
[7] YasuakiTeshirogi, Jun Sawamoto, NorihisaSegawa, EijiSugino, “A proposal of Tsunami warning system Using Area Mail Disaster Information Service on mobile Phones.”2009 International Conference on Advanced Information networking and application workshops.
 [8] USAID|ASIA –“How do seismometers contribute to a Tsunami Warning System”.

Currently there are no Refbacks

Paper Title : Review on Data Mining Techniques with Big Data
Authors : TEMPALLI NARENDRA BABU, R.MADHURI DEVI,
Affiliations : M.Tech (CSE), Priyadrshini Institute of Technology & Management
AssociateProfessor (Dept.of CSE), Priyadrshini Institute of Technology & Management
Abstract :

af

The term Big Data comprises large- volume, complex, growing data sets with multiple, autonomous sources. With the fast development of networking, data storage, and the data collection capacity, Big Data are now rapidly expanding in all science and engineering domains, including physical, biological and biomedical sciences. This paper presents a HACE theorem that characterizes the features of the Big Data revolution, and proposes a Big Data processing model, from the data mining perspective. This data-driven model involves demand- driven aggregation of information sources, mining and analysis, user interest modeling, and security and privacy considerations. We analyze the challenging issues in the data-driven model and also in the Big Data revolution.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


HACE,Hadoop,Big Data, heterogeneity, autonomous sources, complex and evolving associations

TEMPALLI NARENDRA BABU,R.MADHURI DEVI."Review on Data Mining Techniques with Big Data". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1147-1152, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1259.pdf,

1. Bakshi, K.,(2012),” Considerations for big data: Architecture and approach” 
2. Mukherjee, A.; Datta, J.; Jorapur, R.; Singhvi, R.; Haloi, S.; Akram, W., (18-22 Dec.,2012) , “Shared disk big data analytics with Apache Hadoop” 
3. Aditya B. Patel, Manashvi Birla, Ushma Nair ,(6-8 Dec. 2012),“Addressing Big Data Problem Using Hadoop and Map Reduce”
 4. Wei Fan and Albert Bifet “ Mining Big Data:Current Status and Forecast to the Future”,Vol 14,Issue 2,2013 
5. Algorithm and approaches to handle large Data-A Survey,IJCSN Vol 2,Issue 3,2013
 6. Xindong Wu , Gong-Quing Wu and Wei Ding “ Data Mining with Big data “, IEEE Transactions on Knoweledge and Data Enginnering Vol 26 No1 Jan 2014 
7. Xu Y etal, balancing reducer workload for skewed data using sampling based partioning 2013. 
8. X. Niuniu and L. Yuxun, “Review of Decision Trees,” IEEE, 2010 . 
9. Decision Trees for Business Intelligence and Data Mining: Using SAS Enterprise Miner “Decision Trees-What Are They?”
 10. Weiss, S.H. and Indurkhya, N. (1998), Predictive Data Mining: A Practical Guide, Morgan Kaufmann Publishers, San Francisco, CA

Currently there are no Refbacks

Paper Title : Automatic and Methodical approach for Test Packet Generation
Authors : BEJJANKI PRADEEPKUMAR, D.RAVI KIRAN,
Affiliations : M.Tech (CSE), Priyadrshini Institute of Technology & Management
Professor (Dept.of CSE), Priyadrshini Institute of Technology & Management
Abstract :

af

Recently networks are growing wide and more complex. However administrators use tools like ping and trace route to debug problems. Hence we proposed an automatic and Methodical approach for testing and debugging networks called Automatic Test Packet Generation (ATPG). This approach gets router configurations and generates a device-independent model. ATPG generate a few set of test packets to find every link in the network. Test packets are forwarded frequently and it detect failures to localize the fault. ATPG can detect both functional and performance (throughput, latency) problems. We found, less number of test packets is enough to test all rules in networks.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fault Localization, Test Packet Selection, Network Debugging, Automatic Test packet Generation (ATPG).

BEJJANKI PRADEEPKUMAR,D.RAVI KIRAN."Automatic and Methodical approach for Test Packet Generation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1142-1146 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1258.pdf,

[1] Hongyi Zeng, Peyman Kazemian, George Varghese, ACM, and Nick McKeown, ACM,“Automatic Test Packet Generation”.
 [2] M. Jain, C. Dovrolis,“End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput”, IEEE/ACM Trans. Netw., Vol. 11, No. 4, pp. 537–549, Aug. 2003. 
[3] Kompella, R. R., Greenberg, A., Rexford, J., Snoeren, A. C., Yates, J. Cross-layer Visibility as a Service", In Proc. of fourth workshop on Hot Topics in Networks (HotNet-IV) (2005)
 [4] D. Maltz, G. Xie, J. Zhan, H. Zhang, G. Hjalmtysson, A. Greenberg,"Routing design in operational networks: A look from the inside", In Proc. ACM SIGCOMM, 2004. 
[5] Mark Stemm, Randy Katz, Srinivasan Seshan,“A network measurement architecture for adaptive applications”, In Proceedings of the nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 285 - 294, 2000. 
[6] Verma, D.,"Simplifying Network Administration using Policy based Management". 
[7] P. Yalagandula, P. Sharma, S. Banerjee, S. Basu, S.-J. Lee, “S3: A scalable sensing service for monitoring large networked systems". 
[8] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,"Introduction To Algorithms", Eastern Economy Edition.New Delhi: Prentice-Hall of India Private Limited 1998. 
[9] E Balagurusamy,"Programming in ANSI C", Second edition. New Delhi: Tata McGraw-Hill, 1997. 
[10] Deitel & Deitel, C++ How To Program, Second Edition, New Jersey, NJ Prentice Hall, 1997 
[11] Tom Christiansen, Nathn Torkington,"Perl Cookbook: Solutions and Examples For Perl Programmers", 1st Edition, Sebastopol, CA: O’Reilly & Associates, Inc., 1999. 
[12] Nathan Patwardhan, Ellen Siever and Stephen Spainhour, PERL In A Nutshell, 2nd Edition, Sebastopol, CA: O’Reilly & Associates, Inc., 2002. 
[13] Tom Milligan, “Using Perl With Rational ClearCase Automation Library”, 2004Retrieved Nov10, 2010 from

Currently there are no Refbacks

Paper Title : A Secure and Dynamic Multi Keyword Ranked Search Scheme over encrypted
Authors : A.Raghavendra Praveen Kumar, K.Tarakesh, U.Veeresh
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
Assistant Professor, Department of Computer Science and Engineering G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

The major aim of this paper is to solve the problem of multi-keyword ranked search over encrypted cloud data (MRSE) at the time of protecting exact method wise privacy in the cloud computing concept. Data holders are encouraged to outsource their difficult data management systems from local sites to the business public cloud for large flexibility and financial savings. However for protecting data privacy, sensitive data have to be encrypted before outsourcing, which performs traditional data utilization based on plaintext keyword search. As a result, allowing an encrypted cloud data search service is of supreme significance. In view of the large number of data users and documents in the cloud, it is essential to permit several keywords in the search demand and return documents in the order of their appropriate to these keywords. Similar mechanism on searchable encryption makes centre on single keyword search or Boolean keyword search, and rarely sort the search results. In the middle of various multi-keyword semantics, deciding the well-organized similarity measure of “coordinate matching,” it means that as many matches as possible, to capture the appropriate data documents to the search query. Particularly, we consider “inner product similarity” i.e., the amount of query keywords shows in a document, to quantitatively estimate such match measure that document to the search query. Through the index construction, every document is connected with a binary vector as a sub index where each bit characterize whether matching keyword is contained in the document. The search query is also illustrates as a binary vector where each bit means whether corresponding keyword appears in this search request, so the matched one could be exactly measured by the inner product of the query vector with the data vector. On the other hand, directly outsourcing the data vector or the query vector will break the index privacy or the search privacy. The vector space model facilitate to offer enough search accuracy, and the DES encryption allow users to occupy in the ranking while the popularity of computing work is done on the server side by process only on cipher text. As a consequence, data leakage can be eradicated and data security is guaranteed.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Multi-keyword ranked search over encrypted cloud data, OTP, Product resemblance, Cloud, Data owners

A.Raghavendra Praveen Kumar,K.Tarakesh,U.Veeresh."A Secure and Dynamic Multi Keyword Ranked Search Scheme over encrypted". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1137-1141, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1257.pdf,

[1] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data,” Proc. IEEE INFOCOM, pp. 829- 837, Apr, 2011.
[2] L.M. Vaquero, L. Rodero-Merino, J. Caceres, and M.Lindner, “A Break in the Clouds: Towards a Cloud Definition,” ACM SIGCOMM Comput. Commun. Rev., vol. 39, no. 1, pp. 50-55, 2009.
[3] N. Cao, S. Yu, Z. Yang, W. Lou, and Y. Hou, “LT Codes-Based Secure and Reliable Cloud Storage Service,” Proc. IEEE INFOCOM, pp. 693- 701, 2012. 
[4] S. Kamara and K. Lauter, “Cryptographic Cloud Storage,” Proc. 14th Int’l Conf. Financial Cryptograpy and Data Security, Jan. 2010. 
[5] A. Singhal, “Modern Information Retrieval: A Brief Overview,” IEEE Data Eng. Bull., vol. 24, no. 4, pp. 35- 43, Mar. 2001. 
[6] I.H. Witten, A. Moffat, and T.C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishing, May 1999. 
[7] D. Song, D. Wagner, and A. Perrig, “Practical Techniques for Searches on Encrypted Data,” Proc. IEEE Symp. Security and Privacy, 2000. 
[8] E.-J. Goh, “Secure Indexes,” Cryptology ePrint Archive, http:// eprint.iacr.org/2003/216. 2003. [9] Y.-C. Chang and M. Mitzenmacher, “Privacy Preserving Keyword Searches on Remote Encrypted Data,” Proc. Third Int’l Conf. Applied Cryptography and Network Security, 2005. 
[10] R. Curtmola, J.A. Garay, S. Kamara, and R. Ostrovsky, “Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions,” Proc. 13th ACM Conf. Computer and Comm. Security (CCS ’06), 2006. 
[11] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public Key Encryption with Keyword Search,” Proc. Int’l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), 2004. 
[12] M. Bellare, A. Boldyreva, and A. ONeill, “Deterministic and Efficiently Searchable Encryption,” Proc. 27th Ann. Int’l Cryptology Conf. Advances in Cryptology (CRYPTO ’07), 2007. 
[13] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, “Searchable Encryption Revisited: Consistency Properties, sRelation to Anonymous Ibe, and Extensions,” J. Cryptology, vol. 21, no. 3, pp. 350-391, 2008.

Currently there are no Refbacks

Paper Title : Key Aggregate Searchable Encryption for Group Data Sharing Via Cloud Data Storage
Authors : K.Manohar, R. Anil Kumar, N.Parashuram
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering</br>Assistant Professor, Department of Computer Science and Engineering G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

the ability of preferentially sharing encrypted data with unlike users through public cloud storage might really ease security distress, by possibility data disclose in the cloud. A key test to design such encryption idea lies in the well-organized management encryption keys. The preferred flexibility of allocating any group documents with any group of users by attaining weightage different encryption keys to be used for different documents. On the other hand, this involves the need of securely distributing to users by a large number of keys for both encryption and search, and those users have to progress to store the received keys. The indirect need for secure communication, storage, and complexity clearly cause the unreasonable approach. In this paper, we concentrate on this practical problem, by suggesting the novel concept of key aggregate searchable encryption (KASE) and instantiating the idea through a real KASE scheme, in which a data owner wants to share out a single key to a user for distributing a large number of documents, and the user needs to present a single trapdoor to the cloud for questioning the shared documents.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


data sharing, Searchable encryption, data privacy, cloud storage

K.Manohar,R. Anil Kumar,N.Parashuram."Key Aggregate Searchable Encryption for Group Data Sharing Via Cloud Data Storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1132-1136, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1256.pdf,

[1] Baojiang Cui, Zheli Liu and Lingyu Wang : Key-Aggregate Searchable Encryption for Group Data Sharing via Cloud Storage, IEEE Transactions On Computers, Vol. 6, No. 1, January 2014
 [2] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance:The Essential of Bread and Butter of Data Forensics in Cloud Computing”, Proc. ACM Symp. Information, Computer and Comm.Security, pp. 282-292, 2010. 
[3] X. Liu, Y. Zhang, B. Wang, and J. Yan. “Mona: secure multiowner data sharing for dynamic groups in the cloud”, IEEE Transactions on Parallel and Distributed Systems, 2013, 24(6): 1182-1191. 
[4] C. Chu, S. Chow,W. Tzeng, et al. “KeyAggregate Cryptosystem for Scalable Data Sharing in Cloud Storage”, IEEE Transactions on Parallel and Distributed Systems, 2014, 25(2): 468-477. 
[5] X. Song, D.Wagner, A. Perrig. “Practical techniques for searches on encrypted data”, IEEE Symposium on Security and Privacy, IEEE Press, pp. 44C55, 2000. 
[6] R. Curtmola, J. Garay, S. Kamara, R. Ostrovsky. “Searchable symmetric encryption: improved definitions and efficient constructions”, In: Proceedings of the 13th ACM conference on Computer and Communications Security, ACM Press, pp. 79-88, 2006. [7] P. Van,S. Sedghi, JM. Doumen. “Computationally efficient searchable symmetric encryption”, Secure Data Management, pp.87- 100, 2010. 
[8] S. Kamara, C. Papamanthou, T. Roeder. “Dynamic searchable symmetric encryption”, Proceedings of the 2012 ACM conference on Computer and communications security (CCS), ACM, pp. 965- 976, 2012. 
[9] D. Boneh, C. G, R. Ostrovsky, G. Persiano. “Public Key Encryption with Keyword Search”, EUROCRYPT 2004, pp. 506C522,2004. 
[10] Y. Hwang, P. Lee. “Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System”, In: PairingBased Cryptography C Pairing 2007, LNCS, pp. 2-22, 2007. [11] J. Li, Q. Wang, C. Wang. “Fuzzy keyword search over encrypted data in cloud computing”, Proc. IEEE INFOCOM, pp. 1-5, 2010. 
[12] C. Bosch, R. Brinkma, P. Hartel. “Conjunctive wildcard search over encrypted data”, Secure Data Management. LNCS, pp. 114- 127, 2011. 
[13] C. Dong, G. Russello, N. Dulay. “Shared and searchable encrypted data for untrusted servers”, Journal of Computer Security, pp. 367-397, 2011. 
[14] F. Zhao, T. Nishide, K. Sakurai. Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control. Information Security and Cryptology, LNCS, pp. 406-418, 2012. 
[15] J. W. Li, J. Li, X. F. Chen, et al. “Efficient Keyword Search over Encrypted Data with FineGrained Access Control in Hybrid Cloud”, In: Network and System Security 2012, LNCS, pp. 490- 502, 2012. 
[16] J. Li, K. Kim. “Hidden attribute-based signatures without anonymity revocation”, Information Sciences, 180(9): 1681-1689, Elsevier, 2010. 
[17] X.F. Chen, J. Li, X.Y. Huang, J.W. Li, Y. Xiang. “Secure Outsourced Attribute-based Signatures”, IEEE Trans. on Parallel and Distributed Systems, DOI.ieeecomputersociety.org/10.1109/TPDS.2013. 180, 2013. 
[18] J.Li, X.F. Chen, M.Q. Li, J.W. Li, P. Lee, Wenjing Lou. “Secure Deduplication with Efficient and Reliable Convergent Key Management”, IEEE Transactions on Parallel and Distributed Systems, 25(6): 1615-1625, 2014. 
[19] Z. Liu, Z. Wang, X. Cheng, et al. “Multi-user Searchable Encryption with Coarser-Grained Access Control in Hybrid Cloud”, Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT), IEEE, pp. 249-255, 2013. 
[20] C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing”, Proc. IEEE INFOCOM, pp. 525-533, 2010. 
[21] B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large Groups in the Cloud”, Proc. 10th Int’l Conf. Applied Cryptography and Network Security, pp. 507- 525, 2012. 
[22] D. Boneh, C. Gentry, B. Waters.“ Collusion resistant broadcast encryption with short ciphertexts and private keys”, Advances in CryptologyCCRYPTO 2005, pp. 258-275, 2005. 
[23] D. H. Phan, D. Pointcheval, S. F. Shahandashti, et al. “Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts”, International journal of information security, 12(4):251-265, 2013.
 [24] D. Boneh, B. Lynn, H. Shacham. “Short signatures from the Weil pairing”, Advances in Cryptology ASIACRYPT 2001, pp. 514-532, 2001.

Currently there are no Refbacks

Paper Title : Cost-Effective Authentic and Anonymous Data Sharing with Forward Security
Authors : C.Praveen Kumar, P Suman Prakash, Dr.S.Prem Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
Professor & HOD, Department of computer science and engineering, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

Data distribution is not at all easier with the progress of cloud computing, and an exact examination on the shared data offers a collection of profits both to the the public and individuals. Data distribution with a huge number of applicants must get into account numerous issues, counting effectiveness, data integrity and confidentiality of data owner. Ring signature is a capable applicant to build an unsigned and genuine data sharing system. It lets a data owner to secretly authenticate his data which can be set into the cloud for storage or scrutiny purpose. so far the expensive certificate authentication in the conventional public key infrastructure (PKI) surroundings becomes a restricted access for this solution to be scalable. Identity-based (ID-based) ring signature, which eradicates the method of certificate verification, can be utilized instead. In this paper, we additionally improve the safety of ID-based ring signature by giving advance security: If a secret key of any user has been compromise, all earlier produced signatures that contain this user still remains legal. This property is particularly significant to any huge scale data distribution system, since it is unfeasible to request all data owners to re-authenticate their data still if a secret key of one single user has been compromised. We offer an actual and well-organized instantiation of our scheme, demonstrate its safety and supply an accomplishment to illustrate its realism.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


cloud computing, forward security, smart grid, data distribution, Authentication

C.Praveen Kumar,P Suman Prakash,Dr.S.Prem Kumar."Cost-Effective Authentic and Anonymous Data Sharing with Forward Security". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1126-1131, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1255.pdf,

[1] M. Abe, M. Ohkubo, and K. Suzuki, “1-out-ofn signatures from a variety of keys,” in Proc. 8th Int. Conf. Theory Appl. Cryptol. Inform. Security: Adv. Cryptol., 2002, vol. 2501, pp. 415–432. 
[2] R. Anderson, “Two remarks on public-key cryptology,” Manu-script, Sep. 2000. (Relevant material presented by the author in an invited lecture at the Fourth ACM Conference on Computer and Communications Security, 1997.)
 [3] G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, “A practical and provably secure coalition-resistant group signature scheme,” in Proc. 20th Annu. Int. Cryptol. Conf. Adv. Cryptol., 2000, vol. 1880, pp. 255–270. 
[4] M. H. Au, J. K. Liu, T. H. Yuen, and D. S. Wong, “ID-based ring signature scheme secure in the standard model,” in Proc. 1st Int. Workshop Security Adv. Inform. Comput. Security, 2006, vol. 4266, pp. 1-16
 [5] A. K. Awasthi and S. Lal, “Id-based ring signature and proxy ring signature schemes from bilinear pairings,” CoRR, vol. abs/cs/ 0504097, 2005. 
[6] M. Bellare, D. Micciancio, and B. Warinschi, “Foundations of group signatures: Formal definitions, simplified requirements and a construction based on general assumptions,” in Proc. 22nd Int. Conf. Theory Appl. Cryptographic Techn., 2003, vol. 2656, pp 614– 629
 [7] M. Bellare and S. Miner, “A forward-secure digital signature scheme,” in Proc. 19th Annu. Int. Cryptol. Conf., 1999, vol. 1666, 
[8] J.-M. Bohli, N. Gruschka, M. Jensen, L. L. Iacono, and N. Marnau, “Security and privacy-enhancing multicloud architectures,” IEEE Trans. Dependable Sec. Comput., vol. 10, no. 4, pp. 212–224, Jul. \Aug. 2013. 
[9] A. Boldyreva, “Efficient threshold signature, multisignature and blind signature schemes based on the gap Diffie-Hellman group signature scheme,” in Proc. 6th Int. Workshop Theory Practice PublicKey Cryptography: Public Key Cryptography, 2003, vol. 567, pp. 31–46. 
[10] D. Boneh, X. Boyen, and H. Shacham, “Short group signatures,” in Proc. Annu. Int. Cryptol. Conf. Adv. Cryptol., 2004, vol. 3152, pp. 41–55. 
[11] E. Bresson, J. Stern, and M. Szydlo, “Threshold ring signatures and applications to ad-hoc groups,” in Proc. 22nd Annu. Int. Cryp-tol. Conf. Adv. Cryptol., 2002, vol. 2442, pp. 465–480. [12] J. Camenisch, “Efficient and generalized group signatures,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 1997, vol. 1233, pp. 465–479. 
[13] N. Chandran, J. Groth, and A. Sahai, “Ring signatures of sub-linear size without random oracles,” in Proc. 34th Int. Colloq. Automata, Lang. Programming, 2007, vol. 4596, pp. 423– 434. 
[14] K. Chard, K. Bubendorfer, S. Caton, and O. F. Rana, “Social cloud computing: A vision for socially motivated resource sharing,” IEEE Trans.Serv.Comput.,vol.5,no.4,pp.551– 563,FourthQuarter2012. 
[15] D. Chaum and E. van Heyst, “Group signatures,” in Proc. Work-shop Theory Appl. Cryptographic Techn., 1991, vol. 547, pp. 257– 265. 
[16] L. Chen, C. Kudla, and K. G. Paterson, “Concurrent signatures,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 2004, vol. 3027, pp. 287–305. 
[17] H.-Y. Chien, “Highly efficient ID-based ring signature from pairings,” in Proc. IEEE AsiaPacific Serv. Comput. Conf., 2008, pp. 829–834. 
[18] S. S. Chow, R. W. Lui, L. C. Hui, and S. Yiu, “Identity based ring signature: Why, how and what next,” in Proc. 2nd Eur. Public Key Infrastructure Workshop, 2005, vol. 3545, pp. 144–161. 
[19] S. S. M. Chow, V.K.-W. Wei, J. K. Liu, and T. H. Yuen, “Ring sig-natures without random oracles,” in Proc. ACM Symp. Inform., Comput., Commun. Security, 2006, pp. 297– 302. 
[20] S. S. M. Chow, S.-M. Yiu, and L. C. K. Hui, “Efficient identity based ring signature,” in Proc. 3rd Int. Conf. Appl. Cryptography Netw. Security, 2005, vol. 3531, pp. 499–512. 
[21] R. Cramer, I. Damgard, and B. Schoenmakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” in Proc. 14th Annu. Int. Cryptol. Conf. Adv. Cryptol., 1994, vol. 839, pp. 174–187. 
[22] R. Cramer and V. Shoup, “Signature schemes based on the strong RSA assumption,” in Proc. ACM Conf. Comput. Commun. Security, 1999, pp. 46–51. 
[23] Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup, “Anonymous identification in Ad Hoc groups,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 2004, vol. 3027, pp. 609–626. 
[24] A. L. Ferrara, M. Green, S. Hohenberger, and M. Ø. Pedersen. (2009). Practical short signature batch verification,” in Proc. Cryptographers’ Track RSA Conf. Topics Cryptol., vol. 5473, pp. 309– 324 [Online]. Available: http://eprint.iacr.org/2008/015 
[25] J. Han, Q. Xu, and G. Chen, “Efficient IDbased threshold ring sig-nature scheme,” in Proc. IEEE/IFIP Int. Conf. Embedded Ubiquitous Comput., 2008, pp. 437–442.

Currently there are no Refbacks

Paper Title : A Dynamic Secure Group Sharing Framework in Public Cloud Computing
Authors : N.Mounika, N.Parushuram, R.Anil Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
Assistant Professor, Department of Computer Science and Engineering
G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

Cloud computing is the extended vision of computing as a effectiveness, where data owners can remotely store their data. The essential service presents by the Cloud is Data Storage. On the other hand, it is a tricky task for sharing data in multi-owner manner anywhere group admin and all group members can store and alter data while protecting data and identity privacy from an untrusted cloud server, due to the frequent change of the membership. so secure multi-owner data sharing scheme for dynamic groups in the cloud computing have been projected which absorb addition of group signature and broadcast encryption techniques. However this system also recognized some boundaries in terms of competence and security. since multi-owner data storing and sharing in a dynamic surroundings dumps enormous amount of data files in the cloud, which leftovers in cloud for imprecise period of time. The confidential information stored may changed by service providers. To maintain cloud file’s security and privacy regular elimination of unwanted files is needed. To determine this drawback we propose new framework which is Reliable and Scalable Secure Method to Store and Share Secrete Data for groups in Cloud i.e MONA that remove unnecessary files automatically when the predefined time period for sharing specified by data owner has been run out which improve performance of the system in terms of security and efficiency. Also this method decreases the overhead at the time of upload and download file in the cloud. At last proposed method by name Multi Owner Data Sharing over Cloud (MODOC) declares required efficiency and most importantly security. We apply a working prototype of the MODOC method and assess its performance based on the time addicted during various operations the results give you an idea about that MODOC has the prospective to be effectively used for secure data sharing in the cloud.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Dynamic group, group signature, dynamic broadcast encryption, data sharing, privacy-preserving.

N.Mounika,N.Parushuram,R.Anil Kumar."A Dynamic Secure Group Sharing Framework in Public Cloud Computing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1119-1125, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1254.pdf,

[1] Xuefeng Liu, Yuqing Zhang, Boyang Wang, and Jingbo Yan, “Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud”, IEEE Transactions On Parallel and Distributed Systems, Vol.24, No. 6, June 2013. 
[2] S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing,” Proc. IEEE INFOCOM, pp. 534-542, 2010.
 [3] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of /Data Forensics in Cloud Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010. 
[4] Yong CHENG, Jun MA and Zhi-ying “Efficient revocation in cipertext-policy attribute-based encryption based cryptographic cloud storage” Zhejiang University and Springer-Verlag Berlin 2011 
[5] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “A View of Cloud Computing,” Comm. ACM, vol. 53,no. 4, pp. 50-58, Apr. 2010. 
[6] B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large Groups in the Cloud,” Proc. 10th Int’l Conf. Applied Cryptography and Network Security, pp. 507-525, 2012. 
[7] C. Delerablee, P. Paillier, and D. Pointcheval, “Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys,” Proc. First Int’l Conf. PairingBased Cryptography, pp. 39-59, 2007. 
[8] B. Waters, “Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization,” Proc. Int’l Conf. Practice and 
[9] Theory in Public Key Cryptography Conf. Public Key Cryptography, http://eprint.iacr.org/2008/290.pdf, 2008.
[10]D. Boneh, X. Boyen, and H. Shacham, Short Group Signature, Proc. Intl Cryptology Conf. Advances in Cryptology (CRYPTO), pp. 41-55, 2004. 
[11]V. Goyal, O. Pandey, A. Sahai, and B. Waters, Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data, Proc. ACM Conf. Computer and Comm. Security (CCS), pp. 89-98, 2006.

Currently there are no Refbacks

Paper Title : A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud
Authors : G.Mercy Vimala, R.Vara Prasad, P.Rama Rao
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE<
Assistant Professor, Department of Computer Science and Engineering
Assistant Professor, Department of Computer Science and Engineering
G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

The Benefited from Cloud Computing, clients can achieve a flourishing and moderate methodology for information sharing among gathering individuals in the cloud with the characters of low upkeep and little administration cost. Then, security certifications to the sharing information records will be given since they are outsourced. Horribly, due to the never-ending change of the enrolment, sharing information while giving protection saving is still a testing issue, particularly for an untrusted cloud because of the agreement attack. In addition, for existing plans, the security of key dispersion depends on the safe communication channel, then again, to have such channel is a solid feeling and is difficult for practice. In this paper, we propose a safe information sharing plan for element individuals. Firstly, we propose a safe route for key dispersion with no safe correspondence channels, and the clients can safely acquire their private keys from gathering administrator. Besides, the plan can accomplish fine-grained access control, any client in the gathering can utilize the source in the cloud and refused clients can't get to the cloud again after they are rejected. Thirdly, we can protect the plan from trickery attack, which implies that rejected clients can't get the first information record regardless of the possibility that they scheme with the untrusted cloud. In this methodology, by utilizing polynomial capacity, we can achieve a protected client denial plan. At long last, our plan can bring about fine productivity, which implies past clients need not to overhaul their private keys for the circumstance either another client joins in the gathering or a client is give up from the gathering.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access control, Privacy-preserving, Key distribution, Cloud computing

G.Mercy Vimala,R.Vara Prasad,P.Rama Rao."A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1113-1118, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1253.pdf,

[1] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia. “A View of Cloud omputing,” Comm. ACM, vol. 53, no. 4, pp. 50-58, Apr.2010. 
[2] S. Kamara and K. Lauter, “Cryptographic Cloud Storage,” Proc. Int’l Conf.Financial Cryptography and Data Security (FC), pp.136- 149, Jan. 2010. 
[3] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu, “Plutus: ScalableSecure File Sharing on Untrusted Storage,” Proc. USENIX Conf. File and Storage Technologies, pp. 29-42, 2003. 
[4] E. Goh, H. Shacham, N. Modadugu, and D. Boneh, “Sirius: Securing Remote Untrusted Storage,” Proc. Network and Distributed Systems Security Symp. (NDSS), pp. 131-145, 2003. 
[5] G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage,” Proc.Network and Distributed Systems Security Symp. (NDSS), pp. 29-43, 2005. 
[6] Shucheng Yu, Cong Wang, Kui Ren, and Weijing Lou, “Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010. 
[7] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data,” Proc. ACM Conf. Computer and Comm. Security (CCS), pp. 89- 98, 2006 
[8] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of Data Forensics in Cloud Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010.
[9] B. Waters, “Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization,” Proc. Int’l Conf.http://eprint.iacr.org/2008/290.pdf, 2008 
[10] Xuefeng Liu, Yuqing Zhang, Boyang Wang, and Jingbo Yang, “Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud,” IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 6, pp. 1182-1191, June 2013. 
[11]D. Boneh, X. Boyen, and E. Goh, “Hierarchical Identity Based Encryption with Constant Size Ciphertext,” Proc. Ann. Int’l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 440-456, 2005. 
[12] C. Delerablee, P. Paillier, and D. Pointcheval, “Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ci-phertexts or Decryption Keys,” Proc.First Int’l Conf. PairingBased Cryptography, pp. 39-59, 2007. 
[13] Zhongma Zhu, Zemin Jiang, Rui Jiang, “The Attack on Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud,” Proceedings of 2013 International Conference on Information Science and Cloud Computing (ISCC 2013 ), Guangzhou, Dec.7, 2013, pp. 185-189. 
[14] Lan Zhou, Vijay Varadharajan, and Michael Hitchens, “Achieving Secure Role-Based Access Control on Encrypted Data in Cloud Storage,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 12, pp. 1947-1960, December 2013. 
[15] Xukai Zou, Yuan-shun Dai, and Elisa Bertino, “A practical and flexible key management mechanism for trusted collaborative computing,” INFOCOM 2008, pp. 1211-1219. 
[16] M. Nabeel, N. Shang, and E. Bertino, “Privacy preserving policy based content sharing in public clouds,” IEEE Trans. on Know. and Data Eng., vol. 25, no. 11, pp. 2602-2614, 2013. [17] Dolev, D., Yao A. C., "On the security of public key protocols", IEEE trans. on Information Theory, vol. IT-29, no. 2, pp. 198–208, 1983 [18] Boneh Dan, Franklin Matt, “Identitybased encryption from the weil pairing,” Lecture Notes in Computer Science, vol. 2139 LNCS, pp. 213-229, 2001

Currently there are no Refbacks

Paper Title : A Survey on Dynamic Resource Allocation for Efficient Parallel Data Processing
Authors : B. Praveen Kumar, Santhosh Kumar,
Affiliations : M.Tech (CSE), Sreyas Institute of Engineering & Technology
Associate Professor Dept.of Computer Science & Engineering, Sreyas Institute of Engineering & Technology
Abstract :

af

As recently ad-hoc parallel information handling has developed to be one of the executioner applications for Infrastructure as a service (IaaS) cloud. Most of the Distributed computing organizations have begun to coordinate systems for parallel information making ready in their item portfolio, making it straightforward for clients to get to these Infrastructure and to convey their projects. The preparing constitution which are right now utilized have been intended for static, homogeneous group setups and slight the specific way of a cloud. Subsequently, the dispensed figure assets may be lacking for huge parts of the submitted work and superfluously increment handling time and cost. In this paper we discuss the challenges for proficient parallel information handling in cloud and introduce our exploration venture Nephele. Nephele is the first information preparing structure to expressly neglect the dynamic quality portion offered by today's IaaS mists for each, trip booking and execution. In this paper we talk about the open doors and challenges for effective parallel information preparing Specific errands of a handling occupation can be doled out to distinctive sorts of virtual machines which are consequently instantiated and ended amid the employment execution. In view of this new structure, we perform amplified assessments of Map Reduce-roused preparing occupations on an IaaS cloud framework and contrast the outcomes with the mainstream information handling system Hadoop.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Numerous Assignment Processing, High-Throughput Registering, Approximately Coupled Applications, Distributed computing.

B. Praveen Kumar,Santhosh Kumar."A Survey on Dynamic Resource Allocation for Efficient Parallel Data Processing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1106-1112, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1252.pdf,

[1] Amazon Web Services LLC. Amazon Elastic Compute Cloud (Amazon EC2). http://aws.amazon.com/ec2/, 2009. 
[2] Amazon Web Services LLC. Amazon Elastic MapReduce. http://aws.amazon.com/elasticmapreduce/ , 2009. 
[3] AmazonWeb Services LLC. Amazon Simple Storage Service. http://aws.amazon.com/s3/ , 2009. 
[4] M. Coates, R. Castro, R. Nowak, M. Gadhiok, R. King, and Y. Tsang. Maximum Likelihood Network Topology Identification from Edge-Based Unicast Measurements. SIGMETRICS Perform. Eval. Rev., 30(1):11–20, 2002. 
[5] R. Davoli. VDE: Virtual Distributed Ethernet. Testbeds and Research Infrastructures for the Development of Networks & Communities, International Conference on, 0:213–220, 2005. 
[6] J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI’04: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation, pages 10–10, Berkeley, CA, USA, 2004. USENIX Association.
 [7] I. Raicu, I. Foster, and Y. Zhao. Many-Task Computing for Grids and Super computers. In ManyTask Computing on Grids and Supercomputers, 2008. MTAGS 2008. Workshop on, pages 1–11, Nov.2008. 
[8] M. Stillger, G. M. Lohman, V. Markl, and M.Kandil. LEO-DB2’s LEarning Optimizer. In VLDB ’01: Proceedings of the 27th International Conference on Very Large Data Bases, pages 19–28, San Francisco, CA, USA, 2001. Morgan Kaufmann Publishers Inc. 
[9] D. Warneke and O. Kao. Nephele: Efficient Parallel Data Processing in the Cloud. In MTAGS ’09: Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers, pages 1– 10, New York, NY, USA, 2009. ACM. 
[10] T. White. Hadoop: The Definitive Guide. O’Reilly Media, 2009.


Currently there are no Refbacks

Paper Title : Avoid Link Failure Using Novel Re-routing Method
Authors : Batsala Balaraju, Sahukaru Jayavardhana Rao,
Affiliations : M.Tech (CSE), Sri Vaishnavi College of Engineering at Srikakulam
Assistant Professor, Department of Computer Science & Engineering, Sri Vaishnavi College of engineering at srikakulam
Abstract :

af

In this paper we present a method to find a path when a link is failure when the data is transmitted for source node to destination node when a link Is failure before entering to the gate way protocol and to recover the response of failure the target application Is tested on small network up to tens of nodes for regional access of the service providers network which is one of the most challenging Task We provide and effective method to find the existing path for the Set of nodes to send the data when the link is failure.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



Batsala Balaraju,Sahukaru Jayavardhana Rao."Avoid Link Failure Using Novel Re-routing Method". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1100-1105 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1251.pdf,

[1] C. Boutremans and G. Iannaccone and C. Diot, Impact of link failures on VoIP performance, NOSSDAV, 2002. 
[2] J. Moy, OSPF Version 2, RFC 2328, Apr. 1998. 
[3] D. Oran, OSI IS-IS Intra-domain Routing Protocol, RFC 1142, Feb. 1990. 
[4] A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C. Chuah, C. Diot, Characterization of Link Failures in an IP Backbone, INFOCOM 2004.
[5] N. Dubois, B. Fondeviole, N. Michel, Fast convergence project, RIPE-47 presentation, Jan. 2004. 
[6] P. Pan, G. Swallow, A. Atlas, Fast Reroute Extensions to RSVP-TE for LSP Tunnels, Internet Draft, Feb. 2004. 
[7] S. Nelakuditi, S. Lee, Y. Yu, Z.-L. Zhang, Failure Insensitive Routing for Ensuring Service Availability, IWQoS 2003. 
[8] P. Narvaez,´ K.-Y. Siu, and H.-Y. Tzeng, Local Restoration Algorithm for Link-State Routing Protocols, ICCCN 1999. 
[9] A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: An Approach to Universal Topology Generation, In Proceedings of MASCOTS 2001, Aug. 2001. 
[10] Y. Liu, A. L. Narasimha Reddy, A Fast Rerouting Scheme for OSPF/IS-IS Networks, technical report available at http://ece.tamu.edu/techpubs, Dept. of Electrical Engineer-ing, Texas A&M University, 2004


Currently there are no Refbacks

Paper Title : RFID BASED SHOPPING TROLLEY
Authors : Mrs.Lekshmy S, Ms.Aniltta T C, Ms.Nivya Shaji
Affiliations : Department of ECE, Vimal Jyothi Engineering College, Chemperi, Kannur
Abstract :

af

While purchasing in super market we can gather items we want, put it in the container and at the time of billing only we come to know about the total cost. Also we need to stand in a queue for billing those items. To overcome this here we can design a RFID Based Trolley to make the purchase more easily and comfortable. An RFID Reader with electronics hardware system in fitted with the trolley to make the purchase comfortable. All the items are fitted with an RFID card whose price is fixed into the card. When an item is shown in front of the reader (fitted in the trolley) the amount for the item is added to the purchase bill and is shown on the LCD Display. It also has the provision for removing the items from the trolley where the cost is removed from the total cost. We can set a limit value for the purchase amount in the microcontroller, once the items are added the cost is added up and if it crosses certain limit it gives an alarm signal to indicate that. Along with this a search mode is also provided to the customer. By selecting search mode, customer can easily find out a product that the customer wants to search in the super market. MCU send data through RF module to the receiver side in the search mode if the particular product is selected using key pad. Send data is corresponds to product details that the customer wants to search in the super market. On receiver side, LED indication for corresponding data/product received will switch ON. Audio indication is also provided by MCU. 2.4 GHz open band wireless transceiver modules are used on receiver and transmitter which have range of 30m.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



Mrs.Lekshmy S,Ms.Aniltta T C,Ms.Nivya Shaji."RFID BASED SHOPPING TROLLEY". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1096-1099, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1250.pdf,

1.2013 IEEE International Conference On RFID
Technologies.
2.IEEE RFID-TA 2015.
3.Programming a PIC Microcontroller.

Currently there are no Refbacks

Paper Title : SELF BALANCING ROBOT
Authors : Mrs.LEKSHMY.S, ALEESHA GEORGE, ATHIRA C.V
Affiliations : Department of ECE, Vimal Jyothi Engineering College, Chemperi, Kannur
Abstract :

af

-In this paper, we presented the Balance model as a two wheeled self balancing robot that is capable of adjusting itself with respect to changes in weight and position. We developed the Balance System from a single gyroscope and a single accelerometer. The stability of the system is to show the capabilities of the ATmega328P in doing PID loops even with limited accuracy in position readings. PID control system is designed to monitor the motors so as to keep the system in equilibrium. It should be easily reproducible given the right parts and code
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Self balancing robot, Accelerometer, Gyroscope, Kalman filter, PID controller, feedback control

Mrs.LEKSHMY.S,ALEESHA GEORGE,ATHIRA C.V."SELF BALANCING ROBOT". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.6, Issue 12,pp.1091-1095 , December- 2015, URL :https2//ijcert.org/ems/ijcert_papers/V2I1249.pdf,

[1] Nawawi, S. W., Ahmad, M. N. and Osman, J. H. S (2008) "Real-Time Control of Two-Wheeled Inverted Pendulum Mobile Robot" World Academy of Science, Engineering and Technology 29, 214 - 220. 
[2] Lei Guo , Hong Wang , “PID controller design for output PDFs of stochastic systems using linear matrix inequalities”, IEEE Transactions on Systems, Man, and Cybernetics, Part B 01/2005; 35:65-71,pp.65-71. 
[3] K. Loffler, M. Gienger, F. Pfeiffer, and H. Ulbrich, “Sensors and control concept of a biped robot,” IEEE Trans. Ind. Electron., vol. 51, no.5, pp.972– 980. 
[4] R.S.Meena,Vikas Kumawat(2011) .Controller Design For Servo Motor Using MATLAB .In Proceeding of National Conferences on Advances & Research in Electrical System Technology ( AREST 2011). 
[5] Popescu, Cristina; Paraschiv, Nicolae; Cangea, Otilia.(2011) Comparison Between PID And Fuzzy Controllers Used In Mobile Robot Control annals of daaam & proceedings,jan2011, pp223. 
[6] A. Warnasch, and A. Killen, Low cost, high G, micro electro-mechanical systems (MEMS), inertial measurements unit (IMU) program, IEEE Position Location and Navigation Symposium, 2002, pp. 299- 305.
[7] Andrea Demetlika, Tomislav Tomašić, Mladen Crneković (2012),Self balancing Mobile Robot Tilter.FAMENA issue 3, volume 36. 
[8] Young Soo Suh.(2003) .Attitude Estimation Using Low Cost Accelerometer And Gyroscope Proceedings KORUS 2003. The 7th Korea-Russia International Symposium on Volume: 2, Page(s): 423 - 427. 
[9] D. Simon, Kalman Filtering With State Constraints: A Survey Of Linear And Nonlinear Algorithms, IET Proceediings in Control Theory & Applications,Volume 4, no. 8, pp. 1303-1318.

Currently there are no Refbacks

Paper Title : Android controlled Smart Car
Authors : Jayesh George M, Adithya Sreyaj P P, Daniel Joseph
Affiliations : Vimal Jyothi Engineering College, Chemperi Kannur
Abstract :

af

A car is usually an electro-mechanical machine that is guided by computer and electronic programming. The car which can be controlling using an APP for android mobile. We are developing the remote buttons in the android app by which we can control the car motion with them. Here we use Bluetooth communication to interface controller and android. Controller can be interfaced to the Bluetooth module though UART. According to commands received from android the robot motion can be controlled. The consistent output of a robotic system along with quality and repeatability are unmatched.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


PIC, Android application, Bluetooth module, Motor driver

Jayesh George M,Adithya Sreyaj P P,Daniel Joseph,Sajeer P."Android controlled Smart Car". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1087-1090, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1248.pdf,

1. [Android Developers Guide. Android Architecture.
[Online] 2013. URL:
http://.android.com/about/versions/index.html.
2. Heidi Monson (1999) Bluetooth technology and
implementations, John Wiley & Sons.
3. Piyare, R. and Tazil, M. (2011) “Bluetooth based
home automation system using Android phones”.
IEEE 15TH International symposium on consumer
electronics (ISCE), 14-17 June 2011, Singapore.
4. Potts, J. and Sukittanon, S. (2012) “Exploiting
bluetooth on android mobile mobile devices for
home security application”, proceedings of
southeastcan, 15-18 March 2012, Orlando, Florida,
USA.

Currently there are no Refbacks

Paper Title : Solar Power Smart Waste Bin
Authors : Mr. Jobin francis, Mr. Melbin TL, Mr. Praveen CN
Affiliations : Vimal Jyothi Engineering College, Chemperi Kannur
Abstract :

af

India government recently introduced a new campaign named “SWACH BHARATH” that is aiming to make our country clean and tidy. That is, now the condition of our country is very bad in the field of waste management. There are many waste bins in our cities and country sides. But the reality is nobody using it in an effective way. As we all saw that in cities and streets the waste bin is there and all the wastes are near its side. The reason for this is, if one person deposit the waste outside of it, the person next coming to their will automatically throws the waste outside of the basket. This will continues. Our intention is to approach this problem in a different manner. If the lid of the waste bin opens automatically, when a person approaches to the waste bin then the person automatically deposit the waste inside it. No one has a tendency to throw the garbage outside the basket. That is our project “SOLAR POWERED SMART WASTE BIN “which is aimed to make our cities and streets clean and tidy.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


solar powering, automatic, waste bin, ultra sonic

Mr. Jobin francis,Mr. Melbin TL,Mr. Praveen CN."Solar Power Smart Waste Bin". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1083-1086 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1247.pdf,

[1] http:// www.arduino.cc
[2] http://www.datasheetcatalog.com
[3] http://www.instructables.com
[4] http://www.wikipedia.com
[5] Electronic Circuit and Devices by J.B Gupta
[6] Von Meier, Alexandra (2006). Electric Power
Systems: A Conceptual Introduction. Wiley-IEEE

Currently there are no Refbacks

Paper Title : FPGA Based Efficient Implementation of Viterbi Decoder
Authors : BEERAM RAJ MOHAN REDDY, BELLAM VARALAKSHMI,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

Convolutional encoding is a forward error correction technique that is used for correction of errors at the receiver end. The Viterbi algorithm, which is the most extensively employed decoding algorithm for convolutional codes. In this paper, we present a Spartan XC3S400A Field- Programmable Gate Array efficient implementation of Viterbi Decoder with a constraint length of 3 and a code rate of 1/3. The proposed architecture can be realized by an Adaptive Viterbi Decoder having constraint length, K of 3 and a code rate (k/n) of 1/2 using Verilog HDL. Simulation is done using Xilinx ISE 12.4i design software and it is targeted into Xilinx Virtex-5, XC5VLX110T FPGA. The parameters of Viterbi algorithm can be changed to suit a specific application. The high speed and small area are two important design parameters in today’s wireless technology. In this paper, a high speed feed forward viterbi decoder has been designed using track back architecture and embedded BRAM of target FPGA. It shows that the larger the constraint length used in a convolutional encoding process, the more powerful the code produced.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Convolutional encoding, Viterbi decoder, Path Metric, branch metric, FPGA, Xilinx, Modelsim.

BEERAM RAJ MOHAN REDDY,BELLAM VARALAKSHMI."FPGA Based Efficient Implementation of Viterbi Decoder". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1076-1082, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1246.pdf,

[1] Altera Corporation. Apex II data sheet, 2001.V http://www.altera.com. 
[2] Annapolis Microsystems, Inc. WILD-ONE Reference Manual, 1999. 
[3] W. Burleson, R. Tessier, D. Goeckel, S.Swaminathan, P. Jain, J. Euh, S. Venkatraman, and V. Thyagarajan. Dynamically Parameterized Algorithms and Architectures to Exploit Signal Variations for Improved Performance and Reduced Power. In IEEE Conference on Acoustics, Speech, and Signal Processing, May 2001. 
[4] F. Chan and D. Haccoun. Adaptive Viterbi Decoding of Convolutional Codes over Memoryless Channels IEEETransactions on Communications, 45(11):1389– 1400, Nov. 1997. 
[5] M. Kivioja, J. Isoaho, and L. Vanska. Design and Implementation of a Viterbi Decoder with FPGAs. Journal of VLSI Signal Processing, 21(1):5–14, May 1999. 
[6] C. F. Lin and J. B. Anderson. M-algorithm Decoding of Channel Convolutional Codes. In Proceedings, Princeton Conference of Information Science and Systems, pages 362–366, Princeton, NJ, Mar. 1986. 
[7] A. Michelson and A. Levesque. Error-control Techniques for Digital Communication. John Wiley and Sons, New York, NY,1985.
 [8] B. Pandita and S. K. Roy. Design and Implementation of a Viterbi Decoder Using FPGAs. In Proceedings, IEEE International Conference on VLSI Design, pages 611–614, Jan. 1999. 
[9] J. Proakis. Digital Communications. McGraw-Hill, New York, NY, 1995. 
[10] H. Schmit and D. Thomas. Hidden Markov Modelling and Fuzzy Controllers in FPGAs. In Proceedings, IEEE Workshop on FPGA-based Custom Computing Machines, pages 214–221,Napa, Ca, Apr. 1995. 
[11] S. J. Simmons. Breath-first Trellis Decoding with Adaptive Effort. IEEE Transactions on Communications, 38:3–12, Jan. 1990.
 [12] S. Swaminathan. An FPGA-based Adaptive Viterbi Decoder. Master’s thesis, University of Massachusetts, Amherst, Department of Electrical and Computer Engineering, 2001. 
[13] R. Tessier and W. Burleson. Reconfigurable Computing and Digital Signal Processing: A Survey. Journal of VLSI Signal Processing, 28(1):7–27, May 2001. 
[14] Texas Instruments, Inc. TMS320C6201 DSP Data Sheet, 2001.
[15] Xilinx Corporation. Virtex II data sheet, 2001. http://www.xilinx.com.

Currently there are no Refbacks

Paper Title : Design of an efficient aging aware reliable multiplier to reduce aging effects
Authors : BANDANADHAM BALA KRANTHI KUMAR, AL.SHABNA SAMANTHA TERA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

Digital multipliers are among the most critical arithmetic functional units. The Meanwhile, the negative bias temperature instability effect occurs when a pMOS transistor is under negative bias increasing the threshold voltage of the pMOS transistor, and reducing multiplier speed.. There are three types of multipliers Vedic multiplier base on Vedic arithmetic using Urdhva-Tiryabhyam sutra are proved to be the most efficient in terms of lower power consumption. overall performance of these systems depends on the throughput of the multiplier .A similar phenomenon, positive bias temperature instability, occurs when an nMOS transistor is under positive bias. Both effects degrade transistor speed, and in the long term, the system may fail due to timing violations. Therefore, it is important to design reliable high-performance multipliers. A multiplier is one of the chief hardware blocks in most digital and high concert systems such as microprocessors, digital signal processors. The CNFET-based multipliers have higher speed, and low power dissipation and it nearly reduces 99% PDP (power-delay product) as compared to the MOSFET In this paper, we propose an agingaware multiplier design with a novel adaptive hold logic (AHL) circuit. The multiplier is able to provide higher throughput through the variable latency and can adjust the AHL circuit to mitigate performance degradation that is due to the aging effect. Moreover, the proposed architecture can be applied to a column- or row-bypassing multiplier. The experimental results show that our proposed architecture with 16 ×16 and 32 ×32 column-bypassing multipliers can attain up to 62.88% and 76.28% performance improvement, respectively, compared with 16×16 and 32×32 fixed-latency column-bypassing multipliers
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Adaptive Hold Logic(AHL), variable Latency, Reliable Multiplier, Positive Bias Temperature Instability(PBTI),Negative Bias Temperature Instability(PBTI)

BANDANADHAM BALA KRANTHI KUMAR,AL.SHABNA SAMANTHA TERA."Design of an efficient aging aware reliable multiplier to reduce aging effects". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1070-1075 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1245.pdf,

[1] Y. Cao. (2013). Predictive Technology Model (PTM) and NBTI Model 
[2] S. Zafar et al., “A comparative study of NBTI and PBTI (charge trapping) in SiO2/HfO2 stacks with FUSI, TiN, Re gates,” in Proc. IEEE Symp. VLSI Technol. Dig. Tech. Papers, 2006, pp. 23–25. 
[3] S. Zafar, A. Kumar, E. Gusev, and E. Cartier, “Threshold voltage instabilities in high-k gate dielectric stacks,” IEEE Trans. Device Mater. Rel., vol. 5, no. 1, pp. 45–64, Mar. 2005. 
[4] H.-I. Yang, S.-C.Yang, W. Hwang, and C.-T. Chuang, “Impacts of NBTI/PBTI on timing control circuits and degradation tolerant design in nanoscale CMOS SRAM,” IEEE Trans. Circuit Syst., vol. 58, no. 6, pp. 1239–1251, Jun. 2011. 
[5] R. Vattikonda, W. Wang, and Y. Cao, “Modeling and miimization of pMOS NBTI effect for robust naometer design,” in Proc. ACM/IEEE DAC, Jun. 2004, pp. 1047–1052. 
[6] H. Abrishami, S. Hatami, B. Amelifard, and M. Pedram, “NBTI-aware flip-flop characterization and design,” in Proc. 44th ACM GLSVLSI, 2008, pp. 29–34 
[7] S. V. Kumar, C. H. Kim, and S. S. Sapatnekar, “NBTI-aware synthesis of digital circuits,” in Proc. ACM/IEEE DAC, Jun.2007, pp. 370–375. 
[8] A. Calimera, E. Macii, and M. Poncino, “Design techniqures for NBTI-tolerant power-gating architecture,” IEEE Trans. Circuits Syst., Exp. Briefs, vol. 59, no. 4, pp. 249–253, Apr. 2012. 
[9] K.-C. Wu and D. Marculescu, “Joint logic restructuring and pin reorder-ing against NBTIinduced performance degradation,” in Proc. DATE, 2009, pp. 75–80. 
[10] Y. Lee and T. Kim, “A fine-grained technique of NBTI-aware voltage scaling and body biasing for standard cell based designs,” in Proc. ASP- DAC, 2011, pp. 603–608. 
[11]M. Basoglu, M. Orshansky, and M. Erez, “NBTIaware DVFS: A new approach to saving energy and increasing processor lifetime,” in Proc. ACM/IEEE ISLPED, Aug. 2010, pp. 253–258. 
[12] K.-C. Wu and D. Marculescu, “Aging-aware timing analysis and optimization considering path sensitization,” in Proc. DATE, 2011, pp. 1–6. 
[13] K. Du, P. Varman, and K. Mohanram, “High performance reliable variable latency carry select addition,” in Proc. DATE, 2012, pp. 1257–1262. 
[14] A. K. Verma, P. Brisk, and P. Ienne, “Variable latency speculative addition: A new paradigm for arithmetic circuit design,” in Proc. DATE, 2008, pp. 1250–1255. 
[15] D. Baneres, J. Cortadella, and M. Kishinevsky, “Variable-latency design by function speculation,” in Proc. DATE, 2009, pp. 1704–1709.

Currently there are no Refbacks

Paper Title : Design and implementation of high speed 8 bit Vedic multiplier on FPGA
Authors : ANNAM ARAVIND KUMAR, SK. MASTAN BASHA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

In high speed digital signal processing units arithmetic logic units, multiplier and accumulate units, the multipliers are use as the key block. A systems performance is generally determined by the speed of the multiplier since multiplier is one of the key hardware component in high performance systems such as FIR filters, digital signal processors and microprocessors etc. Vedic Mathematics is the ancient system of mathematics which has a unique technique of calculations based on 16 Sutras. With the increasing constraints on delay, more and more emphasis is being laid on design of faster multiplications. The Array multiplier, Vedic 4*4 multiplier and 8*8 multiplier are designed, then 16*16 multiplier. These adders are called compressors. Amongst these Vedic multipliers based on Vedic mathematics are presently under focus due to these being one of the fastest and low power multiplier. In this paper a 4 X 4 Vedic multiplier is designed using reversible logic gates which is efficient in terms of constant inputs, garbage outputs, quantum cost, area, speed and power. The design is simulated using Verilog. Compressor based Vedic Multipliers show considerable improvements in speed and area efficiency over the conventional ones.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Multiplier, Vedic multiplier, Reversible logic, garbage output, quantum cost.

ANNAM ARAVIND KUMAR,SK. MASTAN BASHA."Design and implementation of high speed 8 bit Vedic multiplier on FPGA". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1062-1069, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1244.pdf,

[1] Swami Bharati Krsna Tirtha, Vedic Mathematics. Delhi: Motilal Banarsidass publishers 1965 
[2] Rakshith Saligram and Rakshith T.R. "Design of Reversible Multipliers for linear filtering Applications in DSP" International Journal of VLSI Design and Communication systems, Dec-12 
[3] R. Landauer,"Irreversibility and Heat Generation in the Computational Process", IBM J