Download ebook Roceeding Of 5 Th International Conference On Recent Trends In Engineering And Technology Icrtet2016 Volume 1 Computer Engineering Information Technology Civil Engineering Pdf full chapter pdf

roceeding of 5 th International
Conference on Recent Trends in

Engineering and Technology
ICRTETâ€™2016 Volume 1 Computer
Engineering Information Technology
Civil Engineering - eBook PDF
Visit to download the full and correct content document:
https://ebooksecure.com/download/roceeding-of-5-th-international-conference-on-rec
ent-trends-in-engineering-and-technology-icrtet2016-volume-1-computer-engineering-
information-technology-civil-engineering-ebook-pdf/
Proceeding of
th
5 International Conference on Recent Trends in
ICRTET’2016
Volume 1
Computer Engineering
Information Technology
Civil Engineering
About ICRTET’2016
5th International Conference on “Recent Trends in Engineering & Technology”
ICRTET’2016 held during April 28-30, 2016 in Chandwad, Nashik, (Maharashtra) India.
ICRTET’2016 helps to bring together researchers, academician and Industrial experts in the field of
Civil Engineering, Computer Engineering, Electronics & Telecommunication Engineering,
Information Technology and Mechanical Engineering to a common forum.
The primary goal of the conference is to promote research and developmental activities in
Engineering & Technology. Secondly, it provides a platform to exchange the knowledge & scientific
information amongst academicians, researches, developers, engineers, students, and practitioners
working in India and abroad.
The conference held every year to make it an ideal workstation for people to share views
and experiences in all the relevant areas. English is considered as an official language of the
conference.
ICRTET’2016 i s organized by SNJB’s Late Sau. Kantabai Bhavarlalji Jain College of Engineering
and technically co-sponsored by McGraw Hill Publication. The Proceeding of the ICRTET’2016 is
slated to publish by McGraw Hill Publication with ISBN Numbers.
Proceeding of
5th International Conference on Recent Trends in
ICRTET’2016
Volume 1
Computer Engineering
Information Technology
Civil Engineering
Editors
M. M. Rathore, Prof. Y. L. Bhirud
Associate Editors
Mrs. K. M. Sanghavi, Prof. P. R. Bhaladhare,
Prof. V. M.Pandit, Prof. T. H. Sonawane, Prof. A. J. Shakadwipi,
Prof. P. S. Desai, Prof. V. K. Wani, Mrs. K. R. Nirmal
McGraw Hill Education (India) Private Limited

New Delhi
McGraw Hill Education Offices

New Delhi New York St louis San Francisco Auckland Bogotá Caracas
Kuala lumpur lisbon london Madrid Mexico City Milan Montreal
San Juan Santiago Singapore Sydney Tokyo Toronto
McGraw Hill Education (India) Private Limited
Published by McGraw Hill Education (India) Private Limited,
P-24, Green Park Extension, New Delhi 110 016.
Proceeding of 5th International Conference on Recent Trends in Engineering and Technology (ICRTET’2016) Vol-1
Copyright © 2016, by McGraw Hill Education (India) Private Limited
No part of this publication may be reproduced or distributed in any form or by any means, electronic, mechanical, photocopying, recording,
or otherwise or stored in a database or retrieval system without the prior written permission of the publishers. The program listing (if any)
may be entered, stored and executed in a computer system, but they may not be reproduced for publication.
This edition can be exported from India only by the publishers,
McGraw Hill Education (India) Private Limited.
ISBN (13): 978-93-5260-180-6
ISBN (10): 93-5260-180-7
Managing Director: Kaushik Bellani

Director—Products (Higher Education and Professional): Vibha Mahajan
Manager (Product Development)—B&E-BGR: Hemant K Jha
Senior Researcher—Product Development: Navneet Mehra
Head—Production (Higher Education and Professional): Satinder S Baveja
Assistant Manager—Production: Anuj K Shriwastava
General Manager—Production: Rajender P Ghansela
Manager—Production: Reji Kumar
Information contained in this work has been obtained by McGraw Hill Education (India), from sources believed to be reliable. However, neither
McGraw Hill Education (India) nor its authors guarantee the accuracy or completeness of any information published herein, and neither McGraw
Hill Education (India) nor its authors shall be responsible for any errors, omissions, or damages arising out of use of this information. This work
is published with the understanding that McGraw Hill Education (India) and its authors are supplying information but are not attempting to render
engineering or other professional services. If such services are required, the assistance of an appropriate professional should be sought.
Typeset at Text-o-Graphics, B-1/56, Aravali Apartment, Sector-34, Noida 201 301, and printed at
Cover Printer:
Cover Designer: Kapil Gupta
Organizing Committee
Chief Patrons
Shri. Bebilalji K. Sancheti
Shri. Ajitkumarji S. Surana
Shri. Jawaharlalji S. Abad
Shri. Zumbarlalji H. Bhandari
Shri. Dineshkumarji B. Lodha
Shri. Sunilkumarji M. Chopda
Patron
Prof. M. M. Rathore
Principal, SNJB's Late Sau. K. B. Jain College of Engineering, Chandwad
Advisory Committee
Dr. D. P. Nathe, Joint Director, DTE Dr. Mrs. S. N. Madhekar, COE Pune
Dr. G. K. Kharate, MERC, Nashik Dr. Mrs. A. M. Rajurkar, MGM’s COE, Nanded
Dr. R. Kapuno, Jr., CIT Philippines Dr. R. M. Warkhedkar, Govt. COE, Karad
Mr. Mayur Shah, AMA,USA Dr. N. P. Futane, Govt. COE, Avsari
Dr. R. Kolandaisamy ,Uni. of Malaya Dr. S. V. Bonde, SGGS’s IET, Nanded
Mr. Anirban Haldar, L&T ,Denmark Dr. D. S. Bormane RSCOE, Pune
Prof. Amit Agrawal, IIT Bombay Dr. V. J. Kakhandki, Trinity Academy of Engg, Pune
Prof. S. Balasubramanian ,IIT Bombay Dr. V. J. Gond, G. N. Sapkal COE, Nashik
Dr. D. C. Jinwala, SVNIT, Surat Dr. S. Y. Kute, KKWIEER COE, Nashik
Dr. Upena Dalal, SVNIT, Surat Dr. A. J. Patil, BOS Chairman, NMU, Jalgaon
Dr. S. G. Bhirud, VJTI, Mumbai Dr. S. S. Sane , KKWIEER COE, Nashik
Dr. K. K. Sangale, VJTI, Mumbai Dr. Mrs. V. H. Patil, MCOERC, Nashik
Dr. A. G. Chandak, Consultant, MNRE, GoI Dr. M. U. Kharat, MET, COE, Nashik
Dr. D. G. Regulwar, Govt. COE, Aurangabad Dr. N. G. Bawane, SBJIJMR, Nagpur
Dr. R. K. Shrivastava Govt. COE, Aurangabad Dr. G. K. Patnaik, SSBT COET, Jalgaon
Dr. R. R. Manthalkar, SGGS’s IET, Nanded Dr. P. R. Suresh, NSS COE, Palakkad
Conference Secretary
Prof. Mrs. K. M. Sanghavi, Head, Computer Department
Prof. Dr. V. A. Wankhede, Head, E & TC Department
Prof. P. R. Bhaladhare, Head, IT Department
Prof. U. S. Kasar, Head, MBA Department
Prof. S. B. Chavan, Head, Applied Science Department
Program Director
Prof. Yuvaraj L. Bhirud
Associate Professor, Civil Department,
SNJB's Late Sau. K. B. Jain College of Engineering, Chandwad – 423 101.
Dist. Nasik.(M.S.) India
Website: www.snjbcoe.org
Tel: +91-2556-253750
Fax:+91-2556-253811
Program Committee
Program Committee
Sr. No Committee Name of faculty Departments Roles
1 Program Director Prof. Y. L. Bhirud Civil Engineering Super Chair
Prof. M. A. Mechkul E & TC Engineering Track Chair

Prof. G. S. Pawar E & TC Engineering Track Chair
Prof. H. S. Deore Mechanical Engineering Track Chair
Prof. Y. S. Kulkarni Mechanical Engineering Track Chair
2 Track Chairs Prof. D. S. Rajnor Computer Engineering Track Chair
Prof. A. J. Shakadwipi Computer Engineering Track Chair
Prof. V. K. Wani Information Technology Track Chair
Prof. Mrs. K. R. Nirmal Information Technology Track Chair
Prof. V. M. Pandit Civil Engineering Track Chair
Prof. T. H. Sonawane Civil Engineering Track Chair
Prof. Mrs. D. P. Pawar Computer Engineering Coordinator
Ms. S. B. Memane E & TC Engineering Member
3 Ms. B. S. Lalwani Computer Engineering Member
Reception
Ms. P. D. Randhawane E & TC Engineering Member
Prof. Mrs. M. S. Dhomse Civil Engineering Member
Prof. R. U. Pawar Information Technology Coordinator
Prof. D. D. Aher Civil Engineering Coordinator
Prof. N. C. Mutha Computer Engineering Member
4 Registration Prof. Ms. K. D. Chopra Computer Engineering Member
Prof. V. N. Bagul Civil Engineering Member
Prof. N. K. Sancheti E & TC Engineering Member
Prof. D. D. Sancheti Mechanical Engineering Member
Prof. S. U. Patil Mechanical Engineering Member
Prof. S. D. Sancheti Mechanical Engineering Coordinator
5 Invitation Prof. G. S. Pawar E & TC Engineering Member
Mr. S. Y. Burkule Establishment Section Member
Prof. R. R. Bhandari Computer Engineering Coordinator
Prof. P.N. Achaliya Information Technology Member
Certificate Mr. S. Y. Burkule Establishment Section Member
6 Printing & Kit
Mr. A. S. Mokal Store Member
Selection
Mr. P. D .Bagmar Mechanical Engineering Member
Mr. S. J. Gaikwad Civil Engineering Member
Paper Editing & Prof. G.P. Dhomse Computer Engineering Coordinator
7 Proceeding Prof. P. S. Desai Information Technology Member
Preparation Prof. V. K. Wani Information Technology Member
Prof. Mrs. S. V. Sinha Information Technology Member
Program Committee vii
Prof. Mrs. K. R. Nirmal Information Technology Member

Prof. Mrs. S. A. Chavan Information Technology Member
Prof. P. N. Achaliya Information Technology Member
Prof. A. R. Bramhecha Information Technology Member
Prof. R. U. Pawar Information Technology Member
Prof. R. P. Bafana Information Technology Member
Prof. M. D. Kawade Information Technology Member
Prof. N. V. Sharma Information Technology Member
Prof. Y. K. Desai Information Technology Member
Prof. Ms. S. B. Memane E & TC Engineering Member
Prof. P. D. Randhawane E & TC Engineering Member
Prof. Ms. P. P. Chopda E & TC Engineering Member
Prof. Mutha Hemant E & TC Engineering Member
Prof. R. A. Gawande E & TC Engineering Member
Prof. D. J. Pawar E & TC Engineering Member
Prof. H. R. Thakare Mechanical Engineering Member
Prof. S. U. Patil Mechanical Engineering Member
Prof. P. B. Bagmar Mechanical Engineering Member
Prof. D. D. Sancheti Mechanical Engineering Member
Prof. Y. S. Kulkarni Mechanical Engineering Member
Prof. R. R. Kankaria Mechanical Engineering Member
Prof. S. P. Ingale Mechanical Engineering Member
Prof. D. H. Darekar Mechanical Engineering Member
Prof. R. M. Chandore Mechanical Engineering Member
Prof. S. S. Aher Mechanical Engineering Member
Prof. Ms. R. A. Binayake Civil Engineering Member
Prof. R. S. Sonawane Civil Engineering Member
Prof. H. A. Shirsath Civil Engineering Member
Prof. Mrs. M. S. Dhomse Civil Engineering Member
Mr. S. J. Gaikwad Civil Engineering Member
Prof. A. R. Bramhecha Information Technology Coordinator
Prof. H. A. Shirsath Civil Engineering Member
Prof. P. S. Desai Information Technology Member
8 Accommodation
Prof. R. R. Bhandari Computer Engineering Member
Prof. Nilesh Sharma Information Technology Member
Prof. Ram Gawande E & TC Engineering Member
viii Program Committee
Prof. M. A. Ahire Mechanical Engineering Coordinator

Prof. K. B. Gore Mechanical Engineering Member
Prof. R. A. Geete E & TC Engineering Member
Prof. V. C. Jadhav Mechanical Engineering Member
9 Food Prof. D. H. Darekar Mechanical Engineering Member
Management Prof. S. B. Ambhore Computer Engineering Member
Prof. M. A. Kulkarni Civil Engineering Member
Mr. A. B. Mawal Mechanical Engineering Member
Mr. P. M. Shirsath Civil Engineering Member
Ms. S. B .Jondhale Information Technology Member
Ms. Desai Madhuri Information Technology Member
Prof. S. S. Thakare E & TC Engineering Manager
Prof. Mrs. B. A. Khivsara Computer Engineering Coordinator
Prof. R. R. Bhandari Computer Engineering Coordinator
Prof. Mrs. K. R. Nirmal Information Technology Coordinator
Session Prof. Mrs. S. V. Sinha Information Technology Coordinator
10 Management Prof. Mrs. S. M. Pawar Civil Engineering Coordinator
Prof. P. M. Yeole Civil Engineering Coordinator
Prof. M. A. Mechkul E & TC Engineering Coordinator
Prof. G. S. Pawar E & TC Engineering Coordinator
Prof. R. C. Patil Mechanical Engineering Coordinator
Prof. R. M. Shinde Mechanical Engineering Coordinator
Prof. K. S. Tated E & TC Engineering Coordinator

Prof. Ms. L. R. Lasi MBA Member
Prof. M. D. Kawade Information Technology Member
Prof. N. D. Bhandari MBA Member
Prof. Deepali Pawar Computer Engineering Member
Prof. H. S. Deore Mechanical Engineering Member
11 Stage Prof. H. R. Thakare Mechanical Engineering Member
Management
Prof. H. K. Padmanabhan MBA Member
Prof. Swati Sinha Information Technology Member
Prof. P. M. Bora Mechanical Engineering Member
Prof. Mrs. R. K. Jain Information Technology Member
Mr. S. S. Wadnere Computer Engineering Member
Mr. S. A. Wagh Information Technology Member
Mr. J. G. Rahane E & TC Engineering Member
Mr. A. V. Bhamare E & TC Engineering Member
Publicity- Web Prof. P. N. Achaliya Information Technology Member

12 Site Press Mr. S. Y. Burkule Establishment Section Member
Program Committee ix
Prof. P. M. Bora Mechanical Engineering Coordinator

Prof. R. M. Gavande E & TC Engineering Member
Mr. S. B. Arote Establishment Section Member
13 Transportation
Mr. K. S. Vyas Civil Engineering Member
Mr. S. S. Sonawane Student Section Member
Mr. Pansare Kiran Student Section Member
Mr. S. P. Landge Account Section Coordinator
Mr. S. D. Bafana Account Section Member
Mr. S. V. Thorat Account Section Member
14 Finance
Mr. P. B. Aher E & TC Engineering Member
Mr. R. S. Sonawane Civil Engineering Member
Mr. S. S. Patil Computer Engineering Member
Mr. N. C. Khairnar Mechanical Engineering Member
Prof. P. N. Achaliya Information Technology Member
15 Animation & Prof. H. R. Thakare Mechanical Engineering Member
Design Prof. P. D. Bagmar Mechanical Engineering Member
Prof. V. N. Bagul Civil Engineering Coordinator
16 Post Conference Prof. K. B. Gore Mechanical Engineering Member
Communication Prof. H. A. Shirsath Civil Engineering Member
Mr. M. B. Kedar Library Section Member
Mr. A. S. Mokal Store Section Member
Mr. U. P. Ingle Workshop Section Member
Mr. S. M. Patil Workshop Section Member
Mr. A. R. Desale Workshop Section Member
Mr. S. D. Aher Workshop Section Member
Mr. S. S. Tandale Workshop Section Member
Mr. H. B. Jadhav E & TC Engineering Member
17 Supporting Mr. P. R. Jadhav Computer Engineering Member
Committee Mr. S. J. Gaikwad Civil Engineering Member
Mr. P. N. Jadhav Mechanical Engineering Member
Mr. S. B. Pardeshi Library Section Member
Mr. R. C. Thoke E & TC Engineering Member
Mr. P. J. Bagul Office Member
Mr. S. B. Jadhav Computer Engineering Member
Mr. S. V. Gade Mechanical Engineering Member
Mr. B. V. Nikam Office Member
Mr. N. S. Raut Workshop Section Member
Mr. S. S. Nikam Civil Engineering Member
Mr. S. B. Gangurde Library Section Member
Mr. K. D. Wagh Applied Science Member
x Program Committee
Mr. S. N. Ghuge Office Member

Mr. N. M. Kale Account Section Member
Mr. B. S. Kokande Library Section Member
Mr. K. V. Pawar MBA Member
Program Committee
List Reviewers for Computer Track
Dr. M. R. Sanghavi (Associate Professor Department of Computer Engineering SNJB’s KBJ College of
Engineering Chandwad)
Prof. S. V. Sinha (Assistant Professor Department of Information Technology SNJB’s KBJ College of
Prof. K. M. Sanghavi (Associate Professor and Head of Department of Computer Engineering SNJB’s KBJ
College of Engineering Chandwad)
Prof. B. A. Khivsara (Associate Professor Department of Computer Engineering SNJB’s KBJ College of
Prof. D. R. Agrawal (Assistant Professor Department of Computer Engineering SNJB’s KBJ College of
Prof. P. S. Desai (Assistant Professor Department of Information Technology SNJB’s KBJ College of
Prof. R. R. Bhanadari (Assistant Professor Department of Computer Engineering SNJB’s KBJ College of
Prof. D. S. Rajnor (Assistant Professor Department of Computer Engineering SNJB’s KBJ College of
Prof. K. R. Nirmal (Assistant Professor Department of Information Technology SNJB’s KBJ College of
Prof. P. R. Bhaladhare (Associate Professor and Head of Department of Information Technology SNJB’s
KBJ College of Engineering Chandwad)
Prof. V. K. Wani (Lecturer Department of Information Technology SNJB’s KBJ College of Engineering
Chandwad)
Prof. Yogita Desai (Leturer Department of Information Technology SNJB’s KBJ College of Engineering
Chandwad)
Prof. Neha Mutha (Lecturer Department of Computer Engineering SNJB’s KBJ College of Engineering
Chandwad)
Prof. G. P. Dhomse (Assistant Professor Department of Computer Engineering SNJB’s KBJ College of
Prof. A. J. Shakadwipi (Lecturer Department of Computer Engineering SNJB’s KBJ College of Engineering
Chandwad)
Prof. P. N Achaliya (Lecturer Department of Information Technology SNJB’s KBJ College of Engineering
Chandwad)
xii Program Committee
Prof. Madhuri Kawade (Assistant Professor Department of Computer Engineering SNJB’s KBJ College of
Prof.Milind Bhandare (Assistant Professor Department of Computer Engineering Late G. N. Sapkal

College of Engineering)
Prof.Nana Zalte(Assistant Professor Department of Computer Engineering Late G. N. Sapkal College of

Engineering)
Prof. Gaikwad K.P. (Assistant professor (CSE) Marathwada institute of technology, Aurangabad)
Prof. Archana Vaidya (Assistant Professor Department of Computer , R. H. sapat college of engineering
nashik)
List Reviewers for Civil Track
Dr. Suhasini Madhekar (College of Engineering, Pune)
Dr. Ishwar Sonar (College of Engineering, Pune)
Dr. Pravin Chaudhari (VJTI, Mumbai)
Dr. Ushadevi Patil (DY Patil College of Engineering Ambi, Pune)
Dr. Suman Jain (Sinhgad College of Engineering, Pune)
Dr. Deepa Joshi (DY Patil College of Engineering, Pimpry, Pune)
Prof. Vaishali Dawari (College of Engineering, Pune)
Prof .Vilas Patil (KKWIEER, Nashik)
Prof. Jyoti Bhusari (Sinhgad College of Engineering, Pune)
Prof. Suhas E. Tayade (MET Institue of Engineering, Nashik)
Prof. Upendra Saharkar (DY Patil College of Engineering Ambi, Pune)
Prof. Rajanikant Devalkar (NDMVPS, KBGT COE, Nashik)
Prof. Hemant Salunkhe (DY Patil College of Engineering Ambi, Pune)
Prof. Yuvaraj Bhirud (SNJB’s LSKBJ COE, Chandwad, Nashik)
Prof. Sadhana Pawar (SNJB’s LSKBJ COE, Chandwad, Nashik)
Prof. Pradeep Yeole (SNJB’s LSKBJ COE, Chandwad, Nashik)
Prof. Renuka Binayke (SNJB’s LSKBJ COE, Chandwad, Nashik)
Prof. Lalit Pawar (SNJB’s LSKBJ COE, Chandwad, Nashik)
Prof. Vinod Pandit (SNJB’s LSKBJ COE, Chandwad, Nashik)

Message from Editor
It gives me immense pleasure to welcome you all for the 5th International conference on
Recent Trends in Engineering & Technology being organized at SNJB’s Late Sau. K. B. Jain college of
Engineering, Chandwad, Maharashtra on 28th -30th April 2016.
The main objective of this conference is to bring academicians, technocrats and researchers
to discuss sunrise technologies in core engineering branches. It also provides a comprehensive
forum to discuss recent advances and futuristic trends in Civil Engineering, Mechanical Engineering,
Electronics and Telecommunication Engineering, Computer Engineering and Information Technology.
This conference would provide the participants a unique opportunity to exchange knowledge and to
identify solutions to global engineering challenges.
I am confident that this conference will provide an ideal opportunity for the delegates to
deliberate on technological challenges and road maps in above said areas. I am sure that this
Conference will ignite the young minds, enrich the experience and benefit the industries with new
emerging possibilities.
I wish all the authors and participants a successful meeting, fruitful interactions with
eminent personalities and an enjoyable stay at Chandwad, India.
Prof. M. M. Rathore,
Principal(I/c),
SNJB’s Late Sau. K. B. Jain College of Engineering, Chandwad.
Message from Program Director
I am delighted to welcome you for the International Conference on Recent Trends in
Engineering & Technology – ICRTET’2016 (April 28-30, 2016). I am very providential to have so
many talented Professors, Scholars and Industry inhabitants implicated in the process of submitting
their research papers. Hard working track chairs and veteran reviewers done their work
enormously. Moreover I am gratified for the publishing support put forth by McGraw Hill
publication. I am thankful to our beloved Principal Prof. M. M. Rathode for his everlasting support. I
also take this opportunity to thanks all Heads of Department and my senior colleagues Dr. M. R.
Sanghavi, Prof. Mrs. K. M. Sanghavi, Dr. V. A. Wankhede, Prof. P. R. Bhaldhare, Prof. R. C. Patil and
Prof. S. D. Sancheti.
A remarkable response is received from all over the world. All the papers are accepted after
stringent review process. This was attributed to very strong technical committee that worked so
hard to make conference advertisement reach to so many aspirants. The strong commitment shown
by all track chairs was stupendous. After submission dead line, they worked very hard to get review
process done from expert reviewers to turn around a very high standard review that led to the
strong technical program before you.
On behalf of ICRTET’2016 organizing committee, we wish to thank all the members

of advisory committee, authors and presenters for their contributions. We would also like to extend
sincere thanks and appreciations to all individuals and organizations those who have supported and
helped us to make this conference a grand success. We also take this opportunity to put sincere
gratitude towards our Management, Administration and all section heads who extended all the
facilities and full cooperation during the preparation phase of the conference. Sincere thanks to
SNJB Team who have been involved directly/indirectly for producing this good quality and
wonderful ICRTET-2016 proceeding publication by McGraw Hill Publication and make this event as a
grant success.
We wish and will be very delighted to see you again in the ICRTET’ 2017.
Bhirud Y. L.
Program Director,
ICRTET’2016
Contents

About ICRTET’2016 ii
Organizing Committee v
Program Committee vi
List Reviewers for Computer Track xi
List Reviewers for Civil Track xiii
Message From Editor xiv
Message From Program Director xv
no
1 A Reliable Power Aware Routing Scheme for Mobile Ad Hoc Networks 1
Mr. Makarand R. Shahade, Dr. D. N. Chaudhari
2 data deduplication in hybrid cloud with secured authorization 6
Patil Shweta, Pawar Mohini, Nikam Pratima, Jondhale Sonali Prof V.K.Wani.
3 Secure Online Transactions 10
Jyotsna Bhadane,NagamaDeshmukh, Komal Mule,Neha Vyavahare
4 Consolidation and migration technique for workload distribution in virtualized data 14
center
Tejashwini Y.Bhamare, Prof.B R Nandwalkar
5 Energy efficient orbital unequal clustering (EOUC) algorithm for heterogeneous wsn 19
Surabhi R. Gosavi, Prof. N. R. Wankhade
6 Online Job Portal 24
Agrawal Dipesh, Patil Deepali, More Bhagyashri, Shinde Kajal
7 Salient region detection using bottom-up approach 27
Ankita V. Raut, Prof. J. V. Shinde
8 A novel approach for sketch based image retrieval with descriptor 32
Dipika R. Birari, Prof. J. V. Shinde
9 Covert photographs classification 37
Vrushali C. Bhadane, Nanasaheb K. Zalte
10 Efficient algorithms for closed and hui itemsets mining 42
Mahendra M. Kapadnis,Prof. P. B. Koli
11 Web Usage Mining Using Superior Frequent Pattern Tree Algorithms 48
Tausib Mulani, Jivan Patni, Sagar Jain, Pritesh Bora
12 Machine learning based mining attribute based access control policies 54
Sonali V.Sapkale , B. R. Nandwalkar*
13 Smart Server IOT Based Temperature Monitoring System 63
Archana Ghumare,Tejaswini Kochar, Pooja Jain, Sneha Ahirrao ,Prof.R.R.Bhandari
14 Media Player Controlling by Hand Gesture and Color Detection 67
Shubham B, Vrushali G, Laxmi J, Bhandari R.R.
15 Online Management of Enterprise Resource Planning(ERP) for Gurukul 72
Application(OMEGA)
Miss Nupur V. Soni, Miss Devyani A. Vaidya , Mr. Prasanna R. Pagar , Mr. Ishan Gadoo,
Prof. Rajiv R. Bhandari
16 Online food delivery system 78
Ms. Supriya Pawar, Ms. Deepali Malvi, Ms. Priyanka Gaikwad, Mr. Shailesh Gandhi, Prof.
Anant Maind
17 SNJB's App 83
Miss.Ravina S. Kotwal, Miss.Prajakta R. Lute, Mr.Prashant P. Pagar, Mr.Rohit R. Surade,
Mrs.Kainjan M. Sanghavi
xviii Contents
18 Summarization of Multiple User Reviews in Text Domain 89

Anita K. Bodke , Milind G. Bhandare
19 Monitoring and controlling system for industrial Pollution using iot 95
Anuradha B. Kandekar, Nikita A. Kala, Namrata P. Jain, Nikita V. Tatiya , Deepali P. Pawar
20 Migration of ipv4 to ipv6 99
Mr. Nitesh Acharya, Mr. Amol Bhamare, Mr. Ashish Karpe, Mr.Sarvesh Sawant, Prof.Vipul
Agrwal
21 Generating multimedia answer by collecting web data 104
Ms. Sneha Deore, Mr. Imran Shaikh, Mr. Arfan Shaikh, Ms. Ashwini Dahale,
Prof. G. P. Dhomase
22 Carp-a new security primitive based on hard ai problems 109
Adesh Chopda, Sachin Bhavar ,Paritosh Kulkarni, Venkatesh Pichapati
23 Event spark an android application 114
M.R.Sanghavi, Pooja Gagrani, Dipalee Sangpal , Divyani Dhadiwal, Deepak Singh
24 Make My Grocery App 120
Prof. Maind A.L , Miss.Sonawane A.S. , Miss.Deore V.R., Miss.Kasliwal N.C. , Miss.Patil
M.K.
25 My Destination Wakeup System 124
Shital Bhalerao, Jayashri Sanklecha, Archana Samdadiya,Sejal Karnawat,
Bhavana Khivansara
26 Robust Language Classification on Short Utterances 129
Ms. Snehal V. Gite, Prof J.V.Shinde
27 Inference Of Data Security Policies On Content Sharing Sites 134
Prachiti S. Pimple , Prof. Bhushan R. Nandwalkar
28 Campus Area Network Automation 140
Asst. Prof. Bhavana Khivsara, Monika S. Firodiya,AnkitC. Gandhi, Shital Wani, Ajinkya A.
Bhavsar
29 Object segmentation using Active Contour Model based on Probability density function 146
Ms. Snehal V. Talikoti, Prof. J .V. Shinde
30 Prevention of Discrimination in Data Mining using Direct and Indirect Methods 151
Neha V. Chaube, Ujwala M. Patil
31 Electronic health record system for indian society 156
Bhavana Khivsara,Shradha Firodiya,Surabhi Lakhotiya,Pooja Bhandari,Yashshri Sancheti
32 Fine Grained Model Based Relevance Feature Discovery for Text Mining 163
Suvarna H. Jadhav,P. B.Koli
33 A Novel Approach For Bug Triage With Software Data Reduction Techniques 168
Supriya B. Boraste, Prof. P. B. Koli
34 Multilingual Speech Recognition and LanguageIdentification 172
Ms. Gitanjali B. Pawar, Prof. N .R. Wankhade
35 Image Segmentation for Document Image Binarization 176
Ms.Kirti .S. Datir , Prof. J. V. Shinde
36 Information Retrieval and Keyword Extraction for Document Recommendation 181
Kumodini V. Tate , Bhushan R. Nandwalkar
37 Privacy Preserving Assign Approach to maintain 186
Confidentiality of the Data
Minakshi D. Binayakya, Pooja V. Rajwar, Divya k. Hyalij, Rohini U. Borgude ,Prof. K. M.
Sanghavi
Contents xix
38 Optimal Classifier for the Diagnosis of Lung Cancer using Computational Intelligence 193
Techniques
Vijay L. Agrawal, Dr. Sanjay V. Dudul
39 Mobile-Document Tracker 199
Komal P. Katkade, Latika R. Abad, Manali S. Lunawat, Mahesh R. Sanghavi
40 Internet of Things for Healthcare 203
Pranit S.Thakur, Srushti R.Thakur, Pooja L. Varpe, Kalyani B.More
41 Watermarking Technology for Relational Database 208
Priyanka R. Gadiya, Prashant A. Kale
42 Rule Based Phonetic Search for Surnames in Slovak 213
Janki B. Pardeshi, Prof. Bhushan R. Nandwalkar
43 Mitigation technique for Compromise Aggregators in Wireless Sensor Networks 218
Nikita Pareek, Prof. N. R. Wankhade
44 In Information Filtering used of Maximum Matched Pattern-based Model 223
S.K.Thakare, Prof. M.G.Bhandare
45 Fault Tolerant Middleware Multicast Routing In Wireless Sensor Network 228
Sushmita T. Mahajan, Prof.N R Wankhade
46 News Article Search Engine 233
Dimple S. Kothadiya, Varsha M. Bhandari, Gautam Soni, Monika D. Panchmiya, Kainjan
M. Sanghavi
47 Efficient Influence Maximization on Distinct Users in Social Networks 237
Vidya A. Khairnar, Prof. N. K. Zalte
48 Privacy preservation in location sharing using plqp 242
Miss. Pooja R. Jadhav, Miss. Dhanashree D. Surve, Mr. Aaftab Haider, Mr. Avesh D.
Shaikh , Prof. N.V.Sharma
49 Secure and Enhance Health Care System In Rural Areas in India using Cloud Computing 246
Mr. Rohit R. Nikam, Mr. Mahendra B. Gawali
50 Share Market Prediction using Regression Analysis -A Parallel Programming Mode 251
Shital deshmukh, Priyanka sonawane
51 Digi Campus 24x7 256
Nikhil Pawar , Sagar Shimpi , Priyanka Kothavade , Shraddha Wadge
52 Privacy Protection in User Profile Personalized Web Search 259
Gunjan Deshmukh, Jayashri Gite, Mayuri Khandgaure, Rohini Aher, Prof. Bhaladhare P.R
53 A Review of Traffic Management System Using IoT 262
Nikita Tendulkar, Komal Sonawane, Darshana vakte, Deepti pujari, Ghanshyam Dhomase
54 SMART PARKING SYSTEM USING CLOUD COMPUTING 266
Ajay.R.Jadhav,Datta .P. Hujare, Anil.A. Pawar, Prashant.B.Khandale, Prof. P. S. Desai
55 Life Style Based Friendbook System Using Semantic-based Method 270
K. D. Avhad, K. S. Jadhav, P. S. Pagare, S. P. Thakur, Prof. P. S. Desai
56 Detection and Prevention of Phishing Attack 275
Akshay Jain,Shital Raut, Sagar Sahuji,Sneha Zanzari
57 Secure approach for video sharing using RC4 authentication 278
Nisha D. Patil, Amol D. Potgantwar
58 Mining Text Data Using Side Information: A Survey 282
Mr. Shekhar S. Patil, Prof. R. B. Wagh
59 Revelation of Ranking Fraud for Mobile Apps:A survey 287
Varsha A. Patil, Nitin N. Patil
60 Product Aspect Based Opinion Mining: A Su+C17rvey 292
Namrata R. Bhamre, Nitin N. Patil
xx Contents
61 Sketch Based Image Retrieval 298

DugajeNamita, Nikam Dhanashree,Nikam Jyoti
62 Survey on Clustering Techniques in Data Mining 301
Pragati Kaswa, Gauri Lodha, Ganesh Kolekar,Suraj Suryawanshi,Rupali Lodha,
Prof.D.P.Pawar
63 Forensic Analysis using Document Clustering: A Survey 307
Saad S. Ansari, Prof. T.M. Pattewar
64 A Review of Image Annotation Methods 311
Pallavi D. Chaudhari, Nitin N. Patil
65 Enhanced the Color Quality of Image Through Gamut Mapped and Emboss Filter 316
Swati A. Sardar Prof. Ujwala M. Patil
66 Smartsnap- E-Commerce Application Based On Visual Search 322
Swapnil Nagare, Sagar Thakare, Harshal Avhad, Piyush Jain
67 NewApproaches for Outlier Detection on Imperfect Data Labels using Support Vector 326
Data Description
Mr.Rohit U.Pawar,Prof. Ujwala M.Patil
68 Dissolved Gas Analysis in Power Transformer using Artificial Neural Network 334
Bankar Rahul Sanjay, Prof..P.A.Desai
69 AUTOMATIC LANGUAGE TRANSLATOR MESSENGER 340
Sudrik Shubham,Nagare Sushma,Kshirsagar Pooja,Ghumare Kalyani,V.V.Agrawal
70 Auditing of Dynamic Big Data Storage on Cloud using Efficient Verifiable Fine-Grained 345
Updates
Pranit S.Thakur,Prakash R. Rokade, Sayali B. Khairnar, Sonali B. Dhadge
71 Internet of Things in Home Automation by sing Wi-Fi Technology 349
Arun I. Waghmare,Pranit S. Thakur,Balasaheb A. Aabhale,Sonali D. Dhadge, Sayali B.
Khairnar
72 a security prototype for online social network using lire and naive bayes algorithm 352
Heena R. Khan1,Rohit D. Tanpure, Saloni S. Pande,Saiyjad J. Pathan ,M.D.Kawade
73 travel package recommendation on user interest 356
Khairnar Pornima, Jadhav Nikita, Jadhav Ashwini ,Chhajed Bhagyashri
74 link structure improvement for effective user navigation 360
Pagar Ekta, Dhakrao, Madhuri , Aher Ashwini, Jadhav Prashant
75 identification of whatsapp users among large dataset 363
Patil Bhagyashri1,Nimje Pooja2,Kale Pooja3,Nikam Yogita4
76 motion detection application using webcam 368
Gangwal Nidhi,More Jaya, Patil Riya,Sonawane Prerna
77 web forum crawling 371
Mugdha Belan, Karuna Gaba, Minakshi Ahirrao,Kiran Bachhav
78 Intelligent Voting System 376
Sukanya Deshpande, Shivam Kumar, Shrikrishna Dere, Rohit Pawar
79 Plagiarism Detection 380
Nitin L. Shelke,Pranit S.Thakur, Srushti R.Thakur, Bhagyashri R. Davange ,Sharayu
D.Jadhav
80 A Genetic-Algorithm Based Approach to Solve Carpool Service Problem Using Android 384
App
Swapnali M. Kakulate, Ravina D. Jadhav, Sonali S. Gadhe,Trupti S. More
Contents xxi
81 Multilayer approach for Identity fraud detection System using Communal Detection 387
and Spike Detection
Mr.Sandeep Subhashrao Wadnere, Prof. Mr. Prashant P Rewagad
82 Discovering Elite Users and Routing Question in QA Community 392
Aditya Chavan, Suresh Chaudhary, Akash Chauhan, Prof. Khushali Deulkar
83 Pesticide Industry: A General Insight 398
Randhavane Shrikant B., Dr.Mrs.A.K.Khambete
84 Slum Rehabilitation Scheme: Problems in implementation and Their Remedies [A case 405
study of slum rehabilitation scheme in Ichalkaranji]
Sanjay M. Bagade, Dr. A.K.Gupta, Prof. D.B.Desai
85 Behavior of RC Framed Structures subjected to Recorded and Spectrum Compatible 414
Ground Motions: A Numerical Study
C. Preeti, K. Jagan Mohan
86 Comparison of Life Cycle Cost Analysis for Water Treatment Plant by Net Present Value 422
method and Equivalent Annual Cost Method
H.P. Ambre , A.B. Saner , P.D Aher
87 Life Cycle Cost Analysis of Sewage Treatment Plants 427
V Y Bhoye, A B Saner, P D Aher
88 Comparative study for cross-drain return wall using IRC 112:2011 & IRC 21:2000 431
Digambar K, C.D. Modheara,
89 Control Of Hydraullic JumpUsing Abrupt Rise Inbed 436
Pradnya Dixit, Raj Shet,Kishan Kansagara,PrajwalitWanjari,
Snehal Jadhav,Atharva Karkhanis
90 Study of NSPs and NTH Analyses of RCMRFs 441
Mohd Zameeruddin, Keshav K. Sangle
91 A Review On Development Of Seismic Hazard Analysis Of India 448
Shivamanth A, Shama P S, Mayank K. Desai, Chandresh H. Solanki
92 Studying The Present Contract Model, Causes of Delay in the Model and giving 453
Recommendation to it
Amarsinha N. Pawar, Hemanshu Ahire
93 Landslide Hazard Management Maps for Settlements in Yelwandi River Basin, Pune, 459
Maharashtra
Khamkar Dattatraya, Dr. Mhaske Sumedh
94 Missing Mass Correction in Stiff Bottom Storey Buildings 464
Sharad N. Manohar, Suhasini N. Madhekar, Omkar S. Pingale3
95 Application of GIS for Flood Mapping: A Case Study of Pune City 470
Pawar Amol D , Jyoti Sarup , Sushil Kumar Mittal
96 Hydrogeological Studies of Aslod Stream Watershed,Taluka Shahada,District 475
Nandurbar,M.S.
Dr. S.N. Kalia, Kulkarni M.A
97 Evaluating the efficacy of the burnt clay bricks prepared using industrial waste like 480
foundry sand and textile sludge
Avani K. Dedhia. Prof. Poonam I. Modi
98 Static Bending Analysis of An Isotrophic Circular Plate Using Finite Element Method 486
Pratik S. Gujar, and Sandeep S. Pendhari
99 Effect of CNS and fly ash on Physical Properties of Cement and HSC 491
V.R. Rathi , Dr.C.D.Modhera
xxii Contents
V.R. Rathi , Dr.C.D.Modhera

100 Experimenatal Analysis on coconut cell as course aggregate greener alternative 498
kushal D. oswal,Shailendrapal, Ushadevi S. Patil.
101 Impact of Risk in Railway Construction Management 503
Meshram Pranjali P., Devalkar R. V.
102 Study of “Built, Operate And Transfer”Project 509
Ganesh R Nile, P M Attarde
103 Aircraft Hanger Design Pre-Engineered Building 514
Ashwini.M.Kadam , Dr.R.S.Talikoti
104 Recent Advances of Self Drilled Micro Pile Foundation 519
Suhas Tayade, Sandip Vasanwala
105 Effect of Addition of Ordinary Portland Cement on Geopolymer Concrete with Ambient 525
Curing
B. H. Shinde, Dr. K. N. Kadam
106 Identifying the Cause of Delay in Construction Industry in Mumbai Region 531
Suhas G. Awari, Manisha Jamgade, Dr. Ushadevi Patil
107 Finite Element Analysis of Gravity Dam with Drainage Gallery in Ansys Workbench 14.5 536
Pooja A. Patil, Prof. G.B. Katti
108 Analysis of Axisymmetric Solid with Isoperimetric Element-A Parametric Study 541
Prof.Neha R. Pimpale
109 Determination of Water Quality Index of Khokad Talav and its percolated water in 547
Rangmahal Vihir & Tubewell on Downstream at Chandwad.
Prof. Sadhana M. Pawar, Bhansali Akshay R, Dhomse Shakti V., Jain Akshay S., Jain Mehul
M., Nahar Sameer P.
110 Best Management Practices (BMP’s) Used for Flood MitigationOn Mitthi River 554
Sushil Ade,Harshal Pathak, Pravin Chaudhari
111 Application of Dimentional Analysis in Prediction of Strength of Flexible Pavement 559
Mohit Chandak, Pravin Chaudhari
112 Effect of Plastic Strips on Compaction Characteristics of Soil 563
Vinod M. Pandit1, Hansaraj S. Dikkar2, Jay K. Patil3,Kunal G. Rajput4,Pradnya S.
Chavan5,Yogesh S. Deore6
113 Effect of Iron Dust on Compaction Characteristics of Soil 568
Prof. V.M.Pandit, Ajinkya G. Nerkar, Sagar N. Jagtap, Tushar Y. Gaikwad, Vaibhav B.
Bhandare
114 Effect of Base Isolation on Building 572
Prof. V. R. Rathi, Gadakh Vishal Balkrishna
115 Effects of Jute Fiber on Compaction Test 580
Vinod Pandit, Vyas Krishna, Borate Rohan, Adhikar Roshan, Pankaj Verma, Priyanka Ahire
116 Removal of dyes from industrial waste water (Textile) by using sludge 585
Aher Dhiraj D., Kale Shekhar P.
117 Axial behavior of ferrocement confined cylindrical concrete specimens with different 590
sizes
Kale Shekhar P ,Aher Dhiraj D. Shirsath H.A.
118 Analysis of Factors for Site Selection in Rehabilitation of Slum 594
Prof. Atul P. Khatri, Harshada A. Bhadane
119 Effective Application of PPP in Affordable Housing Project 600
Trymbak B.Dhavale,Rahul.R.Aher
120 Improving the Initial Filtrate Quality of Rapid Sand Filter by Optimizing Coagulant Dose 605
During Backwashing and Ripening Operation for Water Treatment Plant-A Review
C.H.Wagh,Dr. A. Z. Chitade
A Reliable Power Aware Routing Scheme for Mobile
Ad Hoc Networks
Mr. Makarand R. Shahade1, Dr. D. N. Chaudhari2
1
Asst. Prof., Department Of I.T., JDIET Yavatmal, India, makarandr_shahade@rediffmail.com
2
Professor, Department. Of CSE. JDIET Yavatmal, India, dnchaudhari2007@rediffmail.com
Abstract - One important characteristic of MANETs is that the nodes are energy-constrained. Since, nodes are battery-
operated, recharging frequently or replacing batteries may become undesirable or even impossible. The nodes in Mobile
Ad-hoc Networks (MANET) are limited battery-powered. This not only leads to degradation in performance of the
network but also reduces the lifetime of the network and in some cases makes the network partitioned. In order to
maximize the lifetime of MANETs, routes having nodes with low energy and nodes with more buffered packets should
be avoided. so, the energy efficiency is one of the primary metrics of interest. Energy efficient routing in MANETs
is considered as a major issue.In this Paper, a new energy efficient scheme in the routing protocol for mobile ad hoc
network has been proposed which will efficiently utilize the battery power of the mobile nodes in such a way that the
algorithm improves the network energy consumption and increases the lifetime of the network. The popular on demand
routing protocols use shortest path between sources to destination without considering the energy of the intermediate
nodes in the path. The proposed algorithm not only considers energy of the node while selecting the route but also takes
into account the number of packets buffered in the node. More number of buffered packets means remaining energy will
be less and time taken to deliver a packet will be more.
Keywords - Mobile ad hoc network; Routing Protocol; Energy Efficient Routing; Packet buffered; Network lifetime;
I. INTRODUCTION
MANET has emerged as one of the most focused and thrust research areas in the field of wireless networks
and mobile computing. In ad hoc mobile networks, routes are mainly multi hop because of the limited radio
propagation range and topology changes frequently and unpredictably since each network host moves
randomly. Therefore, routing is an integral part of ad hoc communications. Many routing protocols are
proposed for MANET. The protocols are mainly classified in to three categories: Proactive, Reactive and
Hybrid. Proactive routing protocols attempt to maintain consistent, up-to-date routing information from each
node to every other node in the network. Reactive routing protocols create routes only when desired by the
source node. Once a route has been established, it is maintained by a route maintenance procedure. Hybrid
Routing Protocol which combines the merits of proactive and reactive approach and overcome their demerits.
Nodes in Ad Hoc networks should be enabled to manage efficiently their energy consumption to prolong the
network lifetime [1]. The energy consumption of each node varies according to its communication state:
transmitting, receiving, listening or sleeping state. Any power failure of a node will affect the overall network
lifetime. As a result, energy efficiency should be taken into consideration as it is a critical and extensive
research issue. Mobile phones, laptops and PDAs are the devices used as nodes in MANETs, as shown in
figure 1. Researchers and industry both are working on the mechanism to prolong the lifetime of these
devices. Hardware manufacturers are also coming forward to help in saving the battery power by making
energy efficient devices like energy efficient CPUs, low power display units, efficient algorithms for hardware
processing and high density batteries.
One important characteristic of MANETs is that the nodes are energy-constrained. Since, nodes are battery-
operated, recharging frequently or replacing batteries may become undesirable or even impossible. The nodes
in Mobile Ad-hoc Networks (MANET) are limited battery-powered. This not only leads to degradation in
performance of the network but also reduces the lifetime of the network and in some cases makes the network
partitioned. In order to maximize the lifetime of MANETs, routes having nodes with low energy and nodes
with more buffered packets should be avoided. so, the energy efficiency is one of the primary metrics of
interest. Energy efficient routing in MANETs is considered as a major issue.
Many minimum energy (energy-efficient) routing protocols have been proposed in recent years. However,
very limited effort has been made in studying routing overhead, route setup time, and route maintenance
2 Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016)
Issues associated with these protocols. Without a careful design, an energy-efficient routing protocol can
perform much worse than a normal routing protocol. These protocols can be generally classified into two
Categories: Minimum Energy routing protocols [2] and Maximum Network Lifetime routing protocols [3].
Minimum Energy routing protocols search for the most energy-efficient path from the source to the
destination, while Maximum Network Lifetime routing protocols attempt to balance the remaining battery-
power at each node when searching for the energy-efficient path. Since Minimum Energy routing scheme is
also an important part in most recent Maximum Network Lifetime routing protocols such as Conditional Max-
Min Battery Capacity Routing (CMMBCR) and Conditional Maximum Residual Packet Capacity (CMRPC)
routing [4].
In this Paper, a new reliable power aware routing scheme for mobile ad hoc network has been proposed which
will efficiently utilize the battery power of the mobile nodes in such a way that the algorithm improves the
network energy consumption and increases the lifetime of the network. The popular on demand routing
protocols use shortest path between sources to destination without considering the energy of the intermediate
nodes in the path. This can lead to path breakage if any node runs out of energy. The proposed algorithm
which not only considers energy of the node while selecting the route but also takes into account the number
of packets buffered in the node as well as shortest routing path. More number of buffered packets means
remaining energy will be less and time taken to deliver a packet will be more. Proposed algorithm more timely
path setup and efficient route maintenance, that try to find the optimal route during route discovery phase and
maintain the route reactively.
II. PROPOSED RELIABLE POWER AWARE ROUTING SCHEME
A RPAR finds the most stable path out of the entire existing paths from source to destination using on-
demand routing. The popular on demand routing protocols use shortest path between sources to destination
without considering the energy of the intermediate nodes in the path. This can lead to path breakage if any
node runs out of energy. The algorithm which does not always choose only the shortest path between source
and destination but choose such routing path that nodes have the maximum residual energy as well as shortest
path and algorithm which not only considers energy of the node while selecting the route but also takes into
account the number of packets buffered in the node. More number of buffered packets means remaining
energy will be less and time taken to deliver a packet will be more.
2.1 Algorithm for Route Discovery process in RPAR
� When any node has data to send, it generates route request packet (RREQ) and floods it on the
network with a common transmission range.
� The route request packet should carry two pieces of information: hop count and energy consumption.
� Search for all shortest (Minimum hops) routes.
� Among the shortest paths pick the route on which nodes have the maximum residual energy as well as
minimum number of packets buffered in the node.
� Destination node sends the route reply packet (RREP) on selected route.
� The proposed scheme adds the following parameters in the header of route reply packet.
1. Residual Energy Status (RES): the residual energy of the node.
2. Buffered Packets (BP): the number of packets buffered in the node.
The algorithm does not always choose the shortest path between source and destination but chooses such
routing path that has nodes with maximum residual energy as well as minimum number of packets buffered in
the node among the shortest paths. In figure 3, nodes with blue color have more than 50% of remaining energy
and nodes with light blue color (2 & 6) have less than 50% of remaining energy. The small circle with the
nodes gives the number of buffered packets. As shown in figure 1, the shortest path from source node 1 to
destination node 9 chosen by AODV is 1-2-3-9 (shortest hop), but due to low residual energy of node 2, it is
not chosen. Node 5 and 6 also lie in the transmission range of source node 1. Out of the two, node 5 is chosen
as it has the maximum residual energy, minimum packets in buffer and also it is nearest to source node 1.
Thus the route 1-5-7-8-9 will be selected on the basis of above mentioned algorithm, which is more reliable
and number of packets can be transferred before any node dies.
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 3
Fig. 1 Reliable Power Aware Routing Scheme
2.2 Residual Energy Model
The energy consumed ec(T) by a node after time T is calculated as

ec(T) = nt x a + nr x b -------------------(1)
Where, nt and nr are number of packets transmitted and received by a node after time T respectively, a and b
are constants with value between 0 and 1.
The residual energy er(T) of a node at time T, is calculated as
er(T) = ei - ec(T) -------------------(2)
Where, ei is the initial energy of a node [19].
The residual energy of the node is calculated using equation (2)
Residual Energy Status (RES) is found as
If (Residual energy) < 50%
Then set RES = 0
If Residual energy > 50%
Then set RES=1
III. SIMULATION
In this section, it discusses some of the simulation parameters to measure the network performance.
3.1 Simulation Environment
The proposed model has considered an area of 1,000 mts × 1,000 mts with a set of nodes placed randomly. It
simulated by using Network Simulator (NS-2.33). Here, each node is initially placed at a random position
within the defined area. As it progresses, each node pauses current location for 2 sec and then randomly
chooses new location. Each node maintains its behavior, alternately pausing and moving to a new location
during the simulation time.
IV. RESULTS AND DISCUSSION
In order to evaluate the network performance, it uses the metrics such as network lifetime & energy
consumption.
4.1 Network Lifetime
In this experimental setup, it considered 25 nodes, which are deployed within the defined area. Number of
packets sent between 5�20 packets/sec and each node moved 2 mts/sec. Group size versus the network
lifetime as shown in Fig. 2 From the results, it concludes that the proposed model is always kept maximum
number of nodes alive for longer period of time as compared to others. If the group size is 12, then the
proposed model has kept the nodes alive for 8,150 sec, whereas the MIP model and LAM model have kept the
nodes at 7,450 sec and 6,455 sec, respectively.
Fig. 2 Group size nodes verses Network Lifetime
4.2 Energy Consumption
Fig. 3 shows the evaluation of Erms for different time instances. Initially, it assumed that all nodes consumed
zero Fig. 3 Erms for different time instances. From the results, it concludes that the MIP model has reached at
the top position as compared to both the proposed model and LAM model in terms of Erms. As on time
increases the energy consumption of all nodes will increase due to mobility. Then it system requires more
number of route discoveries to perform well. Consequently, it takes high energy consumption over the
network.
Fig. 3 Erms for different time instances
V. CONCLUSION
The algorithm efficiently utilizes the battery power of the mobile nodes in such a way that it will improve the
network energy consumption and increase the lifetime of the network and This algorithm does not always
choose only the shortest path between source and destination but choose such routing path that nodes have the
maximum residual energy as well as shortest path.
This algorithm not only considers energy of the node while selecting the route but also takes into account the
number of packets buffered in the node. More number of buffered packets means remaining energy will be
less and time taken to deliver a packet will be more. This proposed algorithm is differed from existing
algorithms.
The simulation results reported in this paper demonstrate that the proposed model improved the network
lifetime by 20% on average. Extending network lifetime is accomplished by finding multicast that tends to
minimize the variation of remaining energy of all the nodes.
REFERENCES
��-��IEEE
Trans. Wireless Comm., vol. 5, no. 11, pp. 3077-3086, Nov. 2006.
[2] �� rotocol for Wireless Ad Hoc
�� Proc. IEEE INFOCOM, Mar. 2004.
��-Life-Aware Routing Schemes for Wireless Ad
�� June 2001.
[4] A��
��, Mar. 2002.
��lection Scheme based on Caution Zone and
��IEEE Commun. Letters., vol. 15, no. 11, pp. 1252�1255, Nov. 2011.
�� -Hoc
�� IEEE Comm. Surveys and Tutorials, vol. 11, no. 1, pp. 78-91, First Quarter 2009.
��-Efficient Multicasting in Wireless Networks with Fixed
��mputing, pp. 958-962, 2009.
��
��Proc. IEEE Wireless Comm. and Networking Conf., pp. 1-6, 2009.
[9] W. Lian��-Energy Allot-��
IEEE Trans. Wireless Comm., vol. 8, no. 11, pp. 5490-5499, Nov. 2009.
��-Efficient Multicast Support in MANETs
under End-to-��IEEE Trans. Computer Networks, vol. 53, pp. 1603-1627, 2009.
��
��IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 12, pp. 2108�2125, Dec. 2011.
[12] A. Sharif-Nassab and F. As��
��IEEE Trans. Mobile Comput., vol. 11, no. 10, pp. 1425�
1435, Oct. 2012.
[13] A. A. Jeng and R.-��IEEE Trans. Parallel Distrib.
Syst., vol. 22, no. 12, pp. 1953�1960, Dec. 2011.
[14] ��-Demand
MANET Routing Protocols,��IEEE Communications Letters, vol. 17, no. 5, pp. 1040-1043, May 2013.
[15] ��-�� IEEE
Transactions On Mobile Computing, vol. 10, no. 11, pp. 1546-1557, November 2011.
[16] ��-Efficient Real-��
IEEE Transactions On Computers, vol. 60, no. 5, pp. 707-722, May 2011.
[17] �� -Aware Scheme for Routin�� IEEE
Transactions On Vehicular Technology, vol. 60, no. 8, pp. 3919-3932, October 2011.
[18] �� IEEE Sensors
Journal, vol. 13, no. 5, pp. 1442-1446, May 2013.
��
��International Conference on Emerging Trends in Engg. & Tech., Proc. IEEE, pp. 223-227, Dec. 2008.
[20] �� -Adaptive On-Demand Geographic Routing for Mobile Ad Hoc
��IEEE Transactions On Mobile Computing, vol. 11, no. 9, pp. 1572-1586, September 2012.
[21] ��-Efficient Topology Control
�� IEEE Transactions On Parallel and Distributed Systems, vol. 23, no. 8, pp. 1480-
149, August 2012.
[22] �� IEEE
Communications Letters, vol. 17, no. 3, pp. 592-595, March 2013.
[23] Chuan-Chi Weng, Ching-Wen Chen, Po-Yueh Chen, Kuei-Chung Chang�� -efficient cross-
�� Communications, IET Journals, Vol. 7 , Issue 3, May 2013.
DATA DEDUPLICATION IN HYBRID CLOUD
WITH SECURED AUTHORIZATION
Patil Shweta1, Pawar Mohini2, Nikam Pratima3, Jondhale Sonali4, Prof V.K.Wani5.
1
Department of information Technology��sweetypatil121@gmail.com
2
Department of information Technology��pawarmohini786@gmail.com
3
Department of information Technology��pratimanikam318@gmail.com
4
Department of information Technology��sonalijondhale16@gmail.com
Abstract- Data deduplication is technique for reducing the amount of storage space an organization needs to save
its data.In most organizations, the storage system contain duplicate copies of many pieces of data.For protecting the
confidentiality of sensitive data while deduplication, the convergent encryption technique has been proposed to
encrypt the data before outsourcing. For the purpose of better data security, this paper makes the first attempt to
address the problem of authorized data Deduplication.Different from existing deduplication systems, the differential
privileges of users are considered in duplicate check besides the data itself. This System also present several new
deduplication techniques supporting authorized duplicate check in a hybrid cloud architecture .
Keywords- Deduplication, authorized duplicate check, confidentiality, hybrid cloud.
I. INTRODUCTION
Hybrid cloud is the cloud computing environment in which an organization provides and manages
resources in house and has others provides externally. One of the main challenge of cloud storage services
is the management of the increasing size of data. Deduplication technique helps to remove from having
duplicate copies of same data[6]. However deduplication has several profits it improves concerns related
to privacy and security of users as it can lead to insider or outsider attacks[3]. For achieving deduplication
with data security in cloud environment makes critical problem to solve. The system is focusing at
efficiently solving the problem of deduplication with differential privileges in cloud computing, the
system considers a hybrid cloud architecture consisting of a public cloud and a private cloud. Existing
data deduplication systems, the private cloud is act as a proxy to allow data users to securely perform
duplicate check with differential privilege. To make data management widely scalable in cloud computing
environment, deduplication has been a main technique and has attracted more attention recently. Data
compression technique is used to improve storage utilization and can also be applied to network data
transfers to eliminate bytes that must be sent. Instead of keeping multiple data copies with the same
content, deduplication eliminates duplicate data by keeping only one physical copy and referring other
redundant data to that copy. Deduplication can be take place at either the file level or the block level. For
file level deduplication, it eliminates redundant copies of the same data. Deduplication can also take place
at the block level, which removes duplicate blocks of data that follow in non-identical files [6].
II. LITERATURE SURVEY
1��A Secure ��

In this paper, author presents a novel idea that differentiates data according to their popularity. Based on
this idea, author design an encryption scheme that guarantees semantic security for unpopular data and
provide weaker security , storage and bandwidth benefits for popular data. I Author show that our scheme
is secureunder the Symmetric External Diffie Hellman Assumption in the random oracle model[1].
��-��
In this paper, author describes an algorithm which takes advantage of the data which is common between
users to increase the speed of backups, and reduce storage requirements. This algorithm supports client-
end per user encryption which is necessary for confidential data. It also supports unique feature which
allows immediate detection of common subtrees, avoiding the need to query the backup system for every
files[2].
��
In this paper, author present Fade Version, a secure cloud backup system that serves as a security layer on
��
which reduces the storage of redundant data across different version of backup. On top of this, Fade
Version applies cryptographic protection to data backups[3].
4.�Security Proofs for Identity-��
Author provides either security proofs or attacks for a large number of identity based identification and
signature schemes defined either explicitly or implicitly in existing literature. Underlying these are a
framework that on the one hand helps explain how these schemes are derived, and on the other hand
enables modular security analyses, thereby helping to understand, simplify and unify previous work[4].
��
In this paper author proposed an architecture for secure outsourcing of data and arbitrary computations
to commodity cloud. In this approach, the user communicate with a trusted cloud which encrypt and
verifies the data stored and operation performed in the commodity cloud. Author divides the operations
such that trusted cloud is mostly used for security critical operation in the less time critical setup phase,
whereas queries to outsourced data are processed in parallel by the fast commodity cloud on encrypted
data[5].
II. PROPOSED SYSTEM
The owner should login by using authorized user name and password. The Owner has to browse the files,
generate the MAC address and before uploading to cloud server, the data owner has to check the
duplication. Then the connecter will connect to the particular cloud server and check the file availability
and send response to the data owner. After getting the response from the server, then owner has to upload
the file to the corresponding servers (CS). The user should register under data owner, after registration
success.User should login by authorized user name and password. The Cloud server has to authorize the
valid users.If the Remote user is hacker then he has to Automatic block in the cloud server.The data
should be integrated by cloud server. The user has to use correct Secret key and file name. If anyone is
wrong then he is considered as attacker. The Attributes are File Management, cloud server, owner,
Remote user and blocked user, Deduplication, authorized duplicate check, confidentiality, hybrid
cloud.[6]
3.1 System Modules
3.1.1 Data Owner Module
The data owner uploads their data on the cloud server. For the security purpose the data owner encrypts
the file and store in the cloud. The data owner can check the duplication of the file over Corresponding
cloud server. The Data owner can have capable of manipulating the encrypted file and the data owner can
check the multiple cloud data as well as the duplication of the file. And also he can create user with
respect to registered cloud servers. And also data owner has migrate to another cloud option, by this he
can migrating files from one cloud server to another cloud server.
3.1.2 Connector Module
Connector Module In this module, the connector helps to check duplication of file existed or not in cloud
server and you can check in multi cloud servers also. If it is existed then also owner trying to upload the
same file in same cloud server then connector automatically blocks his access permission. If it is not
existed then data owner can upload file in multi cloud servers at a time.
3.1.3 Cloud Server Module
The cloud service provider manages a cloud to provides data storage service. Data owners encrypt their
data files and store them in the cloud for sharing with Remote User. To access the shared data files, data
consumers download encrypted data files of their interest from cloud and then decrypt them.
3.1.4 Remote User
In this module, remote user logs in by using his user name and password. After he will request for secrete
key of required file from cloud servers, and get the secrete key. After getting secrete key he is trying to
download file by entering file name and secrete key from cloud server.
Fig.1 Architecture of Secured Authorized Deduplication
V. CONCLUSIONS
In this system, the notion of authorized files deduplication was planned to protect the data security by
containing differential rights of users in the duplicate check. We also present some new deduplication
methods supporting authorized duplicate check in hybrid cloud scheme, in which duplicate check tokens
of files are generated by private cloud server with private keys.Security analysis demonstrate that patterns
are secure in terms of insider and outsider violences specified in the proposed security model. As a proof
of concept, we appliance prototype of our proposed authorized duplicate check scheme and conduct test
bed experiments on our prototype. We shows that our authorized duplicate check scheme incurs nominal
overhead compared to convergent encryption and system allocation.
REFERENCES
[1] Jan Stanek�, Alessandro ��

Deduplication ��
[2] ��-��
[3] Arthur Rahumed, Henry C. H. Chen, Yang Tang, P��A Secure
Cloud Backup System with Assured Deletion and Version Control��
[4] Mihir Bellare1, Chanathip Namprempre2, and Gregory Neven3�Security Proofs for Identity-Based
Identification and Signature ��
[5] Sven Bugiel1, Stefan Nu¨rnberger1, Ahmad-��
��
[6] ��rized
��
VOL:PP NO:99, 2014.
[7] ��- aided encryption for deduplicated
stora�� IEEE TRANSACTIONS ON PARALLEL AND DIS- TRIBUTED SYSTEM VOL:PP
NO:99, 2013, pp. 296�312.
[8] ��- liable
convergent key ��ansactions on Parallel and Distributed Systems, 2013, pp.
192�220.
[9] ��
with assured ��al Work- shop on Security in Cloud
Computing, 2011, pp. 412 �415.
[10] J. R. T. Pastoriza and F. P. Gonzalez, CryptoDSPs for cloud privacy, 2010.
SECURE ONLINE TRANSACTIONS
Jyotsna Bhadane1, Nagama Deshmukh2, Komal Mule3,Neha Vyavahare4
1
Department of Information ��jyotsna57bhadane@gmail.com
2
Department of Information ��deshmukhnagama123@gmail.com
3
��komalmule93@gmail.com
4
��nehavyavahare9390@gmail.com
Abstract- ��
of online shopping credit or debit card fraud and credential information security are major issues for customers,
merchants and banks. Hence risk of fraud transactions using credit cards has also been increasing. In existing credit
card fraud detection business detection business processing system, fraudulent transaction will be detected after
transaction is done. Powerful Security will be provided in online transactions This System will present two level of
��
security is provided.
Keywords-Steganography; Visual Cryptography; Hidden Markov Model; Fraud detection
I. INTRODUCTION
Online shopping is the retrieval of product using the Internet through electronic purchase request,
submitting credit or debit card information and shipping of product at home delivery by courier. Many
frauds and crimes occur in online shopping and in online banking transactions. In 2012 consumer
information was misused for an average of 48 days as a result of identity theft [1]. Credit card fraud cases
are increasing every year. In 2008, number of fraudulent through credit card had increased by 30 percent
because of various ambiguities in issuing and managing credit cards. Credit card fraudulent is
approximately 1.2 percent of the total transaction amount, although it is not small amount as compare to
��
��nk accounts or arranging credit cards.
In this paper, a new method is proposed, that uses text based steganography, visual cryptography
and Hidden Markov model, which hide information of customer from third party but enable successful
fund transfer from c��
Steganography
& Cryptography
Hidden Markov
Model
Fig. 1 Levels of Security
II. PROPOSED SYSTEM
Traditional online shopping as shown in figure 2. customer selected items from online shopping portal and
then customer submitted his or her credit or debit card details such as credit or debit card number, name
��eway
as PayPal, payonlinesystem , Web Money and others for information checking and after information
checking account verification is done in bank. After that fund is transfer from customer account to
merchant account.
Submission of Credit
Selection of or Debit Card Details
Item By ��
Customer Server
Account Information
Verification In Checking In
Bank Payment Gateway
Transfer of
Fund
Fig.2 Traditional Online System
Proposed System as shown in Fig. 3 customer will selects items from online shopping portal. When
customer submit his or her information then this application activate the HMM, after that system will
apply the steganography and cryptography technique on customer information and submit this information
��
check in payment gateway and then that account verification will be done in bank. And that fund will
transfer from customer account to merchant account. Merchant willverify the payment in his server.
Selection of HMM is Apply Steganography

Item By Activate & Cryptography On
Customer Customer Information
Account Information
Transfer of Verification In Submit &
Fund Checking In
Bank Payment Gateway
Verify The Payment

from Customer
��
Server
Fig. 3 Proposed System

2.1 Hidden Markov Model (HMM)
Fig. 4 Hidden Markov Model
�� set of states; each state is linked with a probability distribution.
Transitions among these states are governed by a set of probabilities called transition probabilities.[2] In a
particular state a possible outcome or observation can be generated which is associated symbol of
observation of probability distribution. It is only the outcome, not the state that is visible to an external
��
Hidden Markov Model is a perfect solution for addressing detection of fraud transaction through credit
��
False Positives transactions recognized as malicious by a fraud detection system even though they are
really genuine.
2.2 Steganaography and visual cryptography

Steganography is the hiding of a message within another so that hidden message is indistinguishable. The
key concept behind steganography is that message to be transmitted is not detectable to casual eye [1].
Text,image, video, audio are used as a cover media for hiding data in steganography. In text
steganography, message can be hidden by shifting word and line [4], in open spaces [8], in word sequence
[9]. Properties of a sentence such as number of words, number of characters, number of vowels, position
of vowels in a word are also used to hide secret message. The advantage of preferring text steganography
over other steganography techniques is its smaller memory requirement and simpler communication [10].
Visual Cryptography (VC) is a special encryption technique to hide information in images in such a way
that it can be decrypted by the human vision if the correct key image is use.
III. RESULTS
It tries to find out any variance in the transaction based on the spending behavioral profile of the
cardholder, shipping address, and billing address and so on. The probabilities of initial set have chosen
based on the spending behavioral profile of card holder and construct a sequence for further processing. If
the fraud detection system makes sure that the transaction will be of fraudulent, it raises an alarm, and for
the security purpose, this application will generate One Time Password. User will enter that OTP and
then original password and OTP will be verified and then it will move to the transaction section. User will
known this password through his mobile.
IV. CONCLUSIONS
It is concluded that text Steganography technique used to hide customer dat a and visual
cryptography by inserting meaningless image on text so that customer data cannot be de - testable to
casual eye, Hidden Markov Model identify the incoming transaction is fraud or real by checking
�� it is concluded that system has various security levels which will provide secure
environment for online transactions.
REFERENCES
��
pp. 978�1�4799�2526�1, 2014.
��-
March 2008.
��al-��630, 1994.
[4] M. Syeda, Y. Zhang, and Y. �� 577,
2002.
�� ective credit card fra��
378�383, 2002.
[6] V. Bhusari and S. Patil��-5, p. 0975
8887, 2011.
Consolidation and Migration Technique for
Workload Distribution in Virtualized Data Center
Tejashwini Y.Bhamare1, Prof.B R Nandwalkar2
1
Department of Computer Engineering, Late G.N.Sapkal COE, Nashik, teju.bhamare@gmail.com
2
Department of Computer Engineering, Late G.N.Sapklal COE, Nashik, nandwalkar.bhushan@gmail.com
Abstract- To increase the efficiency of energy in the server, consolidation technique is used but due to this
technique performance of the workload degraded. So consolidation and migration techniques are used to improve
workload performance in virtualized data center. In consolidation technique reduce the number of physical machine
(PM) and increase the number of virtual machine (VM).VMWARE is used to create multiple number of VM(Virtual
Machines) .it generate multiple VM on single PM. So, Energy requirement for performance becomes less because
automatically workload distributes in proper way. For this purpose two modules are used consolidation planning
module, which gives set of workload, minimize the number of PM by an integer programming model, Migration
planning module which gives workload from consolidation module to VM by Polynomial time algorithm.
LSAP(Linear sum assignment problem)this method used to solve migration planning problem (means during
migration from one VM to another it takes much time automatically it leads higher communication cost because
destination VM already associated with other VM ,communication cost increase)in this method created matrix solve
by using Hungarian algorithm, will get less migration cost.
Keywords- Migration; Consolidation; Physical Machine (PM); Virtual Machine (VM) etc
I. INTRODUCTION
To maintain the energy efficiency of the data center infrastructure of the data center becomes the biggest
problem Because if infrastructure become large energy consumption also increases. If energy
consumption increases costing also increase . To handle such a large infrastructure also tedious job it
create complexity. According to survey of the New York time in 2012 on energy consumption on data
center. They observe that only 6 to 12 percent of electricity used to perform processing on data center
other remaining electricity was totally wasted on infrastructure of data center.
If we consider the example of cloud system same problem arrives to handle large information large
infrastructure require. It automatically increases the costing. The disadvantage of this it leads high energy
bills, also increases the high cooling cost; floor space cost and because the adverse impact on the
environment.
Server consolidation supported by virtualization. The main approach to improve energy efficiency by
reducing number of physical machine. However, server consolidation and VM migration bring two major
challenges:
1) Consolidation can incur considerable performance degradation of co-located VMs due to competition
on shared resource.
2) Migrating virtual machines with different workloads, which will also degrade the performance of
workloads.
The problem is how to minimize the number of PMs during server consolidation without performance loss
of each workload. In the migration planning module, we pose a new problem on how to change a current
workload placement on PMs into a new workload placement on PMs with minimum migrations cost.
System can handle both static and dynamic server consolidations in data centers.
II. RELATED WORK

��-�� Energy-proportional designs would
enable large energy savings in servers. Author compare multiple device and their component and suggest
which device is more efficient for energy saving. The active low power mode suggest processor running
at a lower voltage-frequency mode can still execute instructions without performance loss.
�� Xen, and x86 virtual machine monitor which
allows multiple commodity operating systems to share conventional hardware in a safe and resource
managed fashion, but without sacrificing either performance or functionality. Xen design can targeted
hosting of up to 100 virtual machine instances simultaneously on a modern server so, due to this cost of
communication can reduced. Author also introduces paravirtualization which improved performance, and
overcome from drawbacks of cost of increased complexity and reduced performance of system. Author
also suggest that full virtualization is not part of X86 for that VMM (virtual monitor) provided.
�� Migrating operating system instances across
distinct physical hosts is a useful tool for administrators of data centers and clusters: It allows a clean
separation between hardware and software, and facilitates fault management, load balancing, and low-
level system maintenance. Author works on operating system so it is well known as live migration.
Migration done in multiple phases from source host to destination host. In this paper pre-copy migration,
in this phase it act like the push message phase from source host to targeted host these procedure works
in iterative manner that is message sending methods runs in multiple rounds . Every VM will have some
(hopefully small) set of message(pages) that it updates very frequently .service degradation will occur
because total bandwidth are consume by source and destination during transfer and receive message. After
receiving messages or pages to targeted host migration of pages done but still problem occurs how to
transfer network devices therefore cluster are used in this NAS are used for migration.
�� tualized data centers,
�� Server consolidation describes the process of combining the workloads of several
different servers on a set of target servers This paper presents decision models to optimally allocate source
servers to physical target servers while considering real-world constraints. Therefore, besides an exact
solution method, a heuristic is presented to address large-scale server consolidation projects. Author also
explain static server allocation problem (SSAP) due to this cost of hardware also reduce which is helpful
to maintain IT infrastructure .author also mention to keep track of source of workload because the
workload can be change.
��chnique migration
control technique are suggested .This paper proposes an LP (linear programming) formulation and
heuristics to control VM migration, which prioritize virtual machines with steady capacity. Author
explains problem of mapping in migration in both cases 1)static consolidation -in which no migration
done 2)dynamic migration �in which migration done these two problem are solved by using LP(linear
programming )in which number of physical machines are reduced and number of virtual machines are
increased. second solution is heuristics changes the sequence according to first-fit decreasing (FFD), best-
fit decreasing (BFD), worst-fit decreasing (WFD), and almost worst-fit decreasing(AWFD)Author
performed experiments using TU-Berlin and Google data center workloads to compare migration control
strategy against existing eager-migration-based solutions.
��
technique author describes the architecture and implementation of a power aware application placement
framework, called pMapper . In this various technique are provide for power and performance by using
virtualization.Pmapper basically used for power minimization under some computation i.e performance
constraint. In pmapper the power management action handle in soft actions like CPU idling in the
hypervisor, (ii) hard actions like throttling and (iii) consolidation actions (minimize PM). Basically during
working of Pmapper 3 manager are used performance manager that take about performance must meet
with quality of service, power manager that works regarding power related works and , migration manager
that works in virtualization.
��In this technique , propose a priority-

based method to consolidate parallel workloads in the cloud. author leverage virtualization technologies to
partition the computing capacity of each node into two tiers, the foreground virtual machine (VM) tier
(with high CPU priority) and the background VM tier (with low CPU priority) and provide scheduling
algorithms for parallel jobs to make efficient use of the two tier VMs to improve the responsiveness of
these jobs.
III. PROPOSED SYSTEM
In our Existing system the workload assigns to migration plan and according to size of workload VM is
assign but sequentially due to this migration mapping problem can arrived .In proposed system best VM
(exact size of VM) allocate to workload. As shown in following diagram our proposed system shows
which is combination of static as well as dynamic consolidation.
In our proposed system the energy lost problem also recovers. As shown in following diagram in
migration plan module one Physical machine (PM) of size 1000kb Present. In that PM we can make 3
virtual machine that is VM size of 500kb, 100kb, and 300kb respectively.
So, when workload arrived as a input to PM in migration module. The best VM is assign to arrive
workload. It basically follows the best fit approach instead of first come first serve approach. So,
automatically space of VM is save .
We also used LSAP method to solve the migration mapping problem which is arrived during migration. In
LSAP method Hungarian algorithm also used in which the problem is divided into sub-problem.
3.1 LSAP Method
The original model where n items (e.g. jobs) are to be assigned to n machines (or workers) in the best
possible way. Basically LSAP can perform to divide main problem into sub problem. The partitioning
(division) method done randomly no specific rule used for it. LSAP method solves the problem by making
it into the matrix form. And used Hungarian algorithm to solve the problem
3.2 Algorithm
Input:
1) Source consolidation scenario
2) Target consolidation scenario
Output:
A set of VM migration with Minimal number of migration in it
Begin:
1) If s>t, add s-t empty cases to the target scenario
2) Construct an LSAP with s× s cost matrix C
3) Call Hungarian algorithm to solve LSAP
4) Solve migration mapping problem
End
3.3 Hungarian Algorithm
Hungarian algorithm is used after LSAP (linear sum assignment problem). It can solve the matrix C using
the Hungarian algorithm and gives exact output that which workload assign to which VM.
Fig -1: Proposed System
IV. RESULT AND ANALYSIS

After distribution of workload migration mapping problem arrive to solve this migration mapping
problem will use LSAP (linear sum assignment problem) method. And this problem solved by using
Hungarian method. As shown in above snapshot some limitations are given to the all workload, after
that loads are assigning to the physical machine and will get output by using migration algorithm.
Fig-2: Hungarian Algorithm
V. CONCLUSIONS
The proposed system gives information related to workload distribution by using the migration and
consolidation technique. The main purpose of system is to increase the efficiency of system as well as to
reduced cost required to manage the data. Also to handle such large data big infrastructure is required and
big infrastructure required large power supply.
So the main approach of this system to reduced the number of physical machine by using the virtual
machine this technique basically used in consolidation. In migration workload can distribute from one
VM to another VM but in this cost of migration increase to solve this problem LSAP (linear sum
assignment problem) method used. In LSAP method Hungarian algorithm is used. By using this will get
less migration cost.
REFERENCES
[1] Kejiang Ye, Zhaohui Wu, Chen Wang, Bing Bing Zhou,Weisheng Si, Xiaohong Jiang, and Albert Y.
�� -Based Workload Consol��
IEEE Trans, VOL. 26, NO. 3, 2015
[2] T. N. Y. Times, The cloud factories: Power, pollution and the internet. [Online]. Available:
http://www.nytimes.com/2012/09/23/technology/data-centers-waste-vast-amounts-of-energybelying-
industry-image.html, 2014.
[3] ��-��Comput., vol. 40, no. 12, pp. 33�
37, 2007.
[4] P. Barham, B. Dragovic, K. Fraser, S. Hand, T. Harris, A. Ho, R. Neugebauer, I. Pratt, and A. Warfield,
��in Proc. ACM SIGOPS Oper. Syst. Rev., 2003, vol. 37, no. 5, pp. 164�
177.
[5] C. Clark, K. Fraser, S. Hand, J. Hansen, E. Jul, C. Limpach, ��
�� 2nd Conf. Symp. Netw. Syst. Des. Implementation-Volume 2, 2005, pp. 273�
286.
[6] ��
in vi��IEEE Trans. Serv. Comput., vol. 3, no. 4, pp. 266�278, Oct. 2010.
[7] ��
��Future Generation Comput. Syst., vol. 27, no. 8, pp. 1027�1034, 2011.
[8] ��
��n Proc. 9th ACM/IFIP/USENIX Int. Conf. Middleware, 2008, pp. 243�264.
[9] X. Liu, C.Wang,B.Zhou,J. Chen,T. ��
��IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 9, pp. 1874�1883, Sep. 2013.
Energy Efficient Orbital Unequal Clustering
(EOUC) Algorithm for Heterogeneous WSN
Surabhi R. Gosavi1, Prof. N. R. Wankhade2
1
Department of Computer Engineering,LGNSCOE Nashik, surabhigosavi@gmail.com
2
Department of Computer Engineering,LGNSCOE Nashik, nileshrw_2000@yahoo.com
Abstract-Wireless sensor node is a combination of many small sensor nodes, also called motes and each mote has a
capability of sensing and forwarding the data to the other motes and a gateway (to send information globally on
internet) which is commonly known as sink. Sensor nodes limited energy and memory are important factors to be
worked upon. Energy consumption rate increases highly if all sensor nodes send data individually to the base station
which reduces survival time of node. This is commonly known as hot spot problem. On the other hand the equal size
clusters waste energy according to the network density. This problem is called equal size clustering problem. In this
paper, both the hot spot and equal clustering problems are addressed. And an Energy Efficient Orbital Unequal
Clustering (EOUC) Algorithm is proposed. EOUC improves the network lifetime when compared to other clustering
protocols.
Keywords- Clustering, Sensor network, Internet, Sensor node, Hot spot problem
I. INTRODUCTION
A wireless sensor network (WSN) is usually self-organized wireless ad hoc network which consists of
sensor nodes which are randomly dispersed over the interested area. Sensor nodes generates data, based
on its sensing mechanisms observation and transmit sensed data packet to the base station (sink). The role
of a base station is to collect all data received from the various sensors, analyse them and ultimately make
decisions. Sensor nodes could be deployed in home, military, science, and industry applications such as
transportation, health care, disaster recovery, warfare, security, industrial and building automation, and
even space exploration. Among a large variety of applications, phenomena monitoring is one of the key
areas in wireless sensor networks and in such network. Depending on the application, sensor node
deployment can be either deterministic or random, stationary or mobile, homogeneous or heterogeneous.
At the same time wireless sensor networks offer numerous challenges due to their peculiarities, primarily
the stringent energy constraints to which sensing nodes are typically subjected. These challenges include,
but are not limited to: energy, memory, and throughput constraints. Energy efficiency is crucial because of
the scale and application environments in which sensors are deployed. One of the well-known approaches
is to apply clustering techniques to effectively establish an ordered connection of sensor nodes whilst
improving the overall network lifetime. Clustering organizes the WSN into sets (clusters). A sensor from
each set is elected as cluster head (CH). A CH coordinates and aggregates data of nodes within its cluster
(intra-cluster communication). CHs communicate with each other and/or with an external base station
(BS) (inter-cluster communication) on behalf of their nodes. In the equal size clusters, the nodes nearer to
the sink are overburdened by means of huge traffic load as the data from the entire region are forwarded
through them to reach to the sink. As a result, their energy is shaded rapidly and the network is
partitioned. This is commonly known as hot spot problem. A quit common solution to the energy hole
problem is unequal clustering where clusters far away from the BS will have a larger size when compared
to clusters closer to the BS. By creating unequal sized clusters, the amount of intra-cluster traffic is
considerably reduced for the CHs nearer to the BS.
In homogeneous networks all the sensor nodes are identical in terms of battery energy and hardware
complexity. With purely static clustering (cluster heads once elected, serve for the entire lifetime of the
network) in a homogeneous network, it is evident that the cluster head nodes will be over-loaded with the
long range transmissions to the remote base station, and the extra processing necessary for data
aggregation and protocol co-ordination. As a result the cluster head nodes expire before other nodes. On
the other hand, in a heterogeneous sensor network, two or more different types of nodes with different
battery energy and functionality are used. The motivation being that the more complex hardware and the
extra battery energy can be embedded in few cluster head nodes, thereby reducing the hardware cost of
the rest of the network.[7]
II. LITERATURE SURVEY
A lot of literature is available on equal and unequal size clustering techniques for wireless sensor
networks. In the following we first introduce some work on equal clustering protocols then we discuss
some unequal size protocols.
Srikanth Jannu al. proposed a energy efficient unequal clustering (EEUC) technique which address both
the hot spot and equal clustering problems and present unequal size clustering and routing algorithms by
considering the energy efficiency of the WSN. This paper address the problem of balancing of the energy
consumption among sensor nodes and propose unequal clustering and routing algorithms (combinedly
called UCRA) towards the solution of the hot spot problem. The algorithms are experimented considering
several scenarios of WSN. Also shows the efficiency of the algorithms in terms energy efficiency,
balancing the load and lifetime of the network.[1]
Vijay M. Galshetwar, Amutha Jeyakumar made comparative study of HEED. HEED (Hybrid Energy-
Efficient Distributed) is a distributed clustering protocol, which involves grouping nodes into clusters and
electing cluster heads periodically such that members of a CH can communicate with their cluster heads
and these CHs send aggregated data received from its members to a base station. A set of cluster heads
can be selected from the set of nodes in the network. Cluster heads are responsible for coordination among
the nodes within their clusters and aggregation of their data (intra cluster coordination) and
communication with each other and with external observers on behalf of their clusters (inter cluster
communication).[2,6]
UHEED proposed by E. Ever, R. Luchmun, L. Mostarda, A. Navarra, and P. Shah, is an unequal
clustering protocol that combines HEED and EEUC. it uses the competition radius formula which creates
unequal clusters as they are further away from the base station, in order to create unequal clusters. This
effectively allows more intercluster or relay traffic and less intra-cluster communication for nodes nearer
to the base station, hence preventing their early death. Since the lifetime of the leaders closer to the BS is
more critical, the clusters further away have larger sizes compared to the clusters close to the BS. More
precisely, it uses the leader election algorithm that is defined in HEED and each cluster head computes the
competition radius by using the formula defined by EEUC.[4]
W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan proposed Low Energy Adaptive Clustering
Hierarchy (LEACH) which is one of the primary adaptive hierarchical clustering. LEACH divides the
network into small areas called clusters. In each cluster, a dedicated node called a Cluster Header (CH) is
selected. The LEACH protocol is divided into rounds and each round consists of two phases: the set-up
and steady phases. In setup phase each node decides independently if it will become a CH or not. This
election probability is based on the last time a node has been elected as a CH. The node that hasn't been a
CH for long time is more likely to elect itself than other nodes that have been CHs recently. The Steady-
state phase starts after the setup phase. In this phase, the data transmission is started. Member nodes send
their data during their allocated Time Division Multiple Access (TDMA) slot to the CH. This transmission
uses a minimal amount of energy which is only that required to reach the CH (calculated using the
received strength of the CH advertisement). When all the data has been received, the CH aggregates these
data and transmits it to the base station. But because of the election of cluster head is randomized, it may
cause some problems such as uneven distribution of the cluster head, uneven energy loading and so on.[5]
M. Mehdi Afsar and Mohamed Younis proposes an Energy- and Proximity-based Unequal Clustering
algorithm (EPUC) which imposes a condition on the distance among cluster-heads that is adaptively
adjusted, so that the inter-clusterhead proximity is smaller as they get closer to the base-station. In
addition, the cluster population is set while factoring in the inter-cluster relaying activities in order to
balance the load on cluster-heads. EPUC models the area as tracks around the BS. EPUC opts to
overcome the uneven energy consumption rate of nodes in the vicinity of the BS due to the increased data
relaying activity. CHs are selected in EPUC based on proximity to the BS and their energy reserve. So the
area is divided into tracks centered at the BS and the cluster count is increased as we get closer to the BS.
Nodes with the most remaining energy are designated as CHs through a track-based competition.[3]
III. PROPOSED SYSTEM

3.1. Network Model
Sensor nodes are uniformly deployed in a two dimensional field with the following assumptions:
Each node is identified with a unique ID;
� Nodes can transmit at various power levels depending on the distance of the receivers;
� Nodes are not mobile that is they remain stationary;
� Nodes are equally distributed in the field;
The BS is located away from the sensing field with no energy constraints. It is considered to be a node
with enhanced communication and computation capabilities. The BS is stationary. The data captured in a
cluster is highly correlated, therefore it can be aggregated before being transmitted to the base station.
CHs aggregate data during intra-cluster communication and forward to the BS via multihop. Network
operation model is composed of multiple rounds. A round starts by triggering the cluster election and
formation phases. When the clusters have been formed, the network starts a data exchange phase where
each aggregated data is sent by the CH to the BS (multi-hop data transmission among cluster heads is
performed). The round ends when all aggregated data sent by the CHs reach the base station.
Heterogeneous WSNs may contain two, three, or multitypes of nodes with respect to their energy levels
and termed as two, three, or multi-level heterogeneous WSNs respectively. Proposed system considers
three-level heterogeneous network that contains three different energy levels of nodes: normal, advanced,
and super. Normal nodes have E0 energy. Advanced nodes have a times more energy than normal ones,
i.e. E0(1+a). Whereas, super nodes have b times more energy than the normal ones, i.e., E0(1+b).[7]
The total initial energy of super nodes in WSN is as follows:

Esuper = NE0(1+b)
3.1
The total initial energy of advanced nodes is as follows:
Eadvanced = NE0(1+a)
3.2
Similarly, the total initial energy of normal nodes in the network is calculated as follows:
Enormal = NE0
3.3
The total initial energy of three-level heterogeneous WSNs is therefore calculated as:
Etotal = Esuper + Eadvanced + Enormal
3.4
3.2. Algorithmic Strategies
The proposed algorithm works in three phases:
Phase I: Clustering Phase:

In the clustering phase, sensor nodes select their CHs. The initializing phase assigns to each node the
probability of becoming a tentative cluster head.
Probability of node for becoming cluster head is assigned based on the distance of a node from the base
station. Smaller clusters are formed for the nodes nearer to the base station, so as they transmit more data
as compared to other nodes they will not die early. Hence improving energy efficiency and so prolonging
network lifetime. We will calculate the distance of a node from the base station according to the following
formula:
��-x1)2 + (y2-y1)2
The node having less distance from the base station will have more probability of becoming cluster head.
Phase II: Rotation Phase:

In the rotation phase, based on the highest residual energy of member nodes, next CHs are selected in
their corresponding clusters and there is no need of re-clustering until any of the nodes deplete completely
its energy.
Phase III: Re-Clustering Phase:

When any of the node dies re-clustering is performed by repeating step 1.
3.3. Block Diagram
Nodes closer to base station will require more energy since they have to transmit more data than other
nodes. Therefore these nodes will die earlier which is nothing but known as hot spot problem.
Fig. 1 Block diagram of proposed system

So as shown in Fig. 1, according to proposed system, nodes closer to the base station i.e. sink are
clustered as small clusters and CH heads are rotated. So there will be no requirement to form new cluster.
In this way, hot spot problem can be solved.
IV. CONCLUSIONS
Here we have proposed an energy efficient clustering algorithm EOUC (Energy efficient Orbital
Unequal Clustering) for heterogeneous wireless sensor network. EOUC improves RUHEED with
the heterogeneous network. The proposed scheme can significantly reduce energy consumption
and increase the lifetime of the network compared to the existing schemes.
REFERENCES
[1] �� Efficient Unequal Clustering and Routing Algorithms for Wireless
�� , Advances in computing, communications and informatics (ICACCI) International
conference, DOI: 10.1109/ICACCI.2014.6968283, Sept 2014.
[2] ��
��
Signal Processing, DOI: 10.1109/ICCSP.2014.6950190 , April 3-5, 2014
[3] �� - and Proximity-based Unequal Clustering algorithm
�� th annual IEEE conference on local computer network, DOI:
10.1109/LCN.2014.6925780 , 2014
[4] ��- An Unequal Clustering Algorithm For
��ensornets, 2012.
[5] ��-Efficient Communication Protocol for Wireless
��
Sciences, Maui, HI, USA, pp. 1019, 47 January )2000.
[6] �� -efficient, distributed clustering approach for ad-hoc sensor
��
[7] ��
journal on wireless communications and networking, DOI: 10.1186/s13638-015-0376-4, 2015
[8] G Vennira ��

��f computer applications, vol. 79- No. 1, October 2013
[9] ��Unequal Cluster-��
Vol. 8 No. 11, Nov 2013.
[10] Monica R Mundada, Savan Kiran , ShivanandKhobanna, Raja NahushaVarsha and ��A study
��
Parallel Systems (IJDPS) Vol.3, No.3, May 2012.
[11] ��lustering protocol for wireless sensor
��, Hindawi publishing corporation, International journal of distributed sensor networks, Jan 2015
Another random document with
no related content on Scribd:
III
KING COAL (1810-1910)
THE “Industrial Revolution” that changed the face of a large part of
England is generally stated to have commenced about 1770, when
machinery began to displace hand-labour and so drove the workers
out of their homes into factories. About the same time came the
construction of canals connecting the chief waterways and centres of
population, and the slow improvement of the roads. But none of
these important changes greatly affected the outward appearance of
our villages until about forty years later, when, as the title of this
chapter indicates, the steam-engine replaced the water-wheel in the
factories, and when coal began to make its influence felt all over the
country. Simultaneously there grew up a system of macadamised
roads and stage-coaches, which gave place in thirty or forty years to
railways. For a century coal was the dominant factor in English life,
but since 1910 petrol has played the main part in altering the aspect
of the countryside.
Meanwhile, of course, minor causes have always been in operation.
The progressive enclosure of common land and the gradual
grouping of the old one-acre holdings into large hedged fields
continued all through the early part of the nineteenth century, in spite
of violent agitation by Cobbett. Whatever may have been the
arguments in favour of enclosure, the inevitable effect on village life
was to squeeze the small man out of existence and to perpetuate the
big farm employing workers at starvation wages. Poverty stalked
through the little cottages, many of which were unfit for human
habitation. The cruel game-laws did not prevent the rapid increase of
poaching, and the woods were sprinkled with man-traps and spring-
guns, which sometimes claimed a gamekeeper for victim instead of a
poacher.
And, while economic conditions were rapidly abolishing the old self-
supporting village community, changes in the means of transport
brought machine-made goods to its doors, thus destroying at one
blow the independence of the village craftsman and the rustic
character of village architecture. Too scattered, too cowed, and too
poor to organise a successful revolt, many of the villagers found their
consolation in the little barn-like chapels erected by the Primitive
Methodists and other Nonconformist bodies in the early part of the
century. Usually severe and uncompromising, often ugly, these
buildings represented a revolt against the partnership of squire and
parson with its iron grip on village life. The dignified brick meeting-
houses of the seventeenth and eighteenth centuries were of another
type, the flamboyant Gothic chapel of Victorian days had not been
conceived, but the village Bethel of 1810 or so is a standing witness
to the cottager’s grievance against the ruling class of his day. Very
little cottage-building was done, for though the population was
increasing very fast, it was migrating from country to town in order to
be near the new factories.
The network of canals that spread over England between 1760 and
1830 or so did not greatly influence the appearance of the
countryside, though their numerous lockhouses and bridges have
the merit of severe simplicity. But the system of new roads
introduced by Telford and Macadam early in the nineteenth century
had an immediate and far-reaching effect. With them we enter on the
brief but glorious coaching-period, which holds such a grip on the
English imagination that it still dictates the design of our Christmas
cards. The “old-fashioned Christmas” that has been such a godsend
to artists implies unlimited snow, holly, mistletoe, and plum-pudding,
with the steaming horses standing in the inn yard and the red-nosed
driver ogling the barmaid. Dickens made the most of it in literature,
Hugh Thomson and Cecil Aldin in art. For the stage-coach
immediately enlivened every village and town lying on the great
highways. The roadside inn came into its own, but after some forty
crowded years of glorious life declined again until the motor-car
provided it with a new lease of prosperity, or at any rate until the cult
of the bicycle gave it a fillip.
The influence of railways on the appearance of the countryside has
been mainly indirect, in the sense of having destroyed the isolation
of villages and hamlets and with it the local characteristics that they
possessed. For example, the use of purple Welsh slates was almost
unknown outside Wales up to the beginning of the nineteenth
century, when they came into common use, for though their colour
and texture is unpleasing, they are relatively cheap and can be fixed
on lightly constructed roofs. So first canals and then railways
combined with factories to spread machine-made goods all over the
country. Otherwise the railway has not greatly defaced the landscape
as a whole, for there are still large tracts of country where one can
be out of sight and sound of it, and it is not so ubiquitous as the
modern motor-car. Many village railway-stations and cottages are
inoffensively designed, and in the “stone” districts of England are
usually built of local materials, but their appearance suffers as a rule
from the dead hand of central and standardised control. The habit of
erecting enormous hoardings in the fields bordering a railway must
go far back into the nineteenth century. Presumably these eyesores
have some object in view beyond merely annoying the traveller and
defacing the landscape, but certainly they must come up for
consideration in the last chapter of this essay.
Two hundred years ago, even more recently than that, the populous
and prosperous parts of England were East Anglia, Kent, Sussex,
Surrey, Somerset, Gloucestershire, and some neighbouring
counties. Agriculture, sheep-farming, and the wool trade formed the
main source of wealth: and the only notable exception was the iron
industry of the Weald, where a sufficiency of wood fuel was available
for smelting. Between 1750 and 1850 the great northward trek took
place, and King Coal became supreme. He ruined an appreciable
part of Yorkshire and Lancashire, smeared his ugly fingers over
mountain valleys in South Wales and elsewhere, created the “Black
Country” in his own image, and last of all produced the terrible blot
that we call the “Potteries,” where the whole landscape looks like a
bad dream.
The most hideous nightmare-panorama that comes to my mind is a
scene of utter desolation not far from Etruria (a singularly
inappropriate name), in Staffordshire, where slagheaps, collieries,
blast-furnaces, potbanks and smoke dispute the foreground. Yet an
old print that I saw in Messrs. Wedgwood’s adjoining works proves
that less than two hundred years ago this was unspoiled country.
From that time onwards, the northern half of England became the
national workshop, and a large part of southern England became a
private garden. At the present moment half the total population of
England is concentrated in five comparatively small districts:
“Greater” London, South Lancashire, West Yorkshire, the “Black
Country” and Tyneside.
Examples of the early factories built towards the end of the
eighteenth century are to be found in the beautiful valley above
Stroud, and in many wild and lonely dales among the Pennine hills.
They stand beside fast-running streams which at first provided the
necessary power, but before long the steam-engine replaced the
earlier method, and a tall chimney was one immediate result.
Smoke, of course, was another. Yet so many of these old “mills” still
survive that we can study their architecture. There are mills in the
Stroud Valley admirably designed in the Georgian manner, with well-
proportioned windows divided into small panes, stone-slated roofs,
and stone walls, innocent of soot and now golden with time. Built of
local materials, they harmonise well with their surroundings. The
same may be said of a few Yorkshire mills, though for the most part
they have been blackened with smoke and are more austere.
Standing by some deserted building of this type, its great wheel
disused and its windows broken, in a lonely valley with only the noise
of the stream audible, one always thinks of the machine-breakers in
Charlotte Bronte’s Shirley, a grim incident of the countryman’s fight
against progress.
But even if an occasional example of these old factories has some
vestige of architectural merit, nearly all of them were unsuited to their
purpose. It does not seem to have occurred to their builders that a
“mill” existed for any object beyond the grinding of the last penny out
of the sweated men and women and children whom it housed. Light,
warmth, decent sanitary conditions—all were utterly ignored. It is
hardly to be expected that the slave-drivers of early Victorian days
would produce buildings of any interest, and in fact the great gaunt
prison-like boxes that desecrate so many Yorkshire and Lancashire
hillsides are a very fair expression of that greedy scramble for money
that has caused such a backwash in our own day. For it must not be
forgotten that some of the most beautiful places in England were
violated in this way. Many people have never visited our northern
counties, which they regard as a foreign land, yet which contain
scenery at least comparable with anything south of the Trent.
But if one takes, for purposes of comparison, the two valleys in
which the ruined abbeys of Fountains and Kirkstall now stand, one
obtains a very fair illustration of the effects of industrialism. They are
only some twenty miles apart, they were founded by monks of the
same Order at about the same time, and in their original state they
must both have been attractively situated. The modern visitor to
Fountains, as he rounds the bend that has hitherto concealed the
Abbey, invariably gasps at the beauty that bursts upon him, for here
a nobleman’s park protects the site and no coal or iron lies near. But
Kirkstall is blackened and overcast by the huge ironworks that sprawl
over the adjoining hillside, a sooty mass of tumbledown sheet-iron
sheds, bristling with tall chimneys belching out smoke; and the river
that formerly fed the monks with trout is now covered with an evil-
smelling and iridescent film of factory waste.
Yet, many and various as were the insults heaped upon rural
England by “captains of industry” in the good old days when England
was making money hand-over-fist, they sink into insignificance
compared with the early Victorian achievement in housing. The
golden age of self-help, philanthropy, missionary enterprise,
evangelical zeal, individualism, and all the rest of it, produced the
“back-to-back” house. The meanest streets of the East End, the
worst slums of our Northern and Midland cities, were built while the
Romantic Revival was in full swing and while Ruskin was lecturing
on the Seven Lamps that he had discovered hanging in Venice. The
wind sown in those prosperous days is quite clearly producing a
whirlwind for us to reap in more difficult times, and one recalls
another text about the sins of the fathers. This is not a faddist or an
extreme view. Mr. G. M. Trevelyan, in his new History of England (p.
683), writes of “the ever-advancing bounds of the realm of ugliness
and uniformity, in its constant destruction of the beauty and variety of
the old pre-industrial world. Indeed the more prosperous and
progressive the country was, the more rapidly did that increasing
work go forward.” And he quotes the grave words of another critic:
“The Nineteenth Century did not attack beauty. It simply trampled it
under foot.”
Proceeding with our examination of the various symptoms for which
we shall eventually have to prescribe, let us now consider what are
the shortcomings of the houses built for the people in the early and
mid-nineteenth century, and more particularly how they have
affected the appearance of our countryside. In themselves they
were, as a rule, either entirely sordid, or both sordid and pretentious.
The former were erected by manufacturers and colliery-owners in
long rows to provide shelter for their “hands” at the minimum price,
the latter were more often the work of that public benefactor known
as the “jerry-builder,” and were erected as a speculation. In the
former case the tenants had no option but to accept what was
offered, so paid the rent required and occupied the house without
demur. The jerry-builder’s houses, on the other hand, had to attract
tenants, hence the pretentious element was introduced in order to
ensnare the tenant’s wife. In those days, nearly all small property
was held on weekly rentals and architects were hardly ever
employed to design cottages or small houses.
But the houses had to be designed somehow, so the builder had
recourse to sundry manuals or copybooks of designs for “Villas and
Terrace Houses” in the worst style of the day. The idea of using such
books originated in the second half of the eighteenth century, when
numerous little calf-bound volumes appeared, but they contained
little more than details of the Roman “Orders,” and such features as
chimneypieces, doorways, etc. The result was that the speculative
builder, who made his first appearance about that time, continued to
build in the traditional manner, but added a classical porch and
interior panelling and similar trimmings, which, even if they were
often rather pedantic and un-English, were always in excellent taste.
The nineteenth century copybooks sprang from a very different
source. “Gothick” architecture, for two centuries a byword and a
reproach among all cultivated people, had been rediscovered. From
Queen Victoria’s coronation to her jubilee, architects romped over
Europe and brought home sketches of Gothic detail from France and
Flanders and Venice. Ruskin, who was not greatly enamoured of
English Gothic, but loved it in its French and Venetian forms, spread
the glad tidings among the middle-class; and the famous architect,
Street, ransacked Italy and Spain in his quest. All this mass of
drawings was broadcast over the country at its period of greatest
industrial prosperity. Once I worked in a provincial office facing a
replica of a Venetian palace, and witnessed the erection of a factory-
chimney copied from Giotto’s campanile at Florence.
Naturally the smaller fry in the building world aped their betters.
Second-rate architects and hack draughtsmen set to work to adapt
and caricature these fashionable forms for use by the builder on
shops and villas. Terra-cotta manufacturers gladly joined in the
game, so that soon scraps of Venetian carving and ornament came
to be turned out by the mile and capitals copied from French
churches were moulded in artificial stone in tens of thousands. To
this movement may be ascribed a very large share in the
deterioration of English towns and even villages, for the “Gothic”
craze naturally spread from the centres of fashion to the smaller
places. A travelled and studious architect, set down in a street of
suburban villas to-day, should be capable of tracing the ultimate
source of the pretentious porches, the tile cresting on the roofs, all
the mechanical ornament reproduced down the row; and in nearly
every case he could derive it from a Gothic church in France or Italy.
The sad thing is that these revived ornamental forms were only a
travesty of the old. Gothic architecture was, perhaps, the highest
form of natural and legitimate building that the world has ever seen:
as adapted by the speculative builder, it had no structural meaning
whatsoever, and consisted in mere chunks of crudely caricatured
ornament, generally misapplied. Ruskin preached truth and honesty
in architecture; but his pigmy disciples missed the whole spirit of
Gothic. The barns and cottages of old England represent that spirit
as well as the French cathedrals and Venetian palaces on which he
concentrated with such disastrous effect, yet the English village has
suffered terribly from the Gothic revival.
For the movement spread to village shops and banks, and, of
course, all new churches erected after 1830, or even earlier, followed
the new fashion. Because every old village already possessed a
parish church, now becoming too large for its needs, there was little
for the Church of England to do outside the towns, though there are
many cases such as that at M—— in Middlesex, where an amateur
effort in church-design by the saintly William Wilberforce, just a
century ago, has ruined a beautiful old village highway. But the
Nonconformist bodies, now flourishing and sometimes even wealthy,
were not to be outdone in the race: so they abandoned the stark
galleried chapels, that had hitherto followed the Protestant type
invented by Wren for his City churches, for an ambitious and often
flamboyant variety of “Gothic” that has created a discord in many a
village street. There seems to have been a prevalent idea that every
place of worship must be decorated with a spire, with tracery, and
with a quantity of ornamental features, quite regardless as to
whether funds permitted of a single one of those features being
worthily executed, whether any of them symbolised the entirely
English and healthy movement that produced Nonconformity, or
whether they harmonised with surrounding buildings. Our final
conclusion must be that the Gothic Revival, which, in the hands of a
man like William Morris, who loved England passionately, might have
done so much to save her countryside, was in fact largely
responsible for its defacement.
Another characteristic of this singular movement was its utter
disregard of what we now call “town-planning.” When Ruskin advised
his audience to treat railway-stations as “the miserable things that
they are,”[2] because he disliked railways, he seems to have been
voicing the spirit of his day, which was quite content to speculate on
the symbolism of a piece of carving in a remote foreign city while
men continued to build the most appalling slums. No town was
“planned” in those days: it “just growed.” Occasionally a
manufacturer like Sir Titus Salt coquetted with the idea of a rational
lay-out for a town, but no scheme got very far until the idealist
founders of Bournville and Port Sunlight inaugurated a new school of
thought, proving effectually that good housing was not necessarily
bad business.
At the present time, when authorities on town-planning have long
made it clear that orderly development is both desirable and
practicable, the haphazard growth of suburbs into the country is a
deplorable and even a painful sight to every intelligent person.
English individualism, sometimes an asset, becomes almost a curse
when it interferes, as it still does, with nearly everything that can be
done to save the English countryside from complete uglification.
Consideration of the possibilities of town-planning in this direction
must be deferred to our last chapter; for the moment let us consider
one or two characteristics of nineteenth-century town growth.
Almost without exception, any man could buy a plot of land
anywhere, and build on it anything he wanted. Tripe-dressing,
sausage-skin making, and one or two other “noxious” trades might
be prohibited in a few favoured localities; the obscure and often
absurd law of “Ancient Lights” occasionally restrained his ardour.
Otherwise, so long as his building was strong enough to remain
standing, and provided with adequate means of drainage, he was as
free as air. Building was essentially a commercial business; the
rights or needs of the community did not enter into the question.
Each man built for his day and generation: the future was left to take
care of itself. Yet even from a financial point of view this was a short-
sighted policy. When Wren’s plan for rebuilding London was upset by
vested interests, a chance was lost of making wide streets that are
now urgently necessary but cannot be formed except by payments of
incredible sums for compensation. A more modern instance is to be
seen in the Euston Road, which was a residential thoroughfare
looking over fields when my grandfather knew it a century ago. Then
shops came to be built over the front gardens as the old residents
fled from the invading streets: and now these shops have to be
swept away with heavy payments for compensation to allow the road
to be converted into the great artery that any intelligent person could
have foreseen when it was first built. This phenomenon is not
peculiar to towns: it applies with equal force to the country districts
that are continually being absorbed by towns. Half the squalor of
modern suburbs is due to indiscriminate development. Trees are cut
down and houses are run up along a main road. Traffic increases,
and the tenants move away. The houses are clumsily converted into
inefficient shops, extending over the front garden, or into seedy
inefficient tenements. Empty plots are covered with hideous
hoardings. Without undue interference with the liberty of the subject,
much of this feckless muddling could be avoided by the exercise of a
little rational foresight.
For this is a question deeply affecting the whole community, not a
petty professional grievance. The mad race from towns to the fringe
of the country is destroying the country for miles round: and the
pathology of destruction is now clearly understood. A brilliantly
realistic description of the growth of “Bromstead,” a typical London
suburb, is to be found in Mr. H. G. Wells’ The New Machiavelli. All
who have witnessed the slow spread of this malignant disease will
agree that he does not overstate the case.
IV
THE AGE OF PETROL (1910
ONWARDS)
IT may well be objected that this is a mere journalese title, for the
influence of motoring on the appearance of the countryside is not
always apparent, and many other factors have been at work, among
them the Great War and its considerable legacy of troubles.
Moreover, some readers may point out that motor-cars were to be
seen in England long before 1910. That is true; but they did not
appreciably alter our countryside before that date, and the number of
them was relatively small.
The most obvious influence that motoring has exerted on England
has been in the direction of road “improvements,” especially since
the War. Few of us foresaw that the clumsy and not very speedy
vehicles which made their first appearance on our highways some
thirty years ago, preceded by a man bearing a red flag, would
eventually cause so radical a change in our ideas of the nature of a
road. For a long time nothing happened. As motors increased in
number and speed and bulk, they continued to become more and
more of a nuisance to the cyclists and pedestrians and horse-drawn
vehicles still forming the majority of road-users. Clouds of dust
whitened the hedges, and choked the inhabitants of all houses
anywhere near a main highway. Accidents became frequent. All this
was unavoidable, because even the best roads made by Telford and
Macadam were unequal to the new conditions, and the far larger
number of narrow winding country lanes were altogether inadequate
for the strain that was now put upon them. An excellent instance of
the resulting state of affairs may still be seen in the Isle of Wight,
where several of the “main” roads are tortuous narrow lanes sunk
between high banks topped with thick hedges. In the summer
months a stream of huge charabancs tears over the whole island
every day. At many places there is no possibility of these
Juggernauts passing each other. Even a hay-cart presents such a
complete obstacle that one or other vehicle has to back till the road
widens, and in places the blockage caused by the charabanc forces
a cyclist or a pedestrian to climb up on to the steep grassy bank
while the monster with its cargo of yelling hooligans pushes past
him. Either roads must be widened almost everywhere or motor
vehicles of all types must be abolished, and, as the latter alternative
is out of the question, we must accept the former as inevitable. How
it may be effected with the minimum of damage to the beauty of our
countryside will be discussed in the next chapter. England has not
yet sunk to the level of the Western States, where it is a simple
matter to shift a barbed-wire fence a few yards back on each side of
the furrows that do duty for a road, and where the iron or wooden
shacks that constitute a “home” may readily be wheeled to a new
site on the prairie. England is a crowded little country full of sacred
associations that go back to the beginnings of our race, and that is
why we hate to see crazy new bungalows lining the Pilgrim’s Way.
Their very appearance is an insult to our English sense of
orderliness and decency, such as we should feel if a negro
cheapjack started selling mouth-organs in Canterbury Cathedral.
In some parts of the country there are stretches of road that can be
widened without material defacement of the landscape, but they are
few. Ancient landmarks hamper progress in most places. Old
bridges, for example, are altogether unsuited to heavy and fast
motor-traffic. Often built askew with the line of a main road, they are
nearly always very steep, very narrow, and, though often sturdy in
appearance, are incapable of bearing the weight of a heavy lorry and
trailer moving with the speed of a railway train. Here again is a
problem requiring solution. Some people would attempt to adapt the
old bridge to modern needs, others prefer an entirely new structure
placed parallel with the old one, and, of course, the third alternative
is complete demolition. The first method is generally impossible, and
there is much to be said for a frankly modern design in reinforced
concrete, provided that it does not stand in too close proximity to the
ancient monument that it supersedes.
Another familiar rural feature that must perforce give way to the
insistent needs of the motorist is the ford or “watersplash.” Much as
we may regret its disappearance, it has to go.
But most difficult of all is the question of dealing with the narrow High
Street of a town or village through which a main artery passes.
Occasionally the jerry-builder has anticipated us here, and has
erected some terrible Victorian nightmare of a shop right up to the
old building-line of the historical cottages that he has demolished. In
such a case the children of the Petrol Age may be able to expiate the
sins of their fathers by pulling down that shop. But more often there
is a building of real merit standing at the very bottleneck through
which the procession of traffic has to squeeze its way, such as the
old church at Barnet or the Whitgift Hospital at Croydon; and then we
are in a quandary, impressed on the one hand by the legitimate
needs of our time, deterred on the other hand by an almost religious
sense of the sanctity of the past. Sometimes the obstacle is a mere
cottage, a barn, a pump, a stone cross, or a quaint structure such as
blocks Hampstead Lane near the Spaniard’s Tavern, yet even these
must be treated with respect. The “by-pass” road, as suggested in
the next chapter, is sometimes the best solution, but is not
practicable everywhere. And lastly, there are the trees. As I write
these lines I can hear the crashes of falling elms and yews that I
have known since childhood. A snorting tractor is pulling them down
bodily with a steel hawser, so that the grass-lined lane that runs near
my home may be widened for the growing needs of what was once a
pretty village.
But a wide straight road does not exhaust the motorist’s
requirements. He becomes thirsty at times, and the village inn has
already risen to the occasion, usually, it must be admitted, without
detriment to the village street. The architecture of licensed premises
is looking up. His car also becomes thirsty, (hence the petrol-station),
and its occasional liability to gastric trouble involves the provision at
frequent intervals of telephone-cabins and repair-shops or garages.
We may profitably consider the design of these accessories and their
relation to country surroundings in the next chapter. The phenomenal
development in the use of motor charabancs has involved the
provision of extensive “parking-places” in all pleasure resorts, e.g., at
Brighton, where a large part of the sea-view from the Esplanade is
blocked. The provision of a “park” at Glastonbury has led to an
outcry recently, and everywhere the problem is pressing.
Finally comes the very vexed question of housing, municipal and
private, that has grown so acute since the War. In this movement the
motorist has played a prominent part, for he has helped to extend
the “Housing Problem,” from its obvious location on the fringes of our
towns, away to the remoter parts of the country. From Kent to
Hampshire the bungalows line our southern cliffs. Housing needs
may be divided into three groups: those of the townsman, the rustic,
and the week-ender. The first concerns us here only to the extent
that new housing in urban districts must of necessity be provided in
the adjoining rural areas: thus London is now so congested that its
County Council has had to acquire large estates in Essex, Kent, and
Middlesex to provide houses for city workers, who are quite properly
dissatisfied with the tenement-dwellings that are their only
alternative. Then, although in many country districts the population is
decreasing, new standards of decency impel the newly-wed to
demand something better than the leaking and verminous hovels
where their parents dwell. All these new houses, whether in country
or town, have been provided in increasing proportion by municipal
enterprise since the War, and hence their design is subject to a
measure of control. Whether that control is sufficient to ensure a
tolerable standard of architectural expression is a matter for further
consideration: at this point it is important to realise that practically all
the post-War “Housing Schemes” have been scientifically laid out on
rational lines, with due regard for the future. It is that central control,
whether exercised by a public body or by a properly constituted
private organisation, which makes all the difference between the
“lay-out” of Becontree or Port Sunlight on the one hand and an
average bungalow settlement on the other. One is a design, the
other an accident,—and the Italian word for “accident” is disgrazia!
Some sixteen years ago I endeavoured to interest the inhabitants of
the district where I live in the possibilities of the then newly-passed
Town-Planning Act. The more enlightened among them readily
responded, but there were some who said that this was a rural area
and that they had no wish to see it turned into a town. Since then it
has turned itself into something resembling a town, but its growth
has been spasmodic and irregular. A few years later came a
proposal to acquire two fields in the centre of the district for a public
park. Again the objectors appeared; what does a semi-village need
with a public park, at a high price too? Fortunately the fields were
acquired, and already they are nearly encircled by building plots.
Meanwhile a great Arterial Road has been driven right across the
new park, cutting it in half and reducing its attractions. Under a
proper town-planning scheme such things would be impossible.
Roads and parks would be laid out on paper years before they were
required; and, though modifications of the first plan would become
necessary from time to time, the ultimate gain would be enormous.
Groups of adjoining authorities are already preparing regional town-
planning schemes in concert, so that trunk roads may be provided in
such a way as to pass through each area to its benefit and not to its
detriment. If “Rusticus” stands too long while the river flows by, as
the quotation on my title-page suggests, he will find the countryside
engulfed.
In my last chapter something was said of the possibilities that the
new science of Town-planning has to offer us, as a result of many
years’ experience and experiment. We have seen the appearance of
innumerable municipal housing-schemes, of “Satellite Towns” like
Letchworth and the new Welwyn, of model industrial communities
like Bournville and Port Sunlight, of communal efforts like the
Hampstead Garden Suburb, of many admirable achievements in the
developments of private enterprise. Originating at the time (1876 et
seq.) when Bedford Park was laid out, the idea developed slowly
before the War and has made great strides since. It is one of the
brightest spots in the history of English progress, but it has not been
sufficient to stem the rush of ersatz building that followed the War.
For it is the bungalow craze, with all that it now implies, which has
most seriously damaged the appearance of rural England during the
last eight years. There is nothing inherently unpleasant in the
bungalow type of house. Properly designed and constructed, it may
be made a thing of beauty harmonising perfectly with its
surroundings. But, to my mind, its advantages have been grossly
exaggerated. On the count of cost, the primary consideration
nowadays, it shows no superiority over the two-floor house;
reasonable privacy for its bedrooms is secured with difficulty; and it
is apt to sprawl over the ground. One cannot quite realise why it has
been so much favoured in recent years; possibly it is merely a
transient fashion, like face-powder or crinolines. There was a great
and a genuine demand for houses after the War, which had to be
satisfied. Nine people out of ten took what they could get, and they
got bungalows. For the most part their ménage consisted of
husband, wife, and a two-seater. Neither servants nor children
entered into the picture. There was a prejudice against everything
connected with the pre-War period, especially with its social
distinctions, and perhaps the ex-service man sought for the
antithesis of the suburban villa. Accustomed for four years to scenes
of ruin and to leaky Army huts, his mind readily accepted the slap-
dash bungalow with its familiar barbed-wire fence and no-man’s-land
of a garden. The effect of flimsiness and impermanence that
characterises so many of these little buildings may be ascribed to
three causes: the difficulty of paying for a house and a car out of an
income that only provided a house before the War, the prevalent
restlessness which almost rejects the idea of settling down in one
place and letting oneself “take root,” and the insidious hold that the
architecture of dumps and sheds had gained on the average man’s
mind in 1914-18. His two-seater carried him out into what was (at
first) the peace of the country, where land was cheap. Run up at
express speed to satisfy an enormous demand, these bungalows
spread out for miles along the roads adjoining the towns, thus
avoiding the road-making charges that have to be met on an
ordinary estate. And next this “ribbon” development continued far out
into the country, so that people who had a slight surplus after
meeting their hire-purchase payments for car and furniture could
enjoy a sight of the sea on Saturday and Sunday from a bungalow
perched on the Sussex cliffs. Thus this singular movement has had
its main effect in rural districts, whose little Councils, with their often
rudimentary by-laws, find the problem almost beyond their power to
solve.
For these bungalows are for the most part designed without
knowledge or taste, without regard to the tradition of English
architecture or the claims of the English landscape. They are
generally built of flimsy machine-made materials, largely imported
from abroad. Yet they have satisfied a perfectly legitimate demand
for accommodation, they have been erected honestly by builders
and paid for by their owners, and they have so far complied with the
laws of the land that they have earned a Government “subsidy”
towards their cost. Hence the bungalow, which many of us regard as
the motorist’s least acceptable gift to the countryside, constitutes a
topic which must be criticised with extreme tact and caution.
There must be many beauty-spots in England that have been spoilt
by motorists and charabancs since the War, but as a fair case one
may cite X—— in Romney Marsh. A few years ago this was an
artists’ paradise and a haven of peace. It has now become a glorified
bus-park, where one is surrounded by petrol-pumps, garages,
blatant exorbitant cafés run by loud-voiced aliens, “souvenir” shops
full of Brummagem and German products, ice-carts, and
innumerable direction-posts to “ladies’ cloak rooms.” All the charm of
the place has gone in bribes to the tripper, and when he tires of it the
ugliness will remain. When one sees a beautiful village or landscape
prostituted to such ends, one wishes that the petrol-engine had
never been invented.
But is ugliness an inevitable concomitant of motoring? Last April it
was my good fortune to travel some 200 miles over the main roads
of Tuscany. In that considerable distance I saw not a single petrol-
station, and hardly a poster or a hoarding. The petrol-pumps must
have been there, but at any rate they were not obtrusive enough to
attract notice. Some people may say that the apparent absence of
these accessories of civilisation furnishes an additional proof of
Italian backwardness, others that the iron hand of Mussolini prevents
progress; but to me, as a lover of Italy, it is a satisfaction that she
has contrived to reconcile the legitimate needs of to-day with the
beauty of her countryside.
V
THE FUTURE
THE first part of this little book described rural England as it existed
in its unsullied perfection, the second part the regrettable changes
due mainly to the use of coal and petrol, and now we have to
consider what prospect there is of saving the best of the old and
making the best of the new. If “Rusticus” desires to preserve the
remainder of his heritage, he must adopt some bolder policy than
that of gazing at the flowing stream. Nor will the tactics of Canute
serve his purpose: the tide of “civilisation” will not stop for him. There
is every indication that it will flow with undiminished velocity in the
coming years.
Our efforts must therefore be directed to two objects: the
preservation of such relics of the past as are of recognised worth,
and the regulation of all tendencies that are harmful to the beauty of
the countryside. It is heartening to see, in the recent formation of the
Council for the Preservation of Rural England, some public
expression of interest in this vital matter. Without presuming to offer
suggestions to so august a body, it is my purpose to set down in
order the chief factors in the situation, present and future.
In a previous passage it has been remarked that ruin as such is a
matter for regret, not for admiration. One might go a step further and
say that old buildings are not necessarily good buildings. Strictly
speaking, that is true, but is also dangerous doctrine. Nearly all old
buildings are good buildings, and when we find one that we are
disposed to reckon as bad, we must not forget that the canons of
architectural taste have always been fickle. In the eighteenth century
Gothic buildings were ridiculed, and were treated accordingly. In the
nineteenth, taste was completely reversed. On the other hand,
certain architects of the Gothic Revival were so enamoured of a
special variety of Gothic that they endeavoured to remould all old
churches of any differing period nearer to their hearts’ desire. Hence
the formation in 1877 of that body which is familiarly and even
affectionately known as the “Anti-Scrape,” more precisely as the
Society for the Protection of Ancient Buildings. It was founded by
architects and others to protest against excessive zeal in
“restoration” by architects and others, and has done a noble work. It
is still maintained partly by architects, whose disinterested efforts in
preserving old buildings are worthy of note because architects
naturally depend for their living mainly on new buildings. As its
headquarters are in London, its work in other centres is most
effectively done through the medium of a local committee. The
essential qualifications for such a committee are taste and
disinterestedness. Suppose that an old cottage or barn on a village
street in Blankshire is threatened with demolition. If the matter is
brought to the notice of the Blankshire local committee by any self-
appointed (even anonymous) “informer,” that committee will offer an
opinion, backed by the expert advice of the S.P.A.B., who may be
able to suggest some alternative to demolition. Their knowledge of
the technical details of restoration is unrivalled, especially as regards
building materials suitable for use in an old structure. If the cottage is
older than a.d. 1714 and of sufficient merit, the aid of the Ancient
Monuments Commission may be invoked. Once such a building is
scheduled as an “ancient monument,” the owner is deprived of his
right to demolish or alter it, and its existence is safeguarded by the
Government. Another means of frustrating base designs on an old
building is to appeal to the National Trust for Places of Historic
Interest or Natural Beauty, who may be induced to launch an appeal
through the Press for funds to purchase it. At present they maintain
over twenty buildings, including some which are of literary interest
(e.g., Coleridge’s cottage) rather than of great antiquity. A third
alternative is to enlist the sympathies of a local authority or a local
philanthropist. In any case the delay in demolition caused by creating
an outcry will serve a useful purpose, for a thoughtless owner may
be led to reconsider his original intentions, and by so doing may find
that the building may be preserved after all. The restoration of old
buildings is much more practicable than any yet discovered use of
monkey-gland is to old people. But of course there are cases,—and
sentimentalists are apt to overlook this fact,—where an old building
has no architectural merit, and simply must give way before the
march of progress. It is difficult, too, to see how a man can be
compelled to maintain a disused windmill. It may be added that
bridges are among the “buildings” scheduled as “Ancient
Monuments.”
As regards natural features, it must be generally known that the
National Trust, already mentioned, has been very active during
recent years in acquiring and preserving all manner of beauty-spots
in England, including such various sites as the mountains of the
Lake District, strategical points on the North and South Downs, river
banks, hill-tops and cliff-tops all over the country. Unfortunately the
era of enclosing commons is not yet over, and another organisation
—the Commons and Footpaths Preservation Society—was founded
in 1865 to further the excellent objects indicated by its title. It saved
Epping Forest, Hampstead Heath, Wimbledon Common and many
other familiar places for us, and continues to watch over the interests
of all lovers of the country. But, like the other societies mentioned
here, its activities are limited by its funds. However, we must
remember that any district which has adopted a town-planning
scheme can now invoke the majesty of the law to save its open
spaces and natural features, for the first Schedule of the Town-
Planning Act of 1925 includes a reference to “the preservation of
objects of historical interest or natural beauty.”
There have been many recent agitations—notably in regard to Ken
Wood, the Seven Sisters, the Devil’s Dyke, and the Darenth Valley—
which have shown that, in the last extremity, the public will
sometimes rise to the occasion when a beauty-spot is threatened.
Considering the narrowness of the average village High Street, and
the concentration of its historical relics in its centre, there is much to
be said for the construction of a “by-pass” road to carry through
traffic round the village. Otherwise the village green, the pond, the
stocks, the inns, and nearly all the old landmarks would have to go.
Traders object in the case of the larger towns, but vested interests
always turn up somewhere, and it seems fairly certain that the “by-
pass” road meets the needs of the greater number besides

Download ebook Roceeding Of 5 Th International Conference On Recent Trends In Engineering And Technology Icrtet2016 Volume 1 Computer Engineering Information Technology Civil Engineering Pdf full chapter pdf

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Download ebook Roceeding Of 5 Th International Conference On Recent Trends In Engineering And Technology Icrtet2016 Volume 1 Computer Engineering Information Technology Civil Engineering Pdf full chapter pdf

Uploaded by

Copyright:

Available Formats

roceeding of 5 th International

Conference on Recent Trends in

McGraw Hill Education (India) Private Limited

McGraw Hill Education Offices

Managing Director: Kaushik Bellani

Prof. M. A. Mechkul E & TC Engineering Track Chair

Prof. Mrs. K. R. Nirmal Information Technology Member

Prof. M. A. Ahire Mechanical Engineering Coordinator

Prof. K. S. Tated E & TC Engineering Coordinator

Publicity- Web Prof. P. N. Achaliya Information Technology Member

Prof. P. M. Bora Mechanical Engineering Coordinator

Mr. S. N. Ghuge Office Member

List Reviewers for Computer Track

Prof.Milind Bhandare (Assistant Professor Department of Computer Engineering Late G. N. Sapkal

Prof.Nana Zalte(Assistant Professor Department of Computer Engineering Late G. N. Sapkal College of

Dr. Suhasini Madhekar (College of Engineering, Pune)

Dr. Ishwar Sonar (College of Engineering, Pune)

Dr. Pravin Chaudhari (VJTI, Mumbai)

Dr. Ushadevi Patil (DY Patil College of Engineering Ambi, Pune)

Dr. Suman Jain (Sinhgad College of Engineering, Pune)

Dr. Deepa Joshi (DY Patil College of Engineering, Pimpry, Pune)

Prof. Vaishali Dawari (College of Engineering, Pune)

Prof .Vilas Patil (KKWIEER, Nashik)

Prof. Jyoti Bhusari (Sinhgad College of Engineering, Pune)

Prof. Suhas E. Tayade (MET Institue of Engineering, Nashik)

Prof. Upendra Saharkar (DY Patil College of Engineering Ambi, Pune)

Prof. Rajanikant Devalkar (NDMVPS, KBGT COE, Nashik)

Prof. Hemant Salunkhe (DY Patil College of Engineering Ambi, Pune)

Prof. Yuvaraj Bhirud (SNJB’s LSKBJ COE, Chandwad, Nashik)

Prof. Sadhana Pawar (SNJB’s LSKBJ COE, Chandwad, Nashik)

Prof. Pradeep Yeole (SNJB’s LSKBJ COE, Chandwad, Nashik)

Prof. Renuka Binayke (SNJB’s LSKBJ COE, Chandwad, Nashik)

Prof. Lalit Pawar (SNJB’s LSKBJ COE, Chandwad, Nashik)

Prof. Vinod Pandit (SNJB’s LSKBJ COE, Chandwad, Nashik)

On behalf of ICRTET’2016 organizing committee, we wish to thank all the members

18 Summarization of Multiple User Reviews in Text Domain 89

61 Sketch Based Image Retrieval 298

V.R. Rathi , Dr.C.D.Modhera

II. PROPOSED RELIABLE POWER AWARE ROUTING SCHEME

2.1 Algorithm for Route Discovery process in RPAR

Fig. 1 Reliable Power Aware Routing Scheme

2.2 Residual Energy Model

The energy consumed ec(T) by a node after time T is calculated as

IV. RESULTS AND DISCUSSION

4.1 Network Lifetime

Fig. 2 Group size nodes verses Network Lifetime

4.2 Energy Consumption

Fig. 3 Erms for different time instances

II. LITERATURE SURVEY

1��A Secure ��������������������������������������������

3.1 System Modules

3.1.1 Data Owner Module

3.1.2 Connector Module

3.1.3 Cloud Server Module

3.1.4 Remote User

Fig.1 Architecture of Secured Authorized Deduplication

[1] Jan Stanek�, Alessandro ���������������������������������������������� ���������������

Fig. 1 Levels of Security

II. PROPOSED SYSTEM

Fig.2 Traditional Online System

Selection of HMM is Apply Steganography

Verify The Payment

Fig. 3 Proposed System

2.1 Hidden Markov Model (HMM)

1��A Secure ��

[1] Jan Stanek�, Alessandro ��

��In this technique , propose a priority-