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
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
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
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
Engineering and Technology
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
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
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
Engineering Chandwad)
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
Engineering Chandwad)
Prof. D. R. Agrawal (Assistant Professor Department of Computer Engineering SNJB’s KBJ College of
Engineering Chandwad)
Prof. P. S. Desai (Assistant Professor Department of Information Technology SNJB’s KBJ College of
Engineering Chandwad)
Prof. R. R. Bhanadari (Assistant Professor Department of Computer Engineering SNJB’s KBJ College of
Engineering Chandwad)
Prof. D. S. Rajnor (Assistant Professor Department of Computer Engineering SNJB’s KBJ College of
Engineering Chandwad)
Prof. K. R. Nirmal (Assistant Professor Department of Information Technology SNJB’s KBJ College of
Engineering Chandwad)
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
Engineering Chandwad)
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
Engineering Chandwad)
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
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.
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
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
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
1
Asst. Prof., Department Of I.T., JDIET Yavatmal, India, [email protected]
2
Professor, Department. Of CSE. JDIET Yavatmal, India, [email protected]
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.
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.
� 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
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.
In order to evaluate the network performance, it uses the metrics such as network lifetime & energy
consumption.
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.
4 Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016)
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.
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.
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 5
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�������������������������������[email protected]
2
Department of information Technology�������������������������������[email protected]
3
Department of information Technology�������������������������������[email protected]
4
Department of information Technology�������������������������������[email protected]
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].
��������������������������������������������������������������������������
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]
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.
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.
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.
8 Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016)
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.
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.
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 9
REFERENCES
1
Department of Information �����������������������������������������[email protected]
2
Department of Information ������������������������������������������[email protected]
3
��������������������������������������������������������������������[email protected]
4
��������������������������������������������������������������������[email protected]
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
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
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 11
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
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.
Account Information
Transfer of Verification In Submit &
Fund Checking In
Bank Payment Gateway
�� ������� ������� ������ ��� �� ����� 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.
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.
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 13
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, [email protected]
2
Department of Computer Engineering, Late G.N.Sapklal COE, Nashik, [email protected]
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.
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 15
����� ���� ���� ���� ��� �������������������� ��� ����� ���������� 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.
16 Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016)
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.
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
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.
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 17
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.
18 Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016)
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, [email protected]
2
Department of Computer Engineering,LGNSCOE Nashik, [email protected]
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
20 Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016)
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]
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
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 21
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]
their corresponding clusters and there is no need of re-clustering until any of the nodes deplete completely
its energy.
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.
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
Proceeding of 5th International Conference on Recent Trends in Engineering & Technology (ICRTET’2016) 23