Proceedings of International Conference on

Advancements in
Engineering and Technology
(ICAET-2015)
Proceedings of International Conference on
Advancements in
Engineering and Technology
(ICAET-2015)
March 20–21, 2015

[ISBN: 978-81-924893-0-8]

Editors
Prof. (Dr.) Tanuja Srivastava
Dr. Shweta Rani
Dr. Anuj Kumar Gupta
Mr. Manoj Kumar Gupta

Organized by

Bhai Gurdas Institute of Engineering & Technology

Main Patiala Road, Sangrur–148001 (Punjab), India
www.bgiet.ac.in
(An NBA Accredited Institute)
 ORGANIZING COMMITTEE

Chief Patrons
Sh. H. S. Jawandha
Chairman, Bhai Gurdas Group of Institutions, Sangrur

Prof. (Dr.) Guninderjeet Singh Jawandha

Dean Colleges & Executive Member, BGGI, Sangrur

Patron & Coordinator

Prof. (Dr.) Tanuja Srivastava

Director, Bhai Gurdas Institute of Engg. & Technology, Sangrur

Convener

Dr. Shweta Rani

Co-Convener

Dr. Gurmeet Singh Cheema

Dr. Anuj Kumar Gupta
Er. Amardeep Singh Kang

Organizing Secretary
Mr. Manoj Kumar Gupta
Er. Sushil Kakkar
Er. Divesh Kumar
Er. Abhinash Singla
Er. Randhir Singh
Dr. Arun Kumar Singh

Executive Members

Dr. Ravi Kant

Dr. Satnam Singh
Mr. Jatinder Rattan
Er. Amandeep Kaur Randhawa
Er. Parminder Pal Singh
Er. Manuraj Moudgil
Er. Simarpreet Singh
Mr. Kamaljit Singh
 INTERNATIONAL ADVISORY COMMITTEE

Prof. Worsak Kanok-Nukulchai

President, Asian Institute of Technology, Thailand

Prof. Christos Christodoulou

University of New Mexico, Albuquerque

Prof. M. Affam Badar

Indiana State University, USA

Prof. Yehia Hadded

University of Ottawa, Canada

Prof. Om Parkash Yadav

Wayne State University, USA

Prof. Gauri S. Mittal

School of Engineering, Guelph

Prof. Xiao-Zhi Gao

Aalto University, Finland

Prof. Nitin Tripathi

Asian Institute of Technology, Thailand

Prof. Mushtak Al-Atabi

Taylors University, Malaysia

Dr. Ravinder Chutani

University of Franche Comte, France

Dr. Mohd. Nazri Ismail

University of Kuala Lumpur, Malaysia

Dr. Huynh Trung Luong

Asian Institute of Technology, Thailand
 NATIONAL ADVISORY COMMITTEE
Prof. Pawan Kapur
Director, PIT, Rajpura
Prof. Buta Singh
Dean Academics, PTU, Jalandhar
Prof. A. P. Singh
Dean RIC, PTU, Jalandhar
Prof. S. K. Mohapatra
Thapar University, Patiala
Prof. D.C. Saxena
SLIET, Longowal
Prof. Kawaljit Singh
Director, UCC, Punjabi University, Patiala
Prof. Brahmjit Singh
NIT, Kurukshetra
Prof. P. K. Tulsi
NITTTR, Chandigarh
Prof. Deepak Garg
Thapar University, Patiala
Dr. Amalendu Patnaik
IIT, Roorkee
Prof. S. S. Patnaik
NITTTR, Chandigarh
Prof. T. S. Kamal
Director, Radiant Engineering College, Abohar
Prof. B. C. Chaudhary
NITTTR, Chandigarh
Prof. Rajesh Bhatia
PEC University of Technology, Chandigarh
Prof. Maitreyee Dutta
NITTTR, Chandigarh
Dr. Sunita Mishra
Senior Scientist & Head, CSIO
Dr. Udit Narayan Pal
Senior Scientist, CEERI, Pilani
 MESSAGE FROM CHAIRMAN

With a pledge to make a successful rise in the highly competitive world of engineering
and technology, Bhai Gurdas institute of Engineering and Technology is organizing 3rd
International Conference on Advancements in Engineering and Technology on 20
and 21 March, 2015.

In order to face various emerging challenges in different fronts of engineering and

technology, it has become indispensable to explore multifarious integrated and
interdisciplinary engineering approaches.

I am sure that this conference would serve as a platform to connect various

academicians, researchers and scholars to go beyond borders in search of new
frontiers in researches of the millennium and as well to show case their innovations and
findings.

I wish you success in your deliberations at conference.

S. H.S. Jawandha
Chairman
Bhai Gurdas Group of institutions
 MESSAGE FROM DEAN COLLEGES

With a pledge to make a successful rise in the highly competitive world of engineering
and technology,

Bhai Gurdas Institute of Engineering and Technology is organizing 3 rd International

Conference on “Advancements in Engineering and Technology” on 20 and 21 st March,
2015.

In order to face various emerging challenges in different fronts of engineering and

technology, it has become indispensable to explore multifarious integrated and
interdisciplinary engineering approaches.

I am sure that this conference would serve as a platform to connect various

academicians, researchers and scholars to go beyond borders in search of new
frontiers in researches of the millennium and as well to show case their innovations and
findings.

I wish you success in your deliberations to make the event a event a successful one.

Dr. Guninderjit Singh Jawandha

Dean Colleges
Bhai Gurdas Group of Institutions
 MESSAGE FROM DIRECTOR

With a significant rise Bhai Gurdas institute of Engineering and Technology has taken a
constructive step by organizing 3rd International Conference on Advancements in
Engineering and Technology on 20 and 21 March, 2015.

The theme of the conference indeed attains importance in the millennium as it will help
academicians, researchers and scholars to demonstrate the key issues prevalent in
technological advancements happening worldwide in industrial and manufacturing
sector.

The international Conference was inspired by the need for a platform to address various
emerging issues in engineering. I believe this Conference is essential to all researchers
who will get real opportunities to showcase their research.

I encourage you to make this significant event part of your professional development for
2015 and look forward to welcoming you to the international Conference in the campus.

Dr. Tanuja Srivastava

Director
Bhai Gurdas institute of Engineering & Technology
 MESSAGE FROM CONVENER

It is my privilege and honor to welcome to the 3rd international conference on

advancements in engineering and technology which will be held in 20-21st March
2015.

This conference provides an excellent opportunity to showcase your work and share
your expertise, so we as an international community can move towards developing
national and international priorities for advancements in engineering & technology.

This interdisciplinary conference, will bring together academics, researchers,

administrators, policy makers, industry representative, students, from key government
and non-government organizations from all over the globe to share and enhance
knowledge on latest advancements

This conference will be dedicated to discuss on new technologies that can be

transferred from lab to land for the benefit and welfare of persons in the society.

Thank you for joining in this event and expecting a sound response from you all.

Dr. Shweta Rani

Convener
ICAET 2015
 MESSAGE FROM CO-CONVENER

It is my great pleasure to welcome you to the 3rd International Conference on

Advancements in Engineering & Technology (ICAET-2015) which takes place in Bhai
Gurudas Institute of Engineering & Technology, Sangrur on March 20 – 21, 2015. It
has been a real honor and privilege to serve as the Co-Convener of the conference.

The conference would not have been possible without the enthusiastic and hard work of
a number of colleagues. A conference of this size relies on the contributions of many
volunteers, and I would like to acknowledge the efforts of our committee members and
referees and their invaluable help in the review process. I am also grateful to all the
authors who trusted the conference with their work.

I look forward to an exciting week of insightful presentations, discussions, and sharing

of technical ideas with colleagues from around the world. I thank you for attending the
conference and hope that you enjoy your visit.

Dr. Anuj Kumar Gupta

Co-Convener
ICAET 2015
 MESSAGE

It gives me great pleasure to know that Bhai Gurdas Institute of Engineering &
Technology (BGIET) is organizing its 3rd International Conference on Advancements
in Engineering & Technology (ICAET-2015) for two days on March 20-21, 2015.

The conference will provide a platform to share new research ideas and technological
assets to translate innovations from fundamental research to quality products. I wish the
conference, ICAET-2015, a grand success and congratulate the BGIET leadership for
taking up this noble endeavour.

M. Affan Badar
PhD, CSTM
Professor & former Department Chair
Department of Applied Engineering and Technology Management
Indiana State University, USA
 MESSAGE

I am delighted to know that Bhai Gurudas Institute of Engineering & Technology,

Sangrur is organizing the 3rd International Conference on Advancements in
Engineering & Technology (ICAET-2015) on 20th-21st March, 2015 in its Campus.

I hope that this International Conference is to bring together Academicians,

Researchers and Industry Practitioners from around the globe, working broadly in the
areas of Research & Development and its most important applications, with an
emphasis on informal interactions.

Therefore, this conference will help young researchers to share valuable thoughts with
experienced Academicians & Industry Practitioners on their respective areas of
Research. In the process, they will increase the possibility of collaborating among
themselves in the days to come.

On behalf of PTU, I extend a warm welcome to all the National & International delegates
attending the International Conference and wish that the discussions and interactions
during the conference will help them to enhance their knowledge and provide directions
for future research Work.

I extend my best wishes for the success of the International Conference.

Dr. Buta Singh Sidhu

Dean (Academics)
Punjab Technical University
Jalandhar.
 PLENARY TALKS

Prof. (Dr.) M. K. Surappa

Director, IIT, Ropar

Prof. (Dr.) A. K. Ganguli

Director, INST, Mohali

Prof. (Dr.) Amod Kumar

Director, CSIO-CSIR, Chandigarh

Prof. (Dr.) R. K. Bagchi

Director, NISST, Mandi Gobindgarh

Prof. (Dr.) D. C. Saxena

SLIET, Longowal

Prof. (Dr.) Joseph Anand Vaz

NIT, Jalandhar

Prof. (Dr.) Brahmjit Singh

NIT, Kurukshetra

Prof. (Dr.) Amalendu Patnaik

IIT, Roorkie

Prof. (Dr.) Jitendra Chhabra

NIT, Kurukshetra

Prof. (Dr.) O. P. Pandey

Thapar University, Patiala

Prof. (Dr.) Seema Bawa

Thapar University, Patiala

Prof. (Dr.) S K Gupta

NITTTR, Chandigarh

Sh. Paramjit Singh

RCED, Chandigarh
 CONTENTS

Electronics & Communication Engineering

S. No. Paper ID Paper Title Page No.

Content Retrieval from Historical Manuscript Images: A Review
1. 3 1
Kitty Gupta and Rishav Dewan
Development of Dual Band Planar Inverted-F Antenna for Wireless Applications
2. 4 5
Jashandeep Singh, Sushil Kakkar and Shweta Rani
Power Oscillation Damping and Voltage Stability Improvement Using SSSC integrated with SMES
3. 5 9
Amritpal Singh and Divesh Kumar
Electronic toll collection based on Category of Vehicle Using RFID
4. 9 14
Gurpreet Singh, Amrik Singh and Harpal Singh
Extended local binary pattern for face recognition
5. 13 17
Jatinder Sharma and Rishav Dewan
Analysis and implementation of full adder circuit using Xilinx software
6. 14 22
Girdhari Agarwal, Bobbinpreet Kaur and Amandeep Kaur
Automatic Detection of Diabetic Retinopathy from Eye Fundus Images: A Review
7. 16 27
Manpreet Kaur and Mandeep Kaur
Various Methods of Road Extraction From Satellite Images: A Comparative Analysis
8. 18 33
Atinderpreet Kaur and Ram Singh
Design of Microstrip Patch Antenna by Introducing Defected Ground Structure
9. 26 38
Harpreet Kaur and Monika Aggarwal
Edge Detection of A Video Using Adaptive Edge Detection Operator
10. 31 43
Pankaj Sharma and Jatinder Sharma
Design of 3-side Truncated Patch Antenna With Open Semicircular Slot for UWB Applications
11. 34 50
Amrik Singh, Sushil Kakkar and Shweta Rani
Gait Recognition Using SVM And LDA With Pal And Pal Entropy Image
12. 35 54
Reecha Agarwal and Rishav Dewan
Enhancement The Accuracy of Photonic Crystal Fiber By Using Ann
13. 49 63
Amit Goyal and Kamaljeet Singh Sidhu
Effect of Different Feeding Techniques on Slot Antenna
14. 54 67
Sushil Kakkar, Shweta Rani and Anuradha Sonker
Low Cost Planar Antenna for Wireless Applications
15. 55 71
Anand Jain, Sushil Kakkar and Shweta Rani
Artificial Eyes: Brain Port Device
16. 59 74
Lovedeep Dhiman and Deepti Malhotra
High Reflectance Multiple step metal grating for multichannel reflector
17. 60 78
Ramanpreet Kaur, Neetu Sharma and Jaspreet Kaur
Speech Recognition Using Neural Network
18. 66 81
Pankaj Rani, Sushil Kakkar and Shweta Rani
BER Analysis of Turbo Coded OFDM for different Digital Modulation Techniques
19. 67 86
Gurwinder Kaur and Amandeep Kaur
S. No. Paper ID Paper Title Page No.
Rectangular Microstrip Patch Antenna with Triangular Slot
20. 73 91
Sandeep Singh and Jagtar Singh Sivia
Design review on high-swing, high performance CMOS operational amplifier
21. 74 94
Harjeet Singh and Tusty Bansal
Application of AHP-VIKOR Hybrid MCDM Approach for 3PL selection: A Case Study
22. 75 97
Arvind Jayant and Priya Singh
Comparison of different types of Microstrip patch antennas
23. 76 105
Sumanpreet Kaur Sidhu and Jagtar Singh Sivia
Artificial vision towards creating the joys of seeing for the blind
24. 81 110
Aastha Bansal, Virpal Kaur and Anjali Gulati
A review: nanotechnology
25. 82 113
Sonali Tyagi, Savaljeet Kaur and Shilpa Rani
A Review: 5G Technology
26. 83 116
Varinder Bansal, Gursimrat Singh and Vipin Bansal
Adaptive Modulation based Link Adaptation for High Speed Wireless Data Networks using Fuzzy Expert System
27. 84 118
Kuldeep Singh, Jatin Sharma and Danish Sharma
Design and analysis of dual band printed microstrip dipole antenna for wlan
28. 91 123
Gurmeet Singh and Lakhwinder Singh Solanki
Koch Fractal Loop antenna using modified ground
29. 92 127
Pravin Kumar, Anuradha Sonker and Varun Punia
Automatic Detection of Diabetic Retinopathy- A Technological Breakthrough
30. 96 131
Chinar Chahar and Deepti Malhotra
A Survey on Hybridization of Wireless Energy Harvesting and Spectrum Sharing in Cognitive Radio
31. 98 134
Ranjeet Singh and Amandeep Singh Bhandari
Hybrid modulation
32. 100 138
Rishav Dewan, Gagandeep Kaur and Harjeet Kaur
Removal of Powerline Interference from EEG using Wavelet-ICA
33. 101 141
Gautam Kaushal, V.K. Jain and Amanpreet Singh
A Survey on Reversible Logic Gates
34. 103 144
Santosh Rani and Amandeep Singh Bhandari
A review of reversible logic gates
35. 105 148
Sukhjeet Kaur and Amandeep Singh Bhandari
A Review of an Adaptive On-demand Routing Protocols for Mobile Ad-hoc Networks
36. 112 151
Navjot Kaur and Deepinder Singh
Exploding Electronic Gadgets
37. 113 156
Avonpreet Kaur, Anmol Sharma
Distinguish Abandons in Gears
38. 114 159
Avonpreet Kaur, Anmol Sharma and Shweta Rani
Study of various aspects related to Wireless Body Area Networks
39. 116 161
Raju Sharma and.Hardeep Singh Ryait
How to Reduce Mobile Phone Tower Radiation
40. 118 167
Anmol Sharma, Avonpreet Kaur and Shweta Rani
Optimal ECG Sampling Rate for Non-Linear Heart Rate Variability
41. 119 170
Butta Singh, Vijay Kumar Banga and Manjit Singh

ii
S. No. Paper ID Paper Title Page No.
Design of Rectangular Microstrip Patch Antenna Array for S, C and X- Band
42. 127 175
Jagtar Singh Sivia, Amandeep Singh and Sunita Rani
UWB Stacked Patch Antenna using Folded Feed for GPR application
43. 129 179
Mohammad Shahab and Tanveer Ali Khan
Parameters evaluation of semi-circular object in stitched image
44. 131 183
Jagpreet Singh, Ajay Kumar Vishwakarma and Neha Hooda
Arduino based Microcontroller
45. 133 188
Manoj Kumar and Vertika Garg
Application of DGS in Microstrip Patch Antenna
46. 136 191
Sushil Kakkar, A. P. Singh and T.S. Kamal
Wavelength Assignment Problem In WDM Network
47. 145 194
Gunvir Singh, Abhinash Singla and Sumit Malhotra
Comparative Study of Different Algorithms to Implement Smart Antenna Array-A Review
48. 149 199
Gurjinder Kaur and Gautam Kaushal
A review of deterministic energy-efficient clustering protocols for wireless sensor networks
49. 155 203
Gurjit Kaur and Shweta Rani
Performance Analysis of AODV, TORA and AOMDV Routing Protocols in the presence of Blackhole
50. 159 206
Gurmeet Singh, Deepinder Singh Wadhwa and Ravi Kant
Study of Evolutionary Optimisation techniques and their Applications
51. 160 211
Mandeep Kaur and Balwinder Singh Sohi
Soft Computing and its various tools: A review
52. 181 216
Nishi Sharma and Dr. Shaveta Kakkar
Passive Optical Networks Employing Triple Play Services : A Review
53. 182 220
Harneet Kaur and Harmanjot Singh
Review of Static Light path Design in WDM network
54. 186 224
Harpreet Kaur and Munish Rattan
A Review Paper on Nanomaterials & Nanotechnology
55. 193 228
Anshu Rao and Ravi Kant
Review of Segmentation of Thyroid gland in Ultrasound image using neural network
56. 194 235
Mandeep Kaur and Deepinder Singh
Review of Robust Document Image Binarization Technique for Degraded Document Images
57. 195 240
Rupinder Kaur and Naveen Goyal
A Review of Multibiometric System with Recognition Technologies and Fusion Strategies
58. 211 244
Cammy Singla and Naveen Goyal
Fractal Reconfigurable Antenna
59. 212 250
Anuradha Sonker, Shweta Rani and Sushil Kakkar
Review of Spectrum Sensing in Cognitive Radio by Using Energy Detection Technique.
60. 213 252
Ajay Jindal
Review of Cognitive Radio by Cyclostationary Feature Based Spectrum Sensing
61. 214 256
Nishant Goyal
Review of simple distributed Brillouim scattering modeling for temperature & strain
62. 215 259
Tushar Goyal and Gaurav Mittal

iii
 Computer Science & Engineering

S. No. Paper ID Paper Title Page No.

A Comprehensive Study of AODVv2-02 Routing Protocol in MANET
1. 1 263
Vikram Rao and Anuj Kumar Gupta
A Survey on Zone Routing Protocol
2. 2 267
Nafiza Mann, Abhilash Sharma and Anuj Kumar Gupta
A Review on Cloud Computing & its Current Issues
3. 6 272
Sandeep Kaur and Simarjit Kaur
A Survey On Load Balancing Techniques In Cloud Computing
4. 7 276
Lakhvir Kaur and Simarjit Kaur
Review of Various Fractal Detection Techniques in X-Ray Images
5. 10 280
Tanudeep Kaur and Anupam Garg
A Review of the Techniques used for Face Recognition
6. 11 284
Priyanka Bansal
Enhancement in intrusion detection system for WLAN using genetic algorithms
7. 15 289
Rupinder Singh and Sandeep Kautish
A Review on Reliability Issues in Cloud Service
8. 19 292
Gurpreet Kaur and Rajesh Kumar
Influence of Anti-Patterns on Software Maintenance: A Review
9. 20 296
Sharanpreet Kaur and Satwinder Singh
A review on Data clustering and an efficient k-Means Clustering Algorithm
10. 23 302
Sukhjeet Kaur and Satwinder Singh
Data Mining Technique to Predict Mutations from Human Genetic Information in Bioinformatics: A Review
11. 24 306
Manpreet Kaur and Shivani Kang
Analysis of AODV, OLSR and ZRP Routing Protocols in MANET under cooperative black hole attack
12. 25 310
Sukhman Sodhi, Rupinder Kaur Gurm and Gurjot Singh Sodhi
A Review on content based video retrieval
13. 27 314
Jaspreet Kaur Mann and Navjot Kaur
Web Services: An e-Government Perspective
14. 30 319
Monika Pathak, Gagandeep Kaur and Sukhdev Singh
A review on ACO based and BCO based routing protocols in MANET’s
15. 36 322
Jatinder Pal Singh
A Comprehensive Study on the Basics of Artificial Neural Network
16. 38 328
Neha Singla, Mandeep Kaur, Sandeep Kaur and Amandeep Kaur
A Survey of Routing Protocols in Mobile Ad-Hoc Network
17. 39 333
Preet Kamal Sharma and R.K. Bansal
The Beginning of Statistical Machine Translation System to convert Dogri into Hindi
18. 40 337
Manu Raj Moudgil and Preeti Dubey
A brief study about evolution of Named Entity Recognition
19. 43 342
Varinder Kaur and Amandeep Kaur Randhawa
Comparison between PID, fuzzy, genetic algorithm & particle swarm optimization soft computing techniques
20. 44 348
Rakesh Kumar and Nishant Nakra

iv
S. No. Paper ID Paper Title Page No.
A Survey on Routing Protocol for Wireless Sensor Network
21. 46 355
Mahima Bansal, Harsh Sadawarti and Abhilash Sharma
A Survey on Optical Amplifiers
22. 47 360
Kirandeep Kaur and Harsh Sadawarti
Managing Big Data with Apache Hadoop
23. 48 365
Maninderpal Singh Dhaliwal and Amandeep Singh Khangura
Gateway Based Energey Enhancement Protocol For Wireless Sensor Network
24. 52 372
Maninder Jeet Kaur and Avinash Jethi
Literature survey of AODV and DSR reactive routing protocols
25. 56 376
Charu Sharma and Harpreet Kaur
A Survey on Data Placement and Workload Scheduling Algorithms in Heterogeneous Network for Hadoop
26. 57 380
Ruchi Mittal and Harpreet Kaur
A Survey on Parts of Speech Tagging For Indian Languages
27. 58 387
Neetu Aggarwal and Amandeep Kaur Randhawa
Asymmetric Algorithms and Symmetric Algorithms – A Review
28. 61 391
Tannu Bala and Yogesh Kumar

A Novel Approach for Reducing Energy Consumption and Increasing Throughput in Wireless Sensor Network
29. 64 using Network Simulator 2 395
Jagdish Bassi and Taranjit Aulakh
Comparison & Analysis of Binarization Technique for Various Types of Images Text
30. 77 399
Kanwaljeet Kaur, Monica Goyal and Rachna Rajput
Page Ranking Algorithms for Web Mining: A Review
31. 80 406
Charanjit Singh and Sandeep Kumar Kautish
Comparative analysis of various data mining classification algorithms
32. 86 411
Indu Bala and Yogesh Kumar
Simulative Investigation on VOIP over Wimax Communication Network
33. 89 416
Ambica and Avinash Jethi
Swarm Intelligence (SI)-Paradigm of Artificial Intelligence (AI)
34. 99 421
Pooja Marken and Renu Nagpal
Hierarchical Nepali Base Phrase Chunking Using HMM With Error Pruning
35. 106 424
Arindam Dey, Abhijit Paul and Bipul Syam Prukayastha
Cloud Computing: A Review on Security and Safety Measures
36. 111 429
Sandeep Kapur and Sandeep Kautish
A Survey on Multiprotocol Label Switching Virtual Private Network Techniques (MPLS VPN)
37. 115 435
Gurwinder Singh and Manuraj Moudgil
Comparison Analysis of TORA Reactive Routing Protocols on MANET based on the size of the network
38. 122
Emanpreet Kaur, Abhinash Singla and Rupinder Kaur 439
Comparison Analysis Of Zone Routing Protocol Based On The Size Of The Network
39. 123 443
Rupinder Kaur, Abhinash Singla and Emanpreet Kaur
The Performance Analysis of LMCS Network Model based on Propagation Environment Factors
40. 132 447
Sarbjeet Kaur Dhillon and Gurjeet Kaur
Performance Evaluation of Delay Tolerant Network Routing Protocols
41. 141 453
Vijay Kumar Samyal, Sukvinder Singh Bamber and Nirmal Singh

v
S. No. Paper ID Paper Title Page No.
Road Traffic Control System in Cloud Computing: A Review
42. 146 457
Kapil Kumar and Pankaj Deep Kaur
A Review on Scheduling Issues in Cloud Computing
43. 147 461
Kapil Kumar, Abhinav Hans, Navdeep Singh and Ashish Sharma
Artificial Intelligence (AI): A Review
44. 151 464
Ishu Gupta, Damandeep Kaur and Preeti
Data Optimization using Transformation approach in Privacy Preserving Data Mining
45. 157 469
Rupinder Kaur and Meenakshi Bansal
Study on Design the Sensor for control the traffic light time as dynamic for efficient traffic control
46. 162 473
Divjot Kaur
Quality Aspects of Open Source Softwares
47. 172 476
Amitpal Singh and Harjot Kaur
A Study of Shannon and Renyi entropy based approaches for Image Segmentation
48. 177 480
Baljit Singh and Parmeet Kaur
Swarm Intelligence and Flocking Behavior
49. 183 486
Himani Girdhar and Ashish Girdhar
Internet Threats and Prevention – A Brief Review
50. 184 490
Sheenam Bhola, Sonamdeep Kaur and Gulshan Kumar
A Comparative performance analysis of Mobile Ad hoc Network (MANETs) Routing Protocol
51. 197 495
Sheenam Madaan
Unified Modeling Language For Database Systems and Computer Applications
52. 198 498
Jyoti Goyal
Securing Information Using Images: A Review
53. 202 501
Anjala Grover, Gulshan Ahuja and Avi Grover
Text document tokenization for word frequency count using rapid miner
54. 216 505
Gaurav Gupta and Sumit Malhotra

Mechanical Engineering

S. No. Paper ID Paper Title Page No.

Comparative High-Temperature Corrosion Behavior of D-Gun Spray Coatings on ASTM-SA213, T11 Steel in
1. 41 Molten Salt Environment 509
Ankur Goyal, Rajbir Singh and Gurmail Singh

Analysis And Optimization Of Void Spaces In Single Ply Raw Material Using Finite Element Method & Fused
2. 53 Deposition Modeling 517
Harmeet Singh, J.P.S. Oberoi and Rajmeet Singh

Analysis of the Enablers for Selection of Reverse Logistics Service Provider: An Interpretive Structural Modeling
3. 85 (ISM) Approach 521
Arvind Jayant and Uttam Kumar
Sensitization behavior of GTAW austenitic stainless steel joints
4. 87 530
Subodh Kumar and Amandeep Singh Shahi

Grinding Fluid Applications using Simulated Coolant Nozzles and their Effect on Surface Properties in a Grinding
5. 88 Process 534
Mandeep Singh, Jaskarn Singh and Yadwinder Pal Sharma

vi
S. No. Paper ID Paper Title Page No.
Optimization of Machining Parameters for surface roughness in Boring operation using RSM
6. 90 541
Gaurav Bansal and Jasmeet Singh
Elastic - Plastic & Creep Phenomenon In Solids
7. 108 547
Gaurav Verma and Kulwinder Singh
Finite Element Analysis of a Muff Coupling using CAE Tool
8. 121 551
Rajeev Kumar, Mayur Randive and Gurpreet Dhaul
Evaluation Of Supply Chain Collaboration: An Ahp Based Approach
9. 126 556
Arvind Jayant, Veepan Kumar, Ravi Kantand Rakesh Malviya
Impact of pinch strengths on healthy and non-healthy workers in manufacturing unit
10. 134 560
Ahsan Moazzam and Manoj Kumar
Evaluation of Total Productive Maintenance towards Manufacturing Performance: A Review
11. 139 565
Jagvir Pannu, Harmeet Singh and Gopal Dixit
Evaluation of Technological Innovation Capabilities of SMEs
12. 140 574
Taranjit Virk and Gopal Dixit
Techno-economic aspects in micromachining of H11 hot die steel mould using EDM - a case study
13. 163 579
Shalinder Chopra and Aprinder Singh Sandhu
Optimization of Surface Roughness In CNC Turning of Aluminium Using Anova Technique
14. 165 583
Karamjit Singh, Gurpreet Singh Bhangu and Supinder Singh Gill
Effects of Smart Grid Utilization, Performance, Environmental & Security Issues: A Review
15. 187 589
Parminder Pal Singh and Gagandeep Kaur
Recent Advances In Friction Stir Welding For Fabrication of Composite Materials
16. 191 593
Gurmeet Singh Cheema, Prem Sagar and Vikash Jangra
Recent Development In Aluminium Alloys For The Advance Composite Material In Industry
17. 205 597
Mohan Singh and Balwinder Singh Sidhu

Electrical Engineering

S. No. Paper ID Paper Title Page No.

THD Reduction in DVR by BFO-Fuzzy Logic
1. 17 603
Chirag Kalia and Divesh Kumar
Ripple Control in Converter
2. 21 608
Husanpreet Singh and Divesh Thareja
A half and Full-Wave Rectifier With Full Control of the Conducting Angle
3. 22 611
Jashandeep Singh and Simerjeet Singh
Multi-objective Optimization Using Linear Membership Function
4. 28 615
Gurpreet Kaur, Divesh Kumar and Manminder Kaur
Allocation of Multiple DGs and Capacitors in Distribution Networks by PSO Approach
5. 42 620
Satish Kansal, Rakesh Kumar Bansal and Divesh Kumar
A Review of Renewable Energy Supply and Energy Efficiency Technologies
6. 51 626
Ramandeep Kaur, Divesh Kumar and Ramandeep Kaur
Design and Optimization of DGS based T-Stub Microstrip Patch Antenna for Wireless Applications
7. 68 631
Lalit Dhiman Dhiman and Simerpreet Singh Singh

vii
S. No. Paper ID Paper Title Page No.

Feasibility Study of Hybrid Power Generation using Renewable Energy Resources in Tribal Mountainous Region
8. 70 of Himachal Pradesh 638
Umesh Rathore, Ved Verma and Vikas Kashyap
Modeling & Simulation of Photovoltaic system to optimize the power output using Buck-Boost Converter
9. 93 643
Shilpa Garg and Divesh Kumar
Modelling and Analysis of Grid Connected Renewable Energy Sources with active power filter
10. 110 648
Harmeet Singh and Jasvir Singh
3D Finite Element Analysis for Core Losses in Transformer
11. 124 654
Sarpreet Kaur and Dr. Damanjeet Kaur
Overview Of Power Trading: Meaning , Scneario , Issues And Challenges
12. 128 658
Pooja Dogra
A Review Paper on Wireless Power Transmission Methods
13. 173 663
Ramandip Singh and Yadwinder Singh
Assessment of Bioenergy Potential for Distributed Power Generation from Crop Residue in Indian State Punjab
14. 175 667
Ram Singh
Potential of Microbial Biomass for Heavy Metal Removal: A Review
15. 188 671
Garima Mahajan and Dhiraj Sud
Efficiency comparison of New and Rewound Induction Motors used in Rice Mill
16. 201 673
Ramanpreet Singh and Jasvir Singh

Civil Engineering

S. No. Paper ID Paper Title Page No.

Need of Sustainable Development & Use of Demolished Aggregate for Highway Construction
1. 107 676
Raj Kumar Maini, Amandeep Singh and Saajanbir Singh

Applications of Acoustical & Noise Control Materials & Techniques for Effective Building Performance- A Review
2. 144 679
Jashandeep Kaur, Manu Nagpal and Kanwarjeet Singh Bedi
Nanocement Additives - A Carbon Neutral Strength Enhancing Material
3. 166 684
Jaskarn Singh, Gurpyar Singh, Parampreet Kaur and Akash Bhardwaj
Transpiring Concrete Trends: Review
4. 171 687
Kanwarjeet Singh Bedi, Ivjot Singh and Jaskarn Singh
Feasibility of Flyover on Unsignalised Intersection
5. 180 690
Abhishek Singla, Gurpreet Singh, Bohar Singh and Dapinderdeep Singh
Application of Geoinformatics in Automated Crop Inventory
6. 196 705
Sandeep Kumar Singla, O. P. Dubey and R.D. Garg

Basic & Applied Sciences

S. No. Paper ID Paper Title Page No.

A Study on PRP’s (Protein Rich Pulses) by Irradiating Co-60 Gamma Ray Photons
1. 12 713
Manoj Kumar Gupta, Gurinderjeet Singh, Shilpa Rani and Amrit Singh
Drifting effect of electron in multi-ion plasmas with non-extensive distribution of electrons.
2. 37 716
Parveen Bala and Sheenu Juneja

viii
S. No. Paper ID Paper Title Page No.
Second language learner: threads of communication skills in English language
3. 62 720
Chhavi Kapoor

An Experimental Investigation on Aluminium based Composite Material reinforced with Aluminium oxide,
4. 71 Magnesium and Rice Husk Ash Particles through Stir Casting Technique 723
Rajiv Bharti, Sanjeev Kumar and Jaskirat Singh
Role of Youth and Media in modern communication system
5. 72 729
Harpreet Kaur
A Review Study On Presentation Of Positive Integers As Sum Of Squares
6. 95 733
Ashwani Sikri
Analysis of Material Degradation in Chlorine Environment of Power Plants
7. 104 744
Harminder Singh
Multiple scattering effects of gamma ray in some titanium compounds
8. 109 747
Lovedeep Singh, Amrit Singh, Pooja Rani and Manoj Kumar Gupta
Measurements of radon gas concentration in soil
9. 117 751
Navpreet Kaur, Amrit Singh, Manpreet Kaur and A S Dhaliwal
Determination of Conductivity of Human Tear Film at 9.8 GHz
10. 120 754
Namita Bansal, A S Dhaliwal and K S Mann
Biological Significance of Nitrogen Containing Heterocyclic compounds-A Mini Review
11. 137 755
Rajni Gupta
Steady State creep Behavior of Functionally Graded composite by using analytical method
12. 138 762
Ashish Singla, Manish Garg and Vinay Kumar Gupta
Getting Energy and A cleaner Environment With Nanotechnology
13. 148 767
Savita Sood
Optimal Real-time Dispatch for Integrated Energy Systems
14. 156 772
Prabhpreet Kaur and Sirdeep Singh
Engineering Fluorescence Lifetimes of II-VI Semiconductor Core/Shell Quantum Dots
15. 167 776
Gurvir Kaur and S.K. Tripathi
Human Values and Ethics in the Modern Technology Driven Global Society
16. 168 777
Sunita Rani, Vandana Sharma and Neetika
RFID: A Boom for Libraries
17. 176 780
Arvind Mittal, Amit Mittal and Uma Sharma
Toolkit for Fast Neutron Removal Cross-Section
18. 192 783
Kulwinder Singh Mann, Manmohan Singh Heer and Asha Rani
Green Computing
19. 199 789
Sarbjit Kaur and Sonika Dhiman

Recent Modified Fibers With Their Technological Developments in Different Fields of Application - An Overview
20. 207 794
Nisha Arora and Amit Madahar
Innovations in Textile Composite Desining and Their Applications
21. 210 799
Rajeev Varshney and Amit Madahar

ix
 Food Engineering

S. No. Paper ID Paper Title Page No.

Effect of plasticizer on the properties of pellets made from agro-industrial wastes

1. 142 802
Shumaila Jan, Kulsum Jan, C.S. Riar and D.C. Saxena

Textural and Microstructural Properties of Extruded Snack prepared from rice flour, corn flour and deoiled rice
2. 143 bran by twin screw extrusion 807
Renu Sharma, Raj Kumar, Tanuja Srivastava and D.C. Saxena
Extruded Products Analog To Meat
3. 150 813
Renu Sharma, Tanuja Srivastava, D C Saxena and Raj Kumar
Biotechnology & Genetic Engineering: Enhancement in food quality and quantity
4. 174 818
Joni Lal and Kulbhushan Rana
Effect of physical properties on flow ability of commercial rice flour/powder for effective bulk handling
5. 189 820
Shumaila Jan, Syed Insha Rafiq and D.C Saxena
Extraction of starch from differently treated horse chestnut slices
6. 190 825
Syed Insha Rafiq, Shumaila Jan,Sukhcharn Singh and D.C Saxena
Industrial effluents and human health
7. 217 830
Anchla Rupal

Agriculture Sciences

S. No. Paper ID Paper Title Page No.

Determination of attenuation coefficient and water content of Broccoli leaves using beta particles
1. 29 832
Komal Kirandeep, Parveen Bala and Amandeep Sharma
The Study of Cloud Computing Challenges in Agriculture with Special Reference to Sangli District (MS)
2. 45 835
Dalvi Teja Satej and Kumbhar S.R.
Baler Technology for the Paddy Residue Management – Need of the hour
3. 169 838
Bharat Singh Bhattu and Ankit Sharma Sharma
A Study on Constraints of Broiler Farming Entrepreneurship in Mansa District of Punjab
4. 170 840
Bharat Singh Bhattu, Ankit Sharma and Gurdeep Singh

Business Administration

S. No. Paper ID Paper Title Page No.

Constraints and Opportunities Faced by Women Entrepreneurs in Developing Countries- with Special Contest to
1. 32 India 845
Kamaljit Singh and Deepak Goyal
A Descriptive Study of the Marketing Mix Strategies of Milkfood Ltd.
2. 33 851
Kamaljit Singh and Ramandeep Kaur
Cohorts In Marketing: A Review Paper
3. 50 855
Amandeep Singh Garai and Gurbir Singh
A Study of Corporate social responsibility in India
4. 78 860
Sandeep Kaur and Seema Jain

x
S. No. Paper ID Paper Title Page No.
Emerging Role Of Information Technology In Banking Sector’s Development of India
5. 79 865
Seema Jain and Sandeep Kaur
Customer Satisfaction towards WhatsApp
6. 94 871
Parveen Singla and Rajinder Kumar Uppal
Opportunities And Challenges In The Era of Globalization In 21st Century
7. 130 876
Pankaj Goyal and Kirna Rani

Employment Generation in Indian Economy Micro, Small & Medium Enterprises (MSME’s): An Analytical
8. 135 Approach 880
Parmjot Singh and Rakesh Kumar
Public Distribution System as Development Planning & Policy
9. 153 887
Gurdeep Kaur Ghuman and Pawan Kumar Dhiman

xi
Electronics & Communication
Engineering
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Content Retrieval from Historical

Manuscript Images: A Review
Er. Kitty Gupta Er. Rishav Dewan
Student (ECE Department) Assistant Professor (ECE Department)
BGIET Sangrur, Punjab BGIET Sangrur, Punjab
kittygpt3@gmail.com rishavdewan@gmail.com

ABSTRACT sharpening. In this way useful contents can be retrieved from

the document images. This paper focuses on review of such
Ancient documents play an important role in history. Various types of methods or algorithms by which quality of degraded
information regarding the literature, tradition and culture is documents can be enhanced.
kept in these documents. These heaps of documents are
degraded because of some climatic circumstances, low quality
and inappropriate holding. This paper reviews on the
techniques used to retrieve the necessary content from these
ancient documents. The techniques include preprocessing,
image binarization, thresholding methods and post processing
methods. Further, during scanning the document it can get
corrupted with some unwanted lines or signals termed as
noise that should be eliminated.

General Terms
Document Image Processing, binarization, PSNR

Keywords
Degraded document image; preprocessing; thresholding; post
processing.

1. INTRODUCTION
There are many libraries and places in which degraded
Historical documents are preserved. These manuscripts are
degraded because of various fault conditions in the
environment or low quality of paper used. Another problem
with these documents is that because of past decay of time the
ink of front page get disfigure with last page. Such types of (a)
problems must be corrected by different techniques. Image
binarization is that technique by which the text can be
retrieved from the document. Binarization breaks the
document image in two parts: image background and
foreground text. Document text edges are digitized by using
image binarization. Thresholding methods are used for
binarization of image. Further, two types of thresholding
methods: local and global thresholding. Separation of
foreground and background of degraded document image is
done by global thresholding method. To get information about
the pixels and local area of the document image, local
thresholding is used. This was also seen that global
thresholding proves best with comparison of local
thresholding. Another thresholding method is Otsu‟s method
named after Nobuyuki Otsu. This is used to detect the text
edges. To find text edges constructing contrast is very
important and after this the edges of text can be easily
identified. Clear bimodal patterns are not obtained in the
degraded document. To find text stroke edges in the image,
correct contrast construction is very important. To detect the (b)
text edges provide uniform background to the degrade Figure 1: Degraded Historical Documents
document image. After this, text edges can be easily identified
and detected by separating text and background from the
image. Edge detection methods are used for edge detecting.
Now, by comparing the intensity of document image contents
can be easily retrieved from the image. For comparison,
assign two values „0‟for background and „1‟ for edges.
Detected edges have clear bimodal pattern which are obtained
by binarization. Bimodal patterns results in the text edge
1
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Input Pre-
image processing Binarization
Figure 2: Block diagram for enhancing degrade documents
2. METHODOLOGY
Denoising and Enhancing of Degraded Historical documents
are very important task. In the existing technology some steps
are concluded. These include (a) Pre-processing (b)
Binarization and (c) Post-processing. Each method is
explained as below:
2.1 Post-processing
Pre-processing is also known as pixel level processing. This
processing includes conversion of coloured image into Grey
scale image. Unwanted noise and lines are reduced by using
noise removal filters. The noise present in the document
images are margin noise, Gaussian noise and impulse noise.
For reducing these noises the filters include Gaussian filter,
median filter, bilateral filter and guided image filter. Bilateral
filter reduce noise without preserving edges and this limitation
can be overcome by using guided image filter.
2.2 Binarization
Binarization is a processing of converting grey image into
binary form. Foreground and background parts of the image
are separated from each other. It is done by thresholding
methods. Global and local thresholding comes in this process.
Another thresholding method is Otsu method that gives the
weighted sum of variance of two pixels.
2.3 Post-processing
To enhance the performance of binarization post-processing
technique is applied. During scanning, text may be deviated
from the base line. This type of problem is corrected in post
processing step. Text extraction and edge sharpening is also
included in this.
3. LITERATURE SURVEY
In 2010, Shazia Akram et. al. [11] give an overview on
various techniques to enhance the document images. The
techniques include Preprocessing, feature extraction and
classification. Preprocessing is that state that enhances the
quality of image. It is also known as pixel level processing. It
includes image acquisition, noise removal and image de-
skewing methods. Useful information or data can be extracted
by using feature extraction method. Classification includes
distribution of documents into various categories which
improves indexing efficiency of document storage places.
This paper concludes various techniques for document image
processing and new methods must be developed to enhance
the document images.
C. Patvardhan et. al. (2012) [3] proposed the method of
discrete Curvelet Transform for denoising the document
images. Document images corrupted by Gaussian and impulse
noises are denoised by curvelet transform. These noised gets
added during scanning and transmission. Hard thresholding
and global Otsu methods were also used to smooth the
boundaries. In wavelet scheme Haar wavelet was used as it
2
ISBN: 978-81-924893-0-8
Post- Output
processing image
does not blur the image. Wavelet scheme, wavelet based
scheme with edge preservation and curvelet transform was
compare with (a) F-Measure, (b) Negative Rate Metric, (c)
Normalized correlation, (d) Peak signal to noise ratio (PSNR).
It was concluded that Curvelet transform performs better
results as it preserve edge features of the noisy image and
reduce Gaussian and impulse noise in the image.
B. Gangamma et. al. (2012) [1] combines two methods of
image processing, filtering and mathematical morphology.
Bilateral filter reduce the unwanted noise in the images but
unable to smooth the edges of image. Mathematical
morphology helps in the extraction of edges, shapes and
cracks in the texts. Further, to binarize the image global
thresholding was used. The results of proposed method were
compare with Gaussian and Average filter. It was concluded
that the proposed method proves better to degrade the
document image.
Hossein Ziaei Nafchi et. al. (2013) [5] proposed a post
processing method which is based on phase- preserved
denoised image and phase congruency extracted features from
the document image. Non-orthogonal log-Gabor filters were
used to get the information of phase and amplitude value at
each point of the image. Maximum moment of phase
congruency covariance (MMPCC) and locally weighted mean
phase angle (LWMPA) were used detect the edge and
structure of foreground text respectively. Then Otsu‟s method
was applied to get the binarized image and median filter was
used to remove the noise from the image. The results were
evaluated in F-Measure, recall and Distance reciprocal
distortion (DRD). These methods were tested on DIBCO and
H-DIBCO datasets and the proposed methods showed better
results on DIBCO datasets in terms of F-Measure, recall and
DRD.
Md Iqbal Quriashi et. al. (2013) [7] compared two approaches
to degrade historical document images. In first case, Particle
Swarm Optimization (PSO) with bilateral filter was applied.
In second case, Non-linear filter and bilateral filter was
applied. Then both the techniques were compared in terms of
PSNR and NAE. The results conclude in favor of Particle
Swarm Optimization.
Then, in 2014 Jagroop Kaur et. al. [8] proposed a new filter
known as guided image filter as it is an edge preserving filter.
The proposed method in this paper was worked in various
steps. In first step, guided image filter was applied to smooth
the degrade image. Secondly, adaptive image contrast
enhancement was applied for the grouping of contrast and
gradient of local image. Then, final binarization was done
with thresholding methods. Proposed method was compared
with some old methods in terms of F-Measure, Specificity,
Geometric Accuracy and PSNR. The proposed method show
better results. Another advantage of using guided image filter
is that it reduces noise at higher extent from the degraded
document.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

S. Tamilselvan et. al. (2014) [12] proposed a binarization Table 1: Comparison of various methods
technique for retrieving contents from the degraded document
images. This binarization was performed in various steps. S.no Reference Method Used Conclusion
Correct contrast of the image was constructed. Then, by using 1. Shazia Akram Preprocessing, Gives an
Otsu‟s & Canny edge detection method edges of the image et. al. [11] feature overview on
was detected. After edge detection, necessary text was extraction and these techniques
extracted from the image. At last post processing method was classification used to degrade
applied to sharpen the text edges. Clear bimodal pattern of the the digital
text was extracted without blurring the image. After document
experimental results threshold value of output image was images.
calculated and value ranges from 0.3-0.9. It was also
concluded that contrast construction is more valuable step 2. C. Patvardhan Discrete After comparing
among other steps in the proposed method. et. al. [3] Curvelet three methods,
transform curvelet
Haneen Khader et. al. (2014) [4] describes a novel Annotation wavelet scheme transforms gives
tool for handwritten historical images. This was performed on and wavelet better results as
English and Arabic texts in terms of text segmentation. K- scheme with it reduce noise
means and Otsu‟s thresholding methods were used in image edge and preserve
binarization which comes under pre-processing step. Suitable preservation. edge features.
binarization method was selected depending on the quality of Hard
image. On the output of thresholding, segmentation was thresholding and
applied to detect the lines and texts from the image. Finally, Otsu‟s method in
Annotation tool was applied which finds whether the text is wavelet scheme
English and Arabic. A rectangular box was appeared on each
word. Last step of proposed method is saving of Annotation 3. B. Gangamma Filtering and One
by creating an xml file. The aim of this tool is to eliminate et. al. [1] Mathematical disadvantage of
segmentation errors. Morphology. bilateral filter is
Bilateral filter that it not edge
Hossein Ziaei Nafchi et. al. (2014) [4] introduced a phase and Binarization preserving filter.
based binarization method which worked in three steps (a) is done by global Another filter
pre-processing (b) binarization (c) post processing. Denoising thresholding. can be used to
of image is considered in preprocessing step. Median filter preserve edges.
was used to remove unwanted noise and lines and Gaussian
filter to separate foreground from background. Main 4. Hossein Ziaei Post processing On DIBCO
binarization is based on MMPCC and LWMPA. In post Nafchi et. al. method, dataset proposed
processing, to enhance the binarization Gaussian filter was [5] MMPCC, method shoe
applied. Further, to get ground truth image PhaseGT was used LWMPA, Otsu‟s better results
to simplify and speed up the ground truth generation process. method and
These methods had been analyzed on dataset of DIBCO, H- median filter.
DIBCO, PHIBD and BICKLEY DIARY.
5. Md Iqbal PSO, bilateral PSO performs
Quriashi et. filter and non- better.
al. [7] linear filters
4. CONCLUSION
6. Jagroop Kaur Guided image Guided image
This review paper analyzes the various algorithms and et. al. [8] filter, filter is edge
techniques used for enhancing the degraded historical Binarization preserving filter
documents or manuscripts. The documents get degraded due and will used to
to various environmental conditions. Every technique has its detect brain
own advantages and disadvantages. Usually for improving the tumor.
quality of image binarization performs better results. It is done
by various thresholding methods. Filters are used to remove 7. S. Contrast Contrast
the noise from degraded image and edge preserving filter Tamilselvan construction, construction
show better results. Every algorithm is compared on the basis et. al. [12] Otsu‟s method gives better
of some parameters like PSNR, F-Measure and NC. In future and post results.
new algorithms would be developed for improving other processing.
historical images like text on stone monuments. 8. Haneen Annotation tool, Annotation tool
Khader et. al. image find whether the
[4] segmentation text is English
and Otsu‟s or Arabic.
method

3
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

5. REFERENCES
[1] B. Gangamma, Srikanta Murthy K, Arun Vikas Singh,
“Restoration of Degraded Historical Document Image”,
Journal of Emerging Trends in Computing and Information
Science”, Vol. 3, Issue 5, May 2012.

[2] Bolan Su, Shijian Lu, Chew Lim Tan, “Robust Document
Image Binarization Technique for Degraded Document
Images”, IEEE Transactions on Image Processing, Vol. 22,
Issue 4, April 2013.

[3] C. Patvardhan, A.K. Verma, C.V. Lakshmi, “Denoising of

Document images using Discrete Curvelet Transform for
OCR Applications”, International Journal of Computer
Applications(0975-8887), Vol. 55, Issue 55, October 2012.

[4] Haneen Khadar, Abeer Al-Marridi, “An Interactive

Annotation tool for Indexing Historical Manuscripts”, IEEE
transactions on image processing, 2014.

[5] Hossein Ziaei Nafchi, Reza Farrahi Moghaddam,

“Application of Phase –Based Features and Denoising in post
processing and binarization of Historical Document Images”,
IEEE 12th International Conference on Document Analysis
and Recognition”, pp. 220-224, 2013.

[6] Hossein Ziaei Nafchi, Reza Farrahi Moghaddam, “Phase

Based Binarization of Ancient Document Images: Model and
Applications”, IEEE Transactions on Image Processing, Vol.
23, Issue 7, July 2014.

[7] Iqbal Quraishi, Mallika De, “A Novel Hybrid Approach to

Restore Historical Degraded Documents”, IEEE International
Conference on Intelligent Systems and Signal Processing
(ISSP), 2013.

[8] Jagroop Kaur, Rajiv Mahajan, “Improved Degraded

Document Image Binarization using Guided image filter”,
International journal of Advance research in Computer
Science and Software Engineering, Vol. 4, Issue 9, September
2014.

[9] Konstantinos Ntriogiannis, Basilis Gatos, Ioannis

Pratikakis, “Performance Evolution Methodology for
Historical Image Binarization”, IEEE Transactions on Image
Processing, Vol. 22, Issue 2, February 2013.

[10] Manish Yadav, Swati Yadav, Dilip Sharma. “Image

Denoising Using Orthonormal Wavelet Transform with Stein
Unbiased Risk Estimator”, IEEE student‟s Conference on
Electrical, Electronics and Computer Science”, 2014.

[11] .Shazia Akram, Mehraj-Ud-Din Dar, Aasia Quyoum,

“Document Image Processing- A Review”, International
Journal of Computer Applications (0975-8887), Vol. 10, Issue
5, November 2010.

[12] S. Tamilselvan, S.G. Sowmya, “Content Retrieval from

Degrade Document Images using Binarization Technique”,
IEEE International Conference on Computation of Power,
Energy, Information and Communication(ICCPEIC), pp.422-
426, 2014.

4
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Development of Dual Band Planar Inverted-F

Antenna for Wireless Applications
Jashandeep Singh Sushil Kakkar Shweta Rani
M.Tech Student Assistant Professor Associate Professor
ECE Department ECE Department ECE Department
BGIET, Sangrur BGIET, Sangrur BGIET, Sangrur
jsdeol1989@gmail.com sushil.kakkar@bgiet.ac.in shwetaranee@gmail.com

achieving maximum possible frequency bands with

ABSTRACT
A dual-band planar inverted-F antenna (PIFA) for
wireless applications has been presented in this paper.
The proposed antenna is compact in size and design on
FR4 substrate. The antenna consists of a slotted radiator
supported by shorting wall and a small ground plane.
Square shaped slot in radiating patch have been used to
introduce dual band operation into the proposed antenna.
The structure is designed and optimized to operate at
2.02GHz and 6.1GHz with achievable bandwidths
15.53% and 14.23% respectively. These two bands cover
the existing wireless communication frequency bands
from 1.9-6.5GHz. Good return loss, antenna gain and
radiation pattern characteristics are obtained in the
frequency band of interest. Structural dimensions of the
proposed antenna are optimized by using HFSS EM
solver. Details of the dual-band PIFA characteristics are
presented and studied.
suitable return loss and radiation pattern are desirable
[5].
Planar Inverted-F Antennas are widely used in a variety
of communication systems especially in mobile phone
handsets [6]. Also, PIFAs have features such as small
size, light weight, low-profile, simple fabrication and
relatively low specific absorption rate (SAR). Due to low
absorption of energy in the human body, this antenna
provides good efficiency. In recent years, there have
been a number of PIFA designs with different
configuration to achieve single and multiple operations
by using different shapes of slots. Planar inverted-F
antennas (PIFAs) can cover two or more standard
frequency bands and due to their thin planar structures
[7]. Truncated corner technique, meandered strips and
meandered shapes have been used to create multiple
band operations. Several techniques have been used to
improve the bandwidth of PIFA antennas [8].

Keywords The introduction of various resonant elements in order to

Planar Inverted-F Antenna (PIFA), Return Loss, Gain,
Bandwidth
1. INTRODUCTION
In the past decades, cellular communications become a
ubiquitous part of modern life. The desire of people to be
able to communicate effectively while being mobile has
become an incentive for mobile communications
integration in terrestrial and satellite wireless systems
[1]. The mobile communication industry has already
developed enormously bringing fast and reliable
infrastructure to people’s disposal. Yet, wireless
communication systems are still in the centre of
extensive academic and technological research and
development, with constant demand of more compact,
faster and more reliable devices and services [2].
In recent years, the demand of compact, smaller than
palm size communication devices has increased
significantly. Communication system demands for
antennas to exhibits some standard properties such as
reduced size, moderate gain broadband and multiband
operation [3, 4]. With the increasing interest in covering
various frequency bands, attention was drawn toward the
study of multiband antennas. For multiband antennas,
create a multiband PIFA is a very common approach.
Another method calls for the addition of parasitic patches
with resonant lengths close to the frequency band where
the bandwidth improvement is required. The inclusion of
slots in the ground plane and in the radiating structure
has also been used to enhance the bandwidth. These
antennas are generally designed to cover one or more
wireless communications bands such as the Global
System for Mobile Communications (GSM900 and 800),
Global Positioning System (GPS 1400 and 1575),
Personal Communication System (PCS 1800 and 1900),
Digital Communication Systems(DCS-1800), Universal
Mobile Telecommunication System (UMTS 2000), 3G
IMT-2000, 4G LTE (700, 1700, 2300, 2600),Wireless
Local Area Networks (WLAN) and Worldwide
Interoperability for Microwave Access (WiMAX) etc
[9].
In this work compact PIFA is proposed and presented for
various wireless applications. The effects of different
shorting wall width are studied. The proposed antenna
satisfies the return loss, VSWR and bandwidth for
applications within frequency range from 1.9-6.5 GHz.
The measured reflection coefficient, radiation pattern,
VSWR and gain are characterized.

5
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2. DESIGN AND STRUCTURE

Table 1. Dimensions of Proposed Antenna
Figure 1 shows the geometry of proposed antenna with
detailed dimensions given in Fig 1. The antenna designed Sr.No. Parameter Dimension(mm)
on FR4 substrate with a dielectric constant ɛr= 4.4 and a
loss tangent of 0.02 and thickness of the substrate h= 1 Length of Patch, L1 26
1.57mm have been used to design planar inverted-F
antenna. Air is used as dielectric between FR4 substrate 2 Width of Patch, W1 25.6
and top radiating patch. The dimensional parameters of Width of First Supporting
the proposed antenna are detailed in Table 1. The square 3 2
Wall, S1
shaped slot of suitable dimensions are cut in the Height of Supporting
antenna element to get the required bandwidth. Radiating 4 3.57
Wall, S2
element slot has been used for producing miniaturization,
Width of Second
dual and wide band operation. The proposed antenna has 5 3
Supporting Wall, S3
a very small size and is physically thin.
Width of Shotining Strip,
6 2
S4
The antenna element is fed by a coaxial probe at the Distance b/w Right Corner
suitable location to get better impedance matching. 7 12
and slot, L2
The thickness of copper used in prototype is 0.16mm. Distance b/w Left corner
The radiating element of PIFA is grounded with a 8 2
and slot, L4
shorting strip. The optimization and simulations of
Width of Radiating
the antenna is carried out using High Frequency 9 20
Element, L3
Structure Simulator (HFSS). HFSS employs the Finite
Element Method (FEM), adaptive meshing, and brilliant Distance b/w top corner
10 2
and slot, W3
graphics to give you unparalleled performance and
insight to 3D EM problems. HFSS can be used to Distance b/w lower corner
11 11.6
calculate parameters such as S-Parameters, Resonant and slot, W4
Frequency and Fields [3]. The 3D model of proposed
antenna generated in the HFSS is shown in Figure 2. The
antenna impedance matching is achieved by controlling
the distance between the feed-line and shorting strip.
Optimized dimensions of the antenna are given in the
Table 1.

Fig. 2 : 3-D Model of proposed PIFA Generated in

HFSS

3. RESULTS AND DISCUSSION

Fig. 1 : Radiating Element of Proposed antenna
3.1 Return Loss
The simulated return loss (S11) characterstics of the
proposed antenna is shown in Fig.3. From the graph it
can be seen that resonant frequencies achieved are
2.06GHz and 6.11GHz with return loss of -24.05 dB and
-44.45 dB. Therefore, the proposed antenna covers the
corresponding bandwidths defined by S11 < -6 dB for
the two bands are 15.53% (1.917-2.233GHz) for 2.06
14.23% (5.6-6.53GHz) for 6.1GHz. These bandwidths
satisfy the requirements for various wireless applications.

6
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig. 3 : Return Loss Graph of Proposed PIFA
3.2 VSWR
Voltage Standing Wave Ratio (VSWR) is a ratio of peak
voltage on the minimum amplitude of voltage of standing
wave . The VSWR is always a real and positive number
for antennas [7]. The smaller the VSWR is, the better the
antenna is matched to the transmission line and the more
power is delivered to the antenna. It is illustrated in Fig.
4 that at 2.06 GHz VSWR is 0.8 dB at 6.1GHz VSWR is
0.7 dB Also it is observed from the results that at these
resonant frequencies the Voltage Standing Wave Ratio is
below 2 dB which is desirable for most of the wireless
applications.
Fig. 4 : VSWR plot of the proposed antenna
3.3 Radiation Pattern
It can be seen from the plot of Fig. 5, that the
antenna is a good radiator with almost omnidirectional
radiation which supports multiple standards.
Fig. 5 : Radiation Pattern of proposed PIFA
7
ISBN: 978-81-924893-0-8
3.4 Gain
The gain and efficiency are the two important parameters
of the antenna. The overall gain of the antenna obtained
after simulating the PIFA structure is shown in Fig. 6. A
peak gain of 3.70 dB has been achieved. This value of
gain achieved by the proposed structure is moderate
value and considered to be good for the overall
performance of the antenna.
Fig. 6 : 3-D Polar plot showing Gain
4. CONCLUSION
In this paper a dual band Planar Inverted-F Antenna, has
been presented which covers the frequencies between
1.9-6.5GHz. The proposed antenna has a simple
configuration and is simply printed on FR4
substrate. It has been found that making slots in the
radiating patch and slits in the ground plane provides a
simple multiband PIFA with enhanced bandwidth. The
proposed antenna can covers UMTS, DCS, PCS, GPS,
3G, 4G, and an additional frequency bands, and provides
good return loss, VSWR and radiation patterns.
5. REFERENCES
[1] X. Zhang and A. Zhao, “Enhanced Bandwidth PIFA
Antenna with a Slot on Ground Plane”, Progress In
Electromagnetics Research Symposium, China,
March 23-27, 2009.
[2] N.Ojaroudi, H. Ojaroud and N. Ghadimi, “Quad-
Band Planar Inverted-F Antenna (PIFA) for
Wireless Communication Systems” Progress In
Electromagnetic Research Letters, Vol.-45, 51-56,
2014.
[3] H.F.Abu Tarboush, R. Nilavalan and T. Peter,
“Multiband Inverted-F Antenna With Independent
Bands for Small and Slim Cellular Mobile
Handsets” IEEE Transactions On Antenna and
Propagation, Vol.- 59, NO. -7, 2011.
[4] S.Kakkar and S. Rani, “A novel Antenna Design
with Fractal-Shaped DGS Using PSO for
Emergency Management”, International Journal of
Electronics Letters, vol. 1, no. 3, pp. 108-117, 2013.
[5] N.Kumar and G.Saini, “A Multiband PIFA with
Slotted Ground Plane for Personal Communication
Handheld Devices” International Journal of
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Scientific and Research Publications, ISSN 2250-

3153
[6] S.Kakkar, S. Rani and A.P. Singh, “On the Resonant
Behaviour Analysis of Small-Size Slot Antenna
with Different Substrates” International Journal of
Computer Applications, pp. no. 10-12, 2012
[7] S.Rani and A. P. Singh, “On the Design and
Optimization of New Fractal Antenna Using PSO”,
International Journal of Electronics, vol. 100, no.
10, pp. 1383-1397, 2012.
[8] N. Kumar and G.Saini, “A Multiband PIFA with
Slotted Ground Plane for Personal Communication
Handheld Devices” International Journal of
Scientific and Research Publications, ISSN 2250-
3153
[9] R.R. Raut Dessai and H. G. Virani, 2013 “Triple
Band Planar Inverted F-Antenna For LTE, Wi Fi
And WiMax Applications” International Journal of
Engineering Research & Technology Vol. -2, Issue
3.

8
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Power Oscillation Damping and Voltage Stability
Improvement Using SSSC integrated with SMES
Amritpal Singh
Research Scholar
. B.G.I.E.T Sangrur
amritpal290@gmail.com
ABSTRACT
The power system network is becoming more complex
nowadays so maintaining the stability of the power system is
very difficult. So we have designed a 12-pulse based Static
Synchronous Series Compensator (SSSC) which is operated
with and without integration of Superconducting Magnetic
Energy Storage (SMES) for enhancing the voltage stability and
power oscillation damping in multi area system. Control scheme
for the chopper circuit of SMES coil is designed. The model of
power system is designed in MATLAB / SIMULINK
environment and tested for various conditions. Model is tested
SSSC with and without SMES is analyzed for various transient
disturbances.
Keywords
Static Synchronous Series Compensator (SSSC),
Superconducting Magnetic Energy Device (SMES),
1. Introduction
Today’s modern interconnected power system is highly complex
in nature. In this, one of the most important requirements during
the operation of the electric power system is the reliability and
security. Maintaining stability of such an interconnected multi
area power system has become a cumbersome task. As a counter
measure against these problems, the Flexible AC Transmission
System (FACTS) devices were proposed. Nowadays, the new
Energy Storage System (ESS) is interface with FACTS device to
increase its performance. In bulk power transmission systems,
power electronics based controllers called FACTS, used to
simultaneous control of real and reactive power flow control, has
been proposed in the literature.
Presently, FACTS devices are a viable alternative as they allow
controlling voltages and current of appropriate magnitude for
electric power system at an increasingly lower cost .However, a
comparable field of knowledge on FACTS/ESS control is quite
limited. Therefore, in this work a methodology is proposed to
control the power flow, which uses FACTS controllers with
energy storage. Using switching power converter-based FACTS
controllers can carry this out. Among the different modeling of
FACTS devices, SSSC is proposed as the most adequate for the
present application well discussed. The DC inner bus of the
SSSC allows incorporating a substantial amount of energy
storage in order to enlarge the degrees of freedom of the SSSC
device and also to exchange active and reactive power with
utility grid. Based on a previous study of all energy storage
technologies currently available, the use of SMES is proposed
for the considered application has been presented. Novelreactive
power controllers for STATCOM and SSSC have been reported.
9
ISBN: 978-81-924893-0-8
Divesh Kumar
Research Scholar
B.G.I.E.T Sangrur
diveshthareja@gmail.com
This paper proposes a model of SSSC with and without SMES
to carry out the power flow control in the electric system. The
SMES coil has been connected to the Voltage Source Converter
(VSC) through the dc-dc chopper. Detail on operation, control
strategy of SSSC, chopper control of SMES and simulation
results for SSSC with and without SMES are presented in the
subsequent section.
2. SSSC
A SSSC is build with Thyristors with turn-off capability like
GTO or today IGCT or with more and more IGBTs. The static
line between the current limitations has a certain steepness
determining the control characteristic for the voltage.
The advantage of a STATCOM is that the reactive power
provision is independent from the actual voltage on the
connection point. This can be seen in the diagram for the
maximum currents being independent of the voltage in
comparison to the SVC. This means, that even during most
severe contingencies, the STATCOM keeps its full capability.
Basic STATCOM structure and voltage and current
characteristic are shown in fig. 1.
Fig 1: STATCOM structure and voltage / current characteristic
The three phases STATCOM makes use of the fact that on a
three phase, fundamental frequency, steady state basis, and the
instantaneous power entering a purely reactive device must be
zero. The reactive power in each phase is supplied by circulating
the instantaneous real power between the phases. This is
achieved by firing the GTO/diode switches in a manner that
maintains the phase difference between the ac bus voltage ES
and the STATCOM generated voltage VS. Ideally it is possible
to construct a device based on circulating instantaneous power
which has no energy storage device (i.e. no dc capacitor).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2.1 CONTROL SCHEME FOR SSSC technology. Thus, there has also been considerable development
on SMES for pulsed power systems. A SMES device is made
The 6 Pulse STATCOM using fundamental switching will of up of a superconducting coil, a power conditioning system, a
course produce the 6 N+or-1 harmonics. A 6 Pulse refrigerator and a vacuum to keep the coil at low temperature,
STATCOM is shown in fig.2. There are a variety of methods see Figure 3.
to decrease the harmonics. These methods include the basic
12 pulse configuration with parallel star / delta transformer
connections, a complete elimination of 5th and 7th harmonic
current using series connection of star/star and star/delta
transformers and a quasi 12 pulse method with a single star-
star transformer, and two secondary windings, using control
of firing angle to produce a 30(deg) phase shift between the
two 6 pulse bridges.

Fig.3 Superconducting Magnetic Energy Storage device

Energy is stored in the magnetic field created by the flow of

direct current in the coil wire. In general, when current is passed
through a wire, energy is dissipated as heat due to the resistance
of the wire. However, if the wire used is made from a
Fig.2 Six Pulse STATCOM superconducting material such as lead, mercury or vanadium,
zero resistance occurs, so energy can be stored with practically
The dc sides of the converters are connected in parallel and share no losses.
the same dc bus. The GTO valves are switched at fundamental Due to its rapid discharge capabilities the technology has been
frequency, and the dc voltage varies according to the phase implemented on electric power systems for pulsed power and
control technique used to control the output voltage. system stability applications. The discharge capabilities of
The SSSC switching is synchronized with respect to the SMES compared to several other energy storage technologies is
transmission line current iline, and its rms magnitude is illustrated in Fig. 4.
controlled by transiently changing the phase shift α between Vdc Fig.4 Illustration of the system power rating and the discharge
and Vinj. time of several energy storage technologies. As can be seen,
The change in the phase shift between the SSSC output voltage SMES has a relatively low power system rating, but has a high
and the line current results in the change of the dc capacitor discharge rate.
voltage Vdc, which ultimately changes the magnitude of the
SSSC output voltage VSSSC and the magnitude of the
transmission line current Iline.. The SSSC output voltage
VSSSC is controlled by a simple closed loop ; the per unit value
of the measured line voltage is compared with the injected
voltage and the error of these two values is passed to the PI
controller. The output of the PI controller is the angle α, which is
added to the synchronizing signal passed to the gate pulse
generator by the current synchronization block. To this signal +
α, an angle of –pi/2 or +pi/2. added since the SSSC output
voltage is lagging or leading the line current by 900 depending
on the desired capacitive or inductive operation.

3. SMES
The combination of the two fundamental principles (current with
very limited losses; and energy storage in a magnetic field)
provides the potential for the highly efficient storage of
electrical energy in a superconducting coil. Operationally,
SMES is different from other storage technologies in that a
continuously circulating current within the superconducting coil
produces the stored energy. At several points during the SMES
development process, researchers recognized that the rapid
discharge potential of SMES, together with the relatively high
energy related (coil) costs for bulk storage, made smaller
systems more attractive and that significantly reducing the
storage time would increase the economic viability of the
Fig 4: power rating and the discharge time of several energy
storage technologies
The overall efficiency of SMES is in the region of 90% to 99%.
SMES has very fast discharge times, but only for very short
periods of time, usually taking less than one minute for a full
discharge. Discharging is possible in milliseconds if it is
economical to have a PCS that is capable of supporting this.
Storage capacities for SMES can be anything up to 2 MW,
although its cycling capability is its main attraction. SMES
devices can run for thousands of charge/discharge cycles without
any degradation to the magnet, giving it a life of 20+ years.

10
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.1 CHOPPER CONTROL FOR SMES
SMES consists of a coil with many windings of
superconducting wire that stores and releases energy with
increases or decreases in the current flowing through the wire.
Although the SMES device itself is highly efficient and has no
moving parts, it must be refrigerated to maintain the
superconducting properties of the wire materials, and thus incurs
energy and maintenance costs. SMES are used to improve power
quality because they provide short bursts of energy (in less than
a second). An electronic interface known as chopper is needed
between the energy source and the VSC. For VSC the energy
source compensates the capacitor charge through the electronic
interface and maintains the required capacitor voltage. Two-
quadrant n-phase DC-DC converter is adopted as interface. The
DC-DC chopper allows to reduce the ratings of the overall
power devices by regulating the current flowing from the
superconducting coil to the inverter of the SSSC.
Then the values of voltage, active and reactive power and
current are measured of the system for three phase fault by using
SSSC.
4.2 MATLAB MODEL USING SSSC INTEGRATED
. WITH SMES
Then the model is designed with connecting SMES in the model
in parallel with the capacitor of SSSC. The performance of
network is checked by integrating SMES with SSSC. Power
system model using SSSC and SMES is shown in fig.6. SMES is
simply a storage device conned in parallel with SSSC which is
used to increase the magnitude of capacitor voltage. Then the
values of voltage, active and reactive power and current are
measured of the system for three phase fault by using SSSC and
SMES. The result values of both the circuits are compared.

4. MODELING AND CONTROL STRATEGY

A power system network is matlab/simulink environment. The
designed model is shown in fig. 4.1. As shown in fig. a three
phase power system network is designed in which the power is
fed by three generators. All the three generators are of same
ratings with voltage rating of 500KV and MVA rating of 8500
MVA. 1 load of 300MW and 200MW are connected in the two
ends of the lines. A measurement of line voltage, active and
reactive power has been taken by using different measuring
instruments of MATLAB.

4.1 MATLAB MODEL USING SSSC

The model of power sysyem is designed in SIMULINK and a
fault is produced to show various comparison of transiants.A
FACT family device SSSC is designed and connected into the
network. Model of power system using SSSC is shown in fig. 6.
SSSC is connected in series with the transmission line as shown
in fig.5. The purpose of SSSC is to inject a voltage with
controlled angle in series with line to reduce the power
oscillations damping time and short circuit current.

Fig.6 Simulink model with SSSC and SMES

5. RESULT AND DISCUSSIONS

The simulation network is tested for three cases which are, Case
(a) Without Using SSSC and SMES, Case (b) With SSSC and
without SMES, and Case (c): With SSSC and with SMES. Then
the results of all cases are compared.
Simulation results of various cases are shown below:

Fig.5 Simulink model with SSSC

Case (a)

11
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Case (b) Case (a)

Case (c) Case (b)

Fig.7 Waveform of network voltage

Case (c)

Fig.9 Waveform of power

Case (a)
The fault occurrence time is 0.1667 seconds and clearance of
fault is 0.2333 seconds. In fig. 7 voltages of all the cases are
compared. In fig. 8 current of all case are compared and settling
time of current of case (a) is 0.3433seconds which is very large as
compared to case (b) and case (c) which is 0.2370 seconds and
0.2358 seconds respectively. In fig.10 waveform of active and
reactive power of all cases are compared and it is seen that
power oscillations of case (b) and (c) are oscillated in less time as
compare to case (a). Power oscillation clearing time for case (a) is
0.3633 seconds, case (b) is 0.2380 seconds and case(c) is 0.2315
Case (b) seconds.

6. CONCLSION
The dynamic performance of the SSSC with and without SMES
for the test system is analyzed with Matlab/simulink. In this
paper SMES with chopper control plays an important role in real
power exchange. SSSC with and without SMES has been
developed to improve transient stability performance of the
power system. It is inferred from the results that the SSSC with
SMES is very efficient in transient stability enhancement and
effective in damping power oscillations and to maintain power
flow through transmission lines after the disturbances.
Case (c)

Fig.8 Waveform of network current 7. REFERENCES

[1] Thangavel M., and Jasmine S.S., “Enhancement of
Voltage Stability and Power Oscillation Damping
Using Static Synchronous Series Compensator With

12
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
SMES”, International Journal of Advanced Research
in Technology Vol. 2 Issue 3, March 2012, pp 94-98.
[2] Barati J., Saeedian A., and Mortazavi S.S., “Damping
Power System Oscillations Improvement by FACTS
Devices: A Comparison between SSSC and
STATCOM”, World Academy of Science,
Engineering and Technology Vol. 4 2010, pp 135-145.
[3] Vamsee R.M., Bankarm D.S., Sailor J.,
“Superconducting Magnetic Energy Storage”,
National Conference on Reecent Advances in
Electrical Engineering and Energy system, 2010. pp 1-
5.
[4] Wen J, Jian X.J.,You G.G, Jian G.Z., “Theory and
Application of Superconducting Magnetic Energy
Storage”, Australasian Universities Power Engineering
Conference, 2006, pp 7-12.
[5] Hingorani, N.G., “Role of FACTS in a Deregulated
Market,” Proc. IEEE Power Engineering Society
Winter Meeting, Seattle, WA, USA, 2006, pp.1-6.
13
ISBN: 978-81-924893-0-8
[6] Molina, M.G. and P. E. Mercado, “New Energy
Storage Devices for Applications on Frequency
Control of the Power System using FACTS
Controllers,” Proc. X ERLAC, Iguazú, Argentina,
14.6, 2003, pp 1-6.
[7] Molina, M.G. and Mercado P.E., “Modeling of a Static
Synchronous Compensator with Superconducting
Magnetic Energy Storage for Applications on
Frequency Control”, Proc. VIII SEPOPE, Brasilia,
Brazil, 2002, pp. 17-22.
[8] Gyugyi I., Schauder C.D., “Kalyar K.S., Static
Synchronous Series Compansator: A Solid approach to
the series compensation of transmission line”, IEEE
Transaction on Power Delivery, Vol. 12, No. 1,
January 1997, pp 406-417.
[9] Choi S.S., Jiang F. and Shrestha G. ,“Suppression of
transmission system oscillations by thyristor
controlled series compensation”, IEE Proc., Vol.GTD-
143, No.1, 1996, pp 7-12.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Electronic toll collection based on Category of Vehicle

Using RFID

Gurpreet Singh Amrik Singh Harpal Singh

Guru Kashi University Guru Kashi University
Guru Kashi University
Talwandi sabo Talwandi Sabo
Talwandi sabo
ratandeep2@gmail.com harpalghuman11@gmail.com
gurpreetpeetu@yahoo.in

Abstract—Electronic toll collection approach is based on Radio (b) RFID reader

frequency identification is a contactless technique that uses the
radio waves to identify the object uniquely. With the help of
RFID Tag and Reader the Systems able to store the information
about the object when enters in the range of the Reader. The
paper focuses on automatic electronic toll tax collection based
on category of vehicle. Everyone has to pay different payment to
the authority according to the classification.
RFID reader is hardware Device that is used to fetch the
information from the tag. Antenna of reader produces the radio
waves. That received by in range tags. These waves are used to
activate the tags and send his information to the reader. Then
reader gathers the information. Reader is also known as antenna
or interrogator [4].

Keywords—RFID; Tag; Reader.

1. INTRODUCTION
Electronic toll collection based on categories of vehicle is
implemented with the help of Radio frequency identification
(RFID). Electronic toll collection (ETC) is technologies used on
highways for electronically deduct the toll tax payments from
owner's account automatically when pass the Toll Tax
Figure 1. RFID Tag
Collection point.the registered vehicles are capable to pay toll
tax electronically to toll tax authority. Vehicles are classified
into different category. Each has to pay different charges. Two
wheeler and four wheeler are not belongs to same category. Ex.
Bike, Taxi, Bus, Truck are belongs to different category and
have to pay different charges .the four wheeler are further
classified into sub categories, like a taxi and truck both belongs
to four wheeler but they have to pay different according to sub
category classification on the basis of load and size .Means that
whole vehicle divided in Different category, Each vehicle will
pay the different payment to the toll tax organization.

Overview of the RFID

RFID is a contactless technology that is used for identify any

vehicle or object .This system is identify any object without any
physical contact with the help of radio waves .This system can
identify object uniquely .The components which are used in
RFID technology that given below.[1]
(a) RFID tag
(b) RFID reader
(a) RFID tag
RFID Tag is the small card placed on the vehicle or object.
These tags have an internal memory which is used for store
some information .The antenna of the tag receives signal from
reader. Which are used for activates the tag then tag send stored
information to the reader [2][3].
Figure 2: RFID Reader
II. RELATED WORK
Electronic toll tax collection based on vehicle category is used
for automatic toll tax collection on major highways .Only
register vehicle can pay the automatically his payment or toll tax
.For registering any vehicle the organization of the toll tax
collection placed RFID tag (Hardware) on the vehicle . A
vehicle owner, wants to register has to submit his bank account
detail for automatic payment. Reader is used to detect the
vehicle when appear in the range of reader. . The classification
of the all vehicle is based on the vehicle’s size and vehicle’s type
.large and loaded vehicle must pay much as a comparer to small
vehicle .This system collect the payment automatically
according to the vehicle category .Means that different type of

14
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

vehicle pays the different payment to the toll tax collection
organization .The system first identify the type of vehicle and
then calculate the his payment .After this process, a system
collect the toll tax. This system solve the big problem of cash
payment .Nobody have to waste time at Toll Tax Collection
point because this system automatically identify vehicle and
deduct payment. This system does not get the time for paying
payment. So nobody needs to wait in a line for his payment.
[5][6]
to send the information. That information received by the reader
for identifying any vehicle. When reader reads information from
tag then reader forward that information to control unit
(CU).Control Unit have all information about the that ID number
which is received by the reader. Here system identify the type of
vehicle and calculate his payment .Then system automatically
deduct his payment from his bank account. This system is
capable to collect the toll tax from different type of vehicle. Here
different type of vehicle pays different payment to toll tax
organization.[9]

If anyone has not money in his account then system send a

III. PROPOSED WORK message him. There is system collect the payment from the
registration fee. When owner registered the vehicle then he has
Under the purposed work, insert the RFID Reader on the to pay that fee for emergency like if anyone’s account is null
highways. The RFID Reader is used for identifying or track any then system collect the payment from the registration fee .[10]
object or vehicle. This reader is connected with the central
processing unit and data base. RFID Tag (Hardware) is placed
on the vehicle during the registration time. That RFID Tag has a
unique vehicle identification number for uniquely identifying
any vehicle. Every vehicle’s vehicle identification number is
used to provide the information regarding the priority of the
vehicle and type of the vehicle. The system can uniquely identify
the object or vehicle & its owner with the help of vehicle
identification number. VIN is also known as tag number. [7]

Tag number: Every tag has unique number .In this system
that number divided into two parts, First three bits in 1st
part and remaining for second part. First three bits (first
part) is used for identifying the category of vehicle. The
system identifies the type of vehicle from the first three bits.
Second part of the tag is use for uniquely identifying any
vehicle and its owner. We can differentiate the whole
vehicles into 8 types. Type of vehicle =2n and here n
=number of the bits which are reserved.

Number of reserved bits = 3

With the help of 2n we can find the number of types like 23
= 8 .Here system reserve the first three bit then make the 8
combinations or types of the vehicles.

Types of vehicle: This system divided the whole vehicles in

some category .These categories are given below. Figure3: Communication between Tags and Reader

First category includes the bikes or small vehicle (also includes Pseudo code (algorithm) for electronic toll collection based on
all two wheeler vehicle in this category). Second category vehicle type with a RFID: The following given a pseudo code of
includes the three wheeler vehicle. Third category includes the this
cars and other small four wheeler vehicle like jeeps etc. Fourth
category includes the buses and trucks. Fifth category includes 1. Start
the Heavy and loader vehicle which are using transfer goods.
Some government vehicle like fire brigades and ambulances etc 2. Reader setup on the road and always generate Radio
which are includes in a sixth category. These are six categories waves
which pays different payment .If system reserve first three bit for
identification the vehicle then we can divide eight categories of
3. If
whole vehicles. Here we have six categories of vehicle and other
two combinations reserve for future. [8] Vehicle enter in the range of Reader then

Working of the system (a) antenna receive the radio wave and activate that
tag
A reader set up on the road. This reader reads the tags which are
placed on the every vehicle .Reader always generate the radio (b) Then activated Tag sends his information (id
waves which go to circulation area where from cross the road. number)
When any vehicle appears in the range of that Reader Then the
antenna of the tag which is placed on the vehicle captured radio
wave.After receiving the radio wave tag amplify that wave and
activate the internal circuitry of the tag.Activated tag is capable (c) That id receive by a Reader

15
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

(d) After receive the id then reader forward to next CONCLUSION

control unit
In previous system all vehicle pays equally on electronic toll
(e) Control unit check the type and calculate the collection Point using a RFID. But in manual system every
payment vehicle has to pay different charges on toll tax collection point.
Here loaded vehicle and small vehicle pays same. So in an
4. If (Vehicle is able to payment) “Electronic toll collection based on Category of Vehicle Using
RFID” is collecting the payment that is based on the category of
(a) Then system collects the payment.
vehicle. Here every vehicle pays Different according to their
End of inner IF statement. category.
5. Else (Some government vehicle like fire brigades and
ambulances etc) REFERENCES
(a) Free vehicle. [1] http://RFID.nordic.se
End of inner Else statement and [2] http://www.technovelgy.com/ct/technology-
article.asp?artnum=50
End of outer If statement [3] Elisabeth ILIE-ZUDOR “The RFID Technology and Its
Current Applications”, MITIP mmk2006, ISBN 963
6. Else 86586 5 7, pp.29-36
[4] http://rfid-managerialviewpoint.blogspot.in/2011/01/rfid-
Reader did not find a Tag. tag-and-reader.html
End of else statement [5] Electronic toll collection system using passive RFID
technology, 1khadijah kamarulazizi, 2dr.widad ismail
7. End. [6] An RFID-Based Intelligent Vehicle Speed Controller Using
Active Traffic Signals Joshue Perez , Fernando Seco,
The flow chart given below represents the flow of system and Vicente Milanes, Antonio Jimenez, Julio C. Diaz and
algorithm. Here system check the type of vehicle and collect his Teresa de Pedro
payment. [7] Harpal Singh “Intelligent Traffic Lights Based on RFID”,
International Journal of Computing & Business Research,
pp 13
[8] Sudha Bhalekar, Adesh Chanageri G., Indra Prakash
Chauhan “Automatic Toll Tax Using RFID” International
Journal of Computer Technology and Electronics
Engineering (IJCTEE) Volume 3, Special Issue, March-
April 2013, An ISO 9001: 2008 Certified Journal
[9] Gurpreet singh “ Automatic payment collection on Petrol
pump Using RFID” International Journal of Advance
Research in Computer Science and Management Studies,
Volume 2, pg. 611-616
[10] Chong hua Li “Automatic Vehicle Identification System
based on RFID”, Anti Counterfeiting Security and
Identification in Communication (ASID), 2010, pp 281-
284.

16
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
EXTENDED LOCAL BINARY PATTERN FOR FACE
RECOGNITION
Jatinder sharma
BGIET, Sangrur
sharma.jatinder70@gmail.com
ABSTRACT
This research Paper represents a recent use of the
extended local binary pattern for face recognition.
Extended Local Binary Pattern (ELBP) Technique is
more accurate and describes the texture and shape of a
digital image by using of 3*3 & 5*5 matrices we have to
compare the performance of both matrices so that how
we recognize the image.Variance help to measure
continuous output where the quantization is needed. By
dividing an image into several small region from which
the feature are extracted.if match is found then image
face is recognized otherwise if match does not found
then image face is not recognized. If we saw at the mirror
we can see that our face has different type of human
expression. These are the peak and valley that make up
the different facial features
Keywords
LBP, Face Recognition, Extended LBP, Histograms.
(1) INTRODUCTION
Facial expression play very important role in the human
being life. As we know that according to JAFFE database
there are mainly seven type of face expression i.e. Angry,
Fear, Neutral, Surprise, Disgust, Happy, Sadness. It is
basically software and is based on the ability to first
recognize face which is a technological feat in itself.
Vision define these landmark as the nodal point, these
are about so nodal point on a human face. Facial
expression is one of the utmost dominant unbiased and
instantaneous means for socialbeings to communicate
their feeling and intensions. It is easy process of
communication in which we exchanges the
distinguishable ideas, information, data transfer from one
place to another.
In the Local binary pattern the limitation is that reflect
information of images which is encountered only in the
first derivation and on the other side it does not occur in
the velocity about local variations. However when we
using the extended LBP operatorwhich help out original
image and gradient magnitude.Face can also be seen as a
composition of various micro patterns which can be well
describe by LBP operator.
17
ISBN: 978-81-924893-0-8
Rishav dewan
BGIET, Sangrur
reshav.dewan@gmail.com
In the Basic LBP operator as we normally seen that it
assign a label to every pixel of image by thresholding the
3*3 matrices and by considering the result also as an
binary number In the extended LBP normally an image
is divided into small micro patterns i.e 64 regions.By
the using of extended LBP neighborhood of P which has
notation(P.R) consider the sample points of circle.
1.1. LOCAL BINARY PATTERN
Local Binary Pattern (LBP) is a humble however actual
well-organized smoothness operative which tags the
pixels of an appearance by thresholding the region
of every pixel and reflects the product as a two numeral.
Due to its discriminative control and computational
easiness, LBP smoothness operative has developed a
general method in several presentations. The situation
container be realised as a uniting approach to the
usually different arithmetical and important simulations
of smoothness examination. Perchance the greatest
significant things of the LBP operative in actual ideas is
its strength to monotonic gray-scale variations produced,
for sample, by lighting variations. Additional essential
stuff is its computational plainness, which types it
promising to analyze pictures in stimulating actual
surroundings. The simple impression aimed at emerging
the LBP operative was that flattened shallow feels can
be labelled by binary balancing events: native three-
dimensional designs and gray rule distinction. The
unique LBP operative (Ojala ) et al. 1996) forms
labels for the image pixels by thresholding the 3 x 3
neighborhood of all pixel with the center charge
then since the consequence as a two integer. The
histogram of the 28 = 256 dissimilar tags container then
be rummage-sale by way of a smoothness descriptor.
This worker used together by a modest native
difference measure provided actual decent
presentation in unsupervised texture segmentation
(Ojala and Pie tikäinen 1999)After this many related
approaches must stood industrialised for smoothness
and color smoothness separation. The LBP operative
remained extended to usage neighborhoods of
dissimilar scopes ( Ojala et al. 2002). By a
round neighborhood and bi linearly inserting standards
at non-integer pixel organizes let some range and amount
of pixels in the region. The gray rule alteration of the
native region container be charity as the balancing
difference size. Now the next, the representation (P,R)
determination be rummage-sale for pixel neighborhoods
which incomes P sample opinions on a ring of range of
R. See Fig. 2 for an sample of LBP division.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

If we assume gray value of central pixel and adjacent

20 30 22 0 0 0 pixel is 253 & 252 respectively sign information is
extracted by layer1 and two other binary unit {i2,i3}are
29 33 69 0 1 used to encode for GD.
36 48 51 1 1 1 Local Binary Pattern:-
Additional extra time to the unique operative is the
meaning of supposed unchanging designs, which
Threshold 33 container be rummage-sale to decrease the distance of
the eye course and tool a humble rotation-invariant
descriptor. This postponement remained enthused by
Figure :- Basic LBP operator Binary : 00011110 the detail that certain two designs happen additional
Decimal : 30 usually in smoothness imageries than others. A native
two design is called unchanging if the two design covers
at greatest binary bitwise changes after 0 to 1 or evil
Local Binary Pattern (LBP) is a kind of piece used for versa once the minute design is crossed circularly.
organization now processor visualization. LBP remained Aimed at instance, the patterns 00000000 change
first suggested in 1996 for analysis of texture of gray- 01110000 (2 changes) and 11001111 (2 changes) are
scale images. LBP remained found to be invariant by unchanging while the designs 11001001 (4 changes)
small deviations of light disorder and small revolutions .
and 01010010 (6 changes) are not. In the computation of
the LBP tags, unchanging designs are rummage-sale
so that there is a distinct tag for all unchanging design
and altogether the non-uniform designs are labeled with
1.2. EXTENDED LOCAL BINARY a solitary tag. Aimed at instance, once using (8,R)
PATTERN region here are a entire of 256 designs, 58 of which are
unchanging, which harvests in 59 dissimilar tags. Ojala
et al. (2002) saw in their trials with smoothness
pictures that unchanging designs explanation aimed at a
One type of Extended Local binary pattern (ELBP) was slight fewer than 90% of all designs once by the (8,1)
suggested It is similar to 3DLBP The ELBP Operator not
region and aimed at about 70% cutting-edge the
only refer to binary comparison between the central pixel
& its adjacent Pixels .It definitely encode the exact gray (16,2)region . All bin (LBP code) container be stared as a
level value differences between them by adding various micro-text on. Native primitives which are organized
binary units and number of additional binary unit k is through these baskets comprise dissimilar kinds of bent
defined by GD limits, acnes, level parts etc. The next representation
remains rummage-sale aimed at the LBP worker:
LBPP,Ru2. The subscript signifies by the operative
cutting-edge a (P,R) region Superscript u2 attitudes for
by first unchanging designs then labeling altogether
residual designs by a solitary tagin which n is the amount
of dissimilar tags shaped by the LBP worker, then
I{A} is 1 if A is correct and 0 if A is incorrect. In the
LBP approach for texture classification, the incidences of
the LBP codes in an image are collected into a
histogram. The classification is then performed by
computing simple histogram similarities. However,
considering a similar attitude for facemask
appearance demonstration marks fashionable a damage
of altitudinal data then thus unique must organize
the smoothness facts however holding also their scenes.
Any method to reach this aim is to practice the LBP
smoothness descriptors to shape some limited images of
the façade and association them hooked on a worldwide
explanation. Such resident images must been ahead
attention recently which is comprehensible assumed the
limits of the general pictures. These limited eye founded
Fig: An example of Extended LBP Operator
approaches remain additional healthy alongside
At same time K control the concerned maximum of GD differences in position or lighting than general
& also approaches.

18
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The elementary policy for LBP founded appearance movie orders, though Zhao et al. (2009) accepted the

narrative future through Ahonen et al. (2006) stays by LBP Highest method toward graphic language credit

way of glooms: The facemask appearance remains realizing cutting advantage presentation deprived of

distributed keen on limited sections then LBP error-prone segmentation of moving lips. In addition to

smoothness descriptors remain take out since every area face and facemask appearance acknowledgment, the LBP

freely. The descriptors are then concatenated to form a takes too remained rummage-sale in numerous additional

global description of the face, This histogram well requests of biometrics, counting sense localization, iris

consumes a narrative of the appearance happening three credit, impression acknowledgment, award pattern

changed ranks of zone LBP tags aimed at the histogram acknowledgment, walk acknowledgment besides

cover data nearby the patterns on a pixel-level, the labels facemask stage organization. Orientations toward

are summed over a small region towards yield evidence numerous of these everything container remain originate

arranged a county near then the local histograms remain after the LBP list.

concatenated to shape a worldwide account of the

1.3.FORMULAS & CALCULATIONS:-
appearance. It must be renowned that once spending the
For calculate Extended local binary technique we used
histogram founded systems the sections organize not
this given formula which is given below :-
essential toward remain four-sided. Neither fix they

essential toward stay of the similar magnitude or form,

besides they prepare not essentially must to protection

the entire copy. The situation stays too probable toward

must somewhat meeting areas. The flat appearance

explanation technique has remained lengthy hooked on 2. FLOW OF ALGORITHM :

spatiotemporal area portrays facemask look explanation
start
by LBP-TOP. Outstanding facemask appearance

acknowledgement presentation takes remained got by

this method. Meanwhile the magazine of the LBP Divide Extended LBP Features into
founded appearance explanation, the method takes Subsets

previously achieved an recognized place popular

appearance examination investigation then requests. A Select Extended LBP Feature

Candidates by using Boosting
famous specimen is brightness invariant appearance
Learning Process
acknowledgement organization planned through Li et al.

(2007), merging NIR imaging by LBP geographies then

Advertisement improvement knowledge. Zhang et al. Generate Pool of New Extended LBP
Feature Candidates
(2005) future the removal of LBP topographies after

pictures got through sifting a facemask copy by 40 Gabor

strainers of dissimilar balances and locations, Construct Extended LBP Feature Set
procurement unresolved marks. Hadid and Pietikäinen

(2009) castoff spatio time-based LBPs aimed at

expression then sexual category acknowledgment after End

19
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3. RESULT AND CONCLUSION
Extended Local binary pattern (LBP) is used for face
recognition. Apply Extended LBP on Different Windows
size i.e. 3x3 and 5x5Compare the result with ELBP with
Different Windows size. The invariant texture which has
been classify with Local Binary pattern has powerful
texture feature In this Variance help to measure
continuous output where quantization is needed. The
basic version of LBP consider measurements from a 3*3
pixel squareis the binary code.In the face recognition it
is basically based on the ability to first recognize face It
also used in the image analysis database and computer
vision database.it has many application like security
,authentication, human identity matching, online
banking, netbanking, airport , defence etc .The best
example is that human eye is uses as identity in the
Aadharcard . The face represent mainly human face
expression, ideas and mentality of the person.As we
know that many public place like Bus stand,Railway
station ,Bank ,Cinema hall have uses Surveillance
camera for video recording and capture the photos for
security purpose It focuses on detecting face and
distinguishing one face from another if you uploaded a
photo on facebook and prompted to tag a particular face
as a particular friend
. A preprocessed appearance is also distributed into 64
section The LBP method takes run to important growth
in feel examination. It is generally castoff all finished the
creation together in investigation and submissions.
Unpaid to his discriminative influence then compu
20
ISBN: 978-81-924893-0-8
tational easiness, the technique consumes remained
actual positive in numerous such processor glitches
which remained not previous smooth viewed as
smoothness difficulties, such as appearance examination
and signal examination (Pietikäinen et al. 2011). For a
catalogue of LBP correlated investigation and relations
towards numerous passes
The LBP article course, in its humblest procedure, is
shaped in the next way:
 Division the searched gap into cubicles (e.g.
16x16 pixels for every lockup).
 Aimed at every pixel in a booth, associate the
pixel to every of its 8 neighbors (on its
leftward highest, left hand central, leftward
lowermost, correct highest, etc.). Survey the
pixels beside a round, i.e. circular or pledge
circular.
 Anywhere the middle pixel worth is better
than the neighbor's worth, inscribe "1". Then,
inscribe "0". This stretches an 8-digit two
amount
 Calculate the histogram ended the lockup, of
the incidence of all "amount" happening
Optionally regularize the histogram.
An valuable postponement to the unique worker is the
consequently named unchanging design which container
remain rummage-sale to decrease the distance of the
piece course and tool a humble revolution invariant
descriptor. This impression is interested by the aspect
that selected two policies happen additional usually in
smoothness pictures than others. A native two design is
named unchanging if the two arrangement comprises at
greatest binary 0-1 or 1-0 changes. For sample,
00010000 is a unvarying project, 01010100(6 changes)
is not. In the calculation of the LBP histogram, the
histogram consumes a distinct basket for every uniform
pattern, and all non-uniform patterns are assigned toward
a solitary basket. By unchanging arrangements, the
distance of the article direction aimed at a 3x3 frame
decreases since 256 toward 59.
4. FUTURE SCOPE
Apply extended LBP on Different Windows size i.e 3x3
and 5x5. and also Compare the result with ELBP with
Different Windows size .
5. ACKNOWLEDGEMENTS
Our heartly thanks to the project guide Mr Rishav Dewan
who have contributed towards development of the above
stated paper.
REFERENCES
[1] Ahmed Faisal, HossainEmam, Bari A.S.M.
Hossain and Shihavuddin ASM, “Compound
Local Binary Design CLBP aimed at Healthy
Facemask Appearance Acknowledgment”,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

12th IEEE Global Conference on [6] DiHuang CaifengShan,MohsenArdebilian,Limi

Computational Cleverness and Informatics • ng Chen, “Facial Image Analysis Based on
21–22 November, 2011 • Budapest, Hungary, Local Binary Patterns: A Survey” – IEEE
PP.: 391-395, 2011.
[7] G. Guo, C.R. Dyer, “Simultaneous feature
[2] Ahmed Faisal and Kabir Md. Hasanul,
selection and classifier training vialinear
“Directional Ternary Pattern ( DTP) for Facial
programming: a circumstance education aimed
Expression Recognition”, IEEE International
at expression communication
Conference on Consumer Electronics (ICCE),
acknowledgment”, :IEEEConference on
IEEE, PP.:265-266, 2012.
Computer Vision and Pattern Recognition
(CVPR), 2003.
[3] Bartlett Marian Stewart, Littlewort Gwen,
Frank Mark, Lainscsek Claudia,Fasel Ian and
[8] Liao Shu, Fan Wei, Chung Albert C. S. and
Movellan Javier, “Recognizing Facial
Expression: Machine Learning and Application Yeung Dit-Yan, “Facial expression
toSpontaneous Behavior”. Recognition using Advanced Local Binary
Patterns, tsallis Entropies and Global
[4] Chuang Chao-Fa, Shih FrankY., “Recognizing
facial exploit components by self-governing Appearence Features” IEEE, PP.: 665-668,
constituent examination then provision course 2006.
mechanism”, Elsevier, PP.: 1795 – 1798, 2006

[5] Do, Hyungrok, “Image Recognition Technique

using Local Characteristics of Sub sampled
Images”, EE368 Digital Image Processing,
PP.:1-5, 2007.

21
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Analysis and implementation of a Full Adder circuit
using Xilinx Software
Girdhari Agarwal Bobbinpreet Kaur
ECE(student) ECE(AP)
Chandigarh group of colleges Chandigarh group of colleges
Mohali, India Mohali, India
girdhari9933112222@gmail.com bobbinece@gmail.com
ABSTRACT
This paper presents the novel method to analyze and
implement a full adder circuit using VHDL Technology. The
results include successful compilation of the VHDL code in
the Xilinx software along with the waveforms that prove the
legality of the truth table. This paper also shows the effective
use of Xilinx software in the analysis of the full adder circuit.
It shows the Register Transfer Level (RTL) schematic
diagrams and technology schematic diagrams of the different
VHDL architectural styles of modeling that include dataflow
modeling, behavioral modeling and structural modeling. The
analysis includes the detailed analysis of the fitter report and
the timing report along with the synthesis report of the design
summary. It also shows the chip floor plan of the full adder
circuit.
General Terms
Wave simulation, chip floor, architectural, truth table,
karnaugh map.
Keywords
Full Adder, Xilinx, VHDL, design.
1. INTRODUCTION
One of the most fundamental arithmetic operations that are
widely used in digital system is addition. Addition is the basic
operation of all logic and arithmetic operations that can be
performed in a digital system. The term „digital system‟ is not
only limited to a low-level component that can be designed
theoretically on paper, but it also extends its hierarchy up to
the designing the complete system over a chip or board. It is
not always possible to understand the system completely in
case of higher levels of hierarchy due to the increased
complexity of the digital system at these levels. Thus to
overcome this complex situation, VHDL technology is used
which makes the design of the system simpler and easy to
understand.[6]
This paper describes the analysis and implementation of a full
adder circuit with the help of VHDL technology so that the
chip or on board design of the full adder system gets easy to
implement as it meets the less complexity requirement. One of
the most popular and easy approach to VHDL technology is
done with the help of Xilinx software that allows us to
compile our VHDL code to a machine level program and then
implement it on hardware i.e. on the chip or board. The paper
also shows that how efficiently our digital system i.e. a full
adder can be implemented and analyzed completely using this
software.[9] The analysis part shows the RTL view,
technological map, chip floor plan and wave forms of voltage
22
ISBN: 978-81-924893-0-8
Amandeep Kaur
ECE(AP)
Chandigarh group of colleges
Mohali, India
amandeepece.cgc@gmail.com
v/s time with varying input and their respective output so as to
verify the truth table of the full adder circuit.
Following text is divided into five sections. Section 2 refers to
the previous papers and the literature reviews of those papers
on the same field. Section 3 describes the full adder and its
design, section 4 describes the various VHDL architectural
styles, section 5 describes the implementation of the full adder
circuit using the various architectural designs as discussed in
section 4 and the last section i.e. section 6 describes the
analysis of the design.
2. LITERATURE REVIEW
Rupesh Prakash Raghatate explained a brief overview about
the full adder circuit using VHDL[1] in the paper titled,
“Design and implementation of Full adder using VHDL and
its verification in analog domain”. He implemented the circuit
using VHDL in QuartusII.
Rajendra Kumar explained about the implementation of full
adder in the addition of multi bit using the carry look ahead[3]
in his paper titled, “Performance analysis of different bit carry
look ahead adder using VHDL Environment.”
3. FULL ADDER DEESIGN
A full adder is a combinational digital circuit with three inputs
and two outputs. The full adder circuit has the ability to add
the three 1-bit binary numbers (Input1, Input2, Input3) and
results in two outputs (Sum, Carry). The fig. 1 below shows
the basic logic diagram of the full adder circuit, Table 1 that
shows the truth table and fig. 2 shows the K-Map reduction
for the two outputs from the truth table.[4]
3.1 Logic Design
Fig 1: Basic logic diagram for a full adder[5]
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.2 Truth Table 4. VHDL

Table 1. Truth Table for full adder
Hardware Descriptive Languages (HDL) are the basic
language that are used for the designing of most of the digital
circuits using software tools. VHDL is one of most important
type of HDL. VHDL is the abbreviation for “Very High
Speed Integrated Circuit Hardware Description Language
(VHSIC HDL)”. [2]
VHDL is supposed to be the heart for the production of
electronic design of any digital circuit. With the advancement
of time and the shrinking of the semiconductor device
dimensions into compact sizes, the VHDL has gained a lot of
importance.
There are three architectural styles of modeling of a VHDL
statement. The internal functionality of digital circuit can be
specified using any of the modeling styles as discussed
below[8]:

4.1 Structural
A structural architectural design refers to the architectural
design where all the used components are interconnected to
each other.

4.2 Dataflow
3.3 Karnaugh Map A dataflow architectural design refers to the architectural
design where a set of concurrent assignment statements are
used to design the program.

4.3 Behavioral
A behavioral architectural design refers to the architectural
design where a set of sequential assignment statements are
used to design the program.

5. IMPLEMENTATION
Entity statement[7] :
entity Full_Adder is
Port ( Input1 : in STD_LOGIC;
Input2 : in STD_LOGIC;
Input3 : in STD_LOGIC;
Sum : out STD_LOGIC;
Carry : out STD_LOGIC);
end Full_Adder;

Architectural design using:

Fig 2: K-Map for logic Sum
5.1 Structural
architecture Structural of Full_Adder is
signal xor_1, and_1, and_2:STD_LOGIC;
component XOR1 port(A, B : in STD_LOGIC;
X: out STD_LOGIC);
end component;
component OR1 port(M, N : in STD_LOGIC;
Y: out STD_LOGIC);
end component;
component AND1 port(P, Q : in STD_LOGIC;
Z: out STD_LOGIC);
end component;
begin
X1:XOR1 port map(Input1, Input2, xor_1);
X2:XOR1 port map(xor_1, Input3, Sum);
A1:AND1 port map(Input1, Input2, and_1);
A2:AND1 port map(xor_1, Input3, and_2);
Fig 3: K-Map for logic Carry O1:OR1 port map(and_1, and_2, Carry);
end Structural;

23
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

5.2 Dataflow 6.1.1 Structural

architecture DataFlow of Full_Adder is
signal xor_1, and_1, and_2:STD_LOGIC;
begin
xor_1 <= Input1 xor Input2;
and_1 <= Input1 and Input2;
and_2 <= xor_1 and Input3;
Sum <= xor_1 xor Input3;
Carry <= and_1 or and_2;
end DataFlow;

5.3 Behavioral
architecture Behavioral of Full_Adder is
begin
process(Input1, Input2, Input3)
begin Fig 5: RTL Schematic for structural
if (Input1='0') and (Input2='0') and (Input3='0')
then Sum<='0'; Carry<='0'; 6.1.2 Dataflow
elsif (Input1='0') and (Input2='0') and (Input3='1')
then Sum<='1'; Carry<='0';
elsif (Input1='0') and (Input2='1') and (Input3='0')
then Sum<='1'; Carry<='0';
elsif (Input1='0') and (Input2='1') and (Input3='1')
then Sum<='0'; Carry<='1';
elsif (Input1='1') and (Input2='0') and (Input3='0')
then Sum<='1'; Carry<='0';
elsif (Input1='1') and (Input2='0') and (Input3='1')
then Sum<='0'; Carry<='1';
elsif (Input1='1') and (Input2='1') and (Input3='0')
then Sum<='0'; Carry<='1';
elsif (Input1='1') and (Input2='1') and (Input3='1')
then Sum<='1'; Carry<='1';
end if;
end process; Fig 6: RTL for Dataflow
end Behavioral;
6.1.3 Behavioral

6. ANALYSIS
6.1 Register Transfer Logic(RTL)
schematic of the above written architectural
designs:

Fig 4: RTL Schematic for the block Fig 7: RTL for Behavioral

24
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

6.2 Wave Simulation

Fig 8 – Wave simulation

TABLE V. EQUATIONS
6.3 Fitter Report
TABLE II. SUMMARY ********** Mapped Logic **********

Design Name Full_Adder

Carry <= ((Input1 AND Input3)
Fitting Status Successful
OR (Input1 AND Input2)
OR (Input3 AND Input2));
Software Version M.81d

Device Used XA9536XL-15-VQ44

Sum <= NOT (Input2
XOR
Sum <= NOT (((Input1 AND Input3)
TABLE III. RESOURCES SUMMARY OR (NOT Input1 AND NOT Input3)));

Function
Macrocells Pterms Registers Block
Pins Used
Used Used Used Inputs 6.4 Timing Report
Used
TABLE VI. DATA SHEET REPORT FOR PAD TO PAD LIST
2/36 (6%) 6/180 (4%) 0/36 (0%) 5/34 (15%) 6/108 (6%)
Source Pad Destination Pad Delay

TABLE IV. PIN RESOURCES Input1 Carry 15.500

Signal Type Required Mapped Input1 Sum 15.500

Input 3 3
Input2 Carry 15.500
Output 2 2
Input2 Sum 15.500
Bidirectional 0 0
Input3 Carry 15.500
GCK 0 0
GTS 0 0 Input3 Sum 15.500

GSR 0 0

25
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
6.5 Chip Floor Diagram
Fig 9 – Chip Floor Diagram
7. CONCLUSION
This paper implements Full adder circuit using Xilinx that
help us to design a full adder with the help of a general 44 pin
cmos device. XA9536XL-15-VQ44 is the device used to
successfully fit the layout of Full adder on chip, the
XA9536XL-15-VQ44 has 44 pins out of which pin 30, 31 and
28 are used as inputs and pin 41 and 38 are used as sum and
carry output respectively. The wave simulations show about
all the possible inputs for a full adder and their respective
outputs to verify the truth table. Further, more improvement
can be made in the design for optimized implementation by
varying the design methodology. This full adder circuit can be
further used in addition of 2 multi-bits binary numbers using
the concept of carry look ahead in which the carry from the
least significant bit is carried to its successive significant bit.
REFERENCES
[1] Rupesh Prakash Ragahtate, 2013, “Design and
implementation of Full adder using VHDL and its verification
in analog domain”, International Journal of Engineering
Science Invention, Volume 2 Issue 4 ǁ April. 2013 ǁ PP.35-
39.
[2] Jayaram Bhasker, A VHDL Primer(PTR Prentice Hall
Englewood cliffs, New Jersey 07632).
26
ISBN: 978-81-924893-0-8
[3] Rajender Kumar, Sandeep Dahiya, 2013, “Performance
analysis of different bit carry look ahead adder using VHDL
Environment”, International Journal of Engineering Science
and innovative technology, Volume 2 Issue 4 ǁ April. 2013 ǁ
PP.80-88.
[4] A. Anand Kumar, Fundamentals of Digital Circuits(PHI
2nd edition).
[5] Prashant Gurjar and Rashmi Solanki, 2011, VLSI
Implementation of adders for high speed ALU., International
Journal of Computer Applications, vol. 29-No. 10, PP-11-15.
[6] Floyd, Digital Fundamentals, Pearson Publications, 10th
edition.
[7] Xilinx inc., Xilinx student edition 4.2i, PHI. 1st edition,
2002
[8] Pedroni, 2004 Circuit design with VHDL, MIT Press,
Cambridge, England, PP-159-186
[9] Chiuchisan, Potorac, 2010, Finite state machine design
and VHDL coding techniques, 10th international conference
on development and applications systems, Romania, PP-273-
278.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Automatic Detection of Diabetic Retinopathy from Eye

Fundus Images: A Review
Manpreet Kaur Mandeep Kaur
Department of Electronics and Communication Department of Electronics and Communication
Engineering, Punjabi university Patiala, Punjab, Engineering, Punjabi university Patiala, Punjab,
India India
manpreet89sidhu@gmail.com ermandeep0@gmail.com

water from blood vessels. (ii) Proliferative diabetic

ABSTRACT retinopathy (PDR) is the more advanced form of the disease. At
Diabetic Retinopathy(DR) is one of the eye diseases that people this stage new fragile blood vessels begin to grow in the retina and
with diabetes may face as a complication of diabetes. It cause into the vitreous. The new blood vessel may leak blood into the
severe vision loss or even blindness. Therefore, to prevent severity vitreous, and also these vessels get damaged due to extremely high
pressure in the eye. If left untreated, PDR can cause severe vision
of this disease it is essential to detect it at early stage. Automatic
loss and even blindness.
detection of DR has taken over manual screening of eye fundus
images in time constraints as well as to estimate the severity of
disease. The algorithms for automated DR detection involves
retinal image preprocessing, blood vessel enhancement and
segmentation and optic disk localization and detection which
eventually lead to detection of different DR lesions. In this paper,
the review of techniques, algorithms and methodologies used for
automatic detection of DR in eye fundus images is presented.

Keywords
Automated detection; Diabetic retinopathy; Fundus photographs;
optic disk; blood vessels.

1. INTRODUCTION
In patients with diabetes, prolonged periods of high blood sugar can Fig.1. Retinal Fundus Image
lead to the accumulation of fluid in the retina along the blood
vessels, which eventually leads to blurred vision. The WORLD
However, risk of vision loss due to diabetic retinopathy can be
HEALTH ORGANIZATION (WHO) has evaluated that Diabetic
reduced by effective control of serum glucose and blood pressure
retinopathy is on the priority list of eye conditions which can be
and by its early detection and timely treatment. Fundus
partly prevented and treated. It is recommended that eye care
photography is used to document the anatomical parts of retina
services for diabetic patients be incorporated into strategic VISION
such as optic disc, fovea, blood vessels and abnormalities related to
2020 national plans. Well tested international guidelines should be
diabetic retinopathy (damage to the retina from diabetes) such as
followed to detect diabetic retinopathy at early stage. Diabetes is a
microaneurysms, hemmorhages, exudates etc. as shown in fig.1.
disease that interferes with the body's ability to use and store sugar,
This is because retinal details may be easier to visualize in
and cause imbalance of sugar levels in the body, which eventually
stereoscopic fundus photographs as opposed to with direct
can cause many other health problems, including the eyes.
examination. Early diagnosis is very important to control rapid
increase in the number of instances of diabetic retinopathy.
Over time, diabetes affects the circulatory system of the retina.
Diabetic retinopathy is the result of damage caused by diabetes to
the small blood vessels located in the retina. Blood vessels The potential solution is to develop an algorithm that can
damaged from diabetic retinopathy can cause vision loss. The automatically detect it at early stage so that ophthalmologist could
longer a person has diabetes, the more likely they will develop give more time for patients which require their attention rather
diabetic retinopathy. Diabetic retinopathy is classified into two seeing each and every fundus image. The speedy growth of
types: (i) Non-proliferative diabetic retinopathy (NPDR) is the
information processing system and the emergence of inexpensive
early state of the disease. In NPDR, the blood vessels in the retina
are weakened causing tiny bulges called microanuerysms (MAs) to ophthalmic imaging devises have led to the development of
protrude from their walls. The abnormal bleeding from blood automated techniques for detection of diabetic eye diseases. This
vessels results in hemmorhages having dark blot configuration in paper provides review of various automated techniques along with
the eye fundus image. Exudates are bright yellow marks in the their strength and weakness. In this review we discuss various
retina that occurs due to leakage of fats and proteins along with

27
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

algorithms on automated detection of retinal features based on 3. EVALUATION and PERFORMANCE

digital image analysis.
MEASURES
For automated detection of lesions in fundus images two measures
2. METHODOLOGY are mostly used: sensitivity and specificity. Confusion matrix is
Automatic detection of diabetic retinopathy is very important for used for measuring the sensitivity and specificity.
diagnosing the disease to prevent blindness. With the help of
automated system, the work of optahlmologists can be reduced and Predicted class  C1(YES) C2(NO)
the cost of detection of diabetic retinopathy can also be reduced. Actual class
Most of the existing methods of automatic detection work in three
stages: (i) image pre-processing, (ii) detection and segmentation of C1(YES) TP FN
optic disc and retinal blood vessels, (iii) extraction of lesions (hard
or soft or both). C2(NO) FP TN

First stage requires image preprocessing for the reduction of noise

and contrast enhancement. Mostly Image preprocessing is Fig.3. Confusion Matrix
performed on the green color plane of RGB image because in green
color plane higher contrast is obtained with the background. The The sensitivity is defined as the ability of a test to detect correctly
presence of non retinopathic features such as blood vessels, optic people with a disease or condition.
disc which may contain similar color, contrast as that of other
retinal features, might lead to a non retinopathic feature be wrongly
classified as a retinopathic feature. Hence, in second stage optic
disc and blood vessels are segmented from the fundus image for the
reduction in false positives. After the optic disc and blood vessel The specificity is defined as the ability of a test to exclude properly
network localization the exudates, hemorrhages and people without a disease or condition.
microaneurysms are extracted from the images. Microaneurysms
and hemorrhages detection(dark red regions) requires the removal
of other brighter regions such as exudates and optic disc. Detection
of hard exudates that are brightly colored is difficult in presence of
TP(True positive): Sick people correctly diagnosed as sick.
other brighter regions i.e., blood vessel network and the optic
FP(False positive): Healthy people incorrectly identified as sick.
disc,hence these must be removed before extracting exudates. In
TN(True negative): Healthy people correctly identified as healthy.
some cases, severity of diseas i.e. normal, mild or severe has also
FN(False negative): Sick people incorrectly identified as healthy.
been detected.

4. LITERATURE SURVEY
In 2010, Hussain F. Jaafar et al.[3] proposed an automated method
for the detection of exudates in retinal images. The proposed
method was adapted to deal with different types and qualities of
images through taking all image information into account. The
performance of the proposed method was measured against
clinician hand-labelled images. Comparing with some recent
related works, the proposed method indicates an improvement in
the specificity and accuracy measures and reasonable sensitivity.
Candidates were detected using a combination of coarse and fine
segmentation. The coarse segmentation was based on a local
variation operation to outline the boundaries of all candidates
which have clear borders. The fine segmentation was based on an
adaptive thresholding and a new split-and-merge technique to
segment all bright candidates locally.A limitation in this work was
that it occasionally fails to exclude some non-exudate objects
particularly those that have similar features to real exudates.
Performance measure shows that exudates were detected from a
database with 89.7% sensitivity, 99.3% specificity value.

Fig.2. Flow chart showing methodology. Then, Carla Agurto et al. (2010) [4] used multiscale amplitude-
modulation-frequency modulation (AM-FM) method to

28
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
discriminate between normal and pathological retinal images. All
the lesions associated with DR i.e. microaneurysms, exudates,
hemorrhages were detected. The texture feature vectors consist of
cumulative distribution functions of the instantaneous amplitude,
the instantaneous frequency magnitude, and the relative
instantaneous frequency angle from multiple scales are used.
Distance metrics between the extracted feature vectors is used to
measure interstructure similarity. Good sensitivity for the
abnormal images versus normal images and high
sensitivity/specificity for IR versus normal images were obtained
by this method. This algorithm allows the user to obtain a detailed
analysis of the images since the features are extracted by regions.
This paper reports on the first time that AM-FM has been used with
a multiscale decomposition of retinal structures for the purposes of
classifying them into pathological and normal structures. The
results demonstrate a significant capability to differentiate between
retinal features, such as normal anatomy (OD and retinal vessels),
from lesions (MAs, hemorrhages, and exudates).
Usman M. Akram et al. (2011) [5] proposed a digital diabetic
retinopathy system for early detection of diabetic retinopathy. The
algorithms for retinal image preprocessing, blood vessel
enhancement and segmentation and optic disk localization and
detection which eventually lead to detection of different DR lesions
using proposed hybrid fuzzy classifier is presented. First step of
proposed system is preprocessing, in which the background and
noisy area is separated from the overall image to enhance the
quality of acquired retinal image and to lower the processing time.
After preprocessing, blood vessels are enhanced and segmented by
using Gabor wavelet and multilayered thresholding respectively.
Then optic disk is localized using average filter and thresholding
and detected the optic disk boundary using Hough transform and
edge detection. After segmenting blood vessels and OD, dark and
bright lesions are detected using hybrid fuzzy classifier.
Keerthi Ram et al. (2011) [6] proposed a new method for automatic
MA detection from digital color fundus images The MA detection
is formulated as a problem of target detection from clutter, where
the probability of occurrence of target is significantly smaller
compared to the clutter. To progressively lower the number of
clutter responses a successive rejection-based strategy is proposed.
By using a set of specialized features the processing stages are
designed to reject specific classes of clutter while passing majority
of true MAs. The remained true positives after the final rejector are
assigned a score depending on its similarity to a true MA. To
characterize the clutter and MA structures a new set of
morphological and appearance-based features are used. In previous
approaches, a single classification step is used to distinguish
between the target and multiple subgroups of clutter class together
which demands design complexity in feature space and underlying
classifier. The proposed processing pipeline separates both classes
and further allows various subgroups of clutter class to be handled
through a cascade solution. This gives flexibility to achieve an
independent optimal solution for individual subtasks and helps
simplify the final classification step (L stage) by reducing the
number of clutter subgroups to be handled.
29
ISBN: 978-81-924893-0-8
Then, L. Giancardo et al. (2011) [7] we propose a new
microaneurysms segmentation technique based on a novel
application of the radon transform, which is able to identify these
lesions without any previous knowledge of the retina
morphological features and with minimal image preprocessing. In
this paper we present a MA detector based on a novel radon-based
approach. The radon based features allows the detection of MAs
directly on the original image without vessel or optic nerve
segmentation. Also, they are inherently able to identify MAs of
different sizes without multiscale analysis. It does not require a
large dataset, once some examples of Mas are shown to the
classifier, it is simply a matter of dynamically selecting the
negative examples on one or two images to make the algorithm
“converge” to the desired performance.
Anitha Mohan et al. (2013) [8] of developed an automatic
diagnostic system to detect diabetic retinopathy changes in the eye
so that only affected persons can be referred to the
specialist for further examination and treatment. The aim of this
project was to find the nonhealthy parts i.e. part affected with
disease, in the eye of diabetic patients. Here, FCM (fuzzy c-means)
algorithm is used to find the ratio of the disease. A major advantage
of this algorithm is that it implies greater accuracy of exudates
detection. To classify the segmented regions into healthy and non-
healthy area, an artificial neural network classifier was used. The
significant contributions of this work were: 1) median filter was
used to reduce the irregular edges or smoothing the edges. 2) hue
saturation value of the given input image was obtained and 3) FCM
(fuzzy c-means) algorithm was applied for finding the ratio of the
disease.
Shraddha Tripathi et al. (2013) [9] proposed an automatic method
for exudate detection from colour fundus images based on
Differential Morphological Profile (DMP). The three main phases
involved in this method consist of (i) pre-processing is done by
Gaussian smoothing and contrast enhancement, (ii) the pre-
processed image is gone through DMP. The resultant image
contains highlighted bright regions indicating exudates and optic
disc, (iii) feature extraction is done which depends on following
parameters: location of optic disc, shape index and area. The image
obtained is consist of actual exudates. The results show that the
proposed method detects exudates more efficiently and accurately
in comparison to other state of the art .
Syna Sreng et al. (2013) [10] developed an automatic method for
automatic detection of exudates from fundus images. The proposed
method first pre-processes the fundus image to improve the quality
and then detection and elimination of Optic Disc (OD) is done to
prevent the interference to the result of exudate detection by
combination of three methods: (i) image binarization, (ii) Region
Of Interest (ROI) based segmentation and (iii) Morphological
Reconstruction (MR). Then, the maximum entropy thresholding is
applied to filter out the bright pixels from the result of OD region
eliminated. Finally, exudates are extracted by using Morphological
reconstruction.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1. Comparison of Various Algorithms Discussed In Literature Survey

Sr.no Reference Method used Results Advantages/ Disadvantages

1. Hussain F. Jaafar An adaptive thresholding and a 89.7% sensitivity It occasionally fails to exclude some Non-
et al[3] new split-and-merge technique to and exudates that have similar features to real
segment all bright candidates 99.3% specificity exudates.
locally.
2. Carla Agurto et AM-FM has been used with a 100% sensitivity and The various retinal structures are encoded
al[4] multiscale decomposition of retinal 88% specificity differently by the am -fm feature hence lesions
structures . can be easily detected.

3. Keerthi Ram et A successive rejection-based 88.46% sensitivity It is an expensive and complex technique.
al[6] strategy is proposed to and
progressively lower the number of 90% specificity.
clutter responses.
4. L. Giancardo et Segmentation technique based on a Sensitivity at 0.5 FPs i) It is able to identify MAs of different sizes
al[7] novel application of the radon is 36.6% without multiscale analysis.
transform is used. ii) Less sensitivity.

5. Anitha Mohan et FCM (fuzzy c-means) DNP* It implies greater accuracy of exudates
al.[8] Algorithm is used to find the ratio detection.
of disease.
6. Shraddha Gaussian smoothing is used in first 97.6% sensitivity It detects exudates quite efficiently and
Tripathi et al.[9] stage and then Differential and accurately.
Morphological Profile (DMP) is 99.9% specificity.
applied to segment exudates
7. Syna Sreng et Maximum entropy thresholding is 91% sensitivity The average processing time is 3.92 second per
al.[10] applied to filter out the bright image.
pixels.
8. T.Yamuna et Region-based image segmentation 66.67% sensitivity i) ANFIS is used to classify the retinal images
al.[11] is used for candidate extraction and and as normal, mild, severe depending on their
Adaptive Neuro Fuzzy Inference 62.5 % Specificity severity.
System (ANFIS) used for ii) It need training and testing prior to
classification. classification.
9. Sérgio Bortolin Mathematical morphological 87.69% sensitivity It is not able to identify some microaneurysms
Júnior et al[12] operations are used. and 92.4%specificity occupying very small area hence sensitivity
decreased.

10. Sharath Kumar P Multi-channel histogram analysis 88.45% sensitivity The algorithm can detect abnormalities related
N et al.[13] is used . and to the DR with high accuracy and
95.5% specificity. Reliability.

11. Mahendran Morphological operations are used DNP* i) Segmented image shows the location of
Gandhi et al.[14] for segmentation and support exudates confirming the disease.
Vector Machine(SVM) is used for ii) SVM classifier is used to assess the severity
classification of disease. of this disease.
12. Abderrahmane Graph cut algorithm is used for 95% sensitivity and It is a fast method of segmentation.
Elbalaoui et exudate extraction and neural 96.65% specificity
al.[15] network classifier is used to
classify candidate

DNP*- DATA NOT PROVIDED.

30
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
T.Yamuna et al. (2013) [11] proposed a method that aims to detect
low contrast abnormalities such as microaneurysm in the retinal
image and to classify them on the basis of their severity. Two
preprocessing techniques, Illumination Equalization and Contrast
Limited Adaptive Histogram Equalization (CLAHE) was used and
morphological operations were used to extract the abnormal
candidates and the features like area, mean, standard deviation,
entropy etc. were used to classify various stages of abnormalities.
The tool used here for effective screening of retinal abnormalities is
Adaptive Neuro Fuzzy Inference System (ANFIS). The retinal
images as normal, mild, severe were classified by ANFIS depending
on their severity.
Sergio Bortolin Junior et al. (2013) [12] presented a novel approach
for automated detection of red lesions in fundus. The approach here
is based on mathematical morphology and consists of removing
components of retinal anatomy to detect the lesions. There were five
stages involved in this method: a) pre-processing; b) enhancement of
low intensity structures; c) detection of blood vessels; d) elimination
of blood vessels;e) elimination of the fovea. The main contribution
of the proposed method is the detection of blood vessels, where it
was used a solution based on Mathematical morphology.
Sharath Kumar P N et al. (2013) [13] used a new method for
preprocessing and elimination of false positives to detect exudates
accurately. In preprocessing, HSV color space conversion is used to
enhance the brightness of fundus images. Then gamma correction
was performed on each red and green components of the image to
emphasize brighter yellow regions (exudates). The histogram
analysis is used to detect exudates candidates. Finally, by using
multi-channel histogram analysis false positives were removed. In
the future, the integrated fundus image analysis scheme will be
further improved and full fledged automated system can be
developed to detect other symptoms of mild DR viz.
microaneurysms, and haemorrhages.
Mahendran Gandhi et al. (2013) [14] proposed automatic detection of
diabetic retinopathy through detecting exudates in colour fundus
retinal images and also classifies the rigorousness of the lesions. The
morphological operation such as dilation and erosion are used to
detect the presence and location of exudates. This segmented image
shows the location of exudates confirming the disease diabetic
retinopathy. This paper not only confirms the disease but also tends
to measure the severity level of the disease. The SVM classifier is
used to assess the severity of this disease whether the patient is
moderately affected or severely affected.
Abderrahmane Elbalaoui et al. (2014) [15] presented an automated
method for the detection of exudates in retinal color fundus images
with high accuracy. First, the image is converted to HSI model, after
preprocessing possible regions containing exudate, the segmented
image without Optic Disc (OD) using algorithm Graph cuts,
Invariant moments Hu in extraction feature vector are then classified
as exudates and non-exudates using a Neural Network Classifier. The
neural network gives better results with a feature extraction of
images by descriptors and Hu moment of GIST.
31
ISBN: 978-81-924893-0-8
5. CONCLUSION
This review paper analyses the merits and demerits of the existing
automated techniques for the identification of retinal features and
pathologies. Automatic detection of diabetic retinopathy lesions
presents many of the challenges. The size and color of dark lesions is
very similar to the blood vessels, and the intensity of bright lesions is
similar to that of optic disc. There is a chance of false positives in
case of overlaying of anatomical features of retina with pathological
features i.e. lesions. So there is a need of an effective automated
detection method so that diabetic retinopathy can be treated at an
early stage and the blindness due to diabetic retinopathy can be
prevented. In this paper, some existing methods are reviewed to give
a complete view of the field. On the basis of this work, the
researchers can get an idea about automated microaneurysm,
haemorrhages and exudates detection and can develop more
effective and better method for detection to diagnose diabetic
retinopathy.
REFERENCES
[1] Olson, J. Strachan, F. Hipwell, J. Goatrnan, K. McHardy, K.
Forrester, J. Sharp. A comparative evaluation of digital
imaging, retinal photography, and optometrist examination in
screening for diabetic retinopathy. Diabetic Med. 20, 528-
534, 2003 Singalavanija.
[2] D. Fleming, S. Philip, K. A. Goatman, G. J. Williams, J. A.
Olson, and P. F. Sharp, “Automated detection of exudates for
diabetic retinopathy screening,” Phys. Med. Biol., vol. 52, pp.
7385–7396, 2007.
[3] Hussain F. Jaafar, Asoke K. Nandi and Waleed Al-Nuaimy,
“Automated Detection Of Exudates In Retinal Images Using
A Splitand- Merge Algorithm,” in 18th European Signal
Processing Conference (EUSIPCO-2010) EURASIP.
[4] Carla Agurto, Victor Murray,and Eduardo
Barriga,“Multiscale AM-FM Methods for Diabetic
Retinopathy Lesion Detection,” IEEE Transactions On
Medical Imaging, vol. 29, no. 2, February 2010.
[5] Usman M. Akram and Shoab A. Khan, “Automated Detection
of Dark and Bright Lesions in Retinal Images for Early
Detection of Diabetic Retinopathy,” SPRINGER, J Med Syst
(2012) 36, pp.3151–3162.
[6] Keerthi Ram, Gopal Datt Joshi AND Jayanthi Sivaswamy, “A
Successive Clutter-Rejection-Based Approach for Early
Detection of Diabetic Retinopathy,” IEEE Transactions On
Biomedical Engineering, vol. 58, no. 3, pp.664-673, March
2011.
[7] L. Giancardo, F. Meriaudeau, T. P. Karnowski, Y. Li, K. W.
Tobin and E. Chaum, “Microaneurysm Detection with Radon
Transform-based Classification on Retina Images,” in 33rd
Annual International Conference of the IEEE EMBS Boston,
Massachusetts USA, August 30 - September 3, 2011.
[8] Anitha Mohan and K. Moorthy, “Early Detection of Diabetic
Retinopathy Edema using FCM,” International Journal of
Science and Research (IJSR), vol. 2, no. 5, May 2013.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[9] Shraddha Tripathi1, Krishna Kant Singh , B.K.Singh1 ,
Akansha Mehrotra, “Automatic Detection of Exudates in
Retinal Fundus Images using Differential Morphological
Profile,” International Journal of Engineering and
Technology (IJET), vol. 5, no. 3, Jun-Jul 2013.
[10] Syna Sreng, Jun-ichi Takada, Noppadol Maneerat, Don
Isarakorn, and Ronakorn Panj aphongse, “Automatic Exudate
Extraction for Early Detection of Diabetic Retinopathy,” in
5th International Conference on Information Technology and
Electrical Engineering, IEEE, Oct 2013.
[11] T.Yamuna and S.Maheswari, “Detection of Abnormalities in
Retinal Images,” IEEE International Conference on
Emerging Trends in Computing, Communication and
Nanotechnology (ICECCN 2013), pp.236-240, 2013.
[12] Sergio Bortolin Junior and Daniel Welfer, “Automatic
Detection Of Microaneurysms And Hemorrhages In Color
Eye Fundus Images,” International Journal of Computer
Science & Information Technology (IJCSIT). vol 5, no 5, Oct
2013.
32
ISBN: 978-81-924893-0-8
[13] Sharath Kumar P N , Rajesh Kumar R, Anuja Sathar ,and
Sahasranamam V, “Automatic Detection of Exudates in
Retinal Images Using Histogram Analysis,” IEEE Recent
Advances in Intelligent Computational Systems (RAICS), Dec
2013.
[14] Mahendran Gandhi, and Dr. R. Dhanasekaran, “Diagnosis of
Diabetic Retinopathy Using Morphological Process and SVM
Classifier,” IEEE International conference on
Communication and Signal Processing, pp.873-877, April 3-
5, 2013.
[15] Abderrahmane Elbalaoui, Mehdi Boutaounte, Hassan Faouzi,
Mohamed Fakir , And Abdelkrim Merbouha, “Segmentation
and Detection of Diabetic Retinopathy Exudates,” in
International Confrence on Multimedia and Computing
Systems, IEEE, pp.1625 – 1627, April 20.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Various Methods of Road Extraction from Satellite Images:

A Comparative Analysis
Atinderpreet Kaur, Ram Singh,
Dept. Of Computer Engineering, Punjabi University Dept. Of Computer Engineering, Punjabi University
Patiala Patiala.
atti.punia11@gmail.com

ABSTRACT
Extraction of roads from the satellite images is a crucial part of
the image segmentation. Extraction of roads is essential because
number of applications are based on road information like
vehicle navigation, transportation management, tourism,
industrial development, urban or rural development. Images
used in road extraction are mostly satellite images or aerial
images. As the satellite images are of high resolution, therefore
there are many obstacles like a shadow of trees and buildings,
vehicles, interference from the surroundings, broken roads etc.
curb the automatic extraction of the roads. In this paper, the
review of techniques, algorithms and methodologies used for
automatic detection of roads is presented.
Keywords: Road extraction, Morphology, Reference Circle,
Gradient Operator, Unmasking, SVM.
1. INTRODUCTION
Roads become the necessary part of the society in today’s life as
its information is important in traffic and fleet management,
vehicle navigation system, location based services, tourism and
industrial development. So there is need of algorithms to extract
roads from the satellite images. Various techniques exist to
extract the roads like rule based approaches, statistical inference
methods, contour method, etc. Despite the fact that much work
on automatic approaches for road extraction has been taken
place, the desired high level of automation could not be
achieved yet. Reason behind it number of obstacles that curb
automatic extraction like blurring, wrecked or misplaced road
boundaries, lack of road profiles, dense shadows, and
interference from surrounding objects. As a result, the existing
automatic extraction is not sufficient for practical applications.
2. METHODOLOGY
Automatic detection of roads is very important for traffic
management, location based services and especially for vehicle
navigation system. Most of the automatic detection of roads
works in three stages: (i) image pre-processing, (ii) detection
and segmentation of roads, (iii) post-processing to link the
segments and remove the unwanted results.
First stage requires an image preprocessing for the reduction of
noise and contrast enhancement. Mostly Image preprocessing is
performed on the green color plane of RGB image because in
the green color plane higher contrast is obtained with the
background. The presence of non-road regions such as roofs of
buildings, parking lots, etc. which may contain similar color,
contrast as that of roads, might lead to a non-road region be
wrongly classified as a road region. Hence, in second stage non-
road regions are segmented from the road image for the
reduction in false positives.
Image Preprocessing (resize, remove noise
or other obstacles )
Detection and Segmentation of roads and non-road
regions
Extraction of roads and linking of segments (if
required)
Fig.1. Flow chart showing methodology

Road network information is required for a variety of 3. EVALUATION & PERFORMANCE

applications and such information is a necessary input to many MEASURES
decision processes. Because of the large areas to be mapped, it is
important to use highly automated means as well as cheap and For automated detection of roads in aerial images three
readily available data. Manual extraction of road from remote
measures are mostly used: Completeness, and Quality
sensing imagery is mostly time-consuming and costly.
The potential solution is to develop an algorithm that can Correctness.
automatically detect it so that road information can be used for
fruitful results. The speedy growth of information processing Predicted class C1 (YES) C2 (NO)
system has led to the development of automated techniques for Actual class
detection roads. This paper provides reviews of various
C1(YES) TP FN
automated techniques along with their strength and weakness. In
this review, we discuss the various algorithms for automated C2(NO) FP TN
detection of roads based on aerial image analysis.
Fig.2. Confusion Matrix

33
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Correctness are defined as the ability of an algorithm to detect
the correct roads from an image.
Completeness is defined as the ability of an algorithm to get the
all road pixels in extracting image as road pixels in the actual
image.
Quality is defined as the excellence of the road extraction.
TP(True positive): Roads are correctly detected as roads.
FP(False positive): Non-Roads are incorrectly identified as
roads.
TN(True negative): Non-Roads are correctly identified as non-
roads.
FN(False negative): Roads are incorrectly identified as non-
roads.
4. LITERATURE SURVEY
Liu Xu[1] et al. proposed the Unsharp Mask (USM) sharpening
algorithm for image enhancement, and to reinforce the road
feature. A precipitous method of road extraction from satellite
images was achieved by following the three operations a) image
preprocessing, b) threshold segmentation, c) corrosion and
expansion. In USM Gaussian low pass filter is used to suppress
the noise. According to experimental results of this paper, it can
effectively reduce the non- target noise and accurately extract
roads from the images.
Pro of this algorithm is that it enhance the color gradient of
roads from the surrounding environment. However, this method
also has its shortcomings: the color of a processed image gets
changed when the maximum and minimum pixel value will
exceed the original image sharpening, so the choice of the
template is very important.
Xufeng Guo[2] et al. [2011], proposed a method of extraction of
roads on the basis of automatic selection of seed that starts the
road extraction based on the combination of geometry and color
features.
Yan Li and Ronald Briggs [3] et al. proposed a two stage method
of reference circle and central pixel that are amenable to the
distortions which are expected over the roads. The reference
circle provides the feature of direction and shape of the roads
that address the major issues that have caused all existing
extraction approaches to fail, such as blurring boundaries,
interfering objects, heavy shadows, etc. Both visual and
geometric characteristics of roads are taken into account. The
central pixels play an important role throughout the extraction
process, including filtering, segmentation, and grouping and
optimization. Once a centerline is found, then based on the
statistical estimation of the road width, the contour of the road
34
ISBN: 978-81-924893-0-8
can be derived according to all the central pixels. The proposed
approach is efficient, reliable, and assumes no prior knowledge
about the road conditions, surrounding objects and color
spectrum of roads.
Juan Wang,[[4] et al. [2012] proposed a method for four road
extraction strategies: linear road, curvilinear road, crossing the
road and breakage road based on mathematical morphology.
Various Mathematical Morphology operations are used to keep
image features and remove the redundant structure like erosion,
dilation, opening, closing Different structuring elements are
used depends on the structure of the road. Its operations are
simple, flexible and fast.
Beril Sırmac [5] et al. [2010] proposed the spatial voting method
besides edge detection for road extraction. Non-linear Bilateral
filtering is used to smooth the image. Spatial voting matrix
(SVM) is generated by extracting canny edge and gradient
information which is used to signify the possible locations of
road networks. By processing iteratively voting matrix, it detects
initial road pixels. At last tracking algorithm is applied to detect
the missing road pixels on the voting matrix. The negative point
of the method is that tracking algorithm decrease the operation
speed.
Shengyan Zhou[6] et al. proposed a technique of road extraction
based on Support vector Machine (SVM) that focus on the
problem of extraction of feature and classification. It is an
effective approach for self-supervised online learning. It reduces
the possibility of wrong categorization of road and non-road
classes and improves the road detection algorithm.
Sahar Movaghati [7] et al. proposed Extended Kalman filtering
with particle filtering. It helps in finding different road branches.
It is based on two modules EKF and PF. The EKF module
properly find and estimate the coordinates of the road median,
while the PF module is only utilized in critical situations, i.e.,
when the EKF module stops due to road obstacles or road
junctions. When the EKF module faces a severe obstacle, then
update profile cluster procedure cannot successfully create new
profile clusters. To initialize the PF module, the EKF module
transfers the information about its last successful step of the
present road segment onto the PF module. At last clustering is
done to merge all branches created in EKF and PF module to
extract the road. PF module slows the speed of the algorithm
which is the limitation of this method.
Xiangyun Hu,[8] [2014] et al. proposed various features to detect
road centerlines from the residual ground points. The
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

TABLE 1
COMPARISON OF VARIOUS ALGORITHMS DISCUSSED IN LITERATURE SURVEY

Sr. Reference Method Used Image (Database) Results Advantages/Disadvantages

No.
1 Liu Xu et al. [1] Unsharp masking to Quickbird DNP 1. Quick & easy method.
effectively reduce Panchromatic image 2. Improper selection of template
noise using leads to the incorrect extraction of
template. roads.
2 Yan Li and A reference circle Images from Google DNP Well address blurring, broken or
Ronald Briggs and central pixel, to Map missing road boundaries, heavy
[3] capture the essence shadows, and interference from
of both visual and surrounding objects
geometric
characteristics of
roads
3 Juan Wang,[[4] et Mathematical Remote Sensing DNP Easy to use.
al Morphology Image
4 Beril Sırmac [5] et Spatial Voting Panchromatic Ikonos 86.85% of the Tracking Algorithm results in
al Matrix besides using satellite road network; decreasing the operation speed.
edge detection. Image 9.03% false
alarm rate.
5 Shengyan Zhou[6] Support Vector Self Captured images DNP Automatic updating of training data
machine based on reduce the possibility of
online learning misclassifying roads and non-road
regions.
6 Sahar Movaghati Extended Kalman IRS and IKONOS Correctness 1. Effectively find the branches of
[7]
Filter to find road image 98%; roads at road junction.
median and Particle Completeness 2. PF module reduces the speed of
filtering module to 92% (IRS) the algorithm
curb the obstacles . and 85% 3. Not apply to more complex urban
(IKONOS) area.
7 Xiangyun Hu,[8] Mean shift, Tensor LiDAR data of urban Completeness 1. Effectively detect roads in
voting, Hough areas 81.7%; complex urban scenes with varying
transform Correctness road widths and noise.
(MTH) to extract 88.4% 2. One problem is the heavy
centerline of the computational cost in the tensor
road. voting step.
8 Fatemeh Extraction using Road scenes in video FAR 2%; 1. No need of any knowledge of road
Mazrouei hough transform on sequences taken by FRR 11% width, mark length and other
Sebdani[9] et al. video sequencing stationary traffic parameter.
frames. Cameras. 2. Due to computational complexity,
algorithm can’t use in real-time
application.
9 Jiuxiang Hu,[11] An Automatic road Any aerial Image 84% to 94% Efficiently trims the paths that leak
et al. seeding method completeness, into the surroundings of the roads
using footprints. Above 81%
correctness,
Quality 82%
to90%
DNP* - Data not provided.

FAR- is the number of pixels that aren’t as road line, but detect these as road line.

FRR – is the number of pixels that are as road line, but we can’t extract

35
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
main purpose of it is to separate connected non-road features
like parking portion and bare grounds from the roads. Three
features are applied to detect the roads. Adaptive mean shift
finds the center points on the road, Stick tensor voting is applied
to enhance the salient linear features of the road and Hough
Transform is applied to extract the arc primitives of the road
centerline. One problem of this method, the heavy
computational cost in the tensor voting step and another problem
is the identification of the contextual objects of roads, like lane
markings, road junction patterns, vehicles, and road edges.
Fatemeh Mazrouei Sebdani[9] et al. [2012] use Hough Transform
to extract the roads. In the preprocessing region of interest (ROI)
is applied with wiener filter to remove the noise. After it image
is segmented by thresholding and Hough Transform method.
Morphology operations are applied at last to improve the output
results. Positive point of this method: no need of any prior
knowledge of road width, mark length and other parameters.
Negative point: Can’t use this method for real time applications
as it is time consuming and also applicable for 2-D images only.
Hao Chen [10][2014] et al. proposed an algorithm to overcome
the problem of extraction of defects result due to noise using
traditional methods. This method proposes an algorithm based
on the global features. It uses Top-down approach to extract the
roads. Global topological perception is applied prior to the
perception of other locally featured properties (centerlines)
which are extracted using Burns algorithm. Topological
information about roads is derived from vector data.
Jiuxiang Hu,[11][2007] et al. used two-step approach to extract
the roads from aerial images, i.e. detection and pruning analysis.
This method involves detection of road footprints, track the
roads, and grow a road tree. Footprint of a pixel is the local
homogeneous region around a pixel enclosed by a polygon and
Spoke wheel operator is used to get the road footprint. A toe -
finding algorithm is used to find the direction of foot –prints.
Bayes decision model based on the (A/P) area-to-perimeter
ratio of the footprint, is used to trim the paths that leak into the
surroundings. This paper helps in efficiently trimming the paths
that lead to the improvement of performance, correctness and
quality of the extracted roads.
Mingjun Song[12][2004] et al. used SVM to extract the roads. It
helps in classifying the image into road and non-road region.
Based on homogenous criteria Region Growing is used to
segment. After it thresholding is applied to extract roads and
then vectorization and thinning is performed to get the centerline
of the road. This paper helps in extracting the very narrow roads,
but unable to address the roads having tree/building shadows,
gaps etc.
Rajani Mangala [13] et al. [2011] proposed a work for Road
extraction based on the gradient operation and skeletal ray
formation by comparing it with ANN based road extraction
method. Thresholding and coloring with morphological
operations are performed to extract the road. The proposed work
36
ISBN: 978-81-924893-0-8
of this paper is applied on the rural roads. Color image to binary
image conversion is performed and Gradient is operated twice to
remove the noise. Thresholding is also used and after its
midpoints are found out and connected. At last coloring and
morphological operations are performed. This technique has
provide 72%, 82% and 81% completeness, correctness and
quality respectively.
5. CONCLUSION
This review paper throws a light over number of existing
techniques that are used in road extraction. Automatic detection
of roads from an image presents many challenges. The color of
roof top also analogous to that as roads and shadow of trees on
road results in improper extraction of roads. There is a chance of
true negative (i.e. not detect the road, even if it is road in actual)
due to these problems. Also, most of the techniques are not
applied on both rural and urban area road images. In this paper,
some existing methods are reviewed to give a complete view of
the field. On the basis of this work, the researchers can get an
idea about automated road extraction and can develop more
effective and better method for it.
REFERENCES
[1] Liu Xu, Tao Jun, Yu Xiang, Cheng JianJie, and Guo LiQian
“The Rapid Method for Road Extraction from High-Resolution
Satellite Images Based on USM Algorithm”.
[2] Xufeng Guo, David Dean, Simon Denman, Clinton Fookes,
Sridha Sridharan” Evaluating Automatic Road Detection Across
a Large Aerial Imagery Collection”, 2011 IEEE International
Conference on Digital Image Computing: Techniques and
Applications.
[3] Yan Li and Ronald Briggs,” Automatic Extraction of Roads
from High Resolution Aerial and Satellite Images with Heavy
Noise”
[4] Juan Wang, Chunzhi Shan “Extract Different Types of
Roads Based on Mathematical Morphology” 2012 5th
International Congress on Image and Signal Processing (CISP
2012).
[5] Beril Sırmacek and Cem U¨nsalan” Road Network
Extraction using Edge Detection and Spatial Voting” 2010 IEEE
International Conference on Pattern Recognition.
[6] Shengyan Zhou, Jianwei Gong, Guangming Xiong, Huiyan
Chen and Karl Iagnemma” Road Detection Using Support
Vector Machine based on Online Learning and Evaluation”
2010 IEEE Intelligent Vehicles Symposium University of
California, San Diego, CA, USA June 21-24, 2010
[7] Sahar Movaghati, Alireza Moghaddamjoo, Senior Member,
IEEE, and Ahad Tavakoli,” Road Extraction From Satellite
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Images Using Particle Filtering and Extended Kalman Filtering” [13] T Rajani Mangala, S G Bhirud “A New Automatic Road
IEEE Transactions On Geoscience And Remote Sensing, vol. 48, Extraction Technique using Gradient Operation and Skeletal
no. 7, July 2010 Ray Formation”, International Journal of Computer
Applications (0975 – 8887) Volume 29– No.1, September 2011.
[8] Xiangyun Hu, Yijing Li, Jie Shan, Member, IEEE, Jianqing
Zhang, and Yongjun Zhang” Road Centerline Extraction in
Complex Urban Scenes From LiDAR Data Based on Multiple
Features”, IEEE Transactions On Geoscience And Remote
Sensing, vol. 52, no. 11, November 2014

[9] Fatemeh Mazrouei Sebdani, Hossein Pourghassem” A

Robust and Real-time Road Line Extraction Algorithm Using
Hough Transform in Intelligent Transportation System
Application” 2012 IEEE.

[10] Hao Chen, Lili Yin, Li Ma ”Research on Road Information

Extraction from High Resolution Imagery Based on Global
Precedence” 2014 Third International Workshop on Earth
Observation and Remote Sensing Applications.

[11] Jiuxiang Hu, Anshuman Razdan, John C. Femiani, Ming

Cui, and Peter Wonka, “Road Network Extraction and
Intersection Detection From Aerial Images by Tracking Road
Footprints” IEEE transactions On Geoscience and Remote
Sensing, vol. 45, no. 12, December 2007.

[12] Mingjun Song and Daniel Civco” Road Extraction Using

SVM and Image Segmentation” Photogrammetric Engineering
& Remote Sensing Vol. 70, No. 12, December 2004, pp. 1365–
1371.

37
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Design of Microstrip Patch Antenna by Introducing

Defected Ground Structure

Harpreet Kaur Monika Aggarwal

ECE Department BGIET, Sangrur, India ECE Department BGIET, Sangrur, India
email:er.kaur92@gmail.com email:monikaaggarwal176@gmail.com

ABSTRACT embedding slots in ground plane to obtain multiband

This paper proposes a novel Inset Feed Microstrip patch characteristics.
antenna with Z and F shape defect in ground plane. Initially
simple inset feed rectangular Patch Antenna is designed and
results are analyzed. Further this design is modified by
etching Z and F shaped defect on ground plane. Defected
Ground Structure is studied to enhance the performance
parameters of microstrip patch antenna. Proposed antenna
provides wide bandwidth and reduced return loss. Designed
antenna cover the WLAN 5.2 GHz (5.15-5.35 GHz) band.
Performance parameters Return loss, bandwidth, gain,
directivity, and voltage standing wave ratio (VSWR) have
been analyzed for proposed multiband Microstrip Patch
Antenna by using Finite element method based High
Frequency Structure Simulator software (HFSS).

Keywords
DGS, HFSS Software, Microstrip Patch antenna, Return loss, Fig 1: Basic Microstrip Patch Antenna
VSWR
2. ANTENNA DESIGN
1. INTRODUCTION Three main components for designing of microstrip antenna
Wireless communication is the fastest growing field in are resonant frequency, dielectric material and substrate
communication industry. Antenna is an important element in height. The proposed antenna resonates at 5.2 GHz frequency.
wireless system. Handheld devices in wireless communication For the designing of antenna FR4 epoxy is used having
raise the demand of compact and multiband antenna. dielectric constant 4.4 with 0.02 loss tangent. High dielectric
Microstrip antenna because of its small size employed in constant is used for size reduction. Width and length is
wireless communication. Microstrip patch antenna is widely calculated by using transmission line model equations.
used because of its numerous advantages such as low profile,
low cost, ease of fabrication [1]. Narrow bandwidth and low Width of the patch is calculated by formula given below –
gain are the main limitation of microstrip patch antenna [2]. In
literature various techniques have been studied to improve the
bandwidth of microstrip patch antenna such as increasing
substrate thickness, using low dielectric substrates, stacking
geometry, shorting pins , cutting slots and slits in radiating W=
patch and embedding slots in ground plane. Rectangular and
circular patches are preferred because of ease of analysis. C=3*108 m/s, Dielectric constant ϵr = 4.4, Resonant frequency
Defected Ground Structure is studied to improve the basic fr = 5.2 GHz
characteristics of conventional microstrip patch antenna [9].
An antenna with multiband characteristics and high After calculation Patch width W = 17.55mm.
bandwidth is required for wireless applications. Different
feeding techniques are available to excite microstrip patch Effective dielectric constant calculation (ϵ reff)
antenna. In wireless communication an antenna to cover more
than one frequency band is required to support more
applications with single antenna. Different techniques to
achieve multiband operation are like Probe Compensation (L- ϵreff =
shaped probe), Parasitic Patches, Direct-Coupled Patches, Slot
and Slit loaded patches (U or V- shaped slots and E patch, U-
Shaped Slit, Stacked Patches, Patch with parasitic strip and
Substitute ϵ r = 4.4. h = 1.5748mm, W = 17.55mm
the use of Electromagnetic Band Gap (EBG) structures[9].
Most of these methods require complex feeding techniques
Effective dielectric constant ϵ reff = 3.879
and complex structures like more layers and parasitic
structures. In order to avoid the complexity of structure, an
Length extension calculation
inset feed rectangular Microstrip Patch antenna is designed by

38
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

22.88mm
ΔL = 0.412h

Put ϵreff = 3.879, h = 1.5748mm, W= 17.55mm 12.95mm

Obtained length extension ΔL = 0.718mm

27mm

17.55mm
Effective length calculation

Leff =

C = 3* 108 m/s, fr = 5.2GHz

Leff = 14.64mm

Actual length calculation

L = Leff – 2Δ L
Fig 2: Geometry of Simple Rectangular Microstrip Patch
Leff = 14.64mm, ΔL = 0.718 mm Antenna

L = 13.20mm Return Loss ANSOFT

0.00
Ground plane dimensions are calculated by
-5.00
Transmission line model is suitable for infinite ground planes
but practically we should have finite ground plane. If we take m2 m3
the size of ground plane is greater than the patch dimensions -10.00
by six times the substrate height similar results can be
obtained as with infinite ground plane. Therefore length and
dB(St(1,1))

width of ground is given -15.00

Wg = 6h + W
-20.00
Lg = 6h + L
-25.00

Name X Y
3. SIMULATION RESULTS -30.00 m1 5.2312 -30.8215
m1
Curve Info
3.1 Inset feed Simple Rectangular m2 5.1095 -10.0008
dB(St(1,1))
m3 5.3507 -10.0001 Setup1 : Sw eep1
Microstrip Patch Antenna -35.00
Inset feed Simple Rectangular Patch Antenna is designed with 3.00 4.00 5.00 6.00 7.00
Freq [GHz]
the specifications discussed above but length of patch is
reduced to adjust the frequency. The designed antenna has
Patch length L=12.95mm and Width W= 17.55mm. Ground Fig 3: Return Loss of Simple Rectangular Microstrip
plane dimensions are Wg = 27mm and Lg = 22.88mm. Patch Antenna

Return loss versus frequency graph is shown in figure 3.

Antenna resonates at 5.23 GHz with return loss -30.82 dB.
Bandwidth of antenna can be calculated from return loss
graph. It is observed from figure 3 that bandwidth at
5.23GHz is 241 MHz (5.1095-5.3507 GHz) It covers the
WLAN frequency range 5.15-5.35 GHz.

39
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

XY Plot 1 ANSOFT
140.00
Curve Info
mag(VSWR(1))
120.00 Setup1 : Sw eep1
Name X Y
m1 5.2312 1.0592
100.00
m2 5.1106 1.9156

mag(VSWR(1))
m3 5.3518 1.9362
80.00

60.00

40.00

20.00
m2m1
m3
0.00
3.00 4.00 5.00 6.00 7.00
Freq [GHz]

Fig 4: 3D Polar Plot for Gain of Simple Rectangular Fig 6: VSWR of Simple Rectangular Microstrip Patch
Microstrip Patch Antenna Antenna

Figure 4 and 5 shows the 3D polar plot for Gain 5.04 dB and VSWR plot for inset feed simple rectangular Microstrip patch
directivity 6.62 dB at resonant frequency 5.23 GHz. antenna is shown in figure 6. The value of VSWR is 1.05 at
5.23GHz.

3.2 Z and F shaped Defected Ground

Structure
In proposed design Z and F shaped defect is etched on the
ground plane to achieve multiband characteristics. Geometry
of proposed design is shown in figure 7. In DGS defect on the
ground plane is etched intentionally, size and shape of the
defect can be varied according to design requirement.

22.88mm
1mm
17.55mm
27mm

Fig 5: 3D Polar Plot for Directivity of Simple Rectangular

Microstrip Patch Antenna

12.95mm

Fig 7: Z and F slot DGS antenna

Figure 8 depicts the return loss of the designed antenna after

DGS structure. It is observed from return loss versus

40
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

frequency graph that designed antenna resonates at multiple

frequencies by etching Z and F shaped slots on ground plane.
Designed antenna resonates at 5.2 GHz, 5.60 GHz, 10.44
GHz, and 11.52 GHz with return loss of -40.16 dB, -23.57 dB,
-43.75 dB, -20.50 dB, as shown in figure 8. Antenna has
highest return loss -40.16 dB at fundamental frequency 5.24
GHz. The proposed antenna resonates at multiple frequencies
and has large bandwidth 555 MHz (5.1067-5.6624 GHz) at
resonant frequency 5.2 GHz as shown in figure 2. Percentage
bandwidth of antenna is 10.32%. It has 1.696 GHz (10.1036-
11.80 GHz) bandwidth at 10.39 GHz.
Return Loss Z and F DGS ANSOFT
0.00 Curve Info
dB(St(1,1))
-5.00 Setup1 : Sw eep1

m3 m4 m7 m8
-10.00

-15.00

m6
dB(St(1,1))

-20.00
m2

-25.00 Name X Y
m1 5.2422 -40.1628 Fig 10: 3D Polar plot for directivity of DGS Antenna
m2 5.6040 -23.5708
-30.00
m3 5.1067 -10.0000 Figure 11 shows the VSWR (Voltage standing wave ratio) for
-35.00
m4 5.6624 -10.0021 proposed multiband antenna. Voltage standing wave ratio
m5 10.4432 -43.7501 indicates the impedance matching of antenna. The value of
m1 m6 11.5286 -20.5096 VSWR should lie between 1 and 2. Minimum VSWR is
-40.00
m7 10.1036 -10.0003 m5 achieved 1.01 at 5.24 GHz, 1.14 at 5.60 GHz, 1.01 at 10.44
m8 11.8000 -10.1553 GHz and 1.20 at 11.52 GHz.
-45.00
2.50 5.00 7.50 10.00 12.50
Freq [GHz] XY Plot 1 Z and F DGS ANSOFT

Fig 8: Return loss of Z and F slot DGS Antenna 125.00 Curve Info
mag(VSWR(1))
Setup1 : Sw eep1

100.00 Name X Y
m1 5.2422 1.0198
m2 5.6040 1.1420
mag(VSWR(1))

m3 10.4432 1.0131
75.00
m4 11.5286 1.2082
m5 11.8000 1.9012

50.00

25.00

m1m2 m3 m5
m4
0.00
2.50 5.00 7.50 10.00 12.50
Freq [GHz]
Fig 11: VSWR Plot of Z and F slot DGS Antenna
Fig 9: 3D Polar plot for gain of Z and F slot DGS Antenna
4. Conclusion
Above figures 9 shows the 3D polar plot for gain at 5.24 GHz. Proposed antenna is designed by etching slots in Ground
Designed antenna has 4.91 dB gain .It has 6.45 dB directivity Plane. Better return loss, directivity and VSWR is achived
at 5.24 GHz as shown in figure 10. because of the Defected Ground Structure. Antenna has wide
bandwidth at 5.24 GHz (5.1067-5.6624 GHz) which is
WLAN frequency band. Designed antenna resonates at four
different frequencies. It covers the C band and X band and

41
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
used for satellite and radar communication. Designed antenna
is better in terms of bandwidth and return loss. It has
minimum return loss -40.74 dB and bandwidth 555 MHz
(5.1067-5.6624 GHz) at 5.24 GHz.
REFERENCES
[1] Gajera,H.R., and Anoop,C.N., 2011, “The study on
Bandwidth enhancement of Rectangular Microstrip Patch
Antenna for Wireless Application”, Inteernational
Journal of Electronics & Communication
Technology,Vol. 2, Issue 4, ISSN: 2230-7109 (Online)
ISSN: 2230-9543(Print), pp.171-174.
[2] Kaur, J., and Khanna, R., 2013, “Co-axial Fed
Rectangular Microstrip Patch Antenna for 5.2 GHz
WLAN Application”, Universal Journal of Electrical
and Electronic Engineering, pp. 94-98.
[3] Kumar, G., and Ray, K.P., “Broadband microstrip
antennas”, Artech House.
[4] Matin, M.A., and Sayeed, A.I., 2010, “A design rule for
inset-fed rectangular microstrip patch antenna”, Wseas
Transactions on Communications, , Vol. 9, Issue 1,
ISSN: 1109-2742.
42
ISBN: 978-81-924893-0-8
[5] Nawale, P.A., and Zope, R.G., 2014, “Design and
Improvement of Microstrip Patch Antenna Parameters
Using Defected Ground Structure”, International Journal
of Engineering Research and Applications, Vol. 4, Issue
6, ISSN: 2248-9622, pp. 123-129.
[6] Patel, J.M., Patel, S.K., Thakkar, F.N., 2013, “Defected
Ground Structure Multiband Microstrip Patch Antenna
using Complementary Split Ring Resonator”,
International Journal of Emerging Trends in Electrical
and Electronics, , Vol. 3, Issue 2, ISSN: 2320-9569, pp.
14-19.
[8] Singh, G., and Kaur, J., 2014, “Design a multiband
Rectangular ring antenna Using DGS for WLAN,
WiMAX Applications”, International Journal of
Advanced Research in Computer and Communication
Engineering, Vol. 3, Issue 6, ISSN (Online): 2278-1021
[9] Weng, L.H., Guo, Y. C., Shi, X. W., and Chen, X. Q.,
2008, “An Overview On Defected Ground Structure”,
Progress in Electromagnetics Research B, Vol. 7, pp.
173–189.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
EDGE DETECTION OF VIDEO USING ADAPTIVE EDGE
DETECTOR OPERATOR
Pankaj Sharma
Research Scholar ECE
B.G.I.E.T Sangrur
pankx001@gmail.com
ABSTRACT
This paper presents the implementation of an adaptive edge-
detection using Simulink. Simulink is a simulation modeling
and design tool and GUI based diagram environment. The
Simulink based customizable framework is designed for rapid
simulation, implementation, and verification of video and
image processing algorithms and systems .The Edge detection
process detects outlines of an object, scene text and
boundaries between objects and the background in the video
image. Edge detection is in the forefront of video processing
for object detection, it is crucial to have a good understanding
of edge detection methods. In this paper the comparative
analysis of various video image edge detection methods is like
Sobel, Prewitt, and Canny is presented.
KEYWORDS
Canny operator, thresholding, edge detection.
1. INTRODUCTION
1.1. EDGE DETECTION
Unlike the real world, images do not have edges. An edge is
sharp change in intensity of an image. But, since the overall
goal is to locate edges in the real world via an image, the term
edge detection is commonly used. An edge is not a physical
entity, just like a shadow. It is where the picture ends and the
wall starts, where the vertical and the horizontal surfaces of an
object meet. If there were sensor with infinitely small
footprints and zero-width point spread functions, an edge
would be recorded between pixels within in an image. In
reality, what appears to be an edge from the distance may
even contain other edges when close-up looked. The edge
between a forest and a road in an aerial photo may not look
like an edge any more in a image taken on the ground. In the
ground image, edges may be found around each individual
tree. If looked a few inches away from a tree, edges may be
found within the texture on the bark of the tree. Edges are
scale-dependent and an edge may contain other edges, but at a
certain scale, an edge still has no width. If the edges in an
image are identified accurately, all the objects are located and
their basic properties such as area, perimeter and shape can be
measured. Therefore edges are used for boundary estimation
and segmentation in the scene. Edge detection is a basic tool
used in image processing, basically for feature detection and
extraction, which aim to identify points in a digital image
43
ISBN: 978-81-924893-0-8
Jatinder Sharma
Research Scholar ECE
B.G.I.E.T Sangrur
where brightness of image changes sharply and find
discontinuities. The purpose of edge detection is significantly
reducing the amount of data in an image and preserves the
structural properties for further image processing.. For a noisy
image it is difficult to detect edges as both edge and noise
contains high frequency contents which results in blurred and
distorted result. Edge detection is the process of localizing
pixel intensity transitions. The edge detection has been used
by object recognition, target tracking, segmentation, and etc.
Therefore, the edge detection is one of the most important
parts of image processing . There are many edge detection
operators available, each designed to be sensitive to certain
types of edges. Certain criteria involved in selection of an
edge detection operator include edge orientation. There are
mainly exist several edge detection methods Sobel , Prewitt ,
Canny . These methods have been proposed for detecting
transitions in video images. Edge detection is one of the most
important techniques that have been commonly implemented
in image processing. It is used in image segmentation,
registration and identification of image processing. The
concept of the edge in an image is the most fundamental
feature of the image because the edge contains valuable
information about the internal objects inside image. Hence,
edge detection is one of the key research works in image
processing. Edge detection of an image is a very important
step towards understanding image features. Therefore, other
image processing applications such as segmentation,
identification, and object recognition can take place whenever
edges of an object are detected.
1.2. TYPES OF EDGES
Edges are classified according to their behaviour – Sharp
Step, Gradual step, Roof, Trough edge.
Fig : (a) Sharp step (b) Gradual step (c) Roof (d) Trough
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Sharp Step, as shown in Fig. (a), is an idealization of an
edge. Since an image is always band limited, this type of
graph cannot ever occur. A Gradual Step, as shown in Fig.
(b), is very similar to a Sharp Step, but it has been smoothed
out. The change in intensity is not as quick or sharp. A Roof,
as show in Fig. (c), is different than the first two edges. The
derivative of this edge is discontinuous. A Roof can have a
variety of sharpness, widths, and spatial extents. The Trough,
also shown in Fig. (d), is the inverse of a Roof. Edge detection
is very useful in a number of contexts. Edges characterize
object boundaries and are, therefore, useful for segmentation,
registration, and identification of objects in scenes.
intensity. The operator needs to be responsive to such gradual
change, so we do not have problems of false edge detection,
missing true edges, edge localization, and high computational
time. Edge detection is one of the most frequently used
techniques in digital image processing. The boundaries of
object surfaces in a scene often lead to oriented localized
changes in intensity of an image called edges. Edge detection
is a difficult task, hence the objection for the comparison of
various edge detection techniques and analysis of the
performance of the various techniques under different
conditions.

2. EDGE DETECTION TECHNIQUES

1.3. CRITERIA FOR EDGE DETECTION
Quality of edge detection can be measured from several
criteria objectively. Some criteria are proposed in terms of
mathematical measurement, some of them are based on
application and implementation requirements. In all five cases
a quantitative evaluation of performance requires use of
images where the true edges are known.
1) Good detection: There should be a minimum number of
false edges. Usually, edges are detected after a threshold
operation. The high threshold will lead to less false edges, but
it also reduces the number of true edges detected.
a) Sobel Operator:
The operator consists of a pair of 3×3 convolution kernels as
shown in Fig. One kernel is simply the other rotated by 90°.
Sobel operator is a discrete differentiation operator used to
compute an approximation of the gradient of image intensity
function for edge detection. At each pixel of an image, sobel
operator gives either the corresponding gradient vector or
normal to the vector. It convolves the input image with kernel
and computes the gradient magnitude and direction. It uses
following 3x3 two kernels:

2) Noise sensitivity: The robust algorithm can detect edges in

certain acceptable noise (Gaussian, Uniform and impulsive
noise) environments. Actually, and edge detector detects and
also amplifies the noise simultaneously. Strategic filtering,
consistency checking and post processing (such as non-
maximum suppression) can be used to reduce noise
sensitivity.

3) Good localization: The edge location must be reported as

close as possible to the correct position, i.e. edge localization
accuracy (ELA).

4) Orientation sensitivity: The operator not only detects edge

magnitude, but it also detects edge orientation correctly.
Orientation can be used in post processing to connect edge
segments, reject noise and suppress non-maximum edge
magnitude.
1.4EDGE DETECTION PRELIMINARIES
There are certain types of edge variables involved in choosing
a sensitive edge detector they include:
 Edge Orientation: - the geometry of the operator
determines a characteristic direction in which it is most
sensitive to edges. Operator can be optimized to look for
horizontal, vertical or diagonal edges.
These kernels are designed to respond maximally to edges
running vertically and horizontally relative to the pixel grid,
one kernel for each of the two perpendicular orientations. The
kernels can be applied separately to the input image, to
produce separate measurements of the gradient component in
each orientation (call these 𝐺𝑥 and 𝐺 ). These can then be
combined together to find the absolute magnitude of the
gradient at each point and the orientation of that gradient. The
gradient magnitude is given by:

 Noise Environment:- Edge detection is different in noisy Typically, an approximate magnitude is computed using :
images. Since both noise and edges contain high frequency
content, attempt to reduce the noise result in blurred and
distorted edges. Operators used on noisy images are typically
larger in scope so they can average enough data to discount
localized noisy pixels. This result in less accurate localization
of the detached edges.
Gx and Gy are the gradients in horizontal and vertical
 Edge Structure: - not all edges involve step change in directions.
intensity effects such as refraction or poor focus can result in
objects with boundaries defined by gradual change in

44
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

b) Prewitt Edge Detector :

The Prewitt Operator is similar to the Sobel operator and it is

used for detecting vertical and horizontal edges in images .
The Prewitt edge detector is an appropriate way to estimate
the magnitude and orientation of an edge. The Prewitt
operator is limited to eight possible orientations although most
direct orientation estimates are not exactly accurate. The
Prewitt operator is estimated in the 3 x 3 neighborhood for
eight directions. The entire eight masks are calculated then the
one with the largest module is selected.

Fig.: Canny Edge Detector

The Canny method finds edges by looking for local maxima

of the gradient of I. The gradient is calculated using the
derivative of a Gaussian filter. The method uses two
thresholds, to detect strong and weak edges, and includes the
weak edges in the output only if they are connected to strong
edges . This method is therefore less likely than the others to
be fooled by noise, and more likely to detect true weak edges.

3. WORKING PARAMETERS FOR

EDGE DETECTION

a) Sources/From Multimedia File: On Windows reads video

frames and/or audio samples from a compressed or
uncompressed multimedia file. Multimedia files can contain
audio, video, or audio and video data.

Fig: Prewitt Edge detection operator b) Analysis & Enhancement/Edge Detection: Finds the
edges in an input image using Sobel, Prewitt, and Canny
methods.

c) Canny Edge detector : c) Sinks/To Video Display: Displays a video stream.

The Canny edge detector is known to many as the optimal d) Sinks/Frame Rate Display: Calculate and display the
edge detector. The canny edge detector first smoothes the frame rate of the input signal.
image to eliminate noise. It then finds the image gradient to
highlight regions with high spatial derivatives. The algorithm
then tracks along these regions and suppresses any pixel that
is not at the maximum. In order to implement the canny edge
detector algorithm, a series of steps must be followed. The
first step is to filter out any noise in the original image before
trying to locate and detect any edges. And because the
Gaussian filter can be computed using a simple mask, it is
used exclusively in the Canny algorithm. Once a suitable
mask has been calculated, the Gaussian smoothing can be
performed using standard convolution methods.
A convolution mask is usually much smaller than the actual
image. As a result, the mask slid over the image, manipulating
a square of pixels at a time. The larger the width of the
Gaussian mask, the lower is the detector's sensitivity to noise.
The localization error in the detected edges also increases
slightly as the Gaussian width is increased. After smoothing
the image and eliminating the noise, the next step is to find
the edge strength by taking the gradient of the image. The
Sobel operator performs a 2-D spatial gradient measurement
on an image. Then, the approximate absolute gradient
magnitude (edge strength) at each point can be found. The
Sobel operator uses a pair of 3x3 convolution masks, one
estimating the gradient in the x-direction (columns) and the
other estimating the gradient in the y-direction (rows). They
are shown below:

45
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.2. Flow chart of canny edge detector :

Fig : Blockset parameters.

3.1. Flow chart of sobel and prewitts

operators :

3.3. Canny edge detection algorithm

STEP I: Noise reduction by smoothing

Noise contained in image is smoothed by convolving the input

image I (i, j) with Gaussian filter G. Mathematically, the
smooth resultant image is given by

Prewitt operators are simpler to operator as compared to sobel

operator but more sensitive to noise in comparison with sobel
operator.

STEP II: Finding gradients

In this step we detect the edges where the change in grayscale

intensity is maximum. Required areas are determined with the
help of gradient of images. Sobel operator is used to
determine the gradient at each pixel of smoothened image.
Sobel operators in i and j directions are given as :

46
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4.1. Frame Rate Display Block Properties :

These sobel masks are convolved with smoothed image and

giving gradients in I and j directions as

STEP III: Non maximum suppressions:

Non maximum suppression is carried out to preserves all local

maxima in the gradient image, and deleting everything else
this results in thin edges. For a pixel M (i, j):

 Firstly round the gradient direction thita nearest

45°,then compare the gradient magnitude of the
pixels in positive and negative gradient directions Table 2
i.e. If gradient direction is east then compare with
gradient of the pixels in east and west directions say
E (i, j) and W (i, j) respectively.

 If the edge strength of pixel M (i, j) is largest than

that of E (i, j) and W (i, j), then preserve the value
of gradient and mark M (i, j) as edge pixel, if not
then suppress or remove.

 STEP IV: Hysteresis thresholding:

The output of non-maxima suppression still contains the local

maxima created by noise. Instead choosing a single threshold,
for avoiding the problem of streaking two thresholds t low and
t high are used. For a pixel M (i, j) having gradient magnitude
G following conditions exists to detect pixel as edge:
If G <t low than discard the edge. Table 3
If G > than t high keep the edge.
If t low < G < and t high and any of its neighbors in a 3 ×3
region around it have gradient magnitudes greater than t high
keep the edge.

4. Edge Detection Block Properties :

Table

47
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4.2. From Multimedia File Block 5. RESULT AND CONCLUSION

Properties:

Table 4

4.3. Video Viewer Block Properties :

Table 5

4.4. Block Type Count:

Fig after detection of edges by canny, sobel and prewitts.

In our research paper the proposed operator’s to

Implementation of this methodology using Simulink blockset
is more useful for Object Edge detection to detect outlines of
an object, scene text and boundaries. This system provides to
identify of objects and recognition scene text. The
performance for edge detection in a video image is evaluated
both subjectively and objectively. The subjective evaluation
of edge detected video images show that proposed operator,
Sobel and Prewitt and Canny operator exhibit better
performances respectively.From the experimental results we
get that the canny detector detects evenly weak as well as
strong edges and hence enhances the edge detection but it
reverses in the case of sobel and prewitts.

48
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES [3] International Journal of Computer Applications (0975 –

8887) Volume 90– No.19, March 2014 Comparison of
[1] Signal & Image Processing : An International Journal Various Edge Detection Techniques in Tree Ring Structure.
(SIPIJ) Vol.4, No.3, June 2013 DOI : 10.5121/sipij.2013.4306
65 ALGORITHM AND TECHNIQUE ON VARIOUS
EDGE DETECTION: A SURVEY Rashmi 1, Mukesh [4] Empirical Study of Various Edge Detection Techniques
Kumar2, and Rohini Saxena2 Department of Electronics and for Gray Scale Images Er. Harsimran Singh Er. Tajinder Kaur
Communication Engg. M.Tech Scholar Assistant Professor
SBBSIET Jalandhar, India SBBSIET Jalandhar, India.
[2] Ireyuwa. E. Igbinosa (2013), “Comparison of Edge
Detection Technique in Image Processing Techniques”,
International Journal of Information Technology and
Electrical Engineering, ISSN 2306-708X Volume 2, Issue 1,
February 2013.

49
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Design of 3-Side Truncated Patch Antenna with Semi-

Circular Open Slot for UWB Applications

Amrik Singh Sushil Kakkar Shweta Rani

M.Tech Student Assistant Professor Associate Professor
ECE Department ECE Department ECE Department
BGIET, Sangrur BGIET, Sangrur BGIET, Sangrur
Amrik3011@gmail.com kakkar778@gmail.com shwetaranee@gmail.com

ABSTRACT antenna are detailed in Table. 1. In this work semicircular slot

A 3-sided truncated microstrip patch antenna with has been introduced to further enhance the bandwidth of
semicircular open slot for ultra-wideband (UWB) and SHF antenna. On the ground a non-symmetric λ/4 L-shaped slot
(Super High Frequency) applications has been presented in has been used for producing miniaturization and a wide
this paper. The proposed antenna is compact in size and operating bandwidth. The rectangular patch fed by microstrip-
designed on FR4 substrate. From the simulation and line has three truncated corners with a open semicircular open
measurement results, it is shown that the corner-truncated slot corners. The effect of different radii of semicular slot has
With Semi Circular open slot patch scheme is an excellent been analyised to get the best possible bandwidth and gain.
approach, which can be used to make the proposed antenna The proposed antenna is simulated using Ansoft High
match well over an enhanced impedance bandwidth of 12.13 Frequency Structure Simulator (HFSS), which is full wave
GHz (2.26~14.39GHz), for a - 10dB return loss. In order to electromagnetic simulation software for the microwave and
validate the antenna performance, simulated results have been millimeter wave integrated circuits. Ansoft HFSS employs the
reported using HFSS EM solver. The proposed antenna is Finite Element Method (FEM), adaptive meshing, and
feasible for WLAN, WIMAX, Wi-Fi and other various brilliant graphics to give an unparalleled performance and
wireless applications. insight to all of the 3D EM problems [11, 12]. The 3D model
of proposed antenna generated in the HFSS is shown in Figure
Keywords 2.
Patch Antenna, Return Loss, UWB
TABLE 1: ANTENNA DIMENSIONS
1. INTRODUCTION Parameters Dimensions
In the changing world scenario of wireless communication Length Of Patch(Lp) 6 mm
systems, a wideband antenna has been playing a very Width Of Patch (Wp) 9 mm
important role for wireless services. Because of their low Thickness of substrate 0.8 mm
profile, wide bandwidth, compact size, low cost, and ease of Length of substrate (L) 35 mm
fabrication slot antennas are attractive candidates for Width of substrate (W) 30 mm
broadband and ultra wideband (UWB) applications. Width of feed (x) 1.53 mm
Enhancement of bandwidth by introducing slots in radiating Length of feed (Lf) 14.55 mm
patch [1,3,5,6] is one of the best method for enhancing
bandwidth of microstrip patch antenna .Feeding techniques
can also make noticeable enhancement in bandwidth, one of
which is microstrip patch antenna with edge feed
technique[4]. The resonant behavior analysis of small-size slot
antenna with different substrates [2] provides another method
for improving resonating behavior .These slot antennas can
achieve a good broadband characteristic. But along with
enhancement of bandwidth one the important factor has been
reduction of size of antenna which is much important. There
is huge range of UWB applications including wireless
communication system, radars, satellite communication and
lot more .In the presented work semicircular slot three side
truncated antenna has been employed for UWB and SHF
applications.

2. DESIGN AND STRUCTURE

Figure 1 shows the geometry of the three corner-truncated Figure 1: Geometry of proposed antenna showing patch
rectangular patch antenna with open semicircular slot and substrate
fabricated on the FR4 Substrate. The dielectric constant of
substrate ɛᵣ= 4.4 and a loss tangent of 0.02 and thickness of
the substrate h= 0.8mm have been used to design microstrip
patch antenna. The dimensional parameters of the proposed

50
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 2: Bandwidth and Return Loss for Different Radii

Radius of Bandwidth Return Loss

slot
2 mm A return loss of -24 dB at 3.1
10.9 GHz GHz and -23.1dB at 12 GHz
is obtained
2.4 mm A return loss of -24dB at
11.56 GHz 3GHz and -45dB at 12.50
GHz is obtained
2.6 mm A return loss of -29 dB at
12.17 GHz 2.90GHz and -26 dB at 12.50
GHz is obtained
2.7 mm A return loss of -28 dB at
12.12 GHz 2.90GHz and -21 dB at 12.60
GHz is obtained

Name X Y XY Plot 3 HFSSDesign1 ANSOFT

m10.00 2.4515 -10.3146 Curve Info

m2 14.0167 -9.9724 dB(S(1,1))
Setup1 : Sweep
-5.00

Figure:. 3D Ansoft HFSS generated model of proposed m1 m2

-10.00
antenna
-15.00
3. RESULTS AND DISCUSSION
dB(S(1,1))

-20.00
3.1 Return Loss
-25.00
Return loss is the loss of signal power resulting from the
reflection caused at a discontinuity in transmission line. This -30.00
discontinuity can be a mismatch with the terminating load or
-35.00
with a device inserted in the line. In the proposed work,
figures 3, 4,5 and 6 show different graphs for return loss with -40.00
circular slot of radius 2 ,2.4 ,2.6 and 2.7 respectively. For
-45.00
different values of radii of circular slot antenna shows 0.00 2.50 5.00 7.50 10.00 12.50 15.00
Freq [GHz]
different bandwidth and gain which are compared in Table 2.
Best results are evident at radius of 2.6 with band width of Figure 4: Return loss for the antenna with circular slot of
12.17 GHz radius 2.4mm
Name X Y XY Plot 3 HFSSDesign1 ANSOFT

m10.00 2.4983 -9.9219 Curve Info

m2 13.4080 -9.9622 dB(S(1,1))
Setup1 : Sw eep
Name X Y XY Plot 3 HFSSDesign1 ANSOFT

m10.00 2.2642 -10.0176 Curve Info

m2 14.4381 -9.8837 dB(S(1,1))
-5.00
Setup1 : Sweep

-5.00
m1 m2
-10.00
dB(S(1,1))

m1 m2
-10.00

-15.00
dB(S(1,1))

-15.00

-20.00

-20.00

-25.00
0.00 2.50 5.00 7.50 10.00 12.50 15.00
Freq [GHz]
-25.00

Figure 3: Return loss for antenna with circular slot of

radius 2mm -30.00
0.00 2.50 5.00 7.50 10.00 12.50 15.00
Freq [GHz]

3.2. VSWR Figure 5: Return loss for the antenna with circular sot of
VSWR stands for Voltage Standing Wave Ratio, and is also radius 2.6mm
referred to as Standing Wave Ratio (SWR). VSWR may be
express in terms of the reflection coefficient, which describes
the power reflected from the antenna. The VSWR is always a
real and positive number for antennas. The smaller the VSWR
is, the better the antenna is matched to the transmission line
and the more power is delivered to the antenna. The minimum
VSWR is 1.0. Figure 7 shows the VSWR which is well below
2.

51
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Name X Y XY Plot 3 HFSSDesign1 ANSOFT vertical/elevation plane [13, 14]. The H-field of proposed
15.00 2.2174 -10.0884
m1 Curve Info
m2 14.3445 -10.2449 dB(S(1,1))
antenna is shown in Figure 8.
m3 Setup1 : Sweep
10.00 14.3445 -10.2449

3.4. E-Field distribution

5.00
An electric field can be visualized by drawing field lines
0.00 which indicates the direction and magnitude of the field. The
E-plane containing the electric field vector and the direction
dB(S(1,1))

-5.00 of maximum radiation [4]. Field lines start on positive charge

-10.00
m1 m3
m2 and end on negative charge. The E-Field of the proposed
antenna is shown in Figure 9.
-15.00

-20.00

-25.00

-30.00
0.00 2.50 5.00 7.50 10.00 12.50 15.00
Freq [GHz]

Figure 6: Return loss for the antenna with circular slot of

radius 2.7 mm
XY Plot 1 HFSSDesign1 ANSOFT
70.00 Curve Info
VSWR(1)
Setup1 : Sw eep
60.00

50.00

40.00
VSWR(1)

30.00

20.00
Figure 9: E Field distribution for the proposed
antenna
10.00

4. CONCLUSSION
0.00
0.00 2.50 5.00 7.50 10.00 12.50 15.00 UWB antenna printed on FR4 substrate has been described.
Freq [GHz]
The simulation results of the antenna show that enhanced
Figure 7: VSWR for Three side truncated patch with impedance bandwidth can be achieved by using L-shaped slot
circular slot of radius 2.6 mm and 3-side truncated corners. Apart from this a semicircular
slot has been introduced on one side of truncated faces to
further enhance the operation bandwidth of antenna. In this
work a comparison has been conducted for various values of
radii of semicircular slot and best bandwidth is achieved at
R=2.6mm. It is seen that the proposed antenna achieved good
performance and compact size, which well meets the
requirements of UWB and SHF applications.

5. REFERENCES
[1] K.Song ,Y.Z .Yin,H.H.Xie and S.Zuo, “A Corner
Truncated Patch Scheme of Bandwidth Enhancement for open
Slot Antenna” Proceedings of International Symposium on
Signals, Systems and Electronics, 2010
[2] S.Kakkar, S.Rani and A.P Singh, “On the Resonant
Behavior Analysis of Small-Size Slot Antenna with
Different Substrates",International Journal of Computer
Applications, pp. 10-12, 2012
[3] A.Agarwal, N.Naushad and P.K.Singhal, “Trucated Gap
Coupled Wideband Rectangular Microstrip Patch
Figure 8: H field distribution for proposed antenna Antenna” International Journal of Computer Science and
Communication Engineering, Vol.-2, No.-1, 2013
3.3. H-Field Distribution [4] A.Singh, R.Kumar and H.S.Dadhwak, “Design of Edge
It is the plane containing the magnetic field vector and the Fed Rectangular Microstrip Patch Antenna for WLAN
direction of maximum radiation. The magnetic field or “H” Applications” VSRD International Journal of Electrical,
plane lies perpendicular to the “E” plane. The H-plane usually Electronics and Communications Engineering Vol.-2, No.-4,
coincides with the horizontal/azimuth plane in case of pp.160-167, 2012
vertically polarized antenna and in case of horizontally- [5] J. Singh, A.Singh, S.Kakkar, “ Design of 3-side Truncated
polarized antenna, it usually coincides with the Patch Antenna for UWB Applications” International Journal

52
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

on Recent and Innovation Trends in Computing and

Communication ,Volume: 2
[6] Y.W. Jang, " Broadband cross-shaped microstrip-fed slot
antenna," IEEE Electronics Letters, vol. 36, Issue 25, pp.
2056-2057, Dec 2000.
[7] S.Rani and A. P. Singh, “On the Design and Optimization
of New Fractal Antenna Using PSO” International Journal of
Electronics, vol. 100, No.-10, pp. 1383-1397, 2012
[8] S.I. Latif and L. Shafai, "Wideband and reduced size
microstrip slot antennas for wireless applications," IEEE
Antennas and Propagation Society Symposium, vol. 2, pp.
1959-1962, June 2004.
[9] A.Dastranj, A. Imani, and M.N. Moghaddasi, “Printed
wide slot antenna for wideband applications,” IEEE Trans. on
Antennas Propagation, Vol.56, No.10, 3097-3102,October
2008
.[10] K. Song, Y.-Z. Yin, and L. Zhang, “A novel monopole
antenna with a self-similar slot for wideband applications,”
Microwave Optical Technology Letters, Vol.52, No.1, p.95-
97, January 2010.
[11] C.-J. Wang , and S.-W. Chang, “A technique of
bandwidth enhancement for the slot antenna,” IEEE Trans. on
Antennas Propagation, Vol.56, No.10, 3321-3324, October
2008.
[12] J.-Y. Jan, and L.-C. Wang, “Printed wideband rhombus
slot antenna with a pair of parasitic strips for multiband
applications,” IEEE Trans. on Antennas Propagation, Vol.57,
No.4, 1267–1270, April 2009.
[13] Balanis, C. A., Antenna Theory: Analysis and Design,
John Wiley & Sons, Inc, USA, 2005.

53
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
GAIT RECOGNITION USING SVM AND LDA WITH PAL AND
PAL ENTROPY IMAGE
Reecha Agarwal
Student
BGIET, Sangrur, India
reechaagarwal@yahoo.co.in
ABSTRACT
In Gait recognition, identification of a person or human being from
far distance is performed without any cooperation from his side. Its
motive is to develop identification of human being using Gait
recognition method which provides high security in places such as
banks, military, parking slots, airports etc. Recognition of any
individual is a task to identify people. Human recognition methods
such as face, fingerprints, and iris generally require a cooperative
subject, physical contact or close area. These methods are not able to
recognize an individual at a distance therefore recognition using gait
is relatively new biometric technique without these disadvantages.
Human identification using Gait is method to identify an individual
by the way he walk or manner of moving on foot. Gait recognition is
a type of biometric recognition and related to the behavioral
characteristics of biometric recognition. Gait offers ability of distance
recognition or at low resolution.
This thesis aims to recognize an individual using his gait features and
proposed new method for Gait recognition using SVM and LDA with
GAIT PAL and PAL ENTROPY technique. Different parameters are
used such as distance between head and feet, distance between legs
and one another additional parameter used by us is distance between
hands. However the majority of current approaches are model free
which is simple and fast but we will use model based approach for
feature extraction and for matching of parameters with database
sequences. After matching of parameters CCR (Correct Classification
Rate) will be obtained using LDA (Linear Discriminant Analysis)
and SVM (Support Vector Machine) technique. Some experimental
results will show the effectiveness of proposed system.
Keywords
Gait Recognition; SVM; LDA and CCR.
I. INTRODUCTION
Surveillance technology is now present everywhere in modern
society. This is due to the increase in number of crimes as well as it is
necessary to provide a safer environment. Despite the huge increase
of surveillance systems, the question whether current surveillance
systems work as a deterrent to crime is still debatable. Security
systems should not be only able to predict when a crime is about to
happen but, more importantly they ought to identify the individuals
suspected of committing crimes through the use of biometrics such as
Gait Recognition. Recently, in surveillance applications the use of
Gait for people identification has attracted researchers from computer
vision. The suitability of Gait Recognition for surveillance systems
emerges from the fact that Gait can be perceived from a distance as
well as its non-invasive nature.
54
ISBN: 978-81-924893-0-8
Rishav Dewan
Associate Professor, ECE Department,
BGIET, Sangrur, India
rishavdewan@gmail.com
Today in banks, metropolitan public transport stations, and other real
time applications, authentication and verification are always required.
In such type of applications, biometric authentication methods are
more attractive. Biomechanics research (e.g. gait analysis, sport or
rehabilitation biomechanics, motor control studies) often involves
measuring different signals such as kinematics, forces, and EMG.
Gait is defined as “a manner of walking” in the Webster Collegiate
Dictionary. The extend definition of gait is to include both the
appearance and the dynamics of human walking motion. Gait analysis
is the systematic study of human walking , using the eye and brain of
experienced observers, augmented by instrumentation for measuring
body movements , body mechanics and the activity of the muscles.
Gait analysis can give qualitative as well as quantitative values for
the gait parameter. Gait can be detected and measured at low
resolution, and therefore it can be used in situations where face or iris
information is not available in high enough resolution for recognition.
II. BIOMETRICS
The first important steps towards preventing unauthorized access are
user authentication. User authentication is the process of verifying
identity. Traditionally password were set as a string which included
integer or special characters and were used for authentication and
these password can easily cracked but now biometric authentications
are used. Therefore, biometrics refers to the technologies that analyze
and measure characteristics of human body such as fingerprint iris,
voice and facial pattern, DNA etc. So it is critical to establish the
identity of an individual in a variety of scenarios ranging from
issuing a drivers license to granting access to highly secured
resources. The need for reliable identification and authentication
systems has increased due to rapid advancements in networking,
communication and mobility.
Traditional passwords and ID cards have been used for authentication
in many applications (e.g. Internet banking) or facilities (e.g. library)
although such mechanisms have several limitations.
Passwords can be guessed or disclosed to unlawful users and ID
cards can be stolen or forged, resulting in a break of security.
The most general definition of a biometric is:
“A physiological or behavioral characteristic, which can be used to
identify and verify the identity of an individual."
They can be classified into two categories as:
 Physiological: These are biometrics which is derived from
a direct measurement of a part of a human body. These
characteristics are related to the body. Recognition techniques
come into this category are fingerprint, face, iris, DNA and palm
print.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 1 Fingerprint detection
Figure 2 Face and iris detection
 Behavioural: These extract characteristics based on an
action performed by an individual, they are an indirect measure
of the characteristic of the human form. The main feature of a
behavioral biometric is the use of time as a metric. Established
measures include keystroke-scan and speech patterns. They are
related to behavior of the person. Voice and gait recognition
techniques come into this category.
As the physiological characteristics does not provide good
results in low resolution and need user cooperation therefore
recognition using Gait is more attractive.
Figure 3 Gait detection
55
ISBN: 978-81-924893-0-8
III. GAIT RECOGNITION
Gait Recognition aims to identify the individual by the way he
walk or move. Gait based recognition is more suitable in video
surveillance applications because of following advantages:
1 Recognition using gait do not need any user cooperation.
2 The gait of an individual can be captured at a distance.
3 Gait recognition does not require images that have been
captured to be of very high quality and provide good results in
low resolution.
Example: To analyze the video stream from surveillance
cameras. If an unauthorized authority walk in front of camera.
System will compare his gait with stored gait sequences and
recognize him and alerts the appropriate authority for necessary
action. The threat has been successfully detected from distance. Such
a system have large amount of applications, such as banks, airports
and high security areas.
Figure 4. Gait Recognition in Security Access Scenario
Gait as a biometric has many advantages as stated above which make
it an attractive proposition as a method of identification. Gaits main
advantage, unobtrusive identification at a distance, makes it a very
attractive biometric. The ability to identify a possible threat from a
distance, gives the user a time frame in which to react before the
suspect becomes a possible threat. Another motivation is that video
footage of suspects are readily available, as surveillance cameras are
relatively low cost and installed in most buildings or locations
requiring a security presence, the video just needs to be checked
against that of the suspect.
Ideal intelligent monitoring system should be able to automatically
analyze the collected video data, give out an early warning before the
adverse event happens, and reduce injury and economic loss. For
example, when the system detects abnormal behavior, it can
immediately determine the identities of all persons in the scene,
rapidly investigate their previous activities, and track the suspects
across the regions. It requires the monitoring system can not only
estimate the quantity, location and behavior, but also obtain the
identity information. Gait is the most suitable biometrics in the case
of intelligent visual surveillance. In monitoring scenes, people are
usually distant from cameras, which make most of biometric features
no longer available.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Gait Recognition Scenario IV. GAIT RECOGNITION SYSTEM

Gait Recognition system and background
Block diagram of general gait recognition system is shown below in
figure 6. Steps involved and exsting methods of all relevant steps are
explained below:

Figure 5. Gait Recognition Scenario

Example: in bank scenario, only few authorized people are allowed to

go into lockers room, here gait analysis technique is used, gait Figure 6. Gait Recognition System
sequences of those authorized people are stored in bank’s database,
therefore whenever an unauthorized person tries to enter into room, a) Video capture:
his gait sequences will not match with stored sequences and alarm In this method when a person enters his gait is captured through
system will be activated for any action. camera. Then this method of accurate tracking of a person in indoor
surveillence video stream is obtained from static camera. Example a
3.1 Advantages of Gait Recognition video camera on front door or any where in multicomplex can store
gait sequences of a moving person, so that video can be used for
The advantages of Gait as a biometric can be seen as other forms of
further processing.
biometric identification techniques
b) Background subtraction:
for the following reasons:
It is the most common approach of Gait recognition.
• Unobtrusive – The gait of a person walking can be extracted
In this approach moving objects from background in the scene are
without the user knowing they are being analyzed and without any
identified first. After that we will consider the relevant part of the
cooperation from the user in the information gathering stage unlike
frame and irrelevant part will be deleted i.e. instead of complete
fingerprinting or retina scans.
frame only the portion in which a person is moving is identified. Also
• Distance recognition – The gait of an individual can be captured at
while implementing background subtraction we use median filter so
a distance unlike other biometrics such as fingerprint recognition.
that it helps in to remove noise.
• Reduced detail – Gait recognition does not require images that
Background subtraction techniques can be categorised into two types:
have been captured to be of a very high quality unlike other
1. Non-Recursive method:
biometrics such as face recognition, which can be easily affected by
Non-Recursive techniques use sliding window approach for
low resolution images.
background subtraction.
• Difficult to conceal – The gait of an individual is difficult to
2. Recursive method:
disguise, by trying to do so the individual will probably appear more
The recursive methods use single Gaussian method and Gaussian
suspicious.
mixture model. Recursive techniques require less storage.
With other biometric techniques such as face recognition, the
c) Feature Extraction: An important step in gait recognition is the
individuals face can easily be altered or hidden.
extraction of appropriate feature that will effectively capture the gait
Being a biometric, an individual’s biometric signature will be
characteristics.
affected by certain factors such as:
When the input data is too large to be processed and it is suspected to
• Stimulants – drugs and alcohol will affect the way in which a
be notoriously redundant (e.g. the same measurement in both feet)
person walks.
then the input data will be transformed into a reduced representation
• Physical changes – a person during pregnancy, after an
set of features (also named features vector). To transform the input
accident/disease affecting the leg, or after severe weight gain / loss
data into the set of features is called feature extraction.
can all affect the movement characteristic of an individual.
d) Recognition: This is the last step of gait-based individual
• Psychological – a person’s mood can also affect an individual’s gait
detection. Here, input test video sequences are compared with the
signature.
trained sequence in the database. In general, minimum distance
• Clothing – the same person wearing different clothing may cause
classifier may be used for gait recognition.
an automatic signature extraction method to create a widely varying
signature for an individual.
Although these disadvantages are inherent in a gait biometric V. PROPOSED METHODOLOGY
signature, other biometric measures can easily be disguised and
In this the two videos are captured through mobile and are made
altered by individuals, in order to attempt to evade recognition.
compatible by coding using MATLAB which are then converted into
frames and frames to video using MATLAB command.
After that we are comparing Input or live video with database video
which is then converted into frames.

56
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The steps of the proposed work are as following:-

 Firstly, we are taking different videos having different DATABASE VIDEO INPUT VIDEO
extensions so as the input video when compared with
database video will be converted into frames so that we can
match them.
 Secondly, a live video when compared with database video
will be matched based on the walking style of the person or
on the basis of movement of the person that is if the
walking style of both the persons is same then the result
will be matched otherwise not matched. Database of current video
DATABASE CREATED
 Thirdly, we will implement the concept of background
subtraction so that the unneeded part will be deleted and so (parameters of database)
we need to concentrate only on him rather than the
complete frame.
 Fourthly, the concept of feature extraction is implemented
in which we are taking the parameters based on Hanavan’s
model which is model based approach and also the
technique named Surf feature is used for matching the
video.
Extract features from database
 In the final step, that is recognition we are calculating the
accuracy of the previous work SVM with the accuracy of
our work using SVM and LDA for better results. Also, we
are matching input video with database video i.e. we will
check how much efficient our CCR is.
This proposed Gait Recognition System is the one which
consists of the following steps which is shown with the
help of flowcharts.

Matching of current input video with database video using

START MODEL BASED APPROACH.
Different parameters considered (distance between legs, head
to feet and distance between hands)
Load Input Video or
Live Video

Background Subtraction

Feature Extraction (PAL and

PAL entropy technique) CCR (correct classification rate ) using SVM+LDA

Figure 7. The Proposed Gait Recognition

System
Database is N N
Create Database
present?

Y
RECOGNITION USING
LDA+SVM TECHNIQUE

Display the Results Obtained

END

57
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

5.1 Input video: filtering by median filter can be involved to eliminate noise.
The foremost step is to capture an input video for gait identification.
First input video will be converted into frames known as video
sequences, and those frames are used for further gait Recognition
process.

Figure 10. GUI figure file for Background Subtraction

Figure 8. GUI figure file for loading video

Figure 11. Background Subtraction

5.3 Feature Extraction:

Figure 9. Loading the Video
5.2 Background Subtraction:
After converting video into frames, next is background subtraction.
Identifying moving objects from a video sequence is a fundamental
and critical task in many computer-vision applications. A common
approach is to perform background subtraction, which identifies
moving objects from the portion of a video frame that differs
significantly from a background model. Gaussian mixture model is
used for foreground object estimation in which an additional step of
Feature selection is a crucial step in gait recognition. The feature
must be robust to operating conditions and should yield good
discriminability across individuals. Each gait sequence is divided into
cycles. Gait cycle is defined as person starts from rest, left foot
forward, rest, right foot forward, rest. Figure 4.7 shows the stances
during gait cycle. Gait cycle is determined by calculating sum of the
foreground pixels. At rest positions this value is low.

58
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure 12. Stances during gait cycle

Figure 15. Canny Representation

Figure 16. Prewitt Representation

Figure 13. GUI figure file for feature extraction

Figure 14. Cropped image

59
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

low dimensional space with the LDA algorithm. The objective of

LDA is to perform dimensionality reduction while preserving as
much of the class discriminatory information as possible. In general,
if each class is tightly grouped, but well separated from the other
classes, the quality of the cluster is considered to be high.
In PCA, the shape and the location of the original data sets changes
when transformed to a different spaces whereas LDA doesn’t change
the location but only tries to provide more class separability and draw
decision between the given classes. In discriminant analysis, two
scatter matrices, called within-class (Sw) and between-class (Sb)
matrices, are defined to quantify the quality.
T
=
where = x is the mean of ith class
and m= = x is the global mean.

VI. RESULTS AND DISCUSSIONS

In the following figures, results of following figures are highlighted.

Figure 17. Parameters calculated for feature extraction

5.4 Matching and Recognition

The last step in this is recognition which means to compare the
results i.e. we are comparing the input video with the database stored
video to check whether they are same or not. For matching we use the
surf method technique to match the two different images or frames.
Then these extended vectors are matched to the trained data base with
the help of Support Vector Machine and LDA.

A. SUPPORT VECTOR MACHINE (SVM) Figure 18. GUI figure file for matching the video
The theory of SVM is based on the idea of structural risk
minimization. In many applications, SVM has been introduced as a
powerful tool for solving classification problems. Many researchers
have used SVM on gait recognition. Therefore, it is to be noted that
SVM is fundamentally a two-class classifier. First class maps the
training samples into a high dimensions space and then finds a
separating hyper plane that maximizes the margin between two
classes in this high dimension space.
This has two advantages:
a) First, the ability to generate non-linear decision boundaries using
methods designed for linear classifiers.
b) Second, the use of kernel functions allows the user to apply a
classifier to data that have no obvious fixed-dimensional vector space
representation.

B. LINEAR DISCRIMINANT ANALYSIS Figure 19. Successful Match

(LDA) In the above figure Input video was matched with database image and
LDA is a technique which is used for the feature extraction and SVM AND LDA results were calculated. In this case input video is
dimension reduction. It has been used in many applications involving same as database image. SVM and LDA results are better.
high-dimensional data such as image retrieval and recognition. The
LDA method is employs to perform training and projecting on
original gait feature. It reduces dimensionality of high dimensional
gait feature with PCA, and then performs optimal classification on

60
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table (4.1) Comparison of CCR between Previous and our

algorithm

Previous work SVM Proposed work SVM and

LDA

CCR 93.79 99.801

Figure 22. The accuracy value of GPPE with SVM and LDA

This bar graph in figure 23 shows comparison of accuracy between

base paper technique i.e., GPPE GPPE (Gait Pal and Pal Entropy)
with SVM and GPPE with SVM and LDA. Accuracy of proposed
technique is better in comparison to previous technique as can be
seen from bar graph. The values are same as shown in above
table.For bar graph we use bar command in MATLAB.

Figure 20. GUI figure file for matching the unsuccessful video

Figure 23. Accuracy graph of SVM and LDA

This table in figure 24 shows comparison of accuracy between base

paper technique i.e., GEnI (Gait Entropy Intensity) with SVM and
proposed work GEnI with SVM and LDA. Accuracy of proposed
technique is better in comparison to previous technique. Accuracy
value has been calculated using equation and algorithm which has
been implemented using MATLAB software.For table uitable
command is used in MATLAB.

Figure 21. Unsuccessful match

This table in figure 22 shows comparison of accuracy between base

paper technique i.e., GPPE (Gait Pal and Pal Entropy) with SVM and
proposed work GPPE with SVM and LDA. Accuracy of proposed
technique is better in comparison to previous technique. Accuracy
value has been calculated using equation and algorithm which has
been implemented using MATLAB software.For table uitable
command is used in MATLAB.
Figure 24. The accuracy value of GenI with SVM and LDA
This bar graph in figure 25 shows comparison of accuracy between
base paper technique i.e., GEnI (Gait Entropy Intensity) with SVM
and GEnI with SVM and LDA. Accuracy of proposed technique is
better in comparison to previous technique as can be seen from bar
graph. The values are same as shown in above table.For bar graph we
use bar command in MATLAB.

61
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

International conference on Advanced Information Networking and

Applications, Perth, Australia, 20-23.
[7] J.Han and B.Bhanu, 2006. “Individual recognition using gait
energy image,” IEEE Trans.on pattern analysis and machine
intelligence, vol. 28, no.2,pp. 316-322.
[8] J. J. Little and J. E. Boyd, 1998. “Recognizing People by their
Gait: The Shape of Motion,” Videre: J. Computer Vision Research, 1
(2), 1–32 (1998).
[9] Kaur et al., 2013. “Gait Recognition for human identification
using ENN and NN,” International Journal of Advanced Research in
Computer Science and Software Engineering 3(11), pp. 1154-1161.
[10] Lili Liu, Wei Qin, Yilong Yin, Ying Li, 2011 “Gait recognition
based on outermost contour,” International Journal of computational
intelligence systems, Vol.4, No.5.
[11] M.Jeevan, Neha Jain et al., 2013. “Gait Recognition Based on
GAIT PAL AND PAL ENTROPY IMAGE,” pp.4195-4198.
Figure 25. Accuracy graph of GenI with SVM and LDA [12] Niyogi, S., Adelson, E., 1994. “Analyzing and recognizing
. walking figures in XYT,”. In IEEE Computer society conference on
CONCLUSION computer vision and pattern recognition, Seattle, Wash, USA, pp.
469-474.
In this we conclude that to analyze the video streams from
[13] N.K Narayanan,V.Kabeer, “Face recognition using nonlinear
surveillance cameras of a person i.e. if a person walks by the camera
feature parameter and artificial neural network,” International
who's gait has been previously recorded and it is a known threat then
journal of computer intelligence systems, 3(5), 566-574.
the system will recognize him and the concerned authorities can be
[14] Shaveta chauhan et al., 2014 “Gait Recognition using BPNN and
alerted automatically so that the person can be detected before he is
SVM,” International Journal of Computer Application and
allowed to become a threat. The threat can be detected from a
Technology, ISSN: 2349-1841, pp. 63-67.
distance, creating the time buffer for authorities to take action.
[15] S.J.McKenna, S.Jabri, Z.Duric, “Tracking group of people,”
Also in this work we use Gaussian mixture model for foreground
Comput. Vis. Image Understanding, vol.80, no. 1,pp. 42-56.
object estimation in which an extra step regarding filtering through
[16] Su-Li XY, Qian-jin ZHANG, 2010. “ Gait recognition using
median filter can be involved to eliminate noise. Moving target
fuzzy principal component analysis”, 2nd International Confrence on
classification algorithm is used to separate human being (i.e.,
e-business and information system security, IEEE.
pedestrian) from other foreground objects (viz., vehicles). Shape and
boundary information is used for this moving target classification.
The width vector of outer contour of binary silhouette and Gait PAL
AND PAL ENTROPY coefficients for extracting the feature vector
are used and these feature vectors extracted are used to recognize
individual. Surf Feature is used for recognizing persons based on gait.
The parameters like distance between head and feet, distance between
hands and distance between legs are calculated. Finally SVM and
LDA results are calculated which is far better in comparison to
previous research paper.

REFERENCES
[1] A.Hayder, J.Dargham, A.Chekima and G.M. Ervin 2011. “Person
Identification using GAIT,” International Journal of Computer and
Electrical Engineering, vol 3, issue no. 4.
[2] Alese B.K., Mogagi S.A., Adewale O.S. and Daramola O.,2012.
“Design and Implementation of Gait Recognition System,”
International Journal of Engineering and Technology, vol. 2, no.7.
[3] Anupam shukla, Ritu Tiwari, Sanjeev Sharma, 2011.
“Identification of people using gait biometrics”, International journal
of machine learning and computing, Vol.1, No. 4.
[4] Bashir Khalid, Xiang Tao, Gong Shaogang , “Gait Recognition
Using Gait Entropy Image”, 3rd International Conference on Crime
Detection and Prevention (ICDP 2009).
[5] C.Y.Yam, M.S Nixon and J.N., 2001. “Extended model based
automatic gait recognition of walking and running”, 3rd proc.
AVBPA 2001,pp.278-283.
[6] Davrondzhon Gafurov, Einar Snekkenes and Patrick Bour,
2010.“Improves gait recognition performance using cycle matching”,

62
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ENHANCEMENT OF THE ACCURACY OF PHOTONIC
STRUCTURE OF PHOTONIC CRYSTAL FIBER BY USING
ARTIFICAL NEURAL NETWORK
Amit Goyal
Department of Electronics and communication Engg.
Bhai Gurdas Institute of Engineering &Technology
Sangrur, India
amitgoyal672@gmail.com
ABSTRACT
There are several methods introduced to refining the accuracy
of Photonic structures. No one has as yet studied the effect of
Neural Networks in refining the accuracy of the photonic
structure of the Photonic Crystal Fibers. In this paper we use
The simulation that will be conducted using artificial neural
networks to refining the accuracy of the photonic crystal
fibers &.Artificial neural network will be further optimized by
varying the number of layers to enhance the accuracy of the
photonic structure of the photonic crystal fibers.
Keywords
Photonic structure; crystal fiber; artificial neural network.
1. INTRODUCTION
Photonic-crystal fiber (PCF) is a new class of optical fiber
based on the properties of photonic crystals. Because of its
ability to confine light in hollow cores or with confinement
characteristics not possible in conventional optical fiber, PCF
is now finding applications in fiber-optic communications,
fiber lasers, nonlinear devices, high-power transmission,
highly sensitive gas sensors, and other areas[1,2].
Fig. 1: A lattice with the same symmetry (fcc in this case)
may present different topologies. a) isolated dielectric
spheres in air, b) interpenetrated dielectric spheres in air, c)
isolated air spheres in a dielectric and d) interpenetrated air
spheres in a dielectric.
Photonic Crystal Fiber (PCF) can provide characteristics that
ordinary optical fiber do not exhibit, such as: single mode
operation from the UV to IR with large mode-field diameters,
highly nonlinear performance for super continuum generation,
63
ISBN: 978-81-924893-0-8
Kamaljeet Singh Sidhu
Electronics and communication Engg.
Bhai Gurdas Institute of Engineering &Technology
Sangrur, India
sidhuk95@yahoo.in
numerical aperture (NA) values ranging from very low to
about 0.9, optimized dispersion properties, and air core
guidance, among others[3]. Applications for photonic crystal
fibers include spectroscopy, metrology, biomedicine, imaging,
telecommunication, industrial machining, and military, and
the list keeps growing as the technology becomes a
mainstream. Photonic crystal fibers are generally divided into
two main categories[3,4]: Index Guiding fibers that have a
solid core, and Photonic Band gap or air guiding fibers that
have periodic micro-structured elements and a core of low
index material (e.g. hollow core). Structured optical fibers are
also called micro structured optical fibers and sometimes
photonic crystal fiber in case the arrays of holes are periodic.
PCF (Photonic Crystal Fiber) is a type of optical fiber using
the properties of photonic crystals[4,5]. Its advantages against
a conventional optical fiber are possibility to control optical
properties and confinement characteristics of material. The
conventional optical fibers simple guide light and they have
started revolution in telecommunication[6]. The principle of
total internal reflection has been used for guiding of light in
the fiber. Nowadays, we almost have reached the maximum of
its the best properties, which are limited by the optical
properties of their solid cores (attenuation 0.2 dB/km, zero
dispersion shifted to the minimum loss window at 1550 nm on
used wavelength with fiber[7,8].
Fig. 2: Point defects in a square lattice made of dielectric
rods (radius=0.2a). Depending on the radius (r) of the point
defect, localized states are created within the cPBG.
Low-loss dielectric periodic material with sufficiently
different dielectric constants in crystals can control flow of
the light. Crystals with photonic band gaps can be design We
can design such structure which can prevent the light from
propagation in certain directions with specified range of
wavelengths. Hollow Core Photonic Crystal Fibers (HC-PCF)
is also called holey fiber[9,10]. It enables the guidance of the
light in the hollow core with lower attenuation than in the
solid silica core. The core can be filled by air or gas. There are
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
many advantages of using PCF against a conventional optical
fiber. The biggest ones are possibility to control optical
properties and confinement characteristics of material. Since
these fibers allow for guidance through hollow fibers (air
holes).there is smaller attenuation than with fiber with solid
core. PCFs with larger cores may carry more power than
conventional fibers. Larger contrast available for effective-
index guidance[10,11]. Attenuation effects not worse than for
conventional fibers. Control over dispersion: size of air holes
may be tuned to shift of zero dispersion into visible range of
the light. have a 9-point text, as you see here. Please use sans-
serif or non-proportional fonts only for special purposes, such
as distinguishing source code text. If Times Roman is not
available, try the font named Computer Modern Roman[12].
On a Macintosh, use the font named Times. Right margins
should be justified, not ragged.
2. METHODOLOGY
Matlab will be used as the simulation tool. Attempt will be
made to enhance the Accuracy of Photonic Structure of
Photonic Crystal Fiber using Artificial Neural Networks. First
The Parameters of the photonic structure will be considered.
Neural networks have proved themselves as proficient
classifiers and are particularly well suited for addressing non-
linear Problems. Given the non-linear nature of real world
phenomena, like Enhancing the Accuracy of Photonic
Structure of Photonic Crystal Fiber, neural networks is
certainly a good candidate for solving the problem. The
Parameters (as shown in TABLE I) will act as inputs to a
neural network and the enhancement of accuracy of the
photonic structure will be the target. Calculate the photonic
band gaps for various input parameters by using plane wave
method. Find the unit cells which are perpendicular to the xy
plane then form the equation matrix of 2N by 2N.for this case
there have no TE & TM decoupling[11,12]. Find the band gap
& save these values into its appreciate band. Then plotting the
variation of band gap between sio2-air PBG. Similarly repeat
all of this for three samples unless you get desired PBG (as
shown in fig 1a,1b,1c,1d,1e).these figures show the photonic
band gap variation in 2d triangular lattice of sio2-air PBG.For
figs 1(a,b,c,d,e) epsa is the dielectric constant of air,epsb is
the dielectric constant of sio2,a is the diameter & f is the
spacing between holes.
64
ISBN: 978-81-924893-0-8
Fig. 3: Photonic fibers. a) Cross-section images of the omni-
guide . This guide is based on the omnidirectional Bragg
mirrors. b) it consists of a hollow core surrounded by a 2D
photonic crystal that confines light within the core
At last in the photonic band gap graphs if the region width
<.574 then it guides the value else leaky the value[14].
Further Given an input, which constitutes the measured values
for the parameters of the photonic structure, the neural
network is expected to identify if the accuracy has been
achieved or not. This is achieved by presenting previously
recorded parameters to a neural network and then tuning it to
produce the desired target outputs. This process is called
neural network training. The samples will be divided into
training, validation and test sets[14,15]. The training set is
used to teach the network. Training continues as long as the
network continues improving on the validation set. The test
set provides a completely independent measure of network
accuracy. The trained neural network will be tested with the
testing samples. The network response will be compared
against the desired target response to build the classification
matrix which will provide a comprehensive picture of a
system performance[16].
2.1. The training data
The training data set includes a number of cases, each
containing values for a range of input and output variables.
The first decisions you will need to make are: which
variables to use, and how many (and which) cases to gather.
The choice of variables (at least initially) is guided by
intuition. Expertise in the problem domain will give you some
idea of which input variables are likely to be influential. As a
first pass, you should include any variables that you could
have an influence - part of the design process will be to reduce
this set down. Neural networks process numeric data in a
fairly limited range. This presents a problem if data is in an
unusual range, if there is missing data, or if data is non-
numeric. Fortunately, there are methods to deal with each of
these problems[12,13]. Numeric data is scaled into an
appropriate range for the network, and missing values can be
substituted for using the mean value (or other statistic) of that
variable across the other available training cases[16,17].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3. RESULTS AND DISCUSSION

In this paper used unary encoding in this simulation to
perform symbol translation. The first six columns of data will
represent the Cloud characteristics. The 7th column epresents
whether the job is to be transferred or not. This data will be
randomly generated. The next step will be to preprocess the
data into a form that can be used with a neural network. The
next step is to create a neural network that will learn to
identify if the accuracy has been achieved or not. The
assumed samples will be automatically divided into training,
validation and test sets. The training set will be used to teach
the network. Training will continue long as the network
continues improving on the validation set (as shown in fig 2).
The test set will provide a completely independent measure of
neural network accuracy to detect accuracy. The trained
neural network will be tested with the testing samples. This
will give a sense of how well the network will do when
applied to data from the real world[10,11]. The overall Fig 4 :-Graph shows number of layers vs. percentage
architecture of your neural network is store in the variable net. accuracy
The simulation of network returned output in matrix or
structure format. The performance evaluation involves 4. CONCLUSION
Comparison between target and network’s output in testing
set.(generalization ability). Comparison between target and Neural networks have proved themselves as proficient
network’s output in training set. (Memorization ability). classifiers and are particularly well suited for addressing non-
Design a function to measure the distance/similarity of the linear problems[12,13]. Given the non-linear nature of real
target and output[13]. The result shows the graphical world phenomena, like Enhancing the Accuracy of Photonic
representation of percentage accuracy versus number of Structure of Photonic Crystal Fiber, neural networks is
layers(shown in Fig 3). From this it is clear that number of certainly a good candidate for solving the problem[15,16].
two layers is sufficient to achieve the 100% accuracy. From the fig 3 it is clear that only number of two layers are
sufficient to achieve the accuracy of 100%.

5. ACKNOWLEDGMENTS
I should like to take this opportunity to express a deep sense
of gratitude to Er. Amit Goyal for providing me valuable &
consistent guidance, generous advices, academic support
,encouragement during the preparation of manuscript fig 2
shows the performance of neural network

Fig.3 graph shows number of layers vs. percentage accuracy

The constant guidance & encouragement received from books
and internet & great help in carrying out the present work.
Our colleague peerless experiences & knowledge in this field
were very helpful to me for this work.

REFERENCES
[1] Liu Ming-sheng; Yue Ying-juan; Li Yan; , "Birefringence
property of asymmetric structure photonic crystal fiber,"
Communications and Photonics Conference and Exhibition
(ACP), 2010 Asia , vol., no., pp.699-700, 8-12 Dec. 2010

[2] Gowre, S.K.C.; Mahapatra, S.; Sahu, P.K.; Biswas, J.C.; ,

Fig 3:- Graph shows the performance of neuron network "Design and analysis of a modified Photonic Crystal Fiber
structure," Industrial and Information Systems, 2007. ICIIS
2007. International Conference on , vol., no., pp.159-162, 9-
11 Aug. 2007

[3] Rostami, A.; Ghanbari, A.; Soofi, H.; Janabi-Sharifi, F.; ,

"Enlarging effective mode area of photonic crystal fibers
using defected core structures," Optomechatronic
Technologies (ISOT), 2010 International Symposium on ,
vol., no., pp.1-4, 25-27 Oct. 2010

65
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[4] Li Bing-xiang; Xie Ying-mao; , "The band gap structure
on the disorder hollow core triangular lattice photonic crystal
fiber," Advances in Optoelectronics and Micro/Nano-Optics
(AOM), 2010 OSA-IEEE-COS , vol., no., pp.1-4, 3-6 Dec.
2010
[5] Gedik, E.; Topuz, E.; , "Photonic Band Gaps of the
Honeycomb Photonic Crystal Fiber Structure," Signal
Processing and Communications Applications, 2007. SIU
2007. IEEE 15th , vol., no., pp.1-4, 11-13 June 2007
[6] Chen, Daru; , "Absolutely single polarization photonic
crystal fiber based on a structure of sub-wavelength hole
pitch," Communications and Photonics Conference and
Exhibition (ACP), 2009 Asia , vol.2009-Supplement, no.,
pp.1-6, 2-6 Nov. 2009
[7] Morishita, K.; Miyake, Y.; , "Fabrication and resonance
wavelengths of long-period gratings written in a pure-silica
photonic crystal fiber by the glass structure change,"
Lightwave Technology, Journal of , vol.22, no.2, pp. 625-
630, Feb. 2004
[8] Matsui, T.; Nakajima, K.; Fukai, C.; , "Applicability of
Photonic Crystal Fiber With Uniform Air-Hole Structure to
High-Speed and Wide-Band Transmission Over Conventional
Telecommunication Bands," Lightwave Technology, Journal
of , vol.27, no.23, pp.5410-5416, Dec.1, 2009
[9] AbdelMalek, F.; Hongbo Li; Schulzgen, A.; Moloney,
J.V.; Peyghambarian, N.; Ademgil, H.; Haxha, S.; , "A
Nonlinear Switch Based on Irregular Structures and
Nonuniformity in Doped Photonic Crystal Fibers," Quantum
Electronics, IEEE Journal of , vol.45, no.6, pp.684-693, June
2009
[10] Najafi, A.; Jalalkamali, M.; Moghadamzadeh, S.;
Bolorizadeh, M.A.; , "Finite Element Method Analysis of
Photonic Crystal Fiber Band Structure," Photonics and
Optoelectronic (SOPO), 2010 Symposium on , vol., no., pp.1-
4, 19-21 June 2010
[11] Juan Juan Hu; Guobin Ren; Ping Shum; Xia Yu;
Guanghui Wang; Chao Lu; , "Analytical method for band
structure calculation of liquid crystal filled photonic crystal
fibers," Opto-Electronics and Communications Conference,
2008 and the 2008 Australian Conference on Optical Fibre
66
ISBN: 978-81-924893-0-8
Technology. OECC/ACOFT 2008. Joint conference of the ,
vol., no., pp.1-2, 7-10 July 2008
[12] Gedik, E.; Topuz, E.; , "An Investigation of the Photonic
Crystal Fiber Structure with Different Air Hole Diameter,"
Signal Processing and Communications Applications, 2006
IEEE 14th , vol., no., pp.1-4, 17-19 April 2006
[13] Jung-Sheng Chiang; Tzong-Lin Wu; , "A novel periodic
structures in photonic crystal fibers," Lasers and Electro-
Optics, 2003. CLEO/Pacific Rim 2003. The 5th Pacific Rim
Conference on , vol.1, no., pp. 17 Vol.1, 15-19 Dec. 2003
[14] Chen, Daru; , "Absolutely single polarization photonic
crystal fiber based on a structure of sub-wavelength hole
pitch," Communications and Photonics Conference and
Exhibition (ACP), 2009 Asia , vol., no., pp.1-2, 2-6 Nov.
2009
[15] Wang Guanjun; Liu Jiansheng; Zheng Zheng; Yi Yang;
Xiao Jing; Bian Yusheng; , "A fast response photonic crystal
fiber grating refractometer with a side-opening structure,"
Lasers and Electro-Optics (CLEO), 2011 Conference on , vol.,
no., pp.1-2, 1-6 May 2011
[16] Lin, Y.; Herman, P. R.; Valdivia, C. E.; Li, J.; Kitaev, V.;
Ozin, G. A.; , "Photonic band structure of colloidal crystal
self-assembled in hollow core optical fiber," Applied Physics
Letters , vol.86, no.12, pp.121106-121106-3, Mar 2005
[17] Jianhua Li; Rong Wang; Jingyuan Wang; Baofu Zhang;
Hua Zhou; , "Highly birefringent photonic crystal fiber with
hybrid cladding structure," Communications and Photonics
Conference and Exhibition (ACP), 2010 Asia , vol., no.,
pp.222-223, 8-12 Dec. 2010
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Effect of Different Feeding Techniques on Slot Antenna

Sushil Kakkar Shweta Rani Anuradha

ECE Department ECE Department ECE Department
BGIET, Sangrur BGIET, Sangrur NIT, Hamirpur
kakkar778@gmail.com shwetaranee@gmail.com sonanu8@gmail.com

ABSTRACT The fields at the edges of the patch undergo fringing because
An analysis of resonant behavior of a small-size square shape the dimensions of the patch are finite along the length and
slot antenna with different feeding techniques has been width [1].
presented in this paper. It has been observed that for nearly
same dimensions of the patch, the microstrip line feed gives
better return loss and VSWR in comparison to CPW and
probe feed whereas CPW feed provides better gain and
bandwidth than rest of the two feeding techniques for the
particular structure. Results shows that the proposed antenna
may be used as small, compact antenna for X-band
applications.

Keywords
Feeding Techniques, Slot antenna, Bandwidth

1. INTRODUCTION
The increasing progress in wireless communication system (a)
and an increasing demand to integrate different technologies
in to small user equipment has remarkably increase the
fashion of introducing compact antennas [1]. Microstrip patch
antenna, because of its small size, low profile, low
manufacturing cost and ease of integration with feed
networks, is find extensive applications in wireless
communication system [2-3]. Because of extremely thin
profile (0.01 to 0.05 wavelength), printed microstrip antennas
have found heavy applications in military aircraft, missiles,
rockets and satellites [4-5]. One of the most applicable
frequency bands is X-band, ranges from 8-12 GHz. The X-
band frequencies are used in satellite communications, radar
applications and terrestrial communications [6]. Traditional
feeding techniques include the use of aperture coupled
microstrip lines, coaxial probe and coplanar waveguide (b)
(CPW). Using coplanar waveguides offers the advantages of
ease of integration with active devices due to their unipolar
design, eliminating the need of vias. The accurate
determination of antenna impedance is important because of
the fact that most microwave sources and lines are
manufactured with 50Ω characteristic impedance [7-10]. In
this paper a square shape slot antenna has been designed to
analyze the relationship between the resonant performances of
the antenna with different feeding techniques.

2. DESIGN CONSIDERATIONS
The basic geometry of proposed antenna for different feeding
configurations is shown in Fig. 1. The antenna is a small-size (c)
slot antenna having length, L = 20 mm and width, W = 20 mm
Fig. 1: Geometrical Construction of Proposed Antenna.
and designed with FR4 substrate having dielectric constant of
(a) Probe feed, (b) CPW feed, (c) Microstrip Line feed
Єr= 4.4. The presented antenna structure has similar slots in its
design which is responsible for the small size and its low cost.
The dimensions of the slots are Ls = 12 mm and Ws = 12 mm.

67
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3. SIMULATED RESULTS 3.2 Gain and radiation patterns

The maximum achievable gain with different feeding
3.1 Comparison of Resonant properties with Different
Feeding Techniques techniques of the proposed antenna is shown from Fig. 3 to
The simulation tool adopted for evaluating the performance of Fig. 5. It has been clearly illustrated that the CPW feeding
the proposed antennas is IE3D software, which is based on technique provides highest gain of 4.13 dBi.
method of moments technique. Table.1 has shown the
resonant performance characteristics of the square shape slot
antenna with different feeding techniques. In this analysis we
have taken three different feeding techniques that are coaxial
probe, microstrip line and coplanar waveguide. It has been
observed that when patch has been fed by microstrip line, it
gives better return loss and VSWR in comparison to other two
techniques. While with coplanar waveguide (CPW) feed,
bandwidth and gain increases considerably. The resonant
characteristics with probe feed for the proposed slot antenna is
average between the other two feeding techniques. Fig. 2
shows the s-parameters of proposed small-size slot antenna
and from the figure it is clear that the antenna resonate at
9.455 GHz (9.27-9.66 GHz) with microstrip line feed, at
9.495 GHz (8.76-10.3 GHz) with CPW feed and at 9.697 GHz Fig. 3: Simulated gain of proposed antenna with
(9.535-9.98 GHz) with coaxial feed. microstrip line feed.
Table 1. Comparison of resonant performance
characteristics.
Resonant Microstrip CPW Feed Probe
Characteristics Line Feed Feed

Resonant Freq. 9.455 9.495 9.697

(GHz)

Return Loss (dB) -41.45 -13.81 -17.05

VSWR 1.017 1.513 1.327

Gain (dBi) 1.687 4.13 3.09

Bandwidth (%age) 4.12% 16.1% 4.56%

Fig. 4: Simulated gain of proposed antenna with CPW
feed.

Fig. 5: Simulated gain of proposed antenna with probe

feed.
Fig. 2: S-parameters of the Proposed Antenna with
different feeding techniques.
The radiation characteristics of proposed slot antenna for
different feeding techniques are shown from Fig. 6 to Fig.8
and it has been observed that they are nearly similar in nature.

68
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The radiation pattern is symmetrical to antenna axis in E-

plane and nearly omnidirectional pattern in H-plane.

(b)

Fig. 7: Radiation Pattern at 9.495 GHz (a) E-plane (b) H-

(a) plane.

(b) (a)

Fig. 6: Radiation Pattern at 9.454 GHz (a) E-plane (b) H-

plane.

(b)

Fig. 8: Radiation Pattern at 9.697 GHz (a) E-plane (b) H-

plane

69
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
4. CONCLUSION
Feeding mechanism plays an important part in the resonant
performance characteristics of the antenna design. A
comparative study of resonant performance of square shape
slot antenna with different feeding configurations has been
presented in this paper. It has been illustrated that proposed
square shape slot antenna gives better return loss and VSWR
with microstrip line feed but with CPW feeding it provides
wider bandwidth and highest gain in comparison to rest of the
two feeding techniques. The proposed antenna is feasible for
use as small size, low profile and low cost antenna for X-band
applications.
REFERENCES
[1] A. Balanis, “Antenna Theory”. John Wiley & Sons, Inc.
1997.
[2] M. Hirvoven, P. Pusula, K. Jaakkola and K. Laukkanen,
“Planar Inverted F- Antenna for Radio Frequency
Identification”, IEEE Electronic Letters, vol. 40, no. 14,
pp. 848- 850, 2004.
[3] F.Yong, X. Zhang, X. Ye, and Y. Rahmat-Samii, Wide-
band E-shaped patch antennas for wireless
communication," IEEE Trans.on Antennas Propagat.,
Vol. 49, No. 7, pp.1094-1100, Jul. 2001.
[4] Jen-Yea Jan and Jia-wei Su, “Bandwidth enhancement of
a printed wide slot antenna with a rotated slot,” IEEE
Trasaction and Antennas Propagation., Vol.53, No.6,
pp.2111-2114, June 2005.
70
ISBN: 978-81-924893-0-8
[5] K.Chung; T.Yun; and J.Choi,”Wideband CPW-fed
monopole antenna with parasitic elements and
slots.”Electronics Letters,vol.40,pp.1038-1040,2004
[6] J. Jan and J. Su, “Bandwidth enhancement of a printed
wide slot antenna with a rotated slot,” IEEE Transactions
on Antennas and Propagation, Vol.53, No.6, pp.2111-
2114, June 2005.
[7] A. P. Singh and S.Rani, “ Simulation and Design of
Broad-Band Slot Antenna for wireless applications,”
Proceedings of the world Congress on Engineering,
WCE 2011, July 6-8, 2011,Imperial College, London,
U.K., vol.2, pp.1390-1393
[8] S.Rani and A. P. Singh, “On the Design and
Optimization of New Fractal Antenna Using PSO”
International Journal of Electronics, vol. 100, No.-10,
pp. 1383-1397, 2012
[9] S. Kakkar and S. Rani, “A novel Antenna Design with
Fractal-Shaped DGS Using PSO for Emergency
Management”, International Journal of Electronics
Letters, vol. 1, no. 3, pp. 108-117, 2013.
[10] S. Kakkar, S. Rani and A. P. Singh, On the Resonant
Behaviour Analysis of Small-Size Slot Antenna with
Different Substrates, International Journal of Computer
Applications, pp. no. 10-12, 2012.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Low Cost Planar Antenna for Wireless Applications

Anand Jain Sushil Kakkar Shweta Rani
Ericsson AB ECE Department ECE Department
Stockholm, Sweden BGIET, Sangrur BGIET, Sangrur
anandjain80@gmail.com kakkar778@gmail.com shwetaranee@gmail.com

ABSTRACT of the dimension of the patch, the height of the substrate and
An analysis of resonant behavior of small-size planar patch dielectric constant Єr. of the substrate. Because of the fringing
antenna and slot antenna with finite ground plane has been effects, electrically the patch of the microstrip antenna looks
presented in this paper. It is observed that a size reduction of greater than its physical size [1].
70.74% has been achieved by taking out a similar shape slot
from the „7‟-shaped patch. As a result this new antenna,
generate an additional band and shifting the primary resonant
frequency towards lower side. The proposed antenna is not
only has good radiation characteristics, but also has the
advantage of low cost, small size and easy manufacture for S-
band and C-band wireless applications.
Keywords
Slot antenna, Return loss, Gain.

1. INTRODUCTION
The astonishing progress in wireless communication system
and an increasing demand to integrate different technologies
in to small user equipment has remarkably increase the
fashion of introducing compact antennas [1]. Microstrip patch
antenna, because of its small size, low profile, low
manufacturing cost and ease of integration with feed (a)
networks, is find extensive applications in wireless
communication system [2-5]. Because of extremely thin
profile (0.01 to 0.05 wavelength), printed microstrip antennas
have found heavy applications in military aircraft, missiles,
rockets and satellites [6-8]. Microstrip antenna can be divided
in to two basic types by structure, patch antenna and slot
antenna. The slot antenna can be fed by microstrip line, slot
line and CPW [9-11]. In this paper a small-size planar antenna
and a slot antenna have been designed to analyze the
relationship between the resonant performances of these
antennas. The radiation properties have also been examined
and it has been observe that they are nearly similar in nature.

2. DESIGN AND STRUCTURE

Fig. 1 shows the basic geometry of proposed planar patch
antenna and slot antenna. The antennas have been designed
with Roger RT 5880, Duriod (Єr= 2.2) substrate having height
of 1.57 mm. The antenna is a small-size „7‟-shaped planar
patch antenna having length, l = 25 mm and width, w = 33
mm on the finite ground plane of length, L = 32 mm and
width, W = 47 mm. The presented second antenna structure
has similar shape slot as of original patch in its design which
is responsible for the small size and its low cost. The
dimensions of the slots are Ls = 21 mm and Ws = 31 mm. The
introduction of slot in the structure increases the electrical
length of the antenna. Because the dimensions of the patch are
finite along the length and width, the fields at the edges of the
patch undergo fringing. The amount of fringing is a function
(b)
Fig. 1: Geometrical Construction of Proposed Antennas,
a) without slot b) with slot.
3. RESULTS AND DISCUSSION
3.1 Resonant Performance Comparison of Planar and
Slot Antenna
IE3D software has been used for evaluating the performance
of the proposed antennas. Table.1 shows the resonant
performance characteristics of the small-size, planar patch
antenna and slot antenna. It has been observed that by taking
out similar shape slot from the „7‟-shaped planar antenna,
there is considerable improvement in the return loss, and also

71
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

there is shifting of resonant frequency towards the lower side The radiation pattern is symmetrical to antenna axis in E-
as expected. All of the above, the size of the slot antenna has plane and nearly omnidirectional pattern in H-plane.
been reduced to 70.74% to its original planar structure which
make it effectively less expensive comparable to original
patch.

Table.1: Comparison of resonant performance

characteristics.
Resonant Planar Slot Antenna
Characteristics Antenna

Resonant Freq. (GHz) 3.545 3.363

Return Loss (dB) -21.2 -26.39

VSWR 1.191 1.101

Gain (dBi) 4.35 4.35 (a)

Fig. 2 shows the s-parameters of proposed small-size planar

and slot antenna and from the figure it is clear that the planar
patch antenna resonate at 3.545 whereas slot antenna
resonates at 3.363 GHz and 6.333 GHz but with improved
return loss. While for analysis purpose we have taken the
primary frequency only. The value of VSWR for slot antenna
is also considerably good in comparison of planar patch
antenna as given in Table. 1. With these resonant properties
the proposed antenna is feasible for S-band and C-band
wireless applications.

(b)

Fig. 3: Radiation Pattern at 3.545 GHz (a) E-plane (b) H-

plane.

Fig. 2: S-parameters of the Proposed Patch and Slot

Antenna. (a)

3.2 Radiation Patterns and gain

The radiation characteristics of proposed planar patch antenna
and slot antenna are shown in Fig. 3 and Fig.4 respectively
and it has been observed that they are nearly similar in nature.

72
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
(b)
Fig. 4: Radiation Pattern at 3.363 and 6.333 GHz (a) E-
plane (b) H-plane.
The Gain for both the proposed antennas is shown in Fig. 5
and Fig. 6. The maximum achievable gain for both the
antenna is same that is 4.35 dBi at 3.545 GHz for patch
antenna and at 3.363 GHz for slot antenna.
Fig. 5 Simulated Gain of Proposed Patch
Antenna
Fig. 6: Simulated Gain of Proposed Slot Antenna
73
ISBN: 978-81-924893-0-8
4. CONCLUSION
The comparative study of resonant performance of small-size
patch and slot antenna has been presented. It has been
illustrated that in addition to the reduction of size of the
antenna by 70.74% with the introduction of similar shape slot,
there is considerable improvement in return loss and VSWR.
And also slot antenna exhibit dual band characteristics. The
simulated results reveal that the proposed antenna is suitable
for S-band and C-band wireless applications.
REFERENCES
[1] A. Balanis, “Antenna Theory”. John Wiley & Sons, Inc.
1997.
[2] S. Kakkar and S. Rani, “A novel Antenna Design with
Fractal-Shaped DGS Using PSO for Emergency
Management”, International Journal of Electronics
Letters, vol. 1, no. 3, pp. 108-117, 2013.
[3] M. Hirvoven, P. Pusula, K. Jaakkola and K. Laukkanen,
“Planar Inverted F- Antenna for Radio Frequency
Identification”, IEEE Electronic Letters, vol. 40, no. 14,
pp. 848- 850, 2004.
[4] S.Rani and A. P. Singh, “On the Design and
Optimization of New Fractal Antenna Using PSO”
International Journal of Electronics, vol. 100, No.-10,
pp. 1383-1397, 2012
[5] F.Yong, X. Zhang, X. Ye, and Y. Rahmat-Samii, Wide-
band E-shaped patch antennas for wireless
communication," IEEE Trans.on Antennas Propagat.,
Vol. 49, No. 7, pp.1094-1100, Jul. 2001.
[6] S. Kakkar, S. Rani and A. P. Singh, On the Resonant
Behaviour Analysis of Small-Size Slot Antenna with
Different Substrates, International Journal of Computer
Applications, pp. no. 10-12, 2012.
[7] Jen-Yea Jan and Jia-wei Su, “Bandwidth enhancement of
a printed wide slot antenna with a rotated slot,” IEEE
Trasaction and Antennas Propagation., Vol.53, No.6,
pp.2111-2114, June 2005.
[8] K.Chung; T.Yun; and J.Choi,”Wideband CPW-fed
monopole antenna with parasitic elements and
slots.”Electronics Letters,vol.40,pp.1038-1040,2004
[9] J. Jan and J. Su, “Bandwidth enhancement of a printed
wide slot antenna with a rotated slot,” IEEE Transactions
on Antennas and Propagation, Vol.53, No.6, pp.2111-
2114, June 2005.
[10] A. P. Singh and S.Rani, “ Simulation and Design of
Broad-Band Slot Antenna for wireless applications,”
Proceedings of the world Congress on Engineering,
WCE 2011, July 6-8, 2011,Imperial College, London,
U.K., vol.2, pp.1390-1393
[11] S. Rani and A. P. Singh, “Design of Slot Antenna with
Rectangular Tuning Stub & Effect of various substrates
on it,” Proceedings of 5th International Multi
Conference on Intelligent Systems, Sustainable, New and
Renewable Energy Technology and Nanotechnology
(IISN-2011), Feb 18 - 20, pp no. 238 – 240, 2011.
Institute of Science and Technology Klawad-133105,
Haryana, India.
.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Artificial Eyes: Brain Port Device
Lovedeep Dhiman
Research Scholar
Jmit, Radaur, India
lvdp131313@gmail.com
ABSTRACT
We present a device which sends visual input through tongue
in much the same way that seeing individuals receive visual
input through the eyes is called the “Brain port Vision
Device” . This device is underlying a principle called “electro
tactile stimulation for sensory substitution”, an area of study
that involves using encoded electric current to represent
sensory information and applying that current to the skin,
which sends the information to the brain.
Keywords: sensory, encoded, substitution
INTRODUCTION
Fig 1: Brain Port Device
The Brain Port is a technology where by sensory information
can be sent to one's brain via a signal from the Brain Port (and
its associated sensor) that terminates in an electrode array
which sits atop the tongue. It was initially developed by Paul
Bach-y-Rita as an aid to people's sense of balance, particularly
of stroke victims. Brain Port technology has been developed
for use as a visual aid. For example, the Brain Port has
demonstrated its ability to allow a blind person to see his
surroundings in polygonal and pixel form. In this scenario, a
camera picks up the image of the surrounding; the information
is processed by a chip which converts it into impulses which
are sent through an electrode array, via the tongue, to the
person's brain. The human brain is able to interpret these
impulses as visual signals and they are then redirected to the
visual cortex, allowing the person to see. Brain Port
technology is based on the phenomenon of sensory
substitution. For the vision application, visual information is
perceived via the sense of touch on the human tongue. Well,
not exactly through her tongue, but the device in her mouth
sent visual input through her tongue in much the same way
that seeing individuals receive visual input through the eyes.
All sensory information sent to the brain is carried by nerve
fibers in the form of patterns of impulses, and the impulses
end up in the different sensory centers of the brain for
interpretation. To substitute one sensory input channel for
another, you need to correctly encode the nerve signals for the
sensory event and send them to the brain through the alternate
channel. The brain appears to be flexible when it comes to
74
ISBN: 978-81-924893-0-8
Deepti Malhotra
Research Scholar
Jmit, Radaur, India
Deeptimalhotra1981@gmail.com
interpreting sensory input. You can train it to read input from,
say, the tactile channel, as visual or balance information, and
to act on it accordingly.
1. FUNCTIONING
Fig 2: Brain Port Device Functioning
The Brain Port vision device is an investigational non-surgical
assistive visual prosthetic device that translates information
from a digital video camera to your tongue, through gentle
electrical stimulation. The Brain Port vision system consists
of a postage-stamp-size electrode array for the top surface of
the tongue (the tongue array), a base unit, a digital video
camera, and a hand-held controller for zoom and contrast
inversion. Visual information is collected from the user-
adjustable head-mounted camera (FOV range 3–90 degrees)
and sent to the Brain Port base unit. The base unit translates
the visual information into a stimulation pattern that is
displayed on the tongue. The tactile image is created by
presenting white pixels from the camera as strong stimulation,
black pixels as no stimulation, and gray levels as medium
levels of stimulation, with the ability to invert contrast when
appropriate.
1.1 Parts of Brain
Brain Port uses the tongue instead of the fingertips, abdomen
or back used by other systems. The tongue is more sensitive
than other skin areas -- the nerve fibers are closer to the
surface, there are more of them and there is no stratum
corneum (an outer layer of dead skin cells) to act as an
insulator. It requires less voltage to stimulate nerve fibers in
the tongue - 5 to 15 volts compared to 40 to 500 volts for
areas like the fingertips or abdomen. Also, saliva contains
electrolytes, free ions that act as electrical conductors, so it
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
helps maintain the flow of current between the electrode and
the skin tissue.
Fig 3: An Accelerometer
An accelerometer is a device that measures, among other
things, tilt with respect to the pull of gravity. The
accelerometer on the underside of the 10-by-10 electrode
array transmits data about head position to the CPU through
the communication circuitry. When the head tilts right, the
CPU receives the "right" data and sends a signal telling the
electrode array to provide current to the right side of the
wearer's tongue. When the head tilts left, the device buzzes
the left side of the tongue. When the head is level, Brain Port
sends a pulse to the middle of the tongue. After multiple
sessions with the device, the subject's brain starts to pick up
on the signals as indicating head position -- balance
information that normally comes from the inner ear -- instead
of just tactile information. From the CPU, the signals are sent
to .the tongue via a "lollipop," an electrode array about nine
square centimeters that sits directly on the tongue. Each
electrode corresponds to a set of pixels. White pixels yield a
strong electrical pulse, whereas black pixels translate into no
signal. Densely packed nerves at the tongue surface receive
the incoming electrical signals, which feel a little like Pop
Rocks or champagne bubbles to the user. In the case of the
Brain Port vision device, the electronics might be completely
embedded in a pair of glasses along with a tiny camera and
radio transmitter, and the mouthpiece would house a radio
receiver to receive encoded signals from the glasses.
2. WORKING
To produce tactile vision, Brain Port uses a camera to capture
visual data. The optical information -- light that would
normally hit the retina -- that the camera picks up is in digital
form, and it uses radio signals to send the ones and zeroes to
the CPU for encoding. Each set of pixels in the camera's light
sensor corresponds to an electrode in the array. The CPU runs
a program that turns the camera's electrical information into a
spatially encoded signal. The encoded signal represents
differences in pixel data as differences in pulse characteristics
such as frequency, amplitude and duration. Multidimensional
image information takes the form of variances in pulse current
or voltage, pulse duration, intervals between pulses and the
number of pulses in a burst, among other parameters. , the
pulses may convey multidimensional information in much the
75
ISBN: 978-81-924893-0-8
same way that the eye perceives color from the independent
stimulation of different color receptors. The electrode array
receives the resulting signal via the stimulation circuitry and
applies it to the tongue.
2.1 Concept of Electrical Simulation
Electro tactile stimulation for sensory augmentation or
substitution, an area of study that involves using encoded
electric current to represent sensory information that a person
cannot receive through the traditional channel and applying
that current to the skin, which sends the information to the
brain. The brain then learns to interpret that sensory
information as if it were being sent through the traditional
channel for such data. . Electro tactile stimulation is a higher-
tech method of receiving somewhat similar (although more
surprising) results, and it's based on the idea that the brain can
interpret sensory information even if it's not provided via the
"natural" channel. The idea is to communicate non-tactile
information via electrical stimulation of the sense of touch. In
practice, this typically means that an array of electrodes
receiving input from a non-tactile information source (a
camera, for instance) applies small, controlled, painless
currents (some subjects report it feeling something like soda
bubbles) to the skin at precise locations according to an
encoded pattern. The encoding of the electrical pattern
essentially attempts to mimic the input that would normally be
received by the non- functioning sense. So patterns of light
picked up by a camera to form an image, replacing the
perception of the eyes, are converted into electrical pulses that
represent those patterns of light. When the encoded pulses are
applied to the skin, the skin is actually receiving image data
those nerve fibers forward their image-encoded touch signals
to the tactile-sensory area of the cerebral cortex, the parietal
lobe. Within this system, arrays of electrodes can be used to
communicate non-touch information through pathways to the
brain normally used for touch-related impulses. All sensory
information sent to the brain is carried by nerve fibers in the
form of patterns of impulses, and the impulses end up in the
different sensory centers of the brain for interpretation. To
substitute one sensory input channel for another, you need to
correctly encode the nerve signals for the sensory event and
send them to the brain through the alternate channel. The
brain appears to be flexible when it comes to interpreting
sensory input. ." Action potentials (AP's) thus recorded had
amplitudes from 0.1 to 1.0 mV and a 5 : 1 signal-to-noise ratio
(SNR).A circular electrode surrounding the recording site
served as the ground reference. Following pre amplification
and band pass filtering (200-10 000 Hz), a differential
amplitude detector identified AP's, producing an output pulse
whenever the recorded signal entered a predefined amplitude-
time window. In the first experiment, electro tactile
entrainment currents (iEN) were determined by adjusting the
stimulation current from near zero to the minimal value
resulting in one AP for each stimulation pulse. These currents
exceeded the absolute thresholds (the currents causing
occasional AP's) by approximately 5%.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3. Experience Observed By Brain Port
Users
With the current prototype (arrays containing 100 to 600+
electrodes), study participants have recognized the location
and movement of high-contrast objects and some aspects of
perspective and depth. In most studies, participants use the
device for between two and 10 hours, often achieving the
following milestones:
 Within minutes: users perceive where in space
stimulation arises (up, down, left, and right) and the
direction of movement.
 Within an hour: users can identify and reach for nearby
objects, and point to an estimate the distance of object
out of reach.
 Within several hours: users can identify letters and
numbers and can recognize landmark information.
 The device provides a new sensory language with
which users learn to translate the impulse patterns on
the tongue to objects in space. Neuro imaging research
suggests that using Brain Port stimulates the visual
regions of the brain in blind individuals
4.WAVEFORM
Fig 4: Relative timing between simultaneous mechanical and
electro tactile stimulation. The top trace represents the
sinusoidal, 30-Hz, 50-100-_m (0-P) mechanical displacement
Note how the caption is centered in the column.
5. RESOLUTION
7. ADVANTAGES AND DISADVANTAGES:
Fig 5: Example showing the difference in resolution.
76
ISBN: 978-81-924893-0-8
The resolution of brain port camera varies according to the
necessity. The images below demonstrate how information
from the video camera is represented on the tongue. Today's
prototypes have 400 to 600 points of information on a ~3cm x
3cm tongue display, presented at approximately 30 frames per
second, yielding an information rich image stream. Our
research suggests that the tongue is capable of resolving much
higher resolution information and we are currently working to
develop the optimal tongue display hardware and software.
6. APPLICATIONS
6.1 Current Applications:
The current or foreseeable medical applications include:
 Providing elements of sight for the visually impaired.
 Providing sensory-motor training for stroke patients.
 Providing tactile information for a part of the body with
nerve damage.
 alleviating balance problems, posture-stability problems
and muscle rigidity in people with balance disorders
and Parkinson's disease
 enhancing the integration and interpretation of sensory
 Information in autistic people.
6.2 Potential Applications:
 Scanning The Brain Port electrodes would receive input
from a sonar device to provide not only directional cues
but also a visual sense of obstacles and terrain. Military-
navigation applications could extend to soldiers in the
field when radio communication is dangerous or
impossible or when their eyes, ears and hands are
needed to manage other things that might blow up.
Brain Port may also provide expanded information for
military pilots, such as a pulse on the tongue to indicate
approaching aircraft or to indicate that they must take
immediate action. With training, that pulse on their
tongue could elicit a faster reaction time than a visual
cue from a light on the dashboard, since the visual cue
must be processed by the retina before it's forwarded to
the brain for interpretation.
 Other potential Brain Port applications include robotic
surgeries’. The surgeon would wear electro tactile
gloves to receive tactile input from robotic probes
inside someone's chest cavity. In this way, the surgeon
could feel what he's doing as he controls the robotic
equipment.
 Race car drivers might use a version of Brain Port to
train their brains for faster reaction times, and gamers
might use electro tactile feedback gloves or controllers
to feel what they're doing in a video game.
7.1 Safety:
 Navigating difficult environments, such as parking lots,
traffic circles, complex intersections
 Recognizing quiet moving objects like hybrid cars or
Bicycle.
7.2 Mobility:
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

 Finding doorways, hall intersections, lobby or restaurant in an

 office or hotel.
 Finding continuous sidewalks, sidewalk intersections and curbs
7.3 Object Recreation:
 Locating people
 Locating known objects such as shoes, cane, coffee mug, Key
 Brain Port device does not replace the sense of sight, it adds to
 Other sensory experiences to give users information about the
size, shape and location of object.
 Device is like normal sunglasses hence it does not look bad
 It uses a rechargeable battery like in normal cell phone.

8. CONCLUSION
Brain port is indeed one of the finest and useful technologies.
This article offers insights and navigates the action about the
pro and cons, of the brain port technology. Technology is a
boon in biomedical and can work for all the field like defense,
sports, robotics, spy gadgets, and is able to change the life of
physically and mentally impaired persons.

REFERENCES
[1] P. Bach-y-Rita, K. A. Kaczmarek and M. E. Tyler, "A
tongue-based tactile display for portrayal of environmental
characteristics," in Psychological Issues in the Design and Use
of Virtualk and Adaptive Environments, L. Hettlinger and M.
Haas, Eds. Mahwah, NJ: Erlbaum, in press.
[2] K. A. Kaczmarek and M. E. Tyler, "Effect of electrode
geometry and intensity control method on comfort of
electrotactile stimulation on the tongue," Proc. ASME Dyn.
Sys. Contr. Div., Orlando, Florida, pp. 1239-1243, 2000.
[3] P Bach-y-Rita, ME Tyler, KA Kaczmarek - International
Journal of Human-Computer Interaction, 2003 -
informaworld.com
[4] Prather, Laura (15 February 2007). "Tongue creates sight
for blind: Visually impaired persons will be able to use device
to sense images on tongue" (PDF). Truman State University
Index 98 (20): 11. Retrieved 2009-05-24.
[5] Clinical Tests of Ultra-Low Vision Used to Evaluate
Rudimentary Visual Perceptions Enabled by the BrainPort
Vision Device by Amy Nau1, Michael Bach2, and
Christopher Fisher.
[6] Benav H., Bartz-Schmidt K. U., Besch D., Bruckmann A.,
Gekeler F., & Greppmaier U. … Zrenner E. (2010).
Restoration of useful vision up to letter recognition
capabilities using subretinal microphotodiodes. In
Engineering in Medicine and Biology Society (EMBC), 2010
Annual International Conference of the IEEE, 5919–5922.
[7] Chebat D. R., Schneider F. C., Kupers R., & Ptito M.
(2011). Navigation with a sensory substitution device in
congenitally blind individuals. Neuroreport, 22, 342–347
[8] Eickhoff S. B., Dafotakis M., Grefkes C., Shah N. J.,
Zilles K., & Piza-Katzer H. (2008). Central adaptation
following heterotopic hand replantation probed by fMRI and
effective connectivity analysis. Experimental Neurology, 212,
132–144 ,,,

[9] Ptito M, Kupers R. Cross-Modal Plasticity in Early

Blindness. J Integr Neurosci. 2005; 4:479-488.

77
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
High Reflectance Multiple step Metal Grating for
Multichannel Reflector
Ramanpreet Kaur Neetu Sharma
Student Assistant Professor
BGIET, Sangrur BGIET, Sangrur
ramanpreetkaur457@gma neetu4ar@gmail.com
il.com
ABSTRACT
The multiple step subwavelength metal grating with relief
structure is designed and analyzed in which the profile of
grating structure is having a relief structure with multiple
steps. The optical presentation of traditional structure is
evaluated and compared in terms of reflectivity over visible
and ultra violet spectrum with the help of Opti-FDTD. It is
shown that, near the ultra violet band multiple reflections can
be found compared to traditional metal grating in the same
parameters. With these characteristics, designed metal grating
with multiple steps is expected to find applications in optical
communication as multichannel reflector.
Keywords
Metal grating, FDTD, Multichannel reflector.
1. INTRODUCTION
As an vital optical element, gratings take part in the
fundamental role in all types of optical systems. In view of the
fact that Nevdakh et al. [1] had considered the polarization
uniqueness of subwavelength grating has develop into the
focus of researches in most recent years. Researchers have
done work on gratings and they concluded that when grating
period is near to or slightly smaller than the wavelength then
it will be having good polarization characteristics. With this
characteristic, we can fabricate a variety of polarizing devices,
such as special wave plates [2], polarizing color filters [8, 9],
and polarizing beam splitters [3–7]. But if wavelength and
grating period are at large gap from each other then there will
be weak polarization characteristics. On the supplementary
hand, the fabrication has been very grown-up. As given in the
grating equation, when light propagates onto the
subwavelength grating surface, just the zeroth-order
diffraction exists [6]. Traditional subwavelength metal grating
reflectance is generally about 51% at only one wavelength
point in the particular wavelength area.
Figure 1: Traditional subwavelength metal grating with
glass substrate and Si grating where grating period=1μm
and grating width=0.5μm and height=0.25 μm
78
ISBN: 978-81-924893-0-8
Jaspreet Kaur
Assistant Professor
RIMT, Mandi Gobindgarh
jasspreetkaur09@gmail.c
om
In this given structure of traditional metal grating, glass
substrate is used having refractive index of 1.5 and grating
used is of Silicon having refractive index of 3.48. Grating
period is of 1μm and grating width of 0.5μm. We have
examined the reflectivity power of this structure at input
wavelength of 1.55μm and optimized by using Opti FDTD in
the wavelength range of 400nm to 900nm and we get high
reflectivity power only at one wavelength point, that is very
poor reflectivity over this range. So, here we want to improve
the reflectivity over visible and ultra violet region. Various
structures have been implemented recently to use gratings as
various optoelectronic devices. Included planar waveguide
circuits are extensively used in optical telecommunication
systems, with AWG (arrayed waveguide grating) multiplexers
being one of the most composite of such circuits [4].
Presently, these viable waveguide devices are
characteristically made from doped silica glass with a low
refractive index distinction. The high-index contrast (HIC)
SOI material system obtain the potential of a considerable size
and cost diminution of integrated planar waveguide devices,
as well as AWGs [5,11]. Additionally, new applications are
raising for miniaturized SOI waveguide devices. Such as, we
have lately demonstrated a dense high resolution micro
spectrometer [12]. In our design we will show how a
multistep grating can be used for multichannel reflections.
Figure 2: Reflectivity vs. wavelength characteristic for
traditional grating structure at 1.55nm input wavelength
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2. DESIGN AND STRUCTURE can say is perfect result for reflectance. We can see that in our
Figure 1 shows schematic of traditional subwavelength metal result we got multiple reflections. So, we can use our design
as a multichannel reflector.
grating here grating layer used is of Silica (refractive index,
n=3.48). Here p is the grating period, w is the grating width
and h is the grating height. So filling factor for this structure
can be calculated as f = w/p[10]. This factor plays an
significant responsibility in determining the optical properties
of gratings. Owing to different materials with different
reflection powers, thus choosing the right material is chief
problem. In our proposed method we used layer of gratings. In
order to improve reflectivity power of traditional
subwavelength metal grating, subwavelength metal gratings
with relief structures designed by using multiple steps are
shown in figure 3. First layer which we used is of tourmaline
having refractive index 1.63, second layer we choose is of
purpurite having refractive index 1.84 and third layer is
lumicera having refractive index 2.08. Here we will discuss Figure 4: reflectivity vs. wavelength characteristics for 2
two step and three step gratings. Substrate used here is of steps grating over visible and ultraviolet region
refractive index 1.5. Heights of different layers are taken as
h1, h2 and h3 respectively.

(a) Figure 5: Reflectivity vs. wavelength characteristics for 3

steps grating over visible and ultraviolet region

(b)

Figure 3: Representation of subwavelength metal grating

with relief structure having multiple steps
3. RESULTS AND DISCUSSION
The subwavelength metal grating we used in our structure is
having glass substrate and grating used is of different
refractive indexes which vary layer by layer. Input
wavelength used here in our design is of 1.55μm. We have
calculated the results in wavelength range of 400nm to 900nm
or we can say over visible and ultra violet region. We have
evaluated results using Opti FDTD. Reflectivity when
calculated for two step grating is about 80% but when
calculated for three step grating it is about 99.9% which we
Figure 6: Comparison of reflectivity for 2 step and 3 step
grating structure
As shown from our reflectivity curves, reflectivity for
traditional metal grating is of about 51% but by using our
design we can get reflectivity of about 99.9% by using
multiple step structure.
4. CONCLUSION
In our design and analysis of subwavelength metal grating
with relief structure using multiple steps we get the result of

79
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

about 99.9% multiple wavelength reflectivity for 3 steps
grating and 80% of multiple wavelengthreflectivity for 2 steps
of grating by using Opti FDTD.
SWG with relief structure gives more exciting results than
traditional subwavelength metal grating with input
wavelength of 1.55μm over the visible and ultraviolet
region(400 nm to 900 nm). By further tuning the filling factor,
grating period, grating material or sizes, we can use our
design for more purposes like multichannel wavelength filter.
REFERENCES
[1] V. V. Nevdakh, N. S. Leshenyuk, and L. N. Orlov,
“Experimental investigation of the polarization
properties of reflective diffraction gratings for CO2
lasers,” Journal of Applied Spectroscopy, vol. 39, no. 5,
pp. 1249–1254, 1983.
[2] D.-E. Yi, Y.-B. Yan, Q.-F. Tan, H.-T. Liu, and G.-F. Jin,
“Study on broadband achromatic quarter-wave plate by
subwavelength gratings,” Chinese Journal of Lasers, vol.
30, no. 5, pp. 405–408, 2003.
[11] A. Densmore, D.-X. Xu, P. Waldron, et al., “A silicon-
oninsulator photonic wire based evanescent field sensor,”
IEEE Photonics Technology Letters, vol. 18, no. 23, pp.
2520–2522, 2006.
[12] P. Cheben, J. H. Schmid, A. Delˆage, et al., “A high-
resolution silicon-on-insulator arrayed waveguide grating
microspectrometer with sub-micrometer aperture
waveguides,” Optics Express, vol. 15, no. 5, pp. 2299–
2306, 2007.
[13] A. Densmore, D.-X. Xu, S. Janz, et al., “Spiral-path
highsensitivity silicon photonic wire molecular sensor
with temperature-independent response,” Optics Letters,
vol. 33, no. 6, pp. 596–598, 2008.
[14] Zhongfei Wang, Dawei Zhang, Qi Wang, Banglian Xu,
Qingyong Tang, Yuanshen Huang, and Songlin Zhuang,
”High-Transmittance Subwavelength Metal Grating with
Relief Structure Composed of Multiple Steps,” the
scientific world journal,volume 2014,18 february 2014.

[3] L. Zhou and W. Liu, “Broadband polarizing beam

splitter with an embedded metal-wire nanograting,”
Optics Letters, vol. 30, no. 12, pp. 1434–1436, 2005.

[4] S. Janz, P. Cheben, A. Delˆage, et al., “Silicon-based

integrated optics: waveguide technology to
microphotonics,” in Proceedings of the Materials
Research Society Symposium (MRS ’04), vol. 832, pp. 3–
14, Boston, Mass, USA, November-December 2004,
F1.1.

[5] N. V. Tabiryan, S. R. Nersisyan, T. J. White, T. J.

Bunning, D.M. Steeves, and B. R. Kimball, “Transparent
thin film polarizing and optical control systems,” AIP
Advances, vol. 1, no. 2,Article ID 022153, 2011.

[6] Y. Ye, Y. Zhou, H. Zhang, S. Shen, and L. S. Chen,

“Plorizing color filter based on a submicron metal
grating,” Acta Optics Sinica, vol. 31, no. 4, Article ID
0405003, 2011.

[7] P. Cheben, “Wavelength dispersive planar waveguide

devices: echelle and arrayed waveguide gratings,” in
Optical Waveguides: From Theory to Applied
Technologies, M. L. Calvo and V. Lakshminarayanan,
Eds., chapter 5, CRC Press, London, UK, 2007.

[8] N. Nguyen-Huu, Y.-L. Lo, Y.-B. Chen, and T.-Y. Yang,

“Realization of integrated polarizer and color filters
based on subwavelength metallic gratings using a hybrid
numerical scheme,”

[9] P. Cheben, D.-X. Xu, S. Janz, and A. Delˆage, “Scaling

down photonic waveguide devices on the SOI platform,”
in VLSI Circuits and Systems, vol. 5117 of Proceedings
of SPIE, pp. 147– 156, Maspalomas, Spain, May 2003.

[10] Jing Nie,Hu-Quan Li and Wen Liu,,”Perfect Anomalous

Absorption of TM Polarized Light in metallic grating
situated in asymmetric surroundings,” IEEE photonic
journal,vol. 6,number 6,December 2014.

80
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Speech Recognition Using Neural Network
Pankaj Rani Sushil Kakkar
BGIET, Sangrur BGIET, Sangrur
8699500928h@gmail.com kakkar778@gmail.com
ABSTRACT
Speech recognition is a subjective phenomenon. Despite
being a huge research in this field, this process still faces
a lot of problem. Different techniques are used for
different purposes. This paper gives an overview of
speech recognition process. Various progresses have
been done in this field. In this work of project, it is
shown that how the speech signals are recognized using
back propagation algorithm in neural network. Voices of
different persons of various ages in a silent and noise free
environment by a good quality microphone are recorded.
Same sentence of duration 10-12 seconds is spoken by
these persons. These spoken sentences are then converted
into wave formats. Then features of the recorded samples
are extracted by training these signals using LPC.
Learning is required whenever we don’t have the
complete information about the input or output signal. At
the input stage, 128 samples of each sentence are
applied, then through hidden layers these are passed to
output layer. These networks are trained to perform tasks
such as pattern recognition, decision making and motoric
control.
Key words: Neural network, speech recognition, back
propagation, training algorithm.
1. INTRODUCTION
Speech could be a useful interface to interact with
machines. To improve this type of communication,
researches have been for a long time. From the evolution
of computational power, it has been possible to have
system capable of real time conversions. But despite
good progression made in this field, the speech
recognition is still facing a lot of problems. These
problems are due to the variations occurred in speaker
including the variations because of age, sex, speed of
speech signal, emotional condition of the speaker can
cause the difference in the pronunciation of different
persons. Surroundings can add noise to the signal.
Sometimes speaker causes the addition of noise itself [4].
In speech recognition process, an acoustic signal
captured by microphone or telephone is converted to a
set of characters. A view about automatic speech
recognition (ASR) is given by describing the integral part
of future human computer interface. Hence for the
interaction with machines human could use speech as a
useful interface. Human always want to achieve natural,
possessive and simultaneous computing. Elham S. Salam
[13] compared the effect of visual features on the
performance of Speech Recognition System of disorder
people with audio speech recognition system.
Comparison between different visual features methods
for selection is done and English isolated words are
recognized. The recognition of simple alphabet may be
taken as a simple task for human beings. But due to the
occurrence of some problems like high acoustic
similarities among certain group of letters, speech
recognition may be a challenging task [11]. The use of
81
ISBN: 978-81-924893-0-8
Shweta Rani
BGIET, Sangrur
shwetaranee@gmail.com
conventional neural network of Multi-Layer Perceptron
is going to increase day by day. Work is well done as an
effective classifier for vowel sounds with stationary
spectra by those networks. Feed forward multi-layer
neural network are not able to deal with time varying
information like time-varying spectra of speech sounds.
This problem can be copied by incorporated feedback
structure in the network.
1.1 Procedure of speech recognition process
Speech recognition is mainly done in two stages named
as training and testing. But before these, some basic
techniques that are necessary are applied to these speech
signals.
Different voice signals
Pre-processing
Feature extraction
Classification
Output(one detected
voice)
Fig.1: Block diagram of speech recognition process
In this process the voice of different persons is recorded
by a good quality microphone in such an environment
where no noise is present. These speech signals are then
pre- processed by using suitable techniques like filtering,
entropy based end point detection and Mel Frequency
Cestrum Coefficient etc. this type of technique makes the
speech signal smoother and helps us in extracting only
the required signal that is free of noise.
Samples are recorded with a microphone. Besides speech
signals, they contain a lots of distortion and noise
because of the quality of microphone. First of all low and
high frequency noise is eliminated by performing some
digital filtering. The situation of speech signals is mainly
between 300Hz to 750Hz.Identical waveforms never
produced by recorded samples and the background noise,
length and amplitude may vary. 128 samples are applied
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
with sampling rate 11 KHz, this makes possible to
represent all speech signals.
1.2 Speech Classification
Classification of speech signal is very important
phenomenon in speech recognition process. Different
models are introduced by different authors to classify the
speech. But in this work of project, neural network is to
be used for classification. A neural network consists of
small no of neurons. A Number of neurons are
interconnected. A Number of processing units which are
used for the processing of speech signals. The very
simple techniques like pre-processing, filtering are
processed by these types of units. A non-linear weight is
computed simply by each unit and the result over its
outgoing connection to other units is broadcast. Learning
is a process in which value of the appropriate weights is
settled. It is necessary whenever we don’t have the
complete information about the input and output signal.
The weights are adjusted by the proposed algorithm to
match the input and output characteristics of a network
with the desired characteristics. The desired response has
to be assumed by our self with the help of teacher. In this
work of project, features of the pre- processed speech
signals are extracted by using MFCC, LPC. This is called
training. The networks are usually trained to perform
tasks such as pattern recognition, decision making, and
motoric control. Training of the unit is accomplished for
the adjustment of the weights and threshold for the
classification SVM classifier is used. The feature
extraction may be of two types as temporal analysis and
spectral analysis. In temporal analysis, the wave formats
of the speech signals are analyzed by it. In spectral
analysis, the wave format of the speech signal is
analyzed by the spectral representation. Except all this,
there are some other tools that are necessary to study out
are linear predictive coding (LPC) and Mel Frequency
Cestrum Coefficients (MFCC). LINEAR Predictive
Coding is a tool that is used for the processing of audio
signal and speech for representation of spectral envelope
and digital signal in compressed form. LPC is based on
the idea that expression of each sample of signal in a
linear combination of the previous samples. Mel
frequency cestrum coefficient is preferred to extract the
feature of speech signal. It transforms the speech signal
into frequency domain, hence training[3] vectors are
generated by it. Another reason of using this method is
that human learning is based on frequency analysis.
Before obtaining the MFCC of a speech signal the pre
emphasis filtering is applied to the signal with finite
impulse response filter given by
𝑛
𝐻𝑝𝑟𝑒 (𝑍) = 𝑘=0 𝑎𝑝𝑟𝑒 (K) 𝑍 −𝐾
Its Z-Transform is
𝐻𝑝𝑟𝑒 =1+ 𝑎 𝑝𝑟𝑒 𝑧 −𝑘
The value of 𝑎𝑝𝑟𝑒 is usually taken between -1.0 to 0.4.
Testing is the process, in which different speech signals
are tested by using special type of neural network. This is
the main step in the speech recognition process. Testing
of the speech signals is done after training.
82
ISBN: 978-81-924893-0-8
1.3 Speech Recognition Process
Recognition of speech is more difficult than the
recognition of the printed versions. Various techniques
are to be used for the recognition of speech. Basic
procedure is shown by the block diagram. It is shown
that how speech can be recognized using different
processes.
Speech is used effortlessly by humans as a mode of
communication with one another. Same type of easy and
natural communication is wanted with machines by
people. So, speech is preferred as an interface rather than
using any other interfaces like mouse and keyboard. The
speech recognition process is somewhere difficult and
complicated phenomenon. The speech recognition
system can further be divided into various classes. It may
be classified based on the model of speaker and type of
vocabulary.
This figure shows the general procedure of the speech
recognition process. Typical speech sentence consist of
two main parts; speech information is carried out by one
part and silent and noise sections between the utterances
without any verbal information is carried out by the other
part. At the input side, different voice signals are applied.
Before applying these signals to the neural network, pre-
processing of the signals is done by using filtering;
Entropy based end point detection and MFCC. The audio
signals are converted into particular waveforms. The next
step is to extract the features of the voice signals by the
of special kind of neural network. Neural Network acts
as the brain of human. Trained neural networks trains
these networks and at the last testing of voice signals is
done. Tested signal is detected as the output. All the
working procedure is shown in the block diagram of
speech recognition process how the steps take place.
1.4 Voice Individuality
Before trying to solve the problem described in the goal
of project, we must understand the characteristics of the
different voice signals. Acoustic parameters have the
greatest influence on the voice individuality. Acoustic
parameters may be divided into two types: time
dimensions that represent the pitch frequency or
fundamental frequency and in frequency dimensions that
represent the vocal tract resonance. We can consider the
voice signals as quasi periodic signals. Pitch may be
defined as the fundamental frequency of the voice signal.
The average pitch speed, time pattern, gain and
fluctuation change from one individual to another and
also within the speech of the same speaker.in actual the
frequency response of the vocal tract filter is the shape
and gain of the spectral envelope of the signal. From
some researches on voice individuality, it has been
concluded that pitch fluctuation that gives the second
place to the format frequencies is the most important
factor in the voice individuality. From many other
studies it also be concluded that the spectral envelope has
the greatest influence on the voice individuality
perception.
From the above discussion it is concluded that there is no
single parameter that can alone define a speaker. A group
of parameters that depend on the nature of speech
materials vary from one individual to another having
their respective importance.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2. CONVERSION OF SPEECH
SIGNALS INTO WAVES
The samples of the speech signals are converted into
wave formats. This is the most general way for the
representation of the signal. A disadvantage of this
method is also there which is that it cannot represent
speech related information. This problem may be solved
by the technique pre-processing. This representation
shows the change in amplitude spectra over time. There
are three dimensions. X-axis represents time in meter per
second. Y-axis represents frequency and z-axis
represents the color intensity that represents the
magnitude of the signal. It is not possible to start samples
exactly at the same time because different persons
pronounce sentences differently i.e. slowly or fast and as
the result intensities at the different times might be
different.
-3
2
x 10
1.5
1 variables is also kept in check by neural network.
0.5
0
-0.5
-1
-1.5
-2
-2.5
-3
0 20 40 60 80 100 120
Time (m/sec)
Fig.2 Wave format of speech signal of a male
This figure shows the wave format of a speech signal
obtained in the implementation in the MATLAB. The
change in amplitude spectra over time is shown by the
domain representation. The complete sample is split into
two time frames with almost 50% overlap. We calculate
the short term frequency for each time. Although good
visual representation of speech signal is provided by the
spectrogram, verification between samples is still there.
Samples never start exactly at the same time, sentences
are pronounced differently by different persons slower or
faster and as a result that might have different intensities
at different times.
2.1 Algorithm Used
Here the algorithm used is the back propagation. The
back propagation algorithm was originally introduced in
the 1970s. Several neural networks are described here, in
which back propagation works faster than the earlier
approaches used for the learning phenomenon. It makes
possible to use neural network to solve problems which
have not been solved for a long time. In today’s world,
the back propagation algorithm is the work horse of
learning in neural network. Besides this, it gives us
detailed insights into how changing the weights and how
the overall behavior of a network is changed by the
biases.
ISBN: 978-81-924893-0-8
2.2 Roll Played by Neural Network in Speech
Recognition Process
Neural network works as a human brain. These networks
perform learning phenomenon. Neural network is a
computational model inspired by an annual central
nervous system which is capable of machine learning as
well as pattern recognition the artificial neural networks
are generally presented as systems in which number of
neurons are interconnected which have been used to
solve a wide variety of tasks that are difficult to solve
using ordinary rule based programming including
computer vision, speech recognition. This type of
network potentially contains a large number of simple
processing units, roughly analogous to neurons in the
brain. All these units are operated simultaneously.
Except neural network, there is no other processor that
oversees their activity. These units perform all
computations in the system. A scalar function is
computed simply by each unit and the result is
broadcasted to its neighboring units. The course of
dimensionality problem that many attemptations to
model non- linear functions with large number of
Representative data is collected by neural network users
and then training algorithms are invoked because they
have to learn the structure of the data automatically [6].
Lakshami Kanaka [6] described a method for estimating
a continues target for training patterns of neural networks
that are based on the generalized regression neural
network and they compared the performance with the
performance of linear and multilayer perceptron.
140
There are two input units in a network by which data is
received from the environment, hidden layers y which
transformation of data is represented internally output
units whose function is to take decision. It is possible
train recurrent neural networks for sequence labeling
problems where the input and output alignment is not
known by end to end training method such as
connectionist temporal classification. Hence neural
network plays a great role in recognizing the speech in
this work of project.
W
w
I/P b O/P
=
b
Hidden layer =
output
=
Fig.3: A Basic Neural Network Used for Training
=
This is the neural network with an input, ten hidden
layers and one output stage. 128 samples of each
sentence are applied. Out of which 70 are used for
training and 58 are for testing. All the performance is
carried out in MATLAB with coding.When number of
words which are to be recognized increases, the number
of neurons in hidden layers also have to be increase. The
number of neurons required are almost equal to the
number of words are too be recognized. Whenever we
increase the number of hidden layers, the training time
grows sensitively. The quality of the signal pre-
83
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
processing should be good because performance of the
network is mainly dependent on this unit.
3. NEURALNETWORK
IMPLEMENTATION
Neural networks have been used by many of the authors
in the past. For our work of project’s implementation,
MATLAB neural network toolbox has been used to
create, train, and simulate the network. For each
sentence, 128 samples are used. From these 128 samples,
70 are used for training while the other 58 are used for
testing the network. The trained network can also be
tested with real time input from a good quality
microphone. Setup of MFCC and neural network for
experiment are presented by T.B. Adam. [11]. They took
speech data from T146 database isolated alphabet called
T1ALPHA. They set the output nodes to nine in order to
recognize the nine letters of E-set.
The hidden layers can be calculated by using the formula
h= 𝑛 ∗ 𝑚, where n is the number of input nodes and m
is the number of output nodes [11].
4. RESULTS & DISCUSSION
From the above data, it can said that communication can
be module and efficient by speech. Beyond efficiency,
speech helps human in making comfortable and familiar
with speech. More concentration and restrict movement
is required by other modalities due to unnatural
positions. Speech is identified by machines by the use of
process Automatic Speech Recognition. Feature vector
helps in representing each word by conventional method
of speech recognition. Artificial Neural Networks (ANN)
are biological inspired tools that process the information.
Priori information of speech process is not required by
artificial neural networks.
Best result is obtained at epoch 4 in this work. 100%
accuracy is not achieved in any of the case. The best
training performance rate is 2.2596-20 at epoch 4.
0
Best Training Performance is 2.2596e-20 at epoch 4
10
Mean Squared Error (mse)
-5
10
-10
10
-15
10
-20
10
0 0.5 1 1.5
4 Epochs
Fig.4: Best Training Performance Obtained
It is shown that, in our work of project best training
performance is obtained at the epoch 4. We handle the
adjustment with a learning rule from which we can also
derive a training algorithm for a specific task. Data is
trained using neural network toolbox and remaining of
the 70 samples are simulated against this trained neural
network. The performance of neural network is seen
ISBN: 978-81-924893-0-8
when it runs. The mean square error (MSE) is a network
performance function. The performance of the network is
measured according to the mean of squared errors.
Mean Square Error is defined as the average squared
difference between the output and targets. If zero is
obtained, it means no error is there, lower value means
result is better. In the above graph, it
is shown that the mean square error of the network is
starting at large value and decreasing to a small value.
Table 1. Result obtained of different samples
Age No of passed Failed %age
group tested
samples
3-10 5 4 3 90%
10-20 4 2 2 80%
20-30 6 5 1 95%
30-40 5 4 1 97.23%
40-50 5 3 2 86.5%
Above table shows the performance of speech signals of
different persons of various ages including male and
female. From the result it is concluded that the better
percentage of accuracy is obtained on the recognition of
speech signals that are recorded in a closed room than
those are recorded in an open room.
5. CONCLUSION
From the presented work, it is concluded that neural
networks can be very powerful models for the
classification of speech signals. Some types of very
simplified models can recognize the small set of words.
The performance of the neural networks is being
Train impacted largely by the pre- processing technique. On
Best the other hand, it is observed that Mel Frequency
Cestrum Coefficients are very reliable tool for the pre-
processing stage. Very good results are provided by these
coefficients. Satisfying results are achieved by the use
of both the Multilayer Feed Forward and Radial basis
function neural network with the back propagation
algorithm when Mel Frequency Cestrum Coefficients are
used.
REFERENCES
1. John Paul Hosom, Ram Ad Mark Fanty, “Speech
Recognition using Neural Networks” volume.1, July
2 2.5 3 3.5 4
6 1999.
2. Antanas Lipeika, Joana Lipeika, Loimutis Telksnys,
“development of Isolated Word Speech Recognition
System” volume.30, No.1, PP 37-46, 2002.
3. Ben Gold and Nelsom Margan, “Speech and Audio
Processing” Willey addition New Delhi, 2007.
4. Wouter Geuaert, Georgi Tsenav, Valeri Mladenov,
“Neural Network used for Speech Recognition”
Journals Automatic Control, volume.20.1.7, 2010
84
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5. Santosh K. Gaikwad, Bharti W. Gawali, Pravin
Yannawar, “A Review of Speech Recognition
Technique” IJCA, volume.10, No.3, November 2010.
6. Lakshami Kanaka, Venkateswarlu Revada,
Yasautcha Kumari Rambatla and Koti Verra
NagayaAnde, volume.8, issue. 2, March 2011,
IJCST.
7. Nidhi Srivastava, “Speech Recognition using
Artificial Neural Networks” volume.3, issue.3, may
2014, IJEST.
8. Dr. R. L. K. Venkates, Dr. R. Vasantcha Kumari, G.
Vani Jayasatu, “Speech Recognition using A Radial
Basis Function Neural Networks” volume.3, PP
441-445, April 2011, 3rd INC on E computer
technique IEEE.
9. Vansantha Kumari, G.Vani, Dr. R. L. K.
Vankateswarlu, Dr. R. Jayasar, “Speech
Recognition by using Recurrent Neural Network”
IJSER volume.2, issue.6, June 2011.
85
ISBN: 978-81-924893-0-8
10. Abdul Syapiq B Abdul Sukor, “Speaker
Identification System using Mel Frequency Cestrum
Coefficient Procedure and Noise Reduction
Method” Master Thesis, University Tun Hussein
Onn Malaysia, January 2012.
11. T. B. Adam, Md Salam, “Spoken English Alphabet
Recognition with MFCC AND Back Propagation
Neural Network” IJCA, volume.42, No.12, March
2012.
12. R. B. Shinde, Dr. V. P. Pawar, “Vowel
Classification Based on LPC and ANN” IJCA,
volume.50, No.6, July 2012.
13. Elhan S. Salam, Reda A. El-Khoribi, Mahmoud E.
Shoman, “Audio Visual Speech Recognition For
People with Speech Disorder” volume.96, No.2,
June 2014.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
BER Analysis of Turbo Coded OFDM for different
Digital Modulation Techniques
Gurwinder Kaur
Electronics and Communication Section, YCOE,
Talwandi Sabo, Guru Kashi Punjabi University
Campus, Patiala
ABSTRACT
With the rapid growth of digital communication in recent
years, the need for high speed data transmission is
increased. A common problem found in high speed
communication is Inter Symbol Interference (ISI). ISI
occurs when a transmission interferes with itself and the
receiver cannot decode the transmission correctly. ISI
becomes a lilmitation in high data rate communication.
OFDM avoids this problem by sending many low speed
transmissions simultaneously. OFDM is a promising
modulation for achieving high rates in mobile environment,
due to its resistance to inter symbol interference. In this
paper we design a Turbo coded OFDM system which can
be used for digital broadcasting with powerful error control
and we also simulate this OFDM model for BER
performance under different digital modulation techniques.
Keywords: Turbo coded OFDM, Digital Modulation
TECNIQUES, BER(bit error rate).
1. INTRODUCTION
Turbo codes powerful error control code of practical
importance. Turbo codes have error correcting capability
very close to the theoretical performance limits. A variable-
rate variable-power MQAM scheme to exhibit a 20-dB
power gain over non-adaptive modulation on a flat
Rayleigh fading channel. Adaptive Turbo Coded
Modulation adapts the transmit rate by adapting the channel
encoder itself. Due to Complexity in the implementation of
MAP decoder, Log-MAP and Max-Log-MAP have been
designed. Performance of WIMAX using turbo code and
using convolutional product code has been measured.
AWGN channel gives a gain of approximately 22 dB over
Markov channel. Turbo codes give improvement in the
BER performance over convolutional code. Turbo codes
give better performance at low SNR. By dividing the
bandwidth into narrowband flat fading sub-channels,
OFDM is more resistant to frequency selective fading than
single carrier systems are. Channel coding plays a very
important role in OFDM systems performance. A turbo
code can achieve performance within 3 dB of channel
capacity Random coding of long block lengths may also
perform close to channel capacity. MAP and SOVA are
primary decoding strategies for turbo codes. Interleaver is
to randomize the data sequence. BER performance is
improved if the length of the interleaver is increased[6].
The basic turbo encoder which is a parallel concatenation
of two RSC codes, separated by an interleaver. A reliability
86
ISBN: 978-81-924893-0-8
Amandeep Kaur
Computer Science and Engineering, Baba Hira
Singh Bhattal Institute of Engineering and
Technology, Lehragaga
value introduced to overcome the drawbacks of Viterbi
coding used in the encoding is known as the soft output
Viterbi algorithm (SOVA)[9]. This interleaver design is
both tedious and exhaustive. Encoding input sequences
determine minimum codeword weight and the number of
codewords with that weight that produces the largest
minimum codeword weight with the lowest number of
codewords of that weight[11].
In ASK, the amplitude of the carrier is changed in response
to information and all else is kept fixed. In FSK the
frequency of the carrier is changed to two different
frequencies depending on the logic state of the input bit
stream. PSK is a digital modulation scheme that conveys
data by changing, or modulating, the phase of a reference
signal. The outputs of two modulators in QAM are
algebraically summed and the result of which is a single
signal to be transmitted, containing the In-phase (I) and
Quadrature (Q) information. In PAM, the amplitude of the
carrier is varied in proportion to sample values of a
message signal and pulse duration is held constant[2].
The structure of rest of the paper as follows: The second
section describes the Turbo Coded OFDM model. The
Third section explain results of the BER analysis for
different modulation techniques. In fourth section the result
is concluded.
2. TURBO CODED OFDM MODEL
OFDM[7] is a multi-carrier modulation technique in which
a single high rate data stream is divided into multiple low
rate data streams and is modulated using sub-carriers which
are orthogonal to each other. The block diagram of Turbo
coded OFDM shown in Figure. 2.1. The random data
generator(RDG) is used to generate random binary data in
serial format. Convolution Encoder(C.Er) is constituent of
Turbo Encoder. The Interleaver(IL) increases resistance to
frequency selective fading. After BDC(Binary to digital
conversion) the block provides the digital
modulations(DM). Then pilot Insertion(PI) block used to
recover the amplitude and phase of the signal to be
transmitted. The IFFT block converts the frequency domain
data into time domain signal while maintaining the
orthogonality of subcarriers. Cyclic extension(CY.E) used
to mitigate ISI effect in original OFDM symbol. The langth
of cyclic prefix is chosen ¼ of the length of symbol.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

after removing cyclic extension, so as measure the actual

effect of this parameter on BER.

3.1 BER Performance of QAM

Modulated Turbo Coded OFDM
RDG C.Er IL BDC
BER performance using Quadrature Amplitude Modulation
CY. E IFFT PI DM technique in the turbo coded OFDM system with AWGN
channel under the simulation parameters mentioned in the
Table 3.1 is shown in figure 3.1.
AWGN Channel
0
BER vs SNR
10

Dmod P. SYN FFT Re.C.E

.
-1
10

DBC D.IL Turbo BER

.D

BER
-2
10
Figure 2.1. Turbo coded OFDM Model

The signal transmitted through the AWGN channel and the -3

10
receiver section receives the signal with proper phase
sysnchronisation by phase synchronized block(P.SYN).
The cyclic extension removed by Re.C.E. block. After
-4
digital to binary conversion(DBC) de interlaeaving (d.IL) is 10
0 2 4 6 8 10 12 14 16
done and the data transmitted to Turbo Decoder and then SNR (dB)

Bit error analysis plots are obtained using different digital

modulation techniques( ASK, PSK, DPSK, M-QAM and Figure 3.1. BER vs. SNR for QAM modulated turbo
PAM). coded OFDM.
3. RESULTS The BER starts decreasing monotonically as value of SNR
increases and reduced to 0 at SNR value around 20 dB for
Turbo Coded OFDM has powerful error correcting QAM. We do close analysis of BER and SNR Values. The
capabilities due to its multi-path delay spread tolerance and value of BER at SNR equal to 2 dB is 0.4412 and at SNR
efficient spectral usage by allowing overlapping of equal to 4 the value of BER is 0.3844, the difference in the
subcarriers in the frequency domain. All the simulations are BER values is 0.0275. The value of BER at SNR equal to 8
done to achieve a desired BER of 10-4. dB is 0.3183 and at SNR equal to 10 dB the value of BER
is 0.2296, the difference in the BER values is 0.0887 which
Table 3.1 SIMULATION PARAMETER is more as compare to the case above. The value of BER at
SNR equal to 14 dB is 0.0346 and at SNR equal to 16 dB
Sr.N Parameter Value the value of BER is 0.0059, the difference in the BER
o. values is 0.0287. Turbo codes perform better at low SNR.
1 Modulation QAM,PAM,PS
K,DPSK 7.2 BER Performance of PAM Modulated Turbo Coded
OFDM
2 Coding Technique Turbo Coding
BER performance using Pulse Amplitude Modulation
3 No. of subcarriers 64
technique in the turbo coded OFDM system with AWGN
4 Data Frame Size 96 channel under the simulation parameters mentioned in the
5 No. of frames 100 Table 3.1 is shown in Figure 3.2. The BER starts
6 No. of Pilot Subcarriers 04 decreasing monotonically as value of SNR increases and
7 IFFT Size 64 reduced to 0 at SNR value around 30 dB. We do close
8 Cyclic Prefix Length 16 analysis of BER and SNR Values. The value of BER at
9 Channel Type AWGN SNR equal to 2 dB is 0.4231 and at SNR equal to 4 the
value of BER is 0.4167, the difference in the BER values is
Simulation parameters adopted in this thesis are enlisted in
0.0064. The value of BER at SNR equal to 8 dB is
Table 1.1. The BER performance for Turbo coded OFDM
for various modulation techniques such as QAM, PAM,
PSK, DPSK in an AWGN channel is plotted. Moreover,
BER performance of the QAM modulated OFDM is plotted

87
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

0
BER vs SNR BER vs SNR
0
10 10

-1
10

-1
10
BER

-2
10

BER
-2
-3
10 10

-4
10
0 5 10 15 20 25 30
SNR (dB) -3
10
0 5 10 15 20 25
SNR (dB)
Figure 3.2. BER vs. SNR for PAM modulated turbo coded
OFDM. Figure 3.3. BER vs. SNR for PSK modulated turbo coded
OFDM.
0.3968 and at SNR equal to 10 dB the value of BER is
0.3760, the difference in the BER values is 0.0208 which is 7.4 BER Performance of DPSK Modulated Turbo
more as compare to the case above. The value of BER at Coded OFDM
SNR equal to 14 dB is 0.3386 and at SNR equal to 16 dB
the value of BER is 0.2840, the difference in the BER BER performance using DPSK Modulation technique in
values is 0.0546. The value of BER at SNR equal to 22 dB the turbo coded OFDM system with AWGN channel under
is 0.0393 and at SNR equal to 24 dB the value of BER is the simulation parameters mentioned in the Table 3.1 is
0.0085, the difference in the BER values is 0.0308. Turbo shown in figure 3.4.
codes perform better at low SNR. The differences in the
BER values increase when SNR value is about 18 dB and BER vs SNR
0
above 18 dB this difference goes on decreasing. 10

3.3 BER Performance of PSK Modulated

Turbo Coded OFDM -1
10

BER performance using PSK Modulation technique in the

BER

turbo coded OFDM system with AWGN channel under the

simulation parameters mentioned in the Table 3.1 is shown -2
10
in figure 3.3. The BER starts decreasing monotonically as
value of SNR increases and reduced to 0 at SNR value
around 25 dB. We do close analysis of BER and SNR
Values. The value of BER at SNR equal to 2 dB is 0.4861 -3
10
and at SNR equal to 4 the value of BER is 0.4648, the 0 5 10 15
SNR (dB)
20 25 30

difference in the BER values is 0.0213. The value of BER

at SNR equal to 8 dB is 0.4533 and at SNR equal to 10 dB
the value of BER is 0.4066; the difference in the BER
values is 0.0467 which is more as compare to the case
above. The value of BER at SNR equal to 14 dB is 0.3443
and at SNR equal to 16 dB the value of BER is 0.2963; the
difference in the BER values is 0.0480. The value of BER
at SNR equal to 22 dB is 0.0204 and at SNR equal to 24 dB
the value of BER is 0.0021; the difference in the BER
values is 0.0183. Turbo codes perform better at low SNR.
The differences in the BER values increase when SNR
value is about 18 dB and above 18 dB this difference goes
on decreasing.
Figure 3.4. BER vs. SNR for DPSK modulated turbo coded
OFDM
The BER starts decreasing monotonically as value of SNR
increases and reduced to 0 at SNR value around 30 dB. We
do close analysis of BER and SNR Values. The value of
BER at SNR equal to 2 dB is 0.4946 and at SNR equal to 4
the value of BER is 0.4906, the difference in the BER
values is 0.0040. The value of BER at SNR equal to 8 dB is
0.4639 and at SNR equal to 10 dB the value of BER is
0.4532; the difference in the BER values is 0.0107 which is
more as compare to the case above. The value of BER at
SNR equal to 14 dB is 0.3979 and at SNR equal to 16 dB
the value of BER is 0.3738; the difference in the BER
values is 0.0241. The value of BER at SNR equal to 22 dB
is 0.1470 and at SNR equal to 24 dB the value of BER is
0.0472; the difference in the BER values is 0.0998. Turbo
codes perform better at low SNR. The differences in the

88
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

BER values increase when SNR value is about 24 dB and Table 3.2: Analysis of BER for various modulation
above this difference decreases. techniques with SNR

7.5 BER Performance of QAM

BER
Modulated Turbo OFDM without Cyclic SNR
Extension QAM
QAM PAM PSK DPSK (without
BER performance using Quadrature Amplitude Modulation cyclic
technique in the turbo coded OFDM system with AWGN extension)
channel and removing Cyclic Extension and other 0 0.4687 0.4454 0.4861 0.4950 0.4732
simulation parameters mentioned in the Table 3.1 being
same is shown in figure 3.5. 2 0.4412 0.4231 0.4861 0.4946 0.4428
0
10
BER vs SNR 4 0.3844 0.4167 0.4648 0.4906 0.3932
8 0.3183 0.3968 0.4533 0.4639 0.3404
10 0.2296 0.3760 0.4066 0.4532 0.2507
-1
10
12 0.1385 0.3555 0.3884 0.4291 0.1481
14 0.0346 0.3386 0.3443 0.3979 0.0363
BER

-2
10 16 0.0059 0.2840 0.2963 0.3738 0.0042
18 0.0002 0.2319 0.1955 0.3382 0.0007
-3 20 0 0.1169 0.0979 0.2528 0
10
22 0 0.0393 0.0204 0.1470 0
24 0 0.0085 0.0021 0.0472 0
-4
10
0 2 4 6 8 10 12 14 16 26 0 0.0003 0 0.0096 0
SNR (dB)
28 0 0.0001 0 0.0011 0

Figure 7.5. BER vs. SNR for QAM without using Cyclic
Extension
The BER starts decreasing monotonically as value of SNR
increases and reduced to 0 at SNR value around 20 dB for
QAM. We do close analysis of BER and SNR Values. The
value of BER at SNR equal to 2 dB is 0.4428 and at SNR
equal to 4 the value of BER is 0.3932, the difference in the
BER values is 0.0496. The value of BER at SNR equal to 8
dB is 0.3404 and at SNR equal to 10 dB the value of BER
is 0.2507; the difference in the BER values is 0.0897 which
is more as compare to the case above. The value of BER at
SNR equal to 14 dB is 0.0363 and at SNR equal to 16 dB
the value of BER is 0.0042; the difference in the BER
values is 0.0321.
All the values of BERs are more compare to the values of
QAM modulated OFDM with cyclic extension. BER
performances under various modulation techniques in an
AWGN channel with channel coding conditions have been
evaluated. The BER starts decreasing monotonically when
channel coders are used and reduced to 0 at SNR value
around 20 dB for QAM, around 26 dB for PSK, around 30
for PAM and DPSK. For QAM modulated OFDM plotted
after removing cyclic extension BER reduced to 0 around
20 dB but as compare to one with cyclic extension its BER
is more between 0-20 dB SNR. QAM modulated Turbo
OFDM with cyclic prefix has better performance as
compare to PAM, PSK, DPSK and QAM Turbo OFDM
without cyclic prefix. Gain (expressed in decibels) is the
reduction in the required SNR to achieve a specified BER.
As BER reduces to 0 at SNR value around 20 dB for QAM,
around 26 dB for PSK, around 30 for PAM and DPSK
there will be gain in SNR, it will be different with respect
to different modulated models. For BER equal to 0, Gain of
QAM modulated system over PAM modulated will be
around 10 dB; it will be 6 dB over PSK modulated system
and 10 dB over DPSK modulated system.
4. CONCLUSIONS & FUTURE SCOPE
In this paper, The results clearly depicts that the turbo code
has the capability of reaching very low bit error rates at
even small signal to noise ratios. The objective of the
iterative process to further reduce bit errors is accomplished
by evaluating BER vs. SNR under various modulation
techniques. QAM modulated Turbo OFDM with cyclic
prefix has better performance as compare to PAM, PSK,
DPSK and QAM Turbo OFDM without cyclic prefix. For
QAM modulated OFDM plotted with cyclic extension
shows better BER performance than one without cyclic
extension.
The turbo codes have the capability of reaching very low
bit error rates at even small signal to noise ratios. Future
work will include effect of multipath fading channels such
as Nakagami channel model can be studied as this model
represent severe ISI conditions due to their nature of
producing burst of errors and are more realistic for outdoor
mobile applications. Channel equalization techniques can
also aid to improve the performance of the system.

89
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES
[8] N. Sharma and R. Lal Dua; ‘ To Improve Bit error rate
[1] S. Haykin; ‘Digital Communication’ wiley publications. of OFDM Transmission using Turbo Codes’ International
Journal of Advanced Research in Computer Engineering
[2] B. Sklar, R. P. Kumar; ‘Digital Communication
and Technology, Volume 1, Issue 4, pp. 37-44, June 2012.
Fundamentals and Applications’ Pearson publications.
[9] S. Papaharalabos, P. Sweeny and B. G. Evans; ‘ A new
[3] R. Prasad, ‘OFDM for Wireless Communication
method of improving SOVA Turbo decoding for AWGN,
Systems’ Artech House Publishers, 2004. Rayleigh and Rician fading channels’ IEEE Proceedings,
volume 5, pp. 2862-2866, 2004.
[4] R. Bose; ‘Information Theory Coding and
Cryptography’ McGraw-Hill
[10] A. Ebian, M. Shokair and K. Awadalla; ‘Comparision
between Turbo code and Convolutional product code for
[5] V.D. Nguyen and H.P. Kuchenbecker; ‘Interleaving
WIMAX’ World academy of Science, Engineering and
Algorithm for soft decision Viterbi decoding in OFDM
Technology 51, pp.195-199, 2009.
systems over fading channels’ IEEE International
Conference on Telecommunication, June 2001, Romania. [11] B.Lu, X. Wang and K. R. Narayanan; ‘LDPC based
Space Time Coded OFDM Systems over Correlated Fading
[6] A. Burr; ‘Turbo Codes:The Ultimate Error Correction
Channels: Performance analysis and receiver design’ IEEE
Codes’ Electronics and Communication Engineering
Transaction Wireless communication. Volume 1, pp. 213-
Journal, pp.155-165.
225, April 2002.
[7] F.B. Frederiksen and R. Prasad; ‘An overview of
[12] Shang- Kang Deng, Kuan- Cheng Chen and Mao Chao
OFDM and related Techniques towards the development of
Lin; ‘Turbo Coded OFDM for reducing PAPR and Error
Future Wireless Multimedia Communications’ In
Rates’ IEEE Transaction Wireless communication. Volume
Proceedings IEEE Conference Radio and wireless
7, pp. 84-89, January 2008.
Communication(RWC 02), pp. 19-22, August 2002.

90
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Rectangular Microstrip Patch Antenna with Triangular

Slot
Sandeep Singh Sran Jagtar Singh Sivia
Yadavindra College of Engineering Yadavindra College of Engineering
Punjabi University GuruKashi Campus Punjabi University GuruKashi Campus
Talwandi Sabo, Punjab, India Talwandi Sabo,Punjab, India

sandeepsra07@yahoo.in jagtarsivian@yahoo.com

ABSTRACT Basically there are four feeding techniques available to us

This paper describes the design of Rectangular Microstrip while designing of antenna. These are line feed, probe feed,
Patch Antenna with Triangular Slot (RMPATS) at a frequency aperture coupled feed and proximity coupled feed. The feed
of f = 2.4 GHz. The proposed antenna has been designed by that is used here is probe feed (or coaxial feed).
introducing a triangular slot in the rectangular patch. The
FR4-Epoxy with relative permittivity 4.4 and height 1.6 mm
is used as substrate material. Antenna is fed by coaxial probe
feed. The proposed antenna have acceptable value of return
losses (RL) and gain. HFSS software is used for simulation of
Fig 1: Common available shapes of Microstrip
proposed antenna.
Patch Antenna
In this paper we proposed the rectangular microstrip patch
Keywords
Microstrip; Patch; Triangular; Slot; Antenna; Return loss; antenna with triangular slot. The triangular slot is cut in the
Gain. which is mounted on the substrate. We use here the FR4
epoxy as the substrate material with height of 1.6 mm, relative
1. INTRODUCTION permittivity of 4.4 and loss tangent of 0.02.
Microstrip patch antennas are widely used in many
applications in wireless communication. Because microstrip 2. DESIGN OF PROPOSED ANTENNA
antenna has very attractive features such as low profile, light The Geometry of proposed antenna is shown in Fig 2.
weight, high efficiency and low cost. But the disadvantages of 2.1 Without Slot
microstrip antenna has its narrow bandwidth [1]. The Substrate: Material: FR4 epoxy
techniques used to enhance bandwidth are to choose a thick
substrate with low dielectric constant [2] and slotted patch [3- Width: 60 mm
4]. The first technique is limited because the thich substrate
Length: 60 mm
require the increased length of the probe feed which
introduces large inductance and resulting in increase only a Height: 1.6 mm
few percentage in the bandwidth at resonant frequency.
Position: -30, -30, 0
By using the second technique (slotted patch) the size of the
patch reduces and also results in lowering the antennas Patch: Width: 38.04 mm
fundamental resonant frequency. Length: 29.44 mm
Microstrip antennas are also called the patch antennas. The Position: -19.02, -14.72, 1.6
microstrip antenna consist of three layers. The substrate is
sandwitched betwen a gound plane and metallic patch [5-6]. Feed Line: Location: offset from center in y
The radiating element and the feed line are made by process direction (0, 7, 1.6)
of photo etching on the dielectric substrate. The patch
Coaxial inner radius: 0.3 mm
configuration may be square, rectangular, dipole, circular,
elliptical, triangular or any other shapes as shown in Fig 1. Coaxial outer radius: 0.5 mm
Square, rectangular, dipole and circular are the most common
because of ease of analysis and fabrication and their attractive 2.2 With Slot
radiation characteristics, especially low cross-polarization All the dimensions are same as without slot. But the
radiation [3]. In its simplest form a microstrip antenna dimensions of the slot are given below:
consists of a patch of metal, usually rectangular or circular Slot: Traingle
(though other shapes are sometimes used) on top of a
grounded substrate. 1st line length 12.80 mm

Due to their advantages, they become suitable for various From Point 1(0, -2, 1.6) to Point
applications like, vehicle based satellite link antennas [7], 2(-10, -10, 1.6)
global positioning systems (GPS) [8], radar for missiles and 2nd line length 20 mm
telemetry [7] and mobile handheld radios or communication
devices.

91
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

From Point 1(-10, -10, 1.6) to Table 2. Performance parameters of RMPA with slot
Point 2(10, -10, 1.6)
3rd line length 12.80 mm Freq. Return Lower Upper Gain BW
Losses Freq. Freq.
From Point 1(10, -10, 1.6) to
Point 2(0, -2, 1.6) GHz db GHz GHz db MHz
Feed Line: Location: offset from center in y 2.15 -15.27 2.1213 2.1881 +7.37 66.8
direction (5, 7, 1.6)
3.69 -18.58 3.6646 3.7480 +1.11 103.4
Coaxial inner radius: 0.3 mm
Coaxial outer radius: 0.5 5.43 -30.73 5.3610 5.4953 +6.22 134.3

6.10 -12.51 6.0473 6.1432 +2.57 95.9

6.80 -24.65 6.6690 6.9116 +4.13 242.6

8.19 -43.98 8.1225 8.2573 +3.56 134.8

9.79 -29.97 9.6028 10.000 +4.72 397.2

From the table it is clear that with adding triangular slot it is

clear that without slot upper two and lower two resonant
frequencies 2.35 GHz, 3.70 GHz, 7 GHz, 7.42 GHz are
shifting to lower side 2.15 GHz, 3.69 GHz, 6.10 GHz, 6.80
GHz. Also the antenna without slot has negative gain on 4.49
GHz frequency but by adding triangular slot the gain of
antenna at all resonant frequencies becomes positive.
Triangular slot there antenna has more frequency bands than
without slot Antenna. The gain at Frequency 2.15 GHz is 7.37
db.
3.1 Return Losses
Fig 2: Geometry of RMPATS

3. RESULTS
The Results of Rectangular Microstrip Patch Antenna
(RMPA) without triangular slot and With triangular slot in
terms of performance parameters such as RL, gain, directivity
& bandwidth are shown in Table 1 and Table 2 respectively.
Table 1. Perfoemance parameters of RMPA without
slot
Freq. Return Lower Upper Gain BW
Losses Freq. Freq.
GHz db GHz GHz db MHz
2.35 -13.19 2.3194 2.3821 +2.08 62.7

3.70 -11.57 3.6643 3.7451 +1.20 80.8

4.49 -10.06 4.4855 4.5004 -3.20 14.9

7.00 -11.42 6.9678 7.0417 +7.77 73.9

7.42 -20.70 7.3302 7.4972 +6.14 16.7

Fig 3: Return loss versus frequency plot

without slot

92
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig 4: Return loss versus frequency plot with
slot
RL versus frequency plot for the proposed antenna without
slot and with slot are shown in Fig 3 and Fig 4 From the graph
it is clear that return loss has been improved by cutting a slot
than without cutting a slot.
3.2 Gain
Fig 5: Three dimension radiation pattern
Three dimension radiation pattern of proposed antenna at one
resonant frequencies 2.15 GHz is shown in figure 5, which
shows that the proposed antenna has gain of 7.37 db at 2.15
GHz frequency.
3.3 Bandwidth
We measured the bandwidth with reference to the -3dB
points on the S11 curve. The -10 dB of return loss is an
93
ISBN: 978-81-924893-0-8
acceptable level of value to describe the loss of the power
which reflects back from the antenna [7]. Bandwidth of
antenna without & with slot at different frequencies are shown
in Table 1 and Table 2 respectively.
4. CONCLUSION
From the simulation analysis of propoed antenna it can be
easily observed that the designed RMPATS has a gain of 7.37
db and optimized return loses -15 db at a frequency of 2.15
GHz. It has also improved values of return losses, gain and
bandwidth and no. of bands of resonant frequencies.
RMPATS can be used for Wireless Communication
applications. The proposed antennas have achieved good
impedance matching, stableradiation patterns, and high gain.
REFERENCES
[1] Bhomia, Y., Kajla, A. and Yadav, D., “V-slotted
Triangular Microstrip Patch Antenna”, International
Journal of Electronics Engineering, vol. 2, 2010.
[2] James, J.R. and Hall, P.S.: “Handbook of Microstrip
Antennas” (Peter Peregrinus).
[3] Balanis, C.A. : “Antenna Theory, Analysis and Design”
(John Wiley & Sons).
[4] Wang, H., Hunang, X. B. and Fang, D. G., “A single
layer wideband U slot Microstrip patch antenna array”,
IEEE Antennas and Wireless Propagation Letters, Vol. 7,
2008, pp:9-12.
[5] Goyal, R., Jain, Y.K., “Compact Bow Shape Microstrip
Patch Antenna with Different Substrates”, IEEE
Conference on Information and Communication
Technologies, 2013.
[6] Munir, A., Petrus, G., Nusantara, H., “ Multiple Slot
Technique for Bandwidth Enhancement of Microstrip
Rectangular Patch Antenna”, IEEE Conference on
Resarch and Innovation, 2013.
[7] James, R.J., “Some recent developments in microstrip
antenna design”, IEEE Trans. Antennas and Propagation,
Vol.AP-29, January 1981, pp.124-128.
[8] Uzunoglu, N.K., Alexopoulos, N. G. and Fikioris, J.
G.,“Radiation Properties of Microstrip Dipoles,” IEEE
Trans. Antennas propagat., Vol. AP-27, No. 6, pp.853-
858, November 1979.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
DESIGH REVIEW ON HIGH-SWING, HIGH
PERFORMANCE CMOS OPERATIONAL AMPLIFIER
Harjeet Singh
BHS Institute of Engineering &Technology
Lehragaga (Sangrur),India
ABSTRACT
In this paper a review on the high-swing, high
performance CMOS operational Amplifier is carried out
and based on the literature, a design procedure for a
HSHPSS (high-swing high performance Single Stage)
CMOS operational amplifier is developed using design
equations. A proposed design equation based procedure
provides a quick and effective mechanism for directly
estimating the MOS circuit parameters of the op-amp
Key-words
OP-amp, Load capacitance, Slew rate, Power
Dissipation.
1. INTRODUCTION
We are witnessing the dominance of
microelectronics (VLSI) in every sphere of electronics
and communications forming the backbone of modern
electronics industry in wireless mobile communications,
state-of-art processors, computers etc. All efforts
eventually converge on decreasing the power
consumption entailed by ever reducing size of the
circuits enabling the portable gadgets.
Designing high – performance analog circuits is
becoming increasingly challenging with the persistent
trend towards reduced supply voltages .The main
bottleneck in an analog circuit is the operational –
amplifier. At higher supply voltages, there is a trade –
off between power, gain and speed,. Characterstics
under consideration are low offset voltage, high gain, ,
high output swing and high PSRR. These characteristics
define Performance of analog circuit. Reducing supply
voltages and output swing become the key parameter.
Due to the advancement in the Op-amp architectures
time to time have evolved from a simple Two-Stage
architecture to the high performance Telescopic amplifier
involving less high gain low noise, power consumption,
etc.
In this paper the design procedure for HSHPSS (high-
swing high performance Single Stage) CMOS Telescopic
operational amplifier is developed using design
equations. The high swing of the op-amp is achieved by
employing the tail and current source transistors in the
deep linear region. Trade - off among such factors as
bandwidth, output swing, PSRR Gain, bias voltages,
slew rate, Phase margin, CMRR, , power are made
evident.
2. HIGH SWING IN
OPERATIONAL AMPLIFIER
In analog circuits where kT/C noise is the dominant
noise, the relationship between op-amp performance
94
ISBN: 978-81-924893-0-8
Tushty Bansal
BHS Institute of Engineering &Technology
Lehragaga (Sangrur),India
metrics such as signal-to-noise ratio (SNR), speed and
power consumption can be shown to be
 gm 
 
. 
SNR .Speed (Swing ) C  2
(1)

Power  kT  V sup .(I)
 
 C 
where the constants ,  and are the feedback
factor of the closed-loop op-amp, the number of kT/C
noise contributions at the output of the amplifier, and the
ratio of the total current consumption of the op-amp to
the current I flowing through one of the input devices,
respectively. Here, speed corresponds to the dominant
pole location of the op-amp. The above expression can
be as
SNR .Speed (Swing ) 2
 (2)
Power Vsup
where gm  I as in the case, when the input
devices are in weak/ saturation inversion region of strong
inversion. The proportionality constant in the last term is
a function of the architecture of the op-amp and the
switched-capacitor circuitry around the op-amp. It is
clear from this above mathematical expression that
increasing swing of the op-amp leads to improvement of
overall performance ,which leads to achieve lower power
or higher SNR or speed [2,10].
3. SWING IMPROVEMENT
METHODOLOGY
In the topology shown in Fig. 1, transistors
M7–M9 are deliberately driven deep into the linear
region. Since these transistors normally operate in the
linear region Vmargin, is not needed across these devices.
Under these conditions, the output swing is shown to be
2Vsup  6Vds,sat  2Vm arg in  2Vds,lintail  2Vds,linload,
where Vds,lin  tail and Vds,lin load, are the drain-to-source
voltages for the tail and load transistors, respectively.
With Vds, sat of 200 mV, Vmargin of 100 mV, Vds, lin-tail of
80 mV, and Vds, lin-load of 160 mV, the differential output
swing is 2Vsup-1.88 V, which is more not only to a
telescopic amplifier by about 0.7 V but also to a regular
folded-cascode amplifier by roughly 100 mV. The swing
enhancement stems not only from the difference
between Vds, sat and the voltage across the devices in
the linear region but also because of the fact that we no
longer need Vmargin across devices placed in the linear
region. It is important to note that any reduction in
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

voltage across the tail transistor improves differential VB2 = VGS9 – VTh
swing two fold as the tail transistor cuts into the output
swing from both sides of the amplifier. By elimination
the voltage marginal value (Vmargin ) across the tail and 5.4: Design the differential pair of the circuit, by
the load devices itself contributes to a swing assuming both of them to be working in saturation mode.
enhancement of 4V margin . This benefit of increased Their aspect ratios could be calculated using bias current
swing by pushing the load and tail transistors in the Iss. The equation used is
W 
linear region, however, is accompanied by slightly
degraded common-mode rejection ratio (CMRR) and I SS  C ox   VGS  VTh 2
differential gain of the amplifier. The PSRR positive and  L 1, 2
PSRR negative remains the same and less power 5.5: Calculate the common mode voltage that allows M9
dissipation and good slew rate [13,25]. to be in saturation.
Vin, cm >= Vsat, 9 + VGS1
5.6: Design the High Compliance Current mirror and
calculate the bias voltage that is applied to both the gates
by the following equation
VB1 – V2 – VTh, n = Vsat, 3

Where VB1 is the bias voltage that is applied to

high Compliance current mirror, V2 is the voltage at
node 2 and VTh,, is the Threshold voltage .The aspect
ratios of transistors M3 and M4 can be calculated by
assuming both the transistors in saturation and both
are matching. The current equation is
W 
I SS  C ox   VGS  VTh 
2

  3, 4
L
where VGS = VB1 – Vsat, 2 – VTh, n
5.7: Design the Cascode Current Mirror stage where
Fig .1. Methodology for enhancing swing there are four PMOS transistors, which are identical,
and the current passing through them is same as the
4. DESIGN SPECIFICATIONS drain and gate are tied to each other. The transistors
 Unity gain bandwidth (GB) M5 and M6 are in saturation mode while transistors
 Load capacitance (CL) M7 and M8 are deliberately driven into deep linear
 Slew rate (SR) region. The current flowing is same that was in High
 Power Dissipation (Pdiss) Compliance Current Mirror stage. The aspect ratios
can be calculated by the following current equation
W 
5. DESIGN STEPS I 5,6  C ox   VGS  VTh 
2
5.1 The first step of the design is the estimation  L  5, 6
of the bias current. Assuming the GBW
established by the dominant node, we have Where VGS = VDD – 3VTh,p
The top most cascode load transistors characteristics are
2Iss 1
2f T  driven in deep linear region. The current equation is
VGS  VTH  CL given as follows

where Iss is the tail current. I SS 

C ox  W 
2  L  7 ,8

  2VGS  VT V DS  V DS
2

5.2 : Design Tail transistor M9 and calculate W and L
of this transistor by using the transistor
characteristics in deep linear region. The equation
used is Where VGS  VT , VDS  VGS  VT
I SS 
Cox  W 
2  L 9

  2VGS  VT VDS  VDS
2
 6. RESULTS
The development of a design equation based
procedure provides a quick and effective mechanism for
directly estimating the MOS circuit parameters of the op-
where VGS  VT amp The performance requirements Op-amp designed
with these calculated circuit values were able to satisfy
these requirements to a good extent as evidenced by the
T-spice simulations. The design equations highlighted
VDS  VGS  VT the principal factors affecting the performance
specifications, which made it very convenient to
redesign the circuit for different sets of specifications.
5.3: Calculate the bias VB2 of transistor M9 using the
equation

95
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
REFERENCES
[1] Allen Philip E., Holberg Douglas R. 2003,, „„CMOS
Analog Circuit Design” Oxford University Press,
London, Second Edition.
[2] Allstot David J,1989, “A Family of High-Swing
CMOS Operational Amplifiers”, IEEE Journal of
Solid State Circuits, Vol. 24, No. 6,.
[3] Babanezad J. N.,1991, “A low-output-impedance
fully differential op amp with large output swing
and continuous-time common-mode feedback,”
IEEE J. Solid-State Circuits, Vol. 26, pp. 1825–
1833,.
[4] Baker R.J, Li H.W, and Boyce D.E. 1998, “CMOS
Circuit Design, Layout, and Simulation”.
Piscataway, NJ: IEEE Press.
[5] Brown William C. and Szeto Andrew Y.J. 2000,
“Reconciling Spice Results and Hand Calculations:
Unexpected Problems”, IEEE Transaction on
Education, Vol.43, No.1,.
[6] Bult K. and. Geelen G.J.G.M,1990, “A fast-settling
CMOS op amp for SC circuits with 90-dB DC
gain,” IEEE J. Solid-State Circuits, Vol. 25,
pp.1379–1384,.
[7] Chen Fred and Yang Kevin,1999, EECS240 Term
Project Report, “A Fully Differential CMOS
Telescopic operational amplifier with class AB
output stage”, Prof. B.E. Boser,.
[8] Das Mrinal and Hellums Jim, Texas Instruments
India Ltd., “Improved Design Criteria of Gain
Boosted CMOS OTA with high speed
optimization”, IEEE J.Solid State Circuits, Vol.24,
pp.553-559, June 1986.
[9] EE240 Final Project Report,1999 “High- Gain, 3V
CMOS Fully Differential Transconductance
Amplifier ‟‟,Department of Electrical and Computer
Sciences, University of California, Berkeley
[10] Fiez Terri S., Yang Howard C., Yang John J. 1989,
Yu Choung, Allstot David J., “ A Family of High-
Swing CMOS Operational Amplifiers”, IEEE J.
Solid-State Circuits, Vol. 26, NO. 6,.
[11] Geiger R.L., Allen P. E and Strader N. R.1990,
“VLSI Design Techniques for Analog and Digital
Circuits”, McGraw-Hill Publishing Company.
[12] Gray P.R., Hurst P.J., Lewis S.H. and Meyer
R.G,2001, “ Analysis and Design of Analog
Integrated Circuits”, Fourth Edition, John Wiley &
Sons.
[13] Gulati Kush and Lee Hae-Seung, „„High – Swing
CMOS Telescopic Operational Amplifier ‟‟, IEEE
Journal of Solid State Circuits, Vol. 33, No. 12,
Dec. 1998.
[14] Kang Sung-Mo, Leblebici Yusuf, 2003, “CMOS
Digital Integrated Circuits, Analysis and design”,
Tata McGraw-Hill Edition, Third Edition
[15] Krenik W., Hellums J., Hsu W.C., Nail R,1998, and
Izzi L., “High dynamic range CMOS amplifier
design in reduced supply voltage
environment,”Tech. Dig. Midwest Symp. Circuits
and Systems, pp. 368–370.
96
ISBN: 978-81-924893-0-8
[16] Li P.W., Chin M.J., Gray P. R and Castello R., “A
ratio-independent algorithmic analog-to-digital
conversion technique,” IEEE J. Solid-State.
[17] Circuits, Vol. SC-19, pp. 1138–1143, Dec. 1984.
[18] Maloberti Franco, “Analog Design for CMOS VLSI
Systems” KLUWER academic Publisher, Boston/
Dordrecht/ London.
[19] Nicollini G., Moretti F., and Conti M,1989, “High-
frequency fully differential filter using operational
amplifiers without common-mode feedback,”IEEE
J.Solid State Circuits, Vol.24, pp.803-813.
[20] Razavi Behzad, “Design of Analog CMOS
Integrated Circuits”, Tata McGraw-Hill Publishing
Company Limited.
[21] Ribner David B., Copeland Miles A.1984, “Design
Techniques for Cascode CMOS Op Amps with
Improved PSRR and Common-Mode Input Range”,
IEEE Journal of Solid State Circuits, Vol. 19, No. 6.
[22] Roewar Falk and Kleine Ulrich “A Novel Class of
Complementary Folded-Cascode op-amps for low
voltage”, IEEE J. Solid-State Circuits, Vol. 37, No.
8, Aug. 2002.
[23] Steyaert Michel and Sansen Willy,1987, “A High-
Dynamic-Range CMOS Op Amp with Low-
Distortion Output Structure”, IEEE Journal of
Solid-State Circuits, pp. 1204-1207, Vol. SC-22,
No. 6.
[24] Steyaert M. and Sansen W,1990., “Power Supply
Rejection Ratio in Operational Transconductance
Amplifiers”, IEEE Transactions on Circuits and
Systems, Vol. CAS-37, No. 9, pp. 1077-1084.
[25] Tsividis Y,1990., “Operation and Modeling of the
MOS Transistors”, Second Ed., Boston: McGraw-
Hill.
[26] Tsividis Yannis P,1978., “Design Considerations in
Single-Channel MOS Analog Integrated Circuits –
A Tutorial”, IEEE Journal of Solid-State Circuits,
pp. 383-391, Vol. SC-13, No. 3.
[27] Yang J. and Lee H.S,1996,“A CMOS 12-bit 4 MHz
pipelined A/D converter with commutative feedback
capacitor,” in Proc.IEEE Custom Integrated
Circuits Conf., pp. 427-430,.
[28] Zeki A. and Kuntman H., “Accurate and High
output impedance current mirror suitable for CMOS
current output stages”, IEE 1997 Electronics letters
online NO. 19970700.
[29] K.Santosh, Sri G.Ramesh, 1989, “Design of 32Bit
Carry-lookahead Adder using Constant Delay
Logic”, International Journal of Scientific and
Research Publications, Volume 4, Issue 8, pp 1-12.
[30] Viswas Giri,2014, “Design and power optimization
of a low voltage cascode current mirror with
enhance dynamic range”, International Journal for
Technological Research in Engineering Volume 2,
Issue 3, pp. 157-161.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Application of AHP-VIKOR Hybrid MCDM Approach for
3PL selection: A Case Study
Arvind Jayant
SLIET Deemed University,
Longowal, Sangrur, Punjab, INDIA
arvindjayant@gmail.com
ABSTRACT
Multi-criteria decision making (MCDM) is one of the most
common activities in human society. It consists of selecting
the optimal one from a set of available alternatives with
respect to the predefined criteria or attributes. In this paper, a
hybrid decision making approach integrating Analytical
hierarchical process (AHP) operators into VIKOR is proposed
for tackling multi criteria problems with conflicting and non-
commensurable (different units) criteria. A manufacturer
produces new products by using original components or by
remanufactured components. The used products are collected
by the manufacturer or the retailer or a third party logistics
operator. Companies can no longer afford to treatment of
recovered products. It needs to be a core capability within the
supply chain organization. Understanding and properly
managing the reverse logistics can not only reduce costs, but
also increase revenues. It can also make a huge difference in
retaining consumer loyalty and protecting the brand. Due to
intricacies, considerable risks are involved in product recovery
operations; therefore core competency and experience are
prerequisite for successful implementation of reverse logistics
process to Third-Party Logistics Providers (3PLPs). The
selection of third‐party logistics provider is an intriguing
practical and research question. The objective of this work is
to develop decision support system to assist the decision-
makers in selection and evaluation of different third-party
reverse logistics providers by Analytical hierarchical process
(AHP) and Višekriterijumsko kompromisno rangiranje
(VIKOR) methods. A real life case of a mobile manufacturing
company is taken to demonstrate the steps of the decision
support system.
General Terms
Reverse logistics, supply chain, MCDM methods, 3PRL
Selection
Keywords
Višekriterijumsko kompromisno rangiranje (VIKOR); Mobile
industry; Analytical hierarchical process (AHP); reverse
logistics operation;
1. INTRODUCTION
Multi-criteria decision making (MCDM) is regarded as a main
part of modern decision science and operational research,
which contains multiple decision criteria and multiple
decision alternatives. The increasing complexity of the
engineering and management environment makes it less
possible for single decision maker to consider all relevant
aspects of a problem. As a result, many decision making
processes, in the real world, take place in group settings
(Merigó, 2011 and, Yang et al., 2012). Therefore, multiple
criteria group decision making (MCGDM) problem is a hot
research topic which has received a great deal of attention
from researchers recently.
97
ISBN: 978-81-924893-0-8
Priya Singh
SLIET Deemed University,
Longowal, Sangrur, Punjab, INDIA
Singhpiaa23@gmail.com
In classical MCDM methods, the ratings and the weights of
the criteria are known precisely, whereas in the real world, in
an imprecise and uncertain environment, it is an unrealistic
assumption that the knowledge and representation of a
decision maker or expert are so precise. A suitable approach
for dealing with such a problem is to use linguistic
assessments instead of numerical ones to represent the
subjective judgment of decision makers by means of linguistic
variables. A very useful technique for multiple criteria
decision making is the VIKOR method (Opricovic and Tzeng,
2002), which is based on ideas of compromise programming.
The main advantages of the VIKOR method are that it can
solve discrete decision problems with conflicting and non-
commensurable (different units) criteria and provide a
solution that is the closest to the ideal. The VIKOR method
focuses on ranking and selecting from a set of alternatives,
and determines compromise solutions for a problem with
conflicting criteria, which can help the decision makers to
reach a final decision. Recently, the VIKOR method has been
studied and applied in a wide range of problems. Generally,
when using VIKOR in decision making, the separate measures
from the best and worst values are calculated by using the
weighted average and maximum weighted method,
respectively. In some cases, it may be interest to consider the
possibility of parameter zing the results from the maximum
separation to the minimum separation.
The usage of VIKOR method has been increasing. In the
literature, Chen and Wang (2009) optimized partners’ choice
in IS/IT outsourcing projects by fuzzy VIKOR. In this study,
we applied the VIKOR method, which was developed for
multi-criteria optimization for complex systems, to find a
compromise priority ranking of alternatives according to the
selected criteria for a selection problem. Sayadi, Heydari, and
Shahanaghi (2009) used extension VIKOR method for the
solution of the decision making problem with interval
numbers. Liou, Tsai, Lin, and Tzeng (2010) used a modified
VIKOR method for improving the domestic airlines service
quality and Chang and Hsu (2009) used VIKOR method for
prioritizing land-use restraint strategies in the Tseng–Wen
reservoir watershed. On the other hand some researchers have
evaluated VIKOR method under fuzzy environment. For
example Kaya and Kahraman (2010) used an integrated fuzzy
VIKOR and AHP methodology for multi-criteria renewable
energy planning in _Istanbul and also Sanayei, Mousavi, and
Yazdankhah (2010) used VIKOR method for a supplier
selection problem with fuzzy sets. The objective of present
work is to develop decision support system (DSS) to assist the
decision-makers in selection and evaluation of different third-
party reverse logistics providers by Analytical hierarchical
process (AHP) and Višekriterijumsko kompromisno
rangiranje (VIKOR) methods. A real life case study of a cell
phone manufacturing company has been developed to
demonstrate the steps of the decision support system.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2. REVERSE SUPPLY CHAIN
MANAGEMENT
Recently, product and material recovery has received growing
attention throughout the world, with its three main motivators
that include governmental legislations, economic value to be
recovered and environmental concerns (Ali Cetin
Suyabatmaz, et. al., 2014). Reverse supply chain or reverse
logistics is the series of activities required to retrieve a used
product from a customer and dispose of it properly or reuse
after processing. The chain connects end users with
manufacturer in reverse direction. So Reverse Logistics – RL
have an important role in green supply chains by providing
customers with the opportunity to return end life products to
the manufacturer, thus re-evaluating them and including them
again in the production cycle (Efendigil et al., 2008). Reverse
logistics is process of reclaiming recyclable and reusable
materials, returns, and reworks from the point of consumption
or sue for repair, remanufacturing, redistribution, or disposal.
Often, the reprocessing stage requires the highest investments
within reverse logistics network. The process involves
disassembly, repair work, reuse in new products and re-
assembly. The critical issues involved are how to reduce the
uncertainty in the supply of products to be manufactured, how
to ensure a sustainable volume of products to be manufactured
and whether to outsource remanufacturing (open-loop system)
or to integrate with existing operation (closed-loop
system). Decisions regarding selecting of services and
products suppliers are, in general, complex due to various
conflicting objectives involved and, consequently, various
qualitative and quantitative criteria (Choy et al., 2005). Taking
this into account, the processes of identifying the best
suppliers for services and/or products or even evaluating the
performance of a former supplier are challenging for decision
makers (DM), but essential in business processes (Bozarth and
Robert, 2008). Furthermore, growing environmental concerns
have motivated businesses to include environmental criteria
when selecting services and product suppliers (Efendigil et al.,
2008). Returning used products is becoming an important
logistics activity due to government legislation and the
increasing awareness in society (Kannan et al., 2011).
As shown in Figure 1 (Appendix 1), based on the current
demand for reverse logistics activities companies have
basically two options to comply with the law/policy: i)
execute reverse logistics activities internally; and ii) outsource
reverse logistics activities. This article focuses on the second
option and to be able to select the most appropriate 3PRLP, it
is proposed a conceptual framework using MCDA modeling
is proposed, which has systematized steps with the purpose of
support decision makers in these kinds of decisions. The steps
assist DMs to structure the decision problem regarding
selecting of 3PRLP from the identifying objectives and the set
of criteria to defining the most suitable MCDA approach and
method, depending on the rationality of the DM. In this paper
AHP-VIKOR has been used for making strategic decision in
multi-attribute decision environment for selection of third-
party reverse logistics providers (3PRLPs) for collection of
end of life mobile phones.
Reverse Supply Chain Network-Characteristics
• Convergent in nature from end-user to manufacturer
• Reverse flow of used products
• Supply driven
• Relatively slow movement
• Value declines with time while moving upstream
• Very small value addition in some cases
• MH and transportation are not with care
98
ISBN: 978-81-924893-0-8
• Inventory available in different nodes
Drivers of Reverse Supply Chain Initiatives
• Environmental legislations
• Economic value from returns
• Green Image
• Material Resource constraints like lead and other
precious resource
3. AHP METHOD
One of the most popular analytical techniques for complex
decision making problem is the analytical hierarchy process
(AHP). Saaty (1980, 2000) developed AHP, which
decomposes a decision making problem into a system of
hierarchies of objectives, attributes (for criteria), and
alternatives.
An AHP hierarchy can have as many levels as needed to fully
characterize a particular decision situation. A number of
functional characteristics make AHP a useful methodology.
These include the ability to handle decision situations
involving subjective judgments, multiple decision makers, and
the ability to provide measures of consistency of preference
(Triantaphyllou, 2000). Designed to reflect the way people
actually think, AHP continues to be the most highly regarded
and widely used decision-making method. AHP can
efficiently deal with tangible (i.e., objective) as well as non-
tangible (i.e., subjective) attributes, especially where the
subjective judgments of different individuals constitute an
important part of the decision process. The main procedure of
AHP using the radical root method (also called geometric
mean method) is as follows:
Step 1: Determine the objective and the evaluation attributes.
Develop a hierarchical structure with a goal or objective at the
top level, the attributes at the second level and the alternatives
at the third level.
Step 2: determine the relative importance of different
attributes with respect to the goal or objective,
 Construct a pairwise comparison matrix using a
scale of relative importance. The judgments are
entered using the fundamental scale of the analytic
hierarchy process (Saaty 1980, 2000). An attribute
compared with itself is always assigned the value 1,
so the main diagonal entries of the pairwise
comparison matrix are all 1. The numbers 2, 3, 4,
and 5 correspond to the verbal judgments ‘moderate
importance’, ‘strong importance’, ‘very strong
importance’ and ‘absolute importance’. Assuming
M attributes, the pairwise comparison of attribute i
with attribute j yields a square matrix R m∗m where
aij denotes the comparative importance of attribute i
with respect to attribute j. In the matrix, bij = 1
when I = j and rji = 1/rij .
1 ⋯ r1m
R m∗m = ⋮ ⋱ ⋮
rm1 ⋯ 1
 Find the relative normalized weight (wi ) of each
attribute by (i) calculating the geometric mean of the
i-th row, and (ii) normalizing the geometric means
of rows in the comparison matrix. This can be
represented as
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
1
m S i −S ∗
GMi = m
j=1 rij (1)
wi =
GM i
(2)
m
i=1 GM i
The geometric mean method of AHP is commonly
used to determine the relative normalized weights of
the attributes, because of its simplicity, easy
determination of the maximum Eigen value, and
reduction in inconsistency of judgments.
 Calculate matrices A3 and A4 such that A3 = A1 *
A2 and A4 = A3/A2, where A2 =
w1 , w2 , … . . , wi T .
 Determine the maximum Eigen value λmax that is
the average of matrix A4.
 Calculate the consistency index CI = (λmax −
M)/(M-1). The smaller the value of CI, the smaller
is the deviation from the consistency.
 Obtain the random index (RI) for the number of
attributes used in decision making.
 Calculate the consistency ratio CR = CI/RI. Usually,
a CR of 0.1 or less is considered as acceptable, and
it reflects an informed judgment attributable to the
knowledge of the analyst regarding the problem
under study.
4. VIKOR PROCEDURE
Multi criteria decision making (MCDM) is one of the most
prevalent methods for resolving conflict management issues
(Deng & Chan, 2011). MCDM deals with decision and
planning problems by consideration of multiple criteria and
the importance of each (Haleh & Hamidi, 2011). Among the
many MCDM methods, VIKOR is a compromise ranking
method to optimize the multi-response process (Opricovic,
1998). It uses a multi criteria ranking index derived by
comparing the closeness of each criterion to the ideal
alternative. The core concept of VIKOR is the focus on
ranking and selecting from a set of alternatives in the presence
of conflicting criteria (Opricovic, 2011). In VIKOR, the
ranking index is derived by considering both the maximum
group utility and minimum individual regret of the opponent
(Liou, Tsai, Lin, & Tzeng, 2011).
VIKOR denotes the various n alternatives asa1 , a2 ,. . ., an . For
an alternative ai , the merit of the jth aspect is represented
by fij ; that is, fij is the value of the jth criterion function for the
alternativeai , n being the number of criteria. The VIKOR
procedure is divided into the following five steps:
(1) Determine the best fj∗ and worst fj− values of all criterion
functions. If the jth criterion function represents a merit, then
fj∗ = Maxi fij , fj− = Mini fij (3)
(2) Compute the values Si and R i , i = 1,2,3,. . .,m, by the
relations
∗
n w i (f j −f ij )
Si = j=1 f ∗ −f − (4)
j j
w i (f ∗j −f ij )
R i = max (5)
f ∗j −f −
j
Where, wi is the weight of the jth criterion which expresses
their relative importance of the criteria
(3) Compute the value Qi , i = 1,2,3,...,m, by the relation
99
ISBN: 978-81-924893-0-8
R i −R ∗
Qi = v + (1-v) (6)
S − −S ∗ R − −R ∗
where S ∗ = mini Si , S − = maxi Si , R∗ = mini R i , R− = maxi R i ,
and v is the weight of the strategy of maximum group utility,
whereas (1-v) is the weight of the individual regret. Here,
when v is larger than 0.5, the index of Qi follows majority rule
(4) Rank the alternatives, sorting by the values S, R and Q, in
decreasing order.
5. PROBLEM DESCRIPTION
Profitable reuse and remanufacturing of cell phones must meet
the challenges of turbulent business environment which may
include continuously change in design pattern, falling prices
for new phone models, disassembly of unfriendly designs,
short life cycles, and prohibiting transport, labor and
machining costs in high-wage countries. Today, the
remanufacturing of expensive, long-living investment goods,
e.g. machine tools, jet fans, military equipment or automobile
engines, is extended to a large number of consumer goods
with short life cycles and relatively low values. Reuse is an
alternative to material recycling to comply with recovery rates
and quantities as well as special treatment requirements.
(Franke, 2006). The industry segment selected for this study is
Mobile Phones manufacturing industry situated in the
northern part of India. The aim of this study is to evaluate
logistics service providers for hiring their service to collect &
supply the End-of-Life (EOL) Mobile Phones to the company
door step for reclaiming the useful components for
remanufacturing of mobile phones. According to Greenpeace
report, few mobile phones having toxic materials like
polyvinyl Chloride plastic (PVC) bars, phthalates antimony
tried, beryllium oxide and Brominates Frame Retardant
(BFR).These toxic materials possess a great threat to
environment and human health if not disposed off in a proper
method. E-waste rule 2011 (Management and handling
Rules) came into effect in May 2012 in India. It places
responsibility on the producers for the entire life cycle of a
product. Under electronic waste management rules producer
(OEM) will set up collection centers to dispose of e-waste,
and make manufacturers liable for collection of electronic
waste of their products, three years since the rules were
notified most companies have failed to set up collection
centers. An old non-working mobile may fetch up anything
between Rs.200 to Rs.1000 depending on its condition A
laptop may get you a little more ; but your old fridge or a
television may not get you much primarily because of its high
transportations cost to the electronic recycling unit. This new
rule, however, may put any law–abiding citizen in a fix
because the designated centers where they are actually meant
to dispose of the e–waste have not come up in most cities. The
effective implementation of the rules looked very unlikely in
light of the present circumstances. Mostly consumers do not
know where the e-waste is to be disposed (Toxicslink).
Once the mobile phones are assembled in different production
units it has to be shipped through distributors, wholesalers,
retailers and then customers. After its end of life, consumers
do not know where the e-waste is to be disposed. As there is
no mechanism to collect e-waste from homes, it is mostly
lands in municipal bins. Generally used mobile phones are
collected at the retailers and should be quickly transported to
centralized collection center where returned mobile phones
are inspected for quality failure, sorted for potential reuse,
repair or recycling. After inspection, the useless
phones/batteries (not able to recycle) are disposed off by eco-
friendly manner and reusable components are transported to
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
disassembly/recycling plants and recovered components are
used in new phones assembly.
A series of interviews and discussion sessions was held with
the mobile phone industry managers, retailers, and state
pollution control boards officials during this project and
following problem areas are identified for improvement in
closed loop supply chain of the mobile phones.
 Uncertainty involved in supply of used mobile
phones to the OEM and industries are unable to
forecast collection of EOL mobile phones quantity.
 Though most of the e- waste generated in India is
recycled and it is done in a very hazardous manner
by informal sector.
 Presence of illegal recycling units in the state for
unauthorized mobile collection & PVC recycling
operation in business environment.
 The company is not having any well-structured
model of reverse logistics practice.
 Huge cost involved in setting of mobile collection
centers at prime locations under the new
management & handling rules, 2011, Government
of India.
To solve aforesaid problems and business performance
improvement mobile phones manufacturing industry is ready
to assign the work of regular supply of End-of-Life (EOL)
phones to logistics service provider. The team of logistics
managers must have enough knowledge to define the aims and
benefits from outsourcing of logistics service and may be able
to convince about the goal and desired objectives of the
company to the provider exactly understands what goals and
objectives the user wants to achieve. An accurate estimation
of business and service requirements of the company would
minimize the need of assumptions on the part of the provider
and ensure a high service level. Service level desired from the
logistics service providers must include both the present and
the future service standards. The problem addressed here is to
build a sound decision support methodology to evaluation &
selection of best reverse logistics service provider in the
mobile phones reverse supply chain to minimize the forward
and reverse supply chain cost comprising procurement,
production, distribution, inventory, collection, disposal, dis-
assembly and recycling cost by making a responsive supply
chain environment.
5.1 DSS for the selection of 3PL Service Provider
The developed decision support methodology requires for the
assessment of alternative logistics service providers in two
steps: (i) Initial screening of the providers by a team of
concerned managers from industry and (ii) AHP-VIKOR
based decision support system for the final evaluation of the
service providers. Often, the initial screening of the service
providers is an easy task but the final selection from the list of
short-listed providers is a tough task. In this section, we
present a methodology for the initial screening of the
providers. Later, these short-listed providers would be ranked
by the AHP-VIKOR based approach.
The various steps of decision support methodology are
enlisted as follows:
1. Constitution of a team of competitive managers &
Consultant
2. Decision regarding type of outsourcing service level
required and collection objectives
3. Development of collection and functional
specifications of the proposed task
100
ISBN: 978-81-924893-0-8
4. Identification of potential reverse logistics service
providers
5. Evaluation of request of RL logistics service
providers (RLLSP)
6. Develop request for proposal offer from 3PL reverse
logistics service providers
7. Evaluation of service proposal offer supplied by the
logistics service providers
8. Field visits and inspection of facilities of the
logistics service providers
9. Collection of feed backs from the exiting customers
of the service providers
10. Final selection using AHP-VIKOR approach and
agreement for service
AHP-VIKOR based decision modeling methodology, which
is discussed in the next section of the paper, is recommended
for the final selection of a RL service provider. For any long
term business relationship a business contract between two
parties must address scope of work, responsibilities, risks and
rewards, remedies, extra services, damages types, individual
status, termination, agreement modification, liabilities, rate
adjustments, service compensations limitations,
compensation, insurance, , performance measurement issues,
etc.
5.2 Evaluation of 3PL using AHP-VIKOR
The AHP-VIKOR based MCDM approach presented in this
work and applied in evaluation & selection of 3PL for a
mobile phones manufacturing industry. There are 20
outsourcing service providers are interested to conduct reverse
logistics operation for the case company. In the preliminary
screening the 11 service providers were rejected easily by the
company management. The final selection from the remaining
nine potential 3PRLPs (A, B, C, D, E, F, G, H and I) was very
tough task who were almost fulfill the requirement of the case
company. Due to fund limitations and other operational
constraints, the case company was keen interested to apply a
scientific technique to evaluate all eligible 3PL service
providers and determine the best 3PL service providers of the
nine bidding for the deal. The company management
identified 10 important attributes that were relevant to their
business that they deemed it necessary for the 3PL they
intended to choose. These attributes were E-Waste Storage
Capacity (EWSC), Availability of Skilled Personnel (AOSP),
Level of Noise Pollution (LNP) and Impacts of Environmental
Pollution (IEP), Safe Disposal Costs (SDC), Availability of a
Covered and Closed Area (ACCA), Possibilities to Work with
NGOs (PWNGO), Inspection/Sorting and Disassembly Costs
(ISDC), Mobile Phone Refurbishing Costs (MPRC), Mobile
Recycling Costs (MRC). Among these attributes, ISDC
(thousands of Rupees), EWSC (in tons), MPRC (INR/hour),
MRC (thousands of INR) and final disposal costs (thousands
of INR) are quantitative in nature, having absolute numerical
values. Attributes AOSP, LN P, ACCA, IEP and PWNGO
have qualitative measures and for these a ranked value
judgment on a scale of 1–5 (here 1 corresponds to lowest, 3 is
moderate and 5 corresponds to highest) has been suggested.
The cost of recycling of EOL or used mobiles phones ranges
from INR.1000 to INR.1600 per unit and INR.1200 to
INR.2000 per unit for safe disposal of hazardous waste from
mobile. A single mobile refurbishing technician can test and
troubleshoot a donated mobile, make necessary repairs and
upgrade and package it for reuse in 3 hours at a cost of on an
average INR.1500 (Techsoup, 2008). These data was provided
by various remanufacturing companies during this research
project and were used as the reference for the formulation of
reverse logistics data for the case company dealt in this paper.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The data for all 3PL with respect to various attributes are Step 1: Based upon the information provided by various
provided in Table 1.The implementation of the AHP-VIKOR concerned companies, the decision matrix has been prepared
model and analysis are explained in the Following eight steps: as shown in table 1, which illustrates the performance of s
providers with respect to all 10 attribute

Table 1. Decision matrix representing the performance of various RLSP

3PRSPs EWSC ISDC MPRC MRC SDC ACCA PWNGO AOSP LNP IEP
A 150 1600 130 1200 1400 3 4 3 4 5
B 140 1700 150 1300 1800 5 5 4 3 4
C 170 1600 180 1350 1480 4 3 5 5 5
D 180 1650 160 1500 1600 2 3 3 1 2
E 110 1500 160 1500 1400 1 3 5 2 5
F 120 1800 130 1400 1400 5 3 4 4 2
G 130 1650 150 1300 1750 3 2 4 3 5
H 120 1600 130 1550 1800 4 1 2 4 4
I 150 1100 140 1200 1650 5 2 2 4 5

Step 2: In present research project, five experts, three from the Members from industry and academia having life long
mobile manufacturing/ recycling companies and other two experience in the field of reverse logistics practices in
from academia, were consulted for making required pair-wise electronics goods industry. The pair-wise comparison matrix
comparison of attributes. Two senior executives from industry is given herewith:
were the members of the team. The team
Table 2. Pair-wise comparison of attributes
EWSC ISDC MPRC MRC SDC ACCA PWNGO AOSP LNP IEP
EWSC 1 5 4 4 1/3 4 1/2 1/5 2 3
ISDC 1/5 1 3 3 4 1/3 3 1/2 5 4
MPRC ¼ 1/3 1 ¼ 3 2 1/3 4 1/5 2
MRC ¼ ½ 4 1 4 3 1/4 4 2 1/5
SDC 3 ¼ 1/3 ¼ 1 1/5 2 1/2 3 4
ACCA ¼ 3 1/2 1/3 5 1 4 1/3 2 5
PWNGO 2 1/3 3 4 ½ ¼ 1 2 ¼ 3
AOSP 5 2 ¼ ¼ 2 3 1/2 1 3 1/5
LNP ½ 1/5 5 ½ 1/3 ½ 4 1/3 1 2

IEP 1/3 ¼ ½ 5 ¼ 1/5 1/3 5 ½ 1

The weights of the attributes computed using equation (3) is SDC = 0.08, ACCA = 0.02, PWNGO = 0.11, AOSP = 0.10,
given below LNP = 0.08 and IEP= 0.06
EWSC = 0.16, ISDC = 0.14, MPRC= 0.008, MRC = 0.11,

Step 3. The best fj∗ and worst fj− values of all criterion
functions are determined using equation (3) and given in table
3.

Table 3. Best 𝐟𝐣∗ and worst 𝐟𝐣− values

𝐟𝐣∗ 200 1800 180 1550 1800 5 5 5 5 5

101
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

𝐟𝐣− 110 1100 130 1200 1400 1 1 2 1 2

w i (f ∗j −f ij )
Step 4. Value of is calculated and given in table 4.
f ∗j −f −
j

𝐰𝐢 𝐟𝐣∗ −𝐟𝐢𝐣
Table 4. Value of ,,,,, when weights are equal
𝐟𝐣∗ −𝐟𝐣−

EWSC ISDC MPRC MRC SDC ACCA PWNGO AOSP LNP IEP
A 0.088 0.04 0.008 0.11 0.08 0.01 0.027 0.066 0.02 0
B 0.10 0.02 0.005 0.078 0 0 0 0.033 0.04 0.02
C 0.053 0.04 0 0.062 0.064 0.005 0.055 0 0 0
D 0.035 0.028 0.003 0.015 0.04 0.015 0.055 0.066 0.08 0.06
E 0.16 0.06 0.003 0.015 0.08 0.02 0.055 0 0.06 0

F 0.14 0 0.008 0.047 0.08 0 0.055 0.033 0.02 0.06

G 0.124 0.028 0.005 0.078 0.01 0.01 0.082 0.033 0.04 0
H 0 0.04 0.008 0 0 0.005 0.11 0.1 0.02 0.02
I 0.088 0.14 0.006 0.11 0.03 0 0.082 0.1 0.02 0

Step 5: Based on the Table 5, Eq. (3), Eq. (4) and Eq. (5) S ∗ = 0.279, S− =576, R∗ =0.064, R− =0.16,
values of Si , R i and Qi are obtained for each alternative, as
shown in Table 5. Here, the Qi value of each alternative is
calculated using each v value as v = 0.5.

Table 5. 𝐐𝐢 value and ranking

𝐒𝐢 𝐑𝐢 𝐐𝐢 Rank
A 0.449 0.11 0.52 5
B 0.296 0.1 0.216 2
C 0.279 0.064 0 1
D 0.397 0.08 0.281 4
E 0.453 0.16 0.793 8
F 0.443 0.14 0.672 7
G 0.41 0.124 0.532 6

H 0.303 0.11 0.274 3

I 0.576 0.14 0.896 9

Step 6: On the basis of the Qi values, the case company can
be ranked and choose 3PL for their operations. Raking of 3PL
is C-B-H-D-A-G-F-E-I in the decreasing order of preference
as shown in table 5.
6. CONCLUSIONS & FUTURE SCOPE
The VIKOR method was developed as a MCDM method to
determine the preference ranking from a set of alternatives in
the presence of conflicting criteria. The obtained compromise
solution could be accepted by the decision makers because it
provides a maximum group utility for the ‘‘majority’’ and a
minimum individual regret for the ‘‘opponent’’. In this paper,
we have studied the use of AHP operators in the VIKOR
method and developed an integrated AHP-VIKOR method to
solve multi-criteria problems with conflicting and non-
commensurable criteria, specifically considering the complex
attitudinal character of the decision maker. In the present
work, the results from mobile phones case study indicate that

102
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3PL service provider ‘C’ is the first choice for the case
company. An analysis of data provided by 3PL service
provider ‘C’ reveals that the logistics firm ‘C’ has been take
care about environmental aspects like proper disposal of end
of life and used products. Results indicates that logistics firm
‘C’ have scored high values on almost all quantitative
attributes as compared to other logistics service providers.
Day by day environmental issues are gaining more importance
in Indian business environment. So, most important
managerial implication of the developed model is that only the
firms who are dealing with environmental issues significantly
will get success in competitive business environment. The
proposed hybrid model in the present research has find out
several significant attributes for evaluation of logistics firms
for conduct of reverse logistics operation with respect to
mobile phones manufacturing companies. This may provide
support to management and consultants for making strategic
decisions like selection of logistics firm, selection of new
plant site, selection of business partner in competitive
business environment. In the present work 10 relevant
attributes has been identified for evaluation and selection of
3PL service provider for reverse logistics operation for the
mobile phone manufacturing industry. The developed model
provide flexibility in accommodating new attributes according
to industry needs time to time for sound decision making.
In future research, a comparative study may be conducted by
using other multi-criteria decision-making methods to validate
the results obtained by present method. An analytic network
process (ANP) approach may be used for consideration the
interactions between attributes and the results could be
compared by using interpretive structural modeling (ISM)
based approach. Matlab version 11 has been used for
calculation purpose in this work. Customized software may be
developed to reduce computational speed and simplification
of calculations.
REFERENCES
[1] Chen, L. Y., & Wang, T.-C. (2009). optimizing
partners’ choice in IS/IT outsourcing Projects: The
strategic decision of fuzzy VIKOR. International
Journal of Production Economics, 120, 233–242.
[2] Efendigil, T., Önüt, S. and Kongar, E. (2008) ‘A
holistic approach for selecting a third-party reverse
logistics provider in the presence of vagueness’,
Computers and Industrial Engineering, Vol. 54, pp.
269–287.
103
ISBN: 978-81-924893-0-8
[3] J.M. Merigó, Fuzzy multi-person decision making
with fuzzy probabilistic aggregation operators, Int.
J. Fuzzy Syst. 13 (2011) 163–174.
[4] Kaya, T., Kahraman, C. (2011), ‘Fuzzy multiple
criteria forestry decision making based on an
integrated VIKOR and AHP approach’, Expert
Systems with Applications 38 (2011) 7326–7333.
[5] Kaya, T., Kahraman, C., (2010). Multicriteria
renewable energy planning using an integrated
fuzzy VIKOR & AHP methodology: The case of
Istanbul. Energy, (pp.1–11),
doi:10.1016/j.energy.2010.02.051.
[6] Liou, J. J. H., Tsai, C.-Y., Lin, R.-H., & Tzeng, G.-
H. (2010). A modified VIKOR multiple criteria
decision method for improving domestic airlines
service quality. Journal of Air Transport
Management, 1–5.
doi:10.1016/j.jairtraman.2010.03.004.
[7] Opricovic, S. (2011), ‘Fuzzy VIKOR with an
application to water resources planning’, Expert
Systems with Applications 38 (2011) 12983–12990.
[8] Opricovic, S., Tzeng, G. H. (2007), ‘Extended
VIKOR method in comparison with outranking
methods’, European Journal of Operational
Research 178 (2007) 514–529.
[9] Sanayei, A., Mousavi, S. F., & Yazdankhah, A.
(2010). Group decision making process for supplier
selection with VIKOR under fuzzy environment.
Expert Systems with Applications, 37, 24–30.
[10] Sanayei, A., Mousavi, S. F., Yazdankhah, A.,
(2010), ‘Group decision making process for supplier
selection with VIKOR under fuzzy environment’,
Expert Systems with Applications 37 (2010) 24–30.
[11] Sayadi, M. K., Heydari, M., & Shahanaghi, K.
(2009). Extension of VIKOR method for Decision
making problem with interval numbers. Applied
Mathematical Modeling, 33, 2257–2262.
[12] Suyabatmaz, A. C., Altekin, F. T., Sahin. G. (2014),
‘Hybrid simulation-analytical modelling approaches
for the reverse logistics network design of a third-
party logistics provider’, Computers & Industrial
Engineering, ISSN: 1984-3046, Vol. 7, No. 2, pp.37
– 58.
[13] W.E. Yang, J.Q. Wang, X.F. Wang, An outranking
method for multi-criteria decision making with
duplex linguistic information, Fuzzy Set Syst. 198
(2012) 20–33.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Appendix 1

Environmental Legislations

Reverse logistics implementation

Execute RL Activities internally Outsource RL activities

Select the most appropriate 3PRLP

Multi criteria Decision Aid

Identify the Assign Identify the

DM’s weights to set of criteria
Rationality criteria

Decision Making Evaluate and Analyze Identify 3PRLP

3PRLP

MCDA METHODS

Figure 1. Adapted and modified from Guarnieri, P. et. al (2014)

104
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Comparison of Different Types of Microstrip Patch
Antennas
Sumanpreet Kaur Sidhu
Yadavindra College of Engineering
Guru Kashi Campus Punjabi University
Talwandi Sabo, Punjab, India
ersumansidhu@gmail.com
ABSTRACT
In this paper, microstrip patch antennas with six different
shapes i.e. rectangular, circular, square, elliptical, pentagonal
and hexagonal are implemented using Ansoft HFSS version
13.0.0 software. Antennas are designed on Rogers RT/duroid
5880 material with dielectric constant 2.2 and thickness 3.2
mm. The different performance parameters such as return
loss, gain and bandwidth of these antennas are compared. The
operating frequency for all these antennas is taken 7.5 GHz.
All the antennas are fed with the probe feed. It is found that
pentagonal microstrip patch antenna has better results at this
frequency than all other shapes.
Keywords
Microstrip; Patch; Antenna; gain; return; loss; bandwidth.
1. INTRODUCTION
Wireless technology provides less expensive alternative and a
flexible way for communication. Antenna is one of the
important elements of the wireless communications systems.
According to the IEEE Standard Definitions, the antenna or
aerial is defined as “a means of radiating or receiving radio
waves" [1]. In other words, antennas act as an interface for
electromagnetic energy, propagating between free space and
guided medium.
Microstrip patch antennas are widely used in the microwave
frequency region because of their simplicity and compatibility
with printed-circuit technology, making them easy to
manufacture either as stand-alone elements or as elements of
arrays. The advantages of microstrip antennas make them
suitable for various applications like, vehicle based satellite
link antennas [2], global positioning systems (GPS) [3], radar
for missiles and telemetry [2] and mobile handheld radios or
communication devices [3]. In its simplest form a microstrip
patch antenna consists of a patch of metal, generally
rectangular or circular (though other shapes are sometimes
used) on top of a grounded substrate [9] as shown in fig 1.
Fig 1: Microstrip patch antenna [1]
105
ISBN: 978-81-924893-0-8
Jagtar Singh Sivia
Yadavindra College of Engineering
Guru Kashi Campus Punjabi University
Talwandi Sabo, Punjab India
jagtarsivian@yahoo.com
The commonly available shapes of patch antenna are
rectangular, circular, dipole, triangular, square and elliptical
with rectangular and circular shapes the most common. The
various shapes are illustrated in fig 2.
Rectangle Triangle Circular Ring Dipole
Circle Square Ellipse
Fig 2: Common available shapes of microstrip
patch antenna
Basically there are four feeding techniques available to us
while designing of antenna. These are line feed [5], probe feed
[1 and 8], aperture coupled feed [4] and proximity coupled
feed [6]. The feed that is used here is probe feed (or coaxial
feed). The antenna array is designed using standard equations
and simulated by professional software called, High
Frequency Structural Simulator (HFSS). It proves to be the
tool for analyzing the working of any antenna [7]. Before
designing of any antenna, its working and simulation is
checked by this software such that any kind of change if
required could be made.
2. DESIGNING OF ANTENNAS
The designing of the microstrip antennas with circular,
rectangular, elliptical, pentagonal, hexagonal and square patch
is done with HFSS software [7]. The position and dimensions
of the substrate is kept constant throughout. The dimensions
of substrate are as follows.
Position: -50, -45, 0
XSize: 100 YSize: 90 ZSize: 3.2
The radius of circular patch is taken 30 mm. For the
rectangular patch the length is 60 mm and breadth is 50 mm.
The elliptical patch has major axis with radius 20 mm and
minor axis with 10 mm. Pentagonal, hexagonal and square
patches are designed with 44.36 mm, 35 mm and 60 mm side
respectively. All of these shapes are illustrated in fig 3.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

After designing of various patches the simulation is carried in terms of performance parameters such as return loss, gain
out and the performance parameters such as return loss, gain and bandwidth are shown in the table 1.
and bandwidth are found. These results are then compared to
find the best of these microstrip antennas.

Center Position: 0, -10, 3.2 Length: 60 mm, Breadth: 50 mm Center Position: -3, -3, 3.2
Major Radius: 20mm
Radius: 30mm Position: -20, -30, 3.2
Ratio: 2
(a) (b) (c)

Center Position: 2, 5, 3.2 Center Position: 0, -5, 3.2

Center Position: -30, -30, 3.2
Start Position: -30, -15, 3.2 Start Position: 0, 30, 3.2
Side: 44.36mm Size: 60 mm
Side: 35mm

(d) (e) (f)

Fig 3: Microstrip Antenna with (a) Circular patch (b) Rectangular patch

(c) Elliptical patch (d) Pentagonal patch (e) Hexagonal patch (f) Square patch

3. RESULTS AND DISCUSSION

Results of microstrip patch antennas with rectangular,
circular, square, elliptical, pentagonal and hexagonal patches

106
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1: Comparison of various performance parameters of different patches of microstrip antenna

S. No. Shape of Patch Return loss vs. Gain Lower cut off Higher cut off Bandwidth
frequency (dB) frequency frequency (GHz)
(GHz) (GHz)

Circle
1. -16.50 8.1756 6.80 7.43 0.63
(Radius: 30)
Rectangular
2. -19 6.7619 7.33 8.47 1.14
(60, 50, 0)
Ellipse
3. -25 7.2326 6.90 7.96 1.06
(Major Axis:20, Ratio:2)
Pentagon
3. -23 9.0943 7.30 8.54 1.24
(Side: 44.36mm)

Hexagon
4. -22 7.4406 7.30 8.52 1.22
(Side: 35mm)

Square
6. -21 8.2799 6.53 7.45 0.92
(60, 60, 0)

From the table it is clear that at the operating frequency of 7.5
GHz the minimum return loss [1] is found in case of elliptical
patch with -25dB. At the same time the gain [1] is found
maximum in case of pentagonal microstrip patch antenna with
a value 9.0943 dB.
The bandwidth [1] when observed is found maximum in
pentagonal microstrip patch antenna with a value of 1.24
GHz. Also the return loss of pentagonal patch is comparable
with elliptical patch. Hence the best results are obtained with
pentagonal microstrip patch antenna.

Fig 4: Return loss vs. frequency and 3D Radiation Pattern of circular microstrip patch antenna

Fig 5: Return loss vs. frequency and 3D Radiation Pattern of rectangular microstrip patch antenna

107
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The graphs for return loss vs. frequency and 3D Radiation The fig 4 illustrates return loss vs. frequency and 3D
pattern of the six different microstrip patch antennas are Radiation pattern of circular microstrip patch antenna.
illustrated in fig 4,5,6,7,8 and 9.

Fig 6: Return loss vs. frequency and 3D Radiation Pattern of elliptical microstrip patch antenna

Fig 7: Return loss vs. frequency and 3D Radiation Pattern of pentagonal microstrip patch antenna

Fig 8: Return loss vs. frequency and 3D Radiation Pattern of hexagonal microstrip patch antenna

Fig 9: Return loss vs. frequency and 3D Radiation Pattern of square microstrip patch antenna
108
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The return loss vs. frequency and 3D Radiation patterns of
rectangular patch, elliptical patch, pentagonal patch,
hexagonal patch and square patch microstrip antennas are
shown in fig 5,6,7,8 and 9 respectively.
4. CONCLUSION
From the simulation analysis of the rectangular, circular,
square, elliptical, pentagonal and hexagonal microstrip patch
antennas it is observed that at 7.5 GHz of operating frequency
the pentagonal patch antenna gave the best results with a gain
of 9.09943 dB and bandwidth of 1.24 GHz.
REFERENCES
[1] Constantine, A. Balanis , “Antenna Theory Analysis and
Design” 2nd Edition ,Wiley India (p.) Ltd., 2007.
[2] Mailloux, R.J., et al, “microstrip antenna technology”,
IEEE Trans. Antennas and Propagation, Vol. AP-29,
January 1981, pp.2-24.
109
ISBN: 978-81-924893-0-8
[3] James, R.J., et al, “Some recent developments in
microstrip antenna design”, IEEE Trans. Antennas and
Propagation, Vol.AP-29, January 1981, pp.124-128.
[4] Pozar, M. and S.D. Targonski, “Improved Coupling for
Aperture Coupled Microstrip Antennas,” Electronics
Letters, Vol.27, No.13, 1991, pp.1129-1131.
[5] Lee, H. F., Chen, W., “Advances in Microstrip and
Printed Antennas, New York”, John Wiley & Sons,
1997.
[6] Pozar, D.M. and Kauffman, B., “Increasing the
bandwidth of microstrip antenna by proximity coupling,”
Electronics Letters, Vol. 23, No.8, 1987 , pp. 368-369.
[7] Ansoft HFSS version 9: Overview, 2003.
[8] Chen, J. S. and Wong, K. L., “A single-layer dual-
frequency rectangular microstrip patch antenna using a
single probe feed” Microwave Opt. Technol. Lett., vol.
11, pp. 83-84, Feb.5, 1996.
[9] 6x9 Handbook / Antenna Engineering Handbook /
Volakis / 147574-5 / Chapter 7
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Artificial Vision towards Creating the Joys of Seeing

For the Blind

Aastha Virpal Kaur Anjali Gulati

BGIET Sangrur BGIET Sangrur Chitkara Uni., Rajpura
bansalaastha4140@gmail.com

ABSTRACT Landmark location and identification information.

Information enabling self- familiarization and, mental
In 1929, it was discovered that stimulating the visual mapping of an environment.
cortex of an individual led to the perception of the spots of
light, known as phosphenes. The aim of artificial human Most existing mobility aids for the blind provide
vision systems is o attempt to utilize the perception of information in either tactile or auditory form.
phosphenes to provide a useful substitute for normal
vision. Currently, four locations for electrical stimulation
are being investigated; behind the retina (The Bionic Eye); 2. EXISTING TECHNOLOGIES AND
in front of the retina (Cortical Implant); the optic nerve and
the visual cortex. This review discusses artificial human
METHODOLOGIES- Artificial vision system is
being studied worldwide. There are many types of artificial
vision technology and requirements. [6]
vision systems being proposed.
The basic concept of artificial vision system is-
1. INTRODUCTION- “Electrically stimulating nerve tissues associated with
vision help to transmit electrical signals with visual
Blindness- In 1997, the World Health Organization information to the brain through intact neutral
estimated that there were close to 150 million individuals networks.”[9] Many systems are being proposed because
with significant visual disability worldwide. In of its potential for the development of various types
economically, developed societies, the leading cause of devices with existing technologies. These take into
blindness and visual disabilities in adult are diabetic consideration about the patient condition, nerve tissues that
retinopathy.[7] In general, more than two thirds of today’s subject to stimulation and their role in the visual network.
blindness could be prevented or treated by applying This review discusses the system being researched and
existing knowledge and technology. Nearby half of all developed these days. These devices mainly use electrodes
blindness is due o cataract and a quarter of the world’s and tissues targeted foe electrical stimulation.[10] Totally
blindness is due to trachoma. Other major causes of implantable system with all the functions however is not
blindness are glaucoma, trachoma, onchocerciasis, and develops yet with the present technology for any type of
exophthalmia.[8] system. Systems being used nowadays are electrodes
implanted in the body, which work with several devices
worn outside the body.
Blind Mobility- Blind Mobility is affected by physical and
mental health factors, such as multiple disabilities. Age is a
mobility issue as many of blind are elderly, which can
restrict their ability to use some mobility aids. Many
congenitally blind children have hypotonia or abnormally
low muscle tone which can affect mobility. [10]
Main techniques used under this technology nowadays are
mentioned below:
 Artificial human vision for blind by connecting
a television camera to the visual cortex
 The Bionic Eye
 Cortical Implant
Figure 1. The Visual Pathway
 Optic Nerve Implant
In 1996, the US Research Council gave the following
summary for the blind [11]: The main techniques used under this technology are
discussed in detail here one by one:
Detection of obstacles in the travel path from ground level
to head height for the full body width..Travel surface 2.1. Artificial vision for blind by
information. Detection of objects bordering the travel path. connecting a television camera to the
Distant object and cardinal direction information
visual cortex:

110
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
This new visual prosthesis produces black and white
display of visual cortex “phosphenes”. The system was
primarily designed to promote independent mobility, not
reading. A battery has been provided for the electronic
interface hat is RF isolated from line currents for safety.
This permits the volunteer to directly watch television and
use a computer, including access to the internet. Because
of their potential importance for education , and to help
integrate blind people into the workplace, such television,
computer, and internet capabilities may prove even more
valuable in the future than independent mobility. This
system can also store the past time conditioning which can
be viewed by the volunteer through an RF link to remote
videotape recorder and viewing screen. Therefore, this
system allows real-time monitoring camera, as well as
post-trial analysis, by the volunteer.[2]
The television camera, which is built into a pair of
sunglasses (Fig-2), the prosthesis, as worn by the blind
volunteer (Fig-3) and complete system, is described
schematically , including both the
television/computer/Internet interface and the remote
Video Screen/VCR monitor.[2]
Figure 2. Blind volunteer with sub-miniature TV
camera mounted on the right lens of his sunglasses, and
the laser-pointer (position monitor) on the left temple
piece.
Figure 3. The complete artificial vision system showing
the computer and electronics package on the belt with
output cable to the electrodes on the brain.
2.2 The Bionic Eye:-
This article talks about the first bionic eye implant on
Dianne Ashworth a 54 year old blind women. After the
implantation she recalls seeing flashes, shapes and light
111
ISBN: 978-81-924893-0-8
after the surgery. By using the information given by ms
Ashworth’s implant, certain research is done on how to
make it exactly like a proper, working eye. Bionic eye is
visually a prosthetic one which helps people with optic
impairment se. [1]
Main constituents of bionic eye:-
Camera which is attached to a pair of glass which makes
high frequency radio signals.
A microchip inserted into the retina. The signals get turned
into electrical impulses by electrodes in the chip. This
replaces the cells in retina which are connected to optic
nerve.[3]
These impulses are transferred through optic nerve to brain
thus; it is interpreted into a picture. The invention is
predicted to be most beneficial to those with macular
degeneration- damage to the macula which is central part
of retina where light is focused and changed into nerve
signals in the brain. Scientists hope to develop an eye that
has anywhere from 50 to 100 electrodes. [1] Which would
allow the patients to see a much more complete visual
image? While the image would undoubtedly still look hazy
and unclear to the seeing person this is considered an
enormous leap forward currently, the eyes allows people to
do things such as find their way through a building, find a
door or window and avoid obstacles that might be in their
path.[4]
Figure 3. The Bionic Eye Implant [5]
2.3 Cortical Implant:-
This system stimulates the visual cortex in the brain
responsible for vision with electrode arrays. This visual
cortex is located at lower back section of head that bulges
out slightly. The brain is the only final destination of the
visual information network. [6]
The main challenges for this stimulation approach are
there is lot of risks involved during and after surgery and
other safety issues.
FIGURE 4. The Cortical Implant [5]
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[8] World Health Organisation, 1997, Blindness and

2.4 Optic Nerve Implant:-
This system composed of a bundle of nerve fibers from
retinal output cells called retinal ganglion cells (RGC’s).
Bundle exists from the eye and is connected to nerve cells
in the brain. Artificial vision system with electrode array
having embedded electrons in a film substrate is wrapped
around optic nerves from outside as well as a type
stimulating optic Nerves head with wire electrodes are
being proposed. This is considered a feasible method. [7]
Visual Disability: seeing ahead-projections into net
century
[8] World Health Organization, 1999, Blindness and visual
disability: other leading causes worldwide.
[9] Chawla H., 1981, Essential Ophthalmology.
[10] World health organization factsheet, 1997, blindness
and visual disability: socioeconomic aspects.
[11] Blasch BB, Weiner WR, 1997, Foundations of
orientation and mobility

Figure 5. The Optic Nerve Implant [5]

3. KEY ISSUES-
Artificial human vision (AHV) involves the electrical
stimulation of a component of the human visual system,
which may invoke the perception of a phosphenes or point
of light. Four locations for AHV implant are currently
utilized; subretinal, epiretinal, optic nerve and the visual
cortex (using intra- and surface electrodes).[9] The only
commercially available system is the cortical surface
stimulation device from the Dobelle Institute. The most
impressive gains in vision have been reported from the
subretinal device developed by the Opt bionics Corp.,
however, these results may not be related to the Micro
photodiode device used. Psychophysical and mobility
assessment standards would help in comparing AHV
systems with other technical aids for the blind. [10]

REFERENCES
[1] Sarah Irvine Belson, The Special Ed wiki, Bionic Eye
[2] Wm.H.Dobelle, ASAIO Journal 2000, Artificial Vision
for the Blind by Connecting a Television
Camera to the Visual Cortex
[3] Bridie Smith, 2014, Vision for high-performance
bionic eye jeopardized by lack of funds
[4] Terasawa, Y.; Osawa, K.; Tashiro, H.; Noda, T.; Ohta,
J.; Fujikado, 2013, Engineering Aspects of Retinal
Prosthesis by Suprachoroidal Transretinal Stimulation
[5] Terasawa, Y.; Ozawa, M.; Ohta, J.; Tano, Y. 2008,
Bulk Micromachining-based Multielectrode Array for
Retinal Prostheses
[6] Jason Dowling, 2005, Artificial Human vision
[7] Agnew WF,
McCreery DB (Eds). Prentice Hall, NJ, 1990, Neural
Prethesis: Fundamental studies

112
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Review: Nanotechnology
Sonali Tyagi Savaljeet Kaur
BGIET, Sangrur BGIET, Sangrur
savaljeet999@gmail.com
ABSTRACT: - Nanotechnology is the development
of engineering devices in nanometer range. Within the next
few decades, a vast manufacturing will be made possible
by nanotechnology. The purpose of this paper is to look
into the present and future aspects of nanotechnogy. The
paper gives the brief description of what is
nanotechnology..?? It’s uses and its applications in various
fields.[2]
KEYWORDS:- MIT- Massachusetts Institute Of
Technology, DNA- Deoxyribo Nucleic Acid, NM- Nano
Meter.
1. INTRODUCTION:-
Nanoscience is concerned with the production,
characteristics and design of material having atleast one
spatial dimension in the size range of 1-100 nanometre.
Nanotechnology is the study of devices, products and
process based upon individual or multiple integrated
nanoscale components. [1]
An exciting but challenging aspect of nanosc,ience is that
matter acts differently when particle are nanosized. This
means that many macro level concepts of physics cannot
be applied to understand nanoscience. [1] For example we
cannot apply principle of classical physics which are
otherwise applicable to motion of macro sized objects. At
nanoscale level we have to apply quantum mechanical
description. [2]
2. PROPERTIES OF
NANOPARTICLES
The properties of a substance are usually measured by
taking large sample volume. However when these
properties were checked for same material at nanoscale
level then large difference were observed in many physical
properties. This implies that at nanoscale level, physical
properties become sized dependent. [1]
2.1 Optical properties: - Such as colour and
transparency are observed to change at nanoscale level.
For example Gold in bulk appears to be yellow in colour
while nanosized gold appears red in colour. The main
reason for change in optical properties at nanoscale level is
that nanoparticles are so small that electros in them are not
as freer to move as in case of bulk material. Because of
this restricted moment of electrons, Nanoparticles reacted
differently with light as compared to bulk material. [1]
2.2 Electrical properties: - It is also observed to
change at nanoscale level. These properties include
conductivity, resistivity of a material. For example in case
of carbon nanotube conductivity changes with the
changing diameter or area of cross section. Carbon
nanotubes can be conducting or semiconducting while
graphite is a good conductor of electricity.[3]
113
ISBN: 978-81-924893-0-8
Shilpa Rani
BGIET, Sangrur
2.3 Mechanical properties:-It is observed that
physical properties like strength, melting point also change
at nanoscale level. For example bulk steel has highest
strength then graphite. At nanoscale level cylinder of
carbon are 100 times stronger than steel and are very
flexible.[9]
2.4 Chemical properties:- The percentage of
surface items in nanoparticles is larges compared with bulk
objects, thus reactivities of nonmaterial are more than bulk
material.[10]
2.5 Magnetic Properties:-These properties also
show drastic change in nanoparticle due to surface effects
in maganetic interactions.
3. HISTORY
The history of nanotechnology tells the development of the
concepts and experimental work falling under the broad
category of nanotechnology.
In 1959, Feynman gives after-dinner talk describing
molecular machines building with atomic precision. In
1974, Taniguchi uses term "nano-technology" in paper on
ion-sputter machining followed by it in year 1977; Drexler
originates molecular nanotechnology concepts at MIT. In
the year 1981, First technical paper on molecular
engineering to build with atomic precision. In year 1986,
First book published First organization formed. By the
time in year 1990, Japan's STA begins funding nanotech
projects followed by it in the year of 1997 First company
founded: Zyvex First design of nanorobotic system was
proposed . By the year1998 First DNA-based
nanomechanical device was designed. The year 2001, was
stated with the First report on nanotech industry U.S.
announces first centre for military applications. 2003
Congressional implications hearings were introduced. 2006
National Academies nanotechnology report calls for
experimentation toward molecular manufacturing and start
implementing it. Technology Roadmap was released for
Productive Nanosystems in the year 2008. 2009 year came
up with anew height to the nanotechnology that gave us an
improved walking DNA nanorobot. By the year 2011 First
programmable nanowire circuits for nanoprocessors was
discovered.[7]
4. USES
Nanotechnology is used to make the material effectively
stronger, lighter, more durable, more reactive or better
electrical conductors. It benefits us as it is possible to tailor
the essential structures of materials at the nanoscale to
achieve specific properties. Some of its important uses
are:-
4.1 Carbon Nano tubes: - These are the sheets of
graphite rolled upto make a tube that is carbon
macromolecules in cylindrical form. The nanotube
dimensions are variable and can be as small as 0.4nm in
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
diameter. The carbon-carbon bonds are sp2 hybridised due
to this carbon nanotube has extra strength.[5]
4.2 Nanofilms: - It is an assembly of quantum dot
layers with gradient of nanoparticle size, composition or
density. Nanofilms are used to protect or treat the surfaces
in eyeglasses, computers and cameras.
4.3 Nanoscale Transistors: - These are the
advanced design reduced size transistors. These transistors
minimized the leakage of current when the device is in the
off state. In nanoscale transistors voltage of operation can
be reduced without lose of performance which leads to less
power dissipation per-operation.[4]
4.4 Water Treatment: - Nanotechnology offers
the potential of nanomaterials for the treatment of
contaminated surface water, ground water and waste water
which is due to micro organism and toxic metal ions.
4.5 Antimicrobial Bandages: - An antibacterial
bandage using nanoparticles of silver ion is created by Sir
Robert Burrell which is very useful nowadays. These silver
ions suppress the cellular respiration of microbes and kill
them.[5]
4.6 Scratch-resistant coatings:-These types of
coating are commonly used in everything from carts to
eyeglasses. It has been discovered that Scratch-resistant
coatings can become more effective by adding aluminium
silicate nanoparticles which increase the resistance to
chipping and scratching.
4.7 Clothing: - A thin layer of zinc oxide
nanoparticles are used to coat fabrics of clothes which
gives better protection from ultraviolet radiations.
Nanoparticles in the form of hair or whiskers helps in repel
water and make the clothe stain resistant. [8]
Everyday new products such as wrinkle resistance
cosmetics, liquid crystal display (LCD) are coming in the
market using the process of nanotechnology. There are
also many other uses of nanotechnology rather than the
above discussed.
5. APPLICATIONS
Nanotechnology is not strucked to any particular field.
These technologies are very vast and have many
applications in various fields. Some of the fields are
described below:-
5.1 Medicine: - The application of Nanotechnology
in the field of medicine is to detect and treat damage to the
human body and disease.[4]
5.1.1 Drug Delivery:- It is a technique which
reduces damage to healthy cells and allows earlier
detection of disease. In drug delivery technique particles
are engineered so that they are attracted to diseased cells,
which allow direct treatment of disease.
5.1.2 Therapy Techniques:- Nanosponges have
been developed which absorb toxin and remove them from
blood stream. Nanosponges are polymer nanoparticles
which are coated by red blood cell membrane. Breast
cancer tumours can be destroyed using targeted heat
therapy. Nanotubes absorb infrared light from laser and
produces heat that burns the tumour. [6]
114
ISBN: 978-81-924893-0-8
5.1.3 Diagnostic Techniques: - to monitor the level of
nitric oxide in the blood stream sensors have been
developed using carbon nano tubes embedded in a gel. As
the nanoparticles are attached to molecules in the blood
stream it indicates the start of an infection. When the
sample is scanned for scattering the nanoparticles,
RAMAN signal is enhanced which allow detection of
molecules and indicates infectious disease at a very early
stage.
5.2 Electronics: - Nanotechnology holds many
applications in the field of electronics or nanoelectronics.
It increases the efficiency of electronic devices and reduces
their weight and power consumption. [7]
5.2.1 Flexible Circuits:- We are aiming for a
combination of flexibility, a process of fabrication and less
power requirements using cadmium selenide nanocrystals.
5.3 Silver Nanoparticle Ink: - It is used to form
conductive lines needed for circuit boards. It is a method to
print prototype circuit boards using inkjet printers.[8]
5.4 Nanowires:-The electrodes made from nanowires
enable flat panel displays to be flexible and thinner than
current flat panel displays. The semiconductor nanowires
are used to built transistors and integrated circuits.
5.5 Food:-The importance of nanotechnology is not
less in food science. Some nanomaterials are developed
that will effect not only the taste of food but also food
safety and the health benefits that the food delivers.
5.6 Silver Nanoparticles:- With the help of these
nanoparticles the storage bins are being produces
embedded in the plastics. It kills the bacteria and
minimizes the health risks.
5.6.1 Clay Nanocomposites:- In light weight
bottles, cartons and packaging films clay nanocomposites
are used to provide an impermeable barrier to gases like
oxygen and carbon dioxide.
5.6.2 Zincoxide Nanoparticles:- The strength
and stability of the plastic film used for packaging can be
improved using zinc oxide nano particles. It blocks
Ultraviolet rays and provide anti bacterial protection.
5.7 Battery:-Nanotechnology reduces the possibility
of batteries catching fire, increase the available power
from a battery and decrease the time required to recharge
the battery.
5.7.1 Nitrogen-Doped CNT Catalyst: - This
type of catalyst is used in lithium air batteries to store upto
10 times as much energy as lithium ion batteries.
5.7.2 Lithium Ion Battery:-In this type of battery
silicon nanoparticles are used in the anode of battery that
can recharge battery within 10minutes.[10]
5.7.3 Nanotubes on grapheme:- The electrodes
made from these have very high surface area and very low
electrical resistance.
The application of nanotechnology are also in other fields
such as fuel cells, solar cells, space, fuels, better air
quality, cleaner water, fabric and chemical sensors.[8]
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
REFERENCES
[1] Randhir Singh, book name: Interactive physics
[2] Debnath Bhattacharya, shashank Singh, Niraj
Satnalika, 2009, Nanotechnology, Big Things From a Tiny
World: A Review.
[3] Handbook on Nanoscience, Engineeering and
Technology, 2nd Ed., Taylor and Francis, 2007.
[4] Nanotechnology: A Brief Literature Review M.Ellin
Doyle, Ph.D Food Research Institute, University of
Wisconsin–Madison, Madison, WI 53706.
[5] Laura Wright. “Nanotech Safety: More on How Little
We Know” , OnEarth Magazine, December 12, 2007.
115
ISBN: 978-81-924893-0-8
[6] Chris Phoenix and Mike Treder, “Safe Utilization Of
Advanced Nanotechnology”, Center for Responsible
Nanotechnology (CRN), January 2003, Revised on
December 2003. http://www.crnano.org/safe.htm
[7] Research Strategies for Safety Evaluation of
Nanomaterials, Part IV: Risk Assessment of Nanoparticles.
[8] Jui-Ming Yeh, Shir-Joe Liou, Chih-GuangLin, Yen-Po
Chang, Yuan-
Hsiang Yu, Chi-Feng Cheng, J. Appl. Polym. Sci. 2004
[9] S. Girand, S. Bourbigot, M. Rochery,I. Vroman, L.
Tighzert, R.
Delobel, Polym.Degrad. Stab. 2002,
[10] F.A.P. Thomas, J.A.W. Stoks, A. Buegman,US Patent
6291054,September 18, 2001.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Review: 5G Technology
Varinder Bansal Gursimrat Singh
BGIET Sangrur BGIET Sangrur
ABSTRACT- This review gives you the complete
information about what is being used and what new
technologies’ are being added to the existing technology
for future reference and what can further it be implicated
in the technology we are reviewing by this paper. The
viewer will get all the history information about the
generations being used before about their speed standards
and bandwidths and the other required conditions for this
to be.
Keywords- 1G-First Generation
MBPS-Mega Bite Per Second
FDMA- Frequency Divison Multiple Access
1. INTRODUCTION
Mobile and wireless network have developed very much
now a day. It was firstly introduced in 1877 and was based
on AM schemes. It is limited up to some systems only. But
due to increasing needs new systems were developed
during World War II and due to development of FM radio
communication. At present we are using mainly 2.5G and
3G networks. They have very limited access. We need a
fast wireless network to maintain today’s needs. 5G
Technology that stands for 5th Generation Mobile
technology is proposed after the network history of 1G,
2G, 2.5G, 3G and 4G.5G technology may change all the
present network technologies. There is wide range of
communication with very high speed and bandwidth. The
5G terminals consist of new security techniques and error
control systems. 5G wireless uses OFDM and millimeter
wireless that enables data rate of 20 mbps and frequency
band of 2-8 GHz. The 5G communication is capable of
supporting wireless World Wide Web (wwww). This
review gives the concept of intelligent internet phone
where, the mobile can prefer the finest connection.
Historical Prospective
a) 1G -This network design began in 1970 in Bell’s
laboratory and was implemented in 1984. The services
under this network are analog voice communication.
The band width provided for this network is 1.9kbps.
The multiplexing technique is FDMA. The core
network is PSTN.
b) 2G -The beginning of this network takes place in 1980
and implemented in 1991. The services provided by
this are digital voice communication. The bandwidth of
this network is 14.4kbps. The multiplexing techniques
are TDMA, CDMA. The core network is PSTN.
c) 2.5G -This network began in the mid of 1985 and
implemented in 1999. The services provided by this
network are higher capacity, packetized data. The
bandwidth for this is 384kbps. The multiplexing
techniques are TDMA, CDMA. The core network is
PSTN, Packet Network.
d) 3G -The network began in 1990 and implemented in
2002. The services under this network are higher
116
ISBN: 978-81-924893-0-8
Vipin Bansal
BGIET Sangrur
capacity broadband data up to 2mbps. The bandwidth
is 2mbps. The multiplexing technique is CDMA. The
core network is Packet Network.
e) 4G -The beginning of this network takes place in 2000
and implemented in 2010. The services under this
network is completely IP based, speed up to hundreds
MBs. The bandwidth is 200mbps. The multiplexing
technique is CDMA. The core network is Internet.
2. ADVANCEMENT FROM 4G
a) Multi Mode User Terminals -The 4G technology is
based on single station single user operated system but
5G is a single station multi operated system. This is the
major achievement of this technology.
b) Security -Security level increases in this technology.
Reconfigurable and lightweight protection mechanisms
are designed.
c) Data Encryption -There is data encryption technique in
this technology. Due to this it is difficult to encrypt the
data from the transmitter to receiver.
d) A Super-Efficient Mobile Network -It delivers a better
performing network for lower investment cost. It
addresses the mobile network operates need at unit cost
of data transport falling at roughly the same rate as the
volume of data demand is rising.
e) A Converged Fiber-Wireless Network -This uses
wireless Internet access having bandwidth 20 to 60
GHZ in millimeter so as to allow very wide bandwidth
radio channels able to support data access speeds of up
to 10 Gbit/s.
f) Speed of Delivery -One of the main benefits of 5G
technology over 4G will not be its speed of delivery –
which is about between 10Gbps and 100Gbps but it is
low. At present, 4G provides speed between 40ms and
60ms, which is very low and not enough to provide
real-time response.
3. KEY CONCEPTS OF 5G
1) No zone issues in this network technology.
2) No limited access the user can access unlimited
data.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3) Several technologies such as 2G, 2.5G, 3G, and
4G can be connected simultaneously along with
the 5G.
4) All the technologies can use the same frequency
spectrum in very efficient manner. This is also
called smart radio.
5) New features such as online TV, newspaper and
researches with advanced resolution.
6) High altitude stratospheric platform station
systems.
4. FEATURES OF 5G NETWORKS
TECHNOLOGY
1) 5G technology has high resolution and high bandwidth.
2) 5G’s prospective ultra-low-latency could range between
1ms and 10ms. This would allow a spectator in a football
stadium to watch a live stream of an alternative camera
3) The high quality services of 5G technology based on
Policy to avoid error.
4) 5G technology has a very large bandwidth in which we
can connect up to 65000 of connections.
5) The uploading and downloading speed of 5G
technology will extremely large
5. VISIONS AND REQUIREMENTS
FOR 5G NETWORK
a) The Internet of Things -By the year 2020, it is
predicted by analysts that each person in the UK will
own and use 27 internet connected devices. There will
be 51 billion connected devices worldwide. Such as
smart phones, tablets and smart watches, to fridges,
cars and even their will be presence of smart clothes.
Some of these will require significant data to be shifted
at very high speed, while others might just need very
small amount data information to be sent and received.
The 5G system can automatically switch and provide
bandwidth according to requirement of the services.
b) Millimeter Wave Communication -To satisfy
requirement of new increased traffic and technology
services , additional frequency band width is required
which should be greater than 4G network bandwidth .
To resolve this the use of millimeter wave frequency
bands is must to overcome the problem of rare
spectrum.
6. IMPLEMENTATION
As part of a “heterogeneous network”, the points, or cells,
will used for LTE-A. Cells will automatically talk to each
other to provide the best and most efficient service no
matter where the user is. Larger cells will be used in the
same way as they are now, with broad coverage, but urban
areas will be covered by multiple smaller cells, fitted in
lampposts, on the roofs of shops and malls, and in the
pillars of building . Each of these will make the signal
stabilized.
117
ISBN: 978-81-924893-0-8
7. TECHNOLOGIES BEHIND
5G radio access will be built upon both new radio access
technologies (RAT) and evolved existing wireless
technologies (LTE, HSPA, GSM and Wi-Fi). This comes
up with the idea of utilizing millimeter-wave frequencies.
This frequency range lies Between 3 to 300MHz, this is
greater than today’s network frequency. The main benefit
of using this frequency range is that it is securely used by
other broadcast technologies. Hence it provides more
speed and data for the network usage. Millimeter-wave
frequencies don't pass through solid objects easily, and it's
difficult to stable the network up to long distance, that’s
why we are unable to use this in previous mobile networks.
As a result, 5G network will use a lot of little base stations
rather than relatively few large masts. The increase in
spectrum means that these smaller base stations will be
able to share data between one another as well as with
everyone's phones, easily detect how much data a user
much required for that time during the work.
8. CONCLUSIONS AND FUTURE
SCOPE
Here, in conclusion of 5G mobile communication surveys,
the 5G technology is designed as an open platform on
different layers from physical to application. Now the
present network is in process which offers the best
operating system and at very less service charges. There
are lots of improve mental changes from generation 1 to
generation 5 in the world technology of wireless network.
This upcoming technology is very efficient and less
expensive, a lot of expectations from this technology. 5G
technologies provide high resolution for the use of network
to the mobile phone consumers.
REFERENCES
[1] Shakil Akhtar ― Evolution of technologies, Standards
and Deployment of 2G-5G Networks‖, Clayton State
University, USA-2009.
[2] Santhi, K. R. & Srivastava, V. K. & SenthilKumaran,
G. (Oct. 2003). Goals of True Broadband’s Wireless
Next Wave (4G-5G). Retrieved June 11th, 2005, from the
IEEExplore Database from Wallance Library.
[3] Aleksandar Tudzarov and Toni Janevski Functional
Architecture for 5g Mobile Network International Journal
of Advanced Science and Technology Vol. 32, July, 2011
[4] Ramnarayan, Vashu kumar, Vipin kumar ”A New
generation mobile network 5G”IJCA Vol.17 no.20 May
2013.
[5]IEEE, Handover Schemes in Satellite Networks: State-
Of-The-Art and Future Research Directions, NASA, 2006,
Volume 8(4).
[6] Toni Janevski , 5G Mobile Phone Concept, Consumer
Communications and Networking Conference, 2009 6th
IEEE.
7] Bria, F. Gessler, O. Queseth, R. Stridth, M. Unbehaun,
J.Wu, J.Zendler, ―4-th Generation Wireless
Infrastructures: Scenarios and Research Challenges‖, IEEE
Personal Communications, Vol. 8,
[8] Willie W. Lu, ―An Open Baseband Processing
Architecture for Future Mobile Terminals Design‖, IEEE
Wireless Communications, April 2008.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Adaptive Modulation based Link Adaptation for High
Speed Wireless Data Networks using Fuzzy Expert
System
Kuldeep Singh Jatin Shama
GNDU Regional Campus, GNDU Regional Campus,
Fattu Dhinga, Kapurthala, Fattu Dhinga, Kapurthala,
Punjab,India Punjab,India
kuldeepsinghbrar87@gm Jatin.sha11@gmail.com
ail.com
ABSTRACT
With drastic increase in demand of high speed data services,
achieving better performance of high speed wireless data
networks becomes a challenging task because of limited
available spectrum and uncertain nature of wireless
communication link. Adaptive modulation based link
adaptation is one of the solutions to this problem which
predicts the efficient modulation technique among the
available modulation techniques depending upon state of
channel to ensure high performance of data networks. In this
paper, Fuzzy Expert System has been introduced which
chooses efficient modulation technique among QPSK, 8
QAM, 16 QAM, 32 QAM and 64 QAM depending upon
SNR, BER values and current modulation type. This system
gives satisfactory results for prediction of better modulation
technique among others to implement adaptive modulation
based link adaptation which further enhances the performance
of high speed wireless data networks by ensuring error free
delivery and high spectral efficiency.
General Terms
Adaptive Modulation, Link Adaptation, Spectral Efficiency
Keywords
QPSK, QAM, SNR, BER, Fuzzy Expert System
1. INTRODUCTION
In the era of information evolution, there is drastic rise in
internet users over recent years. So this is a challenging task
for internet service providers to cop up the requirement of
high speed data services by enormous number of users over
limited frequency spectrum. High speed wireless data systems
such as WCDMA based High Speed Downlink Packet Access
(HSDPA), requires robust and spectrally efficient
communication techniques for transmission of data through
noisy and fading channels. One of the way of achieving high
data rate is to increase allocated bandwidth. But this way is
very expansive because of limited available spectrum band
which is being used by large number of communication
systems. One more barrier in high speed wireless
communication is unreliable wireless link suffering from
Rayleigh fading which reduces the error performance in
fading environment. Therefore, over the last few years,
research community is in the progress of developing several
techniques to improve spectral efficiency for serving high data
rate requirement over fading channels within the given
bandwidth. Link adaptation is one the techniques [1],[2], [10].
118
ISBN: 978-81-924893-0-8
Danish Shama
GNDU Regional Campus,
Fattu Dhinga, Kapurthala,
Punjab,India
danishsharma101@gmail.
com
Link adaptation is also called Adaptive Modulation and
Coding. In modern high speed wireless data networks, link
adaptation is the process of matching of the technique of
modulation, and/or coding rate to the conditions on the
wireless communication channel and making necessary
changes in modulation and coding depending nature of the
channel which may be noisy or clear [3]. Adaptive modulation
technique requires some information about the nature of
communication channel such as signal to noise ratio (SNR),
Bit error rate (BER) etc. at the transmitter side, which is
provided through feedback mechanism in order to increase the
overall performance of wireless data network in terms of
spectral efficiency and error free delivery of data at high
speed [2], An increase in SNR or increase in BER leads to
choice of higher order modulation technique such as 16 QAM,
32 QAM or 64 QAM and decrease in SNR leads to choice of
lower order modulation technique such as QPSK or 8 QAM.
This is because of the fact that for higher value of SNR,
chances of packet loss are reduced, so by choosing higher
order modulation, spectral efficiency can be further enhanced.
But on the other side, if SNR is low, then there may be
chances of variation in phase of above mentioned higher order
modulation techniques because of very small phase difference
between adjacent phases, which may lead to distortion or loss
of received data packets. Therefore, lower order modulation
techniques are mainly preferred in case of lower value of SNR
[2],[4],[5].
In this research paper, a Fuzzy Expert System has been
introduced for performing the task of adaptive modulation in
order to provide efficient link adaptation. Different types of
digital modulation techniques which are being considered in
this paper are QPSK, 8 QAM, 16 QAM, 32 QAM and 64
QAM. In fuzzy inference system, SNR, BER and Current
Modulation are taken as input parameters which are used to
decide the new modulation technique which is going to
improve spectral efficiency and ensures error free delivery of
data packets.
2. LITERATURE SURVEY
In paper [2], Zalonis et.al has studied the problem of link
adaptation using adaptive modulation and coding for multiple
antenna OFDM system in case of noisy channel. They have
given an accurate packet error rate prediction with channel
estimation errors on the basis of extrinsic information transfer
analysis. In this method, Gaussian approximation has been
used to characterize the output of the detector and decoder.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

They have also discussed approaches for searching and membership functions with the control rules to derive the
selecting the best modulation and coding scheme for the link fuzzy output. Defuzzification is the process of using different
adaptation algorithm. methods to calculate each associated output and put them into
a table: the lookup table and then to pick up the output from
In paper [4] Parminder Kaur et. al have discussed that the lookup table based on the current input during an
adaptive modulation systems are better than fixed modulation application . Fuzzy Expert System has been shown in the
systems because these systems change its modulation following figure.
technique according to present modulation values. Authors
have proposed an adaptive modulated OFDM system based on
Back Propagation Neural Network by taking into
consideration SNR and BER Parameters and then evaluating
the accuracy of this system on the basis of number of neurons
in BPNN and mean square error. But in this research work,
initial data set having known best modulation techniques on
the basis of known value of SNR and BER is required which
is a difficult task.
In Paper [5], Parminder Kaur et. al have discussed adaptive
modulated Orthogonal Frequency Division Multiplexing
(OFDM) system based on Radial Basis Function and then
performance of the system is evaluated on the basis of mean
square error and classification accuracy is evaluated
according to the number of neurons in RBF network. But
again this system will make decision about best modulation
on the basis of Data set of known inputs and known best Fig1: Fuzzy Expert System
output and this type of data set is very difficult to produce and
also reliability of this type of data set in different fading 4. RESULT ANALYSIS
channel environments is doubtful. In this research work, Fuzzy inference system which is termed
as Fuzzy Expert System, has been implemented using
In paper [6], Iftekhar Alam et.al have discussed various MATLAB. For this research work of link adaptation based
adaptive modulated MC-CDMA systems in Rayleigh fading adaptive modulation has been performed by using MATLAB
channel. They have considered various digital modulation 2014b on windows 8.1 operating system machine having Intel
techniques such as M-ary PSK, M-ary QAM, M-ary MHPM, Core I3 processor. For this system, three input variables are
M-ary CPM, and GMSK with varying bit-duration-bandwidth taken into consideration which are Signal to Noise Ratio
product. The results of their paper show that the dynamic (SNR), Bit Error Rate (BER) and Current Modulation and
switching of the modulation orders can enhance the system output of the system is New Modulation. Fuzzy Inference
performance and capacity per given bandwidth of fading System model for link adaptation is shown in figure 2.
channel with the expected BER performance. But fuzzy logic
system has the capacity of making the adaptive modulation
much easier and more effective.

3. FUZZY EXPERT SYSTEM

In the year of 1965, Dr. Lotfi Zadeh, a professor of
mathematics from U.C. Berkeley, proposed the fuzzy theory
[7]. Fuzzy logic is a valuable tool which is basically used to
solve highly complex real time problems where a
mathematical modelling is very difficult to achieve. Fuzzy
logic also helps in reducing the complexity of existing
solutions as well as increase the accessibility of control
theory.
Fuzzy expert system, also known as Fuzzy Inference system
suitable for tasks involving logic has been proposed as
compared to classical crisp set theory. The “fuzzy set” has
been employed to expand classical sets, which are
characterized by some margins for modelling of real time
problems. Fuzzy logic provides a degree of flexibility for each
object which belongs to a particular set. This quality is
realized by membership functions which give fuzzy sets the
capacity of modeling linguistic, fuzzy expression [8]. Fig: 2 Link Adaptation: Fuzzy Inference System
Fuzzy logic based fuzzy expert system is IF-THEN rule based The input and output variables of above mentioned Fuzzy
system in which a set of rules represents a control decision Inference System are discussed below:
mechanism to correct the effect of certain cause used for
many systems. The configuration of fuzzy logic based system  SNR: This input variable is most important factor for
into three parts they are, Fuzzification , Interface Mechanism describing noisy or clear nature of wireless
and Defuzzification. Fuzzification process is used to convert communication channel which is mainly used to make
classical data or crisp data into fuzzy data or Membership decision about new modulation technique in order to
Functions (MFs). Fuzzy Inference System combines implement adaptive modulation. In this research work, a

119
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

total 0 dB to 30 dB SNR range has been taken into

consideration which is divided into three membership
functions: Low ranging upto 17 dB, Medium ranging
upto 23 dB and High ranging above 23 dB [10]. If value
of SNR is going to be increased, then there is the
possibility of choosing higher order modulation
technique so as to increase spectral efficiency. If SNR
value is low, then lower order modulation is the
favorable choice because with increase in channel noise,
there is the possibility of distortion in higher order
modulated received signal because of lesser phase
difference and amplitude difference in adjacent levels of
higher order modulation techniques such as 32 QAM or
64 QAM. In case of medium values of SNR, there may
be no change in modulation technique. SNR input
variable along with its membership functions is shown in
following figure.

Fig 4: Bit Error Rate (BER) input variable along with its
membership functions
 Current Modulation: This input variable describes
different type of modulation techniques used in wireless
data networks. In this research work, only five
modulation techniques have been taken into
consideration which are Quadrature Phase Shift Keying
(QPSK), 8 Quadrature Amplitude Modulation (8 QAM),
16 QAM, 32 QAM and 64 QAM. As the order of
modulation technique is increasing, spectral efficiency of
the system is also going to be increased. For example, in
QPSK, spectral efficiency is 2. But in case of 64 QAM
spectral efficiency is 6. Current Modulation input
variable along with its five membership functions
representing different modulation techniques as 0,1,2,3
and 4 is shown in following figure.
Fig 3: Signal to Noise Ratio (SNR) input variable along
with its membership functions
 BER: This is the second variable which is helpful in
decision making about best modulation technique in the
implementation of adaptive modulation for link
adaptation. This variable is also divided into three
membership functions: LOW, MEDIUM and HIGH. If
BER is having high value, then it is favorable to choose
higher order modulation technique so as to reduce the
value of BER. If BER is having medium value, then it is
still favorable to select higher order modulation so as to
further improve the performance of high speed wireless
data networks. In case of low value of BER, there is no
need to change existing modulation technique. BER
input variable along with its three membership function
is shown in following figure.

Fig 5: Current Modulation input variable along with its

membership functions
 New Modulation: This is the output variable which
describes favorable modulation technique for giving
better performance of high speed wireless data networks
depending upon above mentioned input variables. In this

120
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

variable , again five different type of modulation modulation for output variable New Modulation. This is
techniques are taken into consideration which are QPSK, graphical representation indicates degree of randomness of IF-
8 QAM, 16 QAM, 32 QAM and 64 QAM. Choice of best THEN rules. This representation shows that all different
modulation technique among others depending upon possible combinations are properly described in this fuzzy
SNR and BER values of network which represent inference system. Similarly combination among other
instantaneous characteristics of the channel leads to variables also represents high degree of variability in rules
implementation of adaptive modulation which in turn formation.
leads to efficient link adaptation for better performance
of wireless data networks in fading or clear channel
environments. New Modulation output variable along
with its five membership functions representing efficient
modulation technique for implementing adaptive
modulation is shown in following figure.

Fig 8: Surface viewer representing SNR and current

modulation input variable
Results obtained from this fuzzy exert system by taking into
consideration random values of SNR, BER and Current
modulation technique are shown in following table.
Fig 6: New Modulation Output variable along with its Table 1: Evaluation of Fuzzy Expert System
membership functions
Sr. SNR (in BER Current New
Figure 7 shows Fuzzy IF-THEN rules modelled in Fuzzy No. dB) Modulation Modulation
Inference System deciding efficient modulation technique
depending upon nature of channel. The unreliable nature of
wireless communication channel can be properly represented 1 3 0.7 1 (8QAM) 0 (QPSK)
by SNR and BER information obtained at the receiver side 2 27 0.9 2 (16QAM) 3 (32QAM)
which can be feedback to transmitter part so as to implement
adaptation modulation in order to obtain link adaptation for 3 15 0.3 3 (32QAM) 3 (32QAM)
better performance of wireless data networks.
4 22 0.5 4 (64QAM) 4 (64QAM)
5 18 0 1 (8QAM) 0 (QPSK)

Now the input variables and corresponding results mentioned

in above table are verified manually, and it reveals that Fuzzy
expert system modelled in this paper gives quite satisfactory
results which match with the corresponding predictions of
manual verification. So, Fuzzy Expert System gives very good
response for implementation of adaptive modulation in order
to obtain link adaptation of uncertain communication channel
so as to enhance the performance of the high speed wireless
data networks in terms of error free delivery and spectral
efficiency.

5. CONCLUSION AND FUTURE SCOPE

Fig 7: Fuzzy IF-THEN rules
Figure 8 shows surface viewer diagram by taking into
consideration two input variables SNR and Current
In this research paper, Fuzzy expert system has been
implanted for performing adaptive modulation in order to
obtain link adaption. In this system, SNR, BER and Current
Modulation are taken as input variables which are used to
decide new modulation technique for improving performance
of the wireless data network using fuzzy IF-THEN rules.

121
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Results reveal that Fuzzy expert system gives satisfactory
results for prediction of better modulation technique among
others to implement adaptive modulation based link
adaptation which further enhances the performance of high
speed wireless data networks by ensuring error free delivery
and high spectral efficiency.
In this research paper, only two input variables SNR and BER
are taken into consideration in order to examine the uncertain
behavior of communication channel. There is the possibility
of including other parameters so as to improve the results of
fuzzy inference system. Secondly, in this research work, only
five modulation techniques have been considered. Other
higher and lower order modulation should also be taken into
account for provide the benefit of adaptive modulation to
large number of applications.
REFERENCES
[1] Goldsmith, A.J. and Chua, S.G., “Adaptive coded
modulation for fading channels”, IEEE Transactions on
Communications, Vol. 46, No. 5, May 1998, 595-602.
[2] Zalonis, A., Miliou, N., Dagres, I., Polydoros, A., and
Bogucka,H., “Trends in Adaptive modulation and
Coding”, Advances in Electronics and
Telecommunications, Vol. 1, No. 1, April 2010, 104-111.
[3] Tan, P.H., Yan Wu and Sun, S., “Link Adaptation Based
on Adaptive Modulation and Coding for Multiple-
Antenna OFDM System”, IEEE Journal on Selected
Areas of Communications, Vol. 26, No. 8, October,
2008, 1599-1606.
122
ISBN: 978-81-924893-0-8
[4] Parminder Kaur, Kuldeep Singh and Hardeep Kaur.
2014. Adaptive Modulation of OFDM by using Back
Propagation Neural Network (BPNN). In Proceedings of
International Multi Track Conference on Science,
Engineering & Technical Innovations, Vol. 1, Jalandhar,
Punjab, India, (June 2014), 511-514.
[5] Parminder Kaur, Kuldeep Singh and Hardeep Kaur,
“Adaptive Modulation of OFDM using Radial Basis
Function Neural Network”, International Journal of
Advanced Research in Computer and Communication
Engineering (IJARCCE), Vol. 3, Issue 6, June 2014,
6886-6888.
[6] Alam, I., Srivastva, V., Prakash, A., Tripathi, R., and
Shankhwar, A.K. 2013. Performance Evaluation of
Adaptive Modulation Based MC-CDMA System.
Wireless Engineering and Technology, Scientific
Research, (2013), 54-58,.
[7] Zadeh, L.A. Fuzzy Logic, Neural Networks, and Soft
computing.
[8] Arshdeep Kaur, Sanchit Mahajan and Kuldeep Singh,.
2014. Site Selection for Installation of Cellular Towers
using Fuzzy Logic Technique. In Proceedings of
National Conference on Latest Developments in Science,
Engineering & Management (LDSEM-2014), Amritsar,
Punjab, India, (March 2014), 343-347.
[9] Fuzzy Logic Toolbox for use with MATLAB – Users
Guide. (2015).
[10] Kolding, T.E., Pedersen, K.I., Wigard, J., Frederiksen,
F., and Mogensen, P.E. 2003. High Speed Downlink
Packet Access: WCDMA Evolution. IEEE Vehicular
Technology Society News, (February 2003), 4-10.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

DESIGN AND ANALYSIS OF DUAL BAND PRINTED

MICROSTRIP DIPOLE ANTENNA FOR WLAN
Gurmeet Singh
Department of Electronics and Communication
Engineering
Sant Longowal Institute of Engineering And
Technology, Longowal, Sangrur, Punjab
ergurmeet96@gmail.com
Lakhwinder Singh Solanki
Department of Electronics and Communication
Engineering
Sant Longowal Institute of Engineering And
Technology, Longowal, Sangrur, Punjab
lakhwinder_singh_solanki@ yahoo.co.uk

ABSTRACT frequency bands at 2.4 GHz and 3.2 GHz. The proposed
In today’s technologically advanced era, microstrip fed antenna have omnidirectional radiation pattern. A dual-band
rectangular microstrip dipole antenna is predominantly used printed dipole antenna is designed in this study by combining
in wireless communication. In this paper, a dual band printed a rectangular and two “L” shaped radiating elements and are
microstrip dipole antenna is delineated using HFSS as embedded on a single layer structure with relatively small
Simulation software. The antenna has covered -10 dB size. Antenna has been supposed to be printed on an FR4
impedance bandwidth of 245 MHz (18.71% at 2.4 GHz) and
substrate with a thickness of 0.8 mm and relative permittivity
1670 MHz (31.77% at 5.2 GHz). This aspect enables the
antenna to cover the required bandwidth at the 2.4 GHz and 5 of 4.6. The resulting antenna has been found to have a
GHz band. Proposed antenna covers the 2.182-2.633 GHz and compact size of 25.75x22 mm². The antenna offers dual–band
4.465-5.899 GHz band . A simplified feed structure consists characteristics and antenna is fed by a standard 50 Ω
of a pair of parallel metal strips printed on the opposite sides microstrip line using a broadband microstrip-to coplanar strip
of the dielectric substrate and connected to a 50 Ω microstrip line transition. The transition network is realized by a matched
line with partial ground plane. This feeding network does not
T-junction and a narrowband delay line, which not only
depend upon additional conversion devices, such as power
divider, tuning stub etc. increases the model complication but also requires long
transmission lines. In [5, 6] the antenna consists of a printed
Keywords
Dipole antenna, impedance bandwidth, microstrip monopole and a 50 Ω microstrip line with an open-circuited
tuning stub. The tuning stub length was found to be efficient
in controlling the coupling of the electromagnetic energy from
1. INTRODUCTION the microstrip line to the monopole. In [7], a cavity backed
In recent years, there have been fast developments in wireless
double-sided printed dipole antenna is conferred, which
local area network (WLAN) applications. In order to satisfy
impart broadband performance with compact antenna size. In
the need of today’s wireless application, multi band operation
[8] printed and doubled-sided dipole array wideband antenna
is needed. Antenna should cover the 2.4 GHz band of IEEE
in application of 5.2 GHz UNII band, operated in WLAN
802.11b/g and the 5 GHz band of 802.11a WLAN standards,
access point has been demonstrated .The printed dipole array
dual-band operations in the 2.4 GHz (2400 –2484 MHz) and
antenna consists of one dipole array arranged back to back
5GHz (5150–5350MHz and 5725-5825 MHz) bands are
and can be easily framed by printing on both sides of a
demanded in practical WLAN for various applications.
dielectric substrate and is suitable for integration with
A single antenna is highly advantageous if it can operate in
monolithic microwave integrated circuit (MMIC). In [9] a
double band mode. The antenna should be conformable, low
WLAN/WiMax printed antenna executed by using microstrip
profile, lightweight and compact therefore, the antenna can
feeding and matching. In [10] design and simulation of
easily be fixed in the range of communication devices. There
microstrip dipole antenna at 2.4 GHz have been proposed.
are various feeding methods but a basic feeding circuit is also
Frequency resonance has been also analyzed for different
an important component, because it is in planar form which
width of dipole arm. In [11] modification in two parameters
reduces the transmission line length and the radiation losses.
bend on microstrip line and dipole’s gap of known printed
For this purpose, some printed antennas have been devised
dipole antenna has been discussed. In [12] half wave
[3–12]. The antenna in [3] uses the printed dipole for dual
microstrip dipole antenna with tapered arms has been
frequency band. Antenna with sufficient gain covers only 2.4
designed at a frequency of 2.4 GHz. A dual-band compact bi-
GHz and 5.2 GHz band. In [4] the design concept of the
faced printed dipole antenna has been designed for Wi-Fi
printed dipole antenna with reflector has been discussed,
802.11n.The return losses in proposed antenna match the
which enables the transmission and reception of a single-band
frequency requirements in both bands (measured bandwidth
frequency, a parasitic element is embedded to enable the
of 10.8% at 2.5 GHz and 25.3% at 5.5 GHz), with nearly
operation of dual-band and impedance matching is performed
omnidirectional radiation patterns and efficiency 90% In this
by adjusting the width of the microstrip line. In the design [5],
paper, a microstrip-fed dual-band printed dipole antenna is
the new structures with 50 ohm microtsrip feed line
demonstrated. With a prick line fix into each arm of the
rectangular patch slot antenna for WLAN and WiMAX
dipole, a double-band operation is introduced on a single
applications have been discussed, this antenna operates at dual

123
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

antenna. The suggested design does not have need of isolated arms of the dipole antenna printed on the area of L×W mm²,
dipole arms to acquire two separate operating bands, and it and are printed on opposite side of a dielectric substrate. The
has a reduced length of arms than the design in [3]. The feed structure is composed of a 50 Ω microstrip line and two
proposed antenna can easily be excited by a 50 Ω microstrip parallel metal strips. The parallel strips have a uniform width
line and a pair of parallel metal strips between the dipole and of Ws (Ws = 3.5 mm) and a length of Ls (Ls = 16.6 mm in
the microstrip feed line; good impedance matching can be this study).
obtained for operating frequencies within both 2.4 and 5 GHz
band.
2. ANTENNA DESIGN AND ANALYSIS
In this paper, microstrip dipole antenna is printed on double
sided FR4 substrate having thickness 1.6 mm and dielectric
constant of 4.4. The geometry of microstrip dipole antenna is
shown in figure 1. The width of the Microstrip dipole antenna
is given as [2]

Where λ0 is free space wavelength.

Effective dielectric constant (εreff ) has been calculated by

using equation (1) [1]
(a)

Where = Relative dielectric constant of substrate.

h = height of substrate.

w = width of patch.

Effective length Leff has been calculated at particular

resonant frequency by using equation (2)

Incremented length of the patch is given by

(b)

Fig. 1: (a) and (b) Geometry of dual band printed dipole

Actual length of patch L has been calculated by using
equation (2) and (4)
2.1 Antenna Design
The configuration for printed dipole antenna with a spur line
is shown in Fig. 1, which is printed on a FR4 substrate of
thickness h=1.6 mm and relative permittivity ε =
᷊ 4.4.The top
side consists of a microstrip feed line, one of the parallel
metal strips and one side of the arms of the printed dipole
antenna. The base side consists of a truncated ground plane
(50×22 mm), the other parallel metal strip, and the second
antenna.
Both the microstrip line and parallel metal strips must be
carefully designed for proper matching. By carefully changing
the printed dipole arms of length L and width W, the
uncomplicated conventional printed dipole antenna (without
spur line) can operate in the different bands. In this design, a
spur line is imprinted on each of the two rectangular dipole
arms (detailed dimensions are given in Fig. 1). With the
existence of the spur lines, two extra dipole arms are obtained,
which form a second dipole antenna which are used to
produce a higher resonant mode for 5 GHz band operation
with a smaller length and width. In this design it is clear that
the longer dipole arms are used to operate in the 2.4 GHz
band. Using the simple microstrip feeding structure, good
impedance matching for each of the operating frequencies can
be easily obtained.

124
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig. 2: Simulated return loss for proposed antenna
2.2 Measured Results
Fig. 2 shows the simulated return loss for the proposed double
sided dipole antenna. Each resonant mode with good
impedance matching can be seen. The simulated results
obtained from simulation software HFSS. In this antenna
design the dimensions of long and short dipoles are
14.16×6.25 mm² and 5.2×2.5 mm².These two long and the
short dipole arms are designed for 2.4 and 5 GHz bands,
respectively.
Fig. 3: Radiation pattern at 5.2 GHz
For the first and lower band having frequency range 2182
MHz to 2633 MHz and an impedance bandwidth of 18.7%
(for S11<10 dB) was obtained. For the second and higher
band having frequency range 4465 to 5899 MHz and an
impedance bandwidth of 27.6% (for S11<10 dB), was also
obtained. It shows that the impedance bandwidth of the lower
and the higher bands covers the 2.4 and 5 GHz bands for
WLAN operation. In addition, the overall length (2L+Ws) of
the proposed antenna is about 0.25 λ˳ (30 mm), where λ˳ is
about 125 mm. Figs. 4 and 5 show the measured and
simulated radiation patterns at 2450 and 5250 MHz,
respectively. It can be observed that the radiation patterns are
dipole-like for the two operating bands. For the two
frequencies, the patterns in the x–y plane (E-plane) still act as
a dipole.
125
ISBN: 978-81-924893-0-8
Fig. 4: Radiation pattern at 2.4 GHz
3. CONCLUSION
A dual-band printed dipole antenna has been proposed and
simulated at 2.4 and 5 GHz. To obtain lower and higher
operating modes longer and shorter dipole arms designed by
using above equations in the proposed antenna. The proposed
antenna has a simple feeding structure in design and has wide
operational bandwidth, and has suitable radiation patterns
such that it is commercially suitable for use in WLAN
applications.
REFERENCES
[1] Constantine A. Balanis 2005, " Antenna Theory Analysis
and Design".
[2] R. Garg, P. Bhatia, I. Bahl, and A. Ittipiboon 2001,"
Microstrip Antenna Design Handbook, Artech House".
[3] H.-M. Chen, J.-M. Chen, P.-S. Cheng, and Y.-F. Lin
2004, " Feed for dual-band printed dipole antenna, Electronics
Letters" Vol. 40 No. 21.
[4] Jean-Marie Floc H, and Ahmad El Sayed Ahmad 2012
“Dual-Band Printed Dipole Antenna with Parasitic Element
for Compensation of Frequency Space Attenuation”
International Journal of Electromagnetics and Applications,
2(5) pp. 120-128.
[5] P.Prabhu, M.Ramkumar, S.Pradhap, S.Navin 2013
"compact microstrip fed dual band printed rectangular patch
antenna for wlan/wimax " International Journal of Innovative
Research in Science, Engineering and Technology, Vol. 2,
pp.472-478.
[6] Mahmood T. Yassen, Jawad K. Ali, Ali J. Salim, Seevan
F. Abdulkareem, Ali I. Hammoodi, Mohammed R. Hussan
2013 "A New Compact Slot Antenna for Dual-band WLAN
Applications" International Journal of Science and Modern
Engineering (IJISME),Vol. 1,pp. 28-32.
[7] M. Guo, S.S. Zhong, X.B. Xuan 2012 "Conformal double
printed dipole antenna" IEEE Topical Conference on
Antennas and Propagation in Wireless Communications,pp.
312-314.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[8] Jhin-Fang Huang, Mao-Hsiu Hsu, and Fu-Jui Wu 2006 "
Design of a Double-Sided and Printed Wideband Dipole
Array Antenna on 5.2GHz Band” IEEE 6th International
Conference on ITS Telecommunications Proceedings, pp.430-
433.
[9] C. J. Tsai , C. S. Lin and W. C. Chen 2011 " A Dual-Band
Microstrip-Matched Printed Antenna for WLAN/WiMax
Applications"Proceedings of the Asia-Pacific Microwave
Conference, pp.1726-1729.
Results of a Printed Dipole Antenna"Int. J. Communications,
Network and System Sciences, 3, pp.204-207.
[12] Nitali Garg, Zarreen Aijaz 2012 " A Dual band
microstrip dipole antenna for wideband application"
International Journal of Computer Technology and
Electronics Engineering (IJCTEE), Volume 2, Issue 6, pp.18-
20.

[10] M. H. Jamaluddin, M.K. A. Rahim, M. Z. A. Abd. Aziz,

and A. Asrokin 2005 "Microstrip Dipole Antenna Analysis
with Different Width and Length at 2.4 GHz" Asia pacific
confrence on applied electromagnetics proceedings, pp.41-44.

[11] Constantinos VOTIS, Vasilis CHRISTOFILAKIS, Panos

KOSTARAKIS 2010 "Geometry Aspects and Experimental

126
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Koch Fractal Loop antenna using modified ground
Pravin Kumar Anuradha Sonker
Electronics and Electronics and
Communication Engineering Communication Engineering
Department, NIT Hamirpur, Department, NIT Hamirpur,
Hamirpur-177005 (H.P) Hamirpur-177005 (H.P)
pkpravin011@gmail.com sonanu8@gmail.com
ABSTRACT
In the present paper a Koch fractal loop antenna is
described using modified ground techniques for the
multiband applications. A Koch fractal loop antenna is
printed on dielectric substrate. The return loss value at
each multiple resonating frequencies have been studied
and improved for higher iterations of the Koch fractal
loop antenna with the use of modified ground feed
techniques. Theses antennas have been modeled and
simulated using CST microwave studio software. The
results of the simulations have been shown and compared
for every iteration of Koch fractal loop antenna.
General Terms
R.F and Microwave, Koch fractal loop Antennas,
Communication.
Keywords
Fractal antenna, Koch fractal loop, multiband antenna,
antenna design.
1. INTRODUCTION
Now-days in RF and wireless communication systems
broadband, multiband and compact size antennas are in
great demand for both military and commercial
applications [1]. Nowadays users are trying for antennas
that can operate over multiple frequency bands or are
reconfigurable as the challenges on the antenna system
changes. Furthermore, the design of the antenna systems
is always important to be as miniaturized as possible in
many applications. Outstanding solutions for miniature
and multi-band antennas have been found in Fractal
antennas. A fractal antenna theory has been found a great
progress in the study of antenna engineering. The word
fractal was originally discovered by Benoit Mandelbrot
to describe a family of complex shapes that possess an
inherent self-similarity or self-affinity in their
geometrical structure. Benoit Mandelbrot, the pioneer of
classifying this geometry, first coined the term 'fractal’ in
1975 from the Latin word “fractus”, which means
broken. Fractals are space filling contours, meaning
electrically large features can be efficiently- packed into
small areas [2]. Since the electrical lengths play such an
important role in antenna design, this efficient packing
can be used as a viable miniaturization technique. The
Iterated function system [3, 4], which represents a
versatile method for convenient generation of wide
variety of useful fractal structures and is based on
application of a series of affine transformation, was used
to generate these structures.
127
ISBN: 978-81-924893-0-8
Varun Punia
Electronics and
Communication Engineering
Department, NIT Hamirpur,
Hamirpur-177005 (H.P)
punia.1246@gmail.com
There are several fractal geometries that have been found
to be useful in developing new and innovative design for
miniatured and multiband antennas. Some of these
classical known fractal geometries e.g. Sierpinski gasket,
Sierpinski carpet and Koch fractal geometry have been
studied for the multiband antennas. Fractal antennas
based on Koch fractal shape have been widely explored
for the size miniaturization and multiband applications
[5-9]. The effective length of the Koch fractal curve
increases at each iteration of fractal results in shifting the
frequency response of the antenna. A variety of loop
antennas have been found with the number of fractal
geometries. Simple Loop antennas have some
disadvantages as low input resistance and larger in size.
A Koch fractal island is superimposed on circular loop
antennas. The fractal circular loop antenna based on
Koch island curve has the advantage that the increased
effective length of the Koch island loop at higher
iteration can be packed into a small space of the antenna
as well as increases the input resistance of the simple
circular loop antenna.
In the present work a Koch loop antenna has been
modeled and simulated using CST microwave studio
software for the analysis the multiband behavior. The
reason for carrying study of Koch fractal loop geometry
is to see the effect of changing the dimensions of the
Koch fractal loop on its resonating frequency and
bandwidth. With the introduction of modified ground
based feed techniques on Koch fractal loop antenna
shows the better matching in terms of the return loss
value at each resonating frequencies for higher iterations
of the fractal. Although the higher iterations of Koch
fractal loop antenna can be useful to design the
miniaturized size of antenna.
2. DESIGN OF KOCH LOOP
ANTENNA
A Koch fractal loop antenna has been designed using
CST software [10]. The Koch fractal loop geometries are
generated by the IFS method. Multiple iterations of the
Koch fractal curve are shown in Figure 1. The Koch
curve fractal iterations using IFS method are imposed on
an equilateral triangular shape and then various iterations
of the Koch fractal loop are formed. These Koch fractal
loop are superimposed on circular patch antenna to
analyze the frequency and bandwidth response of the
antenna.
In the present work, the higher iterations of Koch loop
fractal have been studied for the multiband antenna. The
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
structure of the 3rd Koch loop patch antenna of radius r
=10 mm is printed on a FR-4 substrate with thickness of
h = 1.5 mm and relative dielectric constant εr = 4.7 as
shown in Figure 2 (a). Where Ws and Ls represents the
width and length of the substrate. A microstrip feed line
on modified ground has been employed for the designing
of Koch loop antenna for the better impedance matching
at each resonating frequency of the antenna. Where the Lf
= 20.3 mm and Wf = 2.6 mm are the length and width of
the feed line. The modified ground has dimensions of
Lg×Wg =1.6 × 42 mm as shown in Figure 2 (b).
Fig.1. Various iterations of Koch fractal loop geometries.
Fig.2. (a) Front view of the 3rd iterated Koch fractal
loop antenna
128
ISBN: 978-81-924893-0-8
Fig. 2. (b) Back view of Modified ground structure
3. RESULTS AND DISCUSSION
In order to ananyze the multiband frequency resposne of
the Koch fractal loop antenna, second and third iterations
of koch fractal loop antennas was simulated. In figure 3,
The return loss plot shows the multiband nature of the
second iterated Koch loop antenna for radius r of 10 mm.
This second iterated Koch loop antenna has three
resonating frequencies at 4.43 GHz, 8.78 and 11.85
respectively. It has been observed from the plots, all the
three frequencies resonates within the -10 dB return loss
level. The first three frequenices have enough
bandwidths at -10 dB tolerance level for the functioning
of antennas. The resonance nature of the second iterated
Koch loop antenna for three frequencies are tabulated in
Table 4.1.
In order to verify the improvemnet in S11 or return loss
plot with the use of modified feed, third iterated koch
fractal loop antenna of same radius is simulated. Figure 4
shows the multiple fequencies for the third iterated Koch
loop antenna. This third iterated Koch loop antenna has
three resonating frequencies. It has been seen from the
plots, all the three frequencies resonates within the -10
dB reference return loss level. The last two frequenices
shows the improved return loss at frequency 8.75 GHz
and 11.68 GHz. The first three frequenices have enough
bandwidths at -10 dB tolerance level for the functioning
of antennas. The resonance nature of the third iterated
Koch loop antenna for three frequencies are tabulated in
Table - 4.2. It has been noticed from the third iterated
Koch loop structure that the higher iterations of Koch
loop fractal reduces the size or area of the antenna.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig.3. Resonating frequency for 10 mm 2nd iterated Koch fractal loop antenna.

Fig.4. Resonating frequency for 10 mm 3 rd iterated Koch fractal loop antenna

Table 4.1 Resonance nature of 2nd iterated Koch loop 4. CONCLUSION

antenna for 10 mm radius. This paper discussed the role of Koch fractal loop in
antenna as multiband antenna for WLAN band hand set
Band-width S11 (dB) applications, radar and navigation and other higher
Resonating (GHz) at - or frequencies of microwave communication. Antenna
No. of
Frequencies 10dB resonates properly at each resonating frequencies with
resonance Return
(GHz) tolerance the introduction of modified ground in feed method. The
level loss role of effective feeding techniques improves the
impedance matching at each resonating frequencies of
First 4.43 0.53 -40.66
the antenna. Similar approach can be useful to design the
Second 8.78 0.73 -15.72 other fractal multiband and miniaturized antennas.

Third 11.85 0.49 -23.16 REFERENCES

[1] D. H. Werner, and S. Ganguly, “An Overview of
Fractal Antenna Engineering Research,” IEEE
Table 4.2 Resonance nature of 3rd iterated Koch loop Antennas and Propagation Magazine, Vol. 45, No. 5,
antenna of 10 mm radius pp.38-57, February 2003.
[2] Douglas H. Werner, Randy L. Haup, and Pingjuan L
Band-width S11 (dB) Werner, “Fractal Antenna Engineering: The Theory
Resonating (GHz) at - or and Design of Fractal Antenna Arrays. IEEE
No. of
Frequencies 10dB Antennas and Propagation Magazine, Vol. 41, No.5,
resonance Return
(GHz) tolerance pp. 37-59, October 1999.
level loss
[3] D. Kalra, “Antenna Miniaturization Using Fractals,”
First 4.43 0.53 -32.69 M.Sc. Thesis, University of Deemed, India, 2007.
Second 8.75 0.75 -31.96 [4] D.H.Werner, “An overview of fractal antenna
Third 11.68 0.49 -26.86 engineering”, IEEE Antennas and Propagation
Magazine., Vol. 45, No.1, pp.38-57, Feb 2003

129
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[5] K.J.Vinoy, K. A. Jose and V.K.Varadan, “Multiband

Characteristics and fractal dimension of dipole
antenna with Koch curve geometry,” IEEE 2002 AP-
S Inter. Symp., 2002.
[6] D. H Werner and R. Mittra, Frontiers in
Electromagnetic, IEEE press, chapters 1-3, 1999.
[7] H. O. Peitgen, H. Jurgens, and D. Saupe, Chaos and
Fractals: New Frontiers of Science, Springer-
Verlag, New York, 1992
[8] A. Ks. Skrivervik, J. F. Zurcher, O. Staub, and J. R.
Mosig, “PCS Antenna Design: The Challenge of
Miniaturization,” IEEE Antennas and Propagation
Magazine, Vol. 43, No. 4, pp. 12- 26, August 2001.
[9] N. Bayatmaku, P. Lotfi, M. Azarmanesh, and S.
Soltani, “Design of Simple Multiband Patch
Antenna for Mobile Communication Applications
using New E-shape Fractal,” IEEE Antennas and
Wireless Propagation Letters, Vol. 10, pp. 873-875,
September 2011.
[10] www.cst.com

130
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Automatic Detection of Diabetic Retinopathy- A
Technological Breakthrough
Chinar
JMIT, Radaur
chinarchahar@gmail.com
ABSTRACT
Diabetic Retinopathy is a dangerous eye disease and the most
common cause of blindness for worldwide population.
Digital color fundus images are becoming very important as
they help in diagnosing Diabetic Retinopathy. With this fact
new image processing techniques can be applied to improve
automatic detection of diabetic retinopathy. The main image
processing elements in detecting eye diseases include
segmentation, feature extraction, enhancement, pattern
matching, image classification. Microaneurysms are the
primary sign of DR, therefore necessary preprocessing step
for a correct diagnosis to automatically detect the
microaneurysms in fundus image is an algorithm. For
detecting the microaneurysms in retina images this review
paper aims to develop and test a new method.
General Terms
Detection, image processing, retina, vessels.
Keywords
MA, DR, NPDR, PDR, exudates, fundus, neovascularization,
OCT.
1. INTRODUCTION
WHO projects that diabetes will be the 7th leading cause of
death in 2030 and in 2014, 9% of adults 18 years and older
had diabetes, also the global prevalence of diabetes was
estimated to be 9% among adults aged 18+ years[1].Diabetic
eye disease is a group of eye problems that people with
diabetes face due to complication of diabetes. This can cause
severe vision loss or even blindness[2].
fig 1: side view of eye[2]
TYPE 1 DIABETES is also called insulin dependent diabetes
which is usually diagnosed in childhood. when body makes
little or no insulin then to sustain life daily injections of
insulin are required.
TYPE 2 DIABETES this is more common than type 1 and is
also known as non-insulin dependent diabetes, making 90% or
131
ISBN: 978-81-924893-0-8
Deepti Malhotra
JMIT, Radaur
deeptimalhotra@jmit.ac.in
more of all cases of diabetes. It usually occurs in adulthood.
In patients suffering from type 2 diabetics pancreas does not
make enough insulin to keep blood glucose levels normal as
body does not respond to insulin. Many patients do not even
know they suffer with type 2 diabetes, although it is a serious
condition. Type2 diabetes is becoming more common due to
increasing obesity, and not doing exercise.
GESTATIONAL DIABETES During pregnancy some
women get this disease. In gestational diabetics high blood
glucose develops in women who does not have diabetes[3].
The main diabetic eye diseases are:
1.Diabetic retinopathy-in which damage to the blood vessels
in the retina occur.
2.Cataract-clouding of the eye’s lens happens.
3.Glaucoma-optic nerve damage and loss of vision due to
increase in fluid pressure inside the eye.
2. DIABETIC RETINOPATHY
DR is becoming a more important problem worldwide.
Diabetic retinopathy (DR) is the most common cause of
blindness in age group 20-74 years. It starts with mild
nonproliferative abnormalities, characterized by increased
vascular permeability, and with the growth of new blood
vessels on the retina and posterior surface of the vitreous
progresses through moderate and severe nonproliferative
diabetic retinopathy (NPDR) characterized by vascular
closure, to proliferative diabetic retinopathy (PDR)[4].
According to survey around 60 million people in India are
diabetic with youngster are more in number[5].Person having
diabetics can prevent visual loss and blindness with diagnosis
and treatment. However, worldwide more than 50% of
patients suffering diabetics don't undergo any form of eye
examination. The use of digital photography for examining
retina by experts during screening programs appears to be
both sensitive and exact in the detection of the early
symptoms of diabetic retinopathy[6].DR is caused by changes
in retina's blood vessels. Sometimes blood vessels may swell
and leak fluid. otherwise normally, abnormal new blood
vessels grow on the surface of the retina. The light-sensitive
tissue at the back of the eye is known as retina .For
good vision a healthy retina is important[2]. 285 million
people are estimated to be visually impaired worldwide: 39
million are blind and 246 have low vision[7]. During starting
stage patients may not notice changes to their vision. But over
time, usually affecting both eyes DR gets worse and cause
vision loss .Diabetic retinopathy may also cause macular
edema which happens when fluid leaks into the part of the
retina that helps giving you the sharp, central vision you need
for reading, driving, and seeing fine details. Otherwise, things
look blurry[8].DR is due to long-standing hyperglycemia,
wherein retinal lesions (exudates and micro aneurysm and
hemorrhages) appear that could lead to blindness.
2.1 Stages of Diabetic Retinopathy
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig 2: comparison between normal retina and DR[9]
2.1.1. Mild Non-Proliferative Retinopathy
In this stages microaneurysms develop, MA is balloon-like
swelling in the tiny blood vessels of the retina. MA is caused
due to the distension of capillary walls.MA is the first clinical
sign of retinopathy. MAs are less than 125 µm in size and
appears as small circular reddish dots.
2.1.2 Moderate Non-Proliferative Retinopathy
Vessels supplying blood to the retina gets blocked.
2.1.3 Severe Non-Proliferative Retinopathy
Deprived areas of retina send signals to grow new blood
vessels in order to maintain nourishment as many blood
vessels are blocked. Consequently some areas of the retina do
not get enough blood supply.
2.1.4 Proliferative Retinopathy
During this stage, the signals are sent by the retina for the
growth of new blood vessels. New blood vessels formed are
abnormal and fragile, prone to haemorrhage (blood leakage),
that can lead to severe vision loss and even blindness[9].
Fig 3: Diabetic retinopathy stages[10]
2.2 Diabetic Retinopathy Detection
Some of the Eye Exams performed on the diabetic patients are
as follows:
2.2.1Visual Acuity Measurement
It measures the eye's ability to focus at different distances[11].
2.2.2 Ophthalmoscopy And Slit Lamp Exam
These tests allow doctor to view the back of the eye and
structures including blood vessels, nerve bundles, and
underlying layers within the eye. These can be used to detect
clouding of the lens (cataract), changes in the retina, and other
problems.
2.2.3 Optical Coherence Tomography
It is an imaging technique to get high-resolution images of the
retina and the interior segment of the eye, to determine the
thickness of the retina or the presence of swelling within the
retina. This method is also being used by cardiologists
132
ISBN: 978-81-924893-0-8
seeking to develop methods to check for fluid in your retina
[12,14,15].
2.2.4 Fundus Photography
Any process resulting in a 2-D image, where the image
intensities represent the amount of a reflected quantity of
light is known as fundus imaging and when for a specific
waveband image intensities represent the amount of reflected
light then it is called fundus photography. Fundus
photography gives exact images of the back of the eye (the
fundus). An eye doctor can compare images taken at different
times to see the progression of the disease and look how well
treatment is working[13,14].
2.2.5 Fundus Fluorescein Angiography
It is used to check for and locate any leaking blood vessels in
the retina of diabetic patients showing symptoms that suggest
damage to or swelling of the retina. can readily demonstrate
the extent and location of capillary drop out [14].
2.3 Image Preprocessing Methods
Sometimes the retinal images obtained are of low quality and
may contain artifacts because photographer does not have full
control over patient's eye so image preprocessing methods are
required. Also patients can't hold their eye still for a long time
during image processing leading retinal images often
unevenly illuminated with parts of the retinal image brighter
or darker compared to the rest of the image, or can also be
washed out with a little or complete loss of contrast[4].
Fig 4: Flow chart for the automated diagnosis of DR using
fundus image[15].
2.3.1 Detection of Retinal Vessel
Vessel detection can determine the severity of the disease and
effect of the treatment so detection of retinal vessel is
necessary and important too [16]. 2D matched filter based
method to detect blood vessel is found to be more efficient
than Sobel operator and morphological operator[17]. It is seen
that with the help of genetic algorithm matched filter's
sensitivity can be optimized [4].
Fig 5: animated retinal blood vessel picture[18]
2.3.2 Detection of Neovascularization
For the detection of the neovascularization studying blood
vessel is very important. Neovascularization is proliferation
of new blood vessels in the fundus area and inside the optical
disk. So segmentation of blood vessel is important step to
detect neovascularization[4].
2.3.3 Detection of Exudates
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The primary sign of DR are exudates. To slow down the
progression of retinopathy automatic detection is very
important as exudates are the early lesions of diabetic
retinopathy[4]. Malaya Nath et al. [19] proposed a novel
method that due to development of diabetics by using
independent component analysis (ICA) on wavelet sub bands
changes appearing in the color fundus image can be detected.
For the change detection the proposed method consists of
steps such as splitting to different color channels,
preprocessing, wavelet decomposition, selection of sub band,
formation of input matrix for ICA, and fast ICA. The method
for exudates detection proposed by Narsimhan et al. [20]
involves three steps first, color histogram processing follows
the localization of optic disc. detect the edges by segmenting.
The segmentation is obtained by locating the edges in the
smoothened input image. Third, for exudates detection color
histogram thresholding is used. The computational
intelligence technique and Fuzzy C-means clustering were
used for the exudates detection[4].
Fig 6: retina showing exudates
2.2.4 Detection of Microaneurysm
Reliable automatic detection of microaneurysms is a major
challenge. Some other challenges during detection of red
lesion are segmentation of small MA in the areas of low
image contrast and the presence of bright pathologies. To
detect MA Narsimhan et al. [20] gave the method which
involved morphological white top hat transformation to
enhance and isolate the micro aneurysm. The difference
between the input image and opened image gives the top-hat
transformed image. For efficiently extracting the small
circular structures from the image the structuring element is
rotated in twelve different orientations.
3. ACKNOWLEDGMENT
I am extremely grateful to my family for their constant
support. I would like to express my gratitude to my guide
Assistant Professor Mrs. Deepti Malhotra for her guidance
and advices.
REFERENCES
[1] http://www.who.int/mediacentre/factsheets/fs312/en/
[2] https://www.nei.nih.gov/health/diabetic/retinopathy
[3] K.Sangeetha,R.Karthiga,K.Jeyanthi,"Advanced Analysis
Of Anatomical Structures Using Hull Based Neuro-Retinal
Optic Cup Ellipse Optimization In Glaucoma Diagnosis",
2012 International Conference on Computer Communication
and Informatics (ICCCI -2012), Jan 10–12, 2012, Coimbatore,
INDIA.
133
ISBN: 978-81-924893-0-8
[4] Dipika Gadriye, Gopichand Khandale ,"Neural Network
Based Method for the Diagnosis of Diabetic
Retinopathy",2014 Sixth International Conference on
Computational Intelligence and Communication Networks
[5] http://www.tribuneindia.com/2012/20121115/dun.htm
[6] http://www.iovs.org/content/52/7/4866.full
[7] http://www.who.int/mediacentre/factsheets/fs282/en/
[8] http://www.webmd.com/diabetes/h2t-managing-diabetes-
11/diabetes-eye-care
[9]http://www.buchananoptometrists.co.nz/Services/Eye+Con
ditions/Diabetic+Eye+Disease.html
[10]http://mynotes4usmle.tumblr.com/post/42147240126/diab
etc-retinopathy-phases-non-proliferative#.VPBBXfmUdws
[11] Keith P. Thompson, Qiushi S. Ren, Member, IEEE, and
Jean-Marie Parel "Therapeutic and Diagnostic Application of
Lasers in Ophthalmology".
[12] R.K.Ghanta, W. Drexler, U. Morgner, F. Kartner, F.P
Ippen, J.G.Fujimoto, J.S. Schuman, A. Clermontt, S.Bursell,
"Ultrahigh resolution retinal imaging with optical coherence
tomography",CLEO 2000
[13] Zhuo Zhang, Feng Shou Yin, Jiang Liu, Wing Kee
Wong, Ngan Meng Tan, Beng Hai Lee, Jun Cheng, Tien Yin
Wong,"ORIGA-light:An Online Retinal Fundus Image
Database for Glaucoma Analysis and Research",32nd Annual
International Conference of the IEEE EMBS Buenos Aires,
Argentina, August 31 - September 4, 2010
[14] Michael D. Abràmoff, Senior Member, IEEE, Mona K.
Garvin, Member, IEEE, and Milan Sonka, Fellow,"Retinal
Imaging and Image Analysis", IEEE IEEE Reviews
inbiomedical Engineering, VOL. 3, 2010
[15] Arulmozhivarman Pachiyappan,Undurti N Das,
Tatavarti VSP Murthy and Rao Tatavarti,"Automated
diagnosis of diabetic retinopathy andglaucoma using fundus
and OCT images", Pachiyappan et al. Lipids in Health and
Disease 2012, 11:73
http://www.lipidworld.com/content/11/1/73
[16] Deepika Vallabha, Dorairaj R, Namuduri K, Thompson
H,"Automated Detection and Classification of Vascular
Abnormalities in Diabetic Retinopathy"
[17] A. Hoover, Kouznetsoza, V., Goldbaum, M. (2000)
“Locating blood vessels in retinal images by piecewise
threshold probing of a matched filter response.” IEEE
Transactions on Medical Imaging, 19, 203-210
[18] R.Sivakumar, G. Ravindran,M. Muthayya,S.
Lakshminarayanan, and C. U. Velmurughendran, "Diabetic
Retinopathy Analysis" Journal of Biomedicine and
Biotechnology•2005:1 (2005) 20–27•DOI:
10.1155/JBB.2005.20
[19] Malaya Kumar Nath, and Samarendra Dandapat,
“Detection of Changes in Color Fundus Images due to
Diabetic Retinopathy”, CISP2012|Proceedings|81.
[20] K.Narasimhan, V.C.Neha, K.Vijayarekha, “An Efficient
Automated System for Detection of Diabetic Retinopathy
from Fundus Images Using Support Vector Machine and
Bayesian Classifiers”, 2012 International Conference on
Computing, Electronics and Electrical Technologies
[ICCEET]
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Survey on Hybridization of Wireless Energy
Harvesting and Spectrum Sharing in Cognitive Radio
Ranjit Singh
Department of ECE
Punjabi University, Patiala
ranjitpup@gmail.com
ABSTRACT
Wireless Energy Harvesting in Cognitive radio is emerging as
a promising technique to improve the utilization of radio
frequency spectrum. In this paper, we consider the problem of
spectrum sharing among primary (licensed) and secondary
(unlicensed) users. Energy harvesting is a promising solution
to prolong the operation of energy-constrained wireless
networks.
Keywords
Wireless energy harvesting, cognitive radio, radio spectrum,
spectrum sharing.
1. INTRODUCTION
Energy harvesting, also known as power harvesting or energy
scavenging, is a process by which energy is derived from
external sources e.g. solar power, thermal energy, wind
energy, salinity gradients, and kinetic energy, captured, and
stored. Wireless Energy Harvesting is the process by which
energy is derived from external sources (e.g. solar power,
thermal energy, wind energy, salinity gradients, and kinetic
energy), captured, and stored for small, wireless autonomous
devices, like those used in wearable electronics and wireless
sensor networks. Energy harvesters provide a very small
amount of power for low-energy electronics the energy source
for energy harvesters is present as ambient background and is
free. For example, temperature gradients exist from the
operation of a combustion engine and in urban areas, there is a
large amount of electromagnetic energy in the environment
because of radio and television broadcasting.
A cognitive radio is an intelligent radio that can be
programmed and configured dynamically. Its transceiver is
designed to use the best wireless channels in its vicinity. Such
a radio automatically detects available channels in wireless
spectrum, then accordingly changes its transmission or
reception parameters to allow more concurrent wireless
communications in a given spectrum band at one location.
This process is a form of dynamic spectrum management. [1]
The key enabling technologies of CR networks are the
cognitive radio techniques that provides the capability to share
the spectrum in an opportunistic manner. Formally, a CR is
defined as a radio that can change its transmitter parameters
based on interaction with its environment
134
ISBN: 978-81-924893-0-8
Amandeep Singh Bhandari
Department of ECE
Punjabi University, Patiala
singh.amandeep183@gmail.com
Fig 1: Spectrum Access
.From this definition, two main characteristics of cognitive
radio can be defined:
1) Cognitive capability: Through real-time interaction with
the radio environment, the portions of the spectrum that are
unused at a specific time or location can be identified. CR
enables the usage of temporally unused spectrum, referred to
as spectrum hole or white space. Consequently, the best
spectrum can be selected, shared with other users, and
exploited with the licensed user.
2) Reconfigurability: A CR can be programmed to transmit
and receive on a variety of frequencies, and use different
access technologies supported by its hardware design [4].
Through this capability, the best spectrum band and the most
appropriate operating parameters can be selected and
reconfigured.
2. LITERATURE SURVEY
In 2013, Liang Liu et al suggested that by assuming a single-
antenna receiver that can only decode information of harvest
energy at any time because of the practical circuit limitation.
Therefore, it is important to investigate when the receiver
should switch between the two modes of information
decoding (ID) and energy harvesting (EH), based on the
instantaneous channel and interference condition. In this
paper, the author derived the optimal mode switching rule at t
to achieve various trade-offs between wireless information
transfer and energy harvesting. [2]
In 2013, Ali A Nasir et al proposed that an amplify and-
forward (AF) relaying network is considered, where an energy
constrained relay node harvests energy from the received RF
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
signal and uses that harvested energy to forward the source
output to the destination input. Two relaying protocols,
namely, i) time switching-based relaying (TSR) protocol and
ii) power splitting-based relaying (PSR) protocol are proposed
to enable energy harvesting and information processing at the
relay. In order to determine the throughput, analytical
expressions for the outage probability and the ergodic
capacity are derived for delay-limited and delay-tolerant
transmission modes, respective.[3]
In 2013, Seunghyun lee et al suggested that wireless networks
can be self-sustaining by harvesting energy from ambient
radio-frequency (RF) signals. Recently, researchers have
made progress on designing efficient circuits and devices for
RF energy harvesting suitable for low-power wireless
applications. Motivated by this and building upon the classic
cognitive radio (CR) network model, this paper described a
novel method for wireless networks coexisting where low-
power mobiles in a secondary network, called secondary
transmitters (STs), harvest ambient RF energy from
transmissions by nearby active transmitters primary network,
called primary transmitters (PTs), while opportunistically
accessing the spectrum licensed to the primary network.[4]
In 2014, Zihao wang et al developed a wireless energy
harvesting and information transfer protocol in cognitive two-
way relay networks, in which a secondary network scavenges
energy from ambient signals of primary network while shares
the spectrum by assisting the primary transmission. In
particular, two primary users exchange information through
an energy harvesting secondary user which firstly harvests
energy from the received primary signals and then uses the
harvested energy to forward the remaining primary signals
along with the secondary signals [5].
In 2014, Cryril Leung et al described a resource allocation
problem for spectrum sharing in cognitive radio networks.
Specifically, the authors investigate the joint sub-channel, rate
and power allocation for secondary users which share, in a
non-disruptive manner, some frequency bands with primary
users using OFDM technology. The authors considered the
resource allocation problem for downlink and take into
account the maximum total power constraints of the base
station and the power constraints determined by distributed
spectrum sensing and scanning. [6]
In 2014. S. Ali Mausavifar et al proposed a wireless energy
harvesting protocol for a decode and forward relay assisted
secondary user network in a cognitive spectrum sharing
paradigm and expression for outage probability of the
following power constraints: 1)The maximum power that the
source and relay in the secondary user network can transmit
from the harvested energy, 2)The peak interference power
from the source and the relay in the SU network at the
primary user network, 3)The interference power of PU
network at the relay assisted secondary user network .[7]
In 2015, Ying Cui et al suggested to study the grid power-
delay trade off in a point-to-point energy harvesting wireless
135
ISBN: 978-81-924893-0-8
communication system with finite energy storage capacity
serving delay-sensitive applications. This communication
system is powered by both grid and renewable power sources.
The authors considered the average grid power consumption
minimization subject to the data queue stability and renewable
energy availability constraints. By exploring the optimality
property and using the theory of random walks, we transform
the grid power minimization problem to an asymptotically
equivalent problem. [8]
In 2015, Mojtaba nourian et al proposed a design
methodology for optimal energy allocation to estimate a
random source using multiple wireless sensors equipped with
energy harvesting technology. In this framework, multiple
sensors observe a random process and then transmit an
amplified un-coded analog version of the observed signal
through Markovian fading wireless channels to a remote
station. The sensors have access to an energy harvesting
source which is an everlasting but unreliable random energy
source compared to conventional batteries with fixed energy
storage. [9]
3. CHANNEL CHARACTERISTICS IN
COGNITIVE RADIO NETWORKS
Because available spectrum holes show different
characteristics that vary over time, each spectrum hole should
be characterized considering both the time-varying radio
environment and spectrum parameters, such as operating
frequency and bandwidth. Hence, it is essential to define
parameters that can represent a particular spectrum band as
follows:
1) Interference: From the amount of interfere at the primary
receiver, the permissible power of a CR user can be derived,
which is used for the estimation of channel capacity.
2) Path loss: The path loss is closely related to distance and
frequency. As the operating frequency increases, the path loss
increases, which results in a decrease in the transmission
range. If transmission power is increased to compensate for
the increased path loss, interference at other users may
increase.
3) Wireless link errors: Depending on the modulation scheme
and the interference level of the spectrum band, the error rate
of the channel changes.
4) Link layer delay: To address different path loss, wireless
link error, and interference, different types of link layer
protocols are required at different spectrum bands. This
results in different link layer delays. It is desirable to identify
the spectrum bands that combine all the characterization
parameters described previously for accurate spectrum
decision. However, a complete analysis and modeling of
spectrum in CR networks has not been developed yet.
4. SPECTRUM SHARING
The shared nature of the wireless channel requires the
coordination of transmission attempts between CR users. In
this respect, spectrum sharing should include much of the
functionality of a MAC protocol. Moreover, the unique
characteristics of CRs, such as the coexistence of CR users
with licensed users and the wide range of available spectrum,
incur substantially different challenges for spectrum sharing
in CR networks. The existing work in spectrum sharing aims
to address these challenges and can be classified by four
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
aspects: the architecture, spectrum allocation behavior,
spectrum access technique, and scope.
The first classification is based on the architecture, which can
be centralized or distributed:
Centralized spectrum sharing: The spectrum allocation and
access procedures are con-trolled by a central entity.
Moreover, a distributed sensing procedure can be used such
that measurements of the spectrum allocation are forwarded to
the central entity, and a spectrum allocation map is
constructed. Furthermore, the central entity can lease
spectrum to users in a limited geographical region for a
specific amount of time. In addition to competition for the
spectrum, competition for users can also be considered
through a central spectrum policy server.
Distributed spectrum sharing: Spectrum allocation and access
are based on local (or possibly global) policies that are
performed by each node distributively. Distributed solutions
also are used between different networks such that a base
station (BS) competes with its interferer BSs according to the
QoS requirements of its users to allocate a portion of the
spectrum.
The recent work on comparison of centralized and distributed
solutions reveals that distributed solutions generally closely
follow the centralized solutions, but at the cost of message
exchanges between nodes.
The second classification is based on allocation behavior,
where spectrum access can be cooperative or non-
cooperative.
Cooperative spectrum sharing: Cooperative (or collaborative)
solutions exploit the interference measurements of each node
such that the effect of the communication of one node on
other nodes is considered. A common technique used in these
schemes is forming clusters to share interference information
locally. This localized operation provides an effective balance
between a fully centralized and a distributed scheme.
Non-cooperative spectrum sharing: Only a single node is
considered in non-cooperative (or non-collaborative, selfish)
solutions. Because interference in other CR nodes is not
considered, non-cooperative solutions may result in reduced
spectrum utilization. However, these solutions do not require
frequent message exchanges between neighbors as in
cooperative solutions.
Cooperative approaches generally outperform non-
cooperative approaches, as well as closely approximating the
global optimum. More-over, cooperative techniques result in a
certain degree of fairness, as well as improved through-put.
On the other hand, the performance degradation of non-
cooperative approaches are generally offset by the
significantly low information exchange and hence, energy
consumption.
The third classification for spectrum sharing in CR
networks is based on the access technology:
• Overlay spectrum sharing: Nodes access the network
using a portion of the spectrum that has not been used by
licensed users. This minimizes interference to the
primary network.
• Underlay spectrum sharing: The spread spectrum
techniques are exploited such that the transmission of a
CR node is regarded as noise by licensed users.
Underlay techniques can utilize higher band-width at the
cost of a slight increase in complexity. Considering this trade-
off, hybrid techniques can be considered for the spectrum
access technology for CR networks.
136
ISBN: 978-81-924893-0-8
Fig 2. Opportunistic (secondary) spectrum usage with
underlay spectrum sharing (low power) and overlay
spectrum sharing (higher power) [9]
Finally, spectrum sharing techniques are generally focused
on two types of solutions: spectrum sharing inside a CR net-
work (intranetwork spectrum sharing) and among multiple
coexisting CR networks (internetwork spectrum sharing), as
explained in the following:
• Intranetwork spectrum sharing: These solutions focus on
spectrum allocation between the entities of a CR
network, as shown in Fig. 6. Accordingly, the users of a
CR net-work try to access the available spectrum
without causing interference to the primary users.
Intranetwork spectrum sharing poses unique challenges
that have not been considered previously in wireless
communication systems.
• Internetwork spectrum sharing: The CR architecture
enables multiple systems to be deployed in overlapping
locations and spectrum, So far the inter-network
spectrum sharing solutions provide a broader view of the
spectrum sharing concept by including certain operator
policies.
5. CONCLUSION
The spectrum sharing in CRNs is more challenging than the
traditional wireless networks. Here, spectrum band varies
continuously across the space and time in terms of both
availability and quality. This varying nature of spectrum
demands for a radio environment-aware optimized spectrum
allocation mechanism. In this article, we present a spectrum
sharing scheme that schedules the sensed spectrum holes
among cognitive radio (CR) users by considering the changes
occur in the radio environment as well as the PU’s activity on
current in use channels. In the proposed framework, we
assume slotted structure where each CR performs sensing
operation at the start of each slot. The CR monitors the in-use
channel for PU activity. If the channel is still idle, it will
perform the transmission on the same channel otherwise it
looks for some other channel for transmission or remains
silent during the entire time slot to avoid interference with
PU. We also propose a dynamic framing process at MAC
layer, which can form variable size frames depending upon
the capacity of available channels. The simulation results
show that our proposed scheme outperforms in saving the
transmission power while ensuring required throughput and
fairness. Moreover, we compare the service time and
throughput of CR user against different file sizes. The PU
arrival activity on the available channels degrades the
performance of the CRN but in our scheme, the periodic
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

monitoring significantly enhances the performance by [8] Mojtaba Nourian et al.2015. Distortion Minimization in
reducing the number of retransmission. Multi-Sensor Estimation with Energy Harvesting IEEE
Journal on Selected Areas in Communications. DOI
10.1109/JSAC.2015.2391691,pp 1-15

REFERENCES [9] Lars Berlemann and Stefan Mangold. 2009. Cognitive

Radio and Dynamic Spectrum Access, John Wiley & Sons
[1]Lu Lu*, Xiangwei Zhou et al 2012, Ten years of research
Ltd.
in spectrum sensing and sharing in cognitive radio, EURASIP
Journal on Wireless Communications and Networking,pp1-6.
[10]Finite Renewable Energy Storage, IEEE Journal on
Selected Areas in Communications DOI
[2] Liang Liu et al. 2013. Wireless Information Transfer with
10.1109/JSAC.2015.2391836, pp 1-16.
Opportunistic Energy Harvesting, IEEE Transactions on
Wireless Communications, VOL. 12, NO. 1, pp 288-300.
[11]M. J. Neely. 2006. Energy optimal control for time-
varying wireless networks, IEEE Trans. Inf. Theory, vol. 52,
[3] Ali A. Nasir et al. 2013. Relaying Protocols for Wireless
no. 7, pp. 2915–2934.
Energy Harvesting and Information Processing, IEEE
Transactions on Wireless Communications, VOL. 12, pp
[12] L. Georgiadis, M. J. Neely, and L. Tassiulas. 2006.
3622-3635.
Resource allocation and cross-layer control in wireless
networks, Foundations and Trends in Networking, vol. 1, no.
[4] Seunghyun Lee et al. 2013. Opportunistic Wireless Energy
1, pp. 1–144.
Harvesting in Cognitive Radio Networks, IEEE Transactions
On Wireless Communications, VOL. 12,pp4788-4799
[13] Y. Cui and V. Lau, “Distributive stochastic learning for
delay-optimal OFDMA power and sub-band allocation,”
[5] Zihao Wang et al. Wireless Energy Harvesting and
IEEE Trans. Signal Process. vol. 58, no. 9, pp. 4848–4858,
Information Transfer in Cognitive Two-Way Relay Networks,
September 2010.
IEEE Trans. Commun., vol. 61,no. 8, pp. 3181–3191
[14] Y. Cui, Q. Huang, and V. Lau, “Queue-aware dynamic
[6] Cryril Leung et al. Energy Harvesting Wireless
clustering and power allocation for network MIMO systems
Communications with Energy Cooperation between
via distributed stochastic learning,” IEEE Trans. Signal
Transmitter and Receiver, 10.1109/TCOMM.2015pp1-12
Process, vol. 59, no. 3, pp. 1229–1238, March 2011.
[7] S. Ali Mausavifar et al. a wireless energy harvesting
[15] Y. Cui, V. Lau, and Y. Wu, “Delay-aware BS
protocol for a decode and forward relay
discontinuous transmission control and user scheduling for
energy harvesting downlink coordinated MIMO systems,”
[7] Ying Cui et al. Grid Power-Delay Tradeoff for Energy
IEEE Trans. Signal Process., vol. 60, no. 7, pp. 3786– 3795,
Harvesting Wireless Communication Systems with IEEE
July 2012.
Transactions On Wireless Communications, VOL. 12, NO. 1,
pp 44-78.

137
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Hybrid Modulation
Rishav Dewan Gagandeep Kaur
BGIET, Sangrur BGIET, Sangrur
Abstract:. This paper proposes a hybrid single carrier
sinusoidal modulation suitable for multiphase multilevel
inverters. Multiphase multilevel inverters are controlled by
hybrid modulation to provide multiphase variable voltage
and a variable frequency supply. The proposed modulation
combines the benefits of fundamental frequency
modulation and single carrier sinusoidal modulation
strategies. It has low computational complexity. It involves
hybrid modulation without coding and hybrid modulation
concatenated with convolution encoding. We introduce a
novel method for high data rate transmission in ultra-
wideband communication system. This is achieved through
a new approach based on hybrid techniques between pulse
position modulations (PPM), pulse amplitude modulation
(PAM), pulse shape modulation (PSM) using combinations
between a minimum possible number of modified hermite
polynomial (MHP) functions by recalling their
orthogonality property. This paper is organized in the
following way section-1 is introduction, section-2 hybrid
pwm algorithm development, section-3 is ultra-wideband,
and section-4 is conclusion.
Keywords:
PAM- Pulse Amplitude Modulation
PPM- Pulse Position Modulation
PSM- Pulse Shape Modulation
MHP- Modified Hermite Polynomial
1. INTRODUCTION
Hybrid modulation is a combination of two types of
modulation. Hybrid modulation strategies represent
combination of fundamental frequency modulation and
multilevel sinusoidal strategies and designed of the well-
known alternative phase opposition, phase shifted carrier,
carrier based space vector modulation, and single carrier
sinusoidal modulation. Multiphase machine drives have
attracted considerable interest among researchers in
advantage of multiphase machine include improved
reliability and increased fault tolerance, greater efficiency,
high torque density and reduce the rotatory pulsation, low
per phase power handling requirement, enhanced
modularity and improved noise characteristics. Multilevel
converter technology is based on synthesis of voltage
waveforms from several DC voltage levels. As number of
levels increases, the synthesized output voltage produces
more steps and a waveform that approaches the reference
more accurately. Major advantages are-
 Low harmonic distortion
 Reduced switching losses
 Increased efficiency
 Good electromagnetic compatibility
Multilevel inverters are also finding increased attention in
industry as a choice of electronic power conversion for
medium voltage and high power applications, because
138
ISBN: 978-81-924893-0-8
Harjeet Kaur
BGIET, Sangrur
improving the output waveform of the inverter reduces its
harmonic content and, hence, the size of the filter used and
the level of electromagnetic interference (EMI) generated
by switching operation. Various multilevel converter
structures are reported in the literature. The cascaded
multilevel inverters appears to be superior to other
multilevel inverters in application with the high power
rating due to its modular nature of modulation as well as
its control and protection requirements for each full bridge
inverter. The power circuit for the 5-phase having 5 levels
cascaded inverter topology used to examine the proposed
PWM technique is shown in fig.1. Modulation control of a
multiphase multilevel inverter is quite challenging and
much of the reporting research is based on somewhat
heuristic investigations.
Switching loss in high power high voltage converters
create a problem in any switching transitions that can be
eliminated without compromising the harmonic content of
the final waveform are considered advantageous
2. Hybrid PWM algorithm development
a) Multiphase Single Carrier Sinusoidal Modulation:-
A level single carrier sinusoidal PWM is the result of
two sinusoidal modulating signals with the fundamental
frequency f , and amplitude m and one carrier signal.
This PWM technique is aimed at high power voltage
source inverter system in utility applications where the
output frequency is fixed to utility’s grid frequency.
b) Carrier Sinusoidal Modulation:-The principle behind
this hybrid modulation is to mix fundamental frequency
PWM and conventional SC-SPWM for each inverter
module operation, so that the output contains the
features of both. Unfortunately this arrangement causes
switch losses and therefore differential heating among
the Switches in order to overcome this problem a
sequential switching scheme Is embedded into this
hybrid modulation. Fig.2 shows that the general
structure of the proposed hybrid SC-SPWM scheme
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
It consists of a base PWM generator and a hybrid PWM
controller to generate the new pulses. In this modulation
operation, three base PWM signals are needed for each
module operation in a cascaded multilevel inverter. A
sequential signal (A) is a square wave signal with a 50%
duty ratio and half the fundamental frequency. This signal
makes every power switch operate with SC-SPWM and
fundamental frequency PWM sequentially to equalize and
power losses among the switches. Fundamental frequency
PWM (B) is a square wave signal synchronized with a
modulation waveform; B = 1 during the positive half cycle
of the modulation signal, and B = 0 during negative half
cycle. A SC-SPWM signal is obtained by a comparison of
the rectified modulation waveform of each module with
the carrier waveform. The amplitude of the modulation
waveform is defined as. A SC-SPWM pulse for inverter-I
(C) is obtained by a comparison between the rectified
modulation waveform and the carrier signal while a SC-
SPWM Pulse, for the inverter-II (D) is obtained by a
comparison between the rectified modulation waveform
with a bias of and the carrier waveform.
3. ULTRA-WIDEBAND
UWB is a baseband communications in which very short
duration pulses in the order of sub nanoseconds with very
low power spectral density (-41.5 dBm/ MHz) Are directly
radiated to the air. This technology has many synonyms in
technical literature as baseband, carrier-free or impulse
radio According to Federal Communication Commission
(FCC), a radiator is defined as UWB transmitter if it has a
fractional bandwidth (FB) equal or > than 0.2, where FB=
Signal bandwidth/ Center frequency
Due to very low power in UWB systems, transmission of
multiple version of pulses for the same information come
to play an important role-to collect energy for detection in
conventional modulation techniques such as pulse position
modulation (PPM). At the same time no transmissions
between any two successive pulses guarantee to avoid inter
symbol interference (ISI) during certain durations. This
duration should be at least as long as impulse response
(IR), which means low data rates. By this low data rate it
can be said that spectrum is not used in an effective way.
Hence, searching for techniques allowing this repetition,
avoiding ISI and at the same time provide high data rates
become more than to be convenient. Here we propose a
scheme that employs a combination of pulse shape, pulse
amplitude and pulse position modulation to generate bio
139
ISBN: 978-81-924893-0-8
orthogonal pulses for the transmission of multiple bits or
symbols. This allows to transmit more information than the
conventional proposed systems in the same amount of time
even with better performance.
a) A Hybrid UWB Transmission Scheme:-In the propose
scheme, each bit of system is Represented by Nf pulse
pairs, where Nf is a positive integer the two pulses in
each pair are separated by a fixed time Td. The time we
take to transmit a symbol is Ts. Each symbol period is
partitioned into NF frames, each of duration Ts. each
frame is partioned into NC chips each of duration Tc,
which typically corresponds to a pulse period. The three
quantities Ts,Tf and Tc satisfied the following
relationship: Ts = NfTf = NfNcTc
.
(b)Time-hoping (TH) and polarity scrambling are applied
on each symbol to obtain processing gain, to combat
multiple-access interference (MAI), and to smooth the
signal spectrum. Specifically each pulse pair is delayed by
a pseudorandom polarity scrambling that can take on the
values +1 (24); this can be easily undergone at the
receiver.
b) Conventional UWB Transmission:- Systems in this
section we describe with typical UWB transmission
systems and uses as a motivation for proposed system .
If multiple access systems would have been made only
with pulses having uniform space then a chance for the
collisions can occur where a large number of pulses
from the two signals are received at the same time
instants which lead to the corruption of message.
Therefore a random PPM sequence is employed. The
sequences have a period N with each element. Thus this
code provides an additional time shift to each pulse.
These added time shifts are discrete. This additional
time shift could be chosen to be greater or equal the chip
duration. Hence, the two sequences become fully
orthogonal to each other and we can achieve better
performance.
c) Proposed System Description based on Orthogonal
Hermite Pulse Shape:-Modified hermite polynomial
(MHP) pulses are orthogonal to each other. Another
advantage of MHP pulses is that the time duration and
the bandwidth of the pulses do not change when the
order of pulses is increased. But the drawback of MHP
is that the probability of error increases when narrower
correlation peak is present.
4. CONCLUSION
We have proposed a hybrid UWB modulation scheme that
allows reception with good quality. The key idea is to
transmit information with better quality. This allows to
transmit more information than the conventional proposed
systems in the same amount of time even with better
performed for the same SNR. In this multipath propagation
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
is also exploited. In this paper methods to reduce switching
losses of conventional single carrier PWM scheme with
low computational is described
REFERNCES
1) R. van Nee, R. Prasad, OFDM for Wireless Multimedia
Communications, Artech House Publishers, 2000.
2) Han, S. H., Lee, J. H., “An Overview of Peak-ti-
Average Power Ratio Reduction Techniques for
Multicarrier Transmission”, IEEE Wireless Comm.,
Vol. 12, pp.56-65, April 2005.
3) Muller , S. H., Baumal , R. W., Huber, J. B., “OFDM
with reduced peak-to-average power ratio by multiple
signal representation”, Annals of Telecomm., Vol. 52,
pp 58-67, Feb 1997
140
ISBN: 978-81-924893-0-8
4) J. G. Proakis, Digital Communications, 4th Ed.
MeGraw Hill Series in Electrical Engineering, 2000.
5) A. Latif, N. D. Godhar , “A Hybrid MQAM-LFSK
OFDM Transciever with Low PAPR,” 2nd IEEE Int.
Conf. on Wireless Communications, Networking and
Mobile Computing (WiCom06), Sept. 22-24, 2006
China
6) M. Wetz, W. G. Teich, J. Lindner,”PAPR Reduction
Methods for Noncoherent OFDM-MFSK”, Proc. 3rd
COST 289 Workshop , Aveiro/Portugal, Jul. 2006
7) Saha, D., Birdsall, T., G.,”Quardrature-Quardrature
Phase Shift Keying “, IEEE Trans. Comm. Pp437-448,
Vol. 37, No.5, May 1989
8) M. G. diBenedetto, T. Kaiser, A. F. Molisch, I.
Oppermann, C. Politano, and D. Porcino, Eds., UWB
Communications Systems: A Comprehensive
Overview. New York: Hindawi, 2006.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Removal of Power line Interference from EEG using
Wavelet-ICA
Gautam Kaushal V.K.Jain
Department of E.I.E. Department of E.I.E.
S.L.I.E.T.Lonhgowal (Punjab) S.L.I.E.T. Longowal (Punjab)
gautam_kaushal@yahoo.com
ABSTRACT
Electroencephalogram (EEG) signals are of having very small
amplitudes and so these can be easily contaminated by
different Artifacts. Due to the presence of various artifacts in
EEG, its analysis becomes difficult for the clinical evaluation.
Major types of artifacts that affect the EEG are Power Line
noise, eye movements, Electromyogram (EMG), and
Electrocardiogram (ECG). Out of these artifacts Power Line
noise and eye movements related are most prominent. To deal
with these artifacts, there are various methods evolved by
different researchers. In this paper, to remove power line
noise of 50 Hz frequency, a new Wavelet analysis and
Independent Component Analysis (ICA) based technique is
presented, which is applied to a single channel EEG Signal.
The signal is first decomposed into spectrally non-overlapping
components using Stationary Wavelet Transform (SWT). The
SWT decomposes single channel EEG signal into components
based upon different frequency levels. The ICA algorithm is
then applied to derive the independent components. The
wavelet-ICA components associated with artifact related
event is selected and cancelled out. The artifact free wavelet
components are reconstructed to form artifact free EEG. The
performance analysis of the algorithm is done using Signal to
Noise Ratio (SNR).
Keywords
EEG, SWT, ICA, SNR, CWT, DWT
1. INTRODUCTION
The electrical activity of active nerve cells produces currents
spreading through the head which can be recorded as the
electroencephalogram (EEG), which are complex in nature.
EEG signals ranges from 0.5 to 100 μV in amplitude (peak to
peak), which is about 100 times lower than ECG signals [1].
EEG waveforms can be categorized into four basic groups:
delta (0.4-4 Hz), theta (4-8 Hz), alpha (8-13 Hz) and beta (13-
30 Hz)[1]. Due to very low in amplitude, EEG signals are
prone to artifacts and noise. The noise can be electrode noise
or can be generated from the body itself. These various types
of noises that can contaminate the signals during recordings
are the electrode noise, baseline movement, EMG disturbance,
eye movements, eye blinks and sometimes ECG disturbance.
The noises in the EEG signals are called the artifacts. Critical
point in EEG signal processing is the need for careful
treatment and reduction of these artifacts which contaminate
the EEG signals and thus can lead to wrong results and
conclusions. There are many approaches to deal with these
artifacts. Simply rejecting contaminated EEG epochs is one of
the common methods. But this method involves manually
reviewing the data, identifying contaminated segments, and
141
ISBN: 978-81-924893-0-8
Amanpreet Singh
Punab Technical University
Jalandhar (Punjab)
then subsequently rejecting those segments. This process is
laborious and it results in unacceptable data loss when there is
a high degree of contamination in the raw data. Alternative to
this method is to remove the artifact/noise from the data
which includes different methods such as filtering, Wavelet
Transform, Independent component Analysis (ICA).
This paper represents a new algorithm based on joint use of
ICA and Wavelet Analysis. ICA is a multichannel technique
[2]. Thus, ICA cannot be applied directly to Single channel
EEG signal. Thus it needs a technique which can represent the
Single channel signal into virtual multichannel signal [7].
Wavelet Transform is used to decompose the signal. Then
ICA is applied and then Wavelet-ICA components are
reconstructed back to form de-noised signal.
2. EASE OF USE
2.1 Wavelet Transform
The wavelet transform (WT) [3,4,5] is one of the leading
techniques for processing non-stationary signals. The WT is
thus well suited for EEG signals, since these are non-
stationary. The major feature of the WT is its capacity of
decomposing a signal into components that are well localized
in scale (which is essentially the inverse of frequency) and
time [6]. The continuous WT (CWT) uses a family of
wavelets by “continuously” scaling and translating a localized
function called the mother wavelet. The discrete WT (DWT)
is obtained by discretising the scale and translation variables
“dyadically”, i.e. by using powers of two. This allows to
implement the CWT on a computer. The DWT is not
translation invariant [5]. However, such invariance is required
in some applications like change detection and de-noising [5].
The transform obtained by removing the down- samplers and
up-samplers from the CWT is translation invariant, and
naturally called the stationary WT (SWT) [5]. The discrete
wavelet transform (DWT) decomposes the signal into two
phases: detail and approximation data on different scales. The
approximation domain is sequentially decomposed into
further detail and approximation data. These decompositions
of the signal act as the input matrix for ICA technique. The
DWT means choosing subsets of the scales „a‟ and positions
„b‟ of the mother wavelet ψ (t).
ψ(a,b)(t) = 2a/2 (2at-b) (1)
Here, the mother wavelet functions are dilated by powers of
two and translated by integers. Scales and positions chosen
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

based on power of two are named as dyadic scales and
positions. The discrete wavelet transform does not preserve
the translation invariance [8]. To preserve the translation
invariance property, a new approach has been defined as
stationary wavelet transform (SWT) which is close to the
DWT one [9].
2.1 ICA
Independent Component Analysis (ICA) [2] involves the
task of computing the matrix projection of a set of
components onto another set of so called independent
component. Here, the objective is to maximize the statistical
independence of the outputs. If the inputs to the ICA are
known to be linear instantaneous mixture of a set of sources,
the ICA process provides an estimate of the original sources.
The original source vector S is of size M x N and the mixing
matrix A is of size M x M, where M is the number of
statistical independent sources and N is the number of
samples in each source.
The result of the separation process is the de-mixing
matrix W which can be used to obtain the estimated statistical
independent sources, Ŝ from the mixtures.
matrix. The FastICA is applied to the decomposed signal to
find out the mixing and un-mixing matrix (A and W
respectively) along with the matrix of independent
components. After this, selection of desired sources of interest
is done, i.e. here we remove the components related to
artifacts. To obtain the appearance of signal in the form of
wavelet components, the source of interest is multiplied with
the mixing matrix A. and to recover the signal in the form of
original signal; wavelet reconstruction is done using inverse
stationary wavelet transform (ISWT).
3. Results and discussion
Procedure described above is applied on 20 different epochs
of 4 patients. Data was taken from CSIO Chandigarh, The
time period of signals was 4 seconds with 1024 number of
samples and sampling frequency 256 samples per second.
Figure 1 shows the raw EEG signal, and signal after removing
baseline wandering. FFT of raw signal and filtered signal with
proposed algorithm are plotted and shown in figure 2 and 3
respectively.
Raw Electroencephalogram (EEG) Signal
Amplitude (mV) 500

In the EEG signal processing, if the number of channels 0

(mixed signals) are more than or equal to the sources, ICA -500
algorithm is suitable. A group of algorithms i.e. ICA can
-1000
recover these sources. The modeling of ICA can be done by
following equation stated as -1500
0 0.5 1.5 1 2 2.5 3 3.5 4
Time (seconds)
x =A.s (2) Raw Electroencephalogram (EEG) Signal after removal of baseline wandering
1000
Amplitude (mV)

Where, x is the mixed signal, s is the number of sources 500

determined and A is the mixing matrix. The main aim of ICA
0
is to find out the un-mixing matrix W to acquire the
independent components under the conditions of independent -500
criterions. -1000
0 0.5 1 1.5 2 2.5 3 3.5 4
Time (seconds)
s*= W.x (3)
Figure1. EEG Signal in original form are shown, with raw
W=A-1 (4) signal (red), Raw EEG after removing baseline wandering
(blue)
If the coefficients s* are treated as independent random
variables then we have a generative linear statistical model. 4
FFT of raw Signal
x 10
Furthermore if we assume that A is square and invertible we 2.5

have the classic ICA model [2,5]. In this paper FastICA

algorithm is applied. It estimates the independent components
2
from given multi-dimensional signals.

2.2 Wavelet-ICA 1.5

abs fft

In ICA model, the input must be a matrix and not a vector [6].
This means we can‟t apply ICA directly to the single channel
1
signal. So, it is necessary to construct the input matrix if
single channel data is available. Wavelet decomposition is
used to form the input matrix in the method of Wavelet-ICA 0.5
technique.

First of all baseline wandering is removed by taking average 0

0 10 20 30 40 50 60
of the signal. Then SWT is used for wavelet decomposition Frequency (Hz)

with mother wavelet Symlet and decomposition level 8. This Figure2. FFT of Original Signal
decomposed signal acts as input for the ICA in the form of

142
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

x 10
4
FFT of Filtered Signal The low pass signal also generates some distortion in the
2
filtered signal which can lead to information loss. The present
1.8
method preserves the signal and chances of information loss
1.6
are minimal.
1.4

1.2 Table1. Comparison of SNR of Low Pass Filter and

abs fft

1 Proposed Method
0.8
Subject SNR of Low Pass SNR of Proposed
0.6
Filter Method
0.4

0.2 1 43.10 47.28

0
0 10 20 30 40 50 60
Frequency Range 2 41.86 45.12
Figure3. FFT of Filtered signal with proposed algorithm 3 43.06 46.86

100
Filtered Signal from Proposed Algorithm
4 41.76 45.27
80

60 4. CONCLUSION
40 In this paper, a method is proposed for the removal of power-
20 line interference from a Single channel EEG signal on the
AMP (mV)

0 basis of joint use of wavelet analysis and FastICA technique.

-20 Stationary wavelet analysis is done to de-compose the signal
-40
vector into input matrix for the ICA technique. In this paper,
-60
the target noise was 50 Hz power line noise. When compared
-80
with low pass filter, this method shows better SNR results
-100
with negligible information loss.
0 0.5 1 1.5 2 2.5 3 3.5 4
TIME (sec)

Figure4. Filtered EEG Signal using proposed algorithm 5. ACKNOWLEDGEMENTS

We are thankful to CSIO, Chandigarh for providing the EEG
data, their facilities and equipment available for this study.

REFERENCES
[1] M. Teplan, “Fundamentals of EEG measurement,”
Measurement Science Review, 2002; Vol. 2
[2] Aapo Hyvärinen, Erkki Oja, “Independent component
analysis: algorithms and applications,” Neural Networks,
2000; 13: 411-430
[3] S. Mallat., “A Wavelet Tour of Signal Processing,”
second ed. Academic Press, 1999
[4] G. P. Nason, B. W. Silverman, “The stationary wavelet
transform and some statistical applications,” Lecture
Notes in Statistics 103 (1995) 281–300.
[5] Giuseppina Inuso, Fabio La Foresta, “Wavelet-ICA
methodology for efficient artifact removal from
electroencephalographic recordings,” Proceedings of
Figure5. Signals in frequency domain are shown, with raw
International Joint Conference on Neural Networks,
signal (blue line), result from LPF (green line) and using 2007; pp. 12-17
the Wavelet-ICA proposed Algorithm (red line) [6] Lin, J., Zhang, “A. Fault feature separation using
wavelet-ICA filter” NDT & EInt., 2005; Vol.38: 421-427
The performance analysis of the algorithm was done using [7] Monika Sheoran etl. “Wavelet-ICA based Denoising of
signal to noise ratio (SNR). The results of the proposed Electroencephalogram Signal” IJECT ISSN 0974-2239
algorithm are compared with that of low pass filter, and are Volume 4, Number 12 (2014); pp. 1205-1210
shown in table 1. The present method shows better results [8] P. Senthil Kumar, R. Arumuganathan, K. Sivakumar, C.
Vimal A wavelet based statistical method for de-noising
with higher SNR as compared to the low pass filter, and it is
of ocular artifacts in EEG signals International Journal of
consistent for all the signals. The frequency correlation graph Computer Science and Network Security, 2008; Vol.8(9)
of the present method and low pass filter is shown in figure 5 [9] Michel Misiti, Yves Misiti, Georges Oppenheim, Jean-
with the original signal. The SNR value of proposed method Michel Poggi Wavelet toolbox user guide, R2013b,
is better as compared to that of a low pass filter (table 1). 2013; 3:73-91
Filtered signal using the proposed algorithm in time domain is
shown in figure 4.

143
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Survey on Reversible Logic Gates
Santosh Rani
Department of ECE
Punjabi University, Patiala
Sammyrai82@gmail.com
ABSTRACT
Reversible computing is more attractive research area to
reduce power dissipation as compare to conventional
computing where dissipates more power by losing bits of
information. Reversible computing recovers from losing bits
of information through unique path from each state to its
previous state. The main purpose of designing the reversible
computing to reduce the garbage output, gate count and
quantum cost. Reversible computing is used in Nano-
technology, low power CMOS design, Optical computing and
Quantum computing.
Keywords
Reversible logic gates, garbage output, quantum cost, power
dissipation.
1. INTRODUCTION
Reversibility in computing implies that information about the
computational states should never be lost. In Conventional
computing all logical operations performed by millions of
gates thus lost the bits of information and is dissipated in the
form of heat. It has been shown that for every bit of
information lost in conventional computations KT*log2 joules
of heat energy are generated where K is Boltzmann’s constant
and T is absolute temperature. For room temperature the
amount of dissipate heat is small, but not negligible. In [1]
Landauer.R proved that heat dissipation is avoidable if system
is made reversible.
In [2] Bennett showed that a reversible computing, in which
no information is destroyed and dissipate small amount of
heat. A reversible logic gate must have same number of inputs
and outputs lines. The unique output vector produced from
each input vector. This is termed as “logically reversibility”.
Physical reversibility is a process that dissipates no heat in
terms of wastage of energy. Therefore, research on reversible
logic plays a significant role in quantum computing, quantum
dot cellular automata, spacecraft, optical computing,
nanotechnology and low power CMOS design for
development more powerful computers and computations.
One of the major constraints in reversible logic is to minimize
the number of reversible gates used. Complexity of the
circuits becomes very less due to less requirement of primitive
gates. Fan-out is not allowed in reversible logic. Fan-out is a
term that defines the maximum number of digital inputs that
the output of a single logic gate can feed. Minimizing the
garbage outputs produce. Garbage output refers to the output
that is not used for further computations. Constant input is
also main parameter of reversible logic gates. Constant input
which is used in reversible logic function to maintain constant
either 0 or 1 for making it reversible. Each reversible gate has
a cost associated with it called quantum cost. Quantum cost of
144
ISBN: 978-81-924893-0-8
Amandeep Singh Bhandari
Department of ECE
Punjabi University, Patiala
singh.amandeep183@gmail.com
the circuit is calculated by knowing the number of primitive
reversible gates required to realize the circuit.
Quantum networks composed of quantum logic gates in which
each gate performing an elementary unitary operation on one,
two or more state quantum systems called Qubit. Qubits can
perform calculations exponentially faster than conventional
bits. Each qubit represent as 0 or 1.Every reversible circuit is
built from 1x1 and 2x2 quantum primitives and its cost is
calculated by sum of 2x2 gates. Quantum cost of 1x1
reversible gate is zero. Since there are different cost
considerations such as garbage outputs, gate count, quantum
cost methods for specific cost reductions may be developed.
2. LITERATURE SURVEY
In 1961, R.LANDAUER described that the logical
irreversibility is associated with physical irreversibility and
requires a minimal heat generation per machine cycle. For
irreversible logic computations, each bit of information lost
generates kTlog2 joules of heat energy, where k is
Boltzmann’s constant and T the absolute temperature at which
computation is performed. In conventional system the
millions of gates used to perform logical operations. Author
proved that heat dissipation avoidable if system made
reversible [1].
In 1973, C.H.BENNETT described that if a computation is
carried out in Reversible logic zero energy dissipation is
possible, as the amount of energy dissipated in a system is
directly related to the number of bits erased during
computation. The design that does not result in information
loss is irreversible. A set of reversible gates are needed to
design reversible circuit. Reversible gate can generate unique
output vector from each input vector and vice versa [2]
In 2008, Majid Mohammdi et.al presented that quantum gates
to implement the binary reversible logic gates. Quantum gates
V and V+ to be represented in truth table forms. Author
proved that several reversible circuit benchmarks are
optimized and compare with existing work. A new behavioral
model to represent the V and V+ quantum gates based on their
properties. This model used to simulate the quantum
realization of reversible circuits [3].
In 2010, D.Michael Miller and Zahra Sasanian presented the
reducing the number of quantum gate cost of reversible
circuits. To reduce the quantum cost improves the efficiency
of the circuit. To determine a quantum circuit is to first
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

synthesis circuits composed of binary reversible gates then

map that circuit to an equivalent quantum gate realization
[4]
In 2011, Prashant.R.Yelekar et.al described that reversible
logic gates ability to reduce the power dissipation which is
main requirement in VLSI design. Reversible computing
which is requires high energy efficiency, speed and
performance. It include the applications like low power
CMOS, Quantum computer, Nanotechnology, Optical
computing and self-repair [5]. Figure 1: Feynman gate
In 2011, Md.Mazder Rahman et.al presented a quantum BJN GATE:
gate library that consists of all possible two-Qubit quantum
gates which do not produce entangled states. These gates BJN gate is 3x3 gate. The input vector is I(A,B,C) and the
are used to reduce the quantum cost of reversible circuits. output vector is O(P,Q,R).The outputs are defined by
They proposed a two-qubit quantum gate library that plays P=A,Q=B,R=(A+B) C. Quantum cost of a BJN gate is 5.
a significant role in reducing the quantum cost of reversible
gates [6].
In 2012, B.Raghu Kanth et.al described that implementing
of reversible logic has advantages of reducing garbage
outputs, gate count and constant inputs. Addition,
Subtractions operations are realized using reversible DKG
gate and it compare with conventional gates. The proposed
reversible adder/substractor circuit can be applied to design
of complex systems in nanotechnology [7].
In 2012, Mr. Devendra Goyal presented VHDL CODE of
all Reversible Logic Gate, which provide us to design
VHDL CODE of any complex sequential circuit. Here
(a) Block diagram (b) Symbol
author have been tried to make the VHDL code as much as
possible. Author can simulate and synthesis it using Xilinx Figure 2: BJN gate
software [8].
In 2013, Marek Szyprowski presented a tool for
minimizing the quantum cost in 4-bit reversible circuits. PERES GATE
Here Author shown that for benchmarks and for designs Peres gate is 3x3 gate. The input vector is I(A,B,C) and the
taken from recent publications it is possible to obtain output vector is O(P,R,S).The output is defined by
saving in quantum cost comparing with existing circuits
[9]. P=A,Q=A B and R=AB C. Quantum cost of a Peres
gate is 4.
In 2013, Raghava Garipelly provided that the basic
reversible logic gates, which in designing of more complex
system having reversible circuits as a primitive component
and this can execute more complicated operations using
quantum computers. Author introduced some new Gates
which are BSCL, SBV, NCG, and PTR etc. [10].

3. SOME OF IMPORTANT
REVERSIBLE LOGIC GATES
FEYNMAN GATE
Feynman gate is a 2x2 gate. The input vector is I(A,B) and
the output vector is O(P,Q).The output defined by
P=A,Q=A B. Quantum cost of a Feynman gate is
1.Feynman gate can be used as copying gate.
Figure 3: Peres gate
FREDKIN GATE
Fredkin gate is 3x3 gate. The input vector is I(A,B,C) and
the output vector is O(P,Q,R).The output is defined by

145
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

P=A,Q=A’B AC and R=A’C AB. Quantum cost of

Fredkin gate is 5.

(a) Block diagram (b) Symbol

Figure 6: NG gate

4. PARAMETERS RELATETED TO
Figure 4: Fredkin gate REVESIBLE GATES
4.1 Reversible Gate
NFT GATE A reversible gate is an m-input, m-output (denoted by mx
m) circuit that produces unique output pattern from each
NFT gate is 3x3 gate. The input vector is I(A,B,C) and the
input pattern and vice versa. A reversible gate is reversible
output vector is O(P,Q,R).The output is defined by
only if i=o. The number of outputs lines must be equal to
P=A B,Q=B’C AC’ and R=BC AC’. Quantum cost number of inputs lines.
of a NFT gate is 5.
4.2 Garbage Output
Unused output of reversible gate is called garbage output.
The output of reversible gate is not used as a primary
output or as input to other gates is called garbage output.
Garbage’s outputs are needed in circuit to maintain
reversibility concept. For example when 3x3 Toffoli gate is
used to implement the operations like AND EX-OR, output
vector P=A,Q=B are garbage output produced to preserve
reversibility.

4.3 Quantum Cost

Each reversible gate has a cost associated with it called
quantum cost. Quantum cost of the circuit is calculated by
(a) Block diagram knowing the number of primitive reversible gates required
to realize the circuit. Quantum cost of 1x1 reversible gate is
zero. Quantum gates have some property given in equation
1, 2 and 3.
V*V=NOT……………………………… (1)
V*V+ =V+*V=1……………………….. (2)
V+*V+=NOT…………………………... (3)

4.4 Restriction on Reversible logic

(b) Symbol synthesis
Figure 5: NFT gate
Using reversible gate designed the reversible circuit
NG GATE required to some restrictions such as no more than one fan
out is allowed and feedback or loops are strictly restricted.
NG gate is 3x3 gate. The input vector is I(A,B,C) and
output vector is O(P,Q,R,).The output is defined by 4.5 Delay of Reversible Circuit
P=A,Q=AB C,R=(A’C’ B’).

146
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Delay of reversible circuit is delay of critical path. Critical
path refer to maximum number of gates for any input to
any output in the circuit. Delay of reversible circuit is based
on following assumption:
 Every reversible gate will take same amount of
time for internal logic operations in the circuit.
 Before computation start, all inputs to the circuit
are known.
5. CONCLUSION AND FUTURE
WORK
Reversible computing has its great significance in reducing
the complexity of the digital circuits. For this purpose
various reversible logic gates are available. By using these
gates we can design any of combinational or sequential
circuit with low power, low complexity, less delay, high
speed etc. Reversible computing is becoming an important
research area include Quantum computing,
Nanotechnology, Low power CMOS design, Spacecraft,
Cryptography, Digital signal processing.
REFERENCES
[1] Landauer.R “Irreversibility and Heat Generation in the
Computational Process”, IBM Journal of Research and
Development, 1961, Vol. No. 5, Issue No. 3, pp 183-191.
[2] Bennett C H “Logical Reversibility of Computation”,
IBM J. Research and Development, 1973, Vol. No.17, pp
525-532.
[3] Majid Mohammdi “Behavioral Model of V and V+
gates to implement the reversible circuits using quantum
cost”, IEEE, 2008.
147
ISBN: 978-81-924893-0-8
[4] D.Michael Miller and Zahra Sasanian, “Lowering the
quantum gate cost of reversible circuits”, IEEE, 2010.
[5] Prashant.R.Yelekar, “Introduction to reversible logic
gates and its application”, 2nd National Conference on
Information and communication Technology, 2011.
[6] Md.Mazder Rahman, “Two-Qubit quantum gates to
reduce the quantum cost of reversible circuit”, IEEE
International Symposium on multiple-valued logic, 2011.
[7] B.Raghu Kanth, “A Distinguish between reversible and
conventional logic gates”, International Journal of
Engineering Research and Application, 2012, Vol. No.2,
Issue No.2, pp.148-151.
[8] Mr. Devendra Goyal, Ms. Vidhi Sharma,“VHDL
Implementation of Reversible Logic Gates”, International
Journal of Advanced Technology & Engineering Research
(IJATER), 2012.
[9] Marek Szyprowski “Reducing quantum cost in
reversible Toffoli circuits”, IEEE, 2013
[10] Raghava Garipelly, P.Madhu Kiran, A.Santhosh
Kumar, “A Review on Reversible Logic Gates and their
Implementation’’, International Journal of Emerging
Technology and Advanced Engineering, March 2013, Vol.
No. 3, Issue No. 3.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A REVIEW OF REVERSIBLE LOGIC GATES
Sukhjeet Kaur
Department of ECE
Punjabi University, Patiala
sukhjeetsidhu27may@yahoo.com
ABSTRACT
Reversible logic is one of most interesting topic at present
time. It is impossible to realize quantum computing without
implementation of reversible logic. The purposes of designing
reversible are to reduce quantum cost, garbage outputs and
use less no. of constant inputs. They are used in various fields
such low power VLSI design, optical computing,
Nanotechnology, Quantum computer, Design of low power
arithmetic and data path for digital signal processing (DSP).
Keywords
Quantum cost, Garbage out, Reversible logic gates, Quantum
computation
1. INTRODUCTION
The loss of information associated with laws of physics
requiring that one bit of information lost dissipates kTln2
energy. In conventional circuits information is lost. So interest
in reversible computation arises from desire to reduce heat
dissipation. In reversibility there is two terms, one is logical
reversibility and another one is physical reversibility.
Reversibility in computing implies that on information about
the computational states can ever be lost, so we can recover
any earlier stage by computing backward or un-computing the
results. This is termed as logical reversibility.
Physical reversibility is a process that dissipates no energy to
heat. An Absolutely perfect physical computing system is
practically unachievable. Power dissipation of reversible
circuits under ideal conditions is zero. Computing systems
given off heat when voltage levels change from +ve to –ve
(means bits changing from 0 to 1). Most of energy needed to
make that change is given off in form of heat. Rather than
2. LITERATURE SURVEY
In 1961, R. Landauer described that logical irreversibility is
associated with physical irreversibility and requires a minimal
heat generation, per machine cycle, typically of the order of
KT for each irreversible function. A device logically
irreversible if the output of a device does not uniquely define
the inputs. Whenever we use a logically irreversible gate we
dissipate energy into the environment. The loss of information
is associated with laws of physics requiring that one bit of
information lost dissipates kTln2 of energy, where k is
Boltzmann‟ constant and T is the temperature of the system.
The dissipation as calculated is an absolute minimum [1].
In November 1973, C.H.Bennett described that Reversibility
in computing implies that information about the
computational states should never be lost. The information
can be recovered for any earlier stage by computing
backwards or un-computing the results. This is termed as
“logically reversibility”. Physical reversibility is a process that
dissipates no heat in terms of wastage of energy [2].
In 2008, Majid Mohammadi et.al explained quantum gates
uses in implementation of binary reversible logic circuits.
148
ISBN: 978-81-924893-0-8
Amandeep Singh Bhandari
Department of ECE
Punjabi University, Patiala
singh.amandeep183@gmail.com
changing voltages to new levels. Reversible circuit elements
will gradually move charge from one node to the next. This
way one can only expect to lose a minute amount of energy on
each transition. Reversible computing will also lead to
improvement in energy efficiency.
Reversible are circuits or gates that have one to one mapping
between vectors of inputs and outputs, thus the vector of input
states can be always reconstructed from the vector of output
states. In reversible logic gates the number of output bits
always equals the number of input bits. The fan out of every
signal including primary inputs in a reversible gate must be
one.
i1 O1
i2 O2
i3 O3
Reversible
Ga te
i n-1 O n-1
i n On
Figure1: A reversible gate with n-inputs and n-outputs is
called n*n gate.
They proposed behavioral models for well known V & V+
quantum gates. They explained that their proposed
representation is used to synthesize reversible logic circuits
instead of the known unitary matrix form of quantum gates
[3].
In march 2010,D.Michel miller et.al. explained that one
approach to determining a quantum circuit is to first
synthesize a circuit composed of binary reversible gates and
to then map that circuit to an equivalent quantum gate
realization. In this paper they were considered that mapping
phase with the goal of reducing the no. Of quantum gates
required. They were presented the results for quantum library
for NOT, Controlled NOT and square root of NOT gate[4].
In 2011,Prof. Suiata S.Chiwande et.al. presented a basic
reversible gate to build complicated circuits which can be
implemented in some sequential circuits as well as in some
combinational circuits. They also built adder circuits using
basic gates like Peres and TSG gate. They also proposed 4-bit
reversible asynchronous down counter and explained that this
counter is used in applications of digital circuits like
timer/counter, building ALU and reversible processor[5]
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

In 2011, Md.Mazder Rahman et.al.explained that a quantum

gate library that contains of all possible two-qubit quantum
gates which don‟t produce entangled states. The proposed
two-qubit quantum gate library that plays a significant role in
reducing quantum cost of reversible circuits. They also show
some experimental result in which reduction in quantum cost
of more than 20% had been observed in more the half of the
circuits from revlib[6].
In April 2012, B.Ragh Kanth et.al. compared conventional
and reversible logic gates. They also realized the addition and
subtraction operations using reversible DKG gate and also Figure 3.2: Symbol of Toffoli Gate.
compared it with conventional logic gates. The author  DPG Gate: It is 4*4 reversible logic gate with
explained that a 4*4 reversible DKG gate can work singly as a inputs(A,B,C,D) and outputs P=A,Q=A XOR
reversible full adder and a reversible full subtractor.The B,R=(A XOR B) XOR D,S=(A XOR B)D XOR AB
author also compared the results of conventional adder with XOR C.
reversible on Xilinx 9.1 software [7].
In May 2012, Mr. Devendra Goyal et.al. Explained that
reversible logic is very essential for the construction of low
power, low loss computational structures which are every
essentials for construction of arithmetic circuits used in
quantum computation and other low power digital circuits. In
this paper, they were presented the combinational circuits of
all basic reversible logic gates and also had done VHDL codes
of these circuits [8].
In March 2013, Raghava Garipelly et.al. explained that
quantum networks composed of quantum logic gates each
gate performing an elementary unitary operation on one or
more two-state quantum system called qubits. They were also Figure 3.3: Symbol of DPG Gate.
explained constraints for reversible logic circuits that  TR gate: It is 3*3 reversible logic gate with input
reversible logic gates do not allow fan out and required
(A, B, C) and outputs P=A,Q=A XOR B,R= AB
minimum no. Of garbage outputs, constant input and also
XOR C.It has quantum cost six.
minimum quantum cost. They were proposed new 6*6 BSCL
reversible logic gates.[9].
In 2013, Marek Szyprowski et.al. Explained that minimization
of gates count in 4-bit circuits is problem. They explained that
a tool of practical usage for finding optimal gate count Toffoli
network for 4-variable function was developed. In this paper,
they were presented reducing quantum cost of 4-bit reversible
circuits. They also explained that it is possible to obtain
savings in quantum cost of up to 74% comparing with
previously known circuits [10].

3. Different Types of Reversible Logic

Gates:
Figure 3.4: Symbol of TR Gate.
 NOT Gate: It is 1*1 simplest reversible logic gate
with input A and output P= NOT A. The quantum
cost of NOT is zero.  BJN gate: It is 3*3 reversible logic gate with inputs
(A,B,C) and outputs=A,Q=BC=(A OR B)XOR C.It
has quantum cost five.

Figure 3.1: Symbol of NOT Gate.

 Toffoli Gate: It is 3*3 gate with inputs (A, B, C)

and outputs P=A,Q=B ,R=AB XOR C.It has
quantum cost five.

149
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure 3.5: Symbol of BJN Gate. [5]Prashant .R.Yelekar,Prof. Sujata S. Chiwande, “

 Various Parameters for determining the complexity
& performance of the circuit are No. of Reversible
Gates, No. of Constant Inputs, No. of Garbage
Outputs and Quantum cost.
4. QUANTUM COMPUTING
In classical reversible computing manipulates bits but in
quantum computers manipulates qubits.Each qubit represents
an elementary unit of information corresponding to the
classical bit values 0 & 1.In quantum circuits model, we have
logical qubits carried along „wires‟ and quantum gates that act
on the qubits.Each quantum gate acting an n qubits has input
qubits carried to it by n wires and n other wires carry the
output qubits away from the gate. The quantum cost of any
reversible gate is calculated by counting the number of V,V+
and CNOT gates present in its circuit.V is square root of NOT
gate and V+ is its Hermitian.The V and V+ quantum gates
have following properties:
V*V=NOT................. (1)
V*V+=V+*V=1.......... (2)
V+*V+=NOT.............. (3)
Introduction to Reversible Logic Gates & its Application”,
2nd National Conference on Information and Communication
Technology (NCICT) 2011.
[6] Md. Mazder Rahman†, Anindita Banerjee_, Gerhard W.
Dueck†, and Anirban Pathak_‟‟ Two-Qubit Quantum Gates to
Reduce the Quantum Cost of Reversible Circuit‟‟, 41st IEEE
International Symposium on Multiple-Valued Logic,2011.
[7] B.Raghu Kanth,B.Murali Krishna,M.Sridhar,V.G.Santhi
swaroop,‟‟A Distinguish between Reversible and
Conventional logic Gates,International journal of engineering
research and applications,april 2012,vol.2,issue2
[8] Mr. Devendra Goyal, M.Tech, Ms. Vidhi Sharma ,
„‟VHDL Implementation of Reversible Logic Gates‟‟,
International Journal of Advanced Technology & Engineering
Research (IJATER) ,may 2012,ISSN NO: 2250-3536 volume
2, issue 3.
[9]Raghava Garipelly,P.Madhu Kiran,A.Santhosh Kumar,‟‟A
Review on Reversible logic gates and their Implemantation‟‟,
International journal of emerging and advanced
engineering,March2013,volume3,Issue3.
[10] Marek Szyprowski,Pawel Kerntopf,‟‟ Reducing Quantum
Cost in Reversible Toffoli Circuits‟‟,IEEE,2013.

Figure4.1: Quantum implementation of a 3x3 TR gate.

5. CONCLUSION AND FUTURE SCOPE

Reversible Computing has its great significance in reducing
the complexity of the digital circuits. For this purpose, various
reversible logic gates are available. By using these gates we
can design any of combinational or sequential circuit with low
complexity, less delay, higher speed, etc.They are used in
various fields such low power VLSI design, optical
computing, Nanotechnology, Quantum computer, Design of
low power arithmetic and data path for digital signal
processing(DSP).

REFERENCES
[1] Landauer.R “Irreversibility and Heat Generation in the
Computational Process”, IBM Journal of Research and
Development, 5, pp. 183-191, 1961.
[2] Bennett C H “Logical Reversibility of Computation”, IBM
J.Research and Development, pp. 525-532, November 1973.
[3]Majid Mohammadi, Mohammad Eshghi, Abbas
Bahrololoom,‟‟ Behavioral Model ofV and V+ Gates to
Implement the reversible Circuits Using Quantum Gates‟‟,
IEEE, 2008.
[4] D. Michael Miller and Zahra Sasanian,‟‟ Lowering the
Quantum Gate Cost of Reversible Circuits‟‟, IEEE,2010.

150
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Review of an Adaptive On-demand Routing

Protocols for Mobile Ad-hoc Networks
Navjot Kaur Deepinder Singh
BGIET, Sangrur BGIET, Sangrur
knavjot911@yahoo.com wadhwadeepinder@gmail.com

ABSTRACT
Mobile Ad-hoc networks are most commonly used these days in
smart phones but the energy efficiency is major concern when
discovering the neighboring nodes to check the local
connectivity as progressively trade hello messages are utilized
for it. Overhead goes high because of neighbor disclosure in
MANET routing protocols such as AODV, DYMO .This paper
proposes a versatile hello informing plan to stifle pointless hello
messages. We have made both the protocols adaptive and
analyses the performance in terms of energy efficiency and with
the purposed scheme we have successfully reduced the energy
consumption 54%.

Keywords
Hello messaging, hello intervals ad-hoc networks, energy
utilization, network overhead, local connectivity.
1. INTRODUCTION
In the last few years, an expansive utilization of wireless
communication has begun. Presently days, there is an expanding
interest for the wireless communication from both a scholarly
and modern viewpoint. A Mobile specially appointed is the one
comprising of a set of portable hosts which can communicate
with each other and wander around at their will. Hubs in a
MANET can act has and also switches since they can both
create and forward packets [1]. Since an ad-hoc network is a
system without base, example, a wireless or a wired base station
( in case of Wi-Fi setup in a school where all PCs impart to the
web utilizing access focuses). In ad-hoc networks, every hub
finds its neighborhood neighbors and through those neighbors it
will speak with those hubs that are out of its transmission extent
(Multi-hop). Subsequently, in such a system hubs are required to
act in a helpful way to create the system "on-the-fly" [2].
Additionally, these systems are confronted with the customary
issues crucial to wireless communication, for example, less
dependable than wired media, time differing channels,
interference, and so on. Despite the many design limitations,
Mobile ad hoc networks offer many advantages. This sort of
system is exceptionally suggested for utilization in
circumstances where a settled framework is missing, not trusted,
high cost or not dependable. In view of their making toward
oneself, organizing toward oneself and supervising toward
oneself capacities, ad hoc networks can be rapidly deployed with
minimum user intervention [3].
Figure 1: Showing difference of cellular network and Mobile
ad hoc network.
Two commonly used routing protocols are Reactive and
Proactive. Reactive routing protocols are used when they are
required, e.g. DSR (Dynamic Source Routing) and AODV (Ad-
hoc On Demand Distance Vector). Proactive routing protocols
are also known as Table Driven protocols. In this protocol, each
node has one more tables that contain up to date data of the
routes to any node in the system, e.g. DYMO (Dynamic
MANET on Demand) and DSDV (Destination Sequence
Distance Vector). AODV and DYMO conventions are utilized
where another course is found through the RREQ (Route
Request) and RREP (Route Reply) packet trade. In this paper
BFOA (Bacterial Forgaging Optimization Algorithm) must be
connected over a adaptive plan of AODV and DYMO
conventions [4], [5].
AODV built course utilizing Hello messages, for recognizing
the neighbor hubs is in extent or not. At the point when any hub
identifies the connection disappointment in dynamic routes, then
mistake message RERR is created by hub and multicast this
message to those hubs which are connected with course
disappointment. In the wake of accepting this message the hubs
redesigns its directing tables and evacuates the entrance of
influenced routes [6]. AODV evacuates loop issue in light of the
fact that it uses grouping number for every route request
message.

151
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 2: AODV Route Discovery process via RREQ and
RREP message
Route discovery procedure of DYMO convention is same as that
of AODV protocol yet one new gimmick is path accumulation.
In route upkeep process RERR message is produced by hub
when join disappointment happens in the made way and
multicast RERR message to those hubs which are concerned
with the connection disappointment. Every hub redesigns its
directing tables in the wake of getting this message and erases
the steering passage of broken connection. Presently source hub
quit sending information through this way and reinitiates new
course disclosure process if necessary [7].
Figure 3: Route Discovery Process of DYMO
In this paper, a adaptive hello messaging plan is proposed for
neighbor disclosure by successfully suppressing undesirable
Hello messages. This scheme periodically changes Hello
intervals, and does not grow the danger that a sender will
dispatch a packet through a broken connection that has not
been finding by Hello messaging; we call this the probability of
failure of detection of an inaccessible connection (PFD) [4]. To
ascertain this danger, use an average occasion interval, that is, a
normal time opening between two successive intervals i.e.,
transmitting or accepting an information bundle on a hub. By
looking at the occasion intervals, we can decide how effectively
a hub is included in sending or forwarding. On the off chance
152
ISBN: 978-81-924893-0-8
that a hub is not taking part in any communication for a given
time period, it doesn't have to keep up the status of the link.
Hello packets transmits during this period are superfluous. In the
event that a uniform Hello interval is utilized, the danger of
endeavoring to transmit a parcel through a broken connection
diminishes as the event interval increases. Rather than utilization
of steady Hello intervals, our proposed plan utilizes steady risk
level [8]. As the invent interval increases, the Hello intervals
additionally increments without expanding the danger. If the
occasion interval is hugely large, the Hello messaging interval is
also large i.e. Hello messaging is practically smothers [9]. At the
point when a node receive or sends a packet, the Hello
messaging interval is reset to a default esteem so that forward
data is kept in a neighbor table for active communication.
Simulation results demonstrate that our proposed scheme stifles
pointless Hello messaging and decreases the energy utilization
up to 54% as soon as possible [10].
2. RELATED WORK
The hello messaging plan has been explored broadly in the
literature. In [11], an execution of Ad hoc on demand distance
vector (AODV) is used to focus the viability of hello messages
for deciding local connectivity To build the adequacy of the
hello messages, the gathering qualities of hello messages ought
to be equivalent to that of the data packets and for this two must
have comparative attributes of rate and size and thus better
throughput will bring about this case.
In [8], the focal points and disadvantages of both the systems
hello messaging and MAC criticism i.e. used to focus join
disappointments in specially appointed ad-hoc routing protocols
are tended to. Simulation results demonstrated that MAC
criticism works better than hello messages with low system load,
yet in the event that the system burden expands, the mistaken
choice about connection disappointment likewise builds which
brings about lower throughput. Additionally when AODV is run
over MAC layer protocols, the vitality that is devoured and
activity control overwhelmed by the MAC protocols are more
prominent than when they run over MAC IEEE 802.11. In [12],
effect of the hello protocols on ad-hoc networks is talked about.
The essential thought behind the proposed plan is to send hello
messages as meager as could be allowed, the proposed hello
protocols acquire less overhead and the network performance
expands contrasted with an periodic hello messaging protocol,
while looking after the precision of indistinguishable neighbor
table. In [10], the relationship between the transmission
recurrence of hello messages and the sensing clock lapse quality
is explored with the system's node mobility. In [13], neighbor
discovery is abused and overhead of neighbor disclosure courses
of action is lessened. However all these plans address just
ordinary hello messaging plan utilizing consistent hello interval.
At the same time the system topology changes quickly in
MANETs because of arbitrary hub portability and for neighbor
revelation hello messages are sent after standard intervals i.e.
steady hello interval and consequently battery utilization
expands, energy effectiveness diminishes. In [14], the shortest
path routing is very effective as it saves time and beneficial in
terms of cost A standout amongst the most critical qualities in
portable remote systems is the topology dynamics, i.e, the
system topology changes over the long run because of energy
conservation or node mobility. Lately, the steering issue has
been decently tended to utilizing insightful improvement
systems, e.g., Artificial Neural Networks (ANNs), Genetic
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Algorithms (GAs), Particle Swarm Optimization (PSO), and so 𝐹 𝑥, 𝛽 = 1 − 𝑒 −𝑥/𝛽 (2)

on.
The exponential distribution infers that partition of intervals are
3. PROPOSED SCHEME not as much as a given interval x We can decipher x as a
In mobile ad-hoc networks systems utilizing android phones, connection refresh period (Td) and F(x, β) as the likelihood that
power consumed by no sleep energy bugs is a significant an event happens before the connection is invigorated, i.e., F(x,
concern and for the route foundation and support nearby β) = PFD. Since a routine Hello messaging plan utilizes a steady
connection network data is generally essential. For local link esteem for, PFD shifts contingent upon β. This reasons even
connectivity information used in neighbor discovery latent hubs to show Hello packets periodically. We fix (=PFD)
dynamically exchanging hello messages are used, whereas in and make a variable so that the Hello intervals is versatile to the
such traditional hello messaging schemes no start/end condition normal event interval of a hub. We can revise the CDF of the
is defined. Because of no sleep energy bugs hello messages can exponential distribution utilizing the PFD as takes after:
release batteries while cell phones are not being used. A
versatile hello messaging plan for neighbor discovery is
proposed by stifles superfluous hello messages. The proposed 1 − 𝑒 −𝑥/𝛽 = 𝑃𝐹𝐷
plan dynamically modifies hello intervals and does not expand
the danger that a sender will travel a danger through a broken 𝑥 = −𝛽 ln 1 − 𝑃𝐹𝐷 (3)
connection. It demonstrated that our proposed plan suppress
unnecessary hello messaging and decrease energy utilization The probability of failure discovery of an occupied connection is
immediately. We will actualize BFO (Bacterial Foraging made proportional to exponential movement distribution.
Optimization) procedure utilizing multiobjective for a adaptive
hello messaging. BFO is an optimization technique and 4. SIMULATION RESULTS
considers the capacity of tackling complex issues by
collaboration. . This system is likewise roused by the social
forgaging behavior like ant colony and particle swarm Fig 4 analyzes the energy utilization of AODV and AODV-AH.
optimization. It attracts the scientists because of its productivity Every node has at first 150 joules of energy. As the quantity of
in tackling true advancement issues and gives preferred results nodes expands the AODV expends more energy. Then again,
over traditional methods of problem solving. AODV-AH because of proposed plan diminishes unnecessary
The Hello packets are conveyed every working switch interface. hello messages. Consequently the energy utilization will take
They are utilized to find and keep up neighbor connections. Be additional time because of the less transmission and reception of
that as it may because of this occasional HELLO messages, the hello messages.
hub's battery empties all the more rapidly. To keep away from
this issue, Hello parcels ought to be smothered. The correct
arrangement, notwithstanding, relies on upon deciding the right
Hello interval. The greatest interval of time between the
transmissions of hello messages is HELLO_INTERVAL. In
equation 1, time amid which the hub ought to expect that
connection is at present broken is the time if a hub does not get
any bundle from that hub inside the given time i.e. the average
Td is given as
Td = (ALLOWED HELLO LOSS−0.5)∗HELLO INTERVAL (1 )

Let us assume the sender and its neighboring hub. An occasion

on the neighboring hub happens when the sender advances a
packet to the neighboring hub. On the off chance that the
neighboring hub moves out of the sender’s transmission range,
Figure 4: AODV-AH increases the battery lifetime
there are two conceivable game plans: (a) the sender is asked for
to forward; or (b) the sender is not asked for to forward. Here,
just case (a) can cause a connection blunder. In the event that Fig 5 compares the energy utilization of DYMO and DYMO-
(b), the join accessibility does not have to be upgraded. To keep AH. Every node has at first 150 joules of vitality. As the
a connection lapse in the previous case, the sender must know quantity of node build the DYMO consumes more energy and
the accessibility of its connection to the following bounce hub the mobile battery will empty speedier. Then again, DYMO-AH
preceding sending a packet. We watch most event intervals are because of proposed plan suppresses the unnecessary hello
not exactly a default HELLO INTERVAL be that as it may, we messages. Consequently the energy consumed is less because of
examine the event intervals, x, that are bigger than 1 sec on the the less transmission and reception of hello messages.
grounds that the Hello interval is not altered if the interval is not
exactly the default HELLO INTERVAL. The cumulative
distributed function (CDF) in equation 2 demonstrates that all
traffics are limited by the exponential distribution where x > 1.
The CDF of x is as per the following:

153
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 5: DYMO-AH increases the battery lifetime
Fig 6 demonstrates the impact of PFD on the throughput and
Hello ratio when the maximum speed differs. A high PFD
utilizes a more extended Hello intervals than a low PFD. As the
high PFD does not make a valid difference in throughput from a
low PFD.
Fig. 6: Throughput for various max speed and PFD
Fig 7 demonstrates the quantity of Hello packets for different
node densities. The proposed plan diminishes the quantity of
Hello packets by as much as half. The impact of the proposed
plan increments as the quantity of nodes increments.
Figure 7: Hello Packet Overhead
154
ISBN: 978-81-924893-0-8
5. CONCLUSION
In this we proposed an adaptive Hello interval to diminishing
battery empty through viable concealment of superfluous hi
informing. On the premise of occasion interval of a node, the
Hello interval can be extended without lessened detectibility of a
broken connection, which decreases system overhead and
concealed vitality usage. Simulation results demonstrate that our
proposed plan superfluous unwanted Hello messages and
decreases the energy consumption up to 54% immediately.
6. REFERENCES
[1] D. ,Jaafar, M. Ismail, Mobile ad hoc network
overview. Melaka: IEEE, 4-6 DEC,2007.
[2] Asst. Prof. Jaswinder Singh Gurpinder Singh,
MANET: Issues and Behavior Analysis of Routing
Protocols, 24th ed.: International Journal of Advanced
Research in Computer Science and Software
Engineering, APRIL, 2012.
[3] Rupinder Kaur Gurm Jagdeep Kaur, Performance
Analysis of AODV and DYMO Routing Protocols in
MANETs Using Cuckoo Search Optimization, 28th
ed.: International Journal of Advance Research in
Computer Science and Management Studies,
AUGUST,2014.
[4] Dongman Lee Seon yeong Han, An Adaptive Hello
Messaging Scheme for Neighbor Discovery in On-
Demand MANET Routing Protocols, 175th ed.: IEEE
COMMUNICATIONS LETTERS, 5 MAY,2013.
[5] Mr.M.Karnan,Mr.R.Sivakumar G.Kokila, Immigrants
and Memory Schemes for Dynamic Shortest Path
Routing Problems in Mobile Ad hoc networks using
PSO,BFO, 25th ed.: International Journal of Computer
Science and Management Research, MAY,2013.
[6] S.D.C.Perkins E.Belding-Royer, Ad-hoc On-Demand
Distance Vector(AODV)., JULY,2003.
[7] C.E.Perkins D.Chakeres, Dynamic MANET On-
Demand(AODV2)., FEB,2008.
[8] M.Singhal C.Giruka, Hello Protocols for Ad-hoc
networks:Overhead and Accuracy tradeoffs.: IEEE
International Symposium on a World of Wireless
Mobile and Multimedia Networks.
[9] Er.Jasmeet Brar Harpreet Kaur, Adaptive Scheme for
suppressing unnecessary Hello messages used for
Neighbor Discovery in MANET routing protocols,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
0406th ed.: IOSR Journal of Engineering (IOSRJEN),
JUNE,2014.
[10] J.Abdullah, Multiobjectives GA-Based QOS Routing
Protocol for Mobile Ad hoc Networks, 0304th ed.:
International Journal of Grid and Distributed
Computing, DECEMBER,2010.
[11] S. Hemalath P. Divya1, An Adaptive Hello Messaging
and Multipath Route Maintenance in On-Demand
MANET Routing Protocol, 36th ed.: International
Journal of Modern Engineering Research (IJMER),
NOV-DEC, 2013.
155
ISBN: 978-81-924893-0-8
[12] Elizabeth M. Belding-Royer Ian D. Chakeres, The
Utility of Hello Messages for Determining Link
Connectivity” in Proc. 2002 Wireless Personal
Multimedia Communications., 2002.
[13] Jeff Boleng V. D. Tracy Camp, A survey of mobility
models for ad hoc network research., 2002.
[14] Kulvir Kaur Sonia Goyal, OptimizedRouting in
Wireless Ad-hoc networks., MARCH 2011.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

EXPLODING ELECTRONIC GADGETS

Avonpreet Kaur Anmol Sharma

Electronics and Communication Electronics and Communication
Engineering, BGIET, Sangrur Engineering, BGIET, Sangrur
avonpreet007@gmail.com

ABSTRACT flow from negative side of cells to positive side,thereby

This paper insights about the explosions in electronic
gadgets. Highlighting the occurrence of such explosions
doesnot undermine its use. People should be make aware of
the causes of such explosions and they should also be
informed about the precautions to be taken to prevent these
explosions. Laptops and mobiles basically explode due to the
thermal runway of batteries of these devices. Most common
reasons for mobile and laptop battery’s explosion are
mentioned.Then there are detailed tips on how to keep your
laptop battery safe and secure .
Keywords
Thermal runway,gadgets,etc.
1. INTRODUCTION
Nowadays, Life without electronic devices is very tough. We
generally come across the explosions in laptops, mobile
phones and other electronic gadgets. It is necessary to mind
the reason behind the cause in order to minimize the damage.
2. LAPTOP EXPLOSIONS
In order to understand about battery explosions, we should
know about the main cause of these explosions.In a laptop,the
part that is most prone to an explosion is its battery.The
smallest part of a battery is a cell.There are minimum three
cells in a laptop and this number can go upto 12.The more the
cells,the more backup for the laptop.The explosion of laptop
batteries will cause more damage as these contain more than
one cell.If one cell is overheated and explodes,it will trigger a
sequence of blasts,where each subsequent explosion would be
more dangerous.The main reasons responsible for laptop
explosions are:-
providing power to it. Similarly, when you are charging
the battery, electrons are sent back to the electrode points
to prepare the battery for consumption.Plenty of factors
come into play here overcharging, over discharging,
unwanted carbon build up, etc. A Lithium battery though
looks simple from outside, has built-in mechanisms to
disconnect from device and adjacent cells in case of
overcharging etc. A faulty laptop battery is one that
would not provide such mechanisms to protect the cells
from overcharging etc. This is just to give you an idea of
why companies have recalled products in the past saying
the batteries are defective. They are missing one or more
such precaution mechanisms.A laptop battery can
explode due to mishandling also. Dropping it somewhere
disturbs the alignment of electrode. This, in turn, will
change the alignment of electrons in the cells which may
create overheating,a known factor that explodes
batteries.The atmosphere where you are using the laptop
may also cause explosion. If it is humid and hot enough,
it will make a good case for short-circuit that in turn
will result in overheating and hence explosion.Hibernate
not standby.Although placing a laptop in standby mode
saves some power and you can instantly resume where
you left off, it doesn’t save anywhere as much power as
the hibernate function does. Hibernating a PC will
actually save your PC’s state as it is, and completely shut

The most important reason for a laptop to explode is

some sort of fault wih the battery.To understand what
could be the fault you need to understand how down slowly.
the Lithium (Li) Ion battery works. There are different Precautions
types of batteries of which, the popular rechargeable
Always keep laptop batteries in an original packaging
ones are either Acid base or Lithium Ion batteries. You
until new laptop battery is ready to use to prevent
will find an Acid base battery in cars, vehicles, etc.
damages to laptop battery. For example: swelling and
TheLithium Ion batteries are more compact and have
leakage of chemical element from your laptop
one electrode and an anode with suspended electrons in
batteries.The wise precaution for prevention of laptop
form of liquid.When using the laptop on battery,electron
battery explosion is proper maintenance. People tend to

156
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

neglect batteries as they tend to look simple parts and it. Here are some tips for finding quality, choose a
that they carry pretty safe measure of voltage. But since replacement battery for laptop urgently. Battery
their design is complicated, simple negligence can trigger
Voltage: The voltage of a laptop battery is usually
off explosion.Pay attention to Battery voltages and never
labeled on the back of it . You can read it by yourself. A
use different voltage Batteries for your laptop. To avoid
battery cell is of 3.6V or 3.7V. And each cell is usually
laptop damage, never use batteries with different
of 2200mAh .You can figure out how many cells a
voltages in the laptop. One should purchase
battery has from its voltage and its capacity. For
manufacturer recommended products and accessories if
example, if your laptop battery is of 10.8V, 4400mAh.
possible. If you are not sure about whether a replacement
Then your battery is of 6cells — series connection of 3
laptop Battery is compatible with your laptop battery
cells each group, parallel connection of 2 groups. If your
then it is always good to contact the manufacturer of the
battery is of 14.4V, 6600mAh. Then your battery is of
laptop battery and confirm with them before buying
12cells — series connection of 4 cells each group,
laptop battery. Do not put a high pressure on laptop
parallel connection of 3 groups
battery as high pressure can cause an internal short-
circuit leading to overheating of your laptop battery. Do
not get laptop battery wet. Even though laptop battery
MOBILE EXPLOSIONS
Mobile phones may be treated like playthings these days.
can dry and operate normally afterwards, the interlay
However, these flashy gadgets can prove dangerous if not
laptop battery circuitry could corrode and can pose a
handled with care. Sometimes the blast happens to be so bad
hazard. Do not keep a laptop plugged in all the time.
that the victim ends up with severe disfigurement of the body
Though it is fine most of the times, it is not advisable if
or even dies
you are to stay away from the laptop for longer times. To
avoid the dangers of forgetting or leaving the laptop on
without use for a long time,setting up a hibernation time
in a laptop is suggested so that it auto shutsdown.
Using a power stabilizer between the laptop plug and the
mains is recommended. If a higher voltage burst comes
along, at most the fuse will go and laptop will disconnect
from mains.If your battery is considerably old, you
should replace it. If you cannot, for some reasons, I
would advise you to remove the battery and run the
laptop on direct power supply. Older batteries tend to
take in more power and can overheat in no time.
Continuing with an old and exhausted battery is
dangerous. If you are not sure about the health of your
battery, Windows 7 and above tell you if you need to
replace it. You can also use the battery health checker or
battery maintenance software .PC World recommends How and why do mobile phone blasts happen?
replacing your lithium-ion batteries after two to three
years of use. The aging components begin to break down Lithium batteries suffer from a problem called ''thermal
and may start producing additional thermal runaway. runaway,'' whereby excess heat promotes even more excess
Battery life also may drop considerably after two to three heat and so on. Because of this, they are equipped with a
years of use. system that protects against overcharging and prevents
hazardous reactions of the chemicals contained within. It is
How TO Choose Battery Replacement? quite often said that even the inexpensive batteries produced
Li-Ion cells also have much lower levels of self- by unknown companies are just as reliable as the
discharging. These factors combined with the higher original.Lithium-ion batteries are widely used by tech
production costs mean that Li-Ion cells are manufactures because it’s the least dense metallic element;
comparatively more expensive. This battery has currently which means it packs a good amount of power in a
held the major market. Battery is very like the heart of lightweight package. But these batteries are also known to
the laptops/notebooks, and this is just the advantages explode or produce flames.
compared to the desktop PC. Now, most of the laptop
These batteries are prone to a process known as thermal
battery can keep working for 2 to 4 hours of one charge,
runaway; when energetic positive feedback causes the
and it maybe can’t meet some users’ needs. Of course, a temperature to rise and causes a “violent reaction” (or
spare battery for some friends who work as moving explosion). Static electricity or a faulty charger can destroy
office frequently is very necessary. Furthermore, the the battery’s protection circuit, making it more vulnerable to
laptop battery is a kind of consumables. If your laptop the risk of explosion or over-heating.
battery isn't lasting as long as it used to or you find
yourself charging more often, it may be time to replace

157
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Another most common reasons for a cell phone to explode are
using it while the phone is being charged and 'call bombing'.
Charging puts pressure on the motherboard of the phone,
using it during charging increases this pressure manifold. This
causes the cheap electronic components in some mobiles to
explode. Call bombing refers to calls or missed calls received
from international numbers. If one receives or calls these
numbers back and the call exceeds a certain amount of time,
the phone will blast. There is also a malware, or bug, found in
some Android-based smartphones, that can also cause
explosion by exerting extra pressure on the motherboard
during charging.
PRECAUTIONS
Buy a branded phone as far as possible. Ensure that the
phone has a proper IMEI number, which is a code that
identifies each phone. Check that the number on the
phone corresponds to that on the box and receipts.
CONCLUSION
Laptop batteries are always a danger as are other products
such as a pressure cooker etc. Your safety depends on how
you use them. The only mantra to stay safe is to handle your
gadgets with care. For more information on using batteries,
please refer to the product manual pertaining to your product.
REFERENCES
[1] Dr.S.S Verma, Physics Department SLIET , Electronics
For You.
[2] Zbigniew Bielecki, Jacek Janucki, Adam Kawalec
Military University of Technology, ul. S. Kaliskiego 2,
00-908 Warsaw zbielecki@wat.edu.pl
[3] Tadeusz Pustelny Silesian University of Technology,
Faculty of Mathematics and Physics, ul. Krzywoustego
2, 44-100 Gliwice
[4] Tadeusz Stacewicz Institute of Experimental Physics,
Faculty of Physics, University of Warsaw, ul. Hoża 69,
00-681 Warsaw.
158
ISBN: 978-81-924893-0-8
It is considered wise to check the accessories such as
earphones, battery and charger. Make sure the battery
description such as voltage value matches with that of
the charger to avoid overcharging which sometimes lead
to explosion of handset.Avoid using the phone while the
battery is being charged. If you wish to receive a call
during this time, disconnect the phone from charger
before connecting the call. Ensure it is not over-charged
by removing the electric supply when the battery is fully
charged.If your battery seems to have swollen, replace it
immediately.Avoid using public or unsecured Wi-Fi
connections. A hacker could access the mobile device
through a port that is not secured.Make sure the
Bluetooth connectivity is not switched on in public
places as it can be used to send malicious files which
corrupt the operating system.After removing the phone
from water, dismantle it by removing battery, SIM and
memory cards and switch it off (only SIM card in case of
an iPhone). Dry each component thoroughly (but gently)
with a towel until the phone is dry to the touch. Never
use a hair dryer to try to dry the phone quicker. Drying it
with a heated hair dryer can cause important parts to
melt, while forcing water further into the phone. Don’t
use third-party batteries: OEM batteries not only ensure
consistency in components, but also the oversight of the
phone’s manufacturer during their production, which
likely also means better battery life.Avoid hot places and
storing batteries near metal: Avoiding excess heat and
the risk for electrical shortage is yet another logical step
to ensure the best safety for your smartphone.Over-
charging, over-use and knock-off chargers may increase
fire risk
[5] BARTEC brochure Basic concepts for explosion
protection - 11. revised edition - Version 2012
[6] States government Accountability office 2005 [cited
june10,2006]; available from
http://www.gao.gov/new.items/do5937t.pdf
[7] Electronic waste observation on the role of federal
government in encouraging recycling and reuse united.
[8] Waste wise update:Electronics reuse and recycling
environmental protection agency 2000[cited july
14,2006]; available from
http://www.epa.gov/wastewise/wrr/updatehtml
[9] Ammons J and Sarah, B.2003 “Eliminating E-waste
:Recycling through reverse Production”
www.lionhrtpub.com
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Distinguish Abandons in Gears
Avonpreet Kaur Anmol Sharma
Electronics and Communication Electronics and Communication
Engineering Engineering
avonpreet007@gmail.com
ABSTRACT
As the innovative advancement is going on the items are
currently broadly made utilizing plastic material particularly
as a part of mechanical autonomy which needs to be ultra
light weight and particular in nature plastic segments like
gears, according to industry measurements we have observed
that apparatuses are comprised of plastic material High-
thickness polyethylene (HDPE) which is inclined to different
sorts of deformities when assembling utilizing picture
handling. Accordingly we recommend a completely vigorous
framework exploiting picture transforming systems
(segmentation, Non smooth corner recognition and so forth)
must be investigated to manufacture an efficient answer for
give Total Quality Management(TQM) in assembling units
which would permit an eco-arrangement of nonstop checking
and change there by lessening the expense.
Keywords
Digital image processing; count number of teeth; count
number of surface defects; thresholding.
1. INTRODUCTION
Plastic moulding is the process of shaping plastic using a rigid
frame or mould. The technique allows for the creation of
objects of all shapes and sizes with huge design flexibility for
both simple and highly complex designs. A popular
manufacturing option, plastic are responsible for many car
parts, containers, signs and other high volume items.
In Plastic moulding, the moulding process selected depends
upon two main factors:
The geometry of the components to be moulded.
The material from which the product to be made.
There are two main groups of plastic moulding materials:-
1) Thermoplastics:-This group of plastic can be softened
every time they are heated; they can be recycled and reshaped
any number of times. This makes them environmentally
attractive. However, some degradation occurs if they are
overheated or heated too often and recycled materials should
only be used for lightly stressed components. Thermoplastic
moulding usually made by the injection moulding process
which is suitable for quantity production of both large and
small components and is the most widely used moulding
process.For Example: - Polyethylene, PVC, Polystyrene,
Polypropylene, Nylon- Star Wheels, Cams,Brush Handle.
159
ISBN: 978-81-924893-0-8
Shweta Rani
Assistant Professor
BGIET
2) Thermosetting plastic:-This group of plastics differs from
thermoplastic materials in that polymerization is completed
during the moulding process and the material can never be
softened again. Polymerization during the moulding process is
called curing.
Forms of supply:
Both thermoplastic and thermosetting plastic moulding
materials are normally available as powder or as granules
packed in bags or in drums.Thermoplastic powders and
granules are homogeneous materials consisting of the polymer
together with the coloring agent (pigment), lubricant and die-
release agent. Thermosetting plastic materials are come in
powder or granule form mixed with additives to make them
more economical to use, to improve their mechanical
properties, and to improve their moulding properties
2. RELATED WORK DONE
Tomislav Petkovi et.al [2] had made an attempt to classify
various defects encountered in the production of molded
plastic products by taking advantage of image processing.
This paper basically discusses the relevance of doing shape
analysis for identifying surface defects in plastic products and
further classifying these defects using nearest neighborhood
classifiers. Defect detection starts with image acquisition. The
image of the product is obtained by using a background
illumination and that provides excellent contrast
nontransparent black object against the illuminated
background. Such images are then segmented by using
thresholding. All existing boundaries are traced and for each
boundary the pattern vector is calculated. Finally, the pattern
vectors are compared against the prototype vectors. In surface
inspection subsystem several algorithms are used which are
designed for line detection, spot and blemish detection. The
shape inspection subsystem is to detect and classify possible
shape defects.The results of the algorithms are the position of
the defects and some of their characteristics, and those are
compared with the product prototype. The various stages of
development describing algorithms were successfully tested
with the limited number of instances and require further
testing with greater number of instances.K.N.Sivabalan et.al
made an attempt to identify defects, by using a visual
inspection system in fabric. Various techniques of feature
extraction and segmentation are used to identify the defects in
gray level digital images. In this research work the minimum,
maximum and median values are calculated for each row of
the image to frame the feature vector. The defected area is
identified sudden variation of the former pixel or from the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

median value. The pixels which have abrupt changes from the demonstrated that an eigenvalue-based defect recognition
median value about 60% or from the pixel of about the same method is effective to distinguish defective images from non-
value is considered as a pixel in defected area. The defective images.
comparison process excludes the pixels which have zero value
in order to expedite defect detection algorithm. This
Algorithm was most suitable for the defects which have low
frequency.Walter Michaeli had done a study of the various
CONCLUSION
To see the subjectively and quantitatively execution of the
algorithms that focus on inspection of plastic material
proposed calculation, a few examinations are led on a few
exhibiting irregular texture. He uses the local binary pattern
colored and grey scale images. The viability of the
operator for texture feature extraction. Various typical defects
methodology has been legitimized utilizing distinctive
include holes, friction line, burn marks foreign particles or
pictures. The results are processed subjectively (outwardly)
printing rollers. For classification, supervised and semi-
and quantitatively utilizing quality measures.The gear images
supervised approaches are used. This paper discusses the
have been converted into black by using the complement code
plastic surface inspection system that are able
for increasing the visibility.
id
REFERENCES
[1]. Tomislav Petkovi cy, Josip Krapacz, Sven Lon cari
cy.and Mladen Sercerz (2010), “Automated Visual
Inspection of Plastic Products”.
[2]. Walter Michaeli and Klaus Berdel (2011), “Inline-
inspection-of-textured-plastics-surfaces” Optical
Engineering Vol. 50 (2),pp 027205.
[3]. Zhenxiang Zhang, Kun Wang, Xun Yang and Lianqing
Chen (2010), “Research on Detection of Micro Plastic
Gear Tooth Based on Dummy Circle Scan Method”
Applied Mechanics and Material Vol.37-38, pp1002-
1005.
[4]. Sangwook Lee (2009 ) ,Ph.D.“ Automated Defect
Recognition Method by Using Digital Image
Processing”.
[5]. Xianghua Xie (2008) “A Review of Recent Advances in
Surface Defect Detection using Texture analysis
Techniques” Electronic Letters on Computer Vision and
Image Analysis ,Vol 7(3),pp 1-22.
entify defects on unstructured surfaces. The algorithms for
defect detection are directly based on the brightness of a
pixel.The results obtained out of the proposed technique have
been found better compared to the other existing methods.
Experiments with images show detection rate with 97%
accuracy. The real-time tests show that defects can be reliably
detected at speeds of 30 m/min. Marie Vans purposed a
system for automatic, on-line visual inspection and print
defect detection for Variable –Data Printing (VDP). This
system will automatically stop the printing process and alert
the operator that the problems have occurred. The main
advantages of using this system allow a single skilled operator
to maintain and monitor several work loads, reducing the
number of operators and reduce the number of defects.
Examples of defects that may cause an operator to halt the
machine include scratches, spots, missing dot clusters, streaks,
and banding. In this paper the simplest image reference
approach was used, a reference exists that allows a direct
comparison to defective products.Sangwook Lee deals with a
digital image processing method to apply was to evaluate steel
bridge coating condition. The proposed method in this paper
was designed to recognize the existence of bridge coating rust
defects. The image defect recognition method was developed
by pairwise comparisons and calculating Eigenvalues which
were chosen as a key feature to distinguish defective images
from non-defective images. Experimental results were

160
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Study of various aspects related to Wireless Body Area

Networks

Raju Sharma Dr. Hardeep Singh Ryait

ECE Deptt. Of BBSBEC ECE Deptt. Of BBSBEC
Fatehgarh Sahib, Punjab, India Fatehgarh Sahib, Punjab, India
raju.sharma@bbsbec.ac.in hardeepsryait@gmail.com

ABSTRACT 2. System Architecture of WBAN

In recent years, interests in the application of Wireless Body
Area Network (WBAN) have grown considerably. It is one of
the latest technologies in health care diagnosis and
management. Use of a WBAN will also allow the flexibility
of setting up a remote monitoring system via either the
internet or an intranet. This paper presents an overview on the
various aspects of WBAN including System Architecture
,sensors used, wireless technology used and challenges faced
in wireless body area networks. Three network topologies are
also simulated using opnet 18.0.

General Terms
Wireless Body Area Network.
Keywords
WBAN, Network Topology, Bluetooth, Zigbee.
1. INTRODUCTION
The aging population in many developed countries and the
rising costs of health care have triggered the introduction of
novel technology-driven enhancements to current health care
practices. For example, recent advances in electronics have
enabled the development of small and intelligent bio- medical
sensors which can be worn on or implanted in the human
body. These sensors need to send their data to an external
medical server where it can be analyzed and stored. Using a
wired connection for this purpose turns out to be too
cumbersome and involves a high cost for deployment and
maintenance. However, the use of a wireless interface enables
an easier application and is more cost efficient [1]. The patient
experiences a greater physical mobility and is no longer
compelled to stay in a hospital. This process can be
considered as the next step in enhancing the personal health
care and in coping with the costs of the health care system.
Where eHealth is defined as the health care practice supported
by electronic processes and communication, the health care is
now going a step further by becoming mobile. This is referred
to as mHealth [2]. In order to fully exploit the benefits of
wireless technologies in telemedicine and mHealth, a new
type of wireless network emerges: a wireless on-body network
or a Wireless Body Area Network (WBAN).
Fig.1 System Architecture of WBAN
Generalized system architecture of a WBAN can be divided in
three fundamental levels or tiers of communication as
described in [3,4, 5]:
i) Tier-1 communication (intra-WBAN)
ii) Tier-2 communication (inter-WBAN)
iii) Tier-3 communication (beyond WBAN).
2.1 Tier-1 communication - Intra-WBAN
Tier-1 communication or intra-WBAN communication refers
to the radio communication range of about 2 meters around
the human body [3]. Intra-WBAN communication can be sub-
categorized as follows:
(a) Communication among body sensors
(b) Communication between body sensors and a personal
server (PS)
A PS is any machine that can collect data from sensors and do
processing on it to generate some meaningful result, e.g., a
cell phone or a personal digital assistant (PDA) or a palm top.
PS is quite different than a coordinator node or a gateway
node because PS is a more complicated multipurpose
machine, that is needed to be equipped with some peripheral
radio or cable to communicate with the body sensors. PS
should also have sensor data manipulating or processing
software to generate outputs.

Gateway or coordinator nodes are just like sensor nodes, in

architecture, from which they collect data. Their task is to

161
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
forward the data to AP and then AP will route the data on
internet to the remote server/database.
Design of intra-WBAN tier is far more complicated and
challenging than other ones. Well known communication
techniques for intra-WBAN communication are ZigBee,
Bluetooth and UWB.
2.2 Tier-2 communication - Inter-WBAN
The paradigms of inter-WBAN communication are divided
into two subcategories as follows:
Fig2. (a)Ad-hoc communication (b) infrastructure based
communication
2.2.1 Infrastructure based architecture
The architecture shown in Fig.2 is use in most WBAN
applications as it facilitates dynamic deployment in a limited
space such as a hospitals as well as providing centralized
management and security control. The AP can act as a
database server related to its application [6]
2.2.2 Ad-hoc based architecture
In this architecture, multiple APs transmit information inside
medical centers as shown in Fig.3 .The APs in this
architecture form a mesh construction that enables flexible
and fast deployment, allowing for the network to easily
expand, provide larger radio coverage due to multi-hop
dissemination and support patient mobility. The coverage
range of this configuration is much larger compared to the
Actuator infrastructure based architecture, and therefore
facilitates movement around larger areas. In fact, this
interconnection extends the coverage area of WBANs from 2
meters to 100 meters, which is suitable for both short and long
term setups [6].
2.3 Tier-3 communication-Beyond-WBAN
Tier-3 involves communication between a WBAN and an
outside network, e.g., internet or some E-care (electronic care)
center. PS and gateway can directly communicate to the
outside network and it can also have some base stations
involved in between as well. Fig.3 represents a pictorial
representation of the tiers of communication for WBANs. A
database is an important component of the beyond-WBAN
tier. This database maintains, e.g., the user’s profile and
medical history. According to user’s service priority and/or
doctor’s availability, the doctor may access the user’s
information as needed. At the same time, automated
notifications can be issued to his/her relatives based on this
data via various means of telecommunications. The design of
beyond-WBAN communication is application-specific, and
should adapt to the requirements of user-specific services. For
162
ISBN: 978-81-924893-0-8
example, if any abnormalities are found based on the up-to-
date body signal transmitted to the database, an alarm can
notify patient or doctor through email or short message
service (SMS). If necessary, doctors or other care-givers can
communicate with patients directly by video conference via
the Internet. In fact, it might be possible for the doctor to
remotely diagnose a problem by relying on both video
communications with the patient and the patient’s
physiological data information stored in the database or
retrieved by a WBAN worn by the patient [3,4,5,7]
3. Types of nodes in a WBAN
A node in a WBAN is defined as an independent device with
communication capability. Nodes can be classified into three
different groups based on their functionality, implementation
and role in the network. The classification of nodes in
WBANs based on their functionality is as follows [18]
3.1.1 Sensor Node
Sensors in WBAN measure certain parameters .In one’s body
either internally or externally. It consists of sev- eral
components: sensor hardware, a power unit, a processor,
memory and a transmitter or transceiver [8]. A list of different
types of commercially available sensors used in WBANs is as
follow: EMG, EEG, ECG, Temperature, Humidity, Blood
pressure, Blood glucose, Thermistor etc.
3.1.2 Personal Device (PD)
This device is in charge of collecting all the information
received from sensors and actuators and handles interaction
with other users. The PD then informs the user (i.e. the
patient, a nurse, a GP etc.) via an external gateway, an
actuator or a display/LEDS on the device. The components
are a power unit, a (large) processor, memory and a
transceiver. This device may also be called body gateway,
sink, Body Control Unit (BCU) or PDA in some applications
[9].
3.1.3 Actuator
A device that acts according to data received from the sensors
or through interaction with the user. The components of an
actuator are similar to the sensor's actuator hardware (e.g.
hardware for medicine administration, including a reservoir to
hold the medicine), a power unit, a processor, memory and a
receiver or transceiver.
3.1.4 Implant Node
This type of node is planted in the human body, either
immediately underneath the skin or inside the body tissue.
3.1.5 Body Surface Node
This type of node is either placed on the surface of the human
body or 2 centimeters away from it.
3.1.6 External Node
This type of node is not in contact with the human body and
rather a few centimeters to 5 meters away from the human
body.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.1.7 End Nodes Node Function Single sensors, each performs multiple
The end nodes in WBANs are limited to performing their tasks
embedded application. However, they are not capable of
relaying messages from other nodes. Node Accuracy Limited node number with each required
to be robust and accurate.

3.1.8 Relay Node size Pervasive monitoring and need for

The intermediate nodes are called relays. They have a parent miniaturization.
node, possess a child node and relay messages. In essence if a
node is at an extremity (e.g. a foot), any data sent is required High level wireless data transfer security
to be relayed by other nodes before reaching the PDA. The required to protect patient’s information.
Data Protection
relay nodes may also be capable of sensing data.
Access Implantable sensor replacement difficult
4. Wireless technology used in WBAN and requires biodegradability
Three different short-range wireless communication
technologies for intra-WBAN communications are used: Bio A must for implantable and some
compatibility external sensors. Likely to increase cost.
4.1 IEEE 802.15.1-Bluetooth [10]
IEEE 802.15.1 is a communication standard which is used for Context Very important because body physiology
short range communication, typically within 10m range. The Awareness is very sensitive to context change.
data rate of Bluetooth standard is 3Mbps. The bandwidth of
Bluetooth standard is high while latency rate is low. High
Wireless Low power wireless required, with signal
bandwidth encourages use of Bluetooth standard in UHC.
However, this standard consumes high energy, so this Technology detection more challenging.
standard is normally avoided in UHC. This standard is not
well fit for network of sensitive bandwidth and latency. Data transfer Loss of data more significant, and may
require additional measures to ensure
4.2 IEEE 802.15.4-2011 [11] QoS and real-time data interrogation
It is another frequently used communication standard. ZigBee capabilities.
is used in communication devices which utilize less energy
like sensor nodes. This standard is employed with a collision
avoidance technique. ZigBee got the power to control
complex operations related to communication. It utilizes very
less energy in communication nearly about 60mW. The data
6. Network Topology
The objective of this unit is to gather and collect the intended
rate of this standard is low nearly 250kbps. ZigBee has the
capability of encryption to give considerable protected physiological signal from the surface of the human body, or
communication. from an implant. It consists of the following components:
power source (battery), sensor hardware, processor and either
4.3 IEEE 802.15.6-2012 [12] a transmitter or transceiver [13].
UWB is a high bandwidth communication standard and it is
used in high data rate applications. UWB is best choice
whenever a application requires a high bandwidth. In
emergency applications, UWB is considered best choice to
use for communication. UWB are implemented with Global
Positioning System(GPS). This feature provide short routing
path to medical coordinator. GPS facility provide routes
which has less traffic and that makes communication faster
and emergency data can be easily forward to medical server in
critical situation. The receiver of UWB band is very complex,
that makes it not good for use in wearable application.

5. WBAN Challenges
Table 1.represents Challenges faced by WBAN [19]
Challenges WBAN Fig 3. Network topologies for WBANs: (i) star network, (ii)
mesh network , (iii) Cluster Tree
Scale As large as human body parts
(millimeters/centimeters) 6.1 PAN Coordinator: (FFD)
This unit gathers all the transmitted information from multiple
Node Number Fewer, more accurate sensors nodes biosensors in the WBAN and processes the data for
required (limited by space) monitoring or diagnosis purposes [14]. This can either be a
mobile device with a limited power supply, or a computing
unit with a power source. Data can either be used locally, or

163
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

further transmitted into a larger collection unit or a monitoring router is to extend the network coverage. Only routers and
centre. coordinators can have children.

6.2 Full Function Device: (RFD)

A Router is an FFD. A router is used in tree and mesh
topology to expand the network coverag e. The function of a
router is to find the best route to the destination over which to
transfer a message. A router can perform all functions similar
to a coordinator except the establishing of a network.

6.3 Reduced Function Device:(RFD)

An end device can be an RFD. An RFD operates within a
limited set of IEEE 02.15.4 MAC layer, enabling it to
consume less power. The end device can be connected to a
router or coordinator. It also operates at low duty cycle power,
meaning it consumes power only while transmitting
information. Therefore, Zigbee architecture is designed so that
an end device transmission time is short. The end device Fig.5 Tree Topology
performs the following functions:
7.3 Scenario 3
1. Joins or leaves a network Fig. 6 shows mesh topology. In this scenario one coordinator
six end devices and two routers are used. A mesh topology is
2. Transfers applications packes. a multihop network, packet pass through multiple hops to
reach their destination.
7. Simulation scenarios
In this work, we are comparing the three zigbee network
topologies (Star, Mesh, Tree) to each other. In these only one
zigbee coordinator, two zigbee routers and five zigbee end
devices are used. The comparison includes Global Statistics :
mac data traffic sent, data traffic received, Delay ,Load
throughput

7.1 Scenario 1
Fig. 4 shows star topology .It consists of one coordinator, six
end devices and two routers. In this the end devices and
routers communicates only with the coordinator. Any traffic
exchange between end devices or routers must go through the
coordinator.

Fig.6 Mesh Topology

8. Results
After configuring the scenarios in OPNET 18.0 modeler,
global statistics could be taken to study the performance of
system in terms of many parameters. Global statistics: MAC
data traffic send, data traffic received, delay, load, throughput.

8.1 Throughput
Throughput represents the total number of bits ( in bits/sec)
forwarded from 802.15.4 MAC to higher layers in all WPAN
nodes of network.
Fig. 4 Star Topology

7.2 Scenario 2
Fig. 5 shows tree topology. In this scenario one coordinator,
six end devices and two routers are used. The function of the

164
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig. 7 Throughput comparison between three topologies
8.2 Data Traffic Sent
Traffic transmitted by all the 802.15.4 MAC in the network in
bits/sec. While computing the size of the transmitted packets
for this statistic, the physical layer and MAC headers of the
packets are also included. This statistic includes all the traffic
that is sent by he MAC via CSMA/CA. It does not include
any of the management or the control traffic, nor it does
include ACKs.
Fig. 8 End-to-End delay comparison between three topologies
8.3 Data traffic Received
Data traffic received represents the total traffic successfully
received by the MAC from the physical layer in bits/sec. This
includes retransmission.
Fig. 9 Data traffic received comparison between three
topologies
165
ISBN: 978-81-924893-0-8
8.4 Delay (sec)
Delay represents the end-to-en delay of all the packets
received by the 802.15.4 MACs of all WPAN nodes in the
networks and forwarded to the higher layer.
Fig. 10 Delay comparisons between three topologies
8.5 Load
Load represents the total load submitted to 802.15.4 MAC by
all higher layers in all WPAN nodes of the network.
Fig. 11 Delay comparisons between three topologies
9. Conclusion
In this paper we simulate three scenarios for
three topologies (star, tree, mesh) using opnet
18.0 modeler. Results ( Fig. 7,8,9,10,11) shows
that throughput, data traffic sent, data traffic
received and load is greater in Mesh topology in
comparison with other two topologies. But delay
is greater in star topology and delay in tree and
mesh topology is almost equal.
REFERENCES
[1 ]D. Cypher, N. Chevrollier, N. Montavont, and N. Golmie,
“Prevailing over wires in healthcare environments: benefits
and challenges," IEEE Communications Magazine, vol. 44,
no. 4, pp. 56-63, Apr. 2006.
[2] R. S. H. Istepanian, E. Jovanov, and Y. T. Zhang,
“Guesteditorial introduction to the special section on m-
health: Beyond seamless mobility and global wireless health-
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
care connectivity,"Information Technology in Biomedicine,
IEEE Transactions on, vol. 8, no. 4, pp. 405-414, Dec. 2004.
[3] Chen M., Gonzalez S., Vasilakos A., Cao H. & Leung V,”
Body area networks: A survey”, Mobile Networks and
Applications ,The Journal of SPECIAL ISSUES on Mobility
of Systems, Users, Data and Computing © Springer
Science+Business Media, LLC 2010 10.1007/s11036-010-
0260-8, pp. 171–193.
[4] Ullah S., Higgins H., Braem B., Latre B., Blondia C.,
Moerman I., Saleem S., Rahman Z. & Kwak K,” A
comprehensive survey of wireless body area networks”,
Journal of Medical Systems, volume 36 Issue 3, June 2012
,pp. 1065–1094.
[5]Akyildiz I., Su W., Sankarasubramaniam Y. & Cayirci E,”
Wireless sensor networks: a survey”, Journal Computer
Networks: The international Journal of Computer and
Telecommunications Networking, volume 38 Issue 4, 15
March 2002, pp. 393 – 422.
[6] M.Chen, S. Gonzalez, A. Vasilakos, H. Cao, and V.Leug,
“ Body area networks: A survey,”Mobile Networks and
applications, vol16, pp. 171-193, 2011.
[7] Bilstrup K. (2008) A preliminary study of wban.Technical
report IDE0854, Halmstad University.
[8] R. Hoyt, J. Reifman, T. Coster, and M. Buller, Combat
medical informatics: present and future," in Proceedings of
the AMIA 2002 annual symposium, San Antonio, TX,
November 2002, pp. 335-339.
[9] B. Latr´e, B. Braem, I. Moerman, C. Blondia, and P.
Demeester, “A survey on wireless body area networks,”
Wirless Network, vol. 17, pp. 1–18, Jan. 2011.
[10] IEEE std. 802.15.4-2011 Part 15.4: Low rate wireless
personal Area Networks 2005.
166
ISBN: 978-81-924893-0-8
[11] IEEE Std. 802.15.4-2011 Part 15.4: Low-Rate Wireless
Personal Area Networks (LR-WPANs), 2011.
[12] IEEE Std. 802.15.6-2012, Part 15.6: Wireless body area
networks, 2012.
[13] I.F. Akyildiz, Weilian Su, Y. Sankarasubramaniam, and
E. Cayirci, \A survey on sensor networks," Communications
Magazine, IEEE, vol. 40, no. 8, pp. 102 -114, aug 2002.
[14] Benot Late, Bart Braem, Ingrid Moerman, Chris
Blondia, and Piet Demeester, A survey on wireless body area
networks," Wirel. Netw., vol. 17, pp. 118, January 2011.
[15] IEEE Standards, “Part 15.4: Wireless Medium Access
control (MAC) and Physical Layer (PHY) Specifications for
Low-Rate Wireless Personal Area Networks (WPANs),"
IEEE 802.15.4 Standards, Sept. 2006.
[16] Changle Li, Huan-Bang Li, and R. Kohno, “Performance
evaluation of ieee 802.15.4 for wireless body area network
(wban)," in Communications Workshops, 2009. ICC
Workshops 2009. IEEE International Conference on, june
2009, pp. 1-5.
[17] J. Zeng, H. Minn, and L. S. Tamil, “Time hopping direct-
sequence CDMA for asynchronous transmitter-only sensors,"
in Proc. IEEE Military Communications Conference
(MILCOM'08), Nov. 2008.
[18] Samaneh Movassaghi, Justin Lipman,” Wireless Body
Area Networks: A Survey”, IEEE COMMUNICATIONS
SURVEYS & TUTORIALS, ACCEPTED FOR
PUBLICATION,2013
[19] Ragesh G K, Dr.Baskaran K,” Study of various aspects
related to Wireless Body Area Networks”, IJCSI International
Journal of Computer Science Issues, vol-9,Issue 1, No 2,
January 2012,ISSN (online):1694-014, pp.180-186.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

How to Reduce Mobile Phone Tower Radiation

Anmol Sharma Avonpreet Kaur Shweta Rani
Electronics & Comm. Engg Electronics & Comm. Engg Assoc. Prof. BGIET, Sangrur.
anmoldear3391@gmail.com avonpreet007@gmail.com

ABSTRACT Moreover, the WHO has classified mobile phone radiation on

Wireless telecommunication systems use a large number of the IARC (International Agency for Research on Cancer)
mobile phone towers in order to provide telecom facilities to scale into Group 2B – possibly carcinogenic to humans.
their subscribers spread across different geographical
locations. These towers employ multiple antennae that radiate 2. ELECTROMAGNETIC RADIATION
electromagnetic waves. There is a strong perception relating (EMR)
to the existence of a high level of electromagnetic radiation in Electromagnetic Radiation consists of electric and magnetic
the vicinity of these towers, which may cause adverse energy waves moving together through space at the speed of
biological effects. According to World Health Organisation light.
(WHO), INTERPHONE (a 13-country coordinated case-
control study), Independent Expert Group on Mobile Phones
(IEGMP) and Scientific Committee on Emerging and Newly
Identified Health Risks (SCENIHR) study researches, it has
been found that electromagnetic radiation can contributed to
health deficiency, including an increased risk of brain
tumours, eye cancer, salivary gland tumours, testicular cancer
and leukaemia.

Keywords
EMF, Radiation, Transmission towers, Radiation mitigation.
Figure 1
1. INTRODUCTION
The telecommunications industry is experiencing a robust When referring to biological radiation exposures,
growth on a global scale. Mobile phones, sometimes known electromagnetic radiation is divided into two type: ionising
as cellular phones or handsets, form an integral part of and non-ionising. Because the human body is composed of
modern telecommunications and are fast becoming a social about 60 percent water, ionising and non-ionising radiations
lifestyle. Mobile phones are very popular because they allow refer to whether the RF energy is high enough to break
people to maintain constant and continuous communication chemical bonds of water (ionising) or not (non-ionising).
without hampering their freedom of movement. The mobile Antennas on Cell tower transmit in the frequency range of:
phone and its base station is a two-way radio, they produce
• 869 - 890 MHz (CDMA)
radiofrequency (RF) radiation as a means of communicating
and expose the people near them to RF radiation. The wide • 935 - 960 MHz (GSM900)
use of mobile phones has inevitably raised the question of
whether there are any implications for human health. There •2110 – 2170 MHz (3G)
have been some reports relating to possible adverse health
effects and these have understandably led to some concern • 1805 – 1880 MHz (GSM1800)
from the members of the public. As the mobile phone base
and various wireless technologies (such as WiMAX, WiBro, 3. RADIATION PATTERN OF A
iBurst, EV-DO Advanced, etc) are rapidly expanding and MOBILE PHONE TOWER ANTENNA
evolving, the requirement for such towers will also grow. It is Propagation of "main beam“ from antenna mounted on a
therefore high time that a strict regulatory regime is tower or roof top
established, as early as possible, to avoid possible fallout. The
Mobile phone and its base station communicate using a two  People living with in 50 to 300 meter radius are
way radio communication. This radio communication in the high radiation zone (dark blue) and more
produces Electro-magnetic magnetic fields. The effect of prone to ill effects of Electromagnetic Radiation.
electromagnetic radiation on human health is the subject of
recent interest and study. ICNIRP (International Commission
on Non-Ionizing Radiation Protection) study has concluded
that the exposure levels due to cell phone base stations are
generally around one-ten-thousandth of the guideline levels.

167
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4.1 Increased cancer cases with proximity

to Towers

Figure 2
Figure 4
4. EFFECTS OF MOBILE PHONE
TOWER 5. RADIATION MITIGATION
TECHNIQUES
If the electromagnetic radiation level in any area accessible to
people is higher than prescribed limits, it is strongly required
to take action to reduce the radiation level. The different
radiation mitigation techniques are:

5.1 Transmitter power reduction

The transmitter power is directly related to the power density
and square of the electric field strength. So, reduction in
transmitter power would result in reduction of radiation level.
But, this method also leads to reduction of the coverage area.

5.2 Increase in antenna height

The power density at any observation point is the function of
antenna height. If the antenna height is increased, then the
power density/field strength at the observation point is
reduced due to an increase in the distance to the point of
observation. The reduction of radiation level is even greater
because at the same time elevation angles to another part of
the vertical radiation patter of the antenna.

5.3 Increase in antenna gain

Gain of an antenna is a key performance figure that combines
the antenna’s directivity and electrical efficiency. I t specifies
how well the converts input power into electromagnetic waves
headed in a specified direction and to limit the radiation in
other directions. So, it is possible to limit the radiation level in
the area accessible to the people with the control of the
directivity of the antenna. So, it is recommended to use a low-
power transmitter with a high-gain antenna for attaining a low
level of radiation.
Figure 3
5.4Multiple method applied simultaneously
All the methods described above are independent and can be
applied either individually or in combination to achieve the
required decrease in radiation level.

168
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

6. CONCLUSION (such as children), adoption of mobile phones and microcells

with as low as reasonably-practicable levels of radiation,
Operators providing wireless communication should seriously wider use of hands-free and earphone technologies such as
consider this study and ITU-T recommendations in order to Bluetooth headsets, headsets with ferrite beads and headsets
keep the operation of base-station transceivers in compliance with air tube, adoption of maximal standards of exposure and
with regulations concerning environmental protection against greater distances of base-station antennae from human
non-ionising radiation. Further, it is important to note that the habitations, and so forth.
present threshold limits prescribed by ICNIRP are considered
to be rather too generous. Hence, there is a need to review and
remedy the situation and not wait until it becomes the subject
matter of a public-interest petition in the light of possible
environmental adverse effects. In order to minimize possible
health hazards, some recommendations are: minimization of
mobile phone usage, limitation of use by at-risk population

REFERENCES [8] Levitt B, Lai H, Biological effects from exposure to

[1] Kumar G, 2010. Report on cell tower radiation, submitted
to theSecretary, DoT, Delhi.
http://www.ee.iitb.ac.in/~mwave/ GK-celltower-
[2] Cell Tower Radiation Hazards and Solutions by Prof.
Girish Kumar, IIT Bombay
electromagnetic radiation emitted by cell tower base
stations and other antenna arrays, Environ. Rev. 18:369–
395,
[9] World Health Organization. (2010). About WHO.
Retrieved March 15, 2010 from
http://www.who.int/about/en/

[3] S Sivani, D Sudarsanam -Impacts of radio-frequency [10] World Health Organization. (2010). Electromagnetic
electromagnetic field (RF-EMF) from cell phone tower fields. Retrieved March 15, 2010 from
http://www.who.int/peh-emf/en/

[4] Haumann Thomas, et al, “HF-Radiation levels of GSM

cellular phone towers in residential areas”,
http://nocelltower.com/German%20RF%20Research%20Artic
le.pdf

[5] Counter-View of the Interphone Study , 2010, -

http://www.radiationresearch.org/pdfs

[6] Karen J. Rogers , Health Effects from Cell Phone Tower

Radiation, by
http://www.scribd.com/doc/3773284/Health-Effects-from-
Cell-Phone-Tower-Radiation

[7] Radiation Mitigation Research Papers by Bill Brodhead

http;//www.wpb-radon.com/bills_radon_research_papers

169
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Optimal ECG Sampling Rate for Non-Linear Heart Rate
Variability
Manjit Singh Butta Singh
Research Scholar PTU Dept. of ECE, Guru Nanak Dev
Jalandhar, Dept of ECE Guru University, Regional Campus
Nanak Dev University Regional Jalandhar, India.
Campus Jalandhar, India. bsl.khanna@gmail.com
manu_kml@yahoo.co.in
ABSTRACT
The principle difficulty with the analysis of the heart rate
variability (HRV) is that heart rate dynamics are non-linear
and non-stationary. Detrended fluctuation analysis (DFA) and
correlation dimension (CD) are non-linear HRV measures to
quantify fractal-like autocorrelation properties and to
characterize the complex behaviour of nonlinear time series.
Optimal ECG sampling rate is an important issue for accurate
quantification of HRV. High ECG sampling rate results in
very high processing time and low sampling rate produces
signal quality degradation results in clinically misinterpreted
HRV. In this work the impact of ECG sampling frequency on
non-linear HRV have been quantified in terms of short-range
& long-range DFA and CD on short-term (N=200), medium-
term (N=500) and long-term (N=1000) data. Non-linear HRV
parameters are found to be sensitive to ECG sampling
frequency and effect of sampling frequency will be a function
of data length.
Keywords
ECG, HRV, Sampling frequency, DFA, CD, Signal
processing.
1. INTRODUCTION
The electrocardiogram (ECG) is one of the most important
physiological parameters, which reflects to ionic activity in
the cardiac muscles [1]. Heart rate variability (HRV) is the
time variation between RR peaks of ECG in cardiac cycle.
HRV represents sympathetic and parasympathetic activities of
autonomic nervous system (ANS) and is non-invasive tool for
analysis of cardiovascular control of the heart [2]. Time
domain, frequency domain, and non-linear method are the
three ways which can be used for the evaluations and analysis
of HRV [3-4].Time domain is the simplest measure of HRV
but incapable to differentiate sympathetic and
parasympathetic contribution of HRV hence increase the use
of spectral methods for the analysis of the tachogram [5-7].
The cardiovascular system is consisting of multiple sub-
systems and has both highly nonlinear deterministic and
stochastic properties, and subject to hierarchical regulations
[8-10]. As a result, time series generated by cardiovascular
system are often highly nonlinear, non-stationary, random and
complex. Due to which standard linear measures of HRV may
not be able to detect subtle, but important changes in the HR
time series [11]. Therefore, nonlinear methods have been
developed to quantify the dynamics of HR fluctuations.
Approximate entropy (ApEn) [12-13], Sample entropy
(SampEn) [14], multiscale entropy (MSE) [15], Detrended
fluctuation analysis (DFA) [16] and Correlation Dimension
170
ISBN: 978-81-924893-0-8
Vijay Kumar Banga
Dept. of ECE, Amritsar College
of Engineering and Technology,
Amritsar, India.
vkbanga@gmail.com
(CD) [8] are well-developed nonlinear measures to quantify
the chaotic properties, complexity or irregularity of RR
intervals time series.
The fast ECG sampling rate increases the processing time,
requirement of large memory for data storage & access
whereas signal quality degrades with low ECG sampling rate
that may cause clinically misinterpreted HRV measures thus
the selection of Optimal sampling rate is an important issue
for researchers [17-18]. Singh B. et al., investigated the errors
in the estimation of the ApEn and SampEn based non-linear
HRV measures by various ECG sampling frequencies [23-24].
The errors in entropy based HRV was clinically significant
when ECG sampled at low sampling frequency of 125 or 250
Hz. The other researchers have also recommended the value
of sampling frequency under different conditions as listed in
table 1.
Table 1. Recommendation of Sampling Frequency of ECG
Recommended sampling Recommended By
frequency
250-500 Hz or higher Task force of the European
Society of Cardiology and
North American society of
Pacing and Electrophysiology
[4]
1000 Hz Hejjel et al [17]
500 Hz Ziemssen et al [18]
128 Hz Abboud and Barnea[ 19]
Although Task Force recommended the range of ECG
sampling frequencies for accurate time and frequency domain
HRV measures, a systematic study is the need of day to
quantify the influence of sampling rate on nonlinearities based
HRV. ECG sampling rate analysis on nonlinearities measures
of HRV is required for extensive use of HRV by medical
practitioners. This study aims to access the impact of ECG
sampling rate on DFA and CD based HRV and to find out
optimal ECG sampling rate for non-linear measures of HRV
based on computer simulation.
2. DATA AQUISITION
For this study the ECG data has been acquired from the 10
healthy subjects, with no past of any cardiac disorder, in
supine posture with normal breathing in a lab environment at
comfortable light and temperature conditions. All subjects
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

were refrained from alcohol, coffee and smoking for 12 hour
prior to data acquisition. The ectopic-free normal RR intervals
time series were derived for each subject by Lead-II ECG
recordings on Biopac® MP150 system with short-term (N =
200), medium-term (N = 500) and long-term (N = 1000) data
lengths having sampling frequencies of 125, 250, 500, 1000,
1500 and 2000 Hz resulting in a total of 180 time series.
3. NON-LINEAR HRV
Recent developments in the theory of nonlinear dynamics
have paved the way for analyzing signals generated from
nonlinear living systems. It is now generally recognized that
these nonlinear techniques are able to describe the processes
generated by biological systems in a more effective way.
3.1 Detrended Fluctuation Analysis (DFA)
In 1994 Peng et al has developed DFA which is a simple and
efficient scaling method commonly used for detecting long-
range correlations. It is an efficient technique used to
determine the correlations within the signal and to evaluate
the fractal characteristics of RR interval time series. Fractal
are composed of subunits (and sub-sub-units, etc.) that
resembles or show correlation with the structure of the overall
time series. This technique is an enhancement of root mean
square approach of random walks applied to non-stationary
time series [16, 20]. The technique consists i) calculation of
root-mean-square fluctuation of an integrated and detrended
time series at different windows sizes ii) plotting the
fluctuation against the size of the window on a log–log scale.
k
fluctuations F(n) and time scales n can be approximately
evaluated by a linear model that provides the scaling exponent
α given in
F n   n
The scaling exponent α is viewed as an indicator of the
roughness of the original time series: the larger the value of
the scaling exponent α smoother the time series. The fractal
scaling (α) for the normal subjects (healthy young) is closer to
1, and this value falls in different ranges for various types of
cardiac abnormalities
DFA quantifies the correlations within the time series for
different time scales [16]. For HRV analysis, correlations may
be short-term or long-term fluctuations which are represented
by parameters  1 and  2 respectively. These measures are
correlation measure as a function of segment length and
approximated by slopes of a log-log plot. In this work,
calculations for 1 and 2 were obtained from ranges of 4–
16 beats for 1 and range of 16–64 beats for  2 .
3.2 Correlation Dimension (CD)
CD, a novel method based on phase space technique to
distinguish normal and abnormal cases, has been used
extensively for cardiovascular signals.
A phase space plot can be obtained by representing the heart
rate RR[n] in X-axis and the delayed heart rate RR [n+m] in
Y-axis. The minimal mutual information technique is used to

 RRi   RR
1. Obtain integrated series y (k )  avg
i 1
Here k is the total length of integrated series y(k) is kth
value of integrated series RR(i) is ith inter-beat interval. RRavg
is the average of RR intervals over the entire series.
2. Then, the integrated time series y (k ) is divided into
windows of equal length, n.
3. Least-squares line is fitted to the RR interval data in each
window of length n which is local trend in that window. The y
coordinate of the straight line segments are denoted by yn(k).
4. Trend yn(k) is subtracted from the integrated signal y(k) in
order to obtain the detrended profile
calculate an appropriate delay. The method of estimating the
embedding dimension from the phase space patterns was
proposed by Grassberger and Procaccia [22]. For a steady and
unchanging heart rate, the phase plot will be a point; else, the
trajectory spreads out to give some patterns. The emerged
pattern interpreted periodic, chaotic, or random behaviour of
heart rate. A CD factor is a quantitative measure of the pattern
of trajectory, and the ranges of CD for various cardiac
disorders are identified.
The CD of the attractor is calculated for HRV data using the
following definition [22]:
 log C  r  
CD  lim  
 log  r  
r o

y(k)- y n (k) Where the correlation integral C(r) is given by:

5. Then root-mean-square fluctuation of integrated and
   r  RR 
1 N N
detrended time series is computed by C r   
N 2 x 1 y 1, x  y
x  RRy
N
F n    y(k)- y 
1
n (k)
N Where N is the number of data points, RRx and RRy are the
k 1
trajectory points in the phase space; r is the radial distance
6. The procedure is repeated for different boxes size or time around each reference point and  is the Heaviside function.
scales. Finally, the relationship on a double-log graph between

Table 2. Effect of ECG sampling frequency on short-range DFA, long-range DFA and CD based non-linear HRV for ten healthy subjects

171
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Sampling Short-Range Scaling Exponent Long-Range Scaling Exponent Correlation Dimension

Frequency
(Hz) Data Length

200 500 1000 200 500 1000 200 500 1000

125 1.0734 1.1085 1.1812 0.746 44 0.7674 0.8703 1.1880 1.3392 1.6205

250 1.0818 1.1219 1.1219 0.7556 0.7742 0.8689 1.2029 1.3357 1.6090

500 1.0807 1.1295 1.1295 0.7525 0.7763 0.8695 1.0070 1.3363 1.5970

1000 1.0511 1.0847 1.0847 0.6881 0.7286 0.8304 1.0044 1.0994 1.2520

1500 1.0510 1.0772 1.0772 0.6855 0.7311 0.8310 1.0044 1.0998 1.2528

2000 1.0433 1.0837 1.0837 0.6804 0.7128 0.8314 0.9753 1.0975 1.2480

Table 3. Relative error in short-range DFA, long-range DFA and CD based non-linear HRV of ten healthy subjects by ECG sampling
frequencies

Sampling Short-Range Scaling Exponent Long-Range Scaling Exponent Correlation Dimension

Frequency
(Hz) Data Length

200 500 1000 200 500 1000 200 500 1000

125 7.3397 2.2852 1.3218 9.7084 7.6540 4.6857 21.8027 22.0187 29.8467

250 3.6857 3.5213 1.5193 11.0610 8.6080 4.5179 23.3386 21.6968 28.9266

500 3.5803 4.2180 2.3784 10.5921 8.9108 4.5911 3.2488 21.7537 27.9618

1000 0.7434 0.0849 0.3840 1.1380 2.2172 0.1196 2.9857 0.1740 0.3173

1500 0.7428 0.6021 0.2992 0.7473 2.5690 0.0387 2.9791 0.2028 0.3880

2000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000

Table 4. Correlation coefficient between increase in sampling frequency and decrease in REs of  1 ,  2 and CD of short-term, medium term
and long-term data length

Short-Range Scaling Exponent Long-Range Scaling Exponent Correlation Dimension

Data Length

200 500 1000 200 500 1000 200 500 1000

0.8689 0.7860 0.8042 0.9073 0.9233 0.8978 0.7923 0.8932 0.8984

4. STATISTICAL ANALYSIS
In order to study the effect of sampling frequency on DFA
and CD based HRV, the parameters  1 ,  2 and CD are
evaluated. The relative errors (REs) were calculated with the
non-linear measures calculated from the RR interval time
series derived with reference 2000 Hz ECG sampling
frequency. The parameters {X1, X2, . . . Xn} are obtained for
DFA and CD based HRV measures of the short-, medium-
and long-term data set with sampling frequencies of 125, 250,
500 1000 and 1500 Hz. Xorigin is the corresponding non-linear
HRV measure at reference ECG sampling frequency of 2000
Hz, the relative errors REk are computed as |Xorigin− Xk|/Xorigin
× 100 (%). For the statistical calculations 150 error values

172
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
were derived for each HRV parameter and data length of ECG
signal.
5. RESULT
The non-linear HRV measures  1 ,  2 and CD are computed
for RR interval series of long-term (N=1000), medium
(N=500) and short-term (N=200) data lengths respectively and
compared with reference values at sampling frequency of
2000 Hz. Table 2 shows the effect of ECG sampling
frequency on average non-linear HRV parameters  1 ,  2 and
CD respectively, of RR interval time series derived from lead-
II ECG of ten healthy subjects. The REs in short-term  1 and
long-term fluctuations  2 and CD of RR intervals series
derived from ECG at sampling frequency 125, 250, 500, 1000
and 1500 Hz were calculated. Then these REs were compared
with reference parameters to evaluate the impact of ECG
sampling frequency (Table 3).
For very low ECG sampling frequency of 125 Hz, the REs
in  1 ,  2 and CD of time series data of RR intervals with
respect to reference values of sampling frequency 2000 Hz
were approximately 7.33, 9.7 and 21.8% for short-term data;
2.28, 7.65 and 22 % for medium data and 1.32, 4.6 and 29.8%
for long term-data respectively. The REs in  1 ,  2 and CD
respectively was decrease up to 0.7, 1.13 and 2.98 % for short
term data; 0.08, 2.21 and 0.17% for medium term data and
0.38, 0.11 and 0.31% for longt term data respectively at
medium ECG sampling frequency of 1000 Hz. The decrease
in REs will be a function of level of sampling frequency and
RR interval data length. The REs CD due to the ECG
sampling frequency were found to be very high at low
sampling frequency 125 Hz. The correlation coefficients
values for the increase in sampling frequency with decrease in
REs of  1 ,  2 and CD at short-term, medium-term and long-
term data length are shown in Table 4.
6. CONCLUSION
The influence of ECG sampling frequency on DFA and CD
based non-linear HRV parameters at short-, medium and long-
term data lengths have been quantified. At low sampling
frequency the REs in DFA and CD based HRV are found to
be clinically significant. Further, the REs in HRV measures
depend upon sampling level and RR interval data length. Thus
the non-linear HRV parameters estimated by the DFA and CD
algorithms are sensitive to ECG sampling frequency and data
length and erroneous quantification results a bias in DFA and
CD measures and clinically misinterpreted HRV.
7. REFERENCES
[1] Afonso V.X., Tompkins, W.J and Luo, T.Q. 1999.
ECG beat detection using filter banks. IEEE Trans.
Biomed. Engineering, vol. 46, 192–202.
[2] Jovic, A. and Bogunovic, N. 2012. Evaluating and
Comparing Performance of Feature Combinations
of Heart Rate Variability Measures for Cardiac
Rhythm Classification. Biomedical Signal
Processing and Control, vol.7, 245–255.
[3] Berntson, G.G, Bigger, J.T., Eckberg, D.L.,
Grossman, P., Kaufmann, P.G., Malik, M.,
Nagaraja, H.N., Porges, S.W., Saul, J.P., Stone,
P.H., and Vander-Molen, M.W. 1997. Heart rate
173
ISBN: 978-81-924893-0-8
variability: origins, methods, and interpretive
caveats. Psychophysiology, vol. 34, no. 6, 623-
648.
[4] Task Force of European society of Cardiology and
the North American Society of Pacing and
Electrophysiology. 1996. Heart rate variability,
standard of measurement, physiological
interpretations, clinical use. Circulation, Vol. 93,
1043-1065.
[5] Kay, S.M. and Marple, S.L. 1981. Spectrum
analysis: A modern perspective. IEEE Proceedings,
vol. 69, 1380-1419.
[6] Berger, R. D., Akselrod, S., Gordon, D., and
Cohen, R. J. 1986. An efficient algorithm for
spectral analysis of heart rate variability. IEEE
Transactions on Biomedical Engineering, vol.
BME-33, 900-904.
[7] Singh, D., Vinod, K., Saxena, S. C., and Deepak,
K. K.. 2006. Spectral evaluation of aging effects on
blood pressure and heart rate variations in healthy
subjects. Journal of Medical Engineering
Technology, vol. 30, no. 3, 145-150.
[8] Hoyer, D., Schmidt, K., Bauer, R., Zwiener, U.,
Kohler, M., Luthke, B. and Eiselt, M. 1997.
Nonlinear analysis of heart rate and respiratory
dynamics. IEEE Engineering in Medicine and
Biology, vol. 16, no. 1. 31-39.
[9] Kanters, J.K., Hojgaard, M.V., Agncr, E. and
Holstein-Rathlou, N-H. 1996. Short- and long-term
variations in non-linear dynamics of heart rate
variability. Cardiovascular Research, vol. 31, pp.
400-409.
[10] Merati, G., Reinzo, M.D., Parati, G., Veicsteinas,
A. and Castiglioni, P. 2006. Assessment of
autonomic control of heart rate variability in
healthy and spinal-cord injured subjects:
Contribution of different complexity based
estimators. IEEE Transactions on Biomedical
Engineering, vol. 53, no. 1, 43-52.
[11] Goldberger, A.L. 1991. Is normal heartbeat chaotic
or homoststic?. News Physiological Science, vol.
6, 87-91.
[12] Pincus, S.M. 1991. Approximate entropy: a
complexity measure for biologic time-series data.
Proceedings of the IEEE 17th Annual Northeast
Bioengineering Conference. 35-36.
[13] Singh, B., Singh, D., Jaryal, A.K. and Deepak K.K.
2012. Ectopic beats in approximate entropy and
sample entropy-based HRV assessment.
International Journal of Systems Science, vol. 43,
no. 5, 884-893.
[14] Richman, J.S. and Moorman, J.R. 2000.
Physiological time series analysis using
approximate entropy and sample entropy.
American Journal Physiology Heart Circulatory
Physiology, vol. 278, 2039-2049.
[15] Singh, B. and Singh, D. 2012. Effect of threshold
value r on multiscale entropy based heart rate
variability. Cardiovascular Engineering and
Technology, vol. 3, no. 2, 211-216.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[16] Pena, M. A., Echeverrıa, J. C., Garcıa, M. T. and
Gonzalez-Camarena, R. 2009. Applying fractal
analysis to short sets of heart rate variability data.
Medical & Biological Engineering & Computing,
vol 47, 709-717.
[17] Hejjel, L. and Rooth, E. 2004. What is the
adequate sampling interval of ECG signal for heart
rate variability analysis in time domain.
Physiological Measurements, vol. 25, 1405-1411.
[18] Ziemsseen, T., Gascg, Z. and Ruediger, H. 2008.
Influence of ECG sampling frequency on spectral
analysis of RR intervals and baroreflex sensitivity
using Eurobarvar data. Journal of Clinical
Monitoring and Computing, vol. 22, 159-168.
[19] Abboud, S. and Barnea, O. 1995. Errors due to
sampling frequency of electrocardiogram in
spectral analysis of heart rate signals with low
variability. Proceedings of IEEE Computers in
Cardiology, 461-463.
174
ISBN: 978-81-924893-0-8
[20] Rodriguez, E., Echeverria, J. C. and Alvarez-
Ramirez, J. 2007. Detrended fluctuation analysis of
heart intrabeat dynamics. Physica-A, vol. 384, no.
2, 429-438.
[21] Penzel, T., Kantelhardt, J., Grote, L., Peter and A.
Bunde, J. H. 2003. Comparison of detrended
fluctuation analysis and spectral analysis for heart
rate variability in sleep and sleep apnea. IEEE
Trans. Biomed. Eng., vol. 50, no. 10, 1143-1151.
[22] Graxsberger, P. and Procassia, I. 1983. Measuring
the strangeness of strange attractors. Physica D,
189-208.
[23] Singh, B., Singh, M. and Banga, V. K.. 2014.
Sample Entropy based HRV: Effect of ECG
Sampling Frequency. Biomedical Science and
Engineering, vol. 2, no. 3, 68-72.
[24] Singh, M., Singh, B. and Banga, V. K. 2014. Effect
of ECG sampling frequency on approximate
entropy based HRV. International Journal of Bio-
Science and Bio-Technology, vol. 6, no.4,179-186.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Design of Rectangular Microstrip Patch Antenna Array

for S, C and X- Band
Jagtar Singh Sivia Amandeep Singh Sunita Rani
Yadawindra College of M.Tech Student ECE Yadawindra College of
Engineering Punjabi University Yadawindra College of Engineering Punjabi University
Guru Kashi Campus Talwandi Engineering Talwandi Guru Kashi Campus Talwandi
Sabo,Punjab, INDIA Sabo,Punjab, INDIA Sabo,Punjab, INDIA
jagtarsivian@yahoo.com honey02700@gmail.com ersunitagoyal@rediffmail.
com

ABSTRACT and many telecommunication operators using various

In this paper the rectangular microstrip patch antenna arrays
has been designed for S, C and X-band application by using
the IE3D simulator. Roger RT/duroid material with dielectric
constant 2.2 and height 1.588 has been used as a substrate
material. Microstrip inset line feed has been used for feeding
the rectangular patch antenna. Here 1x2 and 1x4 patch
antenna array has been designed using series feed network
and performance parameters of patch antennas array such as
return loss, gain, directivity and VSWR has been computed
and compared.
frequencies [3]. A number of shapes have been used for the
designing of microstrip patch antennas but the rectangular and
circular patches has been most common to use for the
different application in different fields due to their effective
radiation character shown by them when the RF power has
been fed to the patch antenna [4][6].

Keywords
Microstrip antenna; inset line feed; antenna array; return
loss.

1. INTRODUCTION
Antennas are one kind of transducer to convert generated
electrical energy into radiating energy. Antennas are also used
in receiver to collect radiation from free space and deliver the
energy contained in the propagating to the feeder and receiver
Fig 1: Rectangular patch antenna with inset feed
[1] .It has been observed in the recent year that development
in communication system required a light weight, high gain,
high directivity, and high efficiency antenna with minimum Here the dimension of rectangular patch has been computed
return losses and with minimum cost that should work at a by using [6] the equations, given below. Width is calculated
number of frequencies. Microstrip patch antennas fulfill all by using equation (1)
these requirements where in construction such antenna has
been consists of a conducting patch, a substrate material and a 1 2 v 2
RF power feed [4]. According to the IEEE the different bands W  
of frequencies has been defined with different ranges of 2 f r     r 1 2 fr r 1
frequencies such as L, S, C and X -bands and each frequency (1)
band has been used for different applications [5]. Microstrip And the effective dielectric constant is computed by using
antennas found useful in non-satellite based application such equation as
as remote sensing, medical hyperthermia and cancer detection
1
application [2] [6]. From the past history of experiments it has
 r 1  r 1  h 2
been observed that at high frequency range such as X – band  reff   1  12 w 
(8GHz-12GHz) the microstrip antenna are quite effective 2 2   (2)
response as compare to other antenna. However, microstrip
antenna has some drawbacks including narrow bandwidth, Due to fringing effect the increase in length is given by
low power handling capability and low gain[6]. Here a
rectangular microstrip patch antenna has been designed using

  o.3  0.264 
W 
the microstrip inset line feed and roger RT/ duroid material
has been used which shows high value of gain than other reff
substrate material such as Teflon and FR4 [10]. L  0.412h  h  (3)
2. DESIGN OF RECTANGULAR  reff  0.258  0.8 
W 
 h 
MICROSTRIP PATCH ANTENNA
The development of antenna for wireless communication
The actual length of patch is computed by using equation
requires an antenna with more than one operating frequency
because there are various wireless communication systems

175
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

1
L  2L (4)
2 f r  reff 0 o
3. RESULT AND DISCUSSIONS
After calculating the dimension of RMPA now the inset The use of the array of antenna has increased much in the
length of feed inside the patch has been [7] calculated by communications by transmit their signals over long distances
using the equation as without the need for relay stations [8]. Here Rectangular patch
antenna arrays has been designed which resonates at C, S and
0.001699  r 7  0.13761  r 6  6.1783  r 5  93.187  r 4  L X-band frequency so such antenna arrays has been used for
yo  10 4   (5) the number of application such as wireless communication,
 682.69  r  2561.9  r  4043  r  6697  2
3 2
radar system, Wi-Max and in biomedical field [6].
Rectangular patch antenna with inset feed has been shown in
Impedance matching between two elements is the main factor Figure 1 and dimension of patch antenna has been given in
affecting the performance of antenna. Here the width of table 1 on IE3D simulator. In Figure 2 and Figure 3, 1x2 and
microstrip inset line feed with characteristic impedance Zo 1x4 multiband RMPA array has been designed using inset
has been given by using the below [4] equations. feed line where these antenna elements has been combined
with each other using the series feed network . Different
W  8 exp( A) 
 when Z 0  r  89.91and A  1.52 (6) performance parameters have been obtained using IE3D
h  exp( 2 A)  2  simulator such as return loss, gain , directivity and VSWR .

W 2   1  0.61 
 B  1  ln(2B  1)  r ln( B  1)  0.39  
h   2 r   r   (7)

when Z 0  r  89.91 and A  1.52

Where the value of A and B has been [4] calculated using Fig 2: Rectangular 1x2 MPA Array
equation (8) and (9)

60
B (8)
Z0  r

z    1  r 1  .11
1/ 2

A 0  r   0.23   (9)
60  2  r 1 r 
Fig 3: Rectangular 1x4 MPA Array
And length of transmission feed line has been given by using
equation (10)
3.1 Results of 1X2 RMPA Array
 c
Please Return loss Vs Frequency, Gain Vs Frequency,
 directivity Vs Frequency and VSWR Vs Frequency plots of
4 f r  reff (10)
1x2 RMPA array are shown in Fig 4 to Fig 7.

Table 1. Dimension of Single Multiband

Rectangular Patch Antenna with Inset Feed
Length of Rectangular Patch (L) 40.48 mm
Width of Rectangular Patch (W) 48.40 mm

Inset Length of Feed (yo) 9.3167 mm

Width of Inset Feed for Patch (Wi) 4.93 mm
Length of Transmission Feed (λ/4) 20.63 mm
Dielectric Constant of Substrate 2.2
(εr)
Effective Dielectric Constant of 2.032
Substrate (εreff)
Gap width (Wo) 0.34 mm

Dimension of the rectangular patch antenna has been given by Fig 4: Return Loss Vs Frequency
using inset feed line has been given in table 1.

176
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 2. Performance Parameters for Rectangular 1x2

Patch Antenna Array
Frequency Return loss VSWR Gain Directi
(GHz) (dBi) (dBi) vity
(dBi)
2.35 -18.3 1.73 2.45 8.30

4.08 -10.01 1.93 3.54 7.58

5 -22.52 1.20 1.63 6.88

6.82 -14.54 1.63 7.01 11.68

8 -19.84 1.23 3.85 10.01

9.17 -27 1.11 9.24 13.78

Fig 5: Directivity Vs Frequency

3.2 Results of 1X4 RMPA Array

The four antenna elements has been connected in series feed
network as shown in Figure 3 and when such antenna array
has been simulated on the IE3d software then shows the
following results. Return loss Vs Frequency, Gain Vs
Frequency, directivity Vs Frequency and VSWR Vs
Frequency plots of 1x2 RMPA array are shown in Fig 8 to Fig
11.

Fig 6: Gain Vs Frequency

Fig 8: Return Loss Vs Frequency

Fig 7: VSWR Vs Frequency Fig 9: Directivity Vs Frequency

It is clear from Figure 4 that 1x2 RMPA array resonates on
2.35GHz, 4.08GHz, 5GHz, 6.82GHz, 8GHz and 9.17GHz and
each frequency iteration has return losses less than -10dB
which is necessary condition for the working of RMPA [4]
[11]. The performance parameters (return loss, gain,
directivity and VSWR) at each frequency are shown in Table
2. From Figure 5 and Figure 6 it has been observed that such
multiband patch antenna array has maximum gain 9.24dB and
directivity 13.46dB at 9.17GHz frequency.
It is clear from Figure 8 that return losses of 1x4 RMPA array
has less value than 1x2 RMPA array and shows minimum
return loss at 9.17GHz frequency that is -28dB. From Figure 9
and Figure 10 it is clear that RMPA array has maximum gain
9.93dB and directivity and gain at 9.17GHz frequency. These
values of gain and directivity are more than 1x2 RMPA array.
It is clear from Figure 11 that each frequency band has VSWR
[9] less than 2. The different performance parameters for 1x4
RMPA are shown in Table 3.

177
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES
[1] Raja, A. H. 2009 Study of Microstrip Feed Line Patch
Antenna, Eng. & Tech. Journal, Vol.27, No.2.
[2] Mahalakshmi and Jeyakumar, V. 2012 Design and
development of Single Layer Microstrip Patch Antenna
for Breast Cancer Detection Bonfring International
Journal of Research in Communication Engineering, Vol.
2, Special Issue 1.
[3] Chakraborty, U., Chatterjee, S., Chowdhury,S. K., and
Sarkar, P. P.2 011A compact microstrip patch antenna
for wireless communication Progress In
Fig 10: Gain Vs Frequency Electromagnetics Research C, Vol. 18, 211-220.
[4] Garg, R., Bhartia, P., Bahl, I., Ittipiboon, A. 2001
Microstrip Antenna Design Handbook, Artech House
inc.
[5] Lewis, L.L.1991 Introduction to frequency standards,
The IEEE proceeding Vol. 79 No.7. 927-937.
[6] Balanis, C. A.2005 Antenna theory: analysis and design,
3rd ed. ed. Hoboken, N.J. Wiley-Interscience.
[7] Ramesh, M. and Kb Y.2003 Design Formula for Inset
Fed Microstrip Patch Antenna” proceeded in Journal of
Microwaves and Optoelectronics, Vol. 3, N.o 3.
[8] Minervino, D.R. 20134Arrays of Rectangular Patch
Microstrip Antennas for Aerospace Applications 978-1-
4799-1397.
Fig 11: VSWR Vs Frequency [9] Singh, J., Singh, A.P and Kamal,T.S. 2011 On The
Design Of Rectangular Spiral Microstrip Antenna For
Wireless Communication”5th international multi
Table 3. Performance Parameters for Rectangular conference on intelligent system.
1x4 Patch Antenna Array
Frequenc Return loss VSWR Gain Direct [10] Jyothi B., Murthy, V.V.S. and Saha, B.H. 2012 Analysis
y (GHz) (dBi) (dBi) ivity of A Slot Antenna for Different Substrate Materials,”
(dBi) International Journal of Advanced Engineering Research
and Studies E-ISSN2249–8974 IJAERS,Vol. I,Issue III.
2.35 -18.32 1.74 2.63 6.84
[11] Pozar, D. M. and Schaubert, D. H., The Analysis and
4.08 -10.02 1.93 3.414 7.44 Design of Microstrip Antennas and Arrays, published by
john wiley and sons inc., Hoboken, New Jersey.
5 -22.84 1.20 1.53 6.56

6.82 -15 1.63 6.66 11.34

8 -19.61 1.23 3.93 10.06

9.17 -28 1.10 9.93 14.44

4. CONCLUSION
The multiband rectangular microstrip patch antenna has been
designed for S, C and X-band application by using the IE3D
simulator. Roger RT/duroid material with dielectric constant
2.2 and height 1.588 has been used as a substrate material.
Here 1x2 patch antenna array and 1x4 patch antenna arrays
has been designed in series feed network and it has been
concluded that such proposed antenna arrays works for s, c
and x-band applications. When the number of elements has
been increased in the series feed network then performance
parameters also increased efficiently.

178
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
UWB Stacked Patch Antenna using Folded Feed for GPR
application
Mohammad Shahab
Deptt. Of Electronics and Communication Engg.
Future Institute of Engineering and Technology
Bareilly, India
shahabbly@gmail.com
ABSTRACT
In this paper, a design strategy is presented to achieve
enhanced impedance bandwidth for rectangular stacked patch
stacked with H shape rectangular patch & fed with a folded
patch feed. It has been found that by selecting appropriate
width of the folded feed and the size of slots on lower patch,
there is considerable improvement in the impedance
bandwidth & gain of antenna. We achieve an impedance
bandwidth of 122.60 % across the frequency range of
3.58GHz - 14.88GHz. The antenna occupies the compact
dimension of 0.419λg by 0.358λg by 0.209λg where λg is
central operating frequency wavelength. Antenna pattern
shows good performance with congrous radiation pattern and
significant gain over whole frequency band.
Index Terms— folded patch feed; patch antenna ; UWB antenna.
I. INTRODUCTION
Ultrawideband (UWB) communication systems have been
recently received great attention in the wireless world. It is
widely used technology in communications, radar, imaging
and remote sensing applications. Ultra wideband was formerly
known as "pulse radio", but the FCC and the International
Telecommunication Radiocommunication Sector (ITU-R)
currently define UWB in terms of a transmission from an
antenna for which the fractional bandwidth greater than 20%.
Also according to Defense Advanced Research Projects
Agency (DARPA), UWB antennas require to have a fractional
bandwidth greater than 25%.
According to the U.S. Federal Communications Commission
(FCC) the authorized unlicensed use of UWB lies in the
frequency range from 3.1GHz to 10.6 GHz and power spectral
density emission limit for UWB transmitters is
−41.3 dBm/MHz. [2]. The advantages of UWB systems over
conventional (narrowband) wireless communication systems
are its low transmitting power level and high data rates
features. They require consistent gain response for sensitivity
and stable radiation patterns over the entire bandwidth.. The
antenna aspects of UWB systems differ significantly from
those narrowband systems. The design of practical antennas
that radiate efficiently over an ultrawide bandwidth continues
to be a challenging problem. Due to the attractive merits of
low profile, lightweight, ease of fabrication and wide
frequency bandwidth, patch antennas are currently under
179
ISBN: 978-81-924893-0-8
Tanveer Ali Khan
Deptt. Of Electrical Engg.
Future Institute of Engineering and Technology
Bareilly, India
tanveerk881@gmail.com
consideration for use in ultrawideband (UWB) systems.
However, conventional patch antenna suffers typically from a
few percent of bandwidth. For this reason much effort is made
to develop techniques and find configurations to broaden its
impedance bandwidth. It is a common practice to use the
stacked patches to increase gain and/ or impedance bandwidth
of the microstrip antennas. This reduces the impedance
variation of the antenna with frequency, thus enhancing the
impedance matching across a broad frequency band. Various
arrangements of the stacked patch structures have been
investigated. In [5], the maximum bandwidth is 10% and the
structure consists of stacked patches with a shorting wall to
achieve low profile with two layers of dielectric substrate. For
UWB application a dual layer stacked patch antenna with
56.8% bandwidth has been proposed in [6] which has a
dimension of 26.5 x 18 x 11.5 mm³. More recently an
ultrawideband suspended plate antenna consisting with two
layers has achieved an impedance bandwidth of 72.7% [7]. A
new antenna feed method [8] namely the folded-patch feed
has been shown to improve the impedance bandwidth of a
patch antenna. The rectangular U-shaped-slot patch antenna
with a folded patch feed with the dimension of 18 x 15 x 7
mm³ is shown to have an impedance bandwidth of 53.5%
(VSWR 2) [9]. A stacked patch antenna with a folded feed
[10] is presented for ultrawideband application. This design
achieves an impedance bandwidth of 111.08%.
In this paper, a new antenna has been proposed with modified
folded patch feed and slots on lower patch which improves the
impedance bandwidth. Impedance bandwidth of 111.08% has
already been reported [10]. Proposed antenna configuration
further improves impedance bandwidth upto 122.60% and also
improves gain variation over the frequency band.
II. ANTENNA DESIGN AND STRUCTURE
The configuration of the proposed rectangular shaped stack
patch fed by modified folded patch feed antenna is illustrated
in Fig.1. The proposed antenna design has a dimension of 17 x
14.5 x 8.5 mm³ and whole radiating element is centered on top
of a 90 mm x 90 mm ground plane. The radiating patch
including the shorting wall is made of 0.2 mm copper sheet as
the substrate of the whole proposed antenna is air. The antenna
is supporting by coaxial probe and the shorting wall. To
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

support the whole radiating element above the ground plane as

well as to increase a few % impedance bandwidth and to
reduce overall size of antenna we connected a shorting wall to
the ground plane. The probe feed with radius of 0.65 mm is
located on the horizontal central line of the folded patch feed
with 14 mm away from the left edge. With the aid of folded
patch feed design, the probe length shortened, leading to
smaller probe inductance. The overall height of the proposed
antenna is 8.5 mm, while the length of probe is 2.5 mm only
because of this the impedance bandwidth of the antenna
increases significantly. The probe length keeps the real part of
the input impedance as close to 50 Ω. The above specific
shape patch for the slots and the stacked patch configuration
allowed us to obtain a satisfactory matching across the
frequency band of interest. The width of the slots has been
optimize between 3mm to 4mm. The capacitance at the feed (c)
point increases by horizontal section of feeding plate which
Fig. 1. Geometery of the proposed antenna a) top view, b) side view, c) 3D
compensate the increase in inductance due to long probe view
across a broad impedance bandwidth. The extra
electromagnetic coupling in between stack patch of design
further enhance the impedance bandwidth. III. ANTENNA PERFORMANCE & ANALYSIS

The simulation of antenna has been done by Finite-Element

Analysis package, Ansoft HFSS. The simulated return loss
plot is shown in Fig. 2. It is clearly evident that the bandwidth
of the proposed antenna is 122.60 % (10 dB return loss) over
the frequency range of 3.58 GHz-14.88 GHz.
As shown in Fig. 3, the gain of the antenna is above 6 dB and
considerable over the frequency range. VSWR for the said
antenna is plotted in Fig. 4 and is found between 1 and 2. The
radiation pattern at 4.5 GHz and 7.4 GHz is shown in Fig. 6.
The Fig. 4 has been drawn for folded feed width (x_ff) 6, 7, 8
and 9mm and probe feed (x_feed) taking 14mm. The variation
of return loss with probe feed values 11, 12, 13 and 14mm is
shown in Fig.5.

(a)

(b)
Fig. 2. Return loss of the proposed antenna

180
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig. 3. VSWR of the proposed antenna
Fig. 4. Return loss with folded feed width variation
Fig. 5 Return loss with probe feed width variation
181
ISBN: 978-81-924893-0-8
(c)
Fig. 6 (a) Radiation Pattern of the proposed antenna at 4.5 GHz,
(b) 7.4 GHz
IV. CONCLUSION
In this paper, an impedance bandwidth of 122.60% has been
achieved over a frequency range of 3.58 GHZ – 14.88 GHz
which is 11.52% wider than previously reported design [10]
that having impedance bandwidth 111.08%. We optimize the
size of slots on the lower patch, width of folded feed and probe
feed position. The variation of return loss with slots width has
been done and found that by increasing the value above 3mm
the impedance bandwidth decreases. This antenna have small
size and can be fabricated easily with a copper sheet. The
results and dimensions of antenna are mentioned in the Figures.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES [8] C.Y. Chiu, H. Wong, and C.H. Chan, “Study of small wideband
folded-patch-feed antennas,” IET Microw. Antennas
[1] P. Salonen, M. Keskilammi, and M. Kivikoski, “New slot Propag.,vol.2, no. 1, pp. 501-505, 2007.
configurations for dual-band planar inverted-F antenna”, [9] C.Y. Chiu, K. M. Shum, C.H Chan, and K.M. Luk, “Bandwidth
enhancement technique for quarter-wave patch antenna,”
Microwave Opt. Technol. Lett., Vol. 28, pp. 293–298, Mar.
IEEE Antennas Wireless Propag. Lett., Vol. 2, pp. 130-132,
2001. 2003
[2] P. Li, J. Liang, and X. Chen, “Study of printed elliptical/circular [10] Mohammad Tariqul Islam, Mohammed Nazmus Shakib,
slot antenna for ultrawide band application,” IEEE Norbahiah Misran and Baharudin Yatim, “A Stacked Patch
Trans.Antennas Propag., Vol. 54, no. 6, pp. 1670–1675, 2006 Antenna for Ultrawideband Operation” 9781-4244-2931-8/09
IEEE, ICUWB 2009 (September 9-11, 2009)
[3] S. D. Tragonski, R.B. Waterhouse, and D.M. Pozer, “Design of
[11] M.N. Shakib, M.T. Islam and N. Misrann “Stacked patch
wide-band aperture-stacked patch microstrip antennas,” IEEE
antenna with folded patch feed for ultra-wideband application”
Trans. Antennas Propag., Vol. 46, no. 9, pp. 1245-1251, 1999
IET Microw. Antennas Propag., 2010, Vol. 4, Iss. 10, pp. 1456–
[4] R. B. Waterhouse, “Design of probe fed stacked patched.” IEEE
1461
Trans. Antennas Propag., Vol. 47, no. 12, pp. 1780–1784, 1999
[12] Dawar Awan, Shahid Bashir and Nerijus Riauka “Parametric
[5] J. Ollikainen, M. Fische, and P. Vainikainen, “Thin dual-
Study of UWB Antenna Loaded with Stacked Parasitic Patch
resonant stacked shorted patch antenna for mobile
and Reflector “ 2013 Loughborough Antennas & Propagation
communications,” Electron. Lett., vol. 35, no. 6, pp.437–438,
Conference 11-12 November 2013, Loughborough, UK
1999
[13] David Gibbins, Maciej Klemm, Ian J. Craddock, Jack A.
[6] M.A. Matin, B.S. Sharif, and C.C. Tsimenidis, “Dual layer
Leendertz, Alan Preece, and Ralph Benjamin “A Comparison of
stacked rectangular microstrip patch antenna for ultra wideband
a Wide-Slot and a Stacked Patch Antenna for the Purpose of
applications,” IET Microw. Antennas Propag., Vol. 1, no. 6, pp.
Breast Cancer Detection” IEEE Transactions On Antennas And
1192-1196, 2007.
Propagation, Vol. 58, No. 3, March 2010
[7] X. N. Low, Z. N. Chen, and W. K. Toh, “Ultrawideband
suspended plate antenna with enhanced impedance and radiation
performance,” IEEE Trans. Antennas Propag., Vol. 56, no. 8,
pp. 2490-2495, Aug. 2008

182
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
PARAMETERS EVALUATION OF SEMI-CIRCULAR OBJECT
IN STITCHED IMAGE
Jagpreet Singh Ajay Kumar Vishwakarma
SLIET, Longowal SLIET, Longowal
Sangrur, Punjab Sangrur, Punjab
singh.jagpreet86@gmail.com akguru007@yahoo.com
ABSTRACT
In the era of image processing, digital image processing potentially
provides possible, reliable and acceptable solution through the use of
edge detection technique. This paper presents the use of image
stitching combined with thresholding and edge detection algorithm.
Image stitching in real time application has been a challenging field
for image processing. Image stitching is a process of joining two
images in order to create a single large image. Algorithm is
simplified in such a way that the desired parameters such as radius,
area and other dependent dimensional parameters of selected objects
could successfully be determined. The fundamental concepts and
theory of image thresholding is used to calculate various parameters.
Finally all the results are calculated by using MATLAB and
compared with the software tool „imtool‟ in MATLAB. It was found
that the evaluated parameters were highly approximating the actual
values and resulted in good agreement with the proposed algorithm.
Thus the percentage error calculated for all the images considered for
evaluation in this work is very small and even less than one showing
the superiority of the algorithm.
Keywords
Feature extraction, image stitching, Edge detection, Radius
estimation.
1. INTRODUCTION
Image stitching is a traditional image process to create seamless
panorama which shows new perspective of the world around us. In
general, stitching includes feature extraction, registration matching
and blending. Matching of feature of two or several images is used to
find the relationship and it directly relates the speed of image
stitching process and the success rate.
There are many algorithms for matching of images and blending
them. For matching purpose, there are two ways in which one is
direct method and other is the feature detection method. Direct
method is sometimes inconvenient and time taking because it always
needs a high quality and noise free image. But SIFT is used for high
level feature based detection and also applicable for noisy image.
This paper describes the use of SIFT algorithm to merged two small
images into single large image for calculating the object parameters
through edge detection algorithm.
An edge is a set of connected pixels that lie on the boundary
between two regions points in an image where brightness changes
abruptly are called edges or edge points. There are different types of
sharp changing points in an image. Edges can be created by shadows,
texture, geometry, and so for. Edges can also be defined as
discontinuities in the image intensity due to changes in image
structure. These discontinuities originate from different features in an
image. An edge has both magnitude and direction. The direction is
183
ISBN: 978-81-924893-0-8
Neha Hooda
SLIET, Longowal
Sangrur, Punjab
getneha.hooda@gmail.com
used to identify the next possible edge point. Finally, all the edge
points are linked together to form an object boundary [5].
Edge detection is one of the most important processes used in image
processing. It is the basic characteristics of an image and has most of
the information of image object. Its application area reaches from
astronomy to medicine and also for photogrammetric purposes.
Different types of edges present in an image have different
geometrical shapes. These are defined in terms of a step edge, roof
edge, line edge, ramp edge, gray level edge, texture edge and many
others as well [1, 2]. All the edges are detected by edge detection
operations. The edge is the important information source and basis of
shape quality and texture feature.
Thresholding is a non linear operation that is used for image
segmentation process. Thresholding of image is necessary for the
binary conversion of the colored (RGB) or black and white image
available. Threshold follows the same concept as in basic electronics;
here it is used to convert the gray scale image to binary image
consisting of 0s and 1s as pixel values. Image thresholding is most
effective in images with high level of contrast [3]. The proposed
paper presents a new approach of thresholding along with edge
detection for estimating the circular object present in an image. This
method is quite efficient for circular as well as semi- circular object
estimation present within an image and the estimated parameters are
quite close to actual.
Chun-ling Fan et.al. presented the use of Edge detection technique
in vision navigation. Road edge detection helps in analyzing the
specific location of obstacles, speed and size of obstacles on the road,
variations in scene illumination and analyzing the direction of road
extension [4]. Beant Kaur et.al. used the new technique of
Mathematical morphology for edge detection in remote sensing
images. This technique has applications in image segmentation,
texture analysis, image enhancement [5, 6].
The paper is organized as follows. Section II Briefly explains the
SIFT algorithm for stitching the images. Section III explain edge
detection algorithm for detecting the image object. The basic setup
for experiment estimation with the flowchart of the proposed
algorithm is discussed in section IV. Section V Shows the
experimental results and observations made. Finally in section VI
The paper is concluded and the future scope of the proposed
algorithm is viewed.
2. SIFT ALGORITHM
It stands for scale invariant feature transform algorithm by D.G.
Lowe in 2004 which is a scale invariant and rotation based method. It
is also widely used in object recognition, registration and stitching in
images. The steps involved in image stitching using SIFT algorithm
is shown in Fig 1.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Input Construction DOG
Locate strong
image of scale estimation feature
space
Merged Matching Make key point Asking key
Image /blending description points
Fig.1 Flow chart of the SIFT algorithm
The basic steps which are involved in this algorithm are:
First we acquire the two sequential images of a scene through a
digital camera for which we are going to apply stitching process and
find the possible key points to identify location and scales. Detecting
locations that are invariant to scale change of the image can be
accomplished by searching for stable features across all possible
scales, using continuous function of scale known as scale space.
In order to detect local maxima and minima, each sample point is
compared to its eight neighbors in the current image and nine
neighbor in the scale spaced image as shown in Fig.2.
After assigning a consistent orientation to each key-point based on
local image properties, the key-point descriptor can be represented
relative to this orientation and therefore achieved invariance to image
rotation. The best candidate match for each feature points is found by
identifying its nearest neighbor in the data set of feature vectors from
input image. The nearest neighbor is defined as the feature point with
minimum Euclidean distance [7].
Once we found the best transformation we can blend the input
image together with reference image. To overcome the visible
artifacts that are to hide the edges of the component images we use
weighted average method of pixels [8].
Fig.2 Difference of two adjacent intervals in the Gaussian scale-
space
3. EDGE DETECTION ALGORITHM
Edge detection algorithm has several detector methods available.
Sobel algorithm is one of them. It has such advantages as small
amount of calculation and high calculation speed but has the
limitation of inaccuracy and sensitivity to noise. Another is the
Prewitt operator. The principle of Prewitt operator is similar to Sobel
operator except for the weight assigned to the center pixels [9].
Circle detection in basic gray scale images is explored, which is
based on the concept of J. F. Canny and the non-maximum
suppression process for contour tracing described by Neubeck and
Gool. Detection process involves the edge segments if they are part
184
ISBN: 978-81-924893-0-8
of a candidate circle and the center and radius of the circle is
computed using the edge threshold property.
In this paper we have used the novel technique of canny edge
detection operator for edge detection in an image. It detects edges in a
very robust manner. The basic idea of canny operator is smoothing
the raw image. This involves the use of Gaussian function firstly,
then applying Gaussian derivative filters and thus obtaining the edge
gradients and image orientation. The bold image edges are thinned
using non-max suppression before proceeding to the final step, that
is, thresholding of the image. Canny operator is to make the image
gradient operation and then to obtain the edges by finding a local
maximum gradient magnitude of pixels. Compared to other methods
such as Sobel, Prewitt etc. it keeps good balance between noise and
edge detection [10].
A block diagram of the canny edge detection algorithm is shown
in Fig. 3. The input to the detector can be either a color image or a
grayscale image. The output is an image containing assumed circle
edges of the traced semicircular object.
Input image Image Calculation of edge
smoothing strength and direction
Edge map Thresholding Non-maximum
suppression
Fig.3. Block diagram of the canny edge detection algorithm.
Different steps of canny edge detection are given below:
1) First of all it suppress as much noise as possible which is a high
frequency information that overlaps the original signal and introduces
false edges, hence smoothes the image by using Gaussian filter before
detecting edges.
2) The next step is to calculate the gradient and direction at each
point of the image. The image uses Gaussian first order differential
operator to filter, intensity and direction of the image are gained.
3) In this step, the non-maxima suppression of gradient is made such
that the point at which gradient is not maximum are removed and not
considered as a part of edge. So canny suppress the non-maxima
pixels of edge in this step.
4) The last step of this algorithm is to threshold the edges in order to
maintain only the significant ones. This detector uses the “hysteresis”
method of thresholding instead of global thresholding. So two
threshold values are applied on the suppressed image and hence edge
pixels are detected [11].
Thresholding is another important concept used as part of edge
detection process in this work for the calculation of parameters of an
object in the image. Generally thresholding is a non linear operation
that is used for image segmentation. Based upon different criteria
thresholding may be understood with one of the following
techniques:
 Single Thresholding
 Double Thresholding
 Global Thresholding
 Local Thresholding
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The basic concept of thresholding is to convert the gray scale
image to binary image consisting of 0‟s and 1‟s as pixel values. At
the time of process of thresholding, individual pixels in an image are
assigned as object or background. If a given pixel is greater intensity
than the background it is assigned as „object‟ and as „background‟ if
otherwise. A threshold image is given by the expression:
0 𝑖𝑓 𝑓 𝑥, 𝑦 < 𝑇
𝑔 𝑥, 𝑦 =
1 𝑖𝑓 𝑓 𝑥, 𝑦 ≥ 𝑇
4.4 Fit a circle to the boundary
For fitting a circle to the boundary specified by above step, the
basic mathematical equation of circle is used. In semi-circle object,
the complete circle is formed by using the information given by the
images of semi-circular case as given in Table III. Radius and area of
the semicircular object is calculated. Other parameters (not reported
in this paper) as circumference, diameter or volume in case of 3-
dimensional image objects can be calculated.

Such that the pixels with value 1 are considered as an object pixels 5. EXPERIMENTAL RESULTS
and pixel with 0 values are considered as back ground pixels [12].
Thresholding is the easiest form involves mapping all pixels above This section shows the data set of experimental setting and results.
threshold value to one gray value say white and the others are called Firstly we acquired a two sequential images that are stitched through
black. Since the result of image is defined with gray values, the SIFT algorithm for which we evaluated object parameters in stitched
process is called bi-level segmentation process. When multiple image.
threshold values are used the result is a multilevel image and the
process is called multi-level segmentation process. But the Various images of different size are accessed from the reliable
applications dealing with more complex scene automatic multilevel source to check the calculated parameters Initial parameters of the
image segmentation method have to adopt [13]. object in an image such as its tracing point, size, connectivity,
threshold value and value of num point (contour) for each image are
shown in Table 1.
4. EXPERIMENTAL SETUP
This section shows the proposed algorithm in terms of a flowchart as
given in Fig.4. Here the steps on how to estimate the parameters like
radius, area and other parameters are shown. At first we find the
edges of the object in an image using canny edge detection and then
thresholding of the image. Next fit a circle to the detected edge point
using MATLAB software.

4.1 Input image

First of all we acquire the image that have the selective object is
available. In this image we apply the pre processing like de-noising
of image, image dimensioning and conversion of RGB to gray scale
image for edge detection thresholding. Fig.5 Left portion of the image Fig.6 Right portion of the image

4.2 Thresholding of image

It is used to convert the gray scaled or colored image to
binary format. Typically an object pixel is given a value of „one‟
while background pixel is given a value of „zero‟.

Input Thresholding Initialization and

Tracing of boundary
Image of the Image point location

Output Calculation of estimated Fit a circle to

Image Parameters of object the boundary
Fig.7. 248 Points are genuine match out of 1524 points
Fig.4. Block diagram of proposed algorithm.

4.3 Initialization and Tracing of boundary point

location
To find the edges of an object the algorithm picks suitable row
and column pixel value that specifies a point over the semi-circular or
circular object within an image and inspect it until a transition from
background (binary 0) to the object pixel (binary 1) occurs. It may
need to trace the inner boundary (outermost pixel of foreground) or
outer boundary (inner most pixel of background) [14]. Fig.8. Resulting panoramic image using sift algorithm

Tracing point is the starting point where the circular object boundary
is traced in terms of image column pixel value by green line. Tracing

185
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

point of the object can be calculated to read the number of rows and diameter or volume in case of 3-D image objects can be calculated
columns of the object by using MATLAB commands are shown in and comparison of evaluated and actual parameters of image is made.
Table 1.
Table 1. Images and their initial parameters In Table 2 A comparison of evaluated and actual parameters of
image is made. Comparison shows that the parameters resulting from
Sr. Image Image Traci Conne Image Num the proposed algorithm highly approximates the actual values of the
no. taken size ng ctivity threshol point parameters calculated using the image processing tool („imtool‟)
point d value present in the MATLAB toolbox. The percentage error between the
1. Image 256 X 136 8 0.5020 145 actual and estimated results is approaching near zero, thus widely
2 256 acceptable (Table 2).
2. Image 318 X 118 8 0.4314 224
3 340 Table 3 shows the different images taken for experimental
evaluation in the paper. The image named Image1 represents the
standard geometrical shape of a semicircle. Further image named
Image2 is the practical image of the back portion of a car captured by
Table 2. Comparison of Evaluated Image Parameters own camera for the analyses where car-wheel represents the
semicircular object within the image.
Sr Estimated Actual parameters %ag %ag
No e e TABLE 3. SIMULATED IMAGES
. parameters of of image
Erro Erro
image r in r in Sr. Resultant image Conventional image parameter
Parameter calculation (calculation through imtool)
Radi Area No.
through proposed
Radius Area Radius Area us In algorithm
(in (in (in (in pixels) In pixel 1.
pixels) pixels) pixels) pixel s
s
1. 127.01 50684.41 127.02 50661.01 0.007 0.04
2. 114.79 41401.64 114.22 40965.09 0.003 0.01

Radius=127.01 pixels Radius=127.02pixels

A contour plot of the grayscale image automatically sets up the Area=50648.41pixels Area=50661.01pixels
axes so their orientation and aspect ratio match the image. A contour
tracing is a technique that is applied to digital images in order to
extract their boundary. It is one of many preprocessing techniques 2.
performed on digital images in order to extract information about
their general shape.

Once the contour of a given pattern is extracted, its different

characteristics will be examined and used as features which will later
on be used in pattern classification. Therefore, correct extraction of
the contour will produce more accurate features which will increase
the chances of correctly classifying a given pattern. In conclusion,
contour tracing is often a major contributor to the efficiency of the
feature extraction process an essential process in the field of pattern
recognition.
Num point for curve tracing and image threshold value which is
the ratio of white is to black portion of the image are also given in
Table5.1 for each of the images. In image processing and image
recognition, pixel connectivity is the way in which pixels in 2-D or 3-
D images relate to their neighbors. Connectivity of the images for 2-
D may be divided into three connected pixels such as 4, 6 and 8-
connected pixels. Image connectivity for all the cases is taken to be 8
here because 8-connected pixels are neighbors to every pixel that
touches one of their edges or corners. These pixels are connected
horizontally, vertically, and diagonally.
The parameters of the images can be calculated for fitting a circle
(blue line) to the boundary of given object in an image by using
MATLAB coding. Radius and area of the semicircular object is
calculated. In semicircular object, the complete circle is formed by
using the information given by the images of semi-circular form.
Other parameters (not reported in this thesis) as circumference,
Radius=114.79 pixels Radius=114.22pixels
Area=41401.64pixels Area=40965.09pixels
6. CONCLUSIONS AND FUTURE SCOPE
The estimation of different parameters of semi-circular object present
in stitched image has been done using edge detection algorithm based
on MATLAB. The presented work used the edge detection technique
over practical image to show its robustness. The use of edge detection
algorithm for finding the parameters like radius, area etc. in a semi
circular object present in the stitched image has been performed and
the results are calculated by using MATLAB and compared with the
software tool „imtool‟. The estimated parameters highly approximate
the actual values resulting in good efficiency of the proposed
algorithm. The resulting technique can be applied in the area of far
field object detection like telemetry for fault finding in an object
whose captured image is analyzed at remote location. The presented
algorithm has provided accurate results within a few seconds.
But this algorithm has the limitation of being capable of only
circular object detection in an image. No other geometrical shapes are
identified or measured for any image whatsoever. However the

186
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
algorithm is quite robust and reliable for circular as well as semi-
circular object detection present in an image. A possible extension is
to apply the technique over multiple geometrical shapes such as
triangle, hexagon, square, rectangle etc.
REFERENCES
[1] Wenshuo Gao, Lei Yang, Xiaoguang Zhang, Huizhong Liu “An
Improved Sobel Edge Detection”, IEEE Conferences
2010,pp.67-71.
[2] Jiang Lixia, Zhou Wenjun, Wang Yu “Study On Improved
Algorithm For Image Detection” IEEE Conferences,
2010,pp.476-479.
[3] Jaskirat kaur, Sunil Aggrawal, Renu vig, “ A Comparative
Analysis of Thresholding and Edge Detection
SegmentationTechniques‟‟ International Journal of Computer
Applications Volume 39- no.15,2012, pp. 29-34.
[4] Chun-ling Fan, Yuan Ren “Study on the Edge Detection
Algorithms of Road Image”, Third International symposium on
information processing, IEEE Conferences, 2010,pp.217-220.
[5] Beant Kaur, Anil Garg “Mathematical Morphological Edge
Detection For Remote Sensing Images”, IEEE Conferences,
2011,pp.324-327.
[6] Yan Wan, Shanshan Jia, Dong Wang “Edge Detection
Algorithm Based On Grey System Theory Combined With
Directed Graph”, Seventh International conference on image and
Graphics, IEEE, 2013,pp.180-185.
[7] D.G Lowe."Object Recognition from Local Scale-Invariant
Features”, International Conference on Computer Vision, vol. 2,
pp.1150– 1157, 1999..
[8] Yang zhang-long, Guo bao-long. “Image Mosaic Based on SIFT”
International Conference on Intelligent Information Hiding and
Multimedia Signal Processing, IEEE pp. 1422-1425, 2008.
187
ISBN: 978-81-924893-0-8
[9] Raman Maini and Dr. Himanshu Aggarwal “Study and
Comparison of various Image Edge
DetectionTechniques”,International Journal of Image Processing
(IJIP), vol. 3,Issue(1),pp.1-12.
[10] Geng Hao,Luo Min, Hu Feng, “ Improved Self- Adaptive Edge
Detection Method Based on Canny”, Fifty International
conference on intelligent Human – Machine Systems and
Cybernetiecs, IEEE, 2013,pp.527-530.
[11] Siti Salmah Yasiran, Abdhul Kadir Jumaat Aminah, Abdhul
Malek, Fatin Hanani hashim,Rozi Mahmud “Microcalifications
Segmentation using three edge detection techniques”
International conference on electronics design, systems and
applications (ICEDSA), IEEE 2012.
[12] Poonamdeep, Raman Maini “Performance Evaluation of various
thresholding methods using canny edge detector”, International
journal of computer applications. May, 2013,pp.26-32.
[13] Songcan Chan,Min Wang “Seeking Multithreshold directly for
support vector for image segment”, Geometrical methods in
Neural Networks and Learning, 2005, pp. 335-344.
[14] Shohei kumagai, Kazuhiro Hotta “Counting and Radius
Estimation of lipid droplet in intracellular images‟‟, IEEE
International conference on Systems and
Cybernetics,2012,pp.67-71.
[15] R.C.Gonzalez and R.E.Woods “Digital Image Processing” , low
price edition, pearson education publication.
[16] J.Singh,P.Kumar, “Selective evaluation of image parameters
through edge detection algorithm”,IEEE International
conference on advanced in engineering & technology research
(ICAETR),pp.196-200,2014.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Arduino based Microcontroller

Manoj Kumar Vertika Garg
Department of electronic and communication Department of electronic and communication
B.G.I.E.T.,Sangrur B.G.I.E.T.,Sangrur
Manoj95692@gmail.com Gudia.gary95@gmail.com

ABSTRACT source to hardware and electronics? What does it mean to make a

circuit board which is open and extensible, but still usable with
The Arduino board and programming language is an inexpensive little effort? How can we make working with electronics easy,
way for faculty to teach embedded system design in introductory cheap, and quick? These are some of the questions that led to the
courses. In this paper, the Arduino board , programming language, creation the Arduino prototyping platform. This paper discusses
and development will be introduced. Additionally, simple “real- related work, the educational and design context within which
world” electronic interfaces for Arduino systems , such as LED’s, Arduino was developed, the philosophy behind it, the platform
switches, and sensors, will be presented. itself, both hardware and software, and the community that has
formed around Arduino. Integrated development environment
General Terms (based on Processing programming environment) Available for
ARDUINO System open source hardware Platform Window/ Mac/Linux Arduino is an open-source electronics
prototyping platform based on flexible, easy-to-use hardware and
software. It’s intended for artists, designers, hobbyists, and anyone
KEYWORDS interested in creating interactive objects or environments. Arduino
Open hardware, protyping , microcontrollers, opensource, can sense the environment by receiving input from a variety of
education, interactive art. sensors and can affect its surroundings by controlling lights,
motors , and other actuators. The microcontroller on the board is
1. INTRODUCTION programmed using the Arduino programming language and the
It is a movement not a microcontroller founded by Massimo Banzi Arduino development environment. Arduino projects can be stand-
and David Cuartiesslles in 2005 based on wiring platform which alone or they can communicate with software on running on a
dates to 2003 open source hardware platform(1).Open source computer (e.g. Flash, Processing, MaxMSP). The boards can be
development easy to learn language and libraries based wiring built by hand or purchased preassembled; the software can be
language.There are many tools for prototyping with electronics.It downloaded for free.
is used for everything from new musicial instruments to intelligent
rooms.Custom input device and interactive art pieces.These tools The Many Flavors of Arduino
attempt to reduce the difficulty of working with electronics and 1.Arduino Uno
expand the number of people who can experiment with the 2.Arduino Leonardo
medium [4]. Many of them however are either commercial 3.Arduino LilyPad
products expensive and closed or research projects unavailable for 4.Arduino Mega
use by most people.Other consist only of circuit board providing 5.Arduino Mini
no tools to simplify there programming.The open source 6.Arduino Mini Pro
mo9vement mean while has shown that useful and robust software 7.Arduino BT
can be created by a distributed team of volunteers freely sharing
the results of their efforts.Open source projects often gather strong
communities of people working at many levels:some work on the
core code,others contribute small extensions,still other right
documentation of offer support,with the majority simply making
use ogf quality product.Can we apply the principles of open source
to hardware and electronics?What does it mean to make a circuit
board which is open and extensible,but still usable with little
effort?How we can make working with electronics and expand the
number of people who can experiment with the medium [4]. Many
of them , however, are either commercial products expensive and
closed or research projects unavailable for use by most people.
Others consist only of circuit boards, providing no tools to simplify
their programming. The open source movement, meanwhile, has
shown that useful and reboust software can be created by a
distributed team of volunteers freely sharing the results of their
efforts. Open source projects often gather strong communities of
people working at many levels: some work on the core code ,
others contribute small extensions , still others write FIG 1.1 Arduino Based Microcontroller
documentation or offer support, with the majority simply making
use of a quality product. Can we apply the principles of open

188
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Arduino is a tool for making computers that can sense and control
more of the physical world than your desktop computer. It’s an
open-source physical computing platform based on a simple
Microcontroller board, and a development environment for writing
software for writing software for the board. Arduino can be used to
develop interactive objects, taking inputs from a variety of lights,
motors and other physical outputs Arduino projects can be stand-
alone, or they can communicate with software running on your
computer the board can be assembled by hand or purchased
preassembled; the open-source IDE can be downloaded for free.
The Arduino programming language is an implementation of
wiring, a similar physical computing platform, which is based on
the processing multimedia programming environment. There are
many other microcontrollers and microcontrollers platforms
available for physical computing. Parllax Basic Stamp, Netmedia’s
BX-24, Phidgets, MIT’s Handyboard, and many others offer
similar functionality. All of these took take the messy details of
microcontroller programming and wrap it up in an easy-to-use
package. Arduino also simplifies the process of working with
microcontrollers, but it offers some advantage for teachers,
students, and interested amateurs over the systems.
2. RELATED WORK
There are many different microcontroller development tools
available for use in teaching and prototyping. Those that are most
popular outside the electrical engineering community work to offer
some balance between cost, expandability , and ease of use.
Arduino also seeks to balance these factors, while making up for
some of the shortcomings of existing platforms 1. This section
presents a survey of a few of the more popular tools on the market,
followed by an analysis of how their strengths and weaknesses
affect on the design choices behind Arduino. At the highest level
of abstraction are microcontroller tools such as Infusion Systems’
MicroDig, Phidgets, and Standford’s d. tools, Modules at this level
are generally not programmable by the end user. Instead, they are
configured using a desktop tool. These tools are generally not
standalone devices, but must be connected to a personal computer
in order to be useful. Infusion Systems’ MicroDig [5] is a sensor
interface box with a MIDI interface. Its hardware interface consists
of an analog-to-MIDI controller with 8 analog inputs, and various
sensor modules that mate with the controller. Users attach pre-
packaged sensors to the inputs, and connect the controller to a
MIDI output devices. The values of the sensors are output as MIDI
values. The MicroDig is handy for teaching students with some
knowledge of MIDI but little programming or electronics
knowledge how to design hardware interfaces, because it requires
little new knowledge. It is an expensive platform, however, with
the basic kit costing $399, and 1 for a more in-depth comparison,
see [2].Requires that the connecting equipment be MIDI
compatible. Phidgets [9] is a modular system of sensor controllers,
motor controllers, RFID readers, land others special function
devices , all united by a common USB interface and a set of
desktop software APIs. Each Phidget device is a self-contained
electronic device, whether it’s a sensor , motor or LED controller,
or a more complex device like an LCD display. The user needs
almost no electronics knowledge to use Phidgets. Each device is
connected to a desktop computer in order to access its sensor data
or to control it. The development team has released application
programming interfaces for the system in several languages,
including Visual Basic, VBA (Microsoft Access and Excel),
LabView, Java, Delphi, C, C++, and Max/MSP. The modules are
relatively inexpensive , ranging from $10 to $ 100. The devices
189
ISBN: 978-81-924893-0-8
cannot be used as standalone units, however and must be
interfaced to a personal computer to use. The learning curve for
Phidgets is somewhat steeper than for the MicroDig, but it’s useful
for those familiar with software development who want to begin
making hardware interfaces. D.tools [11] is a high-level hardware
and software tool developed at Stanford University’s HCI group
that addresses some of the shortcomings of others in this class.
First, d.tools is a more flexible system. The d.tools software can be
used with other hardware platforms, as long as that hardware is
running a firmware that can communicate in the d.tools protocol.
Wiring, Arduino and Phidgets hardware have been used with
d.tools. The software is written in Java as plugin for the Eclipse
universal tool platform, and can theoretically run on any Java-
capable operating system. Like Phidgets, the hardware is made up
of a series of plug-and-play USB modules, each of which
communicates with the d.tools software d.tools also offers a suite
of analysis tools which allow users to see the results of their
devices graphed on screen, and time-indexed against a video of the
person using the device d.tools is an open source platform, and as
of this writing, the hardware is not commercially available.
Moving down a level of abstraction, there are a number of mid-
level microcontrollers. Controllers in this range feature a
microcontroller with its necessary support electronics (crystal,
power regulator, etc.) on a small module. These modules assume
users can build input and output circuits to attach to the module.
They’re usually programmed in BASIC, or some variation of C,
and attach to the programming environment on a personal
computer using a serial or USB connection. Parallax’ BASIC
stamp[8] is the most well –known of these modules. Also in this
family are NetMedia’s Basic [7] , BASIC Micro’s Basic ATOM
[4] processors. Arduino most resembles these. The main advantage
offered by the mid-level controllers is programmability in a higher
level language, with a simple programming interface. The
disadvantage is generally that the programming languages are very
limited, and the lower levels of the controller itself are not
accessible to the user at all. Students taught to use the controllers
generally reach a problem beyond the module’s capability within
their first semester. The programming environments are almost all
available for Windows operating systems only, though there are
some exeptions.
3. ARDUINO IS NOT ????
Its is not a chip(IC) .It is not a board( PCB) .It is not a company or
manufacturer .It is not a Programming language . It is not a
computer architecture.
Arduino-like systems
1.Cortino (ARM)
2.Xduino (ARM)
3.Leaflabs maple (ARM)
4.Beagleboard (LINUX)
5.Wiring Board (Arduino predecessor)
Arduino programming
Arduino programs are written in C and C++. The Arduino IDE
comes with A software library called “Wiring” from the original
wiring project, which make many common input /output
operations much easier users only need define two functions to
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

make a runnable cyclic executive program: *.setup() : a function
run once at the start of a program that can initialize setting.
*.loop() : a function called repeatedly until the board power off
development
into a supercomputer. But they will help you to get the most out of
this small, but surprisingly powerful little processor.
ACKNOWLEDGMENTS
Our thanks to the DR.SHEWETA RANEE & Mr. VINAY
KHATOR who have contributed towards the development of the
international paper.

REFERENCES
1. J.Sarik and I.Kymissis,”Lab Kits using the Arduino
Prototyping platform,”Frontiers in education
conference,Washington DC,27-3 october 2010,pp.1-5.
2. J.Provost,”Why the Arduino won and Why it’s here to
stay,”.tech.Ref.
3. Information general del
Arduino.http://arduino.cc/es/main/Arduino Board Diecimila
Ultima consulte Julio 2 dec 2010.
4. L.buechley,M.Eisenberg.J.Catchen,and A.Crockett,”The
lilypad Arduino:using computational textiles to investigate
engagement,aesthetics and diversity in computer science
education,”in proceeding of the twenty-sixth annual SIGCHI
Conference on Human factors in computing
Fig1.2 Arduino Software systems.ser.CHI”08,2008,pp.423-
432[online].Available:http://doi.acm.org./10.1145//1357054.1
Arduino is open source hardware : the Arduino hardware reference 357123
design are distributed under a creative commons attribution share – 5. 8-
alike 2.5 licence and are available on the Arduino Web site. Layout bitAVRMicrocontroller,ATMEL,2011.[online],Available:http
and Production files for some versions of the Arduino hardware are ://www.atmet.com/dyn/resources/prod-
also available. The source code for IDE is available and released documents/doc8161.pdf
under the GNU General Public licence, version 2. “Arduino is an 6. Barragan Hernando.”wiring:prototyping physical interaction
open-source electronics platform based on easy-to-use hardware design,”IDI Ivrea people. june 2004.IDI Ivera. 25 jan
and software . it’s intended for anyone making interactive 2007<people.interactionivrea.it/h.barragan/thesis/>
projects.” 7. Reas,Casey and Fry,Ben,”Processing.org:a networked context
for learning computer programming.”ACM
SIGGRAPH,2005.
CONCLUSION 8. Infusion Systems,”Microsystem.”Infusion Systems.Infusion
systems.25jan2007
In this guide we have demonstrated that it is indeed possible for the 9. W.Durface,”Arduino Microcontroller Guide”,University of
Arduino to juggle multiple independent tasks while remaining Minnesota,www.me.umn.edu/co urse s/me
responsive to external events like user input. We’ve learned how to 2011/arduino/,October 2011.
define tasks as state machines that can execute independently of 10. J.O.Lim,and T.Oppus,”Arduino Laboratory Manual:Using the
other state machines at the same time. And we’ve learned how to Advanced Board,”Bughow Electronic solutions and
encapsulate these state machines into C++ classes to keep our code technologies,INC,2011.
simple and compact. These techniques won’t turn your Arduino

190
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Application of DGS in Microstrip Patch Antenna

Sushil Kakkar A.P. Singh T. S. Kamal

Assistant Professor Professor Professor
ECE Department ECE Department ECE Department
BGIET, Sangrur SLIET, Sangrur RIET, Abhohar
kakkar778@gmail.com aps.aps67@gmail.com tsk1005@gmail.com

ABSTRACT the DGS is 10 mm and width (W1) of the defect is 1mm. The
This paper aims to analyze the effect of application of structure of the proposed antenna with and without DGS has
defected ground structure (DGS) on the resonating properties been shown in fig. 1.
of microstrip patch antenna. In order to obtain the
comparative results a small size DGS has been introduced in
the ground plane exactly under the feeding strip of the patch
antenna. The representative results obtained from the
simulations have revealed that the proposed antenna with
DGS possesses better impedance matching and wider
bandwidth than its original structure without DGS. The
presented antenna is small size and low profile antenna
suitable for X-band applications.

Keywords
Bandwidth, DGS, Return Loss.

1. INTRODUCTION
Defected Ground structure (DGS) can be used as an
alternative approach to improve the resonating performance of
the microstrip patch antennas [1]. It can be formed by making
simple slot in the ground of the antenna which effects the
distribution of the current in the ground plane leading a
controlled propagation of electromagnetic (EM) waves
through the dielectric layer [2,3]. As per the literature
reviewed, DGS provide the considerable miniaturization,
good impedance matching and wider bandwidth in the design (a)
engineering of patch antennas [4]. DGS structures are periodic
lattices, which can provide effective and flexible control over
the propagation of the EM waves within a particular band [5].
The main limitation of microstrip patch antennas is narrow
band and so far several solutions have been provided in the
literature such as introduction of slots in the patch, higher
dielectric substrate, coplanar wave guide feeding method,
DGS, etc. to increase the bandwidth. Among them DGS can
be the better option because besides wider bandwidth it also
provides miniaturization to the antenna structure [6-8]. In the
similar approach, an attempt has been made in this paper to
introduce the defects in the ground plane exactly beneath the
feed strip to provide better impedance matching and
bandwidth.

2. DESIGN AND STRUCTURE

The proposed antenna structure is a simple patch antenna with
square shape having side of the square (S2) of 10 mm. The
feeding strip is designed in such a way to obtain 50 ohms
impedance. The width of the strip (W) is 5 mm. Square shape
is the candidate structure for the ground plane having side
(S1) of 20 mm. In order to further enhance the resonating (b)
performance of the proposed antenna, a small size rectangular
DGS has been introduced in the structure. The length (L1) of

191
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig 3: Simulated input impedance of proposed antenna for

both with DGS and without DGS structure.

(c) Table 1. Comparison of Resonating properties with and

Fig 1: Geometry of proposed antenna (a) without DGS (b) without DGS
Reson
with DGS (c) bottom view of DGS
ating Return Input Bandwidth
Structu
Frequ Loss Impedance (GHz)
3. RESULTS AND DISCUSSION re
ency (dB) (ohms)
3.1 Resonant Parameters (GHz)
The analysis of presented antenna has been done using Without 2.91
11.26 -18.95 41.14-j5.25
DGS
method of moment based IE3D EM solver. The graphical plot
of scattering parameters of both the antennas (with and With 3.48
11.63 -29.18 48.09-j2.82
without DGS) has been given in fig. 2 and 3. The obtained DGS
results reveals that the antenna structure with the
implementation of DGS under its feeding strip provide wider
bandwidth and better impedance matching in comparison to
3.2 Radiation Patterns
The radiation patterns of the proposed antenna with DGS is
its original structure without DGS. The detailed resonating
shown in fig 4 and the presented results reveals that the
parameters of both the antennas have been given in table 1.
radiation pattern in the E-plane is bidirectional and in H-plane
is omnidirectional.

Fig 2: Simulated s-parameters of proposed antenna for

both with DGS and without DGS structure.

(a)

192
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
(b)
Fig 4: Radiation pattern of the proposed antenna with
DGS (a) E-plane (b) H-plane
3.3 Gain
The gain vs. frequency plot of proposed antenna with DGS is
shown in fig. 5. The maximum achievable gain of the antenna
is 6.77 dBi at 11.63 GHz resonant frequency.
Fig 5: Gain of the proposed antenna with DGS
193
ISBN: 978-81-924893-0-8
4. CONCLUSION
This paper proposed a simple microstrip patch antenna with
the introduction of DGS beneath the feeding strip. In order to
obtain the effect of DGS critical simulated study has been
done using IE3D simulator. The presented results reveal that
the proposed antenna with DGS provides better impedance
matching and wider bandwidth than its original structure. The
proposed antenna is small size, low profile antenna that can be
used for various wireless applications in X-band region.
REFERENCES
[1] Weng et. al, “An Overview on Defected Ground
Structure”, Progress In Electromagnetics Research B”,
Vol. 7, 173-189, 2008.
[2] D. Schlieter and R. Henderson, “High Q Defected
Ground Structures in Grounded Coplanar Waveguide”,
Electronic Letters, Vol. 48, no. 11, May 2012.
[3] S. Rani and A. P. Singh, “Fractal Antenna with Defected
Ground Structure for Telemedicine Applications,”
International journal on Communications, Antenna and
Propagation, vol.1, pp. 1-15, 2012.
[4] A. Arya, M. Kartikeyan and A. Patnaik, “On the Size
Reduction of Microstrip Antenna Using DGS”,
Proceedings of IEEE Conference, 2010.
[5] A. Nouri and G. Dadashzadeh, “A Compact UWB Band-
Notched Printed Monopole Antenna with Defected
Ground Structure”, IEEE Antennas and Wireless
Propagation Letters, Vol. 10, 2011.
[6] S. Rani and A. P. Singh, “On the Design and
Optimization of New Fractal Antenna Using PSO”,
International Journal of Electronics, vol. 100, no. 10, pp.
1383-1397, 2012.
[7] S. Kakkar, S. Rani and A. P. Singh, On the Resonant
Behaviour Analysis of Small-Size Slot Antenna with
Different Substrates, International Journal of Computer
Applications, pp. no. 10-12, 2012.
[8] R. Azaro, L. Debiasi, M. Benedetti, P. Rocca and A.
Massa, “A Hybrid Prefractal Three-Band Antenna for
Multistandard mobile Wireless Applications”, IEEE
Antennas and Wireless Propagation Letters, vol.8, pp.
905-908, 2009.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Wavelength Assignment Problem In WDM Network
Gunvir Singh Abhinash Singla
Bhai Gurdas College of Engg. Bhai Gurdas College of Engg.
& Tech.,Sangrur.Punjab & Tech.,Sangrur.Punjab
gunvirsingh@gmail.com abhinash11@gmail.com
ABSTRACT
Given a WDM network, the problem of routing and assigning
wavelength to lightpaths is of paramount importance. The
clever algorithms are needed in order to ensure that Routing
and Wavelength Assignment (RWA) function is performed
using a minimum number of wavelengths. The number of
available wavelengths in a fiber link plays a major role in
these networks which is increasing day by day. Once the route
is defined for the connection then what is left is wavelength
assignment. For wavelength assignment a number of
algorithm have been proposed but there is a urgent need of a
wavelength assignment algorithm which should be low
complex in nature. After the literature survey we can conclude
that further work can be done in this field to reduce the
blocking probability
1. INTRODUCTION
Wavelength division multiplexing (WDM) is a very
promising technology to meet the ever increasing demands of
high capacity and bandwidth. In a WDM network several
optical signals are sent on the same fiber using different
wavelength channels. Sometimes, the term dense wavelength
division multiplexing (DWDM) is used to distinguish the
technology from the broadband WDM systems where two
widely separated signals (typically 1310nm and 1550nm)
share a common fiber. In DWDM up to 40 or 80 signals are
combined on the same fiber. WDM networks are a viable
solution for emerging applications, such as supercomputer
visualization and medical imaging, which need to provide
high data transmission rate, low error rate and minimal
propagation delay to a large number of users [1].
Traditionally, only a small fraction of the fiber capacity was
used, but by using WDM it is possible to exploit this huge
capacity more efficiently [2]. The possibility to use the
existing fibers more efficiently makes WDM a very attractive
alternative commercially, as it is very expensive to install new
194
ISBN: 978-81-924893-0-8
Sumit Malhotra
Bhai Gurdas College of Engg.
& Tech.,Sangrur.Punjab
sumitmalhotra.mail@gmail.com
fibers in the ground. This is the case especially in densely
populated areas like cities, where fibers must be dug under
streets etc. WDM technology has been recognized as one of
the key components of the future networks. The
commercialization of WDM technology is progressing
rapidly. Most important for the development of the WDM
technology was the invention of Erbium Doped Fiber
Amplifier, (EDFA) an optical fiber amplifier in 1987. The
optical fiber amplifier is a component capable of amplifying
several optical signals at the same time without converting
them first to electrical domain (opto-electronic amplification).
It is also important to note that EDFAs can be used to amplify
signals of different bit rates and modulations. Other important
WDM components include lasers, receivers, wavelength
division multiplexers, wavelength converters, optical splitters
and tunable filters amongst others. There is also wide interest
towards the optical networking in academic community as it
offers a rich research field for scientists from the component
level up to the network protocols.
If there are multiple feasible wavelengths between a source
node and a destination node, then a wavelength assignment
algorithm is required to select a wavelength for a given
lightpath. The wavelength selection may be performed either
after a route has been determined, or in parallel with finding a
route. Wavelength Assignment problem is divided into two
parts on-line wavelength assignment and off-line wavelength
assignment problem.
There are two constraints that have to be kept in mind by the
approaches when trying to solve RWA.
i. Distinct wavelength assignment constraint: All lightpaths
sharing a common fiber must be assigned distinct
wavelengths to avoid interference. This applies not only
within the all-optical network but in access links as well.
ii. Wavelength continuity constraint: The wavelength
assigned to each lightpath remains the same on all the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

links it traverses from source end-node to destination 2. PROBLEM FORMULATION

end-node
Although a lot of research work is done in
The first constraint holds for solving wavelength Wavelength Assignment for optimization of blocking
assignment problem in any wavelength routing network. performance in Wavelength division multiplexed networks
The second constraint applies only to the simple case of but not enough research is done on comparing these
wavelength routing networks that have no wavelength Algorithms. By analyzing how conventional algorithms
conversion capability inside their nodes performs, the shortcomings can be found out and more
research could be done on removing those shortcomings
Based on the order in which the wavelengths are searched,
wavelength assignment methods are classified into most- 3. CONVENTIONAL ALGORITHMS
used, least-used, fixed-order and random-order. In the
The algorithms which are used for simulation are
most-used wavelength assignment method, wavelengths are
conventional algorithms such as first-fit algorithm and
searched in non-increasing order of their utilization in
random algorithm. These algorithms can be illustrated as
network. This method tries to pack the lightpaths so that
below:
more wavelength continuous routes are available for the
request that arrives later. In the least used wavelength 1. First-fit algorithm: In this algorithm, firstly the
assignment method, wavelengths are searched in non- wavelengths of the traffic matrix are sorted in non-
decreasing order of their utilization in the network. This decreasing order. Then algorithm steps through this
method spreads the lightpaths over different wavelengths.
sorted list for selecting candidate chains joined. Let
The idea here is that a new request can find shorter route
be the next highest wavelength element in sorted list.
and a free wavelength on it. In the fixed-order wavelength
Then, if both nodes and are the end nodes of two
assignment method, the wavelengths are searched in a fixed
chains, largest chain is formed by joining two ends,
order. The wavelengths may be indexed and the wavelength
otherwise next highest element is considered. This
with the lowest index is examined first. In the random
process is carried on until all chains are considered to
wavelength assignment method the wavelength is chosen
form a single chain representing linear topology.
randomly from the free wavelengths.

2. Random algorithm: In this algorithm, wavelength is

One possible way to overcome the bandwidth loss caused
selected randomly from available wavelengths. A
by the wavelength continuity constraint is to use
number is generated randomly and the wavelength is
wavelength converters at the routing nodes. A wavelength
assigned to this randomly generated number.
converter is an optical device which is capable of shifting
one wavelength to another wavelength [2813, 2914]. The
capability of a wavelength converter is characterized by the Algorithm First-fit
degree of conversion. A converter which is capable of begin
sort elements of U in non-decreasing order;
shifting a wavelength to any one of D wavelengths is said
While (two or more chain exist) do
to have conversion degree D. The cost of a converter grows begin
with the increasing conversion degree let uij be the next highest element in U;
if (i and j are the end nodes of the two chains „ij‟ and „jl‟ ) then
connect i and j to get the chain „kl‟;
The basic function of the wavelength converter is to discard uij ;
convert an input wavelength to possibly different output end;
wavelengths within operational bandwidth of WDM
systems in order to improve their overall efficiency and
hence the reuse factor is increased Due to multi-wavelength
fiber optic systems interest is growing in converting signals
from one wavelength to another Figure 3.1: First-fit Algorithm

195
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The algorithm for the random wavelength assignment is very 2. Distinct wavelength constraint: all lightpaths using the
simple and is limited to the generation of a random number same link must be allocated distinct wavelengths.
but algorithm for first-fit is a bit complex. The algorithm for
the first-fit wavelength assignment can be illustrated by figure If there is no free wavelength available on any link the call

(3.1). will be blocked. In simple terms blocking probability as per

Poisson’s formula can be calculated as the ratio of calls

4. ANALYSIS OF WAVELENGTH blocked to the total number of calls generated as given in

ASSIGNMENT STRATEGIES. equation (4.1).

Here, conventional wavelength assignment strategies are

analyzed and compared with each other on the basis of (4.1)
blocking probability and fairness. The performance of
conventional wavelength assignment algorithms is calculated Also, the blocking probability on the link can be calculated by
in terms of blocking probability and fairness. Erlang‟s-B famous Erlang-B formula as given by Milan Kovacevic[45]
formula is used to compute the blocking probability. We have equation (4.2)
developed approximate analytical models for clear channel
blocking probability of the network with arbitrary topology,
both with or without wavelength translations. The goal of our
analysis is to calculate and compare blocking probability of (4.2)
different algorithms. While analyzing following assumptions
are made: Where is blocking probability for load and
wavelengths.
 The network is connected in an arbitrary topology. Each
link has a fixed number of wavelengths.
5. PROPOSED LEAST-USED
WAVELENGTH CONVERSION
 Each station has an array of transmitters and receivers,
ALGORITHM
where is the number of wavelengths carried by the
fiber. In this section, we have proposed an efficient wavelength
assignment algorithm for dynamic provisioning of lightpath.
 Point to point traffic. This proposed algorithm is an improvement of Least-used
wavelength assignment algorithm. We have used
 There is no queuing of the connection request. The mathematical model for WDM optical networks for
connection blocked will suddenly be discarded. minimization of blocking probability. The results of proposed
algorithm are then compared with conventional wavelength
 Link loads are mutually independent. assignment algorithms such as first-fit, best-fit, random and
most used wavelength assignment algorithms. Simulation
 Static routing is assumed.
results proved that these proposed approaches are very
effective for minimization of blocking probability of optical
We have considered blocking probability for wavelength non-
WDM networks.
convertible networks. The two constraints which are followed
for the wavelength assignment are:
6. COMPARISON OF PROPOSED
1. Wavelength continuity constraint: a lightpath must use WAVELENGTH ASSIGNMENT
the same wavelength on all links along the path from
ALGORITHM WITH THE
CONVENTIONAL ALGORITHM
source to destination edge nodes.
The blocking probability of proposed algorithm is compared
with algorithms such as first-fit, best-fit, random and most-

196
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

used wavelength assignment algorithm and are shown in
figure (6.1) and figure (6.4). For this comparison we have
fixed the number of channels to 20; the total number of links
used in the network is also fixed to 20; and the total number
of wavelengths used and the load per unit link are varied.
the proposed algorithm can be used. This algorithm proposed
gives the blocking free environment.
Also, the simulation results proved that blocking probability
(%age) increases with increase in the number of nodes. This
algorithm proposed gives the blocking free environment

Figure 6.1: Comparison of the algorithm for load=10

Figure 6.4: Comparison of the algorithm for load=10
Erlangs; W=20 Erlangs; W=30

REFERENCES

[1]. Anwar Alyatama, “Wavelength decomposition

approach for computing blocking probabilities in
WDM optical networks without wavelength
conversions,” Computer Networks, vol. 49, pp. 727–
742, 2005.
Figure 6.2: Comparison of the algorithm for load=30
Erlangs; W=20 [2]. Junjun Wan, Yaling Zhou, Xiaohan Sun, Mingde
Zhang, “ Guaranteeing quality of service in optical
burst switching networks based on dynamic
wavelength routing,” Optics Communications, vol.
220, pp. 85–95, 2003.

[3]. I. Alfouzan, M.E. Woodward, “Some new load

balancing algorithms for single-hop WDM
networks,” Optical Switching and Networking, vol.
3, pp. 143–157, 2006.

Figure 6.3: Comparison of the algorithm for load=10
Erlangs; W=10
7. CONCLUSIONS
The blocking probability of proposed algorithm is low in
comparison to the conventional algorithms. In situations
where the algorithm of the given system can be changed then
[4]. F. Matera, D. Forin, F. Matteotti, G. Tosi-Beleffi, “
Numerical investigation of wide geographical
transport networks based on 40 Gb/s transmission
with all optical wavelength conversion,” Optics
Communications, vol. 247, pp. 341–351, 2005.
[5]. Abhisek Mukherjee, Satinder Pal Singh, V.K.
Chaubey, “Wavelength conversion algorithm in an

197
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

intelligent WDM network,” Optics [9]. Jianping Wang, Biao Chen and R. N. Uma,
Communications, vol. 230, pp. 59–65, 2004. “Dynamic Wavelength Assignment for Multicast in
All-Optical WDM Networks to Maximize the
[6]. P. Rajalakshmi, Ashok Jhunjhunwala, “Wavelength Network Capacity,” IEEE Journal on Selected
reassignment algorithms for all-optical WDM Areas in Communications, vol. 21, no. 8, pp. 1274 -
backbone networks,” Optical Switching and 1284, October 2003.
Networking, vol. 4, pp. 147–156, 2007.
[10]. Nen-Fu Huang and Shiann-TsongSheu, “An
[7]. Mahesh Sivakumara, Suresh Subramaniam, Efficient Wavelength Reusing/Migrating/Sharing
“Blocking performance of time switching in TDM Protocol for Dual Bus Lightwave Networks,”
wavelength routing networks,” Optical Switching Journal of Lightwave Technology, vol. 15, no. 1, pp.
and Networking, vol. 2, pp. 100–112, 2005. 62-75, January 1997.

[8]. Raja Datta, BivasMitra, SujoyGhose, and [11]. Arun K. Somaniand Murat Azizoglu, “Wavelength
IndranilSengupta, “An Algorithm for Optimal Assignment Algorithms for Wavelength Routed
Assignment of a Wavelength in a Tree Topology Interconnection of LANs,” Journal of Lightwave
and its Application in WDM Networks,” IEEE Technology, vol. 18, no. 12, pp. 1807-1817,
Journal on Selected Areas in Communications, vol. December 2000.
22, no. 9, pp. 1589-1600, November 2004.

198
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Comparative Study of Different Algorithms to Implement

Smart Antenna Array-A Review
Gurjinder kaur Gautam kaushal
Punjabi University Punjabi University
er.gurjinderkaur90@gmail.com gautamkaushal@yahoo.com

ABSTRACT
In this paper, smart antennas are antenna array use to
empathize spatial signal such as DOA of the signal and used
to find beamforming vectors and locate the antenna ray in the
desired direction of target. Beam formed adaptive algorithms
allow the antenna to steer the beam in desired direction of
interest while cancelling the obtrusive signals. The prompt
growth of smart antenna makes use of different algorithms to
implement it. Now the comparison of different algorithms
discussed in my review paper.

General Terms
Algorithms include LMS, SMI, QRD - RLS.

Keywords
Direction of arrival (DOA), Least mean square (LMS),Sample Fig.1 Smart Antenna System
covariance matrix inversion (SMI), Quadrature Rotation
Decomposition Recursive least squares( QRD-RLS).

1. INTRODUCTION
Smart antenna systems generally used in acoustic signal
processing, SONAR Radio telescopes, Radio astronomy and
mostly in cellular systems like WCDMA and UMTS. It has
two functions: DOA estimation and Beamforming. DOA
estimation is to use the particular data received by the array to
estimate the direction of arrival of the signal. Beamforming
is the method used to make the radiation pattern of the
antenna array by adding effectively the phases of the signals
in the direction of the targets and null the pattern of the
mobiles that are undesired. The smart antenna systems can
generally be revealed as either switched beam or adaptive
array systems. In a switched beam system multiple fixed
Fig.2 Concept of Smart Antenna
beams in predetermined directions are used to serve the users.
Adaptive beam forming uses antenna arrays aided by strong
signal process capability to automatically change the beam
2. SMART ANTENNA ALGORITHMS
An LMS algorithm is used to cancel the unwanted
pattern in correspondence with the changing signal
interference. [3-6]LMS algorithm uses continuous adaptation.
environment. It not only directs maximum radiation in the The weights are adjusted as the data is sampled such that the
direction of the desired target but also introduces nulls at resulting weight vector sequence combines to the most
undesirable directions while tracking the desired mobile user favorable solution. It is an iterative beamforming algorithm
at the same time [1].Fig.1 shows smart antenna system. A that uses to find the gradient vector from the available data.
smart antenna technology can achieve a number benefits like This algorithm makes successive corrections to the weight
vector in the direction of the negative of the gradient vector
increase the system capacity, greatly reduce interference,
which finally wrap up to minimum MSE.Fig.3 shows adaptive
increase power efficiency. beamforming network. LMS is an adaptive beamforming
algorithm, defined by the following equations with input
The smart antenna electronically steer a phased array by signal:
weighting the amplitude and phase of signal at each array
element in response to changes in the propagation y(n) = wT(n-1).u(n)
environment. Capacity improvement is achieved by effective
co-channel interference cancellation and multipath fading e(n) = d(n) – y(n)
mitigation. Figure 2 shows the concept of smart antenna[2].

199
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

w(n) = w(n-1)+µe(n)u*(n) SMI employs direct matrix inversion the convergence of this
algorithm is much faster compared to the LMS algorithm.
where y(n) is the filter output, e(n) is the error signal
between filter output and desired signal d(n) at step n . d(n) is
the training sequence of known symbols (also called a pilot
signal), is required to train the adaptive weights. Enough
training sequence of known symbols must be present to assure
convergence. w(n) update function for the LMS algorithm.
Least Mean Square (LMS) algorithm, proposed by Widrow
and Hoff in 1959 [9] is an adaptive algorithm, which uses a
gradient-based method of steepest decent. It is used in
adaptive antennas which is a is a multi-beam adaptive array
with its gain pattern being adjusted dynamically [1-3]. In
recent decades, it has been mostly used in different areas such
as mobile communications, radar, sonar, medical imaging,
radio astronomy etc. Especially with the increasing demand
for improving the capacity of mobile communications,
adaptive antenna is introduced into mobile systems to
decrease the effect of interference and improve the spectral Fig.4 Adaptive RLS beamformer
efficiency. SMI algorithm for adaptively adjusting the array
weights, uses block adaptation. The statistics are estimated QRD-RLS algorithm is used to solve least square problems.
from a temporal block of array data and used in an optimum The decomposition is the basis for QR algorithm. Algorithm
weight equation. In the literature, there have been many is used to produce the eigen values of matrix. QR
studies about different versions of LMS and SMI algorithm decomposition is one of the best numerical procedures for
Used in adaptive antennas [10]. The SMI algorithm has a
solving the recursive least squares estimation problem. It
faster convergence rate since it employs direct inversion of
the covariance matrix. Sample Matrix Inversion (SMI) which involves the use of numerically well behaved unitary rotations
is also known as Block adaptive approach because it involves and operates on input only.[3] Fig.4 shows the adaptive RLS
block implementation or block processing i.e. a block of beamformer.The RLS algorithm would require floating point
samples of the filter input and the desired output are collected precision, or very long fixed point word lengths, due to its
and processed together to obtain a block of output samples. numerical ill-conditioning. In addition to Multiply/Add
The process involves the parallel conversion of the input data, standard RLS implementation also requires divide operations.
parallel processing of the collected data and parallel to serial
conversion of the bring out output data. The computational
2.2 The QRD process is formed by a sequence of two
complexity can be further decreased by the elegant parallel
operators. These are the unitary rotations that convert
processing of the data samples. Thus we can say that in this
complex input data to real data and an associated angle and
type of algorithm we are adapting the weights block by block
element combiners that decimate the selected elements of the
thus increasing the convergence rate of the algorithm and
input data set one by one. The QRD implementation was
reducing the computational complexity further.
attained by using the Xilinx System Generator [12] for DSP
model-based design flow. This is tool chains that lengthen the
123…….k 123…….k
Mathworks Simulink framework with FPGA hardware
generation capabilities. System Generator is a visual design
123…….k environment that allows the system developer to work at a
suitable level of abstraction
k, is the no. of blocks. from the target hardware, and use the same computation graph
not only for simulation and verification, but for FPGA
Compared to SMI algorithms LMS algorithm is relatively hardware implementation. System Generator blocks are bit-
and cycle-true behavioral models of FPGA subjective
simple; it does not require correlation function calculation nor property components, or library elements.
does it require matrix inversions.
The RLS algorithm provides the solution to the slow
convergence of LMS and SMI with the help of QRD least
square processing solution. The antenna array contains three
types of processing cells including are boundary cells, internal
cells and output cell. The boundary cell performing
“vectoring” on complicate input samples to cancel out their
imaginary part. Rotation angles are formed by using input
cells. The output cells in the linear array process the elements
of the upper triangular array to perform the required back
substitution [2] to produce the beamformer weights.

3. FPGA based QRD

The QR-decomposition(QRD)based recursive least squares
(RLS) algorithm is usually used as the weight-update
Fig.3 LMS Adaptive beamforming network algorithm for its fast convergence and good numerical
properties. The updated beam-former weights are then used

200
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
for multiplication with the data that has been transmitted
through the dedicated physical data channel (DPDCH).
Maximal ratio combining (MRC) of the signals from all
fingers is then performed to yield the final soft estimate of the
DPDCH data.
Fig.4 QR-decompositions-based least squares
The least squares algorithm attempts to solve for the
coefficient vector c from X and y. Fig.4 shows QRD based
least square process.[13]To realize this, the QR-
decomposition algorithm is first used to transform the
matrix X into an upper triangular matrix R (N x N matrix) and
the vector y into another vector u such that Rc=u. The
coefficients vector c is then computed using a procedure
called back substitution, which involves solving these
equations:
cN = uNN/RN
ci =1/Rii(ui-∑RijCj)
for i = N-1,-1
The beam-former weights vector c is related to
the R and u outputs of the triangular array as Rc=u. R is an
upper triangular matrix, c can be solved by a procedure called
back substitution. [14]Substitution procedure works on the
outputs of the QR-decomposition and involves mostly
multiply and divides operations that can be accurately
executed in FPGAs with embedded soft processors. The
software can then complete the multiply operation in a single
clock cycle. Since hardware dividers generally are not
available, the divide operation can be implemented as custom
logic block that generally become part of the FPGA-resident
microprocessor. Between the multiply and divide accelerators,
back-substitution becomes so easy and efficient. There are a
number of beam-forming architectures and an adaptive
algorithm that gives good performance under different
scenarios, such as transmit/receive adaptive beam forming and
transmit/receive switched beam forming. FPGAs with
embedded processors are reliable by nature, providing options
for various adaptive signal-processing algorithms. The
standards for next-generation networks are generally evolving
and this generates an element of risk for beam-forming ASIC
implementations. Transmit beam forming, for example,
utilizes the feedback from the mobile terminals.[15-16] The
number of bits provided for feedback in the mobile standards
can determine the beam-forming algorithm that is used at the
base station. Moreover, future base stations are used to
support transmit diversity, including space/time coding and
multiple-input, multiple-output (MIMO) technology. Since
FPGAs are remotely upgradeable, they minimize the risk of
depending on evolving industry standards while providing
201
ISBN: 978-81-924893-0-8
another option for gradual deployment of additional transmit
diversity schemes.
Each element of Antenna array may also be described as
CORDIC block.[17] Cordic describes a method to perform a
number of functions including trigonometric, hyperbolic and
logarithmic functions.
Fig.5 Configuration of Systolic cordic device.
systolic arrays are known which reduce processing time by
parallel implementation of an RLS algorithm based on QR
decomposition. u1(n) input signal series for first tap,u2(n)input
signal series for second tap, the values of tap coefficients can
also be obtained as an output signal e. [18-19]Fig.5 shows the
configuration of systolic cordic device. In order to perform
processing of a sequential least-squares algorithm based on
QR decomposition a final cell which provides the estimated
error from the calculated values of boundary cells. QRD
utilizes unidirectional processor array structure for smart
antenna to cancel out the undesired side lobes, to increase
receiver sensitivity and to eliminate all errors. It is most
suitable algorithm then LMS and SMI to implement smart
antenna. Therefore, one could select the systolic array
structure of [7] when the polynomial order is small while
preferring the unidirectional array of [9] for higher
polynomial orders.
4. CONCLUSION
Algorithms for efficient direction of arrival estimation and to
electronic steer the beam of smart antenna are compared.
LMS algorithm is simple it does not require correlation
function and matrix inversion but it has slow speed of
convergence and lesser numerical stability.SMI is faster than
LMS algorithm but the computational burden can cause
problem. QRD-RLS is less complex than LMS and SMI and
provides speed of convergence. It eliminates almost all errors
and has good numerical properties. Further QRD-RLS with
simulation results will be taken to implement smart antenna
array.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5. ACKNOWLEDGEMENTS
I thanks to the Professor Gautam kaushal who have
contributed towards development of the review research.
REFERENCES
[1] Suraya mubeen, Dr.Am Prasad and DR.A.Jhansi Rani, 2012.
Smart Antenna its algorithms and implementation .
[2] L. C. Godara, “Applications of Antenna Arrays to Mobile
Communications, PartI: Performance Improvement, Feasibility,
and System Considerations,” in Proc. IEEE , vol. 85, pp. 1031-
1060, July 1997.
[3] J. Blass, “Multidirectional Antenna: A New Approach to
Stacked Beams,” IRE International Conference Record, Vol.8,
Part 1, 1960.
[4] S. Mano, et al., “Application of Planar Multi beam array
Antennas to Diversity Reception,” Electronics and
Communications in Japan, Part 1, Vol. 79, No. 11, pp. 104-
112, 1996.
[5] J.Winters, "Smart Antennas for Wireless Systems", IEEE
Personal Communications, vol 1,pp. 23-27., Feb. 1998.
[6] G.Tsoulos, M.Beach, “Wireless Personal Communications for
the 21stCentury: European Technological Advances in Adaptive
Antennas ”IEEE Communications Magazine, Sep.1997.
[7] L. Acar, R.T. Compton, The Performance of an LMS Adaptive
Array with Frequency Hopped Signals, IEEE Transactions on
Aerospace and Electronic Systems, Vol. 21,No. 3, pp. 360-371,
1985.
[8] Y. Ogawa,, et al., An LMS Adaptive Array for Multipath
Fading Reduction, IEEE Transactions on Aerospace and
Electronic Systems, Vol. 23, No. 1, pp. 17-23, 1987.
[9] B. Widrow and M. A. Lehr, “30 years of adaptive neural
networks: Perceptron, madaline, and backpropagation,” Proc.
IEEE, vol. 78, pp. 1415-1442, 1959.
[10] R. Yonezawa, I. Chiba, A Combination of Two Adaptive
Algorithms SMI and CMA, IEICE Trans. On Communications,
Vol. 84, No. 7, 2001.
202
ISBN: 978-81-924893-0-8
[11] E. N. Frantzeskakis and K. J. R. Liu, “A class of square root and
division free algorithms and architectures for QRD-based
adaptive signal processing,” IEEE Trans. Signal Process., vol.
42, no. 9, pp.2455–2469, Sep. 1994.
[12] B. M. Lee and R. J. P. de Figueiredo, “Adaptive predistorter for
linearization of high-power amplifiers in OFDM wireless
communications,”Circuits Syst. Signal Process., vol. 25, no. 1,
pp. 59–80, Feb.2006.
[13] Ray Andraka, A Survey of CORDIC Algorithms for FPGA
based computers, International Symposium on Field
Programmable Gate Arrays, 1998.
[14] Siva D. Muruganathan, and Abu B. Sesay, “A QRD-RLS based
predistortion Scheme for High power Amplifier Linearization”
IEEE Transactions on circuit and systems-II Express
Briefs,VOL,53 no. 10,october 2006.
[15] Zelst, A. van ”MIMO-OFDM for Wireless LANs,”
Ph.D.thesis,2004.
[16] O¨ calan, A. Savas，c，ıhabes，, A. Go¨rgec，, I˙. Ertug˘, O¨ .
Yazgan,E. ”Compact space-multimode diversity stacked circular
antenna array for 802.11n MIMO-OFDM
WLANs”LAPC2009,Loughborough,2009.
[17] O¨ calan, A. Savas，c，ıhabes，, A. Go¨rgec，, I˙. Ertug˘, O¨ .
Yazgan,E. ”Compact space-multimode diversity stacked circular
microstrip antenna array for 802.11n MIMO-OFDM
WLANs” LAPC2009,Loughborough, 2009.
[18] E. Volder, (1959) “The CORDIC Trigonometric Computing
Technique, “ IRE Trans. Electronic Computing, Vol. EC-8, pp.
330-334.
[19] Dongdong Chen and Mihai SIMA,(2011) “Fixed-Point
CORDIC-Based QR Decomposition by Givens Rotations on
FPGA”, International Conference on Reconfigurable
Computing and FPGAs.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A REVIEW OF DETERMINISTIC ENERY-EFFICIENT
CLUSTERING PROTOCOLS FOR WIRELESS SENSOR
NETWORKS
Gurjit Kaur
M.TECH (ECE) Student
BGIET, Sangrur
gurjit.sidhu510@gmail.com
ABSTRACT
Wireless Sensor Networks (WSN) advances have been utilized
as of late for checking purposes in different spaces from
designing industry to our home surroundings because of their
capacity to keenly screen remote areas. DEC (Deterministic
Energy Efficient Clustering) protocol is rapid, distributive,
organizing toward oneself and more productive as far as vitality
than whatever other of the current conventions. DEC utilizes a
simple methodology which lessens computational overhead-cost
to self-sort out the sensor system. It uses a streamlined
methodology which minimizes computational overhead-cost to
self-arrange the sensor system. Our simulation result
demonstrates a superior execution with admiration to energy
utilization, which is reflected in the system lifetime in both
homogeneous and heterogeneous settings when contrasted and
the current protocols.
Keywords:
Wireless Sensor Networks, clustering, DEC protocol, energy
efficient, sink.
1. INTRODUCTION
A Wireless sensor network (WSN) is a remote system that
comprises of disseminated sensor to screen certain conditions at
distinctive areas. A WSN are regularly illustrated as a system
comprises of low-size and low-complex gadgets alluded as
sensor hubs that may sense the earth or surroundings and
assemble the information from the recognition field and impart
through remote connections; the data gathered is sent, by means
of various jumps handing-off to a sink that may utilize it locally,
or is associated with option arranges [1] .The sensor hubs are
normally scattered in a sensor field as indicated in Fig. 1. Each
of those scattered sensor hubs has the abilities to accumulate
data and course data once more to the sink furthermore the end
clients. Data is steered once more to the end/complete client by
multichip foundation plan through the sink as demonstrated in
Fig. 1. The sink could correspond with the task manager node
through web or Satellite [2]. Designing Protocols and
applications for such systems needs to be vitality mindful to
drag out the lifetime of the system, as a consequence of the
substitution of the embedded batteries may be a horribly
203
ISBN: 978-81-924893-0-8
Shweta Rani
Assistant Professor
BGIET, Sangrur
shwetaranee@gmail.com
troublesome technique once these hubs are placed in or
introduced. Sensors generally connect the physical world with
the computerized world by catching and uncovering true
advancement and changing these into a kind that may be
transformed put away, and so on [3]. Sensors offer astounding or
amazing advantages when coordinated into shifted gadgets,
machines, and situations. They will help to maintain a strategic
distance from disastrous base disappointments, preserve
valuable common assets, support profit, enhance security, and
overhaul new applications, for example, setting mindful
frameworks and brilliant home advancements. The scaling down
of figuring and sensing innovations permits the improvement of
little, low-control, and modest actuators, sensors, and controllers
[4].
Fig: 1 Sensor nodes spreaded in a sensor field
In this paper, a deterministic vitality effective cluster protocol
that guarantees a superior race of cluster heads is proposed. This
proposed protocol utilizes the sensor hub's remaining energy
singularly as the decision model. DEC protocol ensures a
superior decision of cluster heads taking into account leftover
vitality data. It is more energy efficient than LEACH (Low
Energy Adaptive Clustering Hierarchy) and some other existing
energy protocols [4].
Deterministic Energy-Efficient clustering protocol utilizes
residual energy of every hub in the group for race procedure or
choice of CH (Cluster Head). Nonetheless, the vulnerabilities in
the cluster head decisions have been minimized in DEC. The
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

setup stage utilized as a part of LEACH protocol is altered, yet methodology approximates a perfect answer for adjusted energy
the consistent state stage is kept same as that of in LEACH utilization in progressive remote sensor networks.
protocol. The CH decision procedure is redesigned by utilizing
the residual energy (RE) of every hub as hub's vitality for the 3. PROPOSED WORK
most part decided a priori [5]. In DEC, the sink or Base Station The proposed work comprises of procedure to be utilized as a
(BS) by and large chooses Nopt group heads at round m for the part of request to advance the execution of wireless sensor
system. The BS can just partake in the race of CHs if and if networks. The routing protocol is executed to work in
m=1. homogenous and heterogeneous environment. DEC uses
clustering methodology. In Figure 2 there are two base stations
2. RELATED WORK in two separate systems. These Base Stations are joined with
A few studies have utilized clustering to oversee WSNs. Cluster Head's for the correspondence reason. Cluster head is
Clustering methodology includes choosing pioneers among the chosen in light of the part of leftover vitality to the most extreme
sensor nodes. When the cluster heads are chosen, they vitality controlled by the sensor hubs. No holds barred
accumulate the data from their separate cluster individuals, correspondence happens and distinctive vitality leveled system
refine it utilizing information pressure methods and afterward have been made. Hub substitution happens with a specific end
report the collected information to the base station (BS) [6]. goal to re-stimulate the system and to build the system lifetime.
Then again, being a cluster head could be a vitality expending
errand. By pivoting the cluster head could have much vitality
picks up than if it were to be settled. Subsequently, a standout
amongst the most imperative calculates deciding the
achievement of a decent convention outline for distributive
WSNs is the way competent it has the capacity deal with the
vitality utilization. Already, the revolution of cluster heads is
done in a randomized way and the decision is not ensured to be
ideal [7]. In this extend, a deterministic vitality productive
deterministic energy-efficient clustering protocol that guarantees
a superior race of cluster heads is proposed. This proposed
convention utilizes the sensor hub's leftover vitality singularly as
the race standard.
In [8], minimizes the vitality scattering in remote sensor
networks. LEACH is one of the first progressive steering
approaches for sensor systems. In this calculation development
of clusters is carried out on the premise of the received signal
quality. The principle destination of LEACH is to give
information collection to sensor systems [9]. Downsides in Figure 2: Scenario Case Diagrams
LEACH protocol are additional overhead to do element
clustering furthermore LEACH is not ready to cover extensive Deterministic Energy-Efficient clustering protocol utilizes
territory. remaining energy of every hub in the group for decision
In [10], augments the fundamental plan of LEACH by utilizing procedure or determination of CH (Cluster Head). DEC is by all
remaining energy as essential parameter and system topology accounts like a perfect arrangement as demonstrated in Figure 3.
characteristics (e.g. node degree, separations to neighbors) are
just utilized as optional parameters to break tie between
applicant cluster heads, as a metric for cluster determination to
attain to power adjusting
In [11], the enhanced version of LEACH as opposed to forming
clusters, it is in light of shaping chains of sensor hubs. One hub
is in charge of directing the totaled information to the sink.
Every hub totals the gathered information with its own particular
information, and after that passes the totaled information to the
following ring. The distinction from LEACH is to utilize multi
hop transmission and selecting stand out hub to transmit to the
sink or base station. Since the overhead created by dynamic
cluster arrangement is dispensed with, multi hop transmission
and information accumulation is utilized, PEGASIS beats the Figure 3: Behavior of Node Energy Consumption Overtime
LEACH.
In [12], uses an improved methodology which minimizes
computational overhead-cost to self-arrange the sensor system. 4. CONCLUSION
Our recreation result demonstrates a superior execution as for In this paper an absolutely deterministic protocol DEC that
energy utilization, which is reflected in the system lifetime in better uses the most profitable system asset (energy) in WSN is
both homogeneous and heterogeneous settings when contrasted presented. DEC beats the probabilistic-based models we have
and the current protocols. It is deserving of note that our considered, by ensuring that a settled number of cluster heads

204
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

are chosen every round. At diverse rounds cluster heads are

chosen utilizing the nearby data of their remaining energies
inside every group to pick the suitable cluster heads. The
attributes of DEC is extremely attractive as it is near to a perfect
arrangement. By and large, DEC enhances the lifetime of
wireless sensor networks by a request of greatness which is huge
when contrasted and LEACH, SEP and SEP-E. DEC exploits
the neighborhood data i.e. the residual energy of every hub to
enhance the energy utilization. In our future work, we expect to
adjust DEC protocol\ to a certifiable application setting, for
example, in rural farmland for compost splashing operations. It
is our trust that this technique can give more understanding into
streamlining WSN energy utilization in certifiable situations.
[9] A. Chandrakasan, and H. Balakrishnan W. R. Heinzelman,
An Application-Specific Protocol Architectures for
Wireless Networks.: IEEE Transactions on Wireless
Communications, 2002.
[10] F. Xiangning and S. Yulin, Improvement on LEACH
Protocol of Wireless Sensor Network. Washington, DC,
USA: International Conference on Sensor Technologies
and Applications, 2007.

REFERENCES [11] O. Younis and S. Fahmy, HEED: A Hybrid, Energy-

Efficient, Distributed Clustering Approach for Ad Hoc
[1] F. Comeau, Optimal Clustering in Wireless Sensor Sensor Networks.: IEEE Transactions on Mobile
Networks Employing Different Propagation Models And Computing, 2004.
Data Aggregation Techniques., 2008.
[12] Q. Zhu, and M. Wang L. Qing, Design of a distributed
[2] S. Gamwarige and C. Kulasekere, An algorithm for energy energy-efficient clustering algorithm for heterogeneous
driven cluster head rotation in a distributed wireless sensor wireless sensor networks.: Computer Communication,
network, 2005th ed.: International Conference on 2006.
Information and Automation.

[3] M. Haase and D. Timmermann, Low energy adaptive

clustering hierarchy with deterministic cluster-head
selection.: IEEE Conference on Mobile and Wireless
Communications Networks (MWCN), 2002.

[4] J. D. Deng, and M. K. Purvis F. A. Aderohunmu,

Enhancing Clustering in Wireless Sensor Networks with
Energy Heterogeneity.: International Journal of Business
Data Communications and Networking, 2011.

[5] Dr. Sonia Vatta Rajesh Chaudhary, Performance

Optimization of WSN Using Deterministic Energy
Efficient Clustering Protocol: A Review, 0403rd ed.: IOSR
Journal of Engineering (IOSRJEN) , MARCH,2014.

[6] I. Matta, and A. Bestavros G. Smaragdakis, SEP: A Stable

Election Protocol for clustered heterogeneous wireless
sensor networks.: International Workshop on SANPA,
2004.

[7] M. Raj Kumar Naik P. Samundiswary, Performance

Analysis of Deterministic Energy Efficient Clustering
Protocol for WSN , 26th ed.: International Journal of Soft
Computing and Engineering (IJSCE), JANUARY,2014.

[8] A. Chandrakasan, and H. Balakrishnan W. R. Heinzelman,

Energy efficient communication protocol for wireless
microsensor networks.: International Conference on System
Sciences, 2000.

205
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Performance Analysis of AODV, TORA and AOMDV
Routing Protocols in the Presence of BLACKHOLE
Gurmeet singh Deepinder Singh Wadhwa
ECE Department ECE Department
BGGPC, Patiala BGIET, Sangrur
ABSTRACT
This paper gives the comparative study of Mobile Ad Hoc
Network (MANET). In this paper analyzes the Blackhole attack
which is one of the possible attacks in ad hoc networks. In a
Blackhole attack, a malicious node impersonates a destination
node by sending a spoofed route reply packet to a source node
that initiates a route discovery. By doing this, the malicious
node can deprive the traffic from the source node. In this paper,
we simulate the Ad hoc on Demand Vector Routing Protocol
(AODV), TORA and AOMDV under Blackhole attack by
considering different performance metric. The simulation
results show the effectiveness of Blackhole attack on AODV,
TORA and AOMDV protocol. In the past few years MANET
system has achieved new milestones with increased data rates.
MANET is a collection of multi-hop wireless mobile nodes that
can communicate with each other. In this there is no central
control system. In this there is no infrastructure is used. The
nodes in MANET are responsible for continuous change their
position in the network and fine the new nodes. It also has a
certain number of characteristics which make the security
difficult. Performance comparison of AOMDV, AODV and
TORA with ns-2 (version 2.34) simulations shows that
AOMDV is able to achieve remarkable packet delivery fraction
and almost similar throughput.
Keywords-- MANET, AODV, AOMDV, TORA,
SECURITY, BLACKHOLE , WORMHOLE ATTACK.
1. INTRODUCTION
A Mobile Ad hoc Network (MANET) consists of a variety of
mobile Nodes which are formed temporary network without any
fixed infrastructure. Since it is very difficult to locate routers
and other infrastructure in such network type of network. In
this type of network all the nodes are self-organized and
collaborated to each other. All the nodes as well as the routers
can move about freely and thus the network topology is highly
dynamic. Due to self-organize and rapidly deploy capability,
MANET can be applied to different applications including
battlefield communications, emergency relief scenarios, law
enforcement, public meeting, virtual class room and other
security-sensitive. Mobile Ad hoc Networks (MANETs) are
open to a wide range of attacks due to their unique
characteristics like dynamic topology, shared medium, absence
of infrastructure, multi-hop scenario and resource constraints. In
such a network, each mobile node operates not only as a host
but also as a router, forwarding packets for other nodes that may
not be within direct wireless transmission range of each other.
Thus, nodes must discover and maintain routes to other nodes.
Data packets sent by a source node may be reached to
destination node via a number of intermediate nodes. In the
absence of a security mechanism, it is easy for an intermediate
node to insert intercept or modify the messages thus attacking
the normal operation of MANET routing.
206
ISBN: 978-81-924893-0-8
Dr. Ravi Kant
ECE Department
BGIET, Sangrur
Therefore, in this paper, we aim to analyze the performance of
MANET routing agents under Blackhole attack. The paper is
organized as follows. In Section II, we provide a brief overview
of MANET routing protocols. Section III describes the Security
of MANET Section IV gives the details Security attack in
MANET. Section V Gives the details of our performance
simulations for protocol with an outlook to future work. Section
VI gives the Result and Section VII gives the conclusion along
with future research directions.
2. ROUTING PROTOCOLS OF AD-HOC
The routing protocols in ad-hoc network is to establish
minimum path (min hops) between source and destination with
minimum overhead and minimum bandwidth use so that packets
are transmitted in a timely manner. A MANET protocol should
function over a large range of networking context from small
ad-hoc group to larger mobile multihop networks[4].In Ad-hoc
network the nodes are continues to move, and the date pass
through many paths. The number MANET routing protocols
had been proposed in the past year. These protocols are
classified according to the routing strategy. These protocols
performance can be checked by the type of traffic, number of
nodes, and rate of mobility and many more other factors can
also be consider. Three routing protocols were studied in this
paper, namely; AOMDV, AODV and TORA. Below is a brief
description of the protocols [1]. Routing protocols can be
categorized into proactive, reactive and hybrid protocols,
depending on the routing topology. Proactive protocols are
typically table-driven. Examples of this type of protocol are
Destination Sequence Distance Vector (DSDV). Reactive or
source-initiated on demand protocols, in opposite, do not
regularly update the routing information. It is circulated to the
nodes only when necessary. Example of this type of protocol is
Dynamic Source Routing (DSR) and Ad Hoc On-Demand
Distance Vector (AODV). Hybrid protocols make use of both
reactive and proactive approaches. Example of this type of
protocol is Zone Routing Protocol
AODV [1]: Ad Hoc On-Demand Distance Vector routing
protocol uses broadcast discovery mechanism, similar to but
modified of that of DSR. To ensure that routing information is
up-to-date, a sequence number is used. The path discovery is
established whenever a node wishes to communicate with
another, provided that it has no routing information of the
destination in its routing table. Path discovery is initiated by
broadcasting a route request control message “RREQ” that
propagates in the forward path. If a neighbor knows the route to
the destination, it replies with a route reply control message
“RREP” that propagates through the reverse path. Otherwise,
the neighbor will re-broadcast the RREQ. The process will not
continue indefinitely, however, authors of the protocol proposed
a mechanism known as “Expanding Ring Search” used by
Originating nodes to set limits on RREQ dissemination. AODV
maintains paths by using control messages called Hello
messages, used to detect that neighbors are still in range of
connectivity. If for any reason a link was lost (e.g. nodes moved
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
away from range of connectivity) the node immediately engages
a route maintenance scheme by initiating route request control
messages. The destination sequence numbers in control packets
ensure loop freedom and freshness of routing information. [2]
Temporally-Ordered Routing Algorithm (TORA)
TORA can work in environment where mobility is highly
dynamic. TORA's algorithm concept is link rever sal, which has
the feature of loop-free and adaptive distributed routing. It
provides multiple routes for any required source/destination pair
and that's why it falls in source-initiated category. Localization
of control message is the key design of TORA, which adopts
topological changes very quickly[25]
3. SECURITY & CHALLENGES IN
MANET
The security issues in MANET become more complicated,
because of the several compelling situations. The AODV and
DSR Protocols are studied[3]. Scarcity of resources - The
mobile nodes are often at limited resources availability
including the battery power, computational power, memory,
speed etc. Due to this restrictions the security solutions
consuming higher resources e.g. public key cryptography, are
not deployable practically. Physical security threats- The mobile
wireless networks are more open to physical security threats.
Due to small size of nodes and permitted mobility, they are
more prone to stealing and physical mishandling . Topological
variations - Due to the transient and moving nature of nodes the
locational dependency is less assured. Lack of regulating
authorities - Unlike the infrastructure-based network in
MANET the central regulating authorities do not exist in
MANET. Shared wireless medium - In MANET the wireless
based of communication is broadcast based, hence all data is
available to all the nodes for tempering, resulting more
complexity & challenges to security.. Insufficient rules for
association - The MANET lacks proper authentication rules and
mechanisms for associating nodes in the network. Unlike in
general network, an intruder can easily join the network and
create security hazards. Hostile and insufficient operational
environment - Since the MANET found more complications in
environment like war fields , there are more hazards to security
issues.
4. SECURITY ATTACKS ON MANET
Wireless networks are more vulnerable than a wired network.
There is a range of attacks aim at the weakness of MANETs.
All data packets should pass through many intermediate nodes
before reaching destination. Each node maintains route entry to
other nodes in two ways either node itself initiates the route
discovery or other nodes push to discover routes. Hence it
maintains proper routing table entry and it becomes an essential
job of mobile network communications. Route discovery and
maintenance phase are always monitored by malicious node,
make other nodes to follow fake route entry and disrupt the
directions of the routing protocols.[8] The black hole attack[5]
is an active insider attack, it has two properties: first, the
attacker consumes the intercepted packets without any
forwarding. Second, the node exploits the mobile ad hoc routing
protocol, to announce itself as having a accurate route to a
destination node, even though the route is counterfeit, with the
intention of intercepting packets. In an ad-hoc network that uses
the AODV protocol, a black hole node pretends to have a fresh
enough routes to all destinations requested by all the nodes and
absorbs the network traffic. When a source node broadcasts the
207
ISBN: 978-81-924893-0-8
RREQ message for any destination, the black hole node instatly
responds with an RREP message that contains the highest
sequence number and this message is received as if it is coming
from the destination or from a node which has a fresh enough
route to the destination. The source considers that the
destination is behind the black hole and rejects the other RREP
packets coming from other nodes. The[4] In this type of attacks,
the attacker disrupts routing by short circuiting the usual flow of
routing packets. Wormhole attack can be done with one node
also. But generally, two or more attackers connect via a link
called “wormhole link”. They capture packets at one end and
replay them at the other end using private high speed network.
Wormhole attacks are relatively easy to deploy but may cause
great damage to the network. Wormhole attack is a kind of
replay attack that is particularly challenging in MANET to
defend against. Even if, the routing information is [4].
2.1 Identity Spoofing
Media Access Control (MAC) and Internet Protocol (IP)
addresses are frequently used in MANETs to verify and
ascertain the identity of its nodes. However, these addresses
may be easily spoofed using tools that are publicly available,
which leads to a spoofing attack [6]. In this attack, the malicious
user attempts to acquire the identity of a legitimate node in the
network. Masquerading as a legitimate user allows the
malicious node to avail of privileged services, that are otherwise
accessible to only genuine nodes, and become an authorized
entity in the network. This attack aims to establish a connection
that will enable the attacker to access the sensitive data of the
other hosts.
2.2 Denial of Service (DoS)
DoS is one of the most well known attacks on computer
networks largely because of the impact it has on the smooth
functioning of the network. This kind of attack is especially
damaging to MANETs owing to the limited communication
bandwidth and resources of the nodes [6]. In the AODV
protocol for instance, a large number of RREQs (message
requests) are sent to a destination node on the network that is
non-existent. As there is no reply to these RREQs, they will
flood the entire network leading to a consumption of all of the
node battery power, along with network bandwidth and this
could lead to denial-of service.
2.3 Black Hole Attack
The black hole attack [4] is an active insider attack, it has two
properties: first, the attacker consumes the intercepted packets
without any forwarding. Second, the node exploits the mobile
ad hoc routing protocol, to announce itself as having a accurate
route to a destination node, even though the route is counterfeit,
with the intention of intercepting packets. The goal of the
malicious node in this attack is to drop all packets that are
directed to it instead of forwarding them as intended. It uses its
routing protocol in order to advertise itself as having the
shortest route to the target node or to any packet that it wants to
intercept. The malicious node advertises its availability of new
routes without checking its routing table [6]. In this way the
malicious node will always have availability of routes while
replying to the route request and hence intercept the data packet.
As a result of the dropped packets, the amount of retransmission
consequently increases leading to congestion. There is a more
subtle form of this attack wherein the attacker selectively
forwards packets instead of dropping all of them altogether.
Packets originating from some particular nodes may be
modified or suppressed while leaving the data from the other
nodes unaffected, thus limiting the suspicion of its malicious
behavior by the other nodes [6].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure 2.1 Illustration of Black hole attack in a Network

5. PERFORMANCE EVALUATION

Simulations have been performed in network simulator, ns-

Figure 1. 1. Comparison of energy versus time of AODV ,
2[22], to determine the impact of mobility on performance of
TORA and AOMDV with the Blackhole Attack
routing protocols. We have used network simulator version 2.34
for the evaluation of our work. The NS-2 simulator software
Figure 1. 1. Shows the comparison of energy versus time
was developed at the University of California at Berkeley and
TORA, AODV and AOMDV. It shows that the energy is
the Virtual Inter Network test bed (VINT) project fall 1997. We
minimum using TORA compared to AODV, and AOMDV
have used Ubuntu 9.04 Linux environment. Our simulation
.AODV is having the highest energy compared to all the other
setup [24] is a network with randomly placed nodes within an
protocols. This comparison is analyzed with the Blackhole
area of 1315m * 572m. We have chosen a wireless channel with
attack
a two-way ground propagation model with a radio propagation
model of 250m and interference range of 550m. We evaluate
three MANET protocols (AODV, AOMDV and TORA) against
Blackhole attack. This allows us to compute protocol
performance under different network scenarios.

6. RESULT
In this paper we have considered several metrics in analyzing
the performance of routing protocols. These
metrics are as follows.

Data packet delivery ratio: Total number of delivered data

packets divided by total number of data packets transmitted by
all nodes. This performance metric will give us an idea of how
well the protocol is performing in terms of packet delivery at
different speeds using different traffic

Throughput (messages/second): Total number of delivered Figure 1. 2. Comparison of PDR versus time of AODV , TORA
data packets divided by the total duration of simulation time. and AOMDV with the Blackhole Attack
We analyze the throughput of the protocol in terms of number
of messages delivered per one second. Figure 1. 2. Shows the comparison of Packet Delivery Ratio for
TORA, AODV and AOMDV. It shows that the PDR using
Average End-to-End delay (seconds): The average TORA is high compared to AODV and AOMDV. This
time it takes a data packet to reach the destination. This metric comparison is analyzed with the Blackhole attack
is calculated by subtracting “time at which first packet was
transmitted by source” from “time at which first data packet
arrived to destination”. This includes all possible delays caused
by buffering during route

208
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 1.3 Comparison of throughput versus time of AODV ,
TORA and AOMDV with the Blackhole Attack
Figure1. 3. Shows the comparison of throughput versus time
TORA, AODV and AOMDV. It shows that the throughput is
minimum using AODV compared to AODV, TORA,.AOMDV
is having the highest throughput compared to all the other
protocols. This comparison is analyzed with the Blackhole
attack.
Figure 1.4. Comparison of end to end delay versus time of
AODV , TORA and AOMDV with the Blackhole Attack
Figure 1.4 shows the comparison of end to end delay versus
time TORA, AODV and AOMDV. It shows that the end to end
delay is minimum using AOMDV compared to AODV, TORA,
DSR and DSDV.TORA is having the highest end to end delay
compared to all the other protocols. This comparison is
analyzed with the Blackhole attack.
7. CONCLUSION AND FUTURE WORK
This paper discusses common possible attacks on different
protocols being used in MANETs. We have tried to analyze
them so as to prevent the attacker to intrude in wireless
networks. As a continuation of this research work, it would be
very interesting to evaluate other protocols that have been
suggested for important operations in MANETs such as those
for performing multicast and broadcast communication.
MANET We requires a reliable, efficient, and scalable and most
importantly a secure protocol as they are highly insecure, self-
organizing, rapidly deployed and they use dynamic routing.
Mobile Ad Hoc network is likely to be attacked by the black
hole attack and wormhole attack . We plan to extend our work
by comparing and analyzing other routing attack viz, wormhole
209
ISBN: 978-81-924893-0-8
attack, selfish attack etc for some of the very popular on-
demand and even secure routing protocols and compare them
and also implementing and evaluating our proposed solution
mechanism for the same.
ACKNOWLEDGMENT
The authors would thanks the reviewers for their help in
improving the document.
REFERENCES
[1] Ahmed Al-Maashri Mohamed Ould-Khaoua “Performance
Analysis of MANET Routing Protocols in the Presence of
Self-Similar Traffic .” pp. 801-807
[2] Arora,V. and Krishna, C.R., 2010 “Performance
Evaluation of Routing Protocols for MANETs under
Different Traffic Conditions.” 2nd International
Conference on Computer Engineering and Technology,
vol. 6 pp. 79-84.
[3] Agrawal, C.P., Vyas,O.P. , and Udaykumar, P. 2010
“Analysis of MANET Security –Challenges, Threats &
Solutions.” International Journal of Computer Science and
Applications, vol. 3, No. 1, pp. 13- 18.
[4] Bhosle,A. A., Tushar, P. , Thosar and Mehatre, S. 2012
“Black-Hole and Wormhole Attack in Routing Protocol
AODV in MANET” International Journal of Computer
Science, Engineering and Applications, vol.2, No.1, pp.
45- 54.
[5] Balachandran, N., 2012. “Surveying Solutions to Securing
On-Demand Routing Protocols in MANETs” Int. J.
Advanced Networking and Applications vol. 4 , pp. 1486-
1491.
[6] Das , M., Panda, B.K., and Sahu, B., 2012. “ Analysis of
Effect of Mobility on Performance of AODV in Mobile Ad
hoc Network.” International Conference on Computer
Communication and Informatics,
[7] Devi, P., and Kannammal, A., 2012. “Security attacks and
Defensive Measures for Routing Mechanisms in MANETs
– A Survey.” International Journal of Computer
Applications,vol, 42, No.4, pp. 27-32.
[8] Ghazizadeh,S., Ilghami. O., and Sirin, E., 2002 “Security-
Aware Adaptive Dynamic Source Routing Protocol.”
Conference on Local Computer Networks
[9] Gregory, S., Yovanof, and Erikci, K., 2004 “Performance
Evaluation of Security- Aware Routing Protocols for
clustered Mobile Ad Hoc Networks.” International
Workshop on Wireless Ad-Hoc Networks, pp. 286-290.
[10] Goyal, P., Batra, S., and Singh, A., 2010 “A Literature
Review of Security Attack in Mobile Ad-hoc Networks.”
International Journal of Computer Applications,vol, 9.
No.12, pp. 11-15
[11] Huhtonen, A., 2004. “Comparing AODV and OLSR
Routing Protocols Seminar on Internetworking” pp. 1-9.
[12] Hu,Y. C., JohnsonD.B., and Perrig, A., 2003 “SEAD:
secure efficient distance vector routing for mobile wireless
ad hoc networks.” pp. 175- 192.
[13] Juwad, M.F. , and Al-Raweshidy, H.S. “OPNET
Performance Comparisons between SAODV&AODV.”
[14] Keshtgary,M. and Babaiyan,V., 2012. “ Performance
Evaluation of Reactive, Proactive and Hybrid Routing
Protocols in MANET.” International Journal on Computer
Science and Engineering, vol. 4, No. 02, pp. 248 – 254.
[15] Kamboj,D., Kumar,P.S., and Nath.R., 2012 “
Performance Evaluation of Secure Routing in Ad-hoc
Network Environment” 1st Int’l Conf. on Recent Advances
in Information Technology.
[16] Kannhavong, B., Nakayama ,H., and Jamalipour,A.,
2008. “SA-OLSR: Security Aware Optimized Link State
Routing for Mobile Ad Hoc Networks.” pp. 1464- 1468.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[17] Karlsson J. , Dooley L.S. , and Polkkis G. , 2012,
“Routing Security in Mobile Ad-hoc Networks.” Vol. 9,
pp. 269- 383.
[18] Kumar,k., Kumar,y., and Pruthi, G., 2011 “A literary
review of manet security protocols.” International Journal
of Computer Science and Management Studies, vol. 11,
PP. 64-68.
[19] Khokhar, R.H., Ngadi, M. A., and Mandala, S., A Review
of Current Routing Attacks in Mobile Ad Hoc Networks.”
International Journal of Computer Science and Security,
vol. 2, pp. 18- 29.
[20] Li, H., and Dhawan, A. P., 2010 “MOSAR: A Secure On-
demand Routing Protocol for Mobile Multilevel Ad Hoc
Networks.” International Journal of Network Security,
vol.10, No.2, pp. 121 -134.
[21] Maan,F., Nauman Mazhar, N., 2011 “MANET Routing
Protocols vs Mobility Models: A Performance Evaluation”
pp. 179- 184.
[22] Moses, G.J., Kumar, D.S., Varma, P.S., Supriya, N.,
2012“ A Simulation Based Study of AODV, DSR, DSDV
Routing Protocols in MANET Using NS-2” International
Journal of Advanced Research in Computer Science and
Software Engineering, Volume 2, Issue 3, March 2012
pp. 42- 51
[23] Nishat, H., Pothalaiah ,S. and Rao, D.S., “Performance
Evaluation of Routing Protocols in MANETS.”
International Journal of Wireless & Mobile Networks .v ol.
3, No. 2, pp. 67-75.
[24] Naeemv,M., Ahmed , Z., Mahmood, R., and Azad, M.A.
2010 “QOS Based Performance Evaluation of Secure On-
Demand Routing Protocols for MANET's” ieee
[25] Rastogi, M., Ahirwar, K.K., 2012 “Adaptive Threat
Modeling For Secure MANET Routing Protocol.”
International Journal of Scientific & Technology Research,
vol. 1, pp. 63 – 66.
[26] Rai, P., and Singh,S.,2010 “A Review of MANET’s
Security Aspects and Challenges” IJCA Special Issue on
Mobile Ad-hoc Networks pp. 162-166
[27] Shrestha, A., and Tekiner, F., 2009. “On MANET Routing
Protocols for Mobility and Scalability.” International
210
ISBN: 978-81-924893-0-8
Conference on Parallel and Distributed Computing,
Applications and Technologies, pp. 451- 456.
[28] Schmidt, R.D.O. and Trentin, M.A.S., 2008 “ MANETs
Routing Protocols Evaluation in a Scenario with High
Mobility.” pp . 883- 886.
[29] Shrivastava , L., Bhadauria , S.S. , and Tomar,G.S., 2011,
“Performance Evaluation of Routing Protocols in MANET
with different traffic loads.” International Conference on
Communication Systems and Network Technologies, pp.
13-16.
[30] Sharma, P., Sinha, A.K., 2012. “ Statistical Approach
for Behavior Detection of Routing metrics in MANET.”
International Conference on Computer Communication
and Informatics,
[31] Sreenath, N. Amuthan, A. and Selvigirija, P., 2012.
“Countermeasures against Multicast Attacks on Enhanced-
On Demand Multicast Routing Protocol in MANETs.”
International Conference on Computer Communication
and Informatics,
[32] Supriya and Khari, M., 2012 “MANET Security
Breaches: Threat To a Secure Communication Platform.”
International Journal on AdHoc Networking Systems, vol.
2, No. 2, pp. 45- 51.
[33] Taneja , S. and Kush,A., 2010. “A Survey of Routing
Protocols in Mobile Ad Hoc Networks.” International
Journal of Innovation, Management and Technology, vol.
1, No. 3, pp. 279- 285.
[34] Taneja, S. and Kush, A., 2012 “Energy Efficient, Secure
and Stable Routing Protocol for MANET.” Global Journal
of Computer Science and Technology, Vol. 12, pp.25-38
[35] Zhao,Z., Hu,H., Ahn,G., and Wu,R., 2012 “Risk-Aware
Mitigation for MANET Routing Attacks.” IEEE
Transactions on Dependable and SecureComputing , vol. 9,
No. 2, pp. 250 – 260.
[36] Woungang, I., Dhurandher,S.K., Peddi, R.D and
Obaidat,M.S., 2012 “Detecting Blackhole Attacks on
DSR-based Mobile Ad Hoc Networks.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Study of Evolutionary Optimisation techniques and their
Applications
Mandeep Kaur
Research Scholar
Punjab Technical University, Kapurthala Road (Punjab)
mandeepkaur03@gmail.com
ABSTRACT
Bio and nature inspired optimization techniques are extensively
used in engineering field to analyze complex problems for which
conventional methods are not suitable or difficult to use. The
capability to find a global optimum result when good numbers of
variables are used is motivating to do a study on optimization
techniques. All optimization techniques are intended to achieve
global optima through local search and global search. Researchers
are working on improving existing methods or developing new
tools. This paper is focused to study available optimization
techniques like GA, PSO, ACO, BFOA and IWA and their use in
engineering problems. Improving the performance of wireless
sensor networks is the hot topic for research and these techniques
can be applied to achieve good results in the performance
evaluation of WSN.
Keywords:
Optimization techniques: GA, PSO, ACO, BFOA and IWA
1. INTRODUCTION
Swarm intelligence is a sub-field of evolutionary computing.
Evolutionary Computing is the collective name for a range of
problem-solving techniques based on principles of biological
evolution, such as natural selection and genetic inheritance. These
techniques are being increasingly widely applied to a variety of
problems, ranging from practical applications in industry and
commerce to leading-edge scientific research. [2]
When network size scales up, routing becomes more challenging
and critical. Lately, biologically-inspired intelligent algorithms
have been deployed to tackle this problem. Using ants, bees and
other social swarms as models, software agents can be created to
solve complex problems, such as traffic rerouting in busy
telecommunication networks. [1] Many issues in WSNs are
formulated as multidimensional optimization problems, and
approached through bio-inspired techniques. Issues of the node
deployment, localization, energy-aware clustering, and data
aggregation are often formulated as optimization problems. [3]
Ant colony optimization (ACO) uses many ants (or agents) to
traverse the solution space and find locally productive areas.
While usually inferior to genetic algorithms and other forms of
local search, it is able to produce results in problems where no
global or up-to-date perspective can be obtained, thus the other
methods cannot be applied.
Particle swarm optimization (PSO) is a computational method for
multi-parameter optimization which also uses population-based
approach. A population (swarm) of candidate solutions (particles)
moves in the search space, and the movement of the particles is
211
ISBN: 978-81-924893-0-8
Dr. B.S.Sohi
Pro-Vice Chancellor
Chandigarh University, Gharuan (Punjab)
influenced both by their own best known position and swarm's
global best known position. Like genetic algorithms, the PSO
method depends on information sharing among population
members. In some problems the PSO is often more
computationally efficient than the GAs, especially in
unconstrained problems with continuous variables.
Intelligent Water Drops or the IWD algorithm is a nature-inspired
optimization algorithm inspired from natural water drops which
change their environment to find the near optimal or optimal path
to their destination. The memory is the river's bed and what is
modified by the water drops is the amount of soil on the river's
bed. This paper will give the detailed study of evolutionary
optimisation techniques and their applications in engineering field.
2. GENETIC ALGORITHM (GA)
Genetic algorithms belong to the larger class of evolutionary
algorithms (EA), which generate solutions to optimization
problems using techniques inspired by natural evolution, such
as inheritance, mutation, selection, and crossover. Genetic
algorithms find application
in bioinformatics, phylogenetics, computationalscience, engineerin
g, economics,chemistry, manufacturing, mathematics, physics, pha
rmacometrics and other fields.
Genetic Algorithms (GA‟s) are search methods based on the
principles and concepts of natural selection and evolution. These
optimisation methods operate on a group of trial solutions in
parallel, and they operate on the coding of the function parameters
rather than the parameters directly. In the GA each variable is
represented as a binary code called a „gene‟. These genes are then
arranged and combined to form a chromosome. Each chromosome
has an associated fitness value or „cost‟ assigning a value of merit
to the chromosome. A high fitness value being the characteristic
of a good chromosome.
After the starting chromosomes have been created in the GA, a
selection strategy determines which chromosomes will take part in
the evolution process. These chromosomes mate with one another
to produce new offspring, which consist of genetic material from
two parent chromosomes. The new set of chromosomes produced
from the mating process make up the next „generation‟ of
chromosomes, although chromosomes from the previous
generation may also be saved and inserted into the new generation.
The amount of chromosomes in every generation is kept constant.
This process is repeated (selection, and mating) until a set amount
of generations have been completed.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Genetic Algorithm Parameters
Selection Strategies: Selection strategies determine which
chromosomes will take part in the evolution process.
Population Decimation: In this strategy the chromosomes are
ranked according to their fitness or cost values from highest to
lowest. This is the recommended strategy to use as it leads to
proper convergence and used to produce the best solutions as
compared to the other strategies.
Proportionate Selection: In this selection strategy the probability
of a chromosome being selected is proportionate to the fitness of
the chromosome as compared to the fitness of the total population.
That is a chromosome with a „good‟ fitness has a higher
probability of being selected, than one that has a low fitness value.
Tournament Selection: In tournament selection two individuals
are randomly selected and then the one with the highest fitness
„wins‟. This process continues until the required number of
chromosomes has been reached.
Mating Schemes: While the selection strategies are involved with
selecting which individuals will take part in the evolution process
(be parents), the mating schemes select which two parent
chromosomes will mate with one another. The mating schemes
that exist include Best Mates-Worst, Adjacent Fitness pairing and
Emperor Selective mating.
Crossover Point: A crossover occurs when two parent
chromosomes mate with one another. When this occurs the two
parent chromosomes are both dissected at the same predefined
crossover point. The two pieces from the first parent chromosome
mate with the two complementary pieces from the second parent
chromosome, to form two new chromosomes. As mentioned
above, the crossover point determines the point at which a
chromosome will be dissected. Allowable inputs values for
crossover point is 0crossover pt1 where 0 indicates a crossover
point that is determined randomly, and 1 indicates that no
crossover will occur.
Mutation: A mutation occurs in a chromosome with a small
probability of Pmutation. When a mutation occurs in a chromosome,
a random bit in the binary chromosome is inverted. For example a
„1‟ will be changed to a „0‟ and vice versa.
Chromosomes and Generations: In the Genetic Algorithm each
chromosome represents a specific antenna design/configuration.
The number of chromosomes used in a Generation and the number
of generations are both user-defined inputs. The number of
chromosomes determines the number of antenna configurations
that will be evaluated in each generation, and the number of
generations determines how many iterations the GA optimizer will
run through before coming to completion. [10]
Genetic Algorithms (GA) are direct, parallel, stochastic method
for global search and optimization, which imitates the evolution of
the living beings, described by Charles Darwin. GA are part of the
group of Evolutionary Algorithms (EA). The evolutionary
algorithms use the three main principles of the natural evolution:
reproduction, natural selection and diversity of the species,
maintained by the differences of each generation with the
previous. Genetic Algorithm works with a set of individuals,
representing possible solutions of the task. The selection principle
is applied by using a criterion, giving an evaluation for the
individual with respect to the desired solution. The best-suited
individuals create the next generation. The large variety of
problems in the engineering sphere, as well as in other fields,
212
ISBN: 978-81-924893-0-8
requires the usage of algorithms from different type, with different
characteristics and settings.
Mardukhi F. et. al. developed genetic algorithm based quality
model depends on a set of quality attributes which categorized into
two main types: positive and negative. The objective is to
maximize the values of positive properties (e.g. throughput and
availability), whereas the values of negative properties require to
be minimized (e.g. price and response time). [7]
Kuila P. et. al. proposed a novel GA based load balanced
clustering algorithm for WSN. The proposed algorithm is shown
to perform well for both equal as well as unequal load of the
sensor nodes and compared the results with some evolutionary
based approaches and other related clustering algorithms. [4]
3. ANT COLONY OPTIMIZATION
In computer science and operations research, the ant colony
optimization algorithm (ACO) is a probabilistic technique for
solving computational problems which can be reduced to finding
good paths through graphs. This algorithm is a member of the ant
colony algorithms family, in swarm intelligence methods, and it
constitutes some metheuristic optimizations. Initially proposed
by Marco Dorigo in 1992 in his PhD thesis, the first algorithm was
aiming to search for an optimal path in a graph, based on the
behavior of ants seeking a path between their colony and a source
of food. The original idea has since diversified to solve a wider
class of numerical problems, and as a result, several problems
have emerged, drawing on various aspects of the behavior of ants.
With an ACO algorithm, the shortest path in a graph, between two
points A and B, is built from a combination of several paths. It is
not easy to give a precise definition of what algorithm is or is not
an ant colony, because the definition may vary according to the
authors and uses. Broadly speaking, ant colony algorithms are
regarded as populated metaheuristics with each solution
represented by an ant moving in the search space. Ants mark the
best solutions and take account of previous markings to optimize
their search. They can be seen as probabilistic multi-
agent algorithms using a probability distribution to make the
transition between each iteration. In their versions for
combinatorial problems, they use an iterative construction of
solutions. According to some authors, the thing which
distinguishes ACO algorithms from other relatives (such as
algorithms to estimate the distribution or particle swarm
optimization) is precisely their constructive aspect. In
combinatorial problems, it is possible that the best solution
eventually be found, even though no ant would prove effective.
Thus, in the example of the Travelling salesman problem, it is not
necessary that an ant actually travels the shortest route: the
shortest route can be built from the strongest segments of the best
solutions. However, this definition can be problematic in the case
of problems in real variables, where no structure of 'neighbours'
exists. The collective behavior of social insects remains a source
of inspiration for researchers.
Cobo L. et. al proposed a QoS routing algorithm such as
AntSensNet for WMSNs based on an Ant Colony optimization
framework and a biologically inspired clustering process.
AntSensNet outperforms the standard AODV in terms of delivery
ratio, end-to-end delay and routing overhead. [1] Liao W.H. et. al.
proposed a deployment strategy to prolong the network lifetime,
while ensuring complete coverage of the service region and
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
modeled the sensor deployment problem as the Multiple Knapsack
Problem (MKP) based on ACO algorithm.[5] Lin Y. et. al.
proposes an ACO-based approach that can maximize the lifetime
of heterogeneous WSNs. The methodology is based on finding the
maximum number of disjoint connected covers that satisfy both
sensing coverage and network connectivity. [6]
4. PARTICLE SWARM OPTIMISATION
Particle swarm optimization (PSO) has emerged as a proficient
stochastic approach of evolutionary computation. Since then it has
been employed in various fields of applications and research and
is successful in yielding an optimized solution. This algorithm
mimics the social behavior executed by the individuals in a bird
flock or fish school while searching for the best food location
(global optima). The PSO algorithm neither depends upon the
initial condition nor on the gradient information. Since it depends
only on the value of objective function, it makes the algorithm
computationally less expensive and much simple to implement.
The low CPU and memory requirement is another advantage.
However, some experimental results show that the local search
ability around the optima is very poor though the global search
ability of PSO is quite good. This results in premature
convergence in problems where multiple optima exist and; hence,
the performance is degraded. [8]
In computer science, particle swarm optimization (PSO) is a
computational method that optimizes a problem
by iteratively trying to improve a candidate solution with regard to
a given measure of quality. PSO optimizes a problem by having a
population of candidate solutions, here dubbed particles, and
moving these particles around in the search-space according to
simple mathematical formulae over the
particle's position and velocity. Each particle's movement is
influenced by its local best known position but, is also guided
toward the best known positions in the search-space, which are
updated as better positions are found by other particles. This is
expected to move the swarm toward the best solutions.
PSO is originally attributed to Kennedy, Eberhart and Shi and was
first intended for simulating social behaviour, as a stylized
representation of the movement of organisms in a
bird flock or fish school. PSO is a metaheuristic as it makes few or
no assumptions about the problem being optimized and can search
very large spaces of candidate solutions. However, metaheuristics
such as PSO do not guarantee an optimal solution is ever found.
More specifically, PSO does not use the gradient of the problem
being optimized, which means PSO does not require that the
optimization problem be differentiable as is required by classic
optimization methods such as gradient descent and quasi-newton
methods. PSO can therefore also be used on optimization
problems that are partially irregular, noisy, change over time, etc.
Kulkarni R.V. & Venayagamoorthy G.A. discussed Particle
swarm optimization (PSO) that is a simple, effective, and
computationally efficient optimization algorithm. It has been
applied to address WSN issues such as optimal deployment, node
localization, clustering, and data aggregation. It has outlined issues
in WSNs, introduces PSO, and discusses its suitability for WSN
applications. [3]
213
ISBN: 978-81-924893-0-8
5. ARTIFICIAL BEE COLONY
ALGORITHM
In the ABC model, the colony consists of three groups of bees:
employed bees, onlookers and scouts. It is assumed that there is
only one artificial employed bee for each food source. In other
words, the number of employed bees in the colony is equal to the
number of food sources around the hive. Employed bees go to
their food source and come back to hive and dance on this area.
The employed bee whose food source has been abandoned
becomes a scout and starts to search for finding a new food source.
Onlookers watch the dances of employed bees and choose food
sources depending on dances. The main steps of the algorithm are
given below:
1. Initial food sources are produced for all employed bees
2. REPEAT
 Each employed bee goes to a food source in her memory
and determines a neighbour source, then evaluates its
nectar amount and dances in the hive
 Each onlooker watches the dance of employed bees and
chooses one of their sources depending on the dances,
and then goes to that source. After choosing a neighbour
around that, she evaluates its nectar amount.
 Abandoned food sources are determined and are
replaced with the new food sources discovered by
scouts.
 The best food source found so far is registered.
3. UNTIL (requirements are met)
In ABC, a population based algorithm, the position of a food
source represents a possible solution to the optimization problem
and the nectar amount of a food source corresponds to the quality
(fitness) of the associated solution. The number of the employed
bees is equal to the number of solutions in the population. At the
first step, a randomly distributed initial population (food source
positions) is generated. After initialization, the population is
subjected to repeat the cycles of the search processes of the
employed, onlooker, and scout bees, respectively. An employed
bee produces a modification on the source position in her memory
and discovers a new food source position. Provided that the nectar
amount of the new one is higher than that of the previous source,
the bee memorizes the new source position and forgets the old
one. Otherwise she keeps the position of the one in her memory.
After all employed bees complete the search process, they share
the position information of the sources with the onlookers on the
dance area. Each onlooker evaluates the nectar information taken
from all employed bees and then chooses a food source depending
on the nectar amounts of sources.
As in the case of the employed bee, she produces a modification
on the source position in her memory and checks its nectar
amount. Providing that its nectar is higher than that of the previous
one, the bee memorizes the new position and forgets the old one.
The sources abandoned are determined and new sources are
randomly produced to be replaced with the abandoned ones by
artificial scouts.
Sahoo R. et. al. presented a trust based secure and energy
competent clustering method in wireless sensor network using
Honey Bee Mating Algorithm (LWTC-BMA). The proposed
LWTC-BMA prolong the life time of the network by depriving
malicious nodes to become a cluster head. [9]
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
6. INTELLIGENT WATER DROPS
ALGORITHM (IWR)
IWD algorithm is a swarm-based nature-inspired optimization
algorithm. This algorithm contains a few essential elements of
natural water drops and actions and reactions that occur between
river's bed and the water drops that flow within. The IWD
algorithm may fall into the category of Swarm
intelligence and Metaheuristic. Intrinsically, the IWD algorithm
can be used for Combinatorial optimization. However, it may be
adapted for continuous optimization too. The IWD was first
introduced for the traveling salesman problem in 2007. Since then,
multitudes of researchers have focused on improving the
algorithm for different problems. Almost every IWD algorithm is
composed of two parts: a graph that plays the role of distributed
memory on which soils of different edges are preserved, and the
moving part of the IWD algorithm, which is a few number of
Intelligent water drops. These Intelligent Water Drops (IWDs)
both compete and cooperate to find better solutions and by
changing soils of the graph, the paths to better solutions become
more reachable. It is mentioned that the IWD-based algorithms
need at least two IWDs to work.
7. BACTERIAL FORAGING
OPTIMISATION (BFO)
The bacterial foraging optimization (BFO) proposed by Passino in
the year 2002 is based on natural selection that tends to eliminate
animals with poor foraging strategies. After many generations,
poor foraging strategies are eliminated while only the individuals
with good foraging strategy survive signifying survival of the
fittest. BFO formulates the foraging behavior exhibited by E.
coli bacteria as an optimization problem. Over certain real-world
optimization problems, BFO has been reported to outperform
many powerful optimization algorithms in terms of convergence
speed and final accuracy. [8]
Bacterial foraging optimization algorithm (BFOA) has been
widely accepted as a global optimization algorithm of current
interest for distributed optimization and control. BFOA is inspired
by the social foraging behavior of Escherichia coli. BFOA has
already drawn the attention of researchers because of its efficiency
in solving real-world optimization problems arising in several
application domains. Application of group foraging strategy of a
swarm of E.coli bacteria in multi-optimal function optimization is
the key idea of the new algorithm. Bacteria search for nutrients in
a manner to maximize energy obtained per unit time. Individual
bacterium also communicates with others by sending signals. A
bacterium takes foraging decisions after considering two previous
factors. The process, in which a bacterium moves by taking small
steps while searching for nutrients, is called chemotaxis and key
idea of BFOA is mimicking chemotactic movement of virtual
bacteria in the problem search space.
Since its inception, BFOA has drawn the attention of researchers
from diverse fields of knowledge especially due to its biological
motivation and graceful structure. Researchers are trying to
hybridize BFOA with different other algorithms in order to
explore its local and global search properties separately. It has
already been applied to many real world problems and proved its
effectiveness over many variants of GA and PSO. Mathematical
modeling, adaptation, and modification of the algorithm might be
214
ISBN: 978-81-924893-0-8
a major part of the research on BFOA in future. [11] The Bacterial
Foraging Optimization Algorithm is inspired by the group
foraging behavior of bacteria such as E. coli and M. xanthus.
Specifically, the BFOA is inspired by the chemotaxis behavior of
bacteria that will perceive chemical gradients in the environment
(such as nutrients) and move toward or away from specific signals.
8. APPLICATIONS
These optimization techniques can be used in the given
applications as in Multidimensional Knapsack problem (MKP),
Vehicle routing problem, MANET Routing algorithm, Economic
Load Dispatch, Travelling salesman problem (TSP), Texture
feature selection, Continuous optimization, Scheduling, Optimal
data aggregation tree in wireless sensor networks, Test data
generation based on test path discovery, Code coverage,
Optimization of manufacturing process models and Optimizing
routing protocol.
9. CONCLUSION
A study has been provided on various optimization techniques like
Genetic algorithm (GA), Particle swarm optimization (PSO), Ant
colony optimization (ACO) and Artificial bee colony in this paper.
In the field of wireless sensor networks these techniques has been
used to calculate network lifetime, energy efficiency and end to
end delay.
FUTURE SCOPE
Hybrid algorithms can be studied and developed based on bio
inspired algorithms and these can be used to improve the
performance of wireless sensor networks. It is proposed in this
paper to study the possibilities of optimization techniques to
improve performance of wireless sensor networks. Best features of
individual optimization techniques can be taken in account and
further hybridization of these optimization techniques can also be
implemented in future research.
REFERENCES
[1] Cobo, L., Quintero, A. and Pierre, S., 2010 “Ant-based routing
for wireless multimedia sensor networks using multiple QoS
metrics” Journal of Computer Networks, 54 pp. 2991–3010
[2] Eiben A.E. and Smith J.E., “Introduction to Evolutionary
Computing” Springer, Natural Computing Series, 2nd Edition,
2007, ISBN: 978-3-540-40184-1
[3] Kulkarni, R.V. and Venayagamoorthy, G.A., 2011 Particle
Swarm Optimization in Wireless-Sensor Networks: A Brief
Survey IEEE Transaction on Systems, Man, and Cybernetics Part
C: Applications and Reviews 41(2) pp- 262- 267
[4] Kuila P., Gupta, S.K., and Jana, P.K., 2013 “A Novel
Evolutionary approach for Load Balanced Clustering problem for
Wireless Sensor Networks” International Journal of Swarm and
Evolutionary Computation 12 pp. 48–56
[5] Liao, W.H., Kao, Y. and Wu, R.T., 2011“Ant Colony
Optimization based sensor deployment protocol for Wireless
Sensor Networks” in International Journal of Expert Systems with
Applications, 38 pp. 6599–6605
[6] Lin, Y., Zhang, J., Chung, H., Ip, W.H., Li, Y. and Shi, Y.H.
2012 “An Ant Colony Optimization Approach for Maximizing the
Lifetime of Heterogeneous Wireless Sensor Networks” IEEE
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Transaction on Systems, Man and Cybernetics-Part c:

Applications and Reviews, 42(3) pp. 408-420
[7] Mardukhia, F., Bakhsha, N.N., Zamanifara, K. and Baratib, A.
2013 “QoS decomposition for service composition using Genetic
Algorithm” International Journal of Applied Soft Computing. 13
pp. 3409–3421
[8] Patnaik S.S. and Panda A.K. “Particle Swarm Optimization
and Bacterial Foraging Optimization Techniques for Optimal
Current Harmonic Mitigation by Employing Active Power Filter”
Hindawi Publishing Corporation Journal of Applied
Computational Intelligence and Soft Computing, Volume 2012,
Article ID 897127
[9] Sahoo, R.R., Singh, M., Sahoo, B.M., Majumder, K., Raya, S.
and Sarkara, S.K., 2013 “A Light Weight Trust Based Secure and
Energy Efficient Clustering in Wireless Sensor Network: Honey
Bee Mating Intelligence Approach” International Journal of
Procedia Technology. 10 pp. 515 – 523.
[10] Super NEC‟s GA optimizer manual.
[11] https://softcomputing.net/bfoa-chapter.pdf website accessed
on 05/05/2014

215
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Soft Computing and its various tools: A review
Nishi Sharma
Department of CSE
B.G.I.E.T., Sangrur
naisha_sharma@yahoo.com
ABSTRACT
Soft Computing as its name implies is an evolutionary
approach to produce intelligent system which do have
human like expertise. The mind of human is incomparable
to anything. Human mind does not work on hard and fast
rules i.e. it behaves according to the situation. Soft
Computing follows the same approach.It is A breakthrough
in science and engineering fields as it can solve problems
that have not been to be solved by conventional
approaches. It yields rich knowledge which enable
intelligent systems to be constructed at low cost. This
remarkable idea of producing machines which behave like
human minds comes to L.A.Zadeh in 1965 when he
proposed the fuzzy sets. After t his, enhancement towards
this field never stops. These emerging ideas changed the
whole world. Today we have microwave ovens and
washing machines that can itself decides how to perform
the tasks optimally. The main objective of this paper is to
introduce about the latest trends in soft computing as well
as hybrid computing to leverage the advantage of two or
more than two models.
Keywords
Computational Intelligence, Fuzzy logic, Soft Computing,
Neural Networks, Genetic Algorithm.
1. INTRODUCTION
To build the machines which are having human like
knowledge intelligence is required. Intelligence basically
derives the answer and not simply arrives to the answer.
Broadly it is classified into two categories-Artificial
Intelligence and Computational Intelligence. Artificial
Intelligence techniques are time consuming and complex.
Under artificial intelligence we do have hard computing.
Today we require low cost and less time consuming
solutions to a problem. This can be made possible by Soft
Computing. In 1965, L.A.Zadeh started his work of Soft
Computing with the initial concept of “Fuzzy Sets”. From
1965 to the end of 20th century, true progress on
computation with imprecise concepts took place [1].In
1968 he opened up several fields of research by writhing an
article on “Probability measures of fuzzy events”[2].After
the establishment of BISC (Berkley initiative in Soft
216
ISBN: 978-81-924893-0-8
Shweta Rani
Department of ECE,
BGIET, Sangrur
shwetaranee@gmail.com
Computing) researchers all over the world started work on
various tools of Soft Computing. It includes fuzzy logic,
Neural Network, Genetic Algorithm, Particle Swarm
Optimization etc.[3]. Soft Computing is defined as an
approach to construct computationally intelligent systems
which have human like expertise and having the ability to
adapt and learn in changing environment at low cost. A
single computational approach cannot be used to produce
these kind of machines. Therefore, Soft Computing
encompasses a group of different methodologies like Fuzzy
,Neural,Genetic Algorithms etc which have information
processing capabilities to solve real-life problems. Soft
Computing techniques can tolerate imprecision, uncertainty
and partial truth to produce HMIQ(High Machine
Intelligent Quotient)[4]. AI techniques deals only with
precision, certainty but in contrast with soft computing it
exploit the tolerance for imprecision, uncertainty and
partial truth, low solution cost, achieve tractability, error
free, and enhanced result with reality. It is used in
conjunction with rule-based expert systems in the form of
if-then rules. Despite different approaches have been
proposed in recent years, for detecting intrusion. Various
hybrid method such as neuro-fuzzy, neuro-genetic, fuzzy-
genetic, and neuro-fuzzy- genetic are used as most popular
techniques[5].These techniques are different from our
conventional approach of Hard Computing which are time
consuming and complex. Soft Computing is a wide ranging
group of techniques like neural network, fuzzy systems,
Genetic algorithm and many more. Each of these
technologies has their own strength. The main
characteristic of soft computing is its capability to create
hybrid systems that is based on the integration of various
technologies. So, it is called as collection of techniques.
This integration provides complementary reasoning
methods rather than competitive. Whenever various
methods are used to implement a particular machine it is
called as Hybrid Soft Computing. Hybrid Soft Computing
consists of strength and novelty of two or more
computational models. The first and most successful hybrid
approach till now are neurofuzzy systems[6], although
more hybridations are being developed with great success
for example the genetic systems[7].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

1. Input layer: Various inputs can be provided to the system

either by input files or directly from electronic sensors in
real time functions.

2.Hidden Layer: At this step, each of input is multiplied by

INTELLIGENCE respective weight factor. After that summation is done on
overall inputs. However, many different type of operations
can be selected depends upon the requirement. Even we can
modify the weights on the input of each processing element
COMPUTATIONAL ARTIFICIAL
as per the need.
INTELLIGENCE INTELLIGENCE
3.Output layer: The output of this hidden layer is then
HARD SOFT transferred to the output layer which can change it into the
COMPUTING real output according to the devices available.
COMPUTING
2. GENETIC ALGORITHMS:
The term genetic algorithm abbreviated as GA was first
NEURAL GENETIC FUZZY
used by John Holland[11] in 1975. Genetic
NETWORK ALGORITHMS LOGIC
algorithms(GAs) are computer programs that mimic the
processes of biological evolution in order to solve
Figure1: Hierarchy of Intelligence problems and to model evolutionary system. John Holland
presented the theoretical framework for adaptation. It is
basically a method for moving from one population of
2. ARTIFICIAL NEURAL NETWORK
chromosomes to a new generated population using
A continuous approach to mimic the functioning of brain is selection together with the genetic inspired operators of
artificial neural network. An Artificial Neuron is basically crossover, mutation and inversion[12]. It is basically a
an engineering approach of biological neuron. It have search technique that will map data for the problems where
device with many inputs and one output. It consists of large no particular formula can be implemented.
number of simple processing elements that are
interconnected with each other and layered as The operators followed by genetic algorithm[13] are
well[8][9].Even the brain of animal works so good which a describes by the flowchart in Figure 3:
machine cannot follow. Now the researchers are aware that
our brain is also in a structured from. Our brain works on Choose the possible solutions
neurons. Each neuron is very complicated in structure.
They have myriad of parts, sub-systems and control
mechanisms. Some pattern is been trying to follow for
artificial neural network which can work like human-mind.
optimum
solutions? Stop
Input layer Hidden layer Output layer

Selection
Neuron
.
Crossover

Mutation
Figure 2: Artificial Neuron Network

The Artificial Neural Network simulates for basic functions

of biological neuron as shown in Figure 2[10]: Figure 3: Flowchart of Genetic Algorithms

217
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
1. Initialization: At the first step all solutions to the
problem are randomly generated. This is called as
population. The size of this depends upon the type of
problem. Basically, all range of possible solutions are
considered.
2. Selection: In this a good selection method is applied to
find out the proportion of the existing population. The
selection method we are choosing should be given prime
importance because it decides the best possible solutions
among the hundreds or thousands of possible solutions.
3. Reproduction: This step produces next generation
population of solutions from those selected by crossover
and mutation. The best fit individuals are selected for
reproduction. Then evaluation is done for new individuals.
In this way process continues until least-fit population is
extracted.
4. Termination: The generation process terminates when all
the combinations are done or fixed number of combinations
has been reached or any other termination condition
satisfied.
3. FUZZY LOGIC
The idea of Fuzzy Logic was conceived by Lotfi Zadeh
1965 [1].Basically, Fuzzy Logic (FL) is a multivalued
logic, that allows intermediate values to be defined between
conventional evaluations like true/false, yes/no, high/low,
etc. In a FLS, a rule base is constructed to control the
output variable. A fuzzy rule is a simple IF-THEN rule
with a condition and a conclusion[14].He gives the concept
to make machines smarter and somewhat behaves
according to the requirement. Fuzzy Logic also mimics the
human brain as Neural Network Do but the concept is
different.
Rules
Fuzzier Inference Defuzzier
Figure 4: Fuzzy Logic
1. Definition: The problem to be solved is defined properly
i.e. a basic understanding should be there what has to be
done.
2. Using the rule-based structure of Fuzzy Logic, break the
problem into series of IF-THEN-ELSE structure that define
the desired output with the given inputs.
218
ISBN: 978-81-924893-0-8
3. Evaluation and testing is done and more over we can
change the inputs for desired results.
4. HYBRID TECHNIQUES
Hybridization of intelligent systems is a promising field of
modern intelligence for the development of next generation
controllers [16]. Integration of various soft computing
techniques can solve complex problems in real world.
Hybrid techniques provide more robust and reliable
problem solving models than standalone models.
Integrating these techniques enhance the overall strengths
and lessen weakness thereby helping to solve overall
control problem in effective way. Various strategies,
models and design have been suggested by researchers to
integrate various intelligent systems for practical
applications. The main goal of integration is to take the
advantages of strengths of each model to achieve
effectiveness and efficiency. Hybridization can be done in
any manner depends upon the requirement. Neuro-Fuzzy,
Genetic-Fuzzy, Neuro-Genetic are the useful techniques for
various real time complex problems[16,17].
5. CONCLUSION
This paper has presented three methods of Soft Computing.
A combining method has also been discussed to improve
performance on real world applications. The primary
contribution of this paper lies in showing the possibilities
of various techniques of soft computing which are not strict
as our mathematical approaches are.
REFERENCES
[1]. Zadeh, L.A. 1965 Fuzzy Sets. Information and Control
338-353.
[2]. Zadeh, L.A. 1968Probability measureson Fuzzy
ogic”,Vol.23 No.2,1968
[3]. Y.Dote,S.J. Ovaska,”Industrial Applications of Soft
Computing: A Review”,IEEE,Vol.89,No.9,2001.
[4]. E.Trillas, “Lotfi A. Zadeh: On the man and his work”
in scientia Iranica D(2011) pp. 574-579
[5]. B.Prasad ,“Introduction to Neuro-Fuzzy Systems”
vol.226of advances in soft Computing Series.
Springer-Verlag,2000.
[6]. O.Cordan,R.Alcal,J.Alcala-Fernandez and I.Rojas
,“Genetic Fuzzy Systems:What’s next?” IEEE Trans.
Fuzzy Systems,Vol. 15,pp.533-535
[7]. Sonali,B.Maind,P.Wankar,”Research Paper On Basic
of Artificial Neural Network”,IJRITCC,Vol.2 Issue
1,pp.96-100.
[8]. Eldon Y. Li, “Artificial Neural Networks and their
Business Applications”, Taiwan, 1994.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[9]. Christos Stergiou and Dimitrios Siganos, “Neural [14]. U.Kose,”Fundamentals of Fuzzy Logic with an Easy-
Networks”. to-use ,Interactive Fuzzy Control Applications”,
[10]. Sonali,B.Maind,P.Wankar,”Research Paper on Basic IJMER ,Vol.2,Issue3,pp.1198-1203,2012
Of Artificial Neural Network”,IJRTCC,vol.2 [15]. B.Joseph,”Paradigm shift- an introduction to fuzzy
Issue1,pp.96-100,2014. logic”,IEEE potentials,2006.
[11]. J.Holland,”Adaptation in Natural and Artificial [16]. R.Malhotra,N.Singh,Y.Singh,”Soft Computing
Systems”,University of Michigan Press,1975 Techniques For Process Control
[12]. C.Reeves,”Genetic Algorithms”, School of Applications”,IJSC,Vol.2,No.3,pp.32-44,2011.
Mathematics and Information Sciences [17]. S.B.Cho,”Fusion of Neural Network with Fuzzy logic
[13]. M.Mitchell,”Genetic Algorithm:An Overview”,MIT and Genetic algorithm”,ICAE,pp.363-372,2002.
press,pp 31-39,1995.

219
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Passive Optical Networks Employing Triple Play
Services: A Review
Harneet Kaur
M.tech student (ECE)
Punjabi University
Patiala, India
harneet9556@gmail.com
ABSTRACT
Passive optical network in scenario of triple play service has
been reviewed in this paper. In triple play services there is a
combination of data, video and audio signals. Passive optical
network is point to multipoint architecture and is regarded as
one of the best choices for the broadband access network in
the future. By developing this network, larger transmission
capacity at higher bit rate and longer transmission distance
can be achieved.
Keywords
Optical Line Termination (OLT), Optical Network Unit
(ONU), Passive Optical Networks (PON).
1. INTRODUCTION
With the advancement in the communication systems, there is
a need for large bandwidth to send more data at higher speed.
Residential subscribers demand high speed network for voice
and media-rich services. Similarly, corporate subscribers
demand broadband infrastructure so that they can extend their
local-area networks to the Internet backbone. This demands
the networks of higher capacities at lower costs. Our current
“age of technology” is the result of many brilliant inventions
and discoveries, but it is our ability to transmit information,
and the media we use to do it, that is perhaps most responsible
for its evolution [1]. Progressing from the copper wire of a
century ago to today’s fiber optic cable, our increasing ability
to transmit more information, more quickly and over longer
distances has expanded the boundaries of our technological
development in all areas [2]. Optical communication
technology gives the solution for higher bandwidth. By
developing the optical networks, larger transmission capacity,
higher bit rate and longer transmission distance can be
achieved. PON uses a dedicated optical fiber, to provide
virtually unlimited bandwidth, without using any active
component within the network. It offers a true triple play
service of voice, video and data on a network.
2. FIBER TO THE HOME (FTTH)
The access network, also known as the “first-mile network,”
connects the service provider central offices (COs) to
businesses and residential subscribers. This network is also
referred in the literature as the subscriber access network, or
the local loop [3]. Demand for larger bandwidth and triple-
play delivery to customers (voice, data, and video) ignited
competition among service providers. Thus service providers
220
ISBN: 978-81-924893-0-8
Harmanjot Singh
Assistant Professor
Punjabi University
Patiala, India
harman.dhaliwal.nba@gmail.com
get motivated to invest in FTTx (Fiber To The x). FTTx is an
acronym for number of optical access technologies, such as
Fiber to the Node (FTTN), Fiber to the Curb (FTTC), Fiber to
the Business–or Building–(FTTB), Fiber to the Home
(FTTH), and Fiber to the Premises (FTTP). These networks
have various advantages like long reach, high bandwidth and
low loss [4]. There are mainly two FTTH architectures that
are of current interest, Active Optical Network (AON), and
Passive Optical Network (PON).
2.1 Active optical network
An active optical system uses electrically powered switching
equipment, such as a router or a switch aggregator, to manage
signal distribution and direct signals to specific customers.
This switch opens and closes in various ways to direct the
incoming and outgoing signals to the proper place. In such a
system, a customer may have a dedicated fiber running to his
or her house [5].
2.2 Passive optical network (PON)
Passive optical network (PON) is a telecommunications
network that uses point-to-multipoint fiber to the premises in
which unpowered optical splitters are used to enable a
single optical fiber to serve multiple premises by separating
the signal towards each user. This network is called passive
because no power element is used within the central office
and the subscribers. Hence the cost of the network and its
installation is reduced. A PON reduces the amount of fiber
and central office equipment required compared with point-to-
point architectures. PON is a form of fiber-optic access
network. It offers a true triple play service of voice, video and
data on a network [5].
3. PON ARCHITECTURE
The PON architecture consists of three main network
elements as Optical Line Terminal (OLT), Passive Optical
Splitter and Optical Network Unit (ONU). Optical line
terminal (OLT) is located at central office (CO). It modulates
the light wave and transmits it through fiber to optical
network units (ONUs) which are located at end users. It is
designed to provide virtually unlimited bandwidth to the
subscriber. We can define it as point to multipoint [p2mp]
topology as it uses a single optical fiber to serve multiple
users usually between 32 to 128[9-13]. A PON is a single,
shared optical fiber (shared feeder fiber) that uses a passive
optical splitter to divide the signal towards individual
subscribers as shown in figure 1.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.1.3 EPON (Ethernet passive optical network)

ONU EPON is IEEE 802.3 standard, and is a category of networks
Fiber optic in based on the Ethernet technique. An EPON combines the low-
distribution cost Ethernet equipment and fiber infrastructure, and transmits
Ethernet data frames directly. It can provide 1 Gbps capacity
Shared feeder fiber in both upstream and downstream directions. These features
enable EPONs to transmit data, voice and video traffic. EPON
also uses the 1310 nm window for upstream and 1490 nm
OLT window for downstream transmission. This standard allows
 . transmission in downstream and upstream under only 1
 . Central single-mode fiber with a maximum range of 10 km between
splitter and ONU, and there is provision for extending the
 . Splitter office distance to 20 km. The EPON standard establishes a dedicated
wavelength for the broadcast of video from the OLT to the
ONUs. The wavelengths are:

Downstream channel: λ=1480-1500 nm

Figure 1: Passive Optical Network (PON) Upstream channel: λ=1260-1360 nm
Video: λ=1550-1560 nm [7]

3.1 PON standards 3.1.4 GPON (Gigabit PON)

There are several PON standards like APON, BPON, EPON
or GEPON, according to the distance between OLT and ONU
and data rates in downstream and upstream transmission.
3.1.1 APON (Asynchronous transfer mode PON)
These networks are referred as APON (ATM Passive Optical
Network), and are standardized under ITU-T standard G.983.1
based on ATM cell transmission. It was the first network that
was defined by FSAN (Full Service Access Network). APON
offers maximum rate of 155 Mbps shared between the ONU
numbers that are connected. First it was limited to 155 Mbps
which later was increased to 622 Mbps. ATM PON connects
up to 32 subscribers to the PON [6].
3.1.2 BPON (Broadband Passive Optical
Network)
BPON (Broadband Passive Optical Network) is an ITU-T
G.983.x standard. It emerges as evolution of APON, and has
the speed limitation of the same. BPON networks are also
based on ATM cell transmission, but they differ from APON
as they support other broadband standards. BPON networks
were first defined under a fixed rate of 155 Mbps transmission
for both uplink and downlink. But later they were amended to
introduce asymmetric channels:
Downlink: 622 Mbps
Uplink: 155 Mbps
For 1fiber per ONU, sharing upstream and downstream:
Downstream channel: λ=1480-1500 nm
Upstream channel: λ=1260-1360 nm
Video: λ=1550-1560 nm
For 2 fibers for each ONU, one for upstream and one for
downstream:
Downstream channel: λ=1260-1360 nm
Upstream channel: λ=1260-1360 nm
Video: λ=1550-1560 nm [6].
The more advanced standard which is still working is
evolution of the BPON. To meet rapidly growing demand and
to work better with changes in communication technologies a,
ITU-T created the series of standards ITU-T G.984.x for
Gigabit capacity PON, which are the basis of the standard
GPON (Gigabit PON). Varied transmission rates are allowed
by GPON in the range between 622 Mbps to 2,488 Gbps in
the downstream channel. Like BPON, this standard allows
data transmission both symmetric and asymmetric where rates
of transmission for each one are:
Symmetric transmission: flow rates between 622 Mbps and
2,488 Gbps are offered both for downstream and upstream
channel.
Asymmetric transmission: Different flow rates for
downstream and upstream channel
Downstream channel: up to 2,488 Gbps.
Upstream channel: up to 1,244 Gbps.
The wavelengths of work that sets the GPON standard vary
depending on whether you use 1 or 2 fibers for each ONT,
although for both sets a dedicated wavelength for video
broadcast from the OLT to the ONTs, being this different
from those used in the voice and data transmission. For 1
fiber per ONT, shared for transmission and reception:
Downstream channel: λ=1480-1500 nm
Upstream channel: λ=1260-1360 nm
Video: λ=1550 nm
For 2 fibers for each ONT, one for transmission and another
one for reception:
Downstream channel: λ=1260-1360 nm
Upstream channel: λ=1260-1360 nm
Video: λ=1550 nm [8].
Following table summarize the common standards available
for PON.
Table 1. Common PON Standards

221
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Technol- Stand- Ditance Down- Up-
ogy ard (KM) stream stream
(Mbps) (Mbps)
BPON G.983 20 155,622,
155,622
1244
EPON 802.3 10 1244
1244
GPON G.984 20 1244, 2488 155
2488
3.2 WDM PON architecture at 5 Gbps
accommodating 32 users at 15 km reach
Evaluation on WDM-PON (wavelength division multiplexed)
access network architecture accommodating 32 users was
done successfully. Results affirmed that network performance
degrades more linearly over increasing secondary SMF
(single mode fiber) lengths when Avalanche photo diodes
(APDs) were used compared to exponential decay in signal
quality which was found to be the case using PIN photo
receivers. Simulation work revealed that performance gains of
around 15km in terms of system reach and up to 5 Gbps in
terms of data carrying capacity per user can be attained if
APDs are used at the receiver side in downstream direction
[9].
3.3 Bidirectional fiber accommodating 32
users and covering 20km at 155 Mbps and
622 Mbps
An extensive research had been carried out to evaluate a
Broadband Passive Optical Network (BPON) for both
downstream and upstream traffic to highly scalable solutions
to service providers to make fiber reach the end user. The
system has been developed to accommodate up to 32 users by
using bidirectional fiber of length 20 km... The system was
analyzed on the basis of Data Rate, Fiber length, Coding
technique, number of users, wavelengths and their effects on
Bit Error rate (BER) as the key performance parameter .
Remarkable results had been achieved and a novel relation
had been developed between the data rate and accommodated
users. The transmitter was configured to generate both
155Mbps and 622Mbps data rates for downstream traffic It
had been revealed that, in downstream direction, doubling the
number of users only requires switching to the lower data rate
in order to maintain identical BER effects over the same fiber
length. Additionally, the relation had also been tested on
Return-to-Zero (RZ) and Non-Return-to-zero (NRZ) coding
and was found to be unaffected by coding formats used The
system has been developed to accommodate up to 32 users by
using bidirectional fiber of length 20 km. [10].
3.4 FTTH triple play services using GE-
PON architecture for 56 users at 20 km
reach and at 2 Gbps
Evaluation and comparison of Fiber to the home, FTTH,
GEPON (gigabit Ethernet passive optical network) link design
for 56 subscribers at 20 km reach at 2 Gbps bit rate was
carried out to provide residential subscribers with triple play
services. A 1:56 splitter was used as a PON element which
creates communication between a Central Office to different
users and a boosting amplifier is employed before fiber length
which tends to decrease BER and allows more users to
accommodate. This architecture was investigated for different
ISBN: 978-81-924893-0-8
values of data rate from a CO (Central Office) to the PON in
terms of BER (Bit Error Rate). BER was considered as the
major technical issue to realize the GEPON based FTTH
access network. The simulation work reports for the case of
56 users at 2 Gbps and by further increasing the data rate of
system say 5 Gbps, and then there was a sharp increase in
to
BER. Similarly in the variation of BER with respect to
transmission distance, BER shows an increase in its value as
transmission distance increases [11].
3.5 Long reach (100 km) 32 channel FTTH
downstream link employing triple play at
2.5 GB/s
Performance of high capacity, long reach, and 32 channel
FTTH downstream link employing triple play services had
been investigated. DWDM has been employed for bandwidth
optimization. The triple-play service was realized as a
combination of data, voice, and video signals. The Internet
component is represented by a data link with a high-speed of
2.5 Gb/s downstream. The voice component was represented
as VOIP and then combined with data component. The video
component was represented as a RF video signal. The reach of
the WDM-PON system can be severely limited by chromatic
dispersion. Therefore, by employing 80 km of non-linear fiber
in combination with 20 km of reverse dispersion fiber to
negate the accumulated chromatic dispersion which ensured
long reach of the modeled FTTH system. Investigations
revealed the effective bandwidth optimization using DWDM.
High quality factor and low BER results confirmed the
feasibility of proposed high capacity, long reach FTTH link.
The investigations further revealed that the system reach can
be extended up to 100 km with efficient chromatic dispersion
management [12].
3.6 Bi-directional PON in scenario of triple
play service covering 40 km at 10 Gbps for
128 users
Performance of bi-directional passive optical network
(BPON) had been evaluated and compared at different bit
rates in the scenario of triple play service. The triple-play
service is realized as a combination of data, voice and video
signals. This architecture was investigated for symmetrical
data traffic for uplink and downlink transmission and its
performance was also evaluated in terms of Q-factor and eye
height at different transmission distance. The Q-factor results
show the acceptable performance at 10 Gbps data rate for
downstream and upstream transmission, as it accommodates
128 optical network units (ONUs) covering the transmission
distance of 40 km[13].
4. CONCLUSION
PON is point to multipoint mechanism and is one of the best
choices for the broadband access network to achieve higher
data rates and longer transmission distances. GPON is the
most advanced PON protocol and offers higher bandwidth and
longer transmission distance when compare to ATM and
Ethernet based PON technologies. Link length and data rate
can be increased further to meet increasing demand of triple
play services. Use of amplifiers increase the link length and
222
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
system performance but it adds cost and noise to the system.
Therefore correct amplifier design is required to amplify the
signal in the Gigabit Passive Optical Network. Bidirectional
Passive Optical Networks are more useful, but with the
increase in No. of users, Data rate, link length and non linear
effects system performance degraded. Work has to be done on
these parameters for better Bidirectional-GPON systems.
REFERENCES
[1] P. Piskarskas, A. P. Stabinis, and V. Pyragaite,
Ultrabroad bandwidth of optical parametric amplifiers,
IEEE J. Quantum Electron., vol. 46, no. 7, pp. 1031–
1038, July 2010.
[2] J.H. Lee, et al., Extended-reach WDM-PON based on
CW super continuum light source for colorless FP-LD
based OLT and RSOA-based ONUs, J. Opt. Fiber Tech-
nol. 15, 310–319, March 2009.
[3] Jingjing Zhang, Nirwan Ansari, Scheduling hybrid
WDM/TDM passive optical networks with nonzero
laser tuning time, IEEE/ACM Trans. Netw., 1014–1027,
April 2011.
[4] Xianbin Yu, et.al ―System Wide Implementation of
Photonically Generated Impulse Radio Ultra-Wideband
for Gigabit Fiber-Wireless Access‖ Journal of Lightwave
Technology, Vol. 31,pp.264-274, January 2013.
[5] Konstantinos Kanonakis ―Offset-Based Scheduling
with Flexible Intervals for Evolving GPON Networks,
Journal of Lightwave Technology, Vol. 27, pp.3259-
3268, August 2009.
223
ISBN: 978-81-924893-0-8
[6] Sang-Heung Lee, et.al ―A Single-Chip 2.5-Gb/s Burst-
Mode Optical Receiver with Wide Dynamic Range‖
IEEE Photonics Technology Letters, Vol. 23, pp.85-87,
January 2011
[7] Hesham A. Bakarman,et.al ―Simulation of 1.25 Gb/s
Downstream Transmission Performance of GPON-FTTx‖
International Conference Photonics,pp 1-5, July 2010
[8] Jingjing Zhang, Nirwan Ansari, Scheduling hybrid
WDM/TDM passive optical networks with nonzero laser
tuning time, IEEE/ACM Trans. Netw. Pp.1014–1027,
April 2011.
[9] Erik Weis, et.al, “GPON FTTH trial-lessons learned”
Journal of SPIE-OSA-IEEE Asia Communications and
Photonics, vol. 7633, pp 6330J-1- 6330J-7, July 2009.
[10] S.F. Shaukat, U. Ibrahim and Saba Nazir, “Monte Carlo
Analysis of Broadband Passive Optical Networks”,
IDOSI Publications, vol.12, no. 8, ISSN 1818- 4952,
2011.
[11] D. Kocher, R.S. Kaler, R. Randhawa, Simulation of fiber
to the home triple play services at 2 Gbit/s using GE-
PON architecture for 56 ONUs, Optik 121 pp.5007-5010,
May 2013.
[12] J.S. Malhotra, M. Kumar, A.K. Sharma, Performance
optimization of high capac-ity long reach 32 channel
FTTH downstream link employing triple play
services,Optik 124,pp. 2424–2427, 2013.
[13] Simranjit Singh, Performance evaluation of bi-directional
passive optical networks in the scenario of triple play
service, Optik 125, pp. 5837-5841, 2014.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Review of Static Light path Design in WDM network
Harpreet Kaur
BBSBEC, Fatehgarh Sahib
reet.mavi82@gmail.com
ABSTRACT: As use of internet is increasing rapidly
so we need networks supporting high bandwidth and data
rates. Need of high bandwidth evolve the need of WDM
network and routing information over them .In this paper
we have reviewed various routing and wavelength
assignment algorithms used in literature .We have also
described the contribution of nature inspired techniques in
enhancing the performance of optical networks.
Keywords: Genetic Algorithm, Differential Evolution
,Variable Neighborhood Search, Multi-objective,
Optimization.
1. INTRODUCTION
In WDM networks, the whole capacity is divided into
multiple channels that have different wavelengths.WDM
networks consist of wdm nodes across which optical traffic
can be transmitted using light paths. If there are no
wavelength converters then light path must use same
wavelength over the fiber links it is transmitting, this is
known as wavelength continuity constraint .The light path
that have same physical link but they cannot be assigned
same wavelength . This is called wavelength clash
constraint [1,6].
For a given set of light paths to be established,
the process of finding routes for light path and assigning
wavelength for the route is called routing and wavelength
assignment problem.RWA problem can be considered
under two types of traffic i.e. static and dynamic. Static
RWA means that connection requests are known in
advance. one has to route the request and allot suitable
wavelength for it. This is also called as offline RWA.
Dynamic RWA means that connection requests arrive in
random fashion with random settling and tearing times.
Ultimately, objective function needs to be optimized in
either type of RWA.
The rest of the paper is organized as follows. In the next
section we present review of already existing and proposed
techniques for static routing and wavelength assignment in
224
ISBN: 978-81-924893-0-8
Munish Rattan
GNDEC, Ludhiana
optical network. Further, we discussed the use of nature
inspired techniques for routing and wavelength assignment
in optical networks. Finally we provide the summary with
future scope to conclude the paper.
2. TECHNIQUES FOR STATIC RWA
In static routing, the light paths are known in advance so
main objective is to minimize the number of wavelengths
when traffic request is routed for a given topology. The
problem may be multi objective i.e. minimizing blocking
probability, throughput or failures among the connections
etc. [2].
According to the objective taken there are number of
techniques proposed in literature. Mostly RWA is solved
by decomposing the problem in two parts i.e. routing
problem and wavelength assignment problem. The
proposed routing algorithms are:
2.1 Shortest Path Routing (SPR): In this
type firstly shortest path is selected using Dijkstra
algorithm based on current state of the network. Path
is measured in terms of number of hops .Then
wavelength is assigned using first fit algorithm if
request is unsuccessful using first wavelength then
second wavelength is tried and process goes on
repeating. If request is unsuccessful for all
wavelengths then call is said to be blocked. In this
there will be unconditional delay due to selection of
shortest paths [14, 11].
2.2 Resource Utilization based Routing
Algorithms (RUR): In this algorithm, set of K
shortest paths are calculated based on minimum
resource utilization i.e. taking in account number of
regenerators, hop count and lastly length [14].
2.3 Bin packing based Routing
Techniques [6]:
2.3.1 FF RWA: In this routing, only one copy of
graph G is created and higher indexed bins are formed
if they are required. The connection request is routed
in this graph( bin Gi ) if it has shortest path between Si
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
and Di exist such that length denoted by Pi is less than
H .Wavelength i is assigned to route once the bin is
used to route the request, then all the edges of Pi are
deleted. Once all the edges in bin vanish means that it
doesn’t have capacity to route any other requests.
2.3.2 BF RWA: In this routing, if number
of bins is created then best fitted bin is one
having shortest path between source and
destination pair compared to other bins.
2.3.3 FFD RWA: (First Fit Decreasing
RWA) In this technique, first longer light path is
routed in a bin and fills the remaining space with
shorter light paths .
2.3.4 BFD- RWA: (Best Fit Decreasing
RWA) It first arrange requests in decreasing
order of their shortest paths in G and then follows
BF-RWA. These bin based routing algorithms
not only minimize the number of wavelength but
also the physical length between source and
destination.
These bin based algorithms not only reduces the
hop length, reduces the number of wavelengths
required but also reduces the chance of light path
request to be blocked.
2.4 Fixed Alternate Routing: In this routing, a
routing table is formed which consist of all the
possible routes between source and destination starting
from the shortest path up to the largest possible route.
When connection request arrives the route is selected
randomly starting from the shortest path on which
wavelength can be allotted. If there exist no route on
which wavelength can be allotted then the connection
is blocked [2].
This technique makes the task of setting up and
tearing off light paths easier, provides fault tolerance
and reduces the blocking probability compared to
shortest path routing.
2.5 Adaptive Routing: In this routing when
connection request arrives, a route is selected among
the N shortest path which has maximum number of
free wavelengths for single hop connection. And in
multi hop connection route selected for source
destination pair is the one which don’t have any
common wavelength among N other shortest paths.
This routing improves the blocking probability of the
network [15].
This technique improves the link utilization hence
improves the capacity of the network.
225
ISBN: 978-81-924893-0-8
2.6 Waveband Switching Routing: In this
technique, firstly K shortest paths are selected between
source destination pairs when the connection request
arrives, then rerouting techniques are employed so as to
reduce number of ports. It also outperforms traditional
routing in terms of performance [4].
2.7 Priority and Maximum Revenue
based routing and wavelength
assignment: In this technique firstly the connection
requests are divided into two sets i.e. HPM (high priority
matrix) and LPM (low priority matrix). In this, light paths
must be formed whereas light paths in LPM can be setup to
optimize revenue when there is not enough resource to
accommodate all. Since requests in HPM need to be
fulfilled so cost for that will always be fixed, the problem is
to maximize the cost contribution from LPM. For this two
algorithms are proposed i.e. SILP and SP.
Maximize
∑ [ ∑Esd^i Psd ^i + ∑ Bsd *PRI ]
S,d€D 1≤i≤n
With the following constraints
∑ (Esd^i + Bsd^i ) ≤ 1 V (m,n) € E 1)
∑ Esd^i ≤Өsd V (s,d )€ D 2)
∑ Bsd^I ≤ λsd ,V (s,d)€ D 3)
Equation 1 represents the constraint that no two route can
use same link. Equation 2 and Equation 3 ensures that
number of routes found is less than desired number. Value
of PRI is kept larger than highest market price so that
algorithm fulfills all requests in HPM [16].
SR Algorithm: In this algorithm in HPM connection
requests are arranged in decreasing order of their shortest
path and stored in list A and in LPM connection requests
are arranged in decreasing order of their cost and stored in
list B. Firstly, route and wavelength for first request in list
A is found, then resources used by it is removed from
network resource availability data. The process is repeated
for next request in list A and so on. If the algorithm
couldn’t find any light path for the request then it
terminates. After all requests of list A are fulfilled then
algorithm works to find light path for first request in list B.
If succeeds the network resource availability is updated and
the process repeats [16].
2.8 Alternate Shortest Path Algorithm: In
this algorithm for every connection request route is selected
on shortest path with at least one unoccupied channel if not
then alternate shortest path with unoccupied channel is
selected if still not possible then call is blocked [11].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2.9 Maximum empty channel routing:
this type of routing as soon as the call request arrives all the
possible paths are inspected and route is established on the
one having maximum number of empty channels [11].
2.10 Resource Utilization based Routing
Algorithm: It is a fixed alternate routing in this set of
‘n’ shortest paths are selected which uses minimum
resources provided hop count; path length and number of
regenerator are minimized. In this weight is assigned to
each link between i and j nodes.
Cij = {(W-aij -2 )/W * (R-rj -2)Lij/R } when Rj =1
{(W-aij -2 )/W* Lij/R } when Rj = 0
Csd = ∑Cij
Where W = Number of toatal equipped wavelength
aij = Number of available wavelengths in link
R = Total equipped regenerators
Rj =1 regeneration required at node j
Rj =0 regeneration is not required j
rj =Number of equipped regenerators
Lij = Length of link(i,j) [14] .
2.11 Resource balance based Link
Disjoint Routing (RBR):
In this routing, link disjoint paths are selected provided
balance is between minimum resources used and disjointed
level of the paths. If completely disjointed path is used it
will definitely use more number of resources so it will be
better to use partially disjointed path. In this weight is
calculated for every path.
Coff^i = 2 Rnode ^i ( H^i - Rnode ^i )10 log(L^i )
Rnode ^i = It is the necessary times 3R regenerator in path
H^i = number of total hops
L^i = represents toatal length
The path having minimum Coff^i is selected as first best
path and 2nd best path is evaluated using
Coff^i = Coff^i + C best [Lcommon]/[Llast]
C best = Last best path selected
Lcommon = set of common links in best path selected
Llast = Links of Last best path selected [14].
ISBN: 978-81-924893-0-8
In 2.12 Resource Optimization based with
customized Link Disjoint Degree Routing
(ROR):
In this technique path is chosen according to priority of
minimum network resource consumption provided with
required link disjoint degree ‘D’ where
Ddegree = 100 * (1 – (Llast –Lpath)/Llast
Llast = Links of Last best path selected
Lpath = Links of considerable path [14].
3. EVOLUTIONARY TECHNIQUE
FOR SINGLE OBJECTIVE STATIC
RWA
The static RWA problem in wdm optical network is also
solved with genetic algorithm for single objective the
optimization i.e. minimizes the number of wavelengths. A
hybrid approach is used for the initialization of the
population, this approach depends on K shortest path for
every source destination pair. A special cost function based
on frequency of occurrence of an edge in different S-D
paths is used to find the fitness of chromosome. An m-point
crossover is used to maintain diversity in solution space.
Wavelength assignment is done using graph coloring
technique. This technique outperforms first fit algorithm
[5].
4. MULTI-OBJECTIVE RWA USING
HYBRIDEVOLUTIONARY
APPROACH
In this technique two objective functions are optimized i.e.
maximize number of accepted commodities and
minimizing the number of wavelengths on each network
edge. In this technique genetic algorithm is used for routing
and minimum degree first for wavelength assignment (GA-
MDF) [8] and fast non dominated sorting GA (Genetic
Algorithm) to search for non dominated solutions (i.e. best
solution).Normally there are number of non dominated
solutions, so in this algorithm pruned optimal mechanism is
used to reduce the number of non dominated solutions [3,
13].
The objective function used is
Fobj= Wc (Q – Qa) / Q + Ww (Ka / Kmax)
Wc = weight for maximizing number of commodities
Ww = weight for maximizing required number of
wavelengths
Q = total number of requests
Qa = total number of accepted requests
226
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Ka = minimum required wavelengths
Kmax = total wavelength
Advantages: Results of NSGA-II are more diverse than
weighted sum approach
Disadvantages: It is more time consuming [9].
An hybrid evolutionary technique is used for static RWA in
which two different multi objective algorithms are
combined. One algorithm is population based i.e.
differential algorithm [12] and another algorithm i.e.
variable neighborhood search is used. Differential
evolution basically adds the weighted difference between
two population vectors to a third vector. Also the concept
of pareto tournament (DEPT) is added to compare the
individuals keeping only the non dominated solutions in the
population. In DEPT each individual receives a scaler value
based on number of individuals that dominates and number
of individuals by which it is dominated.
Variable neighborhood search [7] tries to escape from local
optima trap by modifying the neighborhood space. This
algorithm is changed to adapt it to multi- objective context
i.e. MO-VNS. Results of the algorithm are compared with
various multi-objective ant colony optimization and NSGA
II (Fast Non dominated genetic algorithm which proved to
be improved one [1].
5. CONCLUSION & FUTURE WORK
In this paper we have reviewed the already proposed
techniques for the static RWA problem in optical network.
We have also discussed the significance of using nature
inspired techniques for improving the performance of
RWA problem. Comparative study of all proposed
algorithms revealed that usage of hybrid evolutionary
techniques for multi objective optimization proved to be
quite promising for static RWA. So, future lines for
research in optical networks can be using hybrid
evolutionary techniques for multi-objective optimization
with dynamic traffic patterns.
REFERENCES
[1] A.R. Largo ,M. A. Vega-Rodriguez 2013 Applying
MOEAs to solve the static Routing and wavelength
Assignment problem in optical WDM networks J.
Engineering Application of Artificial Intelligence. 26 ,pp.
1602-1619.
[2] H. Zang, J.P. Jue, and B. Mukherjee 2000 A Review of
Routing and Wavelength assignment approaches For
Wavelength Routed Optical WDM Network Baltzer
Science Publishers, pp. 47-60.
[3] H.A. Taboada,D.W. Coit 2008 Multiobjective
scheduling problems:determination of pruned Pareto sets
IIE Transactions . 40 ,pp. 552-564.
[4] L. Guo, X. Wang,W. Ji, W. Hou, T. Wu, and F. Jin
2008 A New waveband Switching Routing Algorithm in
WDM Optical Networks In Proceedings Of International
227
ISBN: 978-81-924893-0-8
Conference On Advanced Communication Technology ,
Gangwon-Do, pp. 2151-2154.
[5] N. Banerjee and S. Sharan 2004 An Evolutionary
Algorithm for Solving the Single Objective Static Routing
and Wavelength Assignment Problem in WDM Network In
Proceedings Of International Conference On Intelligent
Sensing and Information Processing, pp. 13-18.
[6] N. S. Kapov 2007 Routing and wavelength assignment
in optical networks using bin packing based algorithms
European Journal of Operational Research .177, pp. 1167-
1179.
[7] P. Hansen and N. Mladenovic 2001 Variable
Neighbourhood Decomposition search Journal of Heuristic.
7 ,pp. 335-350.
[8] P. Leesutthipornchai, N. Wattanapongsakorn,C.
Charnsripinyo 2009 Multiobjective design for routing
wavelength assignment in wdm networks. In Proceedings
of International conference on New trends in information
Service Science ,Beijing,China(June 30-July 2),pp. 1315-
1320.
[9] P. Leesutthipornchai , C. Charnsripinyo and N.
Wattanapongsakorn 2010 Solving multi-objective routing
and wavelength assignment in wdm using hybrid
evolutionary computation approach. J. Computer
Communication,pp. 2246-2259.
[10] R. Ramaswami and K.N. Sivarajan 1995 Routing and
wavelength assignment in all optical networks.IEEE/ACM
Transaction On Networking . 3,pp. 489-500,1995.
[11] R. Randhawa and J.S. Sohal 2010 Static and dynamic
and wavelength assignment algorithm for future transport
networks. J. Optik . 121, pp. 702-710.
[12] R. Storn and K. Price 1997 Differential Evolution –A
Simple and Efficient Heuristics for Global Optimization
over continuous Spaces. Journal of Global Optimization .
11,pp 341-359.
[13] S.K. Konak,D.W. Coit ,F. Baheranwala 2008 Pruned
Pareto-optimal sets for the system redundancy allocation
problem based on multiple prioritized objectives. Journal
of Heuristics . 14,pp. 335-337.
[14] T. Chap, X. Wang, S. Xu, and Y. Tanaka 2011 Link-
Disjoint routing algorithms with link-Disjoint degree and
resource utilization concern in translucent WDM optical
networks. In Proceedings of International Conference on
Advanced Communication Technology, pp. 357-362.
[15] Y. Sun, J. Gu, and D.H.K.,Tsang 2001 Routing and
wavelength assignment in all optical networks with
multihop connections.Journal Of Electronics and
Communications. 55, pp. 10-17.
[16] Y. Wang, T.H. Cheng, and M. Ma 2007 Prority and
Maximum Revenue based Routing and Wavelength
Assignment for All Optical WDM Network. In
Proceedings of International Conference on Research
Innovation Vision of the Future,pp. 135-138.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Review Paper on Nanomaterials & Nanotechnology

Anshu Rao Ravi Kant

Department of Applied Science Department of ECE
BGIET, Sangrur BGIET, Sangrur
anshurao77@gmal.com rk2005mail@gmail.com

ABSTRACT Doping is an effective & facile method to modify the

In recent years, nanostructured materials have received physical properties (e.g. optics, magnetic and electricity) of
steadily growing interests because of their unique properties the base materials and this extends the applications of the base
& various potential applications in the fabrication of the materials. So, doping of nanoparticles such as ZnO, CdS,
nanodevices in the future. Various nanometer semiconductor TiO2 etc. is done with materials such as Ag, Bi, Al etc. to
materials such as ZnO, CdS, TiO2, SnO2 have been study & enhance its optical, magnetic & morphological
synthesized & studied. In the current paper, history of properties.
nanotechnology & nanomaterials has been studied. The
emergence of the most recent branch of Science, particularly 2. RESULTS & DISCUSSION
in Physics is discussed. The discovery of various compounds
of nanoscale is discussed & it is also explained that how the History of nanotechnology & formation of various
term “nanotechnology” came into existence. The foundations nanoparticles has been studied as discussed below:-
of nanotechnology have emerged over many decades of The term nanotechnology was first proposed by James
research in many different fields. Computer circuits have been Clerk Maxwell in 1867. He had proposed an experiment of
getting smaller. Chemicals have been getting more complex. small entity named Maxwell‟s Demon capable of handling
Biochemists have learned more about how to study and person molecules[18].
control the molecular basis of organisms. Mechanical Richard Adolf Zsigmondy was the very first to use
engineering has been getting more precise. nanometer for characterizing particle size in 1914. He
determined it as 1/10,00,000 of millimeter from which he
General Terms created the very first technique classification based on particle
Nanodevices, nanoparticles. size in the nanometer range[19].
Moore‟s Law [20-22] had finest codified the notion of
Keywords the influences. Gordon Moore predicted on Intel in 1965
Nanomolecules, carbon nanorods, AFM, SEM, XRD. around how modern day circuitry would pack far more
characteristics as far more devices had been made for the
1. INTRODUCTION market place. This law has held sturdy for practically 50
With the development of human society, the environmental years. Moore‟s law also predicts(as shown in fig 1) that by
pollution and energy waste have been increasingly serious. about 2020, we must be working at the molecular level to stay
Therefore exploring its solution mechanism and to seek new competitive. Molecular nanotechnology is the likeliest
sources of energy have been one of the crucial events that candidate for providing this ultimate precision in
numerous scientists focus on [1]. The nanotechnology & manufacturing [23].
nanomaterials are the answer to this problem due to their
unique properties.
Nanotechnology is the branch of science that deals
with the particles of size≈10-9m. It is manipulation of matter
on an atomic or molecular scale. Nanotechnology is a broad
field including fields of science as diverse as
surface science, organic chemistry, molecular
biology, semiconductor physics, micro
fabrication etc. It has wide applications in
medicine, electronics, biomaterials & energy
production etc.
Due to their unique physical & chemical properties
such as cheap, harmless, high photosensitivity and stability
[2,3] nanomaterials have attracted more and more attention in
the material science. Their applications in gas sensor[4],
photocatalyst [5],solar cells[6,7], ultraviolet light emitting
materials[8], field effect transistors[9] and transparent
conductors[10-12] are commendable. Moreover,
nanostructures also exhibit fascinating morphologies such as
nanorods[13],nanotubes[14],nanowires[15], hierarchical Fig.1. Moore‟s Law
nanobranches[16] and nanocastles[17].

228
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The notion of constructing machines in microscopic sizes and
producing them function like construction bots for generating,
organizing and rearranging objects at molecular level is not
effortless to think when there was no such technology present.
This notion was put forward by Richard Feynman in 1959[24]
in his speech „There‟s A lot of Area at the Bottom‟. It was an
invention to enter a new field of Physics. This transcript of the
classic talk that Richard Feynman gave on December 29, 1959
at the annual meeting of the American Physical Society at the
California Institute of Technology (Caltech) was first
published[24]. Feynman had described a process which had
the ability of manipulating individual atoms and molecules
which might be developed, using one set of precise tools to
build and operate another proportionally smaller set, so on
down to the needed scale. In the course of this, he noted,
scaling issues would arise from the changing magnitude of
various physical phenomena: gravity would become less
important, surface tension and Van der Waals attraction
would become more important [25].
In the late 1970's, Eric Drexler began to invent what
would become molecular manufacturing. He quickly realized
that molecular machines could control the chemical
manufacture of complex products, including additional
manufacturing systems-which would be a very powerful
technology[26].
The Japanese scientist Norio Taniguchi of the Tokyo
University of Science used the term "nano-technology" in a
1974 conference, to describe semiconductor processes such as
thin film deposition and ion beam milling exhibiting
characteristic control on the order of a nanometer. His
definition was, “'Nano-technology' mainly consists of the
processing of, separation, consolidation, and deformation of
materials by one atom or one molecule"[27-28].
In 1980, Drexler encountered Feynman's provocative
1959 talk "There's Plenty of Room at the Bottom" while
preparing his initial scientific paper on the subject,
“Molecular Engineering: An approach to the development of
general capabilities for molecular manipulation,” published in
the Proceedings of the National Academy of Sciences in
1981[25]. In this paper he advanced the proposal that the
molecular machinery found in living systems demonstrates
the feasibility of doing advanced molecular engineering to
produce complex, artificial molecular machines.
The invention of the scanning tunneling microscope in
1981 provided unprecedented visualization of individual
atoms and bonds, and was successfully used to manipulate
individual atoms in 1989. The microscope's developers Gerd
Binnig and Heinrich Rohrer at IBM Zurich Research
Laboratory received a Nobel Prize in Physics in 1986[29-30].
The term "nanotechnology" (which paralleled
Taniguchi's "nano-technology") was independently applied by
Drexler in his 1986 book Engines of Creation: The Coming
229
ISBN: 978-81-924893-0-8
Era of Nanotechnology, which proposed the idea of a
nanoscale "assembler" which would be able to build a copy of
itself and of other items of arbitrary complexity. He also first
published the term "grey goo" to describe what might happen
if a hypothetical self-replicating machine, capable of
independent operation, were constructed and released.
Drexler's vision of nanotechnology is often called "Molecular
Nanotechnology" (MNT) or "molecular manufacturing."
Christoph Gerber invented the first atomic force
microscope(AFM) in 1986. The first commercially available
atomic force microscope was introduced in 1989.The AFM is
one of the foremost tools for imaging, measuring and
manipulating matter at nanoscale. The information is gathered
by “feeling” the surface with a mechanical probe.
Piezoelectric elements that facilitate tiny but accurate and
precise movements on (electronic) command, enable the very
precise scanning. In some variations, electric potentials can
also be scanned using conducting cantilevers.
A document from Japan's Ministry of International
Trade and Industry, "Suggested Investigations in the Human
Frontier Science Program" (November 1987) suggests a
serious interest in studying and developing molecular
machines. It calls for "prediction of tertiary protein structures.
. . to predict the functional change due to the structural
modification," "investigations of the functions of movement at
the molecular level, molecular assembly level, and tissue
level," and "development of artificial molecular assembly
technique based on the mechanism of biomolecules." It notes
that "techniques to control the shapes and the structures of
biomaterials of the functional molecular aggregates, and the
techniques to synthesize these materials by controlling one-,
two- and three-dimensional molecular arrangements are
highly required." While mixed in with many other goals, the
understanding, design, and synthesis of molecular machines
stands out as a major theme of the Human Frontier Science
Program. The Institute (a news supplement to the IEEE
Spectrum) reports that a delegation from Japan's Ministry of
International Trade and Industry (MITI) visited Washington
in spring 1986 to discuss the Human Frontier Science
Program.
IBM researcher Don Eigler was the first to manipulate
atoms using a scanning tunneling microscope in 1989. He
used 35 Xenon atoms to spell out the IBM logo[31]. He
shared the 2010 Kavli Prize in Nanoscience for this work[32].
The discovery of carbon nanotubes( as shown in fig 2 )is
largely attributed to Sumio Iijima of NEC (Nippon Electric
Company) in 1991, although carbon nanotubes have been
produced and observed under a variety of conditions prior to
1991[33]. Iijima's discovery of multi-walled carbon nanotubes
in the insoluble material of arc-burned graphite rods in
1991[34] and Mintmire, Dunlap, and White's independent
prediction showed that if single-walled carbon nanotubes
could be made, then it would exhibit remarkable conducting
properties[35]. Nanotube research accelerated greatly
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
following the independent discoveries by Bethune at IBM[36-
38] and Iijima at NEC[33] of single-walled carbon nanotubes
and methods to specifically produce them by adding
transition-metal catalysts to the carbon in an arc discharge.
Fig. 2. Carbon Nanotubes
First industry analysis of military applications,
“Revolution in Military Affairs”, a document published in
June of 1995 by Hughes Aircraft Company, foresees a
“revolution” in military technology that nanotechnology could
account for. Feynman Prize in Nanotechnology was also
awardedin1995 for synthesis of complex three-dimensional
structures with DNA molecules.
In 1996,Feynman Grand Prize of $250,000 was announced
& First European conference was held. NASA also began to
work in computational nanotech & first nano-bio conference
held in the same year.
In 1997, first company named: Zyvex in the field of
nanotechnology was founded&First design of nanorobotic
system was developed. Also, Feynman Prize in
Nanotechnology was awarded for work in computational
nanotechnology and using scanning probe microscopes to
manipulate molecules.
In 1998,First NSF(National Science Foundation) forum,
held in conjunction with Foresight Conference & first DNA-
based nano-mechanical device was invented. In the
conference, “Laser Assisted Deposition of Bacteriorhodhopsin
Assemblies” was done & “Simulation and Experiments on
Friction and Wear of Diamond: A material of MEMS and
NEMS applications” was performed[39] and studies of
fullerens and carbon nanotubes by an extended bond order
potential was done. Feynman Prize in Nanotechnology was
awarded for computational modeling of molecular tools for
atomically-precise chemical reactions and for building
molecular structures through the use of self-organization.
In 1999,First Nano-medicine book was published & first
safety guidelines were given. Congressional hearings on
proposed National Nanotechnology Initiative was held &
Feynman Prize in Nanotechnology was awarded for
development of carbon nanotubes for potential computing
230
ISBN: 978-81-924893-0-8
device applications and for modeling the operation of
molecular machine designs in same year.
In 2001,first report on nanotech industry was made. In this
report, nanotechnology promised world peace, pre-
programmable drug delivery robots swimming inside
bloodstream embattling cancer, the creation of pollution-free
energy systems, and eternal life. It was the cornucopia of
material science, engineering, physics, chemistry and biology.
U.S. announced first center for military applications in the
same year. Theory of nanometer-scale electronic devices was
discussed and synthesis and characterization of carbon
nanotubes and nanowires was carried out in in the same year.
In 2002,first nanotech industry conference held
&regional nanotech efforts got multiplied. This was a
comprehensive event, which was sponsored by ICS in 2002
when the word “nanotechnology” was still unknown, by
Takahiro Matsui, then General Manager of Exposition
Department at ICS (now General officer), “nano tech 2002”
attracted more than 10,000 researchers and engineers from
various fields. A questionnaire survey conducted then not
only helped to grasp the latest information on research and
development but also highlighted the trend toward practical
use. This proved to be valuable reference for formulating the
road map in the industry and attracted not only domestic but
also global interest. Also in the same year, DNA was used to
enable the self-assembly of new structures and advanced our
ability to model molecular machine systems[40].
In 2003,There were Congressional hearings on
societal implications & Call for balancing NNI research
portfolio was made. Drexler/Smalley debate was published in
Chemical & Engineering News. Richard Smalley, a co-
discoverer of the fullerenes, was involved in a public debate
with Eric Drexler about the feasibility of molecular
assemblers. Feynman Prize in Nanotechnology was awarded
for modeling the molecular and electronic structures of new
materials and for integrating single molecule biological
motors with nano-scale silicon devices[40].
In 2004,first policy conference on advanced nanotech
was held & in this conference, recent progress in designing
novel protein structures and protein-protein interactions was
discussed by David Baker and focus was made on the
computational design and experimental characterization of
TOP7, a novel hyper-stable protein, which opened new
avenues for nano-sacle engineering & study on current nano-
medicine was made which focused on targeted nano-particles
and self-assembled nanostructures. It was expected that in 10-
20 years, the methods of massively-parallel molecular
manufacturing would allow the construction of complex
diamondoid medical nanorobots. These nanorobots would be
used to maintain tissue oxygenation in the absence of
respiration, repair and recondition the human vascular tree
eliminating heart disease and stroke damage, and instantly
staunch bleeding after traumatic injury. Other medical
nanoroboits would eliminate microbial infections and cancer,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

and even replace chromosomes in individual cells thus method using metal acetylacetonates of Zn and V and
reversing the effects of genetic disease and other accumulated poly(vinyl alcohol) as precursors were reported [46] as shown
damage to our genes. First center for nano-mechanical in fig. 4.
systems was also formed in 2004. Feynman Prize in
Nanotechnology was awarded for designing stable protein
structures and for constructing a novel enzyme with an altered
function in the same year.

In 2004, single-crystal ZnO nano-wires were

synthesized (as shown in fig 3) using a vapor trapping
chemical vapor deposition method and configured as field-
effect transistors. Electrical transport studies showed n-type
semiconducting behavior with a carrier concentration of ~107
cm-1and an electron mobility of ~17 cm2 / Vs[42].

Fig.4. SEM micrographs of nanocrystalline V-doped ZnO

powders calcined in air at 600 C for 1 h: (a) Zn0.95V0.05O,
(b) Zn0.90V0.10O and (c) Zn0.85V0.15O

In 2008,Technology Roadmap for Productive Nanosystems

was released & Protein catalysts were designed for non-
natural chemical reactions. The work in molecular electronics
and the synthesis of molecular motors and nanocars was
carried out and theoretical contributions to nanofabrication
Fig.3. ZnO Nanotubes
and sensing were generated[47].

In 2005, at Nanoethics meeting, Roco announced

nanomachine /nanosystem project count reached 300 & Dr.
Christain Joachim designed a wide variety of single molecular
functional nanomachines and synthesized macromolecules of
intermediate sizes with designed shapes and functions[43].
In 2006,National Academies nanotechnology report
called for experimentation toward molecular manufacturing &
Dr. Erik Winfree and Dr. Paul W.K. Rothemund worked in
molecular computation and algorithmic self-assembly, and
produced complex two-dimensional arrays of DNA
nanostructures[44].
In 2007, molecular machine systems that function in the
realm of Brownian motion, and molecular machines based
upon two-state mechanically interlocked compounds were
constructed. A molecular switch is a molecule that can be
reversibly shifted between two or more stable states. The
molecule may be shifted between the states in response to
environmental stimuli, such as changes in pH, light,
temperature, an electric current, microenvironment, or in the
presence of a ligand. Currently, synthetic molecular switches
are of interest in the field of nanotechnology for application in
molecular computers[45].
In 2007, the synthesis and optical properties of
nanocrystalline powders of V-doped ZnO (i.e. Zn0.95V0.05O,
Zn0.90V0.10O, and Zn0.85V0.15O) by a simple sol–gel
In 2009, an improved walking DNA
nanorobot was formed. Structural DNA nanotechnology
arrays were deviced to capture molecular building blocks &
design 'from scratch' of a small protein was obtained that
performed the function performed by natural globin proteins.
Functional components were organized on addressable DNA
scaffolds. The experimental demonstrations of mechano-
synthesis were made using AFM to manipulate single atoms,
and for computational analysis of molecular tools to build
complex molecular structures[48].
In 2010,DNA-based 'robotic' assembly began &
the work in single atom manipulations and atomic switches,
and for development of quantum mechanical methods for
theoretical predictions of molecules and solids was carried out
by Gustavo E. Scuseria[49].
In 2011, first programmable nanowire circuits for
nanoprocessors were invented. A nanoprocessor constructed
from intrinsically nanometer-scale building blocks is an
essential component for controlling memory, nanosensors
and other functions proposed for nanosystems assembled from
the bottom up[50-52]. DNA molecular robots learnt to walk in
any direction along a branched track[53] & mechanical
manipulation of silicon dimers on a silicon surface were
made[54].

231
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
In 2012,undoped and Mg-doped ZnO thin films were
deposited on Si(1 0 0) (as shown in fig 5) (and quartz
substrates by the sol–gel method. The thin films were
annealed at 873 K for 60 min[55].
Fig.5.XRD spectra of Mg-doped ZnO thin films annealed at
873 K for 60 m.
In 2013, Copper-doped ZnO nanoparticles had been prepared
by the precipitation method. The dopant contents in the
samples were 0.24, 0.35 and 1.07 at.%. A set of techniques
including XRD, XPS, TG – DTA, EPR and BET analysis had
been applied to characterize Cu-doped ZnO samples. The
results showed that the crystallite sizes of ZnO and Cu-doped
ZnO nanoparticles were within the range of 45 - 49 nm[56].
In 2014, A carbon nanotube sponge capable of soaking up
water contaminants, such as fertilizers, pesticides and
pharmaceuticals, more than three times more efficiently than
previous efforts has been presented in a new study[57]. So,
the nanotechnology is also beneficial to the field of
agriculture also. Also, solar energy has long been used as a
clean alternative to fossil fuels such as coal and oil, but it
could only be harnessed during the day when the sun's rays
were strongest. In 2014, researchers led by Tom Meyer at the
Energy Frontier Research Center at the University of North
Carolina at Chapel Hill have built a system (as shown in fig
6)that converts the sun's energy not into electricity but
hydrogen fuel and stores it for later use, allowing us to power
our devices long after the sun goes down.
Fig. 6. Solar nano device
232
ISBN: 978-81-924893-0-8
Tom Meyer at the Energy Frontier Research Center at the
University of North Carolina at Chapel Hill built a device that
converts the sun‟s energy not into electricity but hydrogen
fuel and stores it for later use as shown in fig. The device, a
dye-sensitized photoelectrosynthesis cell generates hydrogen
fuel by using the sun‟s energy to split water into its
component parts. After the split, hydrogen is sequestered and
stored, while the byproduct, oxygen, is released into the
air[58].
Also recently, North Carolina State University
researchers have used silver nanowires to develop wearable,
multifunctional sensors that could be used in biomedical,
military or athletic applications, including new prosthetics,
robotic systems and flexible touch panels. The sensors (as
shown in fig 7) can measure strain, pressure, human touch and
bioelectronic signals such as electrocardiograms[59].
Fig. 7.
3. CONCLUSION
The early 2000s saw the beginnings of the use of
nanotechnology in commercial products, although most
applications are limited to the bulk use of passive
nanomaterials. Examples include titanium dioxide and zinc
oxide nanoparticles in sunscreen, cosmetics and some food
products; silver nanoparticles in food packaging, clothing,
disinfectants and household appliances such as Silver Nano;
carbon nanotubes for stain-resistant textiles; and cerium oxide
as a fuel catalyst.As of March 10, 2011, the Project on
Emerging Nanotechnologies estimated that over 1300
manufacturer-identified nanotech products are publicly
available, with new ones hitting the market at a pace of 3–4
per week.
REFERENCES
[1] HAN S T, XI H L, SHI R X, FU X Z, WANG X X.
Prospect and Progress in the Semiconductor Photocatalysis
[J]. Chemical Physics, 2003, 16:339-349.
[2] YIN J, LIU Z G, LIU H, WANG X S, ZHU T, LIU J
M.The epitaxial growth of wurtziteZnO films on LiNbO3 185
(0001) substrates[J]. Journal of Crystal Growth, 2000,
220:281-285.
[3] LEE G H, YAMAMOTO Y, KOUROGI M, OHTSU
M.Blue shift in room temperature photoluminescence from
photo-chemical vapor deposited ZnOfilms[J]. Thin Solid
Films, 2001, 386:117-120.
[4] T. Gao, T.H. Wang, Appl. Phys. A 80 (2005) 1451.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[5] S. Anandan, A. Vinu, T. Mori, N. Gokulakrishnan, P.
Srinivasu, V. Murugesan, K. Ariga, Catal.Commun.8 (2007)
1377.
[6] X.L. Chen, B.H. Xu, J.M. Xue, Y. Zhao, C.C. Wei, J. Sun,
Y. Wang, X.D. Zhang, X.H. Geng, Thin Solid Films 515
(2007) 3753.
[7] H. Chen, A.D. Pasquier, G. Saraf, J. Zhong, Y. Lu,
Semicond. Sci. Technol. 23 (2008)045004
[8] Y.R. Ryu, J.A. Lubguban, T.S. Lee, H.W. White, T.S.
Jeong, C.J. Youn, B.J. Kim, Appl. Phys. Lett. 90 (2007)
131115.
[9] Z.X. Xu, V.A.L. Roy, P. Stalling, M. Muccini, S.
Toffanin, H.F. Xiang, C.M. Che, Appl.Phys. Lett. 90 (2007)
223509.
[10] I. Kim, K.S. Lee, T.S. Lee, J.H. Jeong, B.K. Cheong, Y.J.
Baik, W.M. Kim, J. Appl. Phys.100 (2006) 063701.
[11] K.M. Lin, P. Tsai, Thin Solid Films 515 (2007) 8601.
[12] M. Lv, X. Xiu, Z. Pang, Y. Dai, L. Ye, C. Cheng, S. Han,
Thin Solid Films 16 (2008)2017.
[13] C. Yan, D. Xue, J. Phys. Chem. B 110 (2006) 25850.
[14] C. Yan, D. Xue, Electrochem. Commun.9 (2007) 1247.
[15] B. Wen, Y. Huang, J.J. Boland, J. Phys. Chem. C 112
(2008) 106.
[16] T. Zhang, W. Dong, R.N. Njabon, V.K. Varadan, Z.
Ryan Tian, J. Phys. Chem. C 111 (2007) 13691.
[17] X. Wang, J. Song, Z.L. Wang, Chem. Phys. Lett. 424
(2006) 86.
[18] Cargill Gilston Knott (1911). "Quote from undated letter
from Maxwell to Tait". Life and Scientific Work of Peter
Guthrie Tait. Cambridge University Press. p. 215.
[19] Richard Zsigmondy, Jerome Alexander (1914). “
Colloids & ultramicroscope : A manual of Colloid Chemistry
And Ultramicroscopy”.
[20] Moore, Gordon E. (1969). “ Cramming more components
onto integrated circuits” Electronic Magazine. p. 4. Retrived
2006-11-11.
[21] “ Excerpts from A Conversation with Gordon Moore :
Moore‟s law”. Intel corporation. 2005.P.1. Retrived 2013-09-
12.
[22] “ 1965-“ Moore‟s law” predicts the future of integrated
Circuits”. Computer history Museum. 2007.Retrived 2009-03-
19.
[23] 1.J. Markoff, “ Has Size of Chips Reached its Limits?”,
San Jose Mercury News, Oct.9, 1999 .
[24] Caltech Engineering and Science, Volume 23:5, February
1960, pp 22-36.
[25] Gribbin, John; Gribbin, Mary (1997). Richard Feynman:
A Life in Science. Dutton.p. 170.ISBN 0-452-27631-4.
[26] Drexler, K. Eric. Molecular Machinery and
Manufacturing with Applications to Computation (Ph.D.
thesis). Massachusetts Institute of Technology.
[27] Kazlev, M. Alan (24 May 2003). "History of
Nanotechnology".Retrieved 12 May 2011.
[28] Taniguchi, Norio (1974). "On the Basic Concept of
'Nano-Technology'".Proceedings of the International
Conference on Production Engineering, Tokyo, 1974, Part II
(Japan Society of Precision Engineering).
[29] Binnig, G.; Rohrer, H. (1986). "Scanning tunneling
microscopy".IBM Journal of Research and Development 30:
4.
[30] "Press Release: the 1986 Nobel Prize in Physics". Nobel
prize.org. 15 October 1986. Retrieved 12 May 2011.
[31] Shankland, Stephen (28 September 2009). "IBM's 35
atoms and the rise of nanotech".CNET.Retrieved 12 May
2011.
233
ISBN: 978-81-924893-0-8
[32] "The Kavli Prize Laureates 2010". The Norwegian
Academy of Science and Letters.Retrieved 13 May 2011.
[33] Monthioux, Marc; Kuznetsov, V (2006). "Who should be
given the credit for the discovery of carbon
nanotubes?"(PDF). Carbon44 (9): 1621.
doi:10.1016/j.carbon.2006.03.019.
[34] Iijima, Sumio (7 November 1991). "Helical microtubules
of graphitic carbon".Nature354 (6348): 56–58.
Bibcode:1991Natur.354...56I. doi:10.1038/354056a0.
[35] Mintmire, J.W.; Dunlap, BI; White, CT (1992). "Are
Fullerene Tubules Metallic?".Physical Review Letters68 (5):
631–634. Bibcode:1992PhRvL..68..631M.
doi:10.1103/PhysRevLett.68.631. PMID 10045950.
[36] Bethune, D. S.; Klang, C. H.; De Vries, M. S.; Gorman,
G.; Savoy, R.; Vazquez, J.; Beyers, R. (1993). "Cobalt-
catalyzed growth of carbon nanotubes with single-atomic-
layer walls".Nature363 (6430): 605–607.
Bibcode:1993Natur.363..605B. doi:10.1038/363605a0.
[37] Iijima, Sumio; Ichihashi, Toshinari (1993). "Single-shell
carbon nanotubes of 1-nm diameter".Nature363 (6430): 603–
605. Bibcode:1993Natur.363..603I. doi:10.1038/363603a0.
[38] "The Discovery of Single-Wall Carbon Nanotubes at
IBM". IBM.
[39] X Li, B Bhushan, K Takashima, CW Baek, YK Kim -
Ultramicroscopy, 2003 – Elsevier
[40] Ming Zheng, Anand Jagota, Ellen D. Semke, Bruce A.
Diner, Robert S. Mclean, Steve R. Lustig, Raymond E.
Richardson & Nancy G. Tassi, Nature Materials 2, 338-
342(2003),6 April 2003| doi:10.1038/nmat877.
[41] Chen Jianrong, Miao Yuqing, , He Nongyue, Wu
Xiaohua, Li Sijiao, “Biotechnology Advances” Volume 22,
Issue 7, September 2004, Pages 505–518, doi:10.1016.
[42] Quanchang Li , Vageesh Kumar , Yan Li , Haitao Zhang
, Tobin J. Marks , and Robert P. H. Chang , “Fabrication of
ZnONanorods and Nanotubes in Aqueous Solutions”, Chem.
Mater., 2005, 17 (5), pp 1001–1006.
[43] Leonhard Grill , Karl-Heinz Rieder, Francesca
Moresco, Gorka Jimenez-Bueno, Cheng Wang, Gwénaël
Rapenne, Christian Joachim, “Imaging of a molecular
wheelbarrow by scanning tunneling microscopy”, Volume
584, Issues 2–3, 20 June 2005, Pages L153–L158.
[44] Hareem T. Maune, Si-ping Han, Robert D. Barish, Marc
Bockrath, William A. Goddard III, Paul W. K. Rothemund &
Erik Winfree , “Self-assembly of carbon nanotubes into two-
dimensional geometries using DNA origami templates”,
Nature Nanotechnology 5, 61 - 66 (2010) , 8 November 2009
| doi:10.1038/nnano.2009.311.
[45] Molecular Machines & Motors ( Structure and Bonding)
J.P. Sauvage Ed. ISBN 3-540-41382-0.
[46] Santi Maensiri ,Chivalrat Masingboon , Vinich Promarak
, Supapan Seraphin, “Synthesis and optical properties of
nanocrystalline V-doped ZnO powders”, Optical Materials 29
(2007) 1700–1705.
[47] Dreyfus, R.; Baudry, J.; Roper, M. L.; Fermigier, M.;
Stone, H. A.; Bibette, J., Microscopic artificial swimmers.
Nature 2005, 437, 862-5.
[48] Robert A. Freitas Jr., “Meeting the Challenge of Building
Diamondoid Medical Nanorobots,” Intl. J. Robotics Res.
28(April 2009):548-557.(DOI: 10.1177/0278364908100501).
[49] Gustavo E. Scuseria, Rice University, “ quantum
mechanical methods and computational programs”, Foresight
Nanotech Institute. 20 December 2010. Retrieved 10
April 2011.
[50] Lu, W. & Lieber, C. M. Nanoelectronics from the bottom
up. Nature Mater. 6, 841-850(2007).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[51] Lu, W., Xie, P. & Lieber, C. M. Nanowire transistor
performance limits and applications. IEEE Trans. Electron.
Dev. 55, 2859-2876(2008).
[52] Das, S. et al. Designs for ultra-tiny, special-purpose
nanoelectronic circuits. IEEE Trans. Circuits Syst. Regul. Pap.
54, 2528-2540(2007).
[53] Richard A. Muscat, Jonathan Bath, and Andrew J.
Turberfield, “ A Programmable Molecular Robot”, Calerndon
Laboratory, Department of Physics, University of Oxford,
Parks Road, Oxford OX13PU, U.K. Nano Lett., 2011, 11(3),
pp 982-987.
[54] A. Sweetman, S. Jarvis, R. Danza, J. Bamidele, L.
Kantorovich, and P. Moriarty, “ Manipulating Si(100) at 5 K
using qPlus frequency modulated atomic force microscopy:
Role of defects and dynamics in the mechanical switching of
atoms”, Phys. Rev. B 84, 085426- Published 25 August, 2011.
234
ISBN: 978-81-924893-0-8
[55] Kai Huanga, Zhen Tanga, Li Zhanga, JiangyinYua,
JianguoLvb, XiansongLiuc, FengLiud, “Preparation and
characterization of Mg-doped ZnO thin films by sol–gel
method”, Applied Surface Science 258 (2012) 3710– 3713.
[56] K. Milenova , I. Stambolova , V. Blaskov, A. Eliyas , S.
Vassilev , M. Shipochka, “THE EFFECT OF
INTRODUCING COPPER DOPANT ON THE
PHOTOCATALYTIC ACTIVITY OF ZnO
NANOPARTICLES”, Journal of Chemical Technology and
Metallurgy, 48, 3, 2013, p-259-264.
[57] Qingyu Peng, Yibin Li, Xiaodong He, Xuchun
Gui, Yuanyuan Shang, Chunhui Wang, Chao Wang, Wenqi
Zhao, Shanyi Du, Enzheng Shi, Peixu Li,Dehai Wu and
Anyuan Cao, “Graphene Nanoribbon Aerogels Unzipped
from Carbon Nanotube Sponges”, Advanced Materials, s
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Review of Segmentation of Thyroid gland in Ultrasound
image using neural network
Mandeep Kaur
M.TECH (ECE) Student
BGIET, Sangrur
manibhangu1991@gmail.com
ABSTARCT
The thyroid gland is highly vascular organ and it lies in the
interior part of the neck just below the thyroid cartilage.In
medical organization,there are many ways to detect the affected
interior part of the thyroid gland like CT/MRI and ultrasound
imaging.But CT/MRI are expensive techniques as compare to
US images.But US images are blurred and consist of noise.In the
existing method,to segment the thyroid gland in US images feed
forward neural network techniques can be uesd.In the proposed
method,we can improve the US images a new technique will be
used.
KEYWORDS
Feed Forward Neural Network, Feature Extraction, Image
Processing,Thyroid Segmentation,Ultrasound images.
1. INTRODUCTION
Digital Image Processing is a wide area which includes large
number of sub-areas further but fundamentally it is a single
block in which image or a video is an input and output is either
an image or video or set of parameters associated with an image.
It is vastly used in medical imaging processing which helps
radiologists for diagnosis of problem which manually consumes
lot of time ,so it saves time &comparatively less
laborious.[1]Medical Imaging Analysis plays important role to
detect different kinds of human diseases.[2]With technology
advancements ,computerized diagnosis becomes an active
research area and provides an accurate judgements.Basic
Principle of computerized diagnosis is an image processing
which includes image acquisition,image pre-processing,image
segmentation etc according to requirements.
If there should arise an occurrence of medicinal picture
transforming different methods are there to diagnose the human
body like CT Scans,MRI, X-beams, OCT, US and so on. US
(Ultrasound) is the most broadly utilized tool[3] on the grounds
that it has number of focal points over different systems like
non-obtrusiveness, minimal effort, and short obtaining
times[1].Also, Ultrasound Images have the capacity to give
prompt data and different vital attributes & they doesn't includes
ionizing radiations.[4]But Ultrasound pictures contain dot
clamor notwithstanding grain noise.[1]Noise is the consequence
of blunders which can corrupt the nature of an image.In request
to improve the nature of picture or to make the picture
commotion free picture upgrade is necessary.Various separating
235
ISBN: 978-81-924893-0-8
Deepinder Singh
Assistant Professor
BGIET, Sangrur
wadhwadeepinder@gmail.com
routines are there to upgrade the picture like AWM (Adaptive
Weighted Median Filter)[1] ,anisotropic dispersion model[5] and
so forth.
Thyroid Gland is a butterfly molded organ & comprises of two
cone lobes.It fits in with the endocrine framework & found in
the neck simply front of the larynx.It serves to control the
emission of the thyroid hormone which directs the human body
temperature furthermore significantly influences the youth
intelligence,growth and also grown-up metabolism.[6]The
undesirable development of cells on the thyroid structures a
mass of tissue called as thyroid nodules.[7] Nodules are only a
disorders.Out of which the vast majority of the thyroid knobs are
kindhearted & some may cause growth or malignant.We can
likewise say that thyroid knobs are robust or cystic bumps
framed in the thyroid organ which may get brought about
because of different sorts of thyroid disorders.[3]The danger of
building up a substantial thyroid knob in a lifetime goes between
5% & 10% while half of individuals with single nodules.[4]
Figure 1.Thyroid Gland [14]
Picture division is the procedure of parceling a computerized
picture into numerous fragments or sets of pixels otherwise
called super pixels.[8] It is utilized for finding the articles and
limits in pictures like lines, bends, and so forth. Motivation
behind division is to adjust the picture representation into the
structure which is more important & simple to examine.
Resultant division picture incorporates set of fragments that can
conceal the complete picture all in all, or we can say that it is a
situated of forms (sketching out) taken out from the picture.
When it is connected to countless like if there should arise an
occurrence of restorative imaging, after division of a picture the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
subsequent shapes (blueprints) can get used to create 3D
reproductions by utilizing obliged calculations. Pixels are
comparable in connection of a few properties like power,
shading, surface etc& neighboring districts are altogether
diverse regarding the same characteristics.[8]
Image segmentation is applicable in various areas like:-
 Machine Vision
 Medical Imaging for locating tumors and other
pathologies, Surgery planning, Measure tissue
volumes, Diagnosis, study of anatomical structure etc.
 Object Detection such as face detection & locate
objects in satellite images (roads, forests, crops, etc.)
 Recognition Tasks such as Face recognition,
Fingerprint recognition, iris recognition etc.
 Traffic Control Systems.
Various Image segmentation methods are given as follows:-
 Thresholding
 Clustering methods
 Compression based methods
 Histogram based methods
 Edge Detection
 Optimization Algorithms
 Region growing methods & Graph portioning
methods.
A counterfeit neural system is a gathering of interconnected
hubs like the immense system of neurons in a cerebrum. Every
roundabout hub speaks to a manufactured neuron and a bolt
speaks to an association from the yield of one neuron to the data
of an alternate neuron as demonstrated below.[9]Basically
neural system has three layers i.e. data layer, concealed layer &
yield layer. These layers speak with each other more than an
expansive number of weighted associations
Figure 2 Neural Networks [15]
In machine learning, fake neural systems (ANNs) are a group of
factual learning calculations inspired by organic neural systems
(Central sensory systems like mind) & used to gauge the
capacities that can rely on upon countless and are by and large
unknown[9]. By and large, they are introduced as interconnected
neurons to figure values from inputs & fulfilled of machine
adapting and example distinguishment.
There is no single formal meaning of manufactured neural
system. However, a class of factual models might regularly be
called "Neural" in the event that they comprise of sets of
versatile weights & are fit for assessing non-direct capacities.
Versatile weights are association qualities between neurons,
which get actuated amid forecast and in addition preparing
stage.
236
ISBN: 978-81-924893-0-8
Typically neural network is defined by following three
parameters:-
1. Interconnection pattern between the different neuron
layers.
2. Learning process to update the weights of the
interconnection.
3. Activation function to convert weighted input of
neuron into an output.
Neural Network includes following applications:-
 Function approximation or Regression analysis (time
series prediction & modeling)
 Classification (pattern recognition, sequence
recognition)
 Data processing (filtering, clustering)
 Robotics (directing manipulators)
 Control (vehicle control, process control, natural
resources management)
 Decision making
 Financial applications like automated trading systems
etc.[9]
Common types of Neural Network:-
 FFNN(Feed Forward Neural Network)
 FBNN (Feedback Neural Network)
2. RELATED WORK
In this part writing overview identified with past work and
methodologies about thyroid division of ultrasound pictures is
introduced. Different systems are there to diagnose the human
body like CT Scans,MRI, X-beams, OCT, US and so forth .in
the event of division the majority of the work is performed on
ultrasound (US) pictures due to its favorable circumstances like
non-intrusiveness, minimal effort, short securing times,
capability to give quick information &they does not includes
ionizing radiations.
In our writing review we have considered numerous exploration
approaches. Our point is to study and break down the gimmick
extraction, characterization & division approaches for
fragmenting the thyroid organ to watch the outcomes.
Garg H.& Jindal A.[1] displayed a paper in which Feed-Forward
Neural Network for division of thyroid organ ultrasound pictures
has been talked about. With the end goal of division of US
pictures, power of pixels and surface is taken as criteria and it is
a crossover methodology. First and foremost they have done
picture upgrade so as to uproot the spot clamor. A short time
later different obliged gimmicks get removed to gauge the
surface & to prepare the neural system. At that point creators
actualized Feed-Forward Neural Network for power based
grouping and their trial results demonstrate that neural system
gives better results.
Chang CY. et al. [6]presented a paper in which thyroid organ
division & volume estimation of thyroid has been presented.
Firstly, Image Pre-preparing has been carried out to make the
picture commotion stifled and peculiarities get extricated to
prepare the neural system. At that point, Radial Basis Function
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
(RBF) Neural Network has been connected to group the squares
whether it is thyroid or non-thyroid organ territory. To
recuperate the precise state of thyroid organ area, creator
connected the district developing strategy. With the end goal of
volume estimation of thyroid organ, they connected Particle
Swarm Optimization (PSO) calculation. They contrasted
Volume Estimation of Proposed Method and different strategies
like standard GA.
Gopinath B. & Gupta B.R.[7] introduced a paper which includes
the division and grouping of Papillary carcinoma & Medullary
carcinoma cells in FNAB (Fine Needle Aspiration Biopsy)
infinitesimal cytological pictures of thyroid knobs. They have
utilized numerical morphology for picture division so as to expel
the foundation recoloring data from infinitesimal pictures. At
that point, Feature Extraction is carried out by Discrete Wavelet
Transform (DWT) and Gray Level Co-event Matrix
(GLCM).For arrangement they have utilized k-Nearest Neighbor
(kNN) classifier. Analytic exactness reported by the DWT &
GLCM is 97.5% and 75.84% individually. Creators executed
Majority voting guideline to enhance the symptomatic exactness
of GLCM by 90%.
Savelonas M.A. et al.[4] proposed a novel Active Contour
Model for exact outline of thyroid knobs of assorted shapes on
the premise of their composition & reverberation -genicity in
ultrasound pictures. Proposed model is named as JET (Joint
Echogenicity Texture) which incorporates provincial picture
force & factual surface gimmick conveyances or LBP
disseminations by using Mumford-Shah utilitarian otherwise
called negligible parcel issue. Chan-Vese Model additionally
utilized as a part of definition of JET model so as to keep up the
power data. Creator executed JET for dividing the US pictures
containing hypoechoic, hyperechoic and isoechoic knobs.
Outline Performance of JET is equivalent to VBAC model
(Variable Background Active Contour) furthermore develops its
ability from depiction of hypoechoic to isoechoic knobs
furthermore adapts to the impediments of cross breed multiscale
model. Downside of proposed model is that it is not generally
ready to separate structures like greater veins from real knobs.
Helme A. et al.[10]proposed an application called thermography
which non-obtrusively judgment the thyroid organ malady. In
light of non-intrusive framework, a PC based model gadget was
outlined which can recognize & show the relative varieties of
skin temperature & can diagnose the hyperactivity inside the
thyroid organ. They likewise exhibited a FEA (Finite Element
Analysis) of thyroid knob to assess the temperature circulation
in mix with model and to focus the obliged sensor
determination. They have utilized Non-contact IR (infrared)
thermocouple sensors & Data Acquisition (DAQ) framework
which is tactile 518 card having 16 bit determination. Recreation
results anticipated that a thermocouple temperature
determination of 0.1 ᵒC would be sufficient for tackling the
issue. Downsides of the framework are that it includes
variability in sensor skin separation, restricted determination &
optical covering in center arrangement. Future degree includes
the framework with remote connections between the quiet's
position and specialist's office, use of fiber optics keeping in
mind the end goal to center the infrared range for examining and
to give better determination.
Lakovidis D. K. et al.[11] exhibited a paper for division of US
pictures so as to depict thyroid knobs precisely. They actualized
237
ISBN: 978-81-924893-0-8
a methodology called GA-VBAC i.e. a blend of GA (Genetic
Algorithm) & VBAC (Variable Background Active Contour
model). VBAC uses variable foundation districts with a specific
end goal to minimize the force inhomogeneity impacts in thyroid
US pictures. They utilized GA to consequently & productively
look the VBAC parameters without obliging any specialized
abilities. Trial results demonstrate that GA-VBAC is a
successful, proficient and very target framework for outline of
thyroid in US pictures. As GA-VBAC acquired normal cover
esteem 92.5% though specialists got 91.8%, so it is clear that
GA-VBAC is skilled to acquire high outline precision relatively.
Future work is to improve GA-VBAC by accelerating the
preparation stage to make it practical for numerous US pictures
& plan a coordinated framework to consolidate heterogeneous
data for judgment of thyroid knobs.
Maroulis D.E. et al.[12] introduced a paper on VBAC (Variable
Active Contour Model) for outline of thyroid knobs in US
pictures. They joins the profits of ACWE (Active Contour
without Edges) with VBAC & dissimilar to excellent dynamic
form models which are touchy if there should be an occurrence
of power inhomogeneities, this proposed model likewise
includes the variable foundation districts. At that point, they
assessed VBAC & contrasted and ACWE display if there should
be an occurrence of both engineered and additionally genuine
US pictures. Trial results demonstrate that VBAC external
performs ACWE when in homogeneity was considered.
Likewise, its outlines of hypoechoic knobs are exact by 91%
than that of ACWE in less cycles & it is similar to master
radiologists as indicated by which it is plausible in clinical
practice. VBAC met in 9.6% less cycles than ACWE &
execution time is likewise speedier by 8.2%,as normal division
time is 1min 33s for VBAC while for ACWE it is 1min 41 s.
Kollorz Eva N.K. et al.[13] exhibited a paper on volumetric
evaluation of thyroid utilizing 3-D US imaging. They proposed a
self-loader division approach for grouping & examination is
carried out on the premise of the 3-D US information. Pictures
get examined in 3-D then preprocessing keeping in mind the end
goal to uproot spot commotion, sifting & division is carried out.
Augmentation of Geodesic dynamic form level is examined in
point of interest. They joined two anisotropic dispersion
channels with level set based dissemination calculation.
Affectability & Specificity of division was 75% & 97%
individually. Mean Hausdorff separation is obliged under 3mm
for clinical utilization.
Maroulis D.E. et al.[4] exhibited a paper on thyroid knob
recognition in US pictures utilizing PC supported method that
considers the in homogeneity of US pictures. They actualized
VBAC includes variable subset of the picture as its experience
which can change the shape to diminish the foundation in
homogeneity impacts. Results get assessed by utilizing US
pictures of 35 thyroid patients & demonstrates that VBAC
(Variable Active Contour Model) gives quick joining and
enhanced exactness similar to ACWE (Active Contour without
Edges) .As with VBAC they arrived at the meeting in 10% less
calculation cycles than ACWE. Future work is to implant the
textural gimmicks to watch the form advancement which
empowers non hypo-echoic knobs recognition.
Keramidas E.G.et al.[14] introduced a paper in which they
depicted TND (Thyroid Nodule Detector) which is a PC
supported determination model for ultrasound pictures &
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

features to identify the nodular tissue. This proposed technique

incorporates four segments that considers novel commitments
like TBD-2 calculation incorporates thyroid parenchyma for Segmentation of Thyroid region
programmed meaning of ROI and combination of FLBP (Fuzzy
Logic Binary Patterns) & FGLH (Fuzzy Gray Level
Histogram).They examined the attainability of proposed system
on genuine US pictures. Test results demonstrate that joining of
FLBP & FGLH is more powerful relative to different systems.
They additionally demonstrated that TND framework can get Stop
connected clinically. Precision in thyroid knob location has been
assessed to surpass 95%. Future extension is to improve the
TND with the assistance of modern programmed systems like Figure3.Thyroid Segmentation steps
GA & suitable shape approaches for outline of distinguished
knobs.
5. DISCUSSION
3. PROBLEM FORMULATION For the evaluation of proposed technique we have used
1.Existing Techniques are not always capable of distinguishing MATLAB Simulation 2012a version and platform were installed
structures such as bigger blood vessels from actual nodules. at window 8.1 processor version.The proposed algorithm is now
2.Existing segmentation techniques generally results in broken applied to the images in the data set and the required region of
edges. thyroid gland is extracted. Various experiments were performed
3.Existing techniques suffers from limited resolution & to show the ability of the proposed method. The evaluated
boundary leakage problem. parameters were used Accuracy, Specificity, Sensitivity, False
4. Existing techniques suffers from problem of official overlap Negative Rate and False Positive Rate. The five measuring
during focus alignment. indices are defined as follows:
5.Existing techniques are device dependent as they require Accuracy= TP+TN/AP+AN
different set of parameters for the segmentation if they get Sensitivity=TP/AP
acquired from different ultrasound devices. Specificity=TN/AN
TP Rate= TP/(TP+FN)
FP Rate= 1- TN/(TN+FP)
4. METHODOLOGY We will compare all parameters with existing results by using
our proposed techniques.

Start
REFERENCES
[1] Hitesh garg & alka jindal, Segmentation of Thyroid
gland in Ultrasound Image using neural network.
chandigarh, india, 2013.
Read Ultrasound [2] sheeja agustin A et al, Thyroid Classification as Normal
image and Abnormal using SCG based Feed Forward Back
Propagation Neural Network Algorithm., 2013.
[3] Dimitris K. Iakovidis, Ioannis Legakis, and Dimitris
Preprocessing & ROI generation Maroulis, Michalis A. Savelonas, active contours
guided by echogenicity and texture for delineation of
thyroid nodules in ultrasound images., 2009.
[4] M.A. Savelonas, S.A. Karkanis, D.K. Iakovidis, N.
Dimitropoulos D.E. Maroulis, computer-aided thyroid
Feature Extraction nodules for detection in ultasound images. greece,
2005.
[5] Wei Zheng, Li Zhang and Hua Tian Jie Zhao,
segmentation of ultrasound images of thyroid nodules
Training of Neural Network for assisting fine needle aspiration cytology., 2012.
[6] Yue-Fong Lei, Chin-Hsiao Tseng, and Shyang-Rong
Shih Chuan-Yu Chang, thyroid segmentation and
Classification volume estimation in ultrasound images., 2010.
[7] b.gopinath & Dr B.R. Gupta, Majority Voting based
Classification of Thyroid Carcinoma. india, 2010.

238
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[8] en.wikipedia.org/wiki/Image_segmentation.
[9] en.wikipedia.org/wiki/Artificial_neural_network.
[10] Michael Holdmann, and Maher Rizkalla Ahdy Helmy,., 2008.
[11] Michalis A. Savelonas,Stavros A. Karkanis & Dimitris E.
Maroulis Dimitris K. Iakovidis, A genetically optimized level
set approach to segmentation of thyroid ultrasound image.
greece, 2007.
[12] Michalis A. Savelonas, Dimitris K. Iakovidis ,Stavros A.
Karkanis and Nikos Dimitropoulos Dimitris E. Maroulis,
variable background contour active model for computer-aided
delineation of nodules in thyroid ultrasound images, 2007.
[13] Dieter A. Hahn, Rainer Linke,Tamme W. Goecke, Joachim
Hornegger and Torsten Kuwert Eva N. K. Kollorz,
quantification of thyroid volume usin 3-D ultrasound
imaging., 2008.
[14] Dimitris Maroulis ,Dimitris K. Iakovidis ΤND Eystratios G.
Keramidas, A thyroid nodule detection system for analysis of
ultrasound images and videos, 2010.

239
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Review of Robust Document Image Binarization

Technique for Degraded Document Images
Rupinder Kaur Naveen Goyal
M.TECH (ECE) Student Assistant Professor
BGIET, Sangrur BGIET, Sangrur
cheema1579@gmail.com goyal.naveen2006@gmail.com

ABSTRACT foundation and the content stroke crosswise over diverse record
Segmentation of badly degraded document images is done for pictures.
discriminating a text from background images but it is a very
challenging task. So, to make a robust document images, till
now many binarization techniques are used. But in existing
binarization techniques thresholding and filtering is unsolved
problem. In the existing method, an Adaptive contrast map is
first constructed then binarized and combined with cannny edge
map to identify text stroke edge pixels, the documented is
further segmented by local threshold .So the existing methods
are divided into four main steps out of which last two steps used
two different algorithms. In the proposed method, we can
modify algorithms and test degraded document images then
compare the result that come from previous paper results.

KEYWORDS
Adaptive Binarization Techniques, Document Segmentation,
Image Processing, Denoising.
Figure 1 Figure 2
1. INTRODUCTION
As represented in Fig. 1, the manually written content inside the
Document pictures, as a substitute of paper documents, basically
debased records regularly demonstrates a certain measure of
comprise of regular images, for example, manually written or
variety as far as the stroke width, stroke shine, stroke
machine-printed characters, images and design [1]. In numerous
association, and record foundation. Likewise, recorded records
down to earth applications, we just need to keep the substance of
are frequently corrupted by the drain through as showed in Fig.
the record, so it is sufficient to speak to content and graphs in
1 and Fig. 2, where the ink of the other side leaks through to the
parallel configuration which will be more proficient to transmit
front. Furthermore, authentic reports are regularly corrupted by
and process rather than the first dark scale picture. It is crucial to
diverse sorts of imaging curios. These diverse sorts of record
limit the record picture dependably so as to concentrate valuable
corruptions have a tendency to prompt the report thresholding
data and make further preparing, for example, character
lapse and make debased archive picture binarization a major test
recognition and feature extraction, particularly for those low
to techniques [4].Document picture binarization assumes a key
quality archive pictures with shadows, non-uniform
part in report handling following its execution influences the
enlightenment, low differentiation, substantial sign ward
degree of success in resulting character division and recognition.
commotion, smear and smudge[2]. Along these lines,
all in all, picture binarization is arranged in two fundamental
thresholding a checked dim scale picture into two levels is the
classes: (i) worldwide and (ii) nearby. Binarization is a
"rst step furthermore a discriminating part in most archive
preprocessing stage for report examination and it is utilized to
picture investigation frameworks since any blunder in this stage
fragment the frontal area content from the archive foundation.
will spread to all later stages.
This system guarantees quicker and exact document picture
Document Image Binarization expects to section the closer view
handling tasks [5]. Most record investigation calculations are
content from the document foundation and is performed in the
based in view of hidden binarized picture information. The
preprocessing stage for record analysis [3]. For the following
utilization of bi-level information diminishes the computational
record picture preparing undertakings, for example, optical
load and aides in utilizing streamlined investigation techniques
character recognition (OCR), a quick and exact archive picture
contrasted with 256 levels of dim scale or shading picture data.
binarization strategy is key. In spite of the fact that archive
Document picture understanding systems oblige consistent and
picture binarization has been created for a long time, the
semantic substance conservation for thresholding. Despite the
thresholding of corrupted record pictures is still an unsolved
fact that record picture binarization has been considered for a
issue because of the high inter/intra- variety between the report

240
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
long time, the thresholding of pictures is still a testing
undertaking because of the high variety between the content
stroke and the archive foundation. For a data picture, some
handling stages ought to be utilized before the content
extraction. One of the steps includes binarization.
2. RELATED WORK
Ioannis Pratikakis et al.[6] has talked about a challenge. The
general focus of the challenge is to recognize current
advancements in record picture binarization for both machine-
printed and physically composed record pictures using appraisal
execution measures that obey report picture examination and
recognition. The challenge points of interest have been depicted
fusing the appraisal measures utilized furthermore the execution
of the 23 submitted schedules and a short portrayal of each
system.
Abdenour Sehad et al.[7] has present a skilled plan for
binarization of antiquated and degraded document pictures,
grounded on surface qualities. The proposed method is a
versatile limit based. It has been computed by utilizing a
descriptor focused on a co-event framework and the plan is
confirmed equitably, on DIBCO dataset corrupted reports
besides subjectively, using a set of antiquated debased records
offered by a national library. The results are worthy and
guaranteeing, exhibit a change to established methodologies.
Hossein Ziaei Nafchi et al.[8] has presumed that the
preprocessing and post preparing stages definitively propel the
execution of binarization methodologies, especially in the
circumstance of cruelly degraded antiquated archives. An
unconfirmed post preparing system is introduced established on
the stage saved denoised picture furthermore stage congruency
peculiarities extricated from the data picture. The focal piece of
the procedure involves two powerful cover pictures that can be
utilized to cross the false positive pixels on the generation of the
binarization method. Firstly, a veil with an amazing review
worth is achieved from the denoised picture with the assistance
of morphological strategies. In parallel, a second cover is
procured needy upon stage congruency characteristics. By then,
an average channel is used to clear clamor on these two covers,
which then are used to redress the yield of any binarization
system.
P Lopes, N.V.et al.[9] has present a programmed histogram edge
methodology taking into account a fluffiness measure. Utilizing
the ideas of fluffy rationale, the issues included in discovering
the base of a paradigm capacity are evaded. Similitude between
dark levels is the way to discover an ideal edge. Two starting
locales of dim levels are characterized at the limits of the
histogram. After that utilizing a file of fluffiness, a likeness
methodology is begun to discover the limit point. A huge
complexity in the middle of articles and foundation is accepted.
Histogram leveling is utilized as a part of pictures having little
differentiation distinction.
S.J. Pai, Y.T.et al.[10] present a versatile calculation for
productive archive picture binarization with low computational
intricacy and elite. This is especially suitable for utilization in
versatile gadgets, for example, PDA, cellular telephones which
are checked by their constrained memory space and low
computational capacity. This strategy partitions the report
picture into a few squares by incorporating the idea of
241
ISBN: 978-81-924893-0-8
worldwide and nearby routines. After that an edge surface is
built in view of the differing qualities and the force of every
locale to determine the twofold picture. Trial results demonstrate
the viability of the proposed technique.
Zhou et al. A[11] binarization system is displayed in light of
edge data for feature content pictures. It endeavors to handle
pictures with complex foundation with low differentiation. The
form of the content is distinguished, after that nearby
thresholding system can used to search for the inward side of the
shape; along these lines, the forms of the characters are topped
off to structure characters that are conspicuous to OCR
programming.
Ntirogiannis et.al.[12] present a new archive picture binarization
strategy, as an enhanced variant of the versatile intelligent level
method (ALLT). The first ALLT makes utilization of altered
windows for removing fundamental gimmicks (e.g., the
character stroke width). In any case, there are potential
outcomes of characters with a few diverse stroke widths inside
an area. This may prompt incorrect results. In this paper,
neighborhood versatile binarization is utilized as a manual for
versatile stroke width discovery. The skeleton and the form
purposes of the binarization yield are consolidated to recognize
the stroke width provincially. Also, a versatile neighborhood
parameter is characterized that improves the characters and
enhances the general execution accomplishing more exact
binarization results for both manually written and printed reports
with a specific concentrate on degraded authentic archives.
N.Stathis et al.[13] proposed another method for the approval of
report binarization calculations. Creators assert that the proposed
system is basic in its execution and can be performed on any
binarization calculation since it doesn't oblige much else besides
the binarization stage. As a showing of the proposed strategy,
we utilize the instance of corrupted recorded records. The
proposed method is assessed with 30 binarization calculations
for execution correlation.
Bradley et al.[14]presents a continuous versatile utilizing the
fundamental picture of the information. The system proposed is
powerful to light changes in the picture suitable for preparing
live feature streams at an ongoing edge rate which makes it
suitable for the intuitive application.
3. PROBLEM FORMULATION
In the current framework they creator have utilized edge
discovery procedure for recognizing the edges of the old records
original copies, however the system were new furthermore the
yields were enhanced from the current strategy yet not that much
precise. In the proposed framework we will attempt to execute
existing framework utilizing morphological operators and will
enhance the estimations of parameters like PSNR, F-Measure
and NRM.
4. PROPOSED WORK
This section describes the proposed document image
binarization techniques. Given a degraded document image, an
adaptive contrast map is first constructed and the text stroke
edges are then detected through the combination of the binarized
adaptive contrast map and the canny edge map. The text is then
segmented based on the local threshold that is estimated from
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

the detected text stroke edge pixels. Some post-processing is 5. CONCLUSION

further applied to improve the document binarization quality. This paper presents an adaptive image contrast based document
In the proposed document image binarization technique mainly image binarization technique that is tolerant to different types of
four steps occurs. document degradation such as uneven illumination and
1. Construction of Contrast Image document smear. The proposed technique is simple and robust,
2. Detection of text stroke edge pixels only few parameters are involved. Moreover, it works for
3. Estimation of Local Threshold different kinds of degraded document images. The proposed
4. Reduction Of Noise technique makes use of the local image contrast that is evaluated
Merit: In output part noise level very low compared to previous based on the local maximum and minimum. The proposed
method. method has been tested on the various datasets. In output part
noise level very low compared to previous method in term of
the F-measure, pseudo F-measure, PSNR, NRM, MPM and
DRD.
Degraded Image
Document Image Normalization
REFERENCES
[1] Yibing, and Hong Yan. Yang, "An adaptive logical
method for binarization of degraded document
images.", 2000.
Contrast Image
Construction [2] Bir. Bhanu, Multistrategy Learning for Computer
Vision. California univ riverside coll of engineering.,
1997.

[3] Basilios, Ioannis Pratikakis, and Stavros J. Perantonis.

Gatos, "Adaptive degraded document image
Canny binarization., 2006.
Contrast Image
edge map
binarization [4] Bolan, Shijian Lu, and Chew Lim Tan. Su, "Robust
document image binarization technique for degraded
document images.", 2013.

[5] Basilios, Ioannis Pratikakis, and Stavros J. Perantonis.

Gatos, "Improved document image binarization by
Text Stroke Edge using a combination of multiple binarization
techniques and adapted edge information."., 2008.
Pixel Detection
[6] Ioannis, Basilis Gatos, and KonstantinosNtirogiannis
Pratikakis, "ICDAR 2013 Document Image
Binarization Contest (DIBCO 2013)," in Document
Analysis and Recognition (ICDAR), 2013 12th
Binary Document International Conference on.IEEE, 2013.
Local Threshold
Image estimation [7] Abdenour, et al. Sehad, "Ancient degraded document
image binarization based on texture features.," in
Image and Signal Processing and Analysis (ISPA),
2013 8th International Symposium on.IEEE, 2013.

[8] HosseinZiaei, Reza FarrahiMoghaddam, and

Mohamed Cheriet Nafchi, "Application of Phase-
Output Based Features and Denoising in Postprocessing and
Noise
Document Image Binarization of Historical Document Images.," in
Reduction Document Analysis and Recognition (ICDAR), 2013
12th International Conference on.IEEE, 2013.

Figure 3: Block diagram of proposed system [9] N.V., Mogadouro do Couto, P.A., Bustince, H., Melo-
Pinto, P Lopes, "Automatic histogram threshold using

242
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

fuzzy measures"., 2010.

[10] Y.T., Chang, Y.F., Ruan, S.J. Pai, Adaptive

thresholding algorithm: efficient computation
technique based on intelligent block detection for
degraded document images.., 2010.

[11] Z., Li, L., Tan, C.L. Zhou, "Edge based binarization
for video text images. ," in In: Proceedings of 20th
International Conference on Pattern Recognition
(ICPR), , 2010.

[12] K., Gatos, B., Pratikakis, I. Ntirogiannis,

"Ntirogiannis, K., Gatos, B., Pratikakis, I.,"A
modified Adaptive logical level binarization
technique for historical documents images" , 2009.

[13] P., Kavallieratou, E., Papamarkos, N. Stathis, An

evaluation technique for binarization algorithms.,
2008.

[14] D., Roth, G. Bradley, Adaptive thresholding using the

integral image.., 2007.

243
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A REVIEW OF MULTIBIOMETRIC SYSTEM WITH

RECOGNITION TECHNOLOGIES AND FUSION
STRATEGIES
Cammy Singla Naveen Goyal
M.TECH (ECE) Student Assistant Professor
BGIET, Sangrur BGIET, Sangrur
Cammysingla931@gmail.com goyal.naveen931@gmail.com

ABSTRACT
Biometrics means technology of measuring and analyzing
physiological or biological characteristics of living body for
identification and verification purposes. A biometric system
provides automatic recognition of an individual based on
some sort of unique feature or characteristic of the individual.
Biometric systems is based on fingerprints, facial features,
voice, hand geometry, handwriting, the retina and iris.User
verification systems that use a single biometric indicator often
have to contend with noisy sensor data, restricted degree of
freedom, non-universality of the biometric trait and
unacceptable error rates. So the need of using multimodal
biometric system occurred. A multimodal biometric system
combines the different biometric traits and provides better
recognition performance as compared to the systems based on
single biometric trait. This paper presents a review of
multibiometric systems including its recognition technologies,
level of fusion and feature extraction for fingerprint and iris. Fig 1: Illustrations of some biometric characteristic
Features like minutia points from fingerprint and texture from
iris are extracted. In unimodal biometric frameworks we confront a mixture of
issues, for example, loud information, intra-class varieties,
KEYWORDS limited degrees of opportunity, non-all inclusiveness, parody
Biometrics, Multimodal,fingerprint,iris,recognitiontechniques, assaults, and unsatisfactory lapse rates. The constraints forced
level of fusion and feature extraction of iris and fingerprints. by unimodal biometric frameworks can be overcome by
utilizing various wellsprings of data for securing character.
Such frameworks are known as multimodal biometric
1. INTRODUCTION frameworks. Multimodal framework is a blend of two or more
In the modern world, there is a high demand to authenticate
than two biometric characteristics of a single person for the
and identify individuals automatically. Hence, the recognizable proof purposes.
development of technology such as personal identification
number (PIN), smartcard or passwords have been introduced. 2. INDIVIDUAL DISTINGUISHMENT
However, those technologies are inadequate since they are
2.1Fingerprint distinguishment
disclosable and transferable. For example, PIN and smart card Unique mark distinguishment is a standout amongst the most
can be duplicated, misplaced, stolen or lost, long password famous and remarkable biometrics. Due to their uniqueness,
can be hard to remember by client and short password can be fingerprints have been utilized for distinguishment for more
guessed easily by the imposter.In order to overcome these than a century. Fingerprints are different to every individual in
problems, biometric-based authentication and identification light of an exceptional papillary gimmicks which are diverse
methods are introduced in late 90s. even in twins. Unique finger impression examples stay
unaltered all through the whole grown-up life and that is the
Biometric systems work by first capturing a sample of the
reason effortlessly utilized for recognizable proof. Regardless
feature for example taking a digital color image for face if a finger is harmed, different fingers that are already selected
recognition or recording a digital sound signal for voice into the framework can likewise be utilized for ID.
recognition or taking a fingerprint samples of fingers. Then
some sort of mathematical functions are applied on the
samples. The biometric template will provide an efficient and
highly discriminating representation of the feature.

Fig 2: Cases of some biometric characteristics

244
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Finger impression handling could be possible in two ways.
Firstly utilizing equipment and furthermore utilizing
programming. In equipment unique mark transforming
exceptional biometric scanners are utilized to catch
fingerprints. There are three sorts of unique mark scanners
which are Capacitive scanner, Clear scanner,Optical scanner.
Fig 3: Rridges and valleys of fingerprints
2.2 Iris Distinguishment
Because of numerous hues, iris is known as "Goddess of the
Rainbow", which is a Greek word. The slight divide between
the dull understudy and white sclera is iris. The iris is the
annular ring between the sclera and pupil boundary and
contains the flowery pattern unique to each individual. In
human eye iris is the hued part which is set behind the
cornea.In programming transforming there are two
coordinating systems. Particulars coordinating is broadly
utilized distinguishment system. Details coordinating is in
view of the particulars focuses, uniquely course and area of
every point. In Example coordinating two pictures are just
contrasted with perceive how comparative or disparate they
are to one another.
Fig 4: Human Eye
Picture handling systems can be utilized to concentrate the
one of a kind iris design from a digitized picture of the eye
and encode it into a biometric layout, which can be put away
in a database. This biometric format contains a target
numerical representation of the interesting data put away in
the iris and permits correlations to be made between formats.
This format is then contrasted and alternate layouts put away
in a database until either a coordinating layout is discovered
245
ISBN: 978-81-924893-0-8
and the subject is recognized or no match is discovered and
the subject stays unidentified.
3. LEVEL OF COMBINATION
The vital issue to planning multibiometric framework is to
focus the wellsprings of data and mix systems. Contingent
upon the kind of data to be melded, the combination plan can
be characterized into distinctive levels. As indicated by
Sanderson and Paliwal [8], the level of combination can be
characterized into two categories, combination before
coordinating (preclassification) and combination in the wake
of coordinating (post characterization) as demonstrated in
Figure 2.
Fig 5: Level of fusion
3.1 Fusion before Matching
3.1.1 Sensor level combination
In this level, the crude information from the sensor are joined
together as indicated in Fig. 3. In any case, the wellspring of
data is relied upon to be debased by commotion, for example,
non-uniform brightening, foundation mess and other [10].
Sensor level combination can be performed in two conditions
i.e. information of the same biometric quality is gotten
utilizing different sensors; or information from various
depiction of the same biometric qualities utilizing a
singlesensor [11, 12].
Sensor Sensor
data 1 data 2
Fusion
Feature Vector
Matching
Match
Score
Decision
Fig 6: Sensor level combination methodology stream
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.1.2 Feature level combination 3.2.2 Decision level combination

In gimmick level combination, distinctive peculiarity vectors
removed from different biometric sources are joined together
into a solitary gimmick vector as portrayed in Fig. 4. This
methodology experiences two stages which are gimmick
standardization and peculiarity determination. The gimmick
standardization is utilized to adjust the area and size of
peculiarity qualities by means of a change capacity and this
alteration could be possible byusing fitting standardization
plans [2]. For example, the min-max method and average
plotting have been utilized for hand and face [9] and the mean
score from the discourse flag and lipreading pictures scores
have been utilized in the peculiarity level combination.
Combination at the choice level is executed after a match
choice has been made by the individual biometric source as
delineated in Fig. 6. In this way, there are various strategies
part voting, weightedmajority voting, Bayesian choice
combination, Dempster-Shafer hypothesis of proof and
conduct information space [7]. On alternate hands, Ramli et
al., [14] executed the proposed choice combination by
utilizing the spectrographic and cepstrumgraphic as
peculiarities extraction and UMACE channels as classifiers in
the framework to diminish the slip because of the variety of
information.have been connected to join the different choice
into a definite conclusion, for example, "AND" and "OR"
rules [4], greater

Sensor Sensor Sensor Sensor

data 1 data 2 data 1 data 2

Feature Extraction Feature Extraction

Feature Extraction Feature Extraction

Fusion
Feature Feature
Vector 1 Vector 2
Joint Feature
Vector

Template Template
Template
Matching

Matching Matching

Match
Score

Match Match
Score 1 Score 2
Decision

Fusion
Figure 7: Feature level fusion process flow

3.2 Fusion after Matching

3.2.1 Score level combination Total
In score level combination, the match yields from various
biometrics are joined together to enhance the coordinating Score
execution to confirm or distinguish singular as indicated in
Fig. 5 [13]. The combination of this level is the most
prominent approach in the biometric writing because of its Decision
basic methodology of score accumulation and it is
additionally pragmatic to be connected in multibiometric
framework. In addition, the coordinating scores contain
Figure 8: Score level fusion process flow
sufficient data to make genuine and fraud case recognizable
[6]. Nonetheless, there are a few variables that can influence
Fusion at the decision level is a rather loosely coupled system
the mix transform thus debases the biometric execution. For
architecture, with each subsystem performing like a single
instance, the coordinating scores created by the individual
biometric system. This architecture has therefore become
matchers may not be homogenous because of be in the
increasingly popular with biometric vendors, often advertised
distinctive scale/range or in diverse likelihood conveyance.
under the term “layered biometrics”. Many different strategies
Keeping in mind the end goal to defeat this restriction, three
are available to combine the distinct decisions into a final
combination plans have been introduced i.e. thickness based
authentication decision. They range from majority votes to
plans; change based plan; and classifier-based plan [7].
sophisticated statistical methods.

246
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4.1.1 Implementation of unique finger impression

Sensor Sensor Recognization framework
data 1 data 2

Feature Extraction Feature Extraction

Feature Feature
Vector 1 Vector 2

Fig 10: Original Image

Template
Template

Match Match
Score 1 Score 2

Decision Decision

Fig 11:Thinned Image

Yes/No Yes/No

Decision 1 Decision 2

Fusion

Figure 9: Decision level fusion process flow. Fig 12: Fingerprint feature extraction with minutia points

4. PROPOSED SCHEME 4.2 Feature extraction of iris

4.1 Minutiae focuses extraction from Iris distinguishment is a compelling means for client
validation. iris has a few critical attributes like 1) Iris has
fingerprints exceedingly recognizing surface 2) Right eye contrasts from
Finger impression distinguishment is carried out by a few left eye 3) Twins have distinctive iris composition. The
gimmicks, for example, minutia focuses (Bifurcation & different steps included in peculiarity extraction of iris are as
edges). The general procedure can be separated into taking per the following:
after operations: 1. Load the picture
1. Load the picture 2. Division
2. Binarization 3. Standardization
3. Diminishing 4. Vigilant edge Detection
4. Minutia Extraction 5. Daugman's Rubber Sheet Model
5. Yield picture Iris characteristic extraction is gotten through of a Gabor
Minutia Extraction is carried out by utilizing cover operation channel. The general technique is load the eye picture into the
framework extraction of gimmick in the composition form
a) Bufrication b) Ridges which utilizes the Gabor channel that peculiarity is spoken to
in the iris code.
Hough change used to focus geometric elements, for example,
line, circles. Roundabout Hough change is utilized to
recognize the span and focus directions of student and iris.
The Equation for identifying the circles as takes after: k, l are
the x and y coordinates, g is the range of circle.

k2+l2=g2 (Eq.1)

247
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
For distinguishing the edges of eye watchful edge
identification is utilized. It just perceives the edges from the
eye picture. Presently we have confined the iris locale. For
consistent measurement we are utilizing the daugman's elastic
sheet model.
Fig 13: Daugman's elastic sheet
Daugman's remap the every purpose of iris locale to a polar
coordinates(r,) where r is in the scope of [0, 1] and 𝞱 is of
reach [0,2pi]. The remapping of directions are carried out
from circle's x and y coordinates it changes over the co-
ordinates into the polar directions .The comparison is as per
the following
R= 𝑎𝑔 ± 𝑎𝑔2 − 𝑎 − 𝑟2
where a =𝞼x2+ 𝞼y2
g= cos (𝑝𝑖 −tanh−1𝜎𝑥2/𝜎𝑦2) (Eq.2)
The 𝞼x, 𝞼y determines the distance of center of the iris and
center of pupil. We get the result in the format of rectangular
portion.
a) Original Image b) Segmented Image
c) Normalize Image d)Edge Detection
e)Extracted Feature of Iris
Fig 14:Different images during extraction of eye
Multimodal biometrics was gone for security-cognizant
clients. Multimodal biometric framework has some great
favorable circumstances, for example, 1) Improved exactness
2) Verification Or Identification on the off chance that
sufficient information is not extricated from given biometric
format 3) Ability to shield the classified information from
Kparody assault. A few stages included in proposing the
multimodal based methodology for cryptographic key era are :
248
ISBN: 978-81-924893-0-8
1) Feature extraction from unique finger impression.
2) Feature extraction from iris.
3) Fusion of unique finger impression and iris characteristics.
4.3. Fusion of fingerprint and iris features
The following step is to wire the two arrangements of
peculiarities to get a multimodal biometric layout for
verification. The Fused Image is indicated be low: Fused
Features of Two Templates (Fingerprint & Iris).These
frameworks have the capacity to meet the execution
prerequisites of different applications. They address the issue
of non-comprehensiveness, since numerous characteristics
guarantee sufficient populace scope. Mocking is unrealistic in
multimodal biometric framework in light of the fact that it
would be troublesome for an impostor to satire numerous
biometric qualities of a real client all the while.
Fig 15: Fused Features of Two Templates (Fingerprint &
Iris)
5. DISCUSSION AND CONCLUSION
Multibiometric frameworks, which coordinate data from
various biometric characteristics, are picking up prominence
on the grounds that they find themselves able to overcome
restrictions of unimodal biometrics. Up to this point, most
research in multi-modal biometrics have focused on joining
information at choice or score levels. Consequently; give
more and powerful confirmation process. In the late years
there is a noteworthy increment in examination movement
coordinated at seeing all parts of biometric data framework
representation and use for choice making backing, for
utilization by open and security administrations, and for
comprehension the complex methodologies behind biometric
coordinating and distinguishment. The portrayal with respect
to the level of combinations was likewise introduced in this
paper. From the study, it uncovers that, execution of
multibiometric frameworks can be further enhanced if a
suitable combination methodology is utilized particularly for
the framework which executed in uncontrolled environment.
In our undertaking, we have been utilizing two modalities, for
example, Fingerprint combination of two modalities utilizing
key part investigation strategy. Here, we got the melded
biometric that combined biometric layout utilized for
encryption utilizing particular encryption technique.
Essentially now a day's particular encryption strategy is
utilized for encryption in light of the fact that it gives
accommodating results for sight and sound information and it
is will use for further applications, for example, pressure of
scrambled pictures on web.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES [9] A. Jaina, K. Nandakumara, A. Ross, and A. Jain, “Score

[1] G. Williams, “More than a pretty face”, Biometrics and
SmartCard Tokens. SANS Institute reading room, 2002, pp. 1-
16.
[2] A. K. Jain, K. Nandakumar, U. Uludag, and X. Lu,
“Multimodal Biometrics”, from Augmenting Face With Other
Cues, in W. Zhao, and R. Chellappa, (eds) Face Processing:
Advanced Modelling and Methods, Elsevier, New York,
2006. pp. 675-705.
[3] J.P. Campbell, D.A. Reynolds, and R.B. Dunn, “Fusing
High And Low Level Features for Speaker Recognition”, in
Proceeding of EUROSPEECH, 2003, pp. 2665-2668.
[4] C.C. Lip, and D.A. Ramli, “Comparative Study on
Feature, Score and decision Level Fusion Schemes for Robust
Multibiometric Systems”, Advances in Intelligent and Soft
Computing, Vol. 133, 2012, pp. 941-948.
[5] D.R. Kisku, P. Gupta, and J.K. Sing, “Feature level
Fusion Of Biometrics Cues: Human Identification with
Doddington’s Caricature”, in International Conference of
Security Techonolgy, Communications in Computer and
Information Sciences, 2010, pp. 157-164.
[6] M.X. He, S.J. Horng, P.Z. Fan, R.S. Run, R.J. Chen, J.L.
Lai, M.K. Khan and K.O. Sentosa, “Performance Evaluation
of Score Level Fusion in Multimodal Biometric Systems”,
Journal of Pattern Recognition, Vol. 43, No. 5, 2010, pp.
1789-1800.
[7] A. Ross, and A.K. Jain, “Fusion Techniques in
Multibiometric Systems”, from Face Biometrics for Personal
Identification. In. R.I. Hammound, B.R. Abidi and M.A.
Abidi (eds.), Publisher Springer Berlin Heidelberg, 2007, pp.
185-212.
Normalization in Multimodal Biometric Systems”, Journal of
PatternRecognition, Vol. 38, 2005, pp. 2270.
[10]. S.S. Iyengar, L. Prasad, and H. Min, Advances in
Distributed Sensor Technology, Prentice Hall, 1995.
[11] R. Singh, M. Vatsa, A. Ross, and A. Noore,
“Performance Enhancement of 2D Face Recognition via
Mosaicing”, in Proceedings of the 4th IEEE Workshop on
Automatic Identification Advanced Technologies (AuotID),
2005, pp. 63–68.
[12] A. Ross, and R. Govindarajan, “Feature Level Fusion
Using Hand And Face Biometrics”, in Proceedings of SPIE
Conference Biometric Technology for Human Identification,
Vol. 5779, 2005, pp. 196–204.n
[13] A.K. Jain, and A. Ross, “Multibiometric Systems.
Communications of The ACM”, Special Issue on Multimodal
Interfaces, Vol. 47, No. 1, 2004, pp. 34-40.
[14] R. Brunelli, and D. Falavigna, “Person Identification
Using Multiple Cues”, IEEE Transactions on Pattern Analysis
and Machine Intelligence, Vol. 17, No.10, 1995, pp. 955–966
[15] K. Chang, K. Bowyer, and P. Flynn, “Face Recognition
Using 2D And 3D Faces”, Workshop on Multi Modal User
Authentication (MMUA), 2003, pp. 25-32.

[8] C. Sanderson, and K.K. Paliwal, “Noise compensation in

a person verification system using face and multiple speech
features”, Pattern recognition, Vol. 2, 2003, pp. 293-302.

249
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fractal Reconfigurable Antenna

Anuradha Sonker Shweta Rani Sushil Kakkar
Assistant Professor Associate Professor Assistant Professor
ECE Department ECE Department ECE Department
NIT Hamirpur BGIET, Sangrur BGIET, Sangrur
anuradhasonker@yahoo. shwetaranee@gmail.com kakkar778@gmail.com
co.in

ABSTRACT resulting in a very complex antenna structure with an infinite

This paper presents the use of PN junction diode on fractal number of frequency bands.
monopole antenna with microstrip line for rreconfigurable Electronic reconfigurability is usually achieved by
multiband antennas. The developed multiband antennas focus incorporating switches, variable capacitors, phase shifters, or
on the applications for Wi-Fi, cordless telephone and satellite ferrite materials in the topology of the antenna [4-6]. Most
& radar. A fractal reconfigurable antenna was designed using frequently, lumped components such as PIN diodes, varactor
the known fractal geometry such as Sierpinski gasket is fed by
strip line using coaxial feed. Antenna’s frequencies gets turn diodes, or MEMS switches or varactors are used in the design
on and off with the position and biasing of PN diode on strip of reconfigurable antennas. These components may be used to
line. Simulations were done on the CST software for the electronically change the frequency response and, radiation
analysis of reconfigurable patch antenna. patterns, gain, or a combination of different radiation
parameters of such antennas.
Keywords In the present work, Siepinski gasket monopole antenna was
Smart antennas, Slot antennas, Fractal antennas, Sierpinski
designed at the three resonating frequencies. A PN diode has
gasket antenna..
been inserted on the microstrip line feed system. The different
1. INTRODUCTION positions and bias of the PN diode was used to turn on and
Antennas have become an essential and critical element of all turn of the resonating frequencies of the sierpinski fractal
person electronic devices, microwave and satellite antenna.
communication systems, radar systems and military
surveillance and investigation platforms. In many of these 2. DESIGN OF SIERPINSKI NTENNA
systems, there is a constraint to perform a concourse of Sierpinski monopole gasket is one of the antenna structures
functions across several frequency bands and operating that have got maximum attention among the fractal antenna
bandwidths, particularly in the area of Cognitive radio. category. The monopole antenna based on Sierpinski gasket
Reconfigurable antennas can thus provide great profitableness has been studied extensively as an excellent candidate for
multiband applications.
in applications such as cognitive radio, MIMO systems, smart
antennas, RFIDs etc. The multitude of different standards in
cell phones and other personal mobile devices requires
compact multi-band antennas and smart antennas with
reconfigurable features. The use of the same antenna for a
number of different purposes, preferably in different
frequencies, is highly desirable. A number of different
reconfigurable antennas, planar and 3-D, were developed.
Some of them were developed for radar applications [1] and
other planar antennas were designed for wireless devices [2].
Most of those research works demonstrated only frequency
reconfigurability. There are different types of reconfigurable
antenna have been studied for ultra-wide band and multiband
antennas. Slot antennas have been used for UWB frequency
range. A rectangular patch antenna is modified by a slot
insertion at a particular location in order to alter one resonant
mode more than the other and achieve a dual-band operation. Fig.1 Front view of the Sierpinski gasket monopole antenna
Examples of different techniques that are used to design dual- The structure is usually printed on a dielectric substrate of εr
band slot antennas are presented [3]. In a single-element dual- =2.5 and thickness was 1.5 mm. The overall height H of the
band CPW-fed slot antenna with similar radiation patterns at gasket antenna was taken 22 mm for the designing purpose.
both bands is studied. The Sierpinski gasket monopole antenna consists of a series
A class of fractal antennas has been studied for multiband of scaled triangles having a scaling of r = 0.5. The heights of
the scaled triangle were measured as H/2 and H/4 in the
frequencies. Fractal antenna based on the Sierpinski gasket
gasket antenna. These three heighted antennas operate at three
geometry is described by an infinite number of iterations resonating frequencies respectively as shown in Fig.1.

250
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
In the bottom part of the antenna system, a microstrip line was
printed on the substrate and PN diode has been placed to
produce the reconfiguabilty in the antenna’s resonating
frequencies. The position of diode was used to turn on and off
the resonating frequencies of the antenna. A co-axial feed has
been used to excite the structure though the ground plane on
the back side of the antenna.
3. RESULTS AND DISCUSSION
The sierpinski monopole antenna resonates at three
frequencies with respect to the heights of H, H/2 and H/4
respectively. The three frequencies were observed as 1.8, 5.5
and 8.5 GHz respectively without diode on the microstrip line.
In Figure 2, S11 plot show the frequency response curve. All
three frequencies were satisfied the accepted level of
minimum return loss of 10 Db.
Fig.2 S11 vs frequency plot of gasket monopole antenna
without diode
In Figure 3, when the diode is forward biased and placed at
position of 22 mm on the strip line. The strip line of 22 mm
length matches with the overall height H of the antenna and
the first frequency gets more dominating and the other two
frequencies gets less dominating.
.
Fig.3 S11 vs frequency plot with diode position at 22 mm
Similarly, when the diode is forward biased and placed at 11
mm on the strip line. The strip line length matches with H/2
height of the antenna. So the middle frequency will be more
dominating with respect to the other two frequencies as shown
in Figure 4.
In Figure 5, the strip line length of 5.5 mm matches with the
H/4 height of the antenna. So higher frequency was seem to
be more dominating
251
ISBN: 978-81-924893-0-8
Fig.4 S11 vs frequency plot of gasket monopole antenna
with diode position at 11 mm
Fig.5 S11 vs frequency plot with diode position at 5.5 mm
4. CONCLUSION
A reconfigurable multiple-frequency fractal antenna was
designed at three frequency bands. First, the designed antenna
needs to be well-matched by the proper feeding technique, all
frequencies of interest. With the forward bias switching diode
and location of diode was used to find the frequency on and
off for the desirable applications. By the adopted approach, a
developed reconfigurable antenna works at Bluetooth, GSM
& satellite applications.
5. REFERENCES
[1] E. R. Brown, “RF-MEMS switches for reconfigurable
integrated circuits,” IEEE Trans. Microwave Theory and
Techniques, vol. 46, no. 11, pp. 1868–1880, Nov. 1998.
[2] J. C. Chiao, Y. Fu, I. M. Chio, M. DeLisio, and L.-Y. Lin,
“MEMS reconfigurable Vee antenna,” in Proc. IEEE MTT-S
Int. Microwave Symp.Dig. vol. 4, pp. 1515–1518, Jun. 13–19,
1999.
[3] W. H. Weedon, W. J. Payne, and G. M. Rebeiz, “MEMS-
switched reconfigurable antennas,” in Proc. Antennas and
Propagation society Int.Symp. vol. 3, pp. 654–657, Jul. 8–13,
2001.
[4] E. R. Brown, “On the gain of a reconfigurable-aperture
antenna,” IEEE Trans. Antennas Propag., vol. 49, no. 10, pp.
1357–1362, Oct. 2001.
[5] J. Kiriazi, H. Ghali, H. Ragaie, and H. Haddara,
“Reconfigurable dualband dipole antenna on silicon using
series MEMS switches,” in Proc.Antennas and Propagation
Society Int. Symp., vol. 1, pp. 403–406, Jun. 22–27, 2003.
[6] C. Puente, M. Navarro, I. Romeu, and R. Pous,
“Variations on the fractal Sierpinski antenna flare angle,” in
Proc. Antennas and Propagation Society Int. Symp., vol. 4,
pp. 2340–2343, 1998.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Review of Spectrum Sensing in Cognitive Radio by

Using Energy Detection Technique
Ajay Jindal
ECE Department
BGIET, sangrur
ajayjindal786@gmail.coml

ABSTRACT:
Sensing of channel to detect the presence of primary to
provide the vacant band to secondary users we use the
Energy Detection Technique Algorithm in Cognitive Radio.
The simulations of a proper coding to detect or shows the
all kind of requirements like Presence of primary and
secondary and level of noise and level attenuation The
behaviors of Energy Detection Scheme in Cognitive Radio
is mainly depends upon three parameters like Probability of
Detection, Likelihood of False discovery, Probability of
Miss recognition is likewise enhancing by utilizing the
created MATLAB codes. Vitality Detection Technique is
best strategy for cognitive Radio for low SNR.

KEYWORDS:
Spectrum sensing and opportunity, sensor clustering,
sensing scheduling energy and feature detection.
1. INTRODUCTION
Throughout the most recent decade, remote advances have
become quickly and more range assets are expected to
bolster various developing remote administrations. Inside
the current range administrative structure, however the
greater part of the recurrence groups are solely allotted to
particular
Administrations and no infringement from unlicensed
clients is permitted. The issue of range lack gets to be more
evident and stresses the remote framework fashioners and
information transfers approach. Interestingly, a late review
of the range use made by the Federal Communications
Commission (FCC) has shown that the real authorized
range is to a great extent under- used in tremendous
transient and geographic measurements [1].
With a specific end goal to unravel the contentions between
range shortage and range under-usage, cognitive radio (CR)
innovation has been as of late proposed. It can enhance the
range usage by permitting auxiliary systems to get unused
radio range from essential authorized systems or to impart
the range to the essential systems[2].
As a shrewd remote correspondence framework, a
cognitive radio is mindful of the radio recurrence
environment. It chooses the correspondence parameters, for
example transporter, recurrence, transmission, and
transmission force to advance the range utilization and
adjusts its transmission and gathering appropriately.
Spectrum utilization
A standout amongst the most basic parts of cognitive radio
innovation is range sensing. By sensing and adjusting to the
earth, a cognitive radio has the capacity fill in range
openings and serve its clients without bringing about
hurtful impedance to the authorized client.
One of the considerable difficulties of executing range
sensing is the shrouded terminal issue, which happens when
the cognitive radio is shadowed, in extreme multipath
blurring or inside structures with high entrance misfortune,
while an essential client (PU) is working in the region[3].
Because of the concealed terminal issue, a cognitive radio
may neglect to perceive the vicinity of the PU and
afterward will get to the authorized channel and reason
impedance to the authorized framework. To manage the
concealed terminal issue in cognitive radio systems,
different cognitive clients can participate to direct range
sensing[4-8]. It has been indicated that range sensing
execution can be significantly enhanced with an increment
of the quantity of helpful accomplices. In this letter, we
consider the streamlining of agreeable range sensing with
vitality identification to minimize the aggregate slip rate[9].
It ought to be specified that ideal range sensing under
information combination was researched in where the ideal
direct capacity of weighted information combination has
been gotten[10]. In other late works ideal sensing through
put tradeoff was considered. Ideal dispersed sign discovery
with probability proportion test utilizing reporting stations
from the CRs to the combination focus has been managed
in. Here we explore the optimality of agreeable range
sensing utilizing the sensing channels between the essential
transmitter and the CRs when vitality identification and
disseminated choice combination are connected to a

252
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
cognitive radio system[11]. In particular, we determine the
ideal voting tenet, i.e., the ideal estimation of 𝑛 for the "𝑛-
out-of-𝐾" principle. We likewise focus the ideal
identification limit to minimize the slip rate[12]. We further
propose a quick range sensing calculation for vast cognitive
systems which requires just a couple, not all, cognitive
radios in helpful range sensing to get a target mistake.
2. CHARACTERSTICS
Along these lines two primary qualities of the cognitive
radio are:
 Cognitive Capability- It alludes to the
capacity of the cognitive radio to sense the earth or
channels utilized for transmission and infer the data about
the condition of the channel. It envelops all the essential
capacities of the cognitive radio like range sensing, range
investigation and range choice. Discovering the empty
groups and selecting the most proficient of all accessible
choices is principle character of cognitive.
 Reconfigurability- It alludes to
programming the radio powerfully without rolling out any
improvements to its equipment area. Cognitive radio is a
product based radio and not equipment based so it has the
capacity to switch between diverse remote conventions
furthermore bolsters various applications. This product
based methodology gives the re-configurability qualities to
the cognitive radio. With this it can without much of a
stretch switch between frequencies, change tweak plans and
screen force levels without influencing any of the
equipment ga.
3. PARAMETERS
There are fundamentally three parameter on which capacity
or part of vitality identification method depends so we have
to take much consideration about these parameter their
names are given as
 Probability of Detection,
 Probability of Miss identification
 Probability of False Alarm
Presently we talk about them one by one qu.
Probability of Detection
It is the capacity of Cognitive Radio to recognize the
accessibility essential flag by contrasting approaching sign
and the edge one. For better execution estimation of this
parameter ought to be high. For this we require limit esteem
we taken it as chi square yet straightforward
comprehension we take it as T and approaching sign is
taken as P it implies it is a force level of approaching sign.
what's more for vitality identification we must need a high
SNR for better execution on the grounds that this technique
for discovery is falls flat at lower SNR. We characterize the
SNR as the proportion of the normal got sign force to the
normal clamor power we require the likelihood of false
caution Pf Then the limit is discovered in view of the
formulae in Section For correlation, we likewise reenact the
vitality discovery with or without commotion vulnerability
for the same framework. The edge for the vitality location
is given in. At commotion instability case, the limit is
constantly situated in light of the accepted/assessed clamor
force, while the genuine clamor force is changing in every
253
ISBN: 978-81-924893-0-8
Monte Carlo acknowledgment to a certain degree as
determined by the commotion vulnerability element For
Understand basically we take as basic e.g. as; For e.g.:-
P>T then flag is accessible means no vacant band and the
other way around. From this it is clear that we require a
high SNR for better use So for better use this component
must be higher.
Probability of False Detection-
Due to vicinity of considerably more Noise can command
on the level on genuine approaching sign and along these
lines P>T because of vicinity of commotion and cognitive
Radio take it as force level of approaching sign and it can
distinguish the sign and this think is called False Detection
in the channel some time cognitive radio can false
recognize the sign so estimation of this parameter must be
low.
Probability of Miss Detection-
Now and then cognitive Radio get to be not able to
recognize the sign vicinity that is called miss identification
so estimation of this parameter ought to be low.
Furthermore chart evidence of both of these parameter
indicated combindly.
4. RELATED WORK
Range Sensing is extremely need work for giving the
administration to numerous clients from the free empty
band these clients are called optional clients And other
band that are held for some association that called essential
Users. As we seen such a variety of ways are utilized to
finish it however their no appropriately about the parameter
of Energy Detection for better use So our hypothesis tries
to provide for some more essential data to it.
Subhashri G.Mohapatra, Ambarish G.Mohapatra, Dr. S. K.
Lank[1] In this paper three system of range sensing vitality
recognition, coordinated channel, Cyclostationary based
location in cognitive radio system environment were
examined alongside their execution, appropriateness,
adequacy under distinctive transmission conditions. They
assessed the execution of cognitive radio with vitality based
and cyclo-stationary based recognition utilizing distinctive
windowing methods. Re-enactment results demonstrated
that the Cyclostationary based methodology gives better
results under low SNR condition with a few windows and
with rest of windows execution is not tasteful when SNR is
in scope of -20 dB.
M.Lakshmi, R.Saravanan, R.Muthaiah[2]In this paper four
distinctive procedure of range sensing specifically vitality
location, coordinated channel, Cyclostationary based
discovery, multi determination range sensing were talked
about. Out of these four primary centre of this paper is on
MRSS (multi determination range sensing) in view of
wavelet based change for multi-determination sensing
gimmick. Reproductions results demonstrated MRSS
analyzed wide range with low power utilization, Faster
distinguishment, fast operation.
Xushiynu, Zhaozj, Shangjn[3] In this paper range sensing
in light of Cyclostationary were talked about. Creators
proposed Combination identification strategy utilizing
numerous recognition point for sensing. Reproductions
results demonstrated that better location execution were
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
accomplished utilizing this system and some work were
carried out on lessening many-sided quality too.
Mayank Sachan, Shipla Gupta, Anjali Kansal[4] In this
paper two methods for Energy recognition in view of
Cooperative plan named P out of I helpful and Hybrid
bunch methodology were talked about on premise of
parameter exactness and pace. Reproductions results
demonstrated this plan would be wise to location for
essential client than different past plan.
Varaka Uday Kanth, Kelli Ravi Chandra, Rayala Ravi
Kumar[5] In this Authors talked about diverse range
imparting procedures in cognitive radio system for viably
using the recurrence range. Range offering in light of
Architecture Spectrum Allocation Behaviour Spectrum
Access systems were proposed. Conclusion indicated range
offering systems use range in more compelling way.
Soudilya. P[6] In this paper Combined Design (for channel
access and range sense) was talked about for auxiliary hubs
to better get to the channel and minimize the impacts of
channel sensing slips. Re-enactment results demonstrated
that there is extensive increment in optional client access
probabilities which expand Throughput and diminishing
Delay of both essential and auxiliary systems.
Bodepudi Mounika, Kelli R Chandra, R.R. Kumar[7] In
this paper sensing systems and Issues which prompt
vulnerability in sensing were talked about. In this
Interference based location approach gave thought of ultra
wide band innovation for cognitive radio to exist together
and at the same time transmit with essential client.
Different issues which ought to be taken consideration into
psyche when managing CR methodologies were useful for
effective recognition.
Shunqing Zhang, Tianyu Wu, Vincent K.N.Lau[8] In this
paper Energy discovery based agreeable sensing plan for
the cognitive radio frameworks were proposed. This plot
significantly lessens the period overhead, sensing reporting
overhead of the auxiliary frameworks and the force
booking calculation alertly assign the transmission force of
the agreeable sensor hubs. Reenactments results
demonstrated that the false caution and miss identification
execution of this helpful sensing plan enhanced as there is
in expand the quantity of agreeable sensor hubs.
Anirudh M. Rao, B. R. Karthikeyan, Dipayan Mazumdar,
Govind R. Kadambi[9] In this Principal Component
Analysis plan for Energy location range sensing was
examined. Creators found adjustment component to past
segment investigation to compare sign to clamor force of
got sign to SNR of genuine sign. Reenactments results
indicated Modified Energy location can sense range gap in
more precise way. Problem Formulation In reference base
paper authors proposed window techniques for
Cyclostationary and compare with Energy detection but
there are some points which require important
consideration taken care into. And this information is also
needed for better utilization of bandwidth and so we can
increase the efficiency in Cognitive Radio.
5. Problem Formulation
1) Not notice obviously anything about likelihood of
Detection (Pd), likelihood of False Alarm (P f), likelihood of
254
ISBN: 978-81-924893-0-8
Miss Detection (Pm). As we know for working with
cognitive Radio Field we have to correct working
information of these parameter.
2) Energy based indicator neglected to identify the sign at
low SNR.
6. METHODOLOGY
For effective consummation of our work we pick a product
as all acquainted with MATLAB. It is best programming
for any sort of programming and reproduction with more
exactness.
We use here MATLAB Coding to conquer the issues of
past frameworks particularly in SNR. We take principle
consideration about the Rayleigh technique in Energy
Detection Scheme. Where we contrast approaching flag and
contrast it and edge one with recognize the vicinity of
essential client.
Our Method is less computational, intricate and simple to
actualizes to enhance the SNR in Energy Detection as
contrast with past qualities.
7. DISCUSSION
Vitality Detection Scheme Energy of the Received Signal is
Compare with Energy of Threshold esteem in certain
recurrence band Take the choice about the vicinity of
essential sign or not. The figures of our dialog demonstrate
that with a specific end goal to get solid execution in
difficult engendering situations, joint effort among optional
clients is essential. The execution for a solitary auxiliary
client working alone is altogether more awful in Rayleigh
blurring direct than in AWGN. Joint effort among optional
clients brings the general identification execution in
Rayleigh blurring on the same level with the general
community oriented discovery execution in AWGN. Joint
effort gives spatial assorted qualities and in this manner
decreases the effect of blurring on the general identification
execution. That is, the likelihood that each auxiliary client
is all the while in a profound blur is littler as the quantity of
spatially dislodged optional clients increments. Utilizing
different cyclic frequencies further enhances the execution.
The execution change is 1–2 d
8. REFERENCES
[1] Federal Communications Commission, "Range Policy
Task Force," Rep. ET docket no. 02-135, Nov. 2002.
[2] J. Mitola and G. Q. Maguire, "Cognitive radio: making
programming radios more individual," IEEE Personal
Common., vol. 6, pp. 13-18, Aug. 1999.
[3] D. Cambric, S. M. Mishra, and R. W. Brodersen,
"Usage issues in range sensing for cognitive radios," in
Proc. Asilomar Conf. Signals, Frameworks, Computers,
Nov. 2004, vol. 1, pp. 772-776.
[4] W. Zhang and K. B. Letaief, "Helpful range sensing
with transmit what's more transfer differing qualities in
cognitive radio systems," IEEE Trans. Remote Common.,
vol. 7, pp. 4761-4766, Dec. 2008.
[5] G. Ganesan and Y. G. Li, "Helpful range sensing in
cognitive radio systems," in Proc. IEEE Symp. New
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Frontiers Dynamic Spectrum Access Networks

(DySPAN'05), Baltimore, USA, Nov. 2005, pp. 137- 143.
[6] A. Ghasemi and E. S. Sousa, "Shared range sensing for
crafty access in blurring situations," in Proc. IEEE Symp.
New Frontiers in Dynamic Spectrum Access Networks
(DySPAN'05), Baltimore, USA, Nov. 2005, pp. 131-136.
[7] S. M. Mishra, A. Sahai, and R Brodersen, "Agreeable
sensing among
cognitive radios," in Conf. Rec. IEEE Int. Conf. Common.
(ICC'06), Turkey, June 2006, vol. 4, pp. 1658-1663.
[8] K. B. Letaief and W. Zhang, "Agreeable interchanges
for cognitive radio," Proc. IEEE, vol. 97, no. 5, pp. 878-
893, May 2009. [9] Z. Quan, S. Cui, and A. H. Sayed,
"Ideal direct participation for range sensing in cognitive
radio systems," IEEE J. Sel. Themes Signal Process., vol. 2,
no. 1, pp. 28-40, Feb. 2008.
[10] E. Peh and Y.-C. Liang, "Streamlining for agreeable
sensing in cognitive radio systems," in Proc. IEEE Int.
Remote Common. Organizing Conf., Hong Kong, Mar.
2007, pp. 27-32.
[11] Y.-C. Liang, Y. Zeng, E. Peh, and A. T. Hoang,
"Sensing-throughput tradeoff for cognitive radio systems,"
IEEE Trans. Remote Common., vol. 7, pp. 1326-1337, Apr.
2008.
[12] B. Chen and P. K. Willett, "On the optimality of
probability degree test for
neighborhood sensor choice standards in the vicinity of
non-perfect channels," IEEE Trans. Inf. Hypothesis, vol.
51, pp. 693-699, Feb. 2005.
[13] A. Sahai, N. Hoven, and R. Tundra, "Some central
breaking points on cognitive
radio," in Proc. Allerton Conf. Communion., Control,
Computing, Monticello, Oct. 2004.
[14] F. F. Digham, M.-S. Alouini, and M. K. Simon, "On
the vitality discovery of obscure flags over blurring
channels," in Conf. Rec. IEEE Int. Conf. Common.
(ICC'03), Anchorage, AK, USA, May 2003, pp. 3575-3579.
[15] P. K. Varshney, Distributed Detectiona and Data
Fusion. Springer, 1997.

255
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Review of Cognitive Radio by Cyclostationary Feature

Based Spectrum Sensing
Nishant Goyal
M.TECH (ECE) Student
BGIET, Sangrur
nishant91.goyal@gmail.com

ABSTRACT
The principle of cognitive radio systems is to utilize the licensed
spectrum when their interference to primary users can be
maintained below a certain threshold. Thus, to successfully
coexist, cognitive users must have awareness of primary user’s
presence in the vicinity. As most communication signals exhibit
statistical periodicities, Cyclostationary feature detection can be
used to perform the task of sensing the spectrum for primary
user’s presence. A second-order statistical approach is most
widely used to perform Cyclostationary Feature Detection in
which a set of lags should be chosen for statistical testing. The
optimal method for choosing multiple lags requires knowledge
of the 4th-order cyclic cumulated of Primary user’s signals,
which can be a burden in practice. In this work, a new idea for
lag set selection is presented, which avoids the mentioned 4th-
order cumulated burden. The results are verified via analysis and
simulation. It shows that the performance of the proposed Figure 1: Spectrum utilization [1]
method is comparable to the optimal one in the low signal to
noise ratio region where it is most critical for CR applications. Spectrum sensing that is checking the frequency spectrum for
empty bands forms the foremost part of the cognitive radio.
There are number of schemes for spectrum sensing like energy
KEYWORDS detector, matched filter Cyclostationary based spectrum sensing.
Cognitive radio, Cyclostationary Characteristic Recognition, We have to implement a detector which can perform well under
Range Sensing. low SNR conditions and complexity not as high as the matched
filter. Cyclostationary detector turned out to be the choice for
1. INTRODUCTION such specifications [4]. Cyclostationary based sensing use the
Cognitive Radio is a radio for wireless communications in periodicity property of signals. The signals which are used in
which either a network or a wireless node changes its several applications are generally coupled with sinusoid carriers,
transmission or reception parameters based on the interaction cyclic prefix, spreading codes, pulse trains etc. which result in
with the environment to communicate effectively without periodicity of their statistics like mean and auto-correlation.
interfering with the licensed users [1]. The main interest for the Such periodicities can be easily highlighted when cyclic spectral
cognitive radio users is the frequency range which remains density (CSD) for such signals is found out. Primary user signals
empty for most of the time that is to bring such frequency range which have these periodicities can be easily detected by taking
for unlicensed users in such a way that interference to the their correlation. Fourier transform of the correlated signal
licensed users is minimized. It can also be defined as a radio or results in peaks at frequencies which are specific to a signal and
system that senses its operational electromagnetic environment searching for these peaks helps in determining the presence of
and can dynamically and autonomously adjust its radio the primary user. Noise is random in nature and as such there are
operating parameters to modify system operation. Those system no such periodicities in it and thus it doesn’t get highlighted on
operations can be maximize throughput, mitigate interference, taking the correlation [5]. The main category of interest for the
and facilitate interoperability, access secondary markets [2]. cognitive radio users is the first category in which the hardly
used or empty bands are classified. In layman terms cognitive
radio is nothing but a methodology wherein the first category of
Cognitive Radio is a paradigm that has been proposed so that the
the frequency range is brought to the use for unlicensed users in
frequency spectrum can be better utilized. The formal definition
such a way that interference to the licensed users is minimized
for Cognitive Radio is given as “Cognitive Radio is a radio for
[6]. Spectrum sensing is checking of the frequency spectrum for
wireless communications in which either a network or a wireless
empty bands which forms the foremost part of the cognitive
node changes its transmission or reception parameters based on
radio. There are number of schemes for spectrum sensing like
the interaction with the environment to communicate effectively
Energy Detector, matched filter Cyclostationary based Spectrum
without interfering with the licensed users” [3].
Sensing. The need is to implement a detector which can perform

256
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
well under low SNR conditions and complexity not as high as
the matched filter. Cyclostationary detector turned out to be the
choice for such specifications [7]. Cyclostationary locator ended
up being the decision for such particulars. Cognitive radio work
well for low SNR conditions. It has the capacity to recognize
essential client and clamor.
The parameters that can be used for cognitive radio are as
follows:
SNR (Signal-to-noise ratio) - SNR is a measure utilized as a
part of science and designing that analyzes the level of a coveted
sign to the level of foundation commotion. It is characterized as
the proportion of sign force to the commotion power, frequently
communicated in decibels. A proportion higher than 1:1 (more
noteworthy than 0 dB) shows more flag than clamor. While
SNR is generally cited for electrical signs, it can be connected to
any type of sign, (for example, isotope levels in an ice center or
biochemical motioning between cells) [2].
Probability of detection- As per the hypothesis, there are
various determiners of how a recognizing framework will
distinguish a sign, and where its edge levels will be. The
hypothesis can clarify how changing the limit will influence the
capacity to recognize, frequently uncovering how adjusted the
framework is to the assignment, reason or objective at which it
is pointed.
2. RELATED WORK
In [8], has portrayed that to distinguish the vicinity of the
essential client signal, range sensing is a crucial prerequisite to
accomplish the objective of cognitive radio (CR). It clarifies
Cyclostationary location is the favored strategy to identify the
essential clients getting information inside the correspondence
scope of a CR client at low SNR. Utilizing the proposed location
method, it is watched that the MIMO cognitive radio appreciates
6 dB SNR advantage over single receiving wire when utilizing
four get reception apparatuses for all estimations of likelihood of
identification.
In [9], have outlined new sensing techniques in view of the
eigen estimations of the covariance grid of sign got at the
auxiliary clients. Specifically, two sensing calculations are
proposed, one is taking into account the degree of the greatest
eigen worth to least eigen esteem the other is in view of the
proportion of the normal eigen quality to least eigen esteem. The
techniques can be utilized for different sign location applications
without learning of sign, channel and commotion power.
Reenactments taking into account haphazardly created signs,
remote amplifier flags and caught DTV signs have been carried
out to confirm the techniques.
In [4], proposed and examined procedures for recognition and
grouping of radio flags in a cognitive radio (CR) environment.
Reproduction results demonstrate that it can distinguish the
approaching signs, even at low SNR, if the quantity of
perception pieces is sufficiently huge. One of the strategy's
points of interest is that it doesn't require any from the earlier
information of the transmitting sign with the exception of harsh
data on sign transfer speed. It permits the CR gadget, which tries
to get to a particular divert in an artful way, to indiscriminately
recognize dynamic or authorized client motions in that channel.
Signal characterization can be performed with high precision if
the perception length is sufficiently long. In this work, the cycle
recurrence space profile (CDP) is utilized for sign discovery and
preprocessing for sign arrangement.
257
ISBN: 978-81-924893-0-8
In [10], investigated the new field of cognitive radios with an
uncommon accentuation on one exceptional part of these radios
- range sensing. Firstly, it distinguishes two key issues identified
with the cognitive radio frontend - element range decrease and
wideband recurrence nimbleness. Essential client discovery can
be further enhanced by cutting edge characteristic recognition
plans like cyclostationary identifiers which use the innate
periodicity of balanced signs. Further, individual sensing is not
sufficient for solid discovery of essential clients because of
shadowing and multipath impacts. In such a case helpful choice
making is the way to lessening the likelihood of obstruction to
essential clients.
In [3], has talked about as of late proposed element range
administration and offering plans, for example, medium access
control, range handoff, force control, directing and collaboration
requirement. By tuning the recurrence to the incidentally unused
authorized band and adjusting working parameters to
environment varieties, cognitive radio innovation furnishes
future remote gadgets with extra transfer speed, solid broadband
interchanges, and adaptability for quickly developing
information applications. In this review, the crucial idea about
cognitive radio qualities, capacities, system structural
engineering and applications are displayed.
In [5], have portrayed about the constrained accessible range and
the wastefulness in the range utilization requires another
correspondence standard to endeavor the current remote range
craftily. This new systems administration standard is alluded to
as cutting edge Networks and in addition Dynamic Spectrum
Access (DSA) and cognitive radio systems. XG systems,
outfitted with the inherent capacities of the cognitive radio, will
give an extreme range mindful correspondence ideal model in
remote correspondences. In this overview, inborn properties and
momentum examination difficulties of the XG systems are
introduced. The creator has researched the exceptional
difficulties in XG arranges by a base up methodology, beginning
from the capacities of cognitive radio methods to the
correspondence conventions that need to be created for
proficient correspondence.
In [11], have formulated plans to distinguish and invalidate the
impact of vindictive hubs for the situation where vitality
identifiers are utilized by the sensing gadgets. We utilized a
basic and quick normal mix plan to improve the choice
methodology at the entrance point. Utilizing reproductions, he
has confirmed that the proposed plans can distinguish 'Forever
Yes' clients, 'Constantly No' clients and malignant hubs
delivering compelling qualities.
In [12], has considered cyclostationary range sensing of
essential clients in a cognitive radio framework. He has
proposed single client multi cycle CFAR locators and stretched
out them to oblige client cooperation. In addition, has proposed
a blue penciling strategy for diminishing vitality utilization and
the quantity of transmissions of neighborhood test insights amid
joint effort. Dissimilar to vitality recognition the proposed
cyclostationary methodology has the capacity recognize among
essential clients, optional clients, and obstruction. Besides, it is
not vulnerable to commotion instability. In addition, it is
nonparametric as in no suppositions on information or clamor
disseminations are needed. Joint effort among optional clients is
crucial for moderating the impacts of shadowing and blurring,
and subsequently shortening the location time. In portable
applications battery life is a restricted asset that must be
preserved. A blue penciling plan in which just useful test
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
measurements are transmitted to the FC has been proposed. The
proposed blue penciling plan has been seen as a suitable
methodology for fundamentally diminishing the reporting
overhead without yielding the execution.
In [13], has proposed a recurrence area entropy-based range
sensing plan for CRN and demonstrated to enhance the
recognition execution as for vitality indicator and
cyclostationary indicators. The entropy of the deliberate sign is
evaluated in the recurrence space with the likelihood space
parceled into altered measurements. It has systematically
demonstrated that the proposed plan is strong against
commotion instability. Through Monte Carlo tests, it exhibited
that the proposed finder extraordinarily outflanks vitality finders
and cyclostationary indicators, with 6dB and 5dB execution
enhancement individually. The specimen size is fundamentally
diminished by the proposed plan contrasted with vitality
indicator under the same discovery execution.
3. PROBLEM FORMULATION
The issue of reducing complexity is a challenging process in
Cognitive Radio. The energy detection technique of Cognitive
Radio works only at high SNR. Due to this property of energy
detection mechanism, it will not detect the signal if the as at low
SNR. To overcome the disadvantage of energy detection,
Cyclostationary process can be used for Spectrum Sensing. As
Cyclostationary process does not depend upon SNR, it can
detect any of the signals arriving in its range. It can detect the
presence of the primary user without intervention of SNR. All
the functionalities call for a spectrum aware communication
protocol. It can check the periodicity of the signal, thus it can
evaluate the presence of primary user if signal is periodic.
4. METHODOLOGY
The issue of diminishing multifaceted nature is a testing process
in cognitive radio. The vitality discovery procedure of cognitive
radio work just at high SNR. Because of this property of vitality
identification system, it won't distinguish the sign if the as at
low SNR. To conquer the disservice of vitality identification we
utilize cyclostationary process for range sensing. As
cyclostationary methodology does not rely on SNR, it can
recognize any of the signs landing in its range. It can distinguish
the vicinity of the essential client without mediation of SNR. All
the functionalities require a range mindful correspondence
convention. It can check the periodicity of the sign subsequently
it can assess the vicinity of essential client if sign is occasional.
Since the cognitive radio is to adjust to the environment changes
there must be a high level of co-appointment among diverse
convention stack layers. This happens to be rather than the
traditional correspondence which happens between layers in the
event of altered recurrence allotted applications. All such
research work of improving the execution increase can be
comprehensively arranged under the term cross layer
configuration. In the cross layer configuration field there have
been various understanding of the idea as still it is not
institutionalized and along these lines individuals are working
freely to propose diverse outlines.
5. CONCLUSION
The proposed strategy has the capacity identify the vicinity of
essential client at low SNR. This work has explored
258
ISBN: 978-81-924893-0-8
cyclostationary characteristic identification utilizing various
slacks, in light of the fact that in this we recognize the vicinity of
essential client by checking the periodicity of the sign free of
SNR. Ideal and imperfect strategies for selecting various slacks
have been exhibited and analyzed under different conditions. It
was demonstrated that the proposed problematic system,
contrasted with other existing imperfect systems, can prompt
predominant location execution in the low SNR locale. It is
likewise apparent that both logical and recreation comes about
nearly coordinate.
6. REFERENCES
[1] H. L. Hurd and A. Miamee, Periodically Correlated
Random Sequences: Spectral Theory and Practice., 2007.
[2] T. Pitarque, and E. Thierry P. Rostaing, Performance
analysis of a statistical test for presence of
cyclostationarity in a noisy observation, Speech, and Signal
Processing Acoustics, Ed. Atlanta, GA: IEEE Int. Conf. ,
MAY 1996.
[3] Wang & Raylin, Reasonable Cyclostationary-Based
Spectrum Sensing for Cognitive Radio With Smart
Antennas, 594th ed.: IEEE exchanges on vehicular
innovation, MAY 2010.
[4] Kyouwoong Kim, Cross-layer plan: an overview and the
street ahead, 4312112119th ed., Communications
Magazine, Ed.: IEEE, DEC 2005.
[5] LanF.Akylidz, Delicate Sensing and Optimal Power
Control for Cognitive Radio, 91236383649th ed., Wireless
Communications, Ed.: IEEE Transactions , DEC,2010.
[6] M. Oner and F. Jondral, Cyclostationarity based air
interface recognition for software radio systems , 263266th
ed. Atlanta, GA: IEEE Radio and Wireless Conf., SEP
2004.
[7] P. Kimtho, and J.-I. Takada M. Kim, Performance
enhancement of cyclostationarity detector by utilizing
multiple cyclic frequencies of OFDM signals, 18th ed.:
IEEE Symp. New Frontiers in Dynamic Spectrum, 2010
[8] Rajarsh Mahapatre & Krusbeel, An Efficient Multiple Lags
Selection Method for Cyclostationary Feature Based
Spectrum-Sensing, 202nd ed.: IEEE sign handling letters,
FEB 2013.
[9] Juei-Chin Shen and Emad Alsusa, An Efficient Multiple
Lags Selection Method forCyclostationary Feature Based
Spectrum-Sensing, 202nd ed.: IEEE SIGNAL
PROCESSING LETTERS , FEBRUARY 2013.
[10] Danijela Cabric, Cutting edge/dynamic range access
cognitive Radio Wireless Networks: A Survey,
5021272159th ed.: Computer Networks Journal, 2006.
[11] Praveen Kaliyineedi, Range Sensing Techniques For
Cognitive Radio Systems With Multiple Antennas.: MS
Thesis, Izmir Institute of Technology, 2010.
[12] Arslan and Yucek, Range Policy Task Force Report ,
02155th ed., NOV 2002.
[13] Won-Yeol Lee, Ideal Linear Cooperation for Spectrum
Sensing in Cognitive Radio Networks, 21st ed.: IEEE diary
of chose points in sign handling, FEB 2008.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Review of Simple Distributed Brillouin Scattering

Modeling For Temperature and Strain
Tushar Goyal Gaurav Mittal
M.TECH (ECE) Student Assistant Professor
BGIET, Sangrur BGIET, Sangrur
tushar91.goyal@gmail.com Mitsgaurav@gmail.com

ABSTRACT [3] little temperature changes can be identified by utilizing this

Amalgamation of appropriated Brillouin dissipating
demonstrating in optical strands utilizing a recently created
calculation. The recreations of a conveyed fiber optic sensor are
completed with the go for temperature and strain sensing. The
practices of Brillouin scrambling in optical strands are
contemplated through the backscatter flags under different
working parameters along the optical filaments utilizing the
created MATLAB codes. The examination of backscatter signs
qualities when influenced by temperature and strain are
exhibited. All reproduced models show excellent exactness
versus distributed estimation results. The work completed
cleared route for a more intricate dispersed Brillouin
disseminating demonstrating.
system there by it is conceivable to dodge the overheating issue
in optical filaments. In the fiber optic sensors they consider the
optical fiber as a sensing component. There are characteristic
and extraneous sensors. The primary point of interest of these
are that they are safe to electromagnetic impedance which is an
issue confronted in every correspondence systems. Fiber optic
sensors have numerous favorable circumstances as contrast with
other sensing procedure. By relying on the different standards
the fiber optic sensors are of distinctive sorts like Bragg grinding
sensors, Distributed sensing procedure, Quasi conveyed sensing
and so on[4].

KEYWORDS
Distributed Fiber-Optic Sensors; Brillouin Scattering; MATLAB
Temperature; Strain; Sensing

1. INTRODUCTION
Disseminated fiber optic sensing can be utilized for little
separation ordinarily for a few kilometers. Optical frameworks Figure1: Distributed optic fiber sensing system
are by and large broadly utilized for information correspondence
through the development of laser in 1960. Circulated sensing From the above outline it is clear that if there is any change in
offers high adaptability and pace of estimation. This kind of the deliberate field like temperature, weight or strain varieties it
sensing has the capacity for measuring temperature and strain will be coupled through a fiber optic complex and will be getting
for a large number of focuses in a solitary fiber. This makes data through the sign identification and transforming square. The
appropriated sensing methodology unique in relation to other guideline that lies behind the disseminated sensing methodology
kind of sensing procedure not the same as other sort of sensing is the straight and nonlinear diffusing like Rayleigh scrambling,
methodology [1]. There are essentially straight and nonlinear Brillouin dissipating, Mie dispersing, Raman disseminating and
disseminating methodology occurs in optical filaments [2]. This so forth.
has been utilized to quantify circulated temperature and strain
along the length of the fiber.
The circulated sensors in light of Brillouin scrambling, Rayleigh
disseminating and Raman dispersing thinks that its application
mostly in the structural wellbeing observing. In this Brillouin
based conveyed sensor has been utilized generally to screen
strain and temperature in SHM. In disseminated sensing
procedure it makes utilization of the way that reflection qualities
of a laser pillar going through an optical fiber fluctuates with
temperature and strain along the entire length. By utilizing
appropriated sensing methodology, it is conceivable to take Figure2: Various scattering mechanism
ongoing readings of both temperature and strain.
Other than the customary electronic sensors fiber optic sensors
delineate a few qualities like light weight, vigorous, more 2. RELATED WORK
affectability and so on which serves to screen natural varieties

259
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
In the paper [5] the creator portrays a system for measuring the
Brillouin pick up range in the single mode optical strands. Here
just a solitary laser is utilizing alongside an outer modulator.
Here the creators tried distinctive set of strands with diverse
refractive lists. Here the single laser aides in the era of
inalienable high strength nerves free test signal furthermore the
intelligent pump and test level. The creators tentatively
demonstrated that in the back to back estimation the same fiber
demonstrates a deviation of 100 KHz on the Brillouin recurrence
shift. In this manner this estimation is considering as a standout
amongst the most exact estimation of BGS. The utilization of
modulator for producing a test sign created more favorable
circumstances.
A.Voskoboinik and group [6] introduced a Brillouin diffusing
based sensing procedure which is recurrence scope free in
nature. Here the primary attributes of Brillouin dispersing is the
Brillouin addition and Brillouin recurrence movements are
acquired by utilizing numerous recurrence tones for both the
pump and test waves.
Daniele Inaudi, BrankoGlisic, [7] the creators exhibited the
circulated fiber optic sensor for measuring the temperature and
strain utilizing reproduction setup. Here they introduced the way
of Rayleigh dispersing by utilizing the back scramble signal.
Other than this they considered the impact of the prevailing
commotion source i.e. rational Rayleigh commotion (CRN).
Here the fundamental key point was that for remunerating the
Brillouin power as a result of the progressions in the info force
or fiber misfortunes like weakening, twist, graft they utilized a
Brillouin influence follow which is standardized in nature to that
of Rayleigh back scattered sign. That is, in short they presented
the idea of Landau-Placzek proportion (LPR). They likewise
displayed both Rayleigh and Brillouin disseminating in the time
area reflectometry setup. They have additionally done the
investigation of optical force which is scattered nature for
different fiber lengths.
John .M senior [8] the creators clarify a change that happened in
the spatial determination of appropriated fiber Brillouin strain
sensing with the utilization of a consistent wave systems which
is in light of the relationship process. The primary
accomplishment was that the strategies can be valuable for part
of the way extended fiber. This can be utilized as a sensory
system for savvy materials.
K. Krebber [9] added to a Brillouin pick up range in the
scattering moved strands for concurrent estimation of
temperature and strain sensing. Here they give better result by
utilizing the ease non zero scattering moved strands (NZDSF).
This NZDSF guarantees productive estimation of temperature
and strain circulation utilizing the Brillouin diffusing as a part of
optical silica filaments. The primary rule was in view of the
extension of BGS around energized NZDSF as a sensing fiber.
M. A Soto [10] and group displayed a system for measuring
temperature and strain at the same time by utilizing the optical
heartbeat coding strategy. It gives an improvement in sign to
commotion proportion which permits Brillouin power and
recurrence estimation which is exact in nature. The optical
heartbeat coding improves the temperature and strain
determination as for Brillouin sensor at crest force level.
T. Schneider, Danny Hannover and MarknsJunker [11] present
the methodology of creating millimeter waves in the optical
fiber with help of invigorated Brilliouin dissipating procedure.
They got the ideal parameter by utilizing numerical reenactment.
The principle improvement they attained to was that the reliance
260
ISBN: 978-81-924893-0-8
of Brilliouin diffusing upon the fiber length than that of the
pump power. The working strategy of this method is the
different enhancement and heterodyne discovery of twofold
sidebands out of a recurrence chose. They kept up connection
between sideband stages at the time of intensification process
the ideal length
T.Schneider, Danny Hannover and MarknsJuner, [12] they
outlined an appropriated Brillouin sensor whose execution is
totally under the optical differential parametric enhancement
(OPPA). The OPPA gives a slender band parametric Brilliouin
pick up range. This proposed system can be utilized for
measuring conveyed Brillouin pick up range. This proposed
strategy can be utilized for measuring appropriated strain or
temperature .The system demonstrates a high spatial
determination. The inclination floating methodology helps in
adjusting.
R. Bernini, L. Crocco [13] and their group have been created a
recurrence space approach for appropriated fiber optic Brillouin
sensing. Here both the preparing performed in recurrence space.
Here the remaking is gotten with the assistance of utilizing
expense capacity which is utilized for measuring the obscure
strain and temperature values. They gave a stream outline to the
remaking calculation.
3. PROBLEM FORMULATION
An optical fiber is a barrel shaped dielectric waveguide (no
leading waveguide) that transmits light along its hub, by the
methodology of aggregate interior reflection. The fiber
comprises of a center encompassed by a cladding layer, both of
which are made of dielectric materials. So as to keep the optical
flag in the center, the refractive record of the center must be
more prominent than that of the cladding Physical parameters of
optical fiber can be influenced by temperature and strain, which
turn into the embodiment of dispersed fiber optic sensing. The
disseminated sensing procedures are generally in view or
something to that affect of light dispersing component (e.g.
Rayleigh and Brillouin diffusing) happening inside the fiber.
The capacity of circulated optical fiber sensing frameworks to
focus physical parameters as a capacity of position along the
fiber has produced escalated examination interest. Circulated
optical fiber sensors are essential when vast structures are to be
checked, for example, scaffolds, dams and shafts.
This paper concentrates on dispersed optical fiber sensors in
light of the sensation of SBS. In this kind of fiber optic sensor, a
beat of laser light is propelled into one end of the sensing fiber
through a directional coupler and the time subordinate qualities
of the light that is backscattered to the same fiber end are
measured. This arrangement is in view of the guideline of
Optical Time Domain Reflectometry (OTDR). As the beat
engenders along the fiber, it is scattered by Brillouin dispersing
systems back to the starting end where it is distinguished by the
recipient. In the meantime, the engendering heartbeat
additionally. Encounters Rayleigh scrambling, wherein it‟s
apparent as clamor to the back reflected sensing sign. Brillouin
diffusing alludes to the disseminating of an episode light wave
by the acoustic phonon of a medium, which is the backscattering
of light because of the connection between the occurrence
photon and an acoustic photon. At the point when this procedure
happens in an optical fiber, the backscattered light experiences a
recurrence shift known as the Brillouin shift following the
recurrence movement of a Brillouin pick up range is delicate to
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

of the fiber mode and the speed of acoustic waves inside the
fiber, it changes at whatever point these amounts change in light
of neighborhood natural varieties and can be utilized to find the
temperature and strain along the fiber.
The venture starts by building a straightforward scientific
Brillouin scrambling model utilizing the couple mode
mathematical statements that relate the forward sign with the
backscattered sign. At that point, an altered scientific recipe is
produced.
Figure 3: Optical Time Domain Reflectometer
.
the temperature and strain, it turns into an exceptionally helpful
impact to fabricate fiber optic sensors.
Then again, in Rayleigh scrambling, as a solitary optical wave
goes along the center of an optical fiber, Rayleigh light is
scattered in all bearings from spatial variances of the refractive
file in the optical fiber this is because of the irregular and
garbled warm changes.

4. METHODOLOGY
The different mathematical statements that are utilized as a part
of the recreation of the optical fiber sensor. The advancement of
Brillouin disseminating in optical strands is represented by a
situated of two between related comparisons under enduring
state condition. They are called rate mathematical statements
𝑑𝐼𝑝
= −𝑔𝐵 𝐼𝑃 𝐼𝑆 − 𝛼𝐼𝑃 (1)
𝑑𝑧

𝑑𝐼𝑆
= −𝑔𝐵 𝐼𝑃 𝐼𝑆 − 𝛼𝐼𝑆 (2)
𝑑𝑧

Here, IP, IS, gB, and Į speak to the Stokes power, the pump force,
the Brillouin pick up coefficient and the misfortunes at
pump/Stokes frequencies individually

The primary term on the right-hand side of mathematical

statement (1) portrays the Brillouin pick up. While, the first term
on the right hand side of mathematical statement (2) expresses
the pump exhaustion. The second terms of the above
mathematical statements express engendering misfortunes of the
sign and pump influence/intensities individually. The
fundamental thought basic the utilization of Brillouin dispersing
for fiber sensors can be comprehended from the Brillouin
recurrence shift, connection that is given by
2𝑛𝑉 𝐴
𝑣𝐵 = (3)
𝜆𝑂
5. DISCUSSION
The principle codes ring a capacity to unravel the ODEs. The
MATLAB summon ode45 performs a direct numerical joining
of a set of differential comparisons I'=f (z, I), to some last
separation zf. The principle codes pass the characterized
qualities to the capacity. The capacity utilizes offered parameters
to tackle the set of ODEs and returns the answer. At that point
the intensities are separated and handled to get the yield. Ode45
utilizes all the while fourth and fifth request Runge-Kutta
recipes to make mistake appraises and alter the time step as
needs.

Where VA is the speed of acoustic waves in the fiber, n is the 6. REFERENCES

successful refractive file of the fiber mode, and is the [1] Daniele Inaudi, BrankoGlisic, “Distributed fiber optic strain
wavelength of the proliferating light. As the Brillouin recurrence and temperature sensing for structural Health monitoring”,
movement relies on upon both the compelling refractive record IABMAS July 2006, Portugal

261
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[2] John .M senior, „optical fiber communication‟ principles
and practice’, 3rd edition 2012
[3] K.Fidanboylu and H.S.Efendioglu “Fiber optic sensors and
applications” 5th IAIS May 2009, Turkey
[4] F.T.S. Yu and S.yin, “Fiber optic sensors”, Newyork,
Marcel Dekker, Inc; 2002
[5] M.Nikles, L.Thevenaz and P.A Robert “Brillouin Gain
spectrum characterization in single mode optical fibers”
Journal of light wave technology, Vol.15, N0, 10 October
1997
[6] A. Winsock, K.Krebber “Simultaneous Measurement of
temperature and strain distribution using Brillouin
scattering in dispersion shifted fibers” 978-1-4244 IEEE
2011
[7] A.H. Reshak, M.M. Shahimin, S.A.Z. Murad , S.Azizan “
Simulation of Brillouin and Rayleigh scattering in
distributed fiber optic for temperature and strain sensing
application” Sensors and actuators A 190(2013) 191-196.
262
ISBN: 978-81-924893-0-8
[8] T.Schneider, Danny Hannover and MarknsJuner,
“Investigation of Brillouin scattering in optical fibers for
the generation of millimeter waves”, Journal of light wave
technology, vol.24, No. 1 January 2006.
[9] K.Hotate and M.Tanaka “Distributed fiber Brillouin strain
sensing with 1-cm spatial resolution by correlation based
continuous wave techniques”, IEEE photonics technology
letters, vol.14, NO.2 February 2002.
[10] A.Voskiboinik, J.Wang et.al “ SBS- based fiber optical
sensing using frequency domain simultaneous tone
interrogation, vol.29, No. 11, June 1, 2011.
[11] Y.Hi, X.Bao et.al, “A novel distributed Brillouin sensor
based on optical differential parametric amplification”,
Journal of light wave technology, vol.28, NO.18,
September 15, 2010.
[12] M.A.Soto, G.Bolognini et.al‟ “Enhanced simultaneous
distributed strain and temperature fiber sensor employing
spontaneous Brillouin scattering and optical pulse coding,”
IEEE photonics technology letters, vol.21, NO.7, April 1,
2009;
[13] R.Bernini, L.Crocco et.al, “All frequency domains
distributed fiber optics Brillouin sensing”, IEEE sensors
journal, vol.3, NO.1 February 2003.
Computer Science & Engineering
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A comprehensive study of AODVv2-02 routing protocol
in MANET
Vikram Rao
Research Scholar
CSE Dept
BGIET, Sangrur
vikramrao@live.in
ABSTRACT
A MANET (Mobile Ad hoc Network) is a collection of self-
governing mobile nodes that can communicate to each other
through wireless links. These are fully distributed networks
and can be work at any place without any pre-existing
infrastructure. Many protocols are available for such type of
Networks. AODVv2-02 is a revised version of AODVv2 (also
known as DYMO) developed by IETF. In this paper we will
discuss its working and its features which makes it different
from other routing protocols. The main goals of this revised
version of AODVv2 is to maintain received RREQ table and
compare the incoming RREQ message, for the elimination of
redundant or duplicate RREQ messages.
Keywords
MANET (Mobile Ad hoc Network) , AODV (Ad hoc on
Demand vector routing) , Routing Protocols , DYMO
(Dynamic On-demand MANET routing protocol) , AODVv2-
02
1. INTRODUCTION
A mobile ad-hoc network (MANET) is a infrastructure less
and self-governing network of mobile nodes, in which all
participating nodes can freely transmit the packets through
wireless transmission media to any remote node in the
network. An ad hoc network doesn‟t have any centralized
administration or server, whereas the control of the network is
allocated among participating nodes. In MANET mobile node
are pretended to be move with more or less relative speed in
random direction. There is no long term ensured path from
one node to another node. MANET have very progressive use
in emergency scenarios like military operations & disaster
relief operation where there is need of immediate
communication network whenever some major event, or some
temporary requirement like conference & meetings at new
place where there is no pre-existing network infrastructure is
available. The figure 1 shows a view of mobile ad-hoc
network [12] and the various characteristics of MANET are as
follows:
1. Distributed Network: There is no background network for
the central control of the network operations. The control of
the network is divided among the nodes. The nodes involved
in a MANET should cooperate with each other and
communicate among themselves and each node acts as a relay
as needed, to implement specific functions such as routing and
security.[14]
263
ISBN: 978-81-924893-0-8
Anuj Kumar Gupta
Associate Professor
CSE Dept
BGIET, Sangrur
anuj21@hotmail.com
2. Multi hop routing: When a node tries to send information to
other nodes which is out of its communication range, the
packet should be forwarded through one or more intermediate
nodes.
3. Light-weight terminals: In maximum cases, the nodes at
MANET are mobile with less CPU capability, low power
storage and small memory size.
4. Self-governing nodes: In MANET, each mobile node is an
independent node, which could function as both a host and a
router.
5. Shared Physical Devices: The wireless communication
medium is accessible to any node with the relevant equipment
and sufficient resources. Accordingly, access to the channel
cannot be restricted
6. Dynamic topology: Nodes are free to move promptly with
different speeds, thus the network topology may change
randomly and at unpredictable time. The nodes in the
MANET dynamically establish routing among themselves as
they travel around, establishing their own network.
Figure 1. A mobile ad-hoc network
2. CLASSIFICATION OF ROUTING
PROTOCOLS
The MANET‟s routing Protocols can be classified in many
ways, but mostly this classification depending on routing
strategy and network structure. According to the routing
strategy these routing protocols can be categorized as Table-
driven, on demand and Hybrid MANET routing protocols.
The classification of routing protocols is shown in the
figure 2.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
DSDV
Table
Driven FSR
(Proactive)
OLSR
On AODV
Manet Routing Demand
Protocols
(Reactive) DSR
ABR
CGSR
Hybrid
ZRP
Figure 2. Classification of MANET Routing Protocols
2.1 Table-Driven Routing Protocols
(Proactive)
These types of protocols maintain a route information from
one node to every other node in the network. Each node
maintains a routing table, contains routing information of the
network. Each node updates its routing table regularly, so that
each node knows the route in advance. Whenever any node
wants to send any message to another node than its path is
already known. Thus, if a route has already known before
traffic arrives, then transmission starts without delay. Other-
wise, message packets should wait in queue until the node
receives routing information from source to destination. These
protocols generally use link-state algorithms which help to
maintain and update a routing table by flooding the link
information about neighbor nodes. It creates more overhead in
routing table to maintains and update the node information
entries for each and every node in the network.
2.2 On Demand Routing Protocols
(Reactive)
In Reactive Protocols, there is no need to maintain routing
information between nodes in the network, if there is no
communication [12]. Whenever any node wants to send
packets to another node in the network, only than it starts with
a route discovery process throughout the network. This
process runs until routing information is determined or all
possible permutations have been searched. Once a route has
been determined, it is maintained by a route maintenance
process either until the route is no longer required or until the
destination becomes inaccessible to every path from the
source. Therefore, theoretically the communication overhead
is decrease due to route research [4].
2.3 Hybrid Protocols
Hybrid protocol integrates the features of both proactive as
well as reactive protocols.[4]. It is a combination of proactive
and reactive routing and it is based upon distance vector
protocol but contain many features and advantage of link state
protocol. Hybrid protocol enhances interior gateway routing
protocol.
264
ISBN: 978-81-924893-0-8
2.4 COMPARISON OF TABLE DRIVEN
AND ON-DEMAND ROUTING
PROTOCOLS
1. In Reactive Protocols, Average end-to-end delay or the
time taken to send data from source to destination is variable
but remains constant in Proactive Protocols for a given mobile
Ad hoc network.
2. In On-Demand Protocols, the delivery of packet data is
much more efficient than in Proactive Protocols.
3. Reactive Protocols are faster in performance than Proactive
protocols.
3. AODVv2-02 PROTOCOL OVERVIEW
AODVv2 (DYMO) is the successor of the AODV reactive
routing protocol used for MANET. With many changes
DYMO is designed with future enhancements in mind. It is
implemented by many researchers to analyze its performance
in comparison to other routing protocols designed for
MANET. IETF has published its revised version as a draft
„draft-ietf-manet-aodvv2-02‟ and is still in progress. It is
purposed by C. E. Perkins, S.Ratliff, and J.dowdell [9]. Using
AODVv2 as the basis, AODVv2-02 borrows Path
Accumulation and Multi-hop routing from AODVv2. With
the help of AODVv2-02 MANET routing protocol, reactive
and multi-hop routing can be done between different
participating nodes that wants to communicate with each other
[13]. Some characteristics of AODVv2-02 Protocol are given
below:
 AODVv2-02 Protocol has low routing overhead.
 Protocol Implementation become simple and easy
using path accumulation function.
 The basic operation of AODVv2-02 protocol
involves route discovery and route maintenance.
 AODVv2-02 can be used in both IPv4 and IPv6.
 ADVv2-02 is a better routing protocol for multi-hop
networks.
 This protocol is energy efficient for large networks.
3.1 WORKING OF AODVv2-02
PROTOCOL
Similar to DYMO, the basic operation of AODVv2-02
protocol are route discovery and route maintenance [7]. Route
discovery is performed by sender node to a target node for
which it does not have a valid route and route maintenance is
performed in order to avoid exiting eradicate routes from
routing table and also to decrease packet dropping due to
route breakage or node failure. This protocol can be work as
both reactive and as proactive protocol.
3.2 AODVv2-02 Route Messages
AODVv2-02 protocol implements three types of route
messages during routing operations are Route Request
(RREQ), Route Reply (RREP), and Route Error (RERR) [7].
These are route control messages used to find and maintain
path from source node to any particular target node.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3.3 Route Discovery
During the Route discovery process, the originating node
starts broadcasting of Route Request (RREQ) message
throughout the network to find a path to a particular target
node. Due to AODVv2-02 path accumulation function, each
intermediate node will attach its own address to the RREQ
message. Each intermediate node that propagates the RREQ
message makes a note to the backward path. Figure 3 shows
AODVv2-02 route discovery process, node A is the source
node and node I is the target node. Thus, node A generates
RREQ message which contains its own address, hop count,
sequence number, target node address and then broadcast it on
the network. Each intermediate node having a valid path to
the target keeps on adding its own address and sequence
number with the RREQ message as shown in figure 3 with
nodes D and E, till target is reached. Upon sending RREQ
message in the network, the source node waits for a RREP
(route reply) message. The target node replies with RREP
message. Incase no RREP is received within the particular
wait time; the source node may try again by sending another
RREQ message after some time to discover the route. In this
way AODVv2-02 discover the route from Source node to
target node [7, 12]. One of special feature of AODVv2-02 is
energy efficient .If any node is low on energy; it has option to
not engage in route discovery process.
Figure 3. AODVv2-02 Route Discovery
3.4 Route Maintenance
During the route maintenance process, each node
continuously monitors the status of links and maintains the
latest updates within the routing table. If a route to the target
is lost or a route to the target is not known, then RERR
message is sent towards the message source node, to specify
that route is being invalid or missing towards a particular
node. Upon receiving RERR message, the route table is being
updated and the entry with invalid link is deleted. As shown in
Figure 4 , node D received a packet that wants to go to node I
, but the route from node D to node I is found broken . After
this, a RERR message is generated by node D and forward it
to the target node A. All the intermediate nodes on the path
immediately update their route table entries with the new
updated information regarding invalid path and new route
changes. After updating new route information the packet will
be forwarded from node D to node F and then to node I in
order to reach its target node.
265
ISBN: 978-81-924893-0-8
Figure 4. AODVv2-02 Route Maintenance
3.5 WORKING DIFFERENCE OF
AODVv2-02 MANET ROUTING
PROTOCOL
The main difference of AODVv2-02 MANET routing
protocol is to maintain a received RREQ table, in-order to
eliminate the duplicate RREQ message by comparison of
incoming RREQ message with received RREQ table entries.
Two RREQ incoming request message can be compared if
they were sent to find a route for the same destination with
same Metric type by same AODVv2 router. Whenever a
router receive an RREQ message, it must check it with
previous RREQ message , in order to assure that its response
RREP message would not contain any duplicate information.
So to avoid retransmission of these duplicate RREQ message,
each AODVv2 router needs to save a list of certain
information of recently received RREQ messages.
This list of RREQ messages are called AODVv2-02 Received
RREQ message table. Two RREQ messages can be compared
if they have same Metric type, OrigNode and TargNode
addresses. RREQ table contain given fields for each RREQ
entry.
Table 1. AODVv2-02 Received RREQ Table
Metric type Sequence Number
OrigNode address TargNode address
Metric Timestamp
3.6 Elimination of redundant/duplicate
RREQ messages
Whenever RREQ messages are multicast in the network for
route discovery, in common situations AODVv2 router might
reply with redundant or duplicate information to some
recently received RREQ message. An AODVv2 must
suppress/eliminate these duplicate RREQ message before
replying. To determine that recently received incoming RREQ
message contains new information or not, is done by checking
the received RREQ table list maintained by AODVv2 routers
as given below:
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
1. AODVv2 router checks the received RREQ table entries
that the incoming RREQ message have same OrigNode ,
TargNode and Metric Type , if there is such entry than the
RREQ message is suppressed/eliminated , otherwise RREQ
table Adds new entry.
2. Even if there is an entry in received RREQ table but
incoming RREQ with new sequence number than the previous
table entry is updated with new sequence number to reflect the
new entry. Otherwise incoming RREQ messages must be
suppressed/eliminate to reduce the overhead of replying to
these redundant messages again and again.
3. Similarly, if new RREQ message have Same Sequence
number but incoming RREQ message offers better metric
type, then the new RREQ incoming message is not eliminate
and in order to reflect the new metric received RREQ table
entry must be updated.
4. CONCLUSIONS
In this paper we have discussed various features of MANET
(mobile ad-hoc networks) routing protocols. These protocols
are classified in three main categories: Table-driven, On-
demand and Hybrid protocols and also their comparison has
been done. The AODVv2-02 protocol working with its basic
operations like route discovery and route maintenance are
discussed in detail. The main differentiating factor of aodvv2-
02 routing protocol is to maintain a received RREQ table at
each node and then compare the new RREQ messages with it ,
in order to eliminate the duplicate RREQ messages. Due to
changing topology and security attacks in mobile ad-hoc
networks, lot of research and development on AODVv2-02 is
still required. A comparison of AODVv2-02 routing protocol
can be done with different reactive protocols in order to
evaluate its performance.
REFERENCES
[1] Amit Shrivastava, Aravinth Raj Shanmogavel, Avinash
Mistry, Nitin Chander, Prashanth Patlolla, Vivek
Yadlapalli. “Overview of Routing Protocols in
MANET‟s and Enhancements in Reactive Protocols”.
[2] Surendra H. Raut, Hemant P. Ambulgekar, “Proactive
and Reactive Routing Protocols in Multihop Mobile Ad
hoc Network”, International Journal of Advanced
Research in Computer Science and Software
Engineering, April 2013, Volume 3, Issue 4, pp. 152-
157.
266
ISBN: 978-81-924893-0-8
[3] Olivia, “Difference Between Reactive and Proactive
Protocols”, 2011.
[4] Mr. L Raja and Capt. Dr. S Santhosh Baboo,
“Comparative study of reactive routing protocol
(AODV, DSR, ABR and TORA) in MANET”,
International Journal of Engineering and Computer
Science, March 2013, Volume 2, Issue 3, pp. 707-718.
[5] Amandeep, Gurmeet Kaur, “Performance Analysis Of
AODV Routing Protocol In Manets”, International
Journal of Engineering Science and Technology
(IJEST), August 2012, Vol. 4, No.08, pp. 3620-3625.
[6] Salman Bhimla, Neeru Yadav,” Comparison between
AODV Protocol And DSR Protocol In Manet”,
International Journal of Advanced Engineering
Research and Studies, Oct.-Dec., 2012, Vol. II, Issue I,
pp. 104-107.
[7] Anuj K. Gupta, Harsh Sadawarti and Anil K. Verma,”
IMPLEMENTATION OF DYMO ROUTING
PROTOCOL”, International Journal of Information
Technology, Modeling and Computing (IJITMC), May
2013, Vol.1, No.2, pp. 49-57.
[8] Narendran Sivakumar, Satish Kumar Jaiswal,
“Comparison of DYMO protocol with respect to
various quantitative performance metrics”.IRCSE‟09 ,
IDT workshop on interesting results in computer
science and engineering,oct‟2009.
[9] C. E. Perkins, S.Ratliff, J.dowdell, “Dynamic MANET
On-Demand (AODVv2) Routing”, Internet Draft,
draft-ietf- manet- aodvv2-02, work in progress, 2014.
[10] Sujata V. Mallapur, Siddarama . R. Patil, “Survey on
Simulation Tools for Mobile Ad-Hoc Networks”,
International Journal of Computer Networks and
Wireless Communications (IJCNWC), April 2012,
Vol.2, No.2, pp. 241-248.
[11] Nitin Kumar, Kunj Vashishtha, Kishore Babu,” A
Comparative Study of AODV, DSR, and DYMO
routing protocols using OMNeT++”, International
Journal on Recent and Innovation Trends in Computing
and Communication, September 2013, Volume: 1,
Issue: 9, pp. 735-739.
[12] Jatinder pal Singh and Anuj Kumar Gupta “ A Review
On Dynamic MANET On Demand Routing Protocol in
MANETs ” International Journal of advance trends in
Computer Science and Engineering , ISSN No. 2278-
3091 , Volume 2 , No.2,March-April2013.
[13] Saloni Sharma and Anuj Kumar Gupta “A
Comprehensive Study Of DYMO Routing Protocol”
International Journal of Computer Application (0975-
8887) ,Volume-73, No.22 , July 2013.
[14] Aarti and Dr.S.S. Tyagi “ Study Of MANET :
Characteristics , Challenges Application and Security
Attacks ” International Journal of advance Research in
Computer Science and Software Engineering , ISSN
No. 2277 128X , Volume 5 , Issue 5 No.2 , May2013.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Survey on Zone Routing Protocol

Nafiza Mann Abhilash Sharma Anuj Kumar Gupta

PG Student Assistant Professor Associate Professor
CSE dept. CSE dept. CSE dept.
RIMT- Institute of Engineering RIMT- Institute of Engineering Bhai Gurdas Institute of
and Technology, and Technology, Engineering and Technology,
Mandi-Gobindgarh Mandi-Gobindgarh Sangrur

nafizamann@gmail.com abhilash583@yahoo.com anuj21@hotmail.com

ABSTRACT nature sent to certain set of peripheral nodes (surrounded). If

In this paper, the Zone Routing Protocol (ZRP) is surveyed in case there is no reply after BRP, these set of nodes again
for the nature of its parametric performance. ZRP is hybrid perform bordercasting to their peripheral nodes.Two main
routing protocol works on various routing phenomenon such approaches may be followed for bordercasting, root directed
as Intra-Zone Routing Protocol (IARP) which routes within its bordercast and distributed bordercast. The query control
routing zone, Inter-Zone Routing Protocol (IERP) which mechanism in ZRP includes: Query Detection (QD1/QD2),
routes outside the routing zone, Bordercast Resolution Early Termination (ET), and Random Query Processing Delay
Protocol (BRP), Query Control Mechanisms includes Query (RQPD). In bordercast tree all nodes can detect the QD1 and
Detection (QD1/QD2), Early Termination (ET), Random can avoid the redundancy of queries in node‟s routing zone.
Query Processing Delay (RQPD). Multicast Zone Routing Overhearing in transmission range by any node is possible,
Protocol, Two-Zone Routing Protocol along with security of extending the QD2. During relaying of query, it can prune
Zone Routing protocol in considered. The analyzed covered nodes or already relayed nodes resulting ET. With
performance of the variety of parameters such as PDR (Packet RQPD a relaying node can have another chance to prune
Delivery Ratio), Average Jitter, Average Throughput, downstream nodes.
Average End-to-End Delay, Route Acquisition Latency,
Control Traffic, Overhead of Zone Routing Protocol in 2. ZRP ARCHITECTURE
different simulating environment under the normal and with ZRP acts as a framework for other protocols. The local and
blackhole attack circumstances is compared. global neighborhood in ZRP are separated in such a way so as
to gain advantages of each routing technique. Local
Keywords neighborhood, named as „Zone‟, have number of nodes which
Hybrid Routing, Proactive Routing, Reactive Routing, may be overlapped within different zones (may have different
Routing zone, Blackhole Attack, Performance parameters. sizes). Size of the zone in ZRP is defined as the count of
number of hops it takes to reach to its peripheral nodes called
1. INTRODUCTION „Zone Radius‟ [1]. This hybrid behavior suggest and decide to
ZRP is among most popular hybrid routing protocols. Zone
follow the technique among both. This initiates route-
Routing Protocol is a prominent protocol combining both
determination procedure on demand but at limit search cost
proactive and reactive nature of routing. It is the ad hoc
[2]. The proactive nature of this protocol minimizes the waste
protocol in which proactive procedure is being followed
count associated to this technique. The Zone Routing Protocol
within a scope of local neighborhood or routing zone only.
consists of several components, which only together provide
ZRP composed of Intra-Zone Routing Protocol (IARP), Inter-
the full routing benefit to ZRP [14].
Zone Routing Protocol (IERP), Bordercast Resolution
Protocol (BRP) along with various Query Control
mechanisms. IARP has limited scope which is defined by
zone radius. Within this routing zone radius, IARP very well
maintains the topology information of its local zone. IERP
acts as a global routing component for ZRP. Whenever a node
needs to send information outside the routing zone or the
route needed by a node is not available in local neighborhood,
IERP is used to send the data. As the traditional nature of
reactive routing protocols, route discovery and route
maintenance is also performed by IERP. For the reduction of
routing overhead Bordercast Resolution Protocol is used. By
using the information provided by IARP, it directs the route
requests outward. The outward request sent is multicast in Fig 1: ZRP Architecture

267
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Each component works independently of the other and they about local topology, IERP perform the on-demand routing
may use different technologies in order to maximize mechanism [15]. In presence of route, it issues route queries.
efficiency in their particular area. Components of ZRP are Bordercasting helps to minimize the delay caused by route
IARP, IERP and BRP. The relationship between components discovery. Redundancy of nodes (already covered) is avoided.
is illustrated in Figure 1. IARP is responsible for proactive An example is illustrated in Figure 3.
maintenance while IERP for the reactive one. Bordercasting
leverages IARP‟s up-to-date view of local topology to
efficiently guide route queries away from the query source
[3].

2.1 Intra-Zone Routing Protocol (IARP)

This protocol communicates with interior nodes of the zone.
Zone radius limits the zone size. In IARP, the change in
topology results in change in local neighborhood. IARP
signifies the use of indoor routing zone. It always desires to
update the routing information [4]. IARP helps in removal of
node redundancy along with tacking to link-failures. Figure 2.
Shows the routing zone concept with radius 2 hops. Here S is Fig 3: IERP operation
considered as a source node having zone radius of 2 hops. So
S prepares to send data to destination D. S checks if D exists
in this case, the node A, B are considered as interior nodes
in its local neighborhood. If so, route is already known by S.
having hop count less than zone radius. The nodes C, D and G
Otherwise, a query is sent to its peripheral nodes by S i.e. (C,
are considered to be peripheral nodes having hop count less
G, H). These peripheral nodes further checks for D in their
than or equal to the zone radius. While Nodes E, F have the
routing zone. Like in here, when H send query to B, B
hop count greater than the zone radius, i.e. Outwards the
recognized D as the node in its routing zone and respond back
specified zone.
to query. The path then established is S-H-B-D [3].

2.3 Bordercast Resolution Protocol (BRP)

Fig 2: A routing zone of radius 2 Hops
However, it should be kept in mind that zone is not a
description of physical distance [3]. Media Access Control
(MAC) protocol and Neighbor Discovery Protocol (NDP) can
be use to provide identification of neighbors. Operation of
IARP is done by broadcasting “hello” beacons. The reception
of these beacons indicates the connection establishment.
2.1.1 When to send
Source node send new routing information if:
 there is change in topology or there is a link failure,
 there is change in routing zone of node,
 if the node has not send the packet in its previous
time slot.
2.2 Inter-Zone Routing Protocol (IERP)
It is the global reactive routing component of ZRP. IERP is
responsible for acquiring route to destination that are located
beyond the routing zone. With the help of knowledge gained
Whenever route is requested with the global reactive
technique, BRP is used to nonstop it and maximizes its
effectiveness. IARP routing information is used by BRP. This
information is constructed by IARP from its map provided by
local proactive technique. It maintains the redundancy
removal phenomenon by pruning the nodes it has already
covered (received the query) i.e. When a node receives a
query packet for a node that does not lie within its local
routing zone, a bordercast tree is constructed so that it packet
can be forwarded its neighbors. Upon reception of the packet,
bordercast tree is reconstructed by these nodes so they can
determine whether or not it belongs to the tree of the sending
node. If it does not belongs to the bordercast tree of the
sending node, it continues to process the request and
determines if the destination lies within it‟s routing zone and
takes the appropriate action, so that the nodes within the zone
are marked covered [1]. The two approaches of BRP are
2.3.1 Root Directed Bodercast
In this source nodes and peripheral nodes construct their
multicast trees to which the forwarding instructions to routing
query packet are appended, resulting additional route
overhead which increase with increase in zone radius.
2.3.2 Distributed Bordercast
In this, an extended routing zone is established and
maintained by each node which increases the local routing
information exchanges, resulting in reduction of route
discovery requirement.

268
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2.4 Query Control Mechanism
As per ZRP strategy, querying performing is more efficient
than directly flooding the route requests but due to heavy
overlapping, multiple forwarded route requests can result into
more control traffic than flooding. This happens because
whenever a query is bordercasted, it efficiently covers the
node‟s complete routing zone and excess route query traffic is
the result of redundant query messages. Thus a collection of
query control mechanism is introduced by ZRP.
2.4.1 QD1/QD2
With the help of BRP, the relaying nodes in the tree becomes
able to detect the query which is redundant (QD1). BRP use
bordercast tree hop by hop for this process. It is possible for
queries to be detected within the transmission range of
relaying node, extending query detection capability (QD2).
Bordercast relay QD2
Fig 4: Query Detection (QD1/QD2)
In example, as when node A bordercast to its peripheral nodes
(B-F), The intermediate nodes (relaying) (G, H, I, J) are able
to detect query by QD1. Using QD2, node K able to detect
node G‟s transmission even if node K does not belong to node
A‟s bordercast tree. Even with the high level query detection,
QD2 does not guarantee of the whole routing zone being
informed. Like in here, node L does not overhear and is thus
unaware that L‟s routing is covered by query or not.The
relationship between components is illustrated in Figure 1.
IARP is responsible for proactive maintenance while IERP for
the reactive one. Bordercasting leverages IARP‟s up-to-date
view of local topology to efficiently guide route queries away
from the query source [3].
2.4.2 Early Termination (ET)
In general, it may not be possible to understand that whether
query has perfectly outward to the uncovered zones but the
information obtained from QD1 and QD2 can very well
support Early Termination.
2.4.3 Random Query Processing Delay
(RQPD)Duringbordercast, node‟s routing zone is covered
instantly but even the query take some infinite amount of time
to make a way along the bordercast tree, it can be detected by
QD mechanism. Within this time, it is possible that any
neighboring node may re-bordercast the message
269
ISBN: 978-81-924893-0-8
simultaneously. This problem can be addressed by
bordercasting RQPD. During scheduling of random delay by
waiting node, it can benefit to detect the previous bordercast
tree for already covered areas. This is how RQPD can
significally improve performance up to a point [3].
In Multicast Zone Routing Protocol, a multica--st tree
membership information is maintained proactively. Multicast
ZRP makes on-demand route requests by Multicast Inter zone
routing protocol with an efficient query mechanism [9].
For MANETs, there exist an extension of ZRP named as
Two-Zone Routing Protocol (TZRP). In this two zones may
having different topologies and route updation mechanisms
are used to attain the decoupling of protocol‟s ability to adapt
to traffic characteristics which are gained from the ability to
adapt the mobility. TZRP provides a framework to balance
tradeoff between pure proactive and reactive routing
techniques more effectively than ZRP [9].
The security of any protocol is a big issue. Security of ZRP
aims to tackle the problem of excess bandwidth and long route
requests delay etc. There may be certain mechanisms for
security such as identity based key management. In this,
identifier with the strong cryptographic binding is chosen.
Another can be mechanism which may provide a secure
neighbor discovery. To secure the routing packets can be a
way out. A mechanism for certain alarm messages in presence
of any malicious node (s) can also be adapted [12].
3. ANALYSIS OF ZRP
ZRP has been analyzed on number of platforms with different
kind of methods. As per simulation in [6], the proactive
protocol shows the slightly constant number of flooded
packets with increase in the transmission radius while ZRP as
compare to this protocol, shows a drastic increase in the
number of flooded packets.As concluded in [2], the amount of
intrazone control traffic required to maintain the zone radius
increases along with the size of routing zone. ZRP
configuration can provide good reduction (25%) in control
traffic compared to traditional flood search.The reactive
nature of ZRP is observed more suitable for networks which
exhibits smaller network spans, larger transmission radii. For
highly volatile networks, it is conclude that ZRP provide 20%
less delay then reactive routing only. In real-time scenarios,
ZRP (mobile nodes) may attain good performance as done on
real-time network and traffic configuration as per
experimentation performed in [10][13].
Fig 5: Proactive routing overhead when time is 200sec
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig 6: Reactive routing overhead when time is 200sec

Fig 9: IERP traffic per route discovery per node

While increase in traffic also increase the optimal zone radius

Fig 7: Route Acquisition latency when time is 200sec
The simulations performed in [5], shows that the proactive
part is able to communicate a large amount of routing
information at very low overhead as shown in Figure 5.and
high value of MAXHOPS results in small route acquisition
latencies, but there exist higher routing overhead and higher
information storing cost. If the networks that are largely idle,
the proactive part may cause unnecessary overhead.
In simulations performed in [3], with query control
mechanism, it is observed that traffic (number of packets)
increases with increase in zone radius during proactive
technique while in reactive technique, there is a fall in number
of traffic (number of packets) with increase in zone radius.
value. In case of jitter evaluation of ZRP [8], it shows bad
performance as the number of nodes and packets increases. As
observed in [4] simulation, ZRP is not considered so good in
the presence of black hole attack. In Black Hole attack any
fake or malicious node sends information of having a shortest
route to the destination resulting data discard or data misuse. I
can be a attack by any single node or by group of nodes.
Further Performance of ZRP protocol can be enhanced as per
done in [11], where various parameters are taken into
consideration and observed that radius value low (2 here) is
considered to be optimal for small and medium loads while
medium value (3 here) is optimal for important and high
density loads.
4. COMPARISON OF PARAMETERS
In this survey, we have compared the following parameters of
ZRP with the zone radius as shown in Table 1.
Table 1. Comparison of parameters with the zone radius
Zone Radius Low High
Parameters
Control Traffic Low High
(Proactive)

Control Traffic High Low

(Reactive)

Overhead Low High

Mobility Increase Decrease

Route Acquisition Delay Low

Packet Delivery Ratio Moderate Moderate

Fig 8: IARP + NDP traffic per route update per node

270
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Packet Delivery Ratio Moderate Deteriorates [5] Rohit Kapoor, Mario Gerla, “A Zone Routing Protocol for
(with blackhole attack) Bluetooth Scatternets”, 0-7803-7700-1/03 IEEE 2003.

Av. Jitter Low High [6] Zygmunt J. Haas, “A New Routing Protocol for
Reconfigurable Wireless Networks”, 0-7803-3777-8/97 IEEE
1997.
Av. Jitter High High
(with blackhole attack) [7] Brijesh Patel, Sanjay Srivastava, “Performance Analysis
of Zone Routing Protocols in Mobile Ad Hoc Networks”,
Av. End-to-End Delay Moderate High 978−1−4244−6385−5/10 IEEE 2010.

[8] Swati Bhasin, Puneet Mehta, Ankur Gupta, “Comparison

Av. End-to-End Delay High High of AODV, OLSR and ZRP in Mobile Ad-hoc Network on the
(with blackhole attack) basis of Jitter”, ECE Department, Punjab College of
Engineering & Technology, Lalru, ECE Department, Geeta
Av. Throughput Moderate Moderate Institute of Management & Technology, Kurukshetra, ISSN
2277–9140 July 2012.

Av. Throughput Low Low [9] Xiaofeng Zhang, Lillykutty Jacob, “Multicast Zone
(with blackhole attack) Routing Protocol in Mobile Ad HocWireless Networks”,
Proceedings of the 28th Annual IEEE International
Conference on Local Computer Networks (LCN‟03) 0742-
1303/03IEEE 2003.

5. CONCLUSION [10] Julian Hsu, Sameer Bhatia, MineoTakai,

In this survey of Zone Routing Protocol, it is concluded that in
comparison with only proactive protocols and only reactive
protocols, this hybrid routing protocol is more efficient but if
restricted to small area networks only.For the larger network
routing, ZRP is unable to show such a good performance with
various parameters such as control traffic, Packet delivery
ratio, End to End delay, Jitter, Throughput, Overhead etc. as it
shows in small routing networks. These parameters are
examined and compared on the basis of concluded simulation
results. The efficiency of these parameters also depends on the
proactive or reactive nature of the routing.The whole nature of
ZRP depends on its zone radius. With increase and decrease
in routing zone radius, the performance of ZRP increases or
falls considerably. The lower value of zone radius has proved
better for ZRP processing than the greater one.
RajiveBagrodia, Michael J. Acriche, “Performance ofMobile
Ad Hoc Networking Routing Protocols in Realistic
Scenarios”, IEEE 2003.
[11] A. Loutfi, M. Elkoutbi, “Evaluation and enhancement of
ZRP performances”, IEEE 2010.
[12] Ibrahim S. I. Abuhaiba, Hanan M. M. Abu-Thuraia, “
Securing Zone Routing Protocol in Ad-Hoc Networks”, I. J.
Computer Network and Information Security, 2012, 10, 24-
36.
[13] Anuj k. Gupta, Harsh Sadawarti, Anil k.Verma,
“Performance Analysis of MANET Routing Protocols in
Different Mobility Models”, International Journal of
Information Technology and Computer Science (IJITCS),
ISSN: 2074-9015, 5(6): 73-82, May 2013.

[14] Anuj k. Gupta, Harsh Sadawarti, Anil k.Verma, “A

6. REFERENCES
[1] Shaily Mittal, Prabhjot Kaur, “Performance Comparison
of AODV, DSR and ZRP routing protocols in MANET‟s”,
978-0-7695-3915-7/09 IEEE 2009.
Review of Routing Protocols for Mobile Ad Hoc Networks”,
WSEAS Transactions on Communications, ISSN: 1109-2742,
11(10):331-340, November 2011.

[2] Zygmunt J. Haas, Marc R. Pearlman, “The Performance [15] Anuj k. Gupta, Harsh Sadawarti, Anil k.Verma,
Of A New Routing Protocol For The Reconfigurable Wireless “Performance analysis of AODV, DSR and TORA routing
Networks”, School of Electrical Engineering, Cornell protocols”, International Journal of Engineering and
University, Ithaca, NY, 14853, IEEE 1998. Technology (IJET),Article No. 125, 2(2): 226-231, April
2010.
[3] Zygmunt J. Haas, Marc R. Pearlman, “The Performance
of Query Control Schemes for the Zone Routing Protocol”,
Senior Member, IEEE, IEEE/ACM TRANSACTIONS ON
NETWORKING, VOL. 9, NO. 4, AUGUST 2001.

[4] Harjeet Kaur, ManjuBala, VarshaSahni, “Performance

Evaluation of AODV, OLSR and ZRP routing protocol under
the Black Hole attack in MANET”, Vol. 2, Issue 6, June 2013.

271
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Review on Cloud Computing & its Current Issues

Sandeep Kaur Simarjit Kaur

Student Assistant Professor
Department of CSE, Bhai Gurdas Institute of Department of CSE, Bhai Gurdas Institute of
Engineering and Technology, India Engineering and Technology, India
sandeepmarahar23@gmail.com er.simar0126@gmail.com

ABSTRACT computing a realistic and compelling paradigm [3]. Fig.1 shows

a basic cloud computing environment. The remainder of this
Cloud Computing is based on the concept of distributed
paper deals with characteristics, issues and challenges of cloud
computing, Grid Computing, Utility Computing
Computing.
&Virtualization. Cloud Computing is the internet based
computing and it provides shared resources, software packages
and others resources as per client requirements at specific time.
Cloud Computing provides us a means by which we can access
the applications as utilities, over the internet. This research
paper presents basics of cloud computing, the various cloud
models , various challenges and issues in cloud computing.

Keywords
Cloud Computing, Cloud Models , Software as a Service
(SaaS), Platform as a Service (PaaS), Infrastructure as a Service
(IaaS), Current Issues.

1. INRODUCTION
Cloud Computing is a model for enabling on demand network
access to a shared pool of configurable computing resources in
a convient way. There are number of resources such as
networks, servers, storage, applications and services. These
resources can be rapidly provisioned and released with minimal
management effort or service provider interaction [1]. Cloud
Computing provides us a means to access the applications as
utilities, over the Internet. It allows us to create, configure, and
customize applications online. Cloud computing has emerged as
a popular solution to provide cheap and easy access to
externalized IT (Information Technology) resources.
Within last few years, cloud computing
paradigm has witnessed an enormous shift towards its adoption
and it has become a trend in the information technology space
as it promises significant cost reductions and new business
potential to its users and providers. There are various
advantages of using cloud computing such as:
 reduced hardware and maintenance cost,
 accessibility around the globe, and
 flexibility and highly automated processes where in
the customer need not worry about mundane concerns
like software up-gradation[2].
Computing may be applied to solve problems
in many domains of Information Technology like GIS
(Geographical Information Systems), Scientific Research, e-
Governance Systems, Decision Support Systems, ERP , Web
Application Development, Mobile Technology etc [1],[2].Cloud
Computing is a technique to transport services over the
network. New progress in virtualization technology, processor,
disk storage, broadband internet access and fast, economical
and powerful servers have all combined to make cloud
Fig1: Cloud Computing Environment
2. CLOUD DEPLOYMENT STRATEGIES
This section explains the basic cloud deployment strategies. A
cloud can be deployed using any of the below mentioned
strategies
2.1 Public Cloud
The Public Cloud allows systems and services to be easily
accessible to the general public. Public cloud may be less secure
because of its openness, e.g., e-mail. Public cloud services are
characterized as being available to clients from a third party
service provider via the Internet. The term “public” does not
always mean free, even though it can be free or fairly
inexpensive to use. One of the best examples of a public cloud
include Microsoft Azure, Google App Engine [2].
2.2 Private Cloud
The Private Cloud allows systems and services to be accessible
within an organization. It offers increased security because of
its private nature. The difference between a private cloud and a
public cloud is that in a private cloud-based service, data and
processes are managed within the organization without the
restrictions of network bandwidth, security exposures.
Eucalyptus Systems is one of the example of a private
cloud[2].

272
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2.3 Community cloud
The Community Cloud allows systems and services to be
accessible by group of organizations. A community cloud is
controlled and used by a group of Organizations that have
shared interests, such as specific security requirements or a
common mission. The members of the community share access
to the data and applications in the cloud [1]. An example of a
Community Cloud includes Facebook [2].
2.4 Hybrid Cloud
The Hybrid Cloud is mixture of public and private cloud.
However, the critical activities are performed using private
cloud while the non-critical activities are performed using
public cloud. An example of a Hybrid cloud includes Amazon
Web Services [2].
Fig2: Cloud Deployment Model [1]
3. CLOUD DELIVERY MODELS
This section of the paper describes the various cloud delivery
models. Cloud can be delivered in 3 models namely SaaS, PaaS,
and IaaS.
3.1 Software-as-a-Service (SaaS)
In this model, a complete application is offered to the customer,
as a service on demand. A single instance of the service runs on
the cloud & multiple end users are serviced. On the customers‟
side, there is no need for upfront investment in servers or
software licenses, while for the provider, the costs are lowered,
since only a single application needs to be hosted & maintained.
Today SaaS is offered by companies such as Google,
Salesforce, Microsoft, Zoho, etc.
3.2 Platform-as-a-Service (SaaS)
Here, a layer of software, or development environment is
encapsulated & offered as a service, upon which other higher
273
ISBN: 978-81-924893-0-8
levels of service can be built. The customer has the freedom to
build his own applications, which run on the provider‟s
infrastructure. To meet manageability and scalability
requirements of the applications, PaaS providers offer a
predefined combination of OS and application servers, such as
LAMP platform (Linux, Apache, MySql and PHP) and
Google‟s App Engine.
3.3 Infrastructure-as-a-Service (IaaS)
IaaS provides basic storage and computing capabilities as
standardized services over the network. Servers, storage
systems, networking equipment, data centre space etc. are
pooled and made available to handle workloads. The customer
would typically deploy his own software on the infrastructure.
Some common examples are Amazon, GoGrid, 3 Tera, etc.
Fig.3 Cloud Computing Service Delivery Models[2]
4. CHALLENGES & ISSUES
In this section we explain the challenges & issues cloud
computing has to face. Fig.4 depicts the summary of the survey
conducted by us on the basic issues of the cloud computing.
The client’s primary concern is taken in to account. Hence only
the percentage of 4, 5 is being shown. The following are the
issues that a cloud computing environment has to still resolve:
4.1 Security
It is the biggest concern about cloud computing. Since
data management and infrastructure management in cloud is
provided by third-party, it is always a risk to handover the
sensitive information to such providers. Although the cloud
computing vendors ensure more secure password protected
accounts, any sign of security breach would result in loss of
clients and businesses. When using cloud-based services, one is
entrusting their data to a third-party for storage and security.
Can one assume that a cloud-based company will protect and
secure ones data (Cloud computing presents specific challenges
to privacy and security. back it up, check for data errors, defend
against security breaches) if one is using their services at a very
low cost? Or often for free? Once data is entrusted to a cloud
based service, which third-parties do they share the information
with? [1].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig 4:Graph depicting the concerns of clients on cloud
computing issues[1]
4.2 Performance
Cloud computing suffers from severe performance issues. The
cloud provider must ensure that the performance of the service
being provided remains the same all through. There may be
peak time break downs, internal flaws, and technical snags
arising. Load balancer, data replicators, high end servers must
be installed when needed.
4.3 Reliability & Availability of Service
The challenge of reliability comes into the picture when a cloud
provider delivers on-demand software as a service. The
software needs to have a reliability quality factor so that users
can access it under any network conditions (such as during slow
network connections). There are a few cases identified due to
the unreliability of on-demand software. One of the examples is
Apple’s MobileMe cloud service, which stores and
synchronizes data across multiple devices [2].
4.4 Cost
Cloud computing can have high costs due to its requirements
for both an “always on” connection, as well as using large
amounts of data back in-house [1].
4.5 Regulatory requirements
What legislative, judicial, regulatory and policy environments
are cloud-based information subject to? This question is hard to
ascertain due to the decentralized and global structure of the
internet, as well as of cloud computing. The information stored
by cloud services is subject to the legal, regulatory and policy
environments of the country of domicile of the cloud service, as
well as the country in which the server infrastructure is based.
This is complicated by the fact that some data in transit may
also be regulated.
4.6 Bandwidth, quality of service and data
limits
Cloud computing requires “broadband of considerable speed”
Whilst many websites are usable on non-broadband connections
or slow broadband connections; cloud-based applications are
often not usable. Connection speed in Kilobyte per second (or
274
ISBN: 978-81-924893-0-8
MB/s and GB/s) is important for use of cloud computing
services. Also important are Quality of Service (QoS);
indicators for which include the amount of time the connections
are dropped, response time and loss of data (packet loss) [2].
4.7 Energy Resource Management
Significant saving in the energy of a cloud data center without
sacrificing SLA are an excellent economic incentive for data
center operators and would also make a significant contribution
to greater environmental sustainability [2]. Designing energy-
efficient data centers has recently received considerable
attention. This problem can be approached from several
directions. For example, energy efficient hardware architecture
that enables slowing down CPU speeds and turning off partial
hardware components has become commonplace. Energy-aware
job scheduling and server consolidation are two other ways to
reduce power consumption by turning off unused machines.
Recent research has also begun to study energy-efficient
network protocols and infrastructures. A key challenge in all the
above methods is to achieve a good trade-off between energy
savings and application performance. In this respect, few
researchers have recently started to investigate coordinated
solutions for performance and power management in a dynamic
cloud environment. The Global Energy Management Center
(GEMC) can help companies monitor energy consumption
patterns from multiple sources.
The cloud computing provides high reliability from the
previous technologies (grid computing, distributed computing
etc) but still reliability is primary component to be considered
in cloud computing environment. The challenge of reliability
comes when cloud service provider delivers on-demand
software as a service i.e. accessible through any network
conditions(slow connections) . The main purpose of discussing
reliability in this paper is to highlight the failures in cloud
service. From failure characteristics in cloud we can identify the
availability of cloud service when several of its component
fails. A cloud is more reliable and available if it is more fault-
tolerant. Fault-tolerance mechanism like FTCloudSim and MCS
are used for recovering and evaluating the failures in cloud
computing environment.
5. CONCLUSION
In this paper basics of cloud computing are discussed. Cloud
computing enables the user to have convenient and on demand
access of shared pool of computing resources such as storage,
network, application and services etc. This research paper
represent various issues and challenges of cloud computing, and
pave the way for further research in this area.
6. REFERENCES
[1] SRINIVAS,J.,REDDY,K.VENKATA. and QYSER,
Dr.A.MOIZ.”Cloud Computing Basics”, International
Journal of Advanced Research in Computer and
Communication Engineering Vol. 1, Issue 5, July 2012.
[2] Nazir, Mohsin."Cloud Computing: Overview & Current
Research Challenges” , IOSR Journal of Computer
Engineering (IOSR-JCE) ISSN: 2278-0661, ISBN: 2278-
8727Volume 8, Issue 1 (Nov. - Dec. 2012), PP 14-22.
[3] Jaiswal, A.A. and Jain, Dr.Sanjeev.”An Approach towards
the Dynamic Load Management Techniques in Cloud
Computing Environment”, IEEE 2014.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[4] Buyya Rajkumar, “Introduction to the IEEE Transactions

on Cloud Computing”, IEEE TRANSACTIONS ON
CLOUD COMPUTING, VOL. 1, NO. 1, JANUARY-
JUNE 2013.
[5] Gowri G., Amutha M. , “Cloud Computing Applications
and their Testing Methodology”, International Journal of
Innovative Research in Computer and Communication
Engineering, Vol. 2, Issue 2, February 2014.
[6] Vouk Mladen A., “Cloud Computing – Issues,Research
and Implementations”, Journal of Computing and
Information Technology - CIT 16, 2008, 4, 235–246.
[7] Mohamaddiah, Mohd Hairy. , Abdullah, Azzizol.,
Shamala, Subramaniam. And Hussin, Masnida. “A Survey
on Resource Allocation and Monitoring in Cloud
Computing”, International Journal of Machine Learning
and Computing, Vol. 4, No. 1, February 2014.
[8] Sriram, Ilango. And Hosseins, Ali Khajeh. “Research
Agenda in Cloud Technologies”.

275
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A SURVEY ON LOAD BALANCING TECHNIQUES IN

CLOUD COMPUTING
Lakhvir Kaur Simarjit Kaur
Student Assistant Professor
Department of CSE, Bhai Gurdas Institute of Department of CSE, Bhai Gurdas Institute of
Engineering and Technology,India Engineering and Technology,India
sweetlucy16@gmail.com er.simar0126@gmail.com

ABSTRACT
Cloud Computing is associated with internet computing. It is
growing very fast and provides an alternative to conventional
computing. Load balancing is one of the issue of the cloud
computing which involves the dividing the load equally so the
throughput is high with less response time. For this purpose
various load balancing techniques and algorithms have been
proposed. In this paper we will study the different types of load
balancing techniques and make a comparative analysis among
all the existing techniques.

Keywords
Cloud computing; Load balancing; Virtual Machine; Static and
Dynamic load balancing algorithms.
1. INRODUCTION
In the last few years Cloud Computing became very popular. It
provides a flexible and easy way to keep and receive the cloud
services. It makes a large data sets and files available for the
spreading number of users around the world. Cloud computing
is an evolutionary outgrowth of prior computing approach,
which builds upon existing and new technologies. Cloud
Computing is an emerging computing technology that is rapidly
consolidating itself as the next big step in the development and
deployment of an increasing number of distributed applications.
The cloud has created a new look to align IT and business
visions. It is providing Software-as-Service (Saas), Platform-as-
Service (Paas) and Infrastructure-as-Service (Iaas) in a
virtualized cloud environment. The cloud computing power is
made possible through distributed computing and the advanced
communication networks. Cloud works on the principle of
virtualization of resources with on-demand and pay-as–you go
model policy. [2]
The main aim of cloud computing is to provide the satisfactory
level of performance to the user. In cloud computing there are
various technique to handle the large services and operations
perform on it. To improve the performance of the user
operations and storage utilization, it is important to research
some areas in the cloud computing. One important issue
associated with this field is load balancing or task scheduling.
There are various algorithms for the load balancing which are
used in various environments. The main aim of the load
balancing algorithm is to efficiently assigning task to the cloud
nodes such than the response time of the request is minimum
and request processing is done efficiently[1].
Fig1. View of the Cloud Computing Environment
2. LOAD BALANCING IN CLOUD
COMPUTING
Nowadays implementation of local cloud is popular,
organization is becoming aware of power consumed by
unutilized resources. Reducing power consumption has been an
essential requirement for cloud environments not only to
decrease operating cost but also improve the system reliability.
Load Balancing divides the workload between two or more
computers so that more works to be done at the same time and,
in general, all users get faster services. Load balancing is one of
the central issues in many computers, processes, disks or other
resources. It is a method in which the workload on the resources
of a node spreads to respective resources on the other node in a
network without disturbing the running task. On the other hand,
The Load balancing in clouds is a mechanism that distributes
the excess dynamic local workload evenly across all the nodes
[2]. The load balancing is one of the important and critical
conceptions in cloud computing issues and Proper load
balancing can help utilizing the available resources optimally,
thereby minimizing the resource consumption. Thus load needs
to be distributed over the resources in cloud-based architecture,
so that each resource does approximately the equal amount of
task at any point of time which is performed by a load balancer.
The load balancer determines which web server should serve
the request. The load balancer uses various scheduling
algorithm to determine which server should handle and
forwards the request on to the selected server.

276
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Here we will discuss static load balancing algorithm:

3.1.1 Round Robin Algorithm

It is the simplest algorithm that uses the concept of time
quantum or slices. Here the time is divided into multiple slices
and each node is given a particular time quantum or time
interval and in this quantum, the node will perform its
operations. Round robin algorithm is based on random
sampling. It means it selects the load randomly in case that
some server is heavily loaded or some are lightly loaded [2].

Here we will discuss dynamic load balancing algorithms:

3.2.1 Equally Spread Current Execution

Fig 2: Load Balancer in Cloud Computing [2]
3. CLASSIFICATION OF
BALANCING ALGORITHMS
Based on the current state of the system, there are two other
types of load balancing algorithms [2].
It is spread spectrum technique in which the load balancer
spread the load of the job in hand into multiple virtual
machines. The load balancer maintains a queue of the jobs that
need to use and are currently using the services of the virtual
machine. The balancer then continuously scans this queue and
the list of virtual machines. If there is a VM available that can
handle request of the node/client, the VM is allocated to that
request [3]. If however there is a VM that is free and there is
another VM that needs to be freed of the load, then the balancer
distributes some of the tasks of that VM to the free one so as to
reduce the overhead of the former VM. The jobs are submitted
to the VM manager, the load also maintains a list of the jobs,
their size and the resources requested. The balancer selects the
job that matches the criteria for execution at the present time.
Though there algorithm offers better results as shown in further
section, it however requires a lot of computational overhead.
LOAD The following figure shows how
ESCEL works:

3.1. Static Load Balancing: Static load balancing

refers to load balancing algorithms that distributes the workload
based strictly on a fixed set of rules related to characteristics of
the input workload.

Static load balancing algorithms are not preemptive; therefore

each machine has at least one task assigned for itself.

Round Robin algorithm is a Static load balancing technique.

3.2. Dynamic Load Balancing: A dynamic load

balancing algorithm does not consider the previous state or
behavior of the system and no prior knowledge is needed, i.e., it
depends on the current state of the system.

It allows processes to be moved from an over utilized machine

to an underutilized machine dynamically for faster execution.

This means that it allows process preemption to be run which is

not supported in Static load balancing approach. An important
consequence of this approach for load balancing is that it
decides based on the current state of the system which improves Fig 3: Working of ESCEL
overall system performance.

277
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3.2.2. Throttled Load Balancer:
Throttled load balancer [3] is a dynamic load balancing
algorithm. In this algorithm, the client first requests the load
balancer to find a suitable Virtual machine to perform the
required operation.
In Cloud computing, there may be multiple instances of virtual
machine. These virtual machines can be grouped Based on the
type of requests they can handle. Whenever a client sends a
request, the load balancer will first look for that group, which
can handle this request and allocate the process to the lightly
loaded instance of that group.
Fig 4: Working of Throttled Load Balancer
3.2.3. Honeybee Foraging Algorithm:
This algorithm is derived from the behavior of honey
bees for finding and reaping food. There is a class of bees called
the forager bees which forage for food sources, upon finding
one, they come back to the beehive to advertise this using a
dance called waggle dance. The display of this dance, gives the
idea of the quality or quantity of food and also its distance from
the beehive. Scout bees then follow the foragers to the location
of food and then began to reap it. They then return to the
beehive and do a waggle dance, which gives an idea of how
much food is left and hence results in more exploitation or
abandonment of the food source. In case of load balancing, as
the web servers demand increases or decreases, the services are
assigned dynamically to regulate the changing demands of the
user. The servers are grouped under virtual servers (VS), each
VS having its own virtual service queues. Each server
278
ISBN: 978-81-924893-0-8
processing a request from its queue calculates a profit or
reward, which is analogous to the quality that the bees show in
their waggle dance. One measure of this reward can be the
amount of time that the CPU spends on the processing of a
request. The dance floor in case of honey bees is analogous to
an advert board here. This board is also used to advertise the
profit of the entire colony. Each of the servers takes the role of
either a forager or a scout.
3.2.4. Biased Random Sampling:
Biased Random Sampling [3] is a dynamic load
balancing algorithm. It uses random sampling of system domain
to achieve self-organization thus, balancing the load across all
nodes of system. In this algorithm, a virtual graph is constructed
with the connectivity of each node representing the load on
server. Each node is represented as a vertex in a directed graph
and each in-degree represents free resources of that node.
Whenever a client sends a request to the load balancer, the load
balancer allocates the job to the node which has at least one in-
degree. Once a job is allocated to the node, the in-degree of that
node is decremented by one. After the job is completed, the
node creates an incoming edge and increments the in-degree by
one. The addition and deletion of processes is done by the
process of random sampling. Each process is characterized by a
parameter know as threshold value, which indicates the
maximum walk length. A walk is defined as the traversal from
one node to another until the destination is found. At each step
on the walk, the neighbor node of current node is selected as the
next node.
3.2.5. Active Clustering:
It is a self-aggregation algorithm that works on the principle of
grouping similar nodes together and working on these groups.
The process consists of iterative execution of the following
steps:
 A node initiates the process (initiator node) and
selects another node called the matchmaker node
from its neighbors satisfying the criteria that it should
be of a different type than the former one.
 The matchmaker node then creates a link between one
of its neighbour which is of the same type as the
initiator node.
 The matchmaker node then removes the link between
itself and the initiator node.
If variety of nodes is increased then the algorithm performs
poorly compare to the Honeybee foraging approach [4].
3.2.6. Join-Idle Queue:
Join-Idle-Queue load balancing algorithm proposed
for dynamically scalable web services. This algorithm provides
large scale load balancing with distributed dispatchers by, first
load balancing idle processors across dispatchers and then,
assigning jobs to processors to reduce average queue length at
each processor. By removing the load balancing work from the
critical path of request processing, it effectively reduces the
system load, incurs no communication overhead at job arrivals
and does not increase actual response time [4].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3. COMPARISONS OF LOAD 4. CONCLUSION

Since cloud computing has the potential to effectively handle
BALANCING ALGORITHM the future computing requirements, it is necessary to optimally
handle the major issues arising during computing over clouds.
Table1. Comparison of Different Load Balancing Load balancing is one such important issue which affects the
Algorithms utilization of resources and performance of the cloud system.
So a lot of research work has been done to efficiently balance
overall workload over available resources. This paper has
surveyed some static and dynamic based load balancing
Algorithm Benefit Drawback algorithms with their advantages and disadvantages.

5. REFERENCES
Round Robin Equal distribution of Job processing
work load time is not [1] Ghutke, Bhushan. And Shrawankar, Urmila. “Pros and
considered Cons of Load Balancing Algorithms for Cloud Computing
“, International Conference on Information Systems and
Computer Networks (2014) ,IEEE, pp: 123-127, 2014.
[2] Shoja, Hamid. , Nahid, Hossein. And Azizi, Reza. “A
Equally Response time and Not fault tolerant Comparative Survey On Load Balancing Algorithms in
Spread Current because of single Cloud Computing “, 5th ICCCNT 2014,IEEE - 33044,
processing time of a point of failure. 2014.
Execution job is improved. [3] Jaiswal, A. A. And Jain, Dr. Sanjeev “An Approach
Algorithm towards the Dynamic Load Management Techniques in
Cloud Computing Environment “,IEEE, pp: 112-122,
2014.
[4] Shaw, Subhadra Bose. And Singh , Dr. A.K. “A Survey
Throttled Load Assign job for Does not consider on Scheduling and Load Balancing Techniques in Cloud
balancing appropriate the current load Computing Environment “,5th International Conference
on VM. on Computer and Communication Technology (ICCCT) ,
VM IEEE, 2014, pp. 87-95.
[5] Hans, Abhinav. And Kalra, Sheetal. “Comparative Study
of Different Cloud Computing Load Balancing
Techniques “, International Conference on Medical
Honey Bee Works well under Increase in Imaging, m-Health and Emerging Communication
Foraging resources does not Systems (MedCom),IEEE, 2014, pp. 395-97.
heterogeneous improve
[6] Vouk Mladen A., “Cloud Computing – Issues,Research
resources throughput
and Implementations”, Journal of Computing and
equally.
Information Technology - CIT 16, 2008, 4, 235–246.
[7] Mohamaddiah, Mohd Hairy. , Abdullah, Azzizol.,
Shamala, Subramaniam. And Hussin, Masnida. “A Survey
on Resource Allocation and Monitoring in Cloud
Active Balances load Performs poorly
Computing”, International Journal of Machine Learning
Clustering efficiently. in heterogeneous
and Computing, Vol. 4, No. 1, February 2014.
environment.
[8] Sriram, Ilango. And Hosseins, Ali Khajeh. “Research
Agenda in Cloud Technologies”.

Biased Necessitate high Slower than other

Random storage in all nodes algorithms

Sampling

Join-Idle Reduces system load. More power

Queue consumption.
No communication
overhead at job
arrivals.

279
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Review of various Fractal Detection
Techniques in X-Ray Images
Tanudeep Kaur
Student, Department of Computer
Science and Engineering,
BGIET, Sangrur
tanudeepkaur@gmail.com
ABSTRACT
This paper represents the detection and
segmentation of X-Ray bone fracture Detection
using Edge detection algorithms. Edge detection
is applied to find the fracture in a bone in the
body (Skull, Hand, Leg, Chest, and
Spine).Fracture is a medical condition in which
there is a break in the continuity of the bone.
The work of various researchers is discussed
about the fractures present in X-Ray images and
their detection techniques.
General Terms
Methodology for Bone Fracture Detection
Keywords —Image Segmentation, Edge
Detection, Fracture X-Rays, SVM.
1. INTRODUCTION
Digital image processing is an application
specifically used in progressive transmission of
images, teleconferencing, digital libraries,
image database, remote sensing, and other
particular applied usage. For interpretation of
remote sensing images and to extract as much
information as possible from the image, many
image processing and analysis techniques have
been developed and used. Due to large
collection of digital images, improvement in the
digital storage media, image capturing devices
like scanners, web cameras, digital cameras and
rapid development in internet are done. For
rapid and efficient retrieval for visual
information in the different fields of life such as
280
ISBN: 978-81-924893-0-8
Anupam Garg
Assistant Professor, Department of
Computer Science and Engineering,
BGIET, Sangrur
er.anugarg@gmail.com
medical, medicines, art, architecture, education,
crime prevention, etc., digital image processing
is used.
Due to the technological and software
advancements, Medical image processing is
gaining wide acceptance in healthcare industry.
It plays important role in disease diagnosis and
improved patient care by helping medical
practitioners during decision making. Human
organs in digital forms are produced by several
states of art equipments such as X-Ray,
Computed tomography (CT), Magnetic
Resonance Imaging (MRI), Ultrasound (US),
Positron Emission Tomography (PET), and
Single Photon Emission Computed Tomography
(SPECT). Out of these, X-Ray is non-invasive,
painless and economical, and is one of the
oldest and frequently used technique. An X-ray
can make image of any bone in the body. A
typical bone ailment, which occurs when bone
cannot suffer outside force and a person, is
unable to move that part of body is called
Fracture. A fracture is cracks in bones and is
defined as the breaking up of a continuous bone.
As due to fracture, the patient can suffer from
severe pain, dissatisfaction, expensive litigation,
so the detection and correction treatment of
should be done quickly. Detection of fracture
can be done by passing x-ray emission through
that part of body with the help of X-Ray
machine. Medical imaging has become possible
to approach the problem of automated diagnosis
image with the advancement of computer
processing capabilities. As the fracture cannot
be seen by naked eyes, a radiologist can
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
experience difficulties in reading and
understanding the x-ray images due to the
presence of noise or lack of proper illumination
source. By building the system, one can hope
the system to help the radiologist on detecting
bones anomalies properly.
The methodology followed by the
fracture detection system involves the following
steps: preprocessing, segmentation and fracture
detection.
The Preprocessing enhances the x-ray input
by removing the noise from the X-ray or other
un-wanted effects present in the X-ray by
making it more suitable for segmentation. In the
segmentation process, the separation of the
fractured part is done from the body structure
and identification of that part is done. The
mostly used algorithm for segmentation is the
Edge Detection, which separates the boundary
of the object from the background. Then, the
Fracture Detection which is a tough task verifies
that the segmented image is fractured or not
fractured. This Image processing use edge
detection methods and SVM Classifier that
expected to minimize error on detecting bone
fracture.
2. GENERAL APPROCH TO
CLASSIFICATION
Classification, also known as pattern
recognition, discrimination, supervised learning
or prediction, is a task that involves construction
of a procedure that maps data into one of several
predefined classes. It applies a rule, a boundary
or a function to the sample’s attributes, in order
to identify the classes. Classification can be
applied to databases, text documents, web
documents, web based text documents, etc.
Classification is considered as a challenging
field and contains more scope for research. It is
considered challenging because of the following
reasons:
 Information overload –The information
explosion era is overloaded with
information and finding the required
information is prohibitively expensive.
 Size and Dimension – The information
stored is very high, which in turn,
increases the size of the database to be
281
ISBN: 978-81-924893-0-8
analyzed. Moreover, the databases have
very high number of “dimensions” or
“features”, which again pose challenges
during classification.
A classification technique is a systematic
approach to building classification models from
an input data set. Examples include, Decision
Tree Classifiers, Rule-Based Classifiers, Neural
Networks, Support Vector Machines and Naïve
Bayes Classifiers. Each technique employs a
learning algorithm to identify a model that best
fits the relationship between the attribute set and
class label of the input data. The model
generated by a learning algorithm should both
fit the input data well and correctly predict the
class labels of records it has never seen before.
Therefore, a key objective of the learning
algorithm is to build models with good
generalization capability, i.e., models that
accurately predict the class labels of previously
unknown records. First, a training set consisting
of records whose class labels are known must be
provided. The training set is used to build a
classification model, which is subsequently
applied to the test set, which consists of records
with unknown class labels [1].
3. RELATED WORKS
Now at present, a large amount of research has
been started in image processing for medical
field as per the specification of the diagnosis
while, research in the field concerning X-ray
images are less. The general segmentation
techniques are edge based, region based, edge
detection algorithms, watershed algorithms can
be used.
There are general approaches for
database like neural networks, rule based
classifier and SVM. The main focus of this
research is SVM.
Bielecki, A., Korkosz, M and
Zielinski, B [2], [3], the proposed an automated
algorithm to compute the joint width in the x-
ray images of the hand. Such a process is
essential in age assessment as well as diagnosis
of hand diseases (such as rheumatic arthritis)
and their prognosis. Their approach performs
dilation of the image followed by a filtering step
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
using Gauss function. Then a thinning
procedure is used to define the skeleton of the
hand and an analysis of the branches is
performed to find the correct branches of the
fingers. Based on these joints locations are
detected and their widths are computed.
Mahendran and Baboo [4] presented
a fusion classification technique for automatic
detection of existence of fractures in the Tibia
bone (one of the long bones of the leg). The
authors start with preprocessing steps of
contrast adjustment, edge enhancement, noise
removal and segmentation before extracting
texture features. For the classification step, the
authors propose combining the results of three
common classifiers, viz., feedforward
backpropagation Neural Networks (NN),
Support Vector Machines (SVM) and Naive
Bayes (NB), using a simple majority vote
technique.
SP. Chokkalingam and K. Komathy
[5] implemented a new scheme to diagnose the
presence of rheumatoid arthritis by a series of
image processing techniques which have been
termed to be more effective than the other
methods which perform the same task and hence
provide a more effective approach in computer
aided diagnosis. The system may be further
enhanced by the improvement of the edge
detection as well as finding a better
segmentation technique. Gray level co-
occurrence matrix (GLCM) features like Mean,
Median, Energy, Correlation, Bone Mineral
Density (BMD) and etc. After finding all the
features it stores in the database. This dataset is
trained with inflamed and non-inflamed values
and with the help of neural network all the new
images are checked properly for their status.
He et. al. [6] specified to use a
hierarchical SVM classifier system for fracture
detection in femur bones. To use hierarchical
classifier, the problem is divided into smaller
sub-problems. This is done in the SVM’s kernel
space instead of the feature space due to the
complexity of the problem and the limited
dataset. Each sub-problem is handled by an
optimized SVM classifier and to ensure that the
hierarchical performs well, lower-level SVMs
should complement the performance of higher-
level SVMs.
282
ISBN: 978-81-924893-0-8
Y Jia and Y Jiang [7] presented a
method of segmentation that outlines fractured
bones in an X-ray image of a patient’s arm
within casting materials, and displays the
alignment between the fractured bones.
Geodesic active contour models with global
constraints are applied to segment the bone
region. A prior shape is collected and used as a
global constraint of our model. A maximum-
likelihood function is derived to provide
feedback for each evolving process.
Experimental results show that the method
produces the outlines of the fractured bones on
the low contrast X-ray images robustly and
accurately. [8]
Martin Donnelley et. al. [9] developed
a method of automatically detecting fractures in
long bones. First the edges are extracted from
the x-ray image using a non-linear anisotropic
diffusion method (the affine morphological
scale space) that smoothes the image without
losing critical information about the boundary
locations within the image. Then a modified
Hough transform with automatic peak detection
is used to determine parameters for the straight
lines that best approximate the edges of the long
bones. The parameters used to approximate the
long bone edges are then used for centerline
approximation, diaphysis segmentation and
fracture detection in the segmented region.
C.Linda et.al [10] proposed a procedure
for crack detection in X-ray image, which is
based on the minimization of a fuzzy measure.
The image histogram is divided into three fuzzy
sub- sets using iterative approach to obtain
subsets parameters. The obtained parameters
were used as initial estimates and each pixel in
the fuzzy regions were classified as belonging to
one of the sub-sets by minimizing the fuzzy
index. After segmenting the image into three
regions, the background and skin regions are
removed to detect the cracks in the bone region.
A binary image thus obtained contains cavities
or holes. A hole-filling step utilizing the
morphological operation is then applied to the
binary image to fill these spots and create a
temporary image. The temporary image is
subtracted by the original binary image to
isolate the small pots. Morphological filtering
functions (erosion followed by dilation) are then
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

used to screen noise or undesirable spots using Control Engineering, Vol. 8, Issue 5, pp.834-
the iteration number as an operational 843.
parameter. The morphological operation can
eliminate or maintain the spots on the image [6] He, J. C., Leow, W. K. and Howe, T.
according to their area size. S.(2007),“Hierarchical classifier for detection of
fractures in x-ray images”. In Computer
4. SUMMARY Analysis of Images and Patterns. Springer,
2007, pp. 962–969
This paper surveyed various segmentation
models that segment the bone structure and
[7] Y, Jia, and Y.Jiang. (2006) “Active contour
fractured region from an x-ray image. The steps
model with shape constraints for bone fracture
used to extract the bone fracture from the x-ray
detection.” Computer Graphics, Imaging and
image are Edge detection algorithms,
Visualization, International Conference on.
preprocessing, feature extraction and SVM
IEEE, 2006.
classifier in a serial fashion.
[8] E Jacob, Nathanael. and Wyawahare, M. V.
REFERENCES (2013). “Survey of Bone Fracture Detection
Techniques”.International Journal of Computer
[1] Mahendran, S.K. and Baboo, S.Santosh.
Applications, pp.31-34.
(2011) “Automatic Fracture Detection Using
Classifiers- A Review” International Journal of
[9]Montejo-Raez, A. (2005) “Automatic Text
Computer Science Issues, Vol. 8, Issue 6, No 1,
Categorization of documents in the High Energy
Pp.340-345.
Physics domain,” CERN-THESIS-2006-008,
ISBN: 84-338-3718-4.
[2] Bielecki, A., Korkosz, M. and Zielinski, B.
(2008),“Hand radiographs preprocessing, image
[10] Linda, C. Harriet, and G. Wiselin Jiji.
representation in the finger regions and joint
(2011) “Crack detection in X-ray images using
space width measurements for image
fuzzy index measure.” Applied Soft Computing,
interpretation”. Pattern Recognition, Vol. 41,
Vol, 11, Issue .4: 3571-3579.
Issue.12, pp.3786–3798.

[3] Zielinski, B. “A fully-automated algorithm

dedicated to computing metacarpophalangeal
and interphalangeal joint cavity widths”.
Schedae Informaticae, vol. 16, pp.47–67.

[4]Mahendran, S.K. and Baboo, S. S. (2011).

“An enhanced tibia fracture detection tool using
image processing and classification fusion
techniques in X-ray images”. Global Journal of
Computer Science and Technology, Vol.No.11,
Issue No.14, Version 1.0, pp.23-28.

[5] Chokkalingam, SP. and Komathy, K. (2014).

“Intelligent Assistive Methods for Diagnosis of
Rheumatoid Arthritis Using Histogram
Smoothing and Feature Extraction of Bone
Images”. World Academy of Science,
Engineering and Technology International
Journal of Computer, Information, Systems and

283
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Review of the Techniques used for Face

Recognition
Priyanka
Dept. of Computer Science
Bhai Gurdas Institute of Engineering and Technology, Sangrur
priyankabansal3006@gmail.com

ABSTRACT sequences; and those that require other sensory data such
Face recognition presents a challenging problem in the as 3D information or infra-red imagery.
field of image analysis and computer vision as sucha large
number of face recognition algorithms have been Therefore a basic face recognition system contains the
developed in last decade. In this paper firstlyI present an following sub-modules:
overview of face recognition and discuss its application
and technical challenges. Thereafter I represent the various Input image/video
face recognition techniques. This includes PCA, LDA,
ICA, Gabor wavelet, soft computing tool like ANN for
recognition and various hybrid combination of these
techniques. This review investigates face recognition and
all these methods of face recognition with parameters that FACE DETECTION
have challenges like illumination, pose variation and facial
expressions.

General terms
Face recognition, Feature extraction, and Face detection FEATURE EXTRACTION

Keywords
Principal Component Analysis (PCA), Independent
Component Analysis (ICA), Linear Discriminant Analysis
(LDA), Artificial Neural Networks (ANN). FACE RECOGNITION

1. INTRODUCTION
Over the last ten years, face recognition has become a
specialized applications area within the larger field of
computer vision and it becomes one of the most biometrics
authentication techniques. Face recognition is an
interesting and successful application of Pattern
recognition and Image analysis. Face recognition is used
for two primary tasks [1]:
1. Verification (one-to-one matching): When presented
with a face image of an unknown individual along with a
claim of identity, verify whether the individual is who
he/she claims to be.
2. Identification (one-to-many matching): Given an
image of an unknown individual, determining that person’s
identity by comparing (possibly after encoding) that image
with a database of (possibly encoded) images of known
individuals.
Face verification is a 1:1 match that compares a face
images against a template face images, whose identity
being claimed .On the contrary, face identification is a 1:
N problem that compares a query face image against all
image templates in a face database. Face recognition
techniques can be broadly divided into three categories
based on the face data acquisition methodology: methods
that operate on intensity images; those that deal with video
Identification/Verification
Fig 1: Generic face-recognition system
2. HISTORICAL PERSPECTIVE
The earliest works on this subject were made in the 1950
in psychology. Then came attached to other issues like face
expression, interpretation of emotion or perception of
gestures. Engineering started to show interest in face
recognition in the 1960. Historical perspective of this work
started from Pioneers Automated Facial Recognition
include: W. Bledsoe, H. C. Wolf, and C. Bisson. During
1964 and 1965, Bledsoe, along with Chan and Bisson,
worked on using the computer to recognize human faces
[2, 3 and 4]. He was proud of this work, but because the
funding was provided by a semi-automatic system
unnamed intelligence agency that did not allow much
publicity, so little of the work was published. He continued
later his researches at Stanford Research Institute. Some
face coordinates were selected by a human operator, and
then computers used this information for recognition. He
described most of the problems that even 50 years later
Face Recognition still suffers - variations in illumination,
head rotation, facial expression, and aging. Researches on
this matter still continue, trying to measure subjective face

284
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

features as ear size or between-eye distance. For instance,
this approach was used in Bell Laboratories by A. Jay
Goldstein, Leon D. Harmon and Ann B. Lesk.
Theydescribed a vector, containing 21 subjective features
like ear protrusion, eyebrow weight or nose length, as the
basis to recognize faces using pattern classification
techniques.
3. APPLICATION AREAS
There are numerous application areas in which face
recognition can be exploited, a few of which are outlined
below [1]:
Table 1: Applications of face recognition
problem is harder to solve with respect to the others and
not much has been done especially for age variations.
5. Occlusions: Occlusion can dramatically affect face
recognition performances, in particular if they located on
the upper-side of the face.
6. Image Orientation: Face images directly vary for
different rotations about the camera’s optical axis.
7. Imaging Conditions: When the image is formed,
factors such as lighting (source distribution and intensity)
and camera characteristics (sensor response, lenses) affect
the appearance of a face.
8. Presence or Absence of structural components:
Facial features such as beards, mustaches, and glasses may
or may not be present and there is a great deal of
variability among these components including shape,
color, and size.

5. TECHNIQUES FOR FACE

Areas Application RECOGNITION
Biometrics Person identification (national
IDs, Passports, voter
registrations, driver 5.1 Principal Component Analysis (PCA)
licenses),Automated identity The PCA method is one of the generally used algorithm
verification for face recognition. Karhunen-Loeve is the eigenfaces
Information Access security (OS, data technique in which the Principal Component Analysis
Security bases), Data privacy ,User (PCA) is used. This method is successfully used to
authentication (trading, on line perform dimensionality reduction. Principal Component
banking) Analysis is used by face recognition and detection [5].
Investigation of reports Missing person identification, Mathematically, Eigenfaces are the principal components
criminal identification divide the face into feature vectors. The feature vector
Access Secure access authentication, information can be obtained from covariance matrix.
management Permission based systems, These Eigenvectors are used to quantify the variation
Access log or audit trails between multiple faces. The faces are characterized by the
Law Enforcement Video surveillance, Suspect linear combination of highest Eigenvalues. Each face can
identification, Suspect be considered as a linear combination of the eigenfaces.
tracking ,Simulated aging, The face can be approximated by using the eigenvectors
Forensic Reconstruction of having the largest eigenvalues. The best M eigenfaces
faces define an M dimensional space,called “face space”.
Personal security Home video surveillance Principal Component Analysis is also used by L. Sirovich
systems, Expression and M. Kirby to efficiently represent pictures of faces.
interpretation (driver They defined that a face images could be approximately
monitoring system) reconstructed using a small collection of weights for each
face and a standard face picture. The weights describing
each face are obtained by projecting the face image onto
4. TECHNICAL CHALLENGES the Eigen Pictures. Eigenface is a practical approach for
There are some key factors that can significantly affect face recognition. Because of the simplicity of its
system face recognition performances: algorithm, implementation of an eigenface recognition
system becomes easy. It is efficient in processing time and
1. Illumination: The variations due to skin reflectance storage. PCA reduces the dimension size of an image in a
properties and due to the internal camera control. Several short period of time. There is a high correlation between
2D methods do well in recognition tasks only under the training data and the recognition data. The accuracy of
moderate illumination variation, while performances eigenface depends on many things. As it takes the pixel
noticeably drop when both illumination and pose changes value as comparison for the projection, the accuracy would
occur. decrease with varying light intensity. Preprocessing of
2. Pose: Changes affect the authentication process, image is required to achieve satisfactory result. An
because they introduce projective deformations and self- advantage of this algorithm is that the eigenfaces were
occlusion. Even if methods dealing with up to 32 Degree invented exactly for those purpose what makes the system
head rotation exist, they do not solve the problem very efficient. A drawback of this is that it is sensitive for
considering that security cameras can create viewing lightening conditions and also finding the eigenvectors and
angles that are outside of this range when positioned. eigenvalues are time consuming on PPC .This limitation is
3. Expression: On the contrary, with exception of extreme overcome by Linear Discriminant Analysis (LDA). LDA is
expressions such as scream, theAlgorithmsare relatively the most dominant algorithms for feature selection in
robust. appearance based methods [6]. But many LDA based face
4. Time Delay: This happen because the face changes over recognition system first used PCA to reduce dimensions
time, in a nonlinear way over long periods. In General this and then LDA is used to maximize the discriminating
power of feature selection. Due to this Modified PCA
algorithm for face recognition were proposed in [7], this

285
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
method was based on the idea of reducing the influence of
eigenvectors associated with the large Eigen values by
normalizing the feature vector element by its
corresponding standard deviation. The simulation results
show that the proposed method results in a better
performance than conventional PCA and LDA approaches
and the computational cost remains the same as that of
PCA and much less than that of LDA.
5.2 Linear Discriminant Analysis (LDA)
Linear discriminant analysis (LDA) is a generalization
of Fisher's linear discriminant methods, that used
in statistics, pattern recognition and machine learning to
find a linear combination of features which characterizes
or separates two or more classes of objects or events. The
resulting combination may be used as a linear classifier, or
more commonly for dimensionality reduction before
later classification. Linear discriminant analysis (LDA) is a
powerful method for face recognition. It yields an effective
representation that linearly transforms the original data
space into a low-dimensional feature space where the data
is well separated. However, the within-class scatter matrix
becomes singular in face recognition and the classical
LDA cannot be solved which is the under sampled
problem of LDA (also known as small sample size
problem). A subspace analysis method for face recognition
called kernel discriminant locality preserving projections
was proposed in [8] based on the analysis of LDA, LPP
and kernel function. The nonlinear subspace which can not
only preserves the local facial manifold structure but also
emphasizes discriminant information, Combined with
maximum margin criterion (MMC) and a new method
called maximizing margin and discriminant locality
preserving projections (MMDLPP) was proposed to find
the subspace that best discriminates different face change
and preserving the intrinsic relations of the local
neighborhood in the same face class according to prior
class label information. But this method has variation
problem, for that Illumination adaptive linear discriminant
analysis (IALDA) was proposed to solve illumination
variation problems in face recognition. The recognition
accuracy of the suggested method (IALDA), far higher
than that of PCA method and LDA method. The
recognition accuracy of the suggested method was lower
than that the nearby in the output space, thereby providing
Logarithmic Total Variation (LTV) algorithm. However,
The LTV algorithm has high time complexity. Therefore,
the LTV method is not practically applicable. At the same
time, this also indicates that the proposed IALDA method
is robust for illumination variations. David Monzo et.al.
[9]Compared several approaches to extract facial
landmarks and studied their influence on face recognition
problems. In order to obtain fair comparisons, they used
the same number of facial landmarks and the same type of
descriptors for each approach. The comparative results
were obtained using FERET and FRGC [1] datasets and
shown that better recognition rates were obtained when
landmarks are located at real facial fiducial points. In this
work, comparison was done using Principal Component
Analysis (PCA), Linear Discriminant Analysis (LDA) and
Orthogonal Linear Discriminant Analysis (OLDA). OLDA
is one of the many variations of LDA which aims to tackle
286
ISBN: 978-81-924893-0-8
the problem of undersampling. The key idea of OLDA, the
discriminant vectors are orthogonal to each other. Ye
provides an efficient way of computing OLDA,
Logarithmic Total Variation (LTV) algorithm. However,
The LTV algorithm has high time complexity. Therefore,
the LTV method is not practically applicable.
Implementing LDA directly resulted in poor extraction of
discriminating features. For this in some methods Gabor
filter is used to filter frontal face images and PCA is used
to reduce the dimension of filtered feature vectors and then
LDA is used for feature extraction. LDA is better than
PCA if we need a method which has better computational
time but due to its small sample space its usability is
limited.
5.3Independent Component Analysis
(ICA)
ICA is a widely used subspace projection technique that
projects data from a high-dimensional space to a lower-
dimensional space. This technique is a Generalization of
PCA that decorrelates the high-order statistics in addition
to the second-order moments.ICA provided a more
powerful data representation than PCA as its goal was that
of providing an independent rather than uncorrelated
image decomposition and representation. A fast
incremental principal non Gaussian directions analysis
algorithm called IPCA_ICA was proposed in [10]. This
algorithm computes the principal components of a
sequence of image vectors incrementally without
estimating the covariance matrix and at the same time
transform these principal components to the independent
directions that maximize the non-Guassianity of the
source. PCA_ICA achieves higher average success rate
than Eigenface, the Fisherface and FastICA methods.
5.4 Gabor Wavelet
Gabor wavelets have proven to be good at local and
discriminate image feature extraction as they have similar
characteristics to those of the human visual system. Gabor
wavelet transform [12–13] allows description of spatial
frequency structure in the image while preserving
information about spatial relations which is known to be
robust to some variations, e.g., pose and facial expression
changes. Although Gabor wavelet is effective in many
domains, it nevertheless suffers from a limitation. The
dimension of the feature vectors extracted by applying the
Gabor wavelet to the whole image through a convolution
process is very high. To solve this dimension problem,
subspace projection is usually used to transform the high
dimensional Gabor feature vector into a low dimension
one. For enhancing face recognition high intensity feature
vectors extracted from Gabor wavelet transformation of
frontal face images combined together with ICA in [14].
Gabor features have been recognized as one of the best
representations for face recognition. In recent years, Gabor
wavelets have been widely used for face representation by
face recognition researchers, because the kernels of the
Gabor wavelets are similar to the 2D receptive field
profiles of the mammal cortical simple cells, which
exhibits desirable characteristics of spatial locality and
orientation selectivity. Previous works on Gabor features
have also demonstrated impressive results for face
recognition. Typical methods include the dynamic link
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
architecture (DLA) [15], elastic bunch graph matching
(EBGM) [16], Gabor Fisher classifier (GFC) [17], and
AdaBoosted GFC (AGFC) [18]. The Gabor phases are
sensitive to local variations, they can discriminate between
patterns with similar magnitudes, and i.e. they provide
more detailed information about the local image features.
Therefore, the Gabor phases can work comparably well
with the magnitudes, as long as its sensitivity to
misalignment and local variations can be compensated
carefully. P. Latha use Gabor wavelet to present face, and
applied neural network to classify views of faces. The
dimensionality was reduced by the principal component
analysis. A technique to extract the feature vector of the
whole face in image database by using Gabor filters,
known to be invariant to illumination and facial
expression. This network achieved higher recognition rate
and better classification efficiency when feature vectors
had low dimensions.
5.5 Artificial Neural Networks (ANN)
The neural networks are used in many applications like
pattern recognition problems, character recognition,
object recognition, and autonomous robot driving. The
main objective of the neural network in the face
recognition is the feasibility of training a system to
capture the complex class of face patterns. To get the
best performance by the neural network, it has to be
extensively tuned number of layers, number of nodes,
learning rates, etc. The neural networks are nonlinear in
the network so it is widely used technique for face
recognition. So, the feature extraction step may be more
efficient than the Principal Component Analysis. The
authors achieved 96.2% accuracy in the face
recognition process when 400 images of 40 individuals
are analyzed. The disadvantage of the neural network
approach is that when the number of classes increases
its ability is decreased. Due to this, Multi-Layer
Perceptron (MLP) with a feed forward learning algorithms
was chosen for the proposed system for its simplicity and
its capability in supervised pattern matching. It has been
successfully applied to many pattern classification
problems. A new approach to face detection with Gabor
wavelets & feed forward neural network was presented.
The method used Gabor wavelet transform and feed
forward neural network for both finding feature points and
extracting feature vectors. The experimental results have
shown that proposed method achieves better results
compared to other successful algorithm like the graph
matching and eigenfaces methods. Ahybrid neural network
was presented which is combination of local image
sampling, a self-organizing map neural network, and a
convolutional neural network. The SOM provides a
quantization of the image samples into a topological space
where inputs that are nearby in the original space are also
nearby in the output space, therefore providing
dimensionality reduction and invariance to minor changes
in the image sample. The convolutional neural network
(CNN) provides for partial invariance to translation,
rotation, scale, and deformation. PCA+CNN and
SOM+CNN methods are both superior to eigenfaces
technique even when there is only one training image per
person.SOM +CNN method consistently performs better
than the PCA+CNN method.After that a new face
detection method is proposed using polynomial neural
287
ISBN: 978-81-924893-0-8
network (PNN).The PCA technique used to reduce the
dimensionality of image patterns and extract features for
the PNN. Using a single network the author had achieved
fairly high detection rate and low false positive rate on
images with complex backgrounds. In comparison with a
multilayer perceptron, the performance of PNN is superior.
To best reflect the geometry of the 3D face manifold and
improve recognition, Spectral Regression Kernel
Discriminate Analysis (SRKDA) based on regression and
spectral graph analysis introduced, when the sample
vectors are non-linear SRKDA can efficiently give exact
solutions than ordinary subspace learning approaches. It
not only solves high dimensional and small sample size
problems, but also enhances feature extraction from a face
local non-linear structure. SRKDA only needs to solve a
set of regularized regression problems and no eigenvector
computation involved, which is a huge saving in
computational cost. This ANN yield better performance in
face recognition rate and accuracy.
6.SUMMARY
This paper has attempted to review a significant number of
papers to cover the recent development in the field of face
recognition. Present study reveals that for enhanced face
detection, new algorithm has to evolve using hybrid
methods of soft computing tools such as ANN and Gabor
filter (Feature Extractor) that yield better performance in
terms of face detection rate and accuracy.
7. ACKNOWLEDGMENTS
I would like to thank all experts and authors whose work
helped me a lot. I am also thankful to my professors for
their support.
REFERENCES
[1] Reddy, M. Janga. "A Survey of Face Recognition
Techniques.
[2] Patel, Ripal, NidhiRathod, and Ami Shah.
"Comparative analysis of face recognition
approaches: a survey." International Journal of
Computer Applications 57.17 (2012): 50-69.
[3] Eleyan, Alaa, and Hasan Demirel. "PCA and LDA
based face recognition using feedforward neural
network classifier." Multimedia Content
Representation, Classification and Security. Springer
Berlin Heidelberg, 2006. 199-206.
[4] Ahonen, Timo, AbdenourHadid, and
MattiPietikainen. "Face description with local binary
patterns: Application to face recognition." Pattern
Analysis and Machine Intelligence, IEEE
Transactions on 28.12 (2006): 2037-2041.
[5] Gupta, Bhaskar. "Performance Comparison of
Various Face Detection Techniques."
[6] Swets, Daniel L., and John JuyangWeng. "Using
discriminant eigenfeatures for image retrieval." IEEE
Transactions on pattern analysis and machine
intelligence 18.8 (1996): 831-836.
[7] Luo, Lin, M. N. S. Swamy, and Eugene I. Plotkin. "A
modified PCA algorithm for face
recognition." Electrical and Computer Engineering,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2003. IEEE CCECE 2003. Canadian Conference on.
Vol. 1. IEEE, 2003.
[8] Huanga, Rongbing, et al. "Kernel Discriminant
Locality Preserving Projections for Human Face
Recognition." (2010).
[9] Monzo, David, Alberto Albiol, and J. M. Mossi. "A
Comparative Study of facial landmark localization
methods for Face Recognition using HOG
descriptors."Pattern Recognition (ICPR), 2010 20th
International Conference on. IEEE, 2010.
[10] Dagher, Issam, and Rabih Nachar. "Face recognition
using IPCA-ICA algorithm." Pattern Analysis and
Machine Intelligence, IEEE Transactions on28.6
(2006): 996-1000.
[11] Yang, Ming-Hsuan, David Kriegman, and Narendra
Ahuja. "Detecting faces in images: A survey." Pattern
Analysis and Machine Intelligence, IEEE
Transactions on 24.1 (2002): 34-58.
[12] Jones, Judson P., and Larry A. Palmer. "An
evaluation of the two-dimensional Gabor filter model
of simple receptive fields in cat striate
cortex." Journal of neurophysiology 58.6 (1987):
1233-1258.
288
ISBN: 978-81-924893-0-8
[13] Liu, Chengjun. "Gabor-based kernel PCA with
fractional power polynomial models for face
recognition." Pattern Analysis and Machine
Intelligence, IEEE Transactions on 26.5 (2004): 572-
581.
[14] Kar, Arindam, et al. "High Performance Human Face
Recognition using Independent High Intensity Gabor
Wavelet Responses: A Statistical Approach."arXiv
preprint arXiv:1106.3467 (2011).
[15] Lades, Martin, et al. "Distortion invariant object
recognition in the dynamic linkarchitecture." Compu-
ters, IEEE Transactions on 42.3 (1993): 300-311.
[16] Wiskott, Laurenz, et al. "Face recognition by elastic
bunch graph matching."Pattern Analysis and Machine
Intelligence, IEEE Transactions on 19.7 (1997): 775-
779.
[17] Liu, Chengjun, and Harry Wechsler. "Gabor feature
based classification using the enhanced fisher linear
discriminant model for face recognition." Image
processing, IEEE Transactions on 11.4 (2002): 467-
476.
[18] Shan, Shiguang, et al. "AdaBoost Gabor Fisher
classifier for face recognition."Analysis and
Modelling of Faces and Gestures. Springer Berlin
Heidelberg, 2005. 279-292.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ENHANCEMENT IN INTRUSION DETECTION SYSTEM
FOR WLAN USING GENETIC ALGORITHMS
Rupinder Singh
BGIMT, Sangrur
rupinder.bgimt@hotmail.com
ABSTRACT
The rapid need of Information Technology and that too
wireless usage demands a great deal of security in order to
keep all the data sources and equipments secure. So we
need a secured network to secure all these. But Secured
data communication over Internet and any other network is
always under threat of intrusions and misuses. So Intrusion
Detection System have become necessary in terms of
network security. There are various approaches that have
been used before in Intrusion Detection Systems but all of
the approaches have some types of flaws in it. So the scope
of betterment is always there. In this paper we proposed an
Intrusion Detection System (IDS) by applying Genetic
Algorithm (GA) to effectively detect the network
intrusions. Various Parameters and evolution processes for
GA are discussed in detail and implemented so that to
overcome the flaws that were present in previous Intrusion
Detection Systems.
Keywords
Intrusion Detection, wireless networks, IDS, GA,
Chromosomes, Genes
1. INTRUSION DETECTION SYSTEM
A wireless network is not as secured as a Wired Network
because in wired network we can put the check on wires
but in wireless data is transferred via air so any intruder can
access the data by using various hacking techniques. In
wireless networks it is very difficult to secure the network
for lifetime and detect various attacks by Intruders. Some
commonly used attacks are more in wireless environment
as compared to wired one and some extra efforts should be
used to prevent those. An Intrusion Detection System aim
to detect the different attacks against network and system.
Because of the multitude of methods of intrusions, there are
several reasons why IDS is essential to any network, both
wired and wireless. While the wireless IDS technology is
new, we need to find out its capabilities and how it can help
in providing a robust level of security for wireless
networks. Additionally, we need to know what types of
IDS are available and the drawbacks that come with using a
wireless IDS.
2. NETWORKING ATTACKS
289
ISBN: 978-81-924893-0-8
Sandeep Kautish
Guru Kashi University, Talwandi Sabo
sandeepkautish@yahoo.com
This section is an overview of the four major categories of
networking attacks. Every attack on a network can
comfortably be placed into one of these groupings.
a) Denial of Service (DoS): A DoS attack is a type of
attack in which the hacker makes a
computing or memory resources too busy or too full to
serve legitimate networking requests and hence
denying users access to a machine e.g. apache, smurf,
neptune, ping of death, back, mail bomb, UDP storm
etc. are all DoS attacks.
b) Remote to User Attacks (R2L): A remote to user
attack is an attack in which a user sends packets to a
machine over the internet, which s/he does not have
access to in order to expose the machines
vulnerabilities and exploit privileges which a local
user would have on the computer e.g. xlock, guest,
xnsnoop, phf, sendmail dictionary etc.
c) User to Root Attacks (U2R): These attacks are
exploitations in which the hacker starts off on the
system with a normal user account and attempts to
abuse vulnerabilities in the
system in order to gain super user privileges e.g. perl,
xterm.
d) Probing: Probing is an attack in which the hacker
scans a machine or a networking device in order to
determine weaknesses or vulnerabilities that may later
be exploited so
as to compromise the system. This technique is
commonly used in data mining e.g.
saint, portsweep, mscan, nmap etc.
3. CLASSIFICATION OF INTRUSION
DETECTION SYSTEM
IDS can be classified in two main categories. They are
shown below:
i) Host Based Intrusion Detection:
HIDSs checks the information found on single or multiple
host systems, including the content of operating system,
files of operating system and various application files.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ii) Network Based Intrusion Detection:
NIDSs evaluate information taken from various network
communications, analyzing each packet that are routed
from source to destination. It also takes into account the
stream of packets across the network.
4. COMPONENTS OF INTRUSION
DETECTION SYSTEM
An intrusion detection system normally consists of three
functional components. The first component of an intrusion
detection system, also known as the event generator, is a
data source. The second component of an intrusion
detection system is known as the analysis engine. This
component takes information from the data source and
examines the data for symptoms of attacks or other policy
violations. The analysis engine can use one or both of the
following analysis approaches:
Misuse/Signature-Based Detection: This type of detection
engine detects intrusions that follow well-known patterns
of attacks (or signatures) that exploit known software
vulnerabilities. The main limitation of this approach is that
it only looks for the known weaknesses and may not care
about detecting unknown future intrusions.
Anomaly/Statistical Detection: An anomaly based detection
engine will search for something rare or unusual [26]. They
analyses system event streams, using statistical techniques
to find patterns of activity that appear to be abnormal. The
primary disadvantages of this system are that they are
highly expensive and they can recognize an intrusive
behavior as normal behavior because of insufficient data
The third component of an intrusion detection system is
the response manager. In basic terms, the response manager
will only act when inaccuracies (possible intrusion attacks)
are found on the system, by informing someone or
something in the form of a response.
5. PROBLEMS WITH EXISTING
SYSTEMS
i) The information used by Intrusion Detection
System is obtained from Audit or from Packets
on a network. Packets have to travel a long
distance from the origin to IDS and finally to
destination and in this process can potentially be
destroyed or modified by an attacker.
ii) The Intrusion Detection System Continuously
monitoring even when there is no intrusion
occurring, because the components of IDS have
to run all the time. This pure wastage of
resources.
290
ISBN: 978-81-924893-0-8
6. IDS USING OUR GENETIC
ALGORITHM
By using various ways IDS can be implemented. We have
chosen Genetic Algorithm to make our IDS. A genetic
Algorithm has many operator, processes and parameters
which decide its arrival to an optimal solution. A short
description of the parameters, operators and processes is
handy. The genetic algorithms start processing by initially
selecting a random population of chromosomes. Each
chromosome is composed of a finite number of genes,
which is predefined in every implementation. These
chromosomes are the data representing the problem. This
initial population is refined to a high quality population of
chromosomes, where each chromosome satisfies a
predefined fitness function. According to the requirements
of the solution needed, different gene positions in a
chromosome are encoded as numbers, bits, or characters.
Each population is refined by applying mutation, crossover,
inversion, and selection processes. The working of a
genetic algorithm when applied to intrusion detection can
be viewed as a sequence of following steps:
i) The packet capturing module or sniffer present in the
intrusion detection system collects the information about
the network traffic or logs.
ii) The intrusion detection system applies genetic
algorithms to the captured data. The genetic algorithm at
this stage has classification rules learned from the
information collected.
iii) The intrusion detection system then applies the set of
rules produced in the previous phase to the incoming
traffic. Application of rules to captured data results in the
population initialization, which in turn results in the
creation of a new population with good qualities. This
population is then evaluated and a new generation with
better qualities is created. Then genetic operators are
applied to the newly created generation until the most
suitable individual is found.
7. CONCLUSION
Intrusion detection methods based on genetic algorithms
have attracted most of the attention from the research
community and the industry during the past so many years.
The requirements for building efficient intrusion detection
systems and the features of genetic algorithms is the main
reason behind genetic algorithms getting such an attention
from the intrusion detection research community. This survey
provides an introduction to intrusion detection and genetic
algorithms. The generics of genetic algorithm based
intrusion detection systems are discussed. Also, the work
done by different researchers in the direction of applying
genetic algorithms for intrusion detection is surveyed. In
near future we will try to improve our intrusion detection
system with the help of more statistical analysis and with
better and may be more complex equations.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
REFERENCES
[1] J. P. Planquart, “Application of Neural Networks to
Intrusion Detection”, SANS Institute Reading Room.
[2] R. G. Bace, “Intrusion Detection”, Macmillan
Technical Publishing. 2000.
[3] S. Kumar, E. Spafford, “A Software architecture to
Support Misuse Intrusion Detection” in The 18th
National Information Security Conference, pp. 194-
204. 1995.
[4] K. Ilgun, R. Kemmerer, P. A. Porras, “State Transition
Analysis: A Rule-Based Intrusion Detection
Approach”, IEEE Transaction on Software
Engineering, 21(3):pp. 181-199. 1995.
5] S. Kumar, “Classification and Detection of Computer
Intrusions”, Purdue University, 1995.
[6] V. Bobor, “Efficient Intrusion Detection System
Architecture Based on Neural Networks and Genetic
Algorithms”, Department of Computer and Systems
Sciences, Stockholm University / Royal Institute of
Technology, KTH/DSV, 2006.
291
ISBN: 978-81-924893-0-8
[7] H. G. Kayacık, A. N. Zincir-Heywood, M. I.
Heywood, “Selecting Features for Intrusion
Detection: A Feature Relevance Analysis on KDD 99
Intrusion Detection Datasets”, May 2005.
[8] G. Folino, C. Pizzuti, G. Spezzano, “GP Ensemble for
Distributed Intrusion Detection Systems”. ICAPR 54-
62, 2005.
[9] W. Lu, I. Traore, “Detecting New Forms of Network
Intrusion Using Genetic Programming”.
Computational Intelligence, vol. 20, pp. 3, Blackwell
Publishing, Malden, pp. 475-494, 2004.
[10] M. M. Pillai, J. H. P. Eloff, H. S. Venter, “An
Approach to Implement a Network Intrusion Detection
System using Genetic Algorithms”, Proceedings of
SAICSIT, pp:221-228, 2004.
[11] S. M. Bridges, R. B. Vaughn, “Fuzzy Data Mining
And Genetic Algorithms Applied To Intrusion
Detection”, Proceedings of 12th Annual Canadian
Information Technology Security Symposium, pp.
109-122, 2000.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Review on Reliability Issues in Cloud Service

Gurpreet Kaur Rajesh Kumar
Department of CSE, Bhai Gurdas Institute of Department of CSE, Bhai Gurdas Institute of
Engineering and Technology, India Engineering and Technology, India
preetsidhu004@gmail.com rajeshkengg@gmail.com

ABSTRACT
Cloud computing is a recently developed new technology that
provides a model for resource sharing over the internet, which
is different from the resource sharing of the grid computing
systems. Cloud computing is designed to deliver computing
resources as a service to consumers over the internet from
large-scale data centers – or “clouds". Reliability is one of the
major issue in the cloud computing. Cloud reliability analysis
and modeling are not easy tasks because of the complexity and
large scale of the system.. This research paper is the systematic
review on the cloud computing basic concepts. This research
paper also analyzes the key research challenges present on
reliability of cloud service.

Keywords
Cloud Architecture, Cloud Computing, Cloud Management
System(CMS), Reliability, FTCloudSim, Monte Carlo
Simulation.

Fig 1: A bird’s eye view of cloud computing [3].

1. INRODUCTION
This section gives an introduction to Cloud computing basic
concepts and models. Cloud computing is a model for enabling
convenient, on-demand network access to a shared pool of
configurable computing resources (e.g., networks, servers,
storage, applications, and services) that can be rapidly
provisioned and released with minimal management effort or
service provider interaction [1].
Cloud computing is a combination of various previous
technologies like “grid computing”, “distributed computing”,
“utility computing” or “autonomous computing”. Cloud
computing provides easy and cheap access to all resources.
Cloud computing has the ability to scale up or down their
service requirements. With the help of virtualization different
computational needs are accomplished on the same physical
infrastructure. Usually Cloud Computing services are delivered
by a third party provider.
Cloud computing is a general term that provides
resources as a service over the internet. A bird’s eye view
of Cloud computing is shown in Fig. 1 [3].
1.1.1 Deployment Models
Deployment models are defined on the type of access to the
cloud, i.e., how the cloud is located? Cloud can have any of the
four types of access: Public, Private, Hybrid and Community.
 Public Cloud: are developed, deployed and
maintained by a third part service. The services within
the public cloud has been developed for the general
public. Public clouds have lack of security due to its
openness to public, e.g., e-mail.
 Private Cloud: services are developed, deployed,
maintained and maintained for a single enterprises.
The private cloud provide more security and greater
control than public clouds.
 Community Cloud: a cloud that is developed for
sharing of resources by the several organizations.
These clouds are designed for specific purpose like
for security requirements.

1.1 Basic Concepts  Hybrid Cloud: a cloud that is built by combining the
There are working models that make the cloud computing above of three deployment models. This cloud
feasible and accessible to end users. Following are the working provide the features of that clouds from whom that it
models for cloud computing: is made.
1.1.2 Service Models

Service Models defines the main models for cloud computing

on which computing is based. These are three basic service
models as listed below:

292
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig 2: Cloud computing deployment and service models [5].
 Software as a Service (SaaS): In SaaS pre made
software is provided to consumers on pay-per-use
manner. The SaaS is the software that is developed by
a hosted service and accessed through the internet.
 Platform as a Service (PaaS): PaaS gives the
platform to develop programs and application without
the need of software. Applications are developed by
using a set of programming languages and tools that
are supported by the PaaS provider. It also provides
an infrastructure to test cloud applications.
 Infrastructure as a Service (IaaS): IaaS provides the
environment for sharing of resources like servers,
networks and storage. IaaS helps users to use that
shared resources to deploy and run their applications.
Figure 2 provides an overview of the common deployment and
service models in cloud computing, in which the three service
models could be deployed on top of any of the four deployment
models.
2. CLOUD SERVICE RELIABILTY
This section gives an overview about the architecture and
various failures of cloud service system. Reliability is one of the
key factor to be considered in cloud computing environment.
Reliability is defined as the probability that a given item will
perform its intended function for a given period of time under a
given set of conditions.
Cloud reliability means how the cloud is available to provide
the services even when several of its component fails. A cloud
will be more reliable if it is more fault-tolerant and more
adaptable to changing situations. It is impossible to have a
Fig 3: Cloud Service System[6]
293
ISBN: 978-81-924893-0-8
cloud that is completely free from failures or failure resistant.
Various types of failures are interleaved in the cloud computing
environment such as overflow failure, timeout failure, resource
missing failure, network failure, hardware failure, software
failure, and database failure [6].
The reliability of the cloud computing is very critical but hard
to analyze because cloud is made up by the combination of
various factors like wide-area networks, heterogeneous
software/hardware components. There are many complicated
interactions among the various components of the clouds.
Hence, the reliability models that are defined for pure
software/hardware or conventional networks cannot be simply
applied to study and evaluating the cloud reliability.
2.1 Cloud Computing System and Failure
Analysis
Cloud computing is different from distributed computing by its
focus on high massive-scale service sharing than the distributed
computing.
2.1.1 Cloud Service System Architecture
The architecture of our cloud service system is described in Fig.
3,. There is a cloud management system (CMS) which define
by a set of servers (either centralized or distributed). The CMS
mainly fulfills four different functions as shown in Fig. 3:
The four different functions managed in cloud service system
are given below [6]
 To manage a request queue that receives job requests
from different users for cloud services;
 To manage computing resources (such as PCs,
Clusters, Supercomputers, etc.) all over the Internet;
 To manage data resources (such as Databases,
Publicized Information, URL contents, etc.) all over
the Internet; and
 To schedule a request and divide it into different
subtasks and assign the subtasks to different
computing resources that may access different data
resources over the Internet.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2.1.2 Failure Analysis Of Cloud Service  Software failure,

There are a various types of failures that may affect the
success/reliability of a cloud service, including Overflow,
Timeout, Data resource missing, Computing resource missing,
Software failure, database failure, Hardware failure, and
Network failure[6].
 Overflow: this failure occur if the job request is
greater than the maximum number of the requests set
in the request queue. After the maximum number all
the new request are discarded and the users are unable
to get the service that they want, and the overflow
failure occurs. If the new request have to wait for too
much time then that leads to more timeout failures.
 Timeout: The time is set by the users or service
provider for the result of the requested job in cloud
service that is called due time. If the waiting time of
the job/request is greater than due time the timeout
failure occurs.
 Data resource missing: In CMS, all the data resource
are registered on the data resource manager (DRM). If
the data resources that are registered on DRM are
removed but the DRM is not updated. As a result, if
So when those data resources are assigned in a certain
job request, they will cause the data resource missing
failure.
 Database failure,
 Hardware failure, and
 Network failure.
Therefore, the two groups of failures could be considered as
independent. But failures within each group are strongly
correlated.
3. CLOUD SERVICE RELIABILITY
ENHANCEMENT MECHANISM
The downtime of the cloud data center has the negative affect
on the cloud service reliability. Evaluating and enhancing
reliability in cloud computing is not so much easy task.
However, there are some tools that are used to evaluate and
enhance the cloud service reliability. This section gives the
introduction about the tools that help to enhance the reliability
of cloud service.
3.1 FTCloudSim
FTCloudSim is developed by extending the basic functionality
of CloudSim. FTCloudSim, a CloudSim-based tool provides an
extensible mechanism to enhance the cloud service relaibility.
FTCloudSim can handle the failure events with the help of
check-pointing mechanism.

 Computing resource missing: The computing

resources in cloud are any physical or virtual
component. Similarly to the data resource miss, the
computing resource missing may also occur, such as
PC turns off without notifying the CMS.

 Software failure: The software failures that are due

fault or unexpected results in programs running on
same or different computing resources.

 Database failure: The database that stores the

required data resources may also fail due to mistake
in the design of the database, fail to connect with the
database and database crashes that causing that the
subtasks when running cannot access the required
data.

 Hardware failure: The computing resources and data

resources have both hardware (such as computers or
servers) which may also encounter hardware failures
e.g. crashes in he storage devices. Fig 4: FTCloudSim Framework[9]

 Network failure: The network problems arises due to

3.1.1 Design of FTCloudSim
the bad design of the communication channels and
broken of the communication channels when subtasks
access remote data. As shown in Fig. 4, FTCloudSim is developed by adding 6
modules to CloudSim: (fat-tree data center network
We classify the above failures in two groups[6]: construction, failure and repair event triggering, checkpoint
image generation and storage, checkpoint based cloudlet
recovery, and results generation)[9] which will be described in
1) Request Stage Failures: this section.
 Overflow
 Timeout.  Fat-tree data center network construction.
2) Execution Stage Failures: FTCloudSim automatically constructs a fat-tree data
 Data resource missing, center network. With the help of fat-tree construction
 Computing resource missing, the networks can be used with any bandwidth and

294
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
with any communication technology. This feature
helps the cloud service providers and consumers to
reliable communication of the data resources.
 Failure and repair event triggering. With the help of
FTCloudSim all the failure and repair events are
saved on a file so that the experiments can be
repeated for improving the reliability of the cloud.
 Checkpoint image generation and storage. A
checkpoint image is generated and stored for the
purpose of resume the task from that stored point in
the event of failure.
 Checkpoint-based cloudlet recovery. A task is
resumed from the latest checkpoint image stored in
the event of host failure. If there is no accessible
checkpoint image, it will fetch the necessary data
from the central database and restart the interrupted
task from the beginning.
 Results generation. This module generates all the
failure, repair and checkpoint results to the user.
3.2 MCS (Monte Carlo Simulation)
MCS is a computer based mathematical technique that deals
with the quantitative analysis of the risks occurred in the
system.MCS also analyzes the behavior of the component that
causes the uncertainty.MCS is a stochastic simulation tool
which comes in two varieties: non-sequential and sequential.
The general non-sequential MCS algorithm used for evaluating
reliability[11].
All four steps of the MCS algorithm (sampling, classification,
calculation, and convergence) are dependent on an efficient
representation of individual states[11].Non-sequential Monte
Carlo Simulation (MCS) is used for evaluating cloud service
reliability.
4. CONCLUSION
The cloud computing provides high reliability from the
previous technologies (grid computing, distributed computing
etc) but still reliability is primary component to be considered
in cloud computing environment. The challenge of reliability
comes when cloud service provider delivers on-demand
software as a service i.e. accessible through any network
conditions (slow connections) . The main purpose of discussing
reliability in this paper is to highlight the failures in cloud
service. From failure characteristics in cloud we can identify the
availability of cloud service when several of its component
fails. A cloud is more reliable and available if it is more fault-
tolerant. Fault-tolerance mechanism like FTCloudSim and MCS
are used for recovering and evaluating the failures in cloud
computing environment.
295
ISBN: 978-81-924893-0-8
REFERENCES
[1] SRINIVAS J., VENKATA K. and QYSER Dr.
A.MOIZ, “CLOUD COMPUTING BASICS”,
International Journal of Advanced Research in
Computer and Communication Engineering Vol. 1,
Issue 5, July 2012.
[2] Nazir Mohsin, “Cloud Computing: Overview &
Current Research Challenges”, IOSR Journal of
Computer Engineering (IOSR-JCE) ISSN: 2278-
0661, ISBN: 2278-8727Volume 8, Issue 1 (Nov. -
Dec. 2012), PP 14-22.
[3] Buyya Rajkumar, “Introduction to the IEEE
Transactions on Cloud Computing”, IEEE
TRANSACTIONS ON CLOUD COMPUTING,
VOL. 1, NO. 1, JANUARY-JUNE 2013.
[4] Gowri G., Amutha M., “Cloud Computing
Applications and their Testing Methodology”,
International Journal of Innovative Research in
Computer and Communication Engineering, Vol. 2,
Issue 2, February 2014.
[5] Sriram Ilango and Khajeh-Hosseini Ali, “Research
Agenda in Cloud Technologies”.
[6] Dai Yuan-Shun, Yang Bo, Dongarra Jack and Zhang
Gewei, “Cloud Service Reliability: Modeling and
Analysis”.
[7] Vouk Mladen A., “Cloud Computing –
Issues,Research and Implementations”, Journal of
Computing and Information Technology - CIT 16,
2008, 4, 235–246.
[8] Yadav Nikita, Singh V B and Kumari Madhu,
“Generalized Reliability Model for Cloud
Computing”, International Journal of Computer
Applications (0975 – 8887), Volume 88 – No.14,
February 2014.
[9] Zhou Ao, Wang Shangguang, Sun Qibo, Zou Hua
and Yang Fangchun , “FTCloudSim: A Simulation
Tool for Cloud Service Reliability Enhancement
Mechanisms”.
[10] Zhang Congyingzi, Green Robert and Alam
Mansoor, “ Reliability And Utilization Evaluation of
A Cloud Computing System Allowing Partial
Failures”, 2014 IEEE International Conference on
Cloud Computing.
[11] Snyder, Brett W., "Tools and techniques for
evaluating the reliability of cloud computing systems"
(2013).Theses and Dissertations.Paper 211.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Influence of Anti-Patterns on Software Maintenance:

A Review
Sharanpreet Kaur, Satwinder Singh
Mata Gujri College, Fatehgarh Sahib Punjab, Baba Banda Singh Bahadur Engineering College,
sharancgm@gmail.com Fatehgarh Sahib, Punjab,
satwinder.singh@bbsbec.ac.in

ABSTRACT The purpose of the paper is to disclose the commonly

Anti-patters are the defects which affects the system quality occurring anti-patterns in system which are generally
negatively. An indication of the existence of anti-patterns, in specified in [5] and [6]. The work done will be helpful to the
the software is known as ―Code Smell‖ which leads to the community of software engineers and managers for improving
refactoring of system. Thus the maintenance becomes difficult the software development maintenance activities.
to manage. More the number of smells more refactoring is 2. ANTI-PATTERNS IN SOFTWARE
needed. Different approaches have been identified for the
detection of anti-patterns in the system. The paper aimed at
SYSTEM
The software quality is characterized by good design. The
investigating the impact of anti-patterns on classes and what
design crumbles with the passage of time as changes are made
are the certain kinds of anti-patterns that have a higher impact
in the structure due to changing user requirements. The
than others Finally the results have been concluded for the
defects of the software disclose themselves in the form of
future studies in open source systems. The paper is divided in
―Anti-patterns‖ or ―Code Smells‖ [6]. There is a very fine
to four sections in which the introduction is followed by the
line between the anti-pattern and code smell. Anti-patterns are
types of anti-patterns. Furthermore the related work have been
considered to be a bad programming practice but not an error.
examined carefully with a brief conclusion. Thus the paper
Due to lack of experience and relevant knowledge of the
reveals different approaches for the identification code smells
software developers anti-patterns are introduced to the
in the software system. Hence the detection of smells will be
literature, for solving a specific problem. Code Smell is a
helpful in providing more reliability during testing and
manifestation that indicates the problem of software system
maintenance phases by predicting anti-patterns and faults
[5]. It is an implication that admits anti-patterns. However
before the delivery of the product. Moreover the identification
code smells are technically not wrong but they indicate
of anti-patterns will be of usage to the community of software
delicacy in design. It may lead to the failure of system and
engineers and managers for improving the software
risk of bugs in future. Hence system demands ―Refactoring‖–
development maintenance activities.
changing the existing software code without affecting the
Keywords external behavior. Nearly 20 code smells are specified in [6]
Anti-patterns, Code Smells, Refactoring and Maintenance. which are embodied in the source code where refactoring of
code is needed. The following types of anti-patterns/code
1. INTRODUCTION smells are suggested by the following author.
Software systems require continuous maintenance and Table 1. Types of Anti-Patterns
intelligent development for achieving good quality. Quality
can be improved by various quality assurance activities like Author Name Anti-pattern/Code Smells
formal technical reviews, testing, enforcement of standards. Lazy Class, Large Class, Long
Every time when new software is to be developed; already Method, Long Parameter List,
present capital (source code documents, design templates) is Message Chain, Duplicate Code,
used in the development process. But in most of the cases the Divergent Change , Shot Gun Surgery,
reusability of software components degrades the performance M. Fowler [6] Feature Envy, Data Clumps, Primitive
and quality of the software. Some common examples of Obsession, Switch Statements,
software reusability are: Software Libraries, Design Patterns, Parallel Inheritance Hierarchies,
Frameworks, Systematic Software Reuse. In software Middle Man, Speculative Generality,
designing when a problem is occurring time and again than a Inappropriate Intimacy, Temporary
typical solution is needed and a way is provided by the Field
software developers by introducing the term –Design Patterns.
But in majority of cases the design patterns start performing
like ―ANTI-PATTERNS‖. Such design defects are called Blob, Spaghetti Code, Conditional
Code Smells or Anti-Patterns. In case code smells are present B.F. Webster [1] Complexity, Anti-Singleton, Class
maintenance becomes the need of the system. The code smell and W. J. Brown Data Should Be Private(CDSBP),
is referred as an indication of the presence of anti-patterns in et al. [5] Refused Parent Bequest (RPB), Swiss
the system. More the number of smells more maintenance is Army Knife
needed. Anti-Patterns are defined as a classical style which
provide a solution of the trouble which could generates
negative results. Hence, anti-patterns are treated to be the 3. RELATED WORK
negative solutions that yield more problems than they locate. Anti-patterns are derived from work on patterns. These are
Therefore the system starts demanding Refactoring [6]. considered to be a poor design choices but not an error. Code

296
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Smells is an evidence of the presence of anti-patterns. The
term anti-pattern was originated by Andrew Koenig, who
introduces the perception of patterns in the software
engineering [3]. Both the terms anti-patterns and code smells
are used interchangeably.
Several authors studied the influence of anti-patterns and code
smells in the software systems. The work explores the anti-
patterns and code smells, in context to software engineering
activities. The first book on smells was written by Webster [1]
who includes risks of quality assurance, coding, etc.
According to [5] attention is needed towards object oriented
systems. More than 35 smells were specified in [5] which
include the well known design smell ―BLOB‖. The concept of
refactoring was presented in [6], due to the presence of nearly
20 code smells. The author provided a detailed insight of term
―Refactoring‖ which is a process of altering the software
system without changing its external behavior. The author
revealed different types of code smells like Lazy Class, Long
Method, Long Parameter List, Shotgun Surgery, etc. The
above mentioned authors provide a detailed knowledge on
code smells and anti-patterns. However the approach followed
by the authors for the identification of anti-patterns was
completely manual. It was a time consuming and error prone
job for large projects. Thus some researchers proposed the
automatic, visualization based and statistical detection
techniques.
3.1 Traditional Detection Techniques
In the traditional detection techniques the researchers
introduced the different methods using which anti-patterns
and code smells can be identified in the system manually.
This was the first step towards the future of semi automatic
and automatic anti-pattern detection techniques. It varies from
software reading method to metric based and template driven
approach. Some of the approaches are discussed here:
The manual detection strategy [31] was suggested by
Travassos and F. Shull [7]. It was a software reading
technique which provided assistance in detection of smells in
Object Oriented Systems. Different types of Reading
Techniques had been included for the purpose of detection i.e.
Defect Based Reading, Perspective Based Reading, Use
Based Reading. A project was developed by the team of
students which was reviewed on two factors: Horizontal
Review and Vertical Review. The approach was completely
manual and time consuming.
Connie U. Smith and Lloyd G. William [8] investigated the
affect of anti-pattern God Class on the system and show how
to solve it. They also proposed three new performance anti-
patterns that often occur within the software systems
R. Marinescu [14] introduced a metric based approach for
detection of anti-patterns. The technique was realized on tool-
Iplasma More than 8 anti-patterns were detected with nearly
same number of techniques. The threshold values were
compared against values of metrics combined with set
operators.
M.J.Munro [16] suggested a template driven model to detect
anti-patterns. The template consists of three components:
Name of smell, Description of the properties of code smell in
text format, Heuristics for the detection of smells. He
explored the product metrics for the apperception of ―bad
smells‖ in java source software. The paper aimed at using the
metrics to identify the peculiarity of code smell. Interpretation
rules had been applied to calculate the metrics results which
are applied to Java source-code. Hence based on the
calculated results, location of bad smells in the java code
297
ISBN: 978-81-924893-0-8
could be easily identified. For the implementation a prototype
tool had been used on two case studies
E.H.Alikacem and H. Sahraoui [20] provided a language
which identifies the overlook of quality factors and provides s
methodology for identification of smells in object oriented
systems. The terminology provided the guidelines with the
help of fuzzy logic, metrics, association and inheritance.
However it was not validated on any real world project.
Other related detection approaches are discussed by R.Allen
and D. Garlan [2],[4], E.M. Dashofy and A. vander Hoek et
al.[17].
3.2 Visualization Based Detection
Techniques
In visualization based detection techniques the researchers
used different approaches i.e. Metric Based Visualization
Technique, Visualized design defect Detection Strategy,
Domain Specific Language etc. Some of the approaches are
discussed here.
F. Simon et al. [10] suggested a powerful technique to inspect
the internal quality of the software using a metric based
visualization approach. Four types of source code refactoring
had been analyzed: move function, move attribute, extract
class and inline class. An enhanced metric tool- Crocodile had
been used. The approach enabled the software engineers to
identify the ―code smells‖ with a click of mouse and
following the visualization rules.
G. Langelier et al. [19] specified a visualization approach for
the quality analysis of large scale systems. A framework had
been provided which was implemented on open source
systems. Geometrical 3D Box was used for the representation
of classes. Analysis had been done on the values of Metrics
i.e. For Coupling, Cohesion, Inheritance and Size Complexity
CBO, LCOM5, DIT.WMC metrics had been used.
K. Dhambri et al. [25] introduced a design defect detection
visualization based strategy. The approach is validated for
three types of anomalies- Blob, Functional Decomposition
and Divergent Change. The study is further extending to
automatic detection based approach in the near future.
Cedric Bouhours et al. [29] worked on the investigation of
bad smells in the designing process. The spoiled patterns had
been targeted for the identification of bad smells. Spoiled
Patterns are defined as the patterns which did not provide
proper functionality to the system for which it had been
designed. A comparison had been made between design
patterns and spoiled patterns
Naouel Moha et al. [31] specified a domain specific language
based on DECOR, for unmasking anti-patterns. It is a
mechanism which provides a track for description of anti-
patterns, by going through the sequence of steps: Description
analysis, Specification, Processing, Detection, and Validation.
It casts a detection system, DETEX which plays role of
reference instantiation of DECOR. More than 15 types of
code smells had been identified on 11 open source systems.
3.3 Automatic Detection Techniques
In the automatic detection strategies fully automatic detection
tools had been used. Different types of anti-patterns are
identified and few of these approaches are validated on the
real world systems. Some of the approaches are discussed
here:
Yann-Gael Gueheneuc et al. [9] classified three types of
design defects i.e. Intra-Class (within class), Inter-Class
(among classes) and Semantic Nature. A Meta model had
been used to describe design patterns. Inter-class design
defects could be resolved easily with the help of Ptidej Tool.
Eva van Emden and Leon Moonen [11] specified an approach
by which the java source code software’s quality can be
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
improved. The concluded results can also be used in the tool
for automatic software inspection. jCOSMO code smell
browser have been developed to disclose the smells in java
source code. The tool was validated for CHARTOON system.
Jagdish Bansiya and Carl G. Davis [12] introduced a
hierarchical prototype for the evaluation of quality attributes
(reusability, flexibility, understandability etc.) in object
oriented designs. Architectural and Detectable equities of
classes and their objects is calculated using design metrics-
DAM, DCC, CAM, etc. The model provided approach to
implement it on real world projects easily.
Yann-Gael Gueheneuc [15] introduced a tool suite ―Ptidej‖
which have the capability to reverse-engineer different
programming languages to UML class diagrams accurately.
PTIDEJ generates the UML class diagrams which help in
identification of code smells with a higher level of abstraction.
The author provided a brief outline of different reverse
engineering tools like Rational Rose, ArgoUML version
0.14.1, Chava Fujaba version 4.0.1 IDEA, Borland Together,
and Womble recover.
S. Counsell and Y. Hassoun [21] described the refactoring of
seven open source Java systems - MegaMek, JasperReports,
Antlr, Tyrant, PDFBox, Velocity and HSQLDB. The results
demonstrated that the most common re-engineering
components of open source systems are- Renaming and
Moving fields/methods among the code.
Yann Gael Gueheneuc and Giuliano Antoniol [26] presented
Design Motif Identification Multilayered Approach
(DeMIMA) for the detection of micro architectures
(complementary to design motifs). It was a three layered
architecture in which the first two layers provided a miniature
of the source code, and the third layer identified design
patterns. The approach provided 100 % recall on the open
source and industrial systems as well, using explanation-based
constraint programming.
Stephane Vaucher et al. [28] examined carefully the God
Classes to detect the occurrence of bad smells in the software.
Xerces and Eclipse JDT (open-source systems) - had been
studied for the investigation of God Classes.
Salima Hassaine et al. [32] introduced IDS (Immune based
Detection Strategy) - a machine learning process which was
energized from the immune system of the human body.
System could be easily identified for the presence of code
smells and anti-patterns. Gantt Project v1.10.2 and Xerces
v2.7.0 were manually-checked for the existence of smells.
Foutse Khomh et al. [34] proposed Bayesian Detection
Expert, a Goal Question Metric (GQM) based approach to
construct Bayesian Belief Networks (BBNs) from the
descriptions of anti-patterns.BBN examined that identify
whether a class is an anti-pattern or not. BDTEX is validated
for three anti-patterns: Blob, Functional Decomposition, and
Spaghetti code including two open source systems Gantt
Project and Xerces. The approach is also applied to two
industrial projects Eclipse & JHotDraw.
Satwinder Singh and K.S Kahlon [35] investigated the
importance of software metrics and encapsulation for
revealing the code smells. A software metric model had been
introduced that provided the categorization of smells in the
code. Firefox open source system had been investigated for
the validation of results.
Satwinder Singh and K.S Kahlon [36] introduced a metric
model for investigating the smelly classes in the system. The
paper revealed that the results obtained from the metrics could
be helpful in determining the code smells and faulty classes.
Francesca Arcelli Fontana et al. [37] proposed that various
software analysis code smell detection tools are available in
the market but the accuracy of their judgment is still not very
298
ISBN: 978-81-924893-0-8
much clear. Therfore six versions of Gantt Project had been
explored for the detection of four types of code smell, using
more than six tools.
Daniele Romano, Paulius Raila et al. [38] studied the system
by considering source code changes (SCC) obtaining from 16
Java open source systems. Three anti-patterns Complex Class,
Spaghetti Code, and Swiss Army Knife have been identified.
It had been detected that the number of code changes in anti-
patterns classes is greater than the number of changes with no
anti-pattern.
Foutse Khomh et al. [40] investigated the affect of anti-
patterns on classes. More than 50 releases of four systems-
ArgoUML, Eclipse, Mylyn, and Rhino had been considered.
13 types of anti-patterns have been identified .The relation
between the habitation of anti-patterns with the change-
tendency and fault-tendency is investigated. It had been
detected that classes participating in anti-patterns are faultier
than others.
Hui Liu et al. [41] aimed at detecting bad smells in the code.
A detection strategy had been introduced that reduces the
efforts of detecting bad smells by a factor of 17 to 20 %.
Abdou Maiga, Nasir Ali et al. [42] described ―SMURF‖
which is an Anti-pattern Detection Approach. More than 290
experiments have been conducted on three systems i.e
ArgoUML, Xerces, Azureus. Four types of anti-patterns Blob,
Spaghetti Code, Functional Decomposition, and Swiss Army
Knife have been identified. Author revealed that the accuracy
rate of SMURF is greater than that of DETEX and BDTEX
for detection of anti-patterns in the system.
Kwankamol Nongpong [43] carried out the research by
combining the code smells with the tools needed for
refactoring. A tool had been generated called JcodeCanine
which could easily identify the code smells and provided with
the information where the refactoring was needed.
Fehmi Jaafar, Yann Gael Gueheneuc al. [44] provided a
relationship between anti-patterns and design patterns. Three
open source systems ArgoUML, JFreeChart and XercesJ had
been considered for the evaluation of relationship. It had been
concluded that relationship exists between anti-patterns and
design patterns but on temporary basis. The classes had more
error tendency which is present in such anti-patterns.
Harshpreet Kaur Saberwal et al. [45] explored the open source
systems for the identification of code smells in the classes. An
empirical model had been designed for the detection of smells
in the system. The work carried out is validated on the
versions of real world project – JfreeChart.
Pandiyavathi and Manochandar [47] suggested the methods
for the revealing the code smells in the system. An overview
of refactoring technique had been proposed which would be
time saving. Algorithm had been proposed to implement the
refactoring methods.
Francis Palma et al. [48] specified the detection of anti-
patterns in business processes. The rule-based approach has
been detected for improving the quality of BPEL (Business
Process Execution Language) processes to detect BP anti-
patterns. Seven BP anti-patterns have been specified and four
have been detected with three example BPEL processes.
Francis Palma et al. [49] proposed that the quality of service
based systems get affected by the use of anti-patterns. Based
on the data collected from the SBS FraSCAti, it was shown
that the services suspicious of anti-patterns require more
maintenance that non patterns services.
Satwinder Singh and K. S. Kahlon [50] revealed the
importance of metrics and the threshold values in software
quality assurance. Analysis of risk in software system was
explored against the threshold values for the detection of bad
smells. Hence based on threshold values faulty classes could
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
be easily identified. The study is validated by the three
versions of open source systems of Mozilla Firefox.
Jiang Dexun, Ma Peijun et al. [51] suggested that the classes
which were functionally not related could generate problems
in software maintenance. Hence the detection and refactoring
of such classes is needed. A bad smell was proposed by the
author named - Functional over related classes (FRC).A
detection strategy was suggested to indentify the bad smell.
The work was validated on four open source systems-
HSQLDB, Tyrant, ArgoUML and JfreeChart.
3.4 Empirical Detection Techniques
The following are the empirical detection techniques which
explore the work done on code smells and anti-patters.
Different types of anti-patterns have been considered by
different authors. Some of the proposed work is given below:
Mika Mantyla et al. [13] presented the research work done on
the bad code smells. The paper provided taxonomy for
making the smells more understandable. Author revealed
different types of classes for bad smells like Bloaters,
Encapsulators, Dispensables, Couplers, etc. A Survey was
performed at a Finnish software company, which provided a
correlation between the smells.
Foutse Khomh et al. [24] introduced the concept of software
quality maintenance by avoiding the use of harmful anti-
patterns. The paper revealed that the quality of the software is
affected by use of anti-patterns.
S. Olbrich et al. [27] considered the historical data of Lucene
and Xerces. It had been identified that classes with the anti-
patterns Blob and Shotgun Surgery have a higher change
frequency than non anti-patterns classes.
Min Zhang, Tracy Hall et al. [33] provided a deep insight of
literature by going through more than 300 papers on code bad
smells since 2000. The paper disclosed that research work is
needed on the percussion of code smells. It had been
concluded that the smell-Duplicated Code is studied more
than other code smells.
Rabia Bashir [39] identified the impact of anti-patterns on
open source software development. The paper revealed that
the anti-patterns, which are available in open source software
development and the solutions to avoid them.
Harvinder Kaur and Puneet Jai Kaur [46] examined various
types of anti-pattern detection techniques i.e. Manual (metric
based approach, metric-based heuristics, ad hoc domain
specific language) Semi-Automated (DCPP matrix) and SVM
based anti-pattern detection techniques (DTEX, BTEX,
SMURF).
4. CONCLUSION
In this paper a vast literature survey have been done to
limelight the affect of anti-patterns on the source code. Our
study reveals different approaches for the detection of anti-
patters and code smells. It has been concluded that the
research community have analyzed their results on the basis
of within company projects only. The need has been identified
to examine the results for different company projects. Further
it has been analyzed that not much researchers have done
work on large projects to identify the anti-patterns. Only few
have done work on large number of anti-patterns to disclose
the impact of these smells. Therefore the need has been
generated for the identification anti-patterns and the kinds of
anti-patterns with their impact on classes in the object
oriented open source projects. Thus the future work will also
be possible for the identification of the commonly occurring
anti-patterns in the open source systems and to investigate the
impact of anti-patterns using the software metric. Hence the
299
ISBN: 978-81-924893-0-8
results obtained will be beneficial to the software industry to
improve the quality of the software system by predicting the
faulty classes, during the testing phase. It helps in providing
more reliability during testing and maintenance phases by
predicting anti-patterns and faults before delivery of the
product. Thus the results produced will also be of interests to
engineers, as they can predict which classes are to be tested
more precisely. The study will be valuable for the software
engineers and managers for improving their maintenance
activities by eliciting the code smells.
REFERENCES
[1] B. F. Webster, 1995 Pitfalls of Object Oriented
Development.1st Ed. M & T Books.
[2] D. Garlan, R. Allen and J. Ockerbloom, 1995
―Architectural Mismatch: Why Reuse Is So Hard,‖ IEEE
Software, Vol. 12, No. 6, pp. 17-26.
[3] Koenig and Andrew, 1995 ―Patterns and Anti-
patterns,‖ Journal of Object-Oriented Programming 8, pp 46–
48.
[4] R.Allen and D. Garlan, 1997 ―A Formal Basis for
Architectural Connection,‖ ACM Trans. Software Eng. and
Methodology, Vol. 6, No. 3, pp. 213-249.
[5] W.J. Brown, R.C. Malveau, W.H. Brown, H.W.
McCormick III, and T.J. Mowbray, 1998 ―Anti patterns:
refactoring software, architectures, and projects in crisis‖. 1st
Ed. Wiley, New York.
[6] M.Fowler, 1999 ―Refactoring—improving the design of
existing code‖ 1st Ed. Addison-Wesley.
[7] G. Travassos, F. Shull ,Michael Fredericks, Victor R.
Basil, 1999 ―Detecting Defects in Object-Oriented Designs:
Using Reading Techniques to Increase Software Quality,‖ In
Proceedings of 14th Conf. Object-Oriented Programming,
Systems, Languages, and Applications, pp. 47-56.
[8] Connie U. Smith and Lloyd G. William, 2000 “Software
Performance Anti-patterns,‖ ACM Soft. Engg. Research, pp.
127-136.
[9] Yann Gael Gueheneuc, Herve Albin-Amiot and Ecole
des Mines de Nantes,2001 ―Using Design Patterns and
Constraints to Automate the Detection and Correction of
Inter-class Design Defects,‖ Paper accepted at TOOLS USA.
[10] F.Simon, F.Steinbruckner and C.Lewerentz, 2001.
―Metrics Based Refactoring,‖ In Proceedings of Fifth
European Conf. Software Maintenance and Re-eng., p.30
[11] Eva van Emden and Leon Moonen,2002 ―Java Quality
Assurance by Detecting Code Smells,‖ In Proceedings of
Ninth Working Conference on Reverse Engg. IEEE.
[12] Jagdish Bansiya and Carl G. Davis, 2002 ―A Hierarchical
Model for Object Oriented Design Quality Assessment,‖
IEEE Trans. on Software Eng. Vol. 28, No. 1, pp.4-17.
[13] Mika Mantyla, Jari Vanhanen and Casper Lassenius,
2003 ―A Taxonomy and an Initial Empirical Study of Bad
Smells in Code,‖ In Proceedings of the Inter. Conference on
Software Maintenance, IEEE. pp. 381-384.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[14] R.Marinescu, 2004 ―Detection Strategies: Metrics-Based
Rules for Detecting Design Flaws,‖ In Proceedings of 20th
Int. Conf. Software Maintenance, pp. 350-359.
[15]Yann Gael Gueheneuc, 2004 ―A Systematic Study of
UML Class Diagram Constituents for their Abstract and
Precise Recovery,” 11th Asia-Pacific Conference on Soft.
Engg, pp. 265-274.
[16] M.J. Munro, 2005 ―Product Metrics for Automatic
Identification of ―Bad Smell‖ Design Problems in Java
Source-Code,‖ In Proceedings of11th IEEE Int. Software
Metrics Symp.
[17] E.M. Dashofy, A. vander Hoek and R.N. Taylor, 2005
―A Comprehensive Approach for the Development of
Modular Software Architecture Description Languages,‖
ACM Trans. Software Eng. and Methodology, Vol. 14, No. 2,
pp. 199-245.
[18] Yann Gael Gueheneuc, 2005 ―Ptidej: Promoting Patterns
with Patterns‖ In Proceedings of 1st ECOOP workshop on
Building a System using Patterns (BSUP), pp. 1-9 Springer-
Verlag.
[19] G. Langelier, H.A. Sahraoui and Pierre Poulin, 2005
―Visualization-Based Analysis of Quality for Large-Scale
Software Systems,‖ ACM Inter. Conf. on Automated Soft.
Engg, pp. 214-223.
[20] E.H. Alikacem and H. Sahraoui, 2006 ―Generic Metric
Extraction Framework,‖ In Proceedings of 16th Int.
Workshop Software Measurement and Metrik Kongress, pp.
383-390.
[21] S. Counsell and Y. Hassoun, 2006 ―Common
Refactorings, a Dependency Graph and some Code Smells:
An Empirical Study of Java OSS,‖ IEEE Inter. Symposium on
Empirical Soft. Engg. pp. 288-296.
[22] Yann-Gael Gueheneuc, 2007 ―Ptidej: A Flexible
Reverse Engineering Tool Suite,‖ IEEE Inter. Confer. On
Soft. Maintenance, pp 529-530.
[23] Naouel Moha, Yann-Gael Gueheneuc and Anne-
Francoise Le Meur, Laurence Duchien, 2008a ―A domain
analysis to specify design defects and generate detection
algorithms,‖ In Proceedings of of 11th Int. Conf. on
Fundamental Approaches to Soft. Engg., Springer New York,
pp. 276-291
[24] Foutse Khomh and Yann-Gael Gueheneuc, 2008 ―Do
Design Patterns Impact Software Quality Positively?‖
In Proceedings of 12th Conf. on Soft. Maintenance and
Reengineering IEEE pp. 274-278.
[25] K. Dhambri, H. Sahraoui, and P. Poulin, 2008 ―Visual
Detection of Design Anomalies,‖ In Proceedings of 12th
European Conf. Software Maintenance and Reng, pp. 279-
283.
[26] Yann Gael and Giuliano Antoniol, 2008 ―DeMIMA: A
Multilayered Approach for Design Pattern Identification,‖
IEEE Trans. on Software Eng. Vol. 34, No. 5, pp. 667-684.
[27] S. Olbrich, D. S. Cruzes, 2009 ―The evolution and impact
of code sells: A case study of two open source systems,‖ In
300
ISBN: 978-81-924893-0-8
3rd Inter. Symposium on Empirical Soft. Engg. and
Measurement, pp. 390-400.
[28] Stephane Vaucher, Foutse Khomh, Naouel Moha and
Yann-Gael Gueheneuc, 2009 ―Tracking Design Smells:
Lessons from a Study of God Classes,‖ In 16th Working
Conference on Reverse Engg..
[29] Cedric Bouhours, Herve Leblanc, 2009 ―Bad smells in
design and design patterns, ” Journal of Object Techn. , Vol.
8, No. 3, pp. 43-63.
[30] Naouel Moha, Yann-Gael Gueheneuc, Anne-Fran_coise
Le Meur, Laurence Duchien and Alban Tiberghien,2010
―From a Domain Analysis to the Specification and
Detection of Code and Design Smells,‖, Springer Verlag
(Germany), pp.345-361.
[31] Naouel Moha, Yann-Gael Gueheneuc, Laurence
Duchien, and Anne-Francoise Le Meur,2010 ―DECOR: A
Method for the Specification and Detection of Code and
Design Smells,‖ IEEE Trans. on Software Eng. Vol. 36, No.
1, pp.20-36.
[32] Salima Hassaine, Foutse Khomh, Yann-Gael Gueheneuc,
and Sylvie Hamel,2010 ―IDS: An Immune-Inspired Approach
for the Detection of Software Design Smells,‖ 7th IEEE Inter.
Conference on the Quality of Infor. And Comm. Tech., pp.
343-348.
[33] Min Zhang, Tracy Hall and Nathan Baddoo,2011 ―Code
Bad Smells: a review of current knowledge,‖ Journal
Software Maintenance Evol. Res. Pract.,Vol. 23, pp. 179–
202..
[34] Foutse Khomh, Stephane Vaucher, Yann Gael
Guéhéneuc and Houari Sahraoui, 2011 ―Bdtex: A gqm-based
bayesian approach for the detection of anti-patterns,‖ J. Syst.
Softw., Vol. 84, No. 4, pp. 559–572.
[35]Satwinder Singh and K.S Kahlon, 2011 ―Effectiveness of
Refactoring Metrics Model to Identify Smells and Error Prone
Classes in Open Source Software,‖ ACM SIGSOFT Soft.
Engg. Notes, Vol. 36 No.5 pp.1-11.
[36] Satwinder Singh and K.S Kahlon, 2012 ―Effectiveness of
Encapsulation and Object Oriented Metrics to Refactor Coe
and Identity Error Prone Classes using Bad Smells” ACM
SIGSOFT Soft. Engg. Notes, Vol. 37 No.2 pp.1-10.
[37] Francesca Arcelli Fontanaa, Pietro Braione and Marco
Zanoni,2012 ―Automatic detection of bad smells in code: An
experimental assessment,‖ Journal of Object Technology,
Vol. 11, No. 2, pp.1–38.
[38] Daniele Romano, Paulius Raila, 2012 ―Analyzing the
Impact of Anti-patterns on Change-Tendency Using Fine-
Grained Source Code Changes,‖ Proc of the 19th Working
Conference on Reverse Engineering (WCRE), IEEE
Computer Society Press.
[39] Rabia Bashir, 2012 ―Anti-patterns in Open Source
Software Development,‖ Int. Journal of Computer
Applications, Vol.44, No.3.
[40] Foutse Khomh, Massimiliano Di Penta, Yann Gael
Gueheneuc and Giuliano Antoniol,2012 ―An exploratory
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
study of the impact of anti-patterns on class change- and fault-
tendency,‖ Springer Science Business Media, LLC,Aug.
[41] Hui Liu, Zhiyi Ma, Weizhong Shao, and Zhendong Niu,
2012 ―Schedule of Bad Smell Detection and Resolution: A
New Way to Save Effort,‖ IEEE Trans. On Software Engg.,
Vol. 38, No. 1.
[42] Abdou Maiga, Nasir Ali, Neelesh Bhattacharya, Aminata
Sabane, Yann-Gael Gueheneuc, and Esma Aimeur, 2012
“SMURF: A SVM-based Incremental Anti-pattern Detection
Approach, ―Presented at 19th Working Conference on
Reverse Engineering, pp. 466-475.
[43] Kwankamol Nongpong, 2012 ―Integrating \Code Smells
Detection with Refactoring Tool Support‖ Ph.D. Dissertation,
University of Wisconsin-Milwaukee.
[44] Fehmi Jaafar, Yann-Gael, Sylvie Hamel, and Foutse
Khomh, 2013 ―Analysing Anti-patterns Static Relationships
with Design Patterns,‖ In Proceedings of of the First
Workshop on Patterns Promotion and Anti-patterns
Prevention, EASST Vol. 59.
[45] Harshpreet Kaur Saberwal, Satwinder Singh and Sarabjit
Kaur,2013 ― Empirical Analysis Of Open Source System For
Predicting Smelly Classes,‖ Inter. Journal of Engineering
Research & Technology, Vol. 2 Issue 3,pp.1-6.
301
ISBN: 978-81-924893-0-8
[46] Harvinder Kaur, Puneet Jai Kaur, 2014 ―A Study on
Detection of Anti-Patterns in Object-Oriented Systems‖ Inter.
Journal of Computer Applications Vol. - 93, No 5, pp. 25-28.
[47] Pandiyavathi and Manochandar, 2014 ―Detection of
Optimal Refactoring Plans for Resolution of Code Smells,‖
Inter. Journal of Advanced Research in Computer and Comm.
Engg. Vol. 3, No. 5, pp. 6-11.
[48] Francis Palma, Naouel Moha and Yann Gael
Guenheneuc, 2013 “Detection of Process Anti-patterns: A
BPEL Perspective,‖ 17th IEEE Int. Workshop on Enterprise
Distributed Object Computing, pp. 173-177.
[49] Francis Palma, Le An, 2014 ―Investigating the Change-
proneness of Service Patterns and Anti-patterns,‖ 7th Inter.
Conf. on Service-Oriented Computing and Applications IEEE
pp. 1-8.
[50] Satwinder Singh and K. S. Kahlon, 2014 ― Object
oriented software metrics threshold values at quantitative
acceptable risk level,‖ CSI Transactions on ICT, Springer
Vol. 2, No. 3,pp 191-205.
[51] Jiang Dexun1, Ma Peijun, Su Xiaohong and Wang
Tiantian,2014 ―Functional over-related classes bad smell
detection and refactoring suggestions,‖ International Journal
of Software Engineering & Applications (IJSEA), Vol.5,
No.2, pp 29-47.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A review on Data clustering and an efficient k-Means

Clustering Algorithm
Sukhjeet kaur, Satwinder Singh,
BBSBEC, Fatehgarh Sahib BBSBEC, Fatehgarh Sahib

ABSTRACT
Clustering is the task of grouping & organizing a set of similar
objects together. The set of organized objects with the help of
clustering is known as clusters. Clustering together with software
artifacts provides an automatic technique for discovering high level
abstract entities within a system. K-means clustering algorithm which
came into existence in 1955 is most efficient, understandable and
easy to grouped similar behavioral objects. After that, many
algorithms have evolved over the years but k-means is still being
widely used. The reason is complications in designing of a clustering
algorithm and ill-posed problem of clustering. The history and brief
over view of popular clustering methods, key issues in designing
clustering algorithms and the useful researches over the clustering
will be discussed in this work. The implementation and analysis of
heuristic for k-means clustering is known as Lloyd's algorithm, also
named as filtering algorithm. The filtering algorithm requires a kd-
tree as the only major data structure for clustering. The practical
efficiency of the filtering algorithm is discussed in two ways in
scientific community: Firstly, a data-sensitive analysis of the
algorithm's run time and secondly, a number of empirical studies
both on synthetically generated data and on real data sets.

Keywords
Clustering, K-means, Developments, Filtering algorithm

I. INTRODUCTION
The growth of data increases day by day, so the different data is
available. The images and videos contain large amount of data. It is
estimated by Gantz[1] that the digital universe consumed
approximately 281 exabytes in 2007, and it is projected to be 10 times
that size by 2011 (1 exabyte is 101,000,000 terabytes).Most of this
data is unstructured, which lead to the difficulty in analyzing it. Tukey
[2] broadly classified data analysis techniques into two major types:
(i) exploratory or descriptive, meaning the researcher is interested in
understanding general characteristics or structure of the high-
dimensional data but pre-specified models or hypotheses are not
required, and (ii) confirmatory or inferential meaning that the
researcher is interested in confirming the validity of a
hypothesis/model or a set of assumptions given the available data. The
data clustering is a very good technique for organizing and analyzing
the data.
A. Data Clustering
A differentiation is made between learning problems by Duda [3] that
are (i) classification (supervised) or (ii) clustering
(unsupervised).Clustering is a more complicated problem than
classification. In general, in classification there has a set of predefined
classes and want to know which class a new object belongs to.
Clustering tries to group a set of objects and find whether there
is some relationship between the objects.
The aim of data clustering, also known as cluster analysis, is to
discover the natural grouping(s) of a set of patterns, points, or objects.
Webster (Merriam-Webster Online Dictionary, 2008) defines cluster
analysis as „„a statistical classification technique for discovering
whether the individuals of a population fall into different groups by
making quantitative comparisons of multiple characteristics.”
Importance of data clustering:
Cluster analysis is applicable in any discipline that contains analysis
of multivariate data. A search via Google Scholar (October 2014)
found 2,600,000 entries with the words data and clustering that
appeared in 2014.It is complex to comprehensively record the
innumerable scientific fields and applications that have used
clustering techniques and many of published algorithms. Image
segmentation, a significant dilemma in computer vision, can be coined
as a clustering problem. Data clustering is applicable for the following
main intents: Underlying structure, Natural classification and
Compression.
Background development:
According to JSTPR [4], data clustering first appeared in the title of a
1954 article dealing with anthropological data. Data clustering is
acknowledged as Q-analysis, typology, clumping, and taxonomy as
well. Major approaches to clustering will be briefly reviewed .Frank

302
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

and Todeschini [5] defined the Jarvis–Patrick algorithm that states the
similarity between a pair of points as the number of common
neighbors they share. Dempster [6] proposed the EM algorithm, is
usually applied to infer the parameters in mF4ixture models. Agrawal
[7] defined CLIQUE to find subspaces in the data with high-density
clusters. The representation of the data points as nodes in a weighted
graph is done using Graph theoretic clustering, also known as spectral
clustering.
Clustering algorithms can be subdivided as hierarchical and
partitional.K-means is the simplest and most popular partitional
algorithm.
filtered. As the kd-tree is computed for the data points more willingly
than for the centers, the update of this structure with each stage of
Lloyd's algorithm is not required. This is not a new clustering
method, although an accurate implementation of Lloyd's algorithm.
Data analysis can be done of the time spent in each stage of the
filtering algorithm. Traditional worst-case analysis is not really
appropriate here since, in principle, the algorithm might encounter
scenarios in which it degenerates to brute-force search. Empirical
analysis can be done on Synthetic and real data to determine the
variations in running time as a function of cluster separation, data set
size, and dimension.

II. LITERATURE REVIEW

B. k-means clustering:
Jain and Dubes [8] defined the main steps of K means algorithm as:
1.Select an initial partition with K clusters; repeat steps 2 and 3 until
cluster membership stabilizes.2. Generate a new partition by assigning
each pattern to its closest cluster center.3.Compute new cluster
centers. The K-means algorithm depends upon three user-specified
parameters: number of clusters K, cluster initialization, and distance
metric. Choosing value of K is most censorious. There are different
extensions of K-means algorithm. The enlarged heuristics are tackled
by some of these extensions that involve the minimum cluster size and
merging and splitting clusters. There are two popular alternatives of
K-means in pattern recognition literature that are ISODATA proposed
by Ball and Hall [9] and FORGY Forgy [10]. Fuzzy c-means is an
extension of K-means where each data point can be a member of
multiple clusters with a membership value (soft assignment), which
was proposed by Dunn [11] and later improved by Bezdek [12].

1) k-means’ Filtering algorithm

The simple iterative scheme for finding a locally minimal solution is

the base of the notorious heuristic for solving the k-means problem,
known as k-means algorithm. Many variations are available to this
algorithm. Here Lloyd‟s algorithm is discussed whose result was for
scalar data.
A center is optimally placed at the centric of the associated cluster;
this is the fundamental of Lloyd‟s algorithm. Given any set of k
centers Z, for each center z belongs to Z, let V(z)†denote its
neighborhood, that is, the set of data points for which z is the nearest Fig.1.The filtering algorithm
neighbor. In geometric terminology, V (z) †is the set of data points
lying in the Voronoi cell of z [48]. Each stage of Lloyd's algorithm
moves every center point z to the centroid of V (z) and then updates
V (z) by re-computing the distance from each point to its nearest
center. Until a specific condition doesn‟t occur, these steps are
repeated.

Lloyd's algorithm presumes data as memory resident. Lloyd‟s

algorithm is simple and flexible so it is preferred for statistical
analysis. The final distortion of any other clustering algorithm can be
improved by applying Lloyd's algorithm as a post processing stage.
This can provide a significant improvement. An undemanding
implementation of Lloyd's algorithm can be sluggish. The reason is
the computing cost required for the nearest neighbors. A well
organized and simple implementation of Lloyd's algorithm is
presented in this paper, which is known as filtering algorithm. The
very first step of this algorithm is storage of the data points in a kd-
tree. The purpose of computing and moving each center to the Fig.2. Candidate z is pruned because g lies entirely on one side of
centroid of the associated neighbors is to maintain, for each node of the bisecting hyper plane r.
the tree, a subset of candidate centers. The candidates for each node
are broadcasted to the node‟s children as they are condensed or C. Difficulties and challenges for users regarding clustering

303
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The elementary challenges associated with clustering were highlighted
in Jain and Dubes [13] are as follows:
(a) What is a cluster?
(b) What features should be used?
(c) Should the data be normalized?
(d) Does the data contain any outliers?
(e) How do we define the pair-wise similarity?
(f) How many clusters are present in the data?
(g) Which clustering method should be used?
(h) Does the data have any clustering tendency?
(h) Does the data have any clustering tendency?
Some of these challenges will be highlighted and illustrated. The
making of clusters becomes easy while the data representation is good
and the clusters become compact and isolated. Then even a simple
clustering algorithm can easily find those clusters. The purpose of
grouping plays an important role in the data representation. Most
methods for automatically determining the number of clusters cast it
into the problem of model selection. Mostly, the different values of k
are used by the clustering algorithms. Based on the predetermined
criterion, the best value of k is selected. The minimum message
length abbreviated as MML,criteria proposed by Wallace and Boul
ton; Wallace and Freeman[14] in conjunction with the Gaussian
mixture model (GMM) to estimate K. Cluster validity indices can be
defined based on three different criteria: internal, relative, and
external, was used by Figueiredo and Jain[15].
D. Comparison of clustering algorithms:
Even if the different clustering algorithms applied on the same data,
often the results can be entirely different partitions. FORGY,
ISODATA, CLUSTER, and WISH are partitional algorithms that
minimize the squared error criterion.MST (minimum spanning tree)
works as a single-link hierarchical algorithm, and JP is a nearest
neighbor clustering algorithm. A partition can be generated by
specifying a threshold on the similarity by applying a hierarchical
algorithm.
Clustering algorithms were formally analyzed by Fisher and vanNess
[16] with the objective of comparing them and providing guidance in
choosing a clustering procedure. A set of admissibility criteria for
clustering algorithms was defined by them that test the sensitivity of
clustering algorithms with respect to the changes that do not alter the
essential structure of the data. A clustering is called A- admissible if it
satisfies criterion A.
E. Trends in clustering
A diverse set of data is created by Information explosion along with
the large amounts of data. The data created is both structured and
unstructured. The structure in the objects is ignored by most of the
clustering approaches and a feature vector based representation for
both structured and unstructured data is used by them. The traditional
view of data partitioning based on vector- based feature representation
does not always serve as an adequate framework. A brief summary of
some of the recent trends in data clustering is presented below.
1) Developments:
Fred and Jain [17] stated that the development of ensemble methods
for unsupervised learning has been motivated by the success of
ensemble methods for supervised learning. By taking different looks
304
ISBN: 978-81-924893-0-8
at the same data different partitions of the same data can be
generated, which is the principle idea. It is possible to obtain a good
data partitioning while the clusters are not compact and well
separated by combining the resulting partitions. Then a co-occurrence
matrix that provided a good separation of the clusters was used to
combine these partitions.
The data based on the new pair-wise similarity is used to obtain the
resulting clustering. Many different ways of generating a clustering
ensemble and then combining them are available. For example,
multiple data partitions can be generated by: (i) applying different
clustering algorithms, (ii) applying the same clustering algorithm with
different values of parameters or initializations, and (iii) combining of
different data representations (feature spaces) and clustering
algorithms.
Semi-supervised clustering:
Chapelle [18] stated that clustering algorithms are said to be operating
in a semi-supervised mode that utilize such side information. There
are two open questions: (i) how should the side information be
specified? And (ii) how is it obtained in practice? A must-link
constraint specifies that the point pair connected by the constraint
belong to the same cluster. On the other hand, a cannot-link constraint
specifies that the point pair connected by the constraint do not belong
to the same cluster. Other approaches for including side information
include (i) „„seeding”, where some labeled data is used along with
large amount of unlabeled data for better clustering stated by Basu[19]
and (ii) methods that allow encouraging or discouraging some links
stated by Law[20] and Figueiredo[21].
Large-scale clustering:
The challenge of clustering millions of data points that are represented
in thousands of features is addressed by large-scale data clustering.
The application of large-scale data clustering to content-based image
retrieval is reviewed below.
The goal of Content Based Image Retrieval (CBIR) is to retrieve
visually similar images to a given query image. There is not much
success in this topic instead of the study for the past 15 years. Datta
[22] stated that a 2008 survey on CBIR highlights the different
approaches used for CBIR through time. Recent approaches for CBIR
use key point based features.
On the other hand, text retrieval applications are much faster. It takes
about one-tenth of a second to search 10 billion documents in Google.
A large number of clustering algorithms have been developed to
efficiently handle large-size data sets. Most of these studies can be
classified into four categories:
1. Efficient Nearest Neighbor (NN) Search, 2. Data summarization,
3.Distributed computing, 4 Incremental clustering and 5.Sampling
based clustering
Multi-way clustering:
A combination of related heterogeneous components forms objects or
entities that have to be clustered. The objects can be converted into a
pooled feature vector of its components but it is not a natural
representation of the objects and it may result in poor clustering
performance. Hartigan[23] and Mirkin[24] defined Co-clustering as it
aims to cluster aims to cluster both features and instances of data
simultaneously to identify the subset of features where the resulting
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
clusters are meaningful according to certain evaluation criterion. Bi-
dimensional clustering double clustering, coupled clustering, or
bimodal clustering are its other names. Bekkerman [25] stated that the
co-clustering framework was extended to multi-way clustering into
cluster a set of objects by simultaneously clustering their
heterogeneous components. The problem is much more challenging
because of different relationships.
Heterogeneous data:
Heterogeneous data refers to the data where the objects may not be
naturally represented using a fixed length feature vector.
Rank data: Consider a dataset generated by ranking of a set of n
movies by different people; only some of the n objects are ranked
movies by different people; only some of the n objects are ranked. The
task is to cluster the users whose rankings are similar and also to
identify the „representative rankings‟ of each group. Dynamic data:
Dynamic data, as opposed to static data, can change over the course of
time e.g., blogs, Web pages, etc. As change over the course of time
e.g., blogs, Web pages, etc. A data stream is a kind of dynamic data
that is transient in nature, and cannot be stored on a disk. Graph data:
Several objects, such as chemical compounds, protein structures, etc.
can be represented most naturally as graphs. Relational data: Another
area that has attracted considerable interest is clustering relational
(network) data. Unlike the clustering of graph data, where the
objective is to partition a collection of graphs into disjoint groups, the
task here is to partition a large graph (i.e., network) into cohesive sub
graphs based on their link structure and node attributes.
III. CONCLUSION
The various developments, methods and improvements done over the
years, are available for the different clustering techniques which are
discussed in this paper. Many difficulties and challenges are faced by
the users regarding clustering that are still obligatory to be recovered.
The k-means algorithm is most simple and well known algorithm
which can be easily implemented. So its heuristic, Lloyd‟s algorithm
is presented. Kd-tree is the main significance of this algorithm as it
requires only once to be generated for the given data points. The
variation of these data points does not take place, due to this reason
the efficiency is achieved.
IV. FUTURE WORK
Future research is required make the vital amendments in clustering
methods to advance the competence and implementation of
clustering algorithms.
REFERENCES
[1]Gantz,John F.,” The diverse and exploding digital universe”,
“http://www .emc.com/collateral/analyst-reports/diverse-exploding-
digital universe.pdf”
[2]Tukey,John Wilder,”Exploratory Data Analysis”.Addison-
Wesley.Umeyama,S.,1988.An eigen decomposition approach to
weighted graph matching problems.IEEE Trans.Pattern An al.
Machine Inte ll.10(5),695–703 .
[3]Duda ,R.,Hart,P.,Stork ,D. ,”Pattern Classification”. John Wiley
and Sons,New Yo r k.
[4]JSTOR, 2009 . JSTO R.< http :// www. j s to r .o r g>.
305
ISBN: 978-81-924893-0-8
[5]Frank, I ldiko E .,Todeschini,Roberto ,1994.”Data Analysis Hand
book “. Elsevier Science Inc ., pp . 227 – 228 .
[6]Dempster,A.P ., Laird , N.M. ,Rubin ,D.B. ,1977 .”Maximum
likelihood from in complete data via the EM algorithm”. J. Ro y.
Statist.Soc. 3 9, 1 – 38 .
[7]Agrawal , Rakesh , Gehrke, Johannes , Gunopulos , Dimitrios ,
Raghavan , Prabhakar,1998.”Automatic subspace clustering of high
dimensional data for data mining applications”.In : Proc . ACMSIG
MOD, pp . 94 – 1 0 5.
[8]Jain,Anil K.,Dubes,Richard C . ,1988 .”Algorithms for Clustering
Data”. Prentice Hal l. Jain ,Ani l K. , Flynn,P.,1996.Image
segmentation using clustering.In :Advances in Image Understanding .
IEEE Computer Society Press,pp.65 – 83
[9] Ball,G.,Hal l,D.,1965.ISO DATA,anovel method of data anlysis
and pattern classification.Technical report NTISAD 69
9616.Stanford Research Institute, Stanford ,CA.
[10] Forgy, E .W .,1965.Cluster analysis of multivariate data :
Efficiency vs .interpretability of classifications .Biometrics 21,768–
769 .
[11]Dunn,J.C .,1973.A fuzzy relative of the ISO DATA process and
its use in detecting compact well -separated clusters. J. Cybernet.3,32
–57 .
[12] Bezdek,J.C ., 1981.”Pattern Recognition with Fuzzy Objective
Function Algorithms” .PlenumPress .
[13]Jain ,A nil K.,Dubes , Richard C. ,1988 .”Algorithms for
Clustering Data”. Prentice H al l .
[14]Wallace , C. S., Boulton , D. M. , 1 9 6 8 .” An information
measure for classification” .Comput . J. 1 1 , 1 8 5 – 19 5 .
[15] Figueiredo ,Mario ,Jai n ,Anil K .,2002 .”Unsupervised learning
of finite mixture models”. IEEE Trans. Pattern Anal . Machine Intel l
.2 4 (3),381– 396 .
[16]Fisher , L .,van Ness , J., 1971 . “Admissible clustering
procedures” .Biometrika .
[17]Fred ,A ., Jain , A. K., 2002 . “Data clustering using evidence
accumulation” . I n: P roc. Internat . Conf. Pattern Recognition (I CP
R) .
[18]Chapelle , O . , Scholkopf, B ., Z ie n , A. (E d s .), 2 0 0 6.
“Semi - Supervised Learning”. MIT Press , Cambridge , MA .
[19]Basu ,Sugato , Banerjee ,Ar indam, Mooney, Ray mo n d, 2 00 2
. “Semi- supervised Basu,Sugato,Banerjee” ,
Arindam,Mooney,Raymond, 2 00 2 . Semi- supervised
[20] Law , Martin , Topchy ,Alexander , Jai n , A.K ., 2 0 0 5 .
“Model - based clustering with probabilistic constraints” .In : Proc.
SIAM Conf. on Data Mining , p p . 64 1 – 6 4 5.
[21]Figueiredo , M. A. T. , Chang, D. S. , Murino , V. , 20 0 6 .
“Clustering under prior knowledge with application to image
segmentation” . Ad v. Neural Inform. Process . Systems 19 , 4 01 – 4
0 8.
[22]Datta, Ritendra ,Joshi , Dhiraj , Li , Jia , Wang , James Z ., 2 0 08
. “Image retrieval : Ideas , inuences , and trends of the new age”.
ACM Computing Surveys 40(2 ) ( Article5) .
[23]Hartiga n , J. A., 1972 . “Direct clustering of a data matrix. J”.
Amer. Statist . Assoc. 6 7( 3 3 7) , 1 2 3 – 13 2 .
[24]Mirkin , Boris , 1996 . “Mathematical Classification and
Clustering” .Kluwer Academic Publishers.
[25]Bekkerman ,Ron,El - Yaniv , Ran, McCallum , Andrew , 2005.
“Multi - w ay distributional clustering via pairwise interactions” . In :
Proc. 22n d Internat. Conf. Machine Learning , pp . 4 1 –4 8 .
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Data Mining Technique to Predict Mutations from Human
Genetic Information in Bioinformatics: A Review
Manpreet Kaur
Department of Computer Science & Engg,
BGIET,Sangrur,Punjab,India,
manpreet033@gmail.com
ABSTRACT
With the widespread use of databases and the explosive
growth in their sizes, there is a need to effectively utilize these
massive volumes of data. To effectively handle this data there
is a need for new techniques and tools to acquire useful
information from the large amount of data. This growth need
gives a view for a new research field called Knowledge
Discovery in Databases (KDD) or Data Mining. Based on the
type of knowledge that is mined, data mining techniques can
be mainly classified into association rules, decision trees and
clustering. Until recently, biology lacked the tools to analyze
massive repositories of information. The data mining
techniques are effectively used to extract meaningful
relationships from these data and can also monitor the
changing trends in data.
Keywords
Data mining, Nucleotide, Mutations, Association.
1. INTRODUCTION
In recent years Biological related data are growing speedily in
size and complexity. A huge amount of data is available for
extracting high level of information in the form of finding
interested pattern from the database. Biological data contains
DNA sequences and protein sequences. Bioinformatics
involves the manipulation, searching and data mining of DNA
sequence data. The development of techniques to store and
search DNA sequences have led to widely applied advances in
computer science, especially string searching algorithms,
machine learning and database theory. Research in
bioinformatics includes development of applications using
data mining techniques to solve biological problem.
Therefore, there is a great potential to increase the interaction
between data mining and bioinformatics.
1.1 Bioinformatics:-
The term bioinformatics was coined by Paulien Hogeweg in
1979 for the study of informatics processes in biotic systems.
Bioinformatics can be defined as the application of computer
technology to the management of biological information.
Bioinformatics is the science of storing, extracting,
organizing, analyzing, interpreting and utilizing information
from biological sequences and molecules. It has been mainly
used in DNA sequencing and mapping techniques. Over the
past few decades rapid developments in genomic and other
molecular research technologies and developments in
information technologies have combined to produce a
tremendous amount of information related to molecular
biology. The primary goal of bioinformatics is to increase the
understanding of biological processes.[3]
306
ISBN: 978-81-924893-0-8
Shivani Kang
Department of Computer Science & Engg, BGIET,
Sangrur,Punjab, India.
kangshivani@gmail.com
Bioinformatics and computational biology are concerned with
the use of computation to understand biological phenomena
and to acquire and exploit biological data, large-scale data.
Methods from bioinformatics and computational biology are
increasingly used to augment or leverage traditional
laboratory and observation-based biology. These methods
have become critical in biology due to recent changes in our
ability and determination to acquire massive biological data
sets, and due to the ubiquitous, successful biological insights
that have come from the exploitation of those data. This
transformation from a data-poor to a data-rich field began
with DNA sequence data, but is now occurring in many other
areas of biology.[1]
1.1.1 Molecular biology Information - DNA and
Mutation
1.1.1.1 DNA
DNA is made of a long sequence of smaller units strung
together. There are four basic types of unit: A, T, G, and C.
These letters represents the type of base each unit carries:
adenine, thymine, guanine, and cytosine.
The sequence of these bases encodes instructions. Some parts
of your DNA are control centers for turning genes on and off,
some parts have no function, and some parts have a function
that we don't understand yet. Other parts of your DNA are
genes that carry the instructions for making proteins — which
are long chains of amino acids. These proteins help build an
organism.
1.1.1.2 Mutations
A mutation is a change in DNA, the hereditary material of
life. An organism's DNA affects how it looks, how it behaves,
and its physiology. So a change in an organism's DNA can
cause changes in all aspects of its life.
Types of mutations:
a) Substitution: A substitution is a mutation that exchanges
one base for another (i.e., a change in a single "chemical
letter" such as switching an A to a G). Such a substitution
could:
 change a codon to one that encodes a different amino
acid and cause a small change in the protein produced.
 change a codon to one that encodes the same amino acid
and causes no change in the protein produced. These are
called silent mutations.
 change an amino-acid-coding codon to a single "stop"
codon and cause an incomplete protein. This can have
serious effects since the incomplete protein probably
won't function.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Eg. CTGGAG will change to CTGGGG after substitution.
b) Insertion: Insertions are mutations in which extra base
pairs are inserted into a new place in the DNA.
Eg. CTGGAG will change to CTGGTGGAG after insertion.
c) Deletion: Deletions are mutations in which a section of
DNA is lost, or deleted.
Eg. CTGGAG will change to CTAG after deletion.
d) Frameshift: Since protein-coding DNA is divided into
codons three bases long, insertions and deletions can
alter a gene so that its message is no longer correctly
parsed. These changes are called frameshifts.
Eg. Suppose the sequence is ‘the fat cat sat’ and after the
frameshift if t get deleted then sequence become ‘hef atc ats
at’[2]
1.2 KDD, Data Mining and its Techniques
Researchers identify two fundamental goals of data mining:
prediction and description. Prediction makes use of presented
variables in the database in order to predict future values of
interest and description focuses on finding patterns describing
the data and the subsequent presentation for user explanation .
The relative importance of both prediction and description
differ with respect to primary application and the technique.
With the enormous amount of data stored in files, databases,
and other repositories, it is increasingly important, if not
necessary, to develop powerful means for analysis and
explanation of data and for the extraction of interesting
knowledge that could help in decision-making. Data Mining,
also popularly known as Knowledge Discovery in Databases
(KDD).
Fig 1-Steps of KDD Process
The overall process of finding and interpreting patterns from
data involves the repeated application of the following steps
(KDD Process
First Stage : Selecting data-set and focusing on data samples
on which the discovery is to be performed.
Second Stage : Preprocessing of selected data is to be
performed in this stage to remove irrelevant data i.e. outliers
and noise etc. Missing data fields are also handled in this
stage.
307
ISBN: 978-81-924893-0-8
Third Stage : Finding useful features of the data depending
on the goal of the task and using dimensionality reduction or
transformation methods to reduce the effective number of
variables under consideration.
Fourth Stage : Depending on the goal of KDD process,
choose data mining task such as doing clustering, regression,
classification etc. Then choosing the appropriate data mining
algorithm for searching patterns satisfying constraints of
overall KDD process.
Fifth Stage : In this stage, search for patterns of interest
(which are in particular representational form. Interpretation
of mined patterns and consolidating discovered knowledge is
the main objective at this stage.
Data mining is a step in the knowledge discovery process. It
refers to the application of algorithms for extracting patterns
from data without the additional steps of the KDD process.
1.2.1 Techniques of Data Mining :
1. Characterization: This kind of functionality in data mining
summarize general features of objects in a target class. For
example -Characterize Graduate Student in Science etc.
2. Discrimination : This functionality is comparison of general
features of objects between a target class and a contrasting
class. It is used for Comparison between the two subjects in
target class. For example - Compare students in Science and
Students in Arts.
3. Association : Given a database with n Boolean attributes
A1,A2,A3..,An, the task of discovering association rules is to
derive implications of the form X!Y, where X and Y are sets
of attributes from Ai (i=1 to n) and X\Y = null with support
S% and confidence C% (user defined) where: Support S%
indicates that S% of transactions in the database contain both
X and Y. Confidence C% indicates that C% of transactions
containing X in the database, also contain Y. For example :
Bread->Milk with support 0.4 and confidence 0.7, indicates
that when people buy Milk they also buy cookies 70% of the
time and that 40% of transactions contain both these items.
4. Prediction : In this functionality, prediction of some
unknown or missing attribute values based on other
Information. For example : Forecast the sale value for next
week based on available data.
5. Classification : A set of object (record), called the training
data-set T, is available. This data-set belongs to a population,
which is partitioned into K mutually exclusive and exhaustive
groups or classes. Each object in T is labeled with exactly one
class and serves as an example. The objective is to classify or
assign an unlabelled object (belonging to the parent
population) to one of the classes under conditions of
uncertainty, based on the observations made on the training
data set T i.e. the classification problem strives to construct a
classification scheme which classifies an unlabelled object (i.e
whose class is unknown ) to the correct class with some
known confidence.
6. Clustering : In this, Data Mining organizes data into
meaningful sub-groups (clusters) such that points within the
group are similar to each other, and as different as possible
from the points in the other groups. It is an Unsupervised
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Classification. For example : Group crime locations to find
distribution patterns. In this, Minimize interclass similarity
and Maximize intra-class similarity.
7. Outlier Analysis : In this, Data Mining is done to identify
and explain exceptions. For example, in case of Market
Basket Data Analysis, outlier can be some transaction which
happens unusually i.e which happens surprisingly or so.
8. Time-series Analysis : In this, Data Mining analyzes trends
and deviations, regression, sequential pattern, similar
consequences.[10]
1.3 Need of Data Mining in Bioinformatics
The entire human genome, the complete set of genetic
information within each human cell has now been determined.
Understanding these genetic instructions promises to allow
scientists to better understand the nature of diseases and their
cures, to identify the mechanisms underlying biological
processes such as growth and ageing and to clearly track our
evolution and its relationship with other species. The key
obstacle lying between investigators and the knowledge they
seek is the sheer volume of data available.
Biologists, like most natural scientists, are trained primarily to
gather new information. Until recently, biology lacked the
tools to analyze massive repositories of information such as
the human genome database. Luckily, the discipline of
computer science has been developing methods and
approaches well suited to help biologists manage and analyze
the incredible amounts of data that promise to profoundly
improve the human condition. Data mining is one such
technology.
Applications of data mining to bioinformatics include gene
finding, protein function domain detection, function motif
detection, protein function inference, disease diagnosis,
disease prognosis, disease treatment optimization, protein and
gene interaction network reconstruction, data cleansing, and
protein sub-cellular location prediction.
For example, microarray technologies are used to predict a
patient’s outcome. On the basis of patients’ genotypic
microarray data, their survival time and risk of tumour
metastasis or recurrence can be estimated. Machine learning
can be used for peptide identification through mass
spectroscopy. Correlation among fragment ions in a tandem
mass spectrum is crucial in reducing stochastic mismatches
for peptide identification by database searching. An efficient
scoring algorithm that considers the correlative information in
a tuneable and comprehensive manner is highly desirable.
2. Related Works
Data mining is used in various applications of bioinformatics.
The various applications of bioinformatics where data mining
can be used has been proposed by [3]. He had discussed the
grand area of research in bioinformatics like Sequence
analysis, Genome Annotation, Analysis of gene expression,
analysis of protein expression, analysis of mutations in cancer,
comparative genomics etc.
There are many data mining techniques are available to
discover meaningful pattern and rules. These techniques has
been discussed in [4].These techniques can be statistics,
308
ISBN: 978-81-924893-0-8
artificial intelligence techniques, Decision tree approach,
Genetic algorithm, Visualization etc.
The work of mining gene expression databases is closely
related to the outcome using association rules has been
proposed by[5]. In this research work, they had made an
algorithm for effectively mining association rules from gene
expression data using the data set of 300 expression profiles
for yeast. By analysing these rules, we can extract numerous
associations between certain genes.
The work of Data Mining in Bioinformatics using WEKA has
been proposed by [6].WEKA is based on the machine learning
technique. WEKA explorer provide the graphical user
Interface. It is used for automatic classification, clustering and
feature selection. It can be also used for comparing various
machine learning algorithms.
The work of exploration of DNA sequences using pattern
mining has been proposed by [7]. In this analysis they had
perform a comparison between the nucleotides of normal
breast gene with BRCA1 gene and predict that whether the
patient is suffering from breast cancer or not.
The work of predicting outcome of thoracic surgery by data
mining techniques has been proposed by [8] .This paper helps
in predicting outcome of thoracic surgery. The dataset contain
the information of 470 patients where 400 patients survived a
year after surgery and 70 patients failed to survive at least 1
year after the surgery. For the analysis of data they had used
the WEKA toolkit. For the prediction purpose they had used
the data mining techniques like Naïve Bayes, Simple Logistic
regression, J48 and Multilayer perceptron.
The work of mining DNA sequences to predict sites which
mutations cause genetic diseases has been proposed by [9].
They had developed a data mining system called rSNP_Guide
to discover regulatory sites in DNA sequences and analyse the
change in nucleotides to predict the type of mutations which
could be the cause of genetic diseases.
Diseases which are caused due to abnormalities in individual's
genome is the most focused area of research at present.
Genetic mutations accompanied by disorders make it more
complex.
DNA is made of a long sequence of smaller units strung
together. There are four basic types of unit: A, T, G, and C.
These letters represents the type of base each unit carries:
adenine, thymine, guanine and cytosine.
Mutations are the changes in the pattern of DNA due to some
diseases or due to some treatment like cancer treatment.
We can predict the mutations in pattern of DNA using data
mining tools by extracting information about the patterns
which are followed by nucleotide chains of DNA. Monitoring
changes in patterns, we will better be able to recognize
patterns of nucleotides which are actually changing due to
some mutations or disorders. This information can be useful
in medical research to let them develop tools and techniques
to handle those nucleotide patterns.
To extract this information about changes in DNA pattern, we
can use the technique of data mining like association. From
this, we will find the association rules and from these
association rules we will extract the information about
mutations.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Although data mining has become popular as an emerging
technique, still there are several issues to be resolved to make
it useful in diverse domains. Some of the issues faced by data
mining are quality of data, inter-operability, security and
privacy etc. Other than all this, there is one major issue with
the data mining is its lack of taking into account the analysis
of real time data e.g Time Series Data, Evolving Data
Streams. Data mining does not capture all these changes. It is
just a static method which analyse the data which it is having
as input (static data).
To complete the lacking needs of Data mining mentioned
above, we need to develop a new data mining technique to
capture the changing trends in databases.
3. CONCLUSION
So far, many genetic diseases have no effective cure.
Scientists are facing difficulties in finding out the causes.
Bioinformatics field researches have identified techniques to
analyze huge chunks of genetic information. The technique
called next generation data mining have revolutionized
diversity of research in biology. Data mining will help us to
detect diseases by sequences of genomic data. Scientists can
effectively handle the large volume of data and can easily
extract the useful information. This useful information will
help us find the defective genome and will help in curing the
disease. This technique can be used in cancer treatment, drug
treatment, AIDS etc. Data mining in future will help us study
genomic data in more detail and tell information about how
our body formed and how its working is associated with
genome. It is therefore an effective technique to solve the
problem of enormous data faced by researchers in their quest
to solve the puzzles of our life.
We can use this data mining technique in various fields. This
application can be extended to other fields like market basket
analysis to tell how things should be placed in baskets, media
applications (trend of news and media quality) etc, Fraud
detection techniques like finding out outliers or frauds in
criminal investigation data and detecting worms and viruses in
cyber attacks.
309
ISBN: 978-81-924893-0-8
REFERENCES
[1] Ezziane,Zoheir 2006. Applications of artificial
intelligence in bioinformatics:A review. Expert System with
Applications(ELSEVIER), Vol.30, pg. 2-10.
[2] Lodish,H., Berk A.,Zipursky,S Lawerence, Matsudaira,P.,
Baltimore,D. and Darnell,J. 2000. Molecular Cell Biology, 4th
Edition.
[3] Raza,Khalid 2006. Application of Data Mining in
Bioinformatics. Indian Journal of Computer Science and
Engineering, Vol. 1 No. 2, p.114-118 ,ISSN.
[4] Lee,Sang Jun and Siau,Keng 2001. A review of Data
Mining Techniques.Vol. 101/1,p.41-46,ISSN.
[5] Creighton,Chad and Hanash,Samir 2003. Mining gene
expression databases for association rules. University of
Michigan. Vol.19, No. 1, pg. 79-86.
[6] Frank, E., Hall,M., Trigg,L., Holmes, G. and Witten, Lan
H. 2004. Data Mining in Bioinformatics Using Weka.
University of Waikato. Vol. 20, No. 15, pg. 2479-2481.
[7] Kawade, Dipak R. and Oza,Kavita S. 2013. Exploration
of DNA Sequences Using Pattern Mining. International
Journal of Emerging Technologies in Computational and
Applied Sciences (IJETCAS), pg. 144-148, ISSN.
[8] Harun,Ahasan Uddin and Alam, Nure 2015. Predicting
Outcome of Thoracic Surgery By Data Mining Techniques.
International Journal of Advanced Resaerch in Computer
Science and Software Engineering, Vol.5, Issue 1, pg.7-
10,ISSN.
.
[9] Ponomarenko,J., Merkulova,T., Orlova,G., Fokin,O.,
Gorshkov,E. and Ponomarenko,M. 2002. Mining DNA
sequences to predict sites which mutations cause genetic
diseases, Vol.15, pg.225-233.ISSN.
[10] Saurkar,Anand V., Bhujade,V., Bhagat,P. and
Khaparde,A. 2014. A Review Paper on various Data Mining
Techniques, Vol.4, Issue 4, pg.98-101.ISSN.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Analysis of AODV, OLSR and ZRP Routing Protocols in

MANET under cooperative black hole attack
Sukhman Rupinder Kaur Gurm Gurjot Singh Sodhi
Dept of Computer Science, RIMT, Dept of Computer Science, RIMT, Dept of Computer Science,
Mandi Gobindgarh ,India Mandi Gobindgarh ,India Tangori, Mohali ,India

ABSTRACT
An ad hoc network (MANET) is a set of different types of
mobile nodes , these nodes are connected with each other
through wireless link. MANET can be developed at any time,
at any place with low cost. In MANET protocols are used to
connect nodes which are not in direct range of each other.
These protocols are mainly of three types i.e reactive (on
demand), proactive (table driven) and hybrid routing
protocols. This research effort is focused on first the
comparative investigation of routing protocols under the
cooperative black hole attack to create scenario and simulate
and investigate the performance in terms of packet delivery Figure I Mobile Ad hoc network (MANET)
ratio , average end to end delay and throughput.

Keywords
MANET , AODV ,OLSR ,ZRP ,Black hole.

1. INTRODUCTION
A mobile Ad hoc Network (MANET) as its name implies, is
a collection of mobile nodes that can communicate with each
other without the use of predefined infrastructure or
centralized administration. Mobile ad-hoc network have the
attributes such as wireless connection, continuously changing
topology, distributed operation and ease of deployment.
Mobile ad hoc networks (MANETs) face different levels of
challenges due to its varying mobile characteristics. The major
goal of these networks is to bring the idea of mobility into
real-life networks. These networks are known for their
infrastructure less characteristics. The nodes are free to move
anywhere and hence the communications links may be broken
at any moment.
2. ROUTING PROTOCOLS
In MANET routing protocols are used for communicate. They
are classified into different categories according to the
methods used during the route discovery and route
maintenance procedures.
Figure II Routing Protocols in MANET
2.1 AODV (Ad hoc on demand distance vector )
The Ad-hoc On-Demand Distance Vector (AODV) routing
protocol [14] is designed for use in ad-hoc mobile networks.
AODV is a reactive protocol: the routes are created only when
they are needed. It uses traditional routing tables, one entry
per destination, and sequence numbers to determine whether
routing information is up-to date and to prevent routing loops.
An important feature of AODV is the maintenance of time-
based states in each node: a routing entry not recently used is
expired. In case of a route is broken the neighbours can be
notified. Route discovery is based on query and reply cycles,
and route information is stored in all intermediate nodes along
the route in the form of route table entries. The following
control packets are used: routing request message (RREQ) is
broadcasted by a node requiring a route to another node,
routing reply message (RREP) is back to the source of RREQ,
and route error message (RERR) is sent to notify other nodes
of the loss of the link. HELLO messages are used for
detecting and monitoring links to neighbors.

310
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure III (a) AODV Route Discovery
Figure III (b) Route Error Message in AODV
2.2 OLSR (Optimized Link State Routing)
Optimized Link State Routing Protocol, OLSR [4] is
developed for mobile ad hoc networks. It is well suited to
large and dense mobile networks. It operates as a table-driven,
proactive protocol, that is, it exchanges topology information
with other nodes of the network regularly. Each node selects a
set of its neighbour nodes as “multipoint relays” (MPR) [2],
[6]. MPRs, are responsible for forwarding, control traffic,
declaring link state information in the network, provide an
efficient mechanism for flooding control traffic by reducing
the number of transmissions required.
Figure IV Topology graph of network
2.3 ZRP – ZONE ROUTING PROTOCOL
ZRP (Zone outing Protocol) is a wireless Ad hoc routing
protocol uses both proactive routing and on-demand routing
policies [4]. Proactive routing uses needless bandwidth to
maintain routing information, while reactive routing involves
311
ISBN: 978-81-924893-0-8
route acquisition latency. Reactive routing also inefficiently
floods the entire network during route establishment phase.
The aimof Zone Routing Protocol (ZRP) is to trace the
problems by joining the best properties of both approaches.
ZRP can be called as a hybrid reactive/proactive routing
protocol [5].
2.3.1 Architecture
The architecture of Zone Routing Protocol is basically based
on the concept of zones, in which a large network is
partitioned into number of zones and a routing zone is defined
for each node separately, and the zones of neighbouring nodes
overlap. The routing zone has a radius r denoted by hops. The
zone thus includes the nodes, whose distance from the node is
at most r hops. Figure1 illustrates that, the routing zone of S
consists of the nodes A–I, but not K. In the illustrations, the
radius is pointed as a circle around the node. It should
however, be noted that the zone is not a physical distance,
rather it is defined in hops.
Figure V Example routing zone with r=2
The nodes of a zone are partitioned into horizon nodes and
interior nodes. Horizon nodes are those nodes whose
minimum distance from the centre node is exactly equal to the
zone radius r. The nodes whose, minimal distance is
comparatively less than radius r are interior nodes. The nodes
having distance equal to zone radius r are horizon nodes and
nodes with distance more than radius r are exterior nodes. In
Figure 1, the nodes A, B, C, D, E and F are interior nodes, the
nodes G, H, I and J are horizon nodes and node K lies outside
the routing zone. The node G can be reached in two ways, one
with hop count 2 and another with hop count 3. The node is
said to be within the zone, because the shortest path is less
than or equal to the zone radius [6].
3. BLACK HOLE ATTACK
Black holes refer to places in the network where incoming
traffic is dropped without informing the source that the data
did not reach its intended recipient. In Black hole Attack a
node uses the protocol and advertises itself as having the
shortest path to the destination node where the packet is
destined to. Black hole attack can occur when the malicious
node present in the network is intended to attack directly the
data traffic and intentionally drops, delay or alter the data
traffic passing through it [8]. In black hole attack, black hole
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

node acts like black hole in the universe, it consumes all the 5.Singh etal. (2014)Stimulated and analysed the performance
traffic towards itself and doesn’t forward to other nodes . of AODV , DSR and TORA for E-Mail application under
There are two types of black hole attack. blackhole attack.

3.1 Single black hole node
In the Black hole attack with single malicious node, only one
node will act as malicious node in a zone. Other nodes of the
zone will be authentic [10].
6.Arora etal. (2014)studied and analysed the performance of
MANET Routing protocol like DSDV , DSR , AODV , OLSR
and ZRP with and without black hole attack.
6. NS 2 SIMULATION

NS2 Simulation Ns2 is most widely used simulator by

researchers; it is event driven object oriented simulator,
developed in C++ as back end and OTcl as front end. If we
want to deploy a network then both TCL (Tool Command
Language) as scripting language with C++ to be used [11].

Simulation parameters
Figure VI Single malicious node
For simulation, we use NS2 network simulator .Mobility
scenario is generated by random way point modal by taking
3.2 Collaborative black hole attack 50 nodes in simulation area of 1500*1500 m . WE use the
following parameters.
In Collaborative Black Hole Attack multiple nodes in a group
act as malicious node. It is also known as Black Hole Attack Parameters Value
with multiple malicious nodes [10]. Simulator NS 2
Routing protocols AODV , OLSR and ZRP
MAC layer 802.11
Packet size 512 bytes
Terrain size 1500*1500
Nodes 50
Mobility Modal Random waypoint modal
Data traffic rate CBR
No. of sources 5,10,15,20,25,30
Simulation duration 30 sec
CBR Traffic Rate 8 packet / sec
Maximum speed 0-20 m/sec (30 sec pause
time)
Figure VII Multiple malicious nodes
7. CONCLUSION
4. RELATED WORKS
In future the study will be performed on the decided values of
1. Mistry etal.(2010)Proposed modified AODV protocol and parameters, mentioned in this paper and the effect of these
justified the solution with appropriate implementation and parameters on the various performance matrices i.e packet
simulation using NS-2.33 delivery ratio, average end to end delay and throughput will
be noticed.
2. Shivahare etal. (2012)Compared AODV , DSR and DSDV
under black hole attack for parameters such as Route REFERENCES
Discovery, Network overhead ,periodic broadcast and node
overhead. [1] Prabhu and Subramanium , (2012), “Performance
comparison of routing protocols in MANET” ,
3. Gupta etal.(2013)Proposed an algorithm Secure Detection International journal of Advanced research in computer
Technique (SDT)for ZRP protocol which can be used to science and software engineering , Volume 2 , Issue 9,pp
prevent blackhole attack in MANETs. 388 -392.

4.Satveer etal. (2013)Compared FSR,DYMO and LANMAR
to evaluate their performance under blackhole attack over
various parameters.
[2] Arunima patel and ashok verma ,(2012) , “A Review
evaluation of AODV protocol in MANET with and
without black hole attack” , International journal of
emerging technology and advanced engineering ,
Volume 2 , issue 11 , , pp.673-677.

312
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[3] Muzamil Basha and Raghu veer Matam ,(2013) ,

“Improved performance of DSDV, AODV and ZRP
under black hole attack in MANETS ” , IJECT , Volume
4 , Issue 4 .

[4] Pradish Dadhania and Schin Patel ,(2013) , “Performance

evaluation of routing protocol like AODV and DSR
under Black hole attacks” , International journal of
engineering research and application , Volume 3 , Issue 1
,pp. 1487 – 1491.

[5] Monika verma and Dr. N.C ,Barwar ,(2014), “A

Comparative analysis of DSR and AODV protocols
under black hole attack and grey hole attack in MANET”
, IJCSIT , Volume 5 pp.1228 -7231.

[6] Neeraj Arora and Dr. N. C. Barwar ,(2014), , “Evaluation

Of AODV , OLSR and ZRP routing protocol under black
hole attack ” , International Journal Of Application or
Innovation in Engineering and management , Volume 3 ,
Issue 4

[7] Lovepreet Singh , Navdeep Kaur and Gurjeevan Singh ,

(2014), “Analysis of the performance of MANET
protocol under black hole attack for E-mail applications”
, International Journal of Computer application , Volume
3 , Issue 4.

313
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A REVIEW ON CONTENT BASED VIDEO RETRIEVAL

Jaspreet Kaur Mann Navjot Kaur

Department of Computer Engineering Punjabi Department of Computer Engineering Punjabi
University,Patiala. University,Patiala.
preetsmann23@gmail.com navjot_anttal@yahoo.co.in

ABSTRACT
The advancement in the data capturing, data storage, and
communication technologies have made huge amount of
video data available to consumer and for business
applications. The retrieval of relevant data by user is
becoming difficult day by day. In the past the conventional
method of video retrieval was used as the number of videos
were less, video can be retrieved using keywords manually
annotated, but today manual annotation method does not give
relevant results besides it depends on human perception and
is very time consuming. Processing video is slightly difficult
as video contains varied type of information audio, text and
images. Content based video retrieval system retrieves the
video based on content of video i.e. color, texture, shape,
audio and motion. These low level features help in retrieving
relevant videos .In this paper the various existing techniques
of content based video retrieval are discussed. Content based
video retrieval has many useful applications in various areas Fig.1. a) video divided into shots b) Shots into key frames.
such as news broadcasting, video archiving, video
surveillance etc. In content based video retrieval various query techniques can
be used. Querying by example is a method in which user
Keywords provides the CBVR system with an example video and the
Content based video retrieval, distance measure, shot
system searches database using the example. Querying by
boundary, Key frame, GLC,LBP.
direct specification of image features and semantic queries
1. INTRODUCTION can be used like “find videos of Barack Obama”. This paper
Increased use of multimedia has resulted in development of provides introduction to content based video retrieval system
efficient technique for video retrieval i.e. Content based Video and reviews various techniques used for content based video
Retrieval Systems. Usual query-by-text retrieval cannot retrieval.
satisfy users requirements in finding the desired videos
effectively. Content based video retrieval consider the actual 2. ARCHITECTURE OF CBVR
content of the video i.e. the low level features like color, Content-based video retrieval, uses the visual contents of a
texture and shape .Processing videos is difficult than video such as color, shape, texture, and motion to represent
processing images a number of factors must be dealt when and index the video. In content based video retrieval we detect
using video such as shot boundary detection, key frame the shots from video, from the shots we extract the key frames
extraction ,feature extraction and similarity measurement. For from videos in the database, then feature extraction is
enhancing conventional search engines, there is an abundant performed on key frame and features are stored in database.
space in the field of video retrieval via the exploitation of the Similarly when user input query video, the system changes
rich media contents. This has transformed content based video video into shots, shots into key frames these frames are
retrieval (CBVR) into a promising direction for creating represented using feature vectors .The distance between the
future video search engines[1]. Video has complex structure. feature vector of query frame and those frames in the database
Video is divided into scenes, then shot boundary analysis is are then calculated and retrieval is performed. Lower the
done to form shots and key frame analysis is done to extract distance value higher the similarity between frames.
key frames.

314
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig.2. Block diagram of Content Based Video Retrieval
3. METHODOLOGY OF CBVR
3.1 Shot Boundary Detection
A shot consists of set of contiguous frames all acquired
through a continuous camera motion. Each shot can be
represented by one or more key frames. The various
techniques used for shot detection are pixel based shot
boundary detection, block based shot boundary detection and
histogram based shot boundary detection.
3.2 Key Frame Selection
Key frame extraction is one of the important step in content
based video retrieval. Key frame selection helps in reducing
redundancy. Key frame is the frame which can represent the
significant content of the shot. The key frames extracted must
review the characteristics of the video, all the key frames on
the time sequence gives visual outline of the video to the user.
3.3 Feature Extraction
Feature extraction is another crucial step in video retrieval.
The color, texture and shape features are extracted from key
frames and represented in the form of feature vector.
315
ISBN: 978-81-924893-0-8
3.3.1 Color
Color feature is widely used for many applications like image
retrieval and video retrieval. Color feature is relatively robust
and simple to represent. Color histogram, color moments and
color coherence vector are commonly used for representing
color feature.
3.3.2 Texture
Texture involves the spatial distribution of gray levels.
Texture is that property of surfaces that describes visual
patterns. Various techniques used for texture analysis include
GLCM, edge histograms, auto-correlation and LBP.
3.3.3 Shape
The shape of an object is a binary image representing the
extent of the object. The human visual system relies on shape
properties. Shape representations can be divided into two
categories, boundary-based and region-based. Shape is
invariant to translations, rotations and scaling. For
representing shape feature chain codes, edge histogram,
Fourier descriptors are used.
3.4 Similarity Measurement
A distance function like Euclidean distance, Manhattan
distance, Chebyshev distance, chi-square etc can be used for
matching feature vectors of query video and video in the
databases. Videos having feature vector closest to feature
vector of the query are returned as best results.
4. LITERATURE SURVEY
B.V Patel et al. in[1] proposed a method of retrieving videos
by using entropy and black and white points on edge.
Proposed content based video retrieval system work in two
phases. In first phase GLC is constructed for every frame and
entropy is calculated. These entropy values are stored in
database and in second phase when query video frame is
received again its entropy is calculated using GLC matrix and
also black and white points are calculated using prewitt edge
detection and then similarity measure is applied between
query frame and every key frame of database to get relevant
video. The experimental results showed that combining both
features is more effective than using only a single feature .
Asha S,Sreeraj M in[2] proposed a robust content based video
retrieval system. The system retrieves similar videos based on
a local feature descriptor SURF. Manhattan and Euclidean
distance are used for similarity matching. Then the
performance of system is evaluated using recall and precision.
The experimental results shows that system provides an
average precision of 75% with 83% recall.
Chaoqun Hong et al. in[3] proposed a new method to
efficiently find the objects and locate them. First, the tracked
stable features are used to represent the image and encoded by
compressed feature description. This description is fast to
process and lossless. It takes less space than the traditional
feature descriptors to store the features. Second, the fast
region searching method finds the positions of query target
with very low computational complexity. Besides, it is able to
handle scale changes and locate multiple targets in one frame.
The experimental results are satisfactory.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Ja-Hwung et al. in [4] proposed a method for high quality
content based video retrieval by discovering temporal patterns
in video contents and applied efficient indexing and sequence
matching technique to improve retrieval accuracy. In this
method first pre-processing was done and shot was detected
then color layout and edge histogram are extracted from shots.
Indexing was done using FPI-tree and AFPI-tree and then
searching is performed using FPI-search to retrieve videos.
Experimental results show that this approach is very good for
improving content-based video retrieval efficiency.
A Vadivel et al in[5] compared performance of different
distance metrics on different color histograms. Manhattan
distance, Euclidean distance, Vector Cosine Angle distance
and Histogram Intersection distance are used for performance
comparison. The results show that the Manhattan distance
performs better than the other distance metrics for all the five
types of histograms.
T.N Shanmugam et al. in[6] proposed a method of retrieving
video using video query clip. In this method first the video
was divided into shots, then video shots were segmented using
2-D correlation coefficient technique. Motion, edge histogram
and color histogram features were extracted from the videos
and stored in feature database and the same features are then
extracted from the query clip and Kullback Leibler distance
method was used for similarity measurement. The Kullback
Leibler distance was effective in retrieving similar videos.
Shradha Gupta et al. in[7] proposed a method of retrieving
video from a database by giving query as an object .In this
method the video was divided into frame and segmentation
was applied to separate the object from the frame. Then
features are extracted from object using SIFT features. Then
the features of video in database and query object were
matched by nearest neighbor matching algorithm. The
performance of the system was more than 95%,it was more
effective as it was invariant to illumination changes.
transform and color histogram .The experimental results
showed that proposed method was better than other methods
in terms of precision. The computational complexity was also
reduced due to use of wavelet transformation.
Madhav Gitte et al in[11] gives overview of content based
video retrieval system. First video segmentation is done, then
key frame is selected using Euclidean distance, features are
extracted from frame and stored in feature vector. For
indexing of frames hierarchical clustering tree algorithm was
used. For retrieving relevant video similarity matching is done
between query and feature vectors in database .The
performance was evaluated using precision and recall.
Indexing and clustering improved efficiency of the system.
BV Patel et al in[12] provided the review of visual features
that can be extracted from video for efficient retrieval and
similarity measurements are discussed. Comparison of various
feature extraction algorithms is performed like color-texture
classification, character identification, semantic video
retrieval etc. Different types of algorithms are suitable for
different applications .At the end it is concluded that the
feature must be chosen carefully and user interaction must be
increased for better retrieval.
Shimna Balakrishnan et al in[13] discusses about existing
techniques and uses various combination of algorithms for
color, texture and shape features for video retrieval. Various
algorithms are compared the results vary depending upon type
of video and on size of video. In the end it is concluded that
combination of color moment, geometric moment and co-
occurrence gave the best results.

Fazal Malik et al. in[8] has done the analysis of distance

metrics in CBIR using statistical quantized histogram texture
features in DCT domain. In this method first the quantized
histogram statistical features are extracted from the DCT
block of image using DC and first 3 coefficients of AC.
Various distance measures were used to measure similarity
using texture features .The corel image database was used.
The precison values showed that Euclidean distance, city
block distance and sum of absolute differences metrics give
good retrieval results using quantized histogram texture
features in DCT domain.

Poonam O.Raut et al in[9] provides an overview of general

techniques used in content based video retrieval. In the
proposed method first video is divided into shots and
statistical difference method is used for boundary detection,
reference frame based method is used for key frame extraction
and feature extraction is done using color RGB moment is
used, for texture LBP is used and for shape edge histogram is
used and then clustering is used to cluster frames based on
low level features. Then the similarity measure between
clustered frames and query frames is found. The results show
that clustering helps in reducing the number of comparisons.
Thus provide efficient video retrieval.

Manimala Singha et al in[10] proposed the method of content

based video retrieval using texture and color feature .The
texture and color features were extracted using wavelet

316
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1. Comparison of various techniques discussed in literature survey

Sr.no Reference Method used Results Advantages/ Disadvantages

1. B.V.Patel et al Entropy(GLC) and black and DNP* i) Integration of both techniques gives better
[1] white points on edge(prewitt results.
edge detection)
ii)Freq, histogram and data mining
techniques can be used to enhance results.

2. Asha S et al[2] SURF used for feature extraction. Precision=75% i)SURF is robust against rotation, scaling &
Euclidean and manhattan noise.
distance is used for similarity Recall=83%
measurement. ii)It is low dimensional therefore faster.

3. Chaoqun Hong Compressed feature DNP* i)Low cost , high accuracy, lossless and fast
description(CFD) using motion to process.
et al[3] and fast region search(FRS)
ii)Takes less space.

iii)FRS has very low computational

complexity.

4. Ja-Hung et al Temporal pattern used for Precision=90% i) Decrease computation cost.

[4] indexing(FPI and AFPI tree),
Recall=20% ii) Improves retrieval accuracy.
feature extraction using color and
edge histogram

5. T.N Motion(FFT),edge(edge Precision=10-89% i)segments video into shot proficiently.

Shanmugam et histogram),color(histogram) &
al[5] texture(Gabor filter) features Recall=27-90% ii) Efficient method.
used. Kullback Leibler distance
is used for similarity. (depends on type of
query clip)

6. Shradha Gupta SIFT used for feature extraction Precision=95% It is invariant to illumination changes.
et al[6]

7. Poonam O.Raut Shot detection is done from video DNP* Clustering reduces no. Of comparisons.
et al[7] and key frames are
extracted.ColorRGB,Texture(LB
P) & shape (edge histogram)
features used. Clustering of
frames is done.

8. Madhav Gitte et Video segmentation is done Precision=20-80% Indexing improves efficiency.

al[8] .Indexing is done using
hierarchical clustering tree Recall=7-75%
algorithm and clustering(K-
means algorithm used)

317
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

9. Shimna Various combination of average Precision=42% i)More accuracy as all three features color,
Balakrishnan et RGB, color moment, edge shape and texture used.
al[13] direction histogram, geometric
mean, Co-occurrence & auto- ii)Time complexity reduced.
correlation used.

DNP*- DATA NOT PROVIDED

5. CONCLUSION
Content-based retrieval of visual information is an emerging
[10] Manimala Singha and K.Hemachandran , Content Based
area of research. This paper provided a brief overview of
Image Retrieval using Color and Texture, Signal & Image
major content based video retrieval techniques. The
Processing : An International Journal (SIPIJ) Vol.3, No.1,
techniques explained are widely used for video retrieval in
February 2012.
many fields. The combination of various feature extraction
techniques can be used for efficient video retrieval .The data
[11] Madhav Gitte, Harshal Bawaskar, Sourabh Sethi and
mining techniques like classification and clustering can be
Ajinkya Shinde, Content Based Video Retrieval System,
used for better results.
International Journal of Research in Engineering and
Technology, Volume: 03 Issue: 06 | Jun-2014.
REFERENCES
[12] B V Patel and B B Meshram , Content Based Video
[1] B. V. Patel, A. V. Deorankar and B. B. Meshram, Content Retrieval Systems, International Journal of UbiComp (IJU),
Based Video Retrieval using Entropy, Edge Detection, Vol.3, No.2, April 2012.
Black and White Color Features, IEEE, 2nd International
Conference on Computer Engineering and Technology [13] Shimana Balakrishnan and Kalpana S.Thakre, Video
2010,volume 6. match analysis’ Comprehensive Content based Video
Retrieval System, International Journal of Computer Science
[2] Asha S and Sreeraj M, Content Based Video Retrieval
and Application Issue 2010
using SURF Descriptor, 2013 Third International
Conference on Advances in Computing and
Communications.
[3] Chaoqun Hong, Na Li, Mingli Song, Jiagun Bu and chun
chen , An efficient approach to content-based object
retrieval in videos, 2011 Elsevier.
[4] Ja-Hwung Su, Yu-Ting Huang, Hsin-Ho Yeh and Vincent
S. Tseng, Effective content-based video retrieval using
pattern-indexing and matching techniques, Expert
Systems with Applications 2009 Elsevier.
[5] A.Vadivel, A K Majum dar and Shamik Sural,
Performance comparison of distance metrics in content-based
Image retrieval applications.

[6] T.N. Shanmugam and Priya Rajendran, An Enhanced

Content Based Video Retrieval system based on query clip,
International Journal of Research and Reviews in Applied
Sciences, Volume 1, Issue 3 December 2009.

[7] Shradha Gupta, Neetesh Gupta and Shiv Kumar,

Evaluation of Object Based Video Retrieval Using SIFT,
International Journal of Soft Computing and Engineering
(IJSCE), Volume-1, Issue-2, May 2011.

[8] Fazal Malik and Baharum Baharudin, Analysis of distance

metrics in content-based image retrieval using statistical
quantized histogram texture features in the DCT domain,
Journal of King Saud University – Computer and Information
Sciences (2013) 25, 207–218.

[9] Poonam O. Raut and Nita S. Patil, Performance Analysis

of Content Based VideoRetrieval System Using Clustering,
International Journal of Science and Research (IJSR), Volume
3 Issue 8, August 2014.

318
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Web Services: An E-Government Perspective

Monika Pathak Gagandeep Kaur Sukhdev Singh
Research Scholar Research Scholar Research Scholar
monika_mca@yahoo.co.in mailtogagandeep@gmail.com tomrdev@gmail.com

ABSTRACT
The e-Government is increasing its popularity through
number of web services. The web services in e-Government
are aimed to provide services to citizens, businesses and
government agencies. The e-Government web services
provide relevant government information in digital form to
the citizens in a timely manner and cost saving manner. The
numbers of web services are available on web maintained by
different departments of government. The aim of the current
paper is to provide exploratory research which explores latest
advancement in e-Governance through web services. The
different types of web services are available such as
Agmarknet, Bhuiyan, Examination Results Portal, JUDIS,
Passport Website, Value Added Tax (VAT), etc. The study is
also analyzed the problems and challenges are being faced by
the service providers.
Keywords: E-Governance, Web Services, Web Portal,
Agmarknet, Bhuiyan, Judis.
The web based service is one of the initiatives that have been
taken under the umbrella of e-Governance [2]. The study is
aimed to explore different web services for citizen,
businessman and analyzed difficulties being faced by the
services providers. The objective of web service is to reach to
all section of people in respect of distance and language. The
web services are usually provided in the form of web portal,
where information of different government services is
provided. For instance, passport portal as web service is being
used as tool to file application for passport [3, 4]. The
different web services are considered for study some of them
are discussed in this paper in detail. Its purpose is to provide
government services in more transparent manner so that
everybody who so ever is eligible to avail the service should
have equal chance to available it. It is has been seen through
literature survey[8-10] that the challenging tasks for any
government service provider is to involves lot of efforts in
terms of man power and money. The study is aimed to
explore different issues related to success and failure of web
services.

1. INTRODUCTION 2. WEB SERVICES THROUGH E-

The information communication & technology is widely used
in providing the government services which results in new
GOVERNANCE
The web services are not only source of information that is
technological service platform known as e-Governance
gathered and stored at one place but it need to organized such
through web services. Moreover with the increase in internet
as manner that it can access with ease. The web portal [4] is
users and mobile connections, the people are now well aware
not systematic arrangement/classification of information but
through web services about information related to government
is dynamic in nature and provides user interaction. If the
services. In the early stage of e-governance in India [1], it was
information of the government is gathered at one place
focused to develop application for economic monitoring,
without any arrangement or management, it would prove
planning, managing data of census, taxes. Nowadays, e-
difficult for the users to find the required information. The
governance services are almost everywhere, all the
managing information is an important aspect of e-Governance
government functioning is highly influenced by the e-
which requires technical skills. The web service is platform
Governance. Where, the term e-Governance is used to
where user can access important information and can
describe government services provided through means of ICT
available other useful services. On the base of literature
(Information Communication & technology).
review [5-10], we have listed some of the popular web
services which are available in the form of web portals.

Web services Functions

Agmarknet (For Agricultural Information Its function is to share information related to production of agriculture and
Portal) wholesale markets in the country. The portal has been developed to
http://www.agmarknet.nic.in strengthen the interfaces among government and non-government
organizations. It acts as a platform for the communication among farmers,
traders, exporters, policy makers and academic institutions etc.
Bhuiyan (For Land Records) This web based application is for the online retrieval of land information.
http://cglrc.nic.in These details of land are generally required for loan purposes and
sale/purchase of property. The application facilitates the easy retrieval of
these details. Other than this, under admin access one can view the abstract of
Khasara, Khatauni, Area wise details, Farmer wise details, Revenue
collection details of a particular land.
Results Portal The online results of various academic entrance and recruitment examinations

319
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
http://results.nic.in
Judis
http://www.judis.nic.in
Passport Website
http://passport.nic.in
RuralBazar
http://ruralbazar.nic.in
Value Added Tax http://megvat.nic.in
3. CHALLENGES FACED TO
IMPLEMENT THE WEB SERVICES
IN E-GOVERNANCE
It has been observed that the lots of efforts are being used
in the development of various web based services and in
Challenges
Lack of ITC literacy
Awareness regarding
benefits of web services
Lack of existing ICT
infrastructure
Attitude of government
servants towards adopting
new technology
Lack of coordination
between Govt. department
and solution developers
Resistance to digitalize the
information and its online
availability
Lack of infrastructure for
sustaining
e-Governance
Table2: Challenges faced to implement the web services in e-Governance
ISBN: 978-81-924893-0-8
conducted by the various government agencies are available on portal
―results.nic.in‖. This portal also includes results of CBSE, State Education
Boards, Various Universities, Professional Institutes (Engineering, Medical,
MBA, CA, etc.).
Judis is comprehensive online library of caselaw that contains all reportable
judgments of the Supreme Court of India and various High Courts of India.
This site provides the information about passport visa and other related
information.
This site is aimed to provide the business opportunity for poor people.
Products manufactured by rural and poor people are sponsored and sell with
this site.
The application is being used by the Taxation Department to monitor the
revenue generated by the state government in the form of collecting taxes and
monitoring of the sales returns from the commercial establishments in the
state. The major functions are registration, challenges, way bill, transit
documents, etc.
Table1: Web services in e-Governance
the field of e-governance. The technical infrastructure is
developed to provide availability of web services. In spite
of various efforts, the current system is facing various
challenges like lack of IT literacy, lack of information
technology infrastructure; some of them are listed below:
Description
It has been observed that in spite of availability of web services most of people are not able
to access information due to lack of IT literacy. The web services require working
knowledge to access internet services which require training about computer and internet.
There is general lack of awareness regarding benefits of e-Governance through web services.
There must be awareness programmes regarding the facilities being provided through web.
The lack of ICT infrastructure is one of the major problems. The country like India which is
facing problem of poverty at great extends and availability of ICT infrastructure for large
population is a great challenge. On the counter part, sometime with high performance
system, the under utilization of the computers in terms of their usage is another issue that
needs to be addressed.
The psychology of government servants is quite traditional and they are still stick to
traditional working style. The attitude of government department is pathetic and non-serious,
most of official web site are not updated daily basis and consistent.
There is lack of communication between government organization and solution providers
which results in inadequate application like web services. The government authority has
little knowledge about the technical issues and solution providers fail to understand the
requirements of the customers.
Successful implementation of web services depends on availability of digital information.
Moreover the digital information and more the rate of success of web service. But
unfortunately, most of the government institutions are not willing to provide information in
digital format. The authenticity of information is another problem being faced. Therefore the
content as is collected or maintained by various e-Governance portals is unreliable or full of
gaps. In such a scenario, it’s difficult for any e-Governance solution to achieve its intended
results.
The web services under e-Governance are required lot of infrastructure in the form of
network, ICT devices, software and manpower.
320
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
4. CONCLUSION
It is evident from above analysis that web service is one of the
devices of e-governance which is available to the large population
by internet. The objective of the web service is to overcome
geographical barriers and provide equal opportunity to all to avail
the government services. It is an instrument to transforming india.
The complete transformations require people of Indian to come out
of tradition psychological mindset and move forwards to provide
appropriate information. It requires fundamental change in work
culture and goal orientation. Foremost of them is to create a culture
of maintaining, processing and providing updated information to
web portal which will be provided to the people in timely manner.
REFERENCES
1. Gilbert, D., Balestrini, P., &Littleboy, D. (2004). Barriers and
benefits in the adoption of e-government. The International
Journal of Public Sector Management, 17(4/5), 286-301.
2. Wong, K. F., Tam, M. K. W., & Cheng, C. H.(2006). E-
government—A Web Services framework. Journal of
Information Privacy & Security, 2(2), 30-50
3. Jack A. Nickerson , Barton H. Hamilton , Tetsuo Wada
Market Position, Resource Profile, and Governance.(2001).―
Linking Porter and Williamson in the Context of International
321
ISBN: 978-81-924893-0-8
Courier and Small Package Services in Japan , Strategic
Management‖, 251-273.
4. Singh G. Pathak R. D. Naz R. (2010) ―Service Delivery
through E-Governance: Perception and Expectations of
Customers in Fiji and PNG‖, Public Organization Review,
1566-7170, pp 1-14, Springer Science Business Media, LLC.
5. Nikita Yadav, V.B. Singh(2012), ―E-Governace: Past,Present
and Future in India‖, International Journal of Computer
Applications.
6. Mrinalini Shah(2007), ―E-Governance in India: Dream or
reality?‖, International Journal of Education and Development
using Information and Communication Technology, Vol.3,
Issue 2, pp.125-137.
7. Sanjay Kumar Dwivedi and Ajay Kumar Bharti.(2010), ―E-
Governance in India–Problems and Acceptability‖,Jourmal of
Theoretical and Applied InformationTechnology, pp.2005-
2010.
8. N.S. Kalsi, Ravi Kiran and S.C Vaidya.(2009), ―Effective e -
Governance for Good Governance in India‖, International
Review of Business Research Papers,Vol No. 5, pp.212-229,
9. Jamal A Farooquie,(2011).International Journal of Humanities
and Social Science, ―A Review of E-Government Readiness in
India and the UAE‖
10. Anu Paul,Varghese Paul.(2014),―A Framework for e-
Government Interoperability in Indian Perspective‖,
International, Journal of Computer Information Systems and
Industrial Management Applications,pp.582-591.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A review on ACO based and BCO based routing
protocols in MANETS
Jatinder Pal Singh
A.P. CSE Department
SLIET Longowal, PUNJAB
sachdeva.jp@gmail.com
ABSTRACT
Networks have changed our life style drastically in last 10 years. We
always want to stay connected to an external network like Internet or
Intranet with the help of wireless communication. A lot of research
has been in done this field to explore the best and the optimum
protocols which can be used in WSN, WMN and Ad-hoc networks.
Identification of optimal route for data communication, efficient
utilization of energy, providing congestion free communication,
offering scalability, maintaining the Quality of Service are few
research issues in the Ad-hoc Networks. To overcome these issues
swarm Intelligence (SI) inspired routing algorithms have become a
research focus in recent years due to theirs self-organizing nature,
which is very suitable to the routing problems in Mobile Ad hoc
Networks (MANETS). In this paper, we focus on routing algorithms
based on Ant Colony Optimization(ACO) and Bee Colony
Optimization(BCO) for MANETS that have been designed according
to the principles of swarm intelligence..
General Terms
Mobile adhoc networks, Swarm Intelligence, Ant Colony
Optimization, Bee Colony optimization, Routing protocol.
Keywords
MANETS, Ad-hoc, ACO, BCO, SI .
1. INTRODUCTION
MANET[1] is one of those types of wireless networks which do not
require any infrastructure to set up itself; we can set up this type of
network anywhere with the help wireless facility of its nodes as
shown in the figure below:
Figure 1: A MANET Scenario
This type of network which can be set up without any centralized
control or infrastructure is also known as Infrastructure less network.
Such a network can operate in standalone fashion or either connected
to the Internet: after one of the nodes is configured as a gateway as
shown in the figure below:
322
ISBN: 978-81-924893-0-8
Figure 2: MANET connected to Internet
The nature of this kind of networks makes them suitable for
deployment in places where network infrastructure is hard to build
and maintain. Applications of ad hoc networks are emergency search-
and rescue operations, war like situations, VANETS or meetings in
which persons wish to quickly share information
Challenges in MANETS Routing Protocols:
 MANETS are usually made up of small or tiny nodes equipped
with little memory, limited non-rechargeable battery, low-end
processors, and small bandwidth links. As a result, MANET
protocol designers face strict constraints on the use and the
availability of node resources.
 The majority of target applications for MANETS require the
deployment of the sensor nodes in large numbers, ranging from
thousands to millions. Hence, the scalability of the used protocols
is also a major concern.
 Individual nodes can potentially generate huge amounts of data.
The transmission of every data bit to a common sink node would
make use of a large amount of energy, bandwidth, and processing
power. Therefore, possibly redundant information needs to be
detected and filtered, in order to reduce the in-network traffic.
MANETs are dynamic, flexible and require few resources but at the
same time they suffer from a variety of problems like: lack of
centralized management, resource availability, Dynamic topologies,
device discovery, security, reliability, quality of service and
internetworking. Many different approaches dealing with these
problems do exist, one of them is Swarm intelligence. The rest of the
paper is organized as follows. In Section 2, we briefly discuss the
Swarm Intelligence(SI) and SI based Ant Colony Optimization and
Bee Colony Optimization techniques. The third and fourth sections
are the main part of this paper gives description about the most
commonly used ACO and BCO based routing protocols. In the fifth
section we compare ACO and BCO based routing protocols.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2. SWARM INTELLIGENCE
Swarm intelligence(SI)[4,5,6] is a new discipline of study that
contains a better optimal approach for problem solving which are
inspired from the social behavior of insects and animals. Examples in
natural systems of SI include ant colonies, bird flocking, animal
herding, bacterial growth, fish schooling and Microbial intelligence.
Different swarm intelligence fields are shown in figure3 below. This
paper are lend itself to give brief information about swarm
intelligence based ACO and BCO routing protocols. The nature of
swarms largely resembles mobile ad-hoc networks (MANETs) and
that is why ideas from swarm animals like ants and bees are used for
creating suitable routing protocols for MANETs. Bio inspired,
SI[4,5,6] approaches are more promising for MANETS due to the
following reasons.
 Self-organizing behavior & Multiple path availability
 Failure backup & Dynamic topology
Figure 3: Subdivision of Swarm Intelligence
The following sub-sections will describe about ant colonies and bee
colonies optimization techniques which can be used in conjunction
with MANETS.
2.1 ANT COLONY OPTIMIZATION
Ant Colony Optimization[2,3] is paradigm of Swarm Intelligence that
is inspired by the collective behaviour of ants. The basic idea of ANT
colony optimization is taken from the food searching behavior of real
ants. When ant searches for food, they start from nest and walk
towards the food. When ant reaches an intersection, ant has to decide
which branch to take next while walking. Ants deposit a substance
called pheromone. This marks the route taken. The concentration of
pheromone decreases due to diffusion effects. The behavior of ants is
used to find the shortest route in the networks. ACO meta-heuristic
computational approach was proposed by Marco Dorigo in 1996. The
basic principle of ACO is simulation of ability of ants to find the
shortest path between their nest and a food source. Ants are capable
to find the shortest path between their nest and food source, without
any visible, central and active coordination mechanism.
Figure 4: Steps in ACO
323
ISBN: 978-81-924893-0-8
The real ants drop a pheromone, chemical from their bodies naturally,
on the path which leads them for the various decisions. Rest of the
ants reaches the food source by following this pheromone trail.
General steps in ACO are shown in Figure 4. More the concentration
of pheromone value on the path means path probability is greater
than others. Here some important features of ad hoc networks which
flavors the designing of swarm intelligence based protocols:
 Dynamic Topology: The dynamically change topology, causes
bad performance of mostly routing algorithm in mobile multi-hop
ad hoc networks. The working principle of ACO is based on
agent systems and works individually and flavours high
adaptation to the current topology of the network.
 Local Work: The ACO based algorithms are based only on local
information, so it no needs the transmission of routing tables or
other information to neighbour nodes in networks.
 Support for Multi-path: The selection decision is based on the
pheromone value on the current node. It provides the multi-path
selection choices.
2.2 BEE COLONY OPTIMIZATION
Similar to ACO, the Bee Colony Optimisation (BCO) [2,3] is a
nature-inspired meta-heuristic, which can be applied in order to find
solutions for optimization problems that mimics the food foraging
behaviour of swarms as in honey bees. BCO is the name given to the
collective food foraging behavior of honey bee. The bee system is a
standard example of organized team work, and simultaneous task
performance with well-knit communication. In a bee colony there are
different types of bees like a queen bee, many male drone bees and
thousands of worker bees.
 Queen Bee: The main work of queen bee is to laying egg which is
used to develop a new colony because there is only one queen bee
in the hive.
 Male Drone Bees: In the hive there are two types of male drone
bees first is Food Packers Bees the work of food packer bees is to
servethe queen help it in laying the eggs. The second is Nurses
Group Bees which is responsible for feeding the queen and the
babies.
 Worker Bees: There are two types of worker bees, namely scouts
and foragers. The scouts start from the hive in search of a food
source randomly keeping on this exploration process until they
are tired. The movement of scout bees in a typical bee hive is
shown in figure 5. When they return back to the hive, they convey
to the foragers information about the odor of the food, its
direction, and the distance with respect to the hive by performing
dances. A round dance indicate that the food source is nearby
whereas a waggle dance indicate that the food source is far away.
Waggling is a form of dance made in eight-shaped circular
direction and has two components: the first component is a
straight run and its direction conveys information about the
direction of the food; the second component is the speed at which
the dance is repeated and indicates how far away the food is. Bees
repeat the waggle dance again and again giving information about
the food source quality. The better is the quality of food, the
greater is the number of foragers recruited for harvesting. The
Bee Colony Optimization (BCO) meta-heuristic has been derived
from this behavior and satisfactorily tested on many
combinatorial problems. Following is the flowchart which gives
the basic structure of the working of the bee colony system.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 5. Flowchart for Basic BCO Steps.
3. ACO Based Routing Protocols for MANETS
In this section we explained three Ant Colony Optimization based
routing protocols[7,8] namely: ARA, Antnet and AntHocnet. These
three protocols are covered in the next subsections:
3.1 ARA
Gunes et al proposed Ant Colony Based Routing Algorithm[10]
(ARA) which reduces overhead, because routing tables are not
interchanged among nodes. ARA consists of three phases namely:
Route Discovery, Route maintenance and Route failure handling.
ARA is a purely reactive MANET routing algorithm. It does not use
any HELLO packets to explicitly find its neighbours. When a packet
arrives at a node, the node checks it to see if routing information is
available for destination d in its routing table. In ARA, the route
discovery is done either by the FANT (forward ant) flood technique
[13] or FANT forward technique. In the FANT flooding scheme,
when a FANT arrives to any intermediate node, the FANT is flooded
to all its neighbours. If found, it forwards the packet over that node, if
not, it broadcasts a forward ant (FANT) to find a path to the
destination. By introducing a maximum hop count on the FANT,
flooding can be reduced. In the FANT forwarding scheme, when a
FANT reaches an intermediate node, the node checks its routing table
to see whether it has a route to the destination over any of its
neighbours. If such a neighbour is found, the FANT is forwarded to
only that neighbour; else, it is flooded to all its neighbours as in the
flood scheme.
324
ISBN: 978-81-924893-0-8
Figure 6. Route discovery phase in ARA showing a
forward ant (F) and backward ant (B)
In ARA[10], a route is indicated by a positive pheromone value in the
node’s pheromone table over any of its neighbours to the FANT
destination. When the ant reaches the destination it is sent back along
the path it came, as a backward ant. All the ants that reach the
destination are sent back along their path. Nodes modify their routing
table information when a backward ant is seen according to number
of hops the ant has taken. In Route Maintenance phase, DUPLICATE
ERROR flag is set for duplicate packets to prevent from looping
problems. ARA[10] also allows for the evaporation of pheromone by
decrementing factor in route table. In Route Failure Handling phase,
node deactivates the path by reducing pheromone value to 0 in
corresponding route table entry and go to the Route Discovery phase
for selecting path and sending packets to the destination over that
path [26].
3.2 AntNet
Antnet[11] is proposed by G. Di Caro and M. Dorigo. It is an agent
based routing algorithm that is influenced from the real ants
behaviour. In antnet ants (nothing but software agents) explores the
network to find the optimal paths from the randomly selected source
destination pairs. Moreover, while exploring the network ants updates
the probabilistic routing tables and builds a statistical model of the
nodes local traffic. Ants use these tables to communicate with each
other. The idea in AntNet is to use two different network exploration
agents, i.e. forward ants (FANTs) and backward ants (BANTs),
which collect information about delay, congestion status and the
followed path in the network. FANTs are emitted at regular time
intervals from each node to a randomly selected destination. This
transmission occurs asynchronously and concurrently with the data
traffic. As soon as a FANT arrives at the destination, a BANT moves
back to the source node reverse the path taken by the FANT. The
subdivision in forward and BANTs has the following reasons. The
FANTs are just employed for data aggregation of trip times and node
numbers of the path taken without performing any routing table
updates at the nodes. The BANTs get their information from the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

FANTs and use it to achieve routing updates at the nodes. By using
two different types of ant agents FANT and BANT; each node in the
network has shortest path to all the destinations. However, they cause
extra overhead but it reduces the available traffic capacity for actual
data communication. AntNet is designed in such way that the forward
ants carry the information about the status of the links it traverses.
This status information can be captured and can be used to find the
best path. AntNet[11] is one of the dynamic routing algorithms for
learning new routes.
Figure 7. Trip times table in Antnet algorithm
An example of AntNet[11] trip time table is given in the figure 7.
Routing table at each node stores the list of reachable nodes and their
pheromone value. It is represented as structure consisting of
following fields:
 destination_id – This represents the address of the destination
node
 next_id – This represents the address of the adjacent node used to
reach destination node.
 pheromone – This represents the value used by the node to
calculate the probability of each adjacent node to be the next hop
in order to reach the destination.
 An example of such a routing table is given in the table below:
routing information related to the ongoing flow up-to-date with
network changes for both topology and traffic.
When a data session is started between source and
destination, firstly source node S checks whether it has up-to-date
routing information for destination D. If no such information is
available, it reactively sends out ant-like agents, called reactive
FANT, to look for paths to D. These ants gather information about
the quality of the path they followed, and at their arrival in D they
become BANT which trace back the path and update routing tables.
The routing table Ti in node i contains for each destination D and
each possible next hop n a pheromone value. In this way, pheromone
tables in different nodes indicate multiple paths between S and D, and
data packets can be routed from node to node as datagrams. Once
paths are set up and the data session is running, S starts to send
proactive FANT ants to D. These ants follow the pheromone values
similarly to data packets. In this way they can monitor the quality of
the paths in use. Moreover, they have a small probability of being
broadcasted, so that they can also explore new paths. In case of link
failures, nodes either try to locally repair paths, or send a warning to
their neighbors such that these can update their routing tables.
4. BCO Based Routing Protocols for MANETS
In this section we explained three routing protocols based on Bee
Colony Optimization[7,8,9] namely: BeeAdhoc, BeeSensor and
BeeIp. These three protocols are covered in the next subsection:
4.1 BeeAdHoc
BeeAdHoc[13] is a nature inspired routing protocol for MANETs
based on the foraging principles of honey bees. It is a reactive source
routing algorithm based on the use of four different bee-inspired
types of agents: packers, scouts, foragers, and bee swarms. Scouts
are used to discover routes and foragers to transport data. Figure 8
will give an overview of the BeeAdHoc architecture. In this
architecture each node maintains a hive with an Entrance, Packing
Floor and a Dance Floor.

Table 1. Routing table based on Pheromone Values

Routing Table at node 1
Destination Next Node Pheromone Value
0 2 0.5
1 1 1

3.3 AntHocNet(Ant Agents for Hybrid Multipath

Routing)
AntHocNet[12] is a hybrid algorithm proposed by Di Caro, Ducatelle
and Gambardella in 2004 consisting of reactive and proactive
components. It does not maintain routes to all possible destinations at
all times (like AntNet), but only sets up paths when they are needed Figur 8. Overview of the BeeAdHoc architecture
at the start of a data session. It is reactive in the sense that a node
 Packers: Packers mimic the task of a food-storekeeper bee,
only starts gathering routing information for a specific destination
reside inside a network node, receive and store data packets from
when a local traffic session needs to communicate with the
the upper transport layer. Their main task is to find a forager for
destination and no routing information is available. It is proactive
the data packet at hand. Once the forager is found and the packet
because as soon as the communication starts, and for the entire
is handed over, the packer will be killed.
duration of the communication, the nodes proactively keep the

325
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 Scouts: Scouts discover new routes from their launching node to
their destination node. A scout is broadcasted to all neighbors in
range using an expanding time to live (TTL). At the start of the
route search, a scout is generated; if after a certain amount of time
the scout is not back with a route, a new scout is generated with a
higher TTL in order to incrementally enlarge the search radius
and increase the probability of reaching the searched destination.
When a scout reaches the destination, it starts a backward journey
on the same route that it has followed while moving forward
toward the destination. Once the scout is back to its source node,
it recruits foragers for its route by dancing. A dance is abstracted
into the number of clones that could be made of the same scout.
 Foragers: Foragers are bound to the bee hive of a node. They
receive data packets from packers and deliver them to their
destination in a source-routed modality. To attract data packets
foragers use the same metaphor of a waggle dance as scouts do.
Foragers are of two types: delay and lifetime. From the nodes
they visit, delay foragers gather end-to-end delay information,
while lifetime foragers gather information about the remaining
battery power. Delay foragers try to route packets along a
minimum-delay path, while lifetime foragers try to route packets
in such a way that the lifetime of the network is maximized. A
forager is transmitted from node to node using a unicast, point-to-
point modality. Once a forager reaches the searched destination
and delivers the data packets, it waits there until it can be
piggybacked on a packet bounded for its original source node. In
particular, since TCP (Transport Control Protocol) acknowledges
received packets, BeeAdHoc piggybacks the returning foragers in
the TCP acknowledgments. This reduces the overhead generated
by control packets, saving at the same time energy.
 Bee swarms: Bee swarms are the agents that are used to
explicitly transport foragers back to their source node when the
applications are using an unreliable transport protocol like UDP
(User Datagram Protocol). The algorithm reacts to link failures by
using special hello packets and informing other nodes through
Route Error Messages (REM).
In BeeAdHoc, each MANET node contains at the
network layer a software module called hive, which consists of three
parts: the packing floor, the entrance floor, and the dance floor. The
entrance floor is an interface to the lower MAC layer; the packing
floor is an interface to the upper transport layer; the dance floor
contains the foragers and the routing information.
4.2 BeeSensor
Beesensor[14] (Saleem and Farooq, 2007) is an algorithm based on
the foraging principles of honey bees with an on-demand route
discovery (AODV). BeeSensor focuses on minimising the energy
costs using bee agents. The algorithm works with four types of
agents: packers, scouts, foragers and swarms.A brief description of
each type of agent is as follows.
 Packers: Packers behave like the food-storer bees in a hive. Their
major responsibility is to receive packets coming from the upper
layer and locate an appropriate forager (route) for them. Once a
forager is found, packet is encapsulated in its payload and the
packer starts waiting for the next packet. Failure in locating a
forager is an indication to the packer that no route exists to a sink.
 Scouts: Like their natural counterparts, scouts explore the
network in search of a potential sink node. Scouts are of two
326
ISBN: 978-81-924893-0-8
sorts: forward scouts and backward scouts. A scout is uniquely
identified by its agent ID and the source node ID. Forward scouts
propagate in the network using the broadcasting principle. During
the exploration of the network, they do not construct a source
routing header. The result – that their size becomes independent
of the path length – helps BeeSensor to scale to large networks.
Once a forward scout reaches a sink node, it delivers the event to
the upper layer and starts its return journey as a backward scout.
Its task is to build a path leading from the sink to the source node
(or vice versa) and report the quality of the discovered path once
it reaches at the source node.
 Foragers: As in BeeAdHoc[13], foragers are the main workers in
BeeSensor. Their major role is to carry events to the sink nodes
through a predetermined path that is selected stochastically at the
source node. Foragers that follow the same path are grouped
together in BeeSensor. Foragers traverse using point-to-point
mode by utilizing the forwarding information stored at
intermediate nodes. They index the table using their path
identifier (PID). Foragers also evaluate the quality of their path
and report it back to fellow foragers at the source node.
 Swarms: To save energy, foragers are implicitly piggy-backed in
the link layer acknowledgment packets to the source node.
However, sometimes they need to be explicitly transported back
to their source nodes. A swarm agent exactly serves this purpose.
Foragers wait for a certain amount of time at the sink node and
then take the initiative to build a swarm of waiting foragers. A
swarm can transport multiple foragers in its payload back to the
source node. A swarm, like an individual forager, is also routed
on the reverse links.
In BeeSensor[14], route discovery is achieved by using forward
scouts and backward scouts. Results show that the honeybee- inspired
protocol is able to transmit more packets than an energy optimised
version of AODV, achieving less control overhead and lower energy
consumption.
4.3 BeeIP
BeeIP[15] is a new honeybee-inspired adaptive routing protocol
based on the collaborative behaviours of honeybee foragers.
Following a reactive approach, BeeIP’s honeybee agents explore the
topology only when data are required to be transmitted between
nodes. The model uses three types of agents in the form of data
packets. The scout, the ack scout, and the forager.
 Scout: They are sent when a scouting process is initialized in
order to discover new paths towards a given destination. A scout
is transmitted using broadcast to all neighbouring nodes. This
technique benefits not only the propagation of the initial request,
but also the introduction of the transmitting node to its
neighbourhood. Apart from the details of the scouting process,
scouts also carry important information about their sender’s state.
A node’s state is a group of attributes that describe the situation in
which the node is at the time of broadcasting the scout packet.
 Ack scout: Once the scout reaches its destination the scouting is
considered successful and an ack scout packet is created. Ack
scouts use a source routing fashion to travel back to the source,
using unicast transmission. Therefore, the route that was followed
towards the destination is used in reverse. On their way back, ack
scouts acknowledge the success of the scouting to both the
intermediate nodes and the source node.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

 Forager: When BeeIP[15] is unable to transmit a data packet, it low delay. These algorithms have lot of scope for future
stores it into a local queue and starts a new scouting process for improvements. The future work lies in incorporating factors like
its destination. This decreases the packet loss due to incomplete signal strength into these algorithms so that the routing algorithms
routing information. Once an ack scout returns back and will adjust in dynamic topology changing environment.
acknowledges the existence of a path, all packets for the
corresponding destination in the queue are being transmitted. REFERENCES
The way they do this, is by using the most important agent type of [1] A. Boukerche, M. Ahmad, B. Turgut, D. Turgut, A taxonomy of
BeeIP[15], the forager. Foragers are specially crafted packets that routing protocols in sensor networks, in: A. Boukerche (Ed.),
have three important roles. Firstly, they carry (in form of payload) the Algorithms and Protocols for Wireless Sensor Networks, Wiley,
data packets from the source to the destination. Secondly, they are 2008, pp. 129–160 (Chapter 6).
used to update neighbouring nodes’ states and links’ information, just [2] M. Dorigo, T. Stutzle, Ant Colony Optimization, MIT Press,
like scouts did in the first place. Thirdly, foragers are constantly Cambridge, 2004.
monitoring the path they traverse for any improvements. [3] D. Teodorovic, T. Davidovic, M. Selmic, Bee colony
optimization: The applications survey, ACM Transactions on
5. Summary of ACO and BCO based Routing Computational Logic, 2011, pp. 1–20.
Protocols [4] Bonabeau, E.; Dorigo, M. & Theraulaz, G. (1999). “Swarm
Intelligence.From Natural to Artificial Systems”, Oxford
Routing Year Authors SI Routing Strength
University Press, 0-19-513159-2, Oxford
Protocol Tech Type
nique [5] Bonabeau, E.; Dorigo, M. & Theraulaz, G. (2000). “Inspiration
Gianni Di for optimization from social insect behaviour, Nature”, Vol. 406,
Antnet 1998 Caro, Marco ACO Proactive Scalable No. 6, (July 2000) 39-42, 0028-0836
Dorigo [6] Dr. Arvinder Kaur, Shivangi Goyal,” A Survey on the
Mesut Gunes, Applications of Bee Colony Optimization Techniques”,
Udo Sorges, Less International Journal on Computer Science and Engineering
ARA 2002 ACO Reactive (IJCSE), ISSN : 0975-3397, Vol. 3 No. 8 August 2011
Imed overhead
Bouazizi [7] Xun-bing Wang, Yong-zhao Zhan, Liang-min Wang and Li-
Di Caro ping Jiang, “Ant Colony Optimization and Ad-hoc On-demand
G.A., PDR, Multipath Distance Vector Based Routing Protocol,” IEEE
AntHocNet 2004 ACO Hybrid
Ducatelle F., delay Fourth International Conference on Natural Computation, pp.
Gambardella 589-593, 2008.
Horst. F. [8] G.A. Di Caro, F. Ducatelle, and L.M. Gambardella. Swarm
Wedde, Energy intelligence for routing in mobile ad hoc networks. In
BeeAdhoc 2005 BCO Reactive
Muddassar efficient Proceedings of the IEEE Swarm Intelligence Symposium, pages
Farooq 76–83, Pasadena, USA, June 2005. IEEE Press.
Muhammad
[9] M. Dorigo, G.A. Di Caro, and L. M. Gambardella. Ant
Saleem, Energy
BeeSensor 2007 BCO Reactive algorithms for discrete optimization. Artificial Life, 5(2):137–
Muddassar efficient
Farooq 172, 1999.
Alexandros [10] G.A. Di Caro and M. Dorigo. AntNet: Distributed stigmergetic
Giagkos, PDR, control for communications networks. Journal of Artificial
BeeIP 2010 BCO Reactive Intelligence Research (JAIR), 9:317–365, 1998.
Myra S. delay
Wilson [11] M. Gunes, U. Sorges, and I. Bouazizi, “Ara-the ant-colony
based routing algorithm for manets,” in Parallel Processing
Workshops, 2002. Proceedings. International Conference on,
6. CONCLUSION AND FUTURE SCOPE 2002, pp. 79 – 85.
The objective of this study is to briefly review the major contribution [12] G.A. Di Caro, F. Ducatelle, and L.M. Gambardella. AntHocNet:
of swarm intelligence based MANET routing protocols. For this an ant-based hybrid routing algorithm for mobile ad hoc
purpose, swarm intelligence based ACO and BCO protocols are networks. In Proceedings of PPSNVIII, volume 3242 of LNCS,
reviewed and put to partial comparison. The agents in Ant Colony pages 461–470. Springer, 2004. (Best paper award).
inspired routing algorithms communicate indirectly through the [13] H. F. Wedde, M. Farooq, T. Pannenbaecker, B. Vogel, C.
environment (stigmergy) and the agents provide positive feedback to Mueller, J. Meth, and R. Jeruschkat. BeeAdHoc: an energy
a solution by laying pheromone on the links. Moreover, they have efficient routing algorithm for mobile ad-hoc networks inspired
negative feedback through evaporation and aging mechanisms, which by bee behavior. In Proceedings of GECCO, pages 153–161,
avoids stagnation. Finally, Bee Colony algorithms allow for direct 2005.
agent-to-agent communication which makes them more responsive to [14] M. Saleem, M. Farooq, BeeSensor: A Bee-Inspired Power
changes in the network. It is shown that by using ideas taken from the Aware Routing Protocol for Wireless Sensor Networks,
simple behavior of ants and bees optimization and innovations in Springer-Verlag, 2007.
routing protocols can be done, that help outperform the standard [15] A. Giagkos, M. Wilson, BeeIP – A Swarm Intelligence based
MANET routing protocols because SI based protocols ensure higher routing for wireless ad hocnetworks, Information Sciences, 2014
packet delivery ratio, lesser overhead, lower energy consumption and – Elsevier.

327
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Comprehensive Study on the Basics of Artificial

Neural Network

Neha Singla Mandeep Kaur Sandeep Kaur Amandeep Kaur

BGIET, Sangrur BGIET, Sangrur BGIET, Sangrur BGIET, Sangrur
neha_singla93@yahoo.in kaurmandeep796@yahoo. gill28sandeep@gmail.com amehak07@gmail.com
com

ABSTRACT
Artificial Neural Network (ANN) is an information processing
system that is inspired by the way biological nervous systems,
such as the brain, process information. Like brain, it consists
of various interconnected neurons which are also known as
processing elements, that exchanges information to solve
specific problem. An ANN is configured for a specific
application, such as pattern recognition or data classification,
through a learning process. This paper gives an overview of
Artificial Neural Network, its working, trainings &
architecture. It also explains the applications and advantages
of ANN.

Keywords: Artificial Neural Network, Feedback Network,

Feed-Forward Network.
1. INTRODUCTION
Artificial Intelligence (AI) is a combination of computer
science, physiology, and philosophy. AI is the area of
computer science focusing on creating machines that can
engage on behaviours that human consider intelligent. [5]
Lotfi Zadeh, father of fuzzy logic, has classified computing as
hard computing and soft computing. The computations based
on Boolean algebra and other crispy numerical computations
are defined as hard computing, whereas fuzzy logic, neural
network and probabilistic reasoning techniques, such as
genetic algorithm and parts of learning theory are categorized
as soft computing. [6]
The study of the human brain is thousands of years old.
Human brain is a collection of more than 10 billion
interconnected neurons. Each neuron is a cell that uses
biochemical reactions to receive, process, and transmit
information. [8]
The concept of ANN is basically introduced from the subject
of biology where brain plays an important key role in human
body. In human body work is done with the help of brain. As
like as brain, Neural Network is just a web of inter connected
neurons which are millions and millions in number. With the
help of these interconnected neurons all the parallel processing
is done in human body and the human body is the best
example of Parallel Processing. [2]
The first step toward artificial neural networks came in 1943
when Warren McCulloch, a neurophysiologist, and a young
mathematician, Walter Pitts, wrote a paper on how neurons
might work. They modelled a simple neural network with
electrical circuits. [1]
Fig 1:- Neural Network in Human Body [2]
In machine learning, Artificial Neural Networks (ANNs) are
used to estimate or approximate functions that can depend on a
large number of inputs that are generally unknown. These
ANNs are generally presented as systems of interconnected
"neurons" which can compute values from inputs, and are
capable of machine learning as well as pattern & image
recognition due to their adaptive nature.
1.1 What is Neural Network?
The simplest definition of a neural network, more properly
referred to as an 'artificial' neural network (ANN), is provided
by the inventor of one of the first neurocomputers, Dr. Robert
Hecht-Nielsen. He defines a neural network as:
“...a computing system made up of a number of simple, highly
interconnected processing elements, which process
information by their dynamic state response to external
inputs.” [16]
Artificial Neural Networks is considers as major soft-
computing technology and have been extensively studied and
applied during the last two decades. The most general
applications where neural networks are most widely used for
problem solving are in pattern recognition, data analysis,
control and clustering. Artificial Neural Networks have
abundant features including high processing speeds and the
ability to learn the solution to a problem from a set of
examples. [14]
In an ANN, simple artificial nodes, known as "neurons",
"neurodes", "processing elements", "units" or “Computational
Elements” are connected together to form a network which
mimics a biological neural network. These Computational

328
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

elements or nodes are connected via weights that are typically

adapted during use to improve performance. [7]

1.2 Working of ANN

The working of an Artificial Neural Networks depends on the
different types of layers. Whole processing has done between
these layers. There are three different types of ANN layers.
These are as follows:
1. Input Layer: The layer of input neurons receive the data
either from input files or directly from electronic sensors
in real-time applications. [1]
2. Hidden Layer: Between Input & Output layers there can
be many hidden layers. These internal hidden layers
contain many of the neurons in various interconnected
structures. The inputs and outputs of each of these internal
hidden neurons simply go to other neurons. All functions
and algorithms are performed during this layer, and then it Fig 2:- General Structure of ANN [1]
sends the final result to the neurons of output layer. 3. Output Layer: The output layer sends information directly
to the outside world, to a secondary computer process, or
to other devices such as a mechanical control system. [1]

Fig 3:- Different Types of Layers in ANN [16]

1.3 Architecture of ANN

The Neurons are usually arranged in a series of layers, Connections usually feed from the input to the output layers, a
bounded by input and output layers, encompassing a variable feed-forward network, although feedback connections from
number of hidden layers, connected in a structure which hidden layer to input layer. [11] There are two types of
depends on the complexity of the problem to be solved. topologies in the architecture of ANN.

Fig 4:- ANN Architecture [2]

329
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
1. Feed-forward: In feed-forward networks signals are
processed from a set of input units in the bottom to output
units in the top, layer by layer. [4] These allows only for
one directional singnal flow. In this architecture, the
processing elements or neurons can’t send their results in
backward direction. Most of the feed-forward neural
networks are organised in layers.
Fig 5:- ANN Feed-forward Topology [4]
2. Feedback: On the other hand, in feed-back networks the
synapses are bidirectional. Activation continues until a
fixed point has been reached, reminiscent of a statistical
mechanism system. [4]
Fig 6:- ANN Feedback Topology [1]
1.4 Why use Neural Networks over
Conventional Computers?
Neural networks take a different approach to problem solving
than that of conventional computers. Conventional computers
use an algorithmic approach i.e. the computer follows a set of
instructions in order to solve a problem. Unless the specific
steps that the computer needs to follow are known the
computer cannot solve the problem. That restricts the problem
solving capability of conventional computers to problems that
we already understand and know how to solve. But computers
would be so much more useful if they could do things that we
don't exactly know how to do. Neural networks process
information in a similar way the human brain does. The
network is composed of a large number of highly
interconnected processing elements (neurons) working in
parallel to solve a specific problem. Neural networks learn by
example. They cannot be programmed to perform a specific
task. The disadvantage is that because the network finds out
how to solve the problem by itself, its operation can be
unpredictable. On the other hand, conventional computers use
a cognitive approach to problem solving; the way the problem
is to solved must be known and stated in small unambiguous
330
ISBN: 978-81-924893-0-8
instructions. These instructions are then converted to a high
level language program and then into machine code that the
computer can understand. These machines are totally
predictable; if anything goes wrong is due to a software or
hardware fault. Neural networks and conventional algorithmic
computers are not in competition but complement each other.
There are tasks are more suited to an algorithmic approach like
arithmetic operations and tasks that are more suited to neural
networks. Even more, a large number of tasks, require systems
that use a combination of the two approaches (normally a
conventional computer is used to supervise the neural
network) in order to perform at maximum efficiency. [1]
The other characteristics those are not present in Conventional
Computers are:
 massive parallelism,
 distributed representation and computation,
 learning ability,
 generalization ability,
 adaptivity,
 inherent contextual information processing,
 fault tolerance, and
 Low energy consumption. [10]
1.5 Trainings of ANN
Once a network has been structured for a particular
application, that network is ready to be trained. To start this
process the initial weights are chosen randomly. Then, the
training, or learning, begins. There are some approaches to
training:
1. Supervised: In supervised training, both the inputs and the
outputs are provided. The network then processes the
inputs and compares its resulting outputs against the
desired outputs. Errors are then propagated back through
the system, causing the system to adjust the weights which
control the network. The set of data which enables the
training is called the "training set." During the training of a
network the same set of data is processed many times as
the connection weights are ever refined. The current
commercial network development packages provide tools
to monitor how well an artificial neural network is
converging on the ability to predict the right answer. These
tools allow the training process to go on for days, stopping
only when the system reaches some statistically desired
point, or accuracy. However, some networks never learn.
This could be because the input data does not contain the
specific information from which the desired output is
derived. Networks also don't converge if there is not
enough data to enable complete learning. [1]
The back-propagation algorithm belongs into this
category. [15]
2. Unsupervised: Unsupervised training is used to perform
some initial characterization on inputs. In unsupervised
training, the network is provided with inputs but not with
desired outputs. The system itself must then decide what
features it will use to group the input data. This is often
referred to as self-organization or adaption. At the present
time, unsupervised learning is not well understood. [1]. It
does not require a correct answer associated with each
input pattern in the training set. Explores the underlying
structure in the data, or correlations between patterns in
the data, and organizes patterns into categories from these
correlations.
The Kohonen algorithm belongs into this category. [15]
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3. Hybrid: Combines supervised and unsupervised trainings.
Part of the weights are determined through supervised
learning and the others are obtained through an
unsupervised learning [15]
4. Reinforced: In this method, a trainer though available,
does not present the expected answer, but only indicates if
the computed output is correct or incorrect. The
information provided helps the network in its training
process. A reward is given for a correct answer computed
and a penalty for a wrong answer. But, reinforced training
is not one of the popular forms of training. [12]
1.6 Applications
The various real time applications of Artificial Neural
Network are as follows:
1. Function approximation, or regression analysis, including
time series prediction and modelling.
2. Call control- answer an incoming call (speaker-ON) with a
wave of the hand while driving.
3. Data processing, including filtering, clustering, blind
signal separation and compression.
4. Application areas of ANNs include system identification
and control (vehicle control, process control), game-
playing and decision making (backgammon, chess,
racing), pattern recognition (radar systems, face
identification, object recognition, etc.), sequence
recognition (gesture, speech, handwritten text recognition),
medical diagnosis, financial applications, data mining (or
knowledge discovery in databases, "KDD").[1]
5. A classic application for ANN is image recognition. A
network that can classify different standard images can be
used in several areas:
 Quality assurance, by classifying a metal welding as
whether is holds the quality standard.
 Medical diagnostics, by classifying x-ray pictures for
tumour diagnosis.
 Detective tools, by classifying fingerprints to a
database of suspects. [13]
6. The other usage of ANNs are in:
 Airline Security Control.
 Investment Management and Risk Control.
 Prediction of Thrift Failures.
 Prediction of Stock Price Index.
 OCR Systems.
 Industrial Process Control.
 Data Validation.
 Risk Management.
 Target Marketing.
 Sales Forecasting.
 Customer Research.
 Prediction/Forecasting
 Optimization
 Content-addressable Memory. [2,15]
1.7 Advantages
There are several advantages of ANN in today’s world. These
are as follows:
1. Adaptive learning: An ability to learn how to do tasks
based on the data given for training or initial experience.
331
ISBN: 978-81-924893-0-8
2. Self-Organisation: An ANN can create its own
organisation or representation of the information it
receives during learning time.
3. Real Time Operation: ANN computations may be carried
out in parallel, and special hardware devices are being
designed and manufactured which take advantage of this
capability.
4. Pattern recognition: It is a powerful technique for
harnessing the information in the data and generalizing
about it. Neural nets learn to recognize the patterns which
exist in the data set.
5. The system is developed through learning rather than
programming.. Neural nets teach themselves the patterns
in the data freeing the analyst for more interesting work.
6. Neural networks are flexible in a changing environment.
Although neural networks may take some time to learn a
sudden drastic change they are excellent at adapting to
constantly changing information.
7. Neural networks can build informative models whenever
conventional approaches fail. Because neural networks can
handle very complex interactions they can easily model
data which is too difficult to model with traditional
approaches such as inferential statistics or programming
logic.
8. Performance of neural networks is at least as good as
classical statistical modelling, and better on most
problems. The neural networks build models that are more
reflective of the structure of the data in significantly less
time. [1]
9. Distributed memory: The network does not store
information in a central memory. Information is stored as
patterns throughout the network structure. The state of
neurons represents a short-term memory as it may change
with the next input vector. The values in the weight matrix
(the connections) form a long-term memory and are
changeable only on a longer time basis. Gradually, short-
term memory will move into long-term memory and
modify the network as a function of the input experience.
[9]
2. CONCLUSION
The computing world has a lot to gain from Artificial Neural
Networks. Their ability to learn by examples makes them more
flexible and powerful. In this paper we discussed about the
Artificial Neural Network. In which we discussed working of
ANN, Architecture, Trainings, Advantages and Applications.
By studying ANN we had concluded that as per as technology
is developing day by day the need of Artificial Intelligence is
increasing because of its major advantage of parallel
processing, which conventional computers can’t provide.
REFERENCES
[1] Ms. Sonali. B. Maind & Ms. Priyanka Wankar,
“Research Paper on Basic of Artificial Neural Network”,
International Journal on Recent and Innovation Trends in
Computer & Communication, Vol. 2, Issue: 1, ISSN:
2321-8169, pp: 96-100.
[2] Vidushi Sharma, Sachin Rai & Anurag Dev,“A
Comprehensive Study of Artificial Neural Networks”,
International Journal of Advanced Research in computer
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
science & Software Engineering, Oct. 2012, Vol. 2,
Issue: 10, ISSN: 2277 128X, pp: 278-284.
[3] Bogdan M. Wilamowski, “Neural Network Architecture
& Learning”, IEEE Auburn University, 2003, 0-7803-
7852-0, ICIT 2003, pp: 1-12.
[4] Carsten Peterson & Thorsteinn Rognvaldsson, “An
Introduction to Artificial Neural Network”, Sweden, pp.
113-170.
[5] Jyoti Singh & Pritee Gupta, “Advance Applications of
Artificial Intelligence and Neural Networks: A Review”,
pp. 1-4.
[6] Prof D.P.Salapurkar, “Introduction to technique of Soft
Computing: Artificial Neural Networks”, International
Journal of Engineering & Computer Science, ISSN:
2319-7242, Vol. 4, Issue: 1, Jan. 2015, pp. 9868-9873.
[7] Richard P. Lippmann, “An introduction to computing
with neural nets”, IEEE ASSP Magazine, April 1987,
pp. 4-22.
[8] Ajith Abraham, “Artificial Neural Networks”, Stillwater,
OK, USA, 2005.
332
ISBN: 978-81-924893-0-8
[9] Eldon Y. Li, “Artificial Neural Networks and their
Business Applications”, Taiwan, 1994.
[10] Anil K Jain, Jianchang Mao and K.M Mohiuddin,
“Artificial Neural Networks: A Tutorial”, Michigan
State university, 1996.
[11] A.S. Miller, B.H. Blott & T.K. Hames, “Review of
neural network applications in medical imaging and
signal processing”, Sept. 1992, pp. 449-450.
[12] Girish Kumar Jha, “Artificial Neural Netoworks and its
applications”, pp. V41-V49.
[13] Fiona Nielsen, “Neural Networks- algorithms and
applications” Neil’s Brock Business College, Dec 2001,
pp. 1-19.
[14] Koushal Kumar & Gour Sundar Mitra Thakur,
“Advanced Applications of Neural Networks and
Artificial Intelligence: A Review”, IJITCS, ISSN: 2074-
9007, Vol. 4, No. 6, June 2012, pp. 57-68.
[15] http://www.cse.unr.edu/~bebis/MathMethods/NNs/lectur
e.pdf
[16] http://pages.cs.wisc.edu/~bolo/shipyard/neural/local.htm.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Survey of Routing Protocols in Mobile Ad-Hoc

Network

Preet kamal Sharma R. K. Bansal

Assistant Professor, Department of Computer Dean Research, Gurukashi University
Applications Talwandi Sabo, Bathinda
Post Graduate Govt. College for Girls, Sector 42,
Chandigarh bansalrajk2009@gmail.com
(Punjab University)
preetkamal20@gmail.com

ABSTRACT Limited Physical Security, Dynamic network topology and

In recent years the demand of wireless communication rises Frequent routing updates.
due to which mobile ad hoc networks also called MANET
have become very popular and lots of research is being done
on it. An Ad hoc network is a self-configuring network of
wireless links connecting mobile nodes. These nodes may be
routers and/or hosts. Each node or mobile device is equipped
with a transmitter and receiver. They are a type of networks
which can take different forms in terms of topologies and in
term of devices used. Since wireless links developed in this
type of network are more error prone and can easily lose their
signal because of mobility of nodes. Therefore, selection of
optimal routing protocol in MANET is very critical task.
DSR, AODV and TORA are some of the well-known routing
protocol suitable for MANET. This paper provides an
overview of different proposed routing protocols and also
provides a comparison between them.

Keywords- MANET, AODV, DSR, TORA .

1. INTRODUCTION 2. ROUTING PROTOCOLS

Wireless network can be classified into two major categories;
Infrastructure networks and Ad Hoc Networks. Infrastructure
networks are those in which the base stations are fixed and as
the node goes out of the range of a base station, it gets into the
range of another base station. One of the drawback of using an
infrastructure network is that it goes through the overhead of
maintaining the long complex routing tables. See fig. 1 given
below which give us a better description of Infrastructure
network.
Ad-Hoc Network is usually thought of as a collection of
wireless nodes maintaining temporary or for the time being
network without any fixed infrastructure. Hence the topology
of the network is much more dynamic and the changes are
often unpredictable opposite to the Internet which is a
infrastructure network. An ad hoc network is a decentralized
type of wireless network. The network is ad hoc because it
does not rely on a pre-existing infrastructure, such as routers
in wired networks or any centralized access points in
infrastructure wireless networks. Ad Hoc networks do not
have a certain topology or a central coordination point. In
MANET, each node try to act as both host and router. This
flexibility of allowing nodes to join, leave and transfer data to
the network make Ad-Hoc Network more critical and error
prone. Following are some of the challenges faced by
MANET; Bandwidth constrained, variable capacity links,
Routing protocols tells a set of rules which are responsible for
the delivery of message from source node to destination node
in a network. Large number of routing protocols have been
suggested for ad hoc network. These protocols find a route for
packet delivery and deliver the packet to the correct
destination. The studies on various aspects of routing
protocols have been an active area of research for many years.
Following are some ad hoc network routing protocols. a)
Table-driven (proactive) routing and b) On-demand (reactive)
routing
Table Driven or Proactive routing: This type of protocols
maintains fresh lists of destinations and their routes by
periodically distributing routing tables throughout the
network. Here each node maintains one or more tables
containing routing information to every other node in the
network. All nodes keep on updating these tables to maintain
latest information of the network. Therefore, if a route has
already existed before traffic comes, the transmission of may
possible without any delay. Some of the existing Table Driven
or Proactive Protocols are: Dynamic Destination-Sequenced
Distance Vector (DSDV), Wireless Routing Protocol (WRP),
Optimized Link State Routing Protocol (OLSR) and Cluster
Gateway Switch Routing (CGSR). The main disadvantages of

333
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
such kind of algorithms are: i) Respective amount of data for
maintenance. ii) Slow reaction on restructuring and failures.
i) Dynamic Destination-Sequenced Distance
Vector (DSDV)
DSDV is a table-driven routing algorithm for ad hoc mobile
networks which is based on the Bellman–Ford algorithm. It
was developed by C. Perkins and P. Bhagwat in 1994. The
algorithm was basically developed to solve the problem of
routing loop. Each entry in the routing table contains a
sequence number, the sequence numbers are generally even if
a link is present; else, an odd number is used. The number is
generated by the destination, and the emitter needs to send out
the next update with this number. Routing information is
distributed between nodes by sending full dumps infrequently
and smaller incremental updates more frequently.
ii) Wireless Routing Protocol (WRP)
WRP comes under the category of path-finding algorithms,
known as the set of distributed shortest path algorithms that
calculate the paths considering the information regarding the
length and till last hop the shortest path to each destination.
WRP reduces the number of chances in which a temporary
routing loop can occur. For the purpose of routing, each node
maintains four things: 1. A distance table 2. A routing table
3.A link-cost table 4. A message retransmission list. WRP
uses periodic update message transmissions to the neighbours
of a node. The nodes in the response should send
acknowledgments. If there is no change from the last update,
the nodes in the response list should send an idle Hello
message to ensure connectivity.
iii) Optimized Link State Routing Protocol
(OLSR)
OLSR is an IP routing protocol optimized for mobile ad hoc
networks, which can also be used on other wireless ad hoc
networks. OLSR is a proactive link-state routing protocol,
which uses hello and topology control messages to discover
and then disseminate link state information throughout
the mobile ad hoc network. Individual nodes use this topology
information to compute next hop destinations for all nodes in
the network using shortest hop forwarding paths.
iv) Cluster Gateway Switch Routing
(CGSR)
CGSR considers a clustered mobile wireless network instead
of a „„flat‟‟ network. For structuring the network into
separate but interrelated groups, cluster heads are elected
using a cluster head selection algorithm. By forming several
clusters, this protocol achieves a distributed processing
mechanism in the network. However, one drawback of this
protocol is that, frequent change or selection of cluster heads
might be resource hungry and it might affect the routing
performance.
On Demand or Reactive Protocols: These types
of protocol search a route on demand by flooding the network
with Route Request packets. A node initiates a route
discovery throughout the network, only when it wants to send
packets to its destination. For this purpose, a node begins a
route discovery process through the network. This process is
completed once a route is determined or all possible cases
have been examined. Once a route has been established, it is
maintained by a route maintenance process until either the
334
ISBN: 978-81-924893-0-8
destination becomes inaccessible along every path from the
source or until the route is not desired. In reactive protocol,
nodes maintain the routes to active destinations. A route
search is needed for every unknown destination. The main
disadvantages of such kind of algorithms are: i) High latency
time in route finding. Ii) Excessive flooding can lead to
network clogging. Some of the existing On Demand Routing
Protocols are: Cluster Based Routing Protocol (CBRP), Ad
hoc On-Demand Distance Vector (AODV), Dynamic Source
Routing (DSR), Temporally Ordered Routing Algorithm
(TORA), Signal Stability Routing (SSR) and Location Aided
Routing (LAR).
Every Routing Protocol of On Demand routing protocol has
its own advantages and limitations. Here in this paper we
concentrate on the three main routing protocols which are
equally likely competitor of each other. These three protocols
that are best suited for Ad Hoc Network are DRS, AODV
and TORA.
i) Dynamic Source Routing (DSR)
DSR is designed for use in multi hop wireless ad hoc
networks of mobile nodes. Basically (DSR) is an Ad Hoc
routing protocol which is based on the theory of source-based
routing rather than table-based. This protocol is source-
initiated rather than hop-by-hop. The protocol in DRS is based
on the link state algorithm in which source initiates route
discovery on demand basis. DSR was designed for multi hop
networks for small Diameters. It is a beaconless protocol in
which no HELLO messages are exchanged between nodes to
notify them of their neighbours in the network. DSR has a
unique advantage by virtue of source routing. As the route is
part of the packet itself, routing loops, either short – lived or
long – lived, cannot be formed as they can be immediately
detected and eliminated. This property opens up the protocol
to a variety of useful optimizations. It must be noted that
neither AODV nor DSR assure best shortest path. If the
destination alone can respond to route requests and the source
node is always the initiator of the route request, the initial
route may be the shortest one.
ii) Ad-Hoc On-Demand Distance Vector
Routing (AODV)
AODV is a variation of Destination-Sequenced Distance-
Vector (DSDV) routing protocol which is collectively based
on DSDV and DSR. In AODV, the network is silent until a
connection is needed. At that point the network node that
needs a connection broadcasts a request for connection. Other
AODV nodes forward this message, and record the node that
they heard it from, creating an explosion of temporary routes
back to the needy node. When a node receives such a message
and already has a route to the desired node, it sends a message
backwards through a temporary route to the requesting node.
It aims to minimize the requirement of system-wide
broadcasts to its extreme. It does not maintain routes from
every node to every other node in the network rather they are
discovered as and when needed & are maintained only as
long as they are required.
The key steps of this algorithm for the establishment of
unicast routing are : a) Route Discovery, b) Expanding Search
Technique, c) Setting up of Forward Path and d) Route
Maintenance.
Advantages
The main benifit of this protocol is having routes established
on demand and that destination sequence numbers are applied
to find the latest route to the destination. The connection setup
delay is lower.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Limitations
First limitation of this protocol is that intermediate nodes can
lead to inconsistent routes if the source sequence number is
very old and the intermediate nodes have a higher but not the
latest destination sequence number, thereby having stale
entries. Also, multiple Route Reply packets in response to a
single Route Request packet can lead to heavy control
overhead. Another Limitation of AODV is unnecessary
bandwidth consumption due to periodic transmission.
i) Temporary Ordered Routing
Protocol (TORA)
The main feature of TORA is that the control messages are
localized to a very small set of nodes near the occurrence of a
topological change. To achieve this, the nodes maintain
routing information about adjacent nodes. TORA defines a
parameter, termed as height. Height is a measure of the
distance of the responding nodes distance up to the required
destination node. In the route discovery phase, this parameter
is returned to the querying node. The TORA attempts to
achieve a high degree of scalability using a "flat", non-
hierarchical routing algorithm. In its operation the algorithm
attempts to suppress, to the greatest extent possible, the
generation of far-reaching control message propagation. In
order to achieve this, the TORA does not use a shortest path
solution, an approach which is unusual for routing algorithms
of this type. TORA builds and maintains a Directed Acyclic
Graph (DAG) rooted at a destination. No two nodes may have
the same height.
Information may flow from nodes with higher heights to
nodes with lower heights. Information can therefore be
thought of as a fluid that may only flow downhill. TORA
protocol has three basic functions: a) Route Creation, b) Route
Maintenance and c) Route Erasure.
Advantages
The main advantage of TORA is that the multiple routes
between any source destination pair are supported by this
protocol. Therefore, failure or removal of any of the nodes is
quickly resolved without source intervention by switching to
an alternate route.
Disadvantage
The main disadvantage of TORA is that it depends on
synchronized clocks among nodes in the ad hoc network. This
dependence of protocol on intermediate lower layers for
certain functionality assumes that the link status sensing,
neighbour discovery, in order packet delivery and address
resolution are all readily available.
Performance Metrics
There exists various numbers of metrics that can be used to
compare reactive routing protocols. Most of them ensure the
qualitative metrics. Therefore, the following different metrics
have been considered to make the comparative study of these
routing protocols through simulation.
1) Routing overhead: This metric describes how many
routing packets for route discovery and route maintenance
need to be sent so as to propagate the data packets.
2) Average Delay: This metric represents average end-to-end
delay and indicates how long it took for a packet to travel
from the source to the application layer of the destination. It is
measured in seconds.
3) Throughput: This metric represents the total number of
bits forwarded to higher layers per second. It is measured in
bps. It can also be defined as the total amount of data a
335
ISBN: 978-81-924893-0-8
receiver actually receives from sender divided by the time
taken by the receiver to obtain the last packet.
4) Media Access Delay: The time a node takes to access
media for starting the packet transmission is called as
media access delay. The delay is recorded for each packet
when it is sent to the physical layer for the first time.
5) Packet Delivery Ratio: The ratio between the amount of
incoming data packets and actually received data
packets.
6) Path optimality: This metric can be defined as the
difference between the path actually taken and the best
possible path for a packet to reach its destination.
3. CONCLUSIONS
In this paper a number of routing protocols for MANET,
which are broadly categorized as proactive and reactive
protocols. The effort has been made on the comparative study
of Reactive, Proactive routing protocols has been presented in
the form of table. The attempt towards a comprehensive
performance of three commonly used mobile Ad-Hoc routing
protocols (DSR, AODV and TORA). There are various
shortcomings in different routing protocols and it is difficult
to choose routing protocol for different situations as there is
trade off between various protocols. There are various
challenges that need to be met, so these networks are going to
have widespread use in the future.
ACKNOWLEDGEMENT
Our special thanks to the reviewers and editors for their
valuable suggestions and expert comments that helps to
improve the paper.
REFERENCES
[1 ] C K Toh, Ad Hoc Mobile Wireless Networks, Prentice
Hall Publishers , 2002.
[2] Robinpreet Kaur & Mritunjay Kumar Rai, A Novel Review
on Routing Protocols in MANETs, Undergraduate Academic
Research Journal (UARJ), ISSN : 2278 – 1129, Volume-1,
Issue-1, 2012
[3] Ammar Odeh, Eman AbdelFattah and Muneer Alshowkan,
Performance Evaluation Of AODV And DSR Routing
Protocols In Manet Networks, International Journal of
Distributed and Parallel Systems (IJDPS) Vol.3, No.4, July
2012.
[4] Mina Vajed Khiavi, Shahram Jamali, Sajjad Jahanbakhsh
Gudakahriz, Performance Comparison of AODV, DSDV, DSR
and TORA Routing Protocols in MANETs, International
Research Journal of Applied and Basic Sciences. Vol., 3 (7),
1429-1436, 2012 ISSN 2251-838X ©2012 Victor Quest
Publications.
[5] Sachin Dnyandeo Ubarhande, Performance Evolution of
AODV and DSR Routing Protocols in MANET Using NS2,
International Journal of Scientific & Engineering Research
Volume 3, Issue 5, May-2012, ISSN 2229-5518
[6] G.Vijaya Kumar , Y.Vasudeva Reddyr , Dr.M.Nagendra ,
Current Research Work on Routing Protocols for MANET: A
Literature Survey, International Journal on Computer Science
and Engineering Vol. 02, No. 03, 2010, 706-713
[7] Tarek Sheltami and Hussein Mouftah “Comparative study
of on demand and Cluster Based Routing protocols in
MANETs”, IEEE conference, pp. 291-295, 2003
[8] Dr. Kamaljit I. Lakhtaria, Analyzing Reactive Routing
Protocols in Mobile Ad Hoc Networks, Int. J. Advanced
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Networking and Applications Volume:03 Issue:06
Pages:1416-1421 (2012) ISSN : 0975-0290
[9] Johnson. D and Maltz. D. A, “Dynamic source routing in
ad hoc wireless Networks” in Mobile Computing (Imielinski
and H. Korth, eds.), Kluwere Academic Publishers, 199
[10] Perkins CE, Royer EM, Chakeres ID (2003) Ad hoc On-
Demand Distance Vector (AODV) Routing. IETF Draft,
October, 2003
[11] Toh C-K (1996) A Novel Distributed Routing Protocol to
Support Ad- Hoc Mobile Computing.Proceedings of the 1996
IEEE 15th Annual International Phoenix Conference on
Computers and Communications:480–486
[12] Elizabeth M. Royer“A Review of Current Routing
Protocols for Ad Hoc Mobile Wireless Networks” University
of California, Santa Barbara Chai-Keong Toh, Georgia
Institute of Technology, IEEE Personal Communications, pp.
46-55, April 1999.
[13] Krishna Gorantala , “Routing Protocols in Mobile Ad-hoc
Networks”, A Master’ thesis in computer science, pp-1-36,
2006.
[14] Perkins CE, Bhagwat P (1994) Highly Dynamic
Destination-Sequenced Distance-Vector Routing (DSDV) for
Mobile Computers. Proceedings of ACM SIGCOMM
1994:234–244
[15] Cheng C, Riley R, Kumar SPR, Garcia-Luna-Aceves JJ
(1989) A Loop Free Extended Bellman-Ford Routing
Protocol Without Bouncing Effect. ACM SIGCOMM
Computer Communications Review, Volume 19, Issue 4:224–
236
336
ISBN: 978-81-924893-0-8
[16] J. Broch, D.A. Maltz, D. B. Johnson, Y-C. Hu, J.
Jetcheva, “A performance comparison of Multi-hop wireless
ad-hoc networking routing protocols”, in the proceedings of
the 4th International Conference on Mobile Computing and
Networking (ACM MOBICOM ’98), October 1998, pages 85-
97.
[17] Md. Golam Kaosar, Hafiz M. Asif, Tarek R. Sheltami,
Ashraf S. Hasan Mahmoud, “Simulation-Based Comparative
Study of On Demand Routing Protocols for MANET”,
available at http://www.lancs.ac.uk
[18] Per Johansson, Tony Larsson, Nicklas Hedman, Bartosz
Mielczarek, “Routing protocols for mobile ad-hoc networks –
a comparative performance analysis”, in the proceedings of
the 5th International Conference on Mobile Computing and
Networking (ACM MOBICOM ’99), August 1999, pages
195-206.
[19] P. Chenna Reddy, Dr. P. Chandrasekhar Reddy,
“Performance Analysis of Adhoc Network Routing
Protocols”, Academic Open Internet Journal, SSN 1311-4360,
Volume 17, 2006 [20] R. Misra, C. R. Manda, “Performance
Comparison of AODV/DSR On-Demand Routing Protocols
for Ad Hoc Networks in Constrained Situation”, IEEE
ICPWC 2005.
[21] S. Gowrishankar, T.G. Basavaraju, M. Singh, Subir
Kumar Sarkar, “Scenario based Performance Analysis of
AODV and OLSR in Mobile Ad hoc Networks”, available at
http://www.ijcim.th.org
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The Beginning of Statistical Machine Translation System

to convert Dogri into Hindi
Manu Raj Moudgil Preeti Dubey
Research Scholar (Ph.D) Assistant Professor
JJT University, Jhunjhunu Central University of Jammu, Jammu
manu.moudgil@gmail.com preetidubey2000@yahoo.com

ABSTRACT undertaking translation. The structural difference between

Research in the field of machine translation has paced up in English Malayalam pair is resolved applying order
these few years. Statistical machine translation is the latest conversion rules. This system verifies the translation by
approach of MT using which many machine translations using BLEU, F measure and WER evaluation metrics.[5]
systems are being developed producing excellent results. This
paper provides a brief introduction to SMT and the various  Machine Translation at IBM India Research Lab. IBM‟s
tools required for developing a SMT. some systems that have India Research Lab have been working on SMT systems
been developed using this approach are also discussed. This for Indian languages. IBM Research has developed several
paper presents the idea and the work plan for developing NLP tools which can be used to speed up the development
SMT system to convert Dogri into Hindi, which will be the of SMT systems and improve the quality of translation.
first system for the language pair. They have developed a framework for SMT for Indian
languages and have developed a Hindi-English SMT
Keywords: Statistical machine translation, Decoding, system and an English-Hindi SMT system.[6]
Translation, Language model
 Microsoft Bing Translator (2009) is a service provided
by Microsoft as part of its Bing services which allow users
1. MACHINE TRANSLATION to translate texts or entire web pages into different
Machine Translation (MT) is a sub field of artificial
languages. All translation pairs are powered by Microsoft
intelligence which focuses on automatically translating one
Translation (previously Systran), developed by Microsoft
natural language called the source language into another
Research, as its backend translation software. The
natural language called the target language. It can be applied
translation service is also using statistical Machine
to both text and speech. MT was the first computer-based
Translation strategy to some extent [7]
application related to natural language processing [1]. MT
research dates back to 1930‟s, when the first patents for
 EILMT System, aims to design and deploy a Machine
translations were applied. to develop dictionaries. The use of
Translation System from English to Indian Languages in
computers for translations was first discussed by Warren
Tourism and Healthcare Domains. The project is funded by
Weaver in 1949 [2]. In 1951, the first full-time researcher,
Department of Information Technology, MCIT and
Yehoshua Bar-Hillel was appointed at MIT for research on
Government of India. It uses statistical model and its
machine translation. MT research geared in 1950‟s and that is
primary objective is to initially build an English-Hindi
the first generation of translation using the direct approach of
translation system capable of translating free flow text and
translation, where the focus of translation was majorly on
gradually adapt it to other Indian language pairs as well.
dictionaries. The first machine translation systems were
The Consortium Members of EILMT system are C-DAC
developed using dictionaries i.e. they were based on word to
Mumbai, IISc Bangalore, IIIT Hyderabad, C-DAC Pune,
word translations. Second generation of translations was in
IIT Mumbai, Jadavpur University Kolkata, Utkal
mid 60‟s; these systems were based on the transfer approach.
University Bangalore, Amrita University Coimbatore and
Since the late 80‟s corpus based research methods have
Banasthali Vidyapeeth, Banasthali .[8]
emerged [3]. Many systems have been developed based on the
above mentioned approaches. Some systems developed using
SMT are listed below:  Unnikrishhanan et. al. (2010) [9] explained the
development of machine translation system using statistical
 approach for translating English to South Dravidian
Google Translate (2007) uses a statistical Machine
languages like Malayalam and Kannada. The various tools
Translation approach. It was created by Franz-Josef Och,
used for the development of the said system are: SRILM
who is now the head of Google‟s machine translation
for creating language model, GIZA++ for training
Group. Initially Google translate used SYSTRAN for its
translation model and MOSES decoder for translating
translation till 2007. Currently, it is providing the facility
English to Malayalam (or Kannada). Other tools used at
of translation among 51 language pairs. It includes only
various levels of translation process are: The Stanford
one Indian language Hindi. The accuracy of translation is
statistical parser, Roman to Unicode and Unicode to
good enough to understand the translated text. [4]
Roman converter, Morphological analyzer and generators,
 Malayalam and Kannada morphological analyzers, English
English to Malayalam Translation (2008)(A Statistical
morphological analyzer, Malayalam and Kannada
Approach): The system uses statistical models for
morphological generators and Transfer rule file. The
undertaking translation. Monolingual corpus of Malayalam
architecture of the system is:
is used and bilingual corpus is used for English language.
This system uses various pre-processing techniques for

337
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig 1: Architecture of English to Dravidian Language
SMT System
The main ideas implemented and proven very effective for
English to south Dravidian languages SMT system are: (i)
reordering the English source sentence according to
Dravidian syntax, (ii) using the root suffix separation on both
English and Dravidian words and iii) use of morphological
information for improving the quality of translation. The
BLEU score using baseline system for English to Malayalam
is 15.9 (and for English to Kannada is 15.4). When the syntax
and morphological information was incorporated to the
baseline system, BLEU scores show considerable
improvement i.e. 24.9 and 24.5 respectively for above
systems. The low BLEU scores are due to small training
corpus size. The performance evaluation shows that when
reordering and morphological information was applied, the
blue score increased approximately by 9.0.
2. RESEARCH PROPOSAL
The objective of this research work is to develop a machine
translation system for automatic conversion of text from
Dogri into Hindi using the statistical approach. Dogri and
Hindi are closely related languages. These languages are
written from left to right. Both languages are written in
Devanagiri script. The close relationship between Hindi and
Dogri is established by a study by Dr.Preeti Dubey, Dr.
Devanand and. et. al.[10]. The authors have concluded in their
paper that Hindi and Dogri are closely related languages.
There is no work of translating Dogri into any language. The
only available system that is Hindi to Dogri MTS developed
using the direct approach of translation.[11] A brief
introduction of SMT is given below
3. STATISTICAL MACHINE
TRANSLATION
Early efforts based on this idea are example-based translation
systems that have been built especially in Japan since the
1980s. These systems try to find a sentence similar to the
input sentence in a parallel corpus, and make the appropriate
changes to its stored translation. In the late 1980s, the idea of
statistical machine translation was born in the labs of IBM
Research in the wake of successes of statistical methods in
speech recognition. By modelling the translation task as a
statistical optimization problem, the Candide project put
machine translation on a solid mathematical foundation. New
338
ISBN: 978-81-924893-0-8
dimensions of the machine translation were explored which
included Statistical Machine Translation (SMT). It was
introduced by IBM researchers in a workshop sponsored by
the US National Science Foundation and Johns Hopkins
University‟s Centre for Language and Speech Processing [12,
13].
Statistical MT model takes the view that every sentence in
the target language is a translation of the source language
sentence with some probability. The best translation, of
course, is the sentence that has the highest probability. The
key activities in statistical MT are: availability of large
parallel corpus, estimating the probabilities of translation, and
efficiently finding the sentence with the highest probability.
The other problems include sentence alignment, compound
words, idiom translation, morphology and out of vocabulary
words.
3.1 Overview of Proposed Statistical MT
The system proposed in this research paper is the SMT
system for Dogri-Hindi language pair. Suppose we have a
sentence, f, given in Dogri and we want to find a good Hindi
translation, e. There are many possible translations of f into
Hindi, and different translators will have different opinions
about the best translation. We can model these differences of
opinion with a probability distribution P(e|f) over possible
translations, e, given that the Dogri text was f. A reasonable
way of choosing the „best‟ translation is to choose e which
maximizes the conditional probability
P(e|f).
The problem with this strategy is that we do not know the
conditional probability P(e|f). In order to solve this problem,
suppose we have a Dogri-Hindi parallel corpus as seed
corpus. We will use this corpus to infer a model estimating
the conditional probabilities P(e|f).
The standard approach to estimate the conditional probability
P(e|f)is to use Bayes‟ theorem. Using this theorem P (e|f) is
rewritten as
Because f is fixed, the maximization over e is thus equivalent
to maximizing P(f|e)P(e).The problem of machine translation
is broken into three steps:
(1) Build a language model which allows us to estimate P(e);
(2) Build a translation model which allows us to estimate
P(f|e); and
(3) Search for e maximizing the product P(f|e)P(e). Each of
these problems is itself a rich problem which can be solved in
many different ways. The next three sections describe simple
approaches to solve these problems.
3.2 The language model
Suppose we break a Hindi sentence e up into words
e=e1e2…em. Then we can write the probability for e as a
product of conditional probabilities:
For example, in the sentence fragment “इक ।”, the next
word with highest conditional probability can be “ ”,
certainly much higher than the probability of its occurrence at
a random point in a piece of text. The challenge in building a
good language model is that there are so many distinct
conditional probabilities that need to be estimated. The
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
following assumptions about the probabilities may simplify
the problem.
The most drastic assumption that could be made is to assume
that the probability of seeing a word is independent of what
came before it, i.e.,
, so
.
The probabilities P can be estimated by taking a very large
corpus of Hindi text, and counting words i.e. P . 3.3 The Translation Model
Where C(e1)represent the number of times e1 appears in
Hindi corpus,
N is total number of words in corpus.
The problem is that this model is not very realistic.
A more realistic model is the bigram model, which assumes
the probability of a word occurring depends only on the word
immediately before it:
A simple approach to estimate conditional probabilities in the
bigram model is to take a large corpus of Hindi text, count the
number of occurrences of a particular word pair in
that corpus, and then set
More realistic still is the trigram model, which assumes the
probability of a word occurring depends only on the two
words immediately before it:
Similar approach used for the trigram model is to
set . vikasata hoṃdī jā’radī ai) बेरोजगारी/ berojagārī (1) के/ ke
The problem with this procedure is that there are a lot of
bigrams. If we assume that there are 50,000 words in Hindi,
say, then there are 2.5 billion possible bigrams. Even if you
take a large corpus of training data (say, a billion words), it‟s
reasonably likely that there will be some bigrams which don‟t
appear in the corpus, and thus are assigned zero probability,
yet they are likely to appear in translations of some Dogri
sentences. That is, this kind of training procedure is likely to
underestimate the probability of bigrams which don‟t appear
in the training set, and overestimate the probability of those
which do. The problem is even worse for trigrams.
There‟s no obvious best solution to this problem. Many
different ad hoc solutions have been tried, and a quick survey
of the literature suggests that there‟s as yet no broad
agreement about the best way of solving the problem. The
two basic approaches used in the literature are given here.
The first approach is to move away from a pure bigram
model, and instead to use linear interpolation between the
unigram and bigram models. A large and diverse enough
corpus of text is likely to give pretty good estimates for
nearly all single-word probabilities . So one way of
estimating is as:
Here Nis the total number of words in the corpus. is a
parameter in the range which needs to be
determined. This can be done using a second corpus of text,
and setting so that the average probability of the bigrams in
that corpus is maximized.
A second approach is to apply a discount factor to the
conditional probabilities for the bigrams which appear in the
339
ISBN: 978-81-924893-0-8
training corpus, essentially reducing their probability. The
easiest way to proceed is simply to multiply them all by some
constant k in the range , and then to spread the
remaining probability uniformly over all bigrams
which don't appear in the corpus.
In this section a simple translation model is constructed to
compute . Intuitively, when we translate a sentence,
words in the source text generate words in the target
language. In the sentence pair ( एह् साढ़ा ग्ाां ऐ। | यह हमारा गाांव है। )
/( eh sāṛhā grāṃ ai | yaha hamārā gāṃva hai)।
we intuitively feel that एह्/ eh corresponds to यह/ yaha, साढ़ा/
sāṛhā to हमारा/ hamārā, and ग्ाां/ grāṃ to गाांव/ gāṃva. Of course,
there is no need for the word correspondence to be one-to-
one. Sometimes, a word in Hindi may generate two or more
words in Dogri; sometimes it may generate no word at all.
Despite these complications, the notion of a correspondence
between words in the source language and in the target
language is so useful that it is formalized through alignment.
Consider the following aligned sentence pair (बेरोजगारी दे
कारण युवकें च नशे दी आदत ववकसत होंदी जा’रदी ऐ।
(berojagārī de kāraṇa yuvakeṃ ca naśe dī ādata
(2) कारण/ kāraṇa (3) युवकों/ yuvakoṃ (4) में / meṃ (5)
नशे/ naśe (6) की/kī (7) आदत/ ādata (8) ववकससत/ vikasita
(9) होती/ hotī 10-11) जा रही / jā rahī 12) है /) hai । । In this
example, the numbers in parentheses tell us that युवकों
corresponds to the 4th word युवकें in the Dogri sentence. One
notion derived from alignments, particularly useful in
building up our translation model is fertility. It is defined as
the number of Hindi words generated by a given Dogri word.
So, in the example above, युवकें has fertility 1, since it
corresponds to only one word in the Hindi sentence. The
other notion is distortion. In most of the sentences, the Hindi
word and its corresponding Dogri word or words appear in
the same part of the sentence – near the beginning, perhaps,
or near the end, such words are translated roughly without
distortion, while words which move a great distance have
high distortion. Since Dogri and Hindi are closely related
languages and have same sentence structure so problem of
distortion can be ignored without affecting the accuracy of
translation. The translation model can be created with
following parameters:
 The fertility probability , the probability that
the Hindi word has fertility n.
 The translation probability , one for each
Dogri word and Hindi word with alignment a.
A translation model is defined as the probability that
the Dogri sentence f is the correct translation of Hindi
sentence e, with a particular alignment a.
What remains to be done is to estimate the parameters used in
constructing the translation model – the fertility, and
translation probabilities.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.4 Decoding Table 1: shows the resources and tools available for
developing a SMT system
It was explained in the beginning how translation from Dogri
to Hindi can be viewed as the problem of finding e which
Tool Available at
maximizes P(e|f), and that this was equivalent to maximizing
P(f|e)P(e).Considering the above translation model based on Dogri Corpus
alignment, the problem is reformulated as: search for a pair Dogri Unigrams, bigrams, Not available at present state
(e,a) which maximizes P(e,a|f). Using Bayes‟ theorem this is trigrams along with their will be developed from scratch.
equivalent to finding (e,a)which maximizes frequencies

Dogri-Hindi Parallel Not available at present state

Corpus will be developed from scratch
using Hindi-Dogri machine
Because f is fixed in the denominator can be omitted, so translation system developed by
Dr.Preeti Dubey at Department
the search is equivalent to finding a pair (e,a) which of CS&IT, University of Jammu
maximizes Word Alignment Tool Available with Advanced
Centre for Technical
Development of Punjabi
Our translation problem is to find (e,a) maximizing above Language, Literature & Culture,
expression. Unfortunately, there are far too many possibilities Punjabi University, Patiala
to do an exhaustive search. But there are some heuristics developed by Dr. Tejinder
which work pretty well. One is to use a greedy algorithm Saini.
which gradually builds up partial translations and alignments. Hindi Parser Language Technologies
Using the translation and language models described earlier, Research Centre, IIIT
the probabilities for each of these partial alignments can be Hyderabad
computed to find the product
. Hindi Morphological Language Technologies
Analyzer and Generator Research Centre, IIIT
Hyderabad
3.5 Resources Required
Dogri Morphological Developed by Dr.Preeti Dubey
For the development of the said system a large number of
Analyzer and Generator at Department of CS&IT
resources are required. Some of them are listed below:
 Huge Hindi Corpus is required for the development
of Language Model
 SRILM for creating Language Model
 Dogri-Hindi Parallel Corpus required for the SRILM www-
development of Translation Model speech.sri.com/projects/srilm/d
 Word Alignment tool required for improving word ownload.html
alignment probability
GIZA++ http://www.fjoch.com/GIZA++.
 GIZA++ for creating Translation Model
html
 Moses decoder for Translation
 Morphological Analyzer and Generator for
handling OOV words. Moses http://www.statmt.org/moses/

3.6 Resources Available

The only work for the automatic translation done on Dogri is
the Hindi-Dogri machine translation developed using direct
approach of translation by Dr. Preeti Dubey et.al[9]. Therefore
there are hardly any resources available. Almost everything
has to be done from scratch.
Some required resources are available with various sources
which can be requested and acquired for use in this system.
The compatibility of these resources is doubtful and may
require modification. The detail of the available resources is
given:
4. CONCLUSION
This paper provides a brief introduction of how the statistical
machine translation system for Dogri-Hindi language pair
shall be developed. This system will be developed from
scratch as it is the first work where Dogri is the source
language. IT will promote Dogri literature and culture to the
world.

5. ACKNOWLEDGEMENT
My sincere thanks to Dr. Vishal Goyal, Assistant Professor,
Department of Computer Science, Punjabi University, for his
guidance.

340
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
REFERENCES
[1] WJohn Hutchins and Harold L Somers, (1992), “An
introduction to machine translation” London: Academic
Press, [ISBN: 0-12-362830-X]
[2] Hutchins, W. John , “Machine Translation: A Brief
History”, From: Concise history of the language sciences:
from the Sumerians to the cognitivists. Edited by
E.F.K.Koerner and R.E.Asher. Oxford: Pergamon Press,
1995. Pages 431-445
[3] Sneha tripathi, et.al, “Approaches to Machine
Translation”, Annals of Library & Information Studies,
vol 57, dec 2010, pp: 388-393
[4] Google,“Translator”,Translate in various languages,
http://translate.google.com/
[5] Sampark,”Machine Translation among indian languages”,
funded by TDIL program, department of information
technology, govt of india, http://sampark.iiit.ac.in
[6] Vishal Goyal, “Development of a Hindi to Punjabi
Machine Translation System”, PhD Thesis, Department
of Computer Science, Punjabi University, Patiala, 2010.
[7] Microsoft,” Translator in various languages text”,
http://www.microsofttranslator.com/
[8] Eilmt, “Machine Translation System from English to
Indian Languages in Tourism and Healthcare Domains “,
http://www.cdacmumbai.in/e-ilmt
[9] Unnikrishnan P et. al. (2010) “A Novel Approach for
English to South Dravidian Language Statistical
Machine Translation System”, (IJCSE) International
Journal on Computer Science and Engineering Vol. 02,
No. 08, 2749-2759.
341
ISBN: 978-81-924893-0-8
[10] Preeti Dubey, Shashi Pathania, Devanand, “Comparative
Study of Hindi and Dogri Languages with regard to
Machine Translation” , Language In India, Volume 11:10
October 2011,ISSN 1930-2940
[11] Preeti Dubey,Devanand. “Machine translation system for
Hindi-Dogri language pair”, IEEE Conference
(ICMIRA), Dec 2013,ISBN :978-0-7695-5013-8, pages
422-425
[12] Statistical Language Approach Translates into Success
Steven J. Vaughan-Nichols, Technology News,
November 2003.
[13] An Online Relevant Set Algorithm for Statistical
Machine Translation Christoph Tillmann and Tong
Zhang, IEEE Transactions on Audio Spech and
Language Processing, Vol. 16, NO. 7, September 2008.
[14] Lopez A,“Statistical machine translation”. ACM
Computing Survey, 40, 3, Article 8, 49 pages,2008
DOI = 10.1145/1380584.1380586
http://doi.acm.org/10.1145/1380584.1380586]
[15] Sanjay Kumar Dwivedi and Pramod Premdas
Sukhadeve,) “Machine Translation System in Indian
Perspectives”, Journal of Computer Science 6 (10):
ISSN 1549-3636 pp: 1082-1087,2010
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A brief study about evolution of Named Entity
Recognition
Varinder kaur
BGIET, Sangrur
varikhangura86@gmail.com
ABSTRACT
The objective of this research paper is to provide brief
overview on diverse conferences like MUC-6(Message
understanding conference), IREX, ACE (Automatic Content
Extraction) project, CoNLL-2002 and 2003, NERSSEAL
which contributed highly in the emergence of Named Entity
Recognition. All these conferences provided their own
guidelines for the evaluation of Named entity Recognition.
own to increase the system‟s performance. This paper reports
about the various approaches and methods proposed, domain
set, entity types and relevant features essential in Named
Entity Recognition system. It also includes the evaluation
procedure followed which is used for measuring the
performance metrics like recall, precision, F-score.
Keywords: Named Entity Recognition, ACE, CoNLL,
IREX, MUC-6
1. INTRODUCTION
1.1 Natural Language Processing:
It is a branch of artificial intelligence that deals with
analyzing, understanding and generating the languages that
humans use naturally in order to interface with computers
using natural human languages instead of computer
languages.
In the past decade, successful natural language processing
applications have become part of our everyday experience,
from spelling and grammar correction in word processors to
machine translation on the web and from email spam
detection to automate question answering and the very
upcoming research area named entity recognition.
1.2 Named Entity Recognition
A named entity (NE) is a phrase , which serves as a name for
something or someone (person, organization, location,
number, time, measure etc). According to this definition, the
phrase in question must by a noun phrase (NP). Clearly, not
all NPs are named entities.
Named entity Recognition (NER) (which might also be
called “proper name classification”) is a computational
linguistics task in which we classify every word in a
document as falling into some predefined categories: person,
location, organization, date, time, percentage, monetary
value and “none-of-the-above”. NER involves two tasks:
342
ISBN: 978-81-924893-0-8
Amandeep kaur Randhawa
BGIET, Sangrur
amehak07@gmail.com
identification of NPs that are NEs and classification of NEs
into different types, such as organization, location, person
names etc.
2. CONFERENCES ON NER
2.1 Message Understanding Conference -6:
The Message Understanding Conferences were initiated by
NOSC to assess and to foster research on the automated
analysis of military messages containing textual information.
It is designed to promote and evaluate research in information
extraction.
2.1.1 Early history
MUC-1 (1987) : In this, each group designed its own format
for recording the information in the document, and there was
no formal evaluation.
MUC-2 (1989), the task had crystallized as one of template
filling. One receives a description of a class of events to be
identified in the text; for each of these events one must fill a
template with information about the event.
MUC-3 (1991), the task shifted to reports of terrorist events in
Central and South America, as reported in articles provided by
the Foreign Broadcast Information Service, and the template
became somewhat more complex (18 slots).
MUC-4 (1992), same task is used with a further small increase
in template complexity (24 slots).
MUC-5 was the use of a nested template structure which
further increases the task complexity.
MUC-6: The first goal was to identify, from the component
technologies being developed for information extraction,
functions which would be of practical use, would be largely
domain independent, and could in the near term be performed
automatically with high accuracy.
To meet this goal the committee developed the \named entity"
task, which basically involves identifying the names of all the
people, organizations, and geographic locations in a text. The
final task specification, which also involved time, currency,
and percentage expressions, used SGML markup to identify
the names in a text. Figure 1 shows a sample sentence with
named entity annotations. The tag ENAMEX (\entity name
expression") is used for both people and organization names;
Mr.<ENAMEX
TYPE="PERSON">Dooner</ENAMEX> met with
2.1.2 MUC evaluations TYPE="PERSON">Martin
<ENAMEX
Puris</ENAMEX>, president and chief executive
officer of <ENAMEX
TYPE="ORGANIZATION">Ammirati &
Puris</ENAMEX>, about <ENAMEX
TYPE="ORGANIZATION">McCann</ENAMEX>'s
acquiring the agency with billings of <NUMEX
TYPE="MONEY">$400 million</NUMEX>, but
nothing has materialized.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
In MUC events, a system is scored on two axes: its ability to
find the correct type (TYPE) and its ability to find exact text
(TEXT). A correct TYPE is credited if an entity is assigned
the correct type, regardless of boundaries as long as there is an
overlap. A correct TEXT is credited if entity boundaries
are correct, regardless of the type.
For both TYPE and TEXT, three measures are kept:
 the number of correct answers (COR)
 the number of actual system guesses (ACT)
 the number of possible entities in the solution
(POS).
The final MUC score is the micro-averaged f-measure (MAF),
which is the harmonic mean of precision and recall calculated
over all entity slots on both axes. A micro-averaged measure
is performed on all entity types without distinction (errors and
Successes for all entity types are summed together). The
harmonic mean of two numbers is never higher than the
geometrical mean. It also tends toward the least number,
minimizing the impact of large outliers and maximizing the
impact of small ones. The F measure therefore tends to
privilege balanced systems.
In MUC, precision is calculated as COR / ACT and the recall
is COR / POS. For
the previous example, COR = 4 (2 TYPE + 2 TEXT), ACT =
10 (5 TYPE + 5 TEXT)
POS = 10 (5 TYPE + 5 TEXT). The precision is therefore
40%, the recall is 40% and the MAF is 40%.
This measure has the advantage of taking into account all
possible types of errors. It also gives partial credit for errors
occurring on one axis only. Since there are two evaluation
axes, each complete success is worth two points. The worst
errors cost this two points (missing both TYPE and TEXT)
while other errors cost only one point.
2.2 IREX: IR and IE Evaluation project in
Japanese
The main goal is to have a common platform in order to
evaluate systems with the same standard. We believe such
projects are useful not only for comparing system
performance but also to address the following issues:
• To share and exchange problems among researchers.
• To accumulate large quantities of data.
• To let other people know the importance and the quality of
Information Retrieval and Information Extraction techniques.
• To attract young researchers into the field.
To start a long term and larger-size project of this kind.
2.2.1 Tasks in IREX
Information Retrieval task (IR)
IR is the task of retrieving documents relevant to a given topic
from a database of newspaper articles. Each topic is expressed
by a description using a few noun phrases and a narrative
using a few sentences.
Named Entity task (NE)
NE is the task to extract Named Entities, such as names of
organizations, persons, locations, and artifacts, time and
numeric expressions, money and percentage expressions.
There are 8 kinds of NE‟s
343
ISBN: 978-81-924893-0-8
2.3 Automatic Content Extraction (ACE)
Program
The objective of the ACE program is to develop technology
to automatically infer from human language data the entities
being mentioned, the relations among these entities that are
directly expressed, and the events in which these entities
participate. Data sources include audio and image data in
addition to pure text, and Arabic and Chinese in addition to
English.
2.3.1 Task Definitions
The Automatic Content Extraction (ACE) program, a new
effort to stimulate and benchmark research in information
extraction, presents four challenges:
1. Recognition of entities, not just names. In the ACE entity
detection and tracking (EDT) task, all mentions of an
entity, whether a name, a description, or a pronoun, are
to be found and collected into equivalence classes based
on reference to the same entity. Therefore, practical co-
reference resolution is fundamental.
2. Recognition of relations. The relation detection and
characterization task (RDC) requires detection and
characterization of relations between (pairs of) entities.
There are five general types of relations, some of which
are further sub-divided, yielding a total of 24
types/subtypes of relations:
•Role, the role a person plays in an organization, which
can be sub typed as Management, General-Staff,
Member, Owner, Founder, Client, Affiliate-Partner,
Citizen-Of, or Other,
•Part, i.e., part-whole relationships, sub typed as
Subsidiary, Part-Of, or Other,
•At, location relationships, which can be sub typed
Located, Based-In, or Residence,
•Near, to identify relative locations and
•Social, sub typed as Parent, Sibling, Spouse,
Grandparent, Other-Relative, Other-Personal,
Associate, or Other-Professional.
3. Event extraction. Though not in any previous ACE
evaluation, event detection and characterization is
planned for the 2004 evaluation (August-September,
2004). Details of the task definition, annotation
guidelines, and scoring are being worked out at the time
of writing this paper.
4. Extraction is measured not merely on text, but also on
speech and on OCR input. Moving beyond name finding
is a crucial leap for modalities other than text, since the
ability to relate two strings (as in ACE) in very noisy
input may degrade much more than finding strings in
isolation (as in named entity recognition.) Furthermore,
the lack of case and punctuation, including the lack of
sentence boundary markers, poses a challenge to full
parsing of speech.
2.3.2 ACE evaluation
ACE has a complex evaluation procedure. It includes
mechanisms for dealing various evaluation issues (partial
match, wrong type, etc.). The ACE task definition is also
more elaborated than previous tasks at the level of named
entity “subtypes”, “class” as well as entity mentions
(coreferences), and more, but these supplemental elements
will be ignored here.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Basically, each entity type has a parameterized weight and 2.4.2 Results
contributes up to a maximal proportion (MAXVAL) of the
final score (e.g., if each person is worth 1 point Twelve different systems have been applied to data covering
and each organization is worth 0.5 point then it takes two two western languages: Spanish and Dutch
organizations to counterbalance one person in the final score).
Some entity types such as “facility” may account for as Spanish test precision Recall f-score
little as 0.05 points, according to ACE parameters. In
addition, customizable costs (COST) are used for false Carreras et. 81.38% 81.40% 81.39
alarms, missed entities and type errors. Partial matches of al.
textual spans are only allowed if named entity head matches Florian 78.70% 79.40% 79.05
on at least a given proportion of characters. Temporal
expressions are not treated in ACE . Cucerzan et. 78.19% 76.14% 77.15
The final score called Entity Detection and Recognition Value al.
(EDR) is 100% minus the penalties. Wu et. al. 75.85% 77.38% 76.61
ACE evaluation may be the most powerful evaluation scheme
because of its customizable cost of error and its wide coverage Burger et. al. 74.19% 77.44% 75.78
of the problem. It is however problematic because the final Tjong sim 76.00% 75.55% 75.78
scores are only comparable when parameters are fixed. In sang
addition, complex methods are not intuitive and make error Patrick et.al. 74.32% 73.52% 73.92
analysis difficult.
Jansche 74.03% 73.76% 73.89
2.4 CoNLL-2002 shared task: language Malouf 73.93% 73.39% 73.66
dependent NER
Tsukamoto 69.04% 74.12% 71.49
Named entities are phrases that contain the names of persons,
Black et.al. 60.53% 67.29% 63.73
Locations, organizations, times and quantities. In this, it
consider four entities persons, locations, organizations, McNamee 56.28% 66.51% 60.97
miscellaneous .The participants of shared task have been et. al.
offered training and test data in Spanish and Dutch language. Baseline 26.27% 56.48% 35.86
They will use the data for developing a named-entity
recognition system that includes a machine learning
component. Information sources other than the training data Dutch test precision Recall f-score
may be used in this shared task.
Carreras et. 77.83% 76.29% 77.05
al.
2.4.1 Data evaluation
Wu et. al. 76.95% 73.83% 75.86
The data consists of two columns separated by a single space.
Each word has been put on a separate line and there is an Florian 75.10% 74.89% 74.99
empty line after each sentence. The first item on each line is a
word and the second the named entity tag. The tags have the Burger et. al. 72.69% 72.45% 72.57
same format as in the chunking task: a B denotes the first item Cucerzan et. 73.03% 71.62% 72.31
of a phrase. There are four types of phrases: person names al.
(PER), organizations (ORG), locations (LOC) and Patrick et.al. 74.01% 68.90% 71.36
miscellaneous names (MISC). Here is an example:
Tjong sim 72.56% 68.88% 70.67
DATA TAG
sang
Wolff B-PER
Jansche 70.11% 69.26% 69.68
, O
currently O Malouf 70.88% 65.50% 68.08
a O
journalist O Tsukamoto 57.33% 65.02% 60.93
in O
McNamee 56.22% 63.24% 59.52
small O
et. al.
company ORG
Black et.al. 62.12% 51.69% 56.43
of O
china LOC Baseline 64.38% 45.19% 53.10

The data consists of three files per language: one training file
and two test files testa and testb. The first test file will be used
in the development phase for finding good parameters for the
learning system. The second test file will be used for the final
Evaluation. The Spanish data is a collection of news wire
articles made available by the Spanish EFE News Agency.
The Dutch data consist of four editions of the Belgian
newspaper "De Morgen" of 2000 (June 2, July 1, August 1
and September 1)
Here are some remarks on these results:
 The baseline results have been produced by a system
which only selects complete named entities which appear
in the training data.
 The system performs worse than the baseline system
when processing the Dutch data because the authors used

344
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
a poor representation of the data. They had removed all
sentence breaks.
2.5 Named Entity Recognition in Indian
Languages
Hybrid NER system for Indian languages which is designed
for the IJCNLP NERSSEAL shared task competition, the goal
of which is to perform NE recognition on 12 types of NEs -
person, designation, title-person, organization, abbreviation,
brand, title-object, location, time, number, measure and term.
In this, shared task was defined to build the NER systems for
5 Indian languages - Hindi, Bengali, Oriya, Telugu and Urdu
for which training data was provided.
The workshop included two tracks. The first track was for
regular research papers, while the second was organized on
the lines of a shared task.
2.5.1 Previous Work
A variety of techniques has been used for NER. The
two major approaches to NER are:
1. Linguistic approaches.
2. Machine Learning (ML) based approaches.
The linguistic approaches typically use rules manually written
by linguists. There are several rule based NER systems,
containing mainly lexicalized grammar, gazetteer lists, and
list of trigger words, which are capable of providing 88%-
92% f-measure accuracy for English.
ML based techniques for NER make use of a large amount of
NE annotated training data to acquire high level language
knowledge. Several ML techniques have been successfully
used for the NER task of which Hidden Markov Model
(HMM), Maximum Entropy (MaxEnt), Conditional Random
Field (CRF) are most common. Combinations of different ML
approaches are also used.
2.5.2 Maximum Entropy Based Model
This model is used to build the baseline NER system. MaxEnt
is a flexible statistical model which assigns an outcome for
each token based on its history and features.
2.5.3 Features
In the following it discussed about the features which
identified and used to develop the Indian language NER
systems:-
Static Word Feature: The previous and next words of a
particular word are used as features.
Context Lists: Context words are defined as the
frequent words present in a word window for a particular
class.
Dynamic NE tag: Named Entity tags of the previous words
(ti−m...ti−1) are used as features.
First Word: If the token is the first word of a
sentence, then this feature is set to 1. Otherwise, it is set to 0.
Contains Digit: If a token „w‟ contains digit(s)
then the feature ContainsDigit is set to 1.
Word Suffix: Word suffix information is helpful to identify
the NEs.
345
ISBN: 978-81-924893-0-8
Word Prefix: Prefix information of a word may
also be helpful in identifying whether it is a NE.
Root Information of Word: Indian languages
are morphologically rich. Words are inflected in various
forms depending on its number, tense, person, case etc. The
task becomes easier if instead of the inflected words,
corresponding root words are checked whether these are NE t
Parts-of-Speech (POS) Information: The POS of the current
word and the surrounding words may be useful feature. The
POS information is also used by defining several binary
features. An example is the NomPSP binary feature. The
value of this feature is defined to be 1 if the current token is
nominal and the next token is a PSP.
2.5.4 Annotation Constraints
The annotated corpus was created under severe constraints.
The annotation was to be for five languages by different
teams, sometimes with very little communication during the
process of annotation. As a result, there were many logistical
problems. There were other practical constraints like the fact
that this was not a funded project and all the work was mainly
voluntary. Another major constraint for all the languages
except Hindi was time. There was not enough time for cross
validation as the corpus was required by a deadline.
2.5.5 Evaluation Measures
As part of the evaluation process for the shared task,
precision, recall and F-measure had to be calculated for three
cases: maximal named entities, nested named entities and
lexical matches. Thus, there were nine measures of
performance:
• Maximal Precision: Pm = cm/ rm
• Maximal Recall: Rm = cm/ tm
• Maximal F-Measure: Fm = 2∗Pm∗Rm/ Pm+Rm
• Nested Precision: Pn = cn/ rn
• Nested Recall: Rn = cn/ tn
• Nested F-Measure: Fn = 2PnRn/ Pn+Rn
• Lexical Precision: Pl = cl/ rl
• Lexical Recall: Rl = cl/ tl
• Lexical F-Measure: Fl = 2PlRl/ Pl+Rl
where c is the number of correctly retrieved (identified)
named entities, r is the total number of named entities
retrieved by the system being evaluated (correct plus
incorrect) and t is the total number of named entities in the
reference data. The participants were encouraged to report
results for specific classes of NEs.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2.5.5 Results

Table 1: Results for the experiments on a baseline for the five South Asian languages

Measure Precision Recall F- measure

Language F
Pm Pn Pl Rm Rn Rl Fm Fn

Bengali 50.00 44.90 52.20 07.14 06.90 06.97 12.50 11.97 12.30
Hindi 75.05 73.61 73.99 18.16 17.66 15.53 29.24 28.48 25.68
Oriya 29.63 27.46 48.25 07.60 12.18 09.11 13.94 11.91 19.44
Telugu 00.89 02.83 22.85 00.20 00.67 5.41 00.32 01.08 08.75
Urdu 47.14 43.50 51.72 18.35 16.94 18.94 26.41 24.39 27.73
m: maximal; n: nested ; l: lexical

Table 2: Baseline results for specific named entity classes (F-Measures for nested lexical match)
Bengali Hindi Oriya Telugu Urdu

NEP 06.62 26.23 28.48 00.00 04.39

NED 00.00 12.20 00.00 00.00 00.00
NEO 00.00 15.50 03.30 00.00 11.98
NEA 00.00 00.00 00.00 00.00 00.00
NEB NP NP 00.00 00.00 00.00
NETP 00.00 NP 11.62 00.00 00.00
NETO 00.00 05.92 04.08 00.00 00.00
NEL 03.03 44.79 25.49 00.00 40.21
NETI 34.00 47.41 22.38 01.51 38.38
NEN 62.63 62.22 10.65 03.51 09.52
NEM 13.61 24.39 08.03 00.71 07.15
NETE 00.00 00.18 00.00 00.00 00.00
NP: Not present in the reference data

3. Comparisons of multifarious methods by

some factors
3.1 Language factor
German is well studied in CONLL-2003 and in earlier
works. Similarly, Spanish and Dutch are strongly
represented, boosted by a major devoted conference:
CONLL-2002.Japanese has been studied in the MUC-6
conference, the IREX conference and other work.
Moreover, Arabic, Chinese with English also studied in
ACE project.
3.2 Domain factor
MUC-6 collection composed of newswire texts, and on a
proprietary corpus made of manual translations of phone
conversations and technical emails. For ACE project, data
is collected from web which composed of text, audio and
video.
3.3 Entity type factor
In the ACE program, the type “facility” subsumes
entities of the types “location” and “organization”. The
type “GPE” is used to represent a location which has a
government, such as a city or a country.

346
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The type “miscellaneous” is used in the CONLL Applications (0975 – 8887),2010, Volume 1 – No. 3,
conferences and includes proper names falling outside pages 119-122.
the classic “enamex”. The class is also sometimes [12] K. S. Hasan and Md. A. R. and V. Ng, “Learning Based
augmented with the type “product” (e.g., E. Bick 2004). Named Entity Recognition for morphologically resource
The “timex” (another term coined in MUC) types “date” scarce languages”, In Proc. Of the 12th Conf. of the
and “time” and the “numex” types “money” and European Chapter of the Association for Computational
“percent” are also quite predominant in the literature. Linguistics (EACL), pp. 354-362, March 2009, Athens,
Greece.
4. CONCLUSION [13] K. Church. “A stochastic parts program and noun phrase
In this paper, we covered diverse conferences like MUC-6, parser for unrestricted text”, In Proc. Of the 2nd conf. on
IREX, ACE, CoNLL-2002 and 2003 which includes the applied natural language processing, pp., 136-143, 1988,
different procedures set for the evaluation of NER system Association for Computational Linguistics Publishers,
performance. By addressing all aspects of conferences, we Austins, Texas.
also make their comparisons based on some factors like [14] Tom M. Mitchell, The Role of Unlabeled Data in
language, domain set and entity type. Supervised Learning. In Proceedings of the Sixth
International Colloquium on Cognitive Science, San
Sebastian, Spain, 1999.
REFERENCES [15] Andrei Mikheev, Marc Moens and Claire Grover, Named
Entity Recognition without Gazetteers, In Proceedings of
[1] Mohammad Hasanuzzaman, Asif Ekbal and Sivaji EACL'99, Bergen, Norway, 1999, pp. 1-8.
Bandyopadhyay , Maximum Entropy Approach for [16] Michael Collins and Yoram Singer, Unsupervised
Named Entity Recognition in Bengali and Hindi , models for named entity classification. In Proceedings of
International Journal of Recent Trends in Engineering, the 1999 Joint SIGDAT Conference on Empirical
Vol. 1,No.1, May 2009. Methods in Natural Language Processing and Very
[2] David Nadeau, Satoshi Sekine, A survey of named entity Large Corpora, University of Maryland, MD, 1999.
recognition and classification.
[2] Satoshi Sekine, Hitoshi Isahara, IREX: IR and IE
Evaluation project in Japanese.
[3] George Doddington, Alexis Mitchell, Mark Przybocki,
Lance Ramshaw, Stephanie Strassel, Ralph Weischedel,
The Automatic Content Extraction (ACE) Program
Tasks, Data, and Evaluation.
[4] Sujan Kumar Saha, Sanjay Chatterji, Sandipan Dandapat
Sudeshna, Sarkar Pabitra Mitra, A Hybrid Approach for
Named Entity Recognition in Indian Languages. In
Proceedings of the IJCNLP-08 Workshop on NER for
South and South East Asian Languages, pages 17–24.
[5] Erik F. Tijong Kim Sang, Introduction to the CoNOLL-
2002 shared task: language independent named entity
recognition, CNTS- Language Technology Group.
[6] Erik F. Tijong Kim Sang, Fien De Meulder, Introduction
to the CoNOLL-2003 shared task: language independent
named entity recognition, CNTS- Language Technology
Group.
[7] Mohammad Hasanuzzaman, Asif Ekbal and Sivaji
Bandyopadhyay , “Maximum Entropy Approach for
Named Entity Recognition in Bengali and Hindi” ,
International Journal of Recent Trends in Engineering,
Vol. 1,No.1, May 2009.
[8] Thoudam Doren Singh , Kishorjit Nongmeikapam, Asif
Ekbal and Sivaji Bandyopadhyay “Named Entity
Recognition for Manipuri Using Support Vector
Machine” In Proc. of 23rd Pacific Asia Conference on
Language, Information and Computation, pages 811–
818.
[9] Asif Ekbal , Sivaji Bandyopadhyay “Named Entity
Recognition in Bengali: A Multi-Engine Approach” ,
Northern European Journal of Language Technology,
2009, Vol. 1, Article 2, pp 26–58.
[10] Asif Ekbal , Sivaji Bandyopadhyay “Named Entity
Recognition using support vector machine: A language
independent approach” , Int. J. of electrical and
electronics engineering, 2010, Vol4, Issue2.
[11] Sobhana N.V, Pabitra Mitra, S.K. Ghosh, “Conditional
Random Field Based Named Entity Recognition in
Geological Text”, International Journal of Computer

347
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Comparison between PID, fuzzy, genetic algorithm and

particle swarm optimization soft computing techniques
Rakesh Kumar Nishant Nakra
Assistant Prof. Assistant Prof.
Department of Electrical Engineering Department of Electrical Engineering
B.H.S.B.I.E.T. Lehragaga B.H.S.B.I.E.T. Lehragaga.
rkd5975@gmail.com

ABSTRACT Significant studies based on the closed-form analysis of fuzzy

The goal of this work is to make a comparison between PID, PID-like controllers started with the work of Ying, Siler, and
fuzzy, genetic algorithm and particle swarm optimization soft Buckley, where they have used a simple four-rule
computing techniques in the case of linear dynamic process controller similar to that of Murakami and Maeda, More
control systems. This comparative study is made using analytical work in this regard was subsequently reported for
computer simulation. In this work, the main objective of the the four-rule controllers, and linear-like fuzzy controllers.
investigator is to compare the performances of various
Palm has analytically demonstrated the equivalence between
controllers using various soft computing techniques for the
tuning of their parameters. For this comparison of various the fuzzy controller and sliding-mode controllers.
system the performance parameters i.e. Steady-state error,
rise time, overshoot, settling time, gain margin, phase margin
etc. are proposed to be evaluated. PID Controller is important
part in industrial plants and control engineering because it is
simple and robust. The proportional integral derivative (PID)
controllers are widely applied in industrial process owing to
their simplicity and effectiveness for both linear and nonlinear
systems. Comparison of time domain and frequency domain
characteristic such as: rise time and settling time, over shoot,
steady state error, gain margin and phase margin etc. of
controlled process/systems using various soft computing
techniques. The second part of this paper is a description of a
simulated system, and a presentation of simulated controllers.
In the second part, fuzzy controller isexamined in details. A
sensitivity of the fuzzy logic controllerto design parameters,
different shapes and superposition of membership functions,
Fig. 1. Fuzzy Control System
is tested. Moreover, the simulations are done for the different
types of fuzzy reasoning and defuzzification methods. A block diagram of a fuzzy control system is shown in
Figure1. The fuzzy controller is composed of the following
elements:
Keywords: Process plants, Steam temperature
control, Industrial system, Multi objective a. A fuzzification interface, which converts controller inputs
control; Optimal-tuning; PID control Fuzzy logic into information that the inference mechanism can easily use
to activate and apply rules. Shapes of membership functions
control, genetic algorithms, nonlin-ear control, are the triangular, trapezoidal and bell, but the shape is
optimal control, PID control, PID controller tuning generally less important than the number of curves and
using GA, PSO and Fuzzy logic. placement. From 3 to 7 curves are generally enough to cover
the intended range of an input value.
1. INTRODUCTION
b. A rule-base (a set of If-Then rules), which contains a fuzzy
Well-known proportional-integral-derivative PID controller is logic quantification of the expert’s linguistic description of
the most widely used in industrial application because of its how to achieve good control. In other word, the rule base is
simple structure. On the other hand conventional PID derived from an “inference engine” or “fuzzy inference”
controllers with fixed gains do not yield reasonable module, which emulates the expert’s decision making in
performance over a wide range of operating conditions and interpreting and applying knowledge about how best to
systems (time-delayed systems, nonlinear systems, etc.). A control the plant. The processing stage is basically a group of
wide variety of fuzzy PID-like controllers have been logic rules in the form of IF-THEN statements, where the IF
developed. In most cases, fuzzy controller design is accom- part is called the "antecedent" and the THEN part is called the
plished by trial-and-error methods using computer simulations. “consequent".

348
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
This Paper is an attempt to make a comparison between PID,
fuzzy, genetic algorithm and particle swarm optimization soft
computing techniques in the case of linear dynamic process
control systems. We propose a new methodology for the
optimal design of fuzzy PID controllers. In the proposed work
the main objective of the investigator is to compare the
performances of various controllers ie comparison of time
domain and frequency domain characteristic such as: rise
time and settling time, over shoot, steady state error, gain
margin and phase margin etc. of controlled process/systems
using various soft computing techniques.
2. FUZZY LOGIC – A BRIEF HISTORY
Fuzzy logic, invented by LotfiZadeh in the mid 1960s
provides a representation scheme and a calculus for dealing
with vague or uncertain concepts. It is a paradigm for an
alternative design methodology which can be applied in
developing linear and non- linear systems for embedded
control. Zadeh originally devised the technique as a means for
solving problems in the soft sciences, particularly those that
involved interactions between humans, and/or between
humans and machines [6]. Since then there has been rapid
developments of the theory and application of Fuzzy logic to
control systems. Fuzzy logic controllers are being increasingly
applied in areas where system complexities, development time
and costs are the major issues [7].In Japan, Terano, inspired
by Zadeh’s work introduced the idea to the research
community in about 1972. This led toactive research and a
host of commercial applications, almost entirely in the area of
physical system control. In 1990 research institute namely
LIFE (Laboratory for International Fuzzy Engineering) started
functioning under the leadership of Terano [6]. The Japanese
researchers have been a primary force in advancing the
practical implementation of Fuzzy theory and now have more
than 2000 patents in the area.
3. BASIC NOTIONS OF FUZZY LOGIC
3.1. Fuzzy set
General definition of a set is that a set is a collection of
objects distinct and perfectly specified [Kaufmann88]. A part
of a set is a subset. For example, let E is a finite referential
set:
E = {a, b, c, d, e}
We can form a crisp subset of E, for example:
A = {b, d, e}
If we present it in the other form:
A = 0 1 01 1
abcde
349
ISBN: 978-81-924893-0-8
In the classical set theory one element can either belong to a
set, or not. This property can be represented by a degree of
membership. In the case shown before, the element b belongs
to A, and its degree of membership is 1. The element a
doesn’t belong to A and its membership is 0. We can form a
function which represents this property:
A x 1 if x A
0 if' x A
This concept is basic in the classical set theory. The main
concept of fuzzy theory is a notion of fuzzyset. Fuzzy set is
an extension of crisp set. Zadeh [Zadeh65] gave the following
definition:
A fuzzy set is a class of objects with a continuum of grades of
membership. Such a set is characterized by a membership
(characteristic) function which assigns to each object a grade
of membership ranging between zero and one.
4. GENETIC ALGORITHM
Genetic Algorithms are a stochastic global search method that
mimics the process of natural evolution. It is one of the
methods used for optimization. John Holland formally
introduced this method in the United States in the 1970 at the
University of Michigan. The continuing performance
improvement of computational systems has made them
attractive for some types of optimization. The genetic
algorithm starts with no knowledge of the correct solution and
depends entirely on responses from its environment and
evolution operators such as reproduction, crossover and
mutation to arrive at the best solution. By starting at several
independent points and searching in parallel, the algorithm
avoids local minima and converging to sub optimal solutions.
5. PARTICLE SWARM OPTIMIZATION
PSO is one of the optimization techniques and kind of
evolutionary computation technique .The technique is derived
from research on swarm such as bird flocking and fish
schooling. In the PSO algorithm, instead of using evolutionary
operators such as mutation and crossover to manipulate
algorithms, for a d-variable optimization Problem, a flock of
particles are put into the d-dimensional Search space with
randomly chosen velocities and positions knowing their best
values. So far (p best) and the position in the d-dimensional
space [9].
The velocity of each particle, adjusted accordingly to its own
flying experience and the other particles flying experience [9].
For example, the ith particle is represented, as
xi=(xi,1,xi,2,……….,xi,d) ....(1)
In the d-dimensional space. The best previous position of the
ith particle is recorded as,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Pbesti=(Pbesti,1,Pbesti,2······, Pbesti,d) ---(2)  Analysis of the system performance.

 Comparison of time domain and frequency domain

characteristic such as: rise time and settling time,
The index of best particle among all of the particles in the over shoot, steady state error, gain margin and phase
group in g best d .The velocity for particle i is represented as margin etc. of controlled process/systems using
various soft computing techniques.
Vi = ( Vi,1,Vi,2 ,…….Vi,d ) ----- (3)
7. SOME UNIQUE PROBLEMS IN AGRO
The modified velocity and position of each particle can be INDUSTRIES
calculated using the current velocity and distance from
Managing the properties of oil starting from the input stage
Pbesti,d to g bestd as shown in the following formulas. with the aim of controlling them is not an easy task for several
reasons.
Vi,m(t+1) = W. Vi,m(t) + c1 * rand () * (P besti,m - xi,m(t) )
 There are many parameters in Agro industry that
+c2 * Rand () * (g best m – xi,m(t) ) ………(4)xi,m(t+1) must be taken into consideration inparallel. A single
sensory property like color or texture can be linked
= xi,m(t) + Vi,m(t+1)
individually toseveral dimensions recorded by the
human brain.
i = 1 , 2, .... , n  The Agro industry works with non-uniform,
variable raw materials that, whenprocessed, should
m = 1 , 2, ..... , d shaped into a product that satisfies a fixed standard.
 The process control in agro industry are highly non-
Where linear and variables are coupled.
 Little data are available in traditional manufacturing
n= Number of particles in the group plants that produce, for example,sunflower oil or
rice bran and this situation is applies to most Agro
d = dimension processing industry.
 In addition to the temperature changes during a
t = Pointer of iterations (generations) heating or cooling process, there arebiochemical
(nutrient, color, flavor, etc.) or microbial changes
that should be considered.
Vi,m(1) = Velocity of particle I at iteration t
 The moisture in oil is constantly fluctuating either
loss or gain throughout the processwhich can affect
W= Inertia weight factor
the flavor, texture, nutrients concentration and other
properties.
c1, c2 = Acceleration constant  Other properties of oil such as density, thermal and
electrical conductivity, specificheat, viscosity,
rand()=Random number between 0 and 1 permeability, and effective moisture diffusivity are
often a function ofcomposition, temperature, and
xi,m(t) = Current position of particle i at iterations moisture content, and therefore keep changing
duringthe process.
Pbesti = Best previous position of the ith particle  The system is also quite non-homogeneous. Such
detailed input data are not available.
gbestm =Best particle among all the particles in the  Often, irregular shapes are present.
population.

6. PLAN OF WORK AND RESEARCH 8. SIMULATION RESULTS

METHODOLOGY
The proposed work will be carried out by adopting the
following step by step methodology:
 Detailed Literature Survey of various tuning
methods of PID controller.
 Collection of real time data of PID constants and
Temperature, Pressure, level and Flow etc. in
Process industries.
 Implementation of PID controller tuning using GA,
PSO and Fuzzy logic.
Oil Tank Temprature Controller
This PID temprature controller is used to control the
temprature of raw oil in oil tank. In this controller the set
value of temprature is 125 degres and PID controller reaches
the set value in a period of 3 hours 35 minutes.
Fuzzy model was developed using error, change in error and
fuzzy output to improve the time domain and frequency
domain characteristic such as: rise time and settling time,
over shoot, steady state error, gain margin and phase margin

350
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

etc. of controlled process/systems using various soft Very Large (VL) 115 121 125
computing techniques.

Table 1.
Fuzzy system, for flow controller To develop Fuzzy controller, firstly error signal(e)is
Membership functions of Error input.
calculated by subtracting output of PID temperature controller
Membership function for Error from set temperature then change in error(∆e) was calculated
by subtracting previous error from current error. Considering
Initial Peak Final error and change in error as input and fuzzified output as
Linguistic variable output function membership functions are created for each
value value value
input and output. Membership functions for these quantities
Very Small (VS) -0.03 -0.02 -0.01 are defined as in above Table 1. The membership functions
are shown in schematic form in Fig. 2.
Small (S) -0.02 -0.01 0

Medium (M) -0.01 0 0.01

High (H) 0 0.01 0.02

Very High (VH) 0.01 0.02 0.03

Membership functions of Change in Error input.

Membership function for Change in Error

(a) Membership functions of Error input.
Initial Peak Final
Linguistic variable
value value value

Very Small (VS) -1.5 -1 -0.5

Small (SM) -1 -0.5 0

Medium (MD) -0.5 0 0.5

Large (L) 0 0.5 1 (b) Membership functions of Change in Error input.

Very Large 0.5 1 1.5

Membership functions of Fuzzy output.

Membership function for Fuzzy Output

Initial Peak Final

Linguistic variable (c) Membership functions of Fuzzy output.
value value value
Fig.2. Fuzzy system, for oil tank temperature
Very Small (VS) 30 45 60 controller

Small (S) 45 62 80
A rule base was developed for the fuzzy model using simple
Medium (M) 65 82 100 IF-THEN rules.

Large (L) 90 105 122

351
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

respectively. Now a rule-base has been developed for the

fuzzy model using simple IF-THEN rules. On the basis of this
rule base a fuzzified output is calculated.

The rule base is summarized as in Table 2

Table 2 Rule base

Fuzzy output (Fz) Change in Error (∆e)

Error(e) N SM M L
This Fuzzy model is simulated in MATLAB fuzzy logic
VS VL VL VL - toolbox GUI, and results are obtained. Then results are plotted
along with the actual temperature and set temperature
S VL VL VL - obtained from the process, are plotted in Fig.3.

M VL L L -

H - - - -

VH N SM SM -

Fig.3. Response curve of PID Vs Fuzzy flow controller in

oil tank

Red graph shows the fuzzy output of fuzzy model of oil

tank temperature controller, black line represent the output of
PID temperature controller and blue line represent the set
value of temperature controller. Fuzzy output possesses some
oscillations. Improvements have been made by revising the
membership functions by revising the rule-base as shown in
Table. The rule base is also revised as shown in Table 3. By
using this rule base, oscillations in fuzzy response decreases
and steady state error were also reduced than the last fuzzy
model.

Table 3 New Improved Rule base

Membership function for Error

Error input has five membership functions and the change in Initial Peak Final
Linguistic variable
error and fuzzy output also has five membership functions value value value

352
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Very Small (VS) -0.03 -0.02 -0.01 S VL VL VL -

Small (S) -0.02 -0.01 0 M VL L L -

Medium (M) -0.01 0 0.01 H - - - -

High (H) 0 0.01 0.02 VH N SM SM -

Very High (VH) 0.01 0.02 0.03

Here the steady state error is decreased and settling time also
improved It is observed from Fig.4.that the oscillations are
Membership function for Change in Error reduced and steady state error is also reduces. Settling time is
also found to be improved. . Further improvements in Fuzzy
Initial Peak Final output and rule base have been made. To achieve this
Linguistic variable requirement, the range of last two membership function of
value value value
fuzzy output has been changed.
Very Small (VS) -1.5 -1 -0.5

Small (S) -1 -0.5 0

Medium (M) -0.5 0 0.5

High (H) 0 0.5 1

Very High (VH) 0.5 1 1.5

Fig.4. Improved Response curve of PID flow controller Vs

Fuzzy flow controller.
Membership function for fuzzy output
CONCLUSIONS
Initial Peak Final
Linguistic variable
value value value PID controller cannot be applied with the systems which have
a fast change of parameters, because it would require the
Very Small (VS) 30 45 60 change of PID constants in the time. The fuzzy based
controller gives the best performance, but the control engineer
Small (S) 45 62 80 faces different kind of challenges to design such a controller.
Expected conclusions of proposed research are that designing
Medium (M) 65 82 100 of PID controller using various soft computing techniques:

High (H) 90 105 122  Would dramatically improve the steady state and
transient response of the system.
 Overshoot, Rise time and settling time of system
Very High (VH) 115 121 125 response would be reduced in magnitude So production
can surely be increased by adopting such intelligent
controllers.
 Would prove suitable for controlling various process
The MATLAB simulation results are plotted along with the parameters such as: temperature, pressure, level and flow
actual temperature and set temperature obtained from the etc in process industries and would be more efficient and
process, are plotted in Fig.4. effective.

Fuzzy output (Fz) Change in Error (∆e)

REFERENCES
Error(e) N SM M L
[1] Hyung-Soo Hwang, Jeong-Nae Choi“ A Tuning
Algorithm for The PID Controller Utilizing Fuzzy
VS VL VL VL - Theory”Wonkwang University, IEEE Transactions on
Fuzzy System, pp.2210-2215,1999.

353
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[2] F.Karray, W.Gueaieb,“soft computing techniques as

applied to expert tuning of pid controllers”Greece,
Proceedings of the 15th IEEE international Symposium on
Intelligent Control, pp.91-96, 17-19 July2000.

[3]Dong Hwa Kim,“Comparison of PID Controller Tuning of

Power Plant Using Immune and Genetic Algorithms”
Proceedings of the IEEE International Symposium on
Computational Intelligence for Measurementsand
Applications, Ligano, Switzerland,pp.169-174, 29-31 July
2003.

[4]Andrey Popov, Adel Farag and Herbert Werner, “Tuning

of a PID controller Using a Multi-objective Optimization
Technique Applied to A Neutralization Plant” Proceedings of
the 44th IEEE Conference on Decision and Control, Spain,
pp.7139-7143,12-15 December 2005.

[5] Zhenyu Yang, “Automatic Tuning of PID Controller for a

1-D Levitation System Using a Genetic Algorithm - A Real
Case Study”Proceedings of the 2006 IEEE International
Symposium on Intelligent Control Munich,
Germany,pp.3098-3103 October 4-6, 2006.

[6] Tae-Hyoung Kim, Ichiro Maruta and Toshiharu Sugie ,

“Particle Swarm Optimization based Robust PID Controller
Tuning Scheme” Proceedings of the 46th IEEE Conference on
Decision and Control New Orleans, LA, USA,pp.200-205,
Dec. 12-14, 2007.

[7] J.L. CalvoRolle, “Developed an expert system of an

empirical method to choose correct expressions for PID
controllers tuning in open loop” Proceedings of the IEEE
Conference on expert system, pp.2044-2049, 2009.

[8] M. Sridhar, K.Vaisakh, “Adaptive PSO Based Tuning of

PID- Fuzzy and SVC-PI Controllers for Dynamic Stability”
Proceedings of the Second International Conference on
Emerging Trends in Engineering and Technology, ICETET-
09, pp.985-990, 2009.

[9]B.Nagaraj, “A Comparative Study of PID Controller

Tuning Using GA, EP, PSO and ACO” Proceedings of the
IEEE International Conference on Trends in Engineering and
Technology, ICCCCT-10, pp.305-113, 2010.

[10] Hwan Gil Bae, “Comparative Study of PID Controller

Designs Using Particle Swarm Optimizations for Automatic
Voltage Regulators” Proceedings of the IEEE Conference on
expert system, 2011.

354
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Survey on Routing Protocol for Wireless Sensor
Network
Mahima Bansal Dr. Harsh Sadawarti
PG Student Director
CSE dept. RIMT- Institute of Engineering
RIMT- Institute of Engineering and Technology,
and Technology, Mandi-Gobindgarh
Mandi-Gobindgarh
harshsada@yahoo.com
mahima0911@gmail.com
ABSTRACT
Recent advances in wireless sensor networks have led to
many new protocols specifically designed for sensor networks
where energy awareness is an essential consideration. Most of
the attention, however, has been given to the routing protocols
since they might differ depending on the application and
network architecture. This paper surveys recent routing
protocols for sensor networks and presents a classification for
the various approaches pursued. The three main categories
explored in this paper are data-centric, hierarchical and
location-based. Some Routing protocol is described and
discussed under the appropriate category. Moreover, protocols
using contemporary methodologies such as network flow and
QoS modeling are also discussed.
Keywords
Wireless Sensor Network, Routing Protocols, Classification of
Protocols.
1. INTRODUCTION
Wireless sensor networks can provide low cost solution to a
variety of real-world problems. Sensors are low cost tiny
devices with limited storage, computational capability and
power. The large scale deployment of wireless sensor
networks is expected to guarantee real time communication.
Devices in sensor networks have a much smaller memory,
constrained energy supply, less process and communication
bandwidth. Topologies of the sensor networks are constantly
changing due to a high node failure rate, occasional shutdown
and abrupt communication interferences. Due to the nature of
the applications supported, sensor networks need to be
densely deployed and have anywhere from thousands to
millions of sensing devices, which are the orders of magnitude
larger than traditional ad hoc mobile networks. In addition,
energy conservation becomes the center of focus due to the
limited battery capacity and the impossibility of recharge in
the hostile environment. Wireless sensor networks (WSN)
allow flexible, powerful, automated data collection and
monitoring systems to be created. Many routing protocols
have been proposed to facilitate data transport from sensor
nodes to a base station. Surveys of Al-Karaki and Kamal [2]
355
ISBN: 978-81-924893-0-8
Abhilash Sharma
Assistant Professor
CSE dept.
RIMT- Institute of Engineering
and Technology,
Mandi-Gobindgarh
abhilash583@yahoo.com
and Jiang and Manivannan [3] identify a wide range of
approaches to routing in wireless sensor network. Few of
these protocols have been formally verified or operationally
deployed however. The Minimum Cost Forwarding (MCF)
routing protocol [1], has been proposed. The application of
MCF is restricted to networks possessing a single sink node
and multiple source nodes. However, it offers several
potential advantages for sensor nodes with limited resources.
2. RELATED WORK
The growing interest in WSNs and the continual emergence of
new techniques inspired some efforts to design
communication protocols for this area. Communication
protocols take the task of data transmission in the large scale
network and are important to achieve possible better
performance. Normally, current routing can be typically
classified into four main categories, namely data-centric
protocols, hierarchical protocols, location-based protocols and
flow-based and QoS-aware protocols [4]. Of course, there are
also some hybrid protocols that fit under more than one
category. The typical data-centric routing protocols proposed
for WSNs include SPIN [5] and Directed Diffusion [6], which
are obviously different from traditional address-based routing;
location-based protocols such as MECN, GAF and GEAR
require location information for sensor nodes, which are
energy-aware. Hierarchical protocols are scalable for a larger
number of sensors covering a wider region of interest, which
overcome the defects of single-gateway architecture. LEACH
is one of the first hierarchical routing approaches for WSNs
[7]. Although the above three categories are promising in term
of energy efficiency, more attentions should be paid to
address the issues of network flow and QoS posed by real-
time applications. One of the protocols for WSNs that
includes some notions for QoS in its routing decisions is the
Sequential Assignment Routing (SAR) [9]. The SAR protocol
creates trees routed from one-hop neighbor of the sink by
taking into account the QoS metric, the energy resource on
each path and the priority level of each data packet. By using
created trees, multiple paths from sink to sensors are formed.
One of these paths is selected according to the energy
resources and achievable QoS on each path. Akkaya et al
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
extend SAR by selecting a path from a list of candidate paths
that meet the end-to-end delay requirement and maximizing
the throughput for best effort traffic. Their protocol does not
require sensors involved in route setup so that the overhead
problems in SAR approach can be avoided.
Minimum cost forwarding protocol is a kind of flow-based
routing protocol. It aims at finding the minimum cost path in
large scale sensor networks, which will be simple and
scalable. The data flows over the minimum cost path and
resources on the nodes are updated after each flow. Ye et al
also propose a cost field based protocol to Minimize Cost
forwarding Routing (MCR) [1]. In the design, they present a
novel back off-based cost field setup algorithm that finds the
optimal cost of all nodes to the sink with one single message
overheadS at each node. Once the field is established, the
message, carrying dynamic cost information, flows along the
minimum cost path in the cost field. Each intermediate node
forwards the message only if it finds itself to be on the
optimal path, based on dynamic cost states.
3. DATA CENTRIC PROTOCOLS
Data-centric protocols are query-based. In many applications
of sensor networks, it is not feasible to assign global
identifiers to each node. Sink sends queries to certain regions
and waits data from sensors located in that region. Attribute-
based naming is necessary to specify properties of data.
Data Centric Protocols are
 Flooding
 Gossiping
 Sensor Protocols for Information via Negotiation
(SPIN)
 Directed Diffusion
 Energy-aware Routing
 Rumor Routing
 Gradient-Based Routing (GBR)
 Constrained Anisotropic Diffusion Routing (CADR)
 COUGAR
 Active Query Forwarding In Sensor Networks
(ACQUIRE)
3.1 Sensor Protocols for Information via
Negotiation (SPIN)
Hein Zelman et.al.[5] in proposed a family of adaptive
protocols called Sensor Protocols for Information via
Negotiation (SPIN) that disseminate all the information at
each node to every node in the network assuming that all
nodes in the network are potential base stations. This enables
a user to query any node and get the required information
immediately. These protocols make use of the property that
nodes in close proximity have similar data, and hence there is
a need to only distribute the data that other nodes do not
possess. One of the advantages of SPIN is that topological
changes are localized since each node needs to know only its
single-hop neighbors. SPIN provides much energy savings
than flooding, and meta-data negotiation almost halves the
redundant data.
356
ISBN: 978-81-924893-0-8
SPIN Messages
SPIN nodes use three types of messages to communicate
 ADV – new data advertisement. When a SPIN node
has data to share, it can advertise this fact by
transmitting an ADV message containing meta-data.
 REQ - request for data. A SPIN node sends a REQ
message when it wishes to receive some actual data.
 DATA - data message. DATA messages contain
actual sensor data with a metadata header.
Because ADV and REQ messages contain only metadata, they
are smaller, and cheaper to send and receive, than their
corresponding DATA messages. Using SPIN routing
algorithm, sensor nodes can conserve energy by sending the
metadata that describes the sensor data instead of sending all
the data. SPIN can reduce the power consumption of
individual node, but it may decrease the lifetime of the whole
network due to extra messages.
3.2 Directed Diffusion ( DDiff)
C. Intanag onwiwat et. al. [6] proposed a popular data
aggregation paradigm for WSNs, called directed diffusion.
Directed diffusion is a data-centric (DC) and application-
aware paradigm in the sense that all the data generated by
sensor nodes is named by attribute-value pairs. The main idea
of the DC paradigm is to combine the data coming from
different sources and combines them by eliminating
redundancy, minimizing the number of transmissions; thus
saving network energy and prolonging its lifetime. But still
power consumption is high.
Therefore, we propose an algorithm that tries to prolong the
network lifetime by compromising between minimum energy
consumption and fair energy consumption without additional
control packets. It also improves its data packet delivery ratio,
minimizes delay and maximizes throughput of the network.
4. HIERARCHICAL PROTOCOLS
Aim at clustering the nodes so that cluster heads can do some
aggregation and reduction of data in order to save energy.
Scalability is one of the major design attributes of sensor
networks. A single-tier network can cause the gateway to
overload with the increase in sensors density. Such overload
might cause latency in communication and inadequate
tracking of events. The single-gateway architecture is not
scalable for a larger set of sensors covering a wider area of
interest.
Maintain energy consumption of sensor nodes
 By multi-hop communication within a particular
cluster.
 By data aggregation and fusion decrease the number
of the total transmitted packets.
Hierarchical Protocols are
 LEACH : Low-Energy Adaptive Clustering
Hierarchy
 PEGASIS: Power-Efficient Gathering in Sensor
Information Systems
 Hierarchical PEGASIS
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 TEEN: Threshold sensitive Energy Efficient sensor
Network protocol
 Adaptive Threshold TEEN (APTEEN)
 Energy-aware routing for cluster-based sensor
networks
 Self-organizing protocol
4.1 Low-Energy Adaptive Clustering
Hierarchy (LEACH)
LEACH is a clustering-based protocol that minimizes energy
dissipation in sensor networks[7]. LEACH randomly selects
sensor nodes as cluster heads, so the high energy dissipation
in communicating with the base station is spread to all the
sensor nodes in the sensor network. However, data collection
is centralized and is performed periodically. LEACH collects
data from distributed micro sensors and transmits it to a base
station. LEACH uses the following clustering-model: Some of
the nodes elect themselves as cluster-heads. These cluster-
heads collect sensor data from other nodes in the vicinity and
transfer the aggregated data to the base station. Since data
transfers to the base station dissipate much energy, the nodes
take turns with the transmission– the cluster-heads “rotate”.
This rotation of cluster-heads leads to a balanced energy
consumption of all the nodes and hence to a longer lifetime of
the network. Therefore, this protocol is most appropriate when
there is a need for constant monitoring by the sensor network.
LEACH can suffer from the clustering overhead, which may
result in extra power depletion.
4.2 Power-Efficient Gathering in Sensor
Information Systems (PEGASIS)
PEGASIS [8] is an extension of the LEACH protocol, which
forms chains from sensor nodes so that each node transmits
and receives from a neighbor and only one node is selected
from that chain to transmit to the base station (sink). The data
is gathered and moves from node to node, aggregated and
eventually sent to the base station. The chain construction is
performed in a greedy way. Unlike LEACH, PEGASIS avoids
cluster formation and uses only one node in a chain to
transmit to the BS (sink) instead of using multiple nodes. A
sensor transmits to its local neighbors in the data fusion phase
instead of sending directly to its CH as in the case of LEACH.
In PEGASIS routing protocol, the construction phase assumes
that all the sensors have global knowledge about the network,
particularly, the positions of the sensors, and use a greedy
approach. When a sensor fails or dies due to low battery
power, the chain is constructed using the same greedy
approach by bypassing the failed sensor. In each round, a
randomly chosen sensor node from the chain will transmit the
aggregated data to the BS, thus reducing the per round energy
expenditure compared to LEACH.
PEGASIS has been shown to outperform LEACH by about
100–300% for different network sizes and topologies.
5. LOCATION-BASED PROTOCOLS
IT utilizes the position information to relay the data to the
desired regions rather than the whole network. Most of the
357
ISBN: 978-81-924893-0-8
routing protocols for sensor networks require location
information for sensor nodes. There is no addressing scheme
for sensor networks like IP-addresses. Location information
can be utilized in routing data in an energy efficient way.
Protocols designed for Ad hoc networks with mobility in
mind
 Applicable to Sensor Networks as well
 Only energy-aware protocols are considered.
Location-based protocols are
 MECN & SMECN
Minimum Energy Communication Network
 GAF
Geographic Adaptive Fidelity
 GEAR
Geographic and Energy Aware Routing
6. NETWORK FLOW & QOS AWARE
These are based on general network-flow modeling and
protocols that strive for meeting some QOS requirements
along with the routing function. In addition to minimizing
energy consumption, it is also important to consider quality of
service (QoS) requirements in terms of delay, reliability, and
fault tolerance in routing in WSNs. In this section, we review
a sample QoS based routing protocols that help find a balance
between energy consumption and QoS requirements.
Network Flow
Maximize traffic flow between two nodes, respecting the
capacities of the links
QOS-aware protocols
Consider end-to-end delay requirements while setting up
paths
Network Flow & QOS-aware Protocols are
 Maximum Lifetime Energy Routing
 Maximum Lifetime Data Gathering
 Minimum Cost Forwarding
 Sequential Assignment Routing
 Energy Aware QOS Routing Protocol
 SPEED
6.1 Sequential Assignment Routing (SAR)
SAR [9] is one of the first routing protocols for WSNs that
introduces the notion of QoS in the routing decisions. It is a
table-driven multi-path approach striving to achieve energy
efficiency and fault tolerance. Routing decision in SAR is
dependent on three factors: energy resources, QoS on each
path, and the priority level of each packet. The SAR protocol
creates trees rooted at one-hop neighbors of the sink by taking
QoS metric, energy resource on each path and priority level of
each packet into consideration. By using created trees,
multiple paths from sink to sensors are formed. One of these
paths is selected according to the energy resources and QoS
on the path. Failure recovery is done by enforcing routing
table consistency between upstream and downstream nodes on
each path. Any local failure causes an automatic path
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

restoration procedure locally. The objective of SAR algorithm Table 1 represents Classification and Comparison of routing
is to minimize the average weighted QoS metric throughout protocols in WSNs. Table 2 represents routing protocols
the lifetime of the network. Simulation results showed that selection for particular applications in WSNs. These tables are
SAR offers less power consumption than the minimum- based on the survey of Ref. [10].
energy metric algorithm, which focuses only the energy
consumption of each packet without considering its priority. Table2. Routing protocols selection for particular
SAR maintains multiple paths from nodes to sink. Although, applications in WSNs
this ensures fault-tolerance and easy recovery, the protocol
suffers from the overhead of maintaining the tables and states
at each sensor node especially when the number of nodes is
huge.

7. COMPARISON OF ROUTING
PROTOCOLS
In this paper we compared the following routing protocols
according to their design characteristics.
 SPIN [5]: Sensor Protocols for Information via
Negotiation.
 DD [6]: Directed Diffusion
 RR: Rumor Routing
 GBR: Gradient Based Routing. 8. CONCLUSION
One of the main challenges in the design of routing protocols
 CADR: Constrained Anisotropic Diffusion Routing.
for WSNs is energy efficiency due to the scarce energy
 COUGAR.
resources of sensors. The ultimate objective behind the
 ACQUIRE: ACtive QUery forwarding In sensoR
routing protocol design is to keep the sensors operating for as
nEtworks.
long as possible, thus extending the network lifetime. The
 LEACH [7]: Low Energy Adaptive Clustering
energy consumption of the sensors is dominated by data
Hierarchy.
transmission and reception. Therefore, routing protocols
 TEEN & APTEEN: [Adaptive] Threshold sensitive designed for WSNs should be as energy efficient as possible
Energy Efficient sensor Network.
to prolong the lifetime of individual sensors, and hence the
 PEGASIS [8]: The Power-Efficient GAthering in Sensor
network lifetime.
Information Systems.
It is an evolving field, which offers scope for a lot of research.
 VGA: Virtual Grid Architecture Routing.
Moreover, unlike MANETS, sensor networks are designed, in
 SOP: Self Organizing Protocol.
general, for specific applications. Hence, designing efficient
 GAF: Geographic Adaptive Fidelity.
routing protocols for sensor networks that suits sensor
 SPAN networks serving various applications is important. In this
 GEAR: Geographical and Energy Aware Routing paper, we have surveyed a sample of routing protocols by
 SAR[9]: Sequential Assignment Routing. taking into account several classification criteria, including
 SPEED: A real time routing protocol. location information, network layering and in-network
processing, data centricity, path redundancy, network
Table1. Classification and Comparison of routing dynamics, QoS requirements, and network heterogeneity. For
protocols in WSNs each of these categories, we have discussed a few example
protocols and also compared and contrasted the existing
routing protocols. As our study reveals, it is not possible to
design a routing algorithm which will have good performance
under all scenarios and for all applications. Although many
routing protocols have been proposed for sensor networks,
many issues still remain to be addressed.

REFERENCES
[1] F. Ye, A. Chen, S. Lu, and L. Zhang, “A scalable solution
to minimum cost forwarding in large sensor networks,” in
Proc. IEEE 10th Int. Conf. Computer Communications and
Networks, Scottsdale, Arizona, Oct. 2001.

[2] J. Al-Karaki and A. E. Kamal, “Routing techniques in

wireless sensor networks: A survey,” IEEE Trans. Wireless
Commun., Dec. 2004.

358
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[3] Q. Jiang and D. Manivannan, “Routing protocols for

sensor networks,” in Proc. IEEE CCNC, Jan. 2004.

[4] Akkaya, K.; Younis, M., “A survey on routing protocols

for wireless sensor network. Ad Hoc Networks 2005.

[5] W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive

Protocols for Information Dissemination in Wireless Sensor
Networks” in 5th ACM/IEEE Mobicom Conference
(MobiCom '99), Seattle, WA, August, 2006.

[6] C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed

diffusion: a scalable and robust communication paradigm for
sensor networks”, ACM MobiCom '05, Boston, MA, 2008.

[7] L. Subramanian and R. H. Katz, “An Architecture for

Building Self Configurable Systems”, IEEE/ACM Workshop
on Mobile Ad Hoc Networking and Computing, Boston,, MA,
August 2005.

[8] S. Lindsey and C.S. Raghavendra, “PEGASIS: Power-

efficient Gathering in Sensor Information System”,
Proceedings IEEE Aerospace Conference, vol. 3, Big Sky,
MT, Mar. 2002.

[9] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E.

Cayirci, “Wireless sensor networks: a survey”, Computer
Networks (Elsevier) Journal, Vol. 38, no. 4, Mar. 2002.

[10] Ian F. Akyildiz, Weilian Su, Yogesh

Sankaraubramaniam, and Erdal Cayirci: A Survey on sensor
networks, IEEE Communications Magazine (2002).

359
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Survey on Optical Amplifiers
Kirandeep Kaur
PG Student
CSE dept.
RIMT- Institute of Engineering and Technology,
Mandi-Gobindgarh
kiranrimt@gmail.com
ABSTRACT
An optical fiber is an enabling and promising technology used
in almost all the trunk lines of existing networks. It is also
capable of allowing the transmission of many signals over
long distances because of its huge transmission bandwidth (in
THz) and low losses. In WDM networks optical fibers are
employed to transmit information in form of light pulse
between the transmitter and the receiver. WDM systems have
the potential to transmit multiple signals simultaneously. But
the light signals degrade in intensity when they travel a long
distance inside the fiber. So it is required to amplify all the
light signals simultaneously after a certain interval of light
propagation to regain the original signal. Optical amplifiers
are generally used to amplify the light pulses. In this paper,
the three main categories of Optical amplifiers
(Semiconductor optical amplifier, Raman amplifier and
Erbium doped fiber amplifier) and comparison between these
amplifiers are explored.
Keywords
WDM, CWDM, DWDM, SOA, EDFA, Raman.
1. INTRODUCTION
In the modern era, the demand of communication has
increased to larger extent due to introduction of new
communication techniques. As the number of clients are
increasing day by day and need arises to send more and more
data over optical fibers. Residential subscribers demand high
speed network for voice and media-rich services. Similarly,
corporate subscribers demand broadband infrastructure so that
they can extend their local-area networks to the Internet
backbone [2], so the demand of huge bandwidth, high
capacity and high speed network are main requirements to
provide good quality of service to clients. It can only be
possible with the help of fiber optic communication system
that is used to carry light signal with the highest frequency
range i.e. in the range of Terahertz (THz) [4]. This system
utilizes different types of multiplexing techniques but
wavelength division multiplexing (WDM) maintains good
quality of service without traffic, less complicated instruments
with efficient utilization of bandwidth. When the signal that
carries the information transmit over long distance then it
becomes weaken so the signal needs to be amplified with the
help of amplifier at regular intervals. An optical amplifier is a
device which amplifies the optical signal directly without ever
changing it to electricity. The light itself is amplified. Reasons
to use optical amplifiers are
 Reliability
 Flexibility
 Wavelength Division Multiplexing (WDM)
 Low cost
360
ISBN: 978-81-924893-0-8
Dr.Harsh Sadawarti
Director
RIMT- Institute of Engineering and Technology,
Mandi-Gobindgarh
harshsada@yahoo.com
RELATED WORK
2. FIBER OPTIC COMMUNICATION
SYSTEM
Fiber optic communication is a communication technology
that uses light pulses to transfer information from one point to
another through an optical fiber. The information transmitted
is essentially digital information generated by telephone
systems, cable television companies, and computer systems.
An optical fiber is a dielectric cylindrical waveguide made
from low-loss materials, usually silicon dioxide. The core of
the waveguide has a refractive index a little higher than that of
the outer medium (cladding), so that light pulses is guided
along the axis of the fiber by total internal reflection [4].
An optical fiber communication system has three basic
components, transmitter, receiver and the transmission path as
shown in the figure below.
Fig 1: Block Diagram of Optical fiber Communication
System
In the transmitter side, the input signal is generated by a data
source. The optical source is a laser source which generates
optical light signal at a certain wavelength. The data source
and the optical signal are fed to the modulator and then the
resulting modulated pulse signal propagates through the
transmission path which is an optical fiber. At the receiver
side the optical signal is detected through an optical detector.
The detected signal then passes through the demodulator to
get the desired output signal. An optical fiber is a flexible thin
filament of silica glass that accepts electrical signals as input
and converts them to optical signal. It carries the optical
signal along the fiber length and re converts the optical signal
to electrical signal at the receiver side.
Francis Idachaba, Dike U. Ike, and Orovwode Hope et. al. [1]
proposed the future trends in fiber optics communication.
With the advancement in technology and demand of using
optical fiber has driven the evolution of fiber optic
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

communication. In future, it also expected to continue the Mr.Sachin Chaugule, Mr. Ashish More et. al. [5] proposed the
development of new and advanced technology. Some of the principle that is understood by considering the fact that we
envisioned future trends in fiber optic communication were can see many different colors of light like rainbow all at once.
mentioned in this paper is below. The colors are transmitted through the air together and may
mix, but they can easily be separated using a simple device
 All Optical Communication Networks like a prism, just like we separate the white light from the sun
 Multi – Terabit Optical Networks into a spectrum of colors with the prism.
 Improvements in Laser Technology
 Ultra – Long Haul Optical Transmission
 Intelligent Optical Transmission Network
 Laser Neural Network Nodes
 Polymer Optic Fibers
 Improvements in Optical Transmitter/Receiver
technology
 High – Altitude Platforms
 Improvement in Optical Amplification Technology
 Improvement in WDM Technology
Fig 3: Separating a beam of light into its color
 Improvements in Glass fiber design and components
miniaturization
Depending on channel resolution and number of channels,
there are two types of WDM systems.
3. WAVELENGTH DIVISION
MULTIPLEXING (WDM) i. Conventional or coarse wavelength division
In fiber optic communications, WDM is a technology or multiplexing (CWDM)
technique which multiplexes multiple optical carrier signals of ii. Dense wavelength division multiplexing (DWDM)
varying wavelengths of laser light onto a single optical fiber
[2]. It is an analog multiplexing technique and allows multiple CWDM supports 4 to 8 wavelengths per fiber, sometimes
optical signals to be transferred along the same piece of fiber more. The spacing between the channels is large i.e. 1.6 nm –
at the same time. It enables bidirectional communication over 25 nm. It is used in metro, short-haul networks. While
one strand of fiber as well as multiplication of signal capacity DWDM supports 8 or more wavelengths with denser channel
i.e. transmission capacity per fiber is multiplied by the spacing i.e. 1.6 nm or less. It is designed for long-haul
number of signal wavelength.
networks.

4. OPTICAL AMPLIFIERS
Hidenori Taga et al. proposed [6] that with the demand for
longer transmission lengths, optical amplifiers have become
an essential component in long-haul fiber optic system. When
a signal travels in an optical fiber, it suffers from various
losses like fiber attenuation losses, fiber tap losses and fiber
splice losses. Due to these losses, it is difficult to detect the
signal at the receiver side. So in order to transmit signal over a
long distance in a fiber (more than 100km) it is necessary to
compensate the losses in the fiber. Initially the optical signals
Fig 2: WDM System were converted to electrical signal then amplified and then
reconverted to optical signal. But it was a complex and costly
The working of WDM system is illustrated in Fig2. It consists procedure. The introduction of optical amplifiers allowed the
of a multiplexer at the transmitter side to combine the signals
signal amplification in optical domain. There was no need to
together and a demultiplexer at the receiver side to split them
apart. With the proper choice of fiber, it is possible to have a convert the optical signal to electrical signal [4].
device that do both multiplexing and demultiplexing
simultaneously and can function as an optical add-drop
multiplexer. It should be consider that each optical channel is
completely independent of the other optical channels. It may
use its own encodings and protocols and run at its own rate
(speed) without any dependence on the other channels at all.
Each signal having different wavelengths (represented as
colors) of laser light are combined with the help of
multiplexer and then transmitted over single fiber. The signals
can be voice, video or data which may be either in an analog
or multiplexer format. These different carriers are separated
with the help of demultiplexer before the photo detection of
individual signals [3].
Fig 4: Block Diagram of basic optical amplifier

361
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Application of Optical Amplifier [5]
 Power Amplifier
Power or booster amplifiers are placed just after the
transmitter to boost the signals. This helps to
increase the transmission distance by 10-100 km
depending on the amplifier gain and fiber loss.
Fig 5: Power Amplifier
 In-Line Optical Amplifier
In a single mode optical fiber the signal goes
through loss due to attenuation. So after a certain
interval of time the regeneration of the signal and
its amplification needs to be done. So inline optical
amplifier can be used to compensate attenuation
loss and increase the distance between regenerative
repeaters.
Fig 6: In-line Optical Amplifier
 Preamplifier
An optical amplifier can be used as a front-end
preamplifier just before an optical receiver. The
weak optical signals can be amplified by the
preamplifier so that the SNR degradation can be
minimized, Also preamplifier shows high gain and
better bandwidth.
Fig 7: Preamplifier
The three types of Optical amplifiers are classified as follows
 Semiconductor Optical Amplifier (SOA)
 RAMAN Amplifier
 Erbium Doped Fiber Amplifier (EDFA)
4.1 Semiconductor Optical Amplifier
Aruna Rani, Mr. Sanjeev Dewra et. al. [7] proposed that
Semiconductor Optical amplifier (SOAs) are under rapid
development to achieve polarization independent gain, low
facet reflectivity, good coupling to optical fibers and high gain
saturation power. SOAs have been employed to overcome
distribution loses in the optical communication applications
and pursued for metropolitan-area networks as a low-cost
alternative to fiber amplifiers.
362
ISBN: 978-81-924893-0-8
SOAs are essentially laser diodes, without end mirrors, which
have fiber attached to both ends. They amplify any optical
signal that comes from either fiber and transmit an amplified
version of the signal out of the second fiber. SOAs are
typically constructed in a small package and they work for
1310 nm-1550 nm systems.
Fig 8: Semiconductor optical amplifier
4.1.1 Working
An optical signal can amplify by using semiconductor optical
amplifier are as follow
 An electrical current passed through the device that
excites the electrons in the active regions.
 When photon (light) travel through the active region
it can cause these electrons to lose some of their
extra energy in the form of more photons that match
the wavelength of the initial ones.
 Therefore, an optical signal passing through the
active region is amplified and is said to have
experienced ―gain‖.
Fig 9: Working of SOAs
4.2 Raman Amplifier
Raman Amplifiers are based on the phenomena called
stimulated Raman Scattering which is a nonlinear process [5].
Raman gain arises from the transfer of power from one optical
beam to another that is downshifted in frequency by the
energy of an optical phonon, a vibrational mode of the
medium. Raman amplifiers utilize pumps to impart a transfer
of energy from the pumps to the transmission signal through
the Raman Effect mechanism. Raman scattering does not
require population inversion as it is an elastic scattering
mechanism.
T. N. Nielsen [8]can summarized that stimulated Raman
scattering is a nonlinear optical process in which intense
pump light interacts with a signal of low frequency,
simultaneously amplifying the signal and producing an optical
phonon. . Raman scattering occurs in all optical fibers with its
strength depending only on the type of optical fiber and the
frequency offset and power of the interacting waves.
Maximum gain occurs for a frequency offset between the
pump and signal of 13.2THz. Gain is directly proportional to
the pump power and inversely to the length and fiber cross
sectional area.
Three important points are
 SRS can occur in any fiber.
 Raman gain can occur at any signal wavelength.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 Raman gain process is very fast, differs from
EDFA.
Fig 10: Raman amplifier configuration
4.2.1 Principle
Mr.Sachin Chaugule, Mr. Ashish More et. al. [5] proposed the
principle of Raman amplifier that is Stimulated Raman
Scattering (SRS).An incident photon excites an electron to the
virtual state and the stimulated emission occurs when the
electron de-excites down to the vibrational state of glass
molecule.
Fig 11: Energy levels and transitions involved in SRS
4.2.2 Raman Amplification
Raman amplification requires no special doping in the optical
fiber. It is usually accomplished as ―distributed amplification‖
— that is, it happens throughout the length of the actual
transmission fiber, rather than all in one place in a small box
(as in the case with an EDFA).
Fig 12: Raman Amplification
4.2.3 Types of Raman Amplifier
There are two types of RAMAN Amplifiers
 Distributed Raman Amplifier
It is one in which the transmission fiber is utilized
as the gain medium by multiplexing a pump
wavelength with signal wavelength.
 Discrete/Lumped Raman Amplifier
It utilizes a dedicated, shorter length of fiber to
provide amplification. It is highly nonlinear fiber
with a small core, utilized to increase the interaction
between signals and pump wavelengths and thereby
reduce the length of fiber required.
363
ISBN: 978-81-924893-0-8
4.3 Erbium Doped Fiber Amplifier
EDFAs consist of erbium-doped fiber having a silica glass
host core doped with active Er ions as the gain medium.
Where, Erbium is a chemical element of lanthanide series in
periodic table. Erbium symbol is Er and atomic number is 68.
Erbium looks like a silvery-white solid metal when artificially
isolated.
Basic elements of an EDFA are shown schematically in
Fig. 13. Erbium-doped fiber is usually pumped by
semiconductor lasers at 980 nm or 1480 nm. Signal
propagates along short span of a special fiber and is being
amplified at that time. Amplifier is pumped by a
semiconductor laser, which is coupled by using a wavelength
selective coupler, also known as WDM coupler, which
combines the pump laser light with the signal light. The pump
light propagates either in the same directions as the signal (co-
propagation) or in the opposite direction (counters
propagation). Optical isolators are used to prevent oscillations
and excess noise due to unwanted reflections.
Fig 13: Scheme of EDFA
4.3.1 Principle
To make the principle work, erbium atoms needed to be set
in excited state. This is done by 980nm and/or 1480 nm lasers.
The laser diode in the diagram generates a high-powered
beam of light at a wavelength such that the erbium ions will
absorb it and get to their excited state. Pumping laser power is
usually being controlled via feedback.
V. Bobrovs, S. Berezins et. al. [9] proposed that increase in
input signal power reduced EDFA gain and ASE noise.
According to their observations the most effective way to
decrease ASE noise created by the amplifier is not to have a
too weak signal to be amplified at EDFA input. There is
always an optimum EDFA length depending on the pumping
laser power. If the fiber is too short then the whole potential
of the amplifier won’t be realized. Some laser energy will
remain unused. If the EDFA fiber is longer than the optimal
value then erbium inversion level at the end of the EDFA will
be less than 50 % and fiber will start to absorb the signal.
The second key component of the EDFA besides erbium-
doped fiber is pumping laser. All simulation results showed
the advantage of 980 nm co-directional laser usage in
amplifier setup compared to 1480 nm laser, higher gain and
lower noise values are possible to achieve in this setup by
using the same pumping power.
5. COMPARISON OF OPTICAL
AMPLIFIERS [10]
In this survey, we have compared the following
characteristics, advantages, disadvantages and application
areas of EDFA, SOA and Raman amplifiers as shown in
Table 1 and Table 2.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Table 1. Comparison of characteristics of EDFA, SOA and
Raman amplifiers
Table 2. Comparison of advantages, disadvantages and
application areas of EDFA, SOA and Raman amplifiers
6. CONCLUSION
In this survey, it is concluded that WDM provides good
efficiency without traffic, less complicated instruments with
efficient utilization of bandwidth and Optical amplifiers are
used to transmit the signals over long distances to compensate
364
ISBN: 978-81-924893-0-8
attenuation loses, They boost up the power level of multiple
light wave signals.
In comparison of EDFA, SOA and RAMAN amplifiers, it is
concluded that SOAs offer certain advantages over more
commonly used optical fiber amplifier such as low power
consumption, compactness and non-linear gain properties. A
particular attraction of EDFA is their large gain bandwidth,
which is typically tens of nanometers and thus actually more
than enough to amplify data channels with the highest data
rates without introducing any effects of gain narrowing.
Before such fiber amplifiers were available, there was no
practical method for amplifying all channels. The only
competitors to erbium-doped fiber amplifiers in the 1.5-μm
region are Raman amplifiers, which profit from the
development of higher power pump lasers.
REFERENCES
[1] Francis Idachaba, Dike U. Ike, and Orovwode Hope,
―Future Trends in Fiber Optics Communication‖, Proceedings
of the World Congress on Engineering 2014 Vol I, WCE
2014, July 2 - 4, 2014, London, U.K.
[2] Banerjee A., Park Y., Clarke F., Song H., Yang S., Kramer
G., Kim K., Mukherjee B., ―Wavelength-division-multiplexed
passive optical network (WDM-PON) technologies for
broadband access‖, Journal of optical networking, Vol. 4, No.
11, 2005.
[3] Jun Zheng & Hussein T.Mouftah, ―Optical WDM
networks, concepts and Design‖, IEEE press John Wiley -
Sons, Inc., Publication, p.1-4, 2004.
[4] G.P. Agrawal, ―Fiber Optic Communication Systems‖,
John Wiley and Sons, New York, 1997.
[5] Mr.Sachin Chaugule, Mr. Ashish More, ―WDM and
Optical Amplifier‖, IEEE, Volume 2, V2-232, 2010.
[6] Hidenori Taga, ―Long Distance Transmission Experiments
Using the WDM Technology‖, journal of lightwave
technology, Volume 14, 1996, Page 1287.
[7] Aruna Rani, Mr. Sanjeev Dewra, ―Semiconductor optical
amplifiers in optical Communication system‖, IJERT, Vol.2 –
Issue 10 (October – 2013).
[8] T. N. Nielsen, ―Raman Amplifiers in WDM systems‖,
IEEE, 0-7803-5634-9/99, 1999.
[9] V. Bobrovs, S. Berezins, ―EDFA Application Research in
WDM Communication Systems‖, Elektronika Ir
Elektrotechnika, ISSN 1392-1215, VOL. 19, NO. 2, 2013.
[10] Mahmoud Ibrahim and Dr. Amin Abubake, ―A
comparison of optical amplifiers in optical communication
systems EDFA, SOA and RAMAN‖, International Journal of
Current Research Vol. 6, Issue, 09, pp.8738-8741, September,
2014.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Managing Big Data with Apache Hadoop
Maninderpal Singh Dhaliwal
Deptt Of Computer Science, PTU Jalandhar
LCET,katani Kalan,Ldh,Punjab
ermdhaliwal85@gmail.com
ABSTRACT
Over the last few years, various organizations have made a
strategic decision to turn big data into competitive advantage.
The challenge of extracting value from big data is comparable
in many ways to the age-old problem of distilling business
intelligence from transactional information. To overcome this
problem to extract data from several sources, convert it to fit
according to our analytical requirements, and load it into a
data warehouse for subsequent analysis, a process is used
called as ―Extract, Transform & Load‖ (ETL). The nature of
big data requires that the infrastructure for this process can
scale cost-effectively. Apache Hadoop* has emerged as the
one of the standard for managing big data. This paper
examines some of the platform hardware as well as software
considerations in using Hadoop for ETL provided by
companies like Intel.
Keywords-Apache Hadoop, ETL with Apache Hadoop, Big
Data, MapReduce and HDFS, offload ETL with Hadoop,
Infrastructure for ETL.
1. THE EXTRACT, TRANSFORM &
LOAD BOTTLENECK IN BIG DATA
ANALYTICS
Big Data refers to the large amounts of data, at least terabytes,
of poly-structured information that flows through and around
organizations also include video, text, sensor logs as well as
transactional records. The business benefits of analyzing this
data can be significant. According to a latest study by the MIT
Sloan School of Management, organizations which use
analytics are twice as accepted to be top performers in their
industry.
Business analysts at a large company like Intel, for example,
with its large-scale market and complex supply chain, have
long sought insight into consumer demand by analyzing far-
flung data points culled from market information and business
transactions. Increasingly, the data we need is embedded in
financial reports, discussion forums, news sites, social and
professional networks, climate reports, tweets, and various
blogs, as well as transactions. By analyzing all the available
data, decision-makers can better assess threats, anticipate
changes in customer behavior, make stronger supply chains,
improve effectiveness of marketing campaigns, and enhance
their business stability.
Many of these benefits are not latest to organizations that
have mature processes for incorporating business intelligence
(BI) and analytics into their decision-making but meanwhile
most organizations have yet to take full benefits of fresh
technologies for handling big data. Put simply, the cost of the
365
ISBN: 978-81-924893-0-8
Amandeep Singh Khangura
Deptt Of Computer Science, PTU Jalandhar
LCET,katani Kalan,Ldh,Punjab
khangurasony@gmail.com
technologies needed to store and analyze large volumes of
diverse data has dropped; we appreciate the pen source
software running on industry-standard hardware. The cost has
dropped, in fact, that the key strategic query is no longer what
data is relevant, but rather how to fetch the most value from
all the available data we have.
Rapidly ingesting, storing, and processing big data demands a
cost effective infrastructure that can scale with the quantity of
data and the scope of analysis. Most of the organizations with
traditional data platforms—normally relational database
management systems (RDBMS) coupled to enterprise data
warehouses (EDW) using ETL tools—find that their legacy
infrastructure is either technically incapable or financially
impractical for storing and analyzing big data.
A traditional ETL method extracts information from number
of sources, then cleanses, formats, and loads it into a data
warehouse for further analysis shown in figure 1. When the
source information sets are huge, fast, and unstructured,
traditional ETL can become the bottleneck, because it is too
difficult to develop and too expensive to operate, takes too
long to execute.
By most accounts, more than 80 percent of development
effort in a big data project goes into data integration and only
20 percent goes toward data analysis. Furthermore, a long-
established EDW platform can cost upwards of USD 60K per
terabyte. For Analyzing one petabyte the amount of data
Google processes in 1 hour would cost USD 60M. Obviously
―more of the same‖ is not a big data strategy that any CIO can
pay for. So, Apache Hadoop is the most excellent choice.
2. APACHE HADOOP FOR BIG DATA
When various companies like Yahoo, Google, and Facebook
extended their services to web-scale, the amount of data they
collected regularly from user exchanges online would have
overwhelmed the capabilities of long-established IT
architectures. As a result they built their own. In the interest
of advancing the improvement of core infrastructure
components rapidly, they published papers and released code
for many of the components into open source. Among these
components, Apache Hadoop has quickly emerged as the de
facto benchmark for managing large volumes of unstructured
data.
Apache Hadoop is an open source distributed software
platform for storing and processing data. Written in Java, it
runs on a bunch of industry-standard servers configured with
direct-attached storage. Using Hadoop, we can store petabytes
of data reliably on tens of thousands of servers while scaling
performance cost-effectively by merely adding inexpensive
nodes to the cluster.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Central to the scalability of Apache Hadoop is the distributed
processing framework called as MapReduce (Figure 2).
MapReduce helps programmers to resolve data-parallel
trouble for which the data set can be sub-divided into small
parts and processed separately. MapReduce is an essential
advance because it allows normal developers, not just those
skilled in very high-performance computing, and to use
parallel programming constructs without worrying about the
complex details of intra-cluster communication, various task
monitoring, failure handling. MapReduce helps in
simplifying all that.
The system splits the input data-set among multiple chunks;
each one is assigned a map task which can process the data in
parallel. Each map task reads the input as a set of (key, value)
pairs and provides a transformed set of (key, value) pairs as
the output. The framework shuffles and sorts outputs of the
map tasks, sending the intermediate (key, value) pairs to
reduce tasks, which group them into final conclusion.
MapReduce uses Job and Task Tracker mechanisms to plan
tasks, monitor them, and restart any that fail.
The Apache Hadoop platform also integrated with the Hadoop
Distributed File System (HDFS), which is designed for
scalability and fault tolerance. HDFS keeps large files by
separating them into blocks (usually 64 or 128 MB) and
replicating the blocks on three or more servers. MapReduce
applications can read and write data in parallel with help of
C. Apache Hive* and Apache Pig* are two programming
languages which simplify development of applications
employing the MapReduce framework. HiveQL is a dialect of
SQL and supports a subset of the syntax. Even though slow,
Hive is being actively improved by the developer community
to enable low-latency queries on Apache HBase* and HDFS.
Pig Latin is another procedural programming language which
provides high-level abstractions for MapReduce.
We can extend it with User Defined Functions written
in Java, Python, and other languages.
D. ODBC/JDBC Connectors for HBase and Hive are often
proprietary components included in distributions for Apache
Hadoop software. They provide connection with SQL
applications by means of translating standard SQL queries
into HiveQL commands that can be executed upon the data in
HDFS or HBase.
arcane formats no one else uses anymore. It seems to be easy,
but can in fact be one of the major obstacles in getting an ETL
solution off the ground.
The transform step may consist of multiple data
manipulations, like moving, splitting, translating, merging,
sorting, pivoting etc. For example, a customer name might be
split into first and last names, even dates might be changed
according to the standard ISO format (e.g., from 07-24-13 to
2013-07-24). Generally this step also involves validating the
data against data quality protocols.
C. Load the data into the data warehouse for analysis.
This action can be done in batch processes or row by row,
more or less in real time. Early on, before ETL tools existed,
the merely way to combine data from different sources was to
hand-code scripts in languages like COBOL, RPG, and
PL/SQL. Antiquated though it seems, about 45 percent of all
ETL work nowadays is still done by such hand-coded
programs. Even though they are error-prone, very slow to
develop, and difficult to maintain, they have loyal users who
366
ISBN: 978-81-924893-0-8
APIs provided by HDFS. Capacity and performance can be
scaled by adding up Data Nodes, and a single NameNode
method manages data placement and monitors server
availability. HDFS clusters in production utilize nowadays
reliably hold petabytes of data on thousands of nodes.
In addition to MapReduce and HDFS, Apache Hadoop
included with many other components, some of which are
very valuable for ETL.
A. Apache Flume* is a distributed system for collecting data,
aggregating, and moving bulk amounts of data from several
sources into HDFS or another central data store. Enterprises
usually collect log files on application servers or other
systems and archive the log records in order to comply with
regulations. Able to ingest and analyses that structured or
semi-structured data in Hadoop can turn this passive resource
into a significant asset.
B. Apache Sqoop* is a type of the tool for transferring data
among Hadoop and relational databases. We can use Sqoop to
bring in data from a MySQL or Oracle database into Hadoop
Distributed File System, run MapReduce on the data, and then
export the data back into a Relational Database Management
System. Sqoop automate these processes, via MapReduce to
import and export the data in parallel with fault-tolerance.
III. HADOOP ARCHITECTURE
Hadoop is a powerful platform for storage of big data and data
processing. On the other hand, its extensibility and novelty
renew questions around data integration, quality of data,
governance, data security, and a host of other issues that
organizations with extremely mature BI processes have long
taken for granted. Even with the lots of challenges of
integrating Hadoop into a traditional BI environment, ETL
has confirmed to be a frequent use case for Hadoop in
enterprises. Why it is so popular? It is quite easy ETL, ELT,
and ETLT with Apache Hadoop.ETL tools by performing
three functions moves data from one place to another:
A. Extract data from ERP or CRM applications.
During the extract step, we may require to gather data from
numerous source systems and in various file formats, such as
flat files with delimiters (CSV) and XML files. We may also
need to collect data from legacy systems which store data in
B. Convert that data into a common format that fits other data
in the warehouse.
appears to be impervious to the charms of ETL tools, like
Oracle Warehouse Builder,* which can generate code for
databases.
Code generators also have some boundaries, since they work
with only a limited set of databases and are frequently
bundled with them. In contrast, the next generation of ETL
tools includes a general-purpose engine which performs the
transformation as well as set of metadata that stores the
transformation logic. Because engine-based ETL tools like
Pentaho Kettle* and Informatica Powercenter* are
independent of source and target information stores, they are
more versatile than code generating tools.
A traditional ETL architecture (Figure 3) accommodates
several ETL iterations as well as an intermediate step,
performed in the ―staging area,‖ which gets data out of the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
source system as quickly as possible. A staging area may use
a database or just plain CSV files, which makes the process
quicker than inserting data into a database table.
Much has changed in data warehousing over the past two
decades. Databases have become vastly more powerful.
RDBMS engines currently support complex transformations
in SQL, including in-database data mining, data quality
validation, profiling, statistical algorithms, cleansing,
hierarchical as well as drill-down functionality etc. It has turn
out to be more efficient to execute most types of
―transformation‖ within the RDBMS engine.
As a result, ELT emerged as a substitution approach in which
data is extracted from the sources and then loaded into the
target database, and afterwards transformed plus integrated
into the required format. All the heavy data processing takes
place within the target database. The benefit of this approach
is that a database system is much better suited for handling
huge workloads for which hundreds of millions of records
need to be integrated. RDBMS engines are too optimized for
disk I/O, which increases throughput. As long as the RDBMS
hardware scales up, the system performance scales with it.
But ETL is not dead yet. Traditional ETL vendors have
improved their tools with addition of pushdown SQL
capabilities in which transformation can also take place either
in the ETL engine (for operations not supported by the target
database) or after loading inside the database. The end result
is the ETLT approach, supported in the same way by leading
database vendors like Microsoft (SQL Server Integration
Services) and Oracle (Oracle Warehouse Builder).
Not any of these solutions is cheap or simple, and their cost
and complexity are compounded by big data. Consider eBay,
which in 2011 had over 200 million, items for sale, broken up
into 50,000 categories, and bought also sold via 100 million
registered users— all of which entailed approximately 9
petabytes of data. Google reportedly processes over 24
petabytes of data for every day. AT&T processes 19 petabytes
with the help of their networks every day, and the video game
World of War craft uses 1.3 petabytes of storage space. All of
these calculated figures are already out-of-date as of writing
paper because online data is growing so fast.
Under these conditions, Hadoop brings at least two most
significant advantages to traditional ETLT:
1) Ingest huge amounts of data exclusive of specifying a
schema on write. An important characteristic of Hadoop is
called ―no schema on- write,‖ states that there is no need to
pre-define the data schema before loading data into Hadoop.
This is not only true for structured data (such as point-of-sale
transactions and call detail records, ledger transactions, as
well as call center transactions), but also for unstructured data
(like user comments, doctor’s notes, detail of insurance
claims, and web logs) and social media data (from sites such
as Facebook, LinkedIn, Pinterest, and Twitter). Despite of
whether our arriving data has explicit or implicit structure, we
can quickly load it as-is into Hadoop, where it is available for
further process (downstream analytic processes).
2) Offload the transformation of raw data by parallel
processing at scale. Once the data is in Hadoop, we can
execute the traditional ETL tasks like cleansing, normalizing
data, aligning, also aggregating data for our EDW by
employing the massive scalability of MapReduce. Hadoop
allows us to avoid the transformation bottleneck in our usual
367
ISBN: 978-81-924893-0-8
Supplementary ETL iterations may be implemented to move
data from the EDW into data marts that support particular
analytic purposes and end user tools.
ETLT by off-loading the ingestion, transformation, and
integration of unstructured data into your data warehouse
(Figure 4). Because Hadoop enables you to embrace
additional data types than ever before, it enriches our data
warehouse in various ways that would otherwise be infeasible
or prohibitive. Because of its scalable performance, we can
drastically increase speed of the ETLT jobs. Furthermore,
because data stored in Hadoop can persist over a much longer
duration, we can grant more granular, detailed data through
your EDW for high-fidelity analysis.
IV. OFFLOAD ETL WITH HADOOP
By Using Hadoop in this manner, the organization gains an
additional ability to Store as well as to access data that they
―might‖ need, huge data which may never be loaded into the
data warehouse. For example, data scientists might wish to
make use of the large amounts of source data from social
media, web logs, or third-party stores (from curators, such as
data.gov) stored on Hadoop to enhance new analytic models
that drive research and discovery. They can store the available
data cost effectively in Hadoop, and get back it as needed by
using Hive or other analytic tools native to the platform,
without affecting the EDW environment.
Regardless of whether your enterprise takes the ETL, ELT, or
ETLT approach to data warehousing, we can cut the
operational cost of our overall BI/DW solution by offloading
common transformation pipelines to Apache Hadoop and
using MapReduce on HDFS to make available a scalable,
fault-tolerant platform to process large amounts of
heterogeneous data.
V. PHYSICAL PLANNING FOR ETL
WITH HADOOP
The thumb rule for Hadoop infrastructure planning has long
been to ―throw more nodes at the problem.‖ This is one of the
best approaches where the size of your cluster matches a web-
scale challenge, like a returning search results or sometimes
personalizing web pages for hundreds of millions of people on
shops online. But a usual Hadoop cluster in an enterprise has
around 100 nodes and it is supported by IT resources that are
significantly additional constrained than those of Yahoo! and
Facebook. Organizations which are managing these clusters
must adhere to the planning related to capacity and
performance tuning processes typical of other IT
infrastructures. Later, they need to provision, configure, and
tune their Hadoop cluster for the particular workloads their
businesses run.
Workloads vary widely, so it is essential to select and
configure compute, storage, network, and software
infrastructure to match exact needs. But before considering
each of these issues, let’s examine the general
misunderstanding that all Hadoop workloads are I/O-bound.
From last few years, developers at organizations like Intel
have been testing the performance of successive releases of
Hadoop on successive generations of Intel processor-based
servers using a reference set of test workloads. Many of these
workloads resemble real-world applications, such as ETL and
analytics. On the basis of in-depth instrumentation of the test
clusters, they noticed that I/O and CPU utilization vary
extensively across workloads and within the stages of
MapReduce in every workload.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A. TeraSort (map: CPU bound; reduce: I/O bound) TeraSort
transforms data from one representation to another. As the
size of data remains the same from input throughout shuffle to
O/P, TeraSort tends to be I/O bound. still, when we compress
map output so as to minimize disk and network I/O during the
shuffle phases, TeraSort shows very high utilization of CPU
along with moderate disk I/O during the map and shuffle
phases, moreover moderate CPU utilization as well as heavy
disk I/O during the reduce phase.
B. WordCount (CPU bound) WordCount extracts a small
quantity of interesting information from a huge data set,
which means that the map output and the reduce output are
much smaller than the job input. As a result, the WordCount
workload is mostly CPU bound (especially during the map
stage), with high CPU consumption and light disk and
network input output.
C. Nutch indexing (map: CPU bound; reduce: I/O bound) the
input to this workload is about 2.4 million web pages
generated by crawling Wikipedia. Nutch Indexing
decompresses whole crawl information in the map stage, that
is CPU bound, and then converts intermediate results to
inverted index records in the reduce period, which is I/O
bound.
D. PageRank Search (CPU Bound) The Page Rank workload
represents the original inspiration for Google search which is
based on the PageRank algorithm for link analysis. These
workloads utilize most of its time on iterations of numerous
jobs, and these jobs are normally CPU bound, with low to
medium disk I/O and memory utilization.
E. Bayesian classification (I/O bound) this workload
implements the trainer part of the Naïve Bayesian classifier, a
admired algorithm used for knowledge discovery and data
mining. The workload contains four chained Hadoop jobs
mostly all are disk I/O bound, except for the map tasks of the
initial job, which also have high utilization of CPU and turn
out to be the most time consuming.
F. K-means clustering (CPU Bound in iteration; I/O bound in
clustering) This workload first of all computes the centroid of
each of the cluster by running a Hadoop job iteratively until
iterations converge or the maximum number of iterations is
reached. This is CPU-bound. Later than t, it runs a clustering
job (I/O bound) that assigns each sample to a cluster. Even a
cursory scan of a variety of representative workloads shows
that the system resource utilization of Hadoop is even more
critical for enterprises than it has been for early adopters and
much more complex than many have supposed. Various
companies like Intel have worked strongly with a number of
customers to help out develop and deploy a balanced platform
for diverse real-world deployments of Hadoop. Due to
Company’s assessments and benchmarking efforts have led to
make several recommendations when customers consider
infrastructure hardware and distributions of Apache Hadoop
software.
A processor from family of The Intel® Xeon® E5 provides a
strong foundation for many Hadoop workloads. A number of
inbuilt features into the Intel Xeon processor E5 family are
mostly well suited for Hadoop. One of the feature is Intel®
Integrated I/O, which helps in reduction of I/O latency by up
to 32 percent and increases I/O bandwidth by as much as 2x.2,
3 Another we have is Intel® Data Direct I/O Technology
(DDIO), which allows Ethernet adapters to communicate
368
ISBN: 978-81-924893-0-8
directly with processor cache memory, rather than only with
main memory. This feature helps to deliver more I/O
bandwidth along with lower latency, which is mainly
beneficial when processing large data sets.
Another important feature that has captured the attention of
Hadoop users is Advanced Encryption Standard New
Instructions (AES-NI), which accelerates ordinary
cryptographic functions to remove the performance
consequence typically associated with encryption and
decryption of big-data files.
In several surveys conducted by Gartner we came to know
that power and cooling issues were the largest challenge they
are faced in the data center.4 Maximizing energy-efficiency
can be mostly important for Hadoop clusters, which grow
with data volume.
With its system design on a chip (SoC) and power envelopes
as low as 6 watts, the Intel® Atom™ processor offers
improved density and energy efficiency for a few workloads.
Since Intel Atom processors are based on the industrial-
standard x86 instruction set, they are much more compatible
with all application code which runs on Intel Xeon processors.
This helps to cut total cost of ownership by reducing various
costs like software development, porting, and system
management costs. Adding together, Intel organization offers
a power and thermal management software creation called
Intel® Data Center Manager (Intel® DCM). Intel DCM uses
the instrumentation in Intel Xeon and upcoming Intel Atom
processors and integrates with existing management consoles
using standard APIs. We can utilize it to monitor power plus
thermal data in real time for individual servers and blades, and
also for racks, rows as well as logical server groupings. We
can cap power by means of set limits or workload-related
policies, can configure alerts for power and thermal events,
and we can store and analyze data to perk up capacity
planning.
VI. MEMORY
Enough system memory is necessary for high-throughput of
big numbers of parallel MapReduce tasks. Hadoop naturally
requires 48 GB to 96 GB of RAM per server, and 64 GB is
optimal in most of the cases. Always balance server memory
across offered memory channels to keep away from memory-
bandwidth bottlenecks.
Memory errors is one of the most common reason of server
failure and data corruption, so error-correcting code (ECC)
memory is highly suggested.5 ECC is supported in servers
which are based on Intel Xeon processors family whereas in
micro-servers based on the Intel Atom processor family.
VII.STORAGE
Every server in a Hadoop cluster needs a relatively large
number of storage drives to avoid Input output bottlenecks.
Two hard drives per processor core usually deliver excellent
results. However, a single solid-state (SSD) drive per core can
deliver higher I/O throughput, reduced latency, and improve
overall cluster performance. Intel® SSD 710 Series SATA
SSDs offer significantly faster read/write performance as
compared to mechanical hard drives, and this extra
performance can be helpful for latency sensitive MapReduce
applications. . Moreover It can accelerate jobs as intermediate
outcome files are shuffled between the map and the reduce
phase. Intel Company tests show that by replacing mechanical
drives with Intel SSDs can boost performance approximately
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
80 percent. We can use mechanical drives and SSDs both
together, using Intel® Cache Acceleration Software. This
storage model provides some of the performance benefits of
SSDs at a lower cost.
If we use hard drives, 7,200 RPM SATA drives provide an
excellent balance among cost and performance. Run the
drives in the Advanced Host Controller Interface (AHCI)
mode with Native Command Queuing (NCQ) enabled to
improve the performance when multiple read and write
requests are invoked at the same time. Although we can use
RAID 0 to logically combine smaller drives into a larger pool,
RAID is not recommended because Hadoop automatically
orchestrates data provisioning and redundancy across nodes.
VIII. NETWORK
A fast network not only allows data to be imported and
exported quickly, but can also improve performance for the
shuffle phase of MapReduce applications. A 10 Gigabit
Ethernet network provides a simple, cost-effective solution.
Intel tests have shown that using 10 Gigabit Ethernet rather
than 1 Gigabit Ethernet in a Hadoop cluster can improve
performance for key operations by up to 4x when using
conventional hard drives. The performance improvement is
even greater when using SSDs—up to 6x.7 the greater
improvement with SSDs can be attributed to faster writes into
the storage subsystem.
As a Hadoop cluster grows to include multiple server racks,
we can improve network performance by connecting each of
the 10 Gigabit Ethernet rack-level switches to a 40 Gigabit
Ethernet cluster-level switch. As requirements continue to
rise, we can interconnect multiple cluster level switches
moreover include an uplink to a higher-level switching
infrastructure.
IX.SOFTWARE
Apache Hadoop is one of the open source software that is
available free of cost from the apache.org source code
repository. A few numbers of early adopters and test
deployments can directly download the source and make their
platform based on the Apache Hadoop distribution.
Enterprises that require a vendor-supported platform, though,
look to one of several independent software vendors (ISVs) to
provide a entire product with various software, latest updates,
and services. The Intel® Distribution for Apache Hadoop
software (Intel® Distribution) is an enterprise-grade s//w
platform that includes Apache Hadoop together with other
software components. The Intel Distribution contains a
number of exceptional features.
A. Built from the silicon up for performance and security.
Running the Intel Distribution on Intel® processors enables
Hadoop to fully utilize the performance and security features
available in the x86 instruction set in general and the Intel
Xeon processor in particular. For example, the Intel
Distribution includes enhancements that take advantage of
Intel AES-NI, available in Intel Xeon processors, to accelerate
cryptographic functions, moreover erasing the usual
performance consequence of encryption and decryption of
files in HDFS.
B. Automated performance tuning.
This integrated method saves time during delivering a more
optimized configuration. The Intel Distribution also includes a
management console which provides an intelligent and
369
ISBN: 978-81-924893-0-8
powerful mechanism for configuring the Hadoop cluster. Intel
Active Tuner uses a genetic algorithm to try a variety of
parameters and converge quickly on the optimal configuration
for a given application of Hadoop.
C. Supports for a broad range of analytic applications.
X. CONCLUSION
The recent technology of big data is generating new
opportunities and new challenges for businesses across every
organization. The challenge of data integration—
incorporating data available from social media and all other
unstructured data into a traditional BI environment—is one of
the most burning issues in front of CIOs and IT managers.
Apache Hadoop gives us a cost-effective and scalable
platform for ingesting big data sets and preparing it for
analysis. Hadoop can be used to offload the traditional ETL
processes and can decrease time to analysis by hours or even
days. Running the Hadoop cluster economically means
selecting an optimal infrastructure of servers, storage,
networking, and software. Companies like Intel provide
software as well as hardware platform components to help our
design and deploy an efficient, high-performing Hadoop
cluster optimized for big data ETL. We can take advantage of
suggested architectures; available training, specialized
services, as well as technical and scientific support provided
by the company like Intel to speed up our deployment and
help to reduce risk.
REFERENCES
[1] Hadoop HDFS User Guide at
http://hadoop.apache.org/common/docs/current/hdfs_use
r_guide.html.Ding, W. and Marchionini, G. 1997 A
Study on Video Browsing Strategies. Technical Report.
University of Maryland at College Park.
[2] Hadoop Map-Reduce Tutorial at
http://hadoop.apache.org/common/docs/current/mapred_t
utorial.htmlTavel, P. 2007 Modeling and Simulation
Design. AK Peters Ltd.
[3] The Age of Big Data. Steve Lohr. New York Times, Feb
11, 2012. http://www.nytimes.com/2012/02/12/sunday-
review/big-datas-impact-in-the-world.htmlForman, G.
2003. An extensive empirical study of feature selection
metrics for text classification. J. Mach. Learn. Res. 3
(Mar. 2003), 1289-1305.
[4] Big data: The next frontier for innovation, competition,
and productivity. James Manyika, Michael Chui, Brad
Brown, Jacques Bughin, Richard Dobbs, Charles
Roxburgh, and Angela Hung Byers. McKinsey Global
Institute. May 2011.
[5] Dumbill, Edd. What is big data? An introduction to the
big data landscape. O'Reilly Radar. [Online] 11 January
2012 at http://radar.oreilly.com/2012/01/what-is-big-
data.html.
[6] Apache Hive. http://sortbenchmark.org/
[7] HADOOP-3759: Provide ability to run memory intensive
jobs without affecting other running tasks on the nodes.
https://issues.apache.org/jira/browse/HADOOP-3759
[8] J. Dean and S. Ghemawat, ―MapReduce: Simplified data
processing on large clusters,‖ in USENIXSymposium on
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Operating Systems Design and Implementation, San [13] MIKE 2.0, Big Data Definition,
Francisco, CA, Dec. 2004, pp. 137–150 http://mike2.openmethodology.org/wiki/Big
_Data_Definition
[9] Jefry Dean and Sanjay Ghemwat, MapReduce:A Flexible
Data Processing Tool, Communications of the ACM, [14] A Navint Partners White Paper, ―Why is BIG Data
Volume 53, Issuse.1,January 2010. Important?‖ May 2012,
http://www.navint.com/images/Big.Data.pdf.
[10] MarcinJedyk, MAKING BIG DATA, SMALL, Using
distributed systems for processing, analysing and [15] http://bigdataarchitecture.com/
managing large huge data sets, Software Professional‟s
Network, Cheshire Data systems Ltd [16] http://www.informationweek.com/software/business-
intelligence/sas-gets-hip-tohadoop-for-big-
[11] Brad Brown, Michael Chui, and James Manyika, Are data/240009035?pgno=2
you ready for the era of „big
data‟?,McKinseyQuaterly,Mckinsey Global Institute, [17] G. Noseworthy, Infographic: Managing the Big Flood of
October 2011. Big Data in Digital Marketing, 2012
http://analyzingmedia.com/2012/infographic-big-flood-
[12] DunrenChe, MejdlSafran, and ZhiyongPeng, From Big of-big-data-in-digitalmarketing/
Data to Big Data Mining: Challenges, Issues, and
Opportunities, DASFAA Workshops 2013, LNCS 7827,
pp. 1–15, 2013.

Figure 2. MapReduce, the programming paradigm implemented by Apache Hadoop, distribute a batch job into several smaller tasks for parallel
processing on a distributed system. HDFS, the distributed file system stores the data reliably.

370
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure 1. A traditional ETL process

Figure 3. The traditional ETL architecture has served enterprises well for the past 20 years and many deployments still use it.

Figure 4. Using Apache Hadoop,* any organization can ingest, process, as well as export huge amounts of diverse data at scale.

371
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Gateway Based Energey Efficient Protocol For

Wireless Sensor Network
Maninder Jeet Kaur Avinash Jethi
BGIET,Sangrur, Punjab India BGIET,Sangrur, Punjab India
maninderkaur865@gmail.com avinashjethi@ymail.com

ABSTRACT
In the research of the wireless sensor networks Energy
conservation is the main issue. For designing an efficient
protocol for WSN, it is important to monitor the energy
usage of the network. Further the energy usage by a WSN
depends upon the design of network. So there are number
of protocols which are used for designing the structure of
network for WSN.

These protocols are mainly of two types single hop &

multihop energy efficient protocols. But still there is a wide
scope of improvement and research.In this research paper ,
we implement and analyze the results of basic SEP(Stable
Ellection Protocol)for WSN. Also proposed a gateway
based energy efficient , protocol for wireless sensor
networks .Which utilizes minimum energy and resolve the
issue of long distance between sink and sensing nodes.
Proposed protocols can resolved the problems of SEP such
as long distance etc. up to some extent.
Keywords: Wireless Sensor Network, Mobile
Gateway, Clustering, Life time, Multi-hop.
2. INTRODUCTION
A wireless sensor network (WSN) (sometimes called a
wireless sensor and actor network (WSAN) of spatially
distributed to monitor physical or environmental
conditions, such as temperature, sound, pressure, etc. and to
cooperatively pass their data through the network to a main
location. The more modern networks are bi-directional,
also enabling control of sensor activity. The development
of wireless sensor networks was motivated by military
applications such as battlefield surveillance; today such
networks are used in many industrial and consumer
applications, such as industrial process monitoring and
control, machine health monitoring, and so on.
Fig:-Clustering in WSNs.
2. RELATED WORK
Energy consumption and network lifetime are the most
important features in the design of the Wireless Sensor
Network. This study present clustering based routing for
WSNs. Many clustering based protocols are homogeneous
,such as LEACH,PEGASIS,HEED etc. In these type of
mechanisms CHs collect data from its member nodes and
then forward it to the base station. This process overloads
the CH and it consumes lots of energy. LEACH is the basic
protocol for all other protocols of WSNs. In LEACH CHs
are selected periodically and consume uniform energy by
selecting a new Ch in each round. A node become CH in
current round on the basis of probability p. LEACH
performs well in homogeneous network. But this protocol
not considered good for heterogeneous networks.
In [2] author introduce an approach in which a new
heterogeneous network with different types of nodes
having different initial energy levels have been considered
which is called SEP (Stable Election Protocol) for WSN.
Then they compare SEP with existing protocols like
LEACH,DEEC etc in terms of life time and energy
consumption. Nodes in SEP are heterogeneous I terms of
their initial energy i.e called normal nodes and advance
nodes. The probability to become CH depends upon the
initial energy of the node. It is found that SEP provides
better network lifetime than the existing protocols. He

372
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

proposed new EEEP protocol for heterogeneous WSNs. ETx (k,d)= ETx elec (k)+ ETx  amp (k,d)........(i)
which gives better performance as compared to SEP.

In [3] author analyzed the principle of SEP in wireless
sensor networks (WSNs).He proposed a multi-hop routing
scheme (MH-SEP) based on different spatial density of
nodes. The network is to be divided into different sizes of
areas according to the multi-hop routing scheme. CH‟s are
connected via multi-hop communication algorithm. like
spanning tree. where BS is at root. This paper mainly
analysis the performance of scheme based on different
spatial density of nodes. It worked at minimum
communication energy consumption. Because with the
increase of the monitoring area, the space density
decreases. The advantage of the MH-SEP is more as
comparing with SEP.
In [4] author proposed MEEP(Multi-hop Energy Efficient
Protocol) for Heterogeneous Wireless Sensor Network. The
proposed protocol combines the idea of clustering and
multi-hop communication. Heterogeneity is created in the
network by using some nodes of high energy. Low energy
nodes are selected as CH based on there residual energy.
High energy nodes act as the relay nodes for low energy
cluster head. when they are not performing the duty of a
cluster head to save their energy further. Result shows that
proposed scheme is better than the SEP in energy
efficiency and network lifetime.
ETx (k,d)= E elec *k +  amp *k* d 2 ...........(ii)
and to receive this message, the radio expends:
E Rx (k)= E Rx elec (k)
E Rx (k)= E elec *k
4. SIMULATION SET UP
The total number of sensors nodes be N which are
distributed randomly over the field. The number of nodes in
the network can be taken as 100 as optimal values and
which can be increased from 100 to 1000 for different
protocols.
The maximum distance of any node from the sink is
approximately 70m.The initial energy of a normal node is
set to E0 = 0.5 Joules. The base station with „x‟ is located
at the center of the field with point (100, 100).
The size of the message that nodes send to their cluster
heads as well as the size of the (aggregate) message that a
cluster head sends to the sink is set to 4000 bits.
The radio characteristics used in our

simulations are s ummarized in Table I.

3. RADIO ENERGY DISSIPATION Table 1: Parameters settings
MODEL
We assumed a simple model for the radio hardware energy
dissipation where the transmitter dissipates energy to run
the
radio electronics and the power amplifier, and the receiver
dissipates energy to run the radio electronics as shown in
figure A. Using this radio model, to transmit k-bit message
at distance d the radio expends:

Fig. A: Radio energy dissipation model

373
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5.SIMULATION RESULTS OF SEP
5.1Graph showing packets send to Cluster head in SEP
: The graph showing packets or data send to Cluster head is
as shown below:
Figure 5.3: SEP packets to Cluster Head
5.2Graph showing packets send to Base Station in case
of SEP: The graph showing packets or data send to base
station is as shown below:
Figure 5.7: SEP packets to Base Station
5.3Graph showing energy dissipted in SEP : The graph
showing energy dissipated is as shown below:
374
ISBN: 978-81-924893-0-8
Figure 5.11: SEP energy dissipation
5.4Graph showing dead nodes in case of SEP: The graph
showing dead nodes in case of SEP is as shown below:
Figure 5.15: Dead nodes in SEP
6. PROPOSED WORK
After the study of the various present protocols for
heterogeneous/homogeneous WSNs ,we proposed a new
energy efficient scheme for heterogeneous WSNs. Which
will use gateway nodes between cluster heads and sink.
These gateway nodes will be mobile which can move all
around the sensing field. These nodes are rechargeable. It is
possible to solve the problem of long distance between
cluster head and sink. This proposed work can also
improved the lifetime and energy consumption of the
WSNs. After set up a WSN it is difficult to replace a sensor
within the whole circuit. So an efficient network designing
technique is always required for further enhancement.
There are number of single hop energy efficient protocols
that are used for design energy efficient network design for
wireless sensor network like LEACH,SEP,MEEP etc. But
the scope of improvement is still there. Because in all these
protocols CH‟s are overloaded because cluster heads have
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
the responsibility to collect the data from all other member
nodes and aggregate it & then send to the base station. To
do this CH consume a large amount of energy. Proposed
technique can also resolve this problem.
Fig:-Nearly Layout Our Proposed work
Gateway nodes
Cluster Head
Normal Nodes
X Sink
6.CONCLUSION
After the analysis of basic SEP we find above results. But
its results can also be improved further by modifying the
network structure. There is also a scope of improvement in
the types of nodes that are used in the network for data
transmission.
375
ISBN: 978-81-924893-0-8
REFERENCES
[1]Pallavi Jain and Harminder Kaur 2014 volume 4.”An
Improved Gateway Based Multi Hop Routing Protocol
For Wireless Sensor Network”. . International Journal of
Information and Computation Technology.
[2] Chengzhi Long, et al. December2012 “A Multi-Hop
Routng Scheme Based On Different Spatial Density Of
Nodes in WSN‟S”. Journal of Theoretical and Applied
Information Technology.Vol.46 No.1.
[3] Amanjot Singh Toor 2013 “Implementation and
Analysis of Stable Election Protocol”, International Journal
of Advanced Research in Computer Science and Software
Engineering.Vol.3,Issue 9.
[4] Surender Kumar,M.Parteek,et.al March 2014 “Multi-
hop Energy Efficient Protocol for Heterogeneous Wireless
Sensor Network” . International Journal of Computer
Science and Telecommunications.Vol.5,Issue 3.
[5] Pallavi Jain (2014) “ An Improved Gateway Based
Multi Hop Routing Protocol for Wireless Sensor Network”
International Journal of Information & Computation
Technology. Vol.4.No 15,pp.1567-1574.
[6] Jin Wang ; Jian Shen et al.(2013) “An Improved Stable
Election Based Routing Protocol with Mobile Sink for
WSN” IEEE International Conference on and IEEE cyber.
Pages:945-950
[7] Chunyao FU,Zhifang JIANG et al. 2013 vol.10. “An
Energy Balanced Algorithm of LEACH Protocol in
WSN.IJCSI . International Journal of Computer Science
Issues.
[8]Rajesh Patel,Sunil Pariyani et.al 2011 International
Journal of Computer
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Literature survey of AODV and DSR reactive routing
protocols.
Charu Sharma1
Department of CSE
Rayat Bahra Institute of Engg. & Tech.
Patiala, Punjab
charusharma23s@gmail.com
ABSTRACT
MANET(mobile ad-hoc networks) is a type of network in
which mobile nodes communicate to each other via radio
waves. MANET is self configuring, infrastructure-less and
robust network that’s why nowadays its routing protocols
become active research area. In this paper , literature survey
of on-demand AODV and DSR routing protocols is to be
discussed with their comparison.
Keywords
Ad-hoc network, AODV, DSR, MANET.
1. INTRODUCTION
Ad-hoc network provides wireless communication among
nodes in a network and the participated nodes acts as routers
also when they are used as intermediate nodes between the
source node and the destination node for data transmission
beyond the network range. Ad hoc network is the vast and an
emerging research area which has created its efficient
application known as MANET.
MANET provides rapid deployment, flexibility, robustness,
energy efficiency , self administration, fully distribution to
the ad-hoc networks. MANET provides various routing
protocols to make the communication among nodes effective
and efficient.
MANET categorizes its routing protocols into three
categories:
Table-driven or pro-active routing protocol: In this
protocol, each node has its own routing table containing
routing information of every other node and these routing
tables get updated periodically to maintain latest view of
routes in the network. So this consumes more battery power.
This is used only when a source node requires a path to the
destination node for some data transmission. Some pro-active
routing protocols are DSDV, DSF. GSR, WRP,ZRP and many
more[8].
On- demand driven or reactive protocols: In this, there
are no predefined routing tables to each node. The router or
paths are discovered on-demand , when one node requires to
transmit some data to another node. So this saves the battery
power by discovering routes when needed only Each node has
route cache instead of routing table for keeping all
information of all latest paths from source to destination.
DSR, AODV,TORA, ABR etc are some reactive routing
protocols.
376
ISBN: 978-81-924893-0-8
Harpreet kaur2
Department of CSE
Rayat Bahra Institute of Engg. & Tech.
Patiala, Punjab
preet.harry11@gmail.com
Hybrid routing protocols[16]: These are the
combination of both proactive and reactive protocols and take
benefits of both. Due to this combination routes can be found
easily and fastly in the network area. Some hybrid routing
protocols are ZRP, Hazy Sighted Link State etc.
Section 2 of this paper gives an overview of MANETs
background because for discussing anything , we should have
a little knowledge of its root concepts.
Section 3 provides description of AODV and DSR protocols.
Their work with their advantages and disadvantages are also
mentioned in this.
Section 4 includes the survey to be done on both AODV and
DSR protocol. This describes different works to be done on
these routing protocols. Some of the papers also provide their
performance comparisons with different parameters and
different scenarios.
Section 5 gives the conclusion of this survey paper.
Section 6 gives the description of resources which are used for
the whole survey.
2. BACKGROUND
Routing is the process of transferring information from source
node to destination node in a network. Routing is categorized
as static and dynamic routing. Static routing [5] refers to the
routing strategy being stated manually or statically in the
router. Static routing maintains a routing table usually written
by a network administration. The routing table doesn’t depend
on whether the destination is active or not. Dynamic routing
enables routers to select routes according to real time
changing network topologies. It allows creation, maintenance
and updation of routing tables dynamically. All this can be
done when the destination is active.
Several routing algorithms are to be discovered for
ad-hoc networks with their advantages and disadvantages.
Among MANET’s routing protocols reactive routing
protocols are more suitable than proactive one[9]. In reactive
routing there are two phases: route discovery and route
maintenance. The route discovery phase depends on the route
request(RREQ) and route reply(RREP) queries on recycle
basis which increases the cost and decreases the performance
of network. To decrease the cost two techniques are used that
are route caching[6] and local flooding.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3. DESCRIPTION OF REACTIVE
PROTOCOLS
A. AODV
AODV is on-demand extension of the dynamic sequenced
distance vector(DSDV) protocol[2].
Route discovery: When a node finds that there is no available
route to its destination then the source node start its route
discovery process by broadcasting the RREQ query to all the
neighboring nodes. This RREQ query includes source ID,
destination ID, a sequence number of the source, a last known
sequence number of the destination and max. number of hops
the RREQ can be forwarded. Nodes receiving this RREQ
query check whether they already have seen this RREQ, if so
then they drop the RREQ query. If the RREQ query has not
been seen before then they simply increments the hop count
and rebroadcasts the RREQ query. If an intermediate node has
the route to the destination having sequenced number equal to
or greater than the last sequence number of the destination
mentioned in RREQ query, then it generates the RREP query.
Otherwise it just stores the information regarding the previous
hop from which it receives the RREQ query. This information
will be during RREP process. The destination node after
receiving RREQ query, copy all the information included in
RREQ query and generates a RREP query with updated
sequenced number. This RREP query unicast back to the
source node. This is the route discovery phase of AODV
protocol. Route maintenance phase: The source node sends
HELLO messages periodically to destination node to check its
route activeness. If a HELLO from an active node is not
received within specific time interval, the route is considered
unreachable, a route error query (RERR) is broadcast to all
nodes and another cycle of RREQ query is broadcasted. As
only active routes can be used to send data packets, the route
table also contains invalids routes for an extended period of
time. These invalid routes can provide information for
repairing routes and for later RREQ queries. After some time
interval, these invalid routes will be deleted.
B. DSR
DSR is Dynamic Source Routing Protocol. This also has two
mechanisms: route discovery and route maintenance .When a
source node needed to send the data to a destined node then its
searches the route in its route cache first and initiate route
discovery process by issuing RREQ query and RREP queries
.When route failure occur, DSR sends RERR query to source
for new route. Unlike AODV, DSR do not require sending of
any periodic route maintenance messages. Each data packet
sent then carries in its header the complete, ordered list of
nodes through which the packet must pass, allowing packet
routing to be loop free and avoiding the need for up-to-date
routing information in the intermediate nodes[5] . In DSR ,
the new route discovery overhead can be avoided by using
caching strategy of multiple routes to a destination occur.
4. RELATED WORK
Asad Amir Pirzada and Chris McDonald[1], proposed an
efficient scheme for securing the AODV routing protocol
protects the MANET from various attacks carryout by
malicious nodes. This proposed protocol worked in three
parts: key exchange, secure routing and data protection. This
applies a registration with certification authority constraint on
the nodes before joining any network. Then session keys are
377
ISBN: 978-81-924893-0-8
used by key exchange protocols. For route discovery, keys are
used in point –to point encryption and for data packets, keys
are used in end to end encryption. To protect the network
from attacks done by malicious nodes, some key verification
and multilayered enciphering schemes are used.
Kulasekaran A. Sivakumar, Mahalingam Ramkumar
[2]proposed some modifications in the SAODV routing
protocol to make it more secure and generates SAODV-2
protocol .The SAODV-2 protocol uses proactive
maintenance of a secure reliable delivery neighborhood by
each node and uses the BE based authentication strategy for
mutable fields. To do these modifications a two hop secret is
used by just maintaining one hop topology and without the
knowledge of the two hop topology.
Alekha Kumar Mishra, Bibhu Dutta Sahoo [3]
discuses various security threats for the AODV protocol in
MANET . Due to lack of resources, MANETs are facing some
challenges therefore the analyzation of such challenges or
types of attacks on the protocols is must for making it more
efficient and better performance. Security threats discussed in
this paper are attacks done by modifications and
impersonation, using fabrication, atomic and compound
misuses.
FAN Ya-qin, FAN Wen-yong, WANG Lin-zhu[4]
analyses the performance of DSR routing protocol using
OPNET simulation tool with different sizes of MANET
models in which no. of nodes varies. The performance metrics
used are average route discovery time, average route length,
throughput, data network latency and data loss rate. The result
concluded is that DSR is suitable for small scale MANET
networks and it is necessary to improve DSR protocol for
large scale MANETs.
Amer O. Abu Salem, Ghassan Samara,Tareq
Alhmiedat[11], evaluates the performance of DSR routing
protocol using NS-2 simulation with parameters including
delivery ratio, end to end delay and throughput based on
different cache sizes and varying speeds. For this evaluation
work was done on 50 nodes in simulation setup with CBR
traffic model. In this paper two caches primary and secondary
are discussed and it is concluded that greater the cache size,
greater will be the end to end delay and vice versa. Based on
this result the best cache size evaluated for high speed should
not more than 10 for primary cache and 20 for secondary
cache. Keeping this in mind a new caching strategy can be
developed in future research.
Nidhi Sharma ,R.M. Sharma[5] analyze AODV and
DSR protocols and compare their performances on NS-2
simulator, in this paper, they have also evaluate the quality of
service with some parameters include packet delivery ratio,
average time delay , routing load overhead. These parameters
were evaluated upon different network sizes and transmission
range of the respective nodes. For evaluation authors setup
minimum and maximum 10 and 45 nodes. This provides a
result that DSR performs better than AODV in less dense
scenarios and AODV outperforms DSR in more dense
scenarios. This gives an idea to evaluate these two protocols
with different other parameters and varying no. of nodes for
future work.
Kumar Prateek , Nimish Arvind , Satish Kumar
Alaria[8], compares the performance of DSDV, AODV, and
DSR routing protocols for MANET using ns-2 simulation.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The AODV and DSR are reactive protocols while DSDV is
proactive protocol. Both these reactive protocols performed
well in high mobility scenarios than DSDV protocol. High
mobility results in highly dynamic topology i.e. frequent route
failures and changes. The DSDV protocol fail to respond real
time changing network topology. Routing overhead in DSDV
protocol remains almost constant. The result explains that
DSR has performed better than all other protocols for delivery
ratio while AODV outperforms for average delay.
Table 1. Difference Between AODV And DSR Routing Protocols
AODV
More routing overhead
Less normalized MAC overhead
Combination of DSR and DSDV mechanisms
It performs better in high mobility
Route discovery process is frequent
Uses one route per destination.
Consumes more battery power
Rely on timer based activities
Uses route tables to check available routes to the destination.
Gather limited routing information
It is more controlled, the fresher route is always chosen.
5. ACKNOWLEDGMENTS
I would like to thank to Er. Harpreet Kaur, AP & H.O.D of
C.S.E Department, Bahra Group of Institute, Bhedpura Patiala
for having faith in me and allowing me to work with all terms
and conditions and advising me time to time about my this
survey paper.
6. REFERENCES
[1] Asad Amir Pirzada and Chris McDonald, 2005,
Secure Routing with the AODV Protocol, Asia-
Pacific Conference on Communications, Perth,
Western Australia, 3 - 5 October.
[2] Kulasekaran A. Sivakumar and Mahalingam
Ramkumar, 2007, Safeguarding Mutable Fields in
AODV Route Discovery Process”, Computer
Communications and Networks, 2007. ICCCN
2007. Proceedings of 16th International Conference
on, 13-16 Aug., 645 – 651, IEEE.
378
ISBN: 978-81-924893-0-8
Amith Khandakar[7],also compares DSR,AODV and
DSDV protocols using NS-2 simulator and metrics taken are
packet delivery factor, end –to- end delay and normalized
routing load with varying number of nodes, speed and pause
time. It also provides step by step scheme based on
assumptions on how to carry out comparative study so that it
can be used for future work. This implementation shows that
DSDV has slighter higher packet delivery factor than AODV
and DSR in all scenarios and DSR has slightly more packet
delivery factor than AODV.
DSR
Less routing overhead
More normalized MAC overhead
Based on source routing
It performs better in low mobility
It has less frequent route discovery process
Uses multiple routes per destination.
Save battery power
Does not rely on timer based activities
Uses routing cache aggressively for route discovering.
Gather large amount of routing information by virtual of SR
It has an implicit mechanism to expire stale routes in the cache or
choose fresher routes.
[3] Alekha Kumar Mishra, Bibhu Dutta Sahoo,2009
,Analysis Of Security Attacks For Aodv Protocol In
Manet, Proceedings of National Conference on
Modern Trends of Operating Systems, page 54-57,
MTOS.
[4] FAN Ya-qin, FAN Wen-yong, WANG Lin-zhu ,
2010, OPNET-based network of MANET routing
protocols DSR Computer Simulation, WASE
International Conference on Information
Engineering, 978-0-7695-4080-1/10 , IEEE ,DOI
10.1109/ICIE.
[5] Nidhi Sharma. ,R.M. Sharma, 2010 ,Provisioning of
Quality of Service in MANETs Performance
Analysis &Comparison (AODV and DSR ). 978-1-
4244-6349-7/10\ IEEE.
[6] Liu Yujun, Han Lincheng, 2010 ,The Research on
an AODV-BRL to Increase Reliability and Reduce
Routing Overhead in MANET, International
Conference on Computer Application and System
Modeling (ICCASM).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[7] Amith Khandakar, 2012, Step by Step Procedural
Comparison of DSR, AODV and DSDV Routing
protocol, 4th International Conference on Computer
Engineering and Technology (ICCET 2012)IPCSIT
vol.40.
[8] Kumar Prateek, Nimish Arvind and Satish Kumar
Alaria, February 2013 ,MANET-Evaluation of
DSDV, AODV and DSR Routing Protocol,
International Journal of Innovations in Engineering
and Technology, Vol. 2 Issue 1.
[9] Rajesh Sharma and Seema Sabharwal, July 2013
,Dynamic Source Routing Protocol (DSR),
International Journal of Advanced Research in
Computer Science and Software Engineering,
Volume 3, Issue 7.
[10] Diya Naresh Vadhwani, Deepak Kulhare and
Megha Singh, , May 2013, Behaviour Analysis Of
Dsr Manet Protocol With Http Traffic Using Opnet
Simulator, International Journal of Innovative
Research in Computer and Communication
Engineering, Vol. 1, Issue 3.
[11] Puneet Mittal, Paramjeet Singh And Shaveta Rani,
August 2013 , Comparison Of DSR Protocol In
Mobile Ad-Hoc Network Simulated With Opnet
14.5 By Varying Internode Distance , IJAIEM,
Volume 2, Issue 8.
[12] Pooja Singh, Anup Bhola, C.K Jha, April 2013 ,
Simulation based Behavioral Study of AODV, DSR,
OLSR and TORA Routing Protocols in Manet ,
International Journal of Computer Applications
(0975 – 8887) Volume 67– No.23.
[13] Amer O. Abu Salem, Ghassan Samara and Tareq
Alhmiedat, February 2014 ,Performance Analysis of
Dynamic Source Routing Protocol, Journal of
Emerging Trends in Computing and Information
Sciences, Vol. 5, No. 2.
379
ISBN: 978-81-924893-0-8
[14] Naisha Taban Khan and Prof. Nitin Agarwal, ,
2014, Adaptive Routing In Mobile Adhoc
Networks And Comparison Between Routing
Protocols Aodv And Dsr For Apu Strategy, IOSR
Journal of Computer Science (IOSR-JCE) e-ISSN:
2278-0661, p-ISSN: 2278-8727, PP 58-65.
[15] Monika Verma#1, Dr. N. C. Barwar , 2014, A
Comparative Analysis of DSR and AODV Protocols
under Blackhole and Grayhole Attacks in MANET.
IJCSIT, Vol. 5 (6).
[16] Jyoti Rani and Dr. Pardeep Kumar Mittal, June
2014, Review of Energy Efficient AODV and DSR
Routing Protocols”, International Journal of
Advanced Research in Computer Science and
Software Engineering, Volume 4, Issue 6.
[17] V. V. Mandhare, R. C. Thool, January 2015 ,
Comparision Estimation of Various Routing
Protocol in Mobile Ad-hoc Network: A Survey,
IJARCSSE, Volume 5, Issue 1.
[18] Mr. Vikas Kumar, Mr. Amit Tyagi, Mr. Amit
Kumar, January 2015 ,Mobile Ad-hoc Network:
Characteristics, Applications, Security Issues,
Challenges and Attacks , IJARCSSE, Volume 5,
Issue 1.
[19] Mostafa Rajabzadeh, Arash Mazidi, Mehdi
Rajabzadeh, January 2015 ,SG-AODV: Smart and
Goal Based AODV for Routing in Mobile Ad hoc
Networks , IJARCSSE, Volume 5, Issue 1.
[20] Harvaneet Kaur, January 2015 ,A Survey on Manet
Routing Protocols, IJARCSSE, Volume 5, Issue 1.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Survey on Data Placement and Workload Scheduling
Algorithms in Heterogeneous Network for Hadoop
Ruchi Mittal
Department of CSE
Rayat Bahra Institute of Engg. & Tech.
Patiala, Punjab
Email: mittal.ruchi29@gmail.com
ABSTRACT
The elastic scalability and fault tolerance of the cloud computing
has led to a wide range of real world applications. However,
processing requirements of Big Data in these applications pose a
humongous challenge for achieving desired performance levels.
MapReduce is an effective parallel distributed programming
model for handling large unstructured datasets in cloud
applications. Hadoop, an open source implementation of the
MapReduce model, is currently being employed for high
performance processing of Big Data. The current Hadoop
implementation considers the nodes of a cluster in a
homogeneous environment where each node has the same
computing capacity and workload. But in real world applications
the nodes may have different computing capacities and
workloads resulting in a heterogeneous environment. In such
heterogeneous environment the default Hadoop implementation
does not yield the expected performance. This paper includes a
survey on the algorithms proposed by different authors on (a)
data placement strategies and (b) workload scheduling for
Hadoop in heterogeneous network.
Keywords
Cloud Computing, Big Data, MapReduce, Hadoop,
Heterogeneous Network.
1. INTRODUCTION
Nowadays there has been an exponential growth in the data
produced every minute. To store, process and analyze such large
volume of data, called Big Data, is proven to be a big challenge
these days. Parallel computing is a method adopted for the
purpose. MapReduce, a programming model is proven to be an
efficient parallel data processing paradigm for large scale
clusters. Hadoop, an open source implementation of the
MapReduce model, can be used developed to process thousands
of megabytes of the data on the Linux platform. Hadoop is also
adopted by Amazon and Facebook for the processing and
analysis of large volumes of data.
The MapReduce model partitions a program into multiple
smaller tasks which are executed individually and in parallel.
The results of them are combined by the model to give a single
output. As compared to earlier parallel programming models,
MapReduce model provides several benefits. First, in this
model, new nodes can be added easily in the cluster without
much modifications and the system works the same. Second, the
system doesn't get much affected on the failure of a single node
as the task is automatically allocated to some other idle node in
the model.
380
ISBN: 978-81-924893-0-8
Harpreet Kaur
Department of CSE
Rayat Bahra Institute of Engg. & Tech.
Patiala, Punjab
Email: preet.harry11@gmail.com
Hadoop is an open source implementation of the MapReduce
model for parallel processing of the large datasets.
Heterogeneity and Data locality are the main factors affecting
the performance of Hadoop system in the Hadoop architecture.
In the classic homogeneous Hadoop system, all the nodes have
the same processing ability and hard disk capacity. All the nodes
are assigned same workloads and data required for their
processing is often local requiring lesser data movement
between the nodes. The data needed to be written in HDFS are
partitioned in to several smaller data blocks of similar size and
are assigned to the nodes equally. In such homogeneous
environment load balancing can be maintained easily.
However in real world applications the nodes may be of
different processing ability and hard disk capacity. With the
default Hadoop strategy, the faster nodes may finish their tasks
with their local data at a great speed. After finishing the task
with local data faster nodes can work with nonlocal data which
may be present on slower nodes which requires more data
movement between the nodes, thus affecting the Hadoop
performance.
The rest of the paper is organized as follows. Section II presents
an overview on the basic terms of the MapReduce programming
model, Hadoop and Hadoop Distributed File System (HDFS).
Section III comprises the work presenting and describing the
different algorithms on the workload scheduling and data
placement strategies. Section IV and Section V explains the
conclusion drawn from the survey and opportunities for future
research work.
2. BACKGROUND
2.1 MapReduce Model
MapReduce is a parallel programming model used for large sets
of data processing in a distributed environment with a large
number of computing nodes. This model is proposed by Google
in 2004. An application which is to be executed in MapReduce
model is called a job and is divided into 'map tasks' and 'reduce
tasks'. This model works on the strategy of 'divide and conquer'.
The large set of data which is stored for processing is divided into
the blocks of same size. These blocks are then allocated to the
nodes which process them in parallel. The result of the blocks
with same map function is composed of <key, value> pairs. The
reduce nodes combine these intermediate outputs and generate
the final output data.
2.2 Hadoop
Hadoop is an open source implementation of the MapReduce
model supported by Apache Software Foundation. Hadoop
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
MapReduce and Hadoop Distributed File System (HDFS) are
two main parts of the Hadoop System. MapReduce handles the
tasks of parallel computing and HDFS manages the data
management. The jobs are classified into tasks and are executed
in parallel by the MapReduce. The data are classified into blocks
and are handled by the HDFS. These tasks and data blocks are
assigned to the nodes of the cluster. Hadoop adopts the
master/slave architecture in which the master is the JobTracker
and slave is the TaskTracker.
JobTracker is responsible for the job scheduling and task
distribution and TaskTracker is responsible for performing the
tasks and to return the result to the JobTracker. These use
heartbeat messages for communication. High-end PC's are not
necessary for high performance computing while working with
Hadoop. Several general PC's can be used for the purpose with
Hadoop with which high performance platform can be build
saving large amounts of money.
2.3 Hadoop Distributed File System
(HDFS)
Fig 1: An overview of HDFS Read and Write [5]
Based on the Google File System, the HDFS is implemented by
Yahoo! which is used with the MapReduce model. In HDFS
(figure 1), the master is the NameNode and slave is the
DataNode. The complete file system and file information is
stored and managed by the NameNode. The files written in the
HDFS are also partitioned into same sized blocks and assigned
Fig 2: An overview of MapReduce Model [5]
381
ISBN: 978-81-924893-0-8
to the DataNode by the NameNode. The data blocks are stored
by the DataNode.
3. RELATED WORK
The structured survey starts from the definition of the terms-
workload scheduling and data placement strategies for Hadoop
which will guide the work description further.
3.1 Workload Scheduling
There are three main schedulers which come along with Hadoop.
These are FIFO, Fair Scheduling and Capacity Scheduling. In
FIFO, all the jobs are loaded into a queue and are scheduled to
execute accordingly as these are loaded in the queue. In Fair
Scheduling, a minimum number of map and reduce slots are
allocated to the jobs, i.e. each job receives a fair share of cluster's
resources. In Capacity Scheduling, each queue shares the cluster's
computational resources according to its priority. These
schedulers were designed to work in the homogeneous network.
But in real world applications, clusters are of different computing
capabilities and storage capacity. So the expected output cannot
be obtained from these in heterogeneous networks. In this, we
present the new scheduling algorithms proposed by different
authors to work in heterogeneous networks to enhance the
Hadoop's performance.
3.2 Data Placement
The data placement strategy of the MapReduce for data
placement consists of two functions: Map and Reduce. Jobs are
divided into map and reduce tasks to be executed by Mapper and
Reducer. First, the input is loaded into the HDFS and data are
partitioned into equal sized data blocks and each block is handled
by the mapper for data processing. As an intermediate output, a
<key, value> pair is generated which is given to the reducer
which merge them generating a single output (figure 2).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1. Proposed Workload Scheduling Algorithms along with their performance.

Author's Name Publication Title Proposed Work Results

Julio C.S. Anjos, Future Generation MRA++: The proposed MRA++ design The new algorithm attains 70%
Ivan Carrera, Computer Systems, Scheduling and considers the heterogeneity of the of more performance gain in 10
Wagner Kolberg, Jan. 2015. data placement on nodes during the distribution of data, Mbps networks by nullifying
Andre Luis MapReduce for scheduling of tasks and in job the introduced delay in setup
Tibols, Luciana heterogeneous control. A training task is set for phase.
B. Arantes, environments information gathering before the
Claudio R. Geyer distribution of data.

Zhou Tang, Min The Journal of An Optimized This paper considers the large data The experimental results show
Liu, Almoalmi Supercomputing, MapReduce processing workflow as DAG which that the schedule length and the
Ammar, Kenli Li, Nov. 2014. Workload consists of MapReduce jobs. The parallel speedup for the
Keqin Li Scheduling proposed algorithm calculates the workflow task can be improved
Algorithm for priorities of the jobs by categorizing with the proposed algorithm.
Heterogeneous them into I/O intensive and
Computing computing intensive and the slots
are allocated accordingly. Then the
workflow is scheduled for the tasks
according to the data locality.

Feng Yan, 7th IEEE Optimizing Power Based on different job types, as large With this scheduler, smaller
Ludmila International and Performance jobs requiring faster output or small jobs can be executed up to 40%
Cherkasova, Conference on Trade-offs of interactive jobs requiring faster faster and the output of large
Zhuoyao Zhang, Cloud Computing, MapReduce Job response time, this scheduler called jobs can be achieved 40%
Evgenia Smirni July 2014. Processing with DyScale, is designed to allocate higher in the simulation study.
Heterogeneous jobs accordingly to fast or slow
Multi-Core cores in a heterogeneous cluster by
Processors creating virtual resource pools by
using priority scheduling.

Jessica Hartog, IEEE International Configuring A In this, the proposed MapReduce The proposed work can
Renan DelValle, Congress on Big MapReduce framework called MARLA, divides improve the performance for
Madhusudhan Data, July 2014 Framework For a task into subtasks and delays the few upgraded nodes but didn’t
Govindaraju, Performance binding of data to the subtask's affect it equally.
Maichael J. Lewis Heterogeneous process.
Clusters

Xiaolong Xu, IEEE Systems Adaptive Task Using ATSDWA, the TaskTrackers The proposed algorithm can be
Lingling Cao, Journal, 2014. Scheduling can adjust themselves according to beneficial for both the
Xinheng Wang Strategy based on the load change at runtime and JobTracker by avoiding its
Dynamic according to their computing overloading and for the
Workload capacity can obtain the tasks while TaskTracker by reducing the
Adjustment realizing the self-regulation. task execution time giving more
(ATSDWA) for stability to the heterogeneous
Heterogeneous Hadoop cluster. It can be
Hadoop Clusters. applied to both heterogeneous
and homogeneous
environments.

382
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1 (Continued)
Author's Name Publication Title Proposed Work Results

Aysan Rasooli, Future COSHH: A A new Hadoop scheduling As compared to the well known
Douglas G. Generation Classification And algorithm is designed and scheduling algorithms-FIFO
Down Computer Optimization implemented considering the and Fair Scheduling, this
Systems, 2014. Based Scheduler heterogeneity both at the algorithm yields moderate
for application and cluster level. output under minimum share
Heterogeneous The main goal of the proposed satisfaction, fairness and
Hadoop Systems algorithm is to improve the locality metrics.
average completion time of jobs.

Bin Ye, Xiaoshe 8th ChinaGrid A Delay In this, by considering the With the proposed scheduler,
Dong, Pengfei Annual Scheduling history time of the completed more jobs can be assigned to
Zheng, Conference, Algorithm based tasks and Delay Scheduler's the suitable slots for better
Zengdong Zhu, IEEE 2013. on History Time in strategy, a new algorithm is performance of the system.
Qiang Liu, Zhe Heterogeneous proposed for multi-user Hadoop
Wang Environments Cluster.

Quan Chen, The Journal of HAT: History The proposed History based The performance of
Minyi Guo, Supercomputing, based Auto- Auto-tuning MapReduce MapReduce applications can be
Qianni Deng, June 2013. Tuning scheduler tunes the weight of increased by 37% with Hadoop
Long Zheng, MapReduce in each map and reduce tasks by and by 16% with LATE
Song Guo, Yao Heterogeneous their value in history tasks and scheduler by applying the
Shen Environments uses them to calculate the proposed HAT scheduler to
progress of current tasks. It then them.
adapts automatically to the
continuous changing
environment by regularly
monitoring the progress of tasks.

Matei Zaharia, 8th USENIX Improving In this, a robust scheduling On Amazon's Elastic Compute
Andy Symposium on MapReduce algorithm, Longest Approximate Cloud, the proposed LATE
Konwinski, Operating Performance in Time to End (LATE), is algorithm performs much better
Anthony D. Systems Design Heterogeneous proposed which uses the than the Hadoop's default
Joseph, Randy and Environments estimated completion times of speculative scheduling
Kartz, Ion Implementation, jobs which are expected to hurt algorithm.
Stocia ACM, 2008. the response time the most.

Quan Chen , 10th IEEE SAMR: A Self- The proposed algorithm In heterogeneous
Daqiang Zhang, International adaptive classifies the nodes into slow environments, the proposed
Minyi Guo, Conference on MapReduce nodes using the historical algorithm reduces the
Qianni Deng, CIT, 2010 Scheduling information and further execution time by 24% for Sort
Song Guo Algorithm In classifies them into slow map applications by 17% for
Heterogeneous nodes and slow reduces nodes. It Wordcount applications as
Environment then launches the backup tasks compared to default Hadoop
in the meanwhile. scheduling mechanism.

Visalakshi P IJCSNS, MapReduce The proposed scheduler executes This maintains a balance
and Karthik TU, April 2011 Scheduler Using at the JobTracker. At the between the CPU bound and IO
Classifiers for JobTracker when a message is bound jobs by effectively
Heterogeneous received by it from the classifying them and
Workloads TaskTracker, the scheduler, from preventing the re-launching of
the list of the MapReduce jobs, the jobs.
selects a task that is expected to
yield maximum throughout.

383
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 2. Proposed Algorithm on Data Placement along with their performance

Author's Name Publication Title Proposed Work Results

Chia-Wei Lee, Elsevier-Big Data A Dynamic Data The proposed Dynamic Data The performance of the
Kuang-Yu Hsieh Research, July Placement Placement (DDP) algorithm algorithm is evaluated on
Sun-Yuan Hsieh , 2014. Strategy for works in two phases: in First two functions- Wordcount
Hung-Chang Hadoop in phase, in the Hadoop distributed and Grep mainly in
Hsiao Heterogeneous file system the input is written heterogeneous environment
Environments and data are allocated to the for Hadoop .The algorithm
nodes and in second phase, the with average improvement
capacity of the nodes is of 14.5% performs 24.7%
calculated and reallocation of better in case of Wordcount
data takes place accordingly. application . And for Grep
application it performs
32.1% better with average
improvement of 23.5%.

Xiaofei Hou, 4th International Dynamic By analyzing the information The simulation results show
Ashwin Kumar T Conference on Big Workload obtained from the log files of that the remaining time of
K, Johnson P Data and Cloud Balancing for Hadoop, this proposed dynamic the tasks, which belong to
Thomas, Vijay Computing, IEEE Hadoop algorithm balances the workload the busiest racks in Hadoop
Vardharajan 2014. MapReduce between the different busiest Cluster, can be decreased by
racks on the Hadoop cluster by more than 50%.
shifting the tasks between them
and idle racks.

Krish K.R., Ali 22nd International ΦSched: A In this, the information regarding As compared to the
Anwar, Ali R. Symposium on Heterogeneity- the behavior of various leading hardware oblivious
Butt Modeling, Analysis Aware Hadoop Hadoop applications in the scheduling, using the
& Simulation of Workflow heterogeneous Hadoop cluster is proposed method
Computer and Scheduler merged into the hardware-aware performance improvement
Telecommunication ΦSched scheduler to improve the of 18.7% can be achieved by
Systems, IEEE resource-application match. An managing four different
2014. instance of Hadoop Distributed clusters. The I/O throughput
File System (HDFS) is also and the average I/O rate can
configured on all the be enhanced by 23% and
participating clusters to ensure 26% respectively with
the data locality. HDFS improvement.

Ashwin Kumar ICACCI, IEEE Dynamic Data In this paper, depending on the For Hadoop with the
T K, Jongyeop 2014. Rebalancing in number of incoming parallel proposed algorithm,
Kim, K M Hadoop MapReduce jobs, the proposed MapReduce job's service
George, Nohpill algorithm balances the data by time can be decreased by
Park dynamically replicating it with 30% and resource utilization
minimum cost of data movement. can be improved up to 50%.

Zhao Li, Yao International OFScheduler: A In this OFScheduler, a dynamic For multipath heterogeneous
Shen, Bin Yao, Journal of Parallel Dynamic network optimizer is proposed cluster, the proposed
Minyi Guo Programming, Network which relieves the network traffic scheduler's simulation
2013. Optimizer for during MapReduce job execution results show 24 ~ 63% better
MapReduce in by reducing the bandwidth performances of MapReduce
Heterogeneous competition. jobs and bandwidth
Cluster utilization.

384
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 2. (Continued)

Author's Name Publication Title Proposed Work Results

Yuanquan Fan, 7th ChinaGrid A Heterogeneity The proposed method first The experimental results
Weiguo Wu, Annual Aware Data computes the nodes computing show that the execution time
Haijun Cao, Huo Conference, IEEE Distribution and capability based on the log is reduced by 5% in
Zhu, Xu Zhao, 2012. Rebalance information about the history Wordcount benchmark and
Wei Wei Method in tasks. Then data is divided into by 9.6% in Sort Benchmark.
Hadoop Cluster different sized blocks according The data locality can also be
to the nodes computing capacity. increased by 18.8% with
Further the dynamic data Wordcount and by 8.3%
migration policy aims at the with Sort benchmark
transfer of data from slow approximately.
DataNode to headmost DataNode
during execution time.

Jiong Xie, Shu International Improving With the proposed method, data Using the proposed data
Yin, Xiaojun Symposium on MapReduce across the nodes can be balanced placement scheme, output of
Ruan, Zhiyang Parallel and Performance adaptively to improve the Wordcount and Grep can be
Ding, Yun Tian, Distributed through Data performance of data intensive increased up to 33.1% and
James Majors, Processing, Placement in application running on Hadoop 10.2% with an average of
Adam Workshops and Heterogeneous cluster. 17.3% and 7.1%.
Manzanares, PhD Forum, 2010. Hadoop Clusters
Xiao Qin

4. CONCLUSION
A lot of research work is being carried out on Hadoop
these days especially for heterogeneous networks. In
homogeneous environment, the nodes utilize the resources
very efficiently. But when the nodes are of different
processing capabilities, i.e. in heterogeneous environment,
the performance of the Hadoop clusters gets affected by
the load imbalance created due to heterogeneity which
causes additional overhead of the data transfers between
the nodes. Due to this we wish to propose an algorithm for
Hadoop in heterogeneous environment and will evaluate
its performance against homogeneous environment.
5. FUTURE SCOPE
According to my survey, there is lot of scope for research
work in the heterogeneous environments. A lot of work
has been proposed for the homogeneous environments.
But in real world applications, homogeneous
environments are impractical. As in real world, nodes are
of heterogeneous nature as they have different computing
capacity and different storage capacity. So, in future,
algorithms can be proposed for heterogeneous
environment for increasing the Hadoop's performance.
6. ACKNOWLEDGEMENTS
I would like to thank Er. Harpreet Kaur, AP & HOD of CSE
Department, Rayat Bahra Group of Institues, Patiala for having
faith in me and guiding me time to time in the completion of this
survey paper.
7. REFERENCES
[1] Julio C.S. Anjos, Ivan Carrera, Wagner Kolberg, Andre Luis
Tibols, Luciana B. Arantes, Claudio R. Geyer, ”MRA++:
Scheduling and data placement on MapReduce for
heterogeneous environments”, in Future Generation Computer
Systems, vol. 42, pp. 22-35, January 2015.
[2] Xiaofei Hou, Ashwin Kumar T K, Johnson P Thomas, Vijay
Vardharajan, “Dynamic Workload Balancing for Hadoop
MapReduce”, in proceedings of 4th International Conference on
Big Data and Cloud Computing, IEEE, Dec. 2014.
[3] Zhou Tang, Min Liu, Almoalmi Ammar, Kenli Li, Keqin Li,
“An Optimized MapReduce Workload Scheduling Algorithm for
Heterogeneous Computing”, in The Journal of Supercomputing,
Nov. 2014.
[4] Krish K.R., Ali Anwar, Ali R. Butt , “ΦSched: A
Heterogeneity-Aware Hadoop Workflow Scheduler”, in
proceedings of 22nd International Symposium on Modelling,
Analysis & Simulation of Computer and Telecommunication
Systems, IEEE, pp. 255-264, Sep. 2014.
[5] Chia-Wei Lee, Kuang-Yu Hsieh Sun-Yuan Hsieh , Hung-
Chang Hsiao, ”A Dynamic Data Placement Strategy for Hadoop
in Heterogeneous Environments ”, in Big Data Research, vol. 1,
pp. 14-22, July 2014.
[6] Feng Yan, Ludmila Cherkasova, Zhuoyao Zhang, Evgenia
Smirni, ”Optimizing Power and Performance Trade-offs of
MapReduce Job Processing with Heterogeneous Multi-Core
Processors”, in proceedings of 7th IEEE International Conference
on Cloud Computing,pp. 240-247, July 2014.
[7] Jessica Hartog, Renan DelValle, Madhusudhan Govindaraju,
Maichael J. Lewis, “Configuring A MapReduce Framework For
Performance Heterogeneous Clusters”, in proceedings of IEEE
International Congress on Big Data, pp. 120-127, July 2014.
[8] Aysan Rasooli, Douglas G. Down, “COSHH: A
Classification and Optimization Based Scheduler for

385
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Heterogeneous Hadoop Systems”, Future Generation Computer
Systems, vol. 36, pp. 1-15, July 2014.
[9] Xiaolong Xu, Lingling Cao, Xinheng Wang, “Adaptive Task
Scheduling Strategy based on Dynamic Workload Adjustment
(ATSDWA) for Heterogeneous Hadoop Clusters”, in IEEE
Systems Journal, issue 99, pp. 1-12, June 2014.
[10] Ashwin Kumar T K, Jongyeop Kim, K M George, Nohpill
Park, “Dynamic Data Rebalancing in Hadoop”, in proceedings
of IEEE/ACIS 13th International Conference on Computer and
Information Science, pp. 315- 320, June 2014.
[11] Zhao Li, Yao Shen, Bin Yao, Minyi Guo, “OFScheduler: A
Dynamic Network Optimizer for MapReduce in Heterogeneous
Cluster”, in International Journal of Parallel Programming, Oct.
2013.
[12] Bin Ye, Xiaoshe Dong, Pengfei Zheng, Zengdong Zhu,
Qiang Liu, Zhe Wang, “A Delay Scheduling Algorithm based on
History Time in Heterogeneous Environments”, in proceedings
of 8th ChinaGrid Annual Conference, IEEE, pp. 86-91, Aug.
2013.
[13] Sutariya Kapil B., Sowmya Kamath S., “Resource Aware
Scheduling in Hadoop for Heterogeneous Workloads based on
Load Estimation”, in proceedings of 4th International Conference
on Computing, Communications and Networking Technologies,
pp. 1-5, July 2013.
[14] Quan Chen, Minyi Guo, Qianni Deng, Long Zheng, Song
Guo, Yao Shen, “HAT: History based Auto-Tuning MapReduce
in Heterogeneous Environments”, in The Journal of
Supercomputing, vol. 64, pp. 1038-1054, June 2013.
[15] Yuanquan Fan, Weiguo Wu, Haijun Cao, Huo Zhu, Xu
Zhao, Wei Wei, “A Heterogeneity Aware Data Distribution and
Rebalance Method in Hadoop Cluster”, in proceedings of 7th
ChinaGrid Annual Conference, IEEE, pp. 255-264, Sep. 2012.
386
ISBN: 978-81-924893-0-8
[16] Visalakshi P and Karthik TU, “MapReduce Scheduler
Using Classifiers for Heterogeneous Workloads”, in IJCSNS,
vol. 11 no. 4, April 2011.
[17] Jiong Xie, Shu Yin, Xiaojun Ruan, Zhiyang Ding, Yun
Tian, James Majors, Adam Manzanares, Xiao Qin, “Improving
MapReduce Performance through Data Placement in
Heterogeneous Hadoop Clusters”, in proceedings of
International Symposium on Parallel and Distributed Processing,
Workshops and PhD Forum, pp. 1-9 Apr. 2010.
[18] Quan Chen ,Daqiang Zhang, Minyi Guo, Qianni
Deng,Song Guo, “SAMR: A Self-adaptive MapReduce
Scheduling Algorithm In Heterogeneous Environment”, in
proceedings of 10th IEEE International Conference on CIT, pp.
2736-2743, 2010.
[19] Matei Zaharia, Andy Konwinski, Anthony D. Joseph,
Randy Kartz, Ion Stocia, “Improving MapReduce Performance
in Heterogeneous Environments”, in proceedings of 8th USENIX
Symposium on Operating Systems Design and Implementation,
pp. 29-42, ACM Press, 2008.
[20] Ivanilton Polato, Reginaldo Re, Alfredo Goldman, Fabio
Kon, “A comprehensive view of Hadoop research”, in Journal of
Network and Computer Applications, vol. 46, pp. 1-25, Nov.
2014.
[21] B G. Babu, Shabeera T P, Madhu Kumar S D, “Dynamic
Colocation Algorithm for Hadoop”, in proceedings of IEEE
International Conference on Advances in Computing,
Communications and Informatics, pp. 2643- 2647, Sep. 2014.
[22] S. Sujitha, Suresh Jaganathan, “Aggrandizing Hadoop in
terms of Node Heterogeneity & Data Locality”, in proceedings
of IEEE International Conference on Smart Structures &
Systems, pp. 145-151, Mar. 2013.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Survey on Parts of Speech Tagging for Indian
Languages
Neetu Aggarwal
BGIET, Sangrur
neetuaggarwal4491@gmail.com
ABSTRACT
This paper describes the survey on POS (Part of Speech)
tagging for various Indian Languages. Various approaches
concerned for POS tagging of sentences written in Indian
languages are discussed in this paper . Indian Languages have
rich morphological effect so a no. of problems occur while
tagging the sentences written in various languages. A lot of
POS tagging work has been done by the researchers for
various languages using different approaches HMM( Hidden
Marcov Model) , SVM (Support Vector Machine) , ME
(Maximum Entropy) etc.
Keywords: Natural Language Processing, Part of Speech
tagging, Tagset, Indian Languages
1. INTRODUCTION
The main objective of Natural Language Processing is to
facilitate the interaction between human and machine. POS
tagging is the process of attaching the best grammar tag like
to each word of a sentence of some language. A word in a
sentence can act as a verb, noun , pronoun , adjective , adverb,
conjunction , preposition etc so POS is defined as the
grammatical information of each word of a sentence. While
assigning a POS tag it is necessary to determine the context of
the word i.e. whether it is acting like a noun, adjective, verb
etc. Sometime a word can act as a noun in one sentence and in
another sentence it can give the sense of verb. So before
selecting a POS tag for a word the exact context of the word
must be clear.
For Indian languages it is a difficult task to assign the correct
POS tag to each word in a sentence because of some unknown
words in Indian languages. The earlier work that has been
done for Indian languages was based rule based approaches.
But the rule-based approach requires efficient language
knowledge and hand written rule. Most of natural language
processing work has been done for Hindi, Tamil, Malayalam
and Marathi and several part-of-speech taggers have been
applied for these languages. The set of tags assigned by a part
of speech tagger may contain just a dozen tags so such a big
tagset can arise the difficulty in the tagging process. POS
tagging is helpful in various NLP tasks like Information
Retrieval, Machine Translation , Information Extracton ,
Speech Recognition etc. For Indian languages researchers
find difficulty in writing linguistic rules for rule based
approaches because of morphological richness . The other
main issue after morphological richness of Indian Languages
is Ambiguity. Researchers have developed some better POS
taggers using various approaches. It is very time consuming
process to assign a POS tag to each word according to its
387
ISBN: 978-81-924893-0-8
Amandeep kaur Randhawa
BGIET,Sangrur
amehak07@gmail.com
context in sentence by hand and that is why POS Tagging is
becoming a popular problems in the field of NLP for study.
2. POS TAGGING APPROACHES
There are three categories for POS tagging called rule based,
Empirical based and Hybrid based . In rule – based tagging
hand – written rules are used . Empirical POS taggers are
further divided into Stochastic based taggers which either
HMM based , or cue-based, that use decision trees or
maximum entropy models. There are two types of stochastic
taggers supervised and unsupervised taggers.
2.1 Rule Based Approach
In rule-based approach handwritten rules and contextual
information is used to assign POS tags to words in training
data. These rules are often known as context frame rules.
For example, a context frame rule might say something
like:“If an ambiguous/unknown word X is preceded by a
Determiner and followed by a Noun, tag it as an
Adjective”.“Brill‟s tagger” is widely used English POS-
tagger that is based on rule-based approach.
2.2 Empirical Based POS tagging Approach
The empirical approach of parts speech tagging is divided in
to two categories: Example-based approach and Stochastic
based approach.
2.2.1 Stochastic based POS tagging
The stochastic approach is helpful to find out the most
frequently used tag for a specific word in the annotated
training data and uses this information to tag that word in the
unannotated text. In stochastic approach various methods are
used like n-grams, maximum-likelihood estimation (MLE) or
Hidden Markov Models (HMM). A large sized training
corpus is required for stochastic approach. Two types of
stochastic approach are:
Supervised models
For using supervised POS Tagging approach a corpus is
required that is pre-annotated. For extracting information
about the tagset , rule sets ,word tag a pre- annotated corpus is
required for supervised tagging approach. For this approach if
the corpus will be large then the results of evaluation will also
be better. Examples for supervised POS taggers are:
Hidden Markov Model (HMM) based POS tagging:
It calculates the probability of a given sequence of tags. By
calculating the probability it specifies the most suitable tag for
a word or token of a sentence that it occurs with the n
previous tags, where the value of n is set to 1, 2 or 3 for
practical purposes. The most useful algorithm for
implementing an n-gram approach is HMM‟s Viterbi
Algorithm for tagging new text.
Support Vector Machines Approach:
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
SVM is a machine learning algorithm has been applied to
various practical problems like NLP. For dealing with all the
requirements of modern NLP technology the SVM Approach
is used , by combining simplicity, flexibility, robustness,
portability and efficiency. This is achieved by offering NLP
researchers a highly customizable sequential tagger generator
and working in the Support Vector Machines (SVM) learning
framework.
Unsupervised models
As in supervised POS tagging approach a pre-annotated
training corpus is required , in unsupervised approach there is
no requirement of a pre-annotated corpus. Instead, researchers
use advanced computational techniques like the Baum-Welch
algorithm to automatically induce tagsets, transformation
rules, etc. For stochastic taggers they either calculate the
probabilistic information or cajole the contextual rules needed
by rule based systems or transformation based systems.
2.3 Transformation-based POS tagging
Approach
In general, a large sized of pre-annotated corpus is required in
supervised tagging approach But in Transformation –based
tagging a pre-annotated corpus is not required. One approach
to automatic rule induction is to run an untagged text through
a tagging model and get the initial output. After getting the
output all the errors are corrected by human manually. Then
the tagger compare the two sets of data to learn the correction
rules. This process is repeated a no.of times so that the tagger
can obtain the better performance.
3. TAGSET
A tag set consist of tags that are used to represent the
grammatical information of the language. The number of tags
used for a language depends upon the amount of information
that we want to represent using a tag. A tagset can be too large
and can consist a dozen of tags. For representing the context
of words in a sentence of training data various tags are used if
a word is acting as a noun then() NN tag is used like this for
Pronoun (PRP) tag , Verb (V), Adjective (JJ) , Conjunction
(CC) can be used. For Punjabi Language Two POS tagger has
been developed and both the taggers consist same tag set. A
new tagset for Punjabi language is suggested by TDIL
(Technical Development of Indian Languages) is used . TDIL
proposed 36 pos tags for Punjabi language.
4. LITERATURE SURVEY FOR INDIAN
LANGUAGES
Different approaches have been used for part-of speech
tagging and different researchers have developed POS taggers
for various languages Foreign Languages like English,
Arabic and other European languages have more POS taggers
than Indian languages. Indian Languages for which POS
taggers have been developed are Hindi, Bengali, Panjabi and
Tamil.
Antony P J and Dr. Soman had presented a survey on
developments of different POS tagger systems as well as POS
tagsets for Indian languages and the existing approaches that
have been used to develop POS tagger tools . They concluded
that almost all existing Indian language POS tagging systems
are based on statistical and hybrid approach.
A CRF (Conditional Random Fields) based part of speech
tagger and chunker for Hindi had been used by Aggarwal
388
ISBN: 978-81-924893-0-8
Himashu and Amni Anirudh. After evaluation they found that
the strength of Conditional Random Fields can be seen on
large training data and CRF performs better for chunking than
it does for POS tagging with the training on same sized data.
With training on 21000 words with the best feature set, the
CRF based POS tagger is 82.67% accurate, while the chunker
performs at 90.89% when evaluated with evaluation script
from conll 2000.
A POS tagging for Punjabi language using Hidden Marcov
Model has been used by Sapna Kanwar, Mr Ravishankar,
Sanjeev Kumar Sharma and used a Bi-gram Hidden Markov
Model to solve the part of speech tagging problem. During
experimental results they note that the general HMM based
method doesn‟t perform well due to data deficiency problem.
A machine learning algorithm for Gujarati Part of Speech
Tagging has been used by Chirag Patel and Karthik Gali.
The machine learning part is performed using a CRF model.
The algorithm has achieved an accuracy of 92% for Gujarati
texts where the training corpus is of 10,000 words and
the test corpus is of 5,000 words. From the experiments they
observed that if the language specific rules can be formulated
in to features for CRF then the accuracy can be reached to
very high extents.
Sanjeev Kumar Sharma et al., 2011 developed a system using
Hidden Markov Model to improve the accuracy of Punjabi
Part of Speech tagger. A module has been developed that
takes output of the existing POS tagger as input and assign the
correct tag to the words having more than one tag. The system
was evaluated over a corpus of 26,479 words and system
achieved the accuracy of 90.11%.
M. S. Thirumalai, Sam Mohanlal used a Hybrid POS tagger
for Indian Languages. The experiment on twelve Indian
language regarding POS tagging based on the LDC-IL POS
tagset v0.3 using hybrid POS Tagger shows that the most
frequent errors occur with respect to Noun, Verb and
Adjective categories. it is also observed that due to the
unknown tokens the time taken to assign the tag is more as the
system undergoes through several modules to assign the most
appropriate tag. However, its efficiency and accuracy increase
as we increase the training data size.
Sumeer Mittal used N Gram Model for Part of Speech
Tagging of Punjabi Language. A Bi-gram Model has been
used to solve the part of speech tagging problem. An
annotated corpus was used for training and estimating of bi
gram probabilities. During experimental results he noted that
the general-Gram based method doesn‟t perform well due to
unknown words (foreign language words or due to spelling
mistakes) problem.
Vasu Ranganathan proposed a Tamil POS tagger based on
Lexical phonological approach. Ganesan proposed another
POS tagger based on CIIL Corpus and tagset. An
improvement over a rule based Morphological Analysis and
POS Tagging in Tamil were developed by M. Selvam and
A.M. Natarajan in 2009. Dhanalakshmi V, Anand Kumar,
Shivapratap G, Soman KP and Rajendran S of AMRITA
university, Coimbatore developed two POS taggers for Tamil
using their own developed tagset in 2009.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Kavi Narayana Murthy and Srinivasu Badugu proposed a
new approach to automatic tagging without requiring any
machine learning algorithm or training data using a
morphological analyzer and a fine-grained hierarchical tag-
set.. They have worked onTelugu and Kannada languages.
They argue that the critical information required for tagging
comes more from word internal structure than from the
context and they show how a well designed morphological
analyzer can assign correct tags and disambiguate many
cases of tag ambiguities too.
A Comparison of Unigram, Bigram, HMM and Brill‟s POS
Tagging Approaches for some South Asian Languages has
been done by Fahim Muhammad Hasan . compared the
performance of n-grams, HMM or transformation based POS
Taggers on three South Asian Languages, Bangla, Hindi and
Telegu. And we found that the HMM based tagger might
perform better for English, but for South Asian languages,
using corpora of different sizes, the transformation based
Brill‟s approach performs significantly better than any other
approach when using a 26-tags tagset and pre-annotated
training corpora consisting of a maximum of 25426, 26148
and 27511 tokens for Bangla, Hindi and Telegu respectively.
Navneet Garg, Vishal Goyal, Suman Preet used Rule Based
Hindi Part of Speech Tagger for Hindi. The System is
evaluated over a corpus of 26,149 words with 30 different
standard part of speech tags for Hindi. The evaluation of the
system is done on the different domains of Hindi Corpus.
These domains include news, essay, and short storie and
system achieved the accuracy of 87.55%.
Kristina Toutanova and Christopher D. Manning presents
results for a maximumentropy-based part of speech tagger,
which achieves superior performance principally by enriching
the information sources used for tagging. The best resulting
accuracy for the tagger on the Penn Treebank is 96.86%
overall, and 86.91% on previously unseen words. Their work
explored just a few information sources in addition to the ones
usually used for tagging. They incorporated into a maximum
entropy-based tagger more linguistically sophisticated
features, whichare non-local and do not look just at particular
positions in the text. They also added features that model the
interactions of previously employed predictors. All of these
changes led to modest increases in tagging accuracy.
Manjit Kaur , Mehak Aggerwal and Sanjeev Kumar Sharma
introduced an improving Punjabi Part of Speech Tagger by
Using Reduced Tag Set. They Effort to improve the accuracy
of HMM based Punjabi POS tagger has been done by
reducing the tagset. The tagset has been reduced from more
than 630 tags to 36 tags. We observed a significant
improvement in the accuracy of tagging. Their proposed
tagger shows an accuracy of 92-95% whereas the existing
HMM based POS tagger was reported to give an accuracy of
85-87%.
Adwait Ratnaparkhi used a Maximum Entropy Model for
POS tagging. He presents a statistical model which
trains from a corpus annotated with Part-Of -Speech tags and
assigns them to previously unseen text with state-of-the-art
accuracy(96.6%). The model can be classified as a Maximum
Entropy model and simultaneously uses many contextual
"features" to predict the POS tag. Furthermore, He
demonstrates the use of specialized features to model difficult
tagging decisions .
389
ISBN: 978-81-924893-0-8
5. PROBLEMS OF PART OF SPEECH
TAGGING
The main problem in part-of speech tagging is Ambiguity. It
is possible that a word in a sentence can act as more than one
meaning so it can have more than one tag so such situation
arise the problem of Ambiguity. To solve this problem we
consider the context instead of taking single word. For
example-
auh ie`k imhnqI kuVI sI ausdy mW-bwp ny ausdw pUrw
swQ id`qw qy auh swry ausdI sPlqw qy bhuq KuS sn[
In this example word „ਉਹ‟ is both acting as a singular
pronoun and plural pronoun. Since word ਉਹ occur in between
the sentence and also the word next to it is not a noun so it
may be a pronoun. The previous word of the sentence
determines the type of pronoun that is singular or plural. By
looking at the context of the word the correct POS of a word
in a sentence can be identify.
6. Features For POS Tagging
The Following features have been found to be very useful in
POS tagging:
Suffixes : The next word of Current token is used as feature.
Prefixes : The previous word of Current token is used as
feature.
Context Pattern based Features
Context patterns are helpful for POS tagging. Eg.. word prefix
and suffix context patterns.
Word length : Length of particular word is useful feature .
Static Word Feature: The previous and next words of a
particular word are used as features.
Presence of Special characters : Presence Special characters
surrounding the current word are used as features.
7. EVALUATION METRICES
The evaluation metrics for the data set is precision, recall and
F-Measure. These are defined as following:-
Recall = Number of correct answer given by system / Total
number of words.
Precision = Number of Correct answer / Total number of
words.
F-Measure = Recall *Precision / Recall + Precision
8. CONCLUSION
In this paper work, we tried to give a brief idea about the
existing approaches that have been used to develop POS
tagger tools. I have presented a survey on developments of
different POS tagger systems for Indian languages. I found
out from the survey that for Indian Languages Rule-based,
Supervised, Unsupervised , Transformation based POS
tagging approaches have been used which have given good
performance results. In each research work the most
challenging task is to generate the most efficient Pos tagger
for large training corpus which can give the best performance
for different languages.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

9. REFERENCES
[8] Kavi Narayana Murthy and Srinivasu Badugu School of
[1] Antony P J Research Scholar Computational Computer and Information Sciences,University of
Engineering and Networking (CEN), Research Centre, Hyderabad, India
Amrita Vishwa Vidyapeetham University, Coimbatore,
[9] Kristina Toutanova Dept of Computer Science Gates
India and Dr. Soman K P Professor and Head
Bldg 4A, 353 Serra MallStanford, CA 94305–9040, USA
Computational Engineering and Networking (CEN),
Christopher D. Manning Depts of Computer Science and
Research Centre,
Linguistic Gates Bldg 4A, 353 Serra Mal Stanford, CA
[2] Aggarwal Himashu, Amni Anirudh,” Part of Speech 94305–9040, USA
Tagging and Chunking with Conditional Random Fields”
[10] Navneet Garg , Vishal Goyal , Suman Preet Department
in the proceedings of NLPAI Contest, 2006
of Computer Science, Punjabi University, Patiala
[3] Sapna Kanwar, Mr Ravishankar, Sanjeev Kumar Sharma Department of Linguistics and Punjabi Lexicography,
LPU, Jalandhar, Lecturer, LPU, Jalndhar, Punjabi University, Patiala.
Associate professor, B.I.S College of Engineering and
[11] Manjit Kaur Department of Computer Science and
Technology, Moga – 142001, India
Engineering Lala Lajpat Rai Institute of Engg. &
[4] Nidhi Mishra , Amit Mishra (2011), “Part of Speech Technology, Moga, India , Mehak Aggerwal Department
Tagging for Hindi Corpus”, International Conference on of Computer Science and Engineering Lala Lajpat Rai
Communication Systems and Network Technologies. Institute of Engg. & Technology, Moga, India, Sanjeev
Kumar Sharma Assistant Professor Department of
[5] Chirag Patel and Karthik Gali Language Technologies Computer Science and Application DAV University
Research Centre International Institute of Information Jalandhar.
Technology Hyderabad, India
[12] Shambhavi B R Department of CSE R V College of
[6] Sumeer Mittal Adhesh college of Engineering, Faridkot, Engineering, Bangalore Ramakanth Kumar P, PhD,
Mr Navdeep Singh Sethi Lecturer, Adhesh Institute of Department of ISE, , R V College of Engineering,
Engineering and Technology, Faridkot, Sanjeev Kumar Bangalore.
Sharma Assistant Professor DAV University Jalandhar
[13] Erlyn Manguilimotan and Yuji MatsumotGraduate
[7] Managing Editor: M. S. Thirumalai, Ph.D. Editors: B. School of Information Science, Nara Institute of Science
Mallikarjun, Ph.D. Sam Mohanlal, Ph.D. B. A. Sharada, and Technology 8916-5, Takayama-Cho, Ikoma, Nara,
Ph.D. A. R. Fatihi, Ph.D. Lakhan Gusain, Ph.D.Jennifer 630-0192 Japan
Marie Bayer, Ph.D. , S. M. Ravichandran, Ph.D.G.
Baskaran, Ph.D. ,L. Ramamoorthy, Ph.D. Volume 11 : 9
September 2011 ISSN 1930-2940.

390
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Asymmetric Algorithms and Symmetric Algorithms: A

Review
Tannu Bala Yogesh Kumar
Research Scholar(MTech) Assistant Professor
BGIET,Sangrur BGIET,Sangrur
tannu.garg18@gmail.com yksingla37@gmail.com

ABSTRACT For security reasons, this message is then coded using a

In these days securing a network is an important issue. Many
techniques are provided to secure network. Cryptographic is a
technique of transforming a message into such form which is
unreadable, and then retransforming that message back to its
original form. Cryptography works in two techniques:
symmetric key also known as secret-key cryptography
algorithms and asymmetric key also known as public-key
cryptography algorithms. In this paper we are reviewing
different symmetric and asymmetric algorithms.
cryptographic algorithm. This process is called Encryption.
An encrypted message is known as Cipher text. It requires
two processes: - Encryption algorithm and a key. Encryption
algorithm is used by sender.
Decryption: Converting cipher text back to plain text is
known as decryption. This may also need two requirements:
Decryption algorithm and key. Decryption is done by
receiver.

Key: Key is the Combination of any numeric or alpha

Keywords: RSA (Rivest Shamir Aldeman), El-gamal, numeric text or special symbol. Key is used at the time of
Symmetric cryptography, Asymmetric cryptography. encryption or decryption. Encryption and Decryption process
directly depend upon it so key is very important.
1. INTRODUCTION
1.1 Cryptography:

Information security plays a very important role when

communication is provides by using internet. It is very
important for people who are committing by e-transaction
service. [1] There are various cryptography methods that
provide security to password and payments that relay on
internet. To achieve this level of security, various security
protocols that are of Symmetric-key and asymmetric-key type
have been developed. Cryptography is necessary for secure
communications. Cryptography has many uses and
applications such as protecting private company information. Fig 1: encryption and decryption with key
It allows the user to order a product on the internet without the
fear of their credit card number being stolen and used against
them anymore. [1] Cryptography is all about increasing the
level of privacy of individuals and groups. 1.3 Approaches
The Cryptography or methods used for securing the
1.2 Termed used in Cryptography information are classified into following categories:
Plain text: The original message that the person want to send  Symmetric Key Cryptography
is known as plain text. For an example, Tom is a sender who
 Asymmetric Key Cryptography
want to send message ―hello, how are you‖ to person bob
which is at receiver side. Then the message ―hello, where are
Symmetric-Key Cryptography (also known as single-key
you?‖ is known as plain text.
encryption and private key encryption) is a type of encryption
Cipher text: When plain text is coded by using encryption in which same secret key is used to encrypt and decrypt
then the generated text is known as cipher text. This message information. A secret key can be a number, a word, or simple
cannot be understood by anyone. For an example a string of random letters. Secret key is applied to plain text to
―unjn122%$if ―is a cipher text produced for plain text ―hello, change the content. This is done simply by shifting each letter
where are you ―. in a number of places. In this technique both the sender and
receiver has to know about secret key, so they can encrypt and
Encryption: Converting plain text to cipher text is referred as
encryption. A message in original form is known as Plaintext. decrypt all information. In any symmetric-key encryption
techniques, both encryption and decryption process are carried
out using a single key.DES is a symmetric key algorithm. [2]

391
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

These algorithms have many advantages: 2. LITRATURE REVIEW

1. Efficient and secure Ankit Gambhir (2014) in this paper [1] performance as well
2. Execute at high speeds as comparison between two cryptographic algorithms (RSA
3. Consume less computer resources of memory and and DES) was implemented. There are two techniques of
processor time. cryptography: symmetric key that is also called secret-key
cryptography algorithms and asymmetric that is also called
However, symmetric key cryptographic techniques suffer public-key cryptography algorithms. DES is secret- key based
from many problems: algorithm and RSA is public key based algorithm. Both the
algorithms are very efficient.
1. Key distribution problem
2. Key management problem
3. Inability to digitally sign a message.

Fig 4: The process of encryption and decryption [5]

DES algorithm with its steps to provide encryption and

decryption was discussed same RSA algorithm was discussed
with all its steps.

Fig 2: Symmetric key cryptography process [3]

Asymmetric Key Cryptography: The problem with secret

keys is exchanging them over the Internet while preventing
them from thief. Anyone who knows the secret key can
decrypt the message. To overcome this problem we have
asymmetric encryption technique, in which there is related
pair of keys. [4] A public key is available to anyone who
might want to send you a message. A second, private key is
kept secret, so that only receiver knows it. Any message (text,
binary files, or documents) that are encrypted by using the Fig 5: DES process [5]
public key can only be decrypted by applying the same
algorithm, but by using the matching private key. Any Comparison table shows us the difference between DES and
message that is encrypted by using the private key can only be RSA algorithm based on four different parameters: type of
decrypted by using the matching public key. This means that cryptography, key used, throughput, confidentiality.
you do not have to worry about passing public keys over the
Internet. A problem with asymmetric encryption, however, is
that it is slower than symmetric encryption. It requires far Table 1: Comparison between Des and Rsa Algorithm [5]
more processing power to both encrypt and decrypt the
content of the message. In it, instead of a single key, every
person has a pair of keys. One key, called the public key is
known to everyone and the other one, the private key is
known only to the owner. There is a mathematical relationship
between both these keys. Thus, if any message ‗m‘ is
encrypted using any of the key, it can be decrypted by the
other portion. Various asymmetric encryption algorithms
(RSA, Elgamal) have been implemented.

Annapoorna Shetty et. al. (2014) in this paper [4] a detail

about cryptography is studied. Cryptography is the art and
science of protecting information from unwanted person and
Fig 3: Asymmetric key cryptography process [3] converting it into a form which is not easily breakable. The
main aim of cryptography is keeping data secure form

392
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
unauthorized persons. Data cryptography mostly is the
combination of the content of data, such as text data, image
related data and audio, video related data. To convert that data
into code form (cipher text) is called data encryption. The
reverse of data encryption process is called data Decryption.
The paper first discusses about different goals
of the cryptography. Different goals like Confidentiality,
Authentication, Integrity, Non Repudiation, Access control
are discussed. Different type of attacks that may damage your
data is mentioned. In the paper nine different attacks are
discussed including Cipher text-only attack, Known-plaintext
attack, Chosen-plaintext attack etc.
Two types of cryptography are discussed.
This paper gives detail about two asymmetric algorithm RSA
and Elgamal algorithm. Summary table give the detail of the
two algorithms based on different factor analyzed. In this
paper the summary table reports the key length value, type of
algorithm, security attacks, simulation speed, scalability, key
used, power consumption, and hardware/ software
implementation difference between RSA and EL-Gamal.
Bryce D. Allen (2008) in this paper [5] two previous
cryptography techniques Asymmetric and Symmetric
cryptography are combined into one know as Hybrid
Cryptosystems. Hybrid cryptosystems combine them to gain
the advantages of both. This paper implements the two attacks,
basic meet-in-the-middle attack and the two-table attack.
Several variations in basic meet-in-middle attack are
implemented and all these implementations are done in c++.
Table 1.1 shows Splitting probability of the experiment.
Elgamal cryptography algorithm with Discrete Log Problem
was discussed. This paper discuss meet-in-middle attack in
detail with different parameters like its Requirements and
Assumptions, problem Solution, its implementation , its
Running Time and Memory Usage. Then second attack ―two
table attacks‖ was discussed with same parameters.
Implementing a cryptosystem securely
requires far more than an understanding of the basic algorithm.
The implementer must be aware of possible attacks on the
system, and choose keys and parameters to make those attacks
infeasible. This paper discussed attacks which rely on the
underlying mathematics - however timing attacks have been
discovered against various cryptosystem which gain
information based on how long the computer takes to perform
encryption or decryption operations.
Franck Lin (2010) [6] explain the cryptography book. He
divides this book into two parts; first part contains the
description of Symmetric and Asymmetric key algorithm with
examples. A stream cipher attempts to imitate a one-time pad.
Since it is impractical to have a key that is at least the same
size as the plaintext, stream ciphers take a smaller 128 bit key.
Block ciphers represent a major advancement in cryptography
and have little vulnerability. Most block ciphers rely on
substitution-permutation rounds. In each round, data is broken
up into 8-bit sections, substituted according to a key,
recombined, and then rearranged according to a key. Second
part contains the description of digital Age and cryptography.
This report confirms the feasibility and strength of quantum
cryptography, highlighting an almost certain legal battle and
information technology revolution.
Sombir Singh et. al. (2013) in this paper [7] ―DES‖ Symmetric
algorithm was explained. Data encryption standard (DES) is a
private key cryptography system that provides the security in
communication system but DES has the problem of brute force
393
ISBN: 978-81-924893-0-8
attacks. To improve the security of DES algorithm the
transposition technique is added before the DES algorithm to
perform its process. If the transposition technique is used
before the original DES algorithm then the user required first
to break the original DES algorithm and then transposition
technique. So the security is approximately double as
compared to a simple DES algorithm.
This paper includes four techniques to
provide security. First is DES, Double DES (2DES), Its
process is the same as DES but repeated same process 2 times
using two keys K1 and K2, Triple DES is DES -three times,
last one is the transposition technique, this does not replace the
one alphabet with another like the substitution technique but
perform the permutation on the plain text to convert it into
cipher text.
The Designed system improved the security power
of original DES. The only drawback of Enhanced DES is extra
computation is needed but the today‘s computer have parallel
and high speed computation power so the drawback of the
Enhanced DES algorithm is neglected because our main aim is
to enhance the security of a system.
3. Detail about different cryptographic
algorithm:
Data Encryption Standard (DES): DES algorithm is secret
key based algorithm in which same key is used for encryption
and decryption. Des is a symmetric key algorithm. DES is the
block cipher — an algorithm that takes a fixed-length string of
plaintext bits. In the case of DES, the block size is 64 bits.
The key originally consists of 64 bits; however, only 56 of
these are actually used by the algorithm. Eight bits are used
for checking parity, and are thereafter discarded. Hence the
effective key length is 56 bits. [2] DES when implemented
with hardware and software it give better performance in
hardware rather than in software [8]. DES consumes low
power as compare to any other cryptography algorithm
(RSA).
Advanced Encryption Standard (AES): AES is the advance
encryption algorithm which is proposed to provide very strong
security and to overcome the problem of DES algorithm. AES
is the block cipher. In the case of AES, the block size is 128
bits. Size of a key is depends upon the plain text. Standard
size of the key is 128 bit but if for some reasons more security
is required then it may increase upto 256 bits (192 and 256).
Number of rounds are depend upon key size: if key is of 128
bit then 10 rounds are there, if 192 key size is used then 12
rounds are there and if key size is 256 then 14 no. of rounds
are there. AES is now used worldwide.
Rivest Shamir Aldeman (RSA): RSA algorithm is the most
commonly used and secure public key encryption and
authentication algorithm. It can be used to encrypt a message
without the need to exchange a secret key separately. It is
included as part of the Web browsers from Microsoft and
Netscape. It's also part of Lotus Notes, Intuit's Quicken, and
many other products. The encryption system is owned by
RSA Security. The company licenses the algorithm
technologies and also sells development kits. The
technologies are part of existing or proposed Web, Internet,
and computing standards. RSA security depends on the
difficulty of factoring the large integers. It is generally
considered to be secure when sufficiently long keys are used
(512 bits is insecure, 768 bits is moderately secure and 1024
bits is good, for now).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
RSA computation occurs with integers modulo n = p*q. It
requires keys of at least 1024 bits for good security. Keys of
size 2048 bit provide best security. Widely used for secure
communication channel and for authentication to identity
service provider. RSA is too slow for encrypting large
volumes of data but it is widely used for key distribution. [9]
RSA has the disadvantage that it is not efficient for both
hardware and software implementation. The principle of RSA
algorithm is „it is easy to multiply two prime numbers but
difficult to factor them‟. As RSA is asymmetric key
cryptographic algorithm so there are different keys for
encryption and decryption. [1]
Elgamal Algorithm: ElGamal encryption/decryption is
based on the difficulty of the discrete algorithm problem
where it is straight forward to raise numbers of large powers
but it is much harder to do the inverse computation of the
discrete logarithm. The ElGamal algorithm depends on certain
parameters which are affecting the performance, speed and
security of the algorithm. ElGamal encryption is one of
many encryption schemes which utilizes randomization in
the encryption process. [9]
The ElGamal algorithm can be use as RSA algorithm for
public key encryption because:
• RSA encryption depends on the difficulty of factoring large
integers while
• ElGamal encryption depends on on the difficulty of
computing dicrete logs in a large prime modulus.
ElGamal is nothing but the advance version of Diffie- Hell-
men key exchange protocol. But, ElGamal is not good
because its cipher text is two times longer than the plain text.
ElGamal is good because it gives different cipher text for
same plain text each time. For image data, the size of the
cipher text is very huge & reshaping the encrypted data was
not under-stood. ElGamal‗s encryption is very simple because
it is multiplication of message and symmetric key
4. CONCLUSION
Security is playing a very important and powerful role in the
field of networking, Internet and various communication
systems. In this paper we compare various symmetric
algorithms (DES and AES) and asymmetric algorithms (RSA
and Elgamal). Based on this research we conclude that in
symmetric algorithm AES is better and in asymmetric
algorithm Elgamal is better to provide security.
REFERENCES
[1]Gambhir, Ankit. "RSA Algorithm or DES
Algorithm?" Journal of Engineering Computers & Applied
Sciences 3.4 (2014).
[2]Bhardwaj, CR S. "Modification of Des
Algorithm." International Journal of Innovative Research and
Development 1.9 (2012).
[3] Thakur, Jawahar, and Nagesh Kumar. "DES, AES and
Blowfish: Symmetric key cryptography algorithms simulation
based performance analysis."International journal of emerging
technology and advanced engineering 1.2 (2011).
394
ISBN: 978-81-924893-0-8
[4] Annapoorna Shetty, Shravya Shetty and Krithika. ―A
Review on Asymmetric Cryptography –RSA and ElGamal
Algorithm‖ International Journal of Innovative Research in
Computer and Communication Engineering 2014.
[5] Allen, Bryce. Implementing several attacks on plain
ElGamal encryption. ProQuest, 2008.
[6] Lin, Franck. "Cryptography‘s Past, Present, and Future
Role in Society‖.
[7] Singh, Sombir, Sunil K. Maakar, and Sudesh Kumar. "A
Performance Analysis of DES and RSA
Cryptography." International Journal of Emerging Trends &
Technology in Computer Science (IJETTCS), ISSN: 2278-
6856.
[8] Padmavathi, B., and S. Ranjitha Kumari. "A Survey on
Performance Analysis of DES, AES and RSA Algorithm
along with LSB Substitution Technique."International Journal
of Science and Research 2.4 (2013).
[9] Singh, Rashmi, and Shiv Kumar. "Elgamal‘s Algorithm in
Cryptography."International Journal of Scientific &
Engineering Research 3 (2012).
[10] Menezes, Alfred J., Paul C. Van Oorschot, and Scott A.
Vanstone. Handbook of applied cryptography. CRC press,
1996.
[11] Li, Xiaofei, Xuanjing Shen, and Haipeng Chen.
"ElGamal Digital Signature Algorithm of Adding a Random
Number." Journal of Networks 6.5 (2011): 774-782.
[12] Sison, Ariel M., et al. "Implementation of Improved DES
Algorithm in Securing Smart Card Data." Computer
Applications for Software Engineering, Disaster Recovery,
and Business Continuity. Springer Berlin Heidelberg, 2012.
252-263.
[13] Mahajan, Prerna, and Abhishek Sachdeva. "A study of
Encryption Algorithms AES, DES and RSA for
Security." Global Journal of Computer Science and
Technology 13.15 (2013).
[14] William Stallings, " Cryptography and Network Security
Principles and Practices", Prentice Hall, November 16, 2005.
[15] Elminaam, Diaa Salama Abd, Hatem Mohamed Abdual-
Kader, and Mohiy Mohamed Hadhoud. "Evaluating The
Performance of Symmetric Encryption Algorithms." IJ
Network Security 10.3 (2010): 216-222.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Novel Approach for Reducing Energy Consumption
and Increasing Throughput in Wireless Sensor Network
using Network Simulator 2
Jagdish Bassi
Computer Science & Engineering
Punjab Technical University
Jalandhar , India
rommy_btech@yahoo.co.in
ABSTRACT
A wireless sensor network contains collection of sensor nodes
which are situated at desired locations to control various real
time applications like moisture, climate, stress etc. So,
Wireless sensor networks (WSNs) involve greater efficiency
to control the environment related applications which are
greatly used for military purposes and other life related
applications in the field of medical. The wireless sensor nodes
mainly make use of the battery systems and thus the wireless
network’s life is the main issue of the battery’s power system.
Hence, to assist better results for consumption of battery and
security mechanism for the wireless sensor network to be
energy efficient, anycast forwarding scheme is proposed and
used in this paper. In the wireless network each node has
multiple next-hop relaying nodes in a candidate set
(forwarding set), results in reducing the delay and reducing
the consumption of battery power. An active node forwards
the packet to the first wakeup node in the forwarding set.
Keywords
Sensor, Energy, Delay, Node, MAC, DSR, Throughput
1. INTRODUCTION
There are four major activities which consume energy:
energy consumed by radios when they are on; the energy
consumed during the process of transmission and receiving of
control packets; the energy required to remain wireless
sensors in on state; and energy consumed during data transfer
from source to destination . The active process of data sending
and receiving is a rarely occurring event and thus only a small
amount of the total energy is consumed. But, the network
sense events occur repeatedly with continued and independent
energy consumption. Thus we propose spreading the
network’s lifetime by controlling the energy expended to keep
the radio communication systems on (for listening to the
medium and for control packets) [1]. So, wireless
communication systems while waiting for a packet arrival
consumes most of the energy. Hence, sleep wake scheduling
is an effective mechanism to prolong the lifetime of this
energy constrained wireless sensor networks. In sleep wake
scheduling a transmitting node needs to wait for its next-hop
relay node to wake up which may cause a substantial delay.
This delay can be reduced by using some DSR techniques and
packet forwarding schemes [2].
1.1 Wireless Sensor Network
Wireless ad-hoc network consists of mobile nodes which are
communicating over wireless links with processing capability
containing multiple types of memory (programs, data and
flash memories), RF transceivers, and power source and
395
ISBN: 978-81-924893-0-8
Taranjit Aulakh
Computer Science & Engineering
Punjab Technical University
Jalandhar , India
taranaulakh@gmail.com
various sensors and actuators. There are two types of wireless
sensor networks.
1) Structured network
2) Unstructured network
In the structured network, wireless sensor networks plan the
deployment of wireless sensor nodes while the deployment of
nodes is in an ad-hoc network manner in the unstructured
wireless sensor networks. These wireless sensor nodes
consume most of the energy during listening process. We
generally solve this problem by using the concept of duty
cycling in the wireless sensor network. The process of time
synchronization is critical for diverse purposes, including
coordinated actuation, sensor data fusion and power-saving
duty cycling [3]. The wireless sensor nodes periodically
switch between sleeping and active states, called as Duty
cycling. These wireless sensor nodes transmit and receive the
data in active state and going completely inactive in sleeping
state in order to save energy. Here, synchronization process
between the operating cycles of different wireless nodes is
motivated as the radios of both machines must be on to
transmit a packet from one machine to another machine.
Example of protocols using synchronized approach: T-MAC,
S-MAC and RMAC routing protocols [4].
The current duty cycling MAC layer protocols for wireless
sensor networks is synchronized using explicit schedule
exchanges or leave unsynchronized as both possess
weaknesses and deficiencies. The process of duty cycling and
packet transmissions are scheduled by periodic
synchronization of messages (SMAC, TMAC and DMAC),
which consume significant energy even at zero traffic. The
BMAC process wakes up the receiver using the
unsynchronized duty cycling process and long preambles
mechanism. The long prelude mechanism has some problems.
First, the latency accumulated along multihop routes could be
uncontrolled due to the use of long preludes on each hop.
Second, after the awakening of the receiver node, the energy
consumed on prelude transmission and reception at the node
is wasted. This all can be avoided if sender’s side is aware of
the receiver’s wake up schedule and thus choosing the prelude
length conservatively. Third, unneeded prelude overhearing
by neighbor nodes other than the intended receiver node by
remaining awake till the last data packet transmission to the
node results in energy wastage.[5]-[6].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

them over multiple “hops” between nodes that are not directly
within the wireless transmission range area of one another. All
routing information about sources of intermediate nodes
changes and also joining or leaving of nodes in the network
area are determined and maintained by DSR. The resulting
network topology may be quite rich and rapidly changing,
because there may be a change in the number or sequence of
intermediate hops to reach any destination,. The DSR protocol
also finds the multiple routes (hops) to any destination node in
Fig 1: Basic architecture of wireless sensor network the ad hoc network of wireless. There is an order list of nodes
To increase higher power efficiency, to reduce the latency , through which the packets with the header information must
higher packet delivery ratios for traffic, integration of the pass. DSR can successfully discover and forward packets over
selected scheduling algorithm and access control to maintain uni-directional links as if other protocols operate only over
one–to-one mapping function between a data active period bidirectional links of the wireless sensor network.
and the subsequent sleep period, DW-MAC uses a new energy
efficient duty cycle MAC protocol.[4]. The major elements 2. PROPOSED ALGORITHM
characterizing the performance of a wireless sensor network There is a cogent increase in the cost of sensor motes due to
are like the consumption of power in different operating the additional receivers in the DSR routing protocol when an
environments, the impact of weather conditions during the use on-demand synchronized sleep-wake schedule is used. As it is
of wireless networks, interference between neighboring nodes, impractical for every sensor node to be know about wake-
etc. are also aiming to be studied and analyzed. Analysis is the sleep schedule of other sensor nodes, leading to the additional
part of the technology, which provides specific general delays along the path to the sink node because each node
information about the transmission range of mote wireless needs to wait for its next-hop node to wake up before it can
sensor nodes decreases significantly in the presence of rain, transmit the packet. But the delay is minimized for the delay
fog and other climate conditions [7]. sensitive applications, such as fire detection or tsunami alarm,
where delay is unacceptable. In traditional packet-forwarding
1.2 The protocol used in Wireless Ad-hoc Network schemes, each sensor node has one designated next-hop
There are various sleep wake protocols, we have synchronized relaying node in the neighborhood, and it has to wait for the
sleep-wake scheduling protocols proposed in [3], [8]-[11]. next-hop node to wake up when it needs to forward a packet.
These protocols are used when wireless sensor nodes There are multiple next-hop relaying nodes in a candidate set
periodically or a periodically exchange their synchronization (forwarding set) for each node. A packet can forward by a
information with their neighboring nodes. However, such sending node to the first node that wakes up in the forwarding
synchronization schemes can cause additional communication set. Thus the proposed Anycast forwarding scheme reduces
overhead, communication delay and consuming a the event-reporting delay and minimizes the power
considerable amount of energy. The On-demand sleep-wake consumption and maximizing the lifetime of nodes.
scheduling protocols as proposed in [12], where nodes turn off
the most of their circuitry and always turn on a secondary
low-powered receiver to response to “wake-up” calls from
neighboring nodes when there is a need for relaying packets.
However, this on-demand sleep-wake scheduling have an
additional receiver which significantly increases the cost of
the sensor motes. Hence, to save energy, each node wakes up
independently of their neighboring nodes in the above
protocols. But there is an occurring additional delay at each
node along the path to the sink node as each node needs to
wait for its next-hop relaying node to wake up before it can
transmit the packet to the node, adds restraints to it. In a
situation like fire detection and Tsunami alarm the delay
between nodes is unacceptable and thus, to minimize the
event reporting delay for such delay sensitive applications, the
On Demand (Reactive) protocol is used. The Dynamic Source
Routing protocol (DSR) is an on demand and efficient routing
protocol designed for multi-hop wireless sensor ad hoc
networks. It organizes and configures the protocols by itself
without any help of any existing network infrastructure or
administration. In DSR the two routing schemes are used, i.e.
(a) Route Discovery and (b) Route Maintenance. These
schemes work together to allow sensor nodes to discover and
maintain source routes to arbitrary destinations in the wireless
ad hoc network. It is called as a loop free technique because it
won't require up-to-date routing information in the
intermediate nodes through which packets are forwarded. It
aids nodes forwarding packets to cache the routing
information in them for their own future use. It allows the Fig 2: Flowchart of anycast forwarding scheme
packet skyward to those nodes that are reacting to changes in
the current routes which they are using. Here, nodes forward
the packets for each other to allow communication between

396
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3. SIMULATION RESULTS
We have used the various parameters and simulate them by
Network Simulator 2 (NS2) and compared with existing
techniques of on demand (reactive) routing protocol, DSR.
We achieved our major objective that anycast forwarding
technique has significant improvement as compared to the
existing individual Reactive Protocol for a wireless sensor
network using these simulations.
Table 1. Table captions should be placed above the table

Name Type
Simulator Network Simulator 2.34

Network Size 1500m x 1500m

No. of nodes 20

Simulation Time 30Sec

Fig 3: Delay v/s pause time comparison
MAC Type 802.11
3.2 Throughput performance Comparison
Bandwidth 2Mz Throughput refers to the ratio of the amount of packets
received at the Destination node to the amount of packets
Traffic Sources CBR transmitted at the Source node. It must be higher for the better
performance of the wireless sensor network.
Traffic Agents UDP
Throughput= Total Data Bits Received/Simulation Runtime
Interface Queue Length 250 Here the proposed work shows the higher throughput of
anycast forwarding technique as compared to existing DSR
Packet Size 512 Byte data technique is shown in figure.

Routing Protocol DSR

Antenna Type Omni-directional

Initial Energy 850Joules

The Performance analysis of proposed anycast forwarding

technique is done by comparing with existing on demand
technique on the basis of the following parameters:
a) End to End delay b) Throughput c) Energy
3.1 End to End delay performance
Comparison
It is the delay which is calculated from the time when an event
occurs for a node to the time when the packet due to this event
is received at the sink node [8]. It is the average time taken
by the data packet to arrive at the destination node when an
event occurs in the network. It also counts the delay caused by
the queue in data packet transmission and route discovery
process.
Delay = Tr – Ts
Whereas Tr is arrive time & Ts is send time. The lower value Fig 4: Throughput v/s pause time comparison
of end to end delay means the better performance of the
protocol which is used. The proposed work shows the 3.3 Energy Performance Comparison
comparable end to end delay with existing DSR is shown in Energy is consumed while sending a file or data, with the
figure. consideration of the size of the packets. Since it is just
impractical possible to replace the batteries of a large number
of deployed sensors in the hostile environment of wireless
network. So, to develop an energy efficient network keeping
consumption of energy as low as possible .Our proposed
network consumes less energy as compared to the existing
DSR technique.

397
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig 5: Energy versus Pause time Comparison
4. CONCLUSION
Hence, it can be concluded that anycast forwarding technique
giving better results than the existing DSR technique.
Network parameters act as the performance markers. Thus, in
the proposed work, the results in terms of end to end delay is
lower along with higher throughput and less required energy
as in comparison to the existing DSR technique. Hence, it can
be concluded that results of proposed protocol are better or
comparable with existing DSR protocol.
5. ACKNOWLEDGMENTS
At the last of it we are thankful to all the faculty members of
BGIET (Sangrur) whose fruitful suggestions enhanced and
enriched the beauty of this paper presentation.
REFERENCES
[1] M. Zorzi and R. R. Rao, “Geographic Random
Forwarding (GeRaF) for Ad Hoc and Sensor Networks:
Energy and Latency Performance,” IEEE transactions on
Mobile Computing, vol. 2, pp. 349–365, October 2003.
[2] Joohwan Kim, Xiaojun Lin, Ness B,Shroff, Prasun
Sinha, ” Minimizing Delay and Maximizing Lifetime for
Wireless Sensor Networks With Anycast” ,Proceedings
of IEEE INFOCOM-2010.
398
ISBN: 978-81-924893-0-8
[3] J. Elson, L. Girod, and D. Estrin, “Fine-grained network
time synchronization using reference broadcasts”,
SIGOPS Oper. Syst. Rev., vol. 36, pp. 147–163, 2002.
[4] Yanjun Sun,Shu Du, Omer Gurewitz, David B. Johnson,
"DW-MAC: A Low Latency, Energy Efficient Demand-
Wakeup MAC Protocols for Wireless Sensor Networks",
MobiHoc-2008.
[5] Hwee-Xian Tan and Mun Choon Chan, "A2-MAC: An
Adaptive,Anycast MAC Protocol for Wireless Sensor
Networks", Wireless Communications and Networking
Conference (WCNC), 2010 IEEE.
[6] Sha Liu, Kai-Wei Fan and Prasun Sinha, “CMAC: An
Energy Efficient MAC Layer Protocol Using convergent
Packet Forwarding for Wireless Sensor Networks” The
Ohio State University, 2007.
[7] G. Anastasi, A. Falchi, A. Passarella, M. Conti, and E.
Gregori, “Performance Measurements of Motes Sensor
Networks”, in Proceedings of the 7th ACM International
Symposium on Modeling, Analysis and Simulation of
Wireless and Mobile Systems, pp.174–181, October
2004.
[8] Y.-C. Tseng, C.-S. Hsu, and T.-Y. Hsieh, “Power-Saving
Protocols for IEEE 802.11-Based Multi-Hop Ad Hoc
Networks,” Computer Networks,vol. 43, pp. 317–337,
Oct.2003.
[9] W. Ye, H. Heidemann, and D. Estrin, “Medium Access
Control with Coordinated Adaptive Sleeping for
Wireless Sensor Networks,” IEEE/ACM Transactions on
Networking, vol. 12, pp. 493–506, June 2004.
[10] T. van Dam and K. Langendoen, “An Adaptive Energy-
Efficient MAC Protocol for Wireless Sensor Networks,”
in Proc. SenSys, pp. 171–180, November 2003.
[11] G. Lu, B. Krishnamachari, and C. S. Raghavendra, “An
Adaptive Energy-Efficient and Low-Latency MAC for
Data Gathering in Wireless Sensor Networks,” in Proc.
IPDPS, pp. 224–231, April 2004.
[12] E. Shih, S.-H. Cho, N. Ickes, R. Min, A. Sinha, A. Wang,
and A. Chandrakasan , “Physical layer driven protocol
and algorithm design for energy-efficient wireless sensor
networks,” in Proc. MobiCom , 2001.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Comparison & Analysis of Binarization Technique for
Various Types of Images Text
Monica Goyal Rachna Rajput
GKU, Talwandi Sabo GKU, Talwandi Sabo
monikagoyal84@gmail.com rachna12cse@gmail.com
ABSTRACT
Binarization is the process that converts an image into
black-and-white a threshold value is defined and the colors
above that value are converted into white. While the colors
below it is converted into black. This is a very simple
process in digital image processing when one has a
document with black ink written on a white paper.
Document image binarization is an important step in the
document image analysis and recognition pipeline. The
performance of a binarization technique directly affects the
recognition analysis. The quality of the images however
has a significant impact on the OCR performance. Since
most historical archive documents images are of poor
quality due to aging and discolored cards and ink fading.
In recent years this method has gamed popularity over its
competitors due to its simplicity superior convergence
characteristics and high solution quality. Two algorithms
are presented, that are suitable for scanning document
images are high-speed. They are designed or operate on a
portion of the image while scanning the documents, thus,
they fit pipeline architecture and lend themselves to real-
time implementation. The first algorithm is based on
adaptive thresholding and uses local edge information to
switch between global thresh holding and adaptive local
thresholding determined from the statistics of a local
image window. The second thresholding algorithm is
based on tracking the foreground and background levels
using clustering based on a variant of the K-means
algorithm. The two approaches may be used independently
or may be combined /or for improving performance.
Keywords: K-means, binarization, adaptive
thresholding, pipeline.
1. INTRODUCTION
Binarization is the starting step of most document image
analysis systems and refers to the conversion of the gray
scale image to a binary image. Binarization is a key step in
document image processing modules since a good
binarization sets the base for further document image
analysis. Binarization usual distinguishes text areas from
background areas, so it is used as a text locating technique.
1.1 Images and Digital Images
An image is a single picture which represents something. It
may be a picture of a person, of people or animals, or of an
outdoor scene, or a microphotograph of an electronic
component, or the result of medical imaging.
A digital image differs from a photo in that the (x, y) and f
(x. y) values are all discrete. Usually they take on only
integer values; x and y ranging from 1 to 256 each and the
brightness values also ranging from 0 (black) to 255
(white). A digital image can be considered as a large array
of discrete dots, each of which has a brightness associated
399
ISBN: 978-81-924893-0-8
Kanwaljeet Kaur
BGIET, Sangrur
kanwalshergill85@gmail.com
with it. These dots are called picture elements, or more
simply pixels. The pixels surrounding a given pixel
constitute its neighborhood. A neighborhood can be
characterized by its shape in the same way as a matrix
Types of Digital Images:
We shall consider basic four types of images:
(a) Binary Images.
(b) Grayscale.
(c) True color or RGB.
(d) Indexed.
Image Acquisition: Briefly, discussing the meaning for
getting picture into a computer.
CCD camera: Such a camera has, in place of the usual
film, an array or photo sites; these are silicon electronic
devices whose voltage output is proportional to light
falling on them. For a camera attached to a computer,
information fronts the photo sites is then output to a
suitable storage medium. Generally this is done on
hardware as being much faster and more efficient than
software using a frame-grabbing card. This allows a large
number of images to be captured in a very short time in the
order of one ten—thousandth of a second each. The
images can then be copied onto a permanent storage device
at some later time. Digital still cameras use a range of
devices, from floppy discs and CD's, to various specialized
cards and memory sticks. The information can then be
downloaded from these devices to hard disk.
Fig.1.1: Images Capture By Digital Camera.
Flatbed Scanner: This works on a principle similar to the
CCD camera. Instead of the entire image being captured at
once on a large array, a single row or photo sites is moved
across the image, capturing it row-by –row as it moves.
Since this is much smaller process than taking a picture
from the camera, this is quite reasonable to allow all
capture and storage to be processed by suitable software.
Fig.1.2: Images Taken By Scanner.
1.2 Binarization Techniques
Document image binarization is an important area or say
active area in the field of image processing and pattern
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
reorganization. It converts the gray scale image into binary
image as extracting text and eliminating the background.
Binarization plays the important role in document
processing since its performance is quite critically the
degree of success in subsequent character segmentation
and recognition.
Block Diagram
In order to reduce storage requirements and to increase
processing speed, it is often desirable to represent gray
scale or color images as binary images by picking a
threshold value. Binarization algorithms are classified into
global and local methods. Fig 1.3 shows the block diagram
of the binarization method.
Fig. 1.3: Block Diagram of Image Binarization Method.
In general, the document binarization deals with the two
categories: Global Method and Local Method. Our main
focus is to digitize the document images by applying
binarization techniques to suppress the background noise
and to retain information without any distortion.
1.2.1 Global Method
In global approach, a single threshold value is selected for
the entire image and is processed with value it mainly
result good in separation of foreground and background
intensity but in poor contrast, variable intensity of
foreground - background these method fails to binarized
the image. Mainly used global method is Otsu method.
1.2.2 Local Method
Problem with global thresholding is that changes in
illumination across the scene ma cause some parts to be
brighter (in the light) and some parts darker (in the
shadow) in ways that have nothing to do with the objects
in the image. We can deal, at least in part, with such
uneven illumination by determining threshold locally. Ni-
black and Sauvola techniques are used.
1.3 Importance of Binarization
Binarization of an image is carried out to convert it to 256
gray levels. By using binarization techniques, documents
processing, degraded images, fingerprints image and, help
in performing segmentation in OCR as it is mainly used
for pre-processing of an image. For example, it is used for
degraded document images to enhance it so that these
images can be used for fingerprint identification system.
The quality of binarization is measured from several
criteria objectively.
2. PROBLEM DEFINITION
The problem undertaken, High-speed scanners used in
production scanning of document images may process over
one hundred pages per minute. The speed and performance
requirements imposed on these systems dictate the use of
dedicated hardware for image processing and require
400
ISBN: 978-81-924893-0-8
algorithms that are not only effective, but also efficient and
lend themselves to real-time implementation. Document
images are typically captured in gray scale (eight bits per
pixel) by a linear array charge-coupled device and are
converted to binary (one bit per pixel) output images. In
most cases, the documents consist of text or line graphics
on a relatively uniform background, thus, converting them
to binary form is suitable for output and storage, because it
significantly reduces file size and transfer bandwidth
requirements without loss of important document
information. With the goal of preserving the content and
making the documents available in minimum time and at
reduced cost. It will increase the throughput of a system
and recognize the text appreciably. The recognition results
can be improved by using binarization techniques.
Binarization techniques can distinguish text from
background. The simplest way to get an image binarized is
to choose a threshold value, and classify all pixels and
classify all pixels with values above this threshold as
white, and all other pixels as black. The problem arises,
how to select the correct threshold.
3. LITERATURE SURVEY
NOBUYUKI, here in this paper, proposed the Global
Thresholding technique today named as Otsu method, a
non-parametric and unsupervised method of automatic
threshold selection for the picture segmentation. Histogram
of an image represents object and background with a graph
describing deep and sharp valley between two peaks
respectively as to select the threshold at the bottom of this
valley. Where as in real pictures, it is difficult to detect the
valley bottom precisely, when the valley is flat and broad,
imbued with noise, or when peaks have extremely unequal
heights. To solve these types of problems, some techniques
are proposed such as: (i) valley sharpening, (ii) difference
histogram method (iii) Apply directly to histogram.
However such methods need unstable calculation and there
are no criteria of calculating ―goodness‖ of the threshold.
So this paper proposes a method to select an optimal
threshold from the 3 discriminate criterion: mainly by
maximizing the discriminate measure, (total variance of
level) as it is independent of k(levels) as other two are
dependent and based on first order variance (class mean)
and second order variance (class variance). This
maximization is selected in sequential search by using the
simple cumulative quantities that is only 0 and first or
dissimulative moments of gray level histogram are used
and the range of k is fixed. Proposed method is used for
analyzing the further important aspects as it can be used as
a measure to evaluate the severability of classes for the
original image. It can also be used to get the lower bound
and upper bound. A straight forward extension to multi-
thresholding problems is fusible by virtue of the criteria on
which this method is based. This method leads to stable
and automatic selection of threshold based on integration
of the histogram. As a result this method is recommended
as the most simple and standard method. J.KITTLER
AND J.ILLINGWORTH, in this paper, they proposed a
derivation on computationally efficient solution, to the
problem of minimum error thresholding under the
assumption of the object and pixel gray level values being
normally distributed. Basically this method is alternative
solution to the Nagwa and Rosenfeld as they distribute the
population in mean and variance normally and the
population parameter is inferred from gray level histogram
by fitting. This approach is computationally involved as it
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
require optimization of ―Goodness of Fit‖ criteria function
by hill climbing , so the method proposed by this paper is
derivation of simpler technique for finding optimal
threshold (Bayes minimum error). It minimizes the criteria
instead of minimizing error threshold selection as it gets
the amount of overlap between object and background
population. The smaller the overlap between density
function, smaller the classification error. Therefore, the
value of the threshold yielding the lowest value of criteria
will get the best-fit model and therefore minimize the
error. This minimization of criteria function gives a
threshold value for segmenting the square from the
background. In case of non-uniform illumination where,
Otsu method fails and result in salt and pepper noise, this
method uses variable thresholding technique. By using
adaptive windows, an optimal threshold is selected for
each window. It use bilinear interpolation for defining each
pixel threshold and show the binary image, so this is the
local method of binarization.
4. TECHNIQUES WORKED OUT
The goal of Image Binarization is to convert an image of
up to 256 gray levels to a black and white image. Usually,
binarization techniques are used for processing which lead
to the clear extraction of useful information in the images
as these techniques differentiate between foreground and
background. The simplest way to get an image binarized is
to choose a threshold value and classify all pixels with
values above this threshold as white and all other pixels as
black. The problem then is how to select the correct
threshold. There are mainly two categories of methods, the
global thresholding, and local or adaptive thresholding.
The process of binarization is completed by following
steps:
4.1 Preprocessing
Preprocessing is mainly used to smooth the image. It is
used as the noise is there in image. Mainly five categories
of pre-processing filters will be studied: mean filters,
median filter, Wiener filter, Total Variation filter and Non-
local Means filter. Most of these categories have a
selection of variations in implementation.
4.1.2 Wiener Filter
The Wiener filter implemented in the spatial domain is
also evaluated. Wiener filter, known as ―Minimum mean
square error filter‖, is an adaptive linear filter, applied to
an image locally, by taking into account the local image
variance. When the variance in an image is large the
Wiener filter results in light local smoothing, while when
the variance is small, it gives an improved local
smoothing. The filtered image is computed through
Ifilt(x,y)=n+(a2-b2)(Iorig(x,y)-n)/a2 (1)
Where n and a2 are the local mean, variance respectively,
and b2 is the estimate of the noise variance.
(a) (b)
Fig.1.4: Wiener Filter (a) original image (b) wiener
filter.
401
ISBN: 978-81-924893-0-8
4.2 Binarization Techniques
4.2.1 Global Thresholding
This method, applies threshold for the entire image. The
pixels are separated into two classes. Foreground and
background. This can be expressed as in the equation (1).
Where If(x, y) is the pixel of the input image and Ib(x, y) is
the pixel of the binarized image and the image can be
separated into foreground and background [1].
Method:
Otsu Technique: Otsu is an often used global
thresholding method. It is based on treating the gray level
intensities present in the image as values to be clustered
into two sets. One foreground (black) and one background
(white). To carry out this, the algorithm minimizes the
weighted sum of within-class variances of the foreground
and background pixels to establish an optimum threshold.
This is equivalent to maximizing the between-class scatter.
From this a scalar number, K, is returned. This is then used
to binarize the image through the following equation.
4.2.2 Local Thresholding
Local thresholding method calculate a threshold for each
pixel based on the information contained in a
neighborhood of the pixel as in global it is for entire
image. If a pixel(x, y) in the input image has a higher gray
level than the threshold surface, evaluate at (x, y) and to
set to white, otherwise black. These types of approaches
are window-based, which means that the local threshold
for a pixel is computed from gray values of pixels in a
window centered at (x, y). Many researchers proposed
various techniques to compute the local threshold based on
the minimum and the maximum gray values in each
window, some are based on the mean and the standard
deviation as follows:
T=m+k*s
Where,
 T is the threshold for the central pixel of a rectangular
window which is shifted across the image,
 M is the mean,
 ‗s‘ is the variance of the gray values in the window.
 ‗k‘ is a constant.
All the method implemented and result were seen are
qualitatively (visual effects). Methods are explained with
algorithms below:
4.3 Global Method
4.3.1 Otsu Algorithm
Otsu's method is used to automatically perform histogram
shape-based image thresholding or, the reduction of a gray
level image to a binary image. The algorithm assumes that
the image to be threshold contains two classes of pixels or
bi-modal histogram (e.g. foreground and background) then
calculates the optimum threshold separating those two
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

classes so that their combined spread (intra-class variance)
is minimal. The extension of the original method to multi-
level thresholding is referred to as the Multi Otsu method.
Otsu's method is named after Nobuyuki Otsu
Otsu Threshold Method
• Based on a very simple idea:
Find the threshold that minimizes the weighted within-
class variance.
• This turns out to be the same as maximizing the between-
class variance.
• Operates directly on the gray level histogram [e.g. 256
numbers, p(i)], so it's fast (once the histogram is
computed).
Otsu Assumption:
• Histogram (and the image) are bimodal.
. No use of spatial coherence, nor any other notion of
object structure.
• Assumes stationary statistics, but can be modified to be
locally adaptive.
• Assumes uniform illumination, so the bimodal brightness
behavior arises from object appearance differences only.
Algorithm:
1. Compute histogram and probabilities of each intensity
level
2. Set up initial and
3. Step through all possible thresholds
maximum intensity
1. Update and
2. Compute
4. Desired threshold corresponds to the maximum
5. Otsu's thresholding method involves iterating through all
the possible threshold values and calculating a measure of
spread for the pixel levels each side of the threshold, i.e.
the pixels that either falls in foreground or background.
The aim is to find the threshold value where the sum of
foreground and background spreads is at its minimum.
4.3.2 Iterative Method
In this we repeat one step again and again until it reaches
to a convergence level, as the name suggest iterative.
Algorithm:
1. An initial threshold (T) is chosen; this can be done
randomly or according to any other method desired.
2. The image is segmented into object and background
pixels as described above, creating two sets:
(a) = {f(m,n):f(m,n)>T} (object pixels)
(b) = {f(m,n):f(m,n)T} (background pixels)
(Note, f(m, n) is the value of the pixel located in the
column, row)
3. The average of each set is computed.
(a) = average value of
(b) = average value of
4. A new threshold is created that is the average of and
1. T‘ = ( + )/2
5. Go back to step two, now using the new threshold
computed in step four, keep repeating until the new
threshold matches the one before it (i.e. until convergence
has been reached).
Niblack's algorithm calculates a pixel-wise threshold by
sliding a rectangular window over the gray level image.
The computation of threshold is based on the local mean
and the standard deviation s of all the pixels in the
window.
Algorithm:
(a). Simple and efficient method for adaptive thresholding
(b). The local threshold is set at: T(i,j) = (i,j) + w * o(i,j)
(c). The values for local mean and standard deviation is
calculated over a local M x N window.
(d).The parameters are the weight w and the window size.
4.4.2 Sauvola Method Algorithm
Sauvola method introduced by Jaakko Sauvola is an
efficient image binarization technique. The Sauvola
method for local binarization does quite well, and we
implement it with tiling for efficiency. The basic idea
behind Sauvola is that if there is a lot of local contrast, the
threshold should be chosen close to the mean value,
whereas if there is very little contrast, the threshold should
be chosen below the mean, by an amount proportional to
the normalized local standard deviation. Sauvola is
implemented efficiently by using "integral image"
accumulators for the mean and mean-squared pixel values.
The latter requires 64 bit floating point arrays, which are
expensive for large images. Consequently, we give a tiled
version. This gives the identical results as the non-tiled
method, but only requires accumulator arrays to be in
memory for each tile separately. For document image
binarization, Sauvola proposed a new method that first
performs a rapid classification of the local contents of a
page to background, pictures and text. Two different
approaches are then applied to define a threshold for each
pixel: a soft decision method (SDM) for background and
pictures, and a specialized text binarization method (TBM)
for textual and line drawing areas. The SDM includes
noise filtering and signal tracking capabilities, while the
TBM is used to separate text components from background
in bad conditions, caused by uneven illumination or noise.
Finally, the outcome of these algorithms is combined. New
threshold formula:
T=m*(1-k*(1-s/R)),
Where,
 T is the threshold for the central pixel of a rectangular
window which is shifted across the image,
 M is the mean,
 ‗s‘ is the variance of the gray values in the window.
 ‗k‘ is a constant.
 R is the dynamic range of the standard deviation.
Algorithm:
Step 1: Create the window of size Sx * Sy traverse it on
original X*Y as window centered on the pixel(x, y),
Step 2: Compute the local mean m(x, y) and local standard
deviation s(x, y)
Step 3: Compute the threshold value by formula: T=m*(1-
k*(1-s/R)),
Where, value k=-0.2, R=31.
Step 4: Repeat the above two step for each local window
until it has traversed whole image.

4.4 Local Method 4.4.3Localots Method

It is same as Otsu method but there is only one difference
4.4.1 Ni-black Method that this is applied on parts of image in this we took the

402
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Otsu Localots Iterative Niblack Sauvola

Method Method Method Method Method

Fig.1.8: Filtered Image.

threshold value locally. We divide the image in small 5.1.4 Applying Techniques:
windows. Fig.1.9: Binarized Image.
5.2 Datasets Taken:
5. RESULTS ANALYSIS For testing we have taken 2 cases:
All the algorithms described above are implemented and 1. Scanned images
datasets are collected. The results are evaluated 2. Digital images
quantitatively. In order to evaluate performance of the 5.2.1 For scanned images we have taken 3 types of
algorithms quantitatively, the clean image are used for images:
comparison with the binary image produced by the A. Book covers
thresholding algorithms. B. Certificates
C. Hand written papers
5.1 Results Working: D. Newspaper
 Read an image. 5.2.2 For digital images we have taken 2 types of
 Convert RGB to grayscale. images:
 Apply filters. A. Boarding
 Apply techniques. B. Pamphlets
5.3 Results for scanned images:
5.3.1 Book Covers:
5.1.1 Read an Image Origin Otsu Localot Iterativ Ni- Sauvol
In this we are reading the image which is our input or say al Metho su e black a
we want to binarize. Here we use imread( ) function of Image d Metho Metho Metho Metho
MATLAB; a inbuilt function. d d d d

Fig.1.5: MATLAB window reading an image.

5.3.2 Certificates:
Origi Otsu Localot Iterative Ni- Sauvol
nal Meth su Method black a
Imag od Metho Metho Metho
e d d d

Fig. 1.6: Original Image

5.1.2 RGB to Grayscale Image:

5.3.3 Newspaper:
Origin Otsu Localots Iterative Ni- Sauvo
Fig. 1.7: Grayscale Image.
al Meth u Method black la
5.1.3 Applying Filters:
Image od Method Metho Meth
d od

403
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Technique Otsu Localots Iterativ Ni- Sauvola

Used u e black
Image Set
Plain Text Bette Best Bad Poor Bad
r
Newspaper Good Best Good Better Bad
Clip
Documents Best Good Better Good Bad
Book Best Better Best Good Bad
Cover
Single Best Good Better Good Bad
image at
5.4 Result for camera’s images: different
5.4.1 Handwritten paper: resolution
1280*960
Origin Otsu Localo Iterati Niblac Sauvo
al Metho ts ve k la
5.5 Discussion
Image d Metho Metho Metho Metho
This result table is created by our team on visually bases.
d d d d
We take a base line ― the image which recognize the
maximum text from original image is consider the best
image and further are decided on sharpen of edges, clear
text and so on.

5.4.2 A single image at different resolution: 6. CONCLUSION & FUTURE SCOPE

Origina Ots Localot Iterativ Niblac Sauvo It is evident that no algorithm work's well for all types of
l Image u s e k la document images. Sauvola gives good results for
Me Metho Metho Metho Meth document images with dark spot and at low illumination.
tho d d d od Ni-Black captures maximum noise along with the text
d detail. Otsu one of the oldest binarization techniques gives
best overall results for document images. Document
images with non-uniform brightness require binarization
methods with delicate local thresholds that must be
determined according to various conditions. There is no
effect of resolution on binarization.
We conclude the advantages and limitations:
1280*960 Advantage
• Simple to implement
• Low computational complexity
Limitations
• Only useful when objects have constant gray values.
• Uneven illumination requires compensation.
• Throws away spatial information.
640*480
• Global nature of histograms limits application to complex
images.
• Quite often does not have spatial coherence.

Further research can focus on the challenges that merge

from the binarization of historical manuscripts such as
320*240 broken edges and smoothening of these manuscripts so
that it can be useful for further processing in OCR.

REFERENCES

320*240 [1] Benjamin Perret, Sébastien Lefèvre, Christophe Collet,

and Éric Slezak, ―Hyperconnections and Hierarchical
Representations for Grayscale and Multiband Image
Processing‖, IEEE, 2011.
[2] B.Gatos, I. Pratikakis and S.J. Perantonis, ―Adaptive
640*480 Degraded Document Image Binarization‖, Pattern
Recognition, Vol. 39(3), PP: 317 – 327, 2006.
[3] B. Gatos, I. Pratikakis and S.J. Perantonis, ―An
adaptive binarization technique for low quality historical
documents‖, IARP Workshop on Document Analysis

404
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Systems, Lecture Notes in Computer Science (3163), PP:
102 - 113, 2004.
[4] B. Gatos, I. Pratikakis and S.J. Perantonis, ―Efficient
Binarization Of Historical And Degraded Document
Images ‘‘, IEEE Transactions on Image Processing, Vol. 7,
PP: 447 - 454, 2008.
[5] B. Gatos, I. Pratikakis and S.J. Perantonis, ―Improve
Document Image Binarization by Using a Combination of
Multiple Binarization Techniques and Adapted Edge
Information‖, Proceedings of the 19th International
Conference on Pattern Recognition, PP: 1 - 4, 2008.
[6] Bolan Su, el.at, ―Robust Document Image
Binarization Technique for Degraded Document Images‖,
IEEE TRANSACTIONS ON IMAGE PROCESSING,
VOL. 22, NO. 4, APRIL 2013.
[7] Chang Moonsoo, Kang Sunmee, Rho Woosik, et.al,
"Improved Binarization Algorithm for Document. Image
by Histogram and Edge Detection", Proceedings
Binarization Methods", IEEE Trans on PAMI, Vol. 2, PP:
636 - 639, 1995.
[8] Due, Trier Torfinn Taxt, ―Evaluation of Binarization
Methods for Document Images‘‘, IEEE Transactions on
Pattern Analysis and Machine Intelligence, Vol. 17(3), PP:
312 – 315, 1995.
[9] Faisal Shafait, Daniel Keysers, Thomas M. Breuel:
―Efficient Implementation Of Local Adaptive
Thresholding Techniques Using Integral Images‖,
Proceedings of the 15th Document Recognition and
Retrieval Conference, Proc. SPIE, Vol. 6815, 2008.
[10] Fung, C.C. and Chamchong, R., ―A Review of
Evaluation of Optimal Binarization Technique for
Character Segmentation in Historical Manuscripts‖, In: 3rd
International Conference on Knowledge Discovery and
Data Mining, Phuket, IEEE, PP: 236 – 240, 2010
[11] Jaap Oosterbroek, Dr. Marco A. Wiering, Dr.
Michael H.F. Wilkinson, ―Using Max-Trees with
Alternative Connectivity Classes in Historical Document
Processing‖, 2012.
[12] Jagroop Kaur, Dr.Rajiv Mahajan, ―A Review of
Degraded Document Image Binarization Techniques‖,
International Journal of Advanced Research in Computer
and Communication Engineering, Vol. 3, Issue 5, 2014.
[13] J. Bernsen, ―Dynamic Thresholding of Grey-Level
Images‖, In: 8th International Conference on Pattern
Recognition, France-Paris, ICPR, PP: 1251 – 1255, 1986.
[14] J. He, Q.D.M. Do, A.C. Downton, and J.H. Kim., ―A
Comparison of Binarization Methods for Historical
Archive Documents‖, In International Conference on
Document Analysis and Recognition, PP: 538 – 542, 2005.
[15] Jiang Duan, Mengyang Zhang, Qing Li, ―A Multi-
stage Adaptive Binarization Scheme for Document
Images‖, Proceedings of the Second International Joint
Conference on Computational Sciences and
Optimization(CSO), Sanya, Hainan, China, IEEE, Vol. 1,
PP: 867 - 869, 2009.
[16] J. Kittler and J. Illingworth, "Minimum Error
Thresholding," Pattern Recognition, Vol. 19(1),
PP: 41 - 47, 1986.
[17] K.Ntirogiannis ,B. Gatos and I. Pratikakis, ―A
Modified Adaptive Logical Level Binarization Techniques
For Historical Document Images‖, 10th International
Conference on Document analysis and
Recognition(ICDAR), Barcelona, Spain, IEEE, PP: 1171 –
1175, 2009.
[18] Likforman-Sulem, L., Darbon, J., and Barney Smith,
E. H., ―Pre-processing of Degraded Printed Documents by
Non-Local Means and Total Variation,‖ In the proceedings
405
ISBN: 978-81-924893-0-8
of the 10th International Conference on Document
Analysis and Recognition, Barcelona, Spain, PP: 758 –
762, 2009.
[19] Manju Joseph, Jijina K.P, ―Simple and Efficient
Document Image Binarization Technique for Degraded
document images‖, IJSR - INTERNATIONAL JOURNAL
OF SCIENTIFIC RESEARCH, Vol: 3, Issue: 5, 2014.
[20] Naveed Bin Rais, M. Shehzad Hanif, Imtiaz A.Taj,
―Adaptive Thresholding Technique for Document Image
Analysis‖, IEEE International Multitopic Conference
(INMIC), IEEE, PP: 61 - 66, 2005.
[21] Nobuyuki Otsu, "A threshold selection method from
gray-level histograms". IEEE Trans. Sys., Man&
Cybernetics, Vol. 9(1), PP: 62 - 66, 1979.
[22] Ntogas Nikolaos, Ventzas Dimitrios, ―A Binarization
method for. Historical Manuscripts‖, 12th WSEAS
International Conference on Comunications, Heraklion,
Greece, PP: 23 – 25, 2008.
[23] Prof. S. P. Godse, Samadhan Nimbhore, Sujit
Shitole, Dinesh Katke, Pradeep Kasar, ―Recovery of badly
degraded Document images using Binarization
Technique‖, International Journal of Scientific and
Research Publications, Vol: 4, Issue 5, 2014.
[24] Rachid Hedjam, Reza Farrahi Moghaddam and
Mohamed Cheriet, Senior member, IEEE, ―A spatially
adaptive statistical method for the binarization of historical
manuscripts and degraded document images‖, Preprint
submitted to Elsevier, 2012.
[25] Rowayda A. Sadek, ―An Improved MRI
Segmentation for Atrophy Assessment‖, IJCSI
International Journal of Computer Science Issues, Vol: 9,
Issue 3, No 2, 2012.
[26] S. Kopf, T. Haenselmann, and W. Effelsberg.,
―Robust Character Recognition In Low-Resolution Images
And Videos Technical Report‖, Department for
Mathematics and Computer Science, University of
Mannheim, Reihe Informatik, TR-05-0022005, 2005.
[27] Sudipta Roy, Ayan Dey, KingshukChatterjee, Prof.
Samir K. Bandyopadhyay ―A New efficient Binarization
Method for MRI of Brain Image‖, Signal & Image
Processing: An International Journal (SIPIJ) Vol: 3, No.6,
2012.
[28] Valizadeh, M., Komeili, M., Armanfard, N., Kabir,
E., ―A Contrast Independent Algorithm for Adaptive
Binarization of Degraded Document Images‖, 14th
International CSI Computer Conference, Art. No.
5349339, PP: 127 – 132, 2009.
[29] Valizadeh, M., Komeili, M., Armanfard, N., Kabir,
E., ―Degraded Document Image Binarization Based On
Combination of Two Complementary Algorithms‖,
International Conference on Advances in Computational
Tools for Engineering Applications, Art. No. 5227898, PP:
595 – 599, 2009.
[30] IEEE. Trans. PAMI, Vol. 19(5), PP: 540 - 544, 1997.
[31] You Yang, "OCR Oriented Binarization Method of
Document Image," Image and Signal Processing, IEEE,
Vol. 4, PP: 622 - 625, 2008.
[32] Yung-Hsiang Chiu, Kuo-Liang Chung, Wei-Ning
Yang, Yong-Huai Huang, Chi-Huang
Liao, ―Parameter-free based two-stage method for
binarizing degraded document images‖, Elsevier, 2012.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Page Ranking Algorithms for Web Mining: A Review

Charanjit Singh Dr. S. K Kautish

Research Scholar Professor & Dean Engineering
Guru kasha University Gurur Kashi University
Talwandi Sabo Talwandi Sabo
Sehgal_cs@yahoo.com dr.skautish@gmail.com

ABSTRACT
It is becoming very difficult for the web search engines to
provide relevant information to the users with the growth of the
WWW One of the Data Mining technique called Web mining is
defined to extract the hidden information from the web
documents and services. As per the information that is hidden,
web mining can be divided into three different types: web
content mining, web structure mining and web usage mining.
The main application of web mining can be seen in the case of
search engines. In order to rank their search results, they are
using various page ranking algorithms that are either based on
the content of the web pages or on the link structure of WWW.
In this paper, a survey of page ranking algorithms based on
both content and link structure of the web page and comparison
of some important algorithms in context of performance has
been carried out.
Keywords
WWW, Data mining, Web mining, Search engine, Page
ranking.
1. INTRODUCTION
The World Wide Web is a popular segment of the Internet that
contains billions of documents called Web pages includes
documents can contain text, image, audio, video and metadata.
With the rapid growth of information sources on the web world,
it is becoming difficult to manage the information and satisfy
the user needs. To retrieve the required information from the
web matrix, numerous web search engines are used by the
users. Some commonly used search engines are Google, msn,
yahoo search etc.
A tool called Web Search engine is used to enable document
search with respect to specified keywords, in the web and
returns a list of documents where the keywords were found.
Every search engine performs various tasks based on their
respective architectures to provide relevant information to the
users. Basic components of a web search engine are: Interface
(user), Parser, Web Crawler, Database and Ranking Engine (see
Fig. 1).
Web search engines work by sending out a spider or web
crawler to visit and download all the web pages of the website
and retrieve the information needed from them. Using the
information gathered from the crawler, a search engine will
then determine what the site is about and index the information.
But before representing the pages to the user, search engine
uses ranking algorithms in order to sort the results to be
displayed. That way user will have the most important and
useful results first.
In this review paper, various content based and link based page
Web User
Query
Result
Web Crawler
Query
Web pages Interface
Indexer Search
Web Engine
Mining
Index Query
Processor
Figure 1: Search Engine Architecture
ranking algorithms has been done and a comparison is carried
out. This paper is divided into different sections: in section 1,
first introduce the concept of web search engines and explain
its working. In section 2, present the web mining concepts,
categories and technologies. As shown in section 3, present the
detailed overview of some page ranking algorithms and section
4, includes the comparison of these algorithms in context of
performance. Finally in section 5, conclude this review and
discuss some future directions for the system.
2. WEB MINING
Application of data mining technique such as web mining is
used to discover automatically and take out information from
Web data. Web mining data can be:
 Web Content data- text, images, records, etc
 Web Structure data- hyperlinks, tags etc
 Web Usage data- http logs, app server logs, etc
Further Web Mining can be divided into three categories [1]
namely web content mining, web structure mining and web
usage mining as shown in Fig. 2
2.1 Web Content Mining (WCM): WCM is the
process of extracting useful information from the contents of
web documents. Content data corresponds to the collection of
facts a web page was designed to convey to the users. It may
consist of text, images, audio, video, or structured records such
as lists and tables. It can be applied on web pages itself or on
the result pages obtained from a search engine. The Research
activities in this field also involve using techniques from other
disciplines such as Information Retrieval (IR) and the natural
Language Processing (NLP) and Web content mining is further

406
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Web Mining

Web Content Mining Web Structure Web Usage Mining

Mining

Web Page General access Customized

Web Search
Content Mining Pattern tracking Usage tracking
Result Mining

Agent Database Agent Based Database

Based Approach Approach
Approach
Approach

Figure 2: Taxonomy of Web Mining

divide into Web page content mining and Search results
mining. Web page content mining is traditional searching of
web pages with the help of content while search result mining
is a further search of pages found in previous search.
2.2 Web Structure Mining (WSM): Web
Structure Mining (WSM) is the process, using graph theory
discover structure information from the web. This type of
mining can be performed either at the document level or at the
hyperlink level or we can say as intra-page and inter-page The
structure of a typical web graph consists of web pages as nodes,
and hyperlinks as edges connecting between two related pages.
2.3 Web Usage Mining (WUM): Web usage
mining is used to discover the significant patterns from data,
generated by client-server transactions on one or more web
localities. It can be further categorized in finding the general
access patterns or in finding the patterns matching the specified
parameters.
Business intelligence, site improvement and modification, web
personalization, ranking of pages are application area of said
mentioned categories of web mining. Various ranking
algorithms are used by search engine in order to sort the results
to be displayed and to provide relevant information to the users
to cater to their needs. There are various ranking algorithms
developed, few of them have been discussed in the next section:
Page Rank, Weighted Page Rank, HITS and SimRank [3, 4]
3. PAGE RANKING ALGORITHMS
With the swift development of network techniques, huge
information resources glut the whole web world. Web search
engine is increasingly becoming the leading information
retrieving approach.
Relevant information provides to the users is the primary goal
of search engines. As a result, various Page Ranking
Algorithms are used to rank the query results of web pages in
an effective and efficient fashion.
Some algorithms rely only on the link structure of the
document. i.e their popularity scores (web structure mining),
whereas others look for the content in the documents (web
content mining), while some use a combination of both i.e they
use link as well as content of the document to assign a rank
value to the concerned document. Some commonly used page
ranking algorithms have been discussed as follows:
3.1 Page Rank Algorithm
Page Rank Algorithm was purposed by Surgey Brin and Larry
Page [4, 5]. Page Rank was named after Larry Page also was
cofounder of Google search engine. Usually used by the
Google [6] web search engine to rank websites in their search
engine results. Page Rank is used to measure the importance of
website pages by counting the number and quality of links to a
page.
This algorithm states that the Page Rank of a page is defined
recursively and depends on the number and Page Rank metric
of all pages that link to it (incoming links). If a page has some
important incoming links to it than its outgoing links to other
pages also become important. A page that is linked to by many
pages with high Page Rank receives a high rank itself.
A Page Rank Algorithm considers more than 25 billion web
pages on the www to assign a rank score [6]. A simplified
version [4] of Page Rank is defined in Eq.1:
PR (u )  C  PR(v) / N
V B ( u )
v
(1)
here ‘u’ represents a web page, B(u) is the set of pages that
points to u, PR(u) and PR(v) are rank scores of pages u and v
respectively, Nv denotes the number of outgoing links of pages
v, C is a factor used for normalization. In Page Rank, the rank
score of a page, p, is evenly divided among its outgoing links.
The values assigned to the outgoing links of page p are in turn
used to calculate the ranks of the pages to which page p is
pointing as shown in Fig. 3
Figure 3: Distribution of page ranks

407
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Later algorithm was modified, observing that not all users

follow the direct links on WWW. The modified version is given
in Eq. 2:

PR (u )  (1  d )  d  PR(v) / N
V B ( u )
v
(2)

Here‘d’ is a damping factor that is usually set to 0.85 and it can

be thought of as the probability of users’ following the links
and (1-d) as the page rank distribution from non-directly linked
pages.
Figure 4: Hubs and Authorities
3.2 Weighted Page Rank Algorithm
This algorithm was proposed by Wenpu Xing and Ali Ghorbani 3.1.1 The HITS algorithm works in two
[9] which is an extension of PageRank algorithm. Algorithm
assigns rank values to pages according to their importance or major steps:
popularity rather than dividing it evenly. The popularity is
assigned in terms of weight values to incoming and outgoing
links and are denoted as Win(v, u) and Wout (v, u) i. Sampling step: In this step, a set of relevant pages for
respectively. Win(v, u) is the weight of link (v,u) calculated on the given query are collected.
the basis of incoming links to page u and the number of
incoming links to all reference (outgoing linked) pages of page ii. Iterative step: This step finds hubs and authorities
v. using the output of sampling step. The scores of hubs
and authorities are calculated as follows:

W(inv ,u )  I u / I
pR ( v )
P
Hp  A q (6)
(3)
ql ( p )
where Iu and Ip represent the number of incoming links of page
u and page p, R(v) is the reference page list of page v.
Wout(v,u) is the weight of link (v,u) calculated on the basis of

H
the number of outgoing links of page u and the number of
outgoing links of all the reference pages of page v. Ap  q (7)
qB ( p )

v ,u )  Ou /
W(out O
pR ( v )
P
where Hq and Aq represents the Hub score and authority score
of a page. I(p) and B(p) denotes the set of reference and referrer
(4) pages of page p. the page’s authority weight is proportional to
the sum of the hub weights of pages that it links to.
Here Ou and Op represents, the number of outgoing links of
page u and page p, respectively. Then the weighted Page Rank
is given by a formula: 3.1.2 Constraints with HITS algorithm
The following are the constraints of HITS algorithms:

WPR(u )  (1  d )  d WPR(v)W
V B ( u )
in
W(out
( v ,u ) v ,u )
(5)
3.3 HITS
This algorithm was developed by Jon Kleinberg [7] called
Hyperlink- Induced Topic Search (HITS) [8] which gives two
forms of web pages called as hubs and authorities. Hubs are the
pages that act as resource lists. Authorities are having important
contents.
A fine hub page for a subject points to many authoritative pages
on that context and a good authority page is pointed by many
fine hub pages on the same subject. HITS assumes that if the
author of page p provides a link to page q, then p confers some
authority on page q. Kleinberg states that a page may be a good
hub and a good authority at the same time.
The HITS algorithm considers the WWW as a directed graph
G(V,E) where V is a set of vertices representing pages and E is
a set of edges that match upto links. Fig. 4 shows the hubs and
authorities in web.
i. Hubs and Authorities: It is not simple to distinguish
between hubs and authorities since many sites are hubs
as well as authorities.
ii. Topic drift: Sometimes HITS may not produce the
most relevant documents to the users queries because of
equivalent weights.
iii. Automatically generated links: Some links are
automatically generated and represent no human
judgment, but HITS gives them equal importance.
iv. Efficiency: The performance of HITS algorithm is not
efficient in real time.
HITS was used in a prototype search engine called Clever for
an IBM research project. Because of the above constraints,
HITS could not be implement in a real time search engine.
3.4 SimRank
A new page rank algorithm which is based on similarity
measure from the vector space model, called SimRank [10]. In
order to rank the query results of web pages in an effective and
efficient manner, SimRank is used. Normally, traditional Page

408
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Rank algorithm only employ the link relations among pages to
compute the rank of each page but the content of each page
cannot be ignored completely. Actually, the accuracy of page
scoring greatly depends on the content of the page. Therefore,
SimRank algorithm is used to provide the most relevant
information to the users. To calculate the score of web pages in
SimRank , a page in vector space model is represented as a
weight vector, in which each component weight is computed
based on some variation of TF (Term Frequency) ot TF-IDF
(Inverse Document Frequency) scheme as follows:
3.4.1 TF scheme: In TF scheme, the weight of a term
ti in page dj is the number of times that ti appears in
document dj, denoted as fij. The following normalization
approach is applied [4]
f ij
tf ij 
max{ f1 j , f 2 j ,....... f V j REFERENCES
(8)
Where fij is the frequency count of term ti in page j and |V| is
the number of terms in page. The disadvantage of this scheme
is that it does not consider the case that a term appears in
several pages, which limits its application.
3.4.2 TF-IDF scheme: The inverse document
frequency (denoted by idfi ) of term ti is computed by [4].
N
idf i  log
df i (9)
where N is the total no of pages in a web database, dfi is the
number of pages in which term ti appears atleast once, and fij is
the frequency count of term ti in page dj. The term weight is
computed by:
Wij  tf ij  idf i
(10)
Note that the TF-IDF scheme is based on the intuition that if a
term appears in several pages, it is not important. SimRank
algorithm is based on the similarity measure for computing the
rank of each page. The main content of a crawled page contains
two parts: title and body. The SimRank algorithm works on two
distinct weight values that are assigned to the title and body of
a page, respectively. The formula for calculating the SimRank
is as follows [simrank paper]:
SimRank ( p j )  tconst  Wijtitle  bconst  Wijbody (11)
Where pj, could be denoted as (w1j, w2j,…….,wmj), Wij is the
term weight, ‘t const’ and ‘b const’ are some constants between
0.1 to 1.
4. COMPARISON OF VARIOUS
ALGORITHMS
On the basis of literature analysis, a comparison of certain Web
Page Ranking Algorithms is shown in Table 1. The comparison
is performed on the basis of some vaults such as Mining
technique use, Methodology, Input parameters, Relevancy,
Working levels, Quality of results, Importance and Limitations.
409
ISBN: 978-81-924893-0-8
On the basis of these parameters, we can check the performance
of each algorithm.
5. CONCLUSION
The Page Ranking Algorithms, which are an application of web
mining, play an important role in making the user navigation
easier in the results of a search engine. This paper described
several proposed algorithms like Page Rank algorithm,
Weighted Page Rank algorithm, HITS, SimRank, etc. all
algorithms may provide satisfactory performance in some cases
but many times the user may not get the relevant information.
This is because some algorithms calculate the rank by
considering only the content of web page but others compute it
by focusing on link relations among pages. Therefore, a new
technique can be proposed that will consider both content and
link relation of a web page.
[1] Kaur,M., Singh,C., 2014. Content based and Link based
page ranking algorithm: A Survey. International Journal of
Advanced and Innovative Research (IJAIR), ISSN: 2278-
7844,Vol 3, Issue – 4, pp. 250-255.
[2] R.Cooley, B.Mobasher and J.Srivastava, 1997. Web
Mining: Information and Pattern Discovery on the World
Wide Web". In Proceedings of the 9th IEEE International
Conference on Tools with Artificial Intelligence,
(ICTAI'97).
[3] Dr. M. H. Dunham, 2002 Data Mining:Introductory and
Advanced Topics, Prentice Hall.
[4] L. Page, S. Brin, R. Motwani, and T. Winograd, 1999. The
Pagerank Citation Ranking: Bringing order to the Web.
Technical report, Stanford Digital Libraries, SIDL-WP-
1999-0120.
[5] Duhan, N., Sharma, A.K., Bhatia, K.K., 2009. Page
Ranking Algorithms: A Survey. Proceedings of the IEEE
International Conference on Advance Computing.
[6] Kleinberg J., 1998. Authorative Sources in a Hyperlinked
Environment". Proceedings of the 23rd annual
International ACM SIGIR Conference on Research and
Development in Information Retrieval.
[7] C. Ding, X. He, P. Husbands, H. Zha, and H. Simon, 2001.
Link Analysis: Hubs and Authorities on the World.
Technical report: 47847.
[8] Bing Liu., 2006. Web Data Mining: Exploring Hyperlinks,
Contents, and Usage Data (Data-Centric Systems and
Applications). Springer-Verlag NewYork, Inc., Secaucus,
NJ, USA.
[9] Lizorkin, D., Velikhov, P., Grinev, M., Turdakov, D.,
2008 Accuracy estimate and optimization Techniques for
Simrank Computation. Published in ACM, Print ISBN No:
978-1-60558-305-1, on 24-30 Aug 2008, pp. 422-433.
[10] Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y., Wu, T.,
2010. Fast Computation of SimRank for Static and
Dynamic Information Networks. Published in ACM, Print
ISBN No: 978-1-60558-9045-9, on 22-26 March 2010.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1. Comparison of Page Ranking Algorithms

Algorithm Page Rank Weighted Page Rank SimRank HITS

Mining
Web Structure Mining,
Technique Web Structure Mining Web Structure Mining Web Content Mining
Web Content Mining
used

Computes scores at Computes scores at

indexing time not ay query indexing time, unequal Computes scores at query Computes hub and
Description time. Results are sorted distribution of score, pages time. Results are calculated authority scores of n highly
according to the are sorted according to dynamically. relevant pages on the fly.
importance of pages. importance.

I/P Backlinks, forward links,

Backlinks Backlinks, forward links Content
Parameters content

Working
N* 1 1 <N
levels

Less
Relevancy Less More More
(higher than PR)

Importance More More Less Less

Quality of
Medium Higher than PR Approx equal to WPR Less than PR
results

Importance of page links is Topic drift and efficiency

Limitations Query Independent Query Independent
totally ignored problems

410
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Comparative analysis of various data mining
classification algorithms
Yogesh Kumar
Bhai Gurdas College of engg.
& technology,sangrur
yksingla37@gmail.com
ABSTRACT
Data mining is the process of digging through and analyzing
various sets of data and then extracting the meaning of the data.
Classification is a data mining method used to predict the class
of objects whose class label is not known. There are many
classification mechanisms used in data mining such as K-
Nearest Neighbor (KNN), Bayesian network, Cross validated
parameter selection (CVPS), Naive Bayes Multinominal Updatae-
ble (NBMU) Algorithm, Fuzzy logic, Support vector
machines etc. This paper presents a comparison on four
classification techniques which are K-Nearest Neighbor, User
Classifier, Cross validated parameter selection and Naive
Bayes Multinominal Updataeble Algorithms. The goal of this
research is to enumerate the best technique from above four
analyzed under a given data set and provide a fruitful
comparison result which can be used for further analysis or
future development.
Keywords
KNN,CVPS,NBMU,User Classifier
1. INTRODUCTION
Data mining concept is growing very fast in popularity, it
is a technology that involving methods at the intersection of
(Ar- tificial intelligence, Machine learning and database
system), the main goal of data mining process is to extract
information from a large data into a form which could be
understandable for further use. Classification is a data mining
technique based on machine learning [1]. Basically, it is used
to classify each data item in a set of data into one of a
predefined set of classes or groups. The classification
technique makes use of mathematical techniques such as
decision trees, linear programming, neural network etc. In
classification, we make the various types of software that can
learn how to classify the data items into groups. This research
has conducted a comparison study between a number of
available data mining software and tools depending on their
ability for classifying data correctly and accurately. The
accuracy measure which represents the percentage of
correctly classified instances that is used for judging the
performance of the selected tools and software. The rest of the
paper is organized as follows: Section 2 summaries related
works on data mining, data classification. Section 3
summaries the various types of data classification techniques
used. Section 4 provides a general description of the tools and
software under test and dataset used. Section 5 reports
experimental results and compares the results of the different
algorithms. Finally, I close this paper with a summary and an
outlook for some future work.
411
ISBN: 978-81-924893-0-8
Indu bala
Bhai Gurdas College of engg.
& technology,sangrur
Indu.bala30@gmail.com
2. LITERATURE SURVEY
Oliver, et al. (2012) proposed Introduction to k Nearest
Neighbor Classification and Condensed Nearest Neighbor
Data Reduction, k Nearest Neighbors (KNN)[2] algorithm is
to use a database in which the data points are separated into
several separate classes to predict the classification of a new
sample point. The process of choosing the classification of
the new observation is known as the classification problem
and there are the various ways to tackle it. Here we consider
choosing the class of the new observation based on the
classes of the observations in the database which it is most
similar" too.
Thair, et al. (2009) suggested that Classification is a data
mining or machine learning technique used to predict group
membership for data instances. In this, he presents the basic
classification mechanisms. Several major kinds of classifica-
tion techniques including decision tree induction, Bayesian
networks, k-nearest neighbor classifier [3], case-based
reason- ing, genetic algorithm and fuzzy logic techniques.
The goal of this survey is to provide a comprehensive review
of different classification mechanisms in data mining.
Delveen, et al. (2013) proposed, Data mining concept is
growing very fast in popularity, it is a technology that in-
volving large no. Of methods at the intersection of (Machine
learning, database system and Statistics), the main goal of
data mining method is to extract information from a large
data into a form which could be understandable for further
use. Some algorithms for data mining are used to give
solutions to various classification problems in the database. In
this a comparison among three classifications algorithms will
be studied, these are (K- Nearest Neighbor classifier,
Decision tree [4] and Bayesian network) algorithms. In this
he demonstrates the strength and accuracy of each algorithm
for classification in term of performance efficiency and time
complexity required.
Sohil, et al. (2013) suggested that There are several
methods of data mining like classification, clustering,
association rule, outlier analysis, etc. That are used for
uncovering hidden patterns from the data. There are various
algorithms of above techniques are developed by various
researchers. In this he tried to examine and investigate various
techniques of classifications like Decision Trees, Naive
Bayes, k-Nearest Neighbor [5], Feed Forward Neural
Networks and Support Vector Machine to identify the best fit
methods among them. All the above mentioned algorithms
were implemented using WEKA which consists of a
collection of machine learning algorithms for data mining
tasks.
Abdullah, et al. proposed that huge amount of data and
info. Are available for everyone, Data can now be stored in
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
many different kinds of databases, besides being available on
the Internet. With such amount of data, there is a need for
powerful methods for better interpretation of these data that
exceeds the human’s ability for making decision in a better
way. In order to get the best tools for classification task that
helps in decision making [6]. He has shown a comparative
study between a number of freely available data mining and
knowledge discovery tools. He has shown the results that the
performance of the tools for the classification task is affected
by the kind of dataset used and by the way the classification
techniques were implemented within the toolkit.
Yogesh, et al. (2013) suggested that network security needs
to be concerned to provide secure information medium due to
increase in potential network attacks. In todays era detection
of various security threats that are commonly referred to as
intrusion [7], has become a very critical issue in the network.
Highly secured data of large organizations are present over
the network so in order to prevent that data from unauthorized
users or attackers a strong security technique is required.
Intrusion detection system plays a major role in providing
security to computer networks. Intrusion Detection System is
a valuable tool for providing security to computer networks.
In this paper a comparative analysis of different feature
selection mechanisms is presented on the KDD dataset and
their performance are evaluated in terms of computational
time, detection rate and ROC.
3. TECHNIQUES USED
3.1. K-Nearest Neighbor Classifiers (KNN)
K-NN is a type of lazy learning where the function is only
approximated locally and all computation is deferred until
classification. The k-NN is a lazy learning technique [8], and
instead of estimating the target function once for the whole
instance, they delay processing until classification. This
algorithm is amongst the simplest of all machine learning
algorithms: an object is classified by a majority vote of its
neighbors, with the object being assigned to the most common
class amongst its k nearest neighbors (k is a positive integer,
typically small). If k = 1, then the object is simply assigned to
the class of its nearest neighbor. The neighbors are taken from
a collection of objects for which the correct classification is
known. In this no training step is required. The k-nearest
neighbor algorithm is sensitive to the local structure of the
data. K-Nearest Neighbors (K-NN) algorithm is a
nonparametric method in that no parameters are estimated.
For eg: To classify an unknown object:
 Compute distance to other training objects
 Identify total no. Of k nearest neighbors
 Use classification of nearest neighbors to determine
the class label of unknown record
Algorithm of KNN: Consider k as the desired number of
nearest neighbors and S: = p1,..., pn is the set of training
samples in the form p1 = (xi, ci), where xi is the d-
dimensional feature vector of the point pi and ci is the class
that pi belongs to. For each p’= (x’, c’)
 Compute the distance d (x’, xi) between p’ and all
pi belonging to S using Euclidean distance formula:
d(p,q)= 𝑖 (𝑝𝑖 − 𝑞𝑖 )2
 Sort all points pi according to the distance d (x’, xi).
 Select the first k training samples from the sorted
list, those are the k closest training samples to p’.
 Assign classification to p’ based on majority vote
of classification.
412
ISBN: 978-81-924893-0-8
3.2. Decision tree
Decision trees are trees that classify objects by sorting them
based on feature values. Each node in a tree represents a
feature value in[9] an object to be classified, and each branch
represents a value of the node. Objects are classified starting
at the root node and sorted based on their feature values.
Decision Trees offer many benefits of data mining technology
like:
 Easy to follow when compacted.
 The ability of handling a variety of input data:
numeric and text etc.
 High performance in a relatively small
computational effort.
 Useful for various techniques, such as
classification, clustering and feature selection etc.
3.3.Naive Bayes Multinomial Updateable
Algorithm
The task of text classification can be approached from a
Bayesian [10]learning perspective, which predicts that the
word distributions in documents are generated by a specific
parametric model, and the parameters can be estimated from
the training data.There is an option available for NaiveBayes-
Multinomial. When the option is debug and if it’s set to true,
classifier may output additional info. To the console. This is
the incremental version of the naive Bayes multinomial
algorithm. This uses the Bayes rule theory as its core
equation.
3.4. User Classifier
Interactively classify through visual means. You are Presented
with a graph of the data against two user selected
attributes[11], as well as a view of the decision tree. By
creating polygons around data plotted on the scatter graph,
You can create binary splits, as well as by allowing another
classifier [12] to take over at points in the decision tree should
you see fit. There is an option available for UserClassifier.
When the option is debug and if it’s set to true, classifier may
output extra info. to the console.
3.5.CV Parameter Selection Algorithm
This is a class for performing parameter selection by
crossvalidation for any classifier. There are various types of
the options available for CVParameterSelection. When the
option is CV Parameters, then it sets the scheme parameters
which are to be set by cross-validation. When the option is a
classifier, then the base classifier is to be used. When the
option is debug and if it’s set to true, classifier may output
extra info. To the console. If the option is numFolds, then it
gets the no. Of folds used for cross validation. If the option is
a seed, then the random no. seed to be used.
4. THE COMPARATIVE STUDY
The methodology of the study consists of collecting a set of
data mining and knowledge discovery tools to be tested,
specifying the data set to be used, and selecting a various set
of the classification algorithm to test the tools’ performance.
4.1. Tools Description
Weka 3.6 is a collection of machine learning algorithms for
data mining tasks. Weka stands for Waikato Environment for
Knowledge Analysis [13]. The algorithms can either be
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
applied directly to a dataset or called from the Java code.
Weka contains various tools for data pre-processing,
classification, regression, association rules, clustering, and
visualization. The Weka GUI Chooser (class
weka.gui.GUIChooser) provides a starting point for launching
Weka’s main GUI applications and supporting tools. The GUI
Chooser consists of four buttons: one for each of the four
major Weka applications and four menus. The buttons can be
used to start the applications that are explained as follows:
 Explorer: It is an environment used for exploring
data with WEKA (the rest of this documentation
deals with this application in more detail).
 Experimenter: It is an environment for performing
experiments and conducting statistical tests between
learning schemes.
 KnowledgeFlow: This environment supports
essentially the same functions as the Explorer, but
with a drag-and drop interface. It supports
incremental learning.
 SimpleCLI: It provides a simple command-line
interface that allows direct execution of WEKA
commands for operating systems that do not provide
their own command line interface.
4.2. Data Set Description
To verify the efficiency of KNN algorithm with other classifi-
cation algorithm, I have used KDD dataset. This dataset
contains 39 features and is labeled with exact one specific
attack type i.e., either normal or an attack. Each vector is
labeled as either normal or an attack, with exactly one specific
attack type. Deviations from normal behavior, everything that
is not normal, are considered attacks. Attacks labeled as
normal are records with normal behavior. The training dataset
has 53.18% normal and 46.81% attack connections. KDD
CUP 99 has been most widely used in attacks on network. The
simulated attack falls in one of the following four categories:
 Denials-of Service (DoS) attacks[7] have the goal of
limiting or denying services provided to the user,
computer or network. A common tactic is to
severely overload the targeted system. (E.g. apache,
smurf, Neptune, Ping of death, back, mailbomb,
udpstorm, SYNflood, etc.).
 Probing or Surveillance attacks have the goal of
gaining knowledge of the existence or configuration
of a computer system or network. Port Scans or
sweeping of a given IPaddress range typically fall in
this category. (e.g. saint, portsweep, mscan, nmap,
etc.).
 User-to-Root (U2R) attacks have the goal of gaining
root or super-user access to a particular computer or
system on which the attacker previously had user
level access. These are attempts by a non-privileged
user to gain administrative privileges (e.g. Perl,
xterm, etc.).
 Remote-to-Local (R2L) attack is an attack in which
a user sends packets to a machine over the internet,
which the user does not have access to in order to
expose the machine vulnerabilities and exploit
privileges which a local user would have on the
computer .
Features of data set are grouped into four categories:
 Basic Features: Basic features can be derived from
packet headers without inspecting the payload.
 Content Features: Domain knowledge is used to
assess the payload of the original TCP packets. This
413
ISBN: 978-81-924893-0-8
includes features such as the number of failed login
attempts.
 Time-based Traffic Features: These features are
designed to capture properties that mature over a 2
second temporal window. One example of such a
feature would be the number of connections to the
same host over the 2 second interval.
 Host-based Traffic Features: Utilize a historical
window estimated over the number of connections
in this case100 instead of time. Host based features
are therefore designed to assess attacks, which span
intervals longer than 2 seconds.
In order to test the classifiers, I randomly selected 4973
connection records as a training data set and 1000 connection
records as a testing data set. Below Table 1 shows the detail
of connection records in these both datasets. KDD dataset
contains symbolic as well as continuous features.
Table 1: details of connection records in used dataset
Label Training Testing set
set
Normal 2645 269
Probe 114 114
DOS 2147 550
U2R 21 21
R2L 46 46
Total 4973 1000
Records
5. EXPERIMENTS AND EVALUATIONS
5.1. Result evaluation parameters
1) The correctly and incorrectly classified instances show the
percentage of test instances that were correctly and incorrectly
classified. The percentage of correctly classified instances are
often called accuracy or sample accuracy.
2) Root Mean Squared Error (RMSE): The RMSE is a
quadratic scoring rule which measures the average magnitude
of the error.
RMSE= sqrt ((p1-a1)2+…..+ (pn-an) 2/n)
3. Relative Absolute Error (RAE): It is just the total, absolute
error, with the same kind of normalization.
RAE= (|p1-a1|+…+|pn-an|)/(|a¯-a1|+…+| a¯-an|)
(4) Root Relative squared error (RRSE): The root relative
squared error takes the total root of squared error and
normalizes it by dividing the total squared error of the default
predictor. Root relative squared error Ei of an individual
program i is evaluated by the equation:
𝑛 𝑛
Ei= 𝑗 =1(𝑃𝑖𝑗 − 𝑇𝑗 )2 𝑗 =1(𝑇𝑗 − 𝑇) 2
Where P(ij) is the value predicted by the individual program i
for sample case j (out of n sample cases); Tj is the target value
for sample case j; and is given by the formula:
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

𝑛
Root Relative squared error 75%
𝑇 = 1/𝑛 𝑇𝑗
𝑗 =1 Relative absolute error 66%

(5) Mean absolute error (MAE): The mean absolute erroris

less sensitive to outliers than the mean squared error. The
error rates are used for numeric prediction rather than 5.3: Result of different classification algorithms on Weka
classification.
In this I have taken upper defined KDD dataset as a training
MAE=|p1-a1|+…..+|pn-an|/n set and a testing set in the weka. By implementing different
algorithms on this training set and testing set, I have found the
5.2. Result for KNN algorithm % of correctly classified instances, incorrectly classified
In this I have taken upper defined KDD dataset as a training instances, Mean absolute error, Root mean squared error, and
set and a testing set. By implementing the KNN algorithm on Root Relative squared error, a Relative absolute error that is
this training set and testing set by using console application, I shown in below table 5.
have found the % of correctly classified instances, incorrectly
Table 5: performance of different algorithms on weka
classified instances, Mean absolute error, Root mean squared
error, Root Relative squared error, Relative absolute error by Parameter UserClassifier NBMU CVPS
using majority vote classification among the class of the K
objects. Finally, I got the result given by the KNN algorithm % of correctly 52.33 57.89 52.33
as shown in below tables 2, 3 and 4. classified instances
% of incorrectly 47.6641 42.1053 47.664
Table 2: output given by knn algorithm classified instances
Mean absolute 0.2123 0.1687 0.2125
Label Testing Output error
set set Root mean squared 0.3265 0.4104 0.3265
Normal 269 10 error
Root Relative 100% 125.68% 100%
Probe 114 220 squared error
Relative absolute 99.92% 79.39% 100%
DOS 550 550 error

U2R 21 0
5.4: Comparison of Results obtained by KNN,
R2L 46 220 UserClassifier, CVPS and NBMU Algorithms

The below table no. 6 and figure no. 1 enable us to analyze

Table 3: correctly classified instances given by knn the different algorithm results with better perception.
algorithm
Table 6: Result analysis of KNN, UserClassifier, NBMU,
Attacks Frequency and CVPS Algorithms

Normal 10 Parameter KNN UserClassifi NBMU CVP

er S
Probe 114 % of correctly 72.00 52.33 57.89 52.33
classified
instances
DOS 550
% of incorrectly 28.00 47.6641 42.105 47.66
classified 3 4
U2R 0
instances
Mean absolute 0.56 0.2123 0.1687 0.212
R2L 46
error 5
Root mean 0.330 0.3265 0.4104 0.326
Table 4: results of knn algorithm squared error 2 5
Root Relative 75% 100% 125.68 100%
Parameters Result %
squared error
Relative 66% 99.92% 79.39% 100%
% of correctly classified instances 72.00 absolute error
% of incorrectly classified instances 28.00
Fig 1: chart for comparison of various classifiers
Mean absolute error 0.56

Root mean squared error 0.3302

414
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
140 % of correctly
classified
120 instances
% of incorrectly
100 classified
80 instances
Mean absolute
60 error(in %)
40 Root mean
20 squared
error(in %)
0 Root Relative
squared
error(in %)
Relative
absolute
error(in %)
From the results of these experiments, K-Nearest Neighbor
algorithm proved to have better results of finding the 72 % of
correctly classified instances from the KDD dataset. While
having a % of correctly classified instances of 52.33 of
UserClassifier with the minimum error rate than CVPS
algorithm as shown in table 6 had the second best algorithm.
6. CONCLUSION
In this work, I compare the basic classification algorithms.
The goal of this study is to provide a comprehensive review of
different four techniques k-nearest neighbor, User Classifier,
NBMU, and CSPV Algorithms in data mining. In order to
compare these four algorithms based on the Correctly
classified instances, Relative absolute error, Relative squared
error, Mean absolute error, Mean squared error, Root mean
squared error parameters, we came to the conclusion which
algorithm is more efficient to use. The performance of the
each algorithm is tested on a KDD data set. After the
execution of each classification algorithm, I got the numbers
of correctly classified instances and the incorrectly classified
instances. This gave the accuracy of the algorithm. Other
important factors, Mean squared error, Root mean squared
error, Relative absolute error, Relative squared error, Mean
absolute error, and describes the error rate of an algorithm.
The overall evaluation show that K-nearest neighbor
algorithm is far better than User Classifier, NBMU, and
CSPV Algorithms. In future studies, we can enhance the
accuracy of the KNN algorithm to achieve better results than
the previous methodology that I have discussed.
7. ACKNOWLEDGMENT
I highly grateful to the Dr. Tanuja Srivastava, Director, Bhai
Gurdas Institute of Engineering & Technology (BGIET),
Sangrur, for providing this opportunity to carry out the present
thesis/work.The constant guidance and encouragement
received from Er. Amandeep Kaur, Head, Department of
Computer Science & Engineering, BGIET, Sangrur has been
of great help in carrying out the present work and is
415
ISBN: 978-81-924893-0-8
acknowledged with reverential thanks. I would like to express
a deep sense of gratitude and thanks profusely to Er Yogesh
Kumar, Asstt. Prof., Department of Computer Science &
Engineering, BGIET, who is the research work Supervisor.
Without the wise counsel and able guidance, it would have
been impossible to complete the research work in this manner.
The help rendered by Er Yogesh Kumar, AP, BGIET, for the
literature and their associates for experimentation is greatly
acknowledged. I express gratitude to other faculty members of
Department of Computer Science & Engineering, BGIET, for
their intellectual support throughout the course of this work.
Finally,I indebted to all whosoever have contributed in this
research work and friendly stay at BGIET.
REFERENCES
[1] A. L. S. Saabith, E. Sundararajan, and A. A. Bakar,
“Comparative study on different classification techniques for
breast cancer dataset,” 2014.
[2] O. Sutton, “Introduction to k nearest neighbour
classification and condensed nearest neighbour data
reduction,” 2012.
[3] T. N. Phyu, “Survey of classification techniques in data
mining,” in Proceedings of the International MultiConference
of Engineers and Computer Scientists, vol. 1, 2009, pp. 18–
20.
[4] D. L. A. AL-Nabi and S. S. Ahmed, “Survey on
classification algorithms for data mining:(comparison and
evaluation),” Computer Engineering and Intelligent Systems,
vol. 4, no. 8, pp. 18–24, 2013.
[5] S. D. Pandya and P. V. Virparia, “Comparing the
application of classification and association rule mining
techniques of data mining in an indian university to uncover
hidden patterns,” in Intelligent Systems and Signal Processing
(ISSP), 2013 International Conference on. IEEE, 2013, pp.
361–364.
[6] A. H. Wahbeh, Q. A. Al-Radaideh, M. N. Al-Kabi, and E.
M. Al- Shawakfa, “A comparison study between data mining
tools over some classification methods,” International Journal
of Advanced Computer Science and Applications, Special
Issue, pp. 18–26, 2011.
[7] K. Kumar, G. Kumar, and Y. Kumar, “Feature selection
approach for intrusion detection system.”
[8] W. Zheng and A. Tropsha, “Novel variable selection
quantitative structure-property relationship approach based on
the k-nearest-neighbor principle,” Journal of chemical
information and computer sciences, vol. 40, no. 1, pp. 185–
194, 2000.
[9] D. J. Krusienski, E. W. Sellers, F. Cabestaing, S. Bayoudh,
D. J. McFarland, T. M. Vaughan, and J. R. Wolpaw, “A
comparison of classification techniques for the p300 speller,”
Journal of neural engineering, vol. 3, no. 4, p. 299, 2006.
[10] N. Sebe, Machine learning in computer vision. Springer,
2005, vol. 29.
[11] J. Han and M. Kamber, Data Mining, Southeast Asia
Edition: Concepts and Techniques. Morgan kaufmann, 2006.
[12] P. Horton and K. Nakai, “Better prediction of protein
cellular localization sites with the it k nearest neighbors
classifier.” in Ismb, vol. 5, 1997, pp. 147–152.
[13] M. Hall, E. Frank, G. Holmes, B. Pfahringer, P.
Reutemann, and I. H. Witten, “The weka data mining
software: an update,” ACM SIGKDD explorations newsletter,
vol. 11, no. 1, pp. 10–18, 2009.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Simulative Investigation on VOIP over WiMAX
Communication Network
Ambica
BGIET,Sangrur
ambica.aggarwal14@gmail.com
ABSTRACT
The objective of this research paper is to provide brief
overview on simulative investigation on VOIP over WiMAX
communication network for static environment. The mobile
WiMAX (IEEE802.16e) support VOIP traffic under different
scenario, QOS, the system throughput, the packet delay,the
signaling overhead,various design choices and performance
analysis. This paper reports about the various VOIP
application in the IEEE802.16e including all traffic contract
were made correctly by considering overheads and
performance of voice in mobile environment.
Keywords: voice over internet protocol(VOIP),
IEEE802.16e , WiMAX
1. INTRODUCTION
WiMAX is the Next Generation of Wireless Broadband
based on IEEE 802.16 standard. It provides broadband
connectivity anywhere, anytime, for any device and on any
network and can connect to the internet in faster speed and
wider coverage. WiMAX is most suitable for home users,
individual, small office and home office etc. It erases the
suburban and rural blackout areas that currently have no
broadband Internet access.
Number of users and their location from the Base Station play
an important role in the network performance. Thus, in this
paper, the simulative investigation includes the variation in
the number of subscriber stations requesting for VoIP traffic
and the distance between the subscriber station and base
station.The focus of the paper is on the support of VoIP over
mobile
WiMAX (802.16e). Delay sensitive applications, such as
VoIP, pose significant challenges to the design of wireless
network infrastructures due to their stringent QoS
requirements and to the typical hostile radio environments; the
mobility of users is obviously an extra-dimension that adds to
the overall complexity, as it is more difficult to predict the
radio channel conditions, and hence to allocate resources
efficiently at high users speeds. VoIP applications are
characterized by tight air-interface delay budgets (usually in
the order of tens of ms) and a typical QoS target of less than
1%-2% packet loss for 95% - 98% of active VoIP users.
Another major challenge is posed by the amount of overhead
required to support many simultaneous VoIP connections,
which unless controlled in an efficient and intelligent manner,
may grow unacceptably large. In WiMAX, the overhead
includes the downlink map (DL-MAP) and the uplink map
416
ISBN: 978-81-924893-0-8
Avinash Jethi
BGIET,Sangrur
avinashjethi@gmail.com
(UL-MAP) overheads. DL-MAP is a Medium Access Control
(MAC) message that defines burst start times for a subscriber
station on the downlink. UL-MAP supports a set of
information that defines the entire access for a scheduling.
1.2 VOIP DESIGN CHOICES,
RESOURCES
ALLOCATION AND MODELING ASSUMPTIONS
he speech traffic is generated according to a two-state
Adaptive Multi-Rate (AMR) speech codec. Depending on the
air-interface delay budget, VoIP packet bundling can be
considered at the base station, i.e., when creating MAC PDUs.
This form of bundling offers the advantage of reducing
overhead at the expense of some additional delay given by
N*20 ms where N is the number of VoIP packets that are
bundled into a single packet. Bundling offers the benefit that a
single MAC header may be used for a bundled VoIP packet
containing payload from multiple VoIP packets; however, the
compressed header is still needed for each constituent packet.
Packet bundling also allows the MAP overhead to be reduced
since fewer bursts may need to be scheduled for transmission
over the air interface. Silence suppression is achieved through
blanking out the eight-rate speech frames, which in turn
facilitates statistical multiplexing of VoIP users and also plays
a significant role in reducing the interference levels. Each
VoIP packet/bundle is mapped to a physical Orthogonal
Frequency Division Multiple Access (OFDMA) burst and
corresponds to a MAC Protocol Data Unit (PDU). This allows
the Hybrid Automatic Request (HARQ) mechanism to operate
on a per-burst basis, since the Cyclic Redundancy Check
(CRC) is embedded in the MAC PDU. The MAC PDU
overhead is 8 bytes, resulting from 6 bytes MAC header
overhead and 2 bytes CRC for HARQ bursts. Robust header
compression (ROHC) is employed to reduce the original 40
bytes of Real Transport Protocol/User Datagram
Protocol/Internet Protocol (RTP/UDP/IP) overhead to 3 bytes
only. Partially Used Sub-channelization (PUSC) based on
distributed sub-carriers allocation to sub-channels is
employed. To support the uplink traffic, control slots are
allocated for ranging, channel quality indication and downlink
HARQ acknowledgments, as part of the uplink sub- frame.
OFDMA symbols were considered sufficient to carry out the
uplink overhead in the context of an Extended Real Time
Polling Service (eRTPS) like VoIP [1-2]. In the downlink sub-
frame, control slots are allocated for overhead including
preamble (1 symbol), Frame Control Header (4 OFDMA
slots) and MAP messages. MAP messages constitute the
majority of the overhead and are used for allocating resources
to VoIP packets (i.e. number of sub-channels and symbols,
and their respective allocation offsets). Combining packets
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
bundling and silence suppression features may offer desirable
benefits in terms of reducing the total overhead.
It is necessary to ensure that MAP messages are reliably
received by a very large fraction of users since VoIP packets
cannot be successfully decoded without first decoding the
MAP messages. MAP messages require the use of QPSK Rate
1⁄2 encoding; however, the reliability may be further
improved through slot repetition factors of 2, 4 or 6 –
however, the higher the repetition factor, the larger the
overhead grows. In order to avoid having to send MAP
messages to all users with repetition factors of 4 or 6 at QPSK
Rate 1⁄2, telescopic MAP usage is employed as a way of
reducing MAP overhead. With the telescopic MAP approach,
DL/UL-MAP messages in the frame are broken up into one or
more sub-MAPs (overhead portion of the downlink sub-
frame), and instead of transmitting the whole MAP at one low
data rate (e.g. QPSK Rate 1⁄2 with repetition factor of 4), only
the compressed MAP is transmitted with repetition factors and
the sub-MAPs are transmitted at higher data rates (QPSK Rate
1⁄2 or higher). For this VoIP analysis, we assume the
transmission of a single compressed DL/UL-MAP message
that is sent using QPSK Rate 1⁄2 with a repetition factor of 4
followed by a sub- DL-UL-MAP message that is sent using
QPSK Rate 1⁄2. The compressed DL/UL-MAP carries
information elements for resource allocation to about a quarter
of the users while the sub-DL-UL-MAP is used to allocate
resources to the rest of the users. MAP messages are
constructed such that the messages may be reliably received
by a large fraction of the mobile station.
2. VOICE TRAFFIC MODEL OF USERS
An exponentially distributed on-off model is used to charac-
terize traffic from a single voice source, where the mean on-
time is α −1 = 1 s and the mean off-time is β −1 = 1.5 s . The
extended real-time polling service (ertPS) is assumed to be
used for the uplink scheduling, where the BS allocates a fixed
amount of bandwidth at periodic intervals during the on state.
The user informs the BS of its transition between the on state
and the off state by either using a piggyback request field or
sending a codeword over a channel quality indicator channel
(CQICH) . The codeword minimizes the signaling overheads
and prevents delays in the scheduling of uplink requests and
grants. Hence, for the sake of simplicity, this paper ignores
the uplink request and grant procedure.Each user is assumed
to generate VoIP traffic every p frames in the on state, where
the size of a VoIP protocol data unit is fixed and the size is
denoted by L. For example, the G.723.1 codec generates a 24
byte encoded voice frame every 20 ms Assuming the size of a
VoIP packet is fixed, a BS can calcu- late the number of
packets to be transmitted in the uplink from the amount of
requested bandwidth or the amount of allocated bandwidth.
However, the use of the variable rate codec such as the
adaptive multi-rate (AMR) codec makes it difficult to count
the number of packets from the bandwidth request. The case
of variable-rate VoIP codecs can be studied in future works.
This paper assumes that a VoIP packet has a fixed size The
VoIP traffic requested from N v users is aggregated in the
initial transmission queue at the BS. The operation of the ini-
tial transmission queue can be modeled as a two-state
Markov- modulated Poisson process (MMPP) with the
transition rate ma- trix, R, and Poisson arrival rate matrix, Λ .
417
ISBN: 978-81-924893-0-8
3. PERFORMANCE ANALYSIS
No error in the transmission of the signaling message is
assumed because the signaling message is transmitted with a
low MCS level. In the CC-based HARQ transmissions, the
probability of successful decoding for a VoIP packet
transmitted with MCS level i at the kth transmission is given
by
P i (k|γ) = (1 − PER i (kγ)) $ PER i (nγ)
where PER i (γ) is the associated PER of MCS level i at SNR
γ. The probability of a VoIP packet being transmitted at the
kth transmission after k − 1 failures is given by
Q i (k|γ) = $ PER i (nγ)
Let α i be defined as the probability of a packet modulated
with MCS level i being successfully transmitted in N max
transmissions. The value of α i can be expressed as the sum of
the probabilities of successful decoding at the kt transmission.
Thus,
α i ={P i(k|γ)f γ/ P γ (i)dγ}
= 1/P γ (i)P i (k|γ)f γ (γ)dγ ≤ 1
where the denominator, P γ (i), is a normalized factor. Then,
out of x i packets initially transmitted with MCS level i, the
total number of packets successfully transmitted in N max is
ui=αixi.
4. QUALITY OF SERVICE (QoS) IN IEEE
802.16e
Originally, four different service types were supported inthe
802.16 standard: UGS, rtPS, nrtPS and BE.The UGS
(unsolicated grant service) is similar to the CBR(constant bit
rate) service in ATM which generates a fixed size burst
periodically .this service can be used to replace T1/E1 wired
line or a constant rate services.it can also be used to support
real time applications such as Voip or streaming applications.
Even though the UGS is simple ,it may not be the best choice
for the VoIP in that it can waste bandwidth during the off
period of voice calls.
The rtPS( real time polling service) is for a variable bit rate
real time service such as VoIP. Every polling interval ,BS
polls a mobile and the polled mobile transmit bw request
(bandwidth request) if it has datato transmit. The BS grants
the data burst using UL-MAP-IE upon its reaction.The nrtPS
(non-real-time polling service) is very similar to the rtPS
except that it allows contention based polling.
The BE (Best Effort) service can be used for applications such
as e-mail or FTP, in which there is no strict latency
requirement. The allocation mechanism is contention based
using the ranging channel. Another service type called ertPS
(Extended rtPS) was introduced to support variable rate real-
time services such as VoIP and video streaming. It has an
advantage over UGS and rtPS for VoIP applications because
it carries lower overhead than UGS and rtPS.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5. PACKET DELAY ANALYSIS
The average packet delay, which is the sum of the average
waiting time in the queue, W q , and the average transmission
time in the air, T tr , can be expressed as follows
D = W q + T tr .
The queue waiting time includes the waiting time in the initial
transmission queue and the waiting time in the retransmission
queue. However, the waiting time in the retransmission queue
can be neglected because the BS schedules users firstly from
the retransmission queue and then from the initial
transmission queue. The average length of the initial
transmission queue is given by
Lq= kπ(k).
The average waiting time in the initial transmission queue can
be expressed in terms of Little’s theorem. Thus,
W q = Lq/ λ e
where λ e , which is the effective packet arrival rate at the ini-
tial transmission queue during the frame, is equal to the
average number of scheduled packets: That is,
λ e = x.
When a packet is successfully transmitted at the kth trans-
mission, the total transmission time is given
TR(k) = (k − 1)RTT + T f .
5.1Packet delay analysis in a virtually
dedicated resource allocation region
A. System Model
Although there may exist several VDRA regions in a system,
we first analyze a single VDRA region case, because one
VDRA region can be independent of the other regions. The
DL packet transmission model consists of the following five
components:
1) L buffers for storing the arriving packets for the corre-
sponding L users;
2) a VDRA module that performs the operation mentioned in
Section III at each frame;
3) N ru resource units for packet transmissions;
4) L receivers, which decode the received packets, check
whether an error occurs, and generate ACK/negative ac-
knowledge (NACK) signals for retransmission;
5) a delay element (DE), which stores ACK/NACK signals
generated at the receiver and feeds them back to the
transmitter. This overall packet transmission model can be
simplified as a model for a single user as shown in Fig. 5(b),
where a packet is served with a probability of μ(L) in a frame.
μ(L) is affected by the buffer empty probability of all the
buffers in the VDRA region because of resource collisions.
The VDRA region has the following parameters.
418
ISBN: 978-81-924893-0-8
1) M : the MCS level supported by the VDRA region;
2) S ru : the size of the resource unit;
3) B ru : the number of bits which can be transmitted in one
resource unit. This value depends on the M and S ru ;
4) N ru : the number of resource units in the VDRA region;
5) L: the number of users accommodated in the VDRA
region;
6) λ: the packet arrival probability in a frame time. We
assume that packet arrivals follow a Bernoulli process with a
packet arrival probability of λ in a frame time T ;
7) α: the probability that the transmitted packet is negatively
acknowledged (NACK) because of a transmission error;
8) D r : time duration (in frame times) that ACK/NACK
signal for a transmitted packet is fed back to the BS;
9) U l (F N ): the resource unit number generated by the PHP
In addition, we will derive the following analytical results.
1) P S (N D , N R |m): the probability that N D and N R users
transmit packets using the predetermined and redirected
resource units, respectively, when m buffers have pending
packets to transmit;
2) μ m : the probability that a packet is transmitted to a
specific user, regardless of the use of predetermined or
redirected resource unit, where m buffers have pending
packets;
3) μ(L): the probability that a packet is transmitted to a
specific user in a frame when L users are accommodated in
the VDRA region;
4) E[N D ]: the mean number of predetermined resource units
used in the VDRA region;
5) E[N R ]: the mean number of redirected resource units used
in the VDRA region;
6) φ 0 (L): the probability that a buffer is empty when L users
are accommodated in the VDRA region;
7) P: the state transition probability matrix for the number of
packets in a buffer;
8) Π: the steady-state probability for the number of packets in
a buffer;
9) P d (D|L): the probability that packet delay is D frame
times when L users are accommodated in the VDRA region.
6. SIGNALLING SCHEMES OF BS
6.1Conventional Allocation
In conventional mobile WiMAX systems, the characteristic
that the BS broadcasts a signaling message for every frame
generates a substantial overhead for every frame. Hence, the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

size of the signaling overhead is directly proportional to the Carrier Frequency 2.5 GHz
number of scheduled users.
Number of VoIP Variable, subject to capacity
6.2 Persistent Allocation sources/users per sector
simulated
Persistent allocation is a technique used to reduce the
signaling overhead for connections, e.g., VoIP services, that VoIP Capacity Criteria 8% of users satisfied. Users
have a periodic traffic pattern and a relatively fixed payload with less than 2% packet loss
size .A high-level concept of a persistent mapping scheme and are declared satisfied
a conventional mapping scheme. In the persistent allocation
scheme, the BS allocates a persistent resource to a user at Reference VoIP Traffic AMR 12.2 kbps; AMR 7.95
frame t and the allocated resource is valid in a periodic Source kbps
sequence of future frames, namely, frame t + p, frame t + 2p,
without notification of a signaling message. However, if the Transmission Method MIMO, STC (2x2, DL)
optimized modulation and coding scheme (MCS) level at the
current frame is different from the latest MCSlevel indicated Maximum number of HARQ 4
by the BS, the BS may transmit a signaling message in order transmissions (1 st trans +
to adjust the attributes of a persistently allocated resource retransof same packet)
because the MCS mismatch causes a link adaptation error.
MAC Header 48 bits
7. THROUGHPUT ANALYSIS
Total Packet Overhead 88 bits
A discrete-time MMPP can be equivalent to an MMPP in
continuous time. The system state is defined as the number of
packets in the initial transmission queue. The arrival and
service process of the initial transmission queue is depicted . The following performance metrics are used for evaluating the
VoIP users in this paper:
The average packet arrival rate at the initial transmission
queue during the frame is expressed as follows VoIP Packet Loss: it captures packet losses at the receiver
due to residual post-HARQ errors (after a total of maximum
ρ = s(k Dk) allowed number of transmissions) or due to the discarding of
packets that have exhausted their delay budgets
where 1 is a column matrix of ones. The matrix s = [s 1 s 2 ] is at the transmitter.
obtained by solving sU = s and s 1 + s 2 = 1, where U, which
is the phase transition probability matrix in the MMPP, is VoIP Packets Transmmission Statistics: it captures the
expressed as U = (Λ − R) −1 Λ. Additionally, D k is the percentage of packet transmissions across succesive
diagonal probability matrix in which each diagonal element is retransmission attempts along with the average number of
the probability of k packets arriving at the BS for the frame, transmissions per packet. These characteristics are driven by
retransmission attempts along with the transmissions per the H-ARQ mechanisms.
packet.

(λ i T f ) k e −λ i T f /k! for i = 1, 2. 9. CONCLUSION

In this paper, we covered performance analysis,voice traffic
8. RESULTS model of users, QoS, packet delay analysis which includes the
different procedures set for all the system simulation . We
Table 1 :system simulations assumptions and paramters: verified the analytical results by comparing them with
simulation result.
Parameter Assumption

Network Topology 19 cloverleaf cells with three REFERENCES

[1]. Jaewoo So:JOURNAL OF COMMUNICATIONS AND
sectors with wrap-around
NETWORKS, VOL. 14, NO. 5, OCTOBER 2012.
enabled
[2]. M.-H. Fong, R. Novak, S. McBeath, and R. Srinivasan,
“Improved VoIP capacity in mobile WiMAX systems
Duplexing Scheme TDD
using persistent resource allocation,” IEEE Commun.
Mag., pp. 50–57, Oct. 2008.
Bandwidth 10 MHz
[3]. Young Ik Seo, Member, IEEE, and Dan Keun Sung,
Senior Member, IEEE,2011
FFT size 1024
[4]. Doru Calin Bell Laboratories, Alcatel-Lucent,VoIP over
ISD (Inter-Site Distance) 500 m (ITU Ped. B 3Km/h); Realistic IEEE 802.16e System Scenarios: The Uplink
1500m (ITU Veh.A 60Km/h) Direction 2011.
[5]. D. Calin, “VoIP over Realistic IEEE 802.16e System
Propagation Formula 128.1 + 37.6*log10(d) dB, d Scenarios: The Uplink Direction”, in Proc. of IEEE
inKm, for 2GHz Globecom 2012, pp. 3384 – 3388, Anaheim, December
2012.

419
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[6]. Doru Calin Bell Laboratories, Alcatel-Lucent, Design

and Analysis of a VoIP Based IEEE 802.16e System,
2013.
[7]. S. Alshomrani, S. Qamar, S. Jan, I. Khan and I. A.
Shah,QoS of VoIP over WiMAX Access Networks,april
2012.
[8]. João Henriques, Vitor Bernardo, Paulo Simões, Marilia
Curado Center for Informatics and Systems,VoIP
performance over Mobile WiMAX: An Urban
Deployment Analysis,2012.

420
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Swarm Intelligence (SI)-Paradigm of Artificial Intelligence (AI)
Pooja
BGIET, Sangrur
Punjab, India
poojamarken16@gmail.com
ABSTRACT
This paper gives you the overview of the subfield of artificial
intelligence which is called as “SWARM INTELLIGENCE”.
This is so called because it is named after the inspiration taken
from the working behavior of the swarms. The term “swarm”
denotes the group or aggregation of insects or animals or birds
which works together so as to complete the difficult tasks in an
efficient manner which are not possible to be completed as an
individual entity. This working behavior of swarms has
influenced the researchers to solve their problems in robotics,
telecommunications, computer science, networking and various
other technical fields. Apart from it, algorithms have been
proposed to solve various complex problems which are having
resemblance to swarm intelligence, in their working behavior. In
this paper, a brief description of the working of these algorithms
is given.
KEYWORDS
Swarm, swarm intelligence, stigmergy, pheromone, paradigm
1. INTRODUCTION
Since it is described that, problem solution which is inspired by
the collective behavior of swarms is defined as swarm
intelligence [1]. Thus, such an intelligent and autonomous
systems are required that are able to solve complex tasks with
self-organizing nodes that are not having central control (means
distributed approach).
Swarms are broadly categorized into:
1. Ants
2. Honey bees
3. Termites
4. Particle
1.1 ANT SWARMS
Ants as individuals are not smart or intelligent enough to do
their daily tasks of finding food source or finding shortest path
to that location if source is found, dividing their work into short
tasks and assigning these tasks to multiple ants so as to complete
a task as a whole. Foraging is one of the examples that can
describe the behavior of ants, and their working as colony. In the
foraging process,
a) Ants are free to move in any direction in search of
their food location.
b) Once they found a destination, they come back to their
actual starting position by leaving a chemical
substance which is volatile and attractive in nature and
is called as pheromone.
c) For coming back to actual location, an ant may follow
any direct or indirect path.
d) All other colony members will follow the same path
where they found pheromone.
421
ISBN: 978-81-924893-0-8
Renu Nagpal
BGIET, Sangrur
Punjab, India
er.renunagpal@gmail.com
e) Now, in order to move through the shortest path, path
that will constitute more number of ants to follow the
same path in same interval of time will be the shortest
path.
f) And for this shortest path obviously the concentration
of the pheromone will be more as more number of ants
will follow the same route leaving the chemical
substance behind them.
g) As the concentration of that route will increase since
more number of ants will follow it, thus the path that
is comparatively longer will soon disappear. This is
because of the volatile nature of the pheromone and of
least concentration of the substance over that path.
1.2 HONEY BEE SWARMS
Honey bees are one another swarms’ type that seems very
helpful in solving the complex tasks by their working manner in
an efficient, effective and intelligent way. They have tendency
to do typical tasks by dividing them into smaller tasks. Their
daily tasks involves forging, storing, retrieving and distributing
honey and pollens , communication and most precisely their
ability of adaptation for the change in the environment. Several
algorithms have been designed which work in the same manner
as that of the working behavior of the honey bees. The concept
of forging in honey bees can be explained as:
In the hive there are two types of bees named as:
i) worker bees(scouts), and
ii) forager bees
The tasks that are to be performed by the worker bees are
maintenance and management activities like collecting and
storing food, removing the dead bees from the hive, keeping
proper ventilation and guarding the hive etc. the foraging
process involves:
a) First of all, the scout bees are sent to various
directions randomly so as to find the food source.
b) Scouts move from one flower patch to another so as to
find promising food source that may have the quality rated
above the pre-defined quality threshold deposit their nectar
or pollen.
c) After finding this, the scout bees move to the dance
floor to perform a kind of dance so as to indicate the type
of quality food detected to other bees.
d) This kind of dance that scout bees perform on the dance
floor for communication to other bees is known as waggle
dance.
e) This dance basically helps the other bees to know the
direction of patch, distance of patch, and quality rating.
f) After getting this information, forager bees are sent to
that patch.
g) Higher the quality of food at the patch, more will be the
number of bees at that patch.
Thus, in this way bee colony is able to get good quality of food
effectively and efficiently.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
1.3 PARTICLE SWARMS
In particle swarm method, the way by which the researchers got
influenced is the working criteria of the birds and their ability to
find their food. The foraging process in particle swarm can be
described as:
a) It is supposed that the flock of birds is searching for
food in some particular area.
b) And there is only a single piece of food in that area.
c) Now, to get the exact location where the food actually
laying, each bird will flew in the direction in which
the bird nearest to the food is flying.
d) An algorithm is being designed in such a way that
locally and globally best positions of the birds are
being calculated. And velocity after each iteration is
modified.
In this way, the bird swarms (particle swarms) are helpful in
order to find solution to the complex problems.
1.4 TERMITE SWARMS
Termites are known for building hills by using pebbles. And the
way they collect the pebbles, the way they do it effectively by
using shortest path method by the use of pheromone substance
has major influence on the researchers to use an algorithm based
on this intelligence. The process is as described:
a) Each termite moves on the way where it finds the
pheromone substance in order to collect the pebbles.
b) But if no pheromone is detected by the termite then, it
will follow a random path so as to search a pebble by
its own.
c) During the way to search a pebble, if it caught any
pebble it will took it up.
d) A termite can carry on one pebble at a time.
e) And during its path again if it found any other pebble,
then it will drop the already carrying pebble at that
new location and infuse that pebble with pheromone
so that other termite can detect it easily.
f) And this pebble will act as the building site of the hill
of pebbles. That means all other termites will get a
location to drop their own pebbles at that location so
as to build a hill there.
2. APPLICATIONS
towards it so that the ants of the swarm might follow the same
path only. This all process of communication via the use of
chemical substance is termed as trail-laying and trail-following.
The algorithm based on this concept, uses a technique of
positive feedback in which the concentration of the pheromone
goes on increasing with the number of ants passing through the
same route and the path that have lesser number of ants or least
concentration of pheromone will disappear soon.
3.3 Bacterial Foraging Optimization
Bacterial Foraging Optimization algorithm is a kind of
evolutionary computation algorithm. It is based on the foraging
behavior of Escherichia Coli (E. coli) bacteria that resides in
human intestine. This method is used for locating, handling and
ingesting the food in the intestine. During its foraging phase, it
can exhibit two different states: tumbling or swimming. The
modification in the orientation of the bacterium is due to the fact
of tumbling action possessed by the bacterium. And the
swimming action is responsible for the movement of the
bacterium in the current direction. After a certain number of
complete swims, the best half of the population undergoes the
422
ISBN: 978-81-924893-0-8
Since there are many algorithms that can completely fit into the
working of various areas of working of several technical fields.
Thus according to those several principles of working, we are
having with applications in which Swarm Intelligence is useful.
Some of the fields are as follows, Robotics, data Mining,
Communication networks, Fuzzy Systems, Military
Applications, Traffic Patterns and many more resembling fields
that can have their solution with the help of this Swarm
Intelligence.
3. ALGORITHMS
Algorithm is a kind of procedure or formula that is to be
followed step by step so as to calculate or process a particular
problem.
Various algorithms were designed that have their working
similar to the working behavior of the above given swarm types.
Few of the algorithms are listed below as:
a) PSO( Particle Swarm Optimization)
b) ACO(Ant Colony Optimization)
c) BFO(Bacterial Foraging Optimization)
d) PPSO(Perceptive Particle Swarm Optimization)
3.1 Particle Swarm Optimization
Particle Swarm Optimization (PSO) [1] was inspired by the
behavior of the birds that fly around and search space, for the
best location. Each particle either directly or indirectly
communicates with the one another for the directions. Each
particle moves through the multi-dimensional space sampling an
objective function at various positions. Best solution is extracted
out and is plotted.
And is seeded with an initial velocity. The velocity of the
particle is continuously updated so that it may experience the
best position of itself or best position that is experienced by its
neighbor in the swarm. The performance of the particle can be
evaluated with the help of fitness function. The technique might
have the problem of adjusting the parameters but is easy to
implement.
3.2 Ant Colony Optimization
As it is explained in the 1.1 section of this paper, that ants used
to communicate through the use of chemical
reproduction and eliminating the rest of the population. In order
to escape local optima, an elimination- dispersion event is
carried out where some bacteria are liquidated at random with a
very small probability and the new replacements are initialized
at random locations of the search space.
3.4 Perceptive Particle Swarm Optimization
Conventional particle swarm optimization relies on exchanging
information through social interaction among individuals.
However for real-world problems involving control of physical
agents (i.e., robot control), such detailed social interaction is not
always possible. Recently, the perceptive particle swarm
optimization (PPSO) algorithm was proposed to mimic
behaviors of social animals more closely through both social
interaction and environmental interaction for applications such
as robot control. In this study, we investigate the PPSO
algorithm on complex function optimization problems and its
ability to cope with noisy environments.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
4. CONCLUSION
In this paper, I have discussed several types of swarms that can
influence the working behavior of researchers. Nature has
inspired problem solving techniques have been found to be an
intelligent and efficient way for this. Apart from it, this paper is
giving a reference to few of the commonly known algorithms of
swarm intelligence. The working steps of these algorithms are
mentioned that how the ants as a collective team behave
efficiently in order to process complex tasks that are not possible
to be carried out as an individual. Swarm intelligence has also
been used for minimizing functions and for training in neural
networks efficiently. Swarm intelligence is used in various other
areas like in digital circuits, data mining and
telecommunications.
REFERENCES
[1] Dr. Ajay Jangra, Adima Awasthi, Vandhana Bhatia, “A
Study on Swarm Artificial Intelligence” volume 3 , issue 8,
August 2013.
[2] Riya Marry Thomas, “Survey of Bacterial Foraging
Opmization Algorithm” International Journal of science and
modern engineering( IJISME), ISSN: 2319-6386, Volume-1,
Issue-4, March 2013.
[3]ALEKSANDAR JEVTIC , DIEGO ANDINA, “ Swarm
Intelligence and Its Applications in Swarm Robotics” ,6th
WSEAS Int. Conference on Computational Intelligence, Man-
Machine Systems and Cybernetics , Tenerife , Spain , December
14-16, 2007.
423
ISBN: 978-81-924893-0-8
[4]Gainni Di Caro, Frederick Ducatelle and Luca Maria
Gambardella,”SWARM INTELLIGENCE FOR ROUTING IN
MOBILE AD HOC NETWORKS” , Instituto Dalle Molle di
Studi sull’Intelligenza Artificiale(IDSIA) Galleria2, CH-6928
Manno-Lugano, Switzerland.
[5] Xiaohui Hu, Yuhui Shi , Russ Eberhart ,”Recent Advances
in Particle Swarm”.
[6] I. Kassabalidis*, M.A. El-Sharkawi* ,R.J.Marks II*, P.
Arabshahi, A.A. Gray, “Swarm Inteeligence for Routing in
Communication Networks”, dept. of Electrical Eng. Box
352500, University of Washington Seattle, WA98195 USA.
[7] Payman Arabshahi, Andrew Gray,Ioannis Kassabalidis,
Arindham Das, “Adaptive Routing in Wireless Communication
Networks using Swarm Intelligence”.
[8]Dervis KARABOGA , “AN IDEA BASED ON HONEY
BEE SWARM FOR NUMERICAL OPTIMIZATION” ,
Technical Report-TR06, OCTOBER-2005.
[9]Rajani Muraleedharan and Lisa Ann Osadciw, “Sensor
Communication Network using Swarm Intelligence”,
Department of electrical engineering and computer science.
[10]Rajeshwar Singh*, D.K. Singh* and Lalan Kumar, “Swarm
intelligence based for routing in Mobile Ad-Hoc networks”,
Department of electronic and communictions engineering,
BRCM college of engineering and technology.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Hierarchical Nepali Base Phrase Chunking
Using HMM With Error Pruning
Arindam Dey Abhijit Paul
Department of Computer Science Department of Computer Science
Assam University Silchar, India Assam University Silchar, India
4uarin@gmail.com abhijitpaul16@gmail.com
Abstract
Segmentation of a text into non-overlapping syntactic units
(chunks) has become an essential component of many
applications of natural language processing. This paper
presents Nepali base phrase chunker that groups
syntactically correlated words at different levels using
HMM. Rules are used to correct chunk phrases incorrectly
chunked by the HMM. For the identification of the
boundary of the phrases IOB2 chunk specification is
selected and used in this work. To test the performance of
the system, corpus was collected from Amharic news outlets
and books. The training and testing datasets were prepared
using the 10-fold cross validation technique. Test results on
the corpus showed an average accuracy of 85.31% before
applying the rule for error correction and an average
accuracy of 93.75% after applying rules.
Keywords
Nepali Language Processing, Base Phrase Chunking,
Partial Parsing
1. INTRODUCTION
Chunking is a natural language processing (NLP) task that
focuses on dividing a text into syntactically correlated non-
overlapping and non-exhaustive groups of words, i.e., a
word can only be a member of one chunk and not all
words are in chunks (Tjong et al, 2000). Chunking is
widely used as an intermediate step to parsing with the
purpose of improving the performance of the parser. It also
helps to identify non-overlapping phrases from a stream of
data, which are further used for the development of
different NLP applications such as information retrieval,
information extraction, named entity recognition, question
answering, text mining, text summarization, etc. These
NLP tasks consist of recognizing some type of structure
which represents linguistic elements of the analysis and
their relations. In text chunking the main problem is to
divide text into syntactically related non-overlapping
groups of words (chunks).
The main goal of chunking is to divide a text into segments
which correspond to certain syntactic units such as noun
424
ISBN: 978-81-924893-0-8
Bipul Syam Prukayastha
Department of Computer Science
Assam University Silchar, India
bipul_sh@hotmail.com
phrases, verb phrases, prepositional phrases, etc. Abney
(1991) introduced the concept of chunk as an intermediate
step providing input to further full parsing stages. Thus,
chunking can be seen as the basic task in full parsing.
Although the detailed information from a full parse is lost,
chunking is a valuable process in its own right when the
entire grammatical structure produced by a full parse is not
required. For example, various studies indicate that the
information obtained by chunking or partial parsing is
sufficient for information retrieval systems rather than full
parsing (Yangarber and Grishman,1998). Partial
syntactical information can also help to solve many NLP
tasks, such as text summarization, machine translation and
spoken language understanding (Molina and Pla, 2002).
For example, Kutlu (2010) stated that finding noun phrases
and verb phrases is enough for information retrieval
systems. Phrases that give us information about agents,
times, places, objects, etc. are more significant than the
complete configurational syntactic analyses of a sentence
for question-answering, information extraction, text
mining and automatic summarization.
Chunkers do not necessarily assign every word in the
sentence like full parses to a higher-level constituent. They
identify simple phrases but do not require that the sentence
be represented by a single structure. By contrast full
parsers attempt to discover a single structure which
incorporates every word in the sentence. Abney (1995)
proposed to divide sentences into labeled, nonoverlapping
sequences of words based on superficial analysis and local
information. In general, many of NLP applications often
require syntactic analysis at various NLP levels including
full parsing and chunking. The chunking level identifies all
possible phrases and the full parsing analyzes the phrase
structure of a sentence. The choice of which syntactic
analysis level should be used depends on the specific speed
or accuracy of an application. The chunking level is
efficient and fast in terms of processing than full parsing
(Thao et al., 2009).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Chunkers can identify syntactic chunks at different levels
of the parser, so a group of chunkers can build a complete
parser (Abney, 1995). Most of the parsers developed for
languages like English and German use chunkers as
components. Brants (1999) used a cascade of Markov
model chunkers for obtaining parsing results for the
German NEGRA corpus. Today, there are a lot of
chunking systems developed for various languages such as
Turkish (Kutlu, 2010), Vietnamese (Thao et al., 2009),
Chinese (Xu et al, 2006), Urdu (Ali and Hussain, 2010),
etc. Although Nepali is the working language of Nepal and
spoken some of India with a population of about 2 million
at present, it is still one of less-resourced languages with
few linguistic tools available for Nepali text processing.
This work is aimed at developing Nepali base phrase
chunker that generates base phrases. The remaining part of
this paper is organized as follows. Section 2 presents
Nepali language with emphasis to its phrase structure.
Nepali base phrase chunking along with error pruning is
discussed in Section 3. In Section 4, we present
experimental results. Conclusion and future works are
highlighted in Section 5. References are provided at the
end.
2. LINGUISTIC STRUCTURES OF
NEPALI
Nepali or Nepalese (नेऩारी), is a language in the Indo-
Aryan languages. It is the official language and de facto
lingua franca of Nepal and is also spoken in Bhutan.
Nepali has official language status in the formerly
independent state of Sikkim and in West Bengal's
Darjeeling district as well as Assam. Nepali developed in
proximity to a number of Indo-Aryan languages, most
notably Pahari and Magahi, and shows Sanskrit influences.
However, owing to Nepal's geographical area, the
language has also been influenced by Tibeto-Burman.
Nepali is mainly differentiated from Central Pahari, both in
grammar and vocabulary, by Tibeto-Burman idioms owing
to close contact with the respective language group. Nepali
language shares 40% lexical similarity with Bengali
language.
Historically, the language was first called the Khas
language (Khas kurā), then Gorkhali or Gurkhali (language
of the Gorkha Kingdom) before the term Nepali (Nepālī
bhāṣā) was taken from Nepal Bhasa. Other names include
Parbatiya ("mountain language", identified with the
Parbatiya people of Nepal) and Lhotshammikha (the
"southern language" of the Lhotshampa people of Bhutan).
Examles
Nepali Vowels:
अ आ इ ई उ ऊ ए ऐ ओ औ अॊ अः
Nepali Consonant:
कखगघङचछजझञटठडढणतथदधनऩपफबभ
म य र ऱ ल ळ ऴ व श ज़ ॐ ड़ ढ़ फ़ क ष त्र स श्र.
The above are the characters for Nepali used for writing.
The script is devanagari.
425
ISBN: 978-81-924893-0-8
2.1 Phrasal Categories
Phrases are syntactic structures that consist of one or more
words but lack the subject-predicate organization of a
clause. These phrases are composed of either only head
word or other words or phrases with the head combination.
The other words or phrases that are combined with the
head in phrase construction can be specifiers, modifiers
and complements. Yimam (2000) classified Amharic word
classes into five types, i.e. nouns, verbs, adverbs,
adjectives and prepositions. In line with this classification,
Yimam (2000) and Amare (2010) classified phrase
structures of the Nepali language as: noun phrases, verb
phrases, adjectival phrases, adverbial phrases and
prepositional phrases.
Noun Phrase: An Nepali noun phrase (NP) is a phrase that
has a noun as its head. In this phrase construction, the head
of the phrase is always found at the end of the phrase. This
type of phrase can be made from a single noun or
combination of noun with either other word classes
including noun word class. Example: “बफचायी वुबद्रा”
meaning “poor subhadra”.
NOUN PHRASE (NP->JJ NNP)
बफचायी वुबद्रा
POS JJ NNP
CHUNK NP(noun phrase)
Verb Phrase: Nepali verb phrase (VP) is constructed with
a verb as a head, which is found at the end of the phrase,
and other constituents such as complements, modifiers and
specifiers. But not all the verbs take the same category of
complement. Based on this, verbs can be dividing into two.
These are transitive and intransitive. Transitive verbs take
transitive noun phrases as their complement and
intransitive verbs do not. Examples are: “भ बात खान्छु”
meaning “I eat rice”.
VERB PHRASE(VP->PRP NN VM)
भ बात खान्छु
POS PRP NN VM
CHUNK VP(verb phrase)
Adjectival Phrase: An Nepali Adjectival phrase (AdjP) is
constructed with an adjective as a head word and other
constituents such as complements, modifiers and
specifiers. The head word is placed at the end. Examples
are:
“फशुत ऩततऩयामणा” meaning “very loyal(to husband”.
ADJECTIVAL PHRASE (AdjP->QTF JJ)
फशुत ऩततऩयामणा
POS QTF JJ
CHUNK AdjP(adjective phrase)
Adverbial Phrases: Nepali adverbial phrases (AdvP) are
made up of one adverb as head word and one or more
other lexical categories including adverbs themselves as
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8
modifiers. The head of the AdvP is placed at the end. formats are complete chunk representations which can
Unlike other phrases, AdvPs do not take complements. identify the beginning and ending of phrases while the last
Most of the time, the modifiers of AdvPs are PPs that three are partial chunk representations. All boundary types
come always before adverbs. Examples are: “एक एक गयी use “I” tag for words that are inside a phrase and an “O”
शे ये” meaning “He examined one by one”. tag for words that are outside a phrase. They differ in their
treatment of chunk-initial and chunk-final words.
ADVERBIAL PHRASES (AdvP->QTC JJ PRP)
IOB1: the first word inside a phrase immediately following
एक एक गयी शे ये another phrase receives a B tag.
POS QTC JJ PRP IOB2: all phrase- initial words receive a B tag.
CHUNK AdvP (adverb phrase)
IOE1: the final word inside a phrase immediately
preceding another same phrase receives an E tag.
2.2 Sentence Formation IOE2: all phrase- final words receive an E tag.

Nepali language follows subject-object-verb grammatical IO: words inside a phrase receive an I tag, others receive
pattern unlike, for example, English language which has an O tag.
subject-verb-object sequence of words (Yimam, 2000;
Amare, 2010). For instance, the Nepali equivalent of the “[”: all phrase-initial words receive “[” tag, other words
sentence “We never sang a song” is written as “शाभीरे receive “.” tag.
कहशरेऩतन गीत गाएनाॉ”.
“]”: all phrase-final words receive “]” tag and other words
receive “.” tag.
Nepali sentences can be constructed from simple or
complex NP and simple or complex VP. Simple sentences In this work, we considered six different kinds of chunks,
are constructed from simple NP followed by simple VP namely noun phrase (NP), verb phrase (VP), Adjective
which contains only a single verb. The following examples phrase (AdjP), Adverb phrase (AdvP) and sentence (S). To
show the various structures of simple sentences. identify the chunks, it is necessary to find the positions
where a chunk can end and a new chunk can begin. The
 पऩटय कहशरेऩतन झगडा गदै न part-of-speech (POS) tag assigned to every token is used to
Peter never quarrels. discover these positions. We used the IOB2 tag set to
identify the boundaries of each chunk in sentences
एक ककरोको कतत ऩछ
extracted from chunk tagged text. Using the IOB2 tag set

along with the chunk types considered, a total of 13 phrase
How much does a kilo cost? tags were used in this work. These are: B-NP, I-NP, B-VP,
I-VP, B-ADJP, I-ADJP, B-ADVP, I-ADVP, B-S, I-S and
Complex sentences are sentences that contain at least one O. The followings are examples of chunk tagged
complex NP or complex VP or both complex NP and sentences.
complex VP. Complex NPs are phrases that contain at
least one embedded sentence in the phrase construction.
The embedded sentence can be complements. The
following examples show the various structures of CHUNK एक एक गरी हे रे
complex Nepali sentences. IOB1 B-ADVP I- ADVP I-VP O
IOB2 I-ADVP B-ADVP I-VP O
 स्लगगको फाटो छे ककन्छ IOE1 I-ADVP I-ADVP I-VP O
The path of haven is blocked IOE2 I-ADVP I-ADVP I-VP O
IO I-ADVP I-ADVP I-VP O
 उनको आॉवु ऩुतछने थथमो [ [ . . .
Her tears would be wiped ] . . . ]

3. BASE PHRASE CHUNKING Table 1: Chunk representation for the sentence “एक एक
3.1 Chunk Representation गयी शे ये”.

The tag of chunks can be noun phrases, verb phrases,

adjectival phrases, etc. in line with the language
construction rules. There are many decisions to be made
about where the boundaries of a group should lie and, as a
consequence, there are many different „styles‟ of chunking.
There are also different types of chunk tags and chunk
boundary identifications. Nevertheless, in order to identify
the boundaries of each chunk in sentences, the following
boundary types are used (Ramshaw and Marcus, 1995):
IOB1, IOB2, IOE1, IOE2, IO, “[”, and “]”. The first four
426
3.2 Architecture Of The Chunker
To implement the chunker component, we used hidden
Markov model (HHM) enhanced by a set of rules to prune
errors. The HMM part has two phases: the training phase
and the testing phase. In the training phase, the system first
accepts words with POS tags and chunk tags. Then, the
HMM is trained with this training set. Likewise in the test
phase, the system accepts words with POS tags and
outputs appropriate chunk tag sequences against each POS
tag using HMM model. Fig. 1 illustrates the workflow of
the chunking process. In this work, chunking is treated as a
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
tagging problem. We use POS tagged sentence as input
from which we observe sequences of POS tags represented
as T. However, we also hypothesize that the corresponding
sequences of chunk tags form hidden Markovian
properties. Thus, we used a hidden Markov model (HMM)
with POS tags serving as states. The HMM model is
trained with sequences of POS tags and chunk tags
extracted from the training corpus. The HMM model is
then used to predict the sequence of chunk tags C for a
given sequence of POS tag T. This problem corresponds to
finding C that maximizes the probability P(C|T), which is
formulated as:
C' = argcmax P(C | T) (1)
---------------------------------------------------------
Word and POS tag Sequence
Chunk tag sequence
Fig. 1: Workflow of the chunking process.
4. EXPERIMENT
4.1 The Corpus
The major source of the dataset we used for training and
testing the system was Nepali news corpus which is at
present widely used for research on Nepali natural
language processing. The corpus contains 1000 sentences
where words are annotated with POS tags. Furthermore,
we also collected additional text from an Nepali grammar
book authored by Banu Oja and Shambhu Oja (2004). The
sentences in the corpus are classified as training data set
and testing data set using 10 fold cross validation
technique.
1. If POS(w)=ADJ and
POS(w+1)=NPREP,NUMCR then the chunk tag for w is
0;
2. If POS(w)=ADJ and POS(w-1)!=ADJ and
POS(w+1)= AUX,V, then the chunk tag for w is B-VP.
3. If POS(w)=NPREP and POS(w+1)=N, then
chunk for w is B-NP.
4. If POS(w)=NUMCR and POS(w+1)=NPREP,
then chunk tag for w is 0.
5. If POS(w)=N and POS(w+1)=VPREP and
POS(w-1)=N, ADJ, PRON, NPREP, then chunk tag for w
is B-VP.
427
ISBN: 978-81-924893-0-8
where C' is the optimal chunk sequence. By applying
Baye‟s rule can derive, Equation (1) yields:
C'= argcmax P(T |C)*P(C) (2)
which is in fact a decoding problem that is solved by
making use of the Viterbi algorithm. The output of the
decoder is the sequence of chunk tags which groups words
based on syntactical correlations. The output chunk
sequence is then analyzed to improve the result by
applying linguistic rules derived from the grammar of
Amharic. For a given Amharic word w, linguistic rules
(from which sample rules are shown in Algorithm 1) were
used to correct wrongly chunked words (“w-1” and “w+1”
are used to mean the previous and next word,
respectively).
Word, POS tag and Chunk Sequence
HMM Model
Chuking Model
Error pruning with rules
6. If POS(w)=ADJ and POS(w+1)=ADJ, then
chunk tag for w is B-ADJP.
Algorithm 1: Sample rules used to prune chunk errors.
4.2 Test Results
In 10-fold cross-validation, the original sample is
randomly partitioned into 10 equal size subsamples. Of the
10 subsamples, a single subsample is used as the validation
data for testing the model, and the remaining 9 subsamples
are used as training data. The cross-validation process is
then repeated 10 times, with each of the 10 subsamples
used exactly once as the validation data. Accordingly, we
obtain 10 results from the folds which can be averaged to
produce a single estimation of the model‟s predictive
potential. By taking the average of all the ten results the
overall chunking accuracy of the system is presented in
Table 2.
Chunking Model Accuracy
HMM 85.31%
HMM pruned with rules 93.75%
Table 2: Test result for Nepali base phrase chunker.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5. CONCLUSION AND FUTURE
WORKS
Nepali is one of the most morphologically complex and
less-resourced languages. This complexity poses difficulty
in the development of natural language processing
applications for the language. Despite the efforts being
undertaken to develop various Nepali NLP applications,
only few usable tools are publicly available at present. One
of the main reasons frequently cited by researchers is the
morphological complexity of the language. Nepali text
parsing also suffers from this problem. However, not all
Nepali natural language processing applications require
full parsing. In this work, we tried to overcome this
problem by employing chunker. It appears that chunking is
more manageable problem than parsing because the
chunker does not require deeper analysis of texts which
will be less affected by the morphological complexity of
the language. Thus, future work is recommended to be
directed at improving the chunker and use this component
to develop Nepali natural language processing applications
that do not rely on deeper analysis of linguistic structures.
REFERENCES
[1] Abney, S. (1991). Parsing by chunks. In: Berwick, R.,
Abney, S. and Tenny, C., principle-Based Parsing",
Kluwer Academic Publishers
[2] Abney, S. (1995). Chunks and Dependencies: Bringing
Processing Evidence to Bear on Syntax. In: Computational
linguistics and the Foundations of Linguistic Theory.
CSLI.
[3] Ali, W. and Hussain, S. (2010). A hybrid approach to
Urdu verb phrase chunking. In: Proceedings of the 8th
Workshop on Asian Language Resources (ALR-8),
COLING-2010. Beijing, China.
[4] Brants, T. (1999). Cascaded Markov models, In:
Proceedings of the ninth conference on European chapter
of the Association for Computational Linguistics. EACL-
99. Bergen, Norway.
[5] Kutlu, M. (2010). Noun phrase chunker for Turkish
using dependency parser. Doctoral dissertation, Bilkent
University.
[6] Lewis, P., Simons, F. and Fennig D. (2013).
Ethnologue: Languages of the World, Seventeenth edition.
Dallas, Texas: SIL International.
[7] Molina, A. and Pla, F. (2002). Shallow parsing using
specialized HMMs. The Journal of Machine Learning
Research, 2, pp. 595-613.
[8] Ramshaw, A. and Marcus, P. (1995). Text chunking
using transformation-based learning. In Proceedings of the
Third ACL Workshop on Very Large Corpora pp. 82-94.
[9] Thao, H., Thai, P., Minh N., and Thuy, Q. (2009).
Vietnamese noun phrase chunking based on conditional
random fields. In International Conference on Knowledge
and Systems Engineering (KSE'09). pp. 172-178.
[10] Tjong, E. F., Sang, K. and Buchholz, S. (2000).
Introduction to the CoNLL-2000 shared task: Chunking. In
Proceedings of the 2nd workshop on Learning language in
logic and the 4th conference on Computational natural
language learning, Volume 7 pp. 127-132.
428
ISBN: 978-81-924893-0-8
[11] Xu, F., Zong, C. and Zhao, J. (2006). A Hybrid
Approach to Chinese Base Noun Phrase Chunking. In
Proceedings of the Fifth SIGHAN Workshop on Chinese
Language Processing , Sydney.
[12] Yangarber, R. and Grishman, R. (1998). NYU:
Description of the Proteus/PET system as used for MUC-7.
In: Proceedings of the Seventh Message Understanding
Conference. MUC-7, Washington, DC.
[13] Arindam Dey, Bipul Syam Purkayastha “Named
Entity Recognition using Gazetteer Method and N-gram
Technique for an Inflectional Language: A Hybrid
Approach” (IJCA) International Journal of Computer
Applications, Vol. 84, 2013.
[14] Animesh Nayan,, B. Ravi Kiran Rao, Pawandeep
Singh,Sudip Sanyal and Ratna Sanya “Named Entity
Recognition for Indian Languages” .In Proceedings of the
IJCNLP-08 Workshop on NER for South and South East
Asian Languages ,Hyderabad (India) pp.97–104, 2008..
[15] Sujan Kumar Saha Sanjay Chatterji Sandipan
Dandapat. “A Hybrid Approach for Named Entity
Recognition in Indian Languages”.
[16] Asif Ekbal, Rejwanul Haque, Amitava Das,
Venkateswarlu Poka and Sivaji Bandyopadhyay
“Language Independent Named Entity Recognition in
Indian Languages” .In Proceedings of the IJCNLP-08
Workshop on NER for South and South East Asian
Languages, pages 33–40,Hyderabad, India, January 2008.
[17] P. Srikanth, K. Murthy, Named Entity Recognition
for Telugu, Workshop on NER for South and South East
Asian Languages, IJCNLP 2008.
[18] P. K. Gupta and S. Arora, “An Approach for Named
Entity Recognition System for Hindi: An Experimental
Study,” in Proceedings of ASCNT-2009, CDAC, Noida,
India, pp. 103–108.
[19] S. K. Saha, S. Sarkar, and P. Mitra January 2008, “A
Hybrid Feature Set based Maximum Entropy Hindi Named
Entity Recognition,” in Proceedings of the 3rd
International Joint Conference on NLP, Hyderabad , India.
[20] Suleiman H. Mustafa and Qasem A. Al-Radaideh
2004 “Using N-Grams for Arabic Text Searching” journal
of the american society for information science and
technology.
[21] Sujan Kumar Saha, Sudeshna Sarkar, Pabitra Mitra
“Gazetteer Preparation for Named Entity Recognition in
Indian Languages”.Available at:
http://www.aclweb.org/anthology-new/I/I08/I08-7002.pdf
[22] Shilpi Srivastava, Mukund Sanglikar and D.C
Kothari. ”Named Entity Recognition System for Hindi
Language: A Hybrid Approach” International Journal of
Computational Linguistics (IJCL), Volume (2): Issue (1) :
2011.
[23] W. Li and A. McCallum, Sept 2003 “Rapid
Development of Hindi Named Entity Recognition using
Conditional Random Fields and Feature Induction(Short
Paper),” ACM Transactions on Computational Logic.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Cloud Computing: A Review on Security and Safety
Measures
Sandeep Kapur
Research Scholar Guru Kashi University,
Talwandi sabo
sandeep.kapur82@gmail.com
ABSTRACT
Cloud computing is an emerging paradigm of computing. It
is an internet-based computing, whereby shared resources,
software and information, are provided to computers and
devices on-demand. This newer powerful computing
capability approach is byproduct of grid computing,
distributed computing and parallel computing. Cloud has
the advantage of reducing cost by sharing computing and
storage resources, combined with an on-demand
provisioning mechanism relying on a pay-per-use business
model. The major issue hindering the growth of popularity
of usage of cloud computing is cloud security. There are
numerous cloud security issues. This research article
provides an overview of the security challenges pertinent to
cloud computing and points out considerations for safety
measures organizations should take when outsourcing data
and applications. It also explores the safety solutions to
providing a trustworthy cloud computing environment.
Keywords
Cloud computing, security, threat, safety measures, pay-
per- use, byproduct.
1. INTRODUCTION
Cloud computing is not a total new concept; it is originated
from the earlier large-scale distributed computing
technology. Cloud computing will be the third revolution in
the IT industry, which represent the development trend of
the IT industry from hardware to software, software to
services, distributed service to centralized service. The core
concept of cloud computing is reducing the processing
burden on the users’ terminal by constantly improving the
handling ability of the “cloud”. Cloud resources include
hardware and systems software on remote datacenters, as
well as services based upon these that are accessed through
the simple Internet connection using a standard browser.
However, there still exist many problems in cloud
computing. Security risks have become the primary
concern for people to shift to cloud computing.
1.1 Definition
The most acceptable definition for cloud computing
defined by NIST (National Institute of Standards and
Technology, US), Cloud computing is a model for enabling
ubiquitous, convenient, on-demand network access to a
429
ISBN: 978-81-924893-0-8
Dr. Sandeep Kautish
Dean Engineering, Guru Kashi University,
Talwandi sabo
dr.skautish@gmail.com
shared pool of configurable computing resources (e.g.,
networks, servers, storage, applications, and services) that
can be rapidly provisioned and released with minimal
management effort or service provider interaction [8]. This
cloud model is composed of five essential characteristics,
three service models, and four deployment models.
In the commercial sector, Amazon.com was one of the first
vendors to provide storage space, computing resources and
business functionality following the cloud computing
model. In 2006, they launched Elastic Compute Cloud
(EC2) that allowed companies and individuals to rent
computers to run their own enterprise applications and
services. Salesforce.com, in 1999, pioneered the concept of
delivering enterprise applications as cloud-based services to
enterprises. The number of Cloud providers is increasing at
such a rate that Gartner listed Cloud Computing as number
one in its top ten strategic technology areas for 2010 [5].
The organization of the rest part is as follows. Section II
outlines the benefits that cloud computing offers service
model and deployment model. Then, Sections III describe
the information security principles, security threat and
issues and section IV discusses the safety measures with
respect to location, cost and security of data in the Cloud.
The last Section presents a brief conclusion.
2. CLOUD COMPUTING
2.1 Benefits
The essential features of this latest paradigm include [9]:
 On-demand self-services: to enable consumers to
use Cloud provisions as and when required by
business demands
 Resource pooling: to allow dynamically assigned
computing resources to serve multiple consumers
though the use of virtualization technologies
 Rapid elasticity and scaling: to allow Cloud
services, resources and infrastructures to be
automatically provisioned as business
requirements change.
 Measured provision: to provide a metering
capability to determine the on-demand usage for
billing purposes
 Effective management: to provide and facilitate
easy monitoring, controlling and reporting.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2.2 Service Model
 Software-as-a-Service (SaaS): it is software that
refers to prebuilt pieces of software or complete
applications (e.g. an email system, human
resource management, payroll processing)
deployed over the internet. This is a “pay-per-
use” model and was initially deployed for
salesforce automation and Customer Relationship
Management (CRM).
 Platform-as-a-Service (PaaS): It provide
development environment as a service. You can
use the middleman’s equipment to develop your
own program and deliver it to the users through
Internet and servers e.g. application servers,
portal servers and middleware. Consumers use
these to build and deploy their own applications.
 Infrastructure-as-a-Service (IaaS): This delivers a
platform virtualization environment as a service.
Rather than purchasing servers, software, data
center space or network equipment, clients
instead buy those resources as a fully outsourced
service.
 Hardware-as-a-Service (HaaS): According to
Nicholas Carr [7], “the idea of buying IT
hardware or even an entire data center as a pay-
per-use subscription service that scales up or
down to meet your needs. But as a result of rapid
advances in hardware virtualization, IT
automation, and usage metering and pricing, this
model is advantageous to the enterprise users,
since they do not need to invest in building and
managing data centers.
2.3 Deployment Model
 Public cloud: In public clouds, multiple
customers share the computing resources
provided by a single service provider, customers
can quickly access these resources, and only pay
for the operating resources. Although the public
cloud has compelling advantages, there existing
the hidden danger of security, regulatory
compliance and quality of service (QoS). The
resources may be offered free (e.g. Facebook and
YouTube provisions) or offered at a cost.
Consumers are charged only for the resources
they use following a pay-per-use model.
 Private cloud: In the private cloud, computing
resources are used and controlled by an exclusive
private enterprise. It’s generally deployed in the
enterprise’s data center and managed by internal
personnel or service provider. The main
advantage of this model is that the security,
compliance and QoS are under the control of the
enterprises [13]. In these clouds, data is much
more secure than if it is held in a public cloud.
 Hybrid cloud: A third type can be hybrid cloud
that is typical combination of public and private
cloud. It enables the enterprise to running state-
steady workload in the private cloud, and asking
the public cloud for intensive computing
resources when peak workload occurs, then
430
ISBN: 978-81-924893-0-8
return if no longer needed. For mission critical
processes, this type of cloud infrastructure is
much more effective because of enhanced control
and management by the enterprise itself.
 Community cloud: Community clouds are similar
to public clouds except that their access is limited
to a specific community of cloud consumers.
These are semiprivate clouds in that they are used
by a defined group of certain tenants (consumers)
with shared backgrounds and requirements.
Several organizations jointly construct and share
the same cloud infrastructure as well as policies,
requirements, values, and concerns. The cloud
community forms into degree of economic
scalability and democratic equilibrium. The cloud
infrastructure could be hosted by a third-party
vendor or within one of the organizations in the
community.
Figure 1. Cloud Model
3. DATA SECURITY ISSUES
Security issues are treated as vital concerned challenges of
cloud computing [9]. Cloud is expected to offer the
capabilities including: trusted encryption scheme to ensure
safe data-storage environment; stringent access control;
safe and stable backup of user data. However, cloud allows
users to obtain the computing power which exceeds their
own physical domain. This leads to several security
problems.
3.1 Information Security Principle (CIA)
 Confidentiality means to keep secret the personal
information. It ensures that data resides in the
cloud cannot be accessed by unauthorized user.
Various encryption techniques can be used with
symmetric or asymmetric encryption algorithms.
Encrypting data with passwords and biometric
verifications can be the simple solution for this. It
all depends on what type of techniques cloud
service provider is using. For instance in [15],
MozyEnterprise uses encryption techniques to
protect customer data whereas Amazon S3 does
not. It also depends on the customer awareness
where they can encrypt their information prior to
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
uploading it. Also, The CSP should ensure proper
deployment of encryption standards using NIST
standards in [2]. It helps to develop the trust
between communicating parties.
 Integrity is the assurance that the information is
trustworthy and accurate. Data integrity in the
Cloud system means to preserve information
integrity (i.e., not lost or modified by
unauthorized users). Mainly, there are two
approaches which provide integrity, using
Message Authentication Code (MAC) and Digital
Signature (DS). A message authentication code
(MAC) is a cryptographic checksum on data that
uses a session key to detect both accidental and
intentional modifications of the data. On the other
hand, in the DS algorithm it depends on the
public key structure (Having public and private
pair of keys). As symmetric algorithms are much
faster than asymmetric algorithms, in this case,
we believe that Message Authentication Code
(MAC) will be the best solution to provide the
integrity checking mechanism. Studies show that,
PaaS and SaaS doesn’t provide any integrity
protection, in this case assuring the integrity of
data is essential.
Security
CIA
Confidentiality Integrity Availability
Figure 2. Information security principles
 Availability is a guarantee of ready access to the
information by authorized people. The most
powerful technique is prevention through
avoiding threats affecting the availability of the
service or data. It is very difficult to detect threats
targeting the availability. Threats targeting
availability can be either Network based attacks
such as Distributed Denial of Service (DDoS)
attacks or CSP availability. For example,
Amazon S3 suffered from two and a half hours
431
ISBN: 978-81-924893-0-8
outage in February 2008 and eight hours outage
in July 2008.
3.2 Security Threats
 Spoofing identity: It is an ill practice in which
message is sent from unknown source practicing
as a source known to receiver. There are
numerous types of spoofing but most vital and
relevant type to cloud is the IP spoof.
 Tampering with data: It is the knowingly
destruction or manipulation of data. Data can be
tempered whether it is stored physically or it is
communication mode.
 Repudiation: Repudiation of data threat occurs
when proper measures and controls are not taken
to track and log users' actions and allow
malicious manipulation. These attacks destroy
data stored on log files make it invalid and
change the authoring information of actions
executed by a malicious user.
 Information disclosure: These attacks designed to
acquire system specific information about a web
site. This system specific information includes
the software distribution, version numbers, and
patch levels, or the information may contain the
location of backup files and temporary files.
 Denial of service: DoS attacks occur when a
system is flooded with traffic to the point that it is
unable to process legitimate service requests. It
will halt the availability and reliability of
applications. The prediction and removal of DoS
attacks is very tough. Firewall and bandwidth
throttling and resource throttling can be used to
control DOS attacks.
 Elevation of privilege: An elevation of privilege
occurs when a user obtains privileged access to
portions of the application or data that are
normally inaccessible to the user.
3.3 Security Issues
 Privileged user access: Information transmitted
from the client through the Internet poses a
certain degree of risk because of issues of data
ownership; enterprises should spend time getting
to know their providers and their regulations as
much as possible before assigning some trivial
applications. It is probable for the confidential
data to be illegally accessed due to the astringent
access control. Unauthorized access may exist if
security mechanism is not adequate. Entities in
the service chain can easily utilize the
vulnerability to access users’ data. As data
usually exists in the Cloud for a long time, the
risk of illegal access is higher.
 Regulatory compliance: Clients are accountable
for the security of their solution, as they can
choose between providers that allow to be
audited by 3rd party organizations that check
levels of security and providers. Numerous
regulations pertain to the storage and use of data
require regular reporting and audit trails, cloud
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
providers must enable their customers to comply
appropriately with these regulations. Managing
Compliance and Security for Cloud Computing,
provides insight on how a top-down view of all
IT resources within a cloud-based location can
deliver a stronger management and enforcement
of compliance policies. In addition to the
requirements to which customers are subject, the
data centers maintained by cloud providers may
also be subject to compliance requirements.
 Loss of control: Depending on contracts, some
clients might never know what country or what
jurisdiction their data is located. When
organizations port their data or services to cloud,
they are not aware of the location of their data
and services since, the provider can host their
data or services anywhere within the Cloud. This
poses a serious concern as from a user
perspective. Organizations as well as users lose
control over their vital data and are not aware of
any security mechanisms put in place by the
provider.
 Data transfer across the borders: If a global
company that wishes to take advantages of
services hosted on cloud computing systems, it
has to make clear which countries are hosting its
private data providing cloud services, and their
individual laws govern its data. For example, the
US company will want to know where the
personal data of its employees, business
information will be located, so that it can be
known how the specific laws will be applied on
its private data. A German subsidiary may not
oppose to use cloud services provided in
Argentina, but it will object to the transfer of its
data to Turkey, Mexico, or the United States.
Knowing where the cloud service provider will
host the data is a prerequisite task.
 Dynamic Provisioning: It is not clear which party
is responsible (statutorily or contractually) for
ensuring legal requirements for personal
information are observed, or appropriate data
handling standards are set and followed [5].
Neither is it yet clear to what extent cloud sub-
contractors involved in processing can be
properly identified, checked and ascertained as
being trustworthy, particularly in a dynamic
environment. It is also unclear what rights in the
data will be acquired by data processors and their
sub-contractors, and whether these are
transferable to other third parties upon
bankruptcy, takeover, or merger [6].
 Data Sanitization: Sanitization is the removal of
sensitive data from a storage device in various
situations, such as when a storage device is
removed from service or moved elsewhere to be
stored [16]. It also applies to backup copies made
for recovery and restoration of service, and
residual data remaining upon termination of
service. In a cloud computing environment, data
from one subscriber is physically comingled with
the data of other subscribers, which can
432
ISBN: 978-81-924893-0-8
complicate matters. For example, with the proper
skills and equipment, it is possible to recover data
from failed drives that are not disposed of
properly by service providers.
 Data segregation: Encrypted information from
multiple companies may be stored on the same
hard disk, so a mechanism to separate data should
be deployed by the service provider.
 Recovery: Every provider should have a disaster
recovery protocol to protect and secure user data.
 Investigative support: If a client suspect’s faulty
activity from the provider, it may not have many
legal ways pursue an investigation cloud
computing systems (including applications and
services hosted on them) has significant
implications for the privacy of personal
information as well as for the confidentiality of
business and governmental information.
Furthermore, the entire contents of a user’s
originally stored on local device may be shifted
to a single cloud provider or even to many cloud
providers. Whenever an individual, a business, a
government agency, or other entity shares
information in the cloud, privacy or
confidentiality questions may arise.
 Long-term viability: Refers to the ability to
retract a contract and all data if the current
provider is bought out by another firm should be
sure that the data you put into the cloud will
never become invalid even when your cloud
computing provider go broke or get acquired and
swallowed up by a larger company.
 Audit: CSPs need to implement internal
monitoring controls, in addition to an external
audit process. Transactions involving data that
resides in the cloud need to be properly made and
recorded, in order to ensure integrity of data and
the data owner needs to be able to trust the
environment that no untraceable action has taken
place. However, provision of a full audit trail
within the cloud, particularly in public cloud
models, is still an unsolved issue.
 Lack of standardization of policy integration: The
cloud is heterogeneous, which means that
different cloud servers may have different
mechanisms to ensure the clients’ data security,
thus policy integration is one of the concerns. If
not addressed properly, security breaches may
exist. Problem between Google, Amazon and
LoadStorm is one example.
 Unclear responsibility: It is sometimes not clear
which CSP is responsible for security of data.
Who can use and modify the user data. Users are
also concerned about whether the rights of data
procession of one single party can be transferred
to another third party in any circumstances.
 Data Loss: When organizations migrate their data
to cloud, they expect to have the same level of
data integrity and safety as in their own premises.
But in multi tenant environment unauthorized
parties want to gain access to sensitive data.
Deletion or alteration of records without a backup
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
of the original content is an obvious example.
Insufficient authentication and accounting
authorization and accounting controls, an
inconsistent use of encryption and encryption
keys, operational failures, political issues and
data center reliability are the biggest factors
responsible in a direct and indirect way for data
loss.
4. SAFETY MEASURES
 The prime requirement for safety measure is to
approach the right cloud service provider.
Different vendors have different cloud IT security
and data management. A cloud vendor should
have standards and regulation with analytical
technical skill, experience. So there is not any
chance of cloud vendor closing.
 There should be clear contract with cloud vendor.
So if cloud vendor closes before contract,
enterprise can claim.
 Cloud vendors should provide very good
recovery facilities. So, if data are fragmented or
lost due to certain issues, they can be recovered
and continuity of data can be managed.
 Enterprise must have very good infrastructure
which facilitates installation and configuration of
hardware components such as firewalls, routers,
servers, proxy servers. It should be able to defend
against cyber attacks.
 Cloud users should have some mechanism to
encrypt data before storing data on cloud
premises for security purpose.
 For encryption of data, a strategy must be defined
and elaborated.
 Applications have built in security mechanisms to
avoid any buffer overflow and attacks.
 Multi-layer security approach should be
implemented to counter the threats.
 For insider attacks antivirus, firewalls should be
used properly.
 Ensure multi tenant systems are well isolated.
 The cloud customers (organizations, businesses)
should have a sound understanding of security
processes and of the SLAs with the provider.
This helps remove any discrepancies and creates
a symbiotic relationship between provider and
customer.
 There should be total analysis of data. An
approach like representing the flow of data on
chart can be used by managers so they can have
idea where the data is for all the times, where it is
being stored and where it is being shared.
5. CONCLUSION
Cloud computing is an emerging style of computing with
great promises; it is expected to change and revolutionize
computing as we know. Cloud technologies, if used
appropriately, can help to reduce costs, reduce management
responsibilities and increase agility and efficiency of
organizations. However, one must be very careful to
understand the security risks and challenges posed in
433
ISBN: 978-81-924893-0-8
utilizing this technology. There is no silver bullet to counter
the threats to distributed or cloud computing model but it is
possible with right security strategy, multiple layers of
security. Both the service providers and the clients must
work together to ensures safety measures, security of cloud
and data on clouds. Mutual understanding between service
providers and users is extremely necessary for providing
better cloud security. Cloud computing is an environment
making supercomputing available in a very cost effective
way.
REFERENCES
[1] A. Verma and S. Kaushal, “Cloud Computing Security
Issues and Challenges: A Survey”, Proceedings of
Advances in Computing and Communications, Vol. 193,
pp. 445-454, 2011.DOI: 10.1007/978-3-642-22726-4_46
[2] Cloud Security Alliance, “Top Threats to Cloud
Computing”, v1.0, March 2010.
[3] Caroline Kvitka, Clouds Bring Agility to the Enterprise,
[Online] Available at:http://www.oracle.com/technology
/oramag/oracle/10-mar/o20interview.html
[4] Cloud Security Alliance, “Security Guidance for
Critical Areas of Focus in Cloud Computing”. 2009.
[5] Dustin Amrhein & Scott Quint, Cloud Computing for
the Enterprise: Part 1: Capturing the cloud, Understanding
cloud computing and related technologies, Developer
Works, IBM, [Online] Available at:
www.ibm.com/developerworks/websphere/techjournal/090
4_amrhein/ 0904_amrhein.html
[6] Gellman, R. Privacy in the Clouds: Risks to Privacy
and Confidentiality from Cloud Computing. World Privacy
Forum.http://www.worldvacyforum.org/pdf/WPF_Cloud_P
rivacy_R eport.pdf, 2009.
[7] Nicholas Carr's Blog. Here comes haas.
http://www.roughtype.com/archives/2006/03/here_comes_
haas.php, 2006.
[8] Peter Mell and Tim Grance, The NIST Definition of
Cloud Computing, version 15, National Institute of
Standards and Technology (NIST), InformationTechnology
Laboratory,www.csrc.nist.gov, 7 Oct 2009
[9] Peter Mell, Timothy Grance. The NIST Definition of
Cloud Computing (Draft). NIST. 2011. http:/
/www.production scale.com/home/2011/8/7/the-nist
definition-of-cloud computingdraft.html#axz z1X0xKZRuf
[10] Peter Mell(2012) “What’s special about cloud
security” IEEE computer society, 1520-9202/12.
[11] Ramgovind, S., M. Eloff, et al. (2010). The
management of security in cloud computing, IEEE.
[12] Stephen Shankland, Brace yourself for Cloud
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Computing, CNET News, Oct 2009
http://news.cnet.com/8301-30685_3-10378782- 264.html
[13] Tharam Dillon, Chen Wu, Elizabeth Chang, 2010 24th
IEEE International Conference on Advanced Information
Networking and Applications ,“Cloud computing: issues
and challenges”.
[14] T. Mather, S. Kumarasuwamy and S. Latif, “Cloud
Security and Privacy”, O’Rielly, ISBN: 978-0-4596-
802769, 2009.
[15] V.Krishna Reddy(2011) “Security Architecture of
[Cloud Computing” International Journal of Engineering
Science and Technology (IJEST), ISSN : 0975-5462
Vol.3.pages 7149-7155, 2011..
[16] Wayne A. Jansen, (2011) “Cloud Hooks: Security and
Privacy Issues in Cloud Computing” The 44th Hawaii
International Conference on System Sciences – 2011.

434
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Survey on Multiprotocol Label Switching Virtual
Private Network Techniques (MPLS VPN)
Gurwinder Singh
BGIET,Sangrur
er.gurwindertoor@gmail.com
ABSTRACT
MPLS is a technology that is used for fast packet forwarding
within service provider networks. L2VPNs behave like they
are on same LAN, while for L3VPNs Customer Edge router
creates a L3 neighbor ship with Provider Edge router. MPLS
focuses on these three techniques- Virtual Private LAN
Service (VPLS), Virtual Private Wire Service (VPWS),
Ethernet VPN & Provider Backbone Bridging-EVPN (EVPN
& PBB-EVPN). This paper specifies an overview of
Multiprotocol Label switching and Layer 2 and Layer 3
MPLS VPN technologies.
Keywords:
MPLS, LDP, VRF, Layer 3 MPLS VPN, RD, RT, VPLS,
VPWS, EVPN.
1. INTRODUCTION
1.1 MPLS
Multiprotocol Label Switching (MPLS) is a label switching
technology that uses labels attached to packets to forward
them through the network. MPLS Labels are advertised
between routers and creates a label-to-label mapping. It is the
method of packet forwarding that is used in Service Provider
Network environments. Label Distribution Protocols are used
to exchange labels between routers. Various Label exchange
Protocols are Label Distribution protocol (LDP), Resource
Reservation Protocol (RSVP), Multi-Protocol BGP(MP-
BGP). LDP is the most widely used protocol for exchanging
labels. LDP labels are only assigned to non-BGP routes in the
Routing Information Base (RIB). MP-BGP is used to
distribute the label bindings for BGP routes in the RIB. RSVP
is used to distribute the label bindings for Traffic
Engineering(TE).
Fig 1.1 Label Headers [1]
With its ability to forward traffic on the basis of labels instead
of destination IP address, it eliminates the use of Border
Gateway Protocol (BGP) protocol in the core service provider
435
ISBN: 978-81-924893-0-8
Manuraj Moudgil
BGIET,Sangrur
manu.moudgil@gmail.com
routers, but the greatest advantage of using MPLS is its ability
to create Virtual Private Network. MPLS has the capability to
create both Layer 2 and Layer 3 VPNs. Apart from VPNs,
various other benefits includes Traffic Engineering, Optimal
Traffic Flow, and better IP over ATM integration, use of one
unified network infrastructure etc. MPLS is one of the big
things happened to network industry in 21st century, and after
around 14 years, since its first standard paper (IETF RFC
3031), it is still growing with BGP MPLS based Ethernet
VPN standard paper published in February 2015.MPLS is
everywhere in networks with almost all of the service
providers have their backbone network on MPLS, Datacenters
are interconnected using L2 MPLS Technologies, Enterprises
use MPLS services to connect their offices at remote
locations.
Fig 1.2 The AT&T global backbone network includes :
MPLS-based services available to 163 countries over 3,800
service nodes, 290,000+ managed MPLS ports for customers,
38 Internet data centers across the globe, 928,000 worldwide
fiber route miles.[2]
1.2 Layer 3 MPLS VPN
MPLS Layer 3 VPN interconnects customer sites over a
service provider core. It is a peer-to-peer VPN model.
Customer creates a Layer 3 neighbor ship with service
provider. Labels are imposed to customers IP routes, when
they enter from customer edge (CE) to provider edge(PE)
device, and labels got disposed while sending the customer ip
traffic from provider edge to customer edge.
Terminology for MPLS L3 VPN MPLS VPN is below:
 Label - A 4-byte identifier, used by MPLS to make
forwarding decisions.
 CE Router - Customer Edge Router, a non-MPLS
client/site router connected to the MPLS network.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 P Router - Provider Router, a LSR in MPLS VPN
terminology.
 PE Router - Provider Edge Router, an edge-LSR in
MPLS VPN terminology.
 LSP - Label Switch Path, a series of LSRs that
forward labeled packets to their destinations
(unidirectional)
 Ingress PE router - Is the edge-LSR an IP packet
arrives at from a CE router before being labeled and
forwarded to the egress PE router.
 Egress PE Router - Is the edge-LSR where the
destination route is connected. Receives labeled
packets, forwards IP packets.
- Virtual Routing and Forwarding(VRF) is a technology used
with MPLS Layer 3 VPNs that allows multiple routing tables
in a router. Every instance of routing table is specific to a
customer that provides isolated environment between different
clients, even if they have the same address space. Each VRF
instance has a separate RIB, FIB, and LFIB table.
- Route Distinguisher(RD) is used with VRF which uniquely
identifies a route. It is a 64-bit value attached to client's non-
unique 32-bit address in order to produce a unique 96-bit
VPNv4 address. VPN routes are forwarded across a MPLS
VPN network by MP-BGP that requires transported routes to
be unique.
- Route-Target (RT) is a 64-bit extended BGP community
attached to a VPNv4 route to indicate its VPN membership.
 Export RTs are attached to a route when it is
converted into a VPNv4 route. It is used to identify
the VPN membership of routes.
 Import RTs are used to select VPNv4 routes for
insertion into matching VRF tables.
Fig 1.3 - Route Propagation in L3 MPLS VPN [3]
1.3 Layer 2 MPLS VPN
L2VPN (Layer2 VPNs) provides a transparent end-to-end
layer2 connection to an enterprise over a SP's (Service
Provider) MPLS or IP core. Client Sites behaves like they are
connected via Switch. Traffic is forwarded from CE switch or
router to PE switch in Layer 2 format. It is carried by MPLS
436
ISBN: 978-81-924893-0-8
over the service provider network and converted back to
Layer 2 format at the receiving site.
- Unlike L3VPNs where the SP take part in the client routing,
with L2VPNs the SP has no involvement in the client IP
routing.
- Client layer2 traffic is tunneled through the IP/MPLS core
network, such that the CE routers appear to be directly
connected.
2. LITRATURE REVIEW
E. Rosen (2001) [4] describes Multiprotocol Label Switching
Architecture of Cisco Systems, A. Viswanathan of Force10
Networks, and R. Callon [4] of Juniper Networks in Internet
Engineering Task Force (IETF) RFC - 3031 specifies the
architecture of Multiprotocol Label Switching(MPLS). It is
the first standard document of Multiprotocol Label Switching
by IETF MPLS Working Group.
L. Andersson et. al. (2006) [5] describes framework for Layer
2 Virtual Private Networks (L2VPNs) Of Cisco Systems..This
framework is intended to aid in standardizing protocols and
mechanisms to support interoperable L2VPNs. This model
also is a standard document for Virtual Private Wire Service
(VPWS) and Virtual Private LAN Service (VPLS).
L. Martini (2006) [6] describes pseudo wire Setup and
Maintenance Using the Label Distribution Protocol (LDP) of
Cisco Systems, N. El-Aawar of Level 3 Communications, T.
Smith of Network Appliance and G. Heron [6] of Tellabs
describes how layer 2 services like Frame Relay,
Asynchronous Transfer Mode, and Ethernet can be emulated
over a MPLS backbone by encapsulating the Layer 2 protocol
units (PDU) and transmitting them over "pseudo wires". This
document specifies a protocol for establishing and
maintaining the pseudo wires, using extensions to LDP.
L. Martini (2006) [7] describes encapsulation Methods for
Transport of Ethernet over MPLS Networks, Ed., E. Rosen [7]
of Cisco Systems, N. El-Aawar [7] of Level 3 Communications
and G. Heron of Tellabs describes an Ethernet pseudo
wire(PW) is used to carry Ethernet/802.3 protocol data
units(PDUs) over an MPLS network.
K. Komepella (2007) [8] describes virtual Private LAN Service
(VPLS) Using BGP for Auto-Discovery and Signaling, Ed.
And Y. Rekhter [8], Ed of Juniper Networks describes BGP
Auto Discovery and Signaling method for VPLS. It specifies a
mechanism for signaling a VPLS, and rules for forwarding
VPLS frames across a packet switched network.
M. Lasserre et. al. (2007) [9] describes virtual Private LAN
Service (VPLS) Using Label Distribution Protocol (LDP)
Signaling of Alcatel Lucent [9] in IETF RFC 4762 describes a
Virtual Private LAN Service (VPLS) solution using pseudo
wires, a service previously implemented over other tunneling
technologies and known as Transparent LAN Services (TLS).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A VPLS creates an emulated LAN segment for a given set of
users; i.e., it creates a Layer 2 broadcast domain that is fully
capable of learning and forwarding on Ethernet MAC
addresses and that is closed to a given set of users. Multiple
VPLS services can be supported from a single Provider Edge
(PE) node.
N. Bitar (2014) [10] describes requirements for Ethernet
VPN(EVPN) of Verizon, A. Sajassi [10] of Cisco Systems, R.
Aggarwal [10] of Arktan, W. Henderickx [10] of Alcatel-Lucent,
Aldrin Issac [10] of Bloomberg, J. Uttaro [10] of AT&T.
Grenville Armitage et. al. (2000) [11] describes MPLS: The
Magic Behind the Myths [9] reviews the key differences
between traditional IP Routing and the emerging MPLS
approach, and identifies where MPLS adds value to IP
networking.
3. Detail about different MPLS Techniques:
3.1 Virtual Private Wire Service (VPWS) /Any
Transport over MPLS (AToM) - Layer 2 traffic can be
transported over MPLS backbone with the help of
AToM/VPWS. AToM is Cisco's implementation of VPWS
in MPLS networks. Layer 2 traffic is transparently carried
across a MPLS backbone from one site to another with both
the sites behaves like they are directly connected. Two
pseudo wire technologies are used in VPWS, one is AToM,
which is a pseudowire technology that targets MPLS
networks and L2TPv3, a pseudo wire technology for native
IP networks. Both AToM and L2TPv3 supports the transport
of ATM, HDLC, Frame Relay and Ethernet traffic over an IP
MPLS network.
Fig 3.1 AToM Model [12]
3.2 Virtual Private LAN Service (VPLS) - VPLS uses
Layer 2 architecture to offer multipoint Ethernet VPNs that
connects multiple sites over Metropolitan-area-
network(MAN) or Wide-Area-Network(WAN). VPLS is
designed for those applications that requires multipoint
access. VPLS emulates an Ethernet LAN. If a customer needs
to connect his Ethernet segments from one site to another,
VPLS service can emulate an Ethernet Switch that has ports
437
ISBN: 978-81-924893-0-8
leading to different Ethernet Sites. It can be a physical or a
pseudo wire port. MAC address learning takes place
dynamically when packets arrive on a VPLS PE router,
similar to traditional switch. Layer 2 loop prevention is done
using split horizon forwarding. By default, layer2 control
PDUs (VTP, STP, and CDP) are dropped at ingress VPLS PE
routers. Layer2 protocol tunneling configured with
"l2protocol - tunnel " allows VTP, STP or VTP to be sent
across a pseudo wire. Enabling STP might be required in
certain VPLS network designs to avoid downstream loops.
Fig 3.2 VPLS Reference Model [13]
3.3 Ethernet VPN & Provider Backbone Bridging-
EVPN (EVPN & PBB-EVPN) - EVPN and PBB-
EVPN is designed to address various Datacenter and
Servicer Provider requirements. It is a next-generation
solution for Ethernet multipoint connectivity services.
EVPN also gives you the capability to manage routing
over a Virtual Private Network, providing complete
control and security. EVPN uses BGP for distributing
client's MAC addresses over the MPLS/IP network.
EVPN advertises each of clients MAC address as BGP
routes that add the capability of BGP policy control over
MAC addresses. PBB-EVPN solution combines Ethernet
PBB (IEEE 802.1ah) with EVPN, where PEs act as PBB
Backbone Edge Bridge(BEB). PEs receives IEEE 802.1q
Ethernet frames from their attachment circuits. These
frames are encapsulated in the PBB header and
forwarded over the IP/MPLS core. On the egress side,
PBB header is removed and original dot1q frame is
delivered to customer equipment.
Fig 3.3 PBB-EVPN Network [6]
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
4. CONCLUSION
MPLS is the mainstream technology used in service provider
networks because of bulk of features it offer to an ISP, it has
the ability to create both Layer 2 and Layer 3 VPNs. Data
Center Interconnect, Ethernet based WAN services are the key
applications driving deployments of MPLS L2VPN today. E-
VPN and PBB-EVPN are next-generation L2VPN solutions
that address multi-homing and forwarding policy
requirements.
REFERENCES
[1] Cisco press MPLS and Next Generation Networks
,”Foundations for NGN and Enterprise Virtualization
”,http://ptgmedia.pearsoncmg.com/images/chap3_978158720
1202/elementLinks/md100302.gif” ISBN-10:1-58720-120-8
[2]AT&T(American Telephone & Telegraph)
”http://bpastudio.csudh.edu/fac/lpress/471/hout/attnetwork.pn
g”.
[3] Press, Cisco. "MPLS fundamentals." (2007).
[4]Rosen, Eric, Arun Viswanathan, and Ross Callon.
"Multiprotocol label switching architecture." (2001).
[5] Andersson, Loa, and E. Rosen. Framework for layer 2
virtual private networks (L2VPNs). RFC 4664, September,
2006.
[6] Martini, Luca. "Pseudowire Setup and Maintenance Using
the Label Distribution Protocol (LDP)." (2006).
[7] Martini, Luca, et al. "Encapsulation methods for transport
of Ethernet over MPLS networks." RFC4448, April (2006).
438
ISBN: 978-81-924893-0-8
[8] Kompella, Kireeti, and Yakov Rekhter. "Virtual private
LAN service (VPLS) using BGP for auto-discovery and
signaling." (2007).
[9] Lasserre, Marc, and Vach Kompella. Virtual private LAN
service (VPLS) using label distribution protocol (LDP)
signaling. RFC 4762, January, 2007.
[10] Isaac, Aldrin, et al. "Requirements for Ethernet VPN
(EVPN)." (2014).
[11] Armitage, Grenville. "MPLS: the magic behind the myths
[multiprotocol label switching]." Communications Magazine,
IEEE 38.1 (2000): 124-131.
[12] Cisco press MPLS Configuration on Cisco IOS Software
http://flylib.com/books/2/686/1/html/2/images/1587051990/gr
aphics/11fig01.gif
[13] Press, Cisco. "MPLS fundamentals." Page 438, (2007).
[14] Cisco,” ASR 9000 Series L2VPN and Ethernet Services
Configuration Guide“,http://www.cisco.com/c/dam/en/us/td
/i/300001400000/360001370000/361000362000/361074.eps/_
jcr_content/renditions/361074.jpg
[15] Sajassi, Ali, et al. "BGP MPLS Based Ethernet VPN."
(2011).
[16] Press, Cisco. "MPLS fundamentals." (2007).
[17] Luo, Wei, et al. Layer 2 VPN architectures. Pearson
Education, 2004.
[18] Darukhanawalla, Nash, et al. Interconnecting data centers
using VPLS. Cisco Press, 2009.
[19] Zhang, Lixia, et al. "Resource ReSerVation protocol
(RSVP)--version 1 functional specification." Resource (1997).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Comparison Analysis of TORA Reactive Routing
Protocols on MANET based on the size of the network
Emanpreet kaur Abhinash Singla
Bhai Gurdas College of Assistant Professor (CSE),
Engg. & Bhai Gurdas College of
Tech.,Sangrur.Punjab Engg. & Tech.,Sangrur,
sra_gagandeep@yahoo. Punjab, India,
co.in abhinash11@gmail.com
ABSTRACT
MANET is a collection of mobile nodes that communicate
with each other over relatively bandwidth constrained
wireless links . Network topology may change rapidly and
erratically, so it can considerably affect packet routing in
terms of network throughout, load and delay . In this we are
presenting paper on performance comparison on tora
routing protocol on MANET with varying network sizes
and with increasing area and nodes sizes.this performance
is measured by using “OPNET MODELLER 14.0”
Simulator .the parameters taken for simulation is
Throughput ,Network load and Delay .In the last
conculsion is given for the performance of the TORA
reactive protocol under varying network sizes .The final
valuation is given at the end of this paper.
Keywords- manet ,opnet, TORA ,simulation.
1. INTRODUCTION AND RELATED
WORK
In the last couple of year, the use of wireless networks has
become more and more familiar. A Mobile Ad-hoc
Wireless Network (MANET) is a collection of autonomous
nodes that communicate with each other by forming a
multi-hop network, maintaining connectivity in a
decentralized manner[1]. Due to self-organize and rapidly
deploy capability, MANET can be applied to different
applications including battlefield communications,
emergency relief scenarios, law enforcement, public
meeting, virtual class room and other security-sensitive
computing environments. There are 15 major issues and
sub-issues involving in MANET such as routing,
multicasting/broadcasting, location service, clustering,
mobility management, TCP/UDP, IP addressing, multiple
access, radio interface, bandwidth management, power
management, security, fault tolerance, QoS/multimedia,
and standards/products. Currently, the routing, power
management, bandwidth management, radio interface, and
security are hot topics in MANET research. The routing
protocol is required whenever the source to transmit and
delivers the packets to the destination. Many routing
protocols have been proposed for mobile ad
hoc network [2].
439
ISBN: 978-81-924893-0-8
Rupinder kaur Assistant
Professor (CSE),
Bhai Gurdas College of
Engg. & Tech.,Sangrur,
Punjab, India,
rupinder.walia84@gmail
.com
A. Proactive or table-driven routing protocols: In
proactive protocols, each node maintains individual routing
table containing routing information for every node in the
network. Each node maintains consistent and current up-
to-date routing information by sending control messages
periodically between the nodes which update their routing
tables. The proactive routing protocols use link-state
routing algorithms which frequently flood the link
information about its neighbors. The drawback of
proactive routing protocol is that all the nodes in the
network always maintain an updated table. Some of the
existing proactive routing protocols are DSDV and OLSR .
B. Reactive or On Demand Routing Protocol: In
Reactive routing protocols, when a source wants to send
packets to a destination, it invokes the route discovery
mechanisms to find the route to the destination. The route
remains valid till the destination is reachable or until the
route is no longer needed. Unlike table driven protocols, all
nodes need not maintain up-to-date routing information.
Some of the most used on demand routing protocols are
DSR, TORA and AODV .
2. MANET ROUTING PROTOCOLS
There are several protocols proposed for wireless mobile
ad-hoc networks. When we need to transfer the data from
source to destination, we need a dedicated path or a route
that is decided by various routing protocols. In this paper,
we have used the TORA Routing Protocol
Temporally Ordered Routing Algorithm (TORA):
TORA is adaptive and scalable routing algorithm based on
the concept of link reversal. It finds multiple routes from
source to destination in a highly dynamic mobile
networking environment. An important design concept of
TORA is that control messages are localized to a small set
of nodes nearby a topological change. Nodes maintain
routing information about their immediate one-hop
neighbors. The protocol has three basic functions: route
creation, route maintenance, and route erasure . Nodes use
a “height” metric to establish a directed cyclic graph
(DAG) rooted at the destination during the route creation
and route maintenance phases. The link can be either an
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

upstream or downstream based on the relative height metric for certain functionality presumes that the link status
of the adjacent nodes. TORA’s metric contains five sensing, neighbor discovery, in order packet delivery and
elements: the unique node ID, logical time of a link failure, address resolution are all readily available. The solution is
the unique ID of a node that defined the new reference to run the Internet MANET Encapsulation Protocol at the
level, a reflection indicator bit, and a propagation ordering layer immediately below TORA. This will make the
parameter. Establishment of DAG resembles the overhead for this protocol difficult to separate from that
query/reply process discussed in Lightweight Mobile imposed by the lower layer.[3]
Routing (LMR). Route maintenance is necessary when any
of the links in DAG is broken. Figure 2. Denotes the 3. SIMULATION PARAMETERS
control flow for the route maintenance in TORA . The main
strength of the protocol is the way it handles the link To analyse the performance of TORA OPNET 14.0
failures. TORA’s reaction to link failures is optimistic that simulator is used. Scenario is created with 30 and 10
it will reverse the links to re-position the DAG for number of mobile nodes. Simulation parameters used for
searching an alternate path. Effectively, each link reversal the implementation of TORA are listed in the Table 1.
sequence searches for alternative routes to the destination.
This search mechanism generally requires a single-pass of Simulation Parameter Value
the distributed algorithm since the routing tables are
modified simultaneously during the outward phase of the Number of Nodes 30 and 10
search mechanism. Other routing algorithms such as LMR
use two-pass whereas both DSR and AODV use three pass
procedure. TORA achieves its single-pass procedure with Simulation Time 300 sec
the assumption that all the nodes have synchronized clocks
(via GPS) to create a temporal order of topological change
of events. The “height” metric is dependent on the logical Simulation Area (30 and 10 km *10 km
time of a link failure [2, 3,8]. 10 nodes)

Routing Protocols TORA

Data Rate 11mbps

Application Name FTP (High load)

Buffer size 1024000

Simulator Opnet Modeller 14.0

Fig 1. FLOW DIAGRAM OF ROUTE MAINTENANCE
IN TORA
Advantages and Limitations :
The advantage of TORA is that the multiple routes are
supported by this protocol between the source and
destination node. Therefore, failure or removal of any of
the nodes is quickly resolved without source intervention
by switching to an alternate route to improve congestion. It
does not require a periodic update, consequently
communication overhead and bandwidth utilization is
minimized. It provides the support of link status sensing
and neighbor delivery, reliable in-order control packet
delivery and security authentication. Also TORA consist
some of the limitations like which depends on synchronized
clocks among nodes in the ad hoc network. The
dependence of this protocol on intermediate lower layers
4. PERFORMANCE PARAMETERS
The following performance parameters are used to analyze
the simulated result:-
Throughput [4]: Throughput is defined as the ratio of the
total data reaches a receiver from the sender. The time
consumed by the receiver to receive the last packet is called
throughput. Throughput is expressed as bytes or bits per sec
(byte/sec or bit/sec).
Delay- The packet end-to-end delay is the average time of
the packet passing through the network. It includes over all
delay of the network like transmission time delay which
occurs due to routing broadcasting, buffer queues. It also
includes the time from generating packet from sender to
destination and express in seconds.
Load- Load represents the total load in bit/sec submitted to
wireless LAN layers by all higher layers in all WLAN
nodes of the network. When there is more traffic coming on
the network, and it is difficult for the network to handle all

440
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

this traffic so it is called the load. The efficient network can

easily cope with large traffic coming in, and to make a best
network, many techniques have been introduced [5].

Media Access Delay:- The Time taken by a node to access

a media in order to transfer a data packet from source node
to destination node is known as Media Access Delay

5. RESULTS AND ANALYSIS

Throughput: Fig a shows the throughput for each
protocol. The maximum throughput for TORA protocol is
at 7,500 bits/sec for 30 nodes and 1,500 nodes for 10 nodes
after 300 sec Fig b Load of TORA for 10 and 30 nodes

Media Access Delay: fig c shows the media acces delay of

TORA protocol . for 30 nodes it is highest at 0.0020 bits

Fig a: Throughput of TORA for 10 and 30 nodes

Load: Fig. b shows the increase in network load for TORA

for 30 and 60 nodes respectively. From fig it is observed
that network load starts increasing and then reaches its
maximum value at below 6,500 bits for 30 nodes whereas
for 10 nodes it is somewhat below then 1,500 bits .
Fig c: Media Access Delay for 10 and 30 nodes
Wireless LAN Delay: fig d shows the delay for 30 and 10
nodes .for 10 nodes it is seen only as dots and for 3o nodes
its is highest at 0.006 bits.
enhance the capabilities of ad hoc routing protocols. As a
result, ad hoc networking has been receiving much
attention from the wireless research community. With
regards to overall performance TORA performed good .
The simulation study of this report consisted of routing
protocol OLSR deployed over MANET using FTP traffic
analysing their behaviour with respect to five parameters
i.e. delay, network load, throughput, media access delay.

.Fig d LAN Delay for 10 and 30 nodes
6. CONCLUSION
In this paper, performance of TORA is analysed using
OPNET modeler 14.5 . as shown above Throughput is
highest for 30 nodes whereas media acces delay is at its
highest value for 10 nodes. Finally when overall
performance is compared throughput is the main factor
because it is the actual rate of data received successfully by
nodes in comparison to the claimed bandwidth. Over the
past few years, new standards have been introduced to
REFERENCES
[1]. Md.Masud Parvez1, Shohana Chowdhury2,
S.M.Bulbul Ahammed3, A.K.M Fazlul Haque4,
Mohammed Nadir Bin Ali5 “Improved Comparative
Analysis of Mobile Ad-hoc Network” 1,2,3,4
Department of Electronics and Telecommunication
Engineering.
[2]. Tamilarasan-Santhamurthy “A Quantitative Study
and Comparison of AODV, OLSR and TORA Routing
Protocols in MANET” Department of Information
Technology, LITAM, Dullipala (village), Sattenpalli
(Mandal), Guntur, Andhra Pradesh, 522412, India

441
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[3]. Pankaj Palta, Sonia Goyal ” Comparison of OLSR and

TORA Routing Protocols Using OPNET Modeler
“Punjabi University Patiala.

[4]. Ashish Shrestha Firat Tekiner” On MANET Routing

Protocols for Mobility and Scalability” School of
Computing, Engineering and Physical Sciences,
University of Central Lancashire Preston, UK School
of Computing, Engineering and Physical Sciences,
University of Central Lancashire Preston, UK
ftekiner@uclan.ac.uk.

[5]. Gaganjeet Singh Aujla & Sandeep Singh Kang

“Simulation Based Comparative Analysis Of TORA,
OLSR And GRP For Email And Video Conferencing
Applications Over Manets ” Department of CSE,
Chandigarh Engineering College, Punjab, India.

[6]. P. Kuppusamy, K. Thirunavukkarsu and B. Kalavathi,

“A study and Comparison of OLSR, AODV and
TORA Routing Protocols in Ad hoc Networks”,
Proceedings of 3rd IEEE Conference on Electronics
Computer Technology (ICECT 2011), 8-10 April
2011.

442
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
COMPARISON ANALYSIS OF ZONE ROUTING
PROTOCOL BASED ON THE SIZE OF THE NETWORK
Rupinder kaur Abhinash Singla
Assistant Professor (CSE), Assistant Professor (CSE), Bhai
Bhai Gurdas College of Engg. & Gurdas College of Engg. &
Tech.,Sangrur, Punjab, India, Tech.,Sangrur, Punjab, India,
rupinder.walia84@gmail.c abhinash11@gmail.com
om
ABSTRACT
MANET is combination of wireless mobile nodes that
communicate with each other without any kind of
centralized control or any device or established
infrastructure. Therefore MANET routing is a critical task
to perform in dynamic network. Without any fixed
infrastructure, wireless mobile nodes dynamically establish
the network.. A mobile ad hoc networks (MANET) is
characterized by multihop wireless connectivity consisting
of independent nodes which move dynamically by
changing its network connectivity without the uses of any
pre-existent infrastructure. MANET offers such flexibility
which helps the network to form anywhere, at any time, as
long as two or more nodes are connected and communicate
with each other either directly when they are in radio range
or via intermediate mobile nodes. Routing is a significant
issue and challenge in ad hoc networks and many routing
protocols have been proposed like OLSR, AODV,
DSDV,DSR, ZRP, and TORA, LAR so far to improve the
routing performance and reliability[9] This research paper
provides the overview of ZRP by presenting its
functionality. The performance of ZRP (Zone Routing
Protocol) is analyzed on the basis of various parameters
using simulator OPNET 14.0.
Keywords: MANET, Routing Protocols, ZRP
1. INTRODUCTION
Ad-hoc networks are self-organizing wireless networks
composed of mobile nodes and requiring no fixed
infrastructure. The limitations on power consumption
imposed by portable wireless radios result in a node
transmission range that is typically small, relative to the
span of the network.
To provide communication throughout the entire network,
each node is also designed to Serve as a relay. The result is
a distributed multi -hop network with a time-varying
topology. Because ad-hoc networks do not rely on existing
infrastructure and are self-organizing, they can be rapidly
deployed to provide robust communication in a variety of
hostile environments. This makes ad-hoc networks very
appropriate for providing tactical communication for
military, law enforcement and emergency response efforts.
443
ISBN: 978-81-924893-0-8
Emanpreet kaur
Bhai Gurdas College of Engg. &
Tech.,Sangrur.Punjab
sra_gagandeep@yahoo.c
o.in
Ad-hoc networks can also play a role in civilian forums
such as electronic classrooms, convention centers and
construction sites. With such a broad scope of applications,
it is not difficult to envision ad-hoc networks operating
over a wide range of coverage areas, node densities and
node velocities. A mobile ad hoc network may consist of
only two nodes or hundred nodes or thousand nodes as
well. The entire collection of nodes is interconnected in
many different ways. As shown in Fig-1 there is more than
one path from one node to another node. To forward a data
packet from source to destination, every node in the hope
must be willing to participate in the process of delivering
the data packet. A single file is split it into a number of data
packets and then these data packets are transmitted through
the different paths. At the destination node, all these
packets are combined in sequence to generate the original
file.
Fig-1: Mobile Ad hoc Network
2. ROUTING IN MANET
Routing [3] is the process of transferring a packet from
source to its destination. In the routing process, a mobile
node will search for a path or route to communicate with
the other node in the network. Protocols are the set of rules
through which two or more devices communicate with each
other. In MANET, routing tables are used for routing
purpose. Routing tables contain the information of routes to
all the mobile nodes .The routing protocols in MANET are
broadly classified into three categories :
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 Proactive or Table Driven Routing Protocols.
 Reactive or On-Demand Routing Protocols.
 Hybrid Routing Protocols.
2.1. Proactive or Table Driven Routing Protocols
In proactive protocols, each node maintains individual
routing table containing routing information for every
node in the network. Each node maintains consistent and
current up-to-date routing information by sending control
messages periodically between the nodes which update
their routing tables. The proactive routing protocols use
link-state routing algorithms which frequently flood the
link information about its neighbors. The drawback of
proactive routing protocol is that all the nodes in the
network always maintain an updated table. Some of the
existing proactive routing protocols are DSDV and OLSR .
2.2. Reactive or On-demand Routing Protocols
In Reactive or On-Demand [1] Routing Protocols, routes
are not predefined. For packet transmission, a source node
calls for route discovery phase to determine the route. The
route discovery mechanism is based on flooding algorithm
which employs on technique that a node just broadcasts the
packet to all its neighbours and intermediate nodes
forwards the packets to their neighbours . Reactive
protocols are Dynamic Source Routing (DSR), Ad hoc On-
Demand Distance Vector (AODV), Temporally Ordered
Routing Algorithm (TORA).
2.3. Hybrid Routing Protocols
Hybrid Protocols [4] are the combination of both i.e.
Table-Driven and On-Demand protocols. These protocols
take the advantage of best features of both the above
mentioned protocols. These protocols exploit the
hierarchical network architecture and allow the nodes to
work together to form some sort of backbone, thus
increasing scalability and reducing route discovery . Nodes
within a particular geographical area are said to be within
the routing zone of the given node. For routing within this
zone, Proactive i.e. table-driven approach is used. For
444
ISBN: 978-81-924893-0-8
nodes that are located outside this zone, Reactive i.e. an on
demand approach is used. So in Hybrid Routing Protocols,
the route is established with proactive routes and uses
reactive flooding for new mobile nodes [2]. In Hybrid
Routing protocols, some of the characteristics of proactive
and some of the characteristics of reactive protocols are
combined, by maintaining intra-zone information
proactively and inter-zone information reactively, into one
to get better solution for mobile ad hoc.
3. ZONE ROUTING PROTOCOL
Zone Routing Protocol or ZRP was the first hybrid routing
protocol with both a proactive and a reactive routing
component. ZRP was first introduced by Haas in 1997.
ZRP is proposed to reduce the control overhead of
proactive routing protocols and decrease the latency caused
by routing discover in reactive routing protocols. ZRP
defines a zone around each node consisting of its k-
neighborhood (e. g. k=3). In ZRP, the distance and a node,
all nodes within hop distance from node belongs to the
routing zone of node. ZRP is formed by two sub-protocols,
a proactive routing protocol: Intra-zone Routing Protocol
(IARP), is used inside routing zones and a reactive routing
protocol: Inter-zone Routing Protocol (IERP), is used
between routing zones, respectively.
A route to a destination within the local zone can be
established from the proactively cached routing table of the
source by IARP, therefore, if the source and destination is
in the same zone, the packet can be delivered immediately.
For each node a routing zone is defined separately.
Within the routing zone, routes are available immediately
but for outside the zone, ZRP employs route discovery
procedure. For each node, a separate routing zone is
defined. The routing zones of neighboring nodes overlap
with each other’s zone. Each routing zone has a radius ρ
expressed in hops . The zone includes the nodes whose
distance from the source node is at most ρ hops. In Fig-2,
routing zone of radius 2 hops for node A is shown. Routing
zone includes nodes all the nodes except node L, because it
lies outside the routing zone node A. The routing zone is
not defined as physical distance, it is defined in hops. There
are two types of nodes for a routing zone in ZRP :
· Peripheral Nodes
· Interior Nodes
The nodes whose minimum distance to central node is
exactly equal to the zone radius ρ are Peripheral Nodes
while the nodes whose minimum distance is less than the
zone radius ρ are Interior Nodes. In Fig. 2, Peripheral nodes
are E, F, G, K, M and Interior Nodes are B, C, D, H, I, J.
The node L is outside the routing zone of node A.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

(a) Throughput [2]: Throughput is the average rate of

successful data packets received at the destination .It is the
measure of how fast we can actually send the packets
through the network. It is measured in bits per second
(bits/sec or bps)
or data packets per second.

(b) Load [4]: Load in the wireless LAN is the number of

packets sent to the network greater than the capacity of the
network. When the load is less than the capacity of the
network, the delay in packets is minimum. The delay
increases when the load reaches the network capacity.

(c) Delay [7]: The packet end-to-end delay refers to the

time taken for a packet to be transmitted across the network
from source to destination. In other words, it is the time a
data packet is received by the destination minus the time a
data packet is generated by the source. It is measured in
seconds. End. Lost packets due to delay have a negative
effect on received quality.

Fig-2: Routing Zone of Node A with Radius ρ=2 hop

5. RESULTS AND ANALYSIS
4. SIMULATION PARAMETERS 1. Load: From Fig-4 it is observed that load of ZRP is
50,000 bits per second with 20 nodes. Maximum load of
To analyse the performance of ZRP OPNET 14.0 simulator 182,000 bits per second is observed with 40 nodes.
is used. Scenario is created with 40 number of mobile
nodes. The pause time and traffic load are kept constant
under all the scenarios. Simulation parameters used for the
implementation of ZRP are listed in the Table 1.

Values
Parameters

OPNET 14.0
Simulator

ZRP
Protocol

600 sec
Simulation Time

800m *800 m
Simulation Area
Fig: 3 Load over 20 and 40 nodes in ZRP
11 Mbps
Data Rate
2. Throughput: It is observed from the Fig-4 that with 40
nodes the throughput of ZRP is about 3,550,000 bits per
40
Number of Nodes second in starting and 580,000 bits per second with 20
nodes.
1024000
Buffer Size

Table1:- Simulation Parameters

4.1 Performance Metrics

The following performance metrics are used to
analyze the simulated result:-

445
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig: 4 Throughput over 20 and 40 nodes in ZRP
3. Delay: From Fig-5, it is observed that delay of ZRP is
high at .0057 sec is observed with 40 nodes and .0033
second with 20 nodes.
Fig: 5 Delay over 20 and 40 nodes in ZRP
6. CONCLUSION
The Zone Routing Protocol (ZRP) provides a flexible
solution to the challenge of discovering and maintaining
routes .The ZRP combines two radically different methods
of routing into one protocol. Route discovery is based on a
reactive route request / route reply scheme. This querying
can be performed efficiently through the proactive
maintenance of a local routing zone topology. In this paper,
a performance analysis of ZRP routing protocols for mobile
Ad-hoc networks is presented with 20 and 40 nodes.
Performance of these routing protocol is evaluated with
respect to four performance metrics such as delay, load and
throughput .As observed from the results that when the
simulation starts no data is dropped till one minute also the
throughput is also less and throughput also increases till
the end of the simulation. The simulation study of this
report consisted of routing protocol ZRP deployed over
MANET using Voice Conferencing Application analysing
their behavior. So the results of zrp is pretty good.
446
ISBN: 978-81-924893-0-8
REFERENCES
[1] Nadia Qasim, Fatin Said, Hamid Aghvami, “Mobile Ad
Hoc Networks Simulations Using Routing Protocols for
Performance Comparisons”, Proc. of the World Congress
on Engineering, vol. 1, WCE 2008, July 2008.
[2] Kuncha Sahadevaiah, Oruganti Bala, Venkata
Ramanaiah, “An Empirical Examination of Routing
Protocols in Mobile Ad Hoc Networks”, Proc. Of
International Journal of Communications, Network and
System Sciences, June 2010.
[3] Hongbo Zhou, “A survey on Routing Protocols in
MANETs”, Proc. of Michigan State University, MSUCSE-
03-08, March 2003.
[4] Kavita Panday, Abishek Swaroop, “A Comprehensive
Performance Analysis of Proactive, Reactive and Hybrid
MANETs Routing Protocols”, Proc. Of International
Journal of Computer Sciences Issues, vol. 8, Issue 6, no. 3,
Nov 2011.
[5] Zygmunt J. Haas, “The Zone Routing Protocol (ZRP)
for Ad hoc Networks”, Internet Draft, July 2002.
[6] Parma Nand, Dr. S.C. Sharma, “Comparative study and
Performance Analysis of FSR, ZRP and AODV Routing
Protocols for MANET”, Proc. Of International Journal of
Computer Applications, 2011.
[7] Ashish K. Maurya, Dinesh Singh, “Simulation based
Performance Comparison of AODV, FSR and ZRP Routing
Protocols in MANET”, Proc. of Internationl Journal of
Computer Applications, vol.12, no.2, November 2010.
[8]. Zygmunt J Haas, Marc R. Pearlman, and Prince Samar,
"The Zone Routing Protocol (ZRP) for Ad Hoc Networks",
draftietf- manet-zone-zrp-04.txt,july,2002.
[9]. Hrituparna Paul1, Priyanka Sarkar2” a study and
comparison of olsr, aodv and zrp routing protocols in ad
hoc networks” ijret: international journal of research in
engineering and Technology eISSN: 2319-1163 | pISSN:
2321-7308.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The Performance Analysis of LMCS Network Model
Based on Propagation Environment Factors
Dr.Sarbjeet Kaur Dhillon
Malwa College ,Bathinda
Headit.mgmt@gmail.com
ABSTRACT
Broadband wireless access system such as Local Multipoint
Communications Services (LMCS) is aiming to provide
multimedia communication services to subscribers in fixed
locations via millimeter wave transmissions at 28 GHz. In
LMCS, the total allocated frequency band is reused in each
cell/sector through the use of highly directional antennas and
polarization reuse in adjacent sectors. Some of the key issues
in LMCS systems are the coverage and the co channel
interference. These problems have to be resolved before a
successful deployment of such services. In this paper, we
implement a techniques that is known to combat co-channel
Interference. This technique is power control. The objective of
this research is to analyze the system performance of LMCS
system using different scenarios. We will provide system
designers with the appropriate power control command rate
and power control step size. A computer simulation program
was developed and used to determine the system performance
of the LMCS network model. The investigated parameters
include the propagation exponent, lognormal deviation, Rician
K factor, correlation factor of fading channel.
Keywords-LMCS, frequency, Probability, Rician K
factor.
1. INTRODUCTION
The increasing demand for multimedia type, high bit rate
services motivated researchers to develop broadband wireless
access technologies. The delivered services are broadcasting
TV, video on demand, high speed internet access
etc…Broadband access systems will serve both residential
and business customers in fixed networks. One of the
promising broadband access technologies is the local
multipoint distribution services (LMDS) or local multipoint
communication systems (LMCS), which has been introduced
to deliver a wide variety of broadband services. This wire line
technology is competing against wireless broadband systems
such as Fiber-to-the-home (FTTH), hybrid-fiber-coax (HFC),
and Asynchronous Digital Subscriber Loop (ADSL) on
copper wires [6].
Recently local Multipoint Communication System (LMCS) or
local Multipoint Distribution System (LMDS) has been
proposed in Canada and the United states for wireless access
447
ISBN: 978-81-924893-0-8
Ms..Gurjit Kaur
Malwa College ,Bathinda
Gurjeet907@gmail.com
to broadband services. LMCS is a broadband wireless access
technology that is intended to provide broadband services to
fixed subscribers in small cells. LMCS systems are designed
to have cellular layout. They attempt to completely reuse the
frequency band in each cell through the use of highly
directional subscriber antenna and polarization reuse in
adjacent cells, so that the interference from co-channel
subscribers in adjacent cells can be significantly reduced.
1.1 DERIVATION OF LMCS
The acronym LMDS or LMCS is derived from the following:
L (local) denotes that propagation characteristics of signal in
this frequency range limit the potential coverage area of a
single cell site; ongoing field trials conducted in Metropolitan
centers place the range of an LMDS transmitter at up to 5
miles. M (multipoint) indicates that signals are transmitted in
a point-to-multipoint or broadcast method; the wireless return
path, from subscriber to the base station, is a point-to-point
transmission (distribution) or C (communication) refers to
the distribution of signals, which may consist of simultaneous
voice, data, Internet and video traffic. S (service) implies the
subscriber nature of the relationship between the operator and
the customer; the service offered through an LMDS network
is entirely dependent on the operator’s choice of business.
1.2 ADVANTAGES OF LMCS OVER HFC
& PONS
The advantages of the LMCS over the competitive access
technologies such as Hybrid Fiber Coax (HFC) and Passive
Optical Networks (PONs) are as follows
 Low entry and deployment cost
 Ease and speed of deployment: deployment of cable and
fiber systems is difficult in certain areas where installing in-
ground infrastructure is undesirable. LMCS can provide
similar access bandwidths and a two way capability without
trenching streets and yards.
 Faster realization of revenues as a result of rapid
deployment.
 Quick response to growing market.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

1.3 APPLICATIONS AND SERVICE 1.5. CELL ARCHITECTURE

PERFORMANCE The LMCS system is designed to have a cellular architecture
1. Video on demand application and attempts to reuse the total allocated frequency in each
2. Broadband Internet access sector. This essentially means that frequency will be reused 4
3. Interactive multimedia times in each cell. The transmitter site should be on top of a
4. Home office tall building or on a high pole overlooking the service area. A
5. Distance education typical configuration is a four-sector cell site using 90-degree
6. Voice and Video Telephony beam width antennas to provide service to the subscribers.
7. Entertainment TV Each of these sectorized antennas can support the full
8. Interactive video games bandwidth of the allocated spectrum. The isolation between
9. Home shopping adjacent sectors can be maximized through the use of antenna
The required service performance for LMCS can be polarization as shown in Fig 1.2. The use of repeaters to
summarized as follows [7]:
extend coverage was studied in [12] and provides an
Call set up < 10 sec.
Isochronous cell loss rate <10-3, asynchronous cell loss rate improvement of 6% coverage with macro diversity
<10-4. The maximum cell size for the service area is related to the
Maximum delay < 50 ms. desired system availability obtained from the link budget. Cell
1.4. FREQUENCY BAND AND size can vary due to the type of antenna, its height, and signal
SPECTRUM ALLOCATION loss. Operation in the millimeter range imposes some
restrictions. Precipitation effects lead to severe attenuation
Regulatory agencies such as the U.S. Federal and limit the reliable range of operation to 3-5 km depending
Communications Commission (FCC) are authorizing point-to- on the climatic zone and the frequency of operation
multipoint radio systems to operate over a block of spectrum
and throughout a large geographical area.FCC have proposed
two separate licenses, one license for a bandwidth of 1150
MHz, which includes the spectrum from 27.5 to 28.35 GHz,
29.1 to 29.25 GHz and 31.075 to 31.225 GHz. This spectrum
is referred as Block A. The second license, referred as Block
B, includes the spectrum from 31 to 31.075 GHz and 31.225
to 31.3 GHz, a total of 150 MHz [5]. Industry Canada granted
two blocks of 500 MHz in the 27.35 to 28.35 GHz ranges.
Additional spectrum from 25.35 to 27.35 GHz has been
designated for LMCS future use. Frequency bands in US is
shown in Fig.1.1Licensing and deployment in Europe now
indicate that there will be systems in different frequency
bands from 24 GHz up to 43.5GHz. The frequency band 24.5-
26.6 GHz with sub-bands of 56 MHz has been opened for
point-to-multipoint applications in many European countries.
These bands may then be used for Figure 1.2 LMCS Cell Layout
LMDS.
2 FACTORS AFFECTING SYSTEM
PERFORMANCE
The performance of a LMCS system is affected by many
factors such as propagation environment. Sectoring. Antenna
design and power control. These factors how each factor is
investigated in this work.

2.1 PROPAGATION IMPAIRMENTS

The propagation environment at millimeter wave frequencies
is one of the major challenges in delivering LMCS services to
fixed subscribers. At such high frequencies the signal is
attenuated by the obstacles in the radio path between the
subscriber and the hub, such as buildings, trees and vehicles.
Measurement study for LMCS at 28 GHz, in Ottawa shows
that foliage cause signal attenuation of more than 20 dB in
some locations. Rain and snow could cause more signal loss
[11]. This makes it necessary to provide a line-of-sight path
from the hub to subscriber for maintaining sufficient signal
strength. In [30] it was shown that even when line-of-sight
paths are available, excess loss due to rain attenuation must be
Figure 1.1 LMCS/LMDS band Allocation in USA

448
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
accounted for in the link budget. The requirement of line-of-
sight for reliable communication at these frequencies is
presenting a big challenge for system designers who try to
maximize coverage at minimum cost.
2.2 EQUALIZATION
Inter symbol interference (ISI) caused by multipath in band
limited (frequency selective) time dispersive channels distorts
the transmitted signal, causing bit errors at the receiver. ISI
has been recognized as the major obstacle to high speed data
transmissions over radio channels. Equalization compensates
for intersymbol interference [18]. Decision feedback
equalization (DFE) has been evaluated in [10] for various data
rates based on the multipath spread present in the measured
impulse response data from residential area in Ottawa. The
study showed that for data rates of 10 mega symbols per
second (Msps) using QPSK modulation and with narrow
beam width directional antenna at the subscriber, it is possible
to avoid equalizer techniques.
2.3 ERROR CONTROL CODING
Error control coding techniques rely on the systematic
addition of redundant symbols to the transmitted information
to facilitate two basic objectives at the receiver, which are
error detection and error correction. The redundant bits lower
the raw data rate through the channel. Hence, the spectral
efficiency is reduced. The study in [11] shows the Reed
Solomon code and the convolution code performance based
on the temporal variation of the narrow band LMCS channel
studies. The parameters for RS codes are length of code word
n=255 symbols, packet length=53 bytes (1 ATM cell) and
error correction capability t= 0 to 10. The probability of
symbol error as function of link margin for QPSK modulation
is shown in Fig. 1.3(a). Convolution coding is very popular
because of its simplicity in terms of hardware implementation.
Figure 1.3(a)[11]
449
ISBN: 978-81-924893-0-8
2.4 INTERLEAVING
Interleaving is a form of time diversity that is employed to
disperse bursts of errors in time. A sequence of data symbols
is interleaved before transmission over a bursty channel. If
errors occur during transmission, restoring the original
sequence to its original ordering has the effect of spreading
the error over time. By spreading the data symbols over time,
it is possible to use channel coding which protects the data
symbols from corruption by channel. The interleaving
techniques can be divided into two categories:
1. Block Interleaving
2. Convolution Interleaving
The interleaved performance depends on memory required for
data storage and the delay in interleaving and de-interleaving,
which should be kept as small as possible. The performance
of both interleaves’ was evaluated in [11] using the following
parameters with RS codes.
1. Interleaving length = 3000/t Where t is the error correcting
capability (t=2).
2. Data rate = 40 Mb/s.
The delay with convolution inter-leaver is 40 ms and using
block inter-leaver is 80 ms. Efficiency can be defined as the
ratio of the length of the smallest burst of errors that can cause
the errors correcting capability of the code to be exceeded to
the number of memory element used in the inter-leaver. An
efficiency of 14.2% for block inter-leaver and 64% for
convolution inter-leaver has been shown in [11].
3.1 PROPAGATION IN A MOBILE
COMMUNICATION ENVIRONMENT
In a mobile radio environment the propagation phenomena
can be characterized using different propagation models.
These models can be divided into two groups, namely
theoretical and empirical models. Modeling the radio channel
has been one of the most difficult parts of mobile
communication systems design. Thus the stochastic behavior
of the mobile radio signal
may be described by means of statistical distributions. Three
distributions are closely related to the mobile radio channel
statistics: lognormal, Rayleigh and Rician. The lognormal
distribution describes the envelope of the received signal
power shadowed by obstructions such as buildings and hills.
The Rayleigh distribution describes the envelope of the
received signal resulting from multipath propagation. The
Rician distribution considers the envelope of the received
signal with multipath propagation plus a line-of sight
component. Propagation models are required to quantify two
variables:
- 1 Average signal strength at any distance from the
transmitter.
- 2 Signal variability which characterizes the fading nature of
the channel.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3.1.1 PROPAGATION PATH LOSS
Path Loss can be defined as the difference between the
transmitted power and the received power. An exact estimate
of the path loss in mobile communications is not available.
There are many path loss models but we will discuss only the
free space path loss model. In the free space model, the ratio
between the received power Pr and the transmitted power Pt is
given by the Friis free-space transmission formula as follows
[18]
where d is the distance, Gt and Gr are the transmitter and
receiver gains respectively, and λ is the wavelength.
Accordingly, the path loss (in decibels) is
L(dB) = -10 Log Gt –10 Log Gr + 20 Log(4πd) – 20 Log(λ)
(3.2)
Assuming unity antenna gains Gt and Gr , the path loss in dB
is given b L(dB) = 20 Log(4πd) – 20 Log(c/f) (3.3)
Where f is the frequency in hertz, d is the distance in m and c
is the speed of light ( 3 X 108m/s).
A large-scale propagation model use a close-in distance do,
as a known receiver power reference point. The received
power at any distance d (d > do), may be related to the
received power at distance do. Thus received power can be
given for free space model by
The reference distance do must be chosen such that it lies in
the far-field region (i.e. do >df ) .
Df = 2D2 /λ
λ where D is the largest dimension of the antenna aperture
3.1.2 RAYLEIGH FADING
It is well known that the envelope of the sum of two
quadrature Gaussian noise signals obeys a Rayleigh
distribution. The Rayleigh distribution has the following
probability density function (pdf) [18]
Where is the rms value of the received signal power
before envelope detection, 2 is the variance of the received
signal, and r2 is the instantaneous power. Rayleigh fading
usually applies to scenario where there is no LOS path
between the transmitter and the receiver. The corresponding
cumulative distribution function (CDF) is given by
The mean value of r,
450
ISBN: 978-81-924893-0-8
3.1.3 RICIAN FADING
The Rayleigh fading holds only in the case where there is no
LOS path. However, when there is a dominant signal
component such as line of sight propagation path; the small
scale fading envelope is Rician. As the dominant signal
component becomes weaker, the composite signal envelope
becomes Rayleigh fading. The Rician distribution is given by
Where A denotes the LOS dominant signal component and I0
is the modified Bessel function of the first kind and zero-
order. The Rician distribution is often described in terms of
the K factor ratio, which is defined as the ratio between the
dominant signal component and the scattered power. It is
given by
It is obvious that when A goes to zero (i.e. the dominant path
signal component fades away) the K will go to zero and the
Rician distribution degenerates to the Rayleigh distribution.
4. SIMULATION MODEL
Observations from [8] and [30] indicate that strong signals are
received only at locations where a LOS path was available
between the transmitter and receiver. Both studies concluded
that a LOS path is required to provide reliable LMCS service.
Line of sight (LOS) system performance will be investigated
through simulations. LMCS systems attempt to reuse the
allocated frequency band in each cell by means of directional
Antennas and polarization reuse in adjacent sectors. Perfect
orthogonal polarization is assumed which means perfect
isolation between horizontal and vertical polarization.
4.1 SYSTEM MODEL
The LMCS simulation model is designed to have a cellular
layout with frequency reuse factor of 4 (i.e. total frequency
band is reused in each of 4 sectors). We assume that 9 cells
with square grid cover the service area; each hub consists of 4
sectors. Highly directional subscriber antennas and perfect
orthogonal polarization are used to reduce the co channel
interference and to provide high coverage. As we can see
from Figure 4.1, V and H refer to vertical and horizontal
frequency polarization, respectively. Therefore, two of the
sectors in each cell will have horizontal polarization and the
other two sectors will have vertical polarization. Cells are
assumed to be square and the base station of each cell is
located at the center of the cell. The cell radius is 2 2 km; i.e.
the distance between base stations is 4 km. This gives a total
coverage area of 144 km2. Subscribers will be uniformly
distributed in each sector of the cell. For every subscriber
signal received at the base station, there will be up to 17
interferers.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4.1.2 PROPAGATION MODEL Step 2: Simulation over an observation period for specific
A transmitted signal in radio channel is subjected to a user
propagation path loss directly proportional to the propagation 1For each user, after a warming up period, set up Rician
exponent, shadowing and multipath fading. The effect of fading channel link between the fixed subscriber and the
propagation environment parameters such as Rician K factor, chosen base station. We generate samples of faded signal that
propagation exponent and shadowing standard deviation on is correlated in time. Then, the system is frozen (i.e. we have
system availability will be studied. Based on propagation one snapshot per time). A snapshot represents an interval of
studies in the LMCS project, simple but realistic assumptions time short enough that the channel’s path loss can be
are made. considered constant.
2 Measure the received SINR at the base station, compare it
with the preset outer loop threshold (th ) and generate
up/down power control commands. Note that all subscribers
are synchronized together, that is, perform the measurements
and the power updates at the same time.
3 bound (-10 dBw) set it to –10 dBw. On the other hand, if it
goes below the lower bound (-50 dBw) then set the updated
transmitter value to –50 dBw. In the case of higher
PC/snapshot rate, for example 10, we execute 10 power
commands in one snapshot.
4 Collect a preset number of fading samples. In order to avoid
the border effect, we collect data only for the subscriber in the
central cell.
5 Calculate the outage probability for the desired user, defined
as the fraction of received SINR samples for that user less
than the threshold. The system threshold in our simulation is
varied from 8 to 12 dB.
5. SIMULATION ALGORITHM
the framework of the simulation program is given below: Step 3: Repeat the simulation cycle
Step 0: Set up system parameters 1 Go to step 1 unless number of cycles (subscribers) exceeds
1 Set up system parameters such as cell radius, preset value chosen as 1000 cycles.
uplink/downlink channel 2 Calculate the system availability, which is the fraction of
bandwidth, and antenna gains and beam width. desired subscriber positions having less than 1 % outage.
2 Set up the environment parameters such as propagation
exponent for the desired subscriber and interferer, the Rician
6. ISSUES TO BE SIMULATED
K factor for intracell users and intracell user, lognormal
shadowing mean and standard deviation values and the
correlation factor .
3 Set up the power control parameters such as SINR outer
loop threshold, and number of samples per location, dynamic
range, PC step size and number of cycles (i.e. number of
subscribers).
4 Set up the system threshold for the outage probability
calculation for the subscriber of interest.
Step 1: Initialization
1Randomly generate users with uniform distribution within
each sector, one user per sector. This represents desired and
interfering users on a
given frequency channel, and assumes that this channel is
occupied in all cells at all times.
2Set an initial transmitted power for each user, all users will
start simulation with PT = - 20 dBw. In fact, it doesn’t matter
to which value we set the initial transmitted power since we
will wait till system reaches steady state before collecting
data.
3 For each user, set up an independent lognormal distributed
shadowing. Each subscriber is assigned to the base station
with the best SINR (i.e.Macro diversity).
Table 1

451
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
7. SIMULATION RESULTS
The effect of power command rate and step size
Figure 7.1 (a) The effect of power command rate and step
size on system availability, with nd =2, ni= 4, correlation
factor =0.9, i K =4, d K =10, dynamic range= 40dBw.
8. CONCLUSION
The simulation results shows the propagation environment
effects the LMCS/LMDS system availability. Transmitter
power control and macro diversity techniques have been
implemented in this study. The LMCS/LMDS system
availability is affected by the setting of the power control
parameters such as the power control update rate, step size,
transmitted dynamic range and the outer loop threshold. In
this thesis, we also studied the effect of propagation
parameters on system availability, some of these parameters
such as path loss exponent, standard deviation of lognormal
shadowing, Rican K factor and the correlation factor between
fading samples.
REFERENCES
[1] S. Ariyavisitakul, Dec. 1992 SIR-Based Power Control
in a CDMA System, IEEE GLOBECOM, Orlando
[2] S. Ariyavisitakul and L. F. Chang, ,Nov. pp 1993 Signal
and interference statistics of a CDMA system with
power control, IEEE Transactions on
Communications,
[3] Chung-Ju Chang, Jeh-Ho Lee, and Fang-Ching. Ren
August 1996 Design of Power Control Mechanisms with
PCM Realization for the Uplink of a DS-CDMA Cellular
452
ISBN: 978-81-924893-0-8
MobileRadio System,
.
[4] Michele Zorzi, 2, May 1996 Power Control and
Diversity in Mobile Radio Cellular Systems in the
Presence of Ricean Fading and Log-Normal Shadowing.
[5] Douglas A. Gary, “A Broadband Wireless Access
System at 28 GHz,” 1997 Wireless Communications
Conference, Aug11-13,1997
[6] Scott Seidel and Hamilton W. Arnold, “28 GHz Local
Multipoint Distribution Service (LMDS): Strengths and
Challenges,” Virginia Tech. Symposiums, June 1995.
[7] D.Falconer and G. Stamatelos, “LMCS system
architecture and associated research issues,” CITR
Internal document, Dec. 9,1997.
[8] Scott Seidel and Hamilton W. Arnold, “Propagation
Measurement at 28 GHz to investigate the performance
of LMDS”, IEEE GLOBECOM, Nov 1995.
[9] Salina Q Gong, “Outage Performance with Directional
Antennas in Cellular Fixed Broadband Wireless Access
Systems”, M. Eng. thesis, Carleton University, 1998.
[10] Ranjiv S. Saini, “Equalization Requirements and
Solutions for Fixed Broadband Wireless Access
Systems”, M. Eng. thesis, Carleton University, 1998.
[11] Nausheen Naz and D. D. Falconer,, “Temporal
Variation Characterization for fixed wireless at 29.5
GHz ”, IEEE VTC 2000, Tokyo, May 2000
[12] J-P DeCruyenaere, “Propagation Simulation for the
Prediction of LMCS/LMDS Coverage”, ANTEM’98,
OTTAWA, Aug 1998.
[13] Peter B. Papazian et al, “Study of the Local Multipoint
Distribution Service Radio Channel”, IEEE
Transactions on Broadcasting, Vol. 43, No. 2, June
1997.
[14] Vincentzio I. Roman, “Frequency Reuse and System
Deployment in Local Multipoint Distribution Service”,
IEEE Personal Communications, Dec. 1999.
[15] Douglas A. Gray, “Optimal Hub Deployment for 28
GHz LMDS System”, Proc. 1997 Wireless
Communications Conference, Aug.1997
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Performance Evaluation of Delay Tolerant Network
Routing Protocols
Vijay Kumar Samyal Sukvinder Singh Bamber
Punjab Technical University Department of CSE
Jalandhar, Punjab, India Panjab University SSG
Regional Centre, Hoshiarpur,
samyal.mimit@gmail.com Punjab, India
ABSTRACT
The performance analysis of different Delay Tolerant
Networks (DTNs) routing mechanisms plays a key role in
understanding the design of DTNs. It gives the capacity to
describe the conduct and execution of routing protocols,
which encourages one to choose proper routing protocol for
the application or the system under control. DTNs routing
protocols have differ in the knowledge that they use in making
routing decision and the number of replication they make. The
performance of different DTNs routing protocols (i.e., Direct
Delivery, First Contact, Epidemic, Spray and Wait, Prophet
and MaxProp) are compared under the various mobility
models like Random Waypoint (RWP) model, Map-Based
Mobility (MBM) Model, the Shortest Path Map-Based
Movement (SPMBM) model and Random Walk (RW) model.
Among these protocols, the first four routing protocols do not
require any knowledge about the network. The latter two
protocols use some extra information to make decisions on
forwarding.
General Terms
Performance, Experimentation
Keywords
Delay Tolerant Networks (DTNs), Routing Protocols,
Mobility Models, Opportunistic Network Environment (ONE)
1. INTRODUCTION
A Delay Tolerant Networks (DTNs) is a sparse dynamic
wireless network where mobile nodes work on ad hoc mode
and forward data opportunistically upon contacts [1]. Since
the DTN is sparse and nodes in the network are dynamic, the
irregular connectivity makes it difficult to assurance an end-
to-end path between any nodes pair to transfer data and long
round trip delays make it impossible to provide timely
acknowledgements and retransmissions. The communication
of nodes can only be made possible when they are in the
communication range of each other. When a node has a copy
of message, it will store the message and carry it until
forwarding the message to a node in the communication range
which is more appropriate for the message delivery. Since
DTNs allow people to communicate without network
infrastructure, they are widely used in battlefield, wildlife
tracking, and vehicular communication etc. where setting up
network infrastructure is almost impossible and costly [2]. In
recent years, with the propagation of social network
applications and mobile devices, people tend to share texts,
photos and videos with others via mobile devices in DTNs.
Figure 1 shows a sample DTN. It depicts the
network topology snapshots over three different time periods
453
ISBN: 978-81-924893-0-8
Nirmal Singh
Punjab Institute of Technology
Hoshiarpur
Punjab, India
t1, t2 and t3 (t1 < t2 < t3). Node mobility leads to several
pairs of nodes moving into communication range (e.g., node
A and B cannot communicate at t1, but they run into
communication range at t2) or moving out of communication
range (e.g., node C and D are in communication range at t1
and t2, but they become unreachable at t3).
Therefore, the stable end-to-end path does not exist
between any couple of nodes. The communications between a
pair of nodes are often disrupted due to unstable connections.
Besides, if a node wants to send a message to another node, it
may suffer from large delay. This is because the data
transmission between any pair of nodes requires being in the
communication range. However, DTN does not guarantee that
two nodes are in communication range permanently. It may
take a long time period for two nodes to move into
communication range. Thus the communication delay
between two nodes is longer than wired networks. For
instance, if source node A needs to send a message to
destination node E in the sample DTN (Figure 1.), it can only
deliver the data to node E at t3 when they are in
communication range at this time period.
In this study we have analyzed the performance of
different DTN routing protocols (Direct Delivery, First
Contact, Epidemic, Spray and Wait, Prophet and MaxProp) in
different mobility models. These protocols were analyzed on
three different metrics namely Delivery Probability, Average
Delivery Latency, Overhead Ratio. The detailed simulation
setup and metrics is given in section 3. The remainder of
paper is organized as follows: section 2 briefly gives the
introduction of the DTN routing protocols. Section 4 gives the
details of simulator and section 5 gives the simulation setup
used to carry out the work. Section 6 discusses the results.
Section 7 concludes the paper and lists the directions for
future work.
2. ROUTING PROTOCOLS IN DTN
In DTN, the main characteristic of packet delivery is large
end-to-end path latency and a DTN routing protocols has to
cope with frequent disconnections. Numerous routing and
forwarding techniques have been proposed over the past few
years (refer [3] and [4] for overview). Majority of forwarding
and routing techniques uses asynchronous message passing
(also referred to as store-carry-forward) scheme.
T. Spyropoulos et al. [5] & A. Keränen et al. [6]
implemented Direct Delivery & First Contact single-copy
DTN routing protocols: only one copy of each message exists
in the network at each moment. In Direct Delivery (DD), the
message is kept in the source until it comes in contact with the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
t1 t2
A F
B A
B D
C C
E
D E
Figure 1. A solid line represents connectivity between two nodes
destination. In First Contact, the message is delivered to the
first node encountered and deleted, being forwarded until it
reaches the destination.
A. Vahdat and D. Becker [7] worked on Epidemic
routing; an unlimited-copy routing protocol or flooding-based
in nature its tries to send each message to all nodes in the
network. In this router when two nodes encounter, they
exchange only the message they do not have in their memory
buffer. Overhead gets high due to more utilization of buffer
space but delivery probability gives good value.
J. Burgess et al. [2] presented Spray and Wait; an n-
copy routing protocol with two phases of spray and wait
routing protocol: the spray phase and wait phase. In the spray
phase when new message is created at the source node, n
copies of that message are initially spread by the source and
possibly received by other nodes. In wait phase, every node
containing a copy of message and simply holds that particular
message until the destination is encountered directly. There
are two versions of Spray and Wait: normal mode, a node
gives one copy of the message to each node encountered that
does not have same copy. In Spray and Wait Binary mode
(SaWBinary), half of the n copies to the first node
encountered and that node transmits half of the copies to the
one it encounters first this process is continue until one copy
is left with the node.
A. Lindgren et al. [8] proposed Prophet
(Probabilistic routing protocol using history of encounters and
Transitivity); an unlimited-copy routing protocol or flooding-
based in nature. It estimates probabilistic metric called
delivery predictability. This routing protocol based on the
probability of node‟s contact with another node. The message
is delivered to another node if the other node has a better
probability of delivering it to the destination.
T. Spyropoulos et al. [9] developed MaxProp an
unlimited-copy routing protocol. When all node are in
communication range it transfer all the messages not held by
other node. The protocol puts priority order on the queue of
messages. Message that should be dropped and those that
need to be transmitted are then classified in this priority
queue. The priority includes the ratio of successful path
establishments to nodes or the number of acknowledgements.
These methods increase the message delivery ratio.
3. PERROMANCE METRICS
This section characterizes the measurements that are regarded
in this study to look at and assess the performance of different
DTN routing protocols. The DTNs routing protocol need to
454
ISBN: 978-81-924893-0-8
t3
C E
F
B
A
F D
tolerate delays resulting from the tested environment and the
main requirement of such protocols is that the messages are
reliably delivered. Hence, performance metrics for evaluating
the performance of DTN protocols are delivery probability
and delivery latency. Overhead in transmission of the
messages results in additional energy consumption. As the
mobile nodes in DTNs are energy constrained, the overhead is
considered as another important metric. In this study, the
performances of various DTN protocols are evaluated based
on the metrics like delivery ratio, average delivery latency and
overhead ratio under different scenarios. Besides these
metrics, the buffer utilization is observed and the impact of
buffer size on performance is also examined. These metrics
are defined as follows:
 Delivery probability: It is defined as the ratio of the
number of messages actually delivered to the
destination and the number of messages sent by the
sender.
 Average delivery latency: It is defined as the average
of time taken by all messages to reach from source to
destination.
 Overhead ratio: It is defined as the ratio of difference
between the total number of relayed messages and the
total numbers of delivered messages to the total number
of delivered messages.
4. THE ONE SIMULATOR
The majority of researcher use simulator which easily allow for
a large number of reproducible environment-conditions.
Simulation plays an important role in analyzing the behavior of
DTN routing protocols. There are various simulators available
like NS-2 (Network Simulator, 2000), DTNSim (Delay Tolerant
Network Simulator), OMNet++, OPNET and The ONE. The
ONE is preferred among the simulators because the NS-2
simulator lacks full DTN support. It only supports Epidemic
routing whereas DTNSim lacks in movement models. OPNET
and OMNet++ are tailored to specific research needs and hence
have fairly limited support for available DTN routing protocols.
The ONE simulator is a discrete event based simulator. It is a
java-based tool which provides DTN protocol simulation
capabilities in a single framework. A detailed description of The
ONE simulator is available in [10] and ONE simulator project
page [11] where source code is also available. The overview of
ONE simulator [11] with its elements and their interaction are
shown in Figure 2.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure 2. Overview of the One Simulator Environment [11]

5. SIMULATION SETTING 6.1 Effects of Mobility Models

Simulation scenarios are created by defining simulated nodes DTN protocols influence node mobility as a means of
and their characteristics. The simulation parameters are set as message delivery and thus the performance mainly depends
mentioned in Table 1. The simulation is modeled as a network on the encounter pattern. When the network is sparse the node
of mobile nodes positioned randomly within an area (4500 x mobility is an important factor. Node mobility is characterized
3400 m2). The transmission range for each node is set as 250 by structure of mobility and node speed. In the performance
m with a chosen transmission speed of 2 Mbps. The evaluation, the node speed is kept constant and only structure
simulation length is 720 minutes. An event generator of mobility is changed through standard mobility models. The
generates messages of size 500 KB with one new message performance of different routing protocols are compared
created at an interval of every 10-15 s. under the various mobility models like Random Waypoint
(RWP) model, Map-Based Mobility (MBM) Model, the
Table 1. Simulation parameter setting Shortest Path Map-Based Movement (SPMBM) model and
Random Walk (RW) model. While nodes move randomly to a
Parameters Values random destination in RWP model whereas MBM constrains
node movement to predefined paths and routes are derived
Number of Nodes 50 from real map data. The SPMBM uses the same map based
data as in MBM but instead of moving randomly, it calculates
Transmit Range(m) 250 the shortest path from source to a random destination using
Dijikstra‟s shortest path algorithm and follows the shortest
Transmit speed (Mbps) 2 path. The mobility models differ in the pair-wise inter-contact
time due to their behavior. For simplicity it is assumed that all
Node Speed (km/hr) 10-50 nodes follow uniform mobility model. Figures 3 to 5 depict
the effects of mobility models on delivery ratio, average
TTL of message (min) 120 delivery latency and overhead ratio respectively.

Buffer size infinite

Movement Model Random Waypoint Model

Simulation Time(min) 720

6. RESULTS
The effects of variation in mobility models on the
performance of different routing protocols like Epidemic,
Spray and Wait, Direct Delivery, First Contact, Prophet and
MaxProp protocols are evaluated. The results of performance
metrics are presented in the form of graph.

455
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 3. Delivery probability vs. mobility models
It is perceived from the results as in Figure 4 that
the mobility models have substantial impact on the delivery
ratio of routing protocols. The protocols studied so far are not
suitable for Random Walk model. So the Random Walk
model is not preferred for further discussion. MaxProp routing
is the only protocol which performs equally well in all kinds
of mobility models. Though Spray and Wait, Epidemic and
Prophet performs equally well in SPMBM and RWP models,
they experience a slight degradation of 12% in delivery ratio
in MBM model.
Figure 4. Average delivery latency vs. mobility models
Figure 5. Overhead ratio vs. mobility models
It is concluded from the results shown in graph of Figure 4
that all routing protocols, have the less delivery latency when
the nodes follow SPMBM model. This is due to the fact that
in SPMBM model, the nodes use shortest path to reach the
destination. The results depict that among all routing
protocols, the Spray and Wait and MaxProp routing have least
delivery latency when nodes follow SPMBM and RWP model
due to their individual characteristics. It is inferred from graph
plotted in Figure 5 that only Spray and Wait has least
overhead among all the routing protocols. As mentioned
earlier, it is due to the fact that Spray and Wait routing
restricts the number of replication of the messages which does
not differ with the structure of mobility.
7. CONCLUSION
The paper concludes that the impact of mobility models on
different DTN routing protocols. It is inferred from the above
results that Spray and Wait, Epidemic and Prophet performs
equally well in SPMBM and RWP models, they experience a
slight degradation of 12% in delivery ratio in MBM model. In
456
ISBN: 978-81-924893-0-8
case of delivery latency, SPMBM mobility model have less
delivery latency among all routing protocols because the node
use shortest path to reach destination. In case of overhead,
Spray and Wait protocol have least overhead among all the
routing protocols. In future we investigate the effect of
simulation time transmission range and impact of buffer size
on different DTN routing protocols.
REFERENCES
[1] Fall, K., 2003, “A Delay-Tolerant Network Architecture
for Challenged Internets,” Proc. On Applications,
Technologies, Architectures and Protocols for Computer
Communications (SIGCOMM), New York, USA, pp.
27–34.
[2] Burgess, J., Gallagher, B., Jensen, D., and Levine, B.,
2006, “Maxprop: Routing for Vehicle-Based Disruption-
Tolerant Networks,” Proc. 25th IEEE International
Conference on Computer Communications, Barcelona,
Spain, pp. 1–11.
[3] Z. Zhang, 2006 “routing in intermittently connected
mobile ad hoc networks and delay tolerant networks:
Overview and challenges,” IEEE Communication
Surveys and Tutorials 8,vol. 4, pp. 24-37
[4] L. Pelusi, A. Passarella, and M. conti, 2006,
“opportunistic networking: Data forwarding in
disconnected mobile ad hoc networks,” IEEE Comm.
Magazine.
[5] Spyropoulos T., Psounis K., and Raghavendra C. S.,
2004 “Single-copy routing in intermittently connected
mobile networks,” Proc. 1st Annual IEEE
Communications Society Conference on Sensor and Ad
Hoc Communications and Networks, IEEE SECON-„04‟.
[6] Keränen A., et al., 2009, “The ONE Simulator for DTN
Protocol Evaluation,” Proc. 2nd International
Conference on Simulation Tools and Techniques
(Simutools'09), Belgium.
[7] Vahdat A., Becker D., 2000, “Epidemic Routing for
Partially Connected Ad Hoc Networks,” Technical
ReportCS-200006, Duke University.
[8] Lindgren A., et al., 2003, “Probabilistic Routing in
Intermittently Connected Networks,” Proc. SIGMOBILE
Mob. Comput. Commun. Rev. 7, 3. pp. 19-20.
[9] Spyropoulos T., Psounis K., and Raghavendra C. S.,
2005 “Spray and Wait: An Efficient Routing Scheme
for Intermittently Connected Mobile Networks,” Proc.
ACM SIGCOMM workshop on Delay-Tolerant
Networking (WDTN ‟05) ACM, New York, NY, USA,
pp.252-259.
[10] Ker¨anen, A., 2008 “opportunistic network environment
simulator. Special assignment report, helsinki university
of technology,” Department of Communications and
Networking, May 2008.
[11] Tkk/Comnet. Project page of the ONE simulator.
[Online]. Available: http://www.netlab.tkk.fi/tutkimus/
dtn/theone, 2009.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Road Traffic Control System in Cloud Computing: A
Review
Kapil Kumar
Department of Computer Science and
Engineering
Guru Nanak Dev University Regional Campus
Jalandhar, INDIA
er_kapilkumar@yahoo.com
ABSTRACT
Road traffic on public roads around the world is a vital
problem and is seemly a major pretend to conclusion
makers. Urban region have a great stack of traffic crushes.
Many superimposed concepts of road traffic Gas lit,
Wireless sensor networks have appeared in the past few
years. The living methods for traffic management are not
effective. At that place require for a hefty and scalable
high-execution computing. Cloud computing is turning a
good engineering to provide a potent and scalable
computing at low cost. Therefore Sensor-Cloud is seemly
popular in recent years. This paper attempts to review these
concepts and discusses their ending alignment with other
phase of networks like Sensor-cloud network. The key
obstructions to the successful acceptance of Sensor-could
have been distinguished and directions for the existing and
finally the conclusion have been discussed.
Keywords
Cloud Computing, Sensor-cloud Network, Gas Lit, Wireless
Sensor Network, Virtualization
1. INTRODUCTION
Traffic over-crowding is a critical trouble in many urban
centers across the universe. The existing methods are not
accurate in terms of performance and cost for traffic
Fig 1: Evolution of Road Traffic Control System
A gas lit traffic control system is a manually operated by a
police officer. The use of this system is very difficult due to
457
ISBN: 978-81-924893-0-8
Dr. Pankaj Deep Kaur
Department of Computer Science and
Engineering
Guru Nanak Dev University Regional Campus
Jalandhar, INDIA
pankajdeepkaur@gmail.com
management and control. Urban region have a more
problem of traffic crushes, particularly when a bit of
conjunctions take into thoughtfulness. [1].
The traffic signal is typically controlled by a controller
inside a cabinet climbed on a concrete grid. Some electro-
mechanical controllers are still in use [2]. Traffic control
will turn a real significant topic in the hereafter when the
number of road user’s increases. There are several models
for traffic simulation. Huge amount of traffic cause waiting
and accidents. Due to heavy traffic emergency vehicles face
adversities.
Cloud computing permits the systems and users to utilize
Platform as a Service (PaaS) provider offer several
environments to users for development of
applications. The user can develop applications
according to their requirements. Infrastructure as a
Service (IaaS) that provides virtualized computing
resources over the Internet, and Software as a Service
(SaaS) provides software or application on the
internet and customer used these, with no
knowledge of development or maintenance [3].
Therefore, Sensor-Cloud base is seemly popin recent years
that can offer unfold and elastic program for various
supervising and holding diligences.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

burst. Nowadays, Wireless Sensor Network is used of
controlling the traffic. Wireless sensor network is
constructed of nodes. Sensor nodes basically sense data,
collect data from other nodes then process that data and
then transmit this collected data to the base station. It is
proved that node require much power or energy to transmit
data. The main concern is to save power to increase the life
of sensor network. Wireless sensor network applications
used in healthcare, military, environment monitoring, and
manufacturing [4]. Due to the limitations of WSNs in terms
of memory, energy, computation, communication and
scalability [5]. On that point demand for a mighty and
scalable high performance computing for treating and
storing of the WSN data.
Sensor-Cloud Infrastructure i.e. integrated version of
Wireless Sensor Networks and Cloud Computing [6]. A
large number of sensor data easily gather, access, process,
store, share, and search for using Sensor-Cloud [7].
Sensor-cloud will be placed at a particular space ahead the
junctions which will notice the fastness and voice of siren
at a specific doorway. On the foundation of the two
junctions will be capable to downplay the traffic fall by
inter-communication therefore allotting the right time for
red and green lights then emergency vehicles can go
quickly [8].

Table 1. Key attributes differentiating Old, Nowadays and Farther Road Traffic Control System

Controlling Technology Old Traffic Control Nowadays Traffic Control System Farther Traffic
Key Attributes System Control System
Methods Gas lit system Wireless Sensor Network Sensor-Cloud Network

Power Management Dependent on human Do not have defined ability Not dependent on load
power informants

Scalability No Limited Networks Multiple Networks

Network Connectivity and No Dynamic Static and Dynamic

Protocols
Scheduling No Power management and sensor Support job and
resource management service migration
Performance Less Limited High

Robustness Limited, failed fixed, broken projects are secure

tasks are restarted
restarted
Virtualization Support No Yes Yes

Elasticity No modified inexhaustible

2. EXISTING TRAFFIC CONTROL
SYSTEMS
2.1 Applied Research on Traffic Information
Collection system
The distributed treatment of traffic information
collection system is realized. In [9] paper author discussed
the essential troubles in the effectuation and reffered
settlement schemes. This project used in working clients
power, net analysis situs planning and time synchronization
among nodes.
2.2 Platoon-Based Self-Scheduling for Real-Time
Traffic Signal Control
Self-scheduling collects incoming vehicles into critical
clusters. Author proposes [10] unfolded conclusion
insurances that besides integrate look-ahead of upcoming
vehicle platoons. The simulation effect show that the gain
of this access is simple queue solving. The formation of
“green waves” vehicles run through the road network
without halting and amending overall traffic runs.
2.3 Intelligent Traffic Control Unit
The Intelligent Traffic Control Unit focuses on three
areas-Ambulance, Priority vehicles and Density control
[11]. In Ambulances radio frequency identification concept
is applied to fix the Ambulances track Green. The outcomes
distinctly state that gamiest priority is granted to the
ambulance. Secondly in priority vehicles infrared
transmitter and receiver are used to make the vehicle track
Green. In the third part IR and photodiodes are used in the
line of sight to detect the density at the traffic signal.
2.4 Automatic Daytime Road Traffic Control and
Monitoring System
This theme [12] suggests a method for accurately
calculating the routine of vehicles on a route at daylight.
The running aims are evoked from a frame-differencing
algorithm and the data from grain unit members. The

458
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

algorithm acts good below hard road traffic conditions such
as traces, flora and big trucks. The most significant trinket
of the aimed method is the vestiges handling utilizing sole
strength of B&W icons and top hat shifts.
2.5 Design of Adaptive Road Traffic Control
System
This system based on UML. Author provides this
proficiency for manipulating the traffic in main road
network utilizing signs [13]. These signs are mechanically
moderated aside sensors. To afford well advancement to
vehicles through the road network these detectors
coordinates the operation of the traffic signals in the entire
area. The signal timing varies throughout the day while
coordinating all the signals. It withdraws the addiction on
less spoiled schemes on sign designs.
2.6 Priority Based Traffic Lights Controller
Author presented a vehicle sensing and active traffic
signal time handling is used in priority based traffic light
controller system [14]. The project is also designed to
follow international standards for traffic light operations
and control over multiple intersections. Both single and
multiple intersections are dynamically adaptive to traffic
conditions in these techniques.

Table 2. Surviving technologies and key characteristics

Existing Technologies Key Feature

Priority Based Traffic Lights Used for robotic gate opening, VIP vehicles, GPS navigation system.
Controller
Applied Research on Traffic Voltage diligences: High degree AC Voltage, vehicle tire pressure , planes ,ships
Information Collection System potential troubles supervising before their navigate.

This system uses the microcontroller to download registered data, update easy
Intelligent Traffic Control Unit holdups, delete storage etc.

Platoon-Based Self-Scheduling for Performance of composite operations in active surroundings manages.

Real-Time Traffic Signal Control

Design of Adaptive Road Traffic This system uses the UML. UML is the standard visual modelling terminology
Control System which proposes an extended lot of plots for modelling.

Automatic Daytime Road Traffic  The varieties of measurements that can be achieved with cameras.
Control and Monitoring System
 Shadows identification plays a key role.

3. CONCLUSION [2] Legon-Okponglo, “Design and Development of

In this paper the role of Sensor-cloud in the setting of
various living methods in road traffic control system is
hashed out. Cloud Computing is development of these
engineerings and has announced not to substitute any living
technology. Each technology has its possess position and
dissimilar technologies demand to mix unitedly in the IT
environments. Sensor-Cloud enables the sensor information
to be categorised, laid in and treated in such a style that it
turns price-efficient, time usable and easily approachable .
Sensor-cloud signifies to supply summed features and
results to the problems that obsess these technologies. The
opportunities of implementing the technology to treat more
composite spots of traffic control system.
REFERENCES
[1] Cheonshik Kim, You-Sik Hong “Traffic Signal
Using Smart Agent System, ” American Journal of
Applied Sciences, 2008:1487-1493.
Micro-Controller Based Traffic System Using Image
Processing Techniques” University of Ghana,
published in ICAST, 2012 IEEE 4th International
Conference.
[3] J. Srinivas, K. Venkata Subba Reddy, Dr. A. Miss
Qyser, "Cloud computing basics," International
journal of advanced research in computer and
communication engineering, Vol. 1, Issue 5, pp. 343-
347, July 2012.
[4] G. Simon, G. Balogh, G. Pap et al., “Sensor network-
based counter sniper system,” in Proceedings of the
2nd International Conference on Embedded
Networked Sensor Systems (SenSys '04), pp. 1–12,
Baltimore, Md, USA, November 2004.
[5] J. Yick, B. Mukherjee, and D. Ghosal, Wireless
Sensor Network Survey, Elsevier, 2008.

459
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[6] Kian Tee LAN, (2010),” What’s NExT?
Sensor+Cloud?”, in Proceeding of 7 the International
workshop on Data Management for Sensor networks,
ACM Digital Library, ISBN: 978 -1-4503-0416-0,
2010.
[7] H. T. Dinh, C. Lee, D. Niyato, and P. Wang “A
Survey of Mobile Cloud Computing: Architecture,
Applications, and Approaches Wireless
Communications and Mobile Computing” Wiley
Online Library, 2011.
[8] http://telematicswire.net/c-dac-launches-witrac-indias-
first-wireless-traffic-controller-system.
[9] Xiaoquan Chen, Jihong Zhang, Shao Qian, Peng Xu
“Applied Research on Traffic Information Collection
Based on Wireless Sensor Networks”, Elsevier 2012
International Conference on Future Electrical Power
and Energy Systems.
[10] Xiao-Feng Xie, Gregory J. Barlow, Stephen F. Smith,
and Zachary B. Rubinstein “Platoon-Based Self-
Scheduling for Real-Time Traffic Signal Control”,
IEEE International Conference on Intelligent
Transportation Systems (ITSC), Washington, DC,
USA, 2011.
460
ISBN: 978-81-924893-0-8
[11] Searching Jaiswal, Tushar Agarwal, Akanksha Singh
and Lakshita “Intelligent Traffic Control Unit”,
International Journal of Electrical, Electronics ISSN
No. (Online): 2277-2626 and Computer Engineering 2
(2): 66-72 (2013).
[12] P.F. Alcantarilla, M.A. Sotelo, L.M. Bergasa
“Automatic Daytime Road Traffic Control and
Monitoring System” Intelligent Transportation
Systems, 2008. ITSC 2008. 11th International IEEE
Conference on 12-15 Oct. 2008 Page: 944–949.
[13] K. Ranjini, A. Kanthimathi, Y. Yasmine “Design of
Adaptive Road Traffic Control System through
Unified Modeling Language” International Journal of
Computer Applications (0975 – 8887) Volume 14–
No.7, February 2011.
[14] Shruthi K R & Vinodha. K “Priority Based Traffic
Lights Controller Using Wireless Sensor Networks”,
International Journal of Electronics, Signals, and
Systems (IJESS) ISSN: 2231- 5969, Vol-1 Iss-4,
2012.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Review on Scheduling Issues in Cloud Computing

Kapil Kumar Abhinav Hans Ashish Sharma Navdeep Singh

CSE Department
Guru Nanak Dev University Regional Campus
Jalandhar, INDIA
er.kapilkumar@yahoo.com, abhinavhans@gmail.com,
iamashish90@gmail.com, navvdeep.singh@gmail.com,

ABSTRACT
Cloud computing has become very popular in recent years.
Cloud computing deals with different kinds of virtualized
resources, hence scheduling play significant part in cloud
computing. Though the large amount of resources is available,
but is must to schedule the resources in such a manner that each
job can receive the resources for completing it. So the
scheduling algorithms are needed by a cloud to arrange
resources for executing jobs. There are various algorithms
available that can used to schedule the resources for job
execution. Thus the comprehensive way of dissimilar case of
scheduling algorithms in cloud computing have been thoroughly
covered in this review paper and related issues and challenges
have been highlighted.
II.
Keywords— Cloud Computing, Compromised-Time-Cost
Scheduling Algorithm, Hybrid Energy Efficient Scheduling
Algorithm, Optimized Resource Scheduling Algorithm, ANT
Colony Algorithm, Energy Efficient Algorithm uses Migration,
Improved Differential Evolution Algorithm, SHEFT Workflow
Scheduling Algorithm, Cloud-DLS: Dynamic Level Scheduling
Algorithm, Improved Cost Based Scheduling algorithm.
I. INTRODUCTION
The Cloud computing offers a distributed system concluded a
network in which a course of study or any diligence work on
many related computers at the same time .Cloud computing is a
hosted service in which an end user can access the cloud based
applications through the browser or any mobile application. [1].
National Institute of Standard Technology (NIST) detrmines
cloud computing is exact network approach. The major
advantage of cloud computing in which we can pay-for-use for
any software.
Cloud computing in other words is the allegory of the internet
[2]. Cloud system consists of three service models based on the
resource focus [3] i.e. PaaS, IaaS and SaaS. Platform as a
Service (PaaS) provider offer several environments to users for
development of applications. The user can develop applications
according to their requirements. Infrastructure as a Service
(IaaS) that provides virtualized computing resources over the
Internet, and Software as a Service (SaaS) provides software or
application on the internet and customer used these, with no
knowledge of development or maintenance
execute one by one in cloud system increments the price and the
price is reduced if we have a modest number of composite tasks.
When the number of users in the cloud gets increased then
the scheduling becomes difficult. Therefore, there is a need to go
for a better scheduling algorithm than existing one. Since cloud
computing the different kinds of researches is going on, The
scheduling strategies proposed to overcome the problems
between users and resources[5].
Moreover, the rest of the paper is organized as: Section II
describes the various comparison parameters used. Section III
presents various scheduling algorithms. Based on the literature
survey, various open issues have been discussed in IV and the
paper is finally concluded in Section V.
COMPARISON PARAMETERS
Various parameters have been used in this section to compare
various scheduling algorithms:
A. Execution time
In which program is running and single
instruction, such as addition or multiplication is carried out in
the computer instruction.
B. Response time
The response time is the sum of the service time and wait
time. Technically response time is the time of system takes to
react to a given input.
C. Make span
Difference between the depart and close of a sequence of
jobs.
D. Energy Consumption
It is the consumption of energy or power. It is also defined
in some quarters as the use of energy as a raw material in the
process of manufacturing utilities.
E. Throughput
It refers to how much data can be transferred from one
location to another in a given amount of time.
F. Scalability
The increasing demands and growing amount of the work is
known as scalability.

In Cloud Computing user may face hundreds of thousands of
virtualized resources to utilize, it is impossible for anyone to
allocate the jobs manually. To allocate the resources to each job
efficiently, scheduling plays more important role in cloud
computing [4]. For a large number of simple tasks when they
G. Resource utilization
Resource utilization is the use of a resource in such a way
that increases through output. The sources used to perform a
particular task.

461
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
H. Load Balancing
Load balancing is the most above-board method of
surmounting away an application host base. As application need
growths, new hosts can be easily summed to the imagination
pond and the load balancer will instantly start posting traffic to
the new host.
I. Fault tolerance
Fault tolerance is fixed every bit how to supply, by
redundancy, avail following with the stipulation in hurt of faults
causing happened or happening.
III. EXISTING SCHEDULING ALGORITHMS
A. Compromised-Time-Cost Scheduling Algorithm
Novel Compromised-time-cost execution along with the user
input is proposed [6]. For user defined deadlines this work is
focused on minimizing the price below user specified deadlines.
It provides the just in time graph of the time cost relationship.
The multiple concurrent instances of the dynamic cloud
computing platform are used to change the schedule if the user
wants.
B. Hybrid Energy Efficient Scheduling Algorithm
This algorithm based on pre-power techniques and least load
first algorithm developed. The author proposed [7] Pre-power
technique that is used to reduce the response time and it uses the
idle threshold value. When the data centres are running in low
power mode, then the least load first algorithm is used to balance
workloads.
C. Optimized Resource Scheduling Algorithm
The author proposed [8] optimal use of resources by using
virtual machines. It used Improved Genetic Algorithm (IGA). As
compared to traditional GA scheduling method speed of the IGA
was almost twice and utilization of resources is also larger. IGA
selects optimal VMs by introducing dividend policy.
D. ANT Colony Algorithm
The author proposed a poised Ant colony algorithm [9]
which uses a pseudo random proportional rule to poise the
integral organization load while completing all the jobs at hand
as soon as possible according to the environmental status. This
algorithm balances the workload as well as minimizing the make
span.
E. Energy Efficient Algorithm uses Migration
Author proposed a hybrid energy-efficient scheduling
algorithm [10] using dynamic migration. In this paper powering
down a busy node is not feasible using the threshold value. It
uses the power up command to wake sleep nodes as well as the
idle nodes. The expected spectrum set for the left capacity is
used. Hence power efficiency is improved.
F. Improved Differential Evolution Algorithm (IDEA)
In [11] author proposed a scheduling algorithm which
Optimize task scheduling and resource allocation based on the
price and clock methods. It is a multi-objective optimization
approach. This price model includes the treating, obtaining and
clock model includes obtaining, treating and waiting time. This
algorithm trusts the Taguchi method.
462
ISBN: 978-81-924893-0-8
G. SHEFT Workflow Scheduling Algorithm
This paper [13] proposed the SHEFT (Scalable HEFT)
scheduling algorithm that helps increasing and decreasing the
number of resources at runtime. It provides facility to resources
to scale at runtime, outperforms in optimizing workflow
execution time. It scheduled a workflow in a cloud environment
elastically. There was optimized execution time for the
workflow.
H. Cloud-DLS: Dynamic Level Scheduling Algorithm
The Cognitive trust model is used in dynamic level
scheduling (DLS) & hence trusts dynamic level scheduling
algorithm is introduced in [14]. This paper focuses on
trustworthiness in cloud computing. Because of the
characteristics of cloud computing obtaining trustworthiness in
computing resources is difficult. In this the two kinds of trust,
i.e. direct trust degree, recommendation, trust degree is obtained
to obtain the trusted scheduling and extends the traditional DLS
algorithm.
I. Improved Cost Based Scheduling algorithm
In [15] paper author proposed the approach that is improved
cost-based scheduling algorithm. It measured computation
performance and resource cost. It also increased execution data
transfer ratio by combining the tasks.
IV. OPEN ISSUES
Based on the survey a scheduling fabric can be
enforced by utilizing the different parametric quantities.
The efficiency of the energy usage is main issue that took
a lot concern. But Scheduling is unmatchable issues in the
management of diligence performance in a cloud
environment. It must focus on cost, time, energy
efficiency and load balancing of the data centres. Paleness
imagination allotment sets a critical use in scheduling.
V. CONCLUSION
In this paper, we have sight several living scheduling
algorithms in cloud computing. The table 1 is shown for
promote quotations. A scheduling theoretical history
should be enforced to amend the user satisfaction.We
have used various parameters to make a comparison. The
scheduling framework should consider the user input
constraints execution time, energy efficiency,
performance issues and make span so on.We also
acknowledged that disk quad management is vital in
practical surroundings. Hence , there is a demand to carry
out a scheduling algorithm in cloud computing.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

TABLE I. COMPARISON BETWEEN EXISTING SCHEDULING ALGORITHMS ISSUES

Scheduling Execution Response Make Energy Through-- Scalability Resource Load Fault
Algorithms Time Time Span Consumption put Utilization Balancing Tolerance
Compromised-Time-         
Cost Scheduling
Algorithm

Hybrid Energy         
Efficient Scheduling
Algorithm

Optimize Resource         
scheduling Algorithm

ANT Colony         
Algorithm

Energy Efficient         
Algorithm uses
Migration
Improved differential         
evolution algorithm
(IDEA)

SHEFT Workflow         
Scheduling Algorithm

Dynamic Level         
Scheduling Algorithm

Improved Cost Based         

Scheduling Algorithm

[8] H. Zhong, K. Tao, X. Zhang,” An approach to optimized

REFERENCES
[1] C. Germain-Renaud, O. Rana “The Convergence Of
Clouds, Grids, and Autonomics” IEEE Internet Computing
13 (6) (2009) 9.
[2] http://en.wikipedia.org/wiki/Cloud_computing
[3] Krishan Kant Lavania, Yogita Sharma,
Chandresh Bakliwal “A Review on Cloud Computing
Model, ” International Journal on Recent and Innovation
Trends in Computing and Communication ISSN 2321-8169
Volume: 1 Issue: 3 March 2013.
[4] Baomin Xu, Chunyan Zhao, Enzhao Hua,Bin Hu, “Job
Scheduling Algorithm Based on Berger Model in Cloud
Environment”, Elseiver publications, march 2011.
[5] M. Gokilavani, S. Selvi, C. Udhayakumar “A Survey on
Resource Allocation and Task Scheduling Algorithms in
Cloud Environment” ISO 9001:2008 Certified International
Journal of Engineering and Innovative Technology (IJEIT)
Volume 3, Issue 4, October 2013.
[6] Ke Liu, Hai Jin, Jinjun Chen, Xiao Liu, Dong Yuan, Yun
Yang, “A Compromised-Time-Cost Scheduling Algorithm
in SwinDeW-C for Instance-Intensive Cost-Constrained
Workflows on Cloud Computing Platform” International
Journal of High Performance Computing Applications
Volume 24 Issue 4, November 2010 Pages445-456.
[7] Jiandun Li, Junjie Peng, Zhou Lei, Wu Zhang, “An Energy
Efficient Scheduling Approach Based on Private Clouds”,
Journal of Information & Computer Science, April 2011.
resource scheduling algorithm for open-source cloud
system,” Fifth annual china grid conference (IEEE), pp.
124-129,2010.
[9] Kapil Kumar, Abhinav Hans, Ashish Sharma, Navdeep
Singh, “Towards The Various Cloud Computing
Scheduling Concerns: A Review, ” International
Conference on Innovative Applications of Computational
Intelligence on Power, Energy and Controls with their
Impact on Humanity (CIPECH14) 28 & 29 November
2014.
[10] Jiandun Li, Junjie Peng, Zhou Lei, Wu Zhang, “A
Scheduling Algorithm for Private Clouds”, Journal of
Convergence Information Technology, Volume6, Number
&, July 2011.
[11] Jinn-TsongTsai, Jia-Chen Fang, Jyh-Horng Chou
“Optimized Task Scheduling and Resource Allocation on
Cloud Computing Environment using Improved
Differential Evolution Algorithm”, Computers &Operations
Research 40 (2013)3045–3055.
[12] Deepak Poola, Kotagiri Ramamohanarao, and Rajkumar
Buyya “Fault-Tolerant Workflow Scheduling Using Spot
Instances on Clouds”, ICCS 2014. 14th International
Conference on Computational Science, Volume 29, 2014,
Pages 523–533.
[13] C. Lin, S.Lu, “Scheduling Scientific Workflow Elasticity
for Cloud Computing”, IEEE 4th International Conference
on Cloud Computing, pp. 246-247,2011.
[14] Wei Wang, GuosunZeng, Daizhong Tang, Jing Yao,
“Cloud-DLS: Dynamic Trusted Scheduling for Cloud
Computing”, Expert Systems with Applications, 2011.
S. Selvarani, G.S. Sadhasivam,“Improved Cost Based
Algorithm for Task Scheduling In Cloud Computing”,
Computational Intelligence and Computing Research, pp.
1-5,2010.

463
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Artificial Intelligence (AI): A Review
Preeti Damandeep kaur
Asstt.Prof in Computer Sci. Asstt.Prof in Computer Sci.
Gobindgarh Public College, Gobindgarh Public College,
Alour(Khanna) Alour(Khanna)
vermapreeti1234@gmail.com damandeepnabha@gmail.com
ABSTRACT
This paper aims at presenting the perception of “Artificial
Intelligence”. Artificial intelligence is a branch of computer
science that aims to create intelligent machines which can
perform the functions similar to human beings. It has become
an essential part of the technology industry. Research
associated with artificial intelligence is highly technical and
specialized. The paper briefly explains the core part of
Artificial Intelligence (AI) such as Knowledge, Reasoning,
Problem Solving, Perception, Learning and Planning. It
further describes the various applications of the Artificial
Intelligence such as Data Mining, Knowledge Representation,
Knowledge Base (KB), Inference Engine, Soft Computing,
Natural Language Processing, Aviation, Robotics .The main
aim of this paper is to explore the recent applications of
Artificial Intelligence (AI), the impact of Artificial
Intelligence (AI) on our lives, to provide an overview of the
field, the areas where Artificial Intelligence is used and the
critical role of Artificial Intelligence
Keywords
Artificial Intelligence.
1. INTRODUCTION
Artificial Intelligence (AI) is the capacity of a computer to
perform functions like learning and decision making just like
humans, as by an expert system, a program for Computer
Aided Design (CAD) or Computer Aided Manufacturing
(CAM), or a program for the perception and recognition of
shapes in computer vision systems. The term is commonly
applied to the project of developing systems capable with the
intellectual processes characteristic of humans, such as the
capability of reasoning, discover meaning, generalizing, or
learning from past experience.
2. WHAT IS INTELLIGENCE?
Intelligence word derives from the Latin verb intelligere, to
comprehend or perceive. Intelligence has been defined in
many different ways such as in terms of one's capacity for
logic, abstract thought, understanding, self-awareness,
communication, learning, emotional knowledge, memory,
planning, creativity and problem solving.It can also be more
generally described as the ability to perceive and/or retain
knowledge or information and apply it to itself or other
instances of knowledge or information creating referable
understanding models of any size, density, or complexity, due
to any conscious or subconscious imposed will or training to
do so. Intelligence is most extensively studied in humans, but
464
ISBN: 978-81-924893-0-8
Ishu Gupta
Asstt.Prof in Economics
Gobindgarh Public College,
Alour(Khanna)
ishugupta36@gmail.com
has also been observed in non-human animals and in plants.
Artificial intelligence (AI) is the replication of intelligence in
machines.
Intelligence = perceive + Analyze + React
According to some researchers "A very general mental
capability that, among other things, involves the ability to
reason, plan, solve problems, think abstractly, comprehend
complex ideas, learn quickly and learn from experience. It is
not merely book learning, a narrow academic skill, or test-
taking smarts. Rather, it reflects a broader and deeper
capability for comprehending our surroundings—"catching
on," "making sense" of things, or "figuring out" what to do".
3. CORE PARTS OF ARTIFICIAL
INTELLIGENCE
The core parts of artificial intelligence include programming
computers for certain traits such as:
3.1 Knowledge
Knowledge engineering is a core part of Artificial Intelligence
(AI) research. Machines frequently act and react like humans
only if they have rich information concerning to the world.
Artificial intelligence (AI) must have access to objects,
classes, properties and relations between all of them to
implement knowledge engineering.
3.2 Reasoning
Do not include headers, footers or page numbers in your
submission. These will be added when the publications are
assembled.
3.3 Problem Solving
Place Tables/Figures/Images in text as close to the reference
as possible (see Figure 1). It may extend across both columns
to a maximum width of 17.78 cm (7”).
Problem solving is another core part of Artificial Intelligence
(AI), which may be describe as an orderly search through a
range of possible procedures in order to reach some
predefined aims or solution. Problem-solving method is
further divide into two- parts special purpose and general
purpose. A special-purpose method is tailor-made for a
particular problem and often exploits very specific features of
the situation in which the problem is embedded. On the other
hand, a general-purpose method is applicable to a broad range
of problems. One general-purpose technique used in Artificial
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Intelligence (AI) is means-end analysis—a step-by-step, or aspects, data pre-processing, model and inference
incremental, reduction of the difference between the current considerations, interestingness metrics, complexity
state and the final goal. considerations, post-processing of discovered structures,
visualization, and online updating.

4.2 Knowledge Representation

3.4 Perception
Knowledge is the information about an area that can be used
Machine perception deals with the capability to use sensory to solve problems in that particular area. To solve problems
inputs to work out the different aspects of the world, while there is a need of large extent knowledge, and this knowledge
computer idea is the power to analyze visual inputs with few must be embodying in the computer. A representation scheme
sub-problems such as facial, object and speech recognition. In is the form of the knowledge that is used in an agent. A
perception the situation is examined by means of various representation scheme specifies the form of the knowledge. A
sensory organs, real or artificial, and the scene is decomposed knowledge base is the representation of all of the knowledge
into separate objects in various spatial relationships. Analysis that is stored by an agent.
is complicated by the fact that an object may appear different
depending on the angle from which it is viewed, the direction
and intensity of illumination in the scene, and how much the
object contrasts with the surrounding field. In recent times,
Artificial Perception is suitably well advanced to allow optical
sensors to identify individuals, autonomous vehicles to drive
at modest speed on the open road.

3.5 Learning
Machine learning is another core part of Artificial Intelligence
(AI). There are different forms of learning as applied to
artificial intelligence. The simplest is trial and error method.
For example, a simple computer program for solving mate-in-
one chess problems might try moves at random until mate is
found. The program might then store the solution with the
position so that the next time the computer encountered the
same position it would recall the solution. This simple 4.3 Knowledge Base (Kb)
memorizing of individual items and procedures—known as
rote learning—is relatively easy to implement on a computer. A Knowledge Base (KB) is that technology which is used to
More challenging is the problem of implementing what is accumulate complex planned and unplanned information
called generalization. Generalization involves applying past which has been used by a computer system. The initial use of
experience to analogous new situations. the term was in connection with expert systems which were
the first knowledge-based systems. It makes these available to
3.6 Planning the inference engine in a form that it can use. The facts may
be in the form of background information built into the system
The planning problem in Artificial Intelligence (AI) is about or facts that are input by the user during a consultation. The
the decision making performed by intelligent creatures like rules include both the production rules which applied to the
robots, humans, or computer programs when trying to achieve domain of the expert system. The heuristics of rules-of-thumb
some goal. It involves choosing a sequence of actions that will that are provided by the area expert in order to make the
transform the state of the world, step by step, so that it will system find solutions more capably by taking short cuts.
satisfy the goal. The world is typically viewed to consist of
atomic facts, and actions make some facts true and some facts
false.
4.2 Inference Engine
Inference Engine is a program which infers new facts from
4. APPLICATIONS OF ARTIFICIAL known facts using inference rules. It locates the appropriate
INTELLIGENCE (AI) knowledge in the knowledge base, and infers new knowledge
by applying logical processing and problem-solving
Artificial intelligence (AI) has been used in a wide range of strategies. Commonly found as part of a Prolog interpreter,
fields including medical diagnosis, stock trading, robot expert system or knowledge based system.
control, law, remote sensing, scientific discovery and toys.
The various applications of Artificial Intelligence (AI) are:

4.1 Data Mining

Data Mining is the analysis step of the "Knowledge Discovery
in Databases" process (KDD). It is explained as an
interdisciplinary subfield of computer science, is the
computational process of discovering patterns in large data
sets involving methods at the intersection of artificial
intelligence, machine learning, statistics, and database
systems. The overall goal of the data mining process is to
remove information from a data set and transform it into an
understandable structure for further use. Away from the raw
analysis step, it involves database and data management

465
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
4.3 Soft Computing
Soft Computing provides rapid dissemination of important
results in soft computing technologies, a synthesis of research
in evolutionary algorithms and genetic programming, neural
science and neural net systems, fuzzy set theory and fuzzy
systems, and chaos theory and chaotic systems .It also
promote the integration of soft computing techniques and
tools into both everyday and advanced applications.
4.4 NATURAL LANGUAGE
PROCESSING (NLP)
Natural language processing (NLP) refers to computer
systems that examine, attempt to understand, or produce one
or more human languages, such as English, Japanese, Italian,
or Russian. The input might be text, spoken language, or
keyboard input. The task might be to interpret to another
language, to know and represent the content of text, to build a
database or generate summaries, or to maintain a dialogue
with a user as part of an interface for database retrieval.
4.4.1 Goals
 To make it easy to define tokens and sentences.
466
ISBN: 978-81-924893-0-8
 To Safe, compile-time checked definition of the
syntax and grammar.
 Model real-world inheritance with C# class
inheritance.
4.5 Aviation
The Air Operations Division (AOD) uses Artificial
Intelligence (AI) for the rule based expert systems. The AOD
has use for artificial intelligence for surrogate operators for
combat and training simulators, mission management aids,
support systems for tactical decision making, and post
processing of the simulator data into symbolic summaries.
The use of artificial intelligence in simulators is proving to be
very useful for the AOD. Airplane simulators are using
artificial intelligence in order to process the data taken from
simulated flights. Other than simulated flying, there is also
simulated aircraft warfare. The computers are able to come up
with the best success scenarios in these situations. The
computers can also create strategies based on the placement,
size, speed and strength of the forces and counter forces.
Pilots may be given assistance in the air during combat by
computers. The artificial intelligent programs can sort the
information and provide the pilot with the best possible
maneuvers, not to mention getting rid of certain maneuvers
that would be impossible for a human being to perform.
Multiple aircraft are needed to get good approximations for
some calculations so computer simulated pilots are used to
gather data. These computer simulated pilots are also used to
train future air traffic controllers.
4.6 Robotics
Robotics is one field within artificial intelligence.
Conventional Robotics employ Artificial Intelligence
planning technologies to program robot behaviors and works
toward robots as technical devices that have to be developed
and controlled by a human engineer. The Autonomous
Robotics approach suggests that robots could develop and
control themselves autonomously. These robots are able to
adapt to both uncertain and imperfect information in
constantly changing environments. It lets a simulated
evolution process develop adaptive robots.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5. TURING MACHINE
Turing suggests we should ask if the machine can win a game,
called the "Imitation Game". The original Imitation game that
Turing described is a simple party game involving three
players. Player A is a man, player B is a woman and player C
can be of either sex. In the Imitation Game, player C is unable
to see either player A or player B and can communicate with
them only through written notes or any other form that does
not give away any details about their gender. By asking
questions of player A and player B, player C tries to
determine which of the two is the man and which the woman
is. Player A's role is to trick the interrogator into making the
wrong decision, while player B attempts to assist the
interrogator in making the right one.
6. ADVANTAGES OF ARTIFICIAL
INTELLIGENCE (AI)
There are many advantages of the Artificial Intelligence (AI)
and these are:
6.1 Jobs
Due to Artificial Intelligence the computers are able to
perform various jobs. Depending on the level and type of
intelligence these machines receive in the future, it will
obviously have an effect on the type of work they can do, and
how well they can do it .As the level of AI increases so will
their capability to deal with difficulty, complex even risky
tasks that are currently done by humans, a form of applied
artificial intelligence.
467
ISBN: 978-81-924893-0-8
6.2Increase Our Technological Growth
Rate
Artificial Intelligence (AI) will potentially help us 'open
doors' into new and more advanced technological
breakthroughs. For example, due to their capability to produce
millions and millions of computer modeling programs also
with high degrees of correctness, machines could essentially
help us to find and understand new chemical elements and
compounds etc. Basically, a very realistic advantage AI could
propose is to act as a sort of catalyst for further technological
& scientific discovery.
6.3 They don't stop
As they are equipment there is no need for rest or sleep. They
do not get ill or never get tired. There is need for them to be
charged or refill. The machines can do much more work than
a man can do. All that is required is that they have some
energy source.
6.4No risk of damage
During exploring new undiscovered land or even planets, the
machines usually get out of order but there is no harm done as
they don't feel, they don't have emotions. Whereas going on
the same type of expeditions a machine does, may simply not
be possible or they are exposing themselves to high risk
situations.
6.5 Act as helper
These Machines can help 24*7 aids to children with
disabilities or the elderly; they could even act as a source for
learning and teaching. They could even be part of security
alerting you to possible fires that you are in threat of, or
reducing crimes.
6.6 Their function is almost limitless
These machines are able to do everything. Essentially their
use, pretty much doesn't have any limits. They will make
fewer faults, they are emotionless, they are well-organized,
and they are basically giving us more free time to do as we
please.
7. DISADVANTAGES FOR ARTIFICIAL
INTELLIGENCE (AI)
7.1 Over reliance on Artificial Intelligence
(AI)
If we over reliance on machines then we will become
dependent on these machines and this can be proved harmful
for the whole economy. It wouldn't be too smart on our part
not to have some sort of backup plan to potential issues that
could arise, if the machines 'got real smart'.
7.2 Human Feel
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

As they are machines they obviously can't provide you with

that 'human touch and quality', the feeling of a togetherness
and emotional understanding, that machines will lack the
ability of understanding the situations, and may act
irrationally as a consequence.

7.3 Inferior

As machines will be able to perform almost every task better

than us in practically all respects, they will take up many of
our jobs, which will then result in masses of people who are
then jobless and as a result feel essentially useless. This could
then lead us to issues of mental illness and obesity problems
etc.

7.4 Misuse

If this kind of technology will go in wrong hand, it can cause

mass destruction. Where robot armies could be formed, or
they could perhaps malfunction or be corrupted or can prove
harmful for the world.

8. CONCLUSION

The paper aims at the presenting the perception of “Artificial

Intelligence” by which a computer can perform the operations
similar to the human beings. The ability to learn by
illustrations makes them all the more powerful. They are well
organized. The main aim of the researchers is to create
machines that surpass humans. Yet there is lot to gain in the
computer world. Artificial Intelligence in the future will try to
make computers which will be more stylish and sophisticated
and the functions of the humans such as learning by doing,
cognition and sensitivity will also be performed by these
computers.

REFERENCES

[1] Abraham Ajith.2006.Artificial Neural Networks.

Oklahoma State University, Stillwater OK, USA.
[2] Crowen Tyler, Dawson Michelle. 2009. What Does the
Turing test really mean? and how many human beings
(including Turing) could pass? Georage Mason
University Department of Economics and University of
Montreal.
[3] Jha Kumar Girish .2005.Artificial Neural Networks and
Its Application. International Journal of Computer
Science and Issues.
[4] Kumar Koushal, Thakur Mitra Sundar Gour .2012.
Advanced Applications of Neural Networks and
Artificial Intelligence: A Revies.,I.J. Information
Technology and Computer Science, 6, 57-68.
[5] Zurada M. Jacek .2006.Introduction to Artificial Neural
System. Jaico Publishing House.

468
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Data Optimization using Transformation approach in
Privacy Preserving Data Mining
Rupinder Kaur
Student of YCOE
Punjabi University, Guru Kashi Campus,
Talwandi Sabo
rupindercsgate@gmail.com
ABSTRACT
Data Mining is a way to extract hidden knowledge from large
databases. Data mining techniques extracts the hidden patterns
from databases that may be used for effective decision
making. But these techniques may pose a serious threat to
privacy by disclosing sensitive information. So the trend is
towards developing Privacy Preserving Data Mining (PPDM)
techniques that should be able to extract useful information
without causing threat to privacy. This Paper presents the
basic concepts in the context of PPDM and also a description
about various Privacy Preserving Data Mining techniques.
The main emphasis is on transformation approach for PPDM
that results in less information loss as compared to other
PPDM techniques.
General Terms
Your general terms must be any term which can be used for
general classification of the submitted material such as Pattern
Recognition, Security, Algorithms et. al.
Keywords
Keywords are your own designated keywords which can be
used for easy location of the manuscript using any search
engines.
1. INTRODUCTION
The significant development in field of data collection and
data storage technologies have provided transactional data to
grow in data warehouses that reside in companies and public
sector organizations. As the data is growing day by day, there
has to be certain mechanism that could analyze such large
volume of data. Data mining is a way of extracting the hidden
predictive information from those data warehouses without
revealing their sensitive information. Data mining is the
process of extracting hidden information from the database.
Data mining is emerging as one of the key features of many
business organizations. The current trend in business
collaboration shares the data and mined results to gain mutual
benefit. Data mining is a set of automated techniques used to
extract hidden or buried information from large databases.
The term data mining refers to the nontrivial extraction of
valid, implicit, potentially useful and ultimately
understandable information in large databases with the help of
the modern computing devices.
2. PRIVACY PRESERVING DATA
MINING (PPDM)
Successful applications of data mining techniques have been
demonstrated in many areas that benefit commercial, social
and human activities. Along with the success of these
techniques, they pose a threat to privacy. One can easily
disclose other‟s sensitive information or knowledge by using
469
ISBN: 978-81-924893-0-8
Meenakshi Bansal
Assistant Professor
YCOE, Punjabi University
Guru Kashi Campus, Talwandi Sabo
ermeenu10@gmail.com
these techniques. So, before releasing database, sensitive
information or knowledge must be hidden from unauthorized
access. To solve privacy problem, PPDM has become a
hotspot in data mining and database security field. Many
organizations disclose their information or database for
mutual benefit to find some useful information for some
decision making purpose and improve their business schemes.
But this database may contain some private data and which
the organization does not want to disclose. The issue of
privacy plays important role when several organizations share
their data for mutual benefit but no one wants to disclose their
private data. Therefore before disclosing the database,
sensitive patterns must be hidden and to solve this issue
PPDM techniques are helpful to enhance the security of
database. Privacy preserving data mining (PPDM) is the
recent research area that deals with the problem of hiding the
sensitive information while analyzing data.
In recent years, the wide availability of personal data has
made the problem of privacy preserving data mining an
important one. Privacy preserving data mining considers the
problem of running data mining algorithms on confidential
data that is not supposed to be revealed even to the party
running the algorithm. The problem of privacy-preserving
data mining has become more important in recent years
because of the increasing ability to store personal data about
users, and the increasing sophistication of data mining
algorithms to leverage this information. So maintaining
privacy is a challenging issue in data mining.
The basic form of the data in a table consists of following four
types of attributes [4].
(i) Explicit Identifiers is a set of attributes containing
information that identifies a record owner explicitly such as
name, SS number etc.
(ii) Quasi Identifiers is a set of attributes that could
potentially identify a record owner when combined with
publicly available data.
(iii) Sensitive Attributes is a set of attributes that contains
sensitive person specific information such as disease, salary
etc.
(iv) Non-Sensitive Attributes is a set of attributes that creates
no problem if revealed even to untrustworthy parties.
3. NEED FOR PPDM
Consider, as a tea reseller we are purchasing tea at low price
from two companies, Tata Tea Ltd. and Lipton Tea Ltd.,
while granting them to access our customer database. Now,
suppose the Lipton Tea supplier misuse the database and
mines association rules related to the Tata Tea, saying that
most of the customers who buy bread also buy Tata tea.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Lipton tea supplier now runs a coupon scheme that offers transformation, etc. techniques to the original datasets in order
some discount on bread with purchase of Lipton Tea. So, the to generate their sanitized counterparts that can be safely
amount of sales on Tata Tea is down rapidly and Tata Tea disclosed to untrustworthy parties. The goal of this category
supplier cannot offer tea at low price to us as before and of approaches is to enable the data miner to get accurate data
Lipton monopolizes the tea market and is not offering tea at mining results when it is not provided with the real data.
low price to us as before. As a result, we may start losing Secure Multiparty Computation methodologies that have been
business to our competitors. So, releasing database with proposed to enable a number of data holders to collectively
sensitive knowledge is bad for us. This scenario leads to the mine their data without having to reveal their datasets to each
research of sensitive knowledge (or rule) hiding in database. other.
For example, a hospital may release patients‟ diagnosis The second category deals with techniques that prohibits the
records so that researchers can study the characteristics of disclosure sensitive knowledge patterns derived through the
various diseases. The raw data, also called microdata, contains application of data mining algorithms as well as techniques
the identities (e.g. names) of individuals, which are not for downgrading the effectiveness of classifiers in
released to protect their privacy. However, there may exist classification tasks, such that they do not reveal sensitive
other attributes that can be used, in combination with an knowledge.
external database, to recover the personal identities. Now we
assume that the hospital publishes the data in Table1, which PPDM tends to transform the original data so that the result of
does not explicitly indicate the names of patients. data mining task should not defy privacy constraints.
Following is the list of five dimensions on the basis of which
Table 1: Patients’ diagnosis record published by hospital different PPDM Techniques can be classified:
(i) Data distribution
Attributes (ii) Data modification
ID (iii) Data mining algorithms
Age
Age SexSex Zipcode
ZipcodeDiseaseDisease (iv) Data or rule hiding
(v) Privacy preservation
1 26 M 83661 Flu
4.1 Data distribution
2 24 M 83634 Heart The first dimension refers to the distribution of data. Some of
Attack the privacy preserving approaches have been developed for
centralized data and others refer to a distributed data scenario.
3 31 M 83967 Stomach Distributed datasets scenarios can also be classified as
Cancer horizontal data distribution and vertical data distribution.
4 39 F 83949 Horizontal distribution refers to these cases where different
Flu database records reside in different places, while vertical data
distribution, is referring to the cases where all the values for
different attributes reside in different places.
Table 2: Voter registration list
4.2 Data modification
Attributes The second dimension refers to the modification scheme of
ID the data. Data modification is mostly used in order to change
Name Age Sex Zipcode the original values of a database that needs to be released to
Age Sex Zipcode Disease
1 the public and also to ensure high protection of the privacy
Jim 26 M 83661 data. It is important that a data modification technique should
be in concern with the privacy policy adopted by an
2
Jay 24 M 83634 organization. Methods of data modification include:

3  Perturbation, which is accomplished by the

Tom 31 M 83967
4 noise). Moreover, data transformation approach is
Lily 39 F 83949
4. PPDM TECHNIQUES
PPDM has become an important issue in data mining
research. As a result, a whole new set of approaches were
introduced to allow mining of data, while at the same time
prohibiting the leakage of any private and sensitive
information. The majority of the existing approaches can be
classified into two broad categories:
(i) methodologies that protect the sensitive data itself in the
mining process, and
(ii) methodologies that protect the sensitive data mining
results (i.e. extracted knowledge) that were produced by the
application of the data mining.
The first category refers to the methodologies that apply
perturbation, sampling, generalization / suppression,
alteration of an attribute value with a new value
(i.e., changing a 1-value of a 0-value, or adding
more efficient than bit transformation.
 Blocking is the replacement of an existing attribute
value with an aggregation or merging which is the
combination of several values.
 Swapping that refers to interchanging values of
individual records.
 Sampling, which is referred to delivering the data
for only a sample of a population.
4.3 Data mining algorithm
The third dimension refers to the data mining algorithm, for
which the data modification is also placed here. It has
included the problem of hiding data from a combination of
data mining algorithms. For the time being, various data
mining algorithms have been considered in isolation of each
other. Among them, the most important ideas have been
developed for classification data mining algorithms, such as

470
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
decision tree inducers, clustering algorithms, rough sets and
Bayesian networks, association rule mining algorithms.
4.4 Data or rule hiding
The fourth dimension refers to hiding the rule or the data. The
complexity of hiding aggregated data in the form of rules is of
course higher, and for this reason, most heuristics have been
developed. The data miner to produce weaker inference rules
that will not allow the inference of confidential values. This
process is also known as “rule confusion”.
4.5 Privacy preservation
The last dimension which is the most important and it refers
to the privacy preservation technique used for the selective
modification of the data. Selective modification is required in
order to achieve higher utility for the modified data given that
the privacy data is not a loss. The important techniques of
privacy preserving data mining are,
1. The randomization method
2. The anonymization method
3. The encryption method
4.5.1 The randomization method
Randomization method is an important and popular method in
current privacy preserving data mining techniques. It masks
the values of the records by adding additional data to the
original data.
4.5.2 The anonymization method`
Anonymization method is aimed at making the individual
record will be indistinguishable among a group record by
using generalization and suppression techniques. K-
anonymity is the representative anonymization method. The
motivating factor behind the k-anonymity approach is that
many attributes in the data can often be considered quasi-
identifiers which can be used in conjunction with public
records in order to uniquely identify the records.
4.5.3 The encryption method
Encryption method mainly resolves the problems that people
jointly conduct mining tasks based on the private inputs they
provide. These privacy mining tasks could occur between
mutual un-trusted parties, or even between competitors.
Therefore, to protect the privacy becomes an important
concern in distributed data mining setting.
5. TRANSFORMATION APPROACH
FOR PPDM
Transformation means changing from one form to another.
Various transformation methods exist for numeric attributes.
Data Transformation methods are more efficient than bit
transformation methods as they result into less information
loss. The actual sensitive values are replaced with new values,
which can exhibit the same general pattern of the actual data,
but conceal the actual sensitive information (details) even if
traced by linking attack.
5.1 Transformation method for
alphanumerical data type:
The transformation of alphanumeric nominal data type is
based on the principle that encoding does not produce any
information loss. Each nominal sensitive value is assigned a
mapping value. The mapping values are alphabetic or
alphanumeric and assigned in any random order. A typical
mapping table for the attribute „Disease‟ is as shown in Table.
In this, table, actual values of the attribute „Disease‟ are
arranged neither in alphabetical order, nor in severity order,
471
ISBN: 978-81-924893-0-8
nor in any taxonomy order but are assigned certain mapping
values. With this kind of mapped values, the actual values
cannot be perse guessed.
Table 3: Mapping Table
Actual Value Mapping value
Flu Illness_1
Stomach Cancer Illness_2
Bronchitis Illness_3
H1N1 Illness_4
This mapping table is to be preserved in highly secured
trusted sever along with the original table T and kept
confidential. In a table there may be any number of sensitive
nominal or categorical attributes. For each sensitive attribute,
separate mapping table is to be preserved [8].
5.2 Transformation method for numerical
data type:
Various transformation methods exist for numeric sensitive
and quasi-identifier attributes. Poovammal [7] proposed a
fuzzy based transformation to transform quasi-identifier
numeric attribute. In 2010, Poovammal and Ponnavaikko have
developed categorical based transformation method to
transform numeric sensitive attributes [8]. Mukkamala and
Ashok [6] compared fuzzy based transformation methods and
proposed various fuzzy functions and mappings. Haung and
Chen [2] proposed a distance and correlation preserving
transformation called as FISIP transformation to transform
private numeric data values. Jalla and Girjia [3] proposed a
hybrid transformation method specifically for classification.
6. EVALUATION OF PRIVACY
PRESERVING
In privacy preserving data mining algorithms, a list of
evaluation parameters to be used for assessing its quality, is
given below:
 The performance, that is the time needed by
each proposed algorithm to hide a specified set
of sensitive information.
 The data utilized means utilization of the
specific data sets. The application of the
privacy preserving technique, which is
equivalent to the reduction of the information
loss or else the data loss in the functionality.
 The level of uncertainty in which the sensitive
information that have been hidden.
 The resistance is accomplished by the privacy
algorithms, with various data mining
techniques.
7. CONCLUSION
There is a need to develop transformation methods for
Boolean attributes. Correlation preserving Transformation
results into less information loss as it maintains the actual
general pattern of actual values. Transformation based
methods are also well suited for collaborative data mining,
where multiple parties need to share their databases for
efficient mining and accurate results.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
REFERENCES
[1] Dhanalakshmi, M., Sankari, S., (2014), “Privacy
Preserving Data Mining Techniques”, International
Conference on Computing and Network
Technologies, 3(2), pp: 6-11.
[2] Haung, J.W., Su, J.W., and Chen, M.S., (2011),
“FISIP: A Distance and Correlation Preserving
Transformation for Privacy Preserving Data
Mining”, IEEE Conference on Technologies and
Applications of Artificial Intelligence, 1(4), pp:
101-106.
[3] Jalla, H.R., Girjia, P.N., (2014), “An Efficient
algorithm for Privacy Preserving Data Mining
using Hybrid Transformation”, International
Journal of Data Mining & Knowledge Management
Process (IJDKP), 4(4), pp: 45-53.
[4] Malik, M.B., Ghazi, M.A., and Ali, R., (2012),
“Privacy Preserving Data Mining Techniques:
Current Scenario and Future Prospects”, Third
International Conference on Computer and
Communication Technology, 9(2), pp: 26-32.
[5] Modi, C.N., Patel, D.R., and Rao, U.P., (2010),
“Maintaining Privacy and Data Utility in Privacy
Preserving Association Rule Mining”, Second
472
ISBN: 978-81-924893-0-8
International conference on Computing,
Communication and Network Technologies, 2(1),
pp:1-6.
[6] Mukkamala, R., Ashok, V.G., (2011), “Fuzzy-
based Methods for Privacy-Preserving Data
Mining”, Eighth International Conference on
Information Technology, 8(2), pp: 348-353.
[7] Poovammal, E., Ponnavaikko, M., (2009), “An
Improved Method for Privacy Preserving Data
Mining”, IEEE International Advanced Computing
Conference (IACC), 5(2), pp: 1453-1458.
[8] Poovammal, E., Ponnavaikko, M., (2010), “APPT –
A Privacy Preserving Transformation Tool for
Micro Data Release”, ACM Digital Library and
Proceedings of ACM – W, Women in computing
Conference on Advances in Computing, 9(1), pp:
62-72.
[9] Vijayarani, S., Tamilarasi, A., (2011), “An Efficient
Masking Technique for Sensitive Data Protection”,
IEEE-International Conference on Recent Trends in
Information Technology, 1(1), pp: 1245-1249.
[10] Wang, J., Zhao, Y., (2009), “A Survey on Privacy
Preserving Data-Mining”, First International
conference on Database Technology and
Applications, 1(1), pp: 111-114.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Study on Design the Sensor for Control the Traffic Light
Time as Dynamic for Efficient Traffic Control
Divjot Kaur
Computer Science and Engineering,
BBSBEC, Fatehgarh Sahib, PUNJAB, INDIA
divjot.kaur511@gmail.com
ABSTRACT
Soft driving is a major concern of societies all over the world.
Most of people are killed or seriously injured due to accidents
each year, various investigation show that speeding is main
cause of road accidents. The major key region is growing at a
rapid speed. The average speed of vehicles is one of the main
parameters that have been widely used particularly in road
safety equipment designing and road working. The road safety
equipments are affected by some other parameters such as type
of road, days and type of vehicles either heavy or light. In this
paper, a survey had been conducted to study the efficient
performance of road safety equipments to control the traffic.
Keywords: Average Speed, Genetic Algorithm, Road Safety,
Traffic Light System.
1. INTRODUCTION
Traffic congestion is a serious problem in many cities and rural
areas also. So we can say that around the world. Traffic
congestion is a major challenge in the many and most populated
cities. When we can travel to two different places within the
same city then it is difficult for the traveler in traffic. Sometimes
due to traffic congestion problems the people lose many things
like time, opportunities. Traffic congestion also directly impacts
the industries areas. Due to traffic problem there is a loss of
productivity from workers are effect by traffic congestion,
delivery of products are also effect by traffic because delivery
gets delayed. All of the above thereby the costs goes on
increasing.
To solve the congestion problems, new facilities have to been
developed and provide new infrastructure also, but at the time it
make difficult again. When we can provide new infrastructure
there is a big disadvantage of making new roads is that the
surroundings become more congested. That’s why we have to
improve the system instead of making new infrastructures. For
example, most of the countries are working on their existing
systems to resolve these problems. When we can manage
transportation then mobility also improves the safety and traffic
flows. When we can enhance route guidance systems, public
transport, traffic signal improvements and incident
management, congestion problem can be reduced from the
analysis of US department of transportation, it has been found
that one major reason of congestion is the reoccurring of
congestion. Due to reoccurring congestion, the roads have been
used repeatedly. The non-recurring congestions which are
caused due to traffic incidents, special events, work zones,
weather etc. Reoccurring events reduces the capacity and
reliability of the transportation system.
The main goal of traffic research is to optimize traffic flow of
people and goods also. As the number of road user’s increases
and resources of infrastructures are limited, the intelligent
control of traffic will be a very serious issue in the future. There
are several models for traffic simulation. The flow of traffic
constantly changes, which depends on the time of day, the
week, and the year is also a complication. Roadwork and
473
ISBN: 978-81-924893-0-8
accidents further influence complexity and performance. Our
main concern is with the Traffic Control Light System. The
Traffic Lights are explained as below.
1.1 Traffic Light System
A traffic light system is used to minimize the traffic on road.
Traffic safety equipment are used to road safety like as
signaling device positioned at an intersection and road divider to
indicate when the traveler have to ride, drive, walk. The traffic
lights commonly have three main light colors, such as the red
light is stop and the meaning of green light is to go whether the
yellow light means ready to go. For the pedestrians, there are
only two light colors one is red and other is green light. There
are many benefits of traffic light system, besides reducing the
number of accidents. The government makes few rules to
overcome this problem such as punished to all those do not obey
the traffic rules. The traffic control lights placed at the location
where risk of accident is high or large jam is create. Increasing
the numbers of traffic lights also have problems those are as
below:
1.1.1 The heavy traffic jams
With advance in technology, the number of vehicle on roads are
increased, those creates the traffic jams. The jams are usually at
the main intersections in the morning time, before and after the
office hour. So that’s all reasons are effect the time of people.
1.1.2 The road user waits
The traffic light used as road safety equipment on road, but
sometimes traffic lights is the cause of wasting of time for
people. At the certain junction, but sometimes the red light are
occur but there is no traffic, the road users should wait until the
red light convert into green light. If peoples run the red light,
then they have to pay the fine.
1.1.3 Emergency vehicle stuck jam
Because of traffic jams, the emergency vehicle, such as police
cars, ambulance and the fire brigade stuck at the traffic lights,
because the users are waiting for green traffic light. It is very
critical problem, emergency become more complicated.
As above, we mentioned the main problems with the traffic
lights. There are various techniques to solve these problems. All
these techniques are reviewed under the literature survey.
2. LITERATURE REVIEW
Leena Singh et al. in [1] Real-time traffic signal is an
important part of the urban traffic light system. It provides
effective traffic control for complex traffic network problems
those are the challenging problems. The new model uses GA
which is implemented in MATLAB tool. The new model
optimizes the timing of traffic light signal in real time and then
provides optimum green time duration for all the four phases
depending upon the traffic conditions. An “intelligent”
intersection traffic control system was developed. The
developed system takes “real time” decisions to adjust the light
durations.
Javier J. Sanchez et al. in [2] studied a model is which
depends on Genetic Algorithms for optimization, on Cellular
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Automata for Simulation of Function, and also on the Beowulf
Cluster for parallel execution. Up to date traffic network
optimization has been faced using the Trial-And-Error method.
This method cannot ensure that the whole searching space is
covered. We propose a new method, a non deterministic
optimization one to solve this task. In this work we optimize
traffic light cycles.
Halim Ceylan et al. in [3] traffic signal and traffic assignment
problem are optimized by using GA. Signal duration is
described by network cycles and by the offsets between the
joints. The objective function in this paper is the performance
index (PI) of network. Genetic Algorithm (GA) is uses the
inversion of PI as the fitness function. The results show that the
GA is simpler than heuristic algorithm. Furthermore, results
from the tests conducted on road network shows that the
performance index is improved significantly.
Javier J. Sánchez-Medina et al. in [4] optimization
techniques such as genetic algorithms (GAs) for the
optimization; cellular-automata-based micro simulators for
traffic light times; and Multiple-instruction–multiple-
data(MIMD) also called Beowulf cluster multicomputer of
excellent price/performance ratio described positive experience
with the optimization of traffic lights in cities. A distinctive
feature of this paper is the large scale of the underlying grid.
Using the supplied maps and statistics, we have simulated the
present-day traffic behavior. Additionally, we have optimized
the traffic signal times, yielding better results with regard to
several predefined parameters.
Suhail M. Odeh et al. in [5] describes an intelligent traffic light
system to manage the congestion problem because of high flow
of traffic. The authors take two main highways and four
intersection areas for the experimental study of system. The data
regarding the flow of traffic and other parameters are collected
from a video imaging system which captures the images. These
images are used to detect and count the number of vehicles. All
the collected data, images are transferred to another system
based on GA. The system depends on rules those are used to set
the green light interval time.
Martin Kelly et al. in [6] the values of the parameters
governing the simulations are identified through the use of a
genetic algorithm. In a first instance, we will continue pursuing
experiments with the current model in order to identify
additional optimums; then we will extend the current
experiments by comparing with other techniques and evaluating
the current model under different congestion situations. Second,
another model is planned which will tackle re-routing of
emergency vehicles only. We are also planning to combine
these two models together where both regular and emergency
vehicles are re-routed and traffic globally optimized. Third, as
most simulations of car traffic control, we are using a square
grid of routes for modeling the city.
Emad I Abdul Kareem et al in [7] The traffic flow in urban
areas is managed by using traffic lights. But the light system
causes long time for vehicles to wait till there is traffic or there
is no traffic. In urban areas there is a fixed number of traffic-
cycle. To improve the traffic light configuration, the current
monitoring system needs to be improved. The other option is to
add additional component to the traffic light system, which will
be capable to find the three cases such as empty, crowd and
normal and stored that in the memory. This study has to develop
an intelligent vision traffic light monitoring system via
associative memory in order to demonstrate an improvement in
474
ISBN: 978-81-924893-0-8
traffic light configurations. To Improve traffic light, an
Intelligent Traffic Light Monitor System using Memory to
reduce wasting of fuel due to unnecessary waiting times at
intersections and the wasted time and lost lives of vehicle users.
K. T. K. Teo et al. in [8] studied the optimization of traffic
light systems to control traffic. The traffic light systems are
made to control the flow of traffic in the intersections to make
sure that traffic flow is within control in the traffic network.
When there is high traffic flows that cannot be controlled by the
current traffic light systems then the long queues are made at the
intersection areas. Genetic algorithm is used to get the optimal
solution for the reduction of queue length and to control the
traffic flow. Genetic algorithm takes queue length of traffic as
input. The output is the optimized duration of green time. The
results of Genetic algorithm are improved for the incoming
traffic when the red light is turn on.
Shailendra Tahilyani et al. in [9] studied congestion problem
of urban areas which becomes very critical. This problem
increases with the increase in the number of vehicles. The un-
expandable traffic infrastructure also causes congestion. New
lane algorithm/techniques have been developed to solve this
congestion problem and make the traffic flow smooth on roads.
Genetic algorithms are used as optimization method. Finally,
the results of the proposed algorithm are able to deal with this
probelm. A new approach is introduced to deal with the traffic
congestion on the road networks. A new lane by pass based
approach is introduced using genetic algorithms. The results are
found satisfactory.
3. FUTURE WORK
3.1 Problem Formulation
 The current traffic light systems provide a fixed traffic
control plan. The settings of these systems are based on
traffic counts. The monitoring and control of city traffic
light is becoming a major problem.
 There are several types of conventional methods of traffic
light control; however they fail to deal effectively with
complex and time varying traffic conditions. There is a
need to research on new types of highly effective practical
traffic light controllers.
 In our work, we will propose a new development of a
traffic light control system. This system will manage the
time duration of RED and GREEN lights to decrease the
traffic congestion at traffic light. Our system will reduce
the delay, hi-jack etc.
3.2 Objective
1. To conduct a review of the traffic controlling systems.
2. To study the traffic congestion Problems.
3. Propose an Algorithm to make a dynamic traffic light
system.
4. Make the duration of GREEN and RED lights a variable
one according to the traffic volume.
4. CONCLUSION
The major key region of traffic congestion is unbalanced traffic
light management system. The average speed of vehicles is one
of the main parameters that have been widely used particularly
in road safety equipment designing and road working. The road
safety equipments are affected by some other parameters such
as type of road, days and type of vehicles either heavy or light.
In this paper, a survey had been conducted to study the efficient
performance of traffic light system to control the traffic.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
REFERENCES
[1] Arora Himakshi, Singh Leena, Tripathi Sudhanshu, 2009,
"Time Optimization for TSC (Traffic Signal Control)
Using GA" IJRTE, Vol 2, No. 2.
[2] Enrique Ruhio, Galan Manuel, Javier J.Shchez, 2004, " GA
and Cellular Automata: A New Architecture for TL
(Traffic Light) Cycles Optimization ". 07803-85 15-
2/04/$20.00 lEEE.
[3] Ceylan Halim, Michael G.H. Bell, 2003, "TSTO (Traffic
signal timing optimisation) based on GA approach,
including drivers_ routing " Elsevier Ltd. All rights
reserved.
[4] Enrique Rubio Royo, Javier J. Sanchez Medina, Manuel J.
Gal ́an Moreno , Moises Dıaz Cabrera, 2009, "Traffic
Signals in Traffic Circles: Simulation and Optimization
Based Efficiency Study " UROCAST, LNCS 5717, pp.
453–460, c©Springer-Verlag Berlin Heidelberg.
[5] Suhail M. Odeh, 2013, "Management of An Intelligent
(TLS) Traffic Light System by Using GA" Journal of
Image and Graphics Vol. 1, No. 2.
475
ISBN: 978-81-924893-0-8
[6] Giovanna Di Marzo Serugendo, Martin Kelly, 2007, " A
decentralised car traffic control systemsimulation using
local message propagationoptimised with a genetic
algorithm", 1-4244-1396-6/07/$25.00 © IEEE.
[7] Aman Jantan, Emad I Abdul Kareem, 2011, "An Intelligent
Traffic Light Monitor System (TLMS) using an AAM
(Adaptive Associative Memory)" International Journal of
Information Processing and Management. Number 2,
Volume 2.
[8] K. T. K. Teo, “Fuzzy Multiobjective Traffic Light Signal
Optimization”.
[9] Shailendra Tahilyani,Manuj Darbari and Praveen Kumar
Shukla” A New GA Based Lane-By-Pass Approach for
Smooth TF on Roads” IJARAI, Vol. 1, No. 3, 2012.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Quality Aspects of Open Source Software
Amitpal Singh
Department of Computer Science & Engineering
Guru Nanak Dev University, Regional Campus
Gurdaspur, Punjab, India.
apsohal@yahoo.com
ABSTRACT
This paper reviews the quality aspects of free and open source
software systems. We start with brief history followed by
introductory definition of open source software development.
Then we discuss the quality in terms of Functionality,
Reliability, Usability, Maintainability, Portability and
Efficiency of Open Source Softwares. Looking upon
arguments pertaining to quality of Open Source Software
development, we advocate the adoption of Open Source
Softwares by the masses.
Keywords
F/OSS, OSSD.
I. 1. INTRODUCTION
Free and open Source Software Development is a technique
of building, deploying and sustaining large software systems
on global basis which makes it entirely different form the
traditional software engineering practices. It is the process of
developing and managing the software by a geographically
distributed team most of whom never have a face to face
interaction. Source code in human readable form is available
on-line for use, study, reuse, modification, enhancement and
redistribution. First a community is formed followed by
software development and related artifacts. Communication
among community members is openly accessible and publicly
available over the Internet.
2. BRIEF HISTORY
It all started at AT & T lab with UNIX which was the first
Operating System not written in a hardware dependent
assembly language (was written in C). This was considered to
be the first step towards portability. Portability was the most
important reason why people, using different hardware,
developed interest in it. Most of the research during 1970s
was focused on
• writing a program that do one thing and do it well.
• writing programs to work together
• write a program that handle text streams.
With the work of Thompson and presentation of papers at the
symposium on Operating System Principles in Yorktown
heights, NY, in October 1973, UNIX became popular and its
installations grew many folds. Due to certain legal reasons
AT & T was prohibited from doing any other business (like
Software development) except telephone or telegraph.
To escape legal obligations , UNIX was provided as
• no advertising
• no support
476
ISBN: 978-81-924893-0-8
Harjot Kaur
Department of Computer Science & Engineering.
Guru Nanak Dev University, Regional Campus
Gurdaspur, Punjab, India.
harjotkaursohal@rediffmail.com
• no bug fixes
• payment in advance
Without support and bug fixes the growing community
of UNIX users were forces to help themselves, therefore they
started to share ideas, information, programs, bug fixes and
hardware fixes. Hence, a new concept of system design was born.
The term “open source initiative” was coined in 1998. Since then
a new ideology that promises a lot in terms of economics,
development environment and unrestricted user involvement has
been evolving in a big way thrust-ed into the big picture by
loosely-centralized and cooperative community contributions in
the field of software engineering. It is a battle for the increasing
need of high quality and reliable softwares in spite of increasing
complexity of applications [1].
3. WHAT IS OPEN SOURCE SOFTWARE
Free/Open Source Software (F/OSS) is relatively a new,
alternative, idea of software development in the area of software
engineering. A piece of software is F/OSS when its distribution
license fulfills the “four freedoms” of F/OSS [4]. Freedom to
• use it at wish
• copy and redistribute
• modify it but source code has to be distributed along with binary
version of the software
There are mainly two major promoters of F/OSS:
I) The Free Software Foundation : Responsible for the famous
GNU Project
II) The Open Source Initiative : Keeps a repository with “Open
Source” compliant licenses.
The main idea behind development process of F/OSS is that a
single person or a group of people have an idea about a software
product or they want a particular software to address a particular
need. Then they start discussion with their friends and colleagues
about possible solution and making the code base. So they write a
first release of that software to satisfy their needs, their “personal
itch” [3]. They put that software on-line, along with its source
code, and inspire others to contribute to the project by sending
either bug fixes or functional improvement for the software hence
leading to formation of project community [2]. They may
announce their project at places like mailing lists, newsgroups or
on-line news services. At some point these contributions are
incorporated into source code of the product and next test version
of the software is released. After rigorous testing and new code
submissions, test version of the software becomes next stable
release. Then new contributions are made and this process of
release, code contribution (bug fixing and/or functional
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
improvement), code integration into the current one, next
release continues in a circular manner. The evolution of the
product is done by a single or a group of coordinators, who
are responsible for deciding which piece of new code will be
incorporated into the current one. The coordinators are
usually the initial creators of the software and in most cases
have a strong impact on evolution and success of the product.
As the project grows more and more people get attached and
a lot of feedback helps to get a better understanding of the
issue, and possible strategies to solve it. New information and
resources are integrated into the research process. The
solution grows, and addresses the issue in ever better ways.
Open Source is a license to apply to the work that is freely
available. If we take into consideration the development side
then it is a philosophy. It is a different development method
but the way of coordination and communication is something
that makes the real difference.
4. QUALITY OF OPEN SOURCE
SOFTWARES
Quality means that whether or not the product conforms to a
set of standards posed by someone either the manufacturer or
the customer. According to the pioneers of Open Source
Software movement, one of the most acclaimed advantages is
its superior quality. But this suggestion is still an open issue,
since there is little concrete evidence to justify whether
quality for every open source software is better or worse than
that of proprietary software products.
The general aim of this discussion is to look into the current
status of F/OSS quality and to assess its performance in
various aspects of quality. We will try to find out answers to
various questions raised by the assertion concerning the
quality of F/OSS.
Basic quality model that is widely accepted is ISO 9126
quality model which was developed in 1991 in order to
combine several views of software quality. ISO 9126 is a
hierarchical model consisting of six major attributes
contributing to software quality. These attributes are
 Functionality
 Reliability
 Usability
 Maintainability
 Portability
 Efficiency
Fig 1 : ISO 9126 - Quality Characteristics of Software
Source : ESSI-SCOPE Quality Characteristics and their application ,
www.cse.dcu.
477
ISBN: 978-81-924893-0-8
Let us discuss the quality of Open Source Softwares by taking
each factor one by one.
4.1 Functionality: ISO 9126 defines, functionality as “A
set of attributes that bear on the existence of a set of functions and
their specified properties. The functions are those that satisfy
stated or implied needs” [5].
Products developed using open source mechanism are a kind of
“monopoly” in their application domain. Some well known
examples are “category killer” like BIND (Berkeley Internet
Name Domain) Server which is a critical and dominating Domain
Name System for Internet's infrastructure. Another well-known
application is Apache Web Server which is globally used by huge
number of web servers.
The latest data collected from netcraft.net [6] shows that Apache
has about 39% of market share which is highest for any web
server. We have enough literature to prove that the functionality
offered satisfies majority of web server administrators and web
hosting companies. Some other well known and widely accepted
open source applications are various flavors of Linux operating
systems : like Red Hat, Fedora, Ubuntu etc.; Graphical User
Interfaces : like GNOME, KDE, Ximian etc. ; Office Suites : like
Open Office, Koffice, GNOME Office, Gimp, Kile etc.; Network
Applications : like Apache, BIND, Sendmail, Mozila, Samba and
Programming Languages like : GCC,Perl,Python,php etc. These
products have same functionality as that of other similar
proprietary softwares.
Free Open Source Software tries to be compliant with open
standards which means development in a democratic way where
any one is free to contribute and suggest things. Every possible
effort is done to promote functionality and interoperability.
4.2 Reliability: ISO 9126 defines reliability as “A set of
attributes that bear on the capability of software to maintain its
performance level under stated conditions for a stated period of
time” [5]. It is crucial to ensure reliability for applications like
online shoping, banking applications etc. that run round the clock
over Internet. Proponents of F/OSS claim that there is enough
evidence to support that F/OSS is more reliable than proprietary
software.
Most important factor that directly affects reliability is the
frequency of bug discovering. Bug discovering as described by
Eric Raymond [3] postulation: “Given enough eyeballs, all bugs
are shallow” holds good in case of F/OSS. Once a version of
software is released, it is a matter of days, hours or even minutes
before the first bug is reported and the official fix is announced
[7] .
One such example is of Teardrop attack described by Hissam,
Plakosh & Weinstock [8]. What happened was that a flaw in the
Linux kernel's IP stack caused the system to crash, when a special
type of IP packet was received. The reason for selection of this
attack is that it was also affecting another well known closed
source operating system. For Linux, the vulnerability was fixed
within few hours. The patch for other closed source operating
system took a lot longer to be published and successive patches
were needed for resolving the problem.
Another fact that makes F/OSS more recoverable is that these
patches are immediately put on line and are included in the code
stored in the CVS 8 repository of the product.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
F/OSS depends heavily on fast and effective communication
between developers and users. Open source softwares can
only be a success when highly stable and secure
communication channels are ensured.
One additional feature, which plays a critical role in software
product quality, is defect density.
It was found out by Mockus et al [9] that defect density of
open source code before system test is much lower which
means better development process is followed and fewer bugs
are inserted into the code at the time of development. In
addition, due to availability of source code testing and
debugging conducted by peer reviewers is more efficient.
One important question raised is whether F/OSS is more
secure than proprietary software. As the code is open so it is
not only open for the developer, but also for the potential
attacker. So what is the benefit?
According to Landwehr & Caloyannides [10], it is not only
the source code, but the compiler that was used to make it
executable. It is possible for the compiler to insert various
malicious parts in the software for later use. Open source
software let the users review their code and investigate the
existence of such back doors and other kinds of flaws in
software. It is not certain in all cases that F/OSS is more
secure than proprietary software, but the openness of the code
is definitely a positive aspect in improving the final product.
4.3 Usability: Usability may be defined as the ease with
which a user can learn to operate any system. According to
ISO 9126 model usability is defined as “A set of attributes
that bear on the effort needed for use and on the individual
assessment of such use by a stated or implied set of users”
[5]. Many people within the F/OSS community realize that
usability must be a core issue for F/OSS if it wants to attract a
critical mass.
Michelle Levesque [11] found five most important flaws with
Open Source software development which should be kept in
mind to improve its usability. They area
 User interface design
 Documentation
 Feature–centric development
 Programming for the self
 Religious blindness
According to another F/OSS pioneer Brian Behlendorf [12]
end-user applications are hard to write, not only because a
programmer has to deal with a graphical, windowed
environment which is constantly changing, nonstandard and
buggy simply because of its complexity, but also because
most programmers are not good graphical interface designers.
For better or worse, good programmers are not necessarily
good communicators and graphical user interfaces are a form
of non verbal communication [13]. Feller and Fitzgerald [4]
states that the non-developers will focus not only on the
availability of the source code, but mainly on the quality and
the support of the product.
The community of F/OSS does not pay so much attention to
the usability issues that they themselves do not experience as
they belong to the upper class of programming professionals
[4]. The parties involved care for the software to meet their
own demands of usability and do not take into consideration
other users. They cannot imagine how a system looks like for
a novice user and how easy it is to operate it.
Usability problem arise due to the inherent difference
between the developer and users. F/OSS usability seems to be
no better than that of the proprietary software and suffers
478
ISBN: 978-81-924893-0-8
from the same problems that the commercial software does. The
problems with the usability were understood since long and
considerable efforts were made by the community to resolve the
problems. The two major Linux desktop environments, GNOME
and KDE, have identified the problem of usability and have
launched “Usability Projects” to investigate and improve the
usability [14].
Since few years the ease of operation of Open Source Softwares
have improved a lot. As per my own experience around year 2001
installation of Linux was a job of a professional only. One has to
be well versed with machine configuration but now the
installation is as easy as any proprietary operating system. So over
the passage of time community has realized the importance of
usability and is successful in improving the same with various
design recommendations.
Various studies were conducted to compare the usability of F/OSS
and proprietary application like Sun StarOffice with Microsoft
Office and OpenOffice [16], F/OSS and proprietary operating
system GUI [15] and many more. The main result of these studies
was that the usability of F/OSS and proprietary applications has
been evaluated to be nearly equal.
4.4 Maintainability: Maintainability has to do with the
easiness of code modification. Maintenance is defined by the
IEEE as “the process of modifying a software system or
component after delivery to correct faults, improve performance
or other attributes, or adapt to a changed environment” [17].
F/OSS development makes software source code available over
the Internet thereby enabling developers from across the globe to
contribute code, adding new functionality or improving the
previous one and submitting bug fixes to the present release. A
part of these contributions are incorporated into the next release
and the loop of release, code submission/bug fixing, incorporation
of the submitted code into the current and new release is
continued [2]. Hence F/OSS development involves frequent
maintenance for debugging existing functionality and adding new
one to the system.
Different studies on various attributes affecting maintainability
such as testability, simplicity, readability and self-descriptiveness
has been performed. These studies have revealed 50-50 ratio of
good and bad maintainability. One such study to compare the
Maintainability Index [18] of the Apache, Mozilla Firefox, MySql
and FileZilla software was observed over fifty successive
versions. From the results it was observed that the Mozilla Firefox
has the highest maintainability index value and the Apache has
the lowest maintainability index. Studies also show that closed
source software maintainability is no better than that of open
source software.
4.5 Portability: Portability in high-level computer
programming is the usability of the same software in different
environments. The pre-requirement for portability is the
generalized abstraction between the application logic and system
interfaces. When software with the same functionality is produced
for several computing platforms, portability is the key issue for
development cost reduction[19].
Portability was perhaps one of the very first requirement for
emergence of open source softwares. F/OSS systems are built to
enhance the ability of softwares to be used on platforms with
different architectures. The availability of source code makes it
possible for the developer to port an existing F/OSS application to
a different platform than the one it was originally designed for.
The most famous F/OSS, the Linux kernel, has been ported to
almost all CPU architectures like Alpha architecture, ARM
architecture, IBM, Intel IA-64 Itanium, x86 architecture, MIPS
architecture, PowerPCs, Alphas, SPARCs and many more[20].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The creators of Linux have tried to make its design as clean Conference for Mathematics and Informatics for Industry,
as possible and have used loadable kernel module in order to MATHIIND, Thessaloniki, Greece , April 2003.
make it more portable. In Linux practical interfaces and core [3] Raymond, E.S. 2002. The cathedral and the bazaar,
code is architecture independent. Wherever performance is http://www.tuxedo.org/~esr/ writings/ cathedral- bazaar/.
critical kernel features are tuned for each architecture [21]. [4] Feller, J. and Fitzgerald, B. 2001. Understanding Open Source
The F/OSS world adheres the most popular portability Software Development,Addison-Wesley.
standard i.e. IEEE POSIX (Portable Operating System [5] ISO/IEC 9126, http://en.wikipedia.org/wiki/ISO/IEC_
Interface) standard and ISO C. Using IEEE POSIX standard, 9126.
it is possible to compile source code and run that on different [6] March 2014 Web Server Survey, http://news.netcraft.com/
platforms. archives/category/web-server-survey
[7] Schmidt, D.C. and Porter, A. Leveraging Open-Source
4.6 Efficiency: ISO/IEC 9126 defines efficiency as “A Communities To Improve the Quality & Performance of Open-
Source Software, Making Sense of the Bazaar, Proceedings of the
set of attributes that bear on the relationship between the
1st Workshop on Open Source Software Engineering at
software's performance and the amount of resources used
ICSE,2001, Feller, J. , Fitzgerald, B. & Van der Hoek, A. (Eds.),
under stated conditions” [5].
http://flosshub.org/sites/flosshub.org/
The efficiency of open source Softwares has not been
files/schmidt.pdf
investigated much as only few objective and scientific studies
[8] Hissam, S.A., Plakosh, D. & Weinstock, C. ,Trust and
have been found. There is a need of more academic studies to
Velnerability in open source software, IEEE Proceedings –
prove the effectiveness and efficiency of open source
Software, 2002, vol. 149 No. 1, pp. 47-51
softwares. Many major software development companies,
[9] Mockus, A., Fielding, R. and Herbsleb, J.D. Two case studies
research and development labs, huge business organizations,
of open source software development: Apache and Mozilla.,
financial concerns, art and entertainment industry and so on
ACM Transactions on Software Engineering and Methodology,
rely on open source products for their operations. So one
Vol. 11, No. 3 , 2002, pp. 309-346.
cannot doubt the efficiency of open source products. There
[10] Witten, B., Landwehr, C., Caloyannides, M. Does Open
use in big firms is a direct indication of performance,
Source Improve System Security, IEEE Software Archive, Vol.
efficiency and reliability.
18, No. 5, Sept. 2001, pp. 57-61.
[11] Levesque, M. Fundamental issues with open source software
5. CONCLUSION development, First Monday, Vol. 9, April 2004.
[12] Behlendorf, B. Open Sources: Voices from the Open Source
We have explained the reliability of open source software in
Revolution, Open Source as a Business Strategy, MA: O'Reilly
terms of its constituent components which are Functionality,
and Associates, Chris DiBona, Sam Ockman and Mark
Reliability, Usability, Maintainability, Portability and
Stone(Eds), Jan. 1999, pp. 126-144.
Efficiency. We have found that even though it is a different
[13] Bentley, J.E. 14 Steps to a Good GUI, Proceedings of the
methodology of software engineering yet these products have
Twenty-Fourth Annual SAS® Users Group International
same functionality as that of other similar proprietary
Conference, Fontainebleau Hilton Resort and Towers Miami
software. It is not certain in all cases that F/OSS is more
Beach, Florida, April 1999.
secure than proprietary software, but the openness of the code
[14] Smith,S., Mankoski, A. Fisherberg, N. Pederson and C.
is definitely a positive aspect in improving the final product.
Benson, GNOME Usability Study Report,
Taking into consideration the usability of F/OSS and
http://developer.gnome.org/projects/gup/ut1_report/report_main.h
proprietary applications it is evaluated to be nearly equal.
tml, July 2001.
Studies on various maintainability issues like testability,
[15] LeMay, R., Ubuntu 9.04 as slick as Windows 7, Mac OS X,
simplicity, readability and self-descriptiveness has revealed
http://news.cnet.com/ubuntu-9.04-as-slick-as-windows-7-mac-os-
50-50 ratio of good and bad maintainability which happens to
x},2009.
be same as that of proprietary software. Taking portability
[16] Beckett, G. and Muller, J. A Feature Comparison of MS
into account, it is possible to compile source code and run
Office, StarOffice and OpenOffice.org,
that on different platforms. One cannot doubt the efficiency
http://www.opensourceacademy.org.uk/...comparison/feature-
of open source products as big firms are successfully using it.
comparison.pdf, December2005.
Looking at various quality aspects of open source software it
[17] IEEE Standard, Glossary of software engineering
is very clear that the methodology delivers very high quality,
terminology,IEEE Std 610.12-1990., https://standards.Ieee.
secure, stable and economical viable software in a short
org/findstds/standard/610.12-1990.html .
period of time. We are of the view that it is very difficult to
[18] Ganpati, A., Kalia, A. and Singh, H., A Comparative Study
clearly demarcate the application areas of open source and
of Maintainability Index of Open Source Software, International
proprietary softwares. There are n number of application
Journal of Emerging Technology and Advanced Engineering, Vol.
areas and there are n number of softwares available for
2, No. 10, ISSS 2250-2459, October 2012.
serving the purpose. We always have an alternate to
[19]Software Portability, http://en.wikipedia.org/wiki/
proprietary software but to use OSS or not is clearly the
Softwareportability.
choice of user.
[20]List of Linux supported architectures,
http://en.wikipedia.org/wiki/List_of_Linux_supported_architectur
6. REFERENCES es
[1] Asundi, J., 2001. Software engineering lessons from open [21] R. Love, LINUX Kernel Development, Portability, Pearson
source projects. In 1st workshop on Open Source Software, Education, 2 Edition, ISBN 978-81-7758-910-8, 2009, pp. 322
ICSE, 2001.
[2] Samoladas, I. and Stamelos, I., Assessing the Quality of
an Open Source ERP/CRM System. 1st International

479
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Study of Shannon and Renyi entropy based
approaches for Image Segmentation
Baljit Singh
BBSBEC, Fatehgarh Sahib
baljit.singh@bbsbec.ac.in
ABSTRACT
Image segmentation partitions an image into multiple
segments, based on properties of discontinuity and similarity.
One of the simplest methods for image segmentation is
thresholding that is used to discriminate foreground from the
background of an image. The selection of suitable threshold
value in the image is a challenging task. Thresholding value
depends upon the randomness of intensity distribution of the
image. Entropy is a parameter to measure the randomness of
intensity distribution of the image. In this paper, Shannon-
entropy based and Non-Shannon (Renyi) entropy based
approaches are used to select suitable threshold value. After
this, thresholding values obtained from 10 standard test
images are evaluated using Peak Signal to Noise Ratio(PSNR)
and Uniformity and it is observed that Renyi entropy based
approaches is a better measure than Shannon entropy based
approaches.
Keywords
Image segmentation, Thresholding, Shannon Entropy,
Histogram, Renyi Entropy.
1. INTRODUCTION
Segmentation is a process that subdivides an image into a
number of homogeneous regions. Each homogeneous region
is a constituent part or object in the entire scene. The objects
on the scene need to be appropriately segmented and
subsequently classified. The result of image segmentation is a
set of segments that collectively cover the entire image. All
the pixels in a region are similar with respect to some
characteristic or computed property, such as color, intensity or
texture. Segmentation algorithms are based on one of two
basic properties of intensity values discontinuity and
similarity. First category is to partition an image based on
abrupt changes in intensity, such as edges in an image. Second
category is based on partitioning an image into regions that
are similar according to predefined criteria [12].
There are various methods for image segmentation depending
on the basis of threshold value and on the basis of entropy
values.
(I) Image Segmentation Methods on the Basis of Threshold
Selection: The technique used in segmenting the image is
called the thresholding method. This method is based on a
threshold value which converts a grey scale image into a
binary image. Threshold plays an important role in the image
segmentation, it can be selected manually or automatically. A
simple method is to choose a mean or median, the rationale
480
ISBN: 978-81-924893-0-8
Parmeet Kaur
BBSBEC, Fatehgarh Sahib
pparmeetkaur@gmail.com
being that if the object pixels are brighter than the
background, then they should be brighter than the average.
The advantage of obtaining a binary image first is that it
reduces the complexity of the data, simplifies the process of
recognition and classification also reduces the storage space.
All the gray level values below this T will be classified as
black (0) and those above T will be white (1). The
segmentation accuracy can be maximized by an appropriately
chosen threshold value. Among all the existing segmentation
techniques most use the Shannon Entropy [1, 13]. It can be
Global, Local, Single, Multilevel thresholding. Global
techniques are further classified as: point-dependent and
region-dependent techniques. Point detection techniques such
as P-tile, Mode method, Mean histogram dependent
Technique & Ostu method are discussed [2, 11]. Color image
Segmentation is also used for Thresholding [15].
Various threshold selection techniques are:
(A) Basic Global Thresholding: This method is relatively
simple, does not require much knowledge of the image and is
robust against the noise. An initial threshold (T) is randomly
chosen and the image is then segmented into object and
background pixels.
(B) Histogram-based methods: They are very efficient when
compared to other image segmentation methods because they
typically require only one pass through the pixels. In this
technique, a histogram is computed from all of the pixels in
the image, and the peaks and valleys in the histogram are used
to locate the clusters in the image [6].
(C) Region growing methods: Region growing is a procedure
that group pixels or sub-region into larger regions based on
predefined criteria for growth. This iterative approach to
segmentation examines neighbouring pixels of initial seed
points and determines whether the pixel neighbors’ should be
added to the region. [5, 17].
(D) Edge based segmentation: This is used to detect and
locate the edges in the image. A standard test image is used to
compare the results with Laplacian of Gaussian edge detector
operator [9].
The information theoretic approach based on the concept of
entropy was introduced by Shannon [3]. The principle of
entropy is to use uncertainty as a measure to describe the
information contained in a source [14]. In information theory
there are different types of Non-Shannon entropy such as
Renyi entropy, Havrda and Charvat, Vajda, Kapur &Tsallis
entropy [16]. The author had evaluated two-dimensional
Renyi entropy obtained from the two-dimensional histogram
which was determined by using the grey value of the pixels
and the local average grey value of the pixels. The Renyi
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Entropy is extended by the author, while still preserving m n

overall functionality, to improve accuracy. The priori  I (i, j )
i 1 j 1
modification allows addition of texture information in an
k (2)
efficient way, which results in more accurate thresholding. mn
Furthermore, the proposed mechanism allows addition of
Step4. Let p1, p2,…..,pk-1 be the probability distribution of a
other features after some normalization [7, 8].
grey level image.
Non-Shannon entropies have a higher dynamic range than
k 1
, Pk 1   p i
Shannon entropy over a range of scattering conditions, and are h(i)
Step5. In this, p(i)  ,
therefore useful in estimating scatter density and regularity
m n i 1
[10]. Main advantage of non-Shannon measures of entropy
t
over Shannon entropy is that non-Shannon measures of
Pt   p j , t is the threshold value and L is the maximum
entropy have parameters (α in case Renyi) that can be used as
j 1
adjustable values. These parameters play an important role as
grey level value in the image.
tuning parameters in the image processing chain for the same
class of images [4, 12]. Peak Signal to Noise Ratio (PSNR) is Step6. Segment the image into two parts i.e. Foreground and
used to evaluate the thresholding because it can measure the Background.
similarities between the original image and the binarized Algorithm for Shannon Based Entropy
image. A higher PSNR indicates more similarity between the S.1 Shannon Entropy using Foreground Region
two images [13]. t
pi  pi 
S F (t )   log   (3)
2. SHANNON AND RENYI ENTROPY i k Pt  Pk 1 e
 Pt  Pk 1 
Entropy is a concept of information theory. Entropy is used to S.2 Shannon Entropy using Background Region:
measure the amount of information [1]. The principle of L
pi  pi 
entropy is to use uncertainty as a measure to describe the S B (t )   1  P log  1  P  (4)
 
e
information contained in a source [14]. Entropy, thus, i t 1 t t
characterizes our uncertainty about our source of information.
S.3 For Optimal Thresholding
It is defined in terms of the probabilistic behavior of a source
of information. In accordance with this definition, a random T  max[S F (t )  S B (t )] (5)
i
event (A) that occurs with probability P (A) is said to contain
where i=k,…,L
I (A) = log[1/ P (A)] = -log [P (A)] (1)
S.4 Segment the image using T
units of information. The amount I (A) is called the self-
information of event A. The amount of self-information of the 0 if I (i, j )  T 
event is inversely proportional to its probability. The basic S (i, j )    (6)
concept of entropy in information theory has to do with how 255 if I (i, j )  T 
much randomness there is in a signal or in a random event. Algorithm for Renyi Based Entropy
This approach uses the Shannon entropy originated from the R.1 Renyi Entropy using Foreground Region:
information theory considering the gray level image

histogram as a probability distribution 1  t  p  
Shannon based entropy provides an absolute limit on the best RF (t ) 
1
log e   P  P  
i
(7)
possible average length of lossless encoding or compression.  i k  t k 1  

Globally, for the whole data, or locally, to evaluate entropy of R.2 Renyi Entropy using Background Region:
probability density distributions around some points. It

provides additional information about the importance of 1  L  p  
specific events, Here P is Probability Distribution and K is no RB (t )  log    i   (8)
of pixels /Total no of pixels. 1 e
i t 1 1  Pt  
The basic steps of the algorithm are reproduced here for the where α≠1, α>0
sake of convenience:
R.3 For Optimal Thresholding
Step1. Read input image I.
Step2. Histogram of an input image h(I) and size of an T max[ RF (t )  RB (t )] (9)
i
image(m×n) is calculated. where i=k,…,L
L
h( I )   I (i, j )
R.4 Segment the image using T
(1)
i 1 0 if I (i, j )  T 
S (i, j )    (10)
Step3. Calculate the average of an image
255 if I (i, j )  T 

481
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3. PERFORMANCE MEASURES c
2  c     f i  ui 
2
In order to avoid human interpretation, two objective
j=0 iR j
measures, Peak signal to noise ratio and uniformity [15], have U =1 (7)
m  n   f max  f min 
2
been used for performance evaluation.
Peak signal to noise ratio: PSNR measure the similarities
where c is the no of threshold, Rj is the segmented region j, fi
between the original image and the binarized image. A higher
is the grey level of pixel i, uj is the grey level of those pixels
PSNR indicates more similarity between the two images. It is
in segmented region j, m*n is the total pixels, fmax is the
most easily defined via the mean squared error (MSE) which
maximum grey level pixel in given image. fmin is the minimum
for two m×n monochrome images f and g where one of the
grey level pixel in given image.
images is considered a noisy approximation of the other is
defined as:-
m 1 n 1 4. EXPERIMENTAL RESULTS
  f i, j   g i, j 
1 2
MSE = (5)
m  n i=0 j=0 The PSNR and the Uniformity measure for ten standard
The PSNR is defined as: images have been calculated and tabulated in Table 1. The
optimal threshold value of Shannon and Renyi based entropies
Max f for the 10 standard images are tabulated in Table 2. The
PSNR = 20log10 (6) original images are labeled as Fig 1(a)-10(a). The histograms
( MSE ) of these images have been prepared and shown in Fig 1(b)-
where MAXf is the maximum possible pixel value of the 10(b). Fig 1(c)-10(c) depict the Image Segmentation using
image. When the pixels are represented using 8 bits per Shannon based entropy while Fig 1(d)-10(d) represent the
sample, this is 255. Image Segmentation using Renyi based entropy.
Uniformity measure: The uniformity measure is generally
used to describe region homogeneity in an image. For a given
threshold t, it is defined by

(a) (b) (c) (d)

Fig 1: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

(a) (b) (c) (d)

Fig 2: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

(a) (b) (c) (d)

Fig 3: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

482
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

(a) (b) (c) (d)

Fig 4: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

(a) (b) (c) (d)

Fig 5: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

(a) (b) (c) (d)

Fig 6: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

(a) (b) (c) (d)

Fig 7: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

(a) (b) (c) (d)

Fig 8: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

483
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

(a) (b) (c) (d)

Fig 9: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

(a) (b) (c) (d)

Fig 10: (a) Original image (b) Histogram (c) Segmented image using Shannon Entropy (d) Segmented image using Renyi
Entropy

Table 1. Parameters to evaluate the Entropy using Peak Signal to Noise Ratio and Uniformity

S.No Test Image Shannon – Entropy based Approach Renyi - Entropy based Approach
PSNR Uniformity PSNR Uniformity
1 Pattern (512×512) 9.2782 0.8160 9.3286 0.8180
2 Man (1024×1024) 8.4540 0.7966 9.6147 0.8158
3 Walter Cronkite (256×256) 9.3572 0.7997 9.6049 0.8063
4 Mandi (2014×3039) 11.3334 0.8758 11.3548 0.8743
5 ChemicalPlant1 (256×256) 8.6486 0.7354 9.0774 0.7499
6 Chemical Plant2 (256×256) 7.7286 0.6705 8.6022 0.7245
7 Bridge (200×200) 7.8374 0.7157 8.9884 0.7771
8 Croud (200×200) 7.2072 0.6786 8.2088 0.7431
9 Concordorthophoto (2215×2956) 7.7014 0.6916 8.4069 0.7335
10 Lines (200×200) 7.0590 0.6596 8.8867 0.7732

Table 2. The optimal Threshold value of Shannon and Renyi based entropy at α =0.7 for Renyi

S.No Test Image TSopt TRopt

1 Pattern (512×512) 160 158
2 Man (1024×1024) 172 115
3 Walter Cronkite (256×256) 147 133
4 Mandi (2014×3039) 145 113
5 ChemicalPlant1 (256×256) 172 120
6 Chemical Plant2 (256×256) 174 141
7 Bridge (200×200) 185 150
8 Croud (200×200) 191 171
9 Concordorthophoto (2215×2956) 168 139
10 Lines (200×200) 186 152

484
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5. CONCLUSION
In this paper, an attempt is made to analyze the Shannon and
Non-Shannon (Renyi) measures of entropy for segmenting
grey level images. Analysis has been taken on 10 different
types of standard images. This study shows that results of
non-Shannon (Renyi) based entropy are satisfactory. It is also
observed that main advantage of non-Shannon measures of
entropy over Shannon entropy is that non-Shannon measures
of entropy have parameters (α in case of Renyi) that can be
used as an adjustable values. These parameters can play an
important role as tuning parameters in the image processing
chain for the same class of images. The results of this study
are quite promising.
REFERENCES
[1] Shannon, C.E. 1948. A Mathematical theory of
Communication. Int. Journal. Bell. Syst. Technical,
vol.27, pp.379-423.
[2] Sahoo, P.K., Soltani, S. and Wong A.K.C. 1988. A
Survey of Thresholding Techniques. Journal Computer
Vision Graphic Image Processing, vol.41, pp.233-260.
[3] Kapur, J. 1994. Measures of information and their
Applications. John Wiley and Sons Publishers, New
Delhi, 1st Edition, pp.1-20.
[4] Sahoo, P.K., Wilkins, C. and Yeager, C. 1997. Threshold
selection using Renyi entropy. Pattern Recognition, vol.
30, no. 1, pp. 71–84.
[5] Kim, J.B., Park, H.S., Park, M.H. and Kim, H.J. 2001. A
Real time based motion segmentation using adaptive
thresholding and k-mean clustering. Springer Library,
vol.2256, pp.213-224.
[6] Sahoo, P.K. and Arora, G. 2004. A Thresholding method
based on Two-Dimensional Renyi Entropy. Pattern
Recognization, pp.1149-1161.
[7] Sahoo, P.K. and Arora, G. 2006. Image Thresholding
using Two-Dimensional Tsallis-Havrda-Charvat
Entropy. Journal of Pattern Recognization Letters,
vol.27, no.27, pp.520-528.
[8] Chang, C.I., Du, Y., Wang, J., Guo, S.M. and Thouin,
P.D. 2006. Survey and comparative analysis of entropy
and relative entropy thresholding techniques. IEE Proc.-
Vis. Image Signal Process., vol. 153, no. 6, pp.837-850.
485
ISBN: 978-81-924893-0-8
[9] Shareha, A., Rajeshwari, M. and Ramachandram, M.
2008. Textured Renyi Entropy for Image Thresholding.
Fifth International Conference on Computer Graphics,
Imaging and Visualization, pp.185-192.
[10] Singh, A.P. and Khehra, B.S. 2008. Edge Detection in
Gray Level Images based on the Shannon Entropy.
Journal of Computer Science, vol. 4, no. 3, pp. 186-191.
[11] Singh, A.P. and Khehra, B.S. 2009. Shannon and Non-
Shannon measures of entropy for statistical Texture
Feature Extraction in Digitized Mammograms. Proc. Of
World Congress on Engineering and Computer Science,
vol.2, pp.1286-1291.
[12] Al-amri, S., Kalyankar, N.V. and Khamitkar, S.D. 2010.
Image Segmentation by using Threshold Techniques.
Journal of Computing, vol.2, no.5, pp.83-86.
[13] Khehra, B.S. and Singh, A.P. 2011. Digital Mammogram
Segmentation using Non-Shannon Measures of Entropy.
Proceedings of the World Congress on Engineering,
vol.2.
[14] Mahmoudi, L. and Zaart, A.E. 2012. A Survey of
Entropy Image Thresholding Techniques. 2nd
International Conference on Advances in Computational
Tools for Engineering Applications, pp.204-209.
[15] Farshid, P., Abdullah, S. and Sahran, S. 2013. Peak
Signal to noise ratio based on threshold method for
Image Segmentation. Journal of Theoretical and applied
information technology, vol.57, no.2, pp.158-168.
[16] Pandey, V. and Gupta, V. 2014. MRI Image
Segmentation Using Shannon and Non Shannon Entropy
Measures. International Journal of Application or
Innovation in Engineering & Management, vol.3, no.7,
pp.41-46.
[17] Mathur, S. and Gupta, M. 2014. An Analysis on Color
Preservation Using Non-Shannon Entropy Measures for
Gray and Color Images. Fourth International Conference
on Advances in Computing and Communications,
pp.109-112.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Swarm Intelligence and
Flocking Behavior
Himani
M Tech Student
SLIET, Longowal
himanikapurnit@gmail.com
ABSTRACT
Swarm behavior suggests simple methodologies used by
agents of swarm to solve complex problems, which humans
may find difficult. The basic reason behind this is the group
behavior in these algorithms. The distributed control
mechanism and simple interactive rules can manage the
swarm efficiently and effectively. Flocking behavior does not
involve central coordination. This paper aims at the review of
the Swarm Intelligence algorithms developed so far and its
association with flocking model.
General Terms
Artificial Intelligence, Swarm Intelligence, Algorithms
Keywords
Swarm Intelligence, agents, ACO, ABC, Flocking, PSO.
1. INTRODUCTION
The concept of SI was originally introduced by Gerardo Beni
and Jing Wang[1] in 1989 in the context of cellular robotic
systems (Beni and Wang, 1993), while Bonabeau et al[2]
redefined it in 1999 as “any attempt to design algorithms or
distributed problem-solving devices inspired by the collective
behavior of social insect colonies and other animal societies”.
Most of the SI approaches are inspired by the collective
behavior of natural species, such as ants foraging, birds
flocking and bees gathering honey. Nevertheless, the term
swarm could be extended to any constrained collection of
interacting agents or individuals. This paper is organized as
follows: Sections 2,3 and 4 lay down the basic principles
which come under SI and associated algorithms. In section 5
we discuss the flocking behavior in detail and how it is
different and/or similar to the swarm behavior and section 5.1
is discussion on PSO which is a mix of both swarm and flock.
Finally in section 6 we conclude the paper.
2. SWARM INTELLIGENCE
Swarm Intelligence has been derived from the natural swarm
behavior of animals which can be defined as the collective
behavior exhibited by the animas of same size, aggregating
together to solve a problem which is essential for their
survival. SI can be defined as the emergent collective
intelligence of groups of simple agents. Agents are analogous
to the animals of the natural swarm. Agents can be a hardware
device or a software program which operate in distributed
control mechanism. Agents solve problems by interacting
with other agents, or with their environment. Software agents
are capable of taking simple decisions to solve a problem. SI
has three fundamental and essential properties, namely
decentralization, self-organisation and collective behaviour,
486
ISBN: 978-81-924893-0-8
Ashish Girdhar
Assistant Professor
SLIET, Longowal
ashishgirdhar410@gmail.com
which are necessary and sufficient to acquire SI behaviour
According to Millonas[3], the five principles of SI must be
adhered to by the algorithms proposed under SI approach.
First is the proximity principle: the population should be able
to carry out simple space and time computations. Second is
the quality principle: the population should be able to respond
to quality factors in the environment. Third is the principle of
diverse response: the population should not commit its
activities along excessively narrow channels. Fourth is the
principle of stability: the population should not change its
mode of behaviour every time the environment changes. Fifth
is the principle of adaptability: the population must be able to
change behaviour mode when it’s worth the computational
price. It is the last two points that determines the performance
of the SI algorithms. Table 1 lists some of the SI algorithms
proposed so far.
Table 1: Entities and SI Algorithms associated
Entities SI Algorithm
Ant Ant Colony Optimisation[4]
Particles Particle Swarm Optimisation[6]
Bees Artificial Bee Colony[5]
Fireflies Firefly Algorithm[7]
Monkeys Monkey Search[8]
Cockroaches Roach Infestation Optimisation[9]
Frogs Jumping Frogs Optimisation[10]
3. ANT COLONY OPTIMISATION
The natural behaviour of ants during the foraging procedure
inspires the optimisation algorithm as proposed by Colorni et
al[4]. During the searching process for food sources, ants
behave intelligently to find the optimal path to food source,
which is practically achieved by the utilization of pheromone.
The existence of pheromone shows the trace of an ant, and
provides heuristic information for other ants, which decide
whether to follow this pheromone trace or not. If the new ant
chooses to follow this pheromone trace, it would reinforce the
density of pheromone; otherwise the pheromone would be
gradually evaporated and finally exhausted. The above
decision strategies can be regarded as positive feedback and
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

negative feedback respectively. Higher pheromone density

indicates higher chosen probability. Therefore, more and more
ants choose to follow the trace with high pheromone density
and construct the optimal path to the food source.

The whole procedure of the ACO algorithm can be illustrated

as follows. Initially, ants are placed on the nodes of the graph
randomly. Then each ant selects a connected and unvisited
node as its next movement probabilistically. The probability is
influenced by two factors, the distance from the current node
to the next node and the pheromone on the associated edge.
This movement is executed iteratively until all ants have
traversed all the nodes on the graph, which is called one cycle.
After each cycle, the pheromone deployment of the whole
graph is updated. The principle is that whenever an ant moves
through an edge, the pheromone on that edge is reinforced;
otherwise, it would evaporate and be exhausted. After a
certain number of cycles, the path with highest pheromone
density is found, which represents the optimal solution. Thus
the algorithm helps find the optimal solution without actually
knowing the problem.

4. ARTIFICIAL BEE COLONY

This approach was proposed by Karaboga[5] on the principles
of foraging by bees in the natural bee hives. When foraging,
different bees work collaboratively to explore and exploit
food sources with rich nectar. As per the proposed approach
there are three types of bees: employed bees, onlookers and
scouts. For every food source or candidate solution, there is an
employed bee. The food sources with more nectar are better
solutions to the problem.

The whole procedure of the ABC algorithm can be described

as follows. Scout bees are assigned to find the initial food
sources by carrying out a random search in the search space.
After that, employed bees are sent out to exploit the
discovered food sources, and each employed bee matches one
food source. During the exploitation procedure, each
employed bee also carries out a neighbourhood search and
tries to find a better food source nearby. If a better food
source is found, the employed bee would abandon the
previous food source and exploit the better one. . After the
completion of all employed bees, they return to the hive and
share their information on food sources with onlooker bees
waiting in the hive through a waggle dance. The onlooker
bees would choose to follow certain employed bees and
exploit corresponding food sources probabilistically. This
probability is computed by the richness of the corresponding
food sources. Once an onlooker bee chooses to follow an
employed bee, it becomes an employed bee and repeats the
procedure of employed bees. After certain number of iteration
of the exploration and exploitation procedure, a food source
may be exhausted and abandoned. In that case, the
corresponding employed bee becomes a scout bee and
randomly finds a new food source to replace the abandoned
one. The whole procedure can divided into four phases:

487
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
(1) initialization phase,(2)employed bee phase,(3)onlooker
bee phase and(4)scout bee phase
5. FLOCKING BEHAVIOUR
Flocking behaviour can be described as the behavior exhibited
when a group of birds, called a flock, are foraging or in flight.
Birds and fish adjust their physical movement to avoid
predators, seek food and mates, optimize environmental
parameters such as temperature, etc. Birds have poor eyesight
and they move in flocks in order to identify the obstacles in
their paths. Similar algorithms can be applied in controlling
the air traffic in the time of disaster management. Some fish
such as clown fish also move in such flocking fashion called
school. They use it to identify if some fish has been missed
out in the journey. Humans, however adjust not only physical
movement but cognitive or experiential variables as well. We
do not usually walk in step and turn in unison rather, we tend
to adjust our beliefs and attitudes to conform with those of our
social peers. Essentially the basic models of flocking
behaviour are controlled by three simple rules:
1. Separation - avoid crowding neighbours (short
range repulsion)
2. Alignment - steer towards average heading of
neighbours
3. Cohesion - steer towards average position of
neighbours (long range attraction)
With these three simple rules, the flock moves in an extremely
realistic way, creating complex motion and interaction that
would be extremely hard to create otherwise.
The basic model has been extended in several different ways
since it was proposed. In flocking simulations, there is no
central control; each bird behaves autonomously. In other
words, each bird has to decide for itself which flocks to
consider as its environment. Usually environment is defined
as a circle (2D) or sphere (3D) with a certain radius.
5.1 PARTICLE SWARM OPTIMISATION
It was proposed by James Kennedy and Russell Eberhart in [6]
1995 and was inspired by the bird flocking, fish schooling,
and swarming theory. They used the term particles in place of
points, just to incorporate the idea of velocities associated
with each particle. Therein each individual followed three
simple rules: collision avoidance, velocity matching and flock
centring. In addition to three rules, each particle has three
inner attributes: its historical best position (local best position)
and global best position of the swarm, and refers to those two
positions whenever it moves to the next position. The
advantage of using an optimization method such as PSO is
that it does not use the gradient of the problem to be
optimized, so the method can be readily employed for a host
of optimization problems. This is especially useful when the
gradient is too laborious or even impossible to derive. This
versatility comes at a price, however, as PSO does not always
work well and may need tuning of its behavioural parameters
so as to perform well on the problem at hand.
The procedure of the algorithm can be explained as follows.
At the beginning, a number of particles are randomly placed
in the search space. Each particle holds its position and
velocity information in a vector format. Whenever movement
occurs, the particle needs to update its velocity information
488
ISBN: 978-81-924893-0-8
firstly, referring to three factors: its current velocity, the local
best position and the global best position. Different
weightings of different factors indicate different optimization
strategies. Subsequently, the particle updates its position
information following the updated velocity vector. The
positions of each particle correspond to candidate solutions.
The local and global best positions are updated after each
movement provided that the particle arrives at a better
position. This procedure is conducted iteratively until the
stopping criteria are met. The global best position is the
optimal solution which can be found so far.
for each Particle i in [1 .. N]
initialize xi , vi
Pi = xi
End for
repeat:
for each Particle i in [1 .. N]
update vi using equation (5)
Check the velocity boundaries.
update xi using equation (6)
if f(xi) ≤ f(Pi) then Pi=xi
if f(Pi) < f(G) then G=Pi
end for
until stopping criterion is met
Figure1:Pseudo-code for PSO
The basic elements in PSO are position and velocity. In this
context, each solution created by the ants is represented as one
particle. Each particle has a position or in other words their
fitness in the solution space. Each is then attached with a
velocity which the particle will move towards the direction of
the velocity vector pointing with the distance it specified. The
particles will continue moving and updating the velocity until
they reach a common goal or the optimum solution as all the
particles agreed.
6. CONCLUSION
The nature has provided us with a technique for processing
information that is at once elegant and versatile.SI and
flocking behaviour are based on the swarming methodologies
already present in nature. Based on the swarming theory and
flocking of birds, the PSO algorithm is apparently simple to
implement. In addition to the population size, i. e. the number
of candidate solutions, topology also affects the performance
of the algorithm. However, practitioners tend to keep these
constant across problems, although there is some evidence to
suggest that bigger populations are better for higher
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

dimensional problems and that highly-connected topologies [10] Garcia, F.J.M., Perez, J.A.M., 2008. Jumping frogs
work better for unimodal problems, while more sparsely- optimization: a new swarm method for discrete optimization.
connected topologies are superior on multimodal problems.
Dynamic problems are challenging for PSO. These problems [11] Walter J. Gutjahr,2006. Mathematical runtime analysis of
are modelled by the fitness functions which change over time ACO algorithms: survey on an emerging issue
and so storing the values in the memory is obsolete. So, to [12] Shuzhu Zhang, C.K.M.Lee, 2014. Swarm intelligence
date a fully comprehensive mathematical model of particle applied in green logistics: A literature review.
swarm optimization is still not available. There are several
reasons for this. Firstly, the PSO is made up of a large number
of interacting elements (the particles). Although the nature of
the elements and of the interactions is simple, understanding
the dynamics of the whole is nontrivial. Secondly, the
particles are provided with memory and the ability to decide
when to update the memory. This means that from one
iteration to the next, a particle may be attracted towards a new
pi(personal best velocity of particle i) or a new pg(global best
velocity of particle) or both. Thirdly, forces are stochastic.
This prevents the use of standard mathematical tools used in
the analysis of dynamical systems. Fourthly, the behaviour of
the PSO depends crucially on the structure of the fitness
function. However, there are infinitely many fitness functions,
and so it is extremely difficult to derive useful results that
apply to all, even when complete information about the fitness
function is available. Nonetheless, in the last few years, a
number of theoretical advances have been made. Social
optimization occurs in the time frame of ordinary experience -
in fact, it is ordinary experience. It can be concluded that this
class of algorithms belong ideologically to that philosophical
school that allows wisdom to emerge rather than trying to
impose it, that emulates nature rather than trying to control it,
and that seeks to make things simpler rather than more
complex.

REFERENCES
[1] Beni, G., Wang, J., 1993. Swarm Intelligence in Cellular
Robotic Systems, Robots and Biological Systems: Towards a
New Bionics?. Springer, Berlin Heidelberg.
[2]Bonabeau,E.,Dorigo,M.,Theraulaz,G.,1999.Swarm
intelligence: from natural to artificial systems.
[3] Millonas, M. M. (1994). Swarms, phase transitions, and
collective intelligence. In C. G. Langton, Ed., Artificial Life
III. Addison Wesley.
[4] Colorni, A.,Dorigo, M.,Maniezzo,V.,1991.Distributed
optimization by ant colonies. In: Proceedings of the first
European Conference on Artificial Life.
[5] Karaboga, D., 2005. An idea based on honey bee swarm
for numerical optimization.
[6] Eberhart, R., Kennedy, J., 1995. A new optimizer using
particle swarm theory (MHS'95). In: Proceedings of the Sixth
IEEE International Symposium on Micro Machine and
Human Science.
[7] Yang,X.-S.,Deb,S.,2009.CuckoosearchviaLévy flights.
(NaBIC2009).In: IEEE World Congress on Nature and
Biologically Inspired Computing.
[8] Mucherino, A., Seref, O., 2007. Monkey Search: A Novel
Metaheuristic Search for Global Optimization, Data Mining,
Systems Analysis and Optimization in Biomedicine.
American Institute of Physics, New York.
[9] Havens, T.C., Spain, C.J., Salmon, N.G., Keller, J.M.,
2008. Roach infestation optimization. In: Proceedings of the
IEEE Swarm Intelligence Symposium.

489
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Internet Threats and Prevention – A Brief Review
Sheenam Bhola Sonamdeep Kaur
Assistant Professor Assistant Professor
SBSSTC, Ferozepur SBSSTC, Ferozepur
Sheenambhola@gmail.com sonamkamboj7@gmail.com
ABSTRACT
Network security is a branch of computer technology
whose objective is to protect the information and
property from theft, corruption, or threats attack. Now a
days, we are mostly dependent on internet for many
things such as online shopping, bank transactions,
internet surfing etc. However, internet is not fully secure
as its users are threatened by many computer viruses,
malicious threats and many more attacks. This paper
summarize various computer threats and mechanisms
used for protecting sensitive information over the
internet.
Keywords: Internet Threats, security, prevention
1. INTRODUCTION
Continuallyas the innovation of the computer, the
security of computer systems has turn out to be an
progressively moresignificantpart of focal point for
allassociations. The beginning point of the Internet and
Web has supplementary anentireinnovativeaspect to
security which we called an Internet Security. Before the
use of internet the unauthorised access attact on the
system data and misuse the conifidential details. The
internet change the whole picture of computer. By using
internet anyone can access the data any where in the
world.The access of Dial-up releasethe computers upbeat
to various threats that did not contain physical access to
the computer system[3].
This paper discusses the Internet security distress and the
risk of securityallied by the use of Internet which
including various threats, risk related to the security and
its prevention. all through,the users of internet have
practised and they will persist to
familiarityprofuseschemesufferers that have a software or they might be due to software
straightcollision on their mainlyvital feature which is
their important information and theirsecurity is
highestimperative to the users. The exposed attackson the
internet increased day by day and and this paper consider
thesuggestedthe steps to grip the internet security issues
to elucidate before its use [2].
2. THREATS
The internet threats are malicious software programs like
spyware, adware, trojan horse, bots, viruses and worms,
etc. which are set up on the systemdevoid of our
information or we can say without any authorization.
490
ISBN: 978-81-924893-0-8
Gulshan Kumar
Assistant Professor
SBSSTC, Ferozepur
gulshanahuja@gmail.com
These type of programs can make use of the Web
forwiden, conceal, update and transmit theft data back to
criminals or hackers. This will be better understand by
the example- a trojan used to download spyware and a
worm is used to contaminate the system with a bot
[1].The Technology has turn out to be an
predictablecomponent of our lives. But the Internet
proffer a accumulationquantity of helpful information
and formulatemessage easier and faster than eternally,
but it nearbya number of threats as wellbeside the
approach. The computer system is a immensedevice to
store upimperative information. In convinced cases, the
information is extremelyvery importanttotrailing it will
damage the system.The Computer system threats can
draw closer from numerouscustomsmoreover from
human or from natural calamity.illustration, assomebody
is burglary your report information from a
confidentialstore, this type of threat is well thought-out
as a human threat. though, as the computer is drenched in
profound rain, then this type is called as natural disaster
threat.
Internet has turn out to be a typedevice for industry
communication and information contribution. All the
Contents of internet we can read, send, and receive bear a
risk. The numeral of latent security danger has better than
previous to at the similar time that reliance on
information technology has fully fledged manufacture the
require for a inclusive security program
stillextravital.Web threats pretence a broad assortment of
risks, with financial indemnity, identity theft, defeat of
private information, theft of network property, damaged
personal status, and corrosion of customerself-assurance
in e-commerce and online
banking.specialistdetermineinnovative security
vulnerabilities approximatelyeach day[5].The
recentlyexposedvulnerabilities might be due to defect in
constructionfault. Hackers can make use of these
vulnerabilities to achieve access to network resources.
overseerhave touse up a set of point and
forceimmediatelyhang aboutknowledgeableconcerning
and trade with new-fangled vulnerabilities. frequently the
effect is that they are not capable to obtain the instance to
observe and edifyemployees. Enforcement of security
strategymight be missing or rely on the honor structure.
stoppage to protecttouching the solution threats to
information and systemresources can effect in disaster
[11].
The system threats aresomething that show the way to
defeat or bribery of data and bodilyharm to the hardware
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

andcommunications. significantly how to be deliberate, unintentional and cause due to natural

recognizeprotection threats which is the first step in disasters[12].
defensive the systems. The internet threats possibly will

Figure 1: Category of Web Threats

2.1 PHYSICAL THREATS 2.2 NON-PHYSICAL THREATS

Thelatentsource of an occurrence which causemay
possiblyeffect in the loss and physical harm of the
systems is known as physical threat.
There are three types of physical threat:
 Internal threats- these type of threats include
fire, unbalanced power contribute, dampness in
the rooms,accommodation the hardware etc.
 External threats- these threats include the
floods, earthquakes etc.
 Human threats- these include theft,
destruction of the communications and
hardware, disturbance, unintentional or
deliberate errors [4].
The latent source of an occurrence which cause may
cause:
 Loss or fraud of system data
 interrupttradeprocedure that rely on the
systems
 Loss of responsive information
 illegitimateobserve of actions on thesystems
These types of threats are also known as the logical
threats. The following list is the common types of non-
physical threats :

Table 1: Summary of Internet threats and their Impact

THREATS DEFINITION RECENT ATTACKS IMPACT

MALWARE A software program which is clandestinely On 14th Oct 2014, Spike in Loss of about USD $1
located on the computer system that perfom Malware Attacks on Aging million
unpredicted and unauthorized attempts, that ATMs [13]
are malicious activities.
On 8th Oct 2014, Malware Millions of Dollars
Attacks Drain Russian ATMs
[14]
VIRUS A program which can make copy of its own On 15 August 2012,The cyber Infected 30,000 of its
like real-life viruses and extend rapidly. they attact on Saudi on Saudi Windows-based
are premeditated to harm the computer Aramco by Shamoon Virus machines
system and put on show unforeseen messages [15]
and images. It also destroy the important files
and slow down the system.
WORM A self-reliant program which broaden copy On 14th Feb 2013, Bizarre 1000 devices have been
of itself to other systems throughout network attack infects Linksys routers hit by worm
links, email regard, messages and work as with self-replicating malware
malware. They can block you from accessing [16]
various web sites and also pilfer the licenses

491
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

for various applications that we had installed

on our computer system.

TROZEN HORSE It is a program which act upon a malicious On 25th Oct 2011, Japanese A cyber-attack mounted
act except cannot imitate itself. This type of government hit by Chinese from a server in China
program might turn up as a undamaging file Trojan horse attack [17] apparently stole user ID
and we can say an appliance with concealed codes and passwords of
malicious signs. During its execution, we Lower House members
might practice unnecessary system trouble and their secretaries who
and may every so often misplace information use the chamber's
from the system. computer network.
It gave the hackers
access to e-mails and
documents possessed by
the chamber's 480
lawmakers and other
personnel for at least one
month
SPAM The message which is transmit by email and In Jan. 2014,Fridge sends 100,000 devices used as
instant message that is not requested by us spam emails as attack hits part of the spam attack
and intended to formulate funds for the smart gadgets [18]
sender.
PHISHING the attempts which are made by our phones, In April 2013, an AP Erasing $136.5 billion of
emails, messages and fax for getting our journalist journalist clicked on value
private information by stealing our identity. a spear phishing email
mainly phishing stab appear like they are disguised as a Twitter
intended for a lawful intention, but in short email.[19]
they are in fact planned to be worn for illegal
action.
PHARMING The action of capture lawful websites In March 2014, Criminals Compromised 300,000
addresses for redirecting us to a fake website hack 300,000 home routers as consumer and small
whick appear as original. The spoofed part of mystery 'pharming' office routers
website clandestinely gather our private attack[20]
information when ever weenter it, and can be
used for any numeral of illegal activities.
SPYWARE Software which are installed on our system On 9th Jan 2011, System compromised
without our knowledge and observe, tracks „SPYWARE‟ INCIDENT
and rumour our electronic actions to the SPOOKS JIHADI FORUM
spyware instigator. They are frequently [21]
installed on system throughout Trojans and
from justifiable software which are prefer for
downloading and installation.
ADWARE A software which distribute advertisements Nov 2014,Web Affected Windows
like pop-ups and Web links for us without Attack:PUP/Adware/Fake
our permission. They are typically installed Application Download[22]
surreptitiously in the course of Trojans and
through legitimate software which we prefer
for downloading and installation. It can
exhibit highly targeted advertisements based
on the data composed by spyware which is
previously on our system and track the
Internet surfing.
BOTS BOTNETS They are very small programs which are On 9th Dec 2009, Amazon Infected client computers
located clandestinely on system throughout a EC2 cloud service hit by after hackers were able
Trojan. A botmaster might manage numerous botnet, outage [23] to compromise a site on
bots from a innermost position and carry out EC2 and use it as their
phishing and perform a denial of service own C&C (command
attack which carry down a website so it and control) operation.
cannot be accessed. They are normally used
to deal out spam and phishing attacks.
RANSOMWARE The Software which encrypts the files for the On 28th Jan 2015, One Ransomware works by
intention of extortion. Files are held payment million rooms for Marriott infecting your hard drive,
awaiting wounded pay money for a Hotels, book earlier, freezing your computer
decryption key by distribution payment Ransomware on the rise, Hot and demanding a
throughout a third-party Hotels doing well [24] ransom.

492
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3. PREVENTIVE MEASURES
Below are some Internet security tips to keep your
computer and your family safe from web threats:
Avoiding Malware
Ensure that your Internet security software is
restructuredrepeatedly and routinely, but don‟t take it for
grantedthat it will protect you from attacks, and don‟t be
dependententirely on antivirus software. Numerous
threats requiremultifacetedshield like a full-blown
security group.The risks from “zero-day” attacks could
be eliminated by keeping programs updated. Be alert that
PDF‟s, image files and Office documents sometimes
obscurenasty surprises and be apprehensive of program
records and Web links from any unexpected and
unauthorized source. Also observe for anyforged anti-
malware packages that identify the invented spyware and
viruses [6].
Anti-Social Networks
Avoid compressed URLs like bit.ly, tr.im and
tinyURL.comthat are very generally used to disguise
nasty Web sites with different links to fake login window
or to malware. Pleasure very undersized URLs with
doubt. You can put an alternative on TinyURL‟s page in
your own web browser that does the same thing. “Web
2.0” sites are generally fun based sites but are not secure
as they focus to worm attacks like spam and denial of
service attacks. Be cautious while
postingresponsivedelicate information on social network
sites like Facebook and LinkedIn as such social websites
are getting worse as you can‟t even imagine what
damage the bad guys can do with your private data. So
better to Take a birthday, your home address and your
identity from these social networking sites [7].
Maintaining a Healthy System
Make use of Windows bring up to date and related
mechanisms for regular updating, wheneverpromising. In
short, keep your applications and system reorganized and
updated.a Lots of existing malware reaches to teh sites
via Office documents, PDFs and so on as there are
enumorous number of malicious sites. So, Office up-to-
date, Adobe Reader and system updates are needed to
keep the different applications and system safe [9]. For
day-to-day work and play puposes avoid using an
administrative account so that if an attacker or malware
access your system then it will restrict the amount of
damage as the profile doesnot have any administrative
privileges.
Protecting Your Passwords
Frequently change your passwords and also try to use
different passwords for your different accounts so that
unauthorized user can never guess and hack it anyways.
If any of your password leaked out then having different
passwords for different accounts will lead the attacker
can‟t access to everything you owns.Always try to use
very strong passwords which make use of combination of
uppercase and lowercase characters,special characters
and numbers [10]. Avoid using easy guessable passwords
and don‟t make silly mistakes like writing down
passwords where they can be found easily.
(Don’t Be) Burned on a Wire
493
ISBN: 978-81-924893-0-8
Don‟t connect to Web sites that engagewith the transfer
of sensitive information, such as online banking and
create a specific user profile without administrator rights
for surfing from public hotspots. Use HTTPSwhile
accessing Websites. Wireless networks areinherently less
protected [8]. Avoid sharing of files and weak passwords
for Internet usage.
Backups Not Crackups
Keep your private and necessary information “off-site”
as the professional system administrators do. Always
keep your laptops along with you so that to keep backing
up as if anyone stole your data then you won‟t have loose
all the important information.Try using system
passwords so that unauthorized user can‟t access your
systems [7].
4. CONCLUSION
To develop policies and structures to bump into such
threats is a big challenge of Internet security. As the US‟
Iowa state develop the laboratories in order to simulate
the investigation process of Internet attacks so they could
work the same way. The usage of Internet facilities are
becoming more and more familiar and should be
described to the internet users that how these are to be
used and protect their information from disclosure.
There are in short the following security issues to be
taken into concern:
 Security software should be keep up-to-date
and working always. Especially when you use
a laptop in cafes airports and other locations as
they are unprotected networks.
 Make use of Web reputation which is the latest
technology,which can determine the reliability
and security of a Website before you visit it.
Use this technology collectively with contented
scanning technologies and active URL
filtering.
 Install safety patches and use the most up-to-
date Web browser version whenever available.
Make use a no-script plug-in web browser.
 Verify your Internet Service Provider to check
what kind of fortification is presented by their
network.
 Permit the “Automatic Update” feature while
using Microsoft Windows operating system
and pertainlatest updates as soon as they are
obtainable.
 Install, renew, and sustain firewalls and
intrusion revealing software that offer spyware/
malware protection.
 Be careful of Web pages or web links that
involveinstallation of software. Try to examine
all programs downloaded from the Internet
with an advancedsafety measures solution.
 Always examine the End User License
Agreement and terminate the installation
method if any other “programs” are going to be
installed in addition to the desired program.
 Avoid giving the personal information to
unwantedrequirements for the information.
Also when you accept connections ensure that people are
who they say they are, and whether or not you really
want them as a connection. At the end make sure that you
are using a protected connection for your safekeeping.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES y_center/internet_security_tips/internet_security_tips_top
[1] The basic of Web Threats, _10_internet_threats
http://la.trendmicro.com/media/br/the-basic-of-web-
threats-brochure-en.pdf [12] Lujo Bauer, Alessandro Acquisti, Nicolas Christin,
Lorrie Cranor, Anupam Datta, Efforts to promote online
[2] Anthony Bisong and Syed (Shawon) M. Rahman , privacy via research and education at Carnegie Mellon,
AN OVERVIEW OF THE SECURITY CONCERNS IN http://p2.zdassets.com/hc/theme_assets/512007/2000435
ENTERPRISE CLOUD COMPUTING, 00/CMU_Proposal_Updated.pdf
http://airccse.org/journal/nsa/0111jnsa03.pdf
[13]http://krebsonsecurity.com/2014/10/spike-in-
[3] RandyBrown, WEB SECURITY ISSUES: HOW malware-attacks-on-aging-atms/
HAS RESEARCH ADDRESSED THE GROWING
NUMBER OF THREATS? [14]http://www.bankinfosecurity.com/russian-malware-
http://www.swdsi.org/swdsi08/paper/SWDSI%20Procee attacks-drain-atms-a-7412/op-1
dings%20Paper%20S301.pdf
[15]https://www.iiss.org/en/publications/survival/section
[4] Potential security threats to your computer system, s/2013-94b0/survival--global-politics-and-strategy-april-
http://www.guru99.com/potential-security-threats-to- may-2013-b2cc/55-2-08-bronk-and-tikk-ringas-e272
your-computer-systems.html
[16]http://arstechnica.com/security/2014/02/bizarre-
[5] David Harley BA CISSP FBCS CITP , Staying Safe attack-infects-linksys-routers-with-self-replicating-
on the Internethttp://www.eset.com/us/resources/white- malware/
papers/StaySafeOnTheInternet.pdf
[17]http://ajw.asahi.com/article/behind_news/social_affai
[6]Saeed S. Basamh, Hani A. Qudaih, Jamaludin Bin rs/AJ2011102515710
Ibrahim, An Overview on Cyber Security Awareness in
Muslim Countries, [18]http://www.bbc.com/news/technology-25780908
http://esjournals.org/journaloftechnology/archive/vol4no
1/vol4no1_4.pdf [19]http://blog.returnpath.com/blog/tori-funkhouser/top-
7-phishing-scams-of-2013
[7]Trends for 2014 The Challenge of Internet Privacy,
[20]http://www.techworld.com/news/security/criminals-
http://www.welivesecurity.com/wp-
content/uploads/2013/12/Trends-for-2014.pdf hack-300000-home-routers-as-part-of-mystery-
pharming-attack-3505049/
[8] EMERGING CYBER THREATS REPORT 2014,
[21] http://www.wired.com/2011/09/jihadi-spyware/
https://www.gtisc.gatech.edu/pdf/Threats_Report_2014.p
df
[22]http://www.symantec.com/security_response/attacksi
gnatures/detail.jsp?asid=27222
[9] Mark Johnson, Overview of Cyber Security & Risk,
http://www.int-comp.org/attachments/Overview-Cyber-
[23]http://www.cnet.com/news/amazon-ec2-cloud-
Security-Risk.pdf
service-hit-by-botnet-outage/
[10] Dennis Rand, CSIS Security Research and
[24]http://www.irishtimes.com/business/transport-and-
Intelligence, http://www.csis.dk/downloads/LinkedIn.pdf
tourism/one-million-rooms-for-marriott-hotels-book-
earlier-ransomware-on-the-rise-hot-hotels-doing-well-
[11]Top 10 Internet Threats,
1.208246.
http://www.norman.com/home_and_small_office/securit

494
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Comparative performance analysis of Mobile Ad hoc
Network (MANETs) Routing Protocol
Sheenam
PGGCG, Sector 42
Affiliated to PU, Chandigarh
sheenammadan@rediffmail.com
ABSTRACT
A Mobile adhoc network (MANET) consists of a group of
wireless mobile computers or nodes. A routing procedure is
always needed in Mobile adhoc networks to find a path so as
to forward the packets appropriately between the source and
the destination. Adhoc on Demand Distance Vector (AODV)
is a reactive discovery algorithm where a mobile device of
MANET connects by gateway only when it is needed. A
comparative analysis can be made using extensive simulation.
In this paper an attempt has been made to compare prominent
on-demand reactive routing protocols for MANETs i.e.
AODV including AODV-UU and Dynamic Source Routing
(DSR) protocols. The findings reveal that the differences in
the protocol mechanics lead to significant performance
differentials, when these protocols are used. The
performance differentials are analyzed using varying
simulation time. The simulations are carried out using the
NS-2 network simulator.
KEYWORDS
MANETS, AODV, DSR, Routing, Simulators.
1. INTRODUCTION
A wireless network is a growing new technology that will
allow users to access services and information electronically,
irrespective of their geographic position. Wireless
cellular systems have been in use since 1980s. We have seen
their evolutions to first, second and third generation‟s wireless
systems. These systems work with the support of a
centralized supporting structure such as an access point. The
wireless users can be connected with the wireless system by
the help of these access points, when they roam from one
place to the other. The adaptability of wireless systems is
limited by the presence of a fixed supporting coordinate.
It means that the technology cannot work efficiently in
that places where there is no permanent infrastructure. Easy
and fast deployment of wireless networks will be expected by
the future generation wireless systems. This fast network
deployment is not possible with the existing structure of
present wireless systems. Recent advancements such as
Bluetooth introduced a fresh type of wireless systems
which is frequently known as mobile adhoc networks. Mobile
adhoc networks or "short live” networks control in the
nonexistence of permanent infrastructure. Mobile adhoc
network offers quick and horizontal network deployment
in conditions where it is not possible otherwise. Adhoc is
a Latin word, which means "for this or for this only."
495
ISBN: 978-81-924893-0-8
A mobile ad hoc network (MANET) is a type of wireless
networks. This type depends on the mobile nodes and there is
no infrastructure in such type. Adhoc networks require no
centralized administration or fixed network infrastructure such
as base stations or access points, and can be quickly and
inexpensively set up as needed. Mobile adhoc network is an
autonomous system of mobile nodes connected by wireless
links. Each node operates not only as an end system, but also
as a router to forward packets. The nodes are free to move
about and organize themselves into a network. These nodes
change position frequently. The main classes of routing
protocols are Proactive, Reactive and Hybrid.
A Reactive on-demand routing strategy is a popular
routing category for wireless adhoc routing. It is a routing
philosophy that provides a scalable solution to relatively large
network topologies. The design follows the idea that each
node tries to reduce routing overhead by sending routing
packets whenever a communication is requested.
We ask that authors follow some simple guidelines. In
essence, we ask you to make your paper look exactly like this
document. The easiest way to do this is simply to download
the template, and replace the content with your own material.
2. DYNAMIC SOURCE ROUTING
Dynamic Source Routing (DSR) is a routing protocol for
wireless mesh networks. It is similar to AODV in that it
establishes a route on-demand when a transmitting mobile
node requests one. However, it uses source routing instead of
relying on the routing table at each intermediate device.
DSR uses a reactive approach which eliminates the need
to periodically flood the network with table update
messages which are required in a table-driven approach. The
intermediate nodes also utilize the route cache
information efficiently to reduce the control overhead. The
disadvantage of DSR is that the route maintenance
mechanism does not locally repair a broken down link.
The connection setup delay is higher than in table-driven
protocols. Even though the protocol performs well in
static and low-mobility environments, the performance
degrades rapidly with increasing mobility.
3. ADHOC ON DEMAND DISTANCE
VECTOR ROUTING (AODV)
The Adhoc On-Demand Distance Vector (AODV) routing
protocol was developed at the Nokia Research Center of
University of California, Santa Barbara and University of
Cincinnati by C. Perkins and S. Das. AODV supports both
Unicast and Multicast routing. AODV is an on demand
algorithm, meaning that it builds routes between nodes only as
desired by source nodes. It maintains these routes as long as
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

they are needed by the sources. Hence, it is considered as a protecting the physical layers protocols by addressing
reactive routing protocol. AODV forms trees which connect features of these layers that make them vulnerable .
multicast group members. The trees are composed of the
group members and the nodes needed to connect the
members. AODV utilizes routing tables to store routing
information; one routing table for uncast routes as well as one 5. COMPARISON OF PROACTIVE AND
layer data protection layer and adhoc layers talk more about REACTIVE ROUTING PROTOCOL
for multicast routes. There are various AODV routing Sr. Proactive Protocols Reactive protocols
protocol implementations, s uch as Mad-hoc, AODV-UCSB, No.
AODV-UU, Kernel-AODV, and AODV-UIUC.
Constant propagation of No periodic updates.
routing information Control information is
4. SECURITY 1 periodically even when not propagated unless
Heterogeneity of nodes in MANETs increases the topology change does there is a change in the
vulnerability of MANET nodes. The exposed nature of not occur. topology
MANETs connective links makes it open to inspection or Attempt to maintain A route is built only
targeted data capture. Also, unwanted interactions, or consistent, up-to-date when required.
interactions with unwarranted entities drains power, thus are routing information from
decreasing survivability. Thus, security deals with the 2 each node to very other
survivability of the network as a whole. MANETs are node in the network.
susceptible to attacks ranging from passive eavesdropping to
active interfering. First packet latency is First-packet latency is
less when compared with more when compared
Unlike wired networks where an adversary must gain physical
3 on-demand protocols with table-driven
access to the network wires or pass though several lines of
protocols because a route
defense at firewalls and gateways, attacks on a wireless
needs to be built.
network are easy to launch, since they involve power-
based-distances and not spatial distance (viz physical A route to every other Not available.
territories or boundaries). The various security issues in 4 node in adhoc network is
MANETs for different layers of OSI are discussed in Table 1. always available.
TABLE 1: SECURITY ISSUES IN MANETS
Incurs substantial traffic Does not incur
Sr. and power consumption, substantial traffic and
Layer Security issue
No. which is generally scarce power consumption
Detecting and preventing viruses, 5 in mobile computers. compared to Table
Application Driven routing protocols.
1 worms, malicious codes, and
layer
application abuses
Authenticating and securing end-
Transport
2 to-end communications through
layer
data encryption 6.. Network Simulator NS-2
Network Protecting the adhoc routing and for-
3 Ns-2 is a discrete event simulator targeted at
layer warding protocols
Protecting the wireless MAC networking research. It provides substantial support for
4 Link layer protocol and providing link-layer simulation of TCP, routing and multicast protocols over
security support wired and wireless networks. It consists of two
Physical Preventing signal jamming denial- simulation tools. The network simulator (ns) contains
5
layer of-service attacks all commonly used IP protocols. The network animator
(nam) is use to visualize the simulations. Ns-2 fully
simulates a layered network from the physical radio
The requirements at the application layer require protection
from eavesdropping and malignant code (viruses and worms) transmission channel to high-level applications.
to maintain secrecy and integrity. Robust encryption is
typically the first line of defence for any communications Ns-2 is an object-oriented simulator written in C++ and
network . In the cases of both encryption and anti-virus OTcl. The simulator supports a class hierarchy in C++
or anti-worm techniques and technologies, these protections and a similar class hierarchy within the OTcl
come at the cost of network performance and must be interpreter. There is a one-to-one correspondence
balanced against the relative threat level and the between a class in the interpreted hierarchy and one in the
operational need for low latency and high bandwidth. compile hierarchy. The reason to use two different
programming languages is that OTcl is suitable for the
At the network layer, protecting routing data has been programs and configurations that demand frequent and
discussed and many solutions proposed. They mainly deal fast change while C++ is suitable for the programs that have
with strengthening the route discovery process or introducing high demand in speed. Ns-2 is highly extensible. It not only
methods for efficient selection of a route from among many supports most commonly used IP protocols but also
available routes to the same destination .Link and physical allows the users to extend or implement their own
The following Table 2 briefly compares the Proactive routing protocols. It also provides powerful trace functionalities,
protocol with Reactive On-Demand routing protocols. which are very important in our project since various
Table 2: Comparison of Proactive and Reactive routing information need to be logged for analysis.

496
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

When choosing a network simulator, we normally consider
the accuracy of the simulator.Unfortunately there is no
conclusion on which of the above three simulator is the most
accurate one. David Cavin et al. has conducted experiments to
compare the accuracy of the simulators and it finds out that
the results are barely comparable. Furthermore, it warns
that no standalone simulations can fit all the needs of the
wireless developers.
[10] Stefano Basagni, Marco Conti, Silvia Giordano, Ivan
Stojmenovic, (2004) “Mobile ad hoc networking”,
Wiley-IEEE Press
[11] T. Clausen, P Jacket, L Viennot, “Comparative study of
Routing Protocols for Mobile Ad Hoc Networks,” The
First Annual Mediterranean Ad Hoc Networking
Workshop. September 2002

7. CONCLUSION
On-demand reactive routing protocols, namely, Adhoc On-
Demand Distance Vector Routing (AODV), various methods
of AODV i.e AODV-UU, AODV-UCSB and AODV-UIUC,
and Dynamic Source Routing (DSR). The simulation of these
protocols has been carried out using NS-2 simulator.We can
conclude that if the MANET has to be setup for a small
amount of time then AODV should be prefer due to low initial
packet loss and DSR should not be prefer to setup a MANET
for a small amount of time because initially there is packet
loss is very high. If we have to use the MANET for a longer
duration then both the protocols can be used, because after
some times both the protocols have same ratio of packet
delivering. But AODV have very good packet receiving ratio
in comparison to DSR. The two protocols have been
compared using simulation, it would be interesting to note the
behavior of these protocols on a real life test bed.

REFERENCES
[1] MobileAd-hocNetworks(MANET),
http://www.ietf.org/html.charters/manet-charter.html.
(1998-11-29).
[2] Krishna Gorantala, ―Routing in Mobile Ad-hoc
Networks, Umea University,
[3] Performance Comparison Study of Routing Protocols
for Mobile Grid Environment, IJCSNS International
Journal of Computer Science and Network Security,
VOL.8 No.2, pp.82-88, February 2008.
[4] Laura Marie Feeney, ―A taxonomy for routing
protocols in mobile ad hoc networks, Technical
report, Swedish Institute of Computer Science,
Sweden,1999.
[5] V. Davies, ―Evaluating mobility models within an ad
hoc network, Master„s thesis, Colorado School of
Mines, 2000.
[6] Anne Aaron, Jie Weng, “Performance Comparison of
Ad-hoc Routing Protocols for Networks with Node
Energy Constraints”, available at http://ivms.stanford.edu
[7] Charles Perkins, Elizabeth Royer, Samir Das, Mahesh
Marina, “Performance of two on-demand Routing
Protocols for Ad-hoc Networks”, IEEE Personal
Communications, February 2001, pp. 16-28.
[8] C. Perkins, E. B. Royer, S. Das, “Ad hoc On-Demand
Distance Vector (AODV) Routing - Internet Draft”, RFC
3561, IETF Network Working Group, July 2003.
[9] C. E. Perkins and E. M. Royer, “Ad-Hoc On Demand
Distance Vector Routing”, Proceedings of the 2nd IEEE
Workshop on Mobile Computing Systems and
Applications (WMCSA), New Orleans, LA, 1999, pp.
90-100

497
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Unified Modeling Language (UML) for Database
Systems and Computer Applications
Jyoti Goyal
S.D College of Institutes
Barnala, India
jyotigoyal7009@live.in
ABSTRACT
Modeling is an essential part of large software projects and
also to the medium and small projects as well. This paper
presents the concepts of database systems as well as the
overview of the use of Unified Modeling Language (UML)
as a standard notation of real-world objects in developing
object-oriented design methodology for computer
applications.
KEYWORDS
Android, Use case Diagrams (UCD), Class Diagrams,
Sequence Diagrams
I. INTRODUCTION
The first step in developing Object- Oriented methodology
for computer systems as well as Database Systems is the
use of UML (Unified Modeling Language). UML is a tool
for specifying software systems that include standardized
diagrams to define illustrate or model a software system's
design and structure. UML diagrams include the use case
diagram, class diagram, sequence diagram.
UML is considered an industry standard modeling language
with a rich graphical notation, and comprehensive set of
diagrams and elements. This paper presents the layering of
an object-oriented class model of a purely relational
database. Among the concepts of modeling that UML
specifies how to describe are: class (of objects), object,
association, responsibility, activity, interface, use case,
package, sequence, collaboration, and state. The overview
of the database systems, the concepts of Unified Modeling
Language (UML), Use Case diagrams and Sequence
diagrams have been discussed in this paper.
II. ROLE OF DATABASE
Database is an ordered collection of data elements intended
to meet the information needs of an organization and
designed to be shared by multiple users. Database systems
reduce data redundancy, integrate data, and enable
information sharing among the various groups of users in
the organization. It is a term that is typically used to
498
ISBN: 978-81-924893-0-8
encapsulate the constructs of a data model, database
management system (DBMS), the database. Data is stored
within the data structures of the database. A DBMS is a
suite of computer software providing the interface between
users and databases. The interactions carried out by most of
the databases cauterized into following four categories,
explained below:
Data Definition: Defining new data structures for a
database, removing data structures from the database,
modifying the structure of existing data.
Data Maintenance: Inserting new data into existing data
structures, updating data in existing data structures,
deleting data from existing data structures.
Data Retrieval: Querying existing data by end-users and
extracting data for use by application programs.
Data Control: Creating and monitoring users of the
database, restricting access to data in the database and
monitoring the performance of databases.
III. USE CASE DIAGRAMS
A use case is the specification of a set of actions performed
by a system, which yields an observable result that, is,
typically, of value for one or more actors or other
stakeholders of the system. Use cases are part of the Object
Management Group (OMG) Unified Modeling Language
(UML) standard. This standard tells us what the parts of the
use case diagrams mean — stick figures, ovals and lines—
and it gives us the definition of a use case. But it doesn’t
tell us how to structure to write one. So we’re left to read
books or articles (like this one), to try to figure out the right
way. A use case is a list of steps that specifies how a user
interacts with the business or system while keeping in mind
the value that this interaction provides to the user.
The UML is a tool for specifying and visualizing software
systems. It includes standardized diagram types that
describe and visually map a computer application or a
database systems design and structure. The use of UML as
a tool for defining the structure of a system is a very useful
way to manage large, complex systems. Having a clearly
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
visible structure makes it easy to introduce new people to
an existing project [4]. The UML is used to specify,
visualize, modify, construct and document the artifacts of
an object-oriented software-intensive system under
development. It offers a standard way to visualize a
system's architectural blueprints, including elements such
as:
 Activities
 Actors
 Business Processes
 Database Schemas
 Logical Components
 Programming Language Statements
IV. UML (ONLINE GROCERY
SYSTEM)
USE CASE DIAGRAM
Brief Description: - This use case allows customers to
search for their food items online. After making purchase
of their items, the customers will do checkout using any
source (Debit/Credit Card).Vendor checks for the item
being in stock or not. Refer Fig. 1
Actors: -
1. Primary Actors: Customers
2. Secondary Actors: Vendor
Class Diagram: - Class Diagram includes the concept of
Objects which inherits properties of a class. In Software
Engineering, Class Diagram in the Unified Modeling
Language is a type of structure diagram that describes the
structure of a system by showing the system's classes, their
attributes, operations (or methods), and the relationships
among objects. It also shows how the different entities
(people, things, and data) relate to each other. It can be
used to display logical classes, and implementation classes.
It is the main building block of object oriented modeling. It
is a type of static structure diagram in UML that describes
the structure of a system by showing the system's classes,
their attributes, operations (or methods), and the
relationships among the classes. Refer Fig. 2
499
ISBN: 978-81-924893-0-8
Sequence Diagrams: -
A Sequence Diagram is an interaction program which
shows how processes operate with one another and what is
their order. It is a construct of a Message Sequence Chart.
A sequence diagram shows object interactions arranged in
time sequence. It depicts the objects and classes involved in
the scenario and the sequence of messages exchanged
between the objects needed to carry out the functionality of
the scenario. Sequence diagrams are typically associated
with use case realizations in the Logical View of the
system under development. Sequence diagrams are
sometimes called event diagrams or event scenarios. The
sequence diagrams show a detailed flow for a specific use
case or even just part of a specific use case. It shows the
calls between the different objects in their sequence and
can show, at a detailed level, different calls to different
objects. A sequence diagram has two dimensions: The
vertical dimension shows the sequence of messages/calls in
the time order that they occur; the horizontal dimension
shows the object instances to which the messages are sent.
Figure 3 illustrates an example of a sequence diagram of
Online Grocery System.
Fig. 1 Use Case Diagram of Online Grocery Shopping
V. CONCLUSION
The UML is a tool for specifying software systems that
include standardized diagrams to define illustrate and
visually map or model a software system's design and
structure. UML diagrams include the use case diagram,
class diagram, sequence diagram. This paper
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig 2 Class Diagram of Online Grocery Shopping

Fig 3 Sequence Diagram of Online Grocery Shopping

outlined the use of Unified Modeling Language (UML) as [5] Kogent, Software Engineering, (2012)
a standard notation of real-world objects in developing [6] Bertrand Meyer, Mathai Joseph, Software
object-oriented design methodology for computer Engineering Approaches for Offshore and
applications and database systems. Outsourced Development (2007)
[7] http://www.uml-diagrams.org/
REFERENCES [8] Eve Andersson, Philip Greenspun, Andrew
Grumet, Software Engineering for Internet
[1] Roger S. Pressman, Software Engineering: A Applications (2006)
Practitioner’s Approach Seventh Edition (2010)
[2] Pankaj Jalote, Fred B. Schneider, An Integrated
Approach to Software Engineering (2005)
[3] David Gustafson, Schaum’s Outlines of Software Engineering (2002)
[4] Ghezzi Carlo, Jazayeri Mehdi, Mandrioli Dino, Fundamentals of
Software Engineering (2002)

500
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
SECURING INFORMATION USING IMAGES: A
REVIEW
Anjala Avi Grover
Assistant Professor Research Scholar
SBSSTC Ferozepur DAV College,Jalandhar
anjalamca@gmail.com avigrover33@gmail.com
ABSTRACT
Now a day, Security of a data or information is very
important in this world. It is the need of the hour to
transmit sensitive information over a public network in a
secure way. However, this also provides a chance to the
malicious user to get access to our information over the
network. There exist many ways to transmit the
information in a secure way. Securing the information by
embedding in images is one of the prominent methods. In
this paper, we undertake the concepts of information
security, various techniques to secure information using
images with pros and cons, and their current trends.
Keywords: Cryptography, Steganography, image
hiding, least-significant bit (LSB) method.
1. INTRODUCTION
In today’s developing age technologies have developed so
much most of every person use laptop, desktop, mobile,
notepad, etc. in their daily life to transfer their secret
information crossed over the World Wide Web. Some
people are waiting for this type of secret information
which we called hacker and then change your information
which we called cracker so, to assure your secret
information from this type of unauthorized peoples you
must protect your data through security techniques. This
paper discusses a cryptography and stenography
techniques to protect secret data. Cryptography is a
technique in which original data are converted to
unreadable form so the user cannot understand what data
to be transferred over the network. Stenography hides the
data into cover media. Cover media can anything like as
image, audio, video, etc. so; it is unnoticed beyond the
network.
The steganography and cryptography differ in the way
they are estimated: steganography fails when the ‖enemy‖
is able to catch the content of the cipher message, while
cryptography fails when the ‖enemy‖ detects that there is
a secret message present in the steganographic medium.
The disciplines that study techniques for deciphering
cipher messages and detecting hidden messages are called
cryptanalysis and steganalysis [12]. Steganalysis is "the
process of detecting steganography, by looking at
variances between bit patterns and unusually large file
sizes" [3]. It is the art of discovering and rendering
501
ISBN: 978-81-924893-0-8
Gulshan Kumar
Assistant Professor
SBSSTC Ferozepur
gulshanahuja@gmail.com
useless covert messages. The goal of steganalysis is to
identify suspected information streams, determine
whether or not they have hidden messages encoded into
them, and, if possible, recover the hidden information.
The cryptanalysis is the process of encrypted messages
can sometimes be broken the cipher message is otherwise
called as code breaking, although modern cryptography
techniques are virtually unbreakable.
The aim of this paper is to describe a method for
integrating together cryptography and steganography
through some media such as image. In this paper, the
secret message is embedded within the image called
cover-image. Cover-image carrying embedded secret data
is referred as a stego - image.
2. IMAGE STEGANOGRAPHY
In this approach, each byte (pixel) of all the three matrices
(R, G, B matrices of payload) is encrypted using S-DES
algorithm and an image comprised of encrypted pixels is
formed. The key used to encrypt each pixel is of 10-bit
length and is obtained from the pixels of key image. The
pixel values of red, green and blue intensities of each
pixel of key image are combined to get a 24-bit value.
The first ten bits are selected as the key to encrypt the red
intensity pixel of the payload image [6]. The middle ten
bets will be the key to encrypt the green intensity pixel of
payload and finally the last ten bits is the key to encrypt
blue intensity pixel of payload image. So the size of key
image must be same as that of the payload. If not, then the
key image will get resized. Each pixel (24-bit) of the key
image is split into three keys (10-bit each). This encrypted
data is represented as an image which is hidden in another
image called carrier image using Steganography [4, 5, 6].
Hiding information into a medium requires the following
elements [2].
i) The cover media (c) that will hold the hidden data.
ii) The secret message (M), may be plain text, cipher text
or any type of data.
iii) The stego function (Fe) and its inverse (Fe -1)
iv) An optional stego-key (K) or password may be used
to hide and unhide the message.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The stego function operates over cover media and the a stego media(s).
message (to be hidden) along with a stego-key to produce

k k

Fe Fe-1
C C

M M

Figure 1.1 The steganographic Operation

3. MODERN TECHNIQUES OF 4. LSB METHOD

STEGANOGRAPHY
The least significant bit insertion (LSB) is the most
The common modern technique of steganography exploits widely used image steganography technique [10]. It
the property of the media itself to convey a message. embeds message in the least-significant bits of each pixel.
The LSB techniques might use a fixed least significant bit
The following media are the candidate for digitally insertion scheme, in which the bits of data added in each
embedding messages. pixel remains constant, or a variable least significant bit
insertion, in which the number of bits added in each pixel
(i) Plain text varies on the surrounding pixels, to avoid degrading the
image fidelity In this paper we discuss the embedding of
(ii) Still imagery text into an image through variable size least significant
bit insertion. Today, computer and network technologies
(iii) Audio and video provide easy-to-use communication channels for
steganography. Essentially, the information-hiding
(iv) IP datagram
process in a steganographic system starts by identifying a
cover medium’s redundant bit.

Cover Image

Embedding Communication
algorithm mode

Public key

Extraction
Secret message
algorithm

Figure 1.2 Basic Layout of image stegnographic system

5. IMAGE CRYPTOGRAPHY
In today’s information age, information sharing and
transfer have increased exponentially. Cryptography can
be defined as the conversion [14] of data into a
scrambled code that can be deciphered and sent across a
public or private network. Cryptography uses two main
styles or forms of encrypting data; symmetrical and
asymmetrical. Symmetric encryptions, or algorithms, use
the same key for encryption as they do for decryption.

502
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Other names for this type of encryption are secret-key, 6. EMBEDDING THE ENCRYPTED
shared-key, and private-key. Cryptography is the science
of using mathematics to encrypt and decrypt data.
IMAGE IN CARRIER IMAGE
Cryptography enables you to store sensitive information
The LSB is a simple approach to embedding information
or transmit it across insecure networks (like the Internet)
in a cover image. The pixel values of encrypted image
so that it cannot be read by anyone except the intended
are hidden in the LSB of pixels of carrier image by
recipient. While cryptography is the science of securing
merging it with the 2nd LSB of carrier pixel. If the size
data, cryptanalysis is the science of analyzing and
of the encrypted image is mxn, then the size of carrier
breaking secure communication. A cryptographic
image must be mxnx8 as each encrypted byte requires 8
algorithm, or cipher, is a mathematical function used in
bytes (pixels) of image carrier. So if the carrier image
the encryption and decryption process. A cryptographic
size is not eight times the size of the payload, then it has
algorithm works in combination with a key—a word,
to be resized [13]. In this procedure LSB algorithm helps
number, or phrase—to encrypt the plaintext. The same
in securing the originality of the image. For example,
plaintext encrypts to different ciphertext with different
when a secret message is hidden within a cover image,
keys. The security of encrypted data is entirely dependent
the resulting product is a stego-image.
on two things: the strength of the cryptographic
algorithm and the secrecy of the key. A cryptographic A possible formula of the process may be represented as:
algorithm, plus all possible keys and all the protocols that
make it work comprise a cryptosystem. We use Cover medium + embedded message + stegokey = stego-
encryption to ensure that information is hidden from medium
anyone for whom it is not intended, even those who can
see the encrypted data. The process of reverting cipher
text to its original plaintext is called decryption

Key Image

Cover Image Encryption

Stego Image

Cover Decryption
Image

Key Image
Figure: 1.3 Hidden Image

7. CONCLUSION ―crackers‖ as a challenge.Method used in this paper

In this paper, we have presented a system for the
combination of cryptography and Steganography with
LSB, which could be proven as a highly secured method
for data communication in near future. Steganography
transmits secrets through apparently innocuous covers in
an effort to conceal the existence of a secret. If the
embedded message is not advertised, casual users will
not know it even exists and therefore will not attempt to
remove the mark. However, advertising the fact that
some hidden information exists, is only an invitation to
provides triple security because in this method author
used three methods two for cryptography and one for
stegnography. LSB algorithm for hiding encrypted data .
Finally, we conclude that the proposed techniques are
effective for secret data communication.
REFERENCES
[1] S. Dumitrescu, W.X.Wu and N. Memon (2002) On
steganalysis of random LSB embedding in continuous-
tone images, Proc. International Conference on Image
Processing, Rochester, NY, pp.641-644.

503
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[2] R.J. Anderson and F. A. P. Petitcolas (2001) On the
limits of the Stegnography, IEEE Journal Selected Areas
in Communications, 16(4), pp. 474-481
[3] Km. Pooja ,Arvind Kumar , ―Steganography- A Data
Hiding Technique‖ International Journal of Computer
Applications ISSN 0975 – 8887, Volume 9– No.7,
November 2010.
[4] A. Westfeld, "F5-A Steganographic Algorithm: High
Capacity Despite Better Steganalysis," LNCS,Vol. 2137,
pp. 289-302,April 2001.
[5] C.-C. Chang, T. D. Kieu, and Y.-C. Chou, "A High
Payload Steganographic Scheme Based on (7,
4)Hamming Code for Digital Images," Proc. of the 2008
International Symposium onElectronic Commerce and
Security, pp.16-21, August 2008.
[9] R. Chandramouli, M. Kharrazi, N. Memon, ―Image
Steganography and Steganalysis: Concepts and
Practice ― , International Workshop on
DigitalWatermarking, Seoul, October 2004.
[10] C. C. Lin, and W. H. Tsai, "Secret Image Sharing
with Steganography and Authentication," Journal
of Systems and Software, 73(3):405-414, December
2004.
[11] komal patel, sumit utareja and hiesh gupta,
Information hiding Using Least Significant Bit and
Blowfish Algorithm‖ , International journal of computer
application volume 63 –no.13 february 2013.
[12] J. Fridrich, M. Long, ―Steganalysis of LSB encoding
in colorimages,‖Multimedia and Expo, vol. 3,
pp. 1279-1282, July 2000.

[6] Jiri Fridrich ,Du Dui, ―Secure Steganographic [13] A. Ker, ―Improved detection of LSB steganography
in grayscale images,‖ in Proc. Information
Method for Palette Images,‖ 3rd Int. Workshop on
Hiding Workshop, vol. 3200, Springer LNCS, pp. 97–
InformationHiding, pp.47-66, 1999.
115, 2004.
[7] N . Provos, ―Defending Against Statistical
[14] William Stallings, Cryptography and Network
Steganography,‖ Proc 10th USENEX Security Security, Principles and Practice, Third edition,
Symposium 2005. [2] N . Provos and P. Honeyman, PearsonEducation, Singapore, 2003.
―Hide and Seek: An introduction to Steganography,‖
IEEE Security & Privacy Journal 2003.

[8] Y. Lee and L. Chen (2000) High capacity image

steganographic model, IEE Proceedings on
Vision,Image and Signal Processing, 147(3), pp. 288-
294.

504
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Text document tokenization for word frequency count using
RapidMiner
(Taking resume as an example)
Gaurav Gupta
Department of Computer Engineering
University College of Engineering,
Punjabi University
Patiala (Punjab), India
gaurav_shakti@yahoo.com
ABSTRACT
Text mining, at times alluded to as content information mining, is
harshly equal to content investigation, which alludes to the procedure
of determining astounding data from content. RapidMiner is
unquestionably the world-leading open-source system for data
mining. It is available as a stand-alone application for data analysis
and as a data mining engine for the integration into own products.
Tokenization is the process of breaking a stream of text up into
words, phrases, symbols, or other meaningful elements called tokens.
The word frequency counter allows you to count the frequency usage
of each word in your document. Applying tokenization and word
frequency counter for a text document (resume in this case) helps us
find out occurrence of each word in a document but there is no
provision to find a particular word frequency occurrence according to
user choice.
Keywords
RapidMiner, RapidMiner Text Processing, RapidMiner Transform
case operator, RapidMiner Tokenize operator.
1. INTRODUCTION
1.1 Text Mining and Analysis
Boundless measures of new data and information are produced
ordinary through investment, scholarly and social exercises. This
ocean of information, anticipated to expand at a rate of 40% p.a., has
noteworthy potential financial and societal quality. Organizations
utilize such strategies to dissect client and contender information to
enhance intensity; the pharmaceutical industry mines patents and
research articles to improve drug discovery; within academic
research, mining and analytics of large datasets are delivering
efficiencies and new knowledge in areas as diverse as biological
science, particle physics and media and communications. As the
volume of insightful yield expands, we perceive that researchers are
increasingly interested in using tools such as Text mining to explore
patterns and trends across large databases of content. Text mining
transposes words and expressions into numerical qualities.
Text analysis involves information retrieval, distributions, lexical
examination to study word recurrence cognizance,
labeling/annotation, data extraction, information mining methods
including connection and affiliation investigation, visualization, and
505
ISBN: 978-81-924893-0-8
Sumit Malhotra
Department of Computer Science and Engineering
Bhai Gurdas College of Engineering and
Technology,PTU
Sangrur (Punjab), India
sumitmalhotra.mail@gmail.com
prescient examination. The overall objective is, basically, to
transform content into information for investigation.
1.2 Rapidminer
Rapid-miner is certainly the world-heading open-source framework
for information mining. It is accessible as a stand-alone application
for information investigation and as a data mining engine for the
integration into own products. Rapid Miner uses a client/server
model with the server offered as Software as a Service or on cloud
infrastructures. RapidMiner provides data mining and machine
learning procedures including: data loading and transformation
(Extract, transform and load (ETL)), data preprocessing and
visualization, predictive analytics and statistical modeling,
evaluation, and deployment.
Rapidminer is composed in the Java programming dialect.
RapidMiner provides a GUI to design and execute analytical
workflows. Those workflows are called “Process” in RapidMiner and
they consist of multiple “Operators”. Each operator is performing a
single task within the process and the output of each operator forms
the input of the next one. Alternatively, the engine can be called from
other programs or used as an API. Individual functions can be called
from the command line. RapidMiner provides learning schemes and
models and algorithms from Weka and R scripts that can be used
through extensions.
Features:-
1. Open source.
2. Operating system independence.
3. Transformation, data mining, evaluation, and visualization.
4. Compelling high-dimensional plotting facilities.
5. Multi-layered data view concept ensures efficient data handling.
6. Definition of re-usable building blocks.
7. Machine learning library WEKA completely coordinated.
8. Access to information sources like Excel, Access, Oracle, IBM
Db2, Microsoft SQL, Sybase and so forth.
9. Rapid prototyping of data mining processes by nesting operator
chains and complex operator tree
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2. IMPLEMENTATION GB18030 , IBM00858, IBM01140, IBM01141, IBM037,

IBM1026, IBM1047, IBM273, IBM277, IBM278,
IBM280, IBM284, IBM285, IBM297, IBM420, IBM424,
2.1 Process Document from Files IBM437, IBM500 -32BE, UTF-32LE, UTF-8, windows-
1250, x-windows-950, x-windows-50221, x-windows-874,
x-windows-949, windows-1250, windows-1251, x-mswin-
Consider a resume in text format as shown in Figure 2.1 .
936, x-PCK, x-SJIS_0213, x-JISAutoDetect, x-Johab, x-
MacArabic, x-MacCentralEurope, x-MacCroatian, x-
MacCyrillic, x-MacDingbat, x-MacGreek, x-MacHebrew,
x-MacIceland, x-MacRomania, x-MacSymbol, x-MacThai,
x-MacTurkish, x-MacUkraine etc. Default: 'SYSTEM'

Figure 2.1 - Resume in .txt format

In order to process the resume selects the Text Processing group of

RapidMiner. This group contains operators to load and process non-
structured textual data and transform such data into structured forms
for further analysis Figure 2.2 - Process Document.

Process Document from Files operator of this group generates word Double click Process Document from Files operator to add
vectors from a text collection stored in multiple files. This operator components Transform cases and Tokenize as shown below in Figure
utilizes one single TextObject as input for creating a term vector. The 2.3.
subsequent exampleset will subsequently comprise of stand out
single sample. In text directories arbitrary directories can be
specified. All files matching the given file ending will be loaded and
assigned to the class value provided with the directory.

The whole process is shown in Figure 2.2. where text file is selected
from the directory and the parameters are defined below:-

 text directories: In this list arbitrary directories can be

specified. All files matching the given file ending will be
loaded and assigned to the class value provided with the
directory. Range: list
 file pattern: A pattern for the file to be read. Usual
wildcards like ? and * are supported. Range: string; default:
'*'
 extract text only: If checked, structural information like
xml or html tags will be ignored and discarded. Range:
boolean; default: true
 use file extension as type: If checked, the type of the files
will be determined by their extensions. Unkown extensions
will be treated as text files. Range: boolean; default: true Figure 2.3 - Adding components.
 content type: The content type of the input texts Range: 2.2. Transform cases:
txt, pdf, xml, html;default: txt
 encoding: The encoding used for reading or writing files. This operator transforms all characters in a document to either lower
Range: SYSTEM, Big5, Big5-HKSCS, EUC-JP, EUC-KR, case or upper case, respectively as shown in Figure 2.4.

506
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure 2.5 - Tokenize component modes.

Figure 2.4 - Transform case operator.
On clicking to run button the result is displayed as shown in Figure
In this case and by default also lower case is chosen from parameter 2.6 where the occurrence of each keyword in a document is displayed
transform to. in numeric format.

2.3. Tokenize:-
This operator splits the text of a document into a sequence of tokens.
There are several options how to specify the splitting points. Either
you may use all non-letter character, what are the default settings. This
will result in tokens consisting of one single word, what's the most
appropriate option before finally building the word vector. Or if you
are going to build windows of tokens or something like that, you will
probably split complete sentences, this is possible by setting the split
mode to specify character and enter all splitting characters. The third
option let's you define regular expressions and is the most flexible for
very special cases. Each non-letter character is used as separator. As a
result, each word in the text is represented by a single token.

The mode parameter is used to selects the tokenization mode.

Depending on the mode, split points are chosen differently. Various
modes for tokenization are:
 non letter: The non letters mode specify characters and is
the default mode.
 characters: The incoming document will be split into
tokens on each of this characters. For example enter a '.' for
splitting into sentences. Default: '.:'
 regular expression: This regular expression defines the
splitting point.
 linguistic sentence: A sentence is a linguistic unit
consisting of one or more words that are grammatically
linked.
 linguistic tokens: related tokens
In this case the mode is non-letter. The modes are shown in Figure 2.5
Figure 2.6 - Words frequency count
As shown above the frequency of occurrence of each word in a
document is displayed. The result is displayed in sorted order by
default.
3. CONCLUSION
Rather than reading the whole text document user can find out
occurrence of particular word of interest by tokenization. In order to
find the frequency of occurrence of particular word the user has to
scroll the scrollbar. There should be provision for the user to find the
frequency of occurrence of particular keyword of interest by
specifying the keyword. Moreover there should be provision to
compare two text documents by comparing keyword frequency
occurrence. The comparison in this case i.e resume are used to find
the better candidate.

507
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
REFERENCES
[1] Text mining from http://en.wikipedia.org/wiki/Text_
mining.
[2] RapidMiner from http://en.wikipedia.org/wiki/
RapidMiner.
[3] RapidMiner Studio from http://rapidminer.com/
products/rapidminer-studio/.
[4] To find frequency of the words using RapidMiner
(2012). Retrieved June 22, 2012, from http://
gunjanaaggarwal.blogspot.in/2012/07/
words-frequency-text-analytics.html.
[5] Value and benefits of text mining from
http://www.jisc.ac.uk/reports/value-and-benefits-of-text-
mining
508
ISBN: 978-81-924893-0-8
[6] Tanu Verma,Renu,Deepti Gaur,”Tokenization
and Filtering Process in RapidMiner”,
International Journal of Applied Information
Systems (IJAIS) – ISSN : 2249-0868 ,Volume 7–
No. 2, April 2014.
[7] Jordan Shterev,”Demo: Using RapidMiner for
Text Mining”, Digital Presentation and Preservation of
Cultural and Scientific Heritage (Digital Presentation
and Preservation of Cultural and Scientific Heritage),
issue: III / 2013, pages: 254256
[8] Tipawan Silwattananusarn and Assoc.Prof. Dr.
KulthidaTuamsuk,”Data Mining and Its
Applications for KnowledgeManagement : A
Literature Review from 2007 to 2012”
International Journal of Data Mining &
Knowledge Management Process(IJDKP)
Vol.2, No.5, September 2012.
Mechanical Engineering
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Comparative High-Temperature Corrosion Behavior of D-
Gun Spray Coatings on ASTM-SA213, T11 Steel in Molten
Salt Environment
Ankur Goyal Rajbir Singh
Student, Department of Assistant Professor,
Mechanical Engg, Bhai Gurdas Department of Mechanical
Institute of Engg. & Tech, Engg, Bhai Gurdas Institute of
Sangrur, Punjab, India. Engg. & Tech, Sangrur,
gylankur@gmail.com Punjab, India.
ghuman008@gmail.com
ABSTRACT:-
Alloys and metals get corroded when exposed to high
temperature in air or in actual boiler environment in thermal
plant. In the present study, a Ni-20Cr coating was deposited by
Detonation Gun process on ASTM–AS-213, T-11 boiler steel.
Coating characterization was done using SEM/EDS analysis,
XRD analysis. Cyclic corrosion studies were carried out in
molten salt environment at 900oC for 50 cycles. Each cycle
consist of 1 hours heating in Silicon carbide tube Furnace
followed by 20 Minutes cooling in air. The kinetics of weight
gain or loss was measured after each cycle and visually
examined, the surface studies of the exposed samples were
characterized by SEM/EDS analysis, XRD analysis. The
results obtained showed the better performance of Ni-20Cr
coated T-11 boiler steels than the uncoated T-11 boiler steel.
Keywords:- D-Gun coatings, Ni-20Cr, Corroison.
1. INTRODUCTION
To attain high temperature is very important for the
development of civilization in almost every country. Materials
in high technology areas need to operate in harsh conditions of
corrosive environment, temperature and pressure etc. Invention
and discovery of high temperature alloys or materials are
looked with an expectation of increasing the life time of
boilers, gas turbines etc by giving improved strength efficiency
the corrosion resistant properties etc. Gas turbines in aircraft,
fossil fueled power plants refineries and heating elements for
high temperature furnaces are some examples where corrosion
restricts their use and reduce their life, severely reducing the
efficiency. The corrosion that occurs at high temperature is
called hot corrosion or also sometimes dry corrosion. Hot
corrosion is the accelerated oxidation of a material at elevated
temperature induced by a thin film of fused salt deposit [1].
The annual direct loss of natural resources i.e. metals due to
environmental degradation is also substantial. In USA, the loss
due to corrosion is around 4% of GDP. In India, the corrosion
losses will be around Rs.1 lakh crore per annum. Around 80%
of the unscheduled shutdowns and breakdowns in industries
are due to corrosion and process fouling.
Metallic components in coal fired boilers are exposed to severe
corrosive atmospheres and high temperatures Selection of
material and its preparation are very important for the efficient
functioning of the system components. Alloys used at high
temperature should possess good mechanical properties along
509
ISBN: 978-81-924893-0-8
Gurmail Singh
Assistant Professor,
Department of Mechanical
Engg, RIMT – Maharaj
Aggersen Engineering College,
Mandi Gobindgarh, Punjab,
India.
gurmail.malhi@gmail.com
with erosion-corrosion resistance. Therefore composite system
of a base material providing necessary mechanical properties
with a protective surface layer, different in structure or
chemical composition can be an optimum choice in combining
mechanical properties
This particular chapter is concerned with high temperature
oxidation, hot corrosion and its mechanism and related salt
chemistry. The main focus is on hot corrosion of boiler steels,
its preventive measures, coatings techniques.
Hot corrosion became a topic of important and popular interest
in the late 60s as the gas turbines engines of military suffered
severe corrosion during the Viet Nam conflict during operation
over seawater. Metallographic inspection of failed parts often
showed sulfides of nickel and chromium, so the mechanism
was initially called “sulfidation” [2].
An increasing demand for more electricity, reduced plant
emissions and greater efficiency is forcing power plants to
increase the steam temperature and pressure of boilers. Ultra
supercritical steam conditions greater than 31MPa and 600 ◦C
have been adopted, and the thermal efficiency of a pulverised
coal-fired boiler of up to 45% has been obtained. Super heater
and re-heater materials will therefore be required which have
high creep rupture strength and high corrosion resistance at
temperatures of about 900 oC and above [3,4]. Super alloy can
be used to meet these stringent material targets [5, 6] but they
are unable to meet both the high-temperature strength and the
high temperature corrosion resistance requirements
simultaneously [7, 8]. Protective coatings can be used on super
alloys to meet the latter requirement. Coatings can add value to
products up to 10 times the cost of the coating [9]. Even if the
material withstands high temperature without a coating, the
coating enhances the lifetime of the material.
1.1 Oxidation
Oxidation is a type of corrosion involving the reaction between
a metal and air or oxygen at high temperature in the absence of
water or an aqueous phase. It is also called dry corrosion. The
rate of oxidation of a metal at high temperature depends on the
nature of the oxide layer that forms on the surface of metal
[10].
Most metals are thermodynamically unstable in air and react
with oxygen to form an oxide. As this oxide usually develops
as a layer or scale on the surface of the metal or alloy, it can
give protection by acting as a barrier that separates the metal
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
from the gas. The establishment of an oxide scale on an alloy
occurs by a nucleation and growth process. [11].
1.2 Hot Corrosion
Hot corrosion may be defined as accelerated corrosion,
resulting from the presence of salt contaminants such as
Na2SO4, NaCl that combine to form molten deposits which
damage the protective surface oxides [12]. Corrosion is the
deterioration or destruction of metals and alloys in the presence
of an environment by chemical or electrochemical action.
Corrosion is an irreversible interfacial reaction of a material
(metal, ceramic and polymer) with its environment which
results in its consumption or dissolution into the material of a
component of the environment. Often, but not necessarily,
corrosion results in effects detrimental to the usage of the
material considered.
1.3 Hot Corrosion
Hot corrosion may be defined as accelerated corrosion,
resulting from the presence of salt contaminants such as
Na2SO4, NaCl that combine to form molten deposits which
damage the protective surface oxides [13].
Corrosion is the deterioration or destruction of metals and
alloys in the presence of an environment by chemical or
electrochemical action. Corrosion is an irreversible interfacial
reaction of a material (metal, ceramic and polymer) with its
environment which results in its consumption or dissolution
into the material of a component of the environment. Often, but
not necessarily, corrosion results in effects detrimental to the
usage of the material considered.
1.4 High Temperature Corrosion
Hot corrosion is a high-temperature analogue of aqueous
atmospheric corrosion. A thin film deposit of fused salt on an
alloy surface in a hot oxidizing gas causes accelerated
corrosion kinetics. Recognition of the problem and a search
toward a mechanistic understanding and engineering abatement
were initiated in response to the severe corrosion attack of
military gas turbines during the Viet Nam conflict. Initially, the
researchers were misled by the observation of corrosion
product sulphides beneath a fused film of sodium sulphate to
denote the problem and mechanism as “sulfidation”. Later,
studies by Bornstein and Decresente [13, 14] and Goebel and
Pettit[15, 16] demonstrated that the principal corrosive
environmental component was not a vapor species, but rather
the contact of the fused salt with the surface. This fused salt
(sodium sulphate) exhibited an acid-base character which at the
time was quite uncertain and undefined. The electrolytic nature
of the fused salt film and its similarity to atmospheric corrosion
led to the more proper naming of the problem as “hot
corrosion”.
High-temperature corrosion is chemical deterioration of a
material (typically a metal) as a result of heating. This non-
galvanic form of corrosion can occur when a metal is subjected
to a hot atmosphere containing oxygen, sulphur or other
compounds capable of oxidizing (or assisting the oxidation of)
the material concerned. For example, materials used in
aerospace, power generation and even in car engines have to
resist sustained periods at high temperature in which they may
be exposed to an atmosphere containing potentially highly
corrosive products of combustion. Another popular name of
this type of corrosion is hot-corrosion, which is also
extensively used in the scientific community. Hot-corrosion is
a serious problem in power generation equipment in gas
turbines for ships and aircraft, and in other energy conversion
and chemical process systems. The severity of hot-corrosion in
combustion processes can vary substantially and is
510
ISBN: 978-81-924893-0-8
significantly affected by the type of fuel used, its purity and the
quality of the air required to support the combustion. The hot-
corrosion attack involves more severe degradation of the alloy.
The hot-corrosion process depends on parameters such as alloy
composition, deposit composition, and temperature.
2.0 COATINGS
2.1 Coating Techniques
If a material is added or deposited onto the surface of another
material (or the same Material), it is known as a coating.
Coatings are frequently applied to the surface of Materials to
serve one or more of the following purposes:
To protect the surface from the environment that may produce
corrosion or other
 Deteriorative reactions.
 To improve the surfaces appearance.
There are many coating deposition techniques available, and
choosing the best process depends on the functional
requirements, (size, shape and metallurgy of the substrate),
adaptability of the coating material to the technique intended,
level of adhesion required, and availability and cost of the
equipment.
2.2 Thermal Spraying Technology
Thermal spraying is a process of depositing a superior material
layer over a base metal or substrate either to improve the
surface characteristics like corrosion resistance, wear
resistance, surface fatigue or to get the desired dimension, size,
surface appearance etc. In thermal spraying the feed stock
material, in the form of a wire or powder of metallic or non
metallic materials is melted or softened by flame or electricity
and propelled on to prepared work piece to form a coating.
Thermal spray coating processes are not only capable of
applying coatings with excellent wear resistant properties, but
also the range of materials capable of being sprayed so wide
that applications for thermally sprayed wear resistant coatings
are unlimited [9].
2.3 Corrosion Protection
Plating, painting, coating and the application of enamel are the
most common anti-corrosion treatments. They work by
providing a barrier of corrosion-resistant material between the
damaging environment and the structural material. Platings
usually fail only in small sections, and if the plating is more
noble than the substrate (for example, chromium on steel), a
galvanic couple will cause any exposed area to corrode much
more rapidly than an unplated surface would. Painted coatings
are relatively easy to apply and have fast drying times although
temperature and humidity may cause dry times to vary.
Corrosion can be prevented through using multiple products
and techniques including painting, coating, sacrificial anodes,
cathodic protection (electroplating), and natural products of
corrosion itself.
2.4 Hot-Corrosion Protection
In general, thermal spray coating are used to define a group of
processes that deposit finely divided metallic or non metallic
materials onto a prepared substrate to form a coating.
“Thermal spraying is a technique that is capable to solve the
problems like wear, corrosion and thermal stability by
depositing thin layer on surface of substrate.” The coating we
apply on a prepared substrate may be in powder, rod or wire
form. The thermal spray gun uses plasma arc, combustible
gases or an electric arc to generate the heat necessary to melt
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
the coating material. The material changes to a plastic or
molten state when heated and is accelerated by process gases.
The acceleration of the molten material produces a confined
stream of particles that the process gases transfer to the
substrate. The particle strikes the substrate with a large impact
and form thin platelets that bond to the substrate and to each
other. The particles built up and cool into a lamellar structure
that forms a coating.
2.5 Thermal Spray Coating Process
Thermal spraying is group of processes which are used to coat
surface of substrates, wherein coating material is heated and
projected with high velocity onto surface of substrate [15]. The
coating material is heated to change in molten state and
accelerated by compressed gas stream to prepared surface of
base material. The molten particles strike the substrate where
they splat, spread, solidify and adhere to the irregularities of
the prepared substrate and build up new surface [16]. There are
many thermal spray coating techniques named as; flame
spraying, plasma spraying, detonation gun, high velocity oxy-
fuel (HVOF) and arc spraying.
In addition, multi-phase coatings, such as cermets, can have
enhanced pullout due to the different sizes and densities of the
as-sprayed powders. Consequently, if care is not taken when
preparing a thermal spray coating for analysis, pullout can
cause erroneous porosity, volume %, and even chemistry
measurements. Several papers have dealt with metallographic
preparation and routine analysis of thermal spray coatings. [17]
3 MATERIAL AND METHODS
3.1 Selection of Substrate Material
Selection of candidate material for the study has been after
consultation with CHEEMA BOILERS LIMTED (INDIA).
Boiler steel substrate material T-11 (ASTM – SA-213) has
been selected for the present study as the substrate material.
ASTM-SA 213, T11boiler steel has been selected as the
substrate material for the present study. The boiler steel is used
as boiler tube materials in some of the power plants in
Northern India. The material for the study was made available
from the CHEEMA BOILERS LIMTED (INDIA).
3.2 Preparation of Material
Specimens with dimensions of approximately 20mm x 15mm x
5mm were cut from the alloy tubes. The specimens were
prepared manually and care taken to avoid any structural
changes in the specimens. The specimens were grit blasted
with Al2O3 (grit 60) before the deposition of the coating
3.3 Deposition of Coatings
The available coating material Ni-20Cr, in the powder form,
was used as the coating material in the study. Detonation gun
technique was selected for deposition of the coating. The
coating was made available by SVX POWDER M SURFACE
ENGG. PVT LTD. GREATER NOIDA (INDIA)
3.4 Coating Formulation
Detonation-gun process was used to apply coating on the super
alloys at SVX powder M Surface Engineering Pvt. Ltd, Greater
Noida (India). Standard spray parameters were used for
depositing the Ni-20Cr coating. All the process parameters
were kept constant throughout the coating process. The
thickness of the coatings was measured from Electronic
magnetic Induction Thickness Gauge. The average coating
thickness of the coatings ranges from 250 to 350 micron.
511
ISBN: 978-81-924893-0-8
3.5 Hot Corrosion Studies
Hot corrosion studies were conducted at 900°C in the
laboratory using silicon carbide tube furnace, calibrated up to
the variation of ±5°C. The uncoated samples were subjected to
mirror polishing, whereas coated samples were subjected to
wheel cloth polishing for 5min. Thereafter, the samples were
heated in the oven up to 250°C and the salt mixture of
Na2SO4–60% V2O5 dissolved in distilled water was coated on
the warm polished samples with the help of a camel hair brush.
The amount of the salt coating varies in the range 3.0–
5.0mg/cm2. The coated samples were then dried at 110°C for
3–4h in the oven to remove the moisture and weighed. Hot
corrosion studies were carried out for 50 cycles. Each cycle
consisted of 1h heating at 900°C followed by 20min cooling at
room temperature. The weight of samples was measured at the
end of each cycle and spalled scale was also taken into
consideration. The corroded samples were analysed by XRD,
SEM/EDAX and EPMA.
4. EXPERIMENTAL SETUP AND
PROCEDURE UNDER HIGH
TEMPERATURE HOT CORROSION
STUDIES
The high temperature oxidation and hot corrosion study was
conducted at a temperature of 900oC by using Silicon carbide
tube furnace in laboratory. Firstly, the furnace was calibrated
using platinum- rhodium thermocouple and a temperature
indicator with a variation of ±30C. Heating zone in the tube
was found out for 900oC with the help of thermocouple. The
uncoated steel specimen was cleaned with acetone using before
study. Alumina boats were used to place the samples in furnace
for corrosion studies.
The boats were preheated at a constant temperature of 500oC
for 6-7 hours. It was done to ensure that their weight will
remain constant during the high temperature corrosion study.
For conducting the experiment, each sample was kept in the
boat and the weight of the sample was measured. Then the
sample was inserted into the heating zone in the furnace at
900oC. The holding time in furnace was 1 hour and after that
the boat with the sample was measured with help of electronic
weight balance meter of HEICO make (Type- class II). This
consisted one cycle of the study. The study was carried out for
50 cycles. The scale formed and fell in the boat was also taken
into account consideration for weight change measurement.
4.1 High-Temperature Corrosion Studies
(Molten Salt Bath Environment)
Cyclic corrosion studies were performed in molten salt of
Na2SO4-60 wt. % V2O5 for 50 cycles. Each cycle consisted of
1 hour heating at given temperature, i.e. 900oC in a Silicon
carbide tube furnace followed by 20 min cooling at room
temperature. The cyclic conditions have been chosen to create
a more aggressive situation of corrosion attack [40, 27].
Na2SO460%-V2O5 has been selected for the study due to the
fact that the vanadium and sodium are common impurities in
low-grade fuels.
The mixture of Na2SO4 and V2O5 in the ratio of 40:60 (40%
Na2SO4 and 60% V2O5 by weight) constitutes a eutectic with
a low melting point of 5500C and provides a very aggressive
environment for hot corrosion to occur and the corrosion
increases with the increase in the temperature and V2O5
content in the mixture [18]. The studies were performed for
uncoated as well as coated specimens for the purpose of
comparison. Na2SO4-60%V2O5 mixture prepared in distilled
water was applied uniformly on the warm specimens with the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

help of a hair brush. The amount of the salt coating was kept in various analytical techniques such as visual observations,
the range of 3.0-5.0 mg/ cm2. The salt-coated specimens as weight change studies, evaluation of corrosion rate in terms of
well as the alumina boats were then kept in the oven for 3-4 h wall thickness lost X-Ray diffraction (XRD) analysis,
at 1500C. Then they were again weighed before exposing to SEM/EDS analysis etc.
hot corrosion tests in the Silicon carbide tube furnace. The salt 4.2.2 XRD Analysis on Boiler Steel
mixture was applied on the surface only once in the beginning The XRD analysis of the uncoated and coated specimen was
of the test, and it was not replenished during the test. During carried out with X-ray Diffractometer (Goniometer) at
hot corrosion runs, the weight of boats and specimens were THAPAR University Patiala. To recognize various phases
measured together at the end of each cycle, with the help of formed on the surface. The specimens were scanned with speed
electronic balance machine with a sensitivity of 1 mg. The of 20 / min in 2θ range of 10° to 110° and the intensities were
spalled scale was also included at the time of measurements of recorded
weight change to determine total rate of corrosion. The surface
of the corroded specimens was visually observed to record
color, spalling, and peeling of scale during cyclic corrosion. 4.2.2 XRD Analysis Ni-Cr Coated Substrate
Efforts were made to formulate the kinetics of corrosion. XRD, of T-11 Boiler Steel
SEM and EDS techniques were used to analyze the corrosion The XRD analysis as shown in Fig 5.1 for the D-Gun sprayed
products. Ni-Cr coating on T-11 boiler steel as-sprayed before exposure
in Molten salt enviroment, indicate the formation of CrNi
4.2 Characterization of Coatings (Chromium Nickle) and NiC (Nickel Carbide).
4.2.1 Analysis of Corrosion Products
All the specimens subjected to hot corrosion at 900oC for 50

Counts
Chromium Nickel; ( Cr Ni ); Carbon; C; Silicon; Si; Nickel Carbide; Ni C

NiCR
Chromium Nickel; ( Cr Ni ); Nickel Carbide; Ni C

2000

Carbon; C; Silicon; Si

Nickel Carbide; Ni C

Nickel Carbide; Ni C
1000

0
20 30 40 50 60 70 80 90 100

Position [°2Theta] (Copper (Cu))

Figure: 1. XRD diffraction pattern for Ni-20Cr coated T-11 boiler steel before hot corrosion

Table: 1 Major and minor phases identified by XRD analysis Ni-Cr Coated Substrate of T-11 Boiler Steel.

Displacement Chemical
Ref. Code Score Compound Name Scale Factor
[°2Th.] Formula

01-071-7594 39 Chromium Nickle 0.435 0.848 Cr Ni

00-026-1082 16 Carbon 0.196 0.875 C

01-089-9054 13 Silicon 0.090 0.899 Si

00-014-0020 29 Nickel Carbide -0.193 0.434 Ni C

cycles in the Molten Salt environment were analyzed for the

characterization of corrosion products. The surface and cross-
section of the corroded specimens were analyzed by using

512
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4.2.3 X-Ray diffraction (XRD) analysis of The oxide scale of uncoated steel is found to have presence of
mainly in higher intensity Cr-O and higher amount of Fe and O
Un-Coated Corroded Substrate in the scale along with Cr2O3 and Mg2Si04. Some small peaks
The X-ray diffraction of un-coated specimen as shown in Fig of SiO4 and CrP4 (Chromium Phosphide) also observed.
5.8 subjected to Corrosion testing in molten salt environment
of Na2So4-60%V2O5.

Counts

Cr P4; Cr2 O3
Uncoated T11

O3Cr2 O3

Cr - O; Mg2 Si O4; Cr P4; Cr2 O3

Mg2 Si O4; Cr P4; Cr2 O3

Cr2O4;

Cr - O; Cr P4; Cr2 O3
O4; Si

Cr - O; Mg2 Si O4; Cr P4; Cr2 O3

- O;SiMg2

Cr - O; Mg2 Si O4; Cr P4; Cr2 O3

1000

Cr - O; Cr P4; Cr2 O3
Mg2 Si O4; Cr P4; Cr2 O3
Cr - O;CrMg2

Mg2 Si O4; Cr P4; Cr2 O3

Cr P4; Cr2 O3

Mg2 Si O4; Cr2 O3

Cr - O; Cr P4
Cr P4
Cr - O; Cr P4

Cr P4
Cr2 O3

500

0
20 30 40 50 60 70 80 90 100

Position [°2Theta] (Copper (Cu))

Figure: 2 XRD analysis of Un-Coated T-11 Boiler Steel showing XRD Diffraction Pattern After Hot Corrosion

Table: 2 Major and minor phases identified by XRD analysis Un-Coated Substrate of the hot corroded T-11 Boiler Steel specimens after 50
cycles.
Displacement
Ref. Code Score Compound Name Scale Factor Chemical Formula
[°2Th.]
00-006-0532 28 Chromium Oxide -0.115 0.315 Cr - O
01-074-1684 7 magnesium silicate – -0.368 0.186 Mg2 Si O4

01-071-0547 15 Chromium Phosphide 0.175 1.096 Cr P4

01-070-3765 19 Chromium Oxide -0.266 0.452 Cr2 O3

4.2.4 X-Ray diffraction (XRD) analysis of

identified in XRD pattern of coating. Enhance oxide scale of
Ni- 20%Cr Corroded Substrate steel Fe and NiO was observed along with SiC at highest
The XRD patren of Ni-20% Cr as-sprayed coating depicted in intensity which has been for improving hardness of the coating.
Fig 5.9 shows that both the feedstock and coating have Ni as However, No inter metallic phase has been revealed.
the most prominent phase with small intensity of chromium.
Very low intensity of peak Fe3O4

513
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Counts
NiCrCoated

8000

Fe; Si C; Ni O
6000

Si C; Ni OSi C; Ni O

4000

O Ni O
Fe; Mo2 C; NiFe;

Mo2 C; Si C; Ni O
2000

Si C; Ni O
Mo2 C; Si C

Ni O

Ni O
SiSiCC

Si C

Si C

Si C

0
20 30 40 50 60 70 80 90 100

Position [°2Theta] (Copper (Cu))

Figure: 3. XRD analysis of Ni-Cr Coated T-11 Boiler Steel showing XRD Diffraction Pattern After Hot Corrosion

Table: 3 Major and minor phases identified by XRD analysis Ni-Cr Coated Substrate of the hot corroded T-11 Boiler Steel specimens after 50
cycles.
Displacement
Ref. Code Score Compound Name Scale Factor Chemical Formula
[°2Th.]
01-071-4650 26 Iron -0.200 0.822 Fe

01-071-4292 20 Phosphorus -0.453 0.195 P

00-015-0457 23 Molybdenum Carbide -0.197 0.073 Mo2 C

01-080-0017 13 Carbon -0.370 0.027 C

01-089-1975 6 Silicon Carbide 0.137 0.014 Si C

00-022-1189 63 Nickel Oxide 0.009 0.926 Ni O

5.5 Weight change and thickness loss data to Engineering & Technology for corrosion studies is presented in
the Fig: 5.6 in the form of graphs between weight gain and loss
corrosion studies in Molten Salt per unit area (mg/cm2) versus time expressed in number of
Environment at 900ºC for 50 cycles cycles. It can be observed from the graph that uncoated and Ni-
Thermo gravimetric data for coated and Un-Coated T-11 boiler 20Cr coated T-11 boiler steel has shown
steel subjected to cyclic testing in molten salt environment in
Silicon carbide tube furnace at Rayat Bahra Institute of

514
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure: 5.4. (a) Weight Change/Area Vs Number Of Cycles for Comparison between Un-coated and

Coated specimen

B
Figure: 5.4. (b) Bargarph shown the overall Weight Change /Area After Corrosion test in Molten Salt Enviroment
Weight loss Data Calculations
Total weight loss of Un-Coated Substrate – Weight of Coated Substrate
Weight of Un-Coated Substrate

1. Under employed spraying conditions the coating Ni-

6. CONCLUSIONS
The high temperature corrosion behaviors of coated and
uncoated T-11 boiler steel have been investigated in the molten
salt environment at 9000C for 50 hours (50 cycles). The
following conclusions are made:
20Cr has been successfully deposited on ASTM-A-213,
T-11by Detonation –gun spraying technique.
2. D-gun-sprayed Ni-20Cr coating may be recommended
as a suitable process-coating combination for the said
environment.
3. The un-coated T-11 boiler steel suffered accelerated
oxidation during exposure at 900°C in air as well as
molten salt environment in comparison with its coated

515
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

substrate. It has also been observed that the molten salt oxidation in super alloy,” Materials Science and Engg.,
corrosion loss for the Ni-Cr coated was significantly Vol. A265, pp. 87-94
Lower weight loss than un-coated. [13] Chen, K.C, He, J.L, Chen, C.C, Leyland, A and
4. The uncoated T-11 boiler steel and Ni-20Cr coated T- Matthews, A. (2001) “Cyclic Oxidation Resistance of Ni-
11 boiler steel have undergone intense spalling and Al Alloy Coatings Deposited on Steel by a Cathodic Arc
peeling of scale and enormous weight gain during Plasma Process,” Surface Coating Technology, Vol.135,
corrosion attack molten salt environment at 9000C after pp.158-165
50 cycles. [14] W.J. Trompetter a, A. Markwitz a, M. Hyland (2002),
5. In case of Un-coated T-11 boiler steel Cr–O, Mg2 SiO4 “Role of oxides in high velocity thermal spray coatings”,
were identified as main phase by XRD and EDS. Nuclear Instruments and Methods in Physics Research B
6. In Ni-Cr coated NiO, Fe3O4 and SiC was identified as vol.190.pp.518–523.
major phases in aggressive environment as revealed by [15] Eliaz, N., Shemesh, G. and Latanision, R.M. (2002) “Hot
XRD and EDS. Corrosion in Gas Turbine Components,” Engg. Failure
7. Corrosion resistance for coated and uncoated T-11 Analysis, Vol.9, pp. 31-43
boiler steel follows the sequence. [16] Eliaz, N., Shemesh, G. and Latanision, R.M. (2002) “Hot
Corrosion in Gas Turbine Components,” Engg. Failure
Ni-20Cr Coated>Uncoated T11 Analysis, Vol.9, pp. 31-43
[17] Rapp. Robert A. (2002) “Hot corrosion of materials: A
8. The coating was found to have significant resistance to fluxing mechanism,” Corrosion Science, Vol.44, pp. 209-
its oxide scale spallation during cyclic exposures. 221
Moreover, the coating was found to have retained its [18] Uusitalo, M.A., Vuoristo, P.M.J., Mantyla, T.A. (2002)
continuous contact with the substrate steel during these “High temperature corrosion of coatings and boiler
thermal cycles. This indicates that the coating has good steels in reducing chlorine-containing atmosphere,”
adhesion strength. Surface an Coatings Technology, Vol. 161, pp. 275-285
[19] Yamada, K., Tomono , Y., Morimoto, J., Sasaki, Y.,
Ohmori, A. (2002) “Hot corrosion behavior of boiler
REFERENCES tube materials in refuse incineration environment,”
[1] Nelson, H.W., Krause, H. H., Unger, E.W., Putnam, A. Vol.65, pp. 533-540
A., Slander, C.J., Miller, P.D., Hummel, J.D. and Landry, [20] Srikanth, S., Ravikumar, B.Das, S.K., Gopalkrishna, K.,
B.A.(1959) “A Review of Available Information on Nandakumar., K. and Vijayan, P. (2003) : “Analysis of
Corrosion and Deposits in Coal and Oil Fired Boilers Failure in Boilers Tubes due to Fireside Corrosion in a
and Gas Turbines,” Report of ASME Research Pub. Waste Heat Recovery Boiler,” Engineering Failure
Pergamon Press and ASME, New York, pp. 1-197 Analysis, Vol.10, pp. 59-66
[2] Stringer J. (1987) “High Temperature corrosion of super
alloys,” Material Science Technology, Vol.73, pp. 482-
93
[3] Wright IG (1987) “High Temperature Corrosion,” In:
Metals Handbook Vol. 13.9th ed. Metals Park ASM, pp.
97-103
[4] Stringer J. (1987) “High Temperature corrosion of super
alloys,” Material Science Technology, Vol. 73, pp. 482-
93
[5] Otsuka N, Rapp R.A (1990) “Hot corrosion of pre-
oxidised Ni by a thin fused Na2SO4 film at 900oC,” J
Electrochemistry Society, Vol. 137 (1): pp. 46-52
[6] Natesan, K. (1993) “Applications of Coating in Coal –
Fired Energy Systems,” Surface and Coatings
Technology, Vol.56, pp. 185-197
[7] Hocking, M.G. (1993) “Coatings resistant to erosive
/corrosive and severe environments,” Surface and
Coatings Technology, Vol. 62, pp. 460-466
[8] Simmas, N.J., Oakey, J.E., Stephenson, D. J., Smith, P.J,
Nicholls, J.R., (1995) “Erosion-Corrosion modeling of
gas turbine materials for coal fired combined cycle
power generation,” Wear, Vol. 186-187, pp. 247-255
[9] Heath, G.R., Heimgartner, P., Irons G., Miller, R.(1997)
“An assessment of Thermal Spray Coating Technologies
For High Temperature Corrosion Protection,” Material
Science Forum, Vol. 251-54, pp. 809-816
[10] Stott, F.H. (1998) “The Role of the Oxidation in the Wear
of Alloys,” Tribology international Vol. 31 PP. 61-71
[11] Khanna, A.S and Jha. S.K. (1998) “Degradation of
Materials under Hot Corrosion Conditions,” Trans.
Indian Inst. Met., Vol.51, No.5, pp. 279-290
[12] Khalid, F.A, Hussain, N., Shahid, K.A (1999)
“Microstructure and morphology of high temperature

516
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

ANALYSIS AND OPTIMIZATION OF VOID SPACES IN

SINGLE PLY RAW MATERIAL USING FINITE ELEMENT
METHOD & FUSED DEPOSITION MODELING
Harmeet Singh
M-tech Student
Deptt of Mechanical Engineering
BBSBEC, Fatehgarh Sahib
waliamangwal@gmail.com
JPS Oberoi
Professor & Dean (R&D)
Deptt of Mechanical Engineering
BBSBEC, Fatehgarh Sahib
jpsoberoi@gmail.com
Rajmeet Singh
Assistant Professor
Deptt of Mechanical Engineering
BBSBEC, Fatehgarh Sahib
rajmeet.singh@bbsbec.ac.in

able to hollow certain portion of layer. In this way low weight

1. ABSTRACT
Fused Deposition modelling (FDM) technology is based on
decomposition of 3-D computer models into thin cross
sectional layers, followed by physically forming the layer and
stacking them up layer by layer. FDM provide freedom to add
material in the desired area and we are also able to create
hollow region in certain portion of layer. In this way low
weight with good strength single ply raw material with hollow
cross section is produced. Void spaces were created in single
ply raw material. FEM analysis was applied to select the
material. Results of FEM analysis shows that ABS material is
better compressive as comparison to Nylon101, Nylon6/10.
So ABS material is selected for manufacturing of specimens.
ABS specimens were manufactured with the help of FDM.
Compressive test of specimens at 8000N shows that two
small square structures give optimum results for ABS
material.
with good strength single ply raw material with hollow cross
section is produce.
3. PROBLEM STATEMENT
The main requirement is to create Void spaces in single ply raw
material to decrease weight of single ply raw material. FEM
analysis is applied to compare the Nylon101, Nylon6/10 and
ABS material. CAD drawing of void spaces are created and
then it is converted into STL files to give input to FDM
machine. ABS specimens were manufactured with the help of
FDM. Compressive test were done on the specimen to find the
compressive strength.
4. METHODOLOGY

KEYWORDS
STL - Standard Triangulation Language, FEM - Finite Element
method
ABS - Acrylonitrile Butadiene Styrene, FDM - Fused
Deposition modelling

2. INTRODUCTION
In modern time low weight high strength materials is in high
demand with the development of automobile and aerospace
sector. The term rapid prototyping refers to a class of
technologies that can automatically construct physical models
from computer aided design data and allow designers to
quickly create tangible prototypes of their design rather than
just two dimensional pictures. Fused deposition modelling is
based on decomposition of 3-D computer models into thin
cross sectional layers, followed by physically forming the
layer and stacking them up layer by layer. RP provide
Figure 1: Flow chart of methodology
freedom to add material in the desired area and we are also

517
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

5 MATERIAL SELECTIONS BY FEM Table 2: Result for two small square void structure
ANALYSIS S MATERIAL DISPLACEMENT
Three dimensional drawing of single ply raw material with void No NAME (COMPRESSIVE
space are created by CAD software are analysed with FEM TEST) mm
software. Displacement is the criteria for deciding the strength. 1 NYLON 101 0.216401
Strength is inversely proportional to the displacement therefore 2 NYLON 6/10 0.0958644
3 ABS 0.0928
the compressive strength is considered for selection of the
material and shape of void space. Load applied on the specimen
was 8000N during the FEM analysis. Fixture is applied at the
bottom surface and load is applied at the top surface.

5.1 Compressive strength of various materials 0.3 Displacement(Compressive Test)

0.216401
(without void space)

Displacement
0.2

0.0958644 0.0928
0.1

0
Nylon101 Nylon6/10 ABS
Figure 3: Result for two small square void structure
NYLON101 NYLON6/10 ABS
Table 1: Result for without void structure Result of FEM analysis show that ABS material has 0.161mm
S No MATERIALS DISPLACEMENT in mm displacement in without void structure and 0.0928mm
(COMPRESSIVE TEST) displacement in two small square void structure which is less
1 NYLON 101 0.166134
displacement as comparison to Nylon101 and Nylon6/10. ABS
2 NYLON 6/10 0.2196229
3 ABS 0.161 material has better compressive strength. So ABS material is
selected for manufacturing of specimens by Fused deposition
0.3 modelling.
DISPLACEMENT(COMPRESSIVE TEST)
0.2196229
6. MANUFACTURING OF SPECIMEN BY
FUSED DEPOSITION MOULDING
Displacement (mm)

0.2
0.166134 0.161
Fused deposition moulding is used to manufacture the specimens
of ABS material of different void shape structure. Size of the
0.1 specimen is 25mm x 5mm x25mm. Solid works drawing in STL
format is given as input to FDM machine. The chamber
temperature is maintained in the range of 750c to 790c and
0 nozzle temperature is maintained in the range of 310 0c to 3200c.
NYLON 101 NYLON 6/10 ABS
Materaials Nozzle of the machine spread a minute layer of base material on
the table. SR30XL soluble material is used asbase material.
Figure 2: Result for without void structure
Temperature of the base material is maintained in the range of
5.2 Compressive strength of various materials
2950c to 3000c. Processor of the machine supply the model
(Two small square void space)
material in those places which were shown solid in the drawing
through nozzle and base material supply to those portions which
were shown void for support of the structure. P430XL ABS
model (IVR) material is used as model material. Temperature of
NYLON101 NYLON6/10 ABS the model material is maintained 3050c to 3100c. Process of

518
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
model and base material is continuing until product is not
completed with the layer resolution of 0.2540mm.
Figure 4 : Fused Deposition Modelling Machine
For removing base material from the void space solution of
following chemicals in water is maintained at 500c in vibrating
mode:
A. Tetra sodium N1-bis carboxyl to methyl)-I-glutamate and
citric acid
B. Sodium Percarbonate
Temperature of solution is maintained at 50 0c with the help of
electrical heating element and the turbulence is created in the
solution by vibration. Solution is alkaline in nature and the
specimen is dipped in the solution for 20 to 24 hours to remove
the base material. After removing the base material, specimens
were dried out in atmosphere.
Figure 5: Solid Specimen
Figure 6 : Two small square void specimen
7. COMPRESSION TEST
Compressive test is done with the test speed of 2mm/min. Load
applied on the specimen is 8000N.
519
ISBN: 978-81-924893-0-8
Table 3 : Result of Compressive Test
Result of compressive
Sr
Part Name test(displacement in
No.
mm)
1 Solid 0.204
Two small square
2 0.083
void shape
8. RESULT
Two small square void structure shows 0.083mm displacement
in compressive test. So it is better alternative in compressive
load.
REFERENCES
[1]. Awate, S., and Kore, S., 2014, “Finite Element Based
Analysis of the Effect of Internal Voids on the Strength
and Stress Distribution of Component- Review” Journal
of Engineering Research and Applications, Vol. 4, pp.
272-273.
[2]. Mireles, J., and Espalin, D.,2012, “Fuse deposition
modeling of metals,” W.M. Keck Center
for 3D Innovation, The University of Texas at El Paso,
El Paso, TX.
[3]. Novacova and kuric 2012. “Basic and advance material
for Fused Deposition Modeling Rapid prototyping
Technology” Manuf. and Ind. Eng., 11(1), 2012, ISSN
1338-6549 © Faculty of Manuf. Tech.
[4]. Danas, K., and Aravas, N., 2012, “Numerical modeling
of elasto-plastic porous materials with void shape effects
at finite deformations” Composites pp. 1-16.
[5]. Huang, L., Zhao, G., and Wang, Z., 2011, “Shape
Quality Improvement of Three-DimensionalHexahedral
Meshes” Journal of Information & Computational
Science, Vol. 8, pp. 4007-4014.
[6]. Kavcic,Babic,Osterman,Podobnik,Poberaj(2011) Rapid
prototyping system with sub-micrometer resolution for
microfluidic applications, Springer-Verlag 2011
[7]. Benini,Mancini, Minutolo ,Longhi,Montanari(2011) A
Modular Framework for Fast Prototypingof Cooperative
Unmanned Aerial Vehicle, journal intelligent robot
system
[8]. Bagsik, A., and Schoppner, V., 2011, “Mechanical
Properties of Fused Deposition Modeling parts
manufacturing” ANTEC Boston, pp. 1-5
[9]. Haiou Zhang, Xinhong Xiong and Guilan Wang(2009)
Metal direct prototyping by using hybridplasma
deposition and milling, journal of materials processing
technology 124–130
[10]. Singh, R(2010) Three dimensional printing for casting
application : A state of art review and future perspective ,
Advanced Material Research , Vol .83-86, pp. 342-349.
[11]. Singh, J.P. and Singh, R. (2009) Comparison of rapid
casting solution for lead and brass alloys using three
dimensional printing, Proc. Of institute of mechanical
engg. Part C, journal of Mechanical Sciences, Vol 223,
No. 9, pp.2117-2123.
[12]. Kanzaki, Bassoli, luliano, L. and Violante ,MG (2007)
Engineering plastics and metals have been extensively
replaced by polypropylene, Rapid prototyping journal ,
Vol 13, No. 3, pp. 148-155
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[13]. Singh, R(2010) Future potential of rapid prototyping and
manufacturing around the world, Rapid Prototyping
Journal , Vol 1, No.1, pp. 4-10.
[14]. Eyer,D. and Drstvensek, K., (2010) Technologies review
for mass customization using rapid prototyping ,
Assembly Automation ,Vol.30, No.1, pp. 39-46 .
[15]. Gatto and Harris ,Russel Anthony (2010)
Nondestructive analysis of external and internal
structures in 3DP, Rapid Prototyping journal ,Vol.17
,No.2, pp. 128-137
[16]. Simon Li, Li Chen(2010) Pattern-based reasoning for
rapid redesign: a proactive approach, Res Eng Design
Vol 21,25–42
[17]. Haihua Wu, Dichen Li, Xiaojie Chen ,Bo Sun, Xu(2010)
Rapid casting of turbine blades with abnormal film
cooling holes using integral ceramic casting molds,
Journal Advance Manufacturing Technology, Vol. 50,pp
13–19
[18]. Yagnik, D., 2010, “ Fused Deposition Modeling – A
Rapid Prototyping technique for Product Cycle Time
Reduction cost effectively in Aerospace Applications”
Journal of Mechanical and Civil Engineering, pp. 62-68.
[19]. Xiaoyong Tian andDichen Li(2010) Rapid manufacture
of net-shape SiC components, Journal Advance
Manufacturing Technology, Vol. 46,pp 579-587
[20]. Wang , G., Li, H., Guan, Y. and Zhao, G. (2004) A rapid
design and manufacturing system for product
development application , Rapid Prototyping Journal
,Vol. 5, pp 169-178.
[21]. Yongnian, y., Shengjie, L., and Xiaohong, W., 2009,
“Rapid Prototyping and Manufacturing Technology:
Principle,Representative Technics, Applications, and
Development Trends” Tsinghua science and technology,
Vol 14, pp. 1-12.
[22]. Bourell, D.L, Leu ,M.C. and Rosen ,D.W.(2009), Road
map for additive manufacturing identifying the future of
freeform processing , University of Texas at Austin
[23]. Rochus, P., Kruth J. P., and Carrus R., 2007, “New
applications of rapid prototyping and rapid manufacturing
(RP/RM) technologies for space instrumentation” Acta
Astronautica. Vol. 61, pp. 352-359.
520
ISBN: 978-81-924893-0-8
[24]. Lee, C. S., Kim S. G., Kim H. J., and Ahn S. H., 2007,
“Measurement of anisotropic compressive strength of
rapid prototyping parts” Journal of Materials Processing
Technology, Vol. 187, pp. 627–630.
[25]. Palmer, J. A., Summers, J. L., Davis, D. W., Gallegos, P.
L., Chavez, B. D., Yang, P., Medina, F., and Wicker, R.
B., 2005, “Realizing 3-D Interconnected Direct Write
Electronics within Smart Stereolithography Structures,”
IMECE2005-79360, Proceedings of 2005 ASME
International Mechanical Engineering Congress
andExposition, ASME, Orlando, FL.
[26]. Khan, Lee, B. H., Z. A., and Abdullah, J., 2005,
“Optimization of rapid prototyping parametersfor
production of flexible ABS object,” Journal of Materials
Processing Technology, pp. 54–61.
[27]. Jun Xie, Shuhuai Huang, Zhengcheng Duan(2005)
Positional correction algorithm of a laser galvanometric
scanning system used in rapid prototyping
manufacturing, Journal Advance Manufacturing
Technology, Vol. 26,pp 1348–1352
[28]. Liu, Ming Leu, Richards and Schmitt(2004)
Dimensional accuracy and surface roughness of rapid
freeze prototyping ice patterns and investment casting
metal parts, Journal Advance Manufacturing Technology
Vol 24, pp485–495
[29]. Shin,Yang,Choi,Lee and Whang(2003) A new rapid
manufacturing process for multi-face high-speed
machining , journal advance manufacturing
technology,Vol 22, 68–74
[30]. Kulkarni, P., and Dutta, D., 1999, “Deposition Strategies
and Resulting Part Stiffness’s in Fused Deposition
Modeling,” ASME Journal of Manufacturing Science
and Engineering, pp. 93-103.
[31]. Masood, S. H., 1996, “Intelligent Rapid Prototyping with
Fused Deposition Modeling,” Rapid Prototyping Journal,
2(1), pp. 24-33.
[32]. Agarwal, M. K., Jamalabad, V. R., Langrana, N. A.,
Safari, A., Whalen, P. J., and Danforth, S. C., 1996,
“Structural Quality of Parts Processed by Fused
Deposition,” Rapid Prototyping Journal, pp. 4-19.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Analysis of the Enablers for Selection of Reverse
Logistics Service Provider: An Interpretive Structural
Modeling (ISM) Approach
Arvind Jayant
Department of Mechanical Engineering
Sant Longowal Institute of Engineering &
Technology, Longowal, Sangrur, Punjab – 148106,
INDIA
arvindjayant@gmail.com
ABSTRACT
Activities of reverse logistics are extensively practiced by lead
acid battery manufacturing industries. One of the important
problems experienced by the company management in the
battery manufacturing industries is the irregular supply of spent
batteries/spent lead from the end users in the supply chain
management of batteries production. In the competitive
business environment, the industry is involved in reuse,
recycling, and remanufacturing functions using a third party
logistics provider which has an impact on the total
performance of the firm. In the development of the reverse
logistics concept and practice, the selection of providers for
the specific function of reverse logistics support becomes
more important. After comprehensive literatures survey, it
was concluded that multiple dimensions and attributes must
be used in the evaluation of 3PRLP.The attributes play an
important role in selecting a third party reverse logistics
provider (3PRLP). Interpretive structural modeling (ISM)
methodology is applied in the present work, which can be
used for identifying and summarizing relationships among
specific attributes for selecting the best third party reverse
logistics provider among the „n‟ 3PRLPs. The study has used
three different research phases: identification of enablers from
the literature, interviews with various department managers and
a survey in industry. A model of these enablers has been
developed based upon experts‟ opinions. Clear understanding of
these enablers will help organizations to prioritize better and
manage their resources in an efficient and effective way.
Keywords
Interpretive structural modeling (ISM);Reverse Logistics
Service, Reverse Logistics, MCDM
1. INTRODUCTION
With rapid business growth in globalization, some
industries with relatively limited resources have to
outsource some business functions or operations,
purchase raw materials or components/subcomponents
from other small medium enterprises to establish an
interrelated supply network. Consequently, if they would
521
ISBN: 978-81-924893-0-8
Uttam Kumar
Department of Mechanical Engineering
Sant Longowal Institute of Engineering &
Technology, Longowal, Sangrur, Punjab – 148106,
INDIA
like to execute green programs to advance their
environmental performance, they not only monitor their
own operations, also coordinate other partners in their
supply networks, including reverse logistics activities,
material suppliers, manufacturers, distributers, users and
so on. For supply chain mangers, they both insured
traditional performance criteria as well as environmental
criteria, known as green supply chain management. The
outsourcing of reverse logistics activities to third party
has now become a common practice. Reverse logistics
encompasses the logistics activities all the way from used
products no longer required by the user to products again
usable in the market. It is the process of planning,
implementing, and controlling the efficient, cost effective
flow of raw materials, in-process inventory, finished
goods and related information from the point of
consumption to the point of origin for the purpose of
recapturing value or proper disposal (Stock, 1998). The
most intuitively related notion with such reverse activities
involves the physical transportation of used products from
the end user back to the producer. Reverse distribution
activities involve the removal of defective and
environmentally hazardous products from the hands of
customers. This also includes products that have reached
the end of their usable life. It is a process whereby
companies can become more environmentally efficient
through reusing and reducing the amount of materials
used.The commonly known drives for logistics
outsourcing are the basic requirement of the organizations
to concentrate on core expertise, cost revision, design of
supply chain partnerships, re-engineering of the company,
success of the firms using contract logistics, globalization
forces, services level improvement and efficient
operations strategies etc. One of the most important
reasons for outsourcing of the logistics activities are the
capabilities of the logistics providers to support their
clients with the expertise and exposure that otherwise
would be difficult to acquire or costly to have in-house.
The most common outsourced activities are warehousing
operation, outbound logistics transportation, customs
brokerage, and inbound logistics transportation (Jayant et
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
al., 2012).Section 2 consists of literature review of
Reverse Logistics Provider. Enablersfor selection of RSP
in the battery industry have been identified and described
in section 3. Step wise elaborated procedure of
interpretive structural modeling in section 4. Section 5 is
Conclusions and then limitations of the study and scope
of the future work have been discussed in subsequent
sections.
2. LITERATURE REVIEW
A thorough literature review is presented in this paper to
find out the important evaluation criteria that need to be
considered in reverse logistics outsourcing partner
evaluation. Important issues such as the
tools/techniques/methodology presently being used for
the evaluation of a 3PL service provider and specific
problems faced in the evaluation process has been
discussed.
Supply chain management recognizes the importance of, and
focuses effort on, achieving tight integration between the
various links of the chain. To be efficient, a supply chain must
exploit modern productivity techniques and approaches, for
example JIT purchasing, economic batch sizes, strategic
inventory, reverse logistics, third party logistics, etc. Logistic
management is termed as the detailed process of planning,
implementing, and controlling the efficient, cost effective flow
and storage of materials and products, and related information
within a supply chain to satisfy demand (CLM, 2004), and
logistics is recognized as the key enabler that allows a company
to increase and maintain its competitive advantage and ensures
maximum customer satisfaction (Drucker, 1962). Reverse
logistics is the process of moving goods from their typical final
destination to another point, for the purpose of capturing value
otherwise unavailable, or for the proper disposal of the products
(Dowlatshahi, 2000). Reverse logistics is practiced in many
industries, and its effective use can help a company to compete
in all streams of advantages. Many situations exist for the
product to be placed in a reverse flow, such as commercial
returns, warranty returns, end- of-use returns, reusable container
returns, and others (Du and Evans, 2008). According to Andel
(1997), effective reverse logistics is believed to result in several
direct benefits, including improved customer satisfaction,
decreased resource investment levels, and reductions in storage
and distribution costs (Autry et al., 2000). Many manufacturers
and retailers recognize the importance and consider the
outsourcing of reverse logistics (Du and Evans, 2008). 3PRLP
selection and evaluation is one of the most critical activities that
commits significant resources and impacts the total performance
of the firm. The attributes involved in the selection and
evaluation process may vary depending on the type of product
considered, and these attributes are often in conflict with one
another.
Langley et al. 2003, the most common outsourced
activities are inbound transportation, outbound
522
ISBN: 978-81-924893-0-8
transportation, customs brokerage, and warehousing
operations. In the view of growing developments of
logistics outsourcing, many 3PL service providers are
now offering a variety of services at very attractive rates.
These services mainly involve supply chain to supply
chain business relationships, where not only the user is a
critical stakeholder but also their customers who are
directly affected by the quality of service of the
provider.Fifteen years ago, “Logistics” had not yet been
much explored. However today, with the development of
information technology and increased customer demand,
the enterprises have to handle lots of thorny tasks to take
care of the service problems. Therefore “Logistics” are
getting considerable attentions from the enterprises.
3. ENABLERS FOR SELECTION
OFREVERSE LOGISTICS SERVICE
PROVIDER
The company chosen for this study is a battery
manufacturing industry located in the northern part of
India. The main scope of this study is to evaluate logistics
service providers for hiring their service to collect &
supply the End-of-Life (EOL) Lead-acid batteries to the
company door step for reclaiming the lead from
automotive batteries. In the forward supply chain, the
major raw materials such as virgin lead, plastic, and
sulphuric acid are procured from different suppliers for
new battery production which is used in two wheelers,
four wheelers, and for other industrial applications. Once
the battery is produced in different plants it has to be
distributed through distributors, wholesalers, retailers and
then customers. After its end of life, the automobile
owner leaves the used battery at the automobile service
station (initial collection point), where it is replaced by a
new one. The used batteries collected at the collection
points should be quickly transshipped to centralized
return center where returned products are inspected for
quality failure, sorted for potential repair or recycling.
After inspection, the useless batteries (not able to recycle)
are disposed off and reusable batteries are transported to
disassembly/recycling plants where the batteries are
crushed and separated into different components (lead,
plastic, acid etc.). Except lead the remaining components
are sold to the third party for some other applications.
Finally the recycled lead is transported to the battery
manufacturing plants where this secondary lead is used
along with the virgin lead for new battery production. A
series of interviews and discussion sessions held in the
plant with company management, battery retailers, state
pollution control boards officials during this project and
following problem areas are identified for improvement in
closed loop supply chain of the lead acid batteries.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 Uncertainty involved in Supply of spent batteries
to recycling company and company is unable to
forecast collection of EOL products quantity.
 Presence of illegal lead smelting units in the state
for unauthorized battery collection &lead
recycling operation in business environment.
 The company is not having any well-structured
model of reverse logistics practice.
 Underutilization of existing facilities of the
battery closed loop supply chain.
The enablers identified from the literature review, expert
opinion and survey are:-
i. Customer service (CS)
ii. Customer satisfaction( CSF)
iii. Customer queries and Complaint (CQC)
iv. Information technology (IT)
v. On Time Delivery (OTD)
vi. New technologies(NTE)
vii. Market shares (MS)
viii. Return on investment (ROI)
ix. Recapturing values (REV)
The problem is here to develop a model of the identified
enablers for the selection of Reverse Logistics Service
Provider with the help of Interpretive Structural Modeling
(ISM) technique.
4. INTERPRETIVE STRUCTURAL
MODELING(ISM) APPLICATION
Interpretive Structural Modeling (ISM) is a methodology
used to identify relationship among specific elements,
which define a problem or issue. ISM is an interactive
learning process in which a set of dissimilar and directly
related elements are structured into a comprehensive
systematic model. The model so formed, portrays the
structure of a complex issue or problem, a system or a
field of study, in a carefully designed pattern implying
graphics as well as words. The basic idea of ISM is to use
experts‟ practical experience and knowledge to
decompose a complicated system into several sub-systems
(elements) and construct a multilevel structural model; it
523
ISBN: 978-81-924893-0-8
was firstly developed in 1970‟s (Ravi, V., & Shankar R.).ISM
is interpretive as judgment of the selected group for the
study decides whether and how the variables are related.
Some of the important characteristics of ISM as observed
are:
1. This methodology is interpretive as the judgment of the
group decides whether and how the different elements are
related.
2. It is structural, too, on the basis of relationship; an
overall structure is extracted from the complex set of
variables.
3. It is a modeling technique, as the specific relationships
and overall structure are portrayed in a digraph model.
ISM generally has following steps:
Step 1. Variables (criteria) considered for the system
under consideration are listed.
Step 2. From the variables identified in step 1, a
contextual relationship is established among the variables
in order to identify as to which pairs of variables should
be examined.
Step 3. A structural self-interaction matrix (SSIM) is
developed for variables, which indicates pair wise
relationships among variables of the system under
consideration.
Step 4. Reachability matrix is developed from the SSIM
and the matrix is checked for transitivity. The transitivity
of the contextual relation is a basic assumption made in
ISM. It states that if a variable A is related to B and B is
related to C, then A is necessarily related to C.
Step 5. The reachability matrix obtained in step 4is
partitioned into different levels.
Step 6. Based on the relationships given above in the
reachability matrix, a directed graph is drawn and the
transitive links are removed.
Step 7. The resultant digraph is converted into an ISM, by
replacing variable nodes with statements.
Step 8. The ISM model developed in step 7is reviewed to
check for conceptual inconsistency and necessary
modifications are made. The above steps are shown in
Figure 1.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Step 1: List of Enablers Literature review

Step 2: Establish contextual relationship (Xij) Expert Opinion

between attributes (i j)

Step 3: Develop a structural Self- Step 4: Develop Reachability

Interaction Matrix (SSIM) Matrix

Yes
Step 5: Partition the Reachability
Matrix into different levels

Develop the Reachability Matrix into its

conical form

Remove transitivity from the

Step 6: Develop Digraph
digraph

Step 8: Is there
Step 7: Replace attributes nodes any conceptual
with relationship statements inconsistency

No
Represent
Figure. 1.relationship statement
Flow diagram into model
for preparing for the
the ISM Enablers
model

Figure 1. Flow Diagram for ISM

4.1 Structural self-interaction matrix
To analyze the enablers for the selection of Reverse
Logistics Service Provider in the Battery industry, nine
enablers were considered. These enablers are taken from
the literature and after discussion with industrial experts
these enablers were included. These experts were senior
managers in manufacturing and procurement departments
and also experts in environmental in industry. As
discussed in section 3, experts from industry and the
Table 2. Structured Self Intersection Matrix (SSIM)
academia were consulted during the brainstorming session
to identify the nature of contextual relationships among
the enablers. In developing SSIM, following four symbols
have been used to denote the direction of relationship
between two enablers i and j.
V- Enabler i will lead to enabler j;
A- Enabler j will lead to enabler i;
X- Barrier i and j will lead to each other;
O- Barrier i and j are unrelated

Enablers B9 B8 B7 B6 B5 B4 B3 B2 B1
B1 V V O O X A X A X
B2 O X O A X O V X
B3 V O O A V O X
B4 A V O X V X
B5 X O O O X
B6 O O A X
B7 X V X
B8 A X
B9 X

524
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Based on the contextual relationships, the SSIM has been
developed (Table 2). Barrier 1 leads to barrier 8 so
symbol „V‟ has been given in the cell (1,8); barrier 2 leads
to barrier 6 so symbol „A‟ has been given in the cell (2,
6); barrier 5 and 9 lead to each other so symbol „X‟ has
been given in the cell (5,9); barrier 3 and 7 do not lead to
Table 3. Initial Reachability Matrix
each other so symbol „O‟ has been given in the cell (3,7)
and so on. The number of pair wise comparison question
addressed for developing the SSIM are ((N)* (N-1)/2),
where N is the number of enablers
4.2 Initial reachability Matrix

Enablers B1 B2 B3 B4 B5 B6 B7 B8 B9

B1 1 0 1 0 1 0 0 1 1

B2 1 1 1 0 1 0 0 1 0

B3 1 0 1 0 1 0 0 0 0

B4 1 0 0 1 1 1 0 1 0

B5 1 1 0 0 1 0 0 0 1

B6 0 1 1 1 0 1 0 0 0

B7 0 0 0 0 0 1 1 1 1

B8 0 1 0 0 0 0 0 1 0

B9 0 0 1 1 1 0 1 1 1

also be 1;for X(5,9) in SSIM, „1‟ has been given

In this step, the reachability matrix is developed from
SSIM. The SSIM format is initially converted into an
initial reachability matrix format by transforming the
information of each cell of SSIM into binary digits (i.e.
ones or zeros) in the initial reachability matrix by
substituting V, A, X, O by 1 or 0 applying following
rules:
in cell(5,9) and „1‟ in cell(9,5) also in initial
reachability matrix.
 If (i, j) value in the SSIM is O, (i, j) value in the
reachability matrix will be 0 and (j, i) value will
also be 0;for O(3,7) in SSIM, „0‟ has been given
in cell(3,7) and „0‟ in cell(7,3) also in initial
reachability matrix.

 If (i, j) value in the SSIM is V, (i, j) value in the Initial Reachability Matrix for Enablers for selection of
reachability matrix will be 1 and (j, i) value will the RLSP in table 3.
be 0;for V(1,8) in SSIM, „1‟ has been given in
cell(1,8) and „0‟ in cell(8,1) in initial reachability 4.3 Final reachability matrix with driving
matrix.
and dependence power
 If (i, j) value in the SSIM is A, (i, j) value in the
The final reachability matrix has been obtained by adding
reachability matrix will be 0 and (j, i) value will
transitivity as explained in Step 4 earlier. It is a basic
be 1;for A(2,6) in SSIM, „0‟ has been given in
assumption made in ISM. Final Reachability Matrix with
cell(2,6) and „1‟ in cell(6,2) in initial reachability
driving power and the dependence power of each barrier
matrix.
have also been shown in the Table 4.
 If (i, j) value in the SSIM is X, (i, j) value in the
reachability matrix will be 1 and (j, i) value will

525
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 4. Final Reachability Matrix with driving and dependence power

Enablers B1 B2 B3 B4 B5 B6 B7 B8 B9 Driving
Power
B1 1 1⃰ 1 1⃰ 1 0 1⃰ 1 1 8
B2 1 1 1 0 1 0 0 1 1⃰ 6
B3 1 1⃰ 1 0 1 0 0 1⃰ 1⃰ 6
B4 1 1⃰ 1⃰ 1 1 1 0 1 1* 8
B5 1 1 1⃰ 1* 1 0 1⃰ 1⃰ 1 8
B6 1⃰ 1 1 1 1⃰ 1 0 1⃰ 0 7
B7 1* 1* 1* 1* 1* 1 1 1 1 9
B8 1* 1 1⃰ 0 1⃰ 0 0 1 0 5
B9 1⃰ 1⃰ 1 1 1 1⃰ 1 1 1 9
Dependence 9 9 9 6 9 4 4 9 7 66/66
Power
*means value after applying transitivity

4.4 Partitioning of levels
The reachability and antecedent set (Warfield, J.W) for each
barrier have been determined from the final reachability
matrix. The reachability set for a barrier consists of the
barrier itself and the other enablers, which it influences.
Table 5. First Iteration to FIND LEVELS
The antecedent set consists of the barrier itself and other
enablers, which may influence it. Reachability and
Antecedent set and Intersection sets are found for the all
enablers shown in table 5. We have identified three levels
in our study.

S. No Reachability Set Antecedent Set Intersection Set Levels

1 1,2,3,4,5,7,8,9 1,2,3,4,5,6,7,8,9 1,2,3,4,5,7,8,9 I
2 1,2,3,5,8,9 1,2,3,4,5,6,7,8,9 1,2,3,5,8,9 I
3 1,2,3,5,8,9 1,2,3,4,5,6,7,8,9 1,2,3,5,8,9 I
4 1,2,3,4,5,6,7,8,9 1,4,5,6,7,9 1,4,5,6,9
5 1,2,3,4,5,7,8,9 1,2,3,4,5,6,7,8,9 1,2,3,4,5,7,8,9 I
6 1,2,3,4,5,6,8 4,6,7,9 4,6
7 2,3,4,5,6,7,8,9 1,5,7,9 5,7,9
8 1,2,3,5,8 1,2,3,4,5,6,7,8,9 1,2,3,5,8 I
9 1,2,4,5,6,7,8,9 1,2,3,4,5,7,9 1,2,4,5,7,9

Table 6. Second Iteration to FIND LEVELS

S. No Reachability Set Antecedent Set Intersection Set Levels

4 4,6 4,6,7 4,6 II
6 4,6 4,6,7 4,6 II
7 4,6,7 7 7
9 4,6,7 4,7 4,7

526
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 7. Third Iteration to FIND LEVELS

S. No Reachability Set Antecedent Set Intersection Set Levels

7 7 7 7 III

9 7 7 7 III

4.5 Model formulation described in the ISM methodology, the digraph is

From the final reachability matrix in Table 4,from the converted into the ISM model has been made as shown in
final reachability matrix, the structural model is generated Figure 2.
and is given in Fig. 2. Removing the transitivity‟s as
Levels
Customer
Return on Customer On time Customer
queries &
Investment Satisfaction Delivery Service (B1)
I Complaint
(B8) (B2) (B5)
(B3)

Information New
II Technology Technology
(B4) (B6)

III Recapturing Market

Values (B9) Shares (B7)

Figure 2. ISM BASED Model

4.6 Enabler Classification (MICMAC

Analysis)
Variables are classified in to four clusters (Mandal, A., &
Deshmukh, S.G.) named as autonomous variables,
dependent variables, linkage variables and independent
variables. The MICMAC principle is based on
multiplication properties of matrices. The purpose of
MICMAC analysis is to analyze the drive power and
dependence power of enablers.
The purpose of MICMAC analysis is to analyze the drive
power and dependence power of enablers.
1. Autonomous variables (first cluster) have weak
driving power and dependence. These variables can
be disconnected from the system. In our study, no
enablers lie in this range.
2. The second cluster is named dependent variables.
They have weak driving power and strong
dependence power. In our study, no enablers lie in
this range.
3. The third cluster named linkage variables having
strong driving power and strong dependence power.

527
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
In our study, sevenenabler‟s lies in this region named
as Customer service (CS) (B1), Customer
satisfaction(CSF) (B2), Customer queries and
Complaint (CQC) (B3), Information technology (IT)
(B4), On Time Delivery (OTD) (B5), Return on
B7
9
8 (iv)
B6
7
6
5
Driving Power
3 (I)
1
1 2 3 4
Dependence Power
Figure. 3. Cluster of Enablers
The graph between dependence power and driving power
for the enablers for selection of RLSP in Battery industry
is given in Figure 3.The aim of this study is to analyze the
driving power and the dependency power of
enablers(Jharkharia S., & Shankar, R). Without analyzing
the enablers one cannot initiate the implementing the
RLSPin battery industries. This analysis is making RLSP
adoption easy by adding these enablers.
5. CONCLUSION
The environmental consciousness of customers and the
increase of environmental image in the market day by day
have pushedSMEs indirectly to think about cleaner
production by means of RLSP
implementation.Nineenablers to implement RLSP in
Battery industry have been identified. Interpretive
Structural Modeling (ISM) methodology has been used
for finding contextual relationships among various
enablers to implement RLSP in Batter industry. A Model
528
ISBN: 978-81-924893-0-8
investment (ROI) (B8), Recapturing values (REV)
(B9).
4. The fourth cluster named independent variables has
strong driving power and weak dependence power. In
our study, twoenablers named new technologies
(NTE) (B6); Market shares (MS) (B7).
B9
B4 B1,B5
(iii)
B2,B3
B8
(ii)
9
5 6 7 8
has been developed from ISM technique with the help of
expert opinion.
Customer service (CS) (B1), Customer satisfaction( CSF)
(B2), Customer queries and Complaint (CQC) (B3),
Information technology (IT) (B4), On Time Delivery
(OTD) (B5), Return on investment (ROI) (B8),
Recapturing values (REV) (B9) have been identified as
linkage variables. Twoenablers named as new
technologies (NTE) (B6), Market shares (MS) (B7) has
been identified as the driver variables. No barrier has been
identified as autonomous variable and dependent variable.
Return on Investment (B8), Customer Satisfaction (B2),
Customer queries & Complaint (B3), On time Delivery
(B5), Customer Service (B1)have been identified as top
level enablers andRecapturing Values (B9) and Market
Shares (B7) are bottom level barrier. Information
Technology (B4) and New Technology (B6) are at 2 nd
level of the ISM model. The enablers Market shares (B7)
and Recapturing values (B9) are in the independent
cluster which has more driving power and less
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

dependence power. That‟s why these lies in this region.
The market shares enablers has driving power is 9 and
dependence power is 4. Therefore it is most important
enablers in the Reverse Logistics Service Provider. The
industry can implement Reverse Logistics Service by
implementing these selected enablers and add these
enablers into their company for successful RLS.
6. DISCUSSION AND FUTURE SCOPE
In this study, we have developed a model of enablers to
implement RLSP in Indian battery industry based upon
experts‟ opinions. The model may be tested in real world
situation to check that the enablers are complete and their
relationship exists as in the literature. The results of
model may vary in real world setting. The enablers may
be incomplete or their relationships may be different from
the derived model. ISM framework has been developed
with nine enablers for the implementation of RLS only in
the battery industries. More enablers have not been
considered and not categorized. Structural Equation
Modeling (SEM) may be used to test the validity of this
hypothetical model. We have developed ISM model for
the implementation of RLS in battery industry. The ISM
model for the implementation of RLS in some other types
of industry like manufacturing and auto industry may be
developed. Industry wise comparison may be made by
using some different methodologies like Analytical
Hierarchy Process (AHP) and Analytical Network Process
(ANP).
[8] Kent, J. L. and Flint, D. J., 1997, “Perspectives on the
evolution of logistics thought,” Journal of Business
Logistics, Vol. 18, No. 2, pp.15-29.
[9] Langley CJ, Allen GR, Tyndall GR. Third-party logistics
study 2003: results and findings of the eighth annual study,
2003. Lawshe, H., 1975, “A quantitative approach to
content validity,” Personnel Psychology, Vol. 28, No. 4,
pp. 563 575
[10] Mandal, A., & Deshmukh, S.G. (1994). Vendor selection
using interpretive structural modeling(ISM). International
Journal of Operations and Production Management, 14(6),
52-59. Doi: 10.1108/01443579410062086.
[11] Ravi, V., & Shankar R. (2005). Analysis of interactions
among the barriers of reverse logistics. International
Journal of Technological Forecasting & Social change,
72(8), 1011-1029.
[12] Stock, O.N., Oreis, N.P., Kasarda, J.D., 1998. Logistics
strategy and structure a conceptual framework.
International Journal of Operations and Production
Management 18 (1), 37–52.
[13] Warfield, J.W. (1974). Developing interconnected matrices
in Structural modeling. IEEE Transcript on Systems, Men
and Cybernetics, 4(1), 51-81.

REFERENCES
[1] Autry, C.W., Daugherty, P.J., Richey, R.G., 2000. The
challenge of reverse logistics in catalog retailing.
International Journal of Physical Distribution & Logistics
31 (1), 26–37
[2] CLM 2004
DefinitionofLogisticsCouncilofLogisticsManagementAvail
ableat: /www.cscmp.org/S.
[3] Dowlatshahi, S., 2000. Developing a theory of reverse
logistics. Interfaces 30 (3), 143–155.
[4] Drucker, P.F., 1962. The economy‟s dark continent.
Fortune, 103–104.
[5] Du, F., Evans, G.W., 2008. A bi-objective reverse logistics
network analysis for post-sale service. International Journal
of Computers and Operations Research 34, 1–18.
[6] Jayant, P. Gupta, S. K. Garg. Closed Loop Supply Chain
for Spent batteries: A Simulation Study. International
Journal of Advanced Manufacturing Systems 2012;
Volume 3, No.1, pp 89-99.
[7] Jharkharia S., & Shankar, R. (2005). IT enablement of
supply chains: understanding the enablers. Journal of
Enterprise Information Management, 18(1), 11-27.
http://dx.doi.org/10.1108/17410390610658432

529
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Sensitization behavior of GTAW austenitic stainless
steel joints
Subodh Kumar
SantLongowal Institute of
Engineering & Technology, (Deemed
University), Longowal, Sangrur
(Punjab), India-148106
skbamola@gmail.com
ABSTRACT
The present work has been carried out to study the
sensitization behavior of AISI 304L austenitic stainless steel
weld, fabricated using GTAW (gas tungsten arc welding
process). This weld was subjected to post weld thermal aging
(PWTA) treatments lying in the sensitization range, viz. 700
˚C for 30 minutes, 500 minutes and 1000 minutes for studying
the influence of carbide precipitation on their metallurgical
and corrosion properties. Microstructural studies of these
weldments showed that all welds were essentially austenitic
with the presence of a small amount of δ-ferrite. The
microstructure of the welds was dendritic and δ-ferrite phase
placed in interdendritic regions. The weld metal exhibits
largely vermicular morphology of δ-ferrite, and when it was
subjected to different PWTA treatments, carbide precipitation
occurred along the δ-γ interface, the extent of which increases
as the aging time increases. The heat affected zones (HAZ) of
the welds, besides undergoing excessive grain coarsening
during welding, played a significant role in contributing
towards overall sensitization of these joints. Microhardness of
the weldments (weld metal and HAZ) decreases as the aging
time increases due to the reason that the matrix becomes
depleted in solution strengtheners C and Cr, which contribute
towards carbide precipitation. Corrosion studies conducted
through measuring the degree of sensitization (DOS) of the
weldments. It was found that the overall DOS of the joints
increases as the post weld thermal aging time increases.
Keywords
AISI 304L SS; GTAW; sensitization; δ-ferrite; DOS.
1. INTRODUCTION
Stainless steels (SS) are widely used in a variety of
industries and environments due to their good mechanical and
corrosion properties [1]. Austenitic stainless steels (ASS) are
a group of steels that contain nominally 18-25 wt.%
chromium and 8-20 wt.% nickel. This group of stainless steels
exhibits an attractive combination of high strength, good
ductility, excellent corrosion resistance and a reasonable
weldability. These properties make austenitic stainless steels
as attractive candidate materials for use in a wide range of
industries such as nuclear industry, petrochemical, chemical
industry, biomedical, dairy industry, food industry etc. [1, 2].
Welding is one of the most widely used processes to
fabricate austenitic stainless steel structures [3, 4], whereas
intergranular corrosion due to sensitization is one of the most
530
ISBN: 978-81-924893-0-8
A. S. Shahi
SantLongowal Institute of
Engineering & Technology, (Deemed
University), Longowal, Sangrur
(Punjab), India-148106
ashahisliet@yahoo.co.in
common problem encountered in austenitic stainless steel
weldments during welding as well as in the service conditions.
This is a well-known phenomenon called sensitization that
occurs during welding, when these steels are subjected to a
temperature range of 550˚C to 850˚C, chromium reacts with
carbon and form chromium carbides and precipitate along the
grain boundaries thus giving rise to adjacent regions that are
depleted in chromium [5-7]. This sensitization phenomenon
that occurs during welding becomes a cause of concern when
these joints are further subjected to a temperature range less
than 500˚C, as usually encountered in nuclear applications,
where it is observed that the pre-existing carbides nuclei, that
nucleate during welding, tend to grow during long exposure
times [8, 9], which consequently affects their corrosion
properties and hence service performance.
Since, sensitization being a problem associated with
welding as well as post weld service conditions in the welded
joints of austenitic stainless steels, the aim of present
investigation was to study the sensitization behavior of the gas
tungsten arc welded 304L austenitic stainless steel joints.
.
2. MATERIALS AND EXPERIMENTAL
DETAILS
The base material used in the present study was in the
form of AISI 304L austenitic stainless steel plates with
dimensions of 200 mm x 100 mm x 6 mm, which are cut from
a rolled sheet. The ER 308L austenitic stainless steel solid
electrodes of 1.6 mm and 2.4 mm diameters were selected as
the filler metal to fill the single V-groove butt-joint by GTAW
process. The chemical compositions of the base and filler
metals are presented in the Table 1.
Before welding, the plates were cleaned mechanically
and chemically in order to remove any source of
contaminations like rust, dust, oil, etc. One root pass and two
main weld passes were carried out to fill the single V-groove
with the experimental conditions mentioned in Table 2. The
interpass temperature of around 150˚C was maintained for
second and third passes. No preheat and post heat treatment
was carried out on the welded samples. Welded joints were
visually inspected (during and after the welding) for their
quality and it was ensured that all weld beads possessed good
geometrical consistency and were free from visible defects
like surfaceporosity, blow holes etc. Industrial argon gas with
10 l/min was used for shielding the weld pool during welding.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1: Chemical composition of the base and filler material (wt.%)

Alloy element C Si Mn P S Cr Mo Ni Ti V Fe
Base
0.025 0.446 1.386 0.028 0.014 18.238 0.296 9.196 0.006 0.061 Balance
(304L SS)
Filler
0.028 0.421 1.420 0.021 0.012 19.151 0.256 10.02 0.003 0.032 Balance
(ER 308L SS)

Table 2: Experimental welding conditions used in the present work

Heat calomelelectrode (SCE), a graphite counter electrode, and a
input per working electrode. The entire testing including determination
Average unit of the polarization curves was carried out with the
Welding Welding welding potentiostat(Make: Gamry Instruments, Model: Reference
speed length per 600) which was controlled by the dedicated software. The
Type of current voltage (mm/s) weld pass
passes (A) (V) entire DLEPR testing of the welded joints was carried out at
(kJ/mm) room temperature and the electrochemical potential was
varied from the open circuit potential to 300 mV (SCE) with a
Root pass 90 10 1.48 0.43 scan rate of 100 mV/min and then back to the open circuit
potential at the same scan rate of 100 mV/min. The ratio of
Middle
140 14 1.32 1.04 the reactivation current to the activation current multiplied by
pass
100 was taken as a measure of the degree of sensitization
Cover (DOS). The reported values are an average of three tests for
140 14 1.27 1.08 each sample.
pass

In order to study the sensitization (carbide

precipitation) behavior of these joints, three different post
weld thermal aging treatments (CS) viz. 700˚C for 30
minutes, 700˚C for 500 minutes and 700˚C for 1000 minutes
were used in the present work.
The cross-section of the test specimens were
mounted and mechanically ground to 3000 mesh on SiC
papers and finally polished on the cloth using a suspension of
alumina powder. Electrolytic etching was used for revealing
the microstructures of different zones of the weldments. 10
gms. of oxalic acid and 100 ml. of distilled water was used as
the electrolyte using the etching conditions of 6V and 1 min.
as cell voltage and etching time respectively. The
microstructure of the different zones of the weldments like
weld metal (WM), heat affected zone (HAZ) and fusion zone
(FZ) was investigated by optical microscopy. A
microhardness tester equipped with Vickers pyramid indenter
was used for microhardness measurements along the
longitudinal centerline of the welds. A 500 g load was applied
on the indenter for 20s. A ferritescope (M30-Fischer) was
used in the non-destructive evaluation to observe the ferrite
content on the weldments in different regions.
The double loop electrochemical potentiokinetic
reactivation test (DLEPR) was used to assess the sensitization
behavior of the welded joint in accordance with the test
conditions used in the previously reported studies [10-12]. As
shown schematically in Fig. 1, the testing samples were cut
out from the welded plate in such a way that the cross-
sectional area of each specimen (which was taken as 15 x
6mm2=90 mm2) that was exposed directly to the test solution
inDLEPR test. Before electrochemical test, all samples
weremounted in the epoxy resin and then prepared
metallographically by using emery paper up to 1000 grit. A
solution of 0.5 M H2SO4 + 0.01 M KSCN was used for
conducting DLEPR test.A standard cell was used to conduct
the DLEPR tests with a reference electrode of saturated
Fig. 1: Schematic illustration showing the cross-section of
a welded joint and various zones formed in this
joint.(Rectangular box at the centre shows the composite
zone selected from the joint for DLEPR test).
3. RESULTS AND DISCUSSION
Ferrite studies were carried out to check the
susceptibility of the weld metal to hot-fissuring tendency and
it was found thatthe weld metal contains 5.1 to 5.8 % of the
ferrite, which shows that this weld was not prone to hot
cracking tendency. Few micrographs of the weld metal in the
as welded and different post weld thermal aging conditions
are shown in Fig. 2. The microstructure of the weld metal is
dendritic, in which δ-ferrite phase placed in the interdendritic
regions. The microstructure of weld metal possesses
vermicular ferrite morphology. Fig. 2 shows that the carbide
precipitation takesplace along the δ-γ interface [13] and this
precipitation increases as the post weld thermal aging time
increases. Fig. 3 shows the HAZ microstructures in the as
welded and different post weld thermal aging conditions.
From this Fig. 3, it is observed that HAZ experiences grain
coarsening during welding, which may be attributed to the
cooling rate experienced by the weld. This grain coarsening
further affects the carbide precipitation behavior of the HAZ
of the welded joint. From Fig. 3, it can be seen that as the post
weld thermal aging time increases the carbide precipitation in
the HAZ also increases.

531
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

which may be attributed to the microstructural variations that

a occur in these zones during welding. It can also seen that
Vermicular ferrite average microhardness of the weld zones and the HAZs (for
all the post weld thermally aged joints) show a decreasing
trend due to the reason that the matrix becomes depleted in
solution strengtheners C and Cr, which contribute towards
intergranular carbide precipitation [14], and this precipitation
increases with increased exposure times. Further, the extent of
microhardness variation between the as welded condition and
the post weld thermally aging at 700 ˚C for 1000 minuteswas
such that average microhardness of the weld zone and
HAZfor the joint, decreased from 221.52 to 201.23 VHN in
the weld zone and 211.18 to 185.67 VHN in the HAZ, which
may be attributed to higher carbide precipitation.
b
Table 3: Vickermicrohardness (HV0.5) of the WM, HAZ
Vermicular ferrite
and base metal under different conditions

Vickermicrohardness (HV0.5)
S. As- Post weld thermal aging treatment
No. welded at 700˚C
condition 30 500 1000
minutes minutes minutes
1. WM 221.52 219.13 210.74 201.23
2. HAZ 211.18 209.54 195.25 185.67
3. Base 225.33 223.12 208.41 198.74
Fig. 2: Microstructure of the weld metal (at 100X) (a) as-
welded and (b) PWTA (700˚C/1000 minutes) conditions.

HAZ
FB WM

Fig 3: DLEPR curves of the welded joint under various

b conditions.

FB
HAZ WM

GBC

Fig. 3: Microstructure of the HAZ (at 100X) (a) as-welded

and (b) PWTA (700˚C/1000 minutes) conditions.
Different zones of the weldments (as welded and
post weld thermally aged) were evaluated for their
microhardness and the results (which have average of five
microhardness values for various zones of the each joint) are
shown in the Table 3. It has been observed that among all the Fig 4: DLEPR curves of the base metal under various
conditions, the weld zones possess relatively higher average conditions.
microhardness value as compared to the respective HAZs,

532
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Table 4: DLEPR results (DOS values of base metal and
welded joints under different conditions)
Degree of sensitization (DOS=(Ir/Ia)*100)
S.
As- Post weld thermal aging
No. welded treatment at 700˚C
condition 30 500 1000
minutes minutes minutes
1. Welded joint 0.31 2.23 12.21 22.61
2. Base 0.078 0.53 7.78 16.11
DLEPR technique was used for evaluating DOS of
the welded joints andbase metal under different post weld
thermal aging conditions, and the DLEPR curves are shown in
the Fig. 3 &4 respectively. Table 4 shows the DLEPR results
andfrom this table it can be seen that in the as welded
condition, the welded joint possesses 0.31, DOS value and
when this joint was subjected to post weld thermal aging
treatments, the DOS value shows an increasing trend of
varying degree.Maximum DOS (22.61) was observed for the
weldedjoint subjected to 700˚C for 1000 minutes. This
significant DOS variation is attributable to the mechanism
involved for carbideprecipitation in the weld metal andHAZ
of these welded joints, where, as the post weld thermal aging
time increases the carbide precipitation (which occurs along
δ-γ interfaces in the weld metal and along the grain
boundaries in the HAZ) is also increases [15-16].
4. CONCLUSIONS
1. The weld metal matrix was austeniticwith the presence of a
small amount of δ-ferrite and the morphology of the δ-ferrite
was vermicular. When this weld metal was subjected to
different PWTA treatments, carbide precipitation occurred
along the δ-γ interface and the extent of this precipitation
increases as the aging time increases.
2. HAZ of the welded joint experiences grain-coarsening
during welding. When the welded joint subjected to various
PWTA treatments, carbide precipitation occurred along the
grain boundaries of the HAZ and the amount of this carbide
precipitation increases as the aging time increases.
3. Microhardness evaluation of the welded joint showed that
after PWTA treatments, the microhardness value of the base
metal, weld metal and HAZ show a decreasing trend, which
may be due to that the intense carbide precipitation removes
chromium and carbon from solid solution.
4. DLEPR curves of the welded joint showed that as the post
weld thermal aging time increases, the DOS value of the
welded joint also increases.
5. REFERENCES
[1] Khatak, H. S. and Raj, B., 2002. Corrosion of Austenitic
Stainless Steels. Narosa Publishing House, India.
[2] Sedrics, A. J., 1996. Corrosion of Stainless Steels.
second ed., John Wiley & Sons, New York.
[3] Liu, W., Wang, R.J., Han, J.L., Xu, X.Y., Li, Q., 2010.
Microstructure and mechanical performance of resistance
spot welded cold-rolled high strength austenitic stainless
steel. Journal of Materials Processing Technology, 210,
1956-1961.
[4] Zumelzu, E., Sepulveda, J., Ibarra, M., 1999. Influence
of microstructure on the mechanical behavior of
533
ISBN: 978-81-924893-0-8
welded316L SS joints. Journal of Materials Processing
and Technology, 94, 36-40.
[5] Ozyurek, D., 2008. An effect of weld current and weld
atmosphere on the resistance spot weldability of 304L
austenitic stainless steel. Materials and Design, 29, 597-
603.
[6] Bruemmer, S.M. andCharlot, L.A., 1986. Development
of grain boundary chromium depletion in type 304 and
316 stainless steels. ScriptaMetallurgica, 20, 1019-1024.
[7] Parvathavarthini, N., Dayal, R. K., Gnanamoorthy, J. B.,
1994. Influence of prior deformation on the sensitization
of AISI Type 316LN stainless steel. Journal of Nuclear
Materials, 208, 251-258.
[8] Povich, M.J., 1978. Low temperature sensitization of
type 304 stainless steel. Corrosion, 34, 60-65.
[9] Kain, V., Chandra, K., Adhe, K.N., De, P.K., 2004.
Effect of cold work on low-temperature sensitization
behaviourof austenitic stainless steels. Journal of Nuclear
Materials, 334, 115-132.
[10] Lopez, N., Cid, M., Puiggali, M., Azkarate, I., Pelayo,
A., 1997. Application of double loop electrochemical
potentiodynamic reactivation test to austenitic and
duplex stainless steels. Materials Science and
Engineering A, 229, 123-128.
[11] Cihal, V. andStefec, R., 2001. On the development of the
electrochemical potentiokinetic method.
ElectrochimicaActa, 46, 3867–3877.
[12] Gracia, C., Tiedra de, M.P., Blanco, Y., Martin, O.,
Martin, F., 2008. Intergranular corrosion of welded joints
of austenitic stainless steels studied by using an
electrochemical minicell. Corrosion Science, 50, 2390-
2397.
[13] Dadfar, M., Fathi, M.H., Karimzadeh, F., Dadfar, M.R.,
Saatchi, A., 2007. Effect of TIG welding on corrosion
behaviour of 316L stainless steel. Materials Letters, 61,
2343-2346.
[14] Yae Kina, A., Souza, V.M., Tavares, S.S.M., Pardal,
J.M., Souza, J.A., 2008. Microstructure and intergranular
corrosion resistance evaluation of AISI 304 steel for high
temperature service. Materials Characterization, 59, 651-
655.
[15] Cui, Y. andLunding, C.D., 2005. Evaluation of initial
corrosion location in E316 austenitic stainless steel weld
metals. Materials letters, 59, 1542-1546.
[16] Cui, Y. andLunding, C.D., 2007. Austenite-preferential
corrosion attack in 316 austenitic stainless steel weld
metals. Materials and Design, 28, 324-32
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Grinding Fluid Applications using Simulated
Coolant Nozzles and their Effect on Surface
Properties in a Grinding Process
Mandeep Singh Jaskarn Singh
GZS PTU CAMPUS UCOE, Punjabi University
Bathinda Patiala
smaghmandeep@gmail.com
ABSTRACT
Grinding is one of the most widely adopted processes for
finishing flat surfaces. Because of high heat generation
by the process, effective cooling is of great concern to
minimize the detrimental effects to the workpiece and
reduce wheel wear. For this, an effective cooling method
is needed selecting the suitable nozzle that can send
coolant at high velocity to the cutting zone. This ensures
effective cooling that reduces the chances of workpiece
damage, save the valuable resources and obtains the
enhanced surface and dimensional quality, which will be
helpful for precision manufacturing. The Purpose of the
present study is to review the effect of various process
parameters on the properties and surface quality in
grinding process.
Keywords- grinding, Cooling, workpiece, nozzle,
cutting zone, precision manufacturing.
1. INTRODUCTION
Due to a different material removal mechanism of
rubbing, ploughing and ‗size effects‘ during grinding,
specific energy consumption and temperature generation
is much higher than other conventional metal cutting
processes. Higher temperature generation in grinding
adversely affects the surface properties, burns the
surfaces, induces residual stresses, and causes distortion
which leads to surface and sub-surface micro cracks.
This may also lead to difficulties in controlling the
dimensions. Therefore, in majority of the cases,
application of grinding fluid becomes necessary.
Moreover, coolant can wash away the chips, provides
lubrication and can improve overall grinding
performance. But for effective cooling not only correct
grinding fluid but also selection of proper nozzle, its
orientation and nozzle tip distance from grinding zone
are the other important factors. A thin surrounding air
layer generated due to the high rotation of wheel
prevents the grinding fluid to reach the grinding zone.
This layer is often tried to break using a scraper board
but not found very effective method as there always
exists a small gap between the uneven wheel surface and
the scraper board. This gap trims down the effectiveness
of the scraper board.
Several works have been reported to calculate
temperature generation [1, 2], variation of heat transfer
coefficient [3, 4], effect of temperatures [5], and need for
use of coolant [6, 7] in grinding processes. Effects of
boundary layer have been investigated in detail by
534
ISBN: 978-81-924893-0-8
Yadwinder Pal Sharma
GZS PTU CAMPUS
Bathinda
er.yad2007@gmail.com
several researchers [8, 9]. Webster et al. [10, 11]
presented new nozzle designs that give long coherent
jets, thus maximizing the application of fluid into the
grinding zone. The influence of nozzle position, jet
velocity, and distance from the grinding zone was
studied. Methods were described for modeling and
optimization of grinding processes [12, 13]. The grind
hardening process was analyzed that utilizes the heat
dissipation in the grinding area for inducing
metallurgical transformation on the surface of the ground
workpiece [14]. An improved thermal model was
developed which would accurately predict the position of
the burn boundary [15].
2. GRINDING PROCESS AND
GRINDING FLUID
APPLICATIONS
Tawakoli [16] et al. reviewed dry grinding process as it
is one of the most favorable processes from an
economical as well as an ecological point of view. The
research was done to reduce heat generation by special
conditioning using a single-point diamond dressing tool
based on the new innovative concept. Oliveira [17] et al.
analyzed relevant industrial demands for grinding
research. The research starts with an analysis on the main
trends in more efficient engines and the changes in their
components that affects the grinding performance. Case
studies were used to show how research centers and
industries are collaborating. Kiyak [18] et al., examined
and compared dry and cutting fluid application (wet) in
grinding as the process is practiced to obtain the best
possible surface quality and dimensionally accurate of
ground machine parts. Their study also examined
material removal rates for dry and wet grinding
processes. Cakir [19] et al., analyzed that effect of
friction generated heat affects shorter tool life, higher
surface roughness and lowers the dimensional
sensitiveness of work material. The effects of work-piece
material, cutting tool and machining process type were
determined in detail. Jin [20] et al., investigated the
variation of the convection heat transfer coefficient
(CHTC) of the process fluids within the grinding zone by
using hydrodynamic and thermal modeling. They
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
determined the fluid film thickness by grinding wheel
speed, porosity, grain size, fluid type, and flow rate and
nozzle size. The CHTC values were compared for a wide
range of grinding regimes, including high efficiency deep
grinding (HEDG), creep feed and finish grinding. Alves
[21] et al., investigated a alternative to recycle cutting
fluids by varying the plunge velocity in the plunge
cylindrical grinding of ABNT D6 steel, rationalizing the
application of two cutting fluids and using a
superabrasive CBN (cubic boron nitride) grinding wheel
with vitrified binder to evaluate the output parameters of
tangential cutting force, acoustic emission, roughness,
roundness, tool wear, residual stress and surface
integrity, using scanning electron microscopy (SEM) to
examine the test specimens. Gviniashvili [22] et al.,
developed a model for flow rate between a rotating
grinding wheel and a work-piece. They found that the
useful flow that passes through the contact zone is a
function of the spindle power for fluid acceleration,
wheel speed and delivery-nozzle jet velocity. Irani [23]
et al., reviewed some of the common as well as some of
the more obscure cutting fluid systems that have been
employed in recent years with an emphasis on creep-feed
applications. These cutting fluids remove or limit the
amount of energy transferred to the work-piece through
debris flushing, lubrication and the cooling effects of the
liquid. Hryniewicz [24] et al., proposed models of fluid
flow in grinding with nonporous wheels. A smooth
wheel was employed instead of a rough grinding wheel
to simplify the analysis. Fluid flow was investigated for
laminar and turbulent regimes using the classical
Reynolds equation of lubrication and a modified
Reynolds equation for turbulent flows, respectively. It
was found that the classical Reynolds equation reliably
predicts the hydrodynamic pressure if the Reynolds
number Re (based on the minimum gap size) is lower
than about 300. Experimental results for 300, Re, 1500
agree with the proposed turbulent flow model. That
suggests that the flow in this range of Re was turbulent,
and that the fluid inertia is negligible.
3. EXPERIMENTAL ANALYSIS
Ebbrell [25] et al., studied the effects of the boundary
layer on grinding and tried to overcome the boundary
layer of air is entrained around a rotating grinding wheel.
Their investigation aims to show through experiment and
modeling, the effects of the boundary layer on cutting
fluid application and how it can be used to aid delivery
by increasing flow rate beneath the wheel. Results from
three experiments with different quantities of cutting
fluid passing through the grinding zone were presented.
Morgan [26] et al., addresses the quality of fluid
required for grinding and the method of application
using computational fluid dynamics approach. Results
from this research suggested that supply flowrate needs
to be 4 times the achievable ‗useful‘ flowrate. Improved
system design allowed ‗actual‘ useful flowrate to
approach ‗achievable‘ useful flowrate. Achievable flow
rate depends on wheel porosity and wheel speed whereas
535
ISBN: 978-81-924893-0-8
actual useful flowrate depends on nozzle position,
design, flowrate and velocity. Li [27] et al., presented a
theoretical model for flow of grinding fluid through the
grinding zone as the boundary layer of air around the
grinding wheel restricts most of the grinding fluid away
from the grinding zone. Hence, conventional method of
delivering grinding fluid that flood delivery they found
was not believed to fully penetrate this boundary layer.
The flood grinding typically delivers large volumes of
grinding fluid was ineffective, especially under high
speed grinding conditions. Kopac [28] et al., deals with
the contemporary aspects of grinding with regards to
enhanced productivity and precision demands. High-
performance grinding is essential to achieve high
dimensional accuracy and surface integrity of ground
components at optimum cost efficiency. Cameron [29]
et al., found that when grinding, wheel loading can clog
the pores of the grinding wheel and accelerate thermal
damage to the work-piece. To help reduce wheel
loading, separate cleaning-jet systems can be applied to
the grinding process using a high-speed coolant stream
directed towards the wheel surface. They examined the
influence of speed, flowrate and orientation of the
cleaning jet. For the experimental conditions used in
their work, the results show that cleaning-jet orientation
does not appear to have a significant effect on the
grinding process; however, a threshold for the speed and
flowrate of the cleaning jet was observed. Monici [30] et
al., analysed that the type and amount of cutting fluid
used directly affect some of the main output variables of
the grinding process which were analyzed by them, such
as tangential cutting force, specific grinding energy,
acoustic emission, diametrical wear, roughness, residual
stress and scanning electron microscopy. To analyze the
influence of these variables, an optimized fluid
application methodology was developed by them to
reduce the amount of fluid used in the grinding process
and improve its performance in comparison with the
conventional fluid application method. The results
revealed that, in every situation, the optimized
application of cutting fluid significantly improved the
efficiency of the process, particularly the combined use
of neat oil and CBN grinding wheel.
4. SIMULATION WITH DIFFERENT
NOZZLES AND GRINDING
WHEEL
Brinksmeier [31] et al. described different methods for
modeling and optimization of grinding processes. First
the process and product quality characterizing quantities
were measured. Afterwards different model types, e.g.
physical–empirical basic grinding models as well as
empirical process models based on neural networks,
fuzzy set theory and standard multiple regression
methods, were discussed for an off-line process
conceptualization and optimization using a genetic
algorithm. The methods presented were integrated into
an existing grinding information system, which was part
of a three control loop system for quality assurance.
Sakakuraa [32] et al. analyzed the feature of grinding
process which is performed by using a large number of
abrasive grains with irregular shapes, and random
distribution enables accurate and high quality machining,
it complicates analysis of the grinding process. Several
computer simulations using the Monte Carlo Method
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

were carried out. Simulation program based on the

elastic behaviour model of a grain was developed by
taking the background into account, which was
previously investigated by the authors. The program
focuses on the generation process of a work-piece
surface, and simulates the interaction of grains with a
work-piece, which includes the elastic and plastic
deformation and the removal of work-piece material.
Brinksmeier [33] et al., gives an overview of the
current state of the art in modeling and simulation of
grinding processes. Physical process models (analytical
and numerical models) and empirical process models
(regression analysis, artificial neural net models) as well
as heuristic process models (rule based models) were Figure 1: Pressure distribution around scraper
taken into account, and outlined with respect to their board placed at centre level of wheel [39]
achievements. The models were characterized by the
process parameters such as grinding force, grinding An effective cooling method in finding optimum nozzle
temperature, etc. as well as work results including orientation and pressure of cutting fluids can reduce the
surface topography and surface integrity. Nguyen [34] et chances of work-piece damage, save the valuable
al., conducted the research in two parts describing the resources and obtain the enhanced surface quality. Also
kinematic simulation of the grinding process. The first found the peak pressure, pressure drop region and the
part of their research was concerned with the generation swirl direction, nozzle location can be found out so that
of the grinding wheel surface. A numerical procedure for the flow coming out of the nozzle can be send to the
effectively generating the grinding wheel topography exact cutting region.
was suggested. The procedure was based on the
transformation of a random field. Nguyen [35] et al.,
describes the kinematic simulation of the grinding
process and constitutes the second part of the two-part
series. The complex wheel–work-piece interaction was
taken into consideration in the generation of the work-
piece surface. An algorithm was proposed to identify the
active abrasive grains and their attack angles from the
wheel topography. Based on the critical values of the
attack angle, the abrasive grain was determined either to
cut, plough or rub the work-piece. Sinot [36] et al.,
identified the parameters which are influential in
maintaining a clean wheel as grinding of certain
materials such as ductile material which are hard to grind
implies particular conditions of work. They proposed a
cleaning criterion to estimate the efficiency of the
cleaning process. Using an experimental setup, the
significant of the influence of the nozzle position, the
Figure 2: Velocity vector when scraper is at
flow rate and pressure, the boundary layer of air around
the rotating wheel and the particle rate contained in the
centre level [39]
fluid were assessed. Mandeep [37] et al., using
computational fluid simulation found that the rotating air Anirban [39] et al., used computational fluid simulation
layer with the grinding wheel prevents the cutting fluid (using ANSYS CFX module) approach to study six
to reach to the cutting zone but when the fluid jet different nozzle shapes and cross section to study the
velocity becomes equal or higher than the grinding grinding fluid flow behaviour through them. On the basis
wheel surface speed, the air layer can be successfully of the simulation study, two best shapes of nozzles
broken and the cutting fluid can reach cutting zone namely spline followed by convergent-divergent were
enabling an effective cooling. Mandeep [38] et al., identified for obtaining the peak velocity of the fluid.
adapted a computational fluid simulation (using ANSYS The results were experimentally validated using all the
CFX) approach to find the flow behaviour of air around six nozzles used in the simulation study. The results
the rotating grinding wheel when a scraper board is showed different level settings for the three factors for
placed as surface grinding. But because of high heat optimising the three response parameters. Multi-
generation by the process, effective cooling is of great response signal-to-noise (MRSN) was used to optimise
concern to minimize the detrimental effects to the work- the three responses together. Spline shaped nozzle gave
piece. the best results for the three responses followed by
convergent divergent which also validated the simulation
study results.

536
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 3: Six different kinds of nozzles used for
simulation and experimentation
(dimensions not to scale) [40]
The workpiece speed and nozzle tip distance were key
factors that affect the surface roughness, dimensional
stability and the microhardness of the machined parts.
Further, wheel speed and nozzle inclination angle do not
affect any of the responses.Mandeep [40] et al.,
analysed that due to high heat generation by the
cylindrical grinding process, effective cooling is of great
concern to minimize the detrimental effects caused to the
workpiece. Hence, an effective cooling through the use
of proper nozzle can reduce the chances of workpiece
damage, and to enhance surface quality. In this paper,
the air flow behaviour around the rotating wheel and
workpiece was simulated with computational fluid
approach in ANSYS CFX using different wheel and
workpiece rotational speeds to calculate the maximum
air velocity of the rotating air layer.
537
ISBN: 978-81-924893-0-8
Figure 4: Velocity contour around the grinding
wheel and work piece in a cylindrical grinding
process with (wheel revolution: 1,921 rpm,
workpiece 245 rpm) [41]
The simulated results of flow behaviour through six
different kinds of nozzles were experimentally validated
to study the effect of these different types of nozzles as
well as other process parameters on response parameter
namely surface roughness of ground workpiece. Using
Taguchi design of experimentation technique,
experiments were planned and process capability was
statistically analyzed. The optimum solution was found
coherent with the simulated results.
5. OPTIMIZATION OF NOZZLE
ORIENTATION AND NOZZLE TIP
DISTANCE
Baines-Jones [41] et al., reveals that a principal
function of fluid is to improve lubrication and
subsequently reduce the risk of thermal damage and
improve process performance. Grinding fluid is
delivered at a particular flow rate and pressure. Correct
nozzle design and positioning are critical elements of the
delivery system and their research presents the initial
work on nozzle design. Initial work in this area had
identified flow coherency as a measure that will allow
for improved nozzle design. Their findings on the
importance of other delivery system factors including:
nozzle position, nozzle angle, nozzle type and jet
velocity were presented. Morgan [42] et al., proposed
that it is important to the efficiency of the process and to
the performance of the operation that the fluid is
delivered in a manner that ensures the desired jet
velocity has adequate coverage of the contact zone. The
nozzle geometry influences the fluid velocity and flow
pattern on exit from the nozzle orifice.
Recommendations were given to guide a user to optimal
design of nozzles to ensure adequate fluid supply to the
contact zone. Webster [43]., configured a nozzle
assembly and method to apply coherent jets of coolant in
a tangential direction to the grinding wheel in a grinding
process, at a desired temperature, pressure and flowrate,
to minimize thermal damage in the part being ground.
Pilkington [44] et al., disclosed a method of
determining a position of a coolant nozzle relative to a
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
rotating grinding wheel removing material from a work-
piece and an apparatus for practicing the method. The
method includes the step of disposing a coolant nozzle
having a base and a distal end for adjustable movement
relative to the grinding wheel and the work-piece.
6. EFFECT OF GRINDING ON
DIMENSIONAL CONTROL,
SURFACE ROUGHNESS AND
HARDNESS
Brinksmeier [45] et al., reported that during machining
the work-piece surface layer is plastically deformed and
acts as a source of residual stress for the entire cross
section of the work-piece and as a consequence shape
deviations occur. A new method to predict the shape
deviation of machined work-pieces with complex
geometry was proposed. It combines experimental
results of machining work-pieces with simple geometries
with finite element simulations. This was achieved by
making use of the known source stresses in simple parts
for which the approach was validated. Salonitis [46] et
al., analyzed the grind hardening process that utilizes the
heat dissipation in the grinding area for inducing
metallurgical transformation on the surface of the
ground work-piece. In the case of grind-hardening of
thin work-pieces or cylindrical work-pieces of small
diameter, the quenching has to be assisted with the
application of coolant fluid. So they investigated the
utilization of the coolant fluid for the grind hardening of
small diameter cylindrical parts. The rapid heating of the
work-piece and the short austenitising time were taken
into consideration both for the estimation of the hardness
profile and the hardness penetration depth (HPD). A
finite element analysis (FEA) model was developed for
this specific case and its predictions were verified
experimentally. Rowe [47] et al., developed an
improved thermal model which would accurately predict
the position of the burn boundary. The main advance,
compared to previous methods of thermal modeling, was
the partitioning of the heat flux between the grinding
wheel and the work-piece. This allows more realistic
values of heat flux to he employed in the model.
Expressions for upper and lower bound solutions have
been developed which predict the critical specific energy
for the onset of burn. Chryssolouris [48] et al., reported
that in grind hardening, the heat dissipated in the cutting
area during grinding is used for the heat treatment of the
work-piece. The hardness penetration depth has been
calculated, for a given set of process parameters, and
compared with experimental data from a cylindrical dry
grind hardening process. Their model shows that the
flow rate through the contact zone between the wheel
and the work surface depends on wheel porosity and
wheel speed as well as depends on nozzle position,
design, and fluid jet velocity. Furthermore, the model
was tested by a surface grinding machine in order to
correlate between experiment and theory. Shaw [49] et
al., reviewed the nature of two well known forms of
metallurgical damage of ground surfaces that involve
untempered and overtempered martensite
transformations and the special characteristics that
pertain in grinding where the time at temperature before
quenching is unusually short. Both of these forms of
538
ISBN: 978-81-924893-0-8
metallurgical damage involve martensitic
transformations.
7. CONCLUSION
A lot of work has been done on process of grinding and
grinding fluid applications. Temperature rise in grinding
is an important consideration, because it can adversely
affect the surface properties and cause residual stresses
on the work-piece. Furthermore, temperature gradients in
the work-piece cause the distortions by differential
thermal expansion and contraction which causes surface
and sub-surface micro cracks and also makes it difficult
to control dimensional accuracy. If the temperature is
very high, the surface may burn, producing a bluish color
on steels, which indicates oxidation. A burn may not be
objectionable in itself. However, the surface layers may
undergo metallurgical transformations, with martensite
formation in high carbon steels from re-austenization
followed by rapid cooling. The effect is known as
metallurgical burn, which also is a serious problem with
nickel-base alloys. High temperatures in grinding may
also lead to the thermal cracking of the surface of the
work-piece, known as heat cracks. Cracks are usually
perpendicular to the grinding operation; however, under
severe grinding conditions, parallel cracks may also
develop. Temperature change and gradients within the
work-piece are mainly responsible for residual stress in
grinding. A principal function of fluid is to improve
lubrication and subsequently reduce the risk of thermal
damage and improve process performance. The use of
proper grinding fluids can effectively control these
adverse effects. Not only the proper selection of a
grinding fluid is important, but also the proper selection
of nozzle and method of application of fluid is of great
concern.
Because of high rotational speed of grinding wheel, an
air layer surrounding the rotating grinding wheel makes
a thin film which restricts prevents the cutting fluid to
approach towards the cutting region. This layer is often
broken using a scraper board, but the position of scraper
board is of great importance. Furthermore, different
cross sections of the nozzle decides the peak fluid
velocity that is achieved after the exit from the nozzle
and the distance from the exit where peak velocity is
achieved decides the proper location of the nozzle for
effective cooling.
REFERENCES
[1] Guo, C. and Malkin, S. 2000 ‗Energy Partition and
Cooling During Grinding‘. J. Manuf. Processes, 2,
pp. 151-157.
[2] Malkin, S. and Guo, C. 2007 ‗Thermal analysis of
grinding‘ CIRP Annals – Manuf. Technol, 56, pp.
760-782.
[3] Jin, T. and Stephenson, D.J. 2008 ‗A study of the
convection heat transfer coefficients of grinding
fluids‘, CIRP Annals – Manuf. Technol, 57, pp.
367-370.
[4] Jin, T., Stephenson, D.J. and Rowe, W.B.,
‗Estimation of the convection heat transfer
coefficient of coolant within the grinding zone‘,
Proc IMechE, Part B: J. Engineering
Manufacture, 217(3), pp. 397-407.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[5] Cakir, O., Yardimeden, A., Ozben, T. and Kilickap,
E. 2003 ‗Selection of cutting fluids in machining
processes‘, J. Achiev. Mater. Manuf. Engg, 25(2),
pp. 99-102, 2007.
[6] Kiyak, M. and Cakir, O. 2010 ‗Study of surface
quality in dry and wet external cylindrical
grinding‘, Int. J. Compu Mater Sci Surf Engg, 3,
pp. 12-23.
[7] Choi, H. Z., Lee, S.W. and Kim, D.J. 2001
‗Optimization of cooling effect in the grinding
with mist type coolant‘, American Society for
Precision Engineering Proceedings, Crystal City,
Virginia.
[8] Li, C.H., Liu, G.Y., Hou, Y.L., Ding, Y.C. and Lu,
B.H. 2009 ‗Modeling and experimental
investigation of useful flow-rate in flood delivery
grinding‘, Proc. Chinese Control and Decision
Conference, pp. 5467-5471,.
[9] Davies, T.P. and Jackson, R.G. 1981 ‗Air flow
around grinding wheels‘, J. Precision Engg, 3, pp.
225-228.
[10] Webster, J.A., Cui, C., Mindek Jr. R.B. and
Lindsay, R. 1995 ‗Grinding fluid application
system design‘, CIRP Annals – Manuf. Technol,
44, pp. 333-338 .
[11] Webster, J. A. and Storrs, C.T. 2006 ‗Coherent jet
nozzles for grinding applications‘, US Patent
Application Publication, Publication number:
US2006/7086930 B2. Saint-Gobain Abrasives, Inc.
[12] Brinksmeier, E., Tonshoff, H.K. Czenkusch, C.
and Heinzel, C. 1998 ‗Modelling and optimization
ofgrinding processes‘, J. Intelli. Manuf.
[13] Brinksmeier, E., Aurich, J.C., Govekar, E.,
Heinzel, C., Hoffmeister, H.W., Klocke, F.,
Peters, J.,Rentsch, R., Stephenson, D.J., Uhlmann,
E., Weinert, K. and Wittmann, M. 2006 ‗Advances
inmodeling and simulation of grinding processes‘,
CIRP Annals – Manuf. Technol, 55, pp. 667- 696.
[14] Salonitis K. and Chryssolouris G. 2007 ‗Cooling
in grind-hardening operations‘, Int. J. Adv. Manuf.
Technol, 33, pp. 285–297.
[15] Rowe, W.B., Pettit, J.A., Boyle, A. and Moruzzi,
J.L. 1998 ‗Avoidance of thermal damage in
grinding and prediction of the damage threshold‘,
CIRP Annals – Manuf. Technol, 37(1), pp. 327-
330.
[16] T. Tawakoli, A. Rasifard and M. Rabiey, 2007
―High-efficiency internal cylindrical grinding with
a new kinematic‖, International Journal of
Machine Tools and Manufacture, Volume 47,
Issue 5, pp. 729-733.
[17] J.F.G. Oliveira, E.J. Silva, C. Guo and F.
Hashimoto. 2009 Industrial challenges in grinding,
CIRP Annals - Manufacturing
Technology,Volume 58, Issue 2, pp. 663-680.
[18] Murat Kiyak and Orhan Cakir. 2010‖ Study of
surface quality in dry and wet external cylindrical
grinding‖, International Journal of Computational
Materials Science and Surface Engineering,
Volume 3, Issue 1, pp. 12-23,
[19] O. Cakir, A. Yardimeden, T. Ozben and E.
Kilickap, 2007‖ Selection of cutting fluids in
machining processes‖, Journal of Achievements in
Materials and Manufacturing Engineering,
Volume 25, issue 2, pp. 99-102, 2007.
539
ISBN: 978-81-924893-0-8
[20] T. Jin and D.J. Stephenson, 2008‖ A study of the
convection heat transfer coefficients of grinding
fluids‖, CIRP Annals - Manufacturing
Technology, Volume 57, Issue 1, pp. 367-370,.
[21] Manoel Cleber de Sampaio Alves, 2008 ―Eduardo
Carlos Bianchi and Paulo Roberto de Aguiar,
Grinding of hardened steels using optimized
cooling‖, Ingeniare. Revista chilena de ingeniería,
Volume 16, Issue 1, pp.195-202.
[22] V. K. Gviniashvili, N. H. Woolley and W. B.
Rowe, 2004 ―Useful coolant flowrate in grinding‖,
International Journal of Machine Tools and
Manufacture, Volume 44, Issue 6, pp. 629-636.
[23] R.A. Irani, R.J. Bauer and A. Warkentin. 2005 , A
review of cutting fluid application in the grinding
process, International Journal of Machine Tools
and Manufacture,
Volume 45, Issue 15, pp. 1696-1705 .
[24] P. Hryniewicz, A.Z.Szeri and S.Jahanmir, 2001
―Application of lubrication theory to fluid flow in
grinding: Part I—Flow between smooth surfaces‖,
Journal of Engineering for Industry Transactions
of ASME, Volume 123, pp. 94-100, January.
[25] S. Ebbrell, N. H. Woolley, Y. D. Tridimas, D. R.
Allanson, W. B. Rowe, 2000 ―The effects of
cutting fluid application methods on the grinding
process‖, International Journal of Machine Tools
and Manufacture, Volume 40, Issue 2, pp. 209-
223.
[26] M.N. Morgan, A.R. Jackson, H.Wu, V. Baines-
Jones, A. Batako, W.B. Rowe. 2008
―Optimization of fluid application in Grinding‖,
CIRP Annals - Manufacturing Technology,
Volume 57, Issue 1, pp. 363-366,.
[27] C.H. Li, G.Y. Liu, Y.L. Hou, Y.C. Ding and B.H.
Lu. 2009‖Modeling and experimental
investigation of useful flow-rate in flood delivery
grinding‖, Chinese Control and Decision
Conference, pp. 5467-5471.
[28] J. Kopac and P. Krajnik, 2006 ―High-performance
grinding—A review‖, Journal of Materials
Processing Technology, Volume 175, Issues 1-3,
pp. 278-284.
[29] A.Cameron, R.Bauer and A.Warkentin. 2010 ―An
investigation of the effects of wheel cleaning
parameters in creep feed grinding‖, International
Journal of Machine Tools & Manufacture,
Volume 50, pp. 126–130.
[30] Rodrigo Daun Monici, Eduardo Carlos Bianchi,
Rodrigo Eduardo Catai and Paulo Roberto de
Aguiar, 2006 ―Analysis of the different forms of
application and types of cutting fluid used in
plunge cylindrical grinding using conventional and
superabrasive CBN grinding wheels‖,
International Journal of Machine Tools and
Manufacture, Volume 46, Issue 2, pp. 122-131.
[31] E. Brinksmeier, H. K. Tonshoff, C. Czenkusch and
C. Heinzel. 1998, ―Modeling and optimization of
grinding processes‖, Journal of Intelligent
Manufacturing, Volume 9, Issue 4,
[32] M. Sakakuraa, S. Tsukamotob, T. Fujiwarac and I.
Inasakid, 2006 ―Visual simulation of grinding
process‖, Intelligent Production Machines and
Systems-2nd I* PROMS Virtual International
Conference, pp. 107-112.
[33] E. Brinksmeier, J.C. Aurich, E. Govekar, C.
Heinzel, H.W. Hoffmeister, F. Klocke, J. Peters,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
R. Rentsch, D.J. Stephenson, E. Uhlmann, K.
Weinert and M. Wittmann, 2006 ―Advances in
modeling and simulation of grinding processes‖,
CIRP Annals - Manufacturing Technology ,
Volume 55, Issue 2, Pages 667-696.
[34] T.A. Nguyen and D.L. Butler, 2005 ―Simulation of
precision grinding process, part 1: generation of
the grinding wheel surface‖, International Journal
on Machine Tools and Manufacture, Volume 45,
Issue 11, pp. 1321-1328.
[35] T.A. Nguyen and D.L. Butler. 2005 ―Simulation of
surface grinding process, part 1: interaction of
abrasive grain with the work-piece‖, International
Journal on Machine Tools and Manufacture,
Volume 45, Issue 11, pp. 1329-1336.
[36] O. Sinota, P. Chevrierb and P. Padillaa, 2006
―Experimental simulation of the efficiency of high
speed grinding wheel cleaning‖, International
Journal of Machine Tools & Manufacture,
Volume 46, pp. 170–175.
[37] Mandeep Singh, Anirban Bhattacharya, Ajay
Batish and V.K. Singla, Computational fluid
simulation of coolant flow behaviour through
different nozzles for effective cooling in surface
grinding, 2nd National Conference on Precision
Metrology, SLIET Longowal, pp. 18.
[38] Mandeep Singh, Anirban Bhattacharya, Ajay
Batish and V.K. Singla, 2010 ―Nozzle flow
behaviour for effective cooling through
computational fluid simulation in surface grinding
using scraper board‖, International Conference on
Frontiers in Mechanical Engineering, NIT
Surathkal, pp 148-157.
[39] Anirban Bhattacharya, Ajay Batish and Mandeep
Singh, 2012” Experimental studies to validate
simulated results for nozzle effectiveness using
multi-response optimisation during cylindrical
grinding process‖, Int. J. Materials Engineering
Innovation, Vol. 3, Nos. 3/4,.
[40] Mandeep Singh , Yadwinderpal Sharma , Jaskarn
Singh, 2014 “ Experimental Validation of
Simulated Results Through Different Nozzles for
Effective Cooling in Cylindrical Grinding Process
to Enhance Workpiece Surface Quality‖,
International Conference on Advancements and
Futuristic Trends in Mechanical and Materials
Engineering, pp.195-202 .
540
ISBN: 978-81-924893-0-8
[41] V.A. Baines-Jones, M.N. Morgan, D.R. Allanson ,
A.D.L Batako, ―Grinding fluid delivery system
design-Nozzle Optimization‖, European Research
Council Grant No: GR/S82350/01.
[42] M. N. Morgan and V. Baines-Jones, 2009 ―On the
Coherent Length of Fluid Nozzles in Grinding‖,
Key Engineering Materials-Progress in Abrasive
and Grinding Technology, Volume 404, pp. 61-67.
[43] J. A. Webster, Storrs, CT (US), 2006 ―Coherent jet
nozzles for grinding applications‖, US Patent
Application Publication, Publication number:
US2006/7086930 B2, Saint-Gobain Abrasives,
Inc.,.
[44] Mark Iain Pilkington, 2009 ―Coolant nozzle
positioning for machining work-pieces‖, US
Patent, Patent number: US2009/7568968 B2,
Rolls-Royce Corporation.
[45] E. Brinksmeier and J. Solter, 2009 ―Prediction of
shape deviations in machining‖, CIRP Annals -
Manufacturing Technology, Volume 58, pp. 507–
510.
[46] Konstantinos Salonitis and George Chryssolouris,
2007 ―Cooling in grind-hardening operations‖,
International Journal on Advanced Manufacturing
Technology, Volume 33, pp. 285–297.
[47] W.B. Rowe, J.A. Pettit, A. Boyle and J.L. Moruzzi,
1988 Avoidance of thermal damage in grinding
and prediction of the damage threshold, CIRP
Annals - Manufacturing Technology, Volume 37,
Issue 1, pp. 327-330.
[48] G. Chryssolouris, K. Tsirbas and K. Salonitis, 2005
―An analytical, numerical and experimental
approach to grind hardening‖, Journal of
Manufacturing Processes, Volume 7, Issue, pp. 1-
9.
[49] M.C. Shaw and A. Vyas, 1994 ―Heat–Affected
zones in grinding steel‖, CIRP Annals -
Manufacturing Technology, Volume 43, Issue 1,
pp. 279-282.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Optimization of Machining Parameters for surface

roughness in Boring operation using RSM
Gaurav Bansal Jasmeet Singh
BGIET,Sangrur BGIET,Sangru
gaurav_bansal87@yahoo.co.in jasmeet_singh23@rediffmail.com

ABSTRACT: variable) which is influenced by several independent

Machining is a manufacturing process in which
variables (input variables).
unwanted material is removed from the work piece to get the
desired shape and dimensions. Machining operations have 1.1 Boring Process
been the core of the manufacturing industry since the In machining, boring is the process of enlarging a hole
industrial revolution. A machining process involves many that has already been drilled (or cast), by means of a single-
process parameters which directly or indirectly influence the point cutting tool (or of a boring head containing several
surface roughness of the product in common. A reasonably such tools), for example as in boring a cannon barrel. Boring
good surface finish is desired to improve the properties, is used to achieve greater accuracy of the diameter of a hole,
and can be used to cut a tapered hole. Boring can be viewed
fatigue strength, corrosion resistance and aesthetic appeal of as the internal-diameter counterpart to turning, which cuts
the product. Surface roughness is varied due to various external diameters.
parameters of which feed, speed, depth of cut are important
ones. A precise knowledge of these optimum parameters
would facilitate in good surface quality. Extensive study has
been conducted in the past to optimize the process
parameters in any machining process to have the best
product. Current investigation is made on boring process and
Response Surface Methodology is applied on the most
effective process parameters i.e. feed, cutting speed and
depth of cut. The main effects (independent parameters),
surface plots and contour plots of the variables have been
considered separately to build best subset of the model. Each
boring parameter is considered at two levels. After
performing the experiments, roughness value is checked
using surface roughness measuring instrument To analyze
the data set, MINITAB-16 (Software) has been used to
reduce the manipulation and help to arrive at proper
improvement plan of the Manufacturing process &
Techniques.
The results of analysis show that cutting speed and depth of
cut have present significant contribution on the surface
roughness and feed rate have less significant contribution on
the surface roughness. Fig.1 Boring Process

Keywords: Optimization, Boring parameters, Surface There are various types of boring. The boring bar may be
roughness, Response surface methodology. supported on both ends (which only works if the existing
hole is a through hole), or it may be supported at one end.
Line boring (line boring, line-boring) implies the former.
1. INTRODUCTION Back boring (back boring, back-boring) is the process of
Machining operations have been the core of the reaching through an existing hole and then boring on the
manufacturing industry since the industrial revolution. In "back" side of the work piece (relative to the machine
present manufacturing scenario the quality is the challenging headstock). Because of the limitations on tooling design
aspects, which is to be looked upon. Every manufacturing or imposed by the fact that the work piece mostly surrounds the
production unit should concern about the quality of the tool, boring is inherently somewhat more challenging than
product. Response surface methodology (RSM) is a turning, in terms of decreased tool holding rigidity, increased
collection of mathematical and statistical techniques useful clearance angle requirements (limiting the amount of support
for the modeling and analysis of problems. The objective is that can be given to the cutting edge). These are the reasons
to optimize a response (output why boring is viewed as an area of machining practice in its
own right, separate from turning, with its own tips, tricks,

541
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

challenges, and body of expertise, despite the fact that they

are in some ways identical
3.1 Parameters & Their Limits
Experimentation has been done by considering the
2. LITERATURE REVIEW following levels of process variables.
Extensive study has been conducted in the past to Table1 Process parameter levels
optimize the process parameters in any machining process to Process Variable Unit Level 1 Level 2
have the best product. Traditionally, the selection of cutting Cutting Speed m/min. 100 200
conditions for metal cutting is left to the machine operator. Feed Rate mm/rev. 0.08 0.18
In such cases, the experience of the operator plays a major Depth of cut mm 1 2
role, but even for a skilled operator it is very difficult to
attain the optimum values each time. The main machining Now, RSM matrix is made using MINITAB software.
parameters in metal boring operations are cutting speed, feed 20 no. of observations were found and experiments are
rate and depth of cut etc. The setting of these parameters performed on the same and surface roughness value is
determines the quality characteristics of machined parts. determined. Table 2 shows the resultant matrix and
Yadav kumar upendra et.al (2012)[1] discussed the effect surface roughness.
of machining parameters viz. cutting speed, feed rate and
depth of cut on surface roughness in CNC turning by taguchi Table 2 Experiment Results
method. An L27 orthogonal array, analysis of variance and Sr Cutting Feed Depth Surface
signal to noise ratio was used in this study. It was also No. Speed rate of cut roughness
(µm)
concluded that feed rate is the most significant factor
1 150 0.13 1.5 1.44
affecting surface roughness followed by depth of cut. Basim
A. Khidhir et al. (2011) [2] investigated the effect of cutting 2 150 0.13 1.5 1.36
speed feed and depth of cut on surface roughness when 3 65.91 0.13 1.5 1.73
machining nickel based hastelloy 276. It has been found that
4 200 0.18 1 2.22
the good surface finish is obtain with higher cutting speed,
minimum feed rate, and lower depth of cut. 5 200 0.08 1 1.29
6 150 0.13 0.65 0.65
3. EXPERIMENTAL PROCEDURE 7 150 0.13 1.5 1.47
THE STUDY HAS BEEN PERFORMED ON AISI 4130
8 200 0.18 2 2.36
STEEL ALLOY BARS HAVING DIMENSIONS OF 40 MM
DIAMETER AND 40 MM LENGTH, ON CNC BORING 9 150 0.13 1.5 1.31
MACHINE BY USING CARBIDE TOOL OF 0.6 MM NOSE
RADIUS. 10 200 0.08 2 1.26
Further the work has been channelized through following 11 150 0.13 2.34 1.49
adopted procedure:
12 150 0.21 1.5 1.46
 Check and prepare the CNC Boring Machine
(Lokesh TL 250) ready for performing the 13 100 0.18 1 0.81
machining operation. 14 150 0.13 1.5 1.30
 Cut the work piece by power saw and perform
15 100 0.08 2 2.51
initial boring operation on simple lathe to get
desired dimensions of work pieces. 16 150 0.13 1.5 1.47
 Perform straight boring operation on specimens in 17 100 0.08 1 0.72
various cutting environments involving various
18 100 0.18 2 2.36
combinations of process control parameters like:
spindle speed, feed and depth of cut etc. These 19 150 0.045 1.5 1.41
experiments are pre designed with RSM using 20 234.08 0.13 1.5 1.87
MINITAB software and executed as per matrix
provided by RSM technique.
 After this, Surface roughness is found using
roughness measuring instrument. Surface
4. RESULTS & DISCUSSION
roughness of each of the work-piece is measured at Now, various set of analysis is made to validate the
four different points. Then, the average of these results.
four values is found. This resultant value is
considered as the final surface roughness value of
that work-piece.

542
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Residual Plots for Ra(µm)

Normal Probability Plot Versus Fits
99 0.4

90 0.2

Residual
Percent

50 0.0

10 -0.2

1 -0.4
-0.50 -0.25 0.00 0.25 0.50 0.5 1.0 1.5 2.0 2.5
Residual Fitted Value

Histogram Versus Order

0.4
4.8
0.2
3.6
Frequency

Residual
0.0
2.4

1.2 -0.2

0.0 -0.4
-0.4 -0.3 -0.2 -0.1 0.0 0.1 0.2 0.3 2 4 6 8 10 12 14 16 18 20
Residual Observation Order

Fig.2 Residual analysis of surface roughness (Ra)

Table 4 ANNOVA Table to check RSM statics for Ra
Table 3 Estimated Regression coefficients for Ra Source DOF Seq SS Adj SS Adj F P
Term Coef SECoef T P MS
Regression 9 4.66008 4.66008 0.51779 8.14 0.001
Constant 1.38339 0.1028 13.452 0.000
Cutting Speed 0.12084 0.1148 1.053 0.031 Linear 3 2.11117 2.11117 0.70372 11.07 0.002
Feed rate 0.25519 0.1148 2.224 0.050 Square 3 0.70612 0.70612 0.23537 3.70 0.050
Depth of cut 0.59793 0.1148 5.211 0.000
Interaction 3 1.84279 1.84279 0.61426 9.66 0.003
Cutting Speed* 0.56162 0.1879 2.989 0.014
Cutting Speed Residual 10 0.63582 0.63582 0.06358 ------ ------
Error
Feed rate* Feed 0.20012 0.1879 1.065 0.012
Lack of fit 5 0.52105 0.52105 0.10421 4.54 0.061
rate
Depth of cut* -0.16471 0.1879 -0.877 0.401 Pure Error 5 0.11478 0.11478 0.02296 ----- -----
Depth of cut Total 19 5.29591 ------ ------ ------ ------
Cutting speed* 0.73640 0.2522 2.920 0.015
Feed rate
Figs 2 show the residual distribution diagrams for surface
Cutting speed* -1.14009 0.2522 -4.521 0.001 roughness. These are generally fall on a straight line
Depth of cut implying that errors are distributed normally. From Fig. it
Feed rate* -0.02636 0.2522 -0.105 0.919 can be concluded that all the values are within the CI level of
Depth of cut 95 %. Hence, these values yield better results in future
prediction. Fig. indicated that there is no obvious pattern and
S= 0.252156 PRESS= 4.14474
unusual structure. So, it can be conclude that the residual
R-Sq= 87.99% R-Sq (pred)= 91.74% R-Sq(adj)= analysis does not indicate any model inadequacy. The
purpose of analysis of variance is to investigate which design
89.19%
parameter significantly affects the surface roughness.

4.1 Graphical Inferences for Ra

The plots are developed with the help of a software package
MINITAB 16. The purpose of main effect plot is to obtain a
general idea of which main effect may be important. Fig. 3
shows the main effects plot for Ra.

543
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Main Effects Plot for Ra(µm)

Data Means
Cutting Speed Feed rate
2.0

1.5

1.0

0.5
Mean

65.910 100.000 150.000 200.000 234.090 0.045910 0.080000 0.130000 0.180000 0.214090
Depth of Cut
2.0

1.5

1.0

0.5
0.65910 1.00000 1.50000 2.00000 2.34090

Fig. 3 Effect of boring parameters on Ra

Surface Plot of Ra(µm) vs Cutting Speed, Depth of Cut

Hold Values
Feed rate 0.13

Ra(µm) 2

1 250
200
0
150
C utting Speed
1.0 100
1.5
2.0
2.5
Depth of C ut

Fig. 4 Surface plot of Ra vs Cutting speed & Depth of cut

544
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Contour Plot of Ra(µm) vs Depth of Cut, Cutting Speed Surface Plot of Ra(µm) vs Depth of Cut, Feed rate
Ra(µm) Hold Values
2.2 < 0.0 Cutting Speed 150
0.0 – 0.5
0.5 – 1.0
2.0
1.0 – 1.5
1.5 – 2.0
1.8 2.0 – 2.5
2.5 – 3.0
Depth of Cut

> 3.0
1.6
Hold Values 2.0
1.4 Feed rate 0.13
Ra(µm) 1.5

1.2 1.0 2.5

2.0
0.5
1.5
1.0 1.0
Depth of C ut
0.05
0.10
0.15
0.20
0.8 Feed r ate

80 100 120 140 160 180 200 220

Cutting Speed

Fig. 4-a Contour Plot of Ra vs cutting speed & Depth of

cut Fig.6 Surface Plot of Ra vs Feed rate & Depth of cut
To understand how the response changes in a given direction
Surface Plot of Ra(µm) vs Cutting Speed, Feed rate
by adjusting the design variables response surface graphs are
Hold Values
Depth of Cut 1.5 used. Fig. 4,5 & 6 shows the surface plots of Ra vs cutting
speed & depth of cut, cutting speed & feed rate, feed rate &
depth of cut respectively. In every graph, each combination
of design variables generates a value of surface roughness.
Next, contour plots are developed Contour plots are basically
3.0 orthographic views of 3-D surface plot and consists of
2.5
Ra( µm)
2.0
colored regions of input variables bearing different value of
250
1.5 200
output response. Like in the graph (fig.4-a), dark green
150
C utting Speed region of plot reflects the area having values of Cutting
0.05 100
0.10
0.15
0.20
speed and Depth of Cut where surface roughness may be
Feed r ate
reached up to 3.0 or more. Similarly, the extreme light green
color region of above plot reflects the area having values of
Cutting speed and Depth of cut where surface roughness
Fig. 5 Surface plot of Ra vs Cutting speed & Feed rate may vary between 1.5 to 2.0 and the light blue region of the
plot shows the area having values of cutting speed and depth
of cut varying between 1 to 1.5.
Contour Plot of Ra(µm) vs Feed rate, Cutting Speed
Ra(µm)
4.2 Result
0.200 < 1.5 At last lower, upper and target values of the responses has
1.5 – 2.0
2.0 – 2.5 been fed into Response optimizer tool of Minitab. So, the
0.175 2.5 – 3.0
> 3.0 desirability will become 97.2%. After analysing the data of
Hold Values
0.150 Depth of Cut 1.5 experiments, software has provided the solution at 97.2%
Feed rate

0.125
desirability that at Cutting Speed of 234.08 mm/min, Feed of
0.08 mm/rev and Depth of Cut of 2.34 mm, minimum Ra of
0.100 0.89 μm can be achieved.
0.075

0.050
5. CONCLUSION
80 100 120 140 160 180 200 220 The current study was to investigate the effect of machining
Cutting Speed
parameters on the surface roughness. The following
Fig. 5-a Contour Plot of Ra vs Cutting speed & feed rate conclusions are drawn from the study:
1. Surface roughness could be effectively predicted
by using spindle speed, feed rate, and depth of cut
Contour Plot of Ra(µm) vs Depth of Cut, Feed rate
Ra(µm)
as the input variables.
2.2 < 0.6
2. Surface roughness is mainly affected by cutting
0.6 – 0.9
0.9 – 1.2
2.0
1.2 – 1.5
speed followed by depth of cut and feed rate. The
1.5 – 1.8
1.8 1.8 – 2.1 parameters taken in the experiments are optimized
> 2.1
Depth of Cut

1.6
to obtain minimum surface roughness possible.
Hold Values
Cutting Speed 150 The optimum setting of cutting parameters are :
1.4
i) Cutting Speed = 234.08mm/min
1.2
ii) Feed rate = 0.08rev/min
1.0
iii) Depth = 2.34mm
0.8

0.050 0.075 0.100 0.125 0.150 0.175 0.200

Feed rate

Fig. 6-a Contour plot of Ra vs Feed rate & Depth of cut

545
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES
[1]. Upinder Kumar Yadav, Deepak Narang, Pankaj
Sharma Attri “Experimental Investigation and
Optimization of Machining Parameters for Surface
Roughness in CNC Turning By Taguchi Method”/
International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 Vol. 2,
Issue4, July-August 2012, pp.2060-206
[2]. Basim A. Khidhir and Bashir Mohamed “Analyzing
the effect of cutting parameters on surface
roughness and tool wear when machining nickel
based hastelloy- 276.IOP Publishing (2011).
[3]. Harsimran Singh Sodhi1, Dhiraj Prakash
Dhiman2,Ramesh Kumar Gupta3, Raminder Singh
Bhatia4 “Investigation of Cutting Parameters For
Surface Roughness of Mild Steel In Boring.
[4]. Process Using Taguchi Metod”; International
Journal of Applied Engineering Research, ISSN
0973-4562 Vol.7 No.11 (2012) © Research India
Publications;
http://www.ripublication.com/ijaer.htm.
[5]. 4. H. R. Ghan, S.D.Ambekar “Optimization of
cutting parameter for Surface Roughness, Material
Removal rate and Machining Time of Aluminium
LM-26 Alloy” International Journal of Engineering
Science and Innovative Technology (IJESIT)
Volume 3, Issue 2, March 2014.
[6]. 5. Mihir Patel, Vivek Deshpande “Application of
Taguchi Approach for Optimization Roughness for
Boring operation of E 250 B0 for Standard IS: 2062
on CNC TC” © IJEDR| Volume 2, Issue 2 | ISSN:
2321-9939.
[7]. RAKESH.K.PATEL1*, H.R.PRAJAPATI2
“PARAMETRIC ANALYSIS OF SURFACE
ROUGHNESS (SR) AND MATERIAL
REMOVAL RATE (MRR) OF HARDEN STEEL
ON CNC TURNING USING ANOVA
ANALYSIS: A REVIEW; Rakesh.K.Patel et al. /
International Journal of Engineering Science and
Technology (IJEST).
[8]. Nuran Bradley “THE RESPONSE SURFACE
METHODOLOGY.

546
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ELASTIC - PLASTIC & CREEP PHENOMENON IN SOLIDS
Gaurav Verma
Assistant Prof. in Mathematics
Gobindgarh Public College, Alour
gkdon85@gmail.com
ABSTRACT
The advance research in mechanics deals with elastic, plastic
and creep transitions which occur under stress and strain
relations. The phenomenon of elastic-plastic and creep has been
given successfully by B . R. Seth in 1962. The elastic-plastic
and creep transition problems in solids are helpful to calculate
stresses for initial yielding and for fully plastic state. In this
current literature, the elastic-plastic and creep phenomenon has
been elaborated using the Seth transition theory which is
helpful for the designer to make the safe and economical body
mechanical part of machines.
Keywords
Elastic, Plastic, Creep, Transition, Deformation.
1. INTRODUCTION
Solid mechanics is the branch of Continuum mechanics that
deals with the behavior of solid materials, especially their
motion and deformation under the influence of forces, thermal
effects and other different agents. So, it is regarded as science
of force and motions, with its various civil and mechanical
engineering applications. These applications have been
rendering valuable service to the mankind since the very
beginning of our civilization. These applications have been
achieved through a proper understanding of the principles of
mechanics with certain postulates and assumptions based on
experiments. So, solid mechanics is necessary for the basic
understanding of mechanical phenomenon but also to make
engineering techniques advance in most of areas throughout
technology. During various developments including knowledge
of new materials, it is necessary to consider more thoroughly
the creative application of scientific principles to design or
develop machines apparatus or manufacturing processes under
scientific conditions, so that both safety and economy purpose
hold good. In order to make a mechanical body safe, a designer
must have knowledge of the limiting conditions of stress at
which temporary and permanent deformation starts to develop
so that danger of yielding or fracture is to be eliminated.
Deformation is a physical phenomenon causes change in shape,
size or position of a body part as a result of compression,
deflection or extension [1]. A deformation may be occurred due
to body forces, internal pressure, external loads or temperature
changes in the body. Deformations which are recovered after
the removal of body forces are called elastic deformations. In
this case, a body completely recovers its original configuration.
547
ISBN: 978-81-924893-0-8
Kulwinder Singh
Assistant Prof.In Mathematics
Punjab Agricultural University, Ludhiana
kulwinder85pau@gmail.com
On the other hand, if deformation remains even after body
forces have been removed is called plastic deformation. It is
one of type of irreversible deformations in which material
bodies after stresses have attained a certain threshold value
known as the elastic limit or yield stress. If the state of
deformation in a body remains constant throughout the whole
part of the material body is called homogeneous deformation.
ELASTIC
(RECOVERABLE)
DEFORMATION (
PLASTIC
( PERMENANT)
2. THEORY OF ELASTICITY
In physics, elasticity (from Greek ἐλαστός "ductible") is the
tendency of solid materials to return to their original shape after
being deformed. Solid objects will deform when forces are
applied on them. If the material is elastic, the object will return
to its initial shape and size when these forces are removed. The
physical reasons for elastic behavior can be quite different for
different materials. In metals, the atomic lattice changes size
and shape when forces are applied (energy is added to the
system). When forces are removed, the lattice goes back to the
original lower energy state. For rubbers and other polymers,
elasticity is caused by the stretching of polymer chains when
forces are applied. The „theory of elasticity‟ has been
continuously developed by various investigators for anisotropic
bodies and isotropic bodies since 1950. This theory is the solid
foundation for the scientists in designing of engineering
structures because of its increasing application to engineering
problems. The advance research in mechanics deals with
elastic, plastic and creep transitions which occur under stress
and strain relations. The concept of stress and strain is
elaborated by I.S Sokolnkiff in the book "The Mathematical
theory of Elasticity". A load applied to solid structure
originates internal forces with in body called stress which cause
deformation & the deformation of material is called strain.
[6]The state of stress at any point of the medium is completely
characterized by the specification of nine quantities that are
called the components of stress tensor. In the same manner,
there are components of strain tensor which characterized pure
deformation. Both stress and strain move parallel to each other
and having relations between them under various conditions.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The stress-strain relations are concerned with the
characterization of elastic solids. It was Robert Hooke who
gave the first rough law of proportionality between the forces
and displacements. He said that the extension is proportional to
the force. This implies that strain is directly proportional to the
stress that is T=Ee, where E is constant of proportionality
called modulus of elasticity. A natural generalization of
Hooke's law immediately suggests that at each point of the
medium the strain components eij are linear functions of the
stress components Tij .These linear relations involve elastic
coefficients of the materials. It should be noted that if elastic
properties of body are same in all directions about any given
point, then the body is called isotropic, where as anisotropy
body is opposite to the isotropic body that is different elastic
properties in different directions at given point. But if materials
have three mutually directions of elastic symmetry then they
are called orthotropic. The Hooke's law for homogenous
isotropic body can be written in form
Where λ and µ are Lame's constants and is called first
strain invariant.
It is clear from the equation, if we have strain measures then we
can easily find stress components or vice versa. These relations
hold good up to certain limit, after that elastic body behave like
plastic body. Consider the strain components for finite
deformation are given as
= [1 ] , = of plastic deformation of metals.
Where = permanently under the influence of mechanical stresses. It can
Using the generalized form of Hooke's law for homogenous
isotropic body, we have stress components as
= +
= +
3. THEORY OF PLASTICITY
In physics and materials science, plasticity describes the
deformation of a material undergoing non-reversible changes of
shape in response to applied forces. For example, a solid piece
of metal being bent or pounded into a new shape displays
plasticity as permanent changes occur within the material
itself. In the same manner, the designers are interested in the
„theory of plasticity. It is helpful in understanding the
deformation behaviors for avoiding excessive deflection or
distortion in machine parts. The scientific study of the concept
of plasticity is started in 1864. The theory of Plasticity also
deals with the calculation of stress and strain of plastically
deformed body as like of theory of elasticity and deals with
548
ISBN: 978-81-924893-0-8
mathematical techniques for calculating non-uniform
distributions of stress and strain of fully plastic body. Here term
[5] strain is regarded as macroscopically uniform, but the
plastic distortion is confined to narrow bands which extend
through crystal. Since plastic distortion is observed in most of
the metals and it can vary widely due to different physical
structures. The design engineers are interested in knowing the
distortion behaviors and plastic flow of different materials as it
is useful for measuring and avoiding excessive distortion in
body parts of machines. If the stress exceeds a critical value, as
was mentioned above, the material will undergo plastic, or
irreversible, deformation. This critical stress can be tensile or
compressive. The Tresca and the von Mises criteria are
commonly used to determine whether a material has yielded.
However, these criteria have proved inadequate for a large
range of materials and several other yield criteria are in
widespread use.
Therefore , From the viewpoint of design, plasticity is
concerned with predicting the safe limits for use of a material
under combined stresses. i.e., the maximum load which can be
applied to a body without causing:
◦ Excessive Yielding
◦ Flow
◦ Fracture
So ,Plasticity is concerned with understanding the mechanism
4. THEORY OF CREEP
In materials science, creep (sometimes called cold flow) is the
tendency of a solid material to move slowly or deform
occur as a result of long-term exposure to high levels of stress
that are still below the yield strength of the material. Creep is
more severe in materials that are subjected to heat for long
periods, and generally increases as they near their melting
point. Therefore Creep is the gradual increase of the plastic
strain in a material with time at constant load. Particularly at
elevated temperatures some materials are susceptible to this
phenomenon and even under the constant load mentioned
strains can increase continually until fracture. This form of
fracture is particularly relevant to, nuclear reactors, rocket
motors, furnaces, turbine blades etc. The concept of creep in
solids is given by various authors Folke K.G. Odquist, Finnie
and Heller. Creep effects under mechanical stress are observed
in most of solid materials. Creep behavior of a material can be
divided into three stages. The deformation takes place in
primary stage is the early stage of loading. Then it reaches a
steady state which is called the secondary creep stage followed
by tertiary stage in which strain rate accelerates and fracture
soon occurs as shown in figure [9].
While studying creep effects, we generally neglect elastic
deformations as compared with plastic or creep deformations.
This assumption is very useful in simplification of many
problem cases and we take into account plastic deformation
with strain hardening, viscous flow under constant stress,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Deterioration with time and total deformation [7]. The above
combinations of the assumptions give rise to a „Theory of total
creep deformation‟ which is particularly suited to describe
behavior of the materials in the secondary stage of creep, taking
account of primary creep with its total amount of as correction.
A body which obeys the law of plastic deformation with strain
hardening, viscous flow under constant stress and Deterioration
with time could be characterized as a rigid non-linear-
viscoplastic-deteriorating.
Fig 1: THREE STAGES
OF CREEP DEFORMATION
5. RESEARCH METHODOLGY
The transition approach of deformation has been successfully
applied by various researchers to large number of problems in
elastic, plastic and creep situations. The classical macroscopic
treatment of problems in (i) plasticity, (ii) creep and (iii)
relaxation has to assume semi-empirical yield conditions like
those of Tresca and von Mises and Creep strain laws like those
of Norton, Odquist and others. This is a direct consequence of
using linear strain measures which neglect the non-linear
transition region through which the yield occurs and the fact
that creep and relaxation strains are never linear [3]. Therefore
classical elastic-plastic model does take into consideration the
non linear part through which transition takes place. Here in
this current literature, the main emphasis is on the study of
elastic -plastic and creep transition and solving various
problems of solids by considering non liner part through which
the transition takes place. The transition theory of B R SETH is
helpful to deal these types of problems. In the B R Seth theory,
the main consideration is that elastic plastic transition is treated
as asymptotic phenomenon at transition points in the
deformation and transition states are non-linear and irreversible
in nature. Therefore, in elasticity-plasticity non-linear terms are
very important. While adopting the b r Seth theory, the research
methodology of problem is described as;
(i) In any problem of elastic –plastic transition, the first of all
the displacements components of solid are defined that is
displacement components u, v and w are taken.
549
ISBN: 978-81-924893-0-8
(ii) Then the generalized strain measure of elastic –plastic
transition problem is taken and using generalized Hooke‟s law
corresponding stress components are obtained.
(iii) By solving the equations of equilibrium, we get non linear
differential equations from which turning points can be
obtained. Turning points are ± ∞ and -1where ±
∞correspondents to elastic plastic transitions and -1 correspond
to creep transitions.
(iv) The asymptotic solution at these points gives the
displacements & the stresses and no semi empirical yield
condition is necessary.
The methodology is useful to find the solution through
principal stress & helpful in finding initial yielding. And at
fully plastic state, the displacement components are obtained.
6. NATURE OF ELASTIC-PASTIC &
CREEP DEFORMATION
In the classical concept, the elastic and plastic states of body
are two different region that is the materialistic body is
separated by yield surface on the basis of symmetry and
physical conditions[11]. In the elastic region ,the theory of
linear elasticity works and in the plastic region,Von Mises
equations are used with an yield and boundary condition. In
1868, Tresca considered that there exist a mid zone area
between elastic and plastic states of solid which is against the
classical theory of elastic-plastic transitions. The classical
model tells only about the linear behavior of elastic –plastic
transition , but this model does not tell about the non-linear
behavior of transition as shown in the figure [12]. Many
authors have not recognized this intermediate state as a separate
state that of elastic and plastic. It was First B.R Seth who
explained the non-linear nature of transition state. Therefore,
B.R Seth has elaborated the concept of this intermediate region.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

He has named this region as “Transition region” . He has
developed a Transition theory of elastic-plastic and creep
transitions. Seth[5] has defined the concept of generalized
strain measure which when applied to the governing
differential equation of the medium eliminates ad-hoc
assumptions like incompressibility, strain law, yield condition
etc. and these constitutive equations give elastic-plastic ,creep
results through some transition functions.
[5] Hill, R “THE Mathematical Theory of Plasticity”,
Clarendon Press, Oxford, 1950
[6] Sokolnikoff I. S. “THE Mathematical Theory of Elasticity”,
MCGRAW Hill, 1946
[7] Odquist F.K.G, “THE Mathematical Theory of Creep and
Creep Rupture, Clarendon Press, Oxford, 1974

[8] Pankaj, T, "Deformation in a thin rotating Disc having

7. SCOPE OF STUDY variable thickness and Edge load with inclusion at the Elastic-
The scope of study deals with the providing guidelines to
Plastic transitional stresses", Vol.12, No 1, 2012
designers for making products. It deals in developing new ideas
to meet changing demands of products in machinery around the [9] Creep.pdf. , January 25, 2009
world so that innovative, collaborative spirit between people
can be developed. This can lead to the production of industry‟s [10] PropAppGuide_scope and apps.pdf, Quadrantplastics.com.
broadest range of engineering materials. [10]The motive of
study is finding conditions under which life of material parts in
[11] Purushothama, C. M.,”Elastic Plastic transition, ZAMM,
machines get longer , reducing wearing on mating parts, better
45(1965) Heft6, Seite 401-408.
mechanical dampening (less noise) , faster operation of
equipment , less power needed to run equipment, chemical and
corrosion resistance etc. By study the nature of transitions in [12] Seth, B. R. “Elastic Plastic Transition in Shells & Tubes
various material bodies, one can determine the applications and under pressure", ZAMM, vol.43, pp.345, 1963.
mechanical requirements of body.

8. CONCLUSION
While studying elastic plastic & creep transitions, we can say
that the various elastic-plastic & creep problems can be solved
with various different conditions. These problems are non-
linear in nature and works according the B. R. Seth's transition
theory. While solving these problems, there is no need of semi-
empirical laws and adhoc assumptions like creep strain laws,
yield condition etc. Also these problems have very importance
due to higher cost of materials and scarcity of materials for
designing of machines. The knowledge of conditions under
which a body becomes fully plastic, get fractured is also useful
for making safer design of machines. Therefore, in order to
enhance the life of various mechanical tools, the study of
elastic-plastic transition problem has paramount value.

9. ACKNOWLEDGMENTS
The author wishes to acknowledge his sincere thanks to his
Shree Guru Maharaj Ji for support and encouragement for the
whole of the life.

REFERENCES
[1] Seth B.R., “Generalized Strain and Transition Concepts for
Elastic-Plastic Deformation, Creep and Relaxation”, Proc. XIth
Int. Congress of Appl. Mech. Munich, pp. 383-389, 1964.

[2] Borah B.N., “Thermo Elastic-Plastic Transition”,

Contemporary Mathematics, vol.379, pp. 93-111, 2005.

[3] Seth B.R., “Transition Theory of Elastic-Plastic

Deformation, Creep and Relaxation”, NATURE, vol. 195, No.
4844, pp. 896-897, 1962.

[4] Seth B.R., “Generalized strain measure with applications to

physical problems”,Rep. 248

550
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Finite Element Analysis of a Muff Coupling using CAE
Tool
Rajeev Kumar Mayur Randive
Assistant Professor, Mech. Research Scholar, Mech. Engg.
Engg. Dept, LPU, Phagwara. Dept. LPU, Phagwara
rajeev.14584@lpu.co.in randive.mayur08@gmail.com
ABSTRACT
Performance of muff coupling relies heavily on successful
power transmission from one shaft to another shaft, which
strongly affects the various parameters and the reliability of
the muff coupling. Advances taking place in servo application
have increased the need for a predictive tool for simulating the
stress analysis and displacement analysis under operating
conditions. Hyper-Mesh is used as a Pre-Processor A stress
analysis and displacement analysis of a muff coupling has
been done. This paper depicts the validation of the design of a
muff coupling using Finite Element Analysis. The analysis
has been carried out with actual design considerations and
loading conditions. A coupled stress and displacement linear
static analysis has been carried out for a given torque to
determine the maximum deflection, stress distribution and its
location in the muff coupling. Optistruct and RADIOSS are
used as Solver in this problem. It has been observed that
stresses, displacement, in key, shaft1, shaft2, have been found
within safe limits and structure could withstand the given
torque. Hyper-Mesh and HyperView are used for Post-
Processing in this problem.
General Terms
Finite Element Analysis.
Keywords
Displacement Analysis, Muff Coupling, Pre-processor, Post-
processor, Solver CAE Tool, Stress Analysis.
1. INTRODUCTION
We ask that authors follow some simple guidelines. In
essence, we ask you to make your paper look exactly like this
document. The easiest way to do this is simply to download
the template, and replace the content with your own material.
Couplings, have been historically imprecise, inexpensive, and
often home made components for simple shaft to shaft
connections. In the past many people would not consider
using a rigid coupling in any servo application. However,
smaller sized rigid couplings, especially made of aluminum,
cast iron, steel etc are increasingly being used in motion
control applications due to their high torque capacity,
stiffness, and zero backlash . Rigid couplings are torsionally
stiff couplings with virtually zero windup under torque loads.
If any misalignment is present in the system the forces will
cause the shafts, bearings or coupling to fail prematurely.
Rigid couplings cannot be run at extremely high rpm’s for the
reason that they cannot compensate for any thermal changes
in the shafts which is caused by the high speed use. However,
in situations where misalignment can be tightly controlled
rigid couplings offer excellent performance characteristics in
servo applications. A sometimes overlooked advantage of
rigid couplings is they can be used to establish shaft alignment
551
ISBN: 978-81-924893-0-8
Gurpreet Dhaul
Research Scholar, Mech. Engg.
Dept. LPU, Phagwara
gurpreetdhaul@gmail.com
in misaligned systems. To establish shaft alignment the motor
and component mounts need to be loosened to ensure there is
free movement. Then connect the shafts with the rigid
coupling which, if precisely made, will align the shafts.
Lastly, center the components on any remaining free play and
tighten the mounts.
1.1 Purpose of Shaft Coupling
A Shaft coupling is a device used to connect two shafts
together at their ends for the purpose of transmitting power.
Couplings do not normally allow disconnection of shafts
during operation, however there are torque limiting couplings
which can slip or disconnect when some torque limit is
exceeded.
The primary purpose of couplings is to join two pieces of
rotating equipment while permitting some degree of
misalignment or end movement or both. By careful selection,
installation and maintenance of couplings, substantial savings
can be made in reduced maintenance costs and downtime.
Shaft couplings are used in machinery for several purposes,
the most common of which are the following.
 To provide for the connection of shafts of units that are
manufactured separately such as a motor and generator
and to provide for disconnection for repairs or
alterations.
 To provide for misalignment of the shafts or to
introduce mechanical flexibility.
 To reduce the transmission of shock loads from one
shaft to another.
 To introduce protection against overloads.
2. RESEARCH REVIEW
There is a vast amount of literature related to Finite Element
Analysis. Many publications indicate the success story of
implementation of FEA on various components.
Studied the procedural steps involve in the design of coupling
and the development of software package using java as a tool
for design and drafting of the coupling [1]. Study of how
numerical finite element (FE) analysis can improve the
prediction of stress concentration in the keyway. Using shape
optimization and the simple super elliptical shape, it is shown
that the fatigue life of a keyway can be greatly improved with
up to a 50 per cent reduction in the maximum stress level. The
design changes are simple and therefore practical to realize
with only two active design parameters [2].
Studied about fatigue cracks in the coupling sleeve. All of
them being initiated at the spline root region [4]. How to
improve the topology of geometry we can improve the quality
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
of mesh and get the better analysis results. Improvement
procedures provided here are for both for elements that are
interior to the mesh and for elements connected to the
boundary [3].
3. PROBLEM DEFINITION
The finite element analysis of a muff coupling finds
widespread application in various industries, it has been
carried out using CAE tools.. The design of the muff
coupling has been done by taking the data from various
references and books. Muff coupling is designed as a
dividing structure, therefore, it is easy to assemble,
disassemble and removal from the shaft. Precisely
manufactured rigid couplings with honed bores are
increasingly used in motion control applications [5]
where components are properly aligned.
3.1 CAD Model
The CAD model has been prepared in SOLID EDGE & the
meshing tool used is Hyper-mesh & the solver used is Redioss
linear. The results are to be validated by comparing with the
experimental results. The 2-D drawing of the muff coupling is
shown below in Fig 1.
Figure 1: 2d drawing of muff coupling
3.2 Geometry Preparation
After the CAD data has been imported, an Edit/Surface/Edge
Match is performed on the geometry in order to prepare the
surfaces for meshing. This involves the task of removal of
features, changing the shape of a part in order to simplify the
geometry. Certain details of the shape, such as small holes or
blends, may simply not be necessary for the analysis being
removed. When these details are removed, the analysis can
run more efficiently. Changing the geometry to match the
desired shape can also allow a mesh to be created more
quickly.
3.3 Meshing
Meshing is done to reduce the degree of freedom from infinite
to finite. The geometric surfaces of all the components of
muff coupling are meshed using 2-D mixed elements. Mixed
mode is commonly preferred due to better mesh transition
pattern. Based upon the analysis and hardware configuration,
an element edge length of 2 mm is used. For better
representation of hole geometry and smooth mesh flow lines,
holes are modeled with even no. of elements. After all
surfaces have been meshed, next step involves equivalency all
nodes.
Hyper-mesh has tools for determining the causes of mesh
failure such as self intersections, free edges, problems with
element normal’s, or duplicate elements. The 3-D tetra
mesher, available with Hype-rmesh, is used to create the solid
tetra mesh. Quad elements are splitted to trias and converted
552
ISBN: 978-81-924893-0-8
to four-noded tetras. The overall analysis approach is to create
a refined 3D tetra mesh from the imported CAD geometry for
the muff coupling. After completing meshing part of the
model, than quality check is performed to check the quality of
elements because result quality is directly proportional to
element quality. Different quality parameters like skew,
aspect ratio, collapse, included angles; jacobian, stretch etc.
are the measures of how far a given element deviates from
ideal shape.
RBE2 elements are used to distribute the forces and moment
equally among all the connected nodesirrespective of forces
and moment application.
RBE3 elements are used to transmit torque to a body.
Figure 2: RBE3 and RBE2 Element
3.4 Material, component, and property
collector
In material collector we assign the material to the component
we created in component collector. There are four component
of muff coupling. While creating the material collector we
specify MAT 1 Card image to it for isotropic material.
During meshing we put different surfaces in different
component collector. For example, the muff is in muff
component collector, shaft is in shaft component collector etc.
After creating material collector we assign properties by
creating property collectors. Card image used is PSOLID. As
we create the property we assign them to the respective
component collector. For cross checking that whether the
properties are assigned or not, we can check the property
tables, in utility tab.
3.5 Loads and Boundary conditions
Here we collect or specify the forces, loads, moment, torque,
pressure, velocity etc applied ie boundary conditions.
Applying load is very crucial consideration in Analysis. In
muff coupling , we applied a torque on shaft, by creating rbe 3
element, then creating independent and dependent node and
then applying the moment on the rbe3 dependent node as
shown in figure given below.
Figure 3: Constraint applied on shaft
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4. ANALYSIS
The model created in the earlier steps is now taken up for
solution - the computer program reads the data, generate FE
model, calculates matrix entries, solves the matrix equation
and writes the data out for interpretation. The finite element
model was developed to predict the stress distribution and
displacement distribution at key, Shaft1, and shaft2 instead of
those costly and time-consuming experimental trials and
errors. This task is CPU intensive, and is often called
processing. Most of the time very little interaction from the
user is required. The analysis of muff coupling produces
different type of data files having different type of
information
After the program has evaluated the results, we have to
examine and interpret the results which in our case has been Figure 5: Displacement Contours in Shaft 2( constraint
done in Hyper-View. Hype-View gives the information and applied)
results such as: displacement contours in x, y and z direction,
resultant displacement contours, von misses stress contours.

5. RESULTS AND DISCUSSIONS

The Fig 4 shows displacement distribution in the shaft1 of
muff coupling. It is observed from the displacement contours
that displacement is decreasing towards end of the shaft. The
maximum displacement observed is 0.0081 mm at the upper
surface of the shaft1. The Fig 5 shows displacement
distribution in the shaft2 of muff coupling. The maximum
displacement observed is 0.0804 mm at the lower surface of
the shaft. The Fig 6 shows displacement distribution in the
key of muff coupling the maximum displacement observed is
0.03622 mm.
With the same Finite element model, the stresses in key Figure 6: Displacement Contours in key
,shaft1 and shaft2 is also predicted..The Fig 7 shows stress
contours of the shaft1. The maximum stress observed is 29.44
Mpa and is decreasing towards end of the shaft The Fig 8
shows stress contour of the shaft2. The maximum stress
observed is 30.31 Mpa and is also decreasing towards end of
the shaft. The Fig 9 shows stress contour of the key. The
maximum stress observed is 28.67 Mpa. The maximum stress
observed in the shaft2 is 30.31 Mpa.
To validate the analysis, the results have been compared with
the available experimental and standard results. As the
experimental results were available as shown in Table 1 for
the various component of muff coupling under a torque of
11x105 N-mm, the same FE analysis has been carried out for
the torque of 11x105N-mm. Figure 7: Stress Contours in Shaft 1( torque applied)

Figure 8: Stress Contours in Shaft 2(constraint applied)

Figure 4: Displacement Contours in Shaft 1( torque applied)

The maximum deflection observed in shaft2 is 0.08048, which also validate the FE analysis of the muff coupling. The results
is well below the experimental result for the torque of 11x10 5 of the comparison have been depicted in tabular form in table.
N-mm. The stresses and displacement comparison for key

553
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1: Experimental results

Parameters Experimental results

Torque applied 1100000 N-mm

Deflection (shaft 2) 0.023 mm
Deflection key 0.01 mm
Maximum Shear Stress 25.422 Mpa
(shaft 1)
Maximum Shear Stress 25.422 Mpa
(shaft 2)
Maximum Shear Stress 22.79 Mpa
key

Figure 9: Stress Contours in key

Table 2: Comparison of experimental and FEA results

Parameters Experimental Results FEA Results Variation

Torque applied 1100000 N-mm 1100000 N-mm Nil

Deflection (shaft 2) 0.023 mm 0.08048 mm 2.85 mm

Deflection key 0.01 mm 0.03622 mm 2.6 mm

Maximum Shear Stress 25.422 Mpa 29.44 Mpa 15.8 %

(shaft 1)
Maximum Shear Stress 25.422 Mpa 30.31 Mpa 19.22%
(shaft 2)
Maximum Shear Stress key 22.79 Mpa 28.67 Mpa 25.8 %

6. CONCLUSIONS [3] S. A. Canann, S. N. Muthukrishnan, R. K. Phillips,

From the results obtained from HYPERMESH, many
discussions have been made and it will be concluded that,
with the applied torque of 1100000 N-mm on shaft 1, there is
maximum displacement on shaft 2 is 0.0804. The maximum
shear stress under same loading condition is in shaft 2 (30.31)
than in shaft 1 (29.44) and then in key (28.67) which is
approachable to the maximum allowable stress of the given
material (plain carbon steel).The variation in FEA and
experimental results are 15.2%, 19.22% and 25.8 % for the
stress. The variation in FEA and Experimental results in
deflections are 2.85 for shaft 2 and 2.6 for key.
7. REFERENCES
[1] Adeyeri Michael Kanisuru, Adeyemi Michael Bolaji ,
Ajayi Olumuyiwa Bamidele, Abadariki Samson
Olaniran, “Computer Aided Design of Coupling”
International journal of Engineering (IJE), Vol. 5, Issue
5, November 2011.
[2] Niels L. Pedersen, “Optimization of keyway design” 2nd
International Conference on Engineering Optimization,
Lisbon, Portugal, September 2010
“Topological improvement procedures for Quadrilateral
Finite element Meshes” Engineering with Computers,
Volume 14, Issue 2, 1998
[4] Madan, M and Sujata, M and Raghavendra, K and
Bhaumik, “Failure analysis of an aeroengine
components” National Aeronautical Laboratory,
Bangalore, India. 2011
[5] S. B. Jaiswal, M. D. Pasarkar, “Failure Analysis of
Flange Coupling In Industry” International Journal of
Emerging Technology and Advanced Engineering, ISSN
2250-2459, Volume 2, Issue 5, May 2012
[6] Mahmood M Shokrieh, Davood Rezaei, “ Analysis and
Optimization of composite leaf springs, Composite
Structure, Elsevier, Volume 60, Issue 3, Pages 317-325
[7] Kenneth A. Williams, “Hub Design, Finite Element
Analysis” College of Engineering and Mineral Resources
at West Virginia Universit, 2006.
[8] Cerlinca Delia Aurora, Alaci Stelian, Rusu Ovidiu
Toader, Irimescu Luminita, Ciornei Florina Carmen
“FEA of stress concentrator effect from a rotating disk
with a keyway” Fascicle of Management and
Technological Engineering, Volume IX (XIX), 2010,
NR2.

554
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[9] R. Citarella, S. Gerbino, “BE analysis of shaft hub
couplings with polygonal profiles” Journal of Materials
Processing Technology, Volume 109, Issues 1–2,
February 2001.
[10] S. Baguet, G.Jacquenot, ”Nonlinear couplings in a gear-
shaft-bearing system” Mechanism and Machine Theory,
Volume 45, Issue 12, December 2010.
555
ISBN: 978-81-924893-0-8
[11] O. A. Zambrano, J.J. Coronado, S. A. Rodriguez,
“Failure analysis of Shaft” Case Studies in Engineering
Failure Analysis, Volume 2,Issue 1, April 2014.
[12] T.N. Shiau, K.H. Huang, F.C. Wang, W.C. Hsu,
“Dynamic response of a rotating multi-span shaft with
general boundary conditions subjected to a moving load”
Journal of Sound and Vibration, Volume 323, issue 4,
June 2005.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
EVALUATION OF SUPPLY CHAIN COLLABORATION: AN AHP
BASED APPROACH
Veepan kumar Ravi kant
Assistant Professor AssistantProfessor
(MED) (MED)
Sliet Longowal, Svnit Surat, Gujarat
Punjab ravi.kant@med.sv
kumarveepan958 nit.ac.in
@gmail.com
ABSTRACT
Supply chain collaboration (SCC) is the driving force to establish
a collaborative relationship based on truly shared goal. The need
of SC collaboration is to improve sales and/or profits of
organization, to take market share away from competitors, to
reduce organization’s SC costs, to eliminate or reduce
investments in physical assets, to transfer costs and risks to other
parties in SC, to create a more flexible and responsive supply
chain. The objective of this research is to evaluate SC
collaboration using Analytical hierarchy process (AHP) by
understanding the enablers for effective SC collaboration in the
manufacturing organizations. To build awareness of the critical
SCCEs and present an approach to make SC collaboration
effective by understanding the dynamics between various SC
Collaboration Enablers (SCCEs). The findings of the present
research work reveal that three enablers of supply chain
collaboration were statistically significant to organization
performance. The empirical results demonstrate that top
management support, common objectives and goals,
communication SC strategic planning, Advance technology,
Training Advancement and organisation compatibility for SC
collaboration are the seven main influential factors on the success
of SC collaboration project. This study used subjective judgment
and any biasing by the person who is judging the SCCEs might
influence the final result. Here, 20SCCEs have been used to
identify and rank the major SCCEs in relation to the success of
SC Collaboration in the organization. The results offer insights to
supply chain collaboration practitioners and policy makers for
computing importance weights of SCCEs, which helps to identify
and rank the important SCCEs for their needs and to reveal the
direct and indirect effects of each SCCE for achieving the
effective SC Collaboration in the organization by using AHP
approach.
KEY WORDS: Analytical hierarchy process (AHP),
Supply chain collaboration Enablers.(SCCEs)
1. INTRODUCTION
Supply chain collaboration is the driving force to establish a
collaborative relationship based on truly shared goal between the
partner organizations. The need of SC collaboration is to
improve sales and/or profits of organization, to take market
share away from competitors, to reduce organization’s supply
556
ISBN: 978-81-924893-0-8
Arvind Jayant Rakesh Malviya
Associate Professor Research Scholar (MED)
(MED) Svnit Surat, Gujarat
Sliet Longowal, rakeshmalviya.20
Punjab 07@gmail.com
arvindjayant@gm
ail.com
chain costs, to eliminate or reduce investments in physical
assets, to transfer costs and risks to other parties in supply chain,
to create a more flexible and responsive supply chains in
competitive business environment.(Hansen and Nohira, 2004).
SC collaboration has become a new imperative strategy for
organisations to create competitive advantage (Horvath, 2001;
Spekman et al., 1998). A closer relationship enables the
participating organisations to achieve cost reductions and
revenue enhancements as well as flexibility in dealing with
supply and demand uncertainties (Bowersox, 1990; Lee et al.,
1997). Hewlett-Packard (HP), for instance, initiated
collaboration with one of its major resellers (Callioni and
Billington, 2001). These collaborative efforts, which focused on
co-managed inventory by considering different levels of demand
uncertainty, enabled both parties to improve fill rate, increase
inventory turnover, and enhance sales. Similarly, Wal-Mart
collaborated in demand planning and replenishment with its
major suppliers to increase inventory turns, reduce inventory
costs, reduce storage and handling costs, and improve retail
sales (Parks, 2001).
AHP approach helps the organisation to alleviate inconsistencies
in decision making problems. This study applies fuzzy linguistic
preference relations to construct a pairwise comparison matrix.
AHPis an easy and practical way to provide a mechanism for
improving consistency in SC collaboration implementation.
Twenty SCCEs have been chosen on the basis of literature
review and the opinions of experts from industry and academia.
The main objectives of this paper are to measure the success/
failure possibility of implementing the supply chain
collaboration using AHP approach. .
2. LITERATURE REVIEW OF SC
COLLABORATION
The organizations are aware of the importance of all the SCCEs
but fall short of their practicing. Many authors have researched
and written directly on these SCCEs. The various SC literatures
have been reviewed to develop a framework for effective SC
collaboration implementation.
Toni et al. (1994) discussed about co-operation with suppliers
which may help the organizations to improve its time, costs and
quality performances in the product flow management and
design/product development. There are two areas namely
information technology and warehouse and transport
technologyin which technological advances are having a
significant impact on the opportunities for SC collaboration
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

improvement. The innovativeness and information sharing are the collaboration-enabled SC: contingency theory, the resource-
major factor for SC collaboration (Lopez and Poole, 1998; based view of the firm, the relational view of the firm, force
Fearne and Hughed, 1999). Akintoye et al. (2000) discussed that field theory, constituency-based theory, social dilemma theory,
Collaboration has been recognized as a significant process that and resource-advantage theory. The findings reveal that
holds the value creation opportunity in SC also studied about SC developing a collaboration-enabled business model is very
collaboration and management in the top the UK construction difficult. Shankar et al. (2011) proposed a methodology to
industry contractors. Sridharan and Simatupang (2004) measure the extent of collaboration between apparel retailers
discussed a benchmarking study on SC collaboration between and manufacturers in the apparel retail industry in India for
retailers and suppliers, which incorporates collaborative measuring collaboration considers variables like top
practices in information sharing, decision synchronization, and management commitment, information sharing, trust among SC
incentive alignment. An empirical study was carried out to partners, long-term relationships and risk and reward sharing
benchmark the profile of collaborative practices and operational also contributes to the literature by introducing an index for
performance. Simatupang and Sridharan (2005) proposed an measuring the extent of SC collaboration. Kant and Joshi (2012)
instrument to measure the extent of collaboration in a SC presented an approach for effective SC collaboration by
consisting of two members, suppliers and retailers. The understanding the dynamics between various SCCEs that help to
proposed model for collaboration incorporates collaborative effective SC collaboration. The research presents a hierarchy-
practices in information sharing, decision synchronization and based model and the mutual relationships among the SCCEs
incentive alignment. A collaboration index is introduced to using interpretive structural modeling. The research shows that
measure the level of collaborative practices. Collaboration index there exists a group of enablers having a high driving power and
was positively associated with operational performance. Sheu et low dependence requiring maximum attention and of strategic
al. (2006) identify the necessary SC architecture for supplier- importance while another group consists of those variables
retailer collaboration, and demonstrate how it influences SC which have high dependence and are the resultant actions.
performance. A comprehensive supplier-retailer relationship
model is developed with five specific research positions: 3. METHODOLOGY
supplier-retailer business relationship (interdependence,
intensity, trust) affects long-term orientation, supplier-retailer Supply Chain Collaboration Using AHP
business relationship affects SC architecture (information Step1. Establish pairwise comparison matrix for priority
sharing, inventory system, information technology capabilities, weighting of attributes.
coordination structure), long-term orientation affects SC The attributes considered in SC collaboration implementationare
architecture, SC architecture affects the level of supplier-retailer shown in the table below
collaboration, and supplier-retailer collaboration enhances Table 1 shows list of enablers
supplier-retailer performance. Overall, with the exception of SCCEs Enabler Name
duration, all variables are found to be critical to supplier-retailer No
collaboration. Manos et al. (2007) analysed the concept of SC SCCE1 Top management support
collaboration and to provide an overall framework that can be SCCE2 Common objectives and goals
used as a conceptual landmark for further empirical research. SCCE3 Strategic planning
The concept is explored in the context of agri-food industry and SCCE4 Communication
particularities are identified. SC collaboration concept is of SCCE5 Training Advancement
significant importance for the agri-food industry however, some SCCE6 Advance technology,
constraints arise due to the nature of industry’s products, and the SCCE7 Information sharing
SCCE8 Trust and openness
specific structure of the sector. Lorentz (2008) investigated the
SCCE9 Organizational compatibility
level of SC collaboration in an uncertain cross-border context,
SCCE10 Cooperation
and whether it improves SC performance. The moderating role SCCE11 Benefit sharing
of export experience and intensity to the collaboration- SCCE12 Decision synchronization
performance relationship is also investigated. It seems that SCCE13 Motivation and rewards
experience in cross-border SC operations does not guarantee SCCE14 Reliability
success in SC management. However, those organizations with SCCE15 Mutual help and support
large export volumes, implying frequency and leveraged SCCE16 Lead Time
resources in operations, seemed to be better able to collaborate SCCE17 Flexiblity
for successful outcomes.Sridharan and Simatupang (2008) SCCE18 Power sharing
clarified the architecture of SC collaboration and to propose a SCCE19 Innovativeness
design for SC collaboration (DfC), which enables participating SCCE20 Customer Oriented Vision
members to create and develop key elements of the proposed
architecture. The paper offers a concept for designing the five Step2.Normalize the pairwise comparison matrix and aggregate
elements of the architecture of SC collaboration, namely the priority weight for attributes.
collaborative performance system, decision synchronization, The normalized value rij is calculated as
information sharing, incentive alignment, and innovative SC
𝑎 𝑖𝑗
processes. A case study was carried out to illustrate the rij = 𝑛 ∀𝑖, 𝑗 = 1,2 … . , 𝑛.
𝑖=1 𝑎 𝑖𝑗
applicability of the framework. Fawcett et al. (2010) addressed
Meanwhile, the aggregated priority weight of attribute Wi is
how organizations mitigate existing forces to achieve the
collaboration enabled SC. Seven key theories were used to 1 𝑛
provide insight into the theoretical framework for the creation of Wi =
𝑛 𝑗 =1 𝑎𝑖𝑗 ∀𝑖, 𝑗 = 1,2, … 𝑛

557
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Where Wi denotes the aggregated weight of attribute i, and K i

Where Wi denotes the priority weight of attribute (i) and n represents the priority weight of possible outcome Ak with
represents the number of the attributes. respect to attribute i.
Table 2 Degree of preferences between two attributes The consistency ratio (C.R) for a comparison is calculated to
Preferences Preferences number determine the acceptance of the attribute priority weights. it is
to be assigned given by
Equally important /preferred 1 Consistent ratio(C.R) = Consistency index / random index.

Problem solving using AHP for supply chain collaboration

Weakly more important/preferred 3 implementation.
Step1. Establish pairwise comparison matrix for priority
strongly more important/preferred 5 weighting of attributes (See TABLE 3 in appendix)
Step2.Normalize the pairwise comparison matrix and aggregate
the priority weight for attributes(See TABLE 4in appendix)
Very strongly more important 7 Step3. Derivation of the eigenvector and maximum eigen value.
Maximum eigen value is 21.818
Absolutely more important /preferred 9 Step4. Derive the consistency index and consistency ratio.
(CI) = (ƛmax –n)/ (n-1) = (21.818- 20)/19= 0.09568 hence in our
consistency is acceptable
Intermediate values used to present 2,4,6,8 Where CI is consistent index, ƛmax is the maximum value of
compromise eigen value ., n is the number of variable
Consistency ratio (CR) = CI/RI
Random index (RI ) For variable more than eight the random
index is computed using empirical formula given by
Step3. Derivation of the eigenvector and maximum eigen value. 𝑅𝐼 𝑛 = −0.021𝑛2 + 0.1183 𝑛 − 0.001
The eigenvector represents the relative importance among the Where n is the order of the matrixes / variable considered in this
elements. Maximum eigenvalue (ƛmax) can be used to determine SC Collaboration implementation
the strength of consistency among comparisons. Step5.Establish a pairwise comparison matrix for weighting
Step4. Derive the consistency index and consistency ratio. alternatives with respect to attributes.

Table 5 (b) Normalized -matrix of priority weight for

possible outcome in attribute SCCE2 Table 5(a) Paired comparison matrices for possible
outcome in attribute SCCE2
Success Failure Success Failure
SCCE 2 Success 1 3
SCCE 2 Success 0.75188 0.75 Failure 0.33 1
Failure 0.24812 0.25 TOTAL 1.33 4
If matrix A is a consistent matrix, the maximum eigen value of
A should equal its number of orders. Therefore, the consistency Summary of Possible Outcome with Respect to Each
index(CI) = (ƛmax –n)/ n-1 and consistency ratio (CR) = CI/RI can attribute(See TABLE 6 in appendix)
be used to assess the degree of consistency. If the consistency Step6. Priority weight for prediction. (SeeTABLE 7 in
index < 0.1, then there is a satisfactory level of consistency. In appendix)
addition, if the consistency ratio < 0.1, then the evaluation matrix The prediction weights for Successful of SC Collaboration
is acceptable. In this case, CI is 0.09568. implementation = 0.635
Step5. Establish a pairwise comparison matrix for weighting Similarily, The prediction weights for Failure of SC
alternatives with respect to attributes. Collaboration implementation = 0.365
Yusuff et al. (2001) noted that the priority weights for Table 8 illustrates the Rank of enablers of SC Collaboration
alternatives are measured to show the preference of alternatives according to priority weight.(SeeTABLE 8 in appendix)
with respect to attributes. Restated, a stronger alternative
preference indicates that the alternative in question is more
likely to be successful. Five options, Extremely good (5), Good
4. DISCUSSIONS
1. The ranks and priority weights obtained.
(3), Fair (1), Weak (1/3) and Poor (1/5) are provided to illustrate
2. The pairwise comparison times of the priority weight for
the change of success given different alternatives. The larger
possible outcome according to the twenty attributes are done.
rating of an alternative indicates a higher chance of success.
3. The chances of successful and failure SSC implementation
Step6. Priority weight for prediction.
produced by AHP (0.635/0.365)
The prediction weight is computed by multiplying the priority
4. The AHP method performs complicated mathematical
weights of the attributes and the evaluation ratings of the
operations to obtain indicators: for example eigenvector,
alternatives.
maximum eigenvalue, consistency index and consistency ratio,
The prediction weight Ck is then obtained as
to ensure the consistency of a preference matrix.
Ck = ni=1 wi k i
5 All the enablers are ranked according to the priority weights.

558
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5. CONCLUSION
In the present work, AHP Approach has been used in the SC
Collaboration implementation to obtain possibility of success/
failure implementation in SC collaboration and obtain the
prediction weights for success and failure of attribute. After that
we obtained consistency index for both the methods.The
conventional AHP method uses reciprocal multiplicative
preference relation with an interval scale [1/9, 9] to establish a
pairwise comparison matrix based on a set of n (n-1)/2
preference ratios. The principal eigenvector, maximum
eigenvalue, consistency index and consistency ratio then are
calculated for assessing the consistency in a preference relation
matrix. Consequently, paired comparison of the alternatives with
respect to each attribute can be used to obtain the overall
ranking of the feasible alternatives. Future studies will focus on
the generalized analytic hierarchy process problems in linguistic
terms without exporting the reciprocal additive transitivity
property to reciprocal multiplicative decision models. The
empirical results demonstrate that top management support,
common objectives and goals, communication SC strategic
planning, Advance technology, Training Advancement and
organization compatibility for SC collaboration are the seven
main influential factors on the success of SC collaboration
project.Here, 20SCCEs have been used to identify and rank the
important SCCEs for their needs and to reveal the direct and
indirect effects of each SCCE for achieving the effective SC
Collaboration in the organization by using AHP approach.
REFERENCES
1. Chang, T. H and Wang, T.C. 2009 ‘Measuring the success
possibility of implementing advanced manufacturing
technology by utilizing the consistent fuzzy preference
relations,’ Expert Systems with Applications, Vol.36, No.3,
pp .4313–4320.
2. Bowersox, D.J. 1990 ‘The strategic benefits of logistics
alliances,’ Harvard Business Review, Vol. 68, No. 4, pp.
36-43.
3. Lee, H.L., Padmanabhan, V. and Whang, S. 1997 ‘The
bullwhip effect in supply chains,’ Sloan Management
Review, Vol. 38 No. 3, pp. 93-102.
4. Spekman, R.E., Kamauff, J.W. and Myhr, N. 1998 ‘An
empirical investigation into supply chain management”,
International Journal of Physical Distribution and Logistics
Management, Vol. 28, No. 8, pp. 630-50.
5. Horvath, L. 2001 ‘Collaboration: key to value creation in
supply chain management’, Supply Chain Management: An
International Journal, Vol. 6 No. 5, pp. 205-7.
559
ISBN: 978-81-924893-0-8
6. Hansen, M. T and Nohria, N. 2004 ‘How to build the
collaborative advantage’, slogan management review.
7. Parks, L. 2001 ‘Wal-Mart gets on board early with
collaborative planning’, Drug Store News, Vol. 23, No. 2,
pp. 14.
8. De Toni, A., Nassimbeni, G and Tonchia, S. 1994 ‘New
trend in the supply management’, Logistics Information
Management, Vol. 7, No.4, pp.41–50.
9. Fearne, A and Hughes, D. 1999 ‘Success factors in the
Fresh Produce Supply Chain: insights from the UK’,
Supply Chain Management, Vol. 4, No. 3, pp. 120-128.
10. Akintoye, A., McIntosh. G and Fitzgerald. E. 2000 ‘A
survey of supply chain collaboration and management in
the UK construction industry’, European Journal of
Purchasing and Supply Management, Vol. 6, pp. 159-168.
11. Simatupang, T and Sridharan, R. 2005 ‘The collaborative
supply chain’, International Journal of Logistics
Management, Vol. 13 No. 1, pp. 15-30.
12. Simatupang, T and Sridharan, R. 2004 ‘A benchmarking
scheme for supply chain collaboration’, An International
Journal, Vol.11, pp.9-30.
13. Matopoulos, A., Vlachopoulou, M., Manthou .V and
Manos, B. 2007 ‘A conceptual framework for supply chain
collaboration: empirical evidence from the agri-food
industry’, Supply Chain Management: An International
Journal, Vol. 12, No. 3, pp.177 – 186.
14. Lorentz, H. 2008 ‘Collaboration in Finnish-Russian supply
chains: Effects on performance and the role of experience’,
Baltic Journal of Management, Vol. 3, No. 3, pp.246 – 265.
15. Simatupang, T. and Sridharan, R. 2008 ‘Design for supply
chain collaboration’, Business Process Management
Journal Vol. 14, No.3, pp.401 – 418.
16. Fawcett, S., Magnan, G and Fawcett, M. 2010 ‘Mitigating
resisting forces to achieve the collaboration-enabled supply
chain’, Benchmarking: An International Journal, Vol. 17,
No. 2, pp.269 – 293.
17. Anbanandam, R., Banwet, D and Shankar, R. 2011
‘Evaluation of supply chain collaboration: a case of apparel
retail industry in India’, International Journal of
Productivity and Performance Management, Vol. 60, No. 2,
pp. 82-98.
18. Joshi, K. and Kant, R. 2012, ‘Structuring the underlying
relations among the enablers of supply chain collaboration’,
International journal of Collaborative Enterprise, Vol. 3,
No. 1, pp.38–59.
19. Sheu, C., Yen, H.R and Chae, B. 2006 ‘Determinants of
supplier retailer collaboration evidence from an
international study’, International journal of operations and
production management, Vol. 26, No.1, pp.24-29.
20. Herrera–Viedma, E., Herrera, F., Chiclana, F and Luque,
M. 2004 ‘Some issues on consistency of fuzzy preference
relations’, European Journal of Operational Research,
Vol.154, pp.98–109.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Impact of Pinch Strengths on Healthy and Non-Healthy
Workers in Manufacturing Unit
Ahsan Moazzam
Department of ME
Sant Longowal Institute of Engineering and
Technology
Sangrur,Punjab
ahsansliet10@gmail.com
ABSTRACT
The study is conducted on 90 workers comprising of all men.
This paper is focused on studying the impact of pinch
strengths on health workers and non-health workers of
manufacturing industries. This is done by appropriate health
surveillance by using Correlation analysis and difference
between proportion test on different type of pinch strengths.
Fisher‟s test is performed to check the significance of
potential carpal tunnel syndrome (CTS) suffers from the data.
Keywords
Pinch strength, CTS, health surveillance, Fisher‟s test, healthy
workers, non-healthy workers
1. INTRODUCTION
1.1 Repetitive Strain Injury
Repetitive Strain Injury (RSI) is a generic term and often used
to describe work-related musculoskeletal disorders. RSI is an
umbrella term used to describe a number of specific
musculoskeletal conditions, i.e. CTS, as well as „diffuse RSI‟,
which is more difficult to define. These conditions are often
occupational in origin. RSI is the more commonly known
term for a set of disorders called Work Related Upper Limb
Disorders (WRULD‟S). The highest percentage of work
injuries resulting from repetitive motion occurs in the
manufacturing sector, where assembly-line works are
common. RSI‟s must be treated at an early stage or a
permanent disability could be caused which can cause a loss
in term of compensation, productivity and number of working
hours/days. Signs and symptoms vary, depending on type of
jobs and which part of the body is affected. Initially,
symptoms may only occur when the individual is doing the
repetitive task - they will slowly go away when the person
rests. RSI is caused, by continuous repetitive and forceful
work, hand or arm movements, and i.e. hammering pushing,
pulling, lifting or reaching movements, too fast or extreme
workloads, long hours, lack of variety or breaks, awkward
grips or positions, imperfectly designed equipment and/or
poor working environments.
1.2 Carpal tunnel Syndrome
Carpus is a word derived from the Greek word karpos, which
means "wrist." The wrist is surrounded by a band of fibrous
tissue that normally functions as a support for the joint. The
tight space between this fibrous band and the wrist bone is
called the carpal tunnel. The median nerve passes through the
carpal tunnel to receive sensations from the thumb, index, and
middle fingers of the hand. Any condition that causes swelling
or a change in position of the tissue within the carpal tunnel
can squeeze and irritate the median nerve. Irritation of the
median nerve in this manner causes tingling and numbness of
the thumb, index, and the middle fingers a condition known as
560
ISBN: 978-81-924893-0-8
Manoj Kumar
Department of ME
Sant Longowal Institute of Engineering and
Technology
Sangrur,Punjab
manojsliet5@gmail.com
“carpal tunnel syndrome”. Risk factors for CTS can be
classified into three broad categories: occupational, personal,
and psychosocial. Occupational risk factors are factors
associated with the interaction of the worker with the physical
work environment. These factors have been the focus of many
studies relating to CTS. The primary occupational risk factors
of CTS include repetition, forceful hand exertions, and
deviated wrist postures, lack of rest and recovery, and
vibration.
1.3 Development of CTS
Bending the wrist or moving the fingers brings muscles and
tendons into action. For example, when a person bends a
finger the tendon moves about two inches. The tendons of the
hand are encased in sheaths, or sleeves, through which the
tendons slide. The inner wall of the sheaths contains cells that
produce a slippery fluid to lubricate the tendons. Lubrication
is essential for the normal and smooth functioning of the
tendons. With repetitive or excessive movement of the hand,
the lubrication system may malfunction. It may not produce
enough fluid or it may produce a fluid with poor lubricating
qualities. Failure of the lubricating system creates friction
between the tendon and its sheath causing inflammation and
swelling of the tendon area. In turn, the swelling squeezes the
median nerve in the wrist or carpal tunnel. Repeated episodes
of inflammation cause fibrous tissue to form. The fibrous
tissue thickens the tendon sheath, and hinders tendon
movement. A common factor in developing carpal tunnel
symptoms is increased hand use or activity. Persons with
diabetes or other metabolic disorders that directly affect the
body's nerves and make them more susceptible to
compression are also at high risk. It is estimated that three of
every 10,000 workers loses time from work because of CTS.
Half of these workers missed more than 10 days of work.
1.4 Symptoms of Carpal Tunnel Syndrome
The typical symptoms of CTS are tingling of the thumb, and
of the index, middle, and ring fingers, and night pain. The
pain awakens the patient, but is often relieved by shaking,
hanging, or massaging the hand. Pain may involve not only
the hand, but also the arm and the shoulder. Numbness and
loss of manual dexterity occur in more advanced cases.
Weakness of the hand also occurs, causing difficulty with
pinch and grasp. The victim may drop objects or be unable to
use keys or count change with the affected hand. The skin
may dry because of reduced sweating.
2. EXPERIMENTATION
As many industries rely on repetitive and forceful work for
successful completion of a task, it is impossible for any
industry that this repetitive and forceful work would be
wholly eliminate from a work process. This work does
however require the adoption of awkward postures. Awkward
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

postures in this work increase the likelihood that workers are
exposed to physical strain, which in turn create risk (potential
CTS symptoms) to workers in the form of potential CTS
symptoms. Therefore, the present study focuses the
identification of risk factors such as hand pain, wrist pain,
numbness, tingling, weakness, difficulty in grasping, age,
BMI, Cycle time and many more on workers. Present study
sample consists of 90 manual manufacturing workers in
manufacturing industry. Health questionnaire form was
designed according to the information required like age,
height, weight, duration of job, levels of potential symptoms
to study the prevalence of potential CTS symptoms amongst
manufacturing workers. Also the standardized health
surveillance guidelines were used to authenticate the design
considered in present study by experts from industry and
medical profession. Job categorization is done according to
level of repetition (per sec), force involved (kg), BMI (kg/m2)
of the workers. The participants ranged in age from 24 to 60
years with a mean of 47.9 (SD 9.15) years (Table.1).
The mean body mass index (BMI; kg/m2) of the participants
of this study was 24.6kg/m2 (SD3.72), and it ranged from
17.2 kg/m2 to 37.9 kg/m2. The workers had been performing
work for a mean of 24.6 years (SD 8.2).
Table 1. Baseline characteristics of workers
Factor of concern Statistics
Number of workers 90
Where, N= no. of observations in a single variable
r -correlation coefficient = ∑x.y/
Repetitive and pinch grip exertions are common in many
occupational activities, these Repetitive and pinch grip
exertions are impossible to eliminate from the world of work.
Studies of literature shows where pinch grip strength is being
affected by various factors such as age, sex, stature, body
weight, wrist posture, and elbow posture of the workers there
is no study which shows the relationship amongst probability
of CTS symptoms with Pinch grip strength. So, now in the
present study the relationship of pinch grip strength with
outcomes i.e. carpal tunnel syndrome symptoms. So that a
healthier work environment can be, planned, therefore the
goal of the current study was to check the relationship
between pinch grip strength of healthy and non-healthy
workers. These healthy and non-healthy workers have been
divided according to potential CTS severity symptoms. Data
from health surveillance in manufacturing industry workers is
divided into two group i.e. healthy and non-healthy workers
and mean Pinch strengths of both the group is taken shown in
Table.2. To study the correlation between healthy and non-
healthy workers a hypothesis is assumed “that the healthy
worker have more Pinch strengths than that of non-healthy
workers”.
Table 2. Data of pinch strength of healthy and non-healthy
workers

Age(years) 47.9 ± 9.15 Palmar

Workers Tip pinch Key pinch
pinch
Weight(kg) 67.5 ± 9.29 Healthy
13.88 17.47 18.26
workers (X
Height(feet) 5.625 ± 0.219 Non-Healthy
13.59 17.12 17.10
workers (Y)
BMI(kg/m2) 23.1 ± 3.72
Employment time at present
24.6 ± 8.12 The values of ∑X2, ∑Y2 and ∑X.Y are calculated from Table
site(years)
3.11 by using equation (17) to get the correlation coefficient
(r).Corresponding values of ∑X2, ∑Y2 and ∑X.Y has been
shown in Table.3
2.1 Analysis of Pinch Strength of healthy
Table 3. Calculated corresponding values of dependent
and non-healthy workers using correlation and independent variables
analysis
Correlation is often used as descriptive tool in non- X Y X2 Y2 XY
experimental research. Two measures are correlated if they 13.88
have something in common. The intensity of the correlation is 13.59 192.65 184.68 188.62
expressed by a number called the coefficient of correlation, 17.47 17.12 305.20 293.09 299.08
which is usually denoted by the letter (r).
18.26 17.10 333.42 292.41 312.24
Correlation coefficient („t‟ test) is used to check the statistical
2 2
significance of correlation which can be calculated from the ∑X ∑Y= ∑X =8 ∑Y = ∑XY
following equation (Gupta S. P., 2001).To test the hypothesis =49.61 47.81 31.24 770.19 =799.96

Ho: ρ = 0
Ho: ρ ≠ 0 Correlation coefficient (r) = ∑x.y/ √("∑x2.∑y2" ) = 799.96/
√(831.28 x 770.19) = 0.999
The appropriate test statistic for this hypothesis is
Significance test„t‟ value is obtained by putting correlation
t=r / coefficient (r) in equation (16).

Which follows the t distribution with n – 2degrees of freedom
if Ho: ρ = 0 is true.
Therefore we would reject the null hypothesis if │to│> t α/2, n-2
t = r √(N-2)/√(1-(r)2 ) = 0.997√(3-2)/ √(1-(0.999)2 ) = 22.30
Standard value of significance test„t‟ for degree of freedom 1,
at 5% level is equal to 6.314. Since calculated value of t
(22.30) is more than standard value (6.314) which is more

561
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
than the calculated value, so the hypothesis is accepted. It
concludes that healthy worker have more Pinch strength than
that of non – healthy workers.
2.2 Analysis of Pinch strengths using test of
difference between proportions
In locomotive manufacturing industry manual activities which
needs repetitive and forceful work. Due to this repetitive and
forceful work, gripping strength of the worker decreases
because of wrist pain, hand pain, numbness, difficulty in
grasping In fact which is a sign of development of potential
CTS symptoms. In the present case study it has been observed
that repetitive and forceful activities like thread making, glass
fits, nut tightening, dial making and repairing involves the use
of different pinches namely key, tip and palmer pinch. Now to
find that there is a significant difference between pinch
strength i.e. tip, key and palmer pinch of healthy and non-
healthy worker. Difference between the proportion tests is
used. Difference between the proportion test is applied if
two samples are drawn from same/ different populations, we
may be interested in finding out whether the difference
between the proportion of data is significant or not. It is
observed that Pinch strength is a major symptom to decide the
probability of CTS sufferers. Pinch strength of the worker
were taken in neutral position i.e. Tip pinch, Key pinch, and
Palmar pinch. And it is divided into two group i.e. from 0-7
kg and >7 kg.
To test that whether the data reveal a significant difference
between two range, so far as a proportion of CTS sufferers is
concerned, following hypothesis is assumed:-
Every hypothesis test requires the analyst to state a null
hypothesis and an alternative hypothesis. The Table.4 below
shows three sets of hypotheses. Each makes a statement about
the difference d between two population proportions, P1 and
P2.
Table 4. Three sets of hypotheses for differences between
proportion tests
Null Alternative Number of
Set
hypothesis hypothesis tails
1 P1 - P2 = 0 P1 - P2 ≠ 0 2 Difference /S.E. = 0.26/0.118 = 2.20
2 P1 - P2 > 0 P1 - P2 < 0 1 1 Since the difference is less than 2.58 S.E. at 1% level of
3 P1 - P2 < 0 P1 - P2 > 0 1 1
“There is significant difference between the proportions of
CTS sufferers in two groups i.e.(i) From 0-7 kg range and (ii)
>7 kg”.
The standard error of the difference between proportions is
given by
S.E. (P1 –P2) = √ (p*q {(1/n1) + (1/n2)})
And the pooled estimate of the actual proportion in the
population is given by
p = ((x1 + x2) / (n1 + n2))
Where,
P1 = Proportion of successes in one sample.
P2 =Proportion of successes in second sample.
n1 = First sample size.
562
ISBN: 978-81-924893-0-8
n2 = Second sample size.
q =1-p.
x1 = Number of occurrences in first sample.
x2 = Number of occurrences in second sample.
The test procedure is appropriate when the following
conditions are met:
i. The sampling method for each population is simple
random sampling.
ii. The samples are independent.
iii. Each sample includes at least 10 successes and 10
failures. (Some texts say that 5 successes and 5
failures are enough.)
Calculated value and observed value relationship indicates
that whether the difference between data taken of the samples
is significant or not , if the difference is less than Calculated
value at 1% level of significance, then the hypothesis is
accepted and if the difference is more than Calculated value at
1% level of significance, then the hypothesis is rejected.
2.3 Tip pinch
Tip pinch, also called pinch grip, a grasp in which the tip of
the thumb is pressed against any or each of the tips of the
other. In this study, Pinch between digit 2 i.e. the tips of the
index finger and the thumb is taken. To find the relationship
amongst Tip pinch with CTS sufferers raw data has been
classified in two categories i.e. (i) From 0-7 range and (ii) >7
with number of potential CTS sufferers.
n1 = 68, p1=x1/n1=30 / 68=0.441
n2 = 22, p2 = x2 / n2 =04/22 = 0.181
p = ((x1 + x2) / (n1 + n2) = ((30 + 04)/(68+ 22)) =46/90=0.377
q= (1-p) = (1-0.377) =0.62
S.E. (p1 –p2) = √ (0.377*0.623 {(1/68) + (1/22)}) = 0.118
(p1 –p2) = 0.441 -0.181 =0.26
significance, the hypothesis is accepted.
2.4 Key pinch
Key pinch, a grasp in which the thumb is opposed to the
middle phalanx of the index finger also called lateral pinch
fingers. To find the relationship amongst Key pinch with CTS
sufferer‟s raw data has been classified in two categories
(i)From 0-7 range and (ii) >7 with number of potential CTS
sufferers.
n1=28, p1=x1/n1=15/28=0.535
n2 = 62, p2 = x2 / n2 =38/62 = 0.441
p= ((x1 + x2)/ (n1 + n2)) = ((15 + 19) / (28+ 62))= 34/90=0.377
q= (1-p) = (10.377)=0.623
S.E. (p1p2) = √ (0.377*0.623{(1/28) +1/62)}) 0.110
(p1–p2) = 0.535 -0.441 =0.94
Difference /S.E. = 0.94/.110 = 0.85
Since the difference is less than 2.58 S.E. at 1% level of
significance, the hypothesis is accepted.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2.5 Palmar pinch
Palmar pinch a Pinch between the pad of the thumb and the
pads of the index and middle fingers shown in Figure 3.2. To
find the relationship amongst Palmar pinch with CTS
sufferers raw data has been classified in two categories
(i)From 0-7 range and (ii) >7 with number of potential CTS
sufferers.
n1= 23, p1 = x1 / n1 = 14/23 = 0.508
n2 = 67, p2 = x2 / n2 =20/67 = 0.298
p= ((x1 + x2) / (n1 + n2)) = ((14 + 20 / (23+ 67)) =34/90=0.377
q = (1-p) = (1-0.377) = 0.623
S.E. (p1 –p2) = √ (0.544*0.455 {(1/23) + (1/67)}) = 0.126
(p1 –p2)= 0.580 -0.298 =0.31
Difference/S.E.=0.31/0.102=0.18
Since the difference is less than 2.58 S.E. at 1% level of
significance, the hypothesis is accepted.
Where the number of observations obtained for analysis is
small (sample size ≤ 30).
2.7 Impact of Pinch strengths on
probability of CTS symptoms using
Fisher’s Exact Test
It is observed that Pinch strength is a major symptom to
decide the probability of CTS sufferers. Pinch strength of the
worker were taken in neutral position i.e. Tip pinch, Key
pinch, and Palmar pinch. And it is divided into two group i.e.
from 0-7(Group 1) and >7(Group 2) and probability of having
CTS. To test the probability of having CTS is more amongst
Group 1 as compared to Group 2, a hypothesis is taken that
the probability of having CTS is more amongst Group 2
workers as compared to Group 1. Now all the data has been
categorized, operation wise according to the Group and
probability of having CTS as shown in Table.6 for Tip Pinch,
Table.7 for Key pinch, Table.8 for Palmar pinch.
Table.6 Survey based CTS data in Tip Pinch

In all the three cases i.e. Tip pinch, Key pinch, and palmar Tota
Tip Pinch Group 1 (0>7)kg Group 2 (>7)kg
pinch, hypothesis is accepted. Hence, the data revealed a l
significance difference between two levels i.e. 0-7 and >7 so Potential
far as a proportion of CTS suffers is concern. This indicate CTS 30 4 34
that workers with pinch strength up to 7 i.e. lesser pinch Sufferers
strengths workers are more prone to potential CTS symptoms No CTS 38 18 56
which may be due to reduced gripping strength because of
median nerve problems i.e. median nerve compression, Total 68 22 90
swelling ,Tenosynovitis, Epicondylitis or „tennis elbow‟ and
Dupuytren‟s contracture problems due to repetitive and
forceful work. Table.7 Survey based CTS data in Key Pinch
2.6 Fisher’s Exact Test Tota
The Fisher‟s exact test is used to check statistical significance Tip Pinch Group 1 Group 2
l
by (2 × 2) contingency table. In present study Fisher‟s test has Potential
been used to check the significance of potential CTS sufferers CTS 16 18 34
from the collected data for comparison of CTS probability Sufferers
with two levels of pinch strengths i.e. 0-7 and >7 For this,
No CTS 12 44 56
notations a, b, c and d are assigned to cells for fisher‟s exact
test whereas n is assigned to total number of assembly line Total 28 62 90
workers in each operation The test is performed on categorical
data by classifying situation in two different ways as shown in
table.5
Table.8 Survey based CTS data in Palmar Pinch
Table 5. A (2 x 2) contingency table set-up used for
Fisher’s exact test Tota
Tip Pinch Group 1 Group 2
l
Level Potential
Description Level 2 Total
1 CTS 14 20 34
Symptom Sufferers
Present (Test a b a+b No CTS 9 47 56
positive)
Symptom not Total 23 67 90
Present (Test c d c+d
negative)
Totals a+c b+d a + b + c + d= n The significant values of potential CTS sufferers amongst
Group 1 i.e. pinch Strength between 0-7 and Group 2 i.e.
The probability value p is computed by the hyper geometric pinch Strength >7 workers in various operations of assembly
distribution and expressed line have been evaluated and are shown in Table.9

Table.9 Significant values of potential CTS sufferers

amongst Group-1 and Group Strength >7 of
workers through Fisher’s Exact Test
Pinch
Tip pinch Key pinch Palm pinch
Strength

563
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Group - 1 [2] A. Rainoldi, M. Gazzoni , R. Casale “Surface EMG

CTS 30 16 14 signal alterations in Carpal Tunnel syndrome: a pilot
Sufferer study” Eur J Appl Physiol , 103, 2008,233–242
% 44.1 57.1 60.8 [3] Aoife Finneran, Leonard O‟Sullivan, “Force, posture and
Group – 2 repetition induced discomfort as a mediator in self-paced
CTS 4 18 20 cycle time” International Journal of Industrial
Sufferer Ergonomics 40, 2010, 257–266
% 19.0 29.0 29.8 [4] Basmajian JV, De Luca CJ (1985) Muscles Alive. Their
Function Revealed by Electromyography. Williams &
p – value 0.0421 0.0108 0.0123 Wilkens, Baltimore.
Significant Significant Significant [5] Barnhart Scott, Demers A Paul, Miller Mary, Longstreth
Significance WT, Rosenstock, Linda “Carpal tunnel syndrome among
(P<0.05) (P<0.05) (P<0.05) ski manufacturing workers”, Scand J Work Environ
Health 1991;17:46-52
[6] Berlin C., Ortengren R., Lamkull D., “Corporate-internal
P values are calculated through Fisher‟s exact test to find out vs. national standard – A comparison study of two
the significant values of potential CTS sufferers. A parameter ergonomics evaluation procedures used in automotive
is significant if 0.01 < P < 0.05, highly significant if P< 0.01 manufacturing”, Lars Hanson International Journal of
and not significant if P ≤ 0.05. All calculated p-values are less Industrial Ergonomics, 39 ,2009, 940–946.
than the standard value (0.05) whereas p value of trimming
shows highly significance (<0.01). As the data is significant, [7] Bonwglioli Roberta, Mattioli Stefano , Fiorentini
hypothesis is rejected. Hence, the probability of being CTS Cristiana , Graziosi Francesca, Curti Stefania, Violante
sufferer is more amongst Group 1 i.e. having lesser pinch [8] Jo Geere, Rachel Chester, Swati Kale and Christina
strengths, which may be due to reduced gripping strength Jerosch-Herold “Power grip, pinch grip, manual muscle
because of median nerve problems i.e. median nerve testing or thenar atrophy which should be assessed as a
compression, swelling and other problem due to repetitive and motor outcome after carpal tunnel decompression? A
force full work. systematic review” BMC Musculoskeletal Disorders8,
2007, 114-118.
3. CONCLUSIONS
In this present work effect of Repetitive hand movements and [9] Geere Jo , Chester Rachel , Kale Swati and Herold
forceful work has been studied on human body in terms of Jerosch Christina “Power grip, pinch grip, manual
potential CTS symptoms. Fisher‟s test, difference between muscle testing or thenar atrophy – which should be
proportion, Correlation analysis and electromyogram signal assessed as a motor outcome after carpal tunnel
analysis were used to achieve the objectives. decompression? A systematic review” BMC
Musculoskeletal Disorders 2007, 8:114.
Following conclusions have been made from this dissertation:
[10] Giersiepen Klaus, and Spallek Michael, “Carpal Tunnel
i. Correlation analysis shows that healthy workers Syndrome as an Occupational Disease” Dtsch Arztebl
have more pinch strengths than that of non-healthy Int. 2011 Apr;108(14):238-42
workers.
[11] Eleftheriou Andreas, Rachiotis George, and
ii. Difference between proportion test is used on all the Hadjichristodoulou Christos “Cumulative keyboard
three type of pinch strength i.e. Tip pinch ,key pinch strokes: a possible risk factor for carpal tunnel
and palmer which reveals that workers with low syndrome” J Occup Med Toxicol. 2012 Aug 2;7(1):16
pinch strength have more probability of potential
CTS symptoms than that of the workers with high [12] Dong H. , Loomer P. , Barr A. , LaRoche C. , Young ED,
pinch strengths. Rempel D. “The effect of tool handle shape on hand
muscle load and pinch force in a simulated dental scaling
iii. Fisher‟s exact test is also shows the same task” Applied Ergonomics 38 (2007) 525–531
result which authenticate the result as [13] François Gauthier , Dominique Gélinas , Pierre Marcotte
discussed above. “Vibration of portable orbital sanders and its impact on
the development of work-related musculoskeletal
REFERENCES disorders in the furniture industry” Computers &
[1] Ajimotokan H. A, “The Effects Of Coupling Repetitive Industrial Engineering 62 ,2012, 762–769
Motion Tasks With A Manually-Stressed Work [14] Jantree C, Bunterngchit Y, TapechumS, Vijitpornk V,
Environment”, Researcher,1(2),2009,37-40 “An Experimental Investigation on Occupation Factors
Affecting Carpal Tunnel Syndrome in Manufacturing
Industry Works ” AIJSTPME 3(1),2010, 47-53

564
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Evaluation of Total Productive Maintenance Towards
Manufacturing Performance: A Review
Jagvir Singh Harmeet Singh
Deptt. of Industrial Engg. A.P., Deptt. of Mech. Engg.
Guru Nanak Dev Engg. College, Guru Nanak Dev Engg. College,
Ludhiana, Punjab Ludhiana, Punjab
Jagvirpannu85@gmail.com harmeetpawar@gmail.com
ABSTRACT
The importance of maintenance has been emphasized
especially in the manufacturing environment. The failure of
equipments or machines to produce products on time as
required can reflect the inefficiency in operations thus, failure
to deliver the products to the customers. In order to achieve
world-class performance, more and more companies are
replacing their reactive, fire-fighting strategies for
maintenance with proactive strategies like preventive and
predictive maintenance and aggressive strategies like total
productive maintenance (TPM). While these newer
maintenance strategies require increased commitments to
training, resources and integration, they also promise to
improve performance. Companies which seek to improve
competitiveness must infuse quality and improvement
measures in all aspects of their operations. This principle led
to complete overhaul of maintenance practices in
manufacturing plants. Maintenance managers view the
consistent production of quality goods as greatly dependent on
the quality of operations rendered by the necessary machinery.
The TPM approach helps increase uptime of equipment,
reduces machinery set-up time, enhances quality, and lowers
costs. Through this approach, maintenance becomes an
integral part of the team. The purpose of this study is to
examine the relationship between Total Productive
Maintenance (TPM) practices which are management
commitment, information system focus, autonomous
maintenance, 5S activities, employee training, employee
involvement and planned maintenance with performance
improvements. A total of 45 manufacturing industries in
Northern region of India were selected for the filling of
questionnaire. However, only 15 questionnaires were returned
and usable for analysis. The correlation and multiple
regression analysis findings indicated that TPM practices
except employee involvement have a significant impact on the
performance improvements in terms of cost reduction, quality
improvements, delivery compliance and flexibility
enhancements.
Keywords—Total Productive Maintenance (TPM),
Autonomous aintenance.
1. INTRODUCTION
Huang et al. (2003) [1] highlight that in today‟s era of global
recession and competition it is basic business requirement to
supply quality products at competitive prices through reducing
manufacturing expenses which is only possible by improving
manufacturing performance. This increased global
competition forcing companies to improve and optimize their
productivity in order to remain competitive. Vashisth and
Kumar (2011) [2] described that the output of the production
565
ISBN: 978-81-924893-0-8
Gopal K. Dixit
Associate Prof. in Mech. Engg.
Bhai Gurdas Inst. Of Engg. & Tech
Ludhiana, Punjab
gopalkdixit@yahoo.co.in
system is the products or services delivered while the input
consists of various resources like the labour, materials, tools,
plant and equipment, and others, used for producing the
products or services. The desired production output is
achieved through high availability, which is influenced by
equipment reliability and maintainability. The reliability of
equipment is decreasing with time. That has brought the
maintenance functions into focus to improve the production
system‟s performance. Cooke (2000) [3] and Meulen et al.
(2008) [4] showed that equipment maintenance and system
reliability are important factors that affect organization‟s
ability to provide quality and timely services to customers and
to be ahead of competition. Manufacturing firms are realizing
that there is a critical need for proper maintenance of
production facilities and systems to take best use.
Maintenance function is therefore vital for sustainable
performance of any manufacturing plant. Ahuja et.al. (2006)
[5] pointed out that TPM is the proven manufacturing strategy
that has been successfully employed globally for the last three
decades, for achieving the organizational objectives of
achieving core competence in the dynamic environment.
1.1 Total Productive Maintenance (TPM)
Brah and Chong (2004) [6] addressed that Total Productive
Maintenance is a Japanese approach to maximize the
effectiveness of the facilities that used within businesses. It
not only addresses maintenance but all aspects of the
operation and installation of those facilities. It involves the
whole organization and when implemented effectively
benefits all sections of the business through improved
efficiency and better overall performance. In addition,
according to Davis (1995) [7], there are three components of
TPM:
1. Total approach: An all-embracing philosophy which
deals with all aspects of the facilities employed within all
areas of an operating company and the people who operate,
setup, and maintain them.
2. Productive action: A very pro-active approach of the
condition and operation of facilities, aimed at constantly
improving productivity and overall business performance. 3.
Maintenance: A very practical methodology for maintaining
and improving the effectiveness of facilities and the overall
integrity of production operations.
Nakajima (1989) [8] pointed out that TPM is an important
move for companies seeking world class manufacturing
status. TPM can be considered as a comprehensive
maintenance strategy. TPM focuses on a total system of
maintenance prevention, preventive maintenance, and
maintainability improvement. The aim of TPM activities is to
reinforce corporate structures by eliminating all losses through
the attainment of zero defects, zero failures, and zero
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
accidents. Of these, the attainment of zero failures is of the
greatest significance, because failures directly lead to
defective products and a lower equipment operation ratio,
which in turn becomes a major factor for accidents.
1.2 TPM Approaches
There are two main approaches found in TPM literature i.e.
Western Approach and the Japanese Approach. The Japanese
approach is promoted by Japanese Institute of Plant
Maintenance and described by Nakajima (1984) whereas,
Western approach described by Willmott (1994), Wireman
(1991) and Hartmann (1992). The Western approach is closely
tied to the Japanese approach. Willmott (1994) keeping
Japanese approach in view offered his own definition that is
based on teamwork but does not necessarily require total
employee participation, i.e. emphasis has been laid on the use
of teams to achieve specific operational targets. He further
states that the concept of TPM process is that all the assets on
which production depends are kept always in optimum
condition and available for maximum output. Hartmann
(1992) presents a similar definition to Willmott and states that
Total Productive Maintenance permanently improves the
overall effectiveness of equipment with the active
involvement of its operators. The Japanese approach
emphasizes on the role of teamwork, small group activities
and the participation of all employees in the TPM process to
achieve equipment improvement objectives hence it is more
people and process focused. While the Western approach
focuses on the equipment with understanding that operator
involvement and participation in the TPM effort is required
hence, it is focused on equipment improvement objectives.
Ames (2003) finds that the Japanese are just as focused
directly on the results as the Western approach is, and
suggests that although there is very little real difference in the
approaches, The Western definition emphasizes on results as a
marketing, or selling, tool to gain the interest of Western
managers. Similarly, the Japanese Institute of Plant
Maintenance also advocates company wide application of
TPM rather than equipment focus.
2. LITERATURE
Nakajima (1989) [8] has defined TPM as an innovative
approach to maintenance that optimizes equipment
effectiveness, eliminates breakdowns, and promotes
autonomous maintenance by operators through day-to-day
activities involving the total workforce.
McKone and Weiss (1995) [9] identify significant gaps
between industry practice and academic research and
emphasize the need to bridge these gaps by providing
guidelines for implementing TPM activities. As the goal of
the TPM program is to markedly increase productivity
without losing product quality which is the major concern of
business organizations, enormous companies of Bangladesh
are trying to adopt TPM.
Neely et al. (1995) [10] suggested performance
measurement is examined from three different levels, (1) from
566
ISBN: 978-81-924893-0-8
the individual performance measures, (2) from performance
measurement of the system and (3) relationship between the
performance measurement system and its environment also
highlighted three concepts of performance measurement,(1)
classifications of performance measures as per their financial
and non-financial perspectives, (2) positioning the
performance measures from the strategic context and (3)
support of the organizational infrastructure, like resource
allocation, work structuring, information system amongst
others. Maintenance performance measurement aligns the
strategic objective within the hierarchical levels of the whole
organization allowing the visibility of the company‟s goals
and objectives from the top management level to the middle
management at tactical level and throughout the organization.
Leblanc (1995) [11] has emphasized upon various
initiatives like predicting cost savings, integration of cross-
functional teams and effective identification equipment root
causes/problems, for reaping significant benefits from TPM
implementation programs. It has been reported that careful,
efficient planning and preparation are keys to successful
organization-wide implementation of TPM.
Maier et al. (1998) [12] have investigated the impact of
TPM initiatives on the production system and presented
benefits accrued through holistic implementation of TPM
based on data gained from the research project „World Class
Manufacturing‟. They have emphasized upon various factors
like: subjective measures (program flexibility, delivery speed,
on-time delivery, volume flexibility, quality and average unit
costs) and objective measures (cost efficiency, quality
performance, fast delivery, on-time delivery, inventory
turnover and flexibility) for assessing the contributions of
TPM initiatives on plant performance. The analysis confirmed
significant impact of TPM implementation on the
effectiveness of manufacturing system. They have concluded
that TPM is not the only factor determining a plant
performance and recommend that there is an emerging need to
investigate the inter-relations of TPM with other approaches
of continuous improvement leading to a better explanation of
manufacturing performance achievements.
McKone et al. (1999) [13] have proposed a theoretical
framework by testing the impact of contextual issues affecting
maintenance system performance of firms through systematic
TPM implementation. The study brings out clearly that TQM
and TPM programs are closely related. The study also
identifies critical dimensions of TPM and their impact on
manufacturing performance and demonstrates a strong
relationship among TPM and the contextual factors. The
research provides a better understanding of relationships
among TPM, JIT, TQM and EI for supporting the successful
implementation of TPM.
McKone (2001) [14] investigated the relationship between
Total Productive Maintenance (TPM) and manufacturing
performance (MP) through Structural Equation Modeling
(SEM) and found that TPM has a positive and significant
relationship with low cost (as measured by higher inventory
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
turns), high levels of quality (as measured by higher levels of
conformance to specifications), and strong delivery
performance (as measured by higher percentage of on-time
deliveries and by faster speeds of delivery).
Kutucuoglu et al. (2001) [15] have stated that equipment
is a major contributor to the performance and profitability of
manufacturing systems. They have classified maintenance
performance measures into five categories: equipment related
performance, task related performance, cost related
performance, immediate customer impact related
performance, and learning, growth related performance. The
study is aimed at investigation of role of performance
measurement systems (PMS) in maintenance, with particular
reference to developing a new PMS using the quality function
deployment (QFD) technique. The framework substantially
contributes to the area of maintenance management by
incorporating key features of a successful PMS, namely: goal
deployment, cross-functional structure and a balanced view of
a system.
Ireland and Dale (2001) [16] demonstrated that the
companies implemented TPM because of the business
difficulties they faced. In all three companies senior
management had supported TPM and set up suitable
organizational structures to facilitate its implementation. The
companies had followed Nakajima's seven steps of
autonomous maintenance, although different TPM pillars had
been adopted, with the common ones being improvements,
education and training, safety, and quality maintenance. The
main differences in TPM implementation related to the use of
ABC machine classification system and the role of facilitators.
Mora (2002) [17] states that implementing the Total
Productive Maintenance is not a difficult task. However, it
requires some customized training in order to succeed. The
results of implementing an effective program in terms of
increased plant efficiency and productivity are outstanding.
McBRIDE (2004) [18] suggested maintenance and
reliability as a core business strategy, and is key to a
successful TPM implementation. Without the support of top
management, TPM implementation will be failed. It is certain
that Implementing TPM using the 12 steps will leads to “zero
breakdowns” and “zero defects.”
Ming-Hong (2004) [19] suggests that to be successful, not
only support is required from top management, but also from
the head of each department. The other key factor is that each
employee must feel that they also have been benefited from
this activity. This will improve their performance. This
improved performance will reflect in their monthly bonus.
This will motivate the employee, which in turn will lead to
better progress. The design of the activity should be kept as
simple as possible.
Eti et al. (2004) [20] have explored the ways in which
Nigerian manufacturing industries have implemented TPM as
a strategy, culture for improving its performance, and
567
ISBN: 978-81-924893-0-8
suggested self-auditing and benchmarking against world-class
industries with similar product lines as desirable prerequisites
before TPM implementation. They have further reported that
Nigerian industry needs to possess a culture dealing more
effectively with rapid changes to inculcate a competitive
outlook in their manufacturing environments.
Kennedy (2005) [21] suggested that it should be
acknowledged that a TPM implementation is not a short-term
fix program. It is a continuous journey based on changing the
work-area, then the equipment so as to achieve a clean, neat,
safe workplace through a "PULL" as opposed to a "PUSH"
culture. Significant improvement can be evident within six
months, however full implementation can take many years to
allow for the full benefits of the new culture created by TPM.
Seth and Tripathi (2005) [22] have investigated strategic
implications of TQM and TPM in an Indian manufacturing
set-up. They have examined the relationship between factors
influencing implementation of TQM and TPM initiatives with
business performance, for the following three approaches in
an Indian context: TQM alone; TPM alone; both TQM and
TPM together and have also extracted significant factors for
the above three approaches. The research identifies critical
significant factors like leadership; process management and
strategic planning; equipment management and focus on
customer satisfaction, for the effective adaptation of TQM and
TPM programs in Indian manufacturing environment.
Campbell and James (2006) [23] highlighted that TPM is
a manufacturing-led initiative that emphasizes the importance
of (i) people with a „can do‟ and continual improvement
attitude and (ii) production and maintenance personnel
working together in unison. TPM combines the best features
of productive and preventive maintenance (PM) procedures
with innovative management strategies and encourages total
employee involvement.
Parida and kumar (2006) [24] viewed maintenance
performance measurement as the multidisciplinary process of
measuring and justifying the value created by maintenance
investment, and taking care of the overall business
requirements. A performance measurement system is defined
as the set of metrics used to quantify the efficiency and
effectiveness of actions.
Thun (2006) [25] has described the dynamic implications of
TPM by working out inter-relations between various pillars of
TPM to analyze fundamental structures and identified most
appropriate strategy for implementation of TPM considering
the inter-play of different pillars of this maintenance
approach. The research focuses upon analyzing the reasons
behind successful TPM implementation and identifies inter-
relations between the pillars of TPM. The research has been
conducted for analyzing the fundamental structures and
identification of strategy for successful implementation of
TPM.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Pessan (2007) [26] has proposed a multi-skill project
scheduling problem model for maintenance activities in the
organization. Preventive maintenance activities are usually
planned in advance: production is stopped and all
maintenance activities should be processed as fast as possible
in order to restart production. Moreover, these human
resources handled activities which require specific skills and
are subjected to precedence constraints. The main difference
with Multi-Skill Project Scheduling Problem is that some
activities may be submitted to disjunctive constraints due to
material constraints of the production channel. He described
how these constraints can be used to improve usual Multi-
Skill Project Scheduling Problem resolution methods.
Ramayah (2007) [27] has emphasized importance of
maintenance in the manufacturing environment. The failure of
equipments or machines to produce products on time as
required can reflect the inefficiency in operations thus, failure
to deliver the products to the customers. The objective of
TPM is to create an active participation of all employees in
maintenance and production functions, including the operators
who operate the machines and equipments. The results
suggest important aspects of autonomous maintenance and
planned maintenance activities that contributed to the
improvement in quality and cost.
Lazim (2008) [28] suggested that the importance of
maintenance has been emphasized especially in the
manufacturing environment. The failure of equipments or
machines to produce products on time as required can reflect
the inefficiency in operations thus, failure to deliver the
products to the customers. The objective of TPM is to create
an active participation of all employees in maintenance and
production functions, including the operators who operate the
machines and equipments. This paper discusses part of a
preliminary study finding focusing on two main TPM
practices namely autonomous maintenance and planned
maintenance in a Malaysian SME.
Khanna (2008) [29] has described that a large percentage of
the total cost of doing business is due to maintenance-related
activities in the organization. One approach to improve
performance of maintenance activities is to implement and
develop Total Productive Maintenance (TPM). TPM methods
and techniques had been successfully implemented in Japan
over the past three decades, and more recently in India.
Inherent within the TPM concept are the aspects of enhancing
the overall equipment effectiveness. The research shares some
of the experiences of TPM implementation in Mayur
Uniquoters, India and achievements made while adopting and
implementing TPM. It also identifies some of the difficulties
faced during implementation, relates with the concept of TPM
and proposes some solutions to eliminate them.
Paropate et. al (2011) [30] highlighted that a fundamental
component of world-class manufacturing is that of the total
productive maintenance (TPM), which has been recognized as
one of the significant operation strategy to regain the
568
ISBN: 978-81-924893-0-8
production losses due to equipment inefficiency. TPM is the
methodology that aims to increase both availability of the
existing equipment hence reducing the need for the further
capital investment. The aim of the paper is to study the
implementation of the TPM program in an Indian automobile
manufacturing industry. Through a case study of
implementing TPM in an automobile industry, the practical
aspects within and beyond basic TPM theory, difficulties in
the adoption of TPM and Problems encountered during
implementation are discuss.
Wakjira and Singh (2012) [31] have focused upon the
significant contributions of TPM implementation success
factors like top management leadership and involvement,
traditional maintenance practices and holistic TPM
implementation initiatives, towards affecting improvements in
manufacturing performance in the Ethiopian industry. The
study establishes that focused TPM implementation over a
reasonable time period can strategically contribute towards
realization of significant manufacturing performance
enhancements. The study highlights the strong potential of
TPM implementation initiatives in affecting organizational
performance improvements. The achievements of Ethiopian
manufacturing organizations through proactive TPM
initiatives have been evaluated and critical TPM success
factors identified for enhancing the effectiveness of TPM
implementation programs in the Ethiopian context.
Sharma et. al (2012) [32] demonstrated that to improve
productivity it is essential to improve the performance of the
manufacturing systems. This system consists of various
resources like labour, materials, tools, plant and equipment,
and others, used for production. The desired production output
is achieved through high equipment availability, which is
influenced by equipment reliability and maintainability.
Maintenance function is therefore vital for sustainable
performance of any manufacturing plant, since, a proper
maintenance plan improve the equipment availability and
reliability. The paper describes the maintenance (Total
Productive Maintenance) as strategy to improve
manufacturing performance. Further, 5S as the base of Total
Productive Maintenance (TPM) and overall equipment
effectiveness (OEE) as a measure of effectiveness have also
been discussed.
Badli (2012) [33] highlighted that Total Productive
Maintenance (TPM) is a systematic approach to understand
the equipment‟s function, the equipment‟s relationship to the
product quality and the likely cause of failure of the critical
equipment conditions. Introducing TPM requires strategic
planning and few studies had been made in the field of
maintenance within the context of Malaysian Small and
Medium Enterprises (SMEs) especially in automotive SMEs.
Technologically, automotive industry is the most important
and strategic industries in the Malaysian manufacturing sector
must be supported by efficient and effective equipment
management. This paper discusses the state of TPM
implementation in Malaysian automotive SMEs and
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

investigation of Critical Success Factors (CSFs) associated in

implementing TPM. A survey through questionnaires has Detailed Literature Review
been applied to this study to determine the level of TPM
practices in automotive industry. The paper systematically
categorized the TPM knowledge and understanding and
critical success factors (CSFs) in TPM implementation. Problem Identification and
Preparation of Research Plan
3. CONCEPTUAL FRAMEWORK
The conceptual framework shown in Figure 1 has been
developed on the basis of literature review and research Industry Database Questionnaire
problem. This model focuses on the relationship and influence Creation Generation
of TPM practices on performance improvements.

Questionnaire Pre-Testing and

Validation

Questionnaire Administration

Reminders, Phone Calls and

Interviews

Data Collection, Analysis of Data and

Fig. 1: Conceptual Framework Analysis of Results

In this study, there are two variables, which are independent

variables and dependent variables. The independent variables
include management commitment, information system focus,
employee involvement, and autonomous maintenance, 5S
activities, employee training and planned maintenance while
the dependent variable of this study is manufacturing
performance improvements which include cost, quality,
delivery and flexibility. It is hypothesized that there is a
significant association between the above said independent
and dependent variables.
4. QUESTIONARE DEVELOPMENT
In order to carry out the research, a survey of various medium
and large manufacturing organizations of India that have
successfully implemented TPM has been carried out through a
specially designed questionnaire to ascertain the status of
various TPM implementation factors and performance
improvements. A detailed questionnaire called, „TPM
Questionnaire‟ has been designed to seek information on the
status of various components and issues of TPM practices in
Indian manufacturing industry.
Evaluating the Relationships between TPM Input
Factors and Output Factors
Fig. 2: Research Methodology employed for the Study
5. QUESTIONNAIRE VALIDATION
AND PRE-TESTING
For effectively conducting the survey, the questionnaire has
been prepared through extensive literature review and
validated through peer review from academicians and
practitioners from the industry. To ensure the relevance and
effectiveness of the questions to the manufacturing industry,
the questionnaire has been pre-tested on a representative
sample of industry. The suggestions received from peers,
senior executives from the industries and academicians have
been incorporated to make the questionnaire more relevant to
the purpose so that it may bring out key outcomes.

6. SAMPLING AND DATA

COLLECTION
The extensive survey has been conducted for the
organizations in the country that have successfully
implemented TPM. The „TPM Questionnaire‟ was mailed to
the organizations chosen at random from the directory of CII
(Confederation of Indian Industry) who have implemented
TPM successfully, and were subsequently contacted through
personal visits and regular follow ups. A total of 15 responses

569
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
out of 45 selected industries have been received from the
manufacturing organizations with 33 percent response rate.
7. STRUCTURE OF QUESTIONNAIRES
The TPM questionnaire design is simple, easy to understand
and not required much time of the participants to answer it.
The questionnaire consists of six sections, each collecting a
specific type of information.
8. ANALYSIS OF SURVEY
In the present thesis, seven key TPM practices which includes
: Management Commitment (I1), Information System Focus
(I2), Autonomous Maintenance (I3), 5S Activities (I4),
Employee Training (I5), Employee Involvement (I6), Planned
Maintenance (I7) and four performance improvement
parameters which include: Cost Reduction (O1), Quality
Improvements (O2), Delivery Compliance (O3) and
Flexibility Enhancements (O4) have been identified as
significant for analyzing the impact of TPM practices towards
achieving performance improvements.
9. RESULTS
Pearson‟s correlations and t-test results depict that
management commitment significantly contribute towards the
realization of various performance improvement parameters.
The results show that management commitment issues
(I1) are significantly correlated (r= 0.80, p <0.05) with
the cost reduction (O1).
It means the top management can structure a proper and
strategic planning of the direction of companies to achieve its
TPM goals that aligned with business objectives. Moreover,
as much as the impact of TPM on the cost and flexibility of
the productivity output, the management might think to put
some investment for this programme such as enhancing the
personnel skills, provide suitable working environment,
training, and compensation to employees
Management commitment issues (I1) have shown
insignificant correlation (r=-0.28 and r= 0.41) with
quality (O2) and delivery (O3).
From the results it has been found that management
commitment (I1) significantly influences (r= 0.55; p<
0.05) the flexibility in processes (O4).
A positive attitude of top management correlates with
continual attention being paid to improvement opportunities
and provides employees with support for their encourageous
behavior. This in turn strongly affects the flexibility in terms
of increase in variety of tasks/jobs performed by the workers,
reduction in new product development cycle. Well motivated
workforce is able to work with specific strategies to
effectively to improve the manufacturing lead time, set-up
time and equipment flexibility.
570
ISBN: 978-81-924893-0-8
Information system focus (I2) has not shown any
significance with performance improvements.
This is because the employees are not habitual of using
information system as an effective tool. This may be because
the traditional management still has a little impact on the
situation in the plant operations.
The results highlight that ‘Autonomous Maintenance’
(I3) has not been contributing towards cost reduction
(O1), delivery compliance (O3) and flexibility
enhancements (O4) in the industry.
A significant correlation (r= 0.70; p<0.05) has been
exhibited between autonomous maintenance (I3) issues
and quality improvements (O2).
The objective of autonomous maintenance is to minimize the
machine break downs, avoid deterioration, failures, and
stoppages by operator‟s involvement in maintaining the
machine and giving freedom for decision making for the
working gives authority and monopoly feeling to operator
which leads to better quality (O2).
The results highlight that adequate 5S activities (I4)
effectively contributes towards cost reduction, O1
(r=0.55; p<0.05), quality improvement, O2(r=0.32;
p<0.05) and delivery compliance, O3(r=0.27; p< 0.05).
5S, which is the pre-step of TPM, is a systematic approach
providing the contribution of all personnel in the cleaning
regime of the company. The clean and steady environment
targeted by 5S has a positive impact on cost reduction, quality
improvement and delivery compliance.
As a result of 5S activities, a clean work environment can be
formed, increase can be provided in the work efficiency and
therefore a substructure is established for TPM. The personnel
gain collective work skill following the team activities and
they become more sensitive in terms of improvement. With
the aid of successful practices and training, many factors
causing work accidents have been removed. Through the
positive results obtained as a result of the application, the
motivation of the personnel in the joint targets has been
positively affected.
The results show a significant correlation (r=0.45;
p<0.05) between employee training (I5) and quality
improvements (O2).
Employee training directly enhances the human capital of the
firm and directly leads to the performance improvements by
raising the general level of skills. As employee becomes more
highly motivated and more highly skilled, so that their task
performance improves and quality is directly enhanced.
Employee involvement (I6) has exhibited a significant
linkage with quality, O2(r=0.41; p<0.05) and
flexibility, O4 (r=0.47; p<0.05).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

It is in concern with the objectives of TPM that requires the reduction (O1) parameter can be predicted from
total commitment and participation from employees to raising ‘management commitment’ (I1), „5S activities’(I4),
awareness about performance improvement.. „employee involvement’(I6) and ‘planned maintenance’
(I7) issues combined. The results indicate that „management
Therefore, the manufacturing companies have to create which
commitment‟ is very significant (at p<0.01) and β coefficient
will give more positive results because of their higher
(2.6464) for this parameter is highest among other
satisfaction and quality of life at work through involvement.
independent variables chosen for regression analysis. Thus
management commitment issues play a major role in making
Planned maintenance (I7) as an input to the TPM
cost reduction.
implementation has shown a significant correlation (r=
0.72; p <0.05) with cost reduction (O1). Table 1: Multiple Regression Analysis between
Input Factors and Output Parameters
The planned maintenance influences cost reduction the most
by focusing on addressing cost related issues and facilitating
working through self managed project teams and problem
solving groups by stabilization of production systems,
affecting maintenance prevention improvements on the
production system, enhancing the human resource capabilities
and affecting improvements in the reliability of manufacturing
systems. Effective planned maintenance programs can
strategically contribute towards productivity improvements by
improving the basic equipment conditions, reducing
unplanned downtimes and setup times, minimizing troubles
related with equipment upkeep and operations.

The results reveal that planned maintenance (I7) issues

significantly affect (r= 0.63 and r=0.38) the quality
(O2) and delivery (O3) performance of the industry.
Planned maintenance is the basic or common practice in Total
Productive Maintenance. The main idea in TPM is direct
involvement of operators in maintenance process.TPM
improve the plant performance through break down the
traditional barriers between maintenance and production,
foster improvement by looking at multiple perspectives for
equipment operation and maintenance, increase technical
skills of operators, include maintenance in daily tasks as well
as long-term maintenance plans, and allow for information
sharing among different department which lead to reduction in
cost, increase in quality and better delivery services.
In order to investigate critical success factors for achieving
results through holistic TPM implementation, the significant
correlations thus obtained as a result of Pearson‟s Correlation
and t Test are validated through „Multiple Regression
Analysis‟ as depicted in Table below. The notations depicted
in the table will include: β = Regression coefficient (beta
coefficient), R = Multiple correlation coefficient. The
significant factors with (β) significance level, multiple
correlation coefficient (R) and F values for each performance
parameter are indicated in the Table 4.16. The results imply
that there is a significant contribution of various TPM success
factors depicted in the table with the respective manufacturing
performance parameters reported.
Regression analysis results reveal that:
Multiple correlation coefficient (R) for cost reduction(O1) and
the independent variables is 0.874 and variance (R2) is 0.7656,
leading to the connotation that 76.56% of the variance in cost
Multiple correlation coefficient (R) value for quality
improvements (O2) and the independent variables is 0.773
and R2=0.5982. This reveals that 59.82% of the variance in
this output parameter can be predicted from ‘autonomous
maintenance’ (I3), ‘5S activities’ (I4), ‘employee
training’ (I5) and ‘planned maintenance’ (I7) issues
combined. The results show that autonomous maintenance (p<
0.05) is the major contributor (β=0.502) in the quality
improvements
„Delivery compliance‟ (O3) and „independent variables‟ show
a strong association with regression coefficient of 0.384. The
results show that 14.77% of the variance in O3 can be
predicted from ‘5S activities’ (I4) and ‘planned
maintenance’ (I7) input parameters. The 5S activities issues
have maximum impact on increasing the effectiveness of
delivery compliance.
Multiple correlation coefficient (R) for flexibility
enhancement (O4) and the input variables is 0.575 and
variance (R2) is 0.3316, leading to the connotation that
33.16% of the variance in flexibility enhancement (O4)
parameter can be predicted from ‘management
commitment’ (I1) and „employee involvement’(I6) issues
combined. The results indicate that „management
commitment‟ is very significant (at p<0.05) and β coefficient
(0.5873) for this parameter is highest among other
independent variables chosen for regression analysis. Thus
management commitment issues play a major role in making
flexibility enhancements.

571
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The results of multi correlation analysis have corroborated
with those obtained through t-test analysis and thus validate
the same.
10. CONCLUSION
It is concluded that total productive maintenance (TPM)
practices basically have influence the performance of
manufacturing companies. The improvement can be seen in
term of cost, quality, delivery, and flexibility that have shown
better results after implementing TPM programmes in plant
operations. For example, there are less defects during process,
reduction in late delivery, increase product quality, decrease
in cost of manpower, and etc.
REFERENCES
[1] Huang, S.H., Dismukes, J.P., Shi, J., Su, Q., Razzak,
M.A., Bodhale, R., Robinson, D.E. 2003. Implementing
TPM in plant maintenance: some organizational barriers.
International Journal of Quality and Reliability
Management. vol. 17, no. 9, pp. 1003-1016.
[2] Vashisth, D. S., Kumar, R. 2011. Analysis of a redundant
system with common cause failures. International
Journal of Engineering Science and Technology.
vol. 3, no. 12, pp. 8247-8254.
[3] Cooke, F.L. 2000. Implementing TPM in plant
maintenance: some organizational barriers.
International Journal of Quality & Reliability
Management. vol. 17, no. 9, pp. 1003-1016.
[4] Meulen, P., Petraitis, M., Pannese, P.2008. Design for
maintenance. IEEE conference on Advanced
Semiconductor Manufacturing. pp. 278–281.
[5] Ahuja, I.P.S., Khamba, J.S. and Choudhary, R. 2006.
Improved organizational behavior through strategic total
productive maintenance implementation. ASME
International Mechanical Engineering Congress
and Exposition (IMECE), pp. 1-8.
[6] Brah, S.A. and Chong, W.K. 2004. Relationship between
total productive maintenance and performance.
International Journal of Production Research. vol.
42, no. 12, pp. 2383–2401.
[7] Davis, R. K. 1995. Productivity Improvements through
TPM: The Philosophy and Application of Total
Productive maintenance.
[8] Nakajima, S. 1989. TPM Development Program-
Implementing Total Productive Maintenance.
Productivity Press: New York.
[9] McKone, K., Weiss, E. 1995. Total productive
maintenance: bridging the gap between practice and
research. Darden School Working Paper University
of Virginia.
[10] Neely, A.D., Gregory, M.J. and Platts, K.W. 1995.
Performance Measurement System design – a literature
review and research agenda. International Journal of
572
ISBN: 978-81-924893-0-8
Operations and Production Management. vol.15,
no.4, pp. 80–116, 1995.
[11] Leblanc, G. 1995. Tapping the true potential of TPM:
are you maximizing the value of your plant‟s program?.
Journal on Plant Engineering. vol. 49, no. 10, pp.
143–148, 1995.
[12] Maier, F.H., Milling, P.M. and Hasenpusch, J. 1998.
Total Productive Maintenance: An International Analysis
of Implementation and
Performance.http://iswww.bwl.unimannheim.de/lehrstuhl
/publikationen/TPM.pdf, 1998.
[13] McKone, K. E., Schonberger, R. G., & Cua, K. O. 1999.
Total productive maintenance: a contextual view.
Journal of Operations Management. vol.17, no. 2,
pp. 123-144, 1999.
[14] McKone, K. E.; Schroeder, R. G.; Cua, K. O. 2001. The
impact of total productive maintenance practices on
manufacturing performance. Journal of Operations
Management, vol.19, pp. 39- 58, 2001.
[15] Kutucuoglu, K.Y., Hamali, J., Irani, Z. and Sharp, J.M.
2001. A framework for managing maintenance using
performance measurement systems. International
Journal of Operations and Production
Management. vol. 21, no. 1/2, pp. 173-194, 2001.
[16] Ireland, F. and Dale, B.G. 2001. A study of total
productive maintenance implementation. Journal of
Quality in Maintenance Engineering. vol. 7, no. 3,
pp.183–192, 2001.
[17] Mora, E. 2002. The Right Ingredients for a Successful
TPM or Lean Implementation.
[18] McBRIDE, D. 2004. Implementing TPM Total
Productive Maintenance (TPM), Lean Manufacturing
Consulting and Training. EMS Consulting Group,
2004.
[19] Ming-Hong, L. 2004. Factors affecting the
implementation of Total Productive Maintenance
System.
[20] Eti, M.C., Ogaji, S.O.T. and Probert, S.D. 2004.
Implementing total productive maintenance in Nigerian
manufacturing industries. Applied Energy. vol. 79, no.
4, pp. 385–401.
[21] Kennedy, R. 2005. Examining the Process of RCM and
TPM. The Center for TPM (Australasia), The Plant
Maintenance Resource Center. pp. 9-13.
[22] Seth, D. and Tripathi, D. 2005. Relationship between
TQM and TPM implementation factors and business
performance of manufacturing industry in Indian context.
The International Journalof Quality and Reliability
Management. Vol. 22, Nos. 2/3, pp. 256–277.
[23] Campbell, John D.; and Reyes-Picknell, James 2006.
Strategies for Excellence in Maintenance
Management. (2nd Ed.). Productivity Press.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Productivity and Quality Management. Vol. 3, No.6 ,

[24] Parida, A., & Kumar, U. 2006. Maintenance performance pp.12-32.
measure (MPM): issues and challenges. Journal of
Quality in Maintenance Engineering. vol. 12, no. 3, [30] Paropate, R.V., Jachak, S.R., Hatwalne, P.A. 2011.
pp. 239-251. Implementing Approach of Total Productive
Maintenance in Indian Industries & Theoretical Aspect:
[25] Thun, J.H. 2006. Maintaining preventive maintenance An overview. International Journal of Advanced
and maintenance prevention analyzing the dynamic Engineering Sciences And Technologies. Vol. 6, No. 2,
implications of Total Productive Maintenance. System pp. 270-276.
Dynamics Review. Vol. 22, No. 2, pp. 163–179.
[31] Wakjira,M.W. and Singh, A.P. 2012. Total Productive
[26] Pessan, C. 2007. Multi-skill Project Scheduling Problem Maintenance: A Case Study in Manufacturing Industry.
and Total Productive Maintenance. European Journal of Global Journal of researches in engineering. Vol. 12, Iss.
Operational Research. Vol.78, No.2, pp. 146 – 161. 1.

[27] Ramayah,T. 2007. Total Productive Maintenance And [32] Sharma, A.K., Shudhanshu, Bhardwaj, A. 2012.
Performance: A Malaysian SME Experience Manufacturing Performance and Evolution of TPM.
International Review of Business Research Papers Vol 4 International Journal of Engineering Science and
No. 4 , pp.237-250 Technology. Vol. 4, No.03, pp. 854-866.

[28] Lazim, H.M., Ramayah, T. and Ahmad, N. 2010. Total [33] Badli, S. M.Y. 2012. Total Productive Maintenance: A
Productive Maintenance and Performance: A Malaysian Study of Malaysian Automotive SMEs. Proceedings of
SME Experience. International Review of Business the World Congress on Engineering 2012, Vol. III, WCE
Research Papers. Vol 4, No. 4, pp.237-250. 2012, July 4 - 6, 2012, London, U.K.

[29] Khanna, V.K.(2008). Total productive maintenance

experience: case study. International Journal of

573
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
EVALUATION OF TECHNOLOGICAL INNOVATION
CAPABILITIES OF SMEs
Taranjit Singh
Dept. of Industrial Engg.
Guru Nanak Dev Engg. College, Ludhiana,
Punjab, India
Taranvirk22@hotmail.com
Abstract:
In today‟s competitive business environment, global
competition forces companies to perpetually seek ways of
improving their products and services. The need of the hour
is to deliver high quality products through continuous
improvements in product features, bring new products to
the market faster, make product changes faster and more
manageable, improve forecasting accuracy of the product
demands, reduce costs, improve employee training, skills
and education levels, improve information systems and
networks, achieve greater flexibility of manufacturing
functions. Thus the organizations are left with no choice
but to upgrade the existing systems, products and
technologies for their survival. The present study presents a
detailed analysis of the various factors and issues hindering
technology development initiatives of cycle parts industry
in the region and their relative significance in affecting
performance output.
Keywords- Technology Upgradation, Organizational Culture, Resource
Support, Govt. Support, Alliances, Performance Output
1.1 General
The dynamic engine of a nation‟s economic growth is
driven by small and medium enterprises, whose activities
are the spur to aggregate economic and social benefits. As
SMEs face pressure from increased competition, shortening
product life cycles and growing product complexity, many
are finding that they need to change the way they develop
new technologies, products and services. Firms should
develop innovative capabilities for their survival and
growth in the era of global competition. Technological
advancement achieved through technological innovations
enables firms to acquire or improve competitiveness
through market orientation or quality improvement of
products, among others (Nanda and Singh, 2009) [1].
1.2 Technology Upgradation in SMEs
In the present global business context, it has been observed
that existing production techniques and processes in SMEs
are dragging them to become uncompetitive. Therefore,
SMEs need to harness technology appropriate to them to
enhance their national and international competitiveness
(Nanda and Singh, 2008)[2]. SMEs are facing many
challenges in the age of market and trade globalization.
574
ISBN: 978-81-924893-0-8
Gopal K. Dixit
Bhai Gurdas Institute of Engg. & Tech. Sangrur,
Punjab, India
gopalkdixit@yahoo.co.in
They therefore, need to strengthen their technological base
to make themselves competitive, so as to create a niche for
themselves. The opportunities are immense if they can
upgrade their capabilities to catch up the modern
techniques of management, production and marketing
(Dixit and Nanda, 2011) [3]. It is high time that the
industries wake up and gear up for R&D initiatives to
develop cutting edge technologies for sustained competitive
advantages in the global market place. Technology
upgradation has become mandatory for economic
development, industrial growth, enhanced corporate image,
more flexible responses, strategic self-reliance and
sustained competitiveness of an enterprise. Thus
technology upgradation efforts must be placed within the
context of market opportunities, customer needs and
strategic direction, thereby leading to improving the
product and technology portfolio. Without continuous
technology upgradation, no enterprise can ever remain
competitive and the basis of technology creation and up-
gradation is research and development (Choi, 1989) [4].
1.3 Technology Development in India
India has experienced transformation from the regime of
regulated economic development to competitive regime
since the liberalizations of 1991. The major reason for this
turnover is the rapid technological developments and
unprecedented obsolescence rates. Although the change in
technological pattern in Indian industry is remarkable but
India is still rallying behind other developing countries in
terms of growth and absorption of new technology,
especially to its‟ Asian neighbors like China and Taiwan.
The organizations in India depend on external sources for
its technological requirements and often look to
organizations from developed countries or other bigger
organizations for acquisition of technology. This
dependence on other organizations is due to the limited
„know-how‟ and „know-why‟ competencies of
organizations. This situation is even grimmer in smaller
organizations. Organizations in India especially SMEs
should develop their technological and learning capabilities
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

so that they become more innovative and less dependent on

other organizations, if they have to compete at global level.
LITERATURE REVIEW
2.1 Organizational Culture
In the implementation of innovation, firms have to create
an organizational culture that fosters innovation by
ensuring employee skills, providing incentives and
removing obstacles (Aderemi, 2009) [5].Competent
workforce, education, training, reward schemes and
availability of scientific facilitites are an important factors
for technology upgradation of any industry. Innovative
organizations believe that the bottom line difference
between success and failure is finding, developing and
nurturing these elements (Dixit and Nanda, 2012) [3].
2.2 Resource Support
To support technology upgradation programs, organization
must provide resources in the form of adequate physical
infrastructure and sufficient financial support. Innovative
organizations have better systems and technology in place
than less innovative organizations (Ghosbani and Bagheri,
2008) [6]. Advanced equipment and resources (Sheel,
2002) [7]. Innovation budget (Huang, 2008) [8] and
availability of adequate finance has been viewed as a
critical element for the development of SMEs (Abor and
Quartey, 2010) [9].
2.3 Policy Environment
Government can create the right economic, fiscal and
regulatory framework within which innovation can flourish
(Hyland and Beckett, 2005) [10]. Government assistance
can basically be divided into two sub-groups: financial and
technical. Financial assistance includes various forms of
investment incentives and soft policy loans. It includes
contributions in capital accounts and interests, financing at
concession rates, guarantee concessions, etc or tax
incentives. Technical assistance consists of human resource
training, export promotion initiatives, and quality and
technology programs (Zeng et al., 2010) [11].
2.4 Alliance with External Organizations
Organizations need a culture that supports collaboration
and a systematic approach for managing innovation.
Knowledge is generated not only by individuals and
organizations, but also by their complex pattern of
interaction. Through collaborations, a company can
improve its exploration and exploitation capabilities and
consequently improve its innovative capacity (Faem et al.,
2005) [12]. Strong ties can offer steady flows of new ideas,
technological innovations, and operational support (Nanda
and Singh, 2009) [1].

2.7 Conceptual Model

Organizational
Culture
 Manpower Development
 Learning Environment
 Training to Employees
 Traits for Innovation
 Intrinsic-Extrinsic
Motivation
 Risk-Taking and Strategic
Direction
Level of Technology
 Level of process
technology in use.
 Role of old technology in
impairing performance.
Resource Support Policy Environment Alliance with
 Physical Environment  Policy Environment External
 Modernization Programs  Financial Support to Organizations
 Capital Support. R&D  Industrial Partnerships
 University-Industry
Partnerships
TECHNOLOGY  Other Parternerships
DEVELOPMENT PROGRAM
Response to Market
Needs
Strategic Structure and Output  Increase in product
Implementation of of Research Function features to respond to
Innovation  Collecting customer needs of
 External sources for requirements through a marketplace.
technology needs. separate marketing  Product quality and
 In-house R&D for department attributes as
developing new  Well defined R&D policy compared to
technology products and for technology competitors.
processes. development.  Markets served by
 Technology developed  New processes developed the industrial units.
through in-house through in-house research  Improvement in
research. efforts. product-mix offered by
 Use of „Risky Research‟,  New products developed the industrial units.
as a strategic approach. through in-house research
 Use of „Imitation for efforts.
Figure 2.1 Conceptual

Model
Organizational structure
creation‟, as a strategic
approach. for R&D function.

575
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ANALYSIS OF SURVEY
3.1 Industrial Units Surveyed
Small scale cycle parts industry in Ludhiana (Punjab, India)
has been included in the survey. A total of 95 cycle parts
units were selected from the list of registered units
provided by the office of District Industrial Centre,
Ludhiana. A total of 46 units responded to the
questionnaire.
CONCLUSIONS
4.1 Results and Major Findings
The results have been derived from the descriptive and
empirical analysis of data collected through questionnaire
based survey. The main findings are presented as follows:
General Areas
 The most significant (PPS>70) factors deteriorating
performance of cycle parts sector include absence
of large scale manufacturing industry in the region,
lack of technological dynamism and shortage and
high cost of electricity to run production operations
smoothly.
 Increase in competition because of globalization and
liberalization, scarcity of funds for development
projects, shortage of multi-skilled workforce and high
price of raw material are also significant (PPS 65-
70).
Organizational Culture Issues
 Education level in majority (63 percent) of the units is
between fair to good. However, one fourth (24
percent) of units have considered poor education level
of employees to be a serious concern.
 Most of the units (83 percent) do not provide any
formal training to employees. Only a few (4 percent)
organizations provide formal training to employees
just after induction into the organization.
 Majority of the organizations (92 percent) either give a
fixed monetary reward, an increment in salary or a
share in the profits made on account of innovation.
Thus reward schemes have been largely based on
extrinsic motivation tools only.
 In majority of the units the role of top management
has been supportive in situations of project failures.
However, a few organizations (4 percent) take strict
action against members of project team or discourage
employees to undertake projects for innovation if
failure occurs.
576
ISBN: 978-81-924893-0-8
 Industrial units lack in availability of technical and
scientific staff (R&D personnel). Majority of the units
do not have R&D personnel in required numbers.
Only around one tenth (11%) of the units have this
manpower in adequate strength to undertake
technology upgradation initiatives.
 The level of encouragement to employees by senior
management is moderate (PPS= 57.60) for
undertaking R&D work. There is very little to
reasonable pressure on employees to put efforts for
technology development.
 Cycle parts sector in the region is not performing well
in availability of multi-skilled workforce. It is only
about one fifth of the units that have such workforce in
desired numbers.
Resource Support Issues
 Industry, in general, has lacked in adequate financial
support for technology upgradation. One third of the
units face acute shortage of funds. 59 percent units
have only little to reasonable support for their
development projects.
 State of the art production machinery and equipment is
not available in majority (63 percent) of the industrial
units. Only less than one tenth (9 percent) of the units
have latest production facilities.
 Cycle parts units in the region do not have latest
software for drafting, designing and modeling etc. 79
percent of the units are using softwares only to a very
small extent.
 The tool sector lacks in availability of dedicated
laboratories with facilities for experimentation and
analysis. Majority of the units (74 %) do not have
these facilities.
 As far as earmarking of funds for research and
development activities is concerned, the performance
of industry is not satisfactory. 59 percent units do not
allocate funds for research activities clearly. 26
percent club these funds with other developmental
activities.
 Investments in research function by the local industry
do not compare global standards by any means. 63
percent units do not spend even 0.5% of annual
turnover on R&D. Another 20 percent spends between
0.5-2.5 % of annual turnover on development
initiatives.
 Absence of modernization and renovation programs is
another aspect preventing development in the cycle
parts sector. Only one fifth (19%) of the units
regularly implement modernization and renovation
measures.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Policy Environment Issues
 Majority of the units (66 percent) do not receive any
financial help from government which is discouraging.
 Government has to make improvements (PPS= 57.60)
in its policies to ensure availability of raw materials at
appropriate prices. Majority of the units have
considered raw material prices to be high and
significant in impairing their performance.
 Availability and cost of electric power in the region
has been considered as a major problem. Nearly two
third (62 percent) of the units consider this factor as
most significant in restricting growth and
competitiveness of industrial units in the region.
 The proprietors and senior executives of the industrial
units are of the opinion that government can suitably
reward entrepreneurs for their achievements in the
field of technological innovations, support cycle parts
industry by organizing seminars/workshops on
advanced and upcoming technologies, provide labs for
testing, analysis etc. and funding for employee
training programs.
Alliance Issues
 Organizations have shown unreasonably low rating
(PPS= 34.24 only), in interaction with external
agencies (other industries, academic institutes and
research institutes). Most of the units have never dealt
with these organizations
 Industry has shown a poor rating (PPS= 49.45) in
deriving support from government service institutes.
There are only a very few (4 percent) industrial units
which have saught active support from these
government subsidiaries.
 The industry has obtained an extremely poor rating in
alliance with academic institutions. Most of the
organizations (89 percent) have not experienced any
affirmative results through industry-institute
interactions.
 Cycle parts sector in the region lacks in good R&D
infrastructure. Majority of the units (72 percent) are of
the opinion that institutional infrastructure can be
helpful in development initiatives of industry to a
large extent.
 Majority of the units (73 percent) have been dependent
on large scale manufacturing industry in the country
for process technology needs.
Concerning Output Performance
Parameters
 The response of industry in utilizing the „Risky
Research‟ strategy has been low. Nearly half of the
577
ISBN: 978-81-924893-0-8
industrial units (48 percent) are not using this strategy
at all. Another one third uses it only to a small extent.
 A relatively low rating has been shown in „Imitation
for Creation‟ strategy. More than half (54%) of the
units have never practiced this strategy. 39 percent
have used it occasionally for technology development.
 Nearly half of the industrial units utilize their research
efforts for solving maintenance related problems. It is
only 18 percent of the units which tend to use research
function for developing new products. Another one
fourth utilizes it for developing improved processes.
 Only 30 percent of the industrial units collect
information on customer requirements in a structured
manner. Out of these, 18 percent units have a separate
marketing department to perform this function and in
the remaining 12 percent units, a team of senior
executives performs this job.
 Cycle parts sector is aware of the benefits of in-house
technology development programs (PPS= 46.20), but,
a lot needs to be done to convert this awareness into
reality. At present, not even one tenth (6 percent) of
the units are employing latest technology to produce
products. 59 percent units employ old technology in
their products.
 The performance of industry has not been very
encouraging as far as increase in product mix and
adding new features to the products is concerned.
Only 3 percent units have increased product features
considerably in the last few years.
 There are only a few units (6 percent) which follow
and practice a well defined R&D policy. 40 percent
units do not have defined R&D policy. 44 percent of
the units have just started formulating their research
policy and rest 10 percent have almost been decided
their R&D policy.
5.2 Conclusions and Recommendations
The main conclusions to be drawn are as follows:
i. Absence of large scale manufacturing industry in
the region and use of old process technology to
manufacture products are the prime factors
affecting performance of small units. Large scale
manufacturing sector, if present, provide
resources in the form of finance and expertise, as
well as operational support and international
opportunities.
ii. High cost of electricity with restricted and
unreliable supply is also affecting the industrial
performance.
iii. Becoming innovative organization requires an
organizational culture that constantly guides
employees to strive for innovation and a climate
that is conducive to creativity. Small scale sector
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
in the region has to particularly focus on
appropriate reward systems and training of
employees to build an organizational culture
conducive for process improvements and product
innovations.
iv. The performance of industry is worst in resource
support component. A restriction of resources
limits innovative ability because employees are
more occupied with finding additional resources
and not with actually developing new products.
Resources are important not only for functional
support, but also because having an adequate
level of resources for a project influences
employee‟s perception that the project is valuable
and worthy of organizational support.
v. Government has several schemes for industry
but, benefits of the same have not reached the
industrial sector because of lack of awareness of
proprietors regarding the schemes and
ineffectiveness of government subsidiaries in
reaching small units and extending support.
Government should also ensure good quality and
reliable physical infrastructure at reasonable
prices.
vi. Small industry has not been interacting much
with external organizations for technology
upgradation. Industrial units should enter into
interactive learning networks with other firms,
customers and suppliers, government
laboratories, universities and R&D organizations.
REFERENCES
[1] Nanda, T. and Singh, T.P. (2009) „Determinants of
creativity and innovation in the workplace: a
comprehensive review‟, Int. J. Technology, Policy and
Management, Vol. 9, No. 1, pp.84–106.
[2] Nanda,T and Singh, T.P. (2008), „ A
Comprehensive Strategy for Technology Generation
through effective Industry-Institute Bonding‟, The
Indian Journal of Technical Education, Vol. 31, No.2,
pp. 1-6.
578
ISBN: 978-81-924893-0-8
[3] Dixit, G.K. and Nanda, T (2011), “Evaluation of
Technlogy Development Initiatives in Small Scale
Industry in India”, „IJITM‟, pp 120-134.
[4] Choi, H.S. (1989), „From Imitation to Creation‟,
Technological Forecasting and Social Change, Vol.
36, pp. 209-215.
[5] Aderemi, H.O., Hassan, O.M., Siyanbola, W.O.,
Taiwo, K. (2009), „Managing Science and Technology
Occupations of Women in Nigeria‟, Journal of
Technology Management & Innovation, Vol.4, No.3,
pp. 34-45.
[6] Ghorbani, A.A and Bagheri, E. (2008), „The state
of the art in critical infrastructure protection: a
framework for convergence‟, International Journal of
Critical Infrastructures, Vol. 4, No.3, pp. 215 - 244.
[7] Sheel, C. (2002), „Knowledge Clusters of
Technological Innovation‟, Journal of Knowledge
Management, Vol. 6 No. 4, pp. 356-367.
[8] Huang, S.C. (2008), „Efficient Industrial
Technology Policy, High Government Industrial R&D
Expenditure: Does one require the other?‟
International Journal of Technology, Policy and
Management, Vol. 8, No. 3, pp. 211-236.
[9] Abor, J. and Quartey, P. (2010) „Issues in SME
Development in Ghana and South Africa‟,
International Research Journal of Finance and
Economics, Iss.39, pp 218-228.
[11] Zeng, S.X., Xie, X.M., Tam C.M. (2010),
„Relationship between cooperation networks and
innovation performance of SMEs‟, Technovation, Vol.
30, Iss. 3, pp. 181-194.
[12] Faems, D., B. Van Looy, and K. Debackere
(2005), „Interorganizational collaboration and
innovation: Toward a portfolio approach‟, Journal of
Product Innovation Management, Vol. 22, No. 3, pp.
238-250.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
TECHNO-ECONOMIC ASPECTS IN MICROMACHINING
OF H11 HOT DIE STEEL MOULD USING EDM - A CASE
STUDY
Shalinder Chopra,
Assistant Professor,
Chandigarh University,
Gharuan (Mohali),
svmachopra@gmail.com
ABSTRACT
To achieve competitive edge in manufacturing in this era of
stiff competition, most manufacturing companies are focusing
on selection of shaping a component by considering various
technical and economical factors like type of material, shape,
process, process parameters and cost of processing.
Companies are using Techno-Economic analysis to estimate
optimal technology and economic processes to carry out their
tasks in economical and efficient way. Product miniaturization
has opened up a whole new vista of possibilities in the
manufacturing industry. Various micromachining processes
like CNC, EDM, LBM, and ECM are being used to produce
micro grooves/holes; each process having its relative merits
and demerits in terms of metal removal rate, wear rate,
rejection, cost of process and wastage of material as stated by
different researchers. The present work has been carried out to
identify various Techno-Economic aspects in micromachining
of H11 Hot Die Steel Mould using EDM in small scale
industry. The experimental work has been carried out by using
Taguchi Design L-18 Orthogonal Array and verified by
ANOVA. The optimized EDM process parameters for MRR
and ROC to cut micro grooves/holes have been worked out. It
is estimated that with the induction of this micromachining
process with optimized process parameters, the company has
enhanced its productivity and profitability compared to
previous processing by CNC machines.
Keywords
EDM, MRR, radial Over Cut, machining of H11 Hot Die
Steel, mould and Die.
1. INTRODUCTION
Miniaturization is very promising for medical and
biotechnology applications requiring micro-systems to
interact with molecules, proteins, cells and tissues. For
instance, with the miniature devices, cancer agents like PSA,
CA can be detected at early stages and miniaturizing such
devices will reduce the cost of cancer monitoring and save
many lives. Miniature equipments like probes, stents and fibre
optic cameras used in surgeries to avoid tissue damage during
surgeries, implants etc. and their market is growing rapidly.
With miniaturization, products with more functionality are
579
ISBN: 978-81-924893-0-8
Aprinder Singh Sandhu
Assistant Professor,
GNDEC,
Ludhiana,
apsandhu106@gmail.com
achieved like a cell phone not only provides mobile
communication, but also has internet, GPS, camera,
audio/video player, video games etc. Digital data storage
(hard-disc drives) gets smaller and store more data.
Micromachining is capable of fabricating three dimensional
micro features on a variety of engineering materials like
ceramics, metals, composites, polymers etc. Egashira et al.
(2010) carried out EDM process of submicron holes using two
types of electrodes: tungsten electrodes (1µm or less) made by
combining wire electro discharge grinding and ECM, along
with silicon electrodes (< 0.15µm) originally intended as
probes for scanning probe microscopes. Holes drilling was
done using a relaxation-type pulse generator at open-circuit
voltage of 20V or lesser with only machine’s stray
capacitance. Better holes of < 1µm diameter and > 1µm depth
were drilled successfully using tungsten tools. Iosub et al.
(2010) revealed influence of EDM parameters on MRR, TWR
and surface quality of SiC/Al (aluminium matrix composite)
reinforced with 7% SiC and 3.5% graphite. 27 brass tools of
3.97 mm diameter; with different Pulse-ON, Pulse-OFF and
peak currents were used to machine the hybrid composite
using mathematical model developed by full factorial design
and regression analysis. Good surface quality of the
composite was obtained easily by controlling EDM
parameters. Biermann and Heilmann (2011) demonstrated
that by downsizing of components and industrial relevance of
bored holes with small diameters and high length-to-diameter
ratios, combination of laser pre-drilling and single-lip deep
hole drilling could shorten process chain in machining
components having non-planar surfaces, and also could
reduce tool wear in machining case-hardened materials. In
this research, the combination of these two processes was
realized and found out for first time. Garn et al. (2011)
investigated vibration effect on micro-EDM. Micro-EDM
boring was divided into 3 parts namely, start-up, major boring
and work piece breakthrough of tool. Investigations revealed a
delayed start-up of process on work surface for micro-EDM;
but, this effect could be reduced by introducing vibration on
work piece and its cause was analyzed by single discharge
analysis which also provided as a means for investigating the
effect of vibration frequency. Zhang et al. (2011)
demonstrated for online fabrication of micro tool, a
micromachining system based on electrochemical dissolution
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

of material, which consisted of mechanical movement of

equipment, ultra short pulse power supply, circulation system
of electrolyte, and hall current sensor for detecting process Table 1: Specifications of Equipment
status. In micro-ECM, micro tool and micro-structures of
work could be sequentially machined by changing machining Machine Unit Particulars Specifications
conditions. Applying tungsten tool with 8 μm diameter and
ultra short voltage pulses, micro-cross with a 30 μm width Work Table 400mm x 300mm
groove, which had sharp edge, was obtained. Jiang et al. X Travel 250mm
(2012) evacuated debris which were formed during the
Y Travel 150mm
erosion process which limited achievable aspect ratio. To
address the problem of debris accumulation, a pulse generator, Z Travel 300mm
which was capable of shutting off harmful pulses and to Electrode Pipe Dia range 0.3mm to 3.0mm
applying high discharge energy pulses, had been developed. A Max. Job Height 150mm
series of experiments were conducted; experimental results
revealed improved small-hole drilling efficiency and Max. Drilling Depth 100mm
increased aspect ratio. Karthikeyan et al. (2012) revealed Maximum Work Piece Weight 400Kg
behavior of micro Electric Discharge Milling as per shape, Maximum Electrode Weight 35Kg
form and surface quality of channel; also rotation of tool,
traverse were significant where it influenced flow of molten Dielectric Capacity 260Litres
metal, flushing and redeposition of debris. Tool rotation effect For micromachining of H-11 hot die steel by EDM,
not only disturbed plasma but also influenced the final shape cylindrical shaped Copper tool electrode (Fig. 2) is used.
and form of the channel. Using SEM of micro channel at
different instants and conditions of machining, physical nature
of process understood and results presented.

2. EXPERIMENTATIONS
Experimental work has been performed on Sparkonix EDM,
Model S-35, in supervision of EDM operator, at M/s S.G
Engineering Works, Chandigarh.
For experimental investigation in micro-EDM, the following
Techniques/equipments are used:

S No Particulars (Techniques/equipments used)

1. Parametric optimization (Taguchi Method, ANOVA)
2. Experimental Investigation (EDM Equipment) Fig. 2: Copper Tool Electrode
3. Work Material (H11 Hot Die steel) Table 2: Tool Electrode Specifications
4. Cylindrical Tool Electrode (Copper with 500µm diameter) Particulars Specifications
Spark Gap Voltage, Peak Current, Pulse-ON and Pulse-OFF Material Used Copper
are the parameters considered for analyzing the EDM
performance criteria i.e. Metal Removal Rate and accuracy Electrical resistivity 0.0167 Ωmm2/m
(minimum radial overcut) of micro hole. Purity 99.8%
Melting point 1083°C
Density 8.9 kg/dm3
Height 13.7mm
Diameter 500µm

Two response variables MRR and ROC (accuracy) are

considered for present study. Each time material is being
removed from work; there is generation of micro hole, due to
thermal damage. MRR is found out with the help of hole
volume which is calculated by using average hole diameters
from SEMs. Stop watch is used for measuring the machining
time. ROC is determined by difference between diameter of
micro tool and micro hole.

MRR (mm3/min) = π/4 x (Davg)2 x h / Machining Time

(minutes)
ROC (µm) = Davg- davg / 2;
Where, h = work piece height; Davg = average dia. of
machined hole and davg= average dia. of micro tool.
Experiments on micromachining of H-11 hot die steel are
Fig. 1: Sparkonix EDM equipment, Model S-35 used for conducted on EDM equipment (Sparkonix Model S-35) using
Experimentations copper tool electrode of 500µm diameter. The tool alignment
is done with the help of dial indicator to avoid any error due

580
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

to tool displacement during machining. Tip of indicator is to 6μs TON, showing more time arc remains more material is
touched at various points on cylindrical tool circumference, removed. MRR also increases by increas0ing SGV and by
while tool is rotated which helps in aligning the tool vertically decreasing TOFF. These two graphs show that TON and TOFF
straight. The tool is kept perpendicular to work surface, for are the most predominant factors for MRR.
proper machining.
Main Effects Plot for Means
Data Means

3. RESULTS AND DISCUSSION 1.6

Gap Voltage Supply Current

Observations are made during conduction of 18 experiments 1.2

on EDM according to L18 orthogonal array, with different set
0.8
of input parameters. Machining time taken in minutes for each

Mean of Means
0.4
experiment is observed with a stop watch.
0.0
30 40 1 2 3
Pulse ON Pulse OFF
1.6

1.2

0.8

0.4

0.0
2 4 6 2 4 6

Fig. 5: Main Effect Plot for Mean (MRR)

Fig. 6 shows interaction plot graph for Means of different

input parameters for MRR. This graph has been used to
explain effects of two input parameters at a time on the MRR.
Interaction Plot for MRR (mm3/min)
Data Means
1 2 3 2 4 6 2 4 6
2
Gap
Voltage
Gap Voltage 1 30
40
0
2
Supply
C urrent
Supply Current 1 1
2
Fig. 3: SEM’s of Holes made by EDM Micromachining of H11 0
2
3
Pulse
Hot Die Steel ON
Pulse ON 1 2
4
6
Higher MRR (2.14) and S/N Ratio (6.6083) are observed at 0

40V SGV, 2A Current, 6μs TON and 2μs TOFF. It is prepared Pulse OFF

with Minitab with following rule to select Optimum

Parameters from graph: S/N Ratio as well as Mean: Always
Highest Point in all graphs.
Fig. 6: Interaction Graph for MRR
Fig. 4 shows S/N ratio for MRR increases sharply for increase
in TON. So for MRR, optimum values are SGV=40V, SC=2A, Now results obtained for ROC are analyzed, after conduction
TON=6μs and TOFF=2μs. of all 18 experiments, values of ROC, S/N Ratios and Means
are calculated for different set of input parameters. Result
Main Effects Plot for SN ratios analysis includes tables and graphs for S/N ratio and means,
Data Means
interaction graphs for different input parameters and ANOVA.
Gap Voltage Supply Current Minimum ROC (2.75) and S/N Ratio (-8.7867) are observed
5
at 30V Voltage, 2A Current, 2μs TON and 2μs TOFF.
0

-5
It was prepared with Minitab with following rule to select
Mean of SN ratios

-10
Optimum Parameters from graph: S/N Ratio: Highest Point in
-15
30 40 1 2 3
all graphs; Mean: Lowest point in all graphs. S/N ratio for
Pulse ON Pulse OFF
ROC is plotted to select optimum parameter. It is seen this
5
value decreases sharply for increase in TON. So optimum
0 values are SGV=30V, SC=2A, TON=2µs and TOFF=2µs.
-5

-10 Fig. 7 is S/N ratio for Radial overcut for different levels of
-15 input parameters. It is seen the value decreases with TON. S/N
2 4 6 2 4 6
ratio decreases for 30V to 40V SGV. So, optimum values are
Signal-to-noise: Larger is better SGV=30V, SC=2A, TON=2µs and TOFF=2 µs.

Fig. 4: Main Effect Plot for S/N Ratio (MRR)

Fig. 5 shows the main effect plot of mean; here MRR is
almost constant from 1A to 3A SC. MRR increases from 2μs

581
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Main Effects Plot for SN ratios 4. CONCLUSIONS

Data Means Following conclusions have been drawn:
Gap Voltage Supply Current
-20
 MRR is increased with TON and SGV; also ROC
-24
increases with TON and SGV.
-28
 Most dominant factors affecting MRR and ROC are
Mean of SN ratios

-32 TON and TOFF as analyzed by Taguchi method.

30 40 1 2 3  Optimum Micromachining conditions for MRR are
Pulse ON Pulse OFF
-20 TON=6 µs, TOFF=2 µs, SC=3A and SGV=40 V.
-24  Optimum Micromachining conditions for ROC are
-28
TON=2 µs, TOFF=2 µs, SC=2A and SGV=30 V.
-32
 Total operating cost excluding initial set up cost for
CNC is approx. Rs.18, 45,500/- and for EDM it is
2 4 6 2 4 6

Signal-to-noise: Smaller is better

approx. Rs. 1,03,550; and there is saving of Rs.17,
41,950/- to the company;
 Also if we exclude other fixed costs like transformer
cost, AC cost and CAD/CAM software cost, then
Fig. 7: Main Effect Plot for S/N Ratio (ROC) also total operating cost excluding other fixed costs
for CNC is approx. Rs.1, 45,500 and for EDM it is
Fig. 8 is main effect plot for mean. ROC decreases for 1A to approx. Rs. 1, 03,550; and there is still saving of Rs.
2A SC, and further increases for 2A to 3A. ROC decreases for 41,950/- to the company; that means CNC is costs
6µs to 2µs TON showing less time the arc remains less ROC than EDM in any case.
produced leading to accuracy and productivity. ROC Thus it is suggested to use micro EDM, for better machined
decreases by decreasing SGV and TOFF. So from these graphs, circular micro hole as compared to the micro hole produced
it is seen TON & TOFF are the most predominant factors. by CNC, leading to better economical conditions for industry
with suggested optimized parameters.
Main Effects Plot for Means
Data Means 5. REFERENCES
50
Gap Voltage Supply Current [1] Iosub, A. Axinte, E. and Negoescu, F. May 2010. A
40
Study about Micro-Drilling by Electrical Discharge
30
Method of an Al/SiC Hybrid Composite. International
20 Journal of Academic Research, Vol. 2. No. 3. .
Mean of Means

10
30 40 1 2 3 [2] Biermann, D. and Heilmann, M. 2011. Analysis of the
Pulse ON Pulse OFF Laser Drilling Process for the Combination with a
50

40 Single-Lip Deep Hole Drilling Process with Small

30 Diameters. Physics Procedia 12, 308–316. .
20
[3] Karthikeyan, G. Garg, A. K. Ramkumar, J. and
10
2 4 6 2 4 6 Dhamodaran, S. 2012. A microscopic investigation of
machining behavior in µED-milling process. Journal of
Fig. 8: Main Effect Plot for Mean (ROC) Manufacturing Processes. .
[4] Jiang, Yi. Wansheng, Z.. Xuecheng Xi. 2012. A study on
Fig. 9 shows the interaction plot graph for Means of different pulse control for small-hole electrical discharge
input parameters for ROC. This graph explains effects of two machining pp-1463– 1471. .
input parameters at a time over ROC.
[5] Egashira, K. Morita, Y. and Hattori, Y. 2010. Electrical
Interaction Plot for Radial Over Cut (µm) discharge machining of submicron holes using
Data Means
1 2 3 2 4 6 2 4 6
ultrasmall-diameter electrodes. Precision Engineering 34,
60
Gap
Voltage
139–144. .
40
Gap Voltage 30
40
20
[6] Garn, R. Schubert, A. and Zeidler, H. 2011. Analysis of
60
Supply
Current
the effect of vibrations on the micro-EDM process at the
40
Supply Current
20
1
2
work piece surface. Precision Engineering 35, 364–368. .
3
60
Pulse
ON
[7] Maity, K. P. and Singh, R. K. 2012. An optimisation of
40
Pulse ON
20
2
4
micro-EDM operation for fabrication of micro-hole. Int J
6 Adv Manuf Technol 61:1221–1229. .
Pulse OFF [8] Zhang, Z. Wang, Y. Chen, F. and Mao, W. 2011. A
Micromachining System Based on Electrochemical
Dissolution of Material. Russian Journal of
Electrochemistry, Vol. 47, No. 7, pp. 819–824.
Fig. 9: Interaction Graph for ROC

582
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
OPTIMIZATION OF SURFACE ROUGHNESS IN CNC TURNING OF ALUMINIUM USING
ANOVA TECHNIQUE
Karamjit Singh Gurpreet Singh Bhangu
Assistant Professor Assistant Professor
BGIET, Sangrur BGIET, Sangrur
karamjit.nagri@bgiet.ac.in gurpreet_bhangu2001@y
ahoo.com
ABSTRACT
In modern manufacturing processes tight tolerances and good
surface finish are required to obtain the quality products.
Therefore, Surface roughness plays an important role in many
areas and factors that affecting the same are of great
importance in the evaluation of machining accuracy. Turning
is one of the most widely used manufacturing processes. The
present research work aims to the effect of cutting parameters
such as spindle speed, feed rate, and depth of cut on the
surface roughness of aluminum work pieces. The experiments
have been designed according to Yates order and analysis has
been performed using ANOVA technique. Additionally, a
mathematical model has been developed using method of
regression. Two levels of four machining parameters have
been used. The results from the present research work revel
that as increase the value of Nose Radius and Spindle Speed
the surface roughness decreases. Nose Radius and Spindle
Speed are significant factors in improving surface finish of
Aluminum.
Keywords: CNC Turning, Machining, Surface roughness,
ANOVA
1. INTRODUCTION
The challenge of modern machining industries is mainly
focused on the achievement of high quality, in terms of work
piece dimensional accuracy, surface finish, high production
rate, less wear on the cutting tools, economy of machining in
terms of cost saving and increase the performance of the
product with reduced environmental impact . Surface
roughness plays an important role in many areas and is factors
of great importance in the evaluation of machining accuracy.
We are also going to perform an experiment on to produce
minimum surface roughness [1]. For this experiment we have
used cutting parameters spindle speed, feed, depth of cut,
nose radius. We will vary values of these parameters to
perform our experiment. We will find out the effect of various
parameters on the surface roughness. We will perform the
experiment for Aluminum and brass; compare the effect of
various parameters on surface of both.
1.1 Turning process
Turning is very important machining process in which a
single point cutting tool removes unwanted material from the
surface of a rotating cylindrical work piece. The cutting tool is
fed linearly in a direction parallel to the axis of rotation.
Turning is carried on a lathe that provides the power to turn
the work piece at a given rotational speed and to feed to the
cutting tool at specified rate and depth of cut. Therefore three
cutting parameters namely cutting speed, feed and depth of
cut need to be determined in a turning operation. The turning
operations are accomplished using a cutting tool; the high
583
ISBN: 978-81-924893-0-8
Supinder Singh Gill
Assistant Professor
BGIET, Sangrur
supi_gill@yahoo.co.in
forces and temperature during machining create a harsh
environment for the cutting tool. Therefore tool life is
important to evaluate cutting performance. The purpose of
turning operation is to produce low surface roughness of the
parts. Surface roughness is another important factor to
evaluate cutting performance. Proper selection of cutting
parameters and tool can produce longer tool life and lower
surface roughness.
1.2 Tooling for Turning Operation:
The tooling that is required for turning is typically a sharp
single-point cutting tool that is either a single piece of metal
or a long rectangular tool shank with a sharp insert attached to
the end. These inserts can vary in size and shape, but are
typically a square, triangle, or diamond shaped piece [3].
These cutting tools are inserted into the turret or a tool holder
and fed into the rotating work piece to cut away material. All
cutting tools that are used in turning can be found in a variety
of materials, which will determine the tool's properties and the
work piece materials for which it is best suited. These
properties include the tool's hardness, toughness, and
resistance to wear. The most common tool materials that are
used include the following:
 High-speed steel (HSS)
 Carbide
 Carbon steel
 Cobalt high speed steel
The material of the tool is chosen based upon a number of
factors, including the material of the work piece, cost, and
tool life. Tool life is an important characteristic that is
considered when selecting a tool, as it greatly affects the
manufacturing costs. A short tool life will not only require
additional tools to be purchased, but will also require time to
change the tool each time it becomes too worn. We have used
tool bit with nose radius 0.8 and 0.4 mm. These are called
DCMT tool bits because these are made by British Company
named as Die Cast Machine Tool Ltd (DCMT).
1.3 Materials for Work piece:
In turning, the raw form of the material is a piece of stock
from which the work pieces are cut. This stock is available in
a variety of shapes such as solid cylindrical bars and hollow
tubes. Custom extrusions or existing parts such as castings or
forgings are also sometimes used. Turning can be performed
on a variety of materials, including most metals and plastics.
Common materials that are used in turning include the
following:
 Aluminum
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 Brass
 Nickel
 Steel
 Titanium
 Zinc
When selecting a material, several factors must be considered,
including the cost, strength, resistance to wear, and
machinability [7]. The machinability of a material is difficult
to quantify, but can be said to possess the following
characteristics:
 Results in a good surface finish
 Promotes long tool life
 Requires low force and power to turn
 Provides easy collection of chips
 We shall perform our experiment by using
Aluminum and Brass.
1.4 Possible Defects:
Most defects in turning are inaccuracies in a feature's
dimensions or surface roughness. There are several possible
causes for these defects, including the following:
1.4.1 Incorrect cutting parameters
If the cutting parameters such as the feed rate, spindle speed,
or depth of cut are too high, the surface of the work piece will
be rougher than desired and may contain scratch marks or
even burn marks. Also, a large depth of cut may result in
vibration of the tool and cause inaccuracies in the cut.
1.4.2 Dull cutting tool
As a tool is used, the sharp edge will wear down and become
dull. A dull tool is less capable of making precision cuts.
1.4.3 Unsecured work piece
If the work piece is not securely clamped in the fixture, the
friction of turning may cause it to shift and alter the desired
cuts.
1.5 Aluminum:
Aluminum is a silvery white and ductile member of the boron
group of chemical elements. It has the symbol Al and its
atomic number is 13. It is not soluble in water under normal
circumstances. Aluminum is the most abundant metal in the
Earth's crust, and the third most abundant element therein,
after oxygen and silicon. It makes up about 8% by weight of
the Earth's solid surface. Aluminum is too reactive chemically
to occur in nature as a free metal. Instead, it is found
combined in over 270 different minerals [4]. The chief source
of aluminum is bauxite ore. Aluminum is remarkable for the
metal's low density and for its ability to resist corrosion due to
the phenomenon of passivation. Structural components made
from aluminum and its alloys are vital to the aerospace
industry and are very important in other areas of
transportation and building. Its reactive nature makes it useful
as a catalyst or additive in chemical mixtures, including
ammonium nitrate explosives, to enhance blast power.
584
ISBN: 978-81-924893-0-8
2. CUTTING PARAMETERS
2.1 Spindle speed:
The spindle speed is the rotational frequency of the spindle of
the machine, measured in revolutions per minute (RPM). The
preferred speed is determined by working backward from the
desired surface speed (m/min) and incorporating the diameter
(of work piece or cutter).Excessive spindle speed will cause
premature tool wear, breakages, and can cause tool chatter, all
of which can lead to potentially dangerous conditions. Using
the correct spindle speed for the material and tools will greatly
affect tool life and the quality of the surface finish .For a
given machining operation, the cutting speed will remain
constant for most situations; therefore the spindle speed will
also remain constant. Facing operations on a lathe however
involve the machining of a constantly changing diameter.
Ideally this means changing the spindle speed as the cut
advances across the face of the work piece, this was harder to
do in practice and was often ignored unless the work
demanded it. The introduction of CNC controlled lathes has
solved this awkward problem with a feature called Constant
Surface Speed (CSS). By means of the machine's software and
variable speed electric motors, the lathe can increase the RPM
of the spindle as the cutter gets closer to the center of the part.
2.2 Feed Rate:
Feed rate is the velocity at which the cutter is fed, that is,
advanced against the work piece. It is expressed in units of
distance per revolution for turning and boring (millimeters per
revolution). It can be expressed thus for milling also, but it is
often expressed in units of distance per time for milling
(millimeters per minute), with considerations of how many
teeth (or flutes) the cutter has then determining what that
means for each tooth. Feed rate is dependent on the:
 Surface finish desired.
 Power available at the spindle.
 Rigidity of the machine and tooling setup (ability to
withstand vibration or chatter).
 Strength of the work piece
Characteristics of the material being cut, chip flow depends on
material type and feed rate. The ideal chip shape is small and
breaks free early, carrying heat away from the tool and work.
2.3 Depth of Cut:
It is advancement of tool in the perpendicular direction of axis
of work piece. It is measured in mm. Depth of cut plays an
important role in surface finish of work piece during turning.
For rough cuts high value of depth of cut is used and when we
have make the final cut we use very small value of depth of
cut. Depth of cut should given according to need and power
available. If very high value of depth of cut is given it may
produce vibration or chatter.
Depth of Cut = (D1-D2)/2
Where
D1 = Original Diameter of stock in mm
D2 = Diameter obtained after turning
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3. RESPONSE PARAMETER Table 1.2: Design matrix

3.1 Roughness:
Sr. Spindle Feed Depth of cut Nose radius
Roughness is a measure of the texture of a surface. It is No. speed (s) (f) (d) (r )
quantified by the vertical deviations of a real surface from its
ideal form. If these deviations are large, the surface is rough; 1 2 3 4=1*2*3
if they are small the surface is smooth. Roughness is typically
considered to be the high frequency, short wavelength 1 + + + +
component of a measured surface. Roughness plays an
important role in determining how a real object will interact 2 - + + -
with its environment. Rough surfaces usually wear more
quickly and have higher friction coefficients than smooth 3 + - + -
surfaces .Roughness is often a good predictor of the
performance of a mechanical component, since irregularities
4 - - + +
in the surface may form nucleation sites for cracks or
corrosion. Although roughness is usually undesirable, it is
difficult and expensive to control in manufacturing. 5 + + - -
Decreasing the roughness of a surface will usually increase
exponentially its manufacturing costs. This often results in a 6 - + - +
trade-off between the manufacturing cost of a component and
its performance in application. 7 + - - +

4. DESIGN PROCEDURE: 8 - - - -
We have used two levels for every parameter. One is highest
value (given +ve sign) and one is lowest value (given –ve
sign). Number of trials performed is find out by (No. of
levels) (No. of parameters-1) that is {2 4 -1} and equal to 8. Table 1.3: Value for Surface Roughness of Aluminum

Table 1: Cutting Parameter Sr. Y1 Y2 Y=(Y1+Y2)/2 Y3

No.
Symbol Cutting Level 1 Level 2
parameter 1 1.365 1.594 1.479 1.307

A spindle 900 1500 2 1.234 1.359 1.296 1.148

speed
3 0.713 0.854 0.784 0.753
B feed 0.02 0.06
4 1.067 1.217 1,492 1.917
C depth of 0.1 0.3
cut 5 1.159 0.904 1.032 1.117
R nose 0.4 O.8
6 1.748 1.811 1.779 1.717
radius
7 1.312 1.162 1.235 1.295
Units:

Spindle Speed: RPM (Revolution per minute) 8 1.404 1.572 1.488 1.292

Feed: mm (millimeter)

Depth of cut: mm per revolution or mm per minute 4.2 Evaluation of coefficients

Nose radius: mm Regression coefficients for spindle speed (S), feed rate (F),
depth of cut (D), nose radius (R), and surface roughness of
4.1 Design matrix (using yatt’s order) selected model are calculated:
As shown is design matrix which we have followed during bj = Σ (Xji Yi)/N , j = 0,1………….k
turning of Aluminum. In this matrix +ve value shows the
highest value of the parameter and –ve value shows the lowest Where,
value of parameter.
Xji = Value of a factor or interaction in coded form

Yi = Average value of response parameter

N = No. of observations

585
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

K = Number of coefficients 4.3 Variance of Response:

Table1.4: Calculated Values of Coefficients S 2y = [2Σ (∆Y 2)]/N

Sr. No. Coefficients Value S 2y = (2*0.0542)/8

S 2y = 0.01355
1 b0 1.324
Where,
2 b1 -0.191
S 2y = Variance of optimization parameters
3 b2 0.074
Ym = Arithmetic mean of repetions
4 b3 -0.061
Y2 = Value of response in a repetion trial
5 b4 0.173
N = Number of observations
6 b12 0.112
Sr. Due to "t" Remarks
7 b13 0.059 No. value

8 b14 0.052 1 b0 Combined effect of all 32.135 Significant

parameters
9 b23 0.052
2 b1 Main effect of spindle speed 4.635 Significant
10 b24 0.060
3 b2 Main effect of feed rate 1.796 In-
11 b34 0.049 Significant

4 b3 Main effect of depth of cut 1.48 In-

Significant
Model Developed With Above Coefficients
5 b4 Main effect of nose radius 4.199 Significant
YSR = 1.324 – (0.191)S + (0.074)F – (0.061)D + (0.173)R +
(0.112)SF + (0.059)SD +(0.052)SR + (0.052)FD +( 0.060) 6 b12 Interaction effect of S & F 2.718 Significant
FR + (0.049)DR
7 b13 Interaction effect of S & D 1.432 In-
Table 1.5: Finding Variance of Response Significant

Sr. Y1 Y2 Y=(Y1+Y2)/2 ∆Y=Y2- ∆Y 2 8 b14 Interaction effect of S & R 1.262 In-

No. Ym Significant

1 1.365 1.594 1.479 0.115 0.013 9 b23 Interaction effect of F & D 1.262 In-
Significant
2 1.234 1.359 1.296 0.063 0.004
10 b24 Interaction effect of F & R 1.456 In-
3 0.713 0.854 0.784 0.071 0.005 Significant

4 1.067 1.217 1,492 0.042 0.002 11 b34 Interaction effect of D & R 1.189 In-
Significant
5 1.159 0.904 1.032 -0.127 0.016

6 1.748 1.811 1.779 0.032 0.001

4.4 Checking the significance of coefficients of model
7 1.312 1.162 1.235 -0.075 0.006
The statistical significance of coefficients can be tested using
8 1.404 1.572 1.488 -0.084 0.007 ‘t’ test. The level of significance of particular parameter can
be assessed by value of magnitude of ‘t’ associated with it.
Sum=0.054 Higher the value of ‘t’, more it become significant. ‘t’ value
for coefficients of model can be calculated by following
method:

t= (bj)/sbj ,

586
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Sbj= √ [(S 2y)/N] Table 1.7: Analysis of Variance of Surface Roughness

Where, bj = absolute value of coefficient Degree Variance Variance F'--Ratio F' Adequacy
of of of Model Ratio of Model
sbj= standard deviation coefficient Freedom Adequacy Response (Fm) Table

The coefficients b0, b1, b4, b12 are significant as value of ‘t’ F N S 2ad S 2y Fm = S At Whether
is greater than standard value. So these coefficients will used 2ad/ S 2y 3,8 Fm<Ft
to produce the final model. So the final model is:

YSR = 1.324 - 0.191(S) + 0.173 (R) + 0.112 (SF) 3 8 0.033 0.01355 2.4354 4.07 Yes

Table 1.6 Finding Variance of Adequency

Sr.No. Yp Y3 ∆(Yp-Y3) [∆(Yp-Y3)] 2

1 1.418 1.307 0.111 0.012

5. RESULTS AND DISCUSSIONS
2 1.232 1.148 0.084 0.007 From the investigations, it is clear that the surface roughness
of aluminum alloy varies with the cutting parameters used at
3 0.848 0.753 0.095 0.009 each run, so it is possible to obtain improvement in surface
roughness by varying the selected different cutting
parameters.
4 1.800 1.917 -0.117 0.014
Effect of Spindle Speed on Surface Roughness
5 1.072 1.117 -0.045 0.002
Spindle Speed has impact on surface roughness. We have
6 1.576 1.717 -0.141 0.019 observed effect of spindle speed by varying its value at two
levels. We observed that as we increase the value of spindle
7 1.194 1.295 -0.101 0.010 speed the surface roughness decreases.

8 1.454 1.292 0.162 0.026 Effect of Feed on Surface Roughness

Sum=0.099 Feed has impact on surface roughness. We have observed

effect of feed by varying its value at two levels. We observed
that as we increase the value of feed the surface roughness
increases.
4.5 Variance of Adequency: Effect of Nose Radius on Surface Roughness

S 2ad = [Σ [∆ (Yp-Y3)] 2]/f Nose Radius has impact on surface roughness. We have
observed effect of Nose Radius by varying its value at two
Where, levels. We observed that as we increase the value of Nose
Radius the surface roughness decreases.
S 2ad = Variance of Adequacy
Graph between Surface Roughness and Tool Nose Radius
Y3 = Measured/Observed response

Yp = Estimated/Predicted value of response

f = N-(K+1) (Degree of freedom)

K = No. of independent ly controllable variables

Variance of Adequency:

S 2ad = (0.099)/3

S 2ad = 0.033

Where,

f = 8 – (4+1)

f=3 Graph between Surface Roughness and Spindle Speed

587
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Graph between Surface Roughness and Feed
REFERENCES
[1] Abdulla Shariff, "Handbook of Properties of Engineering
Materials and Design Data for machine Elements",
Dhanpat Rai & Sons.
[2] Anil Gupta , Hari Singh , Aman Aggarwal," Taguchi-
fuzzy multi output optimization (MOO) in high speed
CNC turning of AISI P-20 tool steel", Expert Systems
with Applications 38 (2011) pp 6822–6828.
[3] ASM Metals HandBook Volume 18 - Friction,
Lubrication, and Wear Technology, ASM International
Handbook Committee, 1992.
[4] BL juneja, “Fundamentals of Metal cutting and Machine
Tools" New Age International Publishers.
588
ISBN: 978-81-924893-0-8
[5] B.S. Raghuwanshi, "A Course in Workshop technology",
Dhanpat rai & Co.
[6] Chen Lu, "Study on prediction of surface quality in
machining process", journal of materials processing
technology 205 (2008) 439–450.
[7] Durmus Karayel," Prediction and control of surface
roughness in CNC lathe using artificial neural network",
Journal of materials processing technology 209 (2009)
pp 3125–3137.
[8] E. Daniel Kirby, Joseph C. Chen," Development of a
fuzzy-nets-based surface roughness prediction system in
turning operations", Computers & Industrial Engineering
53 (2007) 30–42.
[9] GK Narula, KS Narula, VK Gupta. "Material Science",
Tata McGraw-Hill.
[10] Gaurav Bartarya, S.K. Choudhary," State of the art in
hard turning", International Journal of Machine Tools
and Manufacture, Volume 53, 2012, pp 1-14.
[11] Ilhan Asilturk, Harun Akkus, "Determining the effect of
cutting parameters on surface roughness in hard turning
using the Taguchi method", Measurement 44 (2011)
1697–1704.
[12] Ilhan Asilturk, Mehmet Cunkas," Modeling and
prediction of surface roughness in turning operations
using artificial neural network and multiple regression
method", Expert Systems with Applications 38 (2011)
5826–5832.
[13] Ilhan Asiltürk, Süleyman Neseli, "Multi response
optimisation of CNC turning parameters via Taguchi
method-based response surface analysis," Measurement
45 (2012) 785–794.
[14] M. N. Islam, Brian Boswell," An Investigation of Surface
Finish in Dry Turning", Proceedings of the World
Congress on Engineering 2011 Vol. I WCE 2011, July 6
- 8, 2011, London, U.K
[15] Muammer Nalbant, Hasan Gokkaya, Ihsan Toktas,
Gokhan Sur," The experimental investigation of the
effects of uncoated, PVD- and CVD-coated cemented
carbide inserts and cutting parameters on surface
roughness in CNC turning and its prediction using
artificial neural networks", Robotics and Computer-
Integrated Manufacturing 25 (2009) 211–223.
[16] R.K Jain, "Production Technology" Khanna Publishers.
[17] Suleyman Nes_eli , Suleyman Yaldız , Erol Turkes, "
Optimization of tool geometry parameters for turning
operations based on the response surface methodology",
Measurement 44 (2011) 580–587.
[18] www.asminternational.org
[19] www.atlasmetals.com.au
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Effects of Smart Grid Utilization, Performance,
Environmental & Security Issues: A Review
Parminder Pal Singh
Assistant Professor
Deptt of Mechanical Engg.
Bhai Gurdas Institute of Engg.
&Tech,Sangrur
pps11may76@gmaill.com
ABSTRACT
The purpose of this paper is to explain the utilization of Smart
Grid deployed in the world these days. The paper throws the
light on optimized use of electrical resources. This paper
basically focus on the smart grid working already installed in
some developed countries and they are benefiting out of this.
It results in saving of power, optimal use of power and also
contributes in reducing the cost of valuable electrical supply.
But during the study of the entire process of working,
installation and utilization at user end, certain important
factors /effects has been observed. They need this system to
be reconsidered from environmental and security point of
view. Though the smart grid is smart enough to incorporate
the observations related to environment. The radio frequency
used to control the entire operation of smart meters and grid is
hampering the life cycle of human being, as it causes some
non curable diseases to the old people. So it is recommended
to use the existing telephone optical cables to control the
smart operation. It will reduce the installation cost and saves
the environment. The developing countries can deploy such
smart meters with already existing FO cables serving the
telephone network.
General Terms
Smart Grid, Radio Waves
Keywords
Distribution Automation (DA), Personal Energy Management
(PEM), Advanced Metering Infrastructure (AMI).
1. INTRODUCTION
A smart grid is a power grid equipped with the advanced
technologies dedicated for purposes. They capture the
information about the suppliers and consumers in a highly
automated way so that we can improve the efficiency and
reliability. The production and distribution of electricity will
be more sustainable and economical as we are going to rely
on natural resources. e.g. Solar and wind energy [1]. A two
way communication system is formulated to develop
continuous connectivity among the consumer and electric
power suppliers (see Figure1). A radio frequency based
system is established for this purpose. With such highly
automatic system even homes which are consuming less
energy as compared to the electricity produced by the natural
solar consumer installed in the house hold unit can sell the
electricity to the another one who is consuming more. The
two way communication system takes care of consumption,
utilization and cost procurement [2]. The smart grid with
smart meter running on software controlled system hence
proves to be more effective in both utility as well as cost wise.
589
ISBN: 978-81-924893-0-8
Gagandeep Kaur
Assistant Professor
Deptt of Electrical & Instrumentation
Engg
Thapar University, Patiala
gagandeep@thapar.edu
This system consists of three technical components --
Distribution Automation (DA), Personal Energy Management
(PEM) and Advanced Metering Infrastructure (AMI).
The first one i.e. DA, Distribution Automation System
provides tools for the distribution of power in the network and
maintains its security. It is an economical operation. It
guarantees power quality as well as increasing the working
efficiency of the power system. Distribution automation
system provides the solutions to improve the power grid
monitoring, control, failure management and power balance.
By making use of real-time monitoring and intelligent control,
it improves the reliability of the system [3]. Speed of the
network can be enhanced to a higher level by making use of
D.A. The devices of Distribution Automation (DA) are robust
and reliable and they have the tendency to offer high
computing power, due to which they act as a source of
planning data. The analysis of the status of the devices such
as: switches, capacitor banks, voltage regulators and
transformers in real time is possible in smart grid due to the
presence of the D.A. in the system. These advantages of D.A.
improve fault location and isolation. It also increases energy
efficiency through better capacitor, voltage control and
improved asset management [4].
Secondly, Personal Energy Management (PEM) is a critical
component of the smart grid. It directly connects the energy
consumers in monitoring and controlled energy use. It
provides tools to control the peak load uniformly. PEM
support new sources of generation. e.g. Solar and wind
energy. It provides new methods to the consumers to make
smart use of electricity in the cheapest way. Thus Personal
energy management is the future of energy efficiency. PEM
motivate the use of Home Area Network so that consumer
gets directly engaged with the energy management process.
Smart grid with its smart meter make use of Zig Bee
communication which is a low power wireless communication
technology provides a standards based approach for home
automation. The integration of smart grid, smart meters and
Zig bee communication provides a variety of personal energy
management features including
1. Consumers can notify the cost of units in peak hours and
time of use rates with the help of in-home display. These in-
home display also aware the consumer about the real energy
usage.
2. The commercial and agricultural appliances are controlled
through load reduction programs, provides a reliable power
system.
3. Programmable thermostats are used for control of air
conditioners and heating systems during peak periods [5].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Finally Advanced metering infrastructure (AMI) is
architecture of two-way communication between a smart
Figure 1. Structure of Smart Grid
meter with an IP address and a head end systems. It involves
the intelligent usage of electricity because the customers are
aware about the pricing rates of electricity. This system also
explains that when the demand is high or low and the
customers can use their electric appliances accordingly. AMI
involves many features to manage the peak loads like:
1. Demand Metering which is a billing method in which the
customer is charged for the normal energy usage plus an
additional charge for the peak usage.
2. Time of Use Metering which is again a billing method
where the utility varies the price of electricity during different
periods of a 24 hour day depending on OFF peak and ON
peak hours [6].
2. SMART METERS
The most important requirement for smart grid is the
intelligent and smart meter (see Figure 2). It is installed on the
consumer side. Smart metering is possible without the smart
grid but the smart grid is built on smart metering. A smart
meter is usually an electrical meter that records consumption
of electric energy in intervals of an hour or less and
communicates that information at least daily back to the
utility for monitoring and billing purposes. Smart meters
enable two-way communication between the meter and the
central system. The smart meter will not only keep track of
how much electricity we are using but it is also able to control
and regulate usage of electricity [7].
In this paper three relevant case studies are analyzed to
develop more sophisticated model of smart system. In first
case study in 2009, Pacific Gas and Electric’s (PG&E) invest
US$ 2.2 billion for the installation of 10-million smart meter
in Bakersfield, California, USA. The consumer claims that
individual’s average bills jumped from about US$ 200 a
month to about US$ 500 to US$ 600 a month after they
received a smart meter. Thus there is an increment of three
times in the bills of consumers. These observations are
contributory for the design of economical and effective
metering system is one care that must be undertaken [8].
590
ISBN: 978-81-924893-0-8
In the second case study we found an organization in
Germany namely as Yello Strom. This organization
established the Yello Sparzahler - an online, user-friendly
smart electricity meter that uses existing market standards. By
using these meter and Yello website, customers can get the
information about their energy consumption data and power
bill. It provides the Smart Meter service around the consumer
through broadband connection, with the advantage of making
data available faster to the consumer without having to build
an another network.[8]
Lastly in the third case study State Grid Corporation of China
(SGCC) is running a project at Shanghai, China in 2010. This
project include nine sub-projects of power system namely
Smart Substation (SS) , Distribution Automation(DA), Fault
Restoration Management System(FRMS), Power Quality
Monitoring (PQM), Customer Energy Usage Collection
System (CEUCS), Energy Storage System (ESS), Renewable
Energy Integration (REI), Smart Building/Home (SB/SH) and
EV Charging/Discharging Station Operation.
This whole project spreads in a 4,000-square-metre area
named as Magic Box which explain the smart grid technology
and provide the opportunity for people to experience smart
grid technologies. It is an excellent example of smart
substations realizing smart monitoring, digital power
metering, fault recording, a relay protection network and
automatic trip, based on the GOOSE protocol. Visitors can
see the smart grid control centre technology, smart grid
transmission, IT platforms and visualization displays. They
analyze how the smart communities and smart homes of the
future will improve people’s lives, facilitate the interaction of
the customer with the power grid, increase convenience levels
and improve the economy of electricity consumption. The
two-way interactive display shows energy saving benefits of
optimized energy usage decisions such as reduced CO2
emissions and energy bill reduction. This “Magic Box” is
helping consumers to engage with smart grid technologies and
understand the technologies valuable role in enabling modern
living, has received over 2.6 million visitors. From this we
conclude that Chinese government shows the model set up in
4000 acres land so that people, the consumers become aware
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
about the smart grid and its benefits for the consumer itself.
[8]
Fig 2: Block diagram of smart meter
3. RADIO FREQUENCY WAVES
Radio frequency waves are used for the communication
between smart meters, smart grid and the consumer. These
waves have frequencies from 300 GHz to as low as 3 KHz
and corresponding wavelengths from 1 millimeter to 100
kilometers. These waves travel at the speed of light. Various
wireless applications are possible only due to radio waves
such as fixed and mobile radio communication, broadcasting,
radar and other navigation systems, satellite communication,
computer networks and innumerable other applications[9].
4. ENVIRONMENTAL AND HEALTH
PROBLEM
As there are many advantages of radio waves but there are
many types of problems related to these waves –
environmental and health problems elaborated in the
following section [10].
1. Studies show that when cell towers are installed cows have
increased cancers, lower milk production, agitation, immune
system disorders, more mastitis, miscarriages, and birth
defects in offspring near cell towers. Birds with nests near
antennas display lower reproductive rates, and chicks are born
with birth defects. In simulations of whole colony collapse
disorder, bees have disappeared entirely when transmitting
cell phones were placed next to their hive.
2. Trees also endure die-back near towers. Whole forests near
broadcast antennas in Europe have suffered.
3. Fifteen studies report effects among people living 50-to-
1500 feet from a cell tower -- including cancers, immune
system effects, fertility problems, heart arrhythmias,
miscarriages, sleeplessness, dizziness, concentration
difficulties, memory loss, headaches, skin rashes, lowered
libido, fatigue and malaise.
4. People with implanted medical devices like deep-brain
stimulators for Parkinson’s, some pacemakers, insulin pumps,
and in-home hospital equipment. The radiofrequency
interference inherent to Smart Grids can cause malfunctioning
of such equipments, or even to stop [10].
.
5. ECONOMIC PROBLEMS
1. “Secure,” Smart Grids can be penetrated by both wired and
wireless networks. In August of 2009, hackers robbed
179,000 Toronto Hydro customer’s names, addresses, and
billing information from their e-billing accounts.
2. Ross Anderson and Shailendra Fuloria at Cambridge
University’s Computer Laboratory note that hostile
591
ISBN: 978-81-924893-0-8
government agencies or terrorist organizations could bring
whole countries to their knees by interrupting electrical
generation. More so than traditional grids, they stress that
Smart Grids create a new strategic vulnerability as the cyber
equivalent of a nuclear attack. Smart Grids are also easy to
sabotage with simple jamming devices. [10]
3. People are complaining of ceiling fans turning on in the
middle of the night, speeds spontaneously changing, paddles
reversing direction, and circuit boards burning up. A few
meters have exploded. Fire takes place in many of the smart
meters. In New Zealand firefighters report 422 fires in 2010
involved with Smart Meters. [10, 11]
4. If we work in the evening shift and cook dinner at midnight
at electric chullah’s, your rate could be highest when everyone
else’s is lowest. Then there’s mandatory shut-offs for people
who don’t pay their utility bills -- after which the unfortunate
customer will have to buy a prepaid wireless-enacted electric
meter like a prepaid phone card. Such a system was enacted in
South Africa in the 1990s.
5. According to the Wall Street Journal, Palmisano told that a
$10 billion investment is needed to start a Smart Grids that
will create 239,000 new jobs but there is a jobs lost, such as
hundreds of thousands of unemployed meter readers.
6. 2010’s federal appropriations for Smart Grids were $11
billion. But some financial analysts say it will take over $900
billion over the next two decades to upgrade high-tension
lines, meters, central control facilities and substations. In
addition, they say to truly digitize and digitalize grids, it will
cost hundreds of billions more, into 2030, because every
utility’s computer network will need to be upgraded, new
renewable-energy sources will be needed to plug into new
access points, and recharging stations and power lines will
need to be built.
7. If solar panels are installed for creation of renewable-
energy sources and then such energy can be sold back to the
grid without very expensive equipment [11, 12].
6. CONCLUSION
Smart grid can make the power system more efficient and
flexible. It maintains the load balancing in a country. It
monitors the consumer consumption and can warn and advice
consumer about the present rate of units which are variable as
the consumption varies, with which consumer can maintain
their bills. And also overloading can be taken care of. Smart
grid also makes possible the use of renewable energy sources
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
like solar and wind energy by integrating with the existing
system. But with the use of smart grid many human health
related problems are affecting the life which are observed in
the developed countries like U.S.A where they are already
efficiently used, due to the use of radio frequency waves on
which smart meters work.
7. FUTURE SCOPE
Smart grid can make the power system more efficient and
flexible. It maintains the load balancing in a country. It
monitors the consumer consumption and can warn and advice
consumer about the present rate of units which are variable as
the consumption varies, with which consumer can maintain
their bills. And also overloading can be taken care of. Smart
grid also makes possible the use of renewable energy sources
like solar and wind energy by integrating with the existing
system. But with the use of smart grid many human health
related problems are affecting the life which are observed in
the developed countries like U.S.A where they are already
efficiently used, due to the use of radio frequency waves on
which smart meters work.
REFERENCES
[1] Bowman, M., Debray, S. K., and Peterson, L. L. 1993.
Reasoning about naming systems. .
592
ISBN: 978-81-924893-0-8
[2] Ding, W. and Marchionini, G. 1997 A Study on Video
Browsing Strategies. Technical Report. University of
Maryland at College Park.
[3] Fröhlich, B. and Plate, J. 2000. The cubic mouse: a new
device for three-dimensional input. In Proceedings of the
SIGCHI Conference on Human Factors in Computing
Systems
[4] Tavel, P. 2007 Modeling and Simulation Design. AK
Peters Ltd.
[5] Sannella, M. J. 1994 Constraint Satisfaction and
Debugging for Interactive User Interfaces. Doctoral
Thesis. UMI Order Number: UMI Order No. GAX95-
09398., University of Washington.
[6] Forman, G. 2003. An extensive empirical study of
feature selection metrics for text classification. J. Mach.
Learn. Res. 3 (Mar. 2003), 1289-1305.
[7] Brown, L. D., Hua, H., and Gao, C. 2003. A widget
framework for augmented interaction in SCAPE.
[8] Y.T. Yu, M.F. Lau, "A comparison of MC/DC,
MUMCUT and several other coverage criteria for logical
decisions", Journal of Systems and Software, 2005, in
press.
[9] Spector, A. Z. 1989. Achieving application requirements.
In Distributed Systems, S. Mullender
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
RECENT ADVANCES IN FRICTION STIR WELDING FOR
FABRICATION OF COMPOSITE MATERIALS
Gurmeet Singh Cheema Prem Sagar
Head & Professor, Department Research Scholar
of Mechanical Engineering, PTU, Jalandhar
BGIET, Sangrur jasujaprem@gmail.com
gcheemamand@gmail.com
ABSTRACT
Friction stir welding (FSW) is a solid state joining process.
Different composites have been fabricated via friction stir
welding. This research article studies about the latest
developments in friction stir welding processes for the
fabrication of different alloy materials with different
reinforced particles. In addition microstructure and
mechanical properties of reinforced composites was studied.
Finally a conclusion was drawn that owing to versatile nature
of FSW there is still a lots of scope is available to fabricate
other useful materials.
Keywords
FSW, Alloy materials, microstructural, mechanical properties.
1. INTRODUCTION
Friction stir welding technique was initiated by TWI, England
especially for the materials which were hard to weld by fusion
welding. FSW is widely used in aerospace industry for the
welding of materials like aluminum, magnesium and titanium.
The schematic diagram of the basic principal of FSW process
is given in fig.1. FSW uses a non-consumable tool with
threaded or plane surface. This tool is made up of hard
material. During welding process axial force applied on the
tool to pinned it into the work piece material. The key benefits
of FSW are summarized in Table 1.
2. Literature Review
Cioffi.et.al.[1], welded 8mm thick 2024 Al alloy with 17%
SiC/2124 Al composite to find out the effect of lateral off-set
on strength and fracture location of the butt joint via using
friction stir welding process with unthreaded WC-CO tool.
They concluded that diagonal setup to be an efficient way to
find the appropriate welding parameters for a range of lateral
off-sets and it influences the fracture location and resistance
of the dissimilar friction stir welds. However, a lateral offset
of around 1.5 mm into the alloy and a slightly deeper plunging
could overtake the resistance of the traditional centered setup,
by improving the bonding quality in the bottom section of the
alloy-composite boundary. Lateral off-set could be used as a
parameter to improve the resistance of; not only dissimilar
MMC-Alloy joints, but also friction stir welds of other
materials. Because it changes the amount of deformation that
the joint line goes through.
Liu.et.al. [2], studied the influence of welding parameters on
microstructure and mechanical properties of fabricated
AC4A+30 vol. % SiC via friction stir welding. Defect free
joints at 25-150mm/min. welding speed and 200 r.p.m. can be
obtained. Decrease of weld strength was reported because of
high weld speed. Tensile strength of the joint was tested along
with their fracture location. Also they analyzed that low
welding speed cause high heat affected zone which makes the
material softer.
593
ISBN: 978-81-924893-0-8
Vikash
Research Scholar
PTU, Jalandhar
Vikasjangra281@gmail.com
Sirahbizu. Et. al.[3], investigated the effect of Al +
12%Si/10 wt%TiC in situ composites. They also concluded
that tool rotational speed and tool type to be the most
influential welding variables to develop sound FSW joints of
Al + 12%Si/10 wt%TiC in situ composites. Accordingly, in
the same experimental conditions, 710 rpm tool rotational
speed and 20 mm tool shoulder diameter were preferable
welding parameter for better UTS, percentage elongation and
micro-hardness of the butt joints. The developed multiple
regression equations satisfactorily predicted the influence of
the input variables. The observed errors in the test cases were
0.52–10.41% for UTS, 7.9–9.89% for percentage elongation
and 6.99–10.12% for micro-hardness. The optimality test
results also exhibited 0.07–2.98% error. It was concluded that
the adopted optimization technique is adequate for the current
experimental conditions.
L.Dumpala and D. Lokanadham.[4],elaborate the effect of
friction stir welding on size and distribution of reinforced
particle in composite. Further they provides the idea of
converting conventional milling to CNC operating milling
machine along with they determined an approximate
analytical technique for the calculation of welding flow in
three dimensions, based on viscous flow of an incompressible
fluid induced by a solid rotating disk. The computed velocity
fields for the welding of an aluminum alloy, steel and a
titanium alloy are compared with those obtained from a well-
tested and comprehensive numerical model. They also
presented an improved non-dimensional correlation to
estimate the peak temperature, and an analytical method to
estimate torque. The proposed correlation for the peak
temperature is tested against experimental data for different
weld pitch for three aluminum alloys. The computed torque
values are tested against corresponding measurements for
various tool rotational speeds. The hardness in the TMAZ has
also been correlated with the chemical composition of
aluminum alloys. Nanoparticles used was rice hush ash with
2%, 4% and 8% wt. fraction for the fabrication of A356.2
alloy, Scanning electron microscope equipped with energy
dispersive X-ray analyzer is used for micro structural
characterization, presence of silicon particles in the
composites. Finally they concluded that as the percentage of
RHA particles increases, the density of the composites
decreases and slight increase in the hardness also was
observed.
Jeon et.al.[5], prepared a lap joint of metal matrix composites
i.e Graphite & aluminum metal via friction stir spot welding
technique. Graphite grade 230u and Alumunium 5052-H32
alloy sheet of 3mm was used. Prior to FSSW, the graphite
reinforcement was prepared in the form of graphite/water
colloid (25 wt. % graphite concentration) and applied on the
surface of the upper sheet because the fine-size reinforcement,
i.e., the graphite, can be safely stirred into the matrix while
the risk that the graphite is swept and dispersed into the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
atmosphere by a rapidly rotating tool is minimized. They
considered input parameters like rotation speed, tool depth,
shoulder diameter, pin diameter and pin length to study the
effect on micro hardness and shear test. Finally Raman spectra
and SEM tests was conducted to ensure the successful
distribution of particulates. Further Al1050-H14 was also
fabricated to draw the comparison.
R. L. Suvarna and A. Kumar [6], suggested the optimum
conditions for the fabrication of Cu-Al2O3 composite via
FSW. The Taguchi technique was applied for the optimization
of input parameters of FSW (volume percentage of reinforced
particles, tool tilt angle and concave angle of shoulder) on
output parameters like microstructure properties, ultimate
tensile strength, yield strength, % elongation, hardness and
impact toughness. Also scanning electron microscopy was
used to study the microstructure, fracture morphology and
nature of fracture. Via microstructure and fracture feature they
concluded presence of refinement of grains and tensile
strength of the composite increases with the increase in
volume fraction of the particulates. Findings of the study
outlines that volume % at 12,tilt angle 2° and concave angle
at 4° gives the optimum condition for all UTS,YS,IT and
micro hardness of the composite.
Kalaiselvan et.al. [7], The microstructure of friction stir
welded AA6061/B4C AMC was divided into four zones; (i)
parent composite, (ii) heat affected zone, (iii)
thermomechanically affected zone and (iv) weld zone.It was
difficult to differentiate HAZ and parent composite. TMAZ
showed a parallel band like distribution of B4C particles and
elongated grains. The weld zone was characterized by a
homogenous distribution of B4C particles. The hardness of
weld zone was higher than that of parent composite. The
tensile strength of welded joint was comparable to the
strength of the parent composite under experimental
conditions. But FSW reduced the ductility of the joints. The
fracture mode changed from ductile to brittle subsequent to
FSW.
D. R. Ni .et.al. [8], welded NiTip/6061Al composites FSP
using a novel multi-hole particle presetting mode, which
could effectively prevent the agglomeration and loss of
particles. The NiTip were homogeneously distributed in the
Al matrix without discernible interfacial products. The
composite exhibited a phase transformation behavior similar
to that of the as-received NiTip. The composite reinforced by
the small NiTip showed higher strength than that by the large
NiTip. The aging treatment provided a comparable
strengthening effect on composite. The strengths of both the
aging-treated and T6-treated composites reinforced by small
particles were higher than those of the as-received T651 BM.
The SEM fractographs showed that the bonding between the
TiNip and the Al matrix was good without interfacial
debonding under both the as-FSP and T6-treatment
conditions.
C. Devanathan and A. S. Babu[9], investigated the effect of
process parameters by using ANNOVA,S/N method on
friction stir welding of LM 25 Al alloy with 5% SiC
particulate using TiAIN coated tool. They considered
parameters like tool rotation speed, transverse speed and axial
force to investigate their effect on tensile strength. Findings
suggested that no tool wear was observed and axial force
affect 35%, transverse speed 25% and spindle speed 12% to
increase the final value of tensile strength of the composite
material.
594
ISBN: 978-81-924893-0-8
Prater [10], applied Taguchi L27 array for characterizing the
variation of tool wear in FSW of Al359/SiC/20% measuring
0.635cm in thickness considering different levels of input
parameters like rotation speed, transverse speed and length of
weld. Tools were mounted in an optics bench and close-up
images of the probe were imported into imaging software.
Wear of the probe was quantified by comparing pre-weld
images. The percent tool loss was calculated based on the
degradation in cross sectional area. A 1 cm square grid fixed
behind the tool was used to convert area measurements from
pixels to square centimeters. Tool wear in FSW of MMCs is
observed to be circumferentially symmetric. A multiple
regression model (MRM) was constructed to estimate the
volume loss the tool will experience. Expression derived from
the regression analysis was strongly correlated with
experimental data with any empirically based predictive
model,a more definitive assessment can be obtained by testing
the model on a validation set comprised of cases separate
from those in the original data set. The predicted and observed
wear values for the validation set are closely aligned. Based
on the multivariate regression analysis, tool wear in FSW of
MMCs is directly proportional to rotation rate and distance
welded but inversely proportional to traverse speed.
Zhang. Et. Al.[11], works to increase the mechanical and
microstructural properties of friction stir welded AA2024-T3
sheets via using backing plates made up of pure copper and
carbon steel. Findings suggests that these plates availed high
temperature at the nugget zone and simultaneously provided
cooling effect at thermally heat affected zone and heat
affected zone. Also they concluded that grains under
composites backing plates are completely refined as compared
to those monolithic plates. A good correlation has been
established between findings through microstructure tests
reports and observation through mechanical testing.
D. W. B. L. Xiao and D. R. N. Z. Y. Ma [12], reported
welding tool wear for 6061/Al and reinforced
Al2O3/6061.Finding suggested that serious welding tool wear
were observed. Also they suggested that both nanoparticles
volume fraction and welding tool affect the aluminum matrix
composite. Further they concludes that high reinforcement
composites requires tool materials with high hardness and
toughness, however with low reinforcement volume fraction
wearing of the tools was significantly reduced and the sound
joints could be achieved at high welding speed for the AMCs
when the hard materials such as Ferro-Titanit alloy, cermet,
and WC/Co were used as welding tools.
Thangarasu .et.al.[13], AA6082/TiC AMCs were
synthesized using FSP and the effect of TiC particles along
with its volume fraction on microstructure, mechanical and
sliding wear behaviour was analyzed. They concluded that the
volume fraction of TiC particles influenced the area of the
composite. The area of FSP zone was observed to be 65 mm2
at 0 vol.% and the area of the composite was 34 mm2 at 24
vol.%. Further they concluded that both microhardness and
the UTS increase when the volume fraction of TiC particles
was increased. The microhardness was found to be 62 HV at 0
vol.% and 149 HV at 24 vol.%. The UTS was estimated to be
222 MPa at 0 vol.% and 382 MPa at 24 vol.%. Also TiC
particles influenced the morphology of the fracture surface.
The increased content of TiC particles has increased the
stiffness and wear resistance of the matrix and reduced the
formation of voids along with wear rate. The wear rate was
found to be 693× 10-5 mm3/m at 0 vol.% and 303×10-5mm3/m
at 24 vol.%. The increased volume fraction of TiC particles
altered the wear mode from adhesion to abrasive.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Sathiskumar et.al. [14], variety of ceramic particles such as
SiC, TiC, B4C, WC and Al2O3, were used for the fabrication
of copper surface composites using FSP. Empirical
relationships incorporating the FSP parameters were
developed to predict the properties of copper surface
composites such as the area of the surface composite,
microhardness and wear rate. FSP process parameters such as
tool rotational speed, traverse speed and groove width
influenced the area of the surface composite. All those process
parameters and the type of ceramic particle influenced the
microhardness and wear rate of the surface composite. Higher
tool rotational speed, lower traverse speed and minimum
groove width yielded higher area of surface composite.
Higher tool rotational speed and lower traverse speed
produced a fine distribution of ceramic particles in the surface
composite. The groove width and the type of ceramic particle
did not influence the distribution of ceramic particles
significantly. Lower tool rotational speed, higher traverse
speed, maximum groove width and B4C ceramic particle
resulted in higher microhardness and lower wear rate of the
surface composite.
Thangarasu et.al. [15], produced AA6082/TiC alumunium
matrix composites by friction stir processing technique using
high carbon high chromium tool with threaded profile. Further
they studied the effect of increase in transverse speed from
40-80mm/min on microstructure and mechanical properties of
the composite. Results of their work outline that transverse
speed influence the area of surface composition inversely and
to grain size,hardness and TiC dispersion directly.
Salehi et.al. [16], investigate the effect of SiC particles on
functionally graded 6061 aluminum plate by using different
tool with pin length of 6 mm and of 3.2 mm. Microstructural
observations indicated a proper distribution of SiC
nanonparticles in the Al 6061 matrix. Composition of FG
sample was changed from 18 to 0 wt% SiC along the five
layers in which Layers I, III and V showed a constant
concentration of SiC nanoparticles. Highest value of
microhardness was achieved in FG sample i.e 160 Hv, which
is 3.2 times higher than that of the base metal.
Sabbaghian et.al. [17], studied the effect of TiC nano-
particles on the mechanical and microstructure of pure Cu
matrix composite fabricated via friction stir processing.
Friction stir processing was carried out with transverse and
Fig 1: Basic Principal of FSW
3. CONCLUSION
Following conclusion are drawn
1) Increasing the number of reinforced particles increases the
tensile strength but simultaneously makes it too brittle.
595
ISBN: 978-81-924893-0-8
rotational speeds of 50mm/min and 1000rpm, respectively.
Optical and scanning electron microscope observations
revealed that FSP produced a fine grain microstructure with a
homogeneous distribution of particles on the surface. Their
work results that increasing TiC reinforcement resulted in
higher hardness and wear resistance in stir zone.
Khodabakhshi et.al. [18], used different volume fraction i.e
3%, 5% and 6% of TiO2 with an average size of 30 nm
nanoparticles for friction stir processing of Al-Mg alloy.
Grooves with dimensions of 4 mm (depth) and 1.2 mm
(width) were machined in commercial AA5052-H32 sheets of
thickness 5 mm thickness. Fine grains up to 2-3µm were
reported in metal matrix composite after adding TiO2 which
were 60µm earlier. Further they annealed the Nano-
composites up to 300-500°c in air for 1-5 hr. Annealing
process increases the ductility, ultimate strength and
percentage elongation and reduced yield strength without
affecting the tensile strength. However they suggested that
annealing beyond 500°c shows abnormal results. Finally
outcomes of mechanical properties are correlated with
microstructure analysis observed by SEM and TEM tests.
Table 1. Key benefits of FSW are summarized below
Metallurgical benefits Environmental benefits
Solid phase process. Consumable materials
saving.
Low distortion of work Eliminate grinding wastes
piece.
No loss of alloying No surface cleaning
required.
elements
Good dimensional stability Eliminate grinding wastes.
& repeatability.
Absence of cracking
Fine microstructure
2) Almost all fabricated composites leads to weld free defects.
3) Tool geometry and Tool rotation influenced the mechanical
and microstructure characteristics.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4) Tools made up of tool steel exhibits serious wearing.
5) Elastic modulus, specific modulus can be taken into
account.
REFERENCES
[1] F. Cioffi, J. Ibáñez, R. Fernández, and G. González-
doncel, “The effect of lateral off-set on the tensile
strength and fracture of dissimilar friction stir welds ,
2024Al alloy and 17 % SiC / 2124Al composite,” J.
Mater., vol. 65, pp. 438–446, 2015.
[2] H. Liu, Y. Hu, Y. Zhao, and H. Fujii, “Microstructure
and mechanical properties of friction stir welded AC4A
+ 30 vol .% SiCp composite,” J. Mater., vol. 65, pp.
395–400, 2015.
[3] B. Sirahbizu, D. Venkateswarlu, M. M. Mahapatra, P.
K. Jha, and N. R. Mandal, “On friction stir butt welding
of Al + 12Si / 10 wt % TiC in situ composite,” Mater.
Des., vol. 54, pp. 1019–1027, 2014.
[4] L. Dumpala and D. Lokanadham, “Low Cost Friction
Stir Welding Of Aluminium Nanocomposite - A
Review,” Procedia Mater. Sci., vol. 6, no. Icmpc, pp.
1761–1769, 2014.
[5] C. Jeon, Y. Jeong, S. Hong, T. Hasan, H. N. Tien, S.
Hur, and Y. Kwon, “Mechanical properties of graphite /
aluminum metal matrix composite joints by friction stir
spot welding ,” vol. 28, no. 2, pp. 499–504, 2014.
[12] D. W. B. L. Xiao and D. R. N. Z. Y. Ma, “Friction Stir
Welding of Discontinuously Reinforced Aluminum
Matrix Composites : A Review,” vol. 27, no. 5, pp.
816–824, 2014.
[13] A. Thangarasu, N. Murugan, I. Dinaharan, and S. J.
Vijay, “Synthesis and characterization of titanium
carbide particulate reinforced AA6082 aluminium alloy
composites via friction stir processing,” Arch. Civ.
Mech. Eng., pp. 1–11, 2014.
[14] R. Sathiskumar, N. Murugan, I. Dinaharan, and S. J.
Vijay, “Prediction of mechanical and wear properties of
copper surface composites fabricated using friction stir
processing,” J. Mater., vol. 55, pp. 224–234, 2014.
[15] A.Thangarasu,N.Murugan,I.Dinaharan, “ Infulence of
transverse speed on microstructural and mechanical
properties of AA6082-Ti1C surface composite
fabricated by Friction stir processing” vol. 5, pp. 2115–
2121, 2014.
[16] M. Salehi, H. Farnoush, and J. Aghazadeh, “Fabrication
and characterization of functionally graded Al – SiC
nanocomposite by using a novel multistep friction stir
processing,” J. Mater., vol. 63, pp. 419–426, 2014.
[17] M. Sabbaghian, M. Shamanian, H. R. Akramifard, and
M. Esmailzadeh, “Effect of friction stir processing on
the microstructure and mechanical properties of Cu –
TiC composite,” Ceram. Int., vol. 40, no. 8, pp. 12969–
12976, 2014.

[6] R. L. Suvarna and A. Kumar, “Influence of Al 2 O 3 [18] F. Khodabakhshi, A. Simchi, A. H. Kokabi, A. P.

particles on the microstructure and mechanical Gerlich, and M. Nosko, “Effects of post-annealing on
properties of copper surface composites fabricated by the microstructure and mechanical properties of friction
friction stir processing,” Def. Technol., no. September, stir processed Al – Mg – TiO 2 nanocomposites,” J.
pp. 1–9, 2014. Mater., vol. 63, pp. 30–41, 2014.

[7] K. Kalaiselvan, I. Dinaharan, and N. Murugan,

“Characterization of friction stir welded boron carbide
particulate reinforced AA6061 aluminum alloy stir cast
composite,” J. Mater., vol. 55, pp. 176–182, 2014.

[8] D. R. Ni, J. J. Wang, Z. N. Zhou, and Z. Y. Ma,

“Fabrication and mechanical properties of bulk NiTip /
Al composites prepared by friction stir processing,” vol.
586, pp. 368–374, 2014.

[9] C. Devanathan and A. S. Babu, “Friction Stir Welding

of Metal Matrix Composite using Coated tool,” vol. 6,
no. Icmpc, pp. 1470–1475, 2014.

[10] T. Prater, “Friction Stir Welding of Metal Matrix

Composites for use in aerospace structures $,” Acta
Astronaut., vol. 93, pp. 366–373, 2014.

[11] Z. H. Zhang, W. Y. Li, Y. Feng, J. L. Li, and Y. J.

Chao, “A Improving mechanical properties of friction
stir welded AA2024-T3 joints by using a composite
backplate,” vol. 598, pp. 312–318, 2014.

596
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
RECENT DEVELOPMENT IN ALUMINIUM ALLOYS FOR
THE ADVANCE COMPOSITE MATERIAL IN INDUSTRY
Mohan Singh
Research Scholar (Ph.D.)
Punjab Technical University
Jalandhar Punjab, India
msingh1976@yahoo.com
ABSTRACT
Modern trends in research and development of new
aluminium alloys are characterized in the present work.
Although conventional wrought and casting Al-based alloys
show good specific strength, as compared to steels or Ti-based
alloys, there is still a potential for significant improvement of
their performance. It consists in application of new alloying
elements, mainly transition metals, and uncommon processing
route. By this way, qualitatively new materials with ultra-high
strength and excellent thermal stability can be developed.This
presentation reviews recent developments in aluminium alloys
to improve formability, surface quality in both 5000 and 6000
alloys, and the bake hardening response of 6000 alloys. New
approach in improving thermal stability of Al-base alloys is
alloying with transition metals (TM)having low diffusion
coefficients in solid aluminium The slow diffusivity of
elements retards structure transformations at elevated
temperatures, such as grain growth, coarsening of
intermetallic phases etc., which are reasons for the strength
and hardness reduction.
Keywords: Aluminium alloy, High-strength, thermal stability,
Composite Tool, Microstructure, Scanning Electron
Microscope
1. INTRODUCTION
Metal Matrix Composite (MMC) is engineered combination
of metal (Matrix) and hard particles (Reinforcement) to
tailored properties. Metal Matrix Composites (MMC’s) have
very light weight, high strength, and stiffness and exhibit
greater resistance to corrosion, oxidation and wear. Fatigue
resistance is an especially important property of Al-MMC,
which is essential for automotive application. These properties
are not achievable with lightweight monolithic titanium,
magnesium, and aluminum alloys. Particulate metal matrix
composites have nearly isotropic properties when compared to
long fiber reinforced composite. But the mechanical
behaviour of the composite depends on the matrix material
composition, size, and weight fraction of the reinforcement
and method utilized to manufacture the composite. The
distribution of the reinforcement particles in the matrix alloy
is influenced by several factors such as rheological behaviour
of the matrix melt, the particle incorporation method,
interaction of particles and the matrix before, during, and after
mixing. Non homogeneous particle distribution is one of the
greatestproblems in casting of metal matrix composites. Nai
and Gupta reported that the average coefficient of thermal
expansion of the high SiCp end was reduced as compared to
that of the low SiCp end. Hashimet
597
ISBN: 978-81-924893-0-8
Balwinder Singh Sidhu
Department of Mechanical Engineering
PTU Campus, GZSCET
Bhatinda, Punjab, India
drbwssidhu07@gmail.com
al. reported that the distribution of the reinforcement material
in the matrix must be uniform and the wettability or bonding
between these substances should be optimized. Aluminum-
silicon carbide metal matrix composite has low density and
light weight, high temperature strength, hardness and
stiffness, high fatigue strength and wear resistance etc. in
comparison to the monolithic materials . However, aluminum
alloy with discontinuous ceramic reinforced MMC is rapidly
replacing conventional materials in various automotive,
aerospace, and automobile industries . Amongst various
processing routes stir casting is one of the promising liquid
metallurgy technique utilized to fabricate the composites. The
process is simple, flexible, and applicable for large quantity
production. The liquid metallurgy technique is the most
economical of all the available technique in producing of
MMC .Aluminum alloy-based composites containing 10wt%
alumina (size range: 150-225 mm) were prepared by liquid
metallurgy technique using the vortex method. The ZnO
whiskers 25 vol% reinforced with Al-matrix composites were
fabricated by a squeeze casting process. The quartz-silicon
dioxide particulates reinforced LM6 alloy matrix composites
were fabricated by carbon dioxide sand moulding process.
Various researchers have utilized conventional stir casting
technique for producing MMC but still applied research is
needed for successful utilization of the process for
manufacturing of MMC.
Recently, development effort to apply wrought aluminium is
becoming more active than applying aluminium castings.
Forged wheels have been used where the loading conditions
are more extreme and where higher mechanical properties are
required. Wrought aluminium is also finding applications in
heat shields, bumper reinforcements, air bag housings,
pneumatic systems, sumps, seat frames, side impact panels, to
mention but a few. Aluminium alloys have also found
extensive application in heat exchangers. Until 1970,
automotive radiators and heaters were constructed from
copper and brass using soldered joints. The oil crisis in 1974
triggered are-design to lighter-weight structures and heralded
the use of aluminium. The market share of aluminium has
grown steadily over the last 25 years and is now the material
of choice for use in the automotive heat exchanger industry.
Modern, high performance automobiles have many individual
heat exchangers, e.g. engine and transmission cooling, charge
air coolers (CACs), climate control.One obvious and
significant difference between aluminium and steel is the
outstanding bare metal corrosion of the 5xxx and 6xxx
aluminium materials. Increasingly large amounts of steel are
supplied zinc coated to achieve acceptable paint durability,
this is not necessary for aluminium. However, the aluminium
coil or sheet can be supplied with a range of pre-treatment and
primer layers which can improve formability, surface quality
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
and may eliminate the need for E-coating. There is a wide
range of aluminium materials and surface qualities, which can
be chosen, and the growing design and process experience is
enabling the aluminium industry to help the customer
specifying the right material for the application.
In this study stir casting is accepted as a particularly
promising route, currently can be practiced commercially. Its
advantages lie in its simplicity, flexibility and applicability to
large quantity production. It is also attractive because, in
principle, it allows a conventional metal processing route to
be used, and hence minimizes the final cost of the product.
This liquid metallurgy technique is the most economical of all
the available routes for metal matrix composite production,
and allows very large sized components to be fabricated. The
cost of preparing composites material using a casting method
is about one-third to half that of competitive methods, and for
high volume production, it is projected that the cost will fall to
one-tenth . In general, the solidification synthesis of metal
matrix composites involves producing a melt of the selected
matrix material followed by the introduction of a
reinforcement material into the melt. To obtain a suitable
dispersion the stir casting method is used. The solidification
of the melt containing suspended SiC particles is done under
selected conditions to obtain the desired distribution.
From the past review, it is found that the number of research
work on wear behavior of MMCs have been published, but
only few work related to the influence of weight fraction on
mechanical properties like tensile strength, hardness, impact
strength, percentage of elongation etc. have been reported. In
this study, different weight fractions of Silicon Carbide
particulates are added with aluminum matrix to fabricate the
Al/SiC metal matrix composites. Different samples have been
fabricated by melt-stirring casting and their microstructure,
hardness, tensile strength, and impact strength are studied. In
this study the influences of the reinforced particulate size (220
mesh, 300 mesh, 400 mesh) and weight fraction (5%,
10%,15%, 20%) on mechanical properties like Proportionality
(MPa) limit, Tensile strength upper yield point (MPa), Tensile
strength lower yield point (MPa), Ultimate tensile strength
(MPa), Breaking strength (MPa), % Elongation, % Reduction
in area, Hardness (HRB), Density (gm/cc), Impact Strength
(N.m) are investigated.
2. FABRICATION OF Al/SiC METAL
MATRIX COMPOSITES
Silicon Carbide (SiC) reinforced particles of average
particle size 220 mesh, 300 mesh, 400 mesh
respectively are used for casting of Al/SiC-MMCs by
melt-stir technique. Table 1 represents the chemical
composition of commercially available Al-matrix used
for manufacturing of MMC. Different dimensions of
round bars with 5 vol%, 10 vol%, 15 vol% and 20% of
reinforced particles of size 220 mesh, 300 mesh, 400
mesh respectively.
Experiments were carried out to study the effect of
settling the reinforced particulates on the solidification
microstructure and mechanical properties of the
castMMC. In the present study, commercially available
aluminium (AA6063) is used as matrix reinforced with
Silicon Carbide (SiC) particulates. The melting was
carried out in a clay-graphite crucible placed inside the
resistance furnace. An induction resistance furnace with
598
ISBN: 978-81-924893-0-8
temperature regulator cum indicator is utilized for
melting of Al/SiC-MMCs. Figure 1 (a) and (b) show an
induction resistance furnace and temperature regulator
cum indicator, respectively. A design and developed
stirring setup is shown in Figure 1 (c). Aluminium alloy
(Al 6063) was first preheated at 450°C for 2 hours
before melting and SiC particulates were preheated at
1100°C for 1 hour 30 minutes. to improve the wetness
properties by removing the absorbed hydroxide and
other gases. The furnace temperature was first raised
above the melting temperature, that is, 750°C, to melt
the matrix completely and then it was cooled down to
just below the melting temperature to keep the slurry in
a semi-solid state. At this stage the preheated SiC
particles were added and mixed mechanically. The
composite slurry was then reheated to a fully liquid
state and mechanical mixing was carried out for 20min
at 200rpm average stirring speed. In the final stage of
mixing, the furnace temperature was controlled within
760 ± 10°C and the temperature was controlled at
740°C. Moulds (size 40mm diameter ×170mm long)
made of IS-1079/3.15mm thick steel sheet were
preheated to 350°C for 2 hours before pouring the
molten Al/SiC -MMC. Figure 2 (a) shows the prepared
permanent mould made of steel sheet utilized for
casting of 40mm diameter ×170mm long bar. Figure 2
(b) shows mixing again manually before pouring.
Figure 2 (c) shows pouring mixture of molten Al and
SiC particles. Then fabrication of composite was
followed by gravity casting. Similar process was
adapted for preparing the specimens of varying mesh
size and weight fractions.
3. RESULTS AND DISCUSSION
Various Experiments were conducted on fabricated MMCs
samples by varying weight fraction of SiC (10%, 15%, 20 %,)
and size of SiC particles (220 mesh, 300 mesh, 400 mesh) to
analyze the casting performance characteristics of Al/SiC-
MMCs.
4. MICROSTRUCTURE
Metallographic samples were sectioned from the cylindrical
cast bars. A 0.5 % HF solution was used to etch the samples
wherever required. To see the difference in distribution of SiC
particles in the aluminium matrix, microstructure of samples
were developed on Inverted type Metallurgical Microscope
(Make: Nikon, Range-X50 to X1500). Figure 3 shows
Micrograph of Al/Sic-MMC’s samples for different Sizes
(220 mesh, 300 mesh, 400 mesh) and weight fraction (5%,
10%, 15%, 20 %,) of SiC particles. Optical micrographs
showed reasonably uniform distribution of SiC particles. In
this Al matrix SiC particles are clearly labelled.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 1. Micrograph of Al/Sic-MMC’s samples for
different Sizes and weight fraction of SiC particles
Figure 2. Micrograph of Al/Sic-MMC’s samples for
different Sizes and weight fraction of SiC particles
Figure 3. Micrograph of Al/Sic-MMC’s samples for
different Sizes and weight fraction of SiC particles
5. TENSILE STRENGTH
During selection of the alloys or temper for the different parts
an optimum in gauge and strength has to be the goal. Higher
strength is demanded to reduce the gauge of the used
materials and to tolerate higher operating pressures.
Tensile.The test was carried out at room temperature on
Universal Testing Machine Model-UTN-20, Sr.No.-4/79/239,
Max. Capacity-2000 kgs, Make Blue Star Ltd. Figure 4 shows
standard dimensions of specimen for Tensile Test. Test
specimens of standard dimensions as shown in Figure 5. were
599
ISBN: 978-81-924893-0-8
prepared of Al/Sic-MMC’s for different size (220 mesh, 300
mesh, 400 mesh) and weight fraction (10%,15%,20%) of SiC
particles. In this way, the weight of the heat exchanger is
reduced and its performance is improved. This means that
existing materials have to be improved or new solutions have
to be found to fulfill this demand.
Figure 4 Specimens for Tensile Test
Procedure of Tensile Test is shown by Figure 4. Eight
Specimens are shown after test. Graphs were plotted between
tensile force (kgf) and Extension (mm) for twelve specimens.
The values of tensile force are plotted on vertical axes and
extension on horizontal axes. The specimen passes through
the clearly defined stages i.e. limit of proportionality, Upper
yield value, lower yield value, ultimate stress value and finally
fractures strength value.
6. FORMABILITY
High formability is required since the space under the
hood for head exchanger is minimized. This results that
heat-exchanger designer have to come up with drastic
solution to find a way to optimize the heat exchanger
capacity for a limited space. This puts a large demand on the
forming characteristics of brazing sheet. A simple tensile test
is no longer a guarantee to predict the forming behavior of the
material.
7. BRAZE ABILITY
The term braze ability has not been well-defined in scientific
terms. However, it is generally considered to be a measure of
how well the clad layer flows during brazing to manufacture a
joint, without causing erosion of the underlying core material.
The main factors influencing braze ability are the surface
condition of the aluminum alloy (oxide thickness and type and
the presence of residual rolling oil), the atmosphere within the
brazing furnace, temper of the brazing sheet, alloying
elements in clad and core material.
8. HARDNESS
The Rockwell hardness test was done on Rockwell hardness
tester as shown in Figure 3 (a) Model RAB, Sr.No.SN 4144,
make SEU Pvt. Ltd. Twelve samples of Al/Sic-MMC’s for
different sizes and weight fraction of SiC particles were
prepared. Figure 3. (b) and (c) Shows samples after test and
hardness value on dial. The Rockwell hardness values with
reference to scale HRB were taken for all samples and shown
by graphs.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
9. DENSITY
Density of Twelve samples of Al/Sic-MMC’s for different
Sizes and weight fraction of SiC particles were measured by
using Archimedean principle. Standard blocks of 15X15X10
mm were made as sample pieces. The schematic of the set up
designed and fabricated for the density measurement. Steel
rod of 2mm diameter is bent in U shape, one end of the rod is
brazed with the rectangular steel sheet of 3mm thickness and
the other end is free. The whole set up is placed over the
electronic weighing machine pan having least count (LC) of
0.1mg. Distilled water was filled up to a mark in a standard
beaker of 100ml, which was placed over the wooden slab and
it should be free from the electronic balance. Sample pieces
were freely suspended with a piece of thread from the upper
end of the steel rod. Initially weight of the sample in air (w1)
is measured, later the same sample was immersed in distilled
water, andweight (w2) of the sample was recorded. The actual
density was calculated using the following equation.
Density=w1/(w1-w2). Results are shown by graphs.
10. IMPACT STRENGTH
Impact Test was carried out on Izod Impact Testing Machine
and results were recorded in table. According to size and
weight fraction of SiC particles Twelve Specimens Al/Sic-
MMC’s were prepared of Square cross-section of size
(10X10X75) with single V-notches as shown in Figure 4. The
size of V-notches is 45o and 2mm depth. Figure 4 shows
specimens of Al/Sic-MMC’s after IZOD Test.
11. CORROSION
The standard test for corrosion is saltwater acetic acid test
(SWAAT) which is aimed at reproducing lifetime
performance. The different automotive heat exchangers,
radiator, charge air cooler, evaporator, oil cooler, are
subjected to different corrosion environments. This means that
for every application the right alloy has to be selected to
obtain maximum corrosion resistance. This implicates that
every application has to be specifically tested under condition
that simulatedreal life exposure.
12. RESULT GRAPH
Effect of size and weight fraction of SiC particles of Al/Sic-
MMC’s on mechanical properties like Proportionality (MPa)
limit, Tensile strength upper yield point (MPa), Tensile
strength lower yield point (MPa), Ultimate tensile strength
(MPa), Breaking strength (MPa), % Elongation, % Reduction
in area, Hardness (HRB), Density (gm/cc), Impact Strength
(N.m) are presented in graphs [Figure 5 to 14] as shown
hereunder. In these graphs all above properties are taken on
vertical axes and Wt.% of SiC on horizontal axes.
13. CONCLUSION
The experimental study reveals following conclusions: (a)
Microstructure: Optical micrographs showed reasonably
uniform distribution of SiC particles and this is good
agreement with earlier work. Homogenous dispersion of
600
ISBN: 978-81-924893-0-8
SiCparticles in the Al matrix shows an increasing trend in the
samples prepared by applying stirring casting technique.
(b)Tensile Strength: From the result graphs Proportionality
(MPa) limit, Tensile strength upper yield point (MPa), Tensile
strength lower yield point (MPa), Ultimate tensile strength
(MPa) and Breaking strength (MPa) increases with the
increase in reinforced particulate size(220 mesh, 300 mesh,
400 mesh) and weight fraction (5%, 10%, 15%, 20%) of SiC
particles. % Elongation and % Reduction in area decreases
with the increase in reinforced particulate size (220 mesh, 300
meshes, 400 mesh) and weight fraction (5%, 10%, 15%, 20%)
of SiC particles. (c) Hardness (HRB) and Density (gm/cc)
increases with the increase in reinforced particulate size(220
mesh, 300 mesh, 400 mesh) and weight fraction (5%,10%
,15%, 20%) of SiC particles. Maximum Hardness (HRB) = 83
and Maximum Density (gm/cc) = 2.852 gm/cc has been
obtained at 20 % weight fraction of 220 mesh size of SiC
particles. (d) Impact Strength (N.m) decreases with the
increase in reinforced particulate size(220 mesh, 300 mesh,
400 mesh) and increases with the increase in weight fraction(
5%,10%,15%,20%) of SiC particles. Maximum Impact
Strength = 37.01 N-m has been obtained at 20 % weight
fraction of 400 mesh size of SiC particles.
REFERENCES
[1] Hashim, J., Looney, L. and Hashmi, M.S.J., “Particle
Distribution in Metal Matrix Composites,” Part-I, Journal of
Materials Processing Technology, 123: 251-257. 2002.
[2] Nather, S., Brabazon, D. and Looney, L., “Simulation of
the Stir Casting Process,” Journal of Materials Processing
Technology, 143-144: 567-571. 2003.
[3] Nai, S.M.L. and Gupta, M. ,”Synthesis and
Characterization of Free Standing, Bulk Al/Sicp Functionally
Gradient Materials: Effects of Different Stirrer Geometries,”
Material Research Bulletin, 38: 1573-1589. 2003.
[4] Hashim, J., Looney, L. and Hashmi, M.S.J., ”Metal Matrix
Composites: Production by the Stir Casting Method,” Journal
of Materials Processing Technology, 92-93: 1-7. 1999.
[5] Manna, A. and Bhattacharyya, B., “Study on Different
Tooling Systems during Turning for Effective Machining of
Al/SiC-MMC,” The Institution of Engineers (India) Journal-
Production, 83: 46-50. 2003
[6] Allison, J.E. and Cole, G.S., ”Metal Matrix Composite in
Automotive Industry: Opportunities and Challenges,” Journal
of Mechanical Science, 19-24. 1993.
[7] Surappa, M.K., “Microstructure Evolution during
Solidification of DRMMCs: State of the Art,” Journal of
Materials Processing Technology, 630. 1997.
[9] Lloyd, D.J., Lagace, H., Mcleod, A. and Morris, P.L.
(1989). Micro Structural Aspect of Aluminium Silicon
Carbide Particulate Composites Produced by a Casting
Method, Materials Science and Engineering, A107: 73-79.
[10] Guo, Z., Xiong, J., Yang, M. and Li, W., “Microstructure
and Properties of Tetrapod-like ZnO Whiskers Reinforced Al
Matrix Composite,” Journal of Alloy and Compounds, 461:
342-345. 2008
[11] Sulaiman, S., Sayuti, M. and Samin, R., “Mechanical
Properties of the As-Cast Quartz Particulate Reinforced LM6
Alloy Matrix Composites,” Journal of Material Processing
Technology, 201: 731-735. 2008.
[12] Zhou, W. and Xu, Z.M., “Casting of SiC Reinforced
Metal Matrix Composites,” Journal of Materials Processing
Technology, 63: 358-363. 1997.
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure 5.Proportionality (MPa) limit Vs Wt.% of SiC

Figure 6.Tensile strength upper yield point (MPa) Vs Wt.% of SiC

Figure 7.Tensile strength lower yield point (MPa)Vs Wt.% of SiC

Figure 8.Ultimate tensile strength (MPa)Vs Wt.% of SiC

Figure 9.Breaking strength(MPa)Vs Wt.% of SiC

601
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure 10.% Elongation Vs Wt.% of SiC

Figure 11.% Reduction in area Vs Wt.% of SiC

Figure 12.Hardness (HRB) Vs Wt.% of SiC

Figure 13.Density (gm/cc)Vs Wt.% of SiC

Figure 14.Impact Strength (N.m)Vs Wt.% of SiC

602
Electrical Engineering
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

THD Reduction in DVR by BFO-Fuzzy Logic

Chirag Kalia, Divesh Kumar,
BGIET Sangrur, BGIET, Sangrur,
Kalia_chirag@yahoo.com Diveshthareja@yahoo.com

ABSTRACT combination of above two devices gives a device known as

The modern sensitive, Non-linear and sophisticated load affects
the power quality. Dynamic Voltage Restorer (DVR) provides
the fast, flexible and efficient solution to improve the power
quality for such distribution network. The active power, reactive
power, variation of voltage, flicker, harmonics, and electrical
behavior of switching operations are the major source of
affecting power quality. The intent of this paper is to
demonstrate the improvements obtained with DVR in power
system network using MATLAB/SIMULINK. In this paper, an
overview of the DVR, its functions, configurations, components,
control strategies are reviewed. The Simulation results are
presented to illustrate the performance of DVR in Total
Harmonic Distortion (THD). The results showed clearly the
performance of using DVR in improving THD level.
Keywords
Dynamic Voltage Restorer (DVR), PI controller, Power
Quality, Pulse Width Modulation (PWM), Total Harmonic
Distortion (THD).
UPQC.
1.1 DYNAMIC VOLTAGE RESTORER (DVR)
This is a series connected device that has the same structure as
that of an SSSC shown in Figure 1. The main purpose of this
device is to protect sensitive loads from sag/swell, interruptions
in the supply side. This is accomplished by rapid series voltage
injection to compensate for the drop/rise in the supply voltage.
Since this is a series device, it can also be used as a series active
filter. Even though this device has the same structure as that of
an SSSC, the operating principles of the two devices differ
significantly. Another reason is that the DVR costs less
compared to the UPS. Not only the UPS is costly, it also
requires a high level of maintenance because batteries leak and
have to be replaced as often as every five years. Other reasons
include that the DVR has a higher energy capacity and lower
costs compared to the SMES device. Furthermore, the DVR is
smaller in size and costs less compared to the DSTATCOM.

1 INTRODUCTION
Power quality or, simply, the usability of electric power is of
vital concern to modern life. Both current and frequency rarely
cause problems for end users. That's because electric current is
dictated by load, and the utility -- to maintain stability of the
grid -- very tightly controls the frequency of AC power . Due to
various pieces of equipments or due to any abnormal conditions
in the network, the quality of the power changes and thus it
becomes less suitable for any further application. Earlier the
prime focus for power system reliability was on generation and
transmission system but now a day‘s distribution system
receives more attention. Because 90% of the average customer
interruptions occur in the distribution network and causes huge
amount of financial losses. As a result, voltage quality
represents the lone rogue element. Indeed, statistics reflecting
so-called power quality problems show that over 95% of them Fig.1 Structure of Dynamic Voltage Restorer
are, in fact, voltage problems. These include voltage levels that
are too high or too low; voltage sags (transient drops in voltage);
1.2 EQUATIONS RELATED TO DVR
and power interruptions (absence of voltage). The device named
The load impedance ZTH depends on the fault level of the load
as Dynamic Voltage Restorer, which is connected in series with
bus. When the system voltage (VTH) drops, the DVR injects a
the line. The DVR is a Power Quality device which can protect
series voltage VDVR through the injection transformer so that the
sensitive loads against the disturbances i.e., voltage sags and
desired load voltage magnitude VL can be maintained. The
swells related to remote system faults. The VSC must be
series injected voltage of the DVR can be written
controlled correctly to inject the required current (in shunt
connection) or voltage (in series connection) into the system in as
order to compensate for a voltage dip. Since a number of Where
sensitive loads can shut down because of a dip or other VL: The desired load voltage magnitude
disturbances. The speed of reaction of the device is an important ZTH: The load impedance.
factor for successful compensation by the device. The IL: The load current
VTH: The system voltage during fault condition

603
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Discrete,
The load current IL is given by, Ts = 0.0001 s. a
O/P Voltage
Sag
b Breaker1
powergui c
a A A
a1
b1 b B B
c1
c C C
Line Feeder 1

When VL is considered as a reference equation can be rewritten aA

Breaker2
a A b

as, A
a2
b2
bB b B
c C
c
a

A
c2 cC Voltage Swell Scope9
B B a3
T3
C b3
C

a1

b1

C1
Out 1
Three-Phase Source c3
control. α, β, δ are angles of VDVR, ZTH, VTH respectively and Three-Phase
Sag1

Transformer A
is Load power angle. The complex power injection of the DVR (Three Windings) Line Feeder 2 a A
B
b B
can be written as, c C C

1-1
1-2
2-1
2-2
3-1
3-2
a
c
a A b
b B a
c C c

BFO Voltage Swell1

Double click on this to run optimisation

Note:
1. For Sag--- Breaker 1 is open and Breaker 2 is closed
1 Control_Selection 2.For Swell--- Breaker 2 is open and Breaker 1 is closed
In1
1-2
Fig. 2 Equivalent Circuit Diagram of DVR Constant Goto
1-1
1=Fuzzy Control 2-2
2=BFO -Fuzzy Control 2-1
1.3 DVR SIMULINK MODEL 3. PI Controlled
3-2 3-1
A model for simulation of DVR with PI Controller and Fuzzy DVR
Logic Controller is shown in fig 5.6. In this model a three phase
star ground connected source of 50 Hz is connected to three Flow Chart
phase transformer having winding connections star ground, delta
and delta for winding 1, 2 and 3 respectively. Winding 2
terminals of transformer is connected to a three phase series
RLC branch through a transmission line and winding 3 terminals s
are connected to another three phase RLC branch having
inductance of 0.005H and resistance of 0.001 Ohms. Output of t
these RLC branches are directly connected to two different three a
phase transformers (2 windings). On the upper side transformer, Define
r
a three phase fault having fault resistance 0.001 Ohms and
ground resistance 0.001 Ohms has been put. . A three phase t
breaker is also used to test the system in case of unbalance Define Sort
loading. Output of three phase breaker is directly connected to fuzzy
fuzzy
secondary windings of 3 linear two windings transformers logic the
having a nominal power of 250e6 VA and frequency of 50Hz logic
Initializ
rule set bacter
each. rule set
Fig. 3 DVR Model e BFO Read
ia
paramet define
positi
1-1 1 1-2 2 2-1 3 2-2 4 3-1 5 3-2 6 ers like don
Assign
in
Assign
number fuzzy
bacteri
desce
1

random
of logic
a
nding
2

position
bacteria positio
order
cC
Vabc A

bB

T1

,to each
a

nsIfto n
A
B
C

Three-Phase Breaker
bacteria
searchi
Call for
memb o
b
a

g
+
A
Vabc
a
A that
ngobject eac
ership
B bB
-
C cC
Mag
position
space,
ive h
functio
Universal Bridge T3
Scope2 abc 1
Out Y
Phase

3-Phase
In1
constitu
eliminat
functi n me
Sequence Analyzer puto Evalua e
Pulses Uref vinv_re dlata
MATLAB
Function
du/dt
Subtract
te
onthe
ion, mbs
which
Fuzzy Logic 1 Constant
Discrete
Subsystem
Derivative bject
nposition te new
PWM Generator
dispersa ersnot
are
MATLAB
(t)< ‗fis‘
Incre loofsteps
Function
Control_Selection 1
|u|2
Scope4 From
BFO Fuzzy Logic

Discrete
s
input

Out Y hip
fixed
PI Controller
Math Integrator
Function
To Workspace1

member
ment etc. structu
PI
put e funDecre
the shipE os re and
ctiase
Multiport
Switch

Fig. 4 DVR Model bject

positi functio
n pass
(t-1) onthe
on of n ofd the
x1positi
bacter fuzzy value
604
<xon by
ia logic to the
2<a step
main
x3size
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2. RESULTS
In main simulink model is shown in figure above. Three phase
faults are used along with two breakers. For introducing sag in
the model breaker 2 should be closed and breaker 1 should be
open. Timing for fault introduction can be controlled also. In our
experiment it has been taken from 0.1-0.3 sec. Initially PI
controller is selected for DVR controlling.
The PI compensated THD is 0.24 % that means THD has been
reduced to a good amount but still there is scope of more
reduction in THD. For this purpose we have used fuzzy logic
with 49 rules further. The zoomed output of fuzzy logic is
shown in figure 5.13 to show the distortions. The total harmonic
distortions, as in above case is shown in figure 5.14. it comes
out to be 0.19%, less than the distortions in case of PI controlled
DVR. That proves fuzzy logic control is better than PI
controlled DVR. this figure shown is zoomed in simulink
window and direct taken from there. So because of these
distortions total harmonic distortions are measured by FFT
analysis. For this, FFT analysis from ‗powergui‘ block is used Fig 4. Distortions in the PI compensated waveform
which is placed in model to set the environment for simpower
toolbox in simulink. The THD calculated by that is shown in
figure 5.10. The THD in this case is 1.46%.
Voltage Sag in the interval 0.1-0.3
1
Three phase Voltage

0.5

-0.5

-1
1000 2000 3000 4000 5000 6000 7000
Fig 5. Distortions in fuzzy logic compensated output
Compensated Voltage Sag in the interval 0.1-0.3
1 1
Selected signal: 35 cycles. FFT window (in red): 16 cycles
Three phase Voltage

0.5 -1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7
Time (s)

Fundamental (50Hz) = 0.9888 , THD= 0.19%

0 0.12
Mag (% of Fundamental)

0.1

0.08

-0.5 0.06

0.04

0.02

0
0 200 400 600 800 1000
-1 Frequency (Hz)

1000 2000 3000 4000 5000 6000 7000

Fig 6. THD in case of fuzzy controlled DVR
Fig 3. Uncompensated and Compensated output

605
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

and voltage regulation performance has been successfully

Table 1. Parameters used for BFO demonstrated in MATLAB/Simulink. It is found that BFO-
Fuzzy Logic Control is more effective than PI Control and fuzzy
control technique in operation of DVR as a custom power
Dimension Of Search Space 12
device.
The Number Of Bacteria 6
REFERENCES
Number Of Chemotactic Steps 6 [1] A.Venkata Rajesh Dr. K. Narasimha Rao,‖ Power Quality
Improvement using Repetitive Controlled Dynamic
Limits The Length Of A Swim 4 Voltage Restorer for various faults‖ IJERA Vol. 2, Issue
1, Jan-Feb 2012, pp.168-174.
[2] B.Rajani, Dr.P.Sangameswara Raju,‖ Comparision Of PI,
Fuzzy & Neuro-Fuzzy Controller Based Multi Converter
Voltage Sag in the interval 0.1-0.3 Unified Power Quality Conditioner‖ IJEET Volume 4,
1 Issue 2, March – April (2013), pp. 136-154.
Three phase Voltage

[3] M.Sharanya, B.Basavaraja , M.Sasikala,‖ An Overview of

0.5 Dynamic Voltage Restorer for Voltage Profile
Improvement‖ International Journal of Engineering and
0
Advanced Technology (IJEAT) ISSN: 2249 – 8958,
Volume-2, Issue-2, December 2012.
-0.5
[4] S.Ezhilarasan, G.Balasubramanian,‖ Dynamic Voltage
-1 Restorer For Voltage Sag Mitigation Using Pi With Fuzzy
1000 2000 3000 4000 5000 6000 7000 Logic Controller‖IJERA Vol. 3, Issue 1, January -
February 2013, pp.1090-1095
Compensated Voltage Sag in the interval 0.1-0.3 [5] Seyedreza Aali and Daryoush Nazarpour,‖ Voltage
1 Quality Improvement with Neural Network-Based
Three phase Voltage

Interline Dynamic Voltage Restorer‖ Journal of Electrical

0.5
0
-0.5
-1
1000 2000 3000
Fig 7. Output of BFO fuzzy logic
3. CONCLUSION
The conclusions drawn from the different aspects of the study in
this thesis are summarized in this chapter. The scope for further
study in this area is also dwelt upon at the end. Nonlinear loads
and disturbances due to faults produce harmonic currents that
can propagate to other locations in the power system and
eventually return back to the source. Therefore, harmonic
current propagation produces harmonic voltages throughout the
power systems. Mitigation techniques have been proposed and
implemented to maintain the harmonic voltages and currents
within recommended levels by a custom power device DVR.
DVR with PI Controller and Fuzzy Logic Controller has been
designed to mitigate the effects of the power quality problems
during three phase fault condition. But since there is always
scope of improvement in minimizing distortions, so membership
function of fuzzy logic are optimized by bacterial foraging
optimization (BFO) and it has been successfully recorded that
total harmonic distortions are very less as compared to other two
techniques. The investigation of DVR installation on a power
distribution system with mainly focus on harmonic reduction
Engineering & Technology Vol. 6, No. 6, pp. 769~775,
2011
[6] Mohammad KIANI, Seyed Mohammad Ali
MOHAMMADI,‖ A bacterial foraging optimization
approach for tuning type-2 fuzzy logic controller‖ Turkish
Journal of Electrical Engineering & Computer Sciences
4000 5000 6000 7000 Turk J Elec Eng & Comp Sci (2013) 21: 263 – 273
[7] Rosli Omar, N.A. Rahim and Marizan Sulaiman,‖
Dynamic Voltage Restorer Application for Power Quality
Improvement in Electrical Distribution System: An
Overview‖ Australian Journal of Basic and Applied
Sciences, 5(12): 379-396, 2011
[8] Sushree Sangita Patnaik and Anup Kumar Panda,‖
Particle Swarm Optimization and Bacterial Foraging
Optimization Techniques for Optimal Current Harmonic
Mitigation by Employing Active Power Filter‖ Hindawi
Publishing Corporation Applied Computational
Intelligence and Soft Computing Volume 2012, Article ID
897127, 10 pages
[9] Rosli Omar, N.A. Rahim and Marizan Sulaiman,‖
Dynamic Voltage Restorer Application for Power Quality
Improvement in Electrical Distribution System: An
Overview‖ Australian Journal of Basic and Applied
Sciences, 5(12): 379-396, 2011
[10] Sushree Sangita Patnaik and Anup Kumar Panda,‖
Particle Swarm Optimization and Bacterial Foraging
Optimization Techniques for Optimal Current Harmonic
Mitigation by Employing Active Power Filter‖ Hindawi
Publishing Corporation Applied Computational
Intelligence and Soft Computing Volume 2012
[11] P. Anitha Rani, Sivakumar.R,‖ Improvement of Power
Quality using DVR in Distribution Systems‖ International

606
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Journal of Innovative Research in Science, Engineering
and Technology, Volume 3, Special Issue 1, January 2014
[12] Javed A Dhantiya, Amin S Kharadi, Ashraf M Patel,‖
Analysis of Dynamic Voltage Restorer for Voltage Profile
Improvement‖ Journal of Applied Engineering (JOAE), 2
(5), Volume-II, Issue-V,May-2014
[13] A.Suresh, V.Govindaraj,‖ Power Quality Improvement
using Dual Voltage Source Converter Based DVR‖
International Journal of Engineering Trends and
Technology (IJETT) – Volume 7 Number 4- Jan 2014
[14] Syed Shahnawaz Husain, Dr. Jyoti Srivastava,‖
Enhancing Power Quality with improved Dynamic
Voltage Restorer‖ International Journal of Advanced
Research in Electrical, Electronics and Instrumentation
Engineering, Vol. 3, Issue 6, June 2014
607
ISBN: 978-81-924893-0-8
[15] B. Lakshmana Nayak, V. Vijaya Kumar,‖ Single Phase
Unified Power Quality Conditioner with Minimum VA
requirement‖ International Journal of Advancements in
Research & Technology, Volume 3, Issue 1, January-2014
[16] Introduction to PSCAD / EMTDC, Manitoba HVDC
Research Centre, March 2000. M. Gole, O. B. Nayak, T.
S. Sidhu, and M. S. Sachdev.
[17] E Acha, V G Agelidis, O Anaya-Lara, T J E Miller, ―
Power Electronic Control in Electrical
Systems‖, Newnes Power Engineering series, 2002.
[18] N. Hingorani, ―FACTS — Flexible ac transmission
systems,‖ in Proc.IEE5th Int. Conf. ACDC Transmission,
London, U.K., 1991, Conf. Pub. 345, pp. 1–7.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Ripple Control in Converter
Husanpreet singh,
Bhai Gurdas Institute of Engineering and
Technology, Sangrur,
ABSTRACT
When a sinusoidal voltage is converted into dc, the output
voltage waveform contains ripples. Ripple is an unwanted
ac component in dc output.. Ideal value of ripple factor is
zero. Zero ripple factor means a perfectly dc quantity.
Undesirable effects of the ripple include equipment heating,
increased losses, and reduced equipment life. Ripple factor
of a single-phase half-wave uncontrolled rectifier is 1.21.
The value of ripple is high, a single-phase full-wave
uncontrolled rectifier is proposed with a ripple factor of
0.48. In this paper, the ripple factor for above mentioned
rectifiers with a resistive load is presented mathematically.
The r waveforms are obtained using a computer program
called Alternative Transients program, ATP. Ripple factor
was improved by a factor of 40% by using a 2-pulse
rectifier instead of a 1-pulse rectifier. Theoretically, if the
number of pulses is increased to infinity, the ripple factor
will reduce to zero giving a perfect dc output.
Subsequently, 6-pulse, 12-pulse, and 18-pulse rectifiers
will be modeled and advanced studies will be carried out.
This paper will help understand the one of the power
quality components called ripple in dc output.
Keywords
AC to DC converter, Rectifier, Diode, Ripple Factor, ATP
1 INTRODUCTION
Power quality components can easily be found for a
sinusoidal voltage and current of same frequency. The
switches are on for some part of the cycle and off for other
part. Therefore, the output waveforms from power
electronic devices like rectifiers are periodic but not
sinusoidal.
To compare the performance of different types of
rectifiers of the same class, an index called ripple factor is
investigated in detail. It is desirable for a rectifier that the
voltage and current ripple in the output waveform be as low
as possible to maintain a good quality of the output. The
ripple factor is ratio of root mean square (rms) value of ac
component to average value of dc output . The ac
component of the output waveform is obtained by
subtracting dc component from the output waveform. Thus,
mathematically
Ripple factor = rms value of ac component/ average value
of dc component
== {√ (I2- I20)} /I0 (1)
where,I = RMS value of output current
I0 = Average value of output current
1.1 EFFECTS OF RIPPLE
Ripple quantity results in many unwanted effects in a dc
system. Some of the known effects are explained below
608
ISBN: 978-81-924893-0-8
Divesh Kumar,
Bhai Gurdas Institute of Engineering and
Technology, Sangrur,
I2R Loss: For a perfectly dc current, the current will be
distributed uniformly across the cross-section of the
conductor. when the current is alternating or has ac
component, the current tends to concentrate closer to the
conductor surface. The effect is called skin effect. Skin
effect offers higher resistivity to the ripple current resulting
in higher surface temperature and conductor losses.
Stray Heating: Ripple current induces current in the
neighboring metal structure or piping per Faraday’s law of
electromagnetic induction and causes induction heating.
However, it can be reduced by reducing ripple current itself
or by placing a low-impedance shield such that induced
current does not produce a overheating in the shield
conductor as a result of lower resistance.
Instrumentation and Communication: Induced current in
instrumentation cable causes noise. The ratio of signal to
noise should be within acceptable level. The induction
effect can be reduced by using shielded cable
1.2 CONTROLLING OF RIPPLE
The Increasing or decreasing of ripple effects from dc
output by some methods
1.Increasing the pulse number of rectifier: Higher the
number of pulses, lower is the ripple magnitude
2.Using an Output Filter: If a capacitor is used across the
load and an inductor is used in series with the load,,the load
current will be smoother and ripple effect will be lowered
The ripple magnitude has controlled by the number of
pulses. Higher the number of pulses, lower is the ripple
magnitude. In a single-phase half-wave uncontrolled
rectifier, the number of pulses is one. Likewise, in a single-
phase full-wave uncontrolled rectifier, the number of
pulses is two. It is shown in this paper that the ripple factor
is 1.21 for a 1-pulse rectifier and 0.48 for a 2-pulse
rectifier. To model the rectifier and to obtain voltage and
current waveforms, a computer program called Alternative
Transients Program (ATP) Subsequently, 6-pulse, 12-
pulse, and 18-pulse rectifiers will be modeled and
advanced studies will be carried out.
1.3 SINGLE-PHASE HALF-WAVE
UNCOTROLLED RECTIFIER
A single-phase half-wave uncontrolled rectifier feeding a
resistive load is shown in Figure 1. The diode D conducts
during the positive half cycle of supply voltage Vs and
stops conducting during negative half-cycle of the supply
voltage forming a 1-pulse rectifier. Source current and load
current are represented by iS and i respectively. V average
output voltage
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

periodic in 2π is given by

I0= (1/2π) i0(ɷt) dɷt (5)

After solving above equation we get, I0= Vm /(πR)= Im/π
(6) where I m is peak
value of i0(ɷt) For the load current
i0(ɷt) periodic in 2π, the rms current can be given as

I= √[ i20(ɷt) dɷt] (7) = Vm

fig 1-Single-phase half-wave uncontrolled rectifier with R
load
The instantaneous value of Vs is given by
Vm sin ɷt (2)
where Vm = is the peak value of Vs
instantaneous value of V0 is given by V0 = Vm sin ɷt { 0
to π, 2π to 3π, etc} (3) And ,instantaneous
value of voltage across the diode VD is given by
VD = Vs - V0 = Vm sin ɷt { π to 2π, 3π-------------------------------------------------
--to4π,etc}
Voltage input waveform is shown in fig 2.output voltage
and current wave form is in fig 3
/(2 R) = Im/2
It should be noted that the corresponding rms value of the
load current for sinusoidal operation is Im/√2. Thus the
Vs = degree of distortion, Ripple Factor, in a single-phase half-
wave rectified current waveform can be calculated using
Similarly,the equation
= √ [{(Im/2) / (Im/π)}2 – 1] (8)
= 1.21 (9)
If the output wave is perfectly dc, the ripple factor will
(4) be zero. Ripple factor of 1.21 is unacceptably high for
many industrial applications.
1.4 SINGLE-PHASE FULL-WAVE
UNCOTROLLED RECTIFIER
A single-phase full-wave uncontrolled rectifier feeding
a resistive load is shown in Figure 4. Diodes D1 and
D2 conduct during the positive half cycle of supply
voltage Vs; and diodes D3 and D4 conduct during
negative half-cycle of the supply voltage forming a 2-
pulse rectifier. Source current and load current are
represented by iS and i0 respectively. V0 average output
voltage. Output voltage and output currents are shown
in Figure

Figure 2. Supply voltage waveform

Figure 4. Single-phase full-wave uncontrolled

rectifier with R load
Figure 3. output voltage and current waveform The instantaneous value of load current can be given
The average value I0 of the load current i0(ɷt) which is by

609
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

i0 (ɷt ) = [Vm sin ɷt]/R {0 to π, 2π to 3π, etc} + [Vm RESULTS

sin (ɷt-π)]/R { π to 2π, 3π to 4π, etc} (10) The variation of average load current, rms load current, and
The average value I0 of the load current i0(ɷt) which ripple factor of load current are presented below in a
is periodic in 2π is given by tabular form.

(11)

After solving above equation we get ,

I0= 2Vm /(πR)= 2Im/π
It can be seen that the average value of output current
in case of full-wave rectifier is twice the value of in
case of half-wave rectifier
The rms value of the load current can be given as

2. CONCLUSION
(12) Single-phase 2-pulse rectifier offered better ripple factor
= Vm /(√2 R) = Im/√2 (13) than a single-phase 1-pulse rectifier. The ripple factor was
improved by 0.48/1.21= 40%. Theoretically, if the number
of pulses is increased to infinity, the ripple factor will
reduce to zero giving a perfect dc output. Subsequently, 6-
pulse, 12-pulse, and 18-pulse rectifiers will be modeled
and advanced studies will be carried out. This research will
help seniors, graduate students, and design engineers to
understand the modeling and working principle of ac to dc
converters i.e. rectifiers.

REFERENCES
[1]. M.Mazaheri, V. Scaini, and W. E. Veerkamp
“Cause, Effects, and Mitigation of Ripple From
Rectifiers,” IEEE Trans. Industrial Application; vol.
39, no.4, pp. 1187-1192,July/August 2003
[2]. D. A. Paice, Power Electronic Converter
Fig5-Full-wave Rectifier Output Voltage and Curren Harmonics: Multipulse Methods for Clean Power.
It should be noted that the corresponding rms value New York: IEEE Presss, 1996, Chap. 7.
[3]. B. Singh, G. Bhuvaneswari, V. Garg, and S.
of the load current for half wave rectifier is I m/2. Gairola “Pulse Multiplication in AC-DC converters
Thus the degree of distortion, Ripple Factor, in a for Harmonic Mitigation in Vector-Controlled
Induction Motor Drives,” IEEE Trans. Energy
single-phase full-wave rectified current waveform Conversion; vol. 21, no. 2, pp.342-352, June 2006
can be calculated using equation . [4]. M. Ramasubbamma, V. Madhusudhan, K. S. R.
2 Anjaneyulul, and P. Sujatha “Design Aspect and
= √ [{(Im/√2) / (2Im/π)} – 1] (14)
Analysis for Higher Order harmonic Mitigation of
= 0.48 (15) Power Converter Feeding a Vector Controlled
Ripple factor of 0.48 is significantly better than that Induction Motor Drives,” IEEE International
in half-wave rectifier with a ripple factor of 1.21. Conference on Advances in Engineering, Science, and
Management (ICAESM-2012), pp. 282-287, March
30, 31, 2012.

610
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Full and Half wave Rectifier with Full Control of the

Conducting Angle
Jashandeep Singh Simerjeet Singh
Research Scholar Research Scholar
B.G.I.E.T, Sangrur. B.G.I.E.T, Sangrur.

ABSTRACT
A new rectifier circuit capable of controllingconducting This is why we first address the phase shift circuit in
angle in the full range from zero to π. A two cell ledder RC thenext.
network is studied first to enable as phase shifter. Then a
halve-wave rectifier is described performing full control of
the conducting angle. A full wave rectifier is described and
its characteristics extracted by simulation. The main
advantage of the new circuit is its ability to control the
conducting angle in full range making the rectifier
applicable in electronic power supply circuits and in
systems that need power control.

Index Terms
AC/DC converter, power supply, full-wave thyristor Fig. 1. Block scheme of Full-wave controlled rectifier.
rectifier.

1. INTRODUCTION
The controlling of conducting angle in rectifier from its
application related to power control.it is planned in
industrial applications and electronic power supply,. often
one would need a rectifier with a full scale of control of the
conducting angle from 0 to π. We will present here a new
circuit that has these characteristics. The idea is to use a
two cell RC ladder network as a phase shifter controlling
the firing of the thyristor’s gate Fig. 2. Flowing angle.

2. RECTIFYING FULL-WAVE BY 3. COMPLEX CIRCUIT RC

A THYRISTOR ELEMENT
The single passive RC circuit produce a maximum phase
A full-wave controlled rectifier with thyristor is shown in shift of π/2 for infinite frequency. our frequency 50 Hz very
fig 1. The main voltage Es is rectified so that the thyristors large values of the RC elements are needed for angles
are triggered by a control circuit. In this case consists of an nearer to π/2.Extend the possibilities of the controlling
RC ladder followed by a diac. The controll circuitry is not circuit we proposed the use of two-cell passive RC ladder
shown for convenience. circuit in Fug. 3 The voltage transfer function of this
The waveforms of the main voltage and the load voltage circuit is given with [1]
being denoted by Vout. The conducting angleΘA may be less
than π/2 but generally may be controlled between 0 and T(s) = V out/E = 1/1+S(τ1+ k τ2 )+S τ1 τ2
π.thyristor is off during conducting angle. ΘA. The thyristor
gate controlling voltage is derived from the main voltage, where is τ1 = R1C1, τ2 =R2C2, And k=R1/R2 . In the case
attenuated, phase shifted , and, finally, brought to the
thyristors gate via diac performing as a threshold element R1=R2=R and C1=C2=C the Poles of function (1) are
and protecting from conducting in theinverse direction.

611
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig. 3. Circuit of two RC sections

The phase angle dependence on the resistance in the RC ledder for
three different values of the capacitance. By inspection of the results
one may conclude first that resistances no larger than 20 k are needed
for the application conceived. As for the capacitances we may come
out with the conclusion that C=1µF is practicaly satisfactory and, in
fact, the most convenient value. we came to the conclusion that one
needs to fix the capacitance value and to use variable resistances for
control of the phase angle. Note that resistors with variable resistance
are easier to implement
The amplitude characteristic of the function (1) in the case when
R1=R2=R and C1=C2=C is obtained as
Fig. 5. Half-wave rectifier using a two-cell RC ledder.
Fig. 6. shows the transient waveform of the output voltage after
switching on the circuitry. the phase angle is in accordance with the
value, for the given circuit parameters, may be extracted from Fig. 4
Voltage waveforms for the case when R=20 k . One may notice that
conducting angles areconsiderably lower than 90o.After exhaustive
simulations, Fourier analisys of the waveforms obtained for large set
of values of the resistance in the phase delay circuit

2 2 2
A  T (s) s jω1/ [1  (ωRC) ]  1/[1  (ωRC) ]
(3)or, in terms of decibells,
a(dB)20⋅log(1/ A) f (R, C ). (4)
As for the phase characteristic, using SPICE we got the dependence
a=f(RC) we fixed the value of the capacitance and put the resistance
in the role of a variable. The results are depicted in Fig. 5.From the
amplitude characteristics in Fig. 4 we may come to the conclusion
that even for the largest values of the resitances, if C = 1 µF, we get
an attenuation of only about

The phase characteristic of this function for the case when

R1=R2=R and C1=C2=C is given by
Fig. 6. Waveforms of the output voltage of the circuit of Fig. 6 (for
R=10k , C=1µF, and R3=100 ).

20 dB that is about ten times. This means that one may expect
voltages of the order of magnitude no less than 25 V.

4. HALF-WAVE THYRISTOR
RECTIFIERS WITH CONDUCTION ANGLE
CONTROL
The implementation of the two-cell RC ledder in a thyristor rectifier
is in Fig. 5 [3]. The thyristor is triggered by the gate current pulses
Fig. 4. Attenuation of circuit with two and shaped by the control circuit. The diac is to generate a voltage
. RC sections.
threshold leads the gate to conducting state. In the negative half
cycle of the main voltage the DIAC and the thyristor are off.
Part of these results are shown in Fig. 7 where the DC component of
the output voltage is as a function of the resistance in the phase delay
circuit, for two values of the load resistance

612
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig. 7. Direct component of load voltage the Half-wave

rectifiet
Fig 8.(a) Symbol from the filter plus diac circuit, and (b)
the alternating component of the voltage is dominant for all Full-wave Waveform of voltage (for R=5k ,C=1µF, and
values of the resistance in the phase delay circuit. R3=100
Nevertheles, this dominance is less persuasive for large
values of resistance in the phase delay circuit.

5. FULL-WAVE CONTROLLED
RECTIFIER WITH CONTROL
ANGLE OF PHASE
In order to get larger DC component in the full spectra of
the signal at the output full-wave rectification is needed.
Application of the circuit of Fig. 5.in a full-wave rectifyer
is depicted in Fig. 8 simplification of the schematic we
introduced a subcircuit denoted by D. as shown in Fig. 12a. Fig. 9. Waveform of output voltage (for R=12k ,C=1µF,
Fig. 12b represents a version of the full-wave rectifier. The and R3=100 ).
full wave rectifier circuit was simulated by the SPICE
program in the same manner as the half-wave circuit. The To get a full picture of the properties of the new Fig.
resulting simulation result . In Fig. 9 the output voltage 8proposed circuit Fourier analysis of the output voltage
waveforms are depicted. after transient a steady response is waveforma was performed for a set of resistances R and
obtained in this case with conducting angle lower than π/2. for two values of the load resistance i.e. R3=10 and
In the same time one can recognize that the firing moment R3=100 .
is in accordance with the phase angle obtained from Fig.
4.The simulation results for the output voltage are depicted
in Fig. 10. Relativly large conducting angle may be
observed.
Finally, a large value for teh resistance in the phase shift
circuit was chosen: R=19 k . The simulation results for the
output voltage are shown in Fig. 17, while Fig. 18
represents the waveform of the output current. One may
notice that after some transient a response is obtaine with
very short pulses confirming the role.
Fig. 10. Output voltage waveform (for R=19k , C=1µF,
and R3=100)

613
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The results obtained after Fourier analysis are depicted in
Fig. 12 and Fig. 13. The first one represents the DC
component of the output voltage as a function of the
resistance in the phase shift circuit. One may notice a floor
of about 50V
CONCLUSION
A new concept of control of the conducting angle of a
thyristor rectifier was proposed and implemented in hal-
wave and full-wave rectification circuits. After theoretical
study of the circuit and after creation of some design
formulae a thorough verification procedure was
implemented based on SPICE simulation of the circuits. In
particular, the properties of the circuits in the frequency
domain were studied in order to produce information of the
aplicability of the circuit in different applications.

REFERENCES
[1] Dokić, B. „Power electronics –converters and
regulators“, ETF Banja Luka, 2000, in Serbian
[2] Banzaf, W., „Computer-Aided Circuit analysis using
SPICE“, Prentice Hall, Enlewood Cliffs, N. J., 1989.
[3] Taylor,P.D., „Thyristor design and realization“, John wiley
and Sons, Chichester, 1987
that is not dependent on the load resistance. On the other
side, Fig. 20 depicts the dependence of the second
harmonic on the resistance in the phase shift circuit. Again,
as expected, for small conducting angles large harmonic
compared with the DC value is obtained.

Fig 12 DC component of output voltage of the Full-wave

rectifier

fig 13. second harmonic of voltage on load

614
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Multi-objective Optimization Using Linear Membership

Function
Er.Gurpreet Kaur Er. Divesh Kumar Er. Manminder Kaur
Department of Electrical Engg. Department of Electrical Engg. Department of Electrical Engg.
Bhai Gurdas Institute of Engg.& Bhai Gurdas Institute of Engg.& Guru Kashi University
Technology Technology Talwandi Sabo, India
Sangrur, India Sangrur, India mkaurjassal@gmail.com
ergurpreet88@gmail.com diveshthareja@yahoo.com

performance of proposed technique is tested on IEEE 30-bus

ABSTRACT system.
Economic Dispatch (ED) optimization problem is the most
important issue which is to be taken into consideration in power 2. PROBLEM FORMULATION
systems. The problem of ED in power systems is to plan the The aim of the proposed multi-objective optimization problem is
power output for each devoted generator unit in such a way that to determine the power generation levels, which will minimize the
the operating cost is minimized and simultaneously, matching generation cost and line flow, subject to real and reactive power
load demand, power operating limits and maintaining stability. In balance and generation capacity constraints. The problem
this paper, the traditional economic dispatch problem has been formulation has been sub-divided into following three parts:
modified to minimize generation cost and line flow. As the two 1) Decreasing fuel cost.
sub-problems have conflicting objectives, fuzzy decision making 2) Minimization of line flow losses.
multi-objective optimization has been applied to get single 3) Apply Fuzzy decision making technique using Linear
optimal solution from conflicting objectives of generation cost Membership Function.
and line flow. Practicably, it has been tested on IEEE 30-bus
system. The results describe the capability of the proposed 2.1 Economic Load Dispatch
approach of reducing line flow while maintaining economy in the As the main objective minimize the conflicting objectives of
load dispatch. generation cost and line flow, subject to real and reactive
power balance and generation capacity constraints. Hence the
Keywords objective function is taken equivalent to the total cost for
Economic Load Dispatch, Fuzzy Decision Making, Multi- supplying the load demand which is represented
Objective Optimization, Line Flow.
by . It can be formulated as follows:
1. INTRODUCTION Minimize
The aim of power industry is to generate electrical energy at (2.1)
minimum cost while satisfying all the limits and constraints Where
imposed on generating units. Economic Load dispatch (ELD) is the are the fuel cost coefficient.
one of the optimization problem in power industry. ELD
is the real power output of the generator.
determines the optimal power solution to have minimum
generation cost while meeting the load demand. Due to emerging 2.1.1 Real power dispatch:
technology, various techniques have been proposed by several The basic purpose of the real power dispatch problem is to
researchers.
schedule the outputs of thermal generating units so as to meet the
The problem of economic load dispatch becomes multi-objective
system load at minimum cost. Real power dispatch is defined as
optimization problem with conflicting objectives of generation
following by using load flow equations.
cost and line flow. Various optimization techniques have been
(2.2)
described by many researchers to deal with multi-objective
optimization problems having varying degree of success. Where
In this paper fuzzy decision making technique has been applied to i=1, 2, 3…..n
solve the multi-objective optimization problem with conflicting is load demand of real power at the
objectives of generation cost and line flow. Fuzzy decision is generation of real power at the bus
making technique is considered to be more effective than other
techniques as far as conflicting objectives are included in the
optimization problem. The proposed technique optimizes the said
objective functions under a set of system constraints such as real
and reactive power balance equations and generating capacity
limits. The

615
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2.1.2 Reactive power dispatch (2.7)

Reactive power dispatch is treated as an optimization problem that Reactive power is injected from bus M to bus I as following
reduces grid congestion by minimizing the active power losses. (2.8)
The Reactive power dispatch requires solving the power flow Where
problem and for this reason is usually known as optimal reactive is the series admittance
power dispatch problem or as an optimal power flow problem. is the shunt admittance
The reactive power dispatch is used to solve the power flow is the voltage at the bus
equations. Hence as a result an improved voltage profile can be (2.9)
obtained. Reactive power dispatch is defined as following by (2.10)
using load flow equations. Power losses in the (I-M) line is the sum of the power flows in
the (I-M) line from the bus and the bus.
(2.3) (2.11)
Where
i=1, 2, 3…..n 2.2 Fuzzy Decision Making Technique Using
s total system generation of reactive power bus. Linear Membership Function
bus. Fuzzy multiple objective linear programming formulates the
bus. objectives and the constraints as fuzzy sets, characterized by their
bus. individual linear membership functions. The decision set is defined
as the intersection of all fuzzy sets and the set defined by relevant
2.1.3 Power balance constraints hard constraints.
The total power generation must be equal to total demand and real 2.2.1 Linear Membership Function
power loss in transmission line. Logical decision making can be defined by fuzzy sets using the
(2.4) operating conditions. The fuzzy sets are defined by equations
2.1.4 Generation capacity constraints called the membership functions. These functions represent the
To stabilize the operation, the generator output, bus voltage degree of membership in some fuzzy sets using the values from 0
magnitudes and voltage angles are restricted by upper and lower to 1. The membership value 0 indicates incompatibility with the
limits. These upper and lower bounds are defined as following: sets, while 1 means full compatibility. When neither is true, a value
(2.5) between 0 and 1 is taken. To find out the membership function
Where of cost and line flow first step is to find the minimum and
i=1,2,3…..n maximum values of cost and line flow.

Voltage magnitude must satisfy the inequality

Where
i = 1, 2, 3…..n
= minimum voltage of the unit
= maximum voltage of the unit (2.12)
The power system equipment is designed to operate at fixed
voltages with allowable variation of 5-10) % of the rated value.
Voltage angle also satisfy the inequality
(2.6)
Where
i = 1, 2, 3…..n
= minimum voltage angle of the unit
= maximum voltage angle of the unit Where
= value of an original fuel cost which is varying
2.2 Line Flow = value of an original fuel cost that is completely
Whenever the network component is overloaded then line flow satisfactory
losses occurs in the network. In a competitive market, line flow = value of an original fuel cost that is completely
has its own importance because of the complexity involved. This
unsatisfactory
line flow may be due to overloading of transmission line. Line
flow is managed at the dispatch stage In this paper to reduce the 2.3 Methodology
line flow we minimized the line flow in branch 2 from bus 1 to Step1. Input parameters of system, fuel cost co- efficient
bus 3.
and specify lower and upper boundaries and define
2.2.1 Computation of Line Flow: minimum fuel cost function.
Consider that line is connecting the buses I and M. The Real Step2. Get the power generation for six generating units
power is injected from bus I to M and is given as following.
and total fuel cost and total losses.

616
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Step3. For minimizing line flow we have to check whether Table 2. Result of Test case 2
any line is overloaded or not.
Step4. If overload exists, find the minimum value of line Power Fuel
Line Fuel
Test Case Losses cost
flow by using equations Flow(MW) cost($/h)
(MW) (Rs./hr)
Step5. As the fuel cost and line flow are the conflicting
objectives so an optimal solution cannot be obtained, hence
to obtain the optimal solution linear membership function is With
applied. losses and 6.13 51.88 907.27025 57158
line flow
Step 6.The Value of membership function is obtained using
equation (2.12) for fuel cost and line flow which lies on one
optimal point.
3.3 Test Case 3
Here generation cost coefficients and generation limit of six unit
3. RESULT AND DISCUSSION system are taken from appendix. In this test case operating cost
The fuzzy decision making technique is tested on four different with losses of six unit systems is calculated. For minimizing the
test cases for six unit system of economic load dispatch and line Line Flow equation of branch 2 from bus 1 to bus 3, load flow
flow problem. The test case 1 considers only operating cost equations are applied.
without line flow and losses, test case 2 considers operating cost Table 3. Result of Test case 3
with losses, test case 3 considers losses with line flow and
operating cost and test case 4 considers operating cost with line Power Line
flow and losses. The cost coefficient and operating ranges data Fuel Fuel cost
Test Case Losses Flow
and load data for 1 hour is taken with power demand 290 MW. cost($/h) Rs./hr
(MW) (MW)
3.1 Test Case 1
Here generation limit of six unit system and the generation With
cost coefficients are taken. For this test case line flow and Minimization of
losses are not considered. In this test case operating cost 4.3 27.72 999.64 62977.32
Line Flow in
and real power generation of six unit system is calculated. Branch 2(1-3)
For this test case condition used as

3.4 Test Case 4

Where In this test case operating cost including line flows with power
i = 1, 2, 3…..6 losses of six unit system is calculated using fuzzy decision making
= Real power generation of ith generator technique with linear membership function.
= Real power demand
Table 4. Result of Test case 4
.
Table1. Result of Test case 1 Power Line
Fuel cost Fuel cost
Test Case Losses Flow
($/h) (Rs./hr)
(MW) (MW)
Total Fuel Cost Total Fuel Cost
Test Case
( $/hr) ( Rs/hr)
When Fuzzy 4.83 35.79 938.12538 59101.56
Decision
Without losses 882.4157 55591.83 Making is
Applied

Membership 0.666 0.666

3.2 Test Case 2 Function
Here generation cost coefficients and generation limit of six unit
system are taken. In this test case operating cost with losses of six
unit system is calculated. Here we use line flow equations when
losses are considered.

Where
i = 1, 2, 3…..6
= Real power generation of ith generator
= Real power demand
= Power losses

617
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.5 Comparison between different voltages Table 6. Performance parameters of IEEE 30 Bus System

1.120
Voltage Magnitude

1.100 Power Line Fuel

Fuel cost
1.080 With Losses Test Cases Losses Flow cost
Rs./hr
(MW) (MW) ($/h)
1.060
1.040 Minimization of
1.020 Line Flow With Losses 6.13 51.88 907.27 57158
1.000
0.980 Fuzzy Decision With
Making Minimization
1 5 9 13 17 21 25 29
of Line Flow 4.3 27.72 999.64 62977.3
in Branch
Load Bus No. 2(1-3)
Fig 1. Comparison of voltages for different test cases

Table 5. Power generation of six units for different cases When Fuzzy
Decision
4.83 35.79 938.12 59101.5
S Test Making is
N Case (MW) (MW) (MW) (MW) (MW) (MW) Applied

1 Case 1 130.2 62.96 23.6 35 19.0 19.0

Linear
Membership 0.666 0.666
2 Case 2 127.7 64.63 25.0 35 21.4 22.2 Function

3 Case 3 59.3 80 50 35 30 40

4. CONCLUSION
4 Case 4 86.28 68.91 34.6 35 30 40
In this paper, Fuzzy Decision Making technique is applied to
economic power generation for six generating units. Fuzzy
Decision Making Technique was employed to solve the ELD
problem for four cases of six generating unit system without
140 losses, with losses, with minimization of line flow and fuzzy
decision making technique with linear membership function. The
conclusion describes the capability of the proposed fuzzy decision
120 multi-objective technique to solve the problem of economic load
Power Generation (MW)

Without Losses dispatch and line flow.

100
With Losses REFERENCES
80 [1] Wood, A.J. and Wollenberg, B. F.1984,“Power Generation
Minimization of Operation and Control”, John Wiley and Sons.
60 Line Flow
[2] Farag, A.,Baiyat, S.A.and Cheng, T.C.1995, “Economic load
Fuzzy Decision dispatch multi-objective optimization procedure using
40 Making linear programming techniques,” IEEE Transactions on
Power Systems, vol. 10, no 2, pp 0885-8950.
20
[3] Behera, R., Panigrahi, P. B. and Pati, B. B 2001, “Economic
Load Dispatch Using Modified Genetic Algorithm.”
0
1 2 3 4 5 6 [4] Niimura, T. and Nakashima, T.2003, “Multi-objective trade-
off analysis of deregulated electricity transactions,”
No. of Generating Units sciences direct Electrical Power and Energy Systems, vol.25,
pp. 179–185.
[5] Abido, M.A 2003, “A novel multi-objective evolutionary
Fig 2. Graph for power generation of six units for different algorithm for environmental/Economic power dispatch,”
cases Science Direct Electric Power Systems Research, vol.65,
pp.71-/81.

618
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[6] Bae, J., Song, K., Rin, J., and Lee, K.Y.2005,"A particle
swarm optimization for economic
dispatch with non-smooth cost functions", IEEE
Transactions on Power Systems, vol.20, no.1,pp.34-42.
[7] Bae, J., Won, Y., Kim, H. and Shin, J.2006, “An Improved
Particle Swarm Optimization for Economic Dispatch with
Valve-Point Effect”, International Journal of Innovations in
Energy Systems and Power, Vol. 1, no. 1.
[8] Abedinia, O., Garmarodi, D., Rahbar, R., and Javidzadeh,
F.2012, “Multi-objective Environmental/Economic Dispatch
Using Interactive Artificial Bee Colony Algorithm,” J. Basic.
Appl. Sci. Res., vol.2, no.11, pp.11272-11281.
[9] Surekha, P. and Sumathi, S. 2012, “Solving Economic Load
Dispatch problems using Differential Evolution with
Opposition Based Learning”, Wseas Transactions on
Information Science and Applications, volume 9, issue 1.
[10] Soni, S.K and Bhuria, V. 2012, “Multi-objective Emission
constrained Economic Power Dispatch Using Differential
Evolution Algorithm”, International Journal of Engineering
and Innovative Technology (IJEIT) volume 2, issue 1, pp
120-125.
[11] Agrawal, S., Bakshi, T. and Majumdar, D. 2012, “Economic
Load Dispatch of Generating Units with Multiple Fuel
Options Using PSO”, International Journal of Control and
Automation vol. 5, no. 4, pp 79-92.
[12] Mathur, D. 2013, “A New Methodology for Solving
Different Economic Dispatch Problems,” International
Journal of Engineering Science and Innovative Technology,
vol.2, pp. 494-499.
[13] Bijay Baran Pal, Kumar, M. 2013, “A linear Fuzzy Goal
Programming Method for Solving Optimal Power Generation
and Dispatch Problem”, International Journal of Advanced
Computer Research, volume 3, number 1, issue 8, pp 56-64.
[14] Ramyasri, N.and Reddy, G.S. 2013, “Fuzzified PSO for
Multiobjective Economic Load Dispatch Problem,”
International Journal of Research in Engineering and
Technology, volume 2 issue 8, pp. 157-162.
[15] Palaniyappan, S., and Ilayaranimangammal, I.2013, “An
Optimistic Solution Technique For Economic Load Dispatch
Problem Using Immune Inspired Algorithm” , International
Journal of Advanced Research in Electrical, Electronics and
Instrumentation Engineering volume 2, issue 12, pp. 6191-
6195.
[16] Rajangam, K., Arunachalam, V.P, Subramanian, R. 2013,
“Fuzzy Logic Controlled Genetic Algorithm to Solve The
Economic Load Dispatch For Thermal Power Station”,
European Scientific Journal , edition vol. 8, No.7, pp 172-
184.
[17] Kothari, D.P. and Dhillon, J.S. 2013 “Power System
Optimization”, PHI.
[18] Appendix 19, “Data Sheets for IEEE 30 Bus System” pp.
129-134.

619
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Allocation of Multiple DGs and Capacitors in Distribution
Networks by PSO Approach
Satish Kansal Rakesh Kumar Bansal
Associate Professor M.Tech Student
Electrical Engg. Department Electrical Engg. Department
BHSBIET Lehragaga BGIET Sangrur
kansal.bhsb@gmail.com rkbansal.lehra@gmail.com
ABSTRACT
Distributed generation (DG) has been utilized in some electric
power networks for power loss reduction, voltage
improvement, postponement of system upgradation,
environmental friendliness and increasing reliability. This
paper presents the application of particle Swarm Optimization
(PSO) technique to find the optimal placement of DGs and
capacitors in the radial distribution networks for active and
reactive power compensation by reduction in real power
losses. The improvement in voltage is also considered in this
work. The analytical expressions based on exact loss formula
are considered for real power loss reductions. The proposed
technique is tested on standard 33-bus, 69-bus test systems.
General Terms
Application of PSO based technique is used for optimal
allocations of DGs and Capacitors in the distribution
networks.
Keywords
DG, capacitor, optimal size, optimal location, power loss.
1. INTRODUCTION
Recent development in small generation technologies has
drawn an attention for the utilities to change in the electric
infrastructure for adapting distributed generation (DG) in
distribution systems. Employment of DG technologies makes
it more likely that electricity supply system will depend on
DG systems and will be operated in deregulated environment
to achieve a variety of benefits. As DG systems generate
power locally to fulfill customer demands, appropriate size
and placement of DG can drastically reduce power losses in
the system. DG inclusion also defers transmission and
distribution upgrades, improves supply quality and reliability
and reduces green house effects. Distributed generation is a
topical area of research and interest in this area has been
growing rapidly worldwide.
Including DG in distribution systems requires in-depth
analysis and planning tools. This process usually includes
technical, economical, regulatory, and possibly environmental
challenges. Some of the factors that must be taken into
account in the planning process of expanding distribution
system with DG are: the number and capacity of DG units,
best locations and technology, the network connection,
capacity of existing system, protection schemes, among
others.
Many optimization tools have been utilized to solve different
DG problems, such as: A methodology for evaluating the
impact of DG-units on power loss, reliability, and voltage
620
ISBN: 978-81-924893-0-8
Divesh Kumar
Assistant Professor
Electrical Engg. Department
BGIET Sangrur
diveshthareja@yahoo.com
profile of distribution networks was presented in [1]. The
authors implied that on-line systems including DG-units can
achieve better reliability during interruption situations to keep
customers supplied. The impacts of capacitor placement on
distribution system reliability was considered in [2] by
defining two objective functions. The first one is the sum of
reliability cost and investment cost, and the second one is the
sum of reliability cost, cost of losses and investment cost.
The genetic algorithm to find the optimal placement of DG in
the compensated network for restoration the system caused by
CLPU condition and to conserve load diversity for reduction
in losses, improvement in voltage regulation was discussed in
[3]. In [4],[5], genetic algorithm (GA) based method is also
used to determine size and location. GA is suitable for multi
objective problems like DG allocation and can give near
optimal results, but they are being computationally demanding
and slow in convergence. The improved Tabu Search
algorithm with the introduction of mutation operator to
improve the local search ability and to reduce computation
time to minimize the loss in large scale distribution systems
was introduced in [6]. The authors in [7] reconfigure the
distribution network using ant colony search algorithm by
minimize the system losses. In [8], the authors analyzed the
DG optimal location analytically for two continuous load
distributions, uniformly distributed and uniformly increasing
loads. The goal of their studies was to minimize line losses
and observed that the optimal location of DG which is highly
dependent on the load distribution along the feeder;
significant losses reduction would take place when DG is
located toward the end of a uniformly increasing load and in
the middle of uniformly distributed load feeder. The analytical
approach has been demonstrated in [9, 10] to find the optimal
size and location of DG to minimize the real power losses and
enhancement in voltage profile. In [11], an analytical method
to determine the optimum location–size pair of a DG unit was
proposed in order to minimize only the line losses of the
power system. A fast analytical approach to find the optimal
size of DG at optimal power factor to minimize the power loss
however only type III has been exploited [12]. The authors
find the optimal location in [13], based on the sensitivity test
independently to overcome the limitation of right-of-way or
real estate cost and heuristic curve-fitted technique is applied
to find the optimal size of DG at predetermined power factor
to minimize the power system loss.
Optimal placement of capacitor for loss reduction, a well
known 2/3 rule is presented in [14] for uniformly distributed
loads. Many researchers have applied other techniques such as
GA [15] to improve the power quality in the presence of
voltage and current harmonics. The objective function was to
minimize the cost of power loss and capacitor banks taking
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

the voltage limits, number and size of capacitor bank as

constraints. In [16] the authors proposed a fuzzy expert
system based on voltage and power loss reduction indices to
minimize peak power loss reduction by means capacitor
placement. The hybrid approach Tabu search combination and
with heuristic techniques was employed in [17] for capacitor are the ijth element of [Zbus]
placement to minimize the objective function in terms of cost
and loss. matrix

Most of the approaches presented so for model the optimal Pi = PGi – PDi and Qi = QGi - QDi
placement of DG or Capacitor. However optimal placement of PGi & QGi are power injection of generators to the ith bus.
DG and Capacitor being integrated into distribution systems. PDi & QDi are the loads of ith bus.
The present work develops the comprehensive formula by Pi & Qi are active and reactive power injection of the ith bus.
extending the analytical expression presented in [10] to find
the optimal sizes, optimal locations of DGs and Capacitors to The total power loss against injected power is a parabolic
achieve the objective by compensating the active and reactive function and at minimum losses, the rate of change of losses
powers by the proposed PSO technique. with respect to injected power becomes zero [10].
The paper is organized as follows: Section 2 presents brief
summary of location and sizing issue for reduction of line
losses. The mathematical modeling to calculate the sizes of
DGs and capacitors at optimal locations to minimizing the
system losses has been presented in 3. Section 4 presents the
problem formulation with assumptions and constraints. The It follows that
proposed algorithm for optimal sizing of DGs and Capacitors
at optimal locations to achieve active and reactive power
compensation are introduced in section 5. Section 6 presents
the numerical results of the proposed PSO technique with
interesting observations along with discussions. Finally, the
major contribution and conclusions are summarized in section Where Pi is the real power injection at node i, which is the
7. difference between real power generation and the real power
demand at that node:
2. LOCATION AND SIZING ISSUES
For a particular bus, as the size of DG is increased, the losses
are reduced to a minimum value and increased beyond a size
of DG (i.e. the optimal DG size) at that location. If the size of Where PDGi is the real power injection from DG placed at
DG is further increased, the losses starts to increase and it is node i, and PDi is the load demand at node i. By combining the
likely that it may overshoot the losses of the base case. Also above we get.
notice that location of DG plays an important role in
minimizing the losses. The size at most should be such that it
is consumable within the distribution substation boundary.
Any attempt to install high capacity DG with the purpose of
exporting power beyond the substation (reverse flow of power
though distribution substation), will lead to very high losses
[10]. In distribution system load capacity (MW) will play
important role in selecting the size of DG. The reason for Similarly
higher losses and high capacity of DG can be explained by the
fact that the distribution system was initially designed such
that power flows from the sending end (source substation) to
the load and conductor sizes are gradually decreased from the
substation to consumer point. Thus without reinforcement of
the system, the use of high capacity DG will lead to excessive
power flow through small-sized conductors and hence results
in higher losses.

3. MATHEMATICAL MODELING
3.1Optimal Sizing of DGs and Capacitors
In this section the total power losses will be formulated as
based on real power loss in the system is given by (1).This
formula is popularly referred as “Exact Loss” formula [18].
The equation (4) gives the size of DG and (6) gives the size
of capacitor for each bus i , for the loss to be minimum .Any
size of DG and capacitor other than PDGi and QDGi placed at
bus i, will lead to higher loss.

3.2 Optimal Location of DG and Capacitor

The optimal location can be find for the placement of sizes of
DG and Capacitor as obtained from (4) and (6) which will
give the lowest possible total loss due to placement of DG and
Where, Capacitor at the respective bus. The bus having least power

621
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
loss while satisfying the system constraints will be the optimal
location for the placement of DG and Capacitor [10].
4. PROBLEM FORMULATION
4.1Objective Function
The main objective is to compensate the active power and
reactive power as given in eq. (1) while meeting the following
constraints.
4.2 Assumptions and Constraints
 For each bus, the following power flow equations
must be satisfied.
 The DG & Capacitor under study are supplying real
power & reactive power only.
 The sizing and locations are considered at peak load
only.
 The maximum number of DG and Capacitor units is
three, with the penetration of 100%.
 The voltage at every bus in the network should be
within the acceptable range (Utility‟s standard
ANSI Std. C84.1-1989) i.e., within permissible limit
(±5%) [19],
Vmin ≤ Vi ≤ Vmax
… (9)
 Current in a feeder or conductor, must be well
within the maximum thermal capacity of the
conductor
Here, I_i^Rated is current permissible for branch i within
safe limit of temperature. … (10)
5. PROPOSED ALGORITHM
5.1 Particle swarm optimization technique
The Particle Swarm Optimization (PSO) algorithm is one of
the Evolutionary Computation (EC) techniques. PSO is a
population based and self-adaptive technique introduced
originally by Kennedy and Eberhart in 1995 [20, 21]. This
stochastic-based algorithm handles a population of a
multidimensional space where the optimal solution is
searched. The individuals are called particles and the
population is called a swarm. Each particle in the swarm
moves towards the optimal point with adaptive velocity. Each
particle in the population is treated as a mass-less and volume-
less point in a n-dimensional space. Mathematically, the
622
ISBN: 978-81-924893-0-8
position of particle in a n-dimensional vector is represented
as:
The velocity of this particle is also an n-dimensional vector,
Alternatively, the best position related to the lowest value (for
minimization objective) of the objective function for each
particle is
and the global best position among all the particles or best
pbest is denoted as:
During the iteration procedure, the velocity and position of the
particles are updated. It should be noted that the value of DGs
and capacitors sizes varies between 0 to the sum of loads. This
is regarded as the position of a particle during the
optimization process. Fig.1 illustrates the flow chart of
optimal placement of DGs and Capacitors in the distribution
system at optimal locations by PSO technique taking the
constraints into consideration to minimize the power loss. The
steps used in the proposed algorithm are given below.
Step 1: (Input system data and Initialize): In this step, the
distribution system configuration data, with constraints, such
as maximum-minimum allowed voltages and DG and
Capacitor sizes range are specified. The population size of
swarms and iterations are set. An initial population (array) of
particles with random positions and velocities on dimensions
(Sizes of DGs, capacitors and their respective locations) in the
search space is initialized randomly in this step. Vectors X and
V are also described as shown in (11-12). The PSO weight
factor also set in this step.
Step 2: (Calculation of objective function): The calculation of
objective function (1) is carried out by Backward Sweep and
Forward Sweep Method of distribution load flow [22].
Step 3: (Calculate Pbest): The objective function related to
each particle in the population of the current iteration is
compared with it in the previous iteration and the position of
the particle enjoying a lower objective function as pbest for
the current iteration is recorded,
Where, k is the number of iterations, and f is the objective
function evaluated for the particle.
Step 4: (Calculate Gbest): In this step, the best objective
function associated with the Pbests among all particles in the
current iteration is compared with that in the previous
iteration and the lower value is chosen as the current overall
Gbest
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Start

Recieve data from

Step 5: (Update Velocity): After calculation of the Pbest and
the system
Gbest, the velocity of particles for the next iteration should be
modified by using
Run distribution load
flow for base case

Where, are Set n and m, where

n is number of DGs
the velocities of particle m at iteration k, inertia weight factor, and m is Capacitors
acceleration coefficients, position of particle m at iteration k,
best position of particle m at iteration k and best position
Initialise Particles
among all the particles at iteration k, respectively. (with k1,k2,..kn,P1,P2,...Pn,l1,l2,...lm,Q1,Q2,...Qm)
where, ki is bus number of ith DG
In the velocity updating process, ω, the inertia weight, and C1, Pi is size of ith DG
C2 the acceleration coefficients, should be determined in li is bus number of ith Capacitor
advance. The acceleration coefficients have two values in the Qi is size of ith Capacitor
range of (1,2), and represent the weighting of the stochastic
acceleration terms that pull each particle towards the
individual best position and the overall best position, rand is Set it =1
random functions, generating separate random values in the
range [0, 1], and ω is the inertia weight factor, defined as Calculate fitness(i.e. loss
follows: in network) for each
Particle by placing DGs
and Capacitors at their
respective buses
it = it+1

Where, - Initial inertia Run Distribution load

weight factor, final inertia weight factor, current iteration flow with DG Update Particles
number, maximum iteration number, respectively. using eq(17)

Step 6: (Update Position): The position of each particle at the Constraints

No Update Velocities
next iteration (k+1) is modified as (7)-(10) using eq(15)
Satisfy ?

Fitness =Loss Yes

(in Base case) Fitness = PL (xx)
Step 7: (Check Convergence Criterion): If,
or iter = itermax, the program is terminated
Save old Pbest as
and the results are printed. Otherwise, the program goes to the
Pbest_prev
Step 2. From (15), one can find that the current flying velocity
of a particle comprises of three terms. The first term is the
Update Pbest eq (13) and
particle‟s previous velocity revealing that a PSO system has
Gbest eq (14)
memory. The second term and the third term represent a
cognition-only model and a social-only model, respectively.
The cognition-only model treats individuals as isolated and
reflects private thinking.
If Yes
|Pbest – Pbest_prev|
>ε

No

Output Result

Fig.1: Flow chart of optimal placement of DGs and

Capacitors using PSO Technique

623
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

6. NUMERICAL RESULTS Table 2. Multiple DGs with Three Capacitors

6.1 Test systems

Installed Capacity Loss Loss
The proposed methodology is tested on two different test Cases Bus in Reduction
systems. The first system used in this paper is 33-bus radial No. DG Capacitor (kW) (%)
distribution systems with total load of 3.72 MW and 2.3 (MW) (MVAr)
MVAr [23] and the second one is 69-bus radial distribution Base case 225.0 0.00
system with a total load of 3.80 MW and 2.69 MVAr [24]
with Beaver conductors. Single DG 61 1.81 83.37 62.95
Single DG
Based on the proposed methodology, a computer software & Single 61 1.81 1.29 23.17 89.70
program has been developed in MATLAB environment to run Cap.
load flow, calculate distribution loss and identify the optimal 61 1.81 1.22
size and location of multiple DGs and Capacitors by PSO One DG &
20.14 91.05
Two Cap. 69 0.43
approach, using least loss method as described in [10].
Two DG 17 0.52
6.1.1 33-Bus Test System & Single 12.78 94.32
In this case, multiple DGs are considered with two Capacitors. Cap. 61 1.72 1.29
Table 1 shows the simulation results of optimal sizes,
locations and loss reduction of multiple DGs with two For the optimal placement of single DG and single DG with
Capacitors by the proposed approach. Capacitor, are as given in Table 2 having a loss reduction of
62.95% and 89.7% respectively. As the numbers of DG and
Table 1. Multiple DGs and Capacitors Capacitor units are increased, the loss reduction becomes
more effective. Among the cases, two DGs and single
Capacitor at the optimal locations yield a maximum loss
Installed Capacity Loss Loss reduction of 94.32%, while single DG with single capacitor at
Cases Bus in Reduction optimal locations obtains a minimum loss reduction of only
No. DG Capacitor (kW) (%) 89.70% for 69-bus test system.
(MW) (MVAR)
Base case 211.0 0.00
6.2 Voltage Profile
6 2.49 Tables 3 to 5 indicate the minimum and maximum voltages
Single DG before and after the placement of single DG and single
& Two 12 0.44 50.4 76.11
capacitor, single DG and two capacitors and two DGs with
Cap.
30 1.03 single capacitor of 33-bus and 69-bus test systems
respectively.
13 0.83
Two DG
& Two 30 1.11 1.04 28.5 86.49 Table 3. Voltage profile before and after with single DG
Cap. and Single Capacitor
12 0.44

14 0.75 Voltage @bus before DG Voltage @bus after DG

System
Three DG 24 1.07
& Two 14.9 92.94 Min Max Min Max
Cap. 30 1.03 1.04
33 bus 0.9038@18 1.0000@1 0.9526@18 1.0004@1
12 0.44
1.0000@1-
69 bus 0.9092@65 1.0000@1 0.9723@27
The maximum loss reduction of 92.94% can be achieved by 3,28,36
installing three DGs with two Capacitors and minimum of
single DG with two Capacitors of 76.11%. It is observed that
more the number of DGs and Capacitors installed, the better
Table 4. Voltage profile before and after with single DG
the loss reduction increases.
and Two Capacitor

6.1.2 69-Bus Test System Voltage @bus before DG Voltage @bus after DG
Similar to 33-bus system, the Table II shows the optimal System
sizes, locations and % reduction in line losses of multiple DGs Min Max Min Max
with multiple Capacitors.
33 bus 0.9038@18 1.0000@1 0.9806@18 1.021@30

1.0000@1-
69 bus 0.9092@65 1.0000@1 0.9751@27
3,28,36

624
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Table 5. Voltage profile before and after with Two DG
and Single Capacitor
Voltage @bus before DG Voltage @bus after DG
System
Min Max Min Max
33 bus 0.9038@18 1.0000@1 0.9783@18 1.0003@1
1.0000@1-
69 bus 0.9092@65 1.0000@1 0.9919@69
3,28,36
It is seen that in all the cases the voltage profile
improves, when the number of DG and capacitor units
installed in the system increased, while satisfy all the
current and voltage constraints.
7. CONCLUSION
This paper has proposed the application of particle
swarm optimization technique for finding the optimal
sizes of DGs and Capacitors at optimal locations for
active and reactive power compensation for minimizing
the losses in the primary distribution systems. The
placement of Capacitors in combination with DGs not
only reduces the losses to the great extent, but also
improves the voltage profile of the system. The
placement provides more economy solution for loss
reduction. In the age of integrated grid, the placement
and analysis of DGs and Capacitors give guidance for
optimal operation of power system.
REFERENCES
[1] Borges, CLT and Falcao, DM. “Impact of distributed
generation allocation and sizing on reliability, losses and
voltage profile,” in Proc. IEEE Power Tech Conf.,
Bologna, Italy, 2003, vol. 2, pp. 1–5.
[2] Etemadi AH and Fotuhi-Firuzabad, M. "Distribution
system reliability enhancement using optimal capacitor
placement," IET, Generation, Transmission &
Distribution, 2008, vol. 2, pp. 621-631.
[3] Kumar, V., Kumar, R., Gupta, I., Gupta, H.O.: „DG
integrated approach for service restoration under cold
load pickup‟, IEEE Trans. Power Del., 2010, 25, (1), pp.
398-406.
[4] Kim, K.H., Lee, Y.J., Rhee, S.B., Lee, S.K., „Dispersed
generator placement using fussy-GA in distribution
systems‟, Proc. IEEE Power Engineering Society
Summer Meeting,USA, July, 2002, vol.2, pp.1148-1153.
[5] Kim, J.O., Nam, S.W., Park, S.K., Singh, C.: „Dispersed
generation planning using improved Hereford Ranch
algorithm‟, Elect. Power Syst. Res., October, 1998, 47,
(1), pp. 47-55.
[6] Zhang, D., Fu, Z. and Zhang, L.: „An improved TS
algorithm for loss minimum reconfiguration in large-
scale distribution systems‟, Elect. Power Syst. Res.,
2007, 77, (5-6), pp. 685-694.
[7] Su, C.T., Chang, C.F., and Chiou, J.P.: „Distribution
network reconfiguration for loss reduction by ant colony
search algorithm‟, Elect. Power Syst. Res., 2005, 75, (2-
3), pp.190-199.
625
ISBN: 978-81-924893-0-8
[8] Griffin., Tomsovic, K., Secrest, D., Law, A.: „Placement
of dispersed generation systems for reduced losses‟,
Proc. 33rd Annual Hawaii International Conference on
system Sciences, Maui, Hl, 2000, pp.1-9.
[9] Wang, C., Nehrir, M.H., „Analytical approaches for
optimal placement of DG sources in power systems‟,
IEEE Trans. Power Syst. 19(November (4))(2004), pp.
2068-2076.
[10] Acharya, N., Mahat, P., Mithulananthan, N.: „An
analytical approach for DG allocation in primary
distribution network‟, Elect. Power & Energy Syst.,
December 2006, 28, (10), pp. 669-678.
[11] Gozel, T., Hocaoglu, M.H.: „An analytical method for
the sizing and sitting of distributed generators in radial
systems‟, Elect. Power Syst. Res., 2009. vol.79, pp.
912-918.
[12] Hung, D.Q., Mithulananthan, N., Bansal, R.C.:
„Analytical Expressions for DG Allocation in Primary
Distribution Networks‟, IEEE Trans. Energy
Conversion, 2010, vol.25, (3), pp. 814-820.
[13] Abu-Mouti F. S., El-Hawary M. E.: „Heuristic Curve-
Fitted Technique for Distributed Generation
Optimization in Radial Distribution Feeder Systems‟,
IET Generation, Transmission & Distribution, vol. 5,
no. 2, pp. 172-180, 2011
[14] Schmill, J.V.: „Optimum size and location of shunt
capacitors on distribution feeders‟, IEEE Trans. Power
App. Syst., , Sept. 1965 vol. PAS-84, (9), pp. 825-832.
[15] Masoum, M.A.S., Ladjevardi, M., Jafarian, A. and
Fuchs, E.F.: „Optimal placement, replacement and
sizing of capacitor banks in distorted distribution
networks by genetic algorithms‟, IEEE Trans. Power
Del., , Oct. 2004, vol.19, (4), pp. 1794-1801.
[16] Ng, H.N., Salama, M.M.A. and Chikhani, A.Y.:
„Capacitor allocation by approximate reasoning: fuzzy
capacitor placement‟, IEEE Trans. Power Del., Jan.
2000, vol.15, (1), pp. 393-398.
[17] Gallego, R.A., Monticelli, A.J. and Romero, R.:
„Optimal capacitor placement in radial distribution
networks‟, IEEE Trans. Power Del., Nov. 2001,vol.16,
(4), pp. 630-637.
[18] Elgerd IO, Electric energy system theory: an
introduction, McGraw-Hill; 1971.
[19] H.L.Wills, Power Distribution Planning Reference
Book. New York: Marcel Deckker, 2004.
[20] Kennedy J., Eberhart R.: „Particle Swarm Optimizer‟,
Proc. IEEE International Conference on Neural
Networks, Perth (Australia), IEEE Service Centre
Piscataway, NJ, IV, 1995, pp. 1942-1948.
[21] Eberhart R.C.and Shi Y.: „Comparing inertial weights
and constriction Evaluating computation, San Diego,
California, IEEE service center, Piscataway, NJ, 2000,
pp. 84-88.
[22] Haque M.H., “Efficient load flow method for
distribution systems with radial or mesh
configuration”, IEE Proc. Generation, Transmission
and Distribution, vol.143, issue-1, pp.33-38
[23] Kashem MA, Ganapathy V, Jasmon GB, Buhari MI.
2000. A novel method for loss minimization in
distribution networks. Int. Conf on Electric Ulitity
Deregulation and Restructuring and Power Technology
London.
[24] Baran M, Wu FF.1989. Optimal capacitor placement on
radial distribution systems. IEEE Transaction on Power
Delivery.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Review of Renewable Energy Supply and Energy
Efficiency Technologies
Ramandeep Kaur, Divesh Kumar
Deptt. of Electrical Deptt. of Electrical
Engineering BGIETSangrur
Engineering BGIET, Sangrur diveshthareja@yahoo.com
ramansandhu548@gmail.com
,
ABSTRACT
Solar energy is abundant and offers significant potential for
near-term (2020) and long-term (2050) climate change
mitigation. There are a wide variety of solar technologies of
varying maturities that can, in most regions of the world,
contribute to a suite of energy services. Even though solar
energy generation still only represents a small fraction of total
energy consumption, markets for solar technologies are
growing rapidly. Much of the desirability of solar technology is
its inherently smaller environmental burden and the opportunity
it offers for positive social impacts. The cost of solar
technologies has been reduced significantly over the past 30
years and technical advances and supportive public policies
continue to offer the potential for additional cost reductions.
Potential deployment scenarios range widely—from a marginal
role of direct solar energy in 2050 to one of the major sources
of energy supply. The actual deployment achieved will depend
on the degree of continued innovation, cost reductions and
supportive public policies.
1. INTRODUCTION
The aim of this paper is to provide a synopsis of the state-of-
the-art and possible future scenarios of the full realization of
direct solar energy’s potential for mitigating climate change. It
establishes the resource base, describes the many and varied
technologies, appraises current market development, outlines
some methods for integrating solar into other energy systems,
addresses its environmental and social impacts, and finally,
evaluates the prospects for future deployment.
Some of the solar energy absorbed by the Earth appears later in
the form of wind, wave, ocean thermal, hydropower and excess
biomass energies. The scope of this chapter, however, does not
include these other indirect forms. Rather, it deals with the
direct use of solar energy. Solar energy is an abundant energy
resource. Indeed, in just one hour, the solar energy intercepted
by the Earth exceeds the world’s energy consumption for the
entire year. Solar energy’s potential to mitigate climate change
is equally impressive. Except for the modest amount of carbon
dioxide (CO2) emissions produced in the manufacture of
conversion devices the direct use of solar energy produces very
little greenhouse gases, and it has the potential to displace large
626
ISBN: 978-81-924893-0-8
Ramandeep Kaur
Deptt. of
Electrical Engineering B
BBSBEC, Fatehgarh Sahib
raman16deep89@gmail.c
om
quantities of non-renewable fuels . Solar energy conversion is
manifest in a family of technologies having a broad range of
energy service applications: lighting, comfort heating, hot
water for buildings and industry, high-temperature solar heat
for electric power and industry, photovoltaic conversion for
electrical power, and production of solar fuels, for example,
hydrogen or synthesis gas (syngas). This chapter will further
detail all of these technologies. Several solar technologies, such
as domestic hot water heating and pool heating ,are already
competitive and used in locales where they offer the least-cost
option. And in jurisdictions where governments have taken
steps to actively support solar energy, very large solar
electricity (both PV and CSP) installations, approaching 100
MW of power, have been realized, in addition to large numbers
of rooftop PV installations. Other applications, such as solar
fuels, require additional R&D before achieving significant
levels of adoption. In pursuing any of the solar technologies,
there is the need to deal with the variability and the cyclic
nature of the Sun. One option is to store excess collected
energy until it is needed. This is particularly effective for
handling the lack of sunshine at night. For example, a 0.1-m
thick slab of concrete in the floor of a home will store much of
the solar energy absorbed during the day and release it to the
room at night. When totalled over a long period of time such as
one year, or over a large geographical area such as a continent,
solar energy can offer greater service. The use of both these
concepts of time and space, together with energy storage, has
enabled designers to produce more effective solar systems. But
much more work is needed to capture the full value of solar
energy’s contribution.
2. TECHNOLOGY AND APPLICATIONS
This section discusses technical issues for a range of solar
technologies, organized under the following categories: passive
solar and daylighting, active heating and cooling, PV electricity
generation, CSP electricity generation and solar fuel
production. Each section also describes applications of these
technologies.
2.1 PASSIVE SOLAR AND
DAYLIGHTING TECHNOLOGIES
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

An uncovered absorber, also known as an unglazed

Passive solar energy technologies absorb solar energy, store collector, is likely to be limited to low-temperature heat
and distribute it in a natural manner, without using mechanical production.
elements. The term ‘passive solar building’ is a qualitative
term describing a building that makes significant use of solar A solar collector can incorporate many different materials and
gain to reduce heating energy consumption based on the natural be manufactured using a variety of techniques. Its design is
energy flows of radiation, conduction and convection. The term influenced by the system in which it will operate and by the
‘passive building’ is often employed to emphasize use of climatic conditions of the installation location.
passive energy flows in both heating and cooling, including
redistribution of absorbed direct solar gains and night cooling. . Flat-plate collectors are the most widely used solar thermal
collectors for residential solar water- and space-heating
Daylighting technologies are primarily passive, including systems. They are also used in air-heating systems. A typical fl
windows, skylights and shading and reflecting devices. A at-plate collector consists of an absorber, a header and riser
worldwide trend, particularly in technologically advanced tube arrangement, a transparent cover, a frame and insulation
regions, is for an increased mix of passive and active systems, (Figure 2.1). For low-temperature applications, such as the
such as a forced-air system that redistributes passive solar gains heating of swimming pools, only a single plate is used as an
in a solar house or automatically controlled shades that absorber (Figure 2.2 ).
optimize daylight utilization in an office building. The basic
elements of passive solar design are windows, conservatories
and other glazed spaces (for solar gain and daylighting),
thermal mass, protection elements, and reflectors.
Passive technologies are integrated with the building and may
include the following components:
a) Windows with high solar transmittance and a high thermal
resistance
b) Building-integrated thermal storage,
c) Daylighting technologies and advanced solar control
systems,
Figure2.1 : Schematic diagram of thermal solar collectors: Glazed flat-
In most climates, unless effective solar gain control is plate.
employed, there may be a need to cool the space during the
summer. However, the need for mechanical cooling may often
be eliminated by designing for passive cooling. Passive cooling
techniques are based on the use of heat and solar protection
techniques, heat storage in thermal mass and heat dissipation
techniques. The specific contribution of passive solar and
energy conservation techniques depends strongly on the
climate.

2.2 ACTIVE SOLAR HEATING AND

COOLING

Active solar heating and cooling technologies use the Sun and
mechanical elements to provide either heating or cooling;
various technologies are discussed here, as well as thermal
storage.

2.2.1 SOLAR HEATING

In a solar heating system, the solar collector transforms solar

irradiance into heat and uses a carrier fluid (e.g., water, air) to
transfer that heat to a well-insulated storage tank, where it can
be used when needed. The two most important factors in
choosing the correct type of collector are the following:
Figure:2.2 Schematic diagram of thermal solar collectors:
1) The service to be provided by the solar collector.
Unglazed tube-on-sheet and serpentine plastic pipe.
2) The related desired range of temperature of the heat-carrier
fluid.

627
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Evacuated-tube collectors are usually made of parallel rows of
transparent glass tubes, in which the absorbers are enclosed,
connected to a header pipe (Figure 2.3 ). To reduce heat loss
within the frame by convection, the air is pumped out of the
collector tubes to generate a vacuum.
Figure:2.3 Schematic diagram of thermal solar collectors: Evacuated-
tube collectors.
Solar water-heating systems used to produce hot water can be
classified as passive or active solar water heaters. Active solar
cooling systems, which transform the hot water produced by
solar energy into cold water.
2.2.2 SOLAR COOLING
Solar cooling can be broadly categorized into solar electric
refrigeration, solar thermal refrigeration, and solar thermal air
conditioning. In the first category, the solar electric
compression refrigeration uses PV panels to power a
conventional refrigeration machine. In the second category, the
refrigeration effect can be produced through solar thermal gain;
solar mechanical compression refrigeration, solar absorption
refrigeration, and solar adsorption refrigeration are the three
common options. In the third category, the conditioned air can
be directly provided through the solar thermal gain by means of
desiccant cooling. Both solid and liquid sorbents are available,
such as silica gel and lithium chloride, respectively.
Solar electrical air-conditioning, powered by PV panels. Solar
thermal air-conditioning consists of solar heat powering an
absorption chiller and it can be used in buildings.
Closed heat-driven cooling systems using these cycles have
been known for many years and are usually used for large
capacities of 100 kW and greater. The physical principle used
in most systems is based on the sorption phenomenon. Two
technologies are established to produce thermally driven low-
628
ISBN: 978-81-924893-0-8
and medium-temperature refrigeration: absorption and
adsorption.
Open cooling cycle systems are mainly of interest for the air
conditioning of buildings. They can use solid or liquid sorption.
2.2.3 THERMAL STORAGE
Thermal storage within thermal solar systems is a key
component to ensure reliability and efficiency. Four main types
of thermal energy storage technologies can be distinguished:
sensible, latent, sorption and thermo-chemical heat storage.
Sensible heat storage systems use the heat capacity of a
material. The vast majority of systems on the market use water
for heat storage. Water heat storage covers a broad range of
capacities, from several hundred litres to tens of thousands of
cubic metres.
Latent heat storage systems store thermal energy during the
phase change, either melting or evaporation, of a material.
Depending on the temperature range, this type of storage is
more compact than heat storage in water. Melting processes
have energy densities of the order of 100 kWh/m3 (360
MJ/m3), compared to 25 kWh/m3 (90 MJ/m3) for sensible heat
storage. Most of the current latent heat storage technologies for
low temperatures store heat in building structures to improve
thermal performance, or in cold storage systems. For medium-
temperature storage, the storage materials are nitrate salts. Pilot
storage units in the 100-kW range currently operate using solar-
produced steam.
Sorption heat storage systems store heat in materials using
water vapour taken up by a sorption material. The material can
either be a solid (adsorption) or a liquid (absorption). These
technologies are still largely in the development phase, but
some are on the market. In principle, sorption heat storage
densities can be more than four times higher than sensible heat
storage in water.
Thermo-chemical heat storage systems store heat in an
endothermic chemical reaction. Some chemicals store heat 20
times more densely than water (at a ΔT≈100°C); but more
typically, the storage densities are 8 to 10 times higher. Few
thermo-chemical storage systems have been demonstrated. The
materials currently being studied are the salts that can exist in
anhydrous and hydrated form. Thermo-chemical systems can
compactly store low- and medium-temperature heat.
2.3PHOTOVOLTAIC ELECTRICITY
GENERATION
Photovoltaic (PV) solar technologies generate electricity by
exploiting the photovoltaic effect. Light shining on a
semiconductor such as silicon (Si) generates electron-hole pairs
that are separated spatially by an internal electric field created
by introducing special impurities into the semiconductor on
either side of an interface known as a p-n junction. This creates
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
negative charges on one side of the interface and positive
charges are on the other side (Figure 2.4). This resulting charge
separation creates a voltage. When the two sides of the
illuminated cell are connected to a load, current flows from one
side of the device via the load to the other side of the cell. The
conversion efficiency of a solar cell is defined as a ratio of
output power from the solar cell with unit area (W/cm2) to the
incident solar irradiance. The maximum potential efficiency of
a solar cell depends on the absorber material properties and
device design. One technique for increasing solar cell
efficiency is with a multi junction approach that stacks
specially selected absorber materials that can collect more of
the solar spectrum since each different material can collect
solar photons of different wavelengths.
Figure: 2.4 Generic schematic cross-section illustrating the operation
of an illuminated
solar cell.
PHOTOVOLTAIC APPLICATIONS
Photovoltaic applications include PV power systems classified
into two major types: those not connected to the traditional
power grid (i.e., off-grid applications) and those that are
connected (i.e., grid-connected applications). In addition, there
is a much smaller, but stable, market segment for consumer
applications.
Off-grid PV systems have a significant opportunity for
economic application in the un-electrified areas of developing
countries. Figure 2.5 shows the ratio of various off-grid and
grid-connected systems in the Photovoltaic Power Systems
(PVPS) Programme countries. Of the total capacity installed in
these countries during 2009, only about 1.2% was installed in
off-grid systems that now make up 4.2% of the cumulative
installed PV capacity of the IEA PVPS countries.
Off-grid centralized PV mini-grid systems have become a
reliable alternative for village electrification over the last few
years. In a PV mini-grid system, energy allocation is possible.
For a village located in an isolated area and with houses not
separated by too great a distance, the power may flow in the
mini-grid without considerable losses. Centralized systems for
local power supply have different technical advantages
concerning
629
ISBN: 978-81-924893-0-8
electrical performance, reduction of storage needs, availability
of energy, and dynamic behaviour. Centralized PV mini-grid
systems could be the least-cost options for a given level of
service, and they may have a diesel generator set as an optional
balancing system or operate as a hybrid PV-wind-diesel
system. These kinds of systems are relevant for reducing and
avoiding diesel generator use in remote areas.
Figure:2.5 Historical trends in cumulative installed PV power
of off-grid and grid connected systems in the OECD countries.
Vertical axis is in peak megawatts.
CONCLUSIONS
Potential deployment scenarios range widely—from a marginal
role of direct solar energy in 2050 to one of the major sources
of energy supply. Although direct solar energy provides only a
very small fraction of global energy supply in 2011, it has the
largest technical potential of all energy sources and, in concert
with technical improvements and resulting cost reductions,
could see dramatically expanded use in the decades to come.
Achieving continued cost reductions is the central challenge
that will influence the future deployment of solar energy.
Reducing cost, meanwhile, can only be achieved if the solar
technologies decrease their costs along their learning curves,
which depends in part on the level of solar energy deployment.
In addition, continuous R&D efforts are required to ensure that
the slopes of the learning curves do not flatten before solar is
widely cost competitive with other energy sources. The true
costs of and potential for deploying solar energy are still
unknown because the main deployment scenarios that exist
today often consider only a single solar technology: PV. In
addition, scenarios often do not account for the co-benefits of a
renewable/sustainable energy supply . At the same time, as
with some other forms of RE, issues of variable production
profiles and energy market integration as well as the possible
need for new transmission infrastructure will influence the
magnitude, type and cost of solar energy deployment.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES [5] Chang, K.C., W.M. Lin, T.S. Lee, and K.M. Chung (2009).
Local market of solar water heaters in Taiwan: Review and
perspectives. Renewable and Sustainable Energy Reviews,
[1] A.T. Kearney (2010). Solar Thermal Electricity 2025--
13(9), pp. 2605-2612.
Clean Electricity On Demand: Attractive STE Cost Stabilize
Energy Production. A.T. Kearney GmbH,Duesseldorf,
[6] Bett, A.W., F. Dimroth, W. Gulter, R. Hoheisel, E. Oliva,
Germany, 52 pp.
S.P. Philips, J. Schone, G. Siefer, M. Steiner, A. Wekkeli, E.
Welser, M. Meusel, W. Kostler, and G. Strobl (2009). Highest
[2] Candanedo, J., and A.K. Athienitis (2010). A simulation
effi ciency multi-junction solar cell for terrestrial and space
study of anticipatory control strategies in a net zero energy
applications. In: Proceedings of the 24th European Photovoltaic
solar-optimized house. ASHRAE Transactions, 116(1), pp.
Solar Energy Conference, Hamburg, Germany, 21-25
246-260.
September 2009, pp. 1-6.
[3] Castell, A., I. Martorell, M. Medrano, G. Perez, and L.F.
[7] Braun, M., Y.-M. Saint-Drenan, T. Glotzbach, T. Degner,
Cabeza (2010). Experimental study using PCM in brick
and S. Bofi nger (2008). Value of PV energy in Germany –
constructive solutions for passive cooling. Energy and
Benefi t from the substitution of conventional power plants and
Buildings, 42(4), pp. 534-540.
local power generation. In: Proceedings of the 23rd European
Photovoltaic Solar Energy Conference, Valencia, Spain, 1-5
[4] Catchpole, K.R., and A. Polman (2008). Plasmonic solar
September 2008, pp.
cells. Optics Express, 16(26), pp. 21793-21800.
3645-3652.

630
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Design and Optimization of DGS based T-Stub
Microstrip Patch Antenna for Wireless Applications
Lalit Dhiman
Research Scholar
lalitdhiman1111@gmail.com
ABSTRACT
A compact microstrip patch antenna with wide operational
bandwidth is presented. The proposed design consists of
rectangular patch antenna in ring shaped with U-slots cut in
ground. Antenna is fed by microstrip line. The performance of
rectangular patch antenna has been discussed and analyzed by
modification of the width and length of patch dimensions as
given in the previous work [1].The design proposed that antenna
is having good bandwidth, gain and return loss in frequency
band between 3.5-5 GHz. At resonant frequency 2 GHz antenna
has bandwidth of 10% and return loss up to -44 dB which are
good as compare to reference results. Proposed antenna has been
analyzed using IE3D and simulated results are presented in
terms of bandwidth, gain and return loss at different frequencies.
Keywords : Microstrip line, DGS U-shape, Ring Patch
antenna, Slots cutting.
1. INTRODUCTION
In today world of wireless communication, recent developments
in wireless communication industry continue to derive
requirement of small, compatible and affordable microstrip
patch antennas. A patch antenna is a narrowband, wide-beam
antenna fabricated by etching the antenna element pattern in
metal trace bonded to an insulating dielectric substrate such as a
printed circuit board with a continuous metal layer bonded to the
opposite side of the substrate which forms a ground plane.
Common microstrip antenna shapes are square, rectangular,
circular and elliptical, but any continuous shape is possible.
Some patch antennas do not use a dielectric substrate and instead
made of a metal patch mounted above a ground plane using
dielectric spacers. The resulting structure is less rugged but has a
wider bandwidth because such antennas have a very low profile,
are mechanically rugged and can be shaped to conform to the
curving skin of a vehicle. They are often mounted on the exterior
of aircraft and spacecraft or are incorporated into mobile radio
communications devices. Microstrip antennas are best choice for
wireless devices because of characteristics like low profile, low
weight, ease of fabrication and low cost. Since it is common
practice to combine several radios into one wireless and use
single antenna. Microstrip antenna suffers from disadvantages
like they have less bandwidth and gain. For obtaining multiband
and wideband characteristics,different techniques have been
used like cutting slot in patch, fractal geometry and DGS. In
order to increase bandwidth DGS has been used. DGS may be
realized by cutting shape from ground plane. Shape can be
simple or complex. When DGS has been applied to antenna
equivalent inductive part due to DGS increases and this cause
high effective dielectric constant hence bandwidth reduced. It is
to be noted that within particular area of ground different DGS
can produce different resonant frequencies and different
bandwidth. In this paper two radiating u slot in ground plane
631
ISBN: 978-81-924893-0-8
Simerpreet Singh
EE Department, BGIET, Sangrur
s.simerpreet@gmail.com
have been cut out. Hence new resonances along with effective
current paths are generated in ground plane, as result wideband
characteristics have been obtained.
2. LITERATURE SURVEY
A wide band frequency antenna [1] was obtained for mobile
communication. Radiation patch and ground of proposed
antenna was considerably modified. By two modified U-slots in
the ground plane and a modified ring-shaped radiation patch,
using a T-stub, wide frequency band can be achieved. By
introduction of variable slots in the patches of antenna [2] there
occur less chances of mutual coupling between adjacent
elements. It had been shown that an enhanced bandwidth was
achieved. The incorporation of U-slots in the patch [3] provided
can provide a wider bandwidth than conventional patch antenna
by placing a variable capacitor and an inductor at the antenna
input. A frequency tunable microstrip antenna [4] was presented
by adding U-slot on the patch. This antenna had a planner
compact structure, so it can be incorporated in to wireless
terminals easily. The antenna had good impedance matching at
resonant frequency and measured return loss can reached -43 dB
in operating frequency band. A double L-slots microstrip
antenna for Wi-MAX and WLAN application had been proposed
[5]. The co-planer waveguide fed considered the work comprise
of two rectangular patch elements each embedded on two L-
slots. That design results in a reduction in size and weight and
further allows easy integration in hand-held devices. The
parametric study of considered design showed that radiation
pattern, return loss, voltage standing wave ratio and gain were
optimized within the band operation. A novel tri frequency
monopole antenna [6] for multiband operation was proposed.
For achieving bandwidth enhancement defected ground structure
had been used which has rectangular patch with dual inverted L
shaped strips. Above design found its application in WIMAX
and WLAN. A single patch beam steering antenna with U-slot
[7] was designed, fabricated. Simulated results proved that the
proposed antenna was able to steer the maximum beam direction
in the y-z plane.. The structure of the proposed antenna was
based on a two- layer stacked ECMSA [8]. The radiation patch
of ECMSA was loaded with gaps and stubs to disturb the surface
electric current for the sake of exciting multiple modes. The
impedance bandwidth increased up to 36%. The proposed
antenna was a U-shaped square patch [9] combined with two
parasitic tuning stubs, were fed by a coplanar waveguide (CPW).
The total sizes of dimensions of parameters for the antenna were
introduced and their effects on the frequency characteristics had
been investigated through a parametric study. Simulations and
results indicate that the antenna achieved an ultra wideband
impedance bandwidth (S11, 210 dB) as high as 129%.The
radiation patterns of the antenna were measured and presented.
The gain range from 1.6 to 3 dB against frequency had been
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

obtained. These characteristics make the antenna suitable for

UWB application. A conventional L-probe [10] fed microstrip L
patch antenna was modified so that it may be more easily
fabricated with its own good features preserved. Instead of Where the effective length of the patch Leff
bending a probe in to the L-shape. The measured results showed
that the proposed antenna has a relatively large bandwidth like a
conventional L-probe design. Although the position of a feed
and a patch were inverted, this fact is found to have a little effect Step 5: Calculation of Ground Dimensions
on the proposed antenna. A microstrip patch antenna using the
defected ground structure (DGS) to suppress higher order
harmonics was presented [11]. An H-shaped defect on ground
plane with only one or more unit lattices had been utilized and
yielded band stop characteristics. Comparing with a In this paper dimensions of patch are same with respect to
conventional microstrip patch antenna without DGS unit cell, reference paper [1] and work has been carried out to modify the
the radiated power of DGS patch antenna at harmonic
patch structure to obtain improved results in respect to return
frequencies had been decreased. The book main objective is to
introduce [12], in a unified manner, the fundamental principles loss and bandwidth at same frequency.
of antenna theory and to apply them to analysis, design, and
measurement of antennas. Because there are so many methods of 4. PARAMETRIC ANALYSIS
analysis and design of antenna structures Application of are
made to some of the most basic and practical configurations,
such a dipole antennas, fractal geometry antennas, microstrip 4.1 Basic Designs with Microstrip Line
patch antennas, horn antennas and reflector antennas.
The geometry of Basic Design antenna which is in rectangular
shaped design, compatible size. It is a conventional design
3. ANTENNA DESIGN which is simulated in IE3D Software. It has a rectangular
patch and FR-4 Substrate, which is feeding by Microstrip Line
In this paper a rectangular shaped ring patch antenna has been for IMT/Broadband applications are depicted in Fig 1. The
proposed. Return loss, bandwidth, gain and directivity achieved dimensions of designed antenna with microstrip line feed and
after simulating reference antenna [1]. Slot antenna presented in height of substrate, tangent loss all are mentioned in table 1.
this paper has good bandwidth and return loss as compare to [1]. These dimensions are optimized in order to obtain best results.
The design of the conventional antenna is shown in Fig 1(a). The This antenna has very small dimensions.
antenna has 20mm(y=axis) x 8mm(x=axis) rectangular patch.
The dielectric material selected for this design with dielectric
constant 4 and substrate height of 1mm. According to reference
paper [1] 20x8 mm2 is a very compatible size of patch in fig (1). Table 1: Dimensions of the Reference rectangular patch
The above antenna has been designed by using transmission line antenna
model which is most accurate method. Procedure to obtain the Subject Dimensions
dimension of patch and ground [12] which is followed and Ground size 34×20mm2
modified in reference design [1] can be obtained.
The steps [12] to obtain the dimensions are as follows Patch size 24×8mm2
Loss Tangent (tan 0.02
Step 1: Determination of the Width (W) δ)
The width of the microstrip patch antenna is given by (1) Feed Line size 5×2mm2
Substrate used FR4
Thickness 1 mm
Feeding Microstrip line feed
Technique

It is observed from Fig 1 as shown below a conventional

Step 2: Calculation of effective dielectric constant, , antenna is following rectangular characteristics.
which is given by equation (2)

Step 3: Calculation of the length extension ∆L, which is given

by (3)

Fig 1: Conventional Geometry of Antenna

Step 4: Now to calculate the length of patch by (4)

632
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4.2 Reference Design of Antenna the proposed design has been made in such a way so that it
can operate on a wide range of frequency. In order to achieve
In this design, rectangular shaped ring patch antenna is taken dual band antenna with a larger bandwidth as well as with a
and T- Stub has been applied in the rectangular ring patch [1]. better return loss, ground has been etched by shape of the two
Return loss, bandwidth, gain and directivity are analyzed after U-Slots and patch has been designed in the shape of a T-Stub
simulating the proposed antenna in IE3D environment. Since in ring shaped patch. A square slot cavity has been filled with
there are different disadvantages of microstrip patch antenna, a 7 mm long and 2.2 mm width strip. By doing this, area of
hence to overcome them different techniques like reduction in above the Stub strip increases by 7 mm, T bands have been
patch size, DGS, slot cutting on patch have been applied. In removed, and this antenna is fed by microstrip line as shown
this design T-Stub geometry has been applied on rectangular in Fig 3. Further the antenna parameters have been optimized
ring patch. DGS is applied on ground plane by cutting two U- to get the best possible result. In this design, there is no
slots cuts.Further variations in patch dimensions are made and change in DGS is made. The geometry of proposed antenna is
results are compared. In this design rectangular patch is taken shown in Fig below:
having length of 24mm. By cutting slots, rectangular shaped
ring patch antenna has been formed. This Slot antenna
presented has good bandwidth and return loss as compare to
Reference antenna. The design of the conventional antenna is
as shown in Fig 1. The antenna has rectangular patch
dimensions 20mm along y-axis and 8mm along x-axis. The
dielectric material FR-4 selected for this design with dielectric
constant 4.4 and substrate height of 1mm. As per patch
dimensions given in 20×8 mm2 is a very compatible size of
patch as shown in Fig 2. The proposed antenna has been
designed by using transmission line model which is most
accurate method.

Fig 3 Stub Enlarged to 7 mm up to Microstrip Line

Antenna

4.4 Effect of decreasing Patch Strip Length of Wide Band

Antenna

In this design, the dual band MSA has been designed by

cutting a slot on the patch and hence increasing patch strip
length. This causes antenna to resonate at frequency bands 4.2
GHz. The design specifications of antenna are obtained and
are mentioned in table 3. By changing different parameters
Fig 2 Reference Design of Antenna like slot length and width, results are analyzed.
Table 2 shows dimensions of antenna feed line with
dimension of patch. These dimensions of patch have been Table 3: Parameters of Wideband MSA
modified to obtain improved results in respect to return loss Variable Value
and bandwidth at same frequency.
Height 1mm
T-Stub rectangular enlarged to 3.5mm from centre 3.5mm
Table 2: Shows Dimensions of Antenna Feed Line with
of T (a)
Dimension of Patch.
T- Stub enlarged to 3.5 mm from strip line side (b) 3.5mm

Variable Value
Length of Patch 24 mm
Width of Patch 8 mm
Length of ground 34 mm
Width of ground 20 mm
Thickness of substrate 1 mm
U-slots DGS 24mm along y-
axis, 9mm along
x-axis
Substrate used FR4- epoxy
Feed Point (0, 17, 0)

4.4 Effect of Adding Length in Patch Strip of Antenna
Microstrip Patch Antenna has been designed which operates
on resonant frequency 3.5 GHz and 4 GHz, to get the better
bandwidth as well as the better return loss as compared to the
bandwidth and return loss found in the reference design. Also
Fig 4 (a) T-Stub rectangular enlarged to 3.5mm from
centre of T Antenna (b) T- Stub enlarged to 3.5 mm from
strip line side Antenna.
The proposed antenna can efficiently radiate on the two
central frequencies with a larger bandwidth as well as with a
better return loss. In Design (a), patch has been etched in the

633
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

shape of a T-Stub in ring shaped patch area below Microstrip From the Fig 7 it is observed that Conventional MSA is
Line (MSL) has been cut by 3.5 mm. and In Design (b), patch having VSWR is less than two but greater than one at
has been etched in the shape of a T-Stub in ring shaped patch resonance frequency.
and the area of above the T-Stub strip cut by 3.5 mm, Above It is observed from belove Fig 8 gain of Conventional
the T-Stub instead of square slot cavity has been look like as Antenna at a resonant frequency of 7 GHz is 30 dBi.
U-slot below as showing in Fig 4 (b). After that the antenna
parameter has been optimized to get the best possible result.
In these two configurations, no change in DGS shape has been
made.

5. RESULTS AND DISCUSSION

In this paper results of proposed rectangular microstrip patch
antenna designs are discussed. By making a rectangular ring
microstrip patch antenna with T-stub using DGS, results are
analyzed. Further effect of varying different parameters of
patch like strip width and length results are compared. All
simulations were carried out in IE3D electromagnetic
simulation engine. Fig 8: Gain of Conventional MSA

5.2 Rectangular Ring Patch MSA with T-

5.1 Conventional Rectangular Microstrip
Patch Antenna
In this section the simulation results of the Conventional
microstrip patch antenna is discussed. The simulation design
which is discussed in previous paper has no slotting on patch
and no defected ground. The Fig 1 below shows the S-
parameter of the design.
Stub and U-Slots DGS
In this section the results of the rectangular ring patch MSA
have been discussed. This antenna has a T-Stub in ring patch
and double U-Slot as shown in Fig. This antenna is designed
using procedure given in paper five. This design has same
geometry as given in [1]. Fig 8 below shows the S-parameter
plot of the corresponding antenna.

Fig 9: S-Parameter of Reference Design

Fig 6: S-parameter Plot of Conventional Antenna
As it can be seen from the simulation results that resonance
It is observed from above that Fig 6 than Conventional MSA
frequency of this antenna has been reduced as compare to
resonates at 7 GHz with -17.99 dB of returns loss and a
previous design of conventional antenna. The antenna
bandwidth of 370 MHz
resonates at 25 GHz with -17.44 dB returns loss and
bandwidth of 860 MHz Bandwidth is 60% improved as
compared to previous design. The results have the fluctuating
waveform other than the resonating frequency.

From Fig 10 it has been observed that gain of Reference

Antenna at 25 GHz is 2.81 dBi. From simulation it is seen that
the 2.011 dBi gain of antenna has reduced as compared to 30
dBi gain of previous Conventional MSA.

Fig 7: VSWR of Conventional MSA

634
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig 12 is showing gain of Conventional Antenna. This

antenna has a gain of 1.006 dBi at 3.5 GHz and 3.78 dBi at 4
GHz. It had to design with new idea to increase gain. It can be
seen from simulation result the gain of this antenna has been
reduced as compared to previous Conventional MSA.

5.4 Decreasing Patch Strip Length of Wide

Band Microstrip Patch Antenna
In this section wide band MSA has been designed in which
the patch has been etched in the shape of a T-Stub in ring
shaped patch and also the area below Microstrip Line (MSL)
Fig 10: Gain of Reference MSA
has been cut by 3.5 mm and antenna ground has been etched
by shape of the two U-Slots as shown Fig 4 (a), This antenna
5.3 Dual Band Ring Patch Antenna has a resonating band from 3.63 GHz - 38 GHz.

To achieve improved result patch has been etched in the shape

of a T-Stub in ring shaped patch the area of above the Stub
strip increases by 7 mm, a square slot cavity has been filled
with a 7 mm long and 2.2 mm width strip. T joint has been
removed and ground has been etched by shape of the two U-
Slots and this antenna is feed by microstrip line as shown in
Fig 3. The S-parameter given below:

Fig 13: S-Parameter of T-Stub Rectangular Enlarged to

3.5mm from Centre of T (a)
It is observed from above Fig 13 is showing the optimization
plot of S-Parameter of T-Stub rectangular enlarged to 3.5mm
from centre of T (a) as showing in Fig 4(a). The antenna
resonates is having a resonant band from 3.63 GHz to 83
GHz with -17.19 dB of returns loss and bandwidth of 750
MHz, Bandwidth performance has decreased as compared to
previous design. Now antenna is resonating in a band of 750
MHz

Fig 11: S-Parameter of Dual Band Full Strip Length

Antenna
Fig 11 is showing the optimization plot of S-Parameter of
results of antenna as shown in Fig. The simulated antenna has
better results as compared to the previous simulation results.
The antenna resonates at 3.5 GHz with -28.10 dB, 850 MHz
Bandwidth and 4 GHz with -26.54 dB returns loss and
bandwidth obtained in this case is 300 MHz Results show that
Bandwidth in this case has improved as compared to
Conventional design with multi bands. This antenna resonates Fig 14: Gain Plot of T- Stub Rectangular Enlarged to 3.5
at dual bands. mm from Centre of T (a) at 2 GHz

It is observe from Fig 14 this antenna has a gain of. 2.50 dBi
at 2 GHz. Results of the design as shown in Fig has been
shown in Fig in which The patch has been etched in the shape
of a T-Stub in ring shaped patch the area of above the T-Stub
strip cut by 3.5 mm, the ground remain same. Above the T-
Stub instead of square slot cavity has been looked like as U-
slot below as showing in Fig 4 (b). This antenna has
resonating band 3 GHz - 5 GHz. The analysis waveform given
below:

Fig 12: Gain Plot of Dual Band Ring patch Antenna at

Gain (a) at 3.5 GHz (b) Gain at 4 GHz

635
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

It is observed from above Fig there is comparisons

of entire simulated antenna with conventional antenna and
reference antenna. By using return loss of colors waveforms.
It is observed from above Fig there is comparisons of entire
simulated antenna with conventional antenna and reference
antenna. By using return loss of colors waveforms.
In Fig 17 Bandwidth and Return loss is comparing of all new
designed antennas with reference antenna. All return loss
curve has divided with color.

Table 4: Optimization of Parametric Analysis of Slotted

Fig 15: S-Parameter of T- Stub Enlarged to 3.5 mm from Proposed Antenna
Strip Line Side Antenna (b) Antenna Resonant Retur Gain Bandwidt
Design Frequenc n (dBi h
It is observed Fig 15 that this antenna gives better results. The y (GHz) Loss ) (MHz)
antenna resonates at 4.2 GHz with -44 dB returns loss and (dB)
bandwidth obtained 970 MHz, Bandwidth has improved up to Conventiona 4.7 -17.99 4.33 370
12% as compared to Reference design (860 MHz) (Fig 8) and l Design
as compared to first basic design (370 MHz) improved up to
160% (Fig 6).This antenna resonating frequency at 4.2 GHz Reference 4.25 -17.44 2.68 860
finds application for International Mobile 7mm 3.5 -26.54 1.00 850
Telecommunications (IMT) standards. The performance of increase 6
return loss also minimized. 4.4 -28 3.78 300
3.5 mm cut 3.6 -16 2.40 750
below MSL 4.2 -17.50 2.77
3.5 mm cut 4.2 -44.4 2.50 970
above T
Stub

Fig 16: Gain-Parameter of T- Stub Enlarged to 3.5 mm
from Strip Line Side of Antenna (b)
Fig 16 is showing Gain-Parameter of T- Stub enlarged to 3.5
mm from strip line side of Antenna. At a resonant frequency
of 2 GHz, 2.507 dBi of gain is obtained. The difference
between gain of entire antenna designs shows that gain does
not change a lot.
Fig 17: Comparison of Return Loss all Designed Antennas
6. CONCLUSION
A novel compact microstrip ring patch antenna, fed by
microstrip line is presented for Microwave application. The
microstrip ring patch consists of a T-stub and a U-slot
designed on patch. The patch has total size equal to
24X8mm2. The measured return loss indicates that the
antenna exhibits wide band Characteristics. The bandwidth
characteristics of antenna with respect to the geometrical
parameters are investigated. The proposed antenna shows an
impedance bandwidth as high.
REFERENCES
1. Kaushik sumit, Dhillon S. & Marwah A. 2013
“Rectangular Microstrip Patch Antenna with U-shaped
DGS Structure for Wireless Applications” IEEE
International Conference CICN 2013
2. Mizamohammadi Farnaz, Nourinia Javad and Ghobadi
Changiz 2012 “A Novel Dual-Wide Band Monopole-
Like Microstrip antenna with controllable Frequency
Response” IEEE Antenna And Wireless Propagation
Letter, Vol. 11, 2012.
3. Ismail M.Y., Inam M., Zain A.F.M., Mughal MA. 2010
“Phase and Bandwidth enhancement of Reconfigurable
Reflect Array Antenna with slots Embeded Patch”
IEEE Antenna And Wireless Propagation Letter, Vol. 7,
2010
4. Yang Steven, Kishk A. Ahmad and lee Fong
kai.“Frequency Reconfigurable U-slot Microstrip Patch
Antenna” IEEE ANTENNAS AND WIRELESS
PROPAGATION LETTERS, Vol.7, pp 127-129.
5. Nagarajan V. , Chita R. Jothi “Double L-Slot Microstrip
Patch Antenna for WIMAX and WLAN applications”
Department of Electronics and Communication

636
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Engineering, Adhiparasakhi Engineering College, 9. Golpour M., Koohestani m. “U-shaped microstrip

Chennai, India. Patch Antenna with parasitic tunning stubs for Ultra Wide
6. Wen Lengl, Aan-guo Wang, Xio-tao CAI “Novel Band Applications” Published in IET Microwave,
Radiation Pattern Reconfigurable Antenna with six Antennas & Propgation. Revised on 15th Feb 2009.
beam choices” Science-Direct.com/Journals,April 2012 10. Baik Seung-hun Park Jongkuk, Na Hyung-gi “Design of
pp no-123-28 L-probe Microstrip Patch Antenna” IEEE ANTENNA
7. Liu Wen-Chung, Wu Chao-Ming and Dai Yang, 2011. AND WIRELESS PROPAGATION LETTERS, VOL. 3,
“Design of Triple-Frequency Microstrip-Fed Monopole 2004pp no 117-120.
Antenna Using Defected Ground Structure”, IEEE
Transaction on Antennas and Propagation, Vol.10, pp
2457-2463
8. Jung won Chang, Ha Sangjun “Single Beem Steering
Antenna With U-Slot”@ 2011 crown.
Chen Wen-Ling, Wang Guang-Ming, and Zhang Chen-
Xin, 2009. “Bandwidth Enhancement of a Microstrip-
Line- Fed Printed Wide-Slot Antenna With a Fractal-
Shaped Slot”, IEEE Transaction on Antennas and
Propagation, Vol.59, No.7, pp 2176-2179

637
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Feasibility Study of Hybrid Power Generation using
Renewable Energy Resources in Tribal Mountainous
Region of Himachal Pradesh
Umesh C, Rathore Ved Prakash Verma
ABVGIE&T Pragatinagar ABVGIE&T Pragatinagar
Shimla (HP), India Shimla (HP), India
rathore7umesh@gmail.com ved202verma@gmail.com
ABSTRACT
Electrical energy plays an important role in the development
of a nation. In the country like India, more than 70% of the
total population lives in villages and remote areas. To provide
reliable and clean power to these inaccessible areas, is a
challenging task. This paper presents a feasibility study on the
use of hybrid power generation using various types of
renewable energy resources available in the tribal region of
Himachal Pradesh which lies in the North-Western part of
Himalayan mountain range where living conditions are very
harsh due to extreme cold conditions and tough mountainous
terrain. Based on the current electrical power scenario and
available data related to renewable energy resources in the
region, this paper explores the possibility of hybrid power
generation and the use of micro grid in maintaining the
reliability of electrical power in this part of the world.
General Terms
Hybrid power generation; renewable energy resources;
Keywords
Microgrid; small hydro; wind energy; photovoltaic cell;
storage batteries; induction generators.
1. INTRODUCTION
The present world energy scenario depicts a picture of
concern due to the adverse affects on the environment caused
by the production and consumption of energy across the
globe. There is an imbalance of energy consumption around
the world. Energy consumption is high in most developed
countries. On the other hand, the developing countries need to
consume more energy to ensure economic growth. The world
is gradually marching towards a severe energy crisis due to
ever-increasing demand of energy overstepping its supply. To
tackle the energy crisis and to meet the ever increasing
demand of energy in our day to day life, we need to
understand the importance of energy in our lives and we have
to minimize the use of oil, gas and other conventional energy
sources and must take other alternative steps to explore the
use of non-conventional sources of energy along with efficient
use of energy under energy management programs. With the
rapid advancement in technology, the world is moving
towards the harnessing of alternate sources of energy such as
wind, micro/pico hydro, geothermal, tidal, biomass, and ocean
thermal energy sources etc. A renewable energy system [1]
converts the energy found in sunlight, wind, falling water, sea
waves, geothermal heat and biomass into a form we can use
such as heat or electricity. Most of the renewable energy
comes either directly or indirectly from sun and wind and can
638
ISBN: 978-81-924893-0-8
Vikas Kashyap
ABVGIE&T Pragatinagar
Shimla (HP), India
vikas907@gmail.com
never be exhausted and therefore, they are called renewable
sources of energy. These alternate energy resources can play
crucial role in providing electricity to the majority of world
population living in remote locations where electrical energy
from conventional sources cannot be provided due to
economic constraints. About 20% of the global final energy
consumption comes from renewable sources. The exploration
and use of new renewable sources such as small hydro,
modern biomass, wind, solar, geothermal and bio fuels are
growing very rapidly. The share of renewable in electricity
generation is around 20%, with 16% of the global electricity
coming from hydro power and about 3% from new renewable
energy sources. Wind power is growing at the rate of 30%
annually, with a worldwide installed capacity of about 200
GW and is widely used in Europe, America and Asia.
Emphasis on Photovoltaic electricity generation is also being
given worldwide. Renewable energy conversion technologies
are also suited to rural and remote areas, where energy is
crucial for human development. All over the world small PV
based solar cells; micro hydro and wind based small power
plants contribute a lot in electrification of rural areas [2].
Climate change concerns along with high oil prices and
increasing government supports are driving renewable energy
legislations, incentives and commercialization of these
renewable energy sources.
Hydro energy is the most reliable and cost effective
renewable energy source. Small hydro power systems play a
major role in meeting power requirement of remote and
isolated hilly areas in a de-centralized manner. Small hydro
power plants such as pico and micro-hydro are environment
friendly and they have relatively short gestation periods and
require small investment as compared to large hydro power
plants which require huge capital investment. Estimated
potential of more than 2, 00,000 MW of small hydro exists in
the world. India has a history of more than 100 years in small
hydro. An estimated potential of about 15,000 MW of small
hydro exists in India out of which nearly 6000MW have been
actually identified through more than 2000 sites across India
and most of these sites are located in Himalayan region with
majority of these small hydro power plants located in the
states of Himachal Pradesh, Uttarakhand and Jammu &
Kashmir. However, due to the effect of global warming on
overall environment around the globe and erratic rainfall due
to disturbance in environment, the output of these small hydro
power plants is not consistent. To maintain the reliability and
consistency in output power, the implementation of hybrid
generation in such situation will be beneficial and cost
effective. The best suited alternative in such cases will be to
harness the wind energy potential in such areas along with
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
small hydro, especially in remote locations which are not
connected to grid. Integration of wind energy and hydro
power [3] is the best alternative in maintaining the reliability
of power and utilizing the best possible transmission capacity.
In this paper, the concept of distributed generation using
available renewable energy sources such as wind energy,
photovoltaic and biomass along with small hydro in context to
remote locations in mountainous region has been explored and
suggested to provide the reliable electrical power to this
region.
2. CONCEPT OF MICROGRID &
DISTRIBUTED GENERATION
Microgrid type technologies can play crucial role in providing
the electricity to the majority of the population living in
remote areas with reliability [4]. Connecting a remote
community to the conventional power grid is expensive and
can take much longer period as well as much escalated cost
due to the geographical conditions and economic constraints.
Hybrid microgrids can provide dependable electricity by
intelligently combining power from multiple local sources
such as wind, micro-hydro, photovoltaic & biomass etc.
Micro grids provide reliable and good quality energy services
to off-grid communities living in remote areas. The area of
concern or major constraint in micro grids is in the energy
storage devices such as batteries. Photovoltaic sources or solar
panels, low speed wind energy conversion systems and diesel
generators can last for longer period, but the energy storage
batteries fail much more quickly which leads to escalation of
cost due to their reduced life time. Therefore, in the design of
microgrids, provision of diesel generators is also made as
sometimes it is cheaper to run diesel generators than to add
enough solar panels and batteries to provide power round the
clock especially in emergency applications. However, the use
of diesel generators adds the pollution to environment. The
microgrid designed should need generators only for
emergencies and long stretches of bad weather. Reducing
battery costs and diesel consumption could lower the cost per
kilowatt-hour. Due to subsidies, in developing countries like
India, the high cost of microgrid power is even bigger
obstacle to widespread deployment of microgrid in remotest
part of the country. However in cities micro grids and the
conventional grid will complement each other. The
conventional grid installation is easier in accessible areas like
cities with large consumer loads and it makes more economic
sense. Microgrids will easily be operated along with the
conventional grid. At times of peak demand, utilities can call
on electricity stored in micro grid batteries or use their diesel
generators to provide a boost of power.
Distributed generation (DG) employs small-scale
technologies to produce electricity close to the end users of
electric power. DG technologies often consist of modular and
sometimes renewable-energy generators, and they offer a
number of potential benefits. Distributed generators can
provide lower-cost electricity and higher power reliability and
security with fewer environmental consequences as compared
to traditional power generators. Traditional electric power
network consists of large-scale generating stations located far
from load centers, while distributed generation employ
numerous, but small plants and can provide power on site
with little reliance on the distribution and transmission grid
system [5]-[6]-[7]. DG capacities range from a fraction of a
kilowatt to about 100 megawatts. The power generated at
centralized power plants uses energy from conventional
sources such as coal, oil, natural gas or nuclear fuels.
Centralized power plants based on conventional sources have
639
ISBN: 978-81-924893-0-8
many disadvantages such as the transmission losses, effect on
environment and production of nuclear waste etc. Many of
these issues can be resolved through the use of distributed
generations. By locating, the source near or at the end-user
location the transmission line losses can be minimized.
Distributed generation is often produced by small modular
energy conversion units which are either stand-alone or
integrated into the existing energy grid. Distributed resources
improve the efficiency of electric power system and can
provide type of electric power meeting power quality standard
as compared to large centralized power systems which suffer
from lot of power quality problem. DG facilities offer
potential advantages for improving the transmission of power.
Because they produce power locally for users, they aid the
entire grid by reducing demand during peak times and by
minimizing congestion of power on the network. Large,
centralized power plants emit significant amounts of carbon
monoxide, sulphur oxides, particulate matter, hydrocarbons,
and nitrogen oxides which results in acid rain causing
environmental pollution. On the other hand, distributed
generation technologies substantially reduce emissions.
3. ELECTRICAL POWER SCENARIO
IN HIMACHAL PRADESH
The State of Himachal Pradesh is situated in the northern part
of India and it lies in the North-West Himalayas at 30o 22' 40"
N to 33o 12' 40" N latitude and 75o 45' 55" E to 79o 04' 20" E
longitude. It is almost wholly mountainous state having
altitudes ranging from 350 meters to 6,975 meters with
climate conditions varying from semi-tropical to semi-arctic.
Many of the highest peaks in Himalayan mountainous range
lie in Himachal Pradesh. The State is bordered by Jammu &
Kashmir on North, Punjab on West and South-West, Haryana
on South, Uttarakhand on South-East and China on the East.
The total geographical area of Himachal Pradesh is 55,673 sq.
km and total population as per 2011 census is 68, 56,509 with
population density of 123 persons per square kilometers.
Annual average rainfall varies from 50 centimeters to 250
centimeters. As per the rainfall, the state of Himachal Pradesh
can be divided into three zones namely Outer Himalayas with
average rainfall of 50 -250 centimeters, Inner Himalayas with
average rainfall of 75 -125 centimeters and, Alpine Zone with
snowbound regions having scanty rainfall.
As per preliminary hydrological, topographical and
geological study, an estimated potential of 20,000 MW of
hydro power exists in the state. Apart from this, a large
number of unidentified areas have still been left in the river
basins which can contribute substantially to the power
potential of Himachal Pradesh by way of micro/pico hydro
power plants using the water of small streams. The state of
Himachal Pradesh has the distinction of providing electricity
to all its villages despite difficult geographical constraints.
Micro/pico-hydro power plants are the main sources of
electricity in these remote areas. However, with the
availability of other renewable energy sources such as wind
and solar energy, there is a possibility of using these sources
along with micro-hydro in the form of distributed generation
to maintain the reliability of electrical power in the region.
4. FEASIBILITY OF DISTRIBUTED
GENERATION IN TRIBAL REGION
More than 90% of the state population lives in lower hills of
outer Himalayas and part of inner Himalayas which comprise
almost 50% of the total geographical area of the state. While
in the high altitude snow capped and alpine zone region which
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
comprises of more than 50% of the state’s total geographical
area, only less than 10% of the total population of the state
mostly tribal community lives in tough environmental and
geographical conditions. This is also known as cold desert
having snow bound areas with minimal rainfall. Providing the
reliability in electrical power in these areas is most
challenging task. Although the effort is on to tap the vast
hydro potential available in abundance in the state by
converting into electricity, however, to maintain the reliability
of electrical power in these remote tribal areas is still a
challenging task. The interior Districts of Himachal Pradesh
like that of Lahul & Spitti, Kinnaur and Bharmour area of
Chamba possess large numbers of small water streams which
are sufficient to produce up to 5 MW of electricity. The
receding of glaciers, erratic rainfall in last few years and
extreme temperature changes are the signs of global warming
which we are experiencing now. The hydro power solely
depends on the amount of water available in the rivers and
streams on which power projects are installed. The total water
availability is directly linked to the annual precipitation in the
catchments area in the forms of snow and rainfall. But due to
the climate change in the recent years because of global
warming effects has led to the erratic rainfall. It has direct
impact on the functioning of various power plants mostly
small hydro power plants. Due to the less rainfall, study
carried out by the authors revealed that most of the small
hydro power plants running in the Himalayan region are
operating at under capacity due to the non availability of the
required water for operating the power plants at their designed
capacity as shown in Figure 3.
Figure 1: Micro-Hydro Power Plant of 100kW
Capacity (courtesy HIMURJA)
Figure 2: Small Hydro Power Plant of 2MW Capacity
(courtesy H.P. State Electricity Board)
To verify the facts, the data of five small hydro power
plants located in District Chamba, Himachal Pradesh, was
collected during the months of April, September and October,
640
ISBN: 978-81-924893-0-8
2009. Figure 3 shows the variation in generated power against
the installed capacity as per the collected data:
5000
4500
4000
3500
3000
2500 Installed Capacity(kW)
2000 Min. value of power output(kW)
Max. value of power output (kW)
1500
1000
500
0
Him Ginni AT Hydro KCM HIMURJA
Kailash Global
Figure 3: Graphs showing the power output v/s installed
capacity.
The availability of water for electricity generation is found to
be inconsistent. The situation is worse in the winter when
power requirement is more in this region. Except in the
months of summer, the majority of the small hydro power
plants found to be producing power output less than their
rated installed capacity. To overcome this problem, there are
other renewable energy sources such as wind energy,
photovoltaic available in tribal and remote regions which can
be harnessed to provide electricity to these isolated regions
when there is a scarcity of hydro power during the extreme
winter when water availability is very low. The following
renewable energy resources can be utilized in the hybrid
generation systems suitable for these remote regions having
adverse climatic conditions.
4.1 Wind Energy potential in Mountainous
region
For the state like Himachal Pradesh, wind energy potential
can be utilized to meet the demand of electrical power in
remote areas along with other renewable energy sources
available in that area. It requires preliminary data on wind
availability to explore the feasibility of wind power potential
in the region. The wind energy potential in this part of the
world is assessed using on-site wind speed data procured from
Indian Metrological Department. The temporal resolution
wind speed data sheet from Climate Research Unit has been
used to produce a wind atlas for Himachal Pradesh and the
results show that the mountainous region can minimally
support the electricity generation [8]. The most part of the
tribal region which comes under high elevation zone including
Chamba, Lahual Spiti, Kinnaur, Kullu and Shimla districts in
Himachal Pradesh have relatively higher wind speeds (> 2
m/s) during all seasons. Wind potential in these parts of
Himachal Pradesh is observed to be suitable for small-scale
wind applications like low wind speed turbines, wind-micro
hydro hybrid, agricultural water pumps, wind-solar hybrids,
and battery charging etc. With the technological advancement
in small-scale wind energy conversion systems with cost
effective solutions, these renewable energy sources can meet
the energy demand in remote regions. The highly cold alpine
zone of Chamba, Lahaul Spiti and Kinnaur where the wind
speeds are relatively higher, the wind energy can also be
useful in meeting the heating requirements or in water
pumping applications in this region.
4.2 Wind-solar Hybrid
Wind profile of the Himachal Pradesh shows low wind speed
in most part of the year. This reduction in wind speeds can be
compensated by hybridizing wind with available alternative
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

resources such as solar energy in Himalayan region [8]. A For the smooth functioning of renewable energy conversion
study on the assessment of solar energy potential in Himachal system, the control of generators along with the overall
Pradesh substantiates that it receives monthly average global control of hybrid generation system for load frequency
insolation (incoming solar radiation) of more than 4 regulation is required which involves power electronics based
kWh/m2/day except for the winter months of December and control circuits along with or without the use of dump load
January. The high altitude alpine zone (> 3500 m) consisting [11]. Hybrid power generation system involves various types
of entire tribal region receives lower insolation but higher of renewable energy sources such as wind, small hydro, solar,
wind speeds while in the lower regions with lesser heights diesel generators and biomass etc. Due to the variable inputs
have higher insolation and lower wind speeds [9]. In these of these sources or due to variable load, the output power,
conditions wind-solar hybrid could be the better solution to voltage and frequency have to be regulated for the required
ensure reliable electrical power in the region. This energy can load connected to the hybrid system. The control circuitry in
also be used to charge the storage batteries. The schematic hybrid power generation involves individual or centralized
representation of the wind-solar hybrid power system with converters, switches for dump load control, storage battery
storage battery [10] is as shown in the Figure 4 below: and various sensors. The systems are connected at output
sides of individual converters and a storage battery is also
Wind Energy Conversion connected whose current and voltage is monitored by
System individual converters and optimally controls battery charging
Wind AC DC DC Consumer and supply power to the load. A dump load regulates the
Turbine DC AC AC Load output power and also prevents battery from overcharging.
The role of diesel generator is to supply the load when other
sources inputs are low and battery charging is insufficient.
Photo Voltaic DC The impact of storage battery in hybrid power generation
AC system stability has been effectively proven and found to be
Solar Energy Source productive [14].
Battery
4.4 Use of Induction Generators
In renewable energy conversion system, three phase induction
Figure 4: Wind-Solar Hybrid Scheme generators offer many advantages as compared to
conventional synchronous generators due to their adaptability
4.3 Micro/pico-Hydro, Wind, Solar & to variation in domestic load in isolated conditions and
variable input conditions such as variable water inputs and
Diesel Engine Hybrid varying wind conditions [15]. The use of dump load based
Majority of the micro hydro power plants in isolated mode in control using power electronic devices helps in achieving
Himachal Pradesh are located in the tribal regions of high better control in induction generators to generate required
altitude alpine region which has the scarcity of water in the voltage and to maintain required frequency of generated
extreme winter resulting in lesser power generation from these output. Apart from this, due to the single phase nature of the
small hydro plants. To meet the power requirements under consumer electric load in the domestic sector, single phase
such conditions, distributed generation system comprising of induction generators are preferred over three phase induction
various combination of micro hydro, wind, solar and diesel generators due to their simple construction and low cost per
engine along with suitable energy storage battery system with kW. There are different ways of producing single phase
requisite power control mechanism could be another option. output from induction generators. One of the topology for
The wind-solar, wind-micro hydro hybrid systems have been single phase induction generator is based on the ac tacho
proven to be the best hybrid combination of renewable energy generator [16]. This single phase externally excited low
conversion systems with accurate control of output voltage frequency induction machine working on ac tacho generator
and frequency [10]-[13]. The schematic representation of the principle is very useful for household wind power generation
hybrid scheme involving micro-hydro, wind, solar and diesel at low wind speeds and these can be effectively used in
generator which could be suitable for remote mountainous remote regions with low wind speed profile. The generation is
region is shown in the Figure 5 as below: possible at any speed greater than zero and covers the wide
range of speeds.
Wind Energy Conversion
System
Wind
Turbine
AC
DC
DC
AC
Consumer
Load
4.5 Water Mills (‘Ghraats’)
Water mills in entire Himalayan region are most popular
DC
source of converting kinetic energy of water to mechanical
Photo Voltaic
AC energy for flour mills. With the help of technological
Solar Energy Source Battery advancement, this low cost water energy can be converted
Control
into a source of electrical energy using cost effective
Hydro
technology such as induction generators with simpler control
IG Control
Turbine mechanism. There are estimated over 5, 00,000 watermills
Dump Load (Ghraats) in the Indian Mountain Regions. These 'Ghraats'
Micro-Hydro Power Plant
can lead to potential power generation in the entire Himalayan
Diesel region benefitting the population residing in these areas.
Generator

Diesel Engine Generator

4.6 Pine Needles as source of Bio-mass
Figure 5: Micro-Hydro, Wind, Solar and Diesel Energy
Generator Hybrid System The other resources available for power generation in
Himachal Pradesh could be the use of pine needles from pine

641
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
forest as huge losses due to forest fire occurred due to the
burning of these pine needles every year. Pine needles are
more prone to fire than other wastes like leaves from other
trees, paddy waste as well as wood. These pine needles are
highly susceptible to catch fire, and the whole forest finally
ends up in ashes resulting in loss of property. These pine
needles can be used to generate electricity and collection of
these pine needles through community projects will also
eliminate the risk of forest fire in the hilly terrain. The pine
needles along with other loose agro waste can be processed
for solidifying into solid biomass of high density to make
biomass briquettes. This will give an alternative to the energy
generation coupled with a lot of jobs to the local population to
collect the biomass from the forests and then converting the
same into the briquettes and then to electricity generation. The
block diagram representation of biomass briquetting process
using pine needles as raw material and its use is shown as in
Figure 6 below:
Pressure
Fuel for
Heating
Pine Briquitting Solid Electricity
Briquittes
Needles Process Fuel Generation
Biomass
Temperature Gassifier
Figure 6: Biomass Briquetting process using Pine
Needles
5. CONCLUSION
This paper highlighted the need of harnessing every possible
renewable energy sources available without causing adverse
impacts on environment to generate electrical power to meet
the energy requirements in remotest part of the world to uplift
the living standard of the people living in adverse climatic
conditions. This paper describes the various options of
harnessing available renewable energy resources in the form
of distributed power generation in the tribal regions under
high altitude alpine zone in Himachal Pradesh. This study will
also help in providing the similar facility to generate electrical
power in the entire Himalayan mountain range having the
similar geographical and climatic conditions.
6. ACKNOWLEDGEMENT
Authors sincerely thank the management of Himachal Pradesh
State Electricity Board, HIMURJA and private power
companies AT Hydro, Ginni Global and Him Kailash for
permitting to visit their power plants for collecting data used
in this paper.
REFERENCES
[1] C. Kathirvel and K. Porkumaran, “Technologies for
tapping renewable energy: a survey,” European Journal
of Scientific Research, vol. 67 no.1, 2011, pp. 112-118.
[2] D. K. Lal, B. B. Dash, and A. K. Akella, “Optimization
of photo voltaic/wind/micro hydro/diesel hybrid power
system in HOMER for study area,” International Journal
on Electrical Engineering and Informatics-vol. 3, no. 3,
2011.
[3] NASSER, M. et al. 2008. Experimental results of a
hybrid wind/hydro power system connected to isolated
642
ISBN: 978-81-924893-0-8
loads. In Proceedings of IEEE 13th International Power
Electronics and Motion Control Conference, 2008.
[4] Litifu, Z. et al. 2006. Planning of micro-grid power
supply based on the weak wind and hydro power
generation. In Proceedings of IEEE Engineering Society
General Meeting, 2006.
[5] Chi Ho Eric Cheung, et al. 2009. Development of a
renewable hybrid power generation system. In
Proceedings of IEEE Systems and Information
Engineering Design Symposium, University of Virginia,
Charlottesville, VA, USA, April, 24, 2009.
[6] G. Deb, R. Paul, and S. Das, “Hybrid power generation
system,” International Journal of Computer and
Electrical Engineering, vol. 4, no. 2, April 2012.
[7] Hasan, K., Fatima, K. and Mahmood, M. S. 2011.
Feasibility of hybrid power generation over wind and
solar standalone system. In Proceedings of IEEE 5th
International Power Engineering and Optimization
Conference, Malaysia, 6-7 June, 2011.
[8] Adhikari, S., Adhikary, S. and Umeno, M. 2003. PV
energy potential in Nepal Himalayas: analytical study on
seasonal and spatial variation of solar irradiance for PV.
In Proceedings of 3rd World Conference on Photovoltaic
Energy Conversion, May 11-18, 2003 Osaka, Japan.
[9] Krishnadas, G. and Ramachandra, T.V. 2010. Scope for
renewable energy in Himachal Pradesh, India – a study
of solar and wind resource potential. In Proceedings of
conference at Lake-2010: Wetlands, Biodiversity and
Climate Change, 22-24th December, 2010.
[10] T. Hirose and H. Matsuo, “Standalone hybrid wind-solar
generation system applying dump power control without
dump load,” IEEE Transactions on Industrial Electronics,
vol. 59, no. 2, February 2012.
[11] Cozorici, F., Vadan, I., Munteanu, R. A., Cozorici, I. and
Karaissas, P. 2011. Design and simulation of a small ind-
hydro power plant. In Proceedings of IEEE International
Conference on Clean Electrical Power, 14-16 June 2011,
Ischia, pp. 308-311.
[12] P. K. Goel, B. Singh, S.S. Murthy, and N. Kishore,
“Isolated wind-hydro hybrid system using cage
generators and battery storage,” IEEE Transactions on
Industrial Electronics, vol. 58, no. 4, April 2011.
[13] Aktarujjaman, M., Kashem, M. A., Negnevitsky, M. and
Ledwich, G. 2005. Dynamics of a hydro-wind hybrid
isolated power system. In Proceedings of the
Australasian Universities Power Engineering Conference
(AUPEC 2005), 25-28 Sept., 2005, Hobart, Australia, pp.
231-236.
[14] A. K. Srivastava, A. A. Kumar, and N. N. Schulz,
“Impact of distributed generations with energy storage
devices on the electric grid,” IEEE Systems Journal, vol.
6, no. 1, March 2012.
[15] Rathore, U. C. and Singh, S. 2014. Isolated 3-phase self-
excited induction generator in pico-hydro power plant
using water pump load in mountainous region of
Himalayas. In Proceedings of IEEE Global Humanitarian
Technology Conference - South Asia Satellite (GHTC-
SAS), September 26-27, 2014 Trivandrum, pp. 40-44.
[16] N. R. Kulkarni and Y.S. Apte, “A novel concept in
design of single phase induction generator for remote
area,” Journal of Engineering Research and Studies,
vol.2, no. 1, January-March 2011.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Modeling & Simulation of Photovoltaic system to
optimize the power output using Buck-Boost
Converter
Shilpa Garg
Department of Electrical Engineering
Bhai Gurdas Institute of Engineering and
Technology, Sangrur, Punjab, India
shipugarg@gmail.com
ABSTRACT
The recent upsurge in the demand of PV systems is due to the
fact that they produce electric power without hampering the
environment by directly converting the solar radiation into
electric power. However the solar radiation never remains
constant. It keeps on varying throughout the day. The need of
the hour is to deliver a constant voltage to the grid irrespective
of the variation in temperatures and solar insolation. In this
paper proposes the design, modeling and simulation of
photovoltaic solar cell model considering the effect of solar
irradiations and temperature changes. The PV array is
modelled using basic circuit equations. Its voltage current and
power voltage characteristics are simulated with different
conditions. It is noticed that output characteristics of PV array
are affected by environmental conditions and conversion
efficiency is low. Therefore a maximum power point tracking
(MPPT) technique is needed to track the peak power to
maximize the produced energy. The maximum power point in
the power voltage graph is identified by an algorithm called as
incremental conductance method. This algorithm will identify
the suitable duty cycle ratio in which buck boost converter
should operate to maximum point. The Simulink model for
solar cell, buck boost converter, MPPT algorithm is modeled
and simulated.
Keywords
Photovoltaic, Buck-Boost, Maximum Power Point, Direct
Current
1. INTRODUCTION
The Conventional sources of energy are rapidly depleting.
Moreover the cost of energy is rising and therefore
photovoltaic system is a promising alternative. They are
abundant, pollution free, distributed throughout the earth and
recyclable. The hindrance factor is it’s high installation cost
and low conversion efficiency. Therefore our aim is to
increase the efficiency and power output of the system. It is
also required that constant voltage be supplied to the load
irrespective of the variation in solar irradiance and
temperature. PV arrays consist of parallel and series
combination of PV cells that are used to generate electrical
power depending upon the atmospheric conditions (e.g solar
irradiation and temperature). So it is necessary to couple the
PV array with a boost converter. Moreover our system is
designed in such a way that with variation in load, the change
in input voltage and power fed into the converter follows the
open circuit characteristics of the PV array. Our system can be
used to supply constant stepped up voltage to dc loads. Solar
energy has been harnessed by humans since ancient times
using a variety of technologies. Solar radiation, along with
643
ISBN: 978-81-924893-0-8
Divesh Kumar
Department of Electrical Engineering
Bhai Gurdas Institute of Engineering and
Technology, Sangrur, Punjab, India
diveshthareja@yahoo.com
secondary solar-powered resources such as wave and wind
power, hydroelectricity and biomass, account for most of the
available non-conventional type of energy on earth. Only a
small fraction of the available solar energy is used [13]. Solar
powered electrical generation relies on photovoltaic system
and heat engines. Solar energy's uses are limited only by
human creativity. To harvest the solar energy, the most
common way is to use photo voltaic panels which will receive
photon energy from sun and convert to electrical energy. Solar
technologies are broadly classified as either passive solar or
active solar depending on the way they detain, convert and
distribute solar energy. Solar energy is abundantly available
that has made it possible to harvest it and utilize it properly.
Solar energy can be a standalone generating unit or can be a
grid connected generating unit depending on the availability
of a grid nearby. Thus it can be used to power rural areas
where the availability of grids is very low. Another advantage
of using solar energy is the portable operation whenever
wherever necessary. But there are two major problems with
PV generation systems. One is the low conversion efficiency
of solar energy into electrical power and the other is the non
linear characteristics of PV array which makes the electrical
power generated vary with temperature and solar irradiation
[2], [3]. In general there is only one point on P-V and V-I
curve called the maximum power point. At this point only PV
system operates with maximum efficiency and produces
maximum output power. But this maximum power point is not
known hence calculation models or search algorithms known
as maximum power point tracking techniques are used to find
the maximum power point. A common MPPT Technique is
well known as power feedback method which measures the
power of PV array and uses it as feedback variable. Based on
power feedback there are three important tracking techniques
used in PV systems. They are the Perturbation and
Observation (P&O), the hill climbing method, the incremental
conductance method.
2. BLOCK DIAGRAM OF PV SYSTEM
Fig.1 shows PV system block diagram with MPPT Technique.
It consists of PV array, Buck-Boost converter, MPPT block,
and finally to load. Combination of Series and parallel solar
cells constitute PV array. Series connection of solar cells
boost up the array voltage and parallel connection increases
the current. In order to change the input resistance of the panel
to match the load resistance (by varying the duty cycle), a DC
to DC converter is required [4]. Buck-Boost converter is used
to obtain more practical uses from solar panel. The input of
buck boost converter is connected to PV array and output is
connected to load. MPPT block receives voltage and current
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
signals from PV array. The output of MPPT block is series of
pulses. These pulses are given to the converter. Converter
works based on these pulses to make the PV system operate at
Maximum power point (MPP)
Fig.1. Block Diagram
2.1. Equivalent model
The PV cell model is represented by equivalent electrical
circuit shown in Fig. 2. The model contains a current source,
diode, series resistance Rs, shunt resistance and load. The
current source produces which depends on radiation. The
output current is the difference between photo current and
diode current.
Fig.2. One Diode model Of PV Cell
The equations of PV module are as follows: Current output of
PV module is
Output voltage of PV cell is
644
ISBN: 978-81-924893-0-8
The PV cell output voltage is a function of the photocurrent
that mainly determined by load current depending on the solar
irradiation level during the operation [5].
Module photo current:
Change of temperature and irradiation changes voltage and
current outputs of PV array. Figures shows P-V and V-I
characteristics of PV array for different temperature and solar
irradiance conditions
Fig.3. P-V and V-I characteristics of PV array
3. BUCK-BOOST CONVERTER
The buck–boost converter is a type of DC-DC converter that
has an output voltage magnitude that is either greater than or
less than the input voltage magnitude. Two different
topologies are called buck–boost converter. Both of them can
produce a range of output voltages, from an output voltage
much larger (in absolute magnitude) than the input voltage,
down to almost zero. The output voltage is of the opposite
polarity than the input. This is a switched-mode power supply
with a similar circuit topology to the boost converter and the
buck converter. The output voltage is adjustable based on the
duty cycle of the switching transistor. One possible drawback
of this converter is that the switch does not have a terminal at
ground; this complicates the driving circuitry. Neither
drawback is of any consequence if the power supply is
isolated from the load circuit (if, for example, the supply is a
battery) because the supply and diode polarity can simply be
reversed. The switch can be on either the ground side or the
supply side. The circuit diagram is shown in figure 4.
Fig.4. Buck-Boost Converter
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 While in the On-state, the input voltage source is directly
connected to the inductor (L). This results in
accumulating energy in L. In this stage, the capacitor
supplies energy to the output load.
 While in the Off-state, the inductor is connected to the
output load and capacitor, so energy is transferred from L
to C and R.
4. SIMULINK MODEL OF PV CELL
WITH BUCK – BOOST CONVERTER
A DC-DC converter is considered as a DC transformer that
provides a loss less transfer of energy between different
circuits at different voltage levels. When DC-DC conversion
is needed there is also a need for control, need for higher
efficiencies, and minimum output ripple voltage, this means
increase and decrease voltages with control is needed. So, the
switching frequency control, or PWM duty ratio control is
required. In the proposed buck-boost converter, the input
voltages from (5-20 V) are possible to produce constant (12 V)
output which will be use in the design of solar home
applications effectively.
Fig.5 Simulink Model of PV Cell
Fig.6. Simulink Model of PV cell with Buck- boost converter
645
ISBN: 978-81-924893-0-8
5. MPPT TECHNIQUE
The efficiency of a solar cell is very low. In order to increase
the efficiency, methods are to be undertaken to match the
source and load properly. One such method is the Maximum
Power Point Tracking (MPPT). This is a technique used to
obtain the maximum possible power from a varying source. In
photovoltaic systems the I-V curve is non-linear, thereby
making it difficult to be used to power a certain load. This is
done by utilizing a boost converter whose duty cycle is varied
by using MPPT algorithm. Few of the many algorithms are
listed below [3], [4], [5] and [8]. A Buck-boost converter is
used on the load side and a solar panel is used to power this
converter. There are many methods used for maximum power
point tracking two are listed below:
 Perturb and Observe method
 Incremental Conductance method
5.1. Perturb and Observe method
This method is the most common. In this method very less
number of sensors are utilized [5] and [6]. The operating
voltage is sampled and the algorithm changes the operating
voltage in the required direction and samples dPdV. If dPdV
is positive, then the algorithm increases the voltage value
towards the MPP until dPdV is negative. This iteration is
continued until the algorithm finally reaches the MPP.
5.2. Incremental Conductance method
This method uses the PV array's incremental conductance
dIdV to compute the sign of dPdV. When dIdV is equal and
opposite to the value of I/V (where dPdV =0) the algorithm
knows that the maximum power point is reached and thus it
terminates and returns the corresponding value of operating
voltage for MPP. The First two are the most widely used
methods for maximum power point tracking. The advantage
of P&O algorithm is simple and easy to be implemented,
especially using the low cost micro controller system.
However, the main drawback of the algorithm is that it
oscillates around the maximum power point, due the
perturbing process to find the maximum power point.
5.3. Flow chart for perturb & observe:
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
5.4. Results
Fig.7. I-V Curve of PV Cell
Fig.8. P-V Curve of PV Cell
Fig.9. Output of PV Cell with Buck Boost Converter
646
ISBN: 978-81-924893-0-8
Fig.10. Final output with MPPT
From figure 9
At T=50 degree and S=400 w/ m² I= 10Ampere, V=76.5 volt
and P=712 watt At T=50 degree and S=200 w/ m² I=5.05
Ampere, V=86 volt and P= 395 watt
From Figure 10
At T=50 degree and S=400 w/ m² I= -4.7 Ampere, V=-47
volt and P=470 watt At T=50 degree and S=200 w/ m² I=-3.8
Ampere, V=-38 volt and P= 350 watt
6. CONCLUSION
The buck boost converter is modelled using equation model
approach, rather than circuit model approach. By developing
model using equation modelling, the model could be modified
or extended easily. To verify the developed equation model,
the comparison to the existing circuit model is done. The
experiment result shows that the developed model is suited to
the existing one. Moreover, a MPPT control model (P&O
algorithm) is modelled and tested using several experiment
data. The experiment results show that the overall model
behaves like the real situation. Further, the properties of P&O
algorithm such as the effect of the step value of perturbing
duty cycle and the oscillation problem are well simulated. In
future, the different MPPT methods will be evaluated.
Furthermore, the MPPT algorithm will be applied to the other
renewable energy, such as the wind energy system. The
various waveforms were obtained by using the plot
mechanism in MATLAB.
REFERENCES
[1] M. G. Villalva, J. R. Gazoli, E. Ruppert F,
"Comprehensive approach to modeling and simulation of
photovoltaic arrays", IEEE Transactions on Power
Electronics, 2009 vol. 25, no. 5, pp. 1198--1208, ISSN
0885-8993.
[2] M. G. Villalva, J. R. Gazoli, E. Ruppert F, "Modeling
and circuit-based simulation of photovoltaic arrays",
Brazilian Journal of Power Electronics, 2009 vol. 14, no.
1, pp. 35--45, ISSN 1414-8862.
[3] Mummadi Veerachary, "Control of TI-SEPIC Converter
for Optimal Utilization of PV Power", IICPE, 2010 New
Delhi.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[4] R. Sridhar, Dr. Jeevananathan, N. Thamizh Selvan,
Saikat Banerjee, “Modeling of PV Array and
Performance Enhancement by MPPT Algorithm",
International Journal of Computer Applications (0975 –
8887) Volume 7– No.5, September 2010.
[5] Hairul Nissah Zainudin, Saad Mekhilef, “Comparison
Study of Maximum Power Point Tracker Techniques for
PV Systems”, Cairo University, Egypt, December 19-21,
2010, Paper ID 278.
[6] Katherine A. Kim and Philip T. Krein, “Photovoltaic
Converter Module Configurations for Maximum Power
Point Operation”, University of Illinois Urbana-
Champaign Urbana, IL 61801 USA.
[7] Huan-Liang Tsai, Ci-Siang Tu, and Yi-Jie Su,
“Development of Generalized Photovoltaic Model Using
MATLAB/SIMULINK”, Proceedings of the World
Congress on Engineering and Computer Science 2008
WCECS 2008, October 22 - 24, 2008, San Francisco,
USA.
[8] Elgendy M A, Zahawi B, Atkinson D J. Assesment of
Perturb and Observe MPPT Algorithm Implementation
Techniques for PV Pumping Applications. IEEE
Transactions on Sustainable Energy. 2012; 3(1): 21-33.
[9] Rashid M M, Muhida R, Alam A H M Z, Ullah H,
Kasemi B. Development of Economical Maximum
Power Point Tracking System for Solar Cell. Australian
Journal of Basic and Applied Sciences. 2011:5(5): 700-
713.
[10] Wenhao C, Hui R. Research on Grid-Connected
Photovoltaic System Based on Improved Algorithm.
Przeglad Elektrotechniczny (Electrical Review). 2012; 3b:
22-25.
[11] Takun P, Kaitwanidvilai S, Jettanasen C. Maximum
Power Point Tracking using Fuzzy Logic Control for
Photovoltaics Systems. Proceedings of International
MultiConference of Engineers and Computer Scientists.
Hongkong. 2011.
647
ISBN: 978-81-924893-0-8
[12] Al Nabulsi A, Dhaouadi R. Fuzzy Logic Controller
Based Perturb and Observe Maximum Power Point
Tracking. Proceedings of International Conference on
Renewable Energies and Power Quality. Spain. 2012.
[13] Putri R I, Rifai M. Maximum Power Point Tracking
Control for Photovoltaic System Using Neural Fuzzy.
International Journal of Computer and Electrical
Engineering. 2012; 4(1): 75-81.
[14] Sedaghati F, Nahavandi A, Badamchizadeh M A,
Ghaemi S, Fallah M A. PV Maximum Power-Point
Tracking by Using Artificial Neural Network.
Mathematical Problems in Engineering. 2012; Vol. 2012,
Article ID 506709: 1-10.
[15] Kalirasu A, Dash S S. Modeling and Simulation of
Closed Loop Controlled Buck Converter for Solar
Installation. International Journal of Computer and
Electrical Engineering. 2011; 3(2): 206-210.
[16] Pandiarajan N, Ramaprabha R, Ranganath M.
Application of Circuit Model for Photovoltaic Energy
Conversion System. International Journal of Photoenergy.
2012; Vol. 2012, Article ID 410401: 114.
[17] Samosir A S, Sutikno T, Yatim A B M. Dynamic
Evolution Control for Fuel Cell DC-DC Converter.
TELKOMNIKA. 2011: 9(1): 183-190.
[18] G R Walker. Evaluating MPPT Converter Topologies
Using A MATLAB PV Model. Journal of Electrical &
Electronics Engineerin. Australia. 2001; 21(1): 4956.
[19] J V Gragger, A Haumer, M Einhorn. Averaged Model of
a Buck Converter for Efficiency Analysis. Engineering
Letter. 2010; 18(1).
[20] J A Jiang, T L Huang, Y T Hsiao, C H Chen. Maximum
Power Tracking for Photovoltaic Power Systems.
Tamkang Journal of Science and Engineering. 2005; 8(2):
147-153.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Modelling and Analysis of Grid Connected Renewable

Energy Sources with active power filter

Harmeet Singh Jasvir Singh

BGIET, Punjab (India)
harmeet21nov@gmail.com
jasvir.604@gmail.com

ABSTRACT 2. PROPOSED TOPOLOGY

The integration and control of renewable energy in electric The proposed topology consists of control strategy of inter-
power systems is evaluated. The DC/AC converter is used to connection between photovoltaic panel and grid connected
convert the power generated from RES to the grid, Also, shunt
inverter as shown in figure (1).
APF feature is introduced to compensate current unbalance,
load current harmonics, load reactive power demand and load
neutral current. With such a control, the combination of grid-
interfacing inverter and the 3-phase 3-wire linear/non-linear
unbalanced load at point of common coupling (PCC) appears
as balanced linear load to the grid. The proposed system is
modeled and simulated in MATLAB Simulink environment.
An extensive simulation study is carried out to validate the
proposed control approach.

Keywords
Renewable Energy, Grid-interconnection, Active Power
Filter, Power Quality. PLL, Hysteresis

1. INTRODUCTION
The interest in the development of renewable energy sources
generation system such as photovoltaic solar cells connected
to the power grid has increased in the last few years due to
diminishing of the world‟s conventional sources of energy.
Also, the very large use of conventional fossil fuels which are Fig.1: Grid Connected PV System
the primary source of energy causes the serious environmental
pollution and problems. Therefore renewable energy offers a The power injected from the PV panel into grid through the
promising alternative source and has received great attention dc/ac controller. The proposed system also operates as an
in research because it appears to be one of the possible solu- active power filter which is capable of compensates harmonic
tions to environmental problem. Also, One of the most prom- components, generated by the non linear load connected to the
ising applications of renewable energy to supply power for system.
remote communities where main electrical grid is absent.
There are many renewable energy sources are available. 3. SYSTEM MODEL
Photovoltaic generation is becoming increasingly important
as a renewable energy source since it exhibits a great merits 3.1 Photovoltaic Array
such as less maintenance, noise free and pollution free. Also, Photovoltaic Array is formed by combinations of series and
the capability of the system to supply AC loads, relieving the parallel connection of PV solar cells. A simple solar cell
grid demand and making possible to send energy from the equivalent circuit model [4] is shown in figure (2). From the
panels to the grid. figure it is clear that Iph is the photo-generated current or the
In this paper the integration and control of renewable energy amount of solar radiation ( photon) that are received at the
in electric power systems is evaluated. The DC/AC converter surface of solar cell, Id is the diode current (i.e. The current
is used to convert the power generated from RES to the grid, between the p-n junction of the bulk material of cell which act
Also, shunt APF feature is introduced to compensate current
as a diode).
unbalance, load current harmonics, load reactive power de-
mand and load neutral current. With such a control, the com-
bination of grid-interfacing inverter and the 3-phase 4-wire
linear/non-linear unbalanced load at point of common coupl-
ing (PCC) appears as balanced linear load to the grid. The
proposed system is modeled and simulated in MATLAB
Simulink environment. An extensive simulation study is car-
ried out to validate the proposed control approach.

648
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Ipv

RS

Rp RL

Iph Id IRp

Fig 2: Equivalent circuit of photovoltaic cell

IRp is the shunted resistance (i.e. the resistance due to recom-

bination of electron pair that are going to the load), Rs is the
series resistance (i.e. the resistance between the bulk material
within the contact of p-n junction) and RL is the load resis- Fig 3: V-I characteristics of PV cell
tance. Now, find out the photovoltaic current Iph by applying The expression of diode saturation current, Io is given in
the Kirchhoff‟s current law at particular node where Iph, diode equation (5) which depends on temperature.
current Id, Rp and Rs meet, we get the following equation:

Iph = Id + IRp + Ipv (1) Io = Io,r( )exp[ ( - )] (5)

We get the following expression for the photovoltaic current Where, Io,r is the reference diode saturation current, q
from the above equation:
=1.602 10-19 C is the electron charge, k =1.380 10-23
Ipv = Iph – Id – IRp (2) J/K is the Boltzmann constant, Eg =1.12 eV is the band gap
energy. The expression of reference diode saturation current is
given by the following equation:
(3)

where Iph and Io are the Photovoltaic (PV) and diode satura-
tion current, respectively, and Ipv and Vpv is the photovoltaic
current and photovoltaic voltage of the array and Vt = NskT/q
is the thermal voltage of the array. Ns is the number of cells
connected in series, q is the electron charge (1.60217646 ×
10−19 C), k is the Boltzmann constant (1.3806503 × 10−23
J/K), T (in Kelvin) is the temperature of the p-n junction, and
A is the diode ideality factor. The equation (3) gives the rela-
tionship between the output parameter of the solar cell i.e. Ipv
and Vpv. The behaviour of these output parameter is non-linear
as shown in figure (3), there are three important points: short
circuit (0, Isc), MPP (Vmp, Imp) and open circuit (Voc, 0)
clearly shown in figure (3).
Io,r = (6)
Where, Voc,r is the reference open-circuit voltage, Vt,r is the
nominal thermal voltage of the cell Isc,r is the short-circuit
current at the nominal condition (25oC and 1000W/m2).
Cells combinations is used to enhance the performance
or rating of the Cell, therefore cells connected in parallel in-
crease the current and cells connected in series provide greater
output voltages. Hence a practical PV array consists of several
PV module(combination of solar cell) connected in series (Ns)
and parallel (Np). Therefore, the equation of PV array written
as (7) which is the modified form of the equation (3).

The expression of photo-generated current, Iph is given in Ipv = NpIph –

equation (4) where it linearly depends on solar Irradiance and
also effected by temperature. NpIo[ (7)

Iph = [Iph,r + Ki(T – Tr)] (4)

Where, Iph,r is the photo generated current at the reference For simplification term has been neglected
condition(25oC and 1000W/m2), S is the irradiance or insola-
tion, T is the cell temperature, Sr and Tr is the irradiance and and then further solve the equation (7), we get the following
cell temperature at reference conditions, Ki is the short-circuit equations:
current/temperature coefficient.
(8)

649
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

= (9)

tion (G), temperature (T), number of cell connected in series

4. CONTROL STRATEGY
(Ns) and parallel (Np) and PV Voltage as input and generate
There are two control strategy namely hysteresis controller to the PV current as output as shown in figure (5).
generate appropriate pulses and inner control loop as shown in
figure (1). These control topology are explained in this section
as below:

Control Strategy of Grid Connected Inverter

This paper propose the current control approach based on
hysteresis comparator [8] where reference current is the con-
trol variable. This reference current (Iabc*) is calculated by
multiplication of in-phase component of reference current(Ic)
to the unity grid voltage component (Uabc).
Where,
Fig.5: Masked simulink diagram of the solar PV panel

The M-file for diode current has been developed using the
equation (5) and photovoltaic current subsystem block is
Also, Ic current is calculated from the dc-voltage control loop developed using the equation (4). This diode current and
as shown in figure (4) by comparing the Vdc to the Vdc*, and photovoltaic current is connected according o equation (7)
then respective error signal is given to the PI controller. This resulting to generate the PV current.
PI controller is responsible to maintain a constant dc – link
voltage at the input of the grid interface inverter. The waveforms obtained by varying the solar insolation
but keeping temperatures constant which are fed into the PV
array model have been plotted as shown in figure (6).
I-V Characteristics with different irradiation levels
20
S = 1000
18
S = 800
16 S = 600
S = 400
14
Current in watt

12

10

0
0 5 10 15 20 25 30 35 40 45 50
Voltage in volt

Fig.6: I-V Characteristics with different irradiation

Fig.4:Control strategy of grid interface inverter
From Figure(7), we observed that by increasing the solar
Now, the reference current(Iabc*) are compare with the ac- radiation at constant temperature the voltage and current
tual grid current (Iabc) in the current control loop as shown output from PV array also increases.Hence by increasing
in figure (4) and resulting error signal are given to the hys- insolation we can get our required level voltage.
teresis current controller to generate the switching pulse for
the grid interface inverter.

5. SYSTEM MODELLING IN MAT-

LAB/SIMULINK

5.1 Validating the PV Array

Figure (5) shows the masked simulink structure of PV array
based on equation (1 - 7) [9]. The model use the solar irradia-

650
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

P-V Characteristics with different irradiation levels

500 Irradiation level 600 w/m2 Irradiation level 800 w/m2 Irradiation level 1000 w/m2
S = 1000 4
x 10
450 S = 800 1
S = 600

Psource
400 S = 400 0

350
-1
power in watt

300
-2
0 0.5 1 1.5
250
6000
200

Pload
4000
150
2000
100
0
50 0 4 0.5 1 1.5
x 10
0 2
0 5 10 15 20 25 30 35 40 45 50
Voltage in volt

Pinv
0
Fig.7: P-V Characteristics with different irradiation
-2
0 0.5 1 1.5
5.2 Simulation result of whole system Time
The PV array has been interface with the grid using a current
controlled voltage source converter. This includes the PV Fig.9: Distribution of power
module, inverter and control circuit [8]. In section B, control 200

methodology has been explained, according to that the Vdc is

Vout 0
calculated from the MPPT and Vdc* is given calculated value
-200
but in this paper Vdc* is set by itself according to phase to 50
0 0.5 1 1.5

phase voltage given to grid. In this way controller generate the

Iabc

0
pulses for the inverter. The modeling and simulation of the
whole system has been done in MATLAB/SIMULINK envi- -50
0 0.5 1 1.5
50
ronment.
ILabc

-50
0 0.5 1 1.5
100
Iinv

-100
0 0.5 1 1.5
800
Vdc

600

400
0 0.5 1 1.5
Time

Fig.10:Simulation Results

15

10
Load Current

-5

-10

-15
0.2 0.22 0.24 0.26 0.28 0.3 0.32 0.34 0.36 0.38 0.4
Fig.8: Grid Connected PV System Time

Fig.11: Non-Linear curve of phase ‘a’

The proposed topology is validated with the help of figure(9)
and figure(10) having system response for different solar
i. First mode of operation – Grid and PV feeds the
insolation levels is given. The simulation is run for 1.5 sec
load demand
and insolation is varied at each 0.5 sec such as insolation is set
at 600w/m2 initially from 0-0.5s after that insolation is set at
Figure (12) shows the experimental results
800w/m2 from 0.5-1.0s and than insolation remains at
1000w/m2 for remaining interval. The figure (11) shows the when load demand is shared by both grid and
non-linear curve of phase „a‟ and figure (10) shows that the photovoltaic system. The simulation time for
harmonics generated by non linear load is compensated this mode is 0-0.5sec and after feeding the
perfectly through active filter. power from PV, the remaining demand is
fulfilled by power grid. the phase opposition of
voltage and current waveform of phase „a‟
shows that the grid is feeding the load.

651
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Irradiation Level of 600 W/m2 Irradiation Level of 1000 W/m2

200 200
Va

Va
0

-200
0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 0.45 0.5 -200
1 1.05 1.1 1.15 1.2 1.25 1.3 1.35 1.4 1.45 1.5
50 20
Ia

Ia
0

-50
0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 0.45 0.5 -20
50 1 1.05 1.1 1.15 1.2 1.25 1.3 1.35 1.4 1.45 1.5
50
ILa

ILa
0

-50
0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 0.45 0.5 -50
1 1.05 1.1 1.15 1.2 1.25 1.3 1.35 1.4 1.45 1.5
Time Time

Fig.12:Power injected from the grid

Fig.14 :Power absorbed by the grid

Figure (14) shows the experimental results when load demand

is fulfilled by the photovoltaic system and remaining power is
ii. Second mode of operation – no need to grid power
injected to grid. The simulation time for this mode is 1-1.5sec.
The same phase of voltage and current waveform of phase „a‟
Figure (13) shows the experimental results when load
shows that the power is absorbed by the grid.
demand is fulfilled by the photovoltaic system and there
is no need to grid power. The simulation time for this
6. CONCLUSION
mode is 0.5-1.0sec.
In this paper, the model of grid connected photovoltaic system
Irradiation Level of 800 W/m2
200 is implemented. The system contains a simple model of pho-
tovoltaic array, and grid connected inverter, and active power
Va

0
filter. DC voltage control loop with current control loop me-
-200 thod of DC-AC inverter control is used in this paper. The
0.5 0.55 0.6 0.65 0.7 0.75 0.8 0.85 0.9 0.95 1
50 various values of the voltage and current obtained have been
plotted in the I-V curves of the PV array at different insolation
Ia

0
levels and simulation results of filtering and grid connected
-50
0.5 0.55 0.6 0.65 0.7 0.75 0.8 0.85 0.9 0.95 1 inverter verify the correctness of the proposed model.
50

REFERENCES
ILa

[1] F. Lasnier and T. G. Ang, Photovoltaic Engineering

-50 Handbook. New York: Adam Hilger, 1990
0.5 0.55 0.6 0.65 0.7 0.75 0.8 0.85 0.9 0.95 1
Time [2] J. P. Pinto, R. Pregitzer, L. F. C. Monteiro, J. L. Afonso,
Fig.13: No need to grid power “3-Phase 4-Wire Shunt Active Power Filter with
Renewable Energy Interface” in Proc. Conf. IEEE
iii. Third mode of operation – PV feed power to Rnewable Energy & Power Quality ( ICREPQ’07), 2007.
load as well as grid [3] Wang Xuanyuan, Kazerani M.A novel maximum power
point tracking method for photovoltaic grid-connected
inverters. Industrial Electronics Society, The 29th Annual
Conference of the IEEE, Vol.3, Nov.2003: 2332-2337.
[4] M. G. Villalva, J. R. Gazoli, and E. R. Filho,
"Comprehensive Approach to Modeling and Simulation
of Photovoltaic Arrays," Power Electronics IEEE
Transactions on, vol. 24, pp. 1198-1208, 2009.
[5] E. Matagne, R. Chenni, and R. El Bachtiri, “A
photovoltaic cell model based on nominal data only,” in
Proc. Int. Conf. Power Eng., Energy Elect. Drives,
POWERENG, 2007, pp. 562–565.
[6] Yusof, S. H. Sayuti, M. Abdul Latif, and M. Z. C.
Wanik, “Modeling and simulation of maximum power
point tracker for photovoltaic system,” in Proc. Nat.
Power Energy Conf. (PEC), 2004, pp. 88–93.
[7] Mukhtiar Singh, V. Khadkikar, A. Chandra, and R. K.
Varma, “Grid Interconnection of Renewable Energy
Sources at Distribution Level with Power Quality
Improvement Featues,” IEEE Trans. Power Delivery

652
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[8] Mukhtiar Singh, V. Khadkikar, A. Chandra, and R. K.
Varma, “Grid Interconnection of Renewable Energy
Sources at Distribution Level with Power Quality
Improvement Featues,” IEEE Trans. Power Delivery
[9] R.Murali, P. Nagasekhara Reddy, B. Asha Kiran, “Power
Quality Enhancement of Distributed Network fed with
Renewable Energy Sources based on Interfacing Inverter
ISSN: 2277-3878, Volume-2, Issue-2, May 2013
[10] G.Gnaneshwar Kumar, A.Ananda Kumar, “Renewable
Energy Interconnection at Distribution Level to Improve
Power Quality” Issn: 2278-4721, Vol. 2, Issue 5
(February 2013), Pp 39-48
653
ISBN: 978-81-924893-0-8
[11] Y.Anil Kumar, G.Veeranjaneyulu, “Power Quality
Improvement from Grid Connected Renewable Energy
Sources At Distribution Level Using Fuzzy Logic
Controller” Volume 9, Issue 5 Ver. I (Sep – Oct. 2014),
PP 36-43
[12] N.VimalRadha Vignesh, R.VigneshRam, “Modelling of
Photo Voltaic Array with Active Power Filter” Vol. 3 ,
Issue 4 , April 2014
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3D Finite Element Analysis for Core Losses in
Transformer
Sapreet Kaur
Assistant Professor
UIET, Panjab University,
Chandigarh
sarpreetdua@yahoo.co.in
ABSTRACT
The phenomenal growth of power systems has put burden on
the transformer industry to supply consistent and cost-effective
transformers. Any failure of a transformer or its component
will impair the system performance and social setup. The
reliability of a transformer is a major concern to users and
manufacturers for ensuring a trouble-free performance during
service. Magnetic circuit is considered as the most active
component of the transformer. It consists of iron core and
carries flux associated to the windings. It is important to
understand the connection between iron core and leakage flux
to get a better design of Transformer. Some of the limitation of
using transformer is expenditure by some losses in core. By
solving this difficulty it can save more energy. This paper
presents a numerical technique for calculating the core losses
and its reduction.
Keywords
Finite Element Method, Transformer, Core Losses.
1. INTRODUCTION
A transformer is a multifaceted three dimensional
electromagnetic device, which is used extensively in electric
power systems to transfer power by electromagnetic induction
between the circuits at the same frequency but with different
values of voltage and current. Transformers involve transfer of
power between circuits through the use of electromagnetic
induction. Although transformer is a static most efficient
device of the power system but still there are problems
associated with the transformers which affects its performance.
Majorly transformer has two types of losses associated with it
due to electric current flowing in the windings and the
alternating magnetic field in the magnetic core. The losses
related with the windings are called the load losses, while the
losses related to the core are called no-load losses or core
losses [1]. Load losses vary according to the load on the
transformer. These losses include heat losses and eddy currents
in the primary and secondary windings of the transformer.
Heat losses or I2R losses, in the windings share a major part of
the load losses. These losses can be minimized using a
material with low resistance per cross-sectional area. It is
found that copper is the best suitable conductor material when
designing transformer considering its parameters like size,
weight, cost and resistance. Engineers can also decrease the
resistance of the conductor by increasing the cross-sectional
area of the conductor. But it increases the cost of the
transformer. No-load losses are caused by the magnetizing
current required to energize the core of the transformer. These
losses are independent of the load on the transformer. They are
also called constant losses. Hysteresis losses and eddy current
losses contribute about 99% of the no-load losses, while stray
654
ISBN: 978-81-924893-0-8
Damanjeet Kaur
Assistant Professor
UIET, Panjab University,
Chandigarh
djkb14@rediffmail.com
losses, dielectric losses and I 2R losses are often neglected due
to small amount of no-load current [2].
Transformer
Losses
No-Load Losses Load Losses
Hysteresis Eddy
Current I2 R Leakage
Losses
losses Losses Flux
Losses
Fig. 1: Classification of Transformer Losses
2. RECENT TRENDS IN REDUCTION OF
TRANSFORMER CORE LOSSES
There has been a secure development of core steel material in
the last century from non oriented steels to grain-oriented
steels. The reduction in transformer core losses in the last few
decades is related to a significant increase in energy costs. One
of the best ways to reduce the core losses is to use thinner
grades of core steels. But the price of the thinner grades is
comparatively higher. Despite these disadvantages, core
materials with still lower thicknesses will be available and
used in the future.
The new material is amorphous magnetic alloys which is about
30% of cold rolled grain oriented (CRGO) steel materials,
because of their high resistivity-and low thickness. The flux
distribution in amorphous materials is more uniform in then as
compared to the CRGO materials. The assembly of core is an
automatic process, due to which the amorphous core
transformers are considered as cost-effective with improved
performance [3].
3. CORE LOSS EVALUATION METHOD
Core loss evaluation is a multi-disciplinary problem, requiring
information on Electrical Engineering, Material Engineering
and Physics. Several analytical and numerical techniques are
used for the computation of electrostatic and magneto static
fields in the transformers. Analytical techniques include
double-Fourier method, method of images, separation of
variables, etc. But due to geometric and material complexities,
numerical methods are used for the solution of electrostatic,
electromagnetic, structural, thermal problems [4].
In order to improve the performance of transformer design,
researchers worked on the characteristic, types and
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

performance of magnetic core materials to reduce core losses
[5]. G.W. Swift studied the variables which affect the
performance of magnetic cores with respect to core loss and
exciting current and investigated the effect of frequency and
the effect of series air gaps at the corners [6]. Z. Valkovic
compared the characteristics of different cores and determined
the building factor to study the influence of corner joint
overlap length, the number of laminations per stagger layer,
and the yoke cross-section form [7]. Loffler et al. showed the
improvements of multistep-lap (MSL) jointed cores in
comparison to single-step-lap (SSL) jointed cores to reduce
power losses and concluded that power losses reduces with
more homogeneous flux distribution [8].
The finite element method is a numerical method of analysis
for the explanation of problems described by partial
differential equations. The considered field is represented by a
group of finite elements. The space discretization is realized
by triangles or tetrahedron depending on the problem is 2D or
3D respectively. Therefore, a constant physical problem is
transformed into a discrete problem of finite elements. The
solution of such a problem reduces into a set of algebraic
equations. Therefore, the solution of the 2D or 3D magneto
static problem describing the transformer field reduces into the
estimation of the magnetic field density at each node of the
triangles or tetrahedral of its 2D or 3D mesh, respectively [19].

Girgis et al. carried out an analytical study to determine the

magnitude of core production attributes [9]. Albach et al.
presented a practical method to predict the core losses in
magnetic components for an arbitrary shape of the
magnetizing current [10]. Dolinar et al. determined the
magnetically nonlinear iron core model of a three phase three
limb transformer and compared it with the classical saturated
iron core model [11]. Stranges and Findlay described an
apparatus that determined the iron losses due to rotational flux
[12]. Researchers carried out the experimental study on
various samples of iron core to test the different stacking
patterns of grain oriented silicon steel laminations and reduced
the iron core losses of power transformers [13-15].
3.2 3D FINITE ELEMENT METHOD
BASED MODEL OF TRANSFORMER
CORE
In the 2D FEM analysis, the magnetic field calculation is
conducted with the use of the magnetic vector potential A.
However, in the case of 3D problems, the use of the vector
potential results to great complication, due to the great number
of unknowns parameters. Therefore, the use of magnetic scalar
potential Φm is preferred in the case of 3D magneto static
problem solution. In most of the developed scalar potential
formulations this calculation of Φm is realized with the help of
the following equation:

A modern method of analysis of transformer performance is H = Hs −∇ Φm (1)

Finite element analysis (FEA). It is one of several numerical
methods that can be used to solve complex geometries and is Figure 2 shows the outlook view of the 3D FEM model of the
the considered as the best method used today. FEA consist five
methods that are: transformer active part, comprising the iron core, high and low
voltage windings of single phase.
1. Finite Difference Method (FDM)
2. Moments Method (MM)
3. Monte Carlo Method (MCM)
4. Boundary Element Method (BEM)
5. Finite Element Method (FEM)

FEM is a mathematical method for solving ordinary and

elliptic partial differential equation. It can use to calculate
object with linear or nonlinear. FEM is useful to obtain an
accurate characterization of electromagnetic behavior or
magnetic components such as transformers [16].
These days, finite element method (FEM) is a very effective
numerical tool for the simulation of structural components,
material optimization, reliability enhancement, failure
analysis, corrective action and verification of new designs
under various loading conditions of transformer [17, 18].
Fig. 2: 3D FEM Model of Transformer Core
3.1 FINITE ELEMENT METHOD In transformer analysis, because of ferromagnetic materials
ANALYSIS OF TRANSFORMER properties usually the problems appear in nonlinear form.
Finite element methods used for solving transformer problems Magnetic permeability u=B/H is not constant and is a function
includes three stages. At first stage the problem space is of magnetic field in each mesh.
meshed into contiguous elements of suitable geometry and The ampere law states that:
appropriate values of the material parameters-conductivity, 𝞩 ×H=J (2)
permeability and permittivity to each element are assigned. In
the second stage, the model is excited, so that the initial H: Magnetic field intensity
conditions are set up. Finally, the boundary conditions for the J: Total current density
problem are specified. The finite element method has the
advantage of geometrical flexibility. It is possible to include a
greater density of elements in regions where fields and
geometry are rapidly [16].

655
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
It is a role of magnetic field in each mesh. The B-H curve of
ferromagnetic core as shown in Figure 3 is a hysteresis loop.
The hysteresis loop can be used for calculation of short circuit
reactance or radial and axial electromagnetic force on the
transformer coils but for calculation of flux distribution and
losses in transformer core, the B-H loop is used. Nominal
voltage of primary winding, the value of B and H can be
calculated from the following equation:
E (t) = V (t)-Rio =N dØ/dt (3)
And H = Ni/L (4)
io: no load current
V (t): Terminal voltage in no load circumstance
E (t): EMF
Ø: Flux
R: Resistance of winding
N: Number of turn
L: Mean length
Fig. 3: B-H Curve (Hysteresis Loop)
REFERENCES
[1] T. Steinmetz, B. Cranganu-Cretu and J. Smajic,
“Investigations of no-load and load losses in amorphous
core dry-type transformers”, 19th International
Conference on Electrical Machines (ICEM), pp.1-6, 6-8
Sept., 2010.
[2] R. M. Vecchio, B. Poulin, P. T. Feghali and D. M.
Shah, Transformer Design Principles, CRC Press,
2010.
[3] S. V. Kulkarni and S. A. Khaparde, Transformer
Engineering: Design and Practice, Marcel Dekker Inc.,
2004.
[4] E. I. Amaryllis, M. A. Tsili and P. S. Georgilakis, “The
state of the art in engineering methods for transformer
design and optimization: A survey”, Journal of
656
ISBN: 978-81-924893-0-8
In 3D analysis of transformer we use third order equation, by
which permeability of each part can be calculated as a function
of B. Core attributes can be predicted by using the third order
equation model. 3D model of FEM shows that we can estimate
core losses of a transformer with high accuracy and can
localized flux distribution in the core. Using 3D FEM model
we can also find the hot spots inside the core. The accuracy of
the results increased with the increase in number of meshes.
The mesh generation of these models is as shown in Figure 4.
These types of models show the transformer behavior at the
design stage and required parameters can be considered before
manufacturing them and thereby reducing the design time and
cost [20].
Fig. 4: 3D FEM Mesh Analysis of Transformer Core
4. CONCLUSION
The finite element method is a numerical technique for
obtaining estimate solutions to boundary value problems.
Especially it is an important tool to solve electromagnetic
problems because of its ability to model geometrically and
compositionally complex problems. With the use of advanced
computational tools, more efficient, reliable and compact
transformer can be designed with minimum core as well as
other losses occurring in transformer.
Optoelectronics and Advanced Materials, vol. 10, no. 5,
pp. 1149-1158, May 2008.
[5] H. Chang-Hung, L. Chun-Yao, C. Yeong-Hwa, L. Faa-
Jeng, F. Chao-Ming, J.G. Lin, “Effect of
magnetostriction on the core loss, noise and vibration of
flux gate sensor composed of amorphous materials”,
IEEE Transactions on Magnetics, vol. 49, no. 7, pp.
3862-3865, July 2013.
[6] G.W. Swift, “Excitation current and power loss
characteristics for mitered joint power transformer
cores”, IEEE Transactions on Magnetics, vol. 11, no. 1,
pp. 61-64, Jan. 1975.
[7] Z. Valkovic, “Influence of transformer core design on
power losses”, IEEE Transactions on Magnetics, , vol.
18, no. 2, pp. 801-804, Mar. 1982.
[8] F. Loffler, T. Booth, H. Pfutzner, C. Bengtsson and C.
K. Gramm, “Relevance of step-lap joints for magnetic
characteristics of transformer cores”, IEE Proceedings
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
on Electric Power Applications, vol. 142, no. 6, pp.
371-378, Nov. 1995.
[9] R.S. Girgis, E.G. teNijenhuis, K. Gramm and
J.E.Wrethag, “Experimental investigations on effect of
core production attributes on transformer core loss
performance”, IEEE Transactions on Power Delivery,
vol. 13, no. 2, pp. 526–531, Apr. 1998.
[10] M. Albach, T. Durbaum and A. Brockmeyer,
“Calculating core losses in transformers for arbitrary
magnetizing currents a comparison of different
approaches”, 27th Annual IEEE Conference on Power
Electronics Specialists (PESC 96) Record, vol. 2, pp.
1463-1468, 23-27 Jun., 1996.
[11] M. Dolinar, D. Dolinar, G. Stumberger, B. Polajzer and
J. Ritonja, “A three-phase core-type transformer, iron
core model with included magnetic cross saturation”,
IEEE Transactions on Magnetics, vol. 42, no. 10, pp.
2849-2851, Oct. 2006.
[12] N. Strangers and R.D. Findlay, “Measurement of
rotational iron losses in electrical sheet”, IEEE
Transactions on Magnetics, vol. 36, no. 5, pp. 3457-
3459, Sep. 2000.
[13] R. Findlay, R. Belmans and D. Mayo, “Influence of the
stacking method on the iron losses in power transformer
cores”, IEEE Transactions on Magnetics, vol. 26, no. 5,
pp. 1990-1992, Sep.1990.
[14] P. Marketos and T. Meydan, “Novel transformer core
design using consolidated stacks of electrical steel”,
IEEE International Magnetics Conference (INTERMAG
2006), pp.127, 8-12 May, 2006.
657
ISBN: 978-81-924893-0-8
[15] E. Cazacu, L. Petrescu, “A simple and low-cost method
for miniature power transformers' hysteresis losses
evaluation”, 8th International Symposium on Advanced
Topics in Electrical Engineering (ATEE 2013), pp. 1-4,
23-25 May, 2013.
[16] J.C. Olivares-Galvan, R. Escarela-Perez, F. de Leon, E.
Campero-Littlewood, C.A Cruz, “Separation
of core losses in distribution transformers using
experimental methods”, Canadian Journal of
Electrical and Computer Engineering, vol.35, no.1,
pp.33-39, 2010.
[17] N. Bianchi, Electrical Machine Analysis Using Finite
Elements, CRC Press, 2009.
[18] M. A. Tsili, A. G. Kladas and P. S. Georgilakis,
“Computer aided analysis and design of power
transformers”, Elsevier Journal Computers in Industry,
vol. 59, no. 4, pp. 338-350, Apr. 2008.
[19] M.A Tsili, A.G Kladas, P.S. Georgilakis, A.T.
Souflaris, C.P. Pitsilis, J.A. Bakopoulos, D.G.
Paparigas, “Hybrid numerical techniques for power
transformer modeling: a comparative analysis validated
by measurements”, IEEE Transactions on Magnetics,
vol.40, no.2, pp.842-845, March 2004.
[20] D. Phaengkieo, W. Somlak, S. Ruangsinchaiwanich,
“Transformer design by finite element method with
DOE algorithm”, IEEE International Conference on
Electrical Machines and Systems (ICEMS 2013), pp.
2219-2224, 26-29 Oct., 2013.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
OVERVIEW OF POWER TRADING: MEANING,
SCNEARIO, ISSUES AND CHALLENGES
Pooja Dogra
Master of Technology
(Power Engineering)
BBSBEC, Fatehgarh Sahib
dogra_pooja@yahoo.co.in
ABSTRACT
Power trading inherently means a transaction where the price
of power is negotiable and options exist about whom to trade
with and for what quantum. A robust trading system is very
important for free and fair competitive electricity market
operation. Trading system should be capable of risk hedging
associated with price volatility and other unexpected
changes. Operating behavior of a competitive power market is
significantly affected by the trading arrangements, strategic
bidding, market model and rule. These arrangements are kept
on changing from time to time depending on the requirement
for transparent and non-discriminatory electricity market. In
this paper, various terms related to power trading and
current scenario are discussed. The important key issues and
challenges in this field are also critically analyzed.
Basic idea of ABT and its importance is also discussed.
Keywords
Power trading , Open access, Power market ,ABT.
1. INTRODUCTION
Power trading inherently means a transaction where the price
of power is negotiable and options exist about whom to trade
with and for what quantum. In India, power trading is in an
evolving stage and the volumes of exchange are not huge. All
ultimate consumers of electricity are largely served by their
respective State Electricity Boards or their successor entities,
Power Departments, private licenses etc. and their relationship
is primarily that of captive customers versus monopoly
suppliers. In India, the generators of electricity like Central
Generating Stations (CGSs), Independent Power Producers
(IPPs) and State Electricity Boards (SEBs) have all their
capacities tied up. Each SEB has an allocated share in central
sector/ jointly owned projects and is expected to draw its
share without much say about the price. In other words, the
suppliers of electricity have little choice about whom to sell
the power and the buyers have no choice about whom to
purchase their power from.
The pricing has primarily been fixed/controlled by the Central
and State Governments. However, this is now being done by
the Regulatory Commissions at the Centre and also in the
States wherever they are already functional. Power
generation/ transmission is highly capital intensive and the
Fixed Charge component makes up a major part of tariff.
India being a predominantly agrarian economy, power
demand is seasonal, weather sensitive and there exists
substantial difference in demand of power during different
hours of the day with variations during peak hours and off
peak hours. Further, the geographical spread of India is very
658
ISBN: 978-81-924893-0-8
large and different parts of the country face different types of
climate and different types of loads.
Power demand during the rainy seasons is low in the States of
Karnataka and Andhra Pradesh and high in Delhi and Punjab.
Whereas many of the States face high demand during evening
peak hours, cities like Mumbai face high demand during
office hours. The Eastern Region has a significant surplus
round the clock, and even normally power deficit states with
very low agricultural loads like Delhi have surpluses at night.
This situation indicates enough opportunities for trading of
power. This would improve utilization of existing capacities
and reduce the average cost of power to power utilities and
consumers.
In view of high fixed charges, average tariff becomes
sensitive to PLF. Trading of power from surplus State Utilities
to deficit ones, through marginal investment in removing grid
constraints, could help in deferring or reducing investment for
additional generation capacity, in increasing PLF and
reducing average cost of energy. Over and above this, the
Scheduled exchange of power will increase and un-scheduled
exchange will reduce bringing in grid discipline, a familiar
problem.[1]
2. WHY TRADING
1. To develop a full fledged, efficient and competitive
market mechanism for trading in power and to facilitate
the development of generation projects including through
private investment, both resulting in reliable, economic
and quality power in the long term.
2. Develop power market for optimal utilization of energy
3. Promote power trading to optimally utilize the existing
resources
4. Catalyze development of Power Projects particularly
environment friendly hydro projects
5. Promote exchange of power with neighboring countries.
3. ROLE OF POWER TRADING
1. Trading creates a market based on enforceable contracts
for buying and selling power.
2. Enables (a utility with) a smaller power system to
become part of a large system, obviating the need for
reserve capacity and affording increased reliability as
well as utilization.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4. BENEFITS OF POWER TRADING engaged in generation in accordance with the regulations

1. Seller gets to operate generation capacities at higher
utilization (which would otherwise be backed down);
realizes efficiency and economic benefits.
2. Buyer gets to meet critical loads in a reliable manner,
often substituting costlier sources of generation; realizes
reliability and economic benefits.
5. OPEN ACCESS AND TRADING
The Electricity Act, 2003 which has come into force from
10th June, 2003 repeals the Indian Electricity Act, 1910;
Electricity (Supply) Act, 1948; and Electricity Regulatory
Commissions Act, 1998. In view of a variety of factors,
financial performance of the state Electricity Boards has
deteriorated. The cross subsidies have reached unsustainable
levels. A few States in the country have gone in for reforms
which involve unbundling into separate Generation,
Transmission and Distribution Companies. To address the ills
of the sector, the new Act provides for, amongst others, newer
concepts like Power Trading and Open Access.
Open Access on Transmission and Distribution on payment of
charges to the Utility will enable number of players utilizing
these capacities and transmit power from generation to the
load centre. This will mean utilization of existing
infrastructure and easing of power shortage. Trading, now a
licensed activity and regulated will also help in innovative
pricing which will lead to competition resulting in lowering of
tariffs.
DEFINITION OF ―OPEN ACCESS‖ IN THE
ELECTRICITY ACT, 2003
The non-discriminatory provision for the use of transmission
lines or distribution system or a associated facilities with such
lines or system by any licensee or consumer or a person
specified by the Appropriate Commission‖ Figure .1shows
broad picture of open access mechanism [8]
Open access allows large users of power — typically having
connected load of 1 megawatt (Mw) and above — to buy
cheaper power from the open market. The idea is that the
customers should be able to choose among a large number of
competing power companies–instead of being forced to buy
electricity from their existing electric utility monopoly. It
helps large consumers particularly the sick textile, cement and
steel industrial units by ensuring regular supply of electricity
at competitive rates and boost business of power bourses.
On the basis of location of buying and selling entity, the open
access is categorized as:
1. Inter State Open Access:When buying and selling entity
belongs to different states. In this case CERC regulations are
followed.
It is further categorized as:
1. Short Term Open Access (STOA): open access allowed
for the period of less than one month.
2. Medium Term Open Access (MTOA): open access
allowed for a period of 3 months to 3 years.
3. Long Term Open Access (LTOA): open access allowed
for a period of 12 years to 25 years.
2. Intra State Open Access: When buying and selling entity
belongs to same state. In this case SERC regulations are
followed. It is further categorized as STOA, MTOA, and
LTOA and the duration of which depends on the respective
state open access regulations.

EMERGING INDUSTRY STRUCTURE

Transmission Generation

GENCO GENCO GENCO

TRADER

OPEN ACCESS : Transmission

DISCOM DISCOM DISCOM

Distribution

OPEN ACCESS : Distribution

TRADER

Customer Customer Customer

Fig 1 Emerging industry structure.

659
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
6. POWER MARKET
The Wholesale transactions for electric power globally are
through spot contracts, forward and future contracts and long
term bilateral contracts.[2,6]
TYPES Of TRADING
Bilateral Agreements
Banking Agreements
Power Exchange
Available other resource.
6.1BILATERAL AGREEMENT
An agreement in which each of the parties to the contract
makes a promise or promises to the other party.
Bilateral agreements are of two types.
Bilateral Import
Bilateral Export
These can be done on real time basis, day ahead & on
firm Basis.
Real time :the agreements done on the same day, sometimes
11/2 hour before the scheduling of power. As it takes only
11/2 hour to get the power scheduled depending on the
availability of transmission capacity.
Day Ahead basis:- the agreements which are done one day in
advance.
Firm basis :- the agreements for which the open access have
been applied in advance. Maximum tenure 3 months.
6.2 BANKING AGREEMENT
An agreement between two parties in which either of the party
agrees to supply the power to the other party for a specified
tenure & as per the agreement the power is returned back by
the consuming party in the specified time period.
These type of agreements are also of two types
Day ahead banking
Firm Based
6.3 POWER EXCHANGE
Competitive wholesale spot trading arrangement that
facilitates the selling and buying of electricity
i. It is an organized market that facilitates trade in
standardized hourly and multi-hourly contracts
ii. Develop marginal cost for its energy transaction – A
price index
iii. Power exchanges are ‗ energy only market‘ since
they do not take into account any technical aspects like
transmission constraints or capacity payments.
iv. Bids on an exchange only contain quantity and
prices for a particular period.
v. An exchange is absolutely neutral towards the
market because its rule apply to both sides of the transaction.
660
ISBN: 978-81-924893-0-8
vi. Power exchange is a voluntary market place
vii. Competition in an electricity power exchange‘s spot
market occurs by generators, distributors, traders and large
consumers submitting bids for buying and selling electricity.
viii. Each sale bid specifies the quantity and the
minimum price at which they are willing to supply the energy.
ix. Conversely, each buy bid specifies the desired
quantity and the maximum price at which they are wiling to
buy the energy
x. The power exchange matches supply and demand
along with publishing a market-clearing price.
xi. Power exchange have trading rules, which cover the
setting of prices, delivery, clearing , type of product, timing
etc.
xii. The role of a power exchange is to facilitate the
trade of short- term products.
7. ROLE OF POWER EXCHANGES
Power exchanges in India were conceptualized in 2005. There
was a need for a marketplace, where buyers and sellers could
meet and trade power with genuine price discovery. The
stepping stone for establishing such an exchange was laid in
the Electricity Act, 2003, which introduced the concept of
non-discriminatory open access through provisions for
promoting competition in the market. With the stage set by
the Electricity Act, the country‘s power markets have been
witnessing significant innovation. This has been furthered by
positive regulatory moves to create a vibrant market and
supported by the efforts of market operators to bring out new
products and solutions that benefit consumers, suppliers and
the sector as a whole. Before the operationalization of power
exchanges, the alternatives for purchasing short-term power
included the unscheduled interchange (UI) market (where
prices were volatile) and over-the-counter (OTC) trading
mechanisms (which typically have high transaction costs and
non-standardized contracts). Although the OTC mechanisms
continue to serve an important function, in the past,
consumers wanted a platform that allowed them to enter
standardized contracts, took care of counterparty risks, and
provided fixed acceptable future electricity price signals. The
customer demand for such contracts led to the evolution of
power exchanges.
Recognizing the fact that price signals from an organized
market will promote competition and investments, the Central
Electricity Regulatory Commission initiated the process of
organizing the electricity market by issuing guidelines for
setting up and operating power exchanges. In June 2008, the
country‘s first power exchange – Indian Energy Exchange
(IEX) – commenced operations, followed by Power Exchange
India Limited in October 2008. The power exchanges were
designed to make electricity markets more transparent,
efficient and competitive. The multi-buyer and multi-seller
environment along with access to transmission and
distribution networks increase the responsive- ness of demand
and supply to price signals. The overarching objective of
achieving higher efficiency forms the basis of such platforms.
Today, the power exchanges account for 30 per cent of the
power transacted in the short-term market, thereby serving as
a valuable link in bridging the power demand-supply gap.
The IEX is the leading energy trading platform with a 90 per
cent market share. It started operations with a handful of
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
participants. Over the past five to six years, the number of
participants on the exchange has increased to upto 2,600,
comprising 27 states, five union territories and 500 generators.
Of these, over 2,000 are industrial consumers.
The IEX provides a platform for trading power in the day-
ahead market (DAM)[3,7]
8. TRADING CHALLENGES IN INDIAN
POWER SECTOR SCENARIO
Power Trading has been a subject of discussion right from the
very first day of its existence .Initially, in 2002 when trading
was introduced, people who were in to power sector were
quite skeptical about its existence in the near future. There has
been a number of roadblocks in the path of power trading in
Indian power Sector scenario. Some of the major causes about
the dilemma about the germination of power trading are low
creditworthiness of the distribution utilities, open access
restrictions, rising fuel costs, low liquidity in the market etc.
 The sorrow plight of the DISCOMs is known to
everyone who is directly or indirectly related to the
power sector. Huge debt of distribution utilities are
creating a wider gap between the various development
aspects of the Power sector. IPPs and various other
GENCOs are not ready to wait for the over due
payments from the DISCOMs. Moreover Traders have
not any option to disconnect the supply once the deal has
been finalized. Supplying power without ensuring an
adequate payment security mechanism is a violation of
trading license.
 Trading margin involves a thin percentage of around 1 %
& with the current picture of cash flows of
DISCOMs,many traders may exit the business of trading.
i.e Working capital of traders > Total capitalization
 Limited implementation of Open Access like various
states (Tamil Nadu,Orissa etc) are restraining from Open
Access
 Imposition of high cross subsidy charges are also coming
as hindrance in the roads of Open access implantation
 Another problem of large volume of unscheduled
interchange arising in consideration with ABT. Suppliers
and distribution companies are using this as a
commercial mechanism nowadays to use this power
illegally in literal terms. Appropriate steps are needed to
be taken to reduce UI margins below 1% of the total
power generated(currently its around 2-3 %)
 Another road block is the reduction in availability of
power from the generating companies in terms of
volume. IPPs and captive power producers have taken a
back foot in this scenario.
 Although trading licenses have been issued to no of
power traders but in actual terms there are very power
traders thereby creating a situation of monopolistic
markets.[5]
9. WHAT IS AVAILABILTY BASED
TARIFF
The term Availability Tariff, particularly in the Indian
context, stands for a rational tariff structure for power supply
from generating stations, on a contracted basis. The power
plants have fixed and variable costs. The fixed cost elements
are interest on loan, return on equity, depreciation, O&M
661
ISBN: 978-81-924893-0-8
expenses, insurance, taxes and interest on working capital.
The variable cost comprises of the fuel cost, i.e., coal and oil
in case of thermal plants and nuclear fuel in case of nuclear
plants. In the Availability Tariff mechanism, the fixed and
variable cost components are treated separately. The payment
of fixed cost to the generating company is linked to
availability of the plant, that is, its capability to deliver MWs
on a day-by-day basis. The total amount payable to the
generating company over a year towards the fixed cost
depends on the average availability (MW delivering
capability) of the plant over the year. In case the average
actually achieved over the year is higher than the specified
norm for plant availability, the generating company gets a
higher payment. In case the average availability achieved is
lower, the payment is also lower. Hence the name
‗Availability Tariff‘. This is the first component of
Availability Tariff, and is termed ‗capacity charge‘.
The second component of Availability Tariff is the ‗energy
charge‘, which comprises of the variable cost (i.e., fuel cost)
of the power plant for generating energy as per the given
schedule for the day. It may specifically be noted that
energy charge (at the specified plant-specific rate) is not based
on actual generation and plant output, but on scheduled
generation. In case there are deviations from the schedule
(e.g., if a power plant delivers 600 MW while it
was scheduled to supply only 500 MW), the energy charge
payment would still be for the scheduled generation (500
MW), and the excess generation (100 MW) would get paid for
at a rate dependent on the system conditions
prevailing at the time. If the grid has surplus power at the time
and frequency is above 50.0 cycles, the rate would be lower.
If the excess generation takes place at the time of generation
shortage in the system (in which condition the
frequency would be below 50.0 cycles), the payment for extra
generation would be at a higher rate[3,4]
10. WHY WAS ABT NECESSARY
Prior to the introduction of Availability Tariff, the regional
grids had been operating in a very undisciplined and
haphazard manner. There were large deviations in frequency
from the rated frequency of 50.0 cycles per second (Hz). Low
frequency situations result when the total generation available
in the grid is less than the total consumer load. These can be
curtailed by enhancing generation and/or curtailing consumer
load. High frequency is a result of insufficient backing down
of generation when the total consumer load has fallen during
off-peak hours. The earlier tariff mechanisms did not provide
any incentive for either backing down generation during off-
peak hours or for reducing consumer load / enhancing
generation during peak-load hours. Infact, it was profitable to
go on generating at a high level even when the consumer
demand had come down. In other words, the earlier tariff
mechanisms encouraged grid indiscipline. The Availability
Tariff directly addresses these issues. Firstly, by giving
incentives for enhancing output capability of power plants, it
enables more consumer load to be met during peak load
hours. Secondly, backing down during off-peak hours no
longer results in financial loss to generating stations, and the
earlier incentive for not backing down is neutralized. Thirdly,
the shares of beneficiaries in the Central generating stations
acquire a meaning, which was previously missing. The
beneficiaries now have well-defined entitlements, and are able
to draw power up to the specified limits at normal rates of the
respective power plants. In case of over-drawal, they have to
pay at a higher rate during peak load hours, which discourages
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

them from overdrawing further. This payment then goes to [7] Indian energy exchange website(www.iexindia.com)
beneficiaries who received less energy than was scheduled, [8] Published in Gazette of India the Electricity Act,2003.
and acts as an incentive/compensation for them.[4] India: Universal Law Publications Company Pvt .Ltd.

11. HOW DOES IT BENEFIT

The mechanism has dramatically streamlined the operation of
regional grids in India. Firstly, through the system and
procedure in place, constituents‘ schedules get determined as
per their shares in Central stations, and they clearly know the
implications of deviating from these schedules. Any
constituent which helps others by under drawal from the
regional grid in a deficit situation, gets compensated at a good
price for the quantum of energy under-drawn. Secondly, the
grid parameters, i.e., frequency and voltage, have improved,
and equipment damage correspondingly reduced. During peak
load hours, the frequency can be improved only by reducing
drawls, and necessary incentives are provided in the
mechanism for the same. High frequency situation on the
other hand, is being checked by encouraging reduction in
generation during off-peak hours. Thirdly, because of clear
separation between fixed and variable charges, generation
according to merit-order is encouraged and pithead stations do
not have to back down normally. The overall generation cost
accordingly comes down. Fourthly, a mechanism is
established for harnessing captive and co-generation and for
bilateral trading between the constituents. Lastly, Availability
Tariff, by rewarding plant availability, enables more
consumer load to be catered at any point of time.[4]

12. CONCLUSION
This paper gives the idea of trading in power market. . The
important key issues and challenges in this field are also
critically analyzed. Open access of Power is an important
reform in power sector but transparent mechanism must be
developed, so that it will able to mitigate the liability on
distribution utilities. Power quality and demand side
management issues under electricity trading are also a real
challenge in market. There is a strong need of power tariff
revision.

REFERENCES
[1] Prabodh Bajpai and S. N. Singh ―Electricity Trading In
Competitive Power Market: An Overview And Key
Issues‖, International Conference On Power Systems,
ICPS2004, Kathmandu, Nepal (P110).
[2] S.K.Soonee ―Realizing a Collective Vision Through
Non-Cooperation‖ ―Workshop on Electricity Market in
India and Learning from Developed Markets‖, India
Habitat Centre, Delhi, Mar 1st & 2nd 2005
[3] Mr. C.V.J. Verma President Council of Power Utilities
―Demand Side Management‖, The 11th Annual Asia
Power & Energy Congress31 March-4April 2008, Grand
Hyatt, Singapore
[4] Bhanu Bhushan ― ABC of ABT A Primer on
Availability Tariff‖
[5] Power Trading corporation of India limited,concept and
FAQs, (www.ptcindia.com)
[6] S.N Singh, ―Market power‖, A Short term course on
Electric Power System Operation and Management in
Restructured Environment ,IIT Kanpur, India, pp. A57-
A70.July 21-25,2003.

662
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Review Paper on Wireless Power Transmission
Methods
Ramandip Singh
A.P., Electrical Engg. Deptt
B.G.I.E.T Sangrur (Punjab)
ramansohi79@gmail.com
ABSTRACT
Wireless power transmission is one of the emerging fields of
engineering. The requirement of such technology is increasing as
the applications of mobile devices, because these devices
requires frequent recharging and wired connection limits its
immovability and adds unconvincing wiring. Since the wireless
power transmission combines many theories and explained by
many methods, this paper discusses the different methods used
for the wireless electricity and history of wireless transmission
system is discuss.
Keywords: Wireless power Transmission(W.P.T), Nikola tesla.
1. INTRODUCTION
wireless power transfer is a method of transferring the electric
energy from a power source to an electrical load without
synthetic conductor. Wireless transmission is useful in cases in
which connecting lines are inconvenient, dangerous or
impossible.The problem of wireless transmission of energy
different from the wireless telecommunication, such as a radio.
In the radio, the proportion of energy received becomes critical
when it is too low to distinguish the signal from background
noise. With wireless power efficiency is the more significant
parameter. A large part of the energy required by the production
unit arrive and the receiver or receivers at the system
economical.
The most common form of wireless power transmission is
carried out via direct induction followed by resonant magnetic
induction. Other methods are taking into account
electromagnetic radiation in the form of microwaves or laser [2]
and an electric wire with natural media. [3].
2. BASIC DESIGN OF WIRELESS
POWER SYSTEM
The Figure1depicts high speed rectifier realizing high transfer
efficiency relating to transmitter and receiver.
Figure 1. Wireless power system
663
ISBN: 978-81-924893-0-8
Er.Yadvinder Singh
Lect., Electrical Engg Deptt
Bhai Gurdas Polytechnic College, Sangrur
yadvinder87@gmail.com
William C. Brown, the pioneer in wireless power transmission
technology, has designed, developed a unit and demonstrated to
show how power can be transferred through free space by
microwaves. The concept of Wireless Power Transmission
System is explained with functional block diagram as shown in
figure 3. In the transmission side, the microwave power source
generates microwave power and the output power is controlled
by electronic control circuits. The wave guide ferrite circulator
which protects the microwave source from reflected power is
connected with the microwave power source through the Coax –
Waveguide Adaptor. The tuner matches the impedance between
the transmitting antenna and the microwave source. The
attenuated signals will be then separated based on the direction
of signal propagation by Directional Coupler. The transmitting
antenna radiates the power uniformly through free space to the
rectenna.
In the receiving side, a rectenna receives the transmitted power
and converts the microwave power into DC power. The
impedance matching circuit and filter is provided to setting the
output impedance of a signal source equal to the rectifying
circuit. The rectifying circuit consists of Schottky barrier diodes
converts the received microwave power into DC power. The
Primary components of Wireless Power Transmission are
Microwave Generator, Transmitting antenna and Receiving
antenna .
Figure 2 Flow and components of Wireless power System
The key for the present world is to save energy and related
recourses in the organizations and as well as at home. Energy
costs account for a huge portion of most companies operating
expenses, so monitoring, controlling and conserving a building's
lighting, heating and cooling, and other energy-hungry systems
can lead to substantial savings. Several energy management
vendors report that customers have shrunk their power bills by at
least 30 percent. Saving energy also means lowering your carbon
footprint, which could help reduce carbon taxes and promote a
green image, another plus for business. The figure 2 shows a
typical energy wireless light controller device.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3. METHOS OF TRANSMISSION
Some of the most common methods used for the wireless
transmission of electricity are
1. Electrostatic induction
2. Electromagnetic radiation
3. Microwave method
4. Laser method
5. Transformer coupling
6. Electrical conduction
3.1 ELECTROSTATIC INDUCTION
An electrostatic induction or capacitive coupling, the passage
of electric energy by a dielectric. In practice, an electric field
gradient or differential capacitance between two or more
insulated blocks, plates, electrodes, or nodes, which are
elevated above a conductive ground plane. The electric field is
generated by feeding the sheets with a high potential, high-
frequency AC power supply. The capacitance between two
terminals and a higher powered device form a voltage divider.
The electrical energy which is transmitted through electrostatic
induction is used by a receiving device such as a wireless air.
[10] [11] [12] Nikola Tesla demonstrated the illumination of
wireless lamps by energy that is coupled into them through an
alternating electric field.
3.2 ELECTROMAGNETIC RADIATION
Far-field techniques achieve longer ranges, often several
kilometers ranges, wherein the distance is substantially greater
than the diameter of the device (s). The main reason for greater
distances with radio waves and optical devices is the fact that
the electromagnetic radiation can be in the far field to be (with
high directivity antennas or well-collimated laser beam)
adapted the shape of the reception area, so it provides almost
radiated power at long range. The maximum directivity for
antennas is physically limited by diffraction.
3.3 MICROWAVE METHODS
Taken directional transmission using radio waves are so long
distance power transmission at shorter wavelengths of the
electromagnetic radiation, typically in the microwave range. A
rectenna is used to convert the microwave energy into
electricity. Rectenna efficiencies have been realized in excess
of 95%. Power beaming using microwaves has been for the
transfer of energy from solar power satellites orbiting the earth
and leave the beaming of power to spacecraft orbit has been
considered. [2] [6] proposed
664
ISBN: 978-81-924893-0-8
Power beaming by microwaves has the difficulty that for most
space applications the required aperture sizes are very large due
to the diffraction limited antenna directivity. For example, the
1978 NASA Study of solar energy requires satellite a 1-km
diameter transmitting antenna, and a 10-km diameter receiving
rectenna for a microwave beam at 2.45 GHz. [7] These sizes
can be reduced to something shorter wavelengths, although
short wavelengths may have difficulties with atmospheric
absorption and beam blockage by rain or water droplets.
Because of the "thinned array curse," it is not possible, a narrow
beam which make by combining the beams of several smaller
satellites.
For earthbound applications a large area 10 km diameter
receiving array allows large total power levels are used as
proposed in the low power density for human electromagnetic
exposure safety. A person certainly distributed power density of
1 mW/cm2 over a 10-km, (4.8 km) induced on the surface.
Electrical Conduction and the current flow through the upper
air layers starting at a barometric pressure of approximately 130
mm Hg is possible by the process of the atmospheric ionization
by creating capacitively coupled plasma discharge. A global
system for "the transmission of electrical energy without wires"
called the World Wireless System, dependent upon the high
electrical conductivity of the plasma and the high electrical
conductivity of the earth was proposed already in 1904.
In this way, illuminated electric lamps and electric motors can
be rotated at moderate distances. The transferred energy can be
found in greater distances.
3.4 LASER METHODS
When electromagnetic radiation in detail the visible spectrum
(10s microns (um) to 10s nm) capable of transmitting power
through the conversion of current into a laser beam, which is
then at a solar cell receiver [9] it This mechanism is usually
called "power beaming "because the power at a receiver,
convert it into usable electrical energy radiated can be known.
The laser "powerbeaming" technology has been studied
primarily in military weapons and space and applications will
be developed for commercial and consumer electronics Low-
Power applications. Wireless energy transfer system using laser
for consumer space has to satisfy Laser safety requirements.
3.5 TRANSFORMER COUPLING
Energy transfer between two coil through magnetic fields but in
this method, distance between two coils should be too close.
3.6 ELECTRICAL CONDUCTION
The Disturbed charge of ground and air method. The wireless
transmission of alternating current through the earth with an
equivalent electrical displacement obtained by the air above
long areas that are higher than the resonant electrical induction
methods and low compared with the electromagnetic radiation
methods. Electrical energy can be transmitted through
inhomogeneous earth with low loss because the net resistance
between earth antipodes is less than 1 ohm. [3], the electrical
adjustment takes place predominantly by electrical conduction
through the oceans, and metallic ore bodies and similar
subsurface structures.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The electric displacement by electrostatic induction through the
more dielectric regions such as quartz deposits and other non-
conductive minerals. Recipients are attracted by currents
through the earth while an equivalent electric displacement is
carried out in the atmosphere.
This energy transfer process is suitable for the transmission of
electric energy in industrial quantities and also for wireless
broadband telecommunications. The Wardenclyffe Tower
project was an early commercial venture for trans-Atlantic
wireless telephony and proof-of-concept demonstrations of
global wireless power transmission using this method. The
plant was not completed due to insufficient funding.
Terrestrial transmission line with atmospheric return Single
wire with Earth return electrical power transmission device
systems rely on electricity, which is insulated by the earth and a
single line from the earth to complete the circuit. In
emergencies high-voltage direct current power transmission
systems can also operate in the 'single wire with earth return'
mode. Removal of the increased insulated wire, and the
transmission of alternating high potential through the earth with
an atmospheric return line is the base of this method for the
wireless transmission of electrical energy.
The method depends on the atmospheric line passage of electric
current through the earth and through the upper troposphere and
the stratosphere. This flow is caused by electrostatic induction
up to a height of about 3 miles
4. HISTORY OF WIRELESS POWER
TRANSMISSION
Nikola Tesla he is who invented radio and is referred to as
“Father of Wireless”. Nikola Tesla is the one who first
conceived the idea Wireless Power Transmission and
demonstrated “the transmission of electrical energy without
wires" that depends upon electrical conductivity as early as
1891[2].
In 1893, Tesla demonstrated the illumination of vacuum bulbs
without using wires for power transmission at the World
Columbian Exposition in Chicago. 
The Wardenclyffe tower shown in Figure 1. was designed and
constructed by Tesla mainly for wireless transmission of
electrical power rather than telegraphy [3]. 
Fig.3. Warden clyffe Tower, including
the partially-complete cupola
665
ISBN: 978-81-924893-0-8
 The world’s first fuel free airplane powered by microwave
energy from ground was reported in 1987 at Canada. This
system is called SHARP (Stationary High – Altitude Relay
Platform) [5]. 

 A physics research group, led by Prof. Marin Soljacic, at the
Massachusetts Institute of technology (MIT) demonstrated
wireless powering of a 60W light bulb with 40% efficiency
at a 2m (7ft) distance using two 60cm-diameter coils in 2007
[7]. 

 In 2008, Intel reproduced the MIT group's experiment by
wirelessly powering a light bulb with 75% efficiency at a
shorter distance. 

 MIT team experimentally demonstrates wireless power
transfer, potentially useful for powering laptops, cell phones
without any cords. 

 Imagine a future in which wireless power transfer is feasible:
cell phones, household robots, mp3 players, laptop
computers and other portable electronics capable of charging
themselves without ever being plugged in, freeing us from
that final, ubiquitous power wire. Some of these devices
might not even need their bulky batteries to operate. 

5. CONCLUSION
This paper presented a short review of the techniques used for
the wireless transmission of power and each has their own
advantages and disadvantages. Hence the selection of the
technology is depends upon the number of parameters such
required power, distance, medium, application, complexity and
cost.
REFERENCES
[1] A radio transmitter can produce waves having a power
of several kilowatts or even megawatts but this energy
scatters in all directions. Only a small fraction, less than
a millionth part, of the transmitted energy is received.
However, this is sufficient to yield the intelligence.
[2] G. A. Landis, "Applications for Space Power by Laser
Transmission," SPIE Optics, Electro-optics & Laser
Conference, Los Angeles CA, 24–28 January 1994;
Laser Power Beaming, SPIE Proceedings Vol. 2121,
252–255.
[3] Corum, K. L. and J. F. Corum, "Nikola Tesla and the
Diameter of the Earth: A Discussion of One of the
Many Modes of Operation of the Wardenclyffe Tower,"
1996
[4] Dave Barman and Joshua Schwanecke (2009-
12-00). "Understanding Wireless Power”.
[5] Steinmetz, Charles Proteus(29 August
2008). Steinmetz, Dr. Charles Proteus, Elementary
Lectures on Electric Discharges, Waves, and
Impulses, and Other Transients, 2nd Edition,
McGraw-Hill Book Company, Inc., 1914. Google
Books. Retrieved 4 June 2009.
[6] "Wireless charging, Adaptor die, Mar 5th
2009". The Economist. 7 November 2008.
Retrieved 4 June 2009.
[7] Buley, Taylor (9 January 2009). "Wireless technologies
are starting to power devices, 01.09.09, 06:25 pm EST".
Forbes. Retrieved 4 June 2009.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[8] "Alternative Energy, From the unsustainable...to the

unlimited". EETimes.com. 21 June 2010.
[9] Teck Chuan Beh, Takehiro Imura, Masaki Kato, Yoichi
Hori “Basic Study of Improving Efficiency of Wireless
Power Transfer via Magnetic Resonance Coupling
Based on Impedancem Matching”, Industrial
Electronics (ISIE), 2010 IEEE
[10] Teck Chuan Beh, Masaki Kato, Takehiro Imura, Yoichi
Hori “Wireless Power Transfer System via Magnetic
Resonant Coupling at Restricted Frequency Range”,
http://mizugaki.iis.uokyo.ac.jp/paper_2010/papers/
beh/D_bumon2010Beh.pdf
[11] Teck Chuan Beh, Masaki Kato, Takehiro Imura, Yoichi
Hori “Wireless Power Transfer System via Magnetic
Resonant Coupling at Fixed Resonance Frequency
Power Transfer System Based on Impedance
Matching”, EVS-25 Shenzhen, China, Nov. 5-9, 2010
[12] Takehiro Imura, Yoichi Hori “Maximizing Air Gap
and Efficiency of Magnetic Resonant Coupling for
Wireless Power Transfer Using Equivalent Circuit
and Neumann Formula”, Industrial Electronics, IEEE
Transactions Oct. 2011.

666
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Assessment of Bio-energy Potential for Distributed
Power Generation from Crop Residue in Indian State
Punjab
Ram Singh
Asstt. Professor, Deptt. Of Electrical Engg.
BHSBIET Lehragaga (Sangrur)
singhsran08@gmail.com
ABSTRACT
In India, renewable energy sources are now developing at fast
speed. Especially energy generation using Biomass resources
is one of the area in which Researchers & Governments are
concentrating. Agricultural residue/waste is the main source
of Biomass energy. A large amount of crop residue biomass is
generated in India. The amount of residue varies
geographically. As the Punjab state is the agricultural rich
state of India, so the information collected in this study is
about assessment of the Biomass potential in Punjab for
power generation using local Biomass Power Plant to meet
the demand & supply requirements. A sample study has been
presented in this paper. By using the concept of power
generation at local (distributed) level, the economic & social
status of the society will be raised as this will create the
employability to the local people.
Keywords: Distributed Generation, Bio-mass Power
Generation, Cluster of Villages, Crop Residue
1. INTRODUCTION
Distributed generation (DG) is generally regarded as small
generators, both in terms of power output and physical size,
connected to the existing power distribution grid. The
difference between distributed generation and power plants
operating in the modern transmission system is at least partly
semantic. Although both types of generators operate in an
interconnected system, power plants on transmission systems
are generally located far from the loads they serve and are
operated by utilities, whereas distributed generators are
typically located on-site close to the loads they serve and could
be operated independently by a customer or independent
power producer instead of a utility company. Customers are,
however, limited in the amount of control they can exert on
their own generators. However, the technology offers several
benefits to both consumers and producers of electrical power
and has resulted in increased research and usage of DG
technologies.
Distributed Generation
Distributed Generation is also known as on-site generation,
dispersed generation, embedded generation, decentralized
generation, decentralized energy or distributed energy,
generates electricity from many small energy sources. It is
fairly a new concept in the economics literature about
electricity markets, but the idea behind it is not new at all.
Generally, the term Dispersed or Distributed Generation refers
to any electric power production technology that is integrated
within distribution systems. Distributed generators are
connected to the medium or low voltage grid. They are not
667
ISBN: 978-81-924893-0-8
centrally planned and they are typically smaller than 30 MW.
The exact definition of distributed generation (DG) varies
somewhat between sources and capacities; however, it is
generally and summarily defined as any source of electric
power of limited capacity, directly connected to the power
system distribution network where it is consumed by the end
users.
2. AGRI-RESIDUE POTENTIAL IN PUNJAB
Punjab along with the neighboring state Haryana is referred as
the "Grain Bowl of India". Agriculture is the major economic
activity of the state, sustaining nearly 70-80% of the total
population. Of the total geographical area, 84% is under agri-
culture use, 0.18% area is under cultivable wasteland and
8.94% area is not available for cultivation within the state.
The cropping intensity in the state is averaged at 188%, which
is considered as one of the highest within the country. This is
due to the significant availability of ground water for
irrigation purpose in the state. It has been estimated that
around 55-60% of the net sown area is irrigated in the state.
With only 1.6% of geographical area of the country, Punjab
produces approximately, 22% of wheat, 10% of rice and 13%
of cotton of the total production of these crops in the country.
The total food grain production in Punjab has increased
significantly over the last few decades, especially in the post
Green Revolution period. In 1970-1971, production of food
grains was 7.305 Mt, which increased to 32.818 Mt in 2010-
2011 registering a fivefold increase. Wheat and rice played a
major role in pushing up agricultural production. The
production of rice, which was 6.506 Mt in 1990-1991,
increased to 12.486 Mt in 2010-2011 showing an increase of
91%. Similarly, production of wheat was 12.159 Mt in 1990-
1991 rose to 18.220 Mt in 2010-2011 registering an increase
of 49%. [3] [4]
There are two major agricultural seasons in the state "Rabi"
(winter crop) and "Kharif" (summer crop). The major crops
grown during the Rabi season are Wheat, Arhar,
Mustard(Sarson), Sunflower, Cotton, Dry chillies &
Sesamum while during Kharif season Paddy, Bajra, Jowar,
Maize, Moong, Ground nut and Sugarcane are important
crops. Apart from these crops, there are various other crops
such as barseem, vegetables, potatoes, tomatoes, green
manure, etc., which are categorized as 'Insignificant Crops'.
Here, it is important to mention that in the present work I have
considered only major and minor crops. A crop is considered
major if its crop area fraction was 10% or above of the total
cultivated area. A crop is considered minor if it was not
covered under the major crop and had either crop area fraction
of 2.5% or above. Crops that do not qualify either as major or
minor was considered 'Insignificant crop'. Data for the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

insignificant crops is not calculated in the present work due to
miniscule contribution by such crops in the total biomass
production. The total biological residue generation was
expressed in Quintals per season at 10% moisture content and
CRR (Crop to Residue Generation Ratio) measured in terms
of their weight and averaged. The residues generated from the
major crops consists of wheat straw, mustard stalk, cotton
stalk, paddy straw and husk, Maize husk and cob, and sugar-
cane leaves and trash. [2]
3. TYPES OF AGRI-RESIDUE
Electrical power can be generated from agri-residue by
setting up agri-residue based small power plants in rural areas;
one such plant can satisfy the power needs of a cluster of
villages. The agri-residues like rice straw, rice-husk, soya
bean stalks, mustard stalks, mustard husk, wheat straw cotton
stalks, cotton kernals, maize stalks, maize cobs, sunflower
stalks, grass, sugarcane trash, bagasse can be fruit fully
utilized in power generation. The different types of available
agri-residue are shown in figure 1.
the help of required synchronization / other equipments and
fed to the Grid of M/s Punjab State Power Corporation
Limited at Mansa grid substation which is approx. 10 Km
from the Power Plant location.
Various types of agri-residue are used in the plant which is
given below:
1. Cotton Stalks
2. Mustard Husk
3. Maize Stalks & Cob
4. Peddy Straw
5. Rice Husk
6. Sugarcane Tops & Leaves
5. AGRI-RESIDUE BASED ELECTRIC
POWER POTENTIAL AND CLUSTER
OF VILLAGES
The State of Punjab, known all over the world as rich
agricultural state, contributes heavily to national grain stalks.
The agriculture can also show way for power generations.
Agri- residue, waste material left after separating grains from
crop, can be used to generate electricity. In this study, an
effort has been made to explore the feasible electric power
potential of available agri- residue in a cluster of villages in
district Sangrur, Tehsil Lehra of Punjab State. An agricultural
survey was carried out to cover both Rabi and Kharif seasons
(2013-2014).

5.1. Profile of Cluster

• Cluster of villages: Raidharana, Jhaloor, Bhutal Kalan,
Kartarpura alias Changaliwala, Gaga,Ramgarh
Sandhuan, Khandebad, Lehal Kalan A, Lehal Kalan B,
Lehal Khurd

Table 1: Profile of Cluster

Figure 1 District & Tehsil Sangrur, Lehra
Number of Villages 10
4. INTRODUCTION OF BIOMASS Nearest Towns Lehragaga, Sunam
BASED POWER PLANT BY VIATON Nearest Railway Lehragaga, 05Km away
ENERGY PVT LTD.
Nearest
Station Airport Chandigarh,180Km away
In year 2013 the VIATON ENERGY PVT LTD has
launched a 10 MW Biomass based power plant in Khokhar Main Crops Rabi-Wheat,Barseem, Sarson
Khurd, District Mansa in state Punjab. The plant has started Khariff-Paddy, Cotton,
generating power from the year 2014. Maize.Sugarcane

The plant has done remarkable work and adopted couple of

schemes to support energy conservation. The plant consists of
nominal capacity Fluidized Bed Boiler with super heater
outlet parameter. This boiler produces steam by burning the
various Bio-mass fuels available and the steam thus produced
runs a 10 MW Turbo Alternator of both extractions cum
condensing type, which produces Power at 11 KV. The
Turbo-generator is a multistage, impulse type, extraction
condensing, having single reduction parallel shaft gearbox.
The alternator is operating on 11 KV, A.C, 3-phase, 50 Hz
and having a power factor of 0.8 (lagging).
The 11 KV power generated is stepped up to 66 KV with the
help of step up transformer as per PSPCL guidelines and with
5.2. Assessment of Agri-Residue in the
Cluster of Villages
Data pertaining to different locally available crops was
collected from local circle Patwaris (official of land and
revenue department) of said clusters. By using grain
production per acre and residue to production ratio (R.P.R)
total agri-residue per village and then total agri-residue of
whole cluster was calculated. Table 2 shows the different

668
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

types of local crops, there agri-residue components, residue

production ratio, grain production and agri-residue
production. 5.3 CALCULATIONS FOR AGRI-
Table 2
RESIDUE BASESD POWER PLANTS
Calculation work is carried out for 10 MW capacity agri-
Sr. Crop Agri- Residue Grain Agri-
No. Residue Production Production Residue residue based (Steam- Boiler System) power plant by taking
Component Ratio (Quintal product annual load factor of 0.88. Fuel requirement per year for 7.5
/acre)* ion MW steam boiler plant was calculated to be 83950±10%
(RPR)* (Quintal MT*. Total agri-residue production per year in said cluster is
/acre) 1,20,1548 MT**. By using approximately 78% of this agri-
1. Cotton Stalks 4.2 12 50.4 residue, fuel demand of 10 MW steam - boiler plant can be
satisfied. Fuel used for this system is mainly Cotton sticks,
2. Paddy Straw 1.86 32 59.52 paddy straw & rice husk. The cluster of 10 villages gives
3. Paddy Husk - - 9 cotton stalks equal to 1315.44 MT, paddy straw equal to
95910.53 MT & rice husk equal to 1450.26 MT. Total agri-
4. Wheat Straw 1.75 29 50.75
residue fuel came out to be 98676.23 MT** (only cotton
5. Maize Stalks Cob 2.27 18 40.86 stalks, paddy straw & rice husk). By using approximately
94% of total agri-residue of cotton stalks, paddy straw & rice
6. Sugarc Tops Leaves 0.3 400 75**
husk per year in said cluster fuel demand of 10 MW Biomass
7. Sarson
ane Straw 2.7 20 54 plant can be satisfied. Hence agri-residue of cluster of 10
8. Barsee - - - - villages can sufficiently meet the fuel requirements of 10 MW
plant.
* LocalmSurvey & Rich Experience of Farmers
6. RESULTS AND DISCUSSIONS
** Approximated to 75 due to high moisture content
Paddy, wheat, maize and cotton are the major agri-residue The Study was initiated with the aim of investigating the agri-
contributors. Total agri- residue in cluster was calculated to be residue based electric power potential in clusters of villages,
120154.8 tonnes for the year 2012 (Rabi and Kharif). Table-3 exploring the possibility of utilizing Biomass for Electrical
total agri-residue production crop and village wise is power generation in Punjab state.
presented. Paddy, wheat, maize and cotton are the major agri- For investigating the agri-residue based electric power
residue contributors. Total agri- residue in cluster was potential in cluster of villages total agri-residue (Rabi &
calculated to be 1201548 tonnes for the year 2013 (Rabi and Kharif) in year 2013-14 was estimated which came to be
Kharif). 1,20,1548 MT covering all major local crops. Calculation
Table 3 work was carried out for 10 MW power plant. Requirement of
fuel for 10 MW power plant came out to be 83950±10% MT.
By using 78% of the total village cluster agri-residue, the fuel
TOTAL AGRI- demand of 10 MW (Boiler System) can be satisfied for Power
Sr. Crop Agri-residue RESIDUE- CROP
No Component generation from 10 MW plant is sufficient to meet the
WISE (QUINTALS) requirement of more than 20 villages approximately. The
(FROM CLUSTER benefits from agri- residue based power plants are multiple in
OF 10 VILLAGES) terms of development, employment generation and
Cotton Stalks environmental aspects.
1. 13154.40
7. CONCLUSION
2. Paddy Straw 959105.30
 For small power plants, biomass offers the most
3. Paddy Husk 145026.00 attractive alternative energy system than steam power
plants.
4. Wheat Straw 40834.00  A cluster of 10 villages can fulfill the fuel requirements
of 10 MW agri-residue based electric power plant, which
can serve the power needs of more than 20 villages
5. Maize Stalk & Cobs 8826.30
approximately.
 The annual financial benefit to the village Cluster from
6. Sugar Top & leaves the sale of agri-residue is approximately 1.7 times than
cane 23100.00 the amount of annual electrical energy consumed by the
village cluster.
7. Sarson Straw 11502.00  Employability will be created for the youth of the rural &
remote areas of the state.
TOTAL 1201548.00  It helps & encourages Distributed Power Generation in
de-centralized energy market of today.

669
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES [4]. Chauhan Suresh (2010) Biomass resources assessment

for power generation: A case study from Haryana state,
[1]. Abbasi Tasneem, Abbasi S.A. (2010) India Original Research Article Biomass and Bioenergy,
“Biomass energy and the environmental impacts Volume 34, Issue 9, Pages 1300-1308 elsevier
associated with its production and utilization” Review
Article Renewable and [5]. Rai, G.D. (2004), “Non- Conventional Energy Sources
Sustainable Energy Reviews, Volume 14, Issue 3, Pages ", Khanna Publishers, Delhi.
919-937 elsevier
[6]. Tehsil office, Lehragaga ( Sangrur), Punjab
[2]. Baruah, D.C. and Jain, A.K.(1998), "Distribution
of Agricultural Crop Residues in India", Journal of [7]. Viaton Energy Pvt. Ltd. (www.viaton.in)
Agriculture Engineering 35(1), pp. 7-12 .
[8]. www.wikipedia.com/Biomass power from crop residue.
[3]. Chauhan Suresh(2012), “District wise agriculture
biomass resource assessment for power generation: A
case study from an Indian state, Punjab”, Original
Research Article Biomass and Bioenergy, Volume 37,
February 2012, Pages 205-212 elsevier

670
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Potential of Microbial Biomass for Heavy Metal Removal:
A Review
Garima Mahajan
Department of Electrical Engineering
Bhai Gurdas Institute of Engineering
& Technology, Sangrur
garima8mahajan@hotmail.com
ABSTRACT
Present review paper deals with extensive literature survey in
exploring the potential of microbial biomass for the
sequestering of toxic heavy metals from aquatic streams.
Presently more than half billion people are underprivileged
and deprived of fresh water, clean air, soil and pure food.
Contamination of aquatic streams due to release of toxic metal
ions is a stern issue demanding global concern. Toxic metals
such as Cr (VI), Cd (II), Pb (II), Zn (II), Ni (II) and many
more are being released in natural aquatic systems by various
small and large scale industries such as tanneries,
electroplating, galvanizing, pigment and dyes, metallurgical,
paint, refining and metal processing etc. The utilization of
various microorganisms such as yeast, algae and fungi helps
in binding and extracting heavy metal ions such as Nickel,
Cadmium, Lead and Chromium from natural as well as
simulated wastewaters.
Keywords
Biosorption, Heavy metals, Microorganisms, Kinetic Studies
1. INTRODUCTION
Metals have played a critical role in industrial development
and technological advances of modern society. Most metals
are not destroyed; indeed, they are accumulating at an
accelerated pace, due to the ever-growing industrialization.
The major toxic metal ions hazardous to humans as well as
other forms of life are Cr, Fe, Se, V, Cu, Co, Ni, Cd, Hg, As,
Pb, Zn, etc. These heavy metals are of specific concern due to
their toxicity, bio- accumulation tendency and persistency in
nature [1,2,3]. In the past several disasters became natural
evidences of metal toxicity in aquatic streams such as
Minimata tragedy due to Methyl Mercury contamination and
“Itai-Itai” by the contamination of Cadmium in Jintsu river of
Japan [1,4]
Mounting health problems and its concern have motivated the
researchers and environmentalists to find the solutions that
would be helpful in the sequestering of these toxic metals
from aquatic streams. The real impetus for improvements
came in the 1950s and 1960s as a result of modification of the
legislation and setting up of independent pollution prevention
authorities at global level. Conventional methodologies like
chemical precipitation, ion exchangers, chemical
oxidation/reduction, reverse osmosis, electro dialysis, ultra
filtration, etc. [5,6,7] were applied for the sequestering of
heavy metals from aquatic streams. However, these
conventional techniques have their own inherent limitations
such as less efficiency, sensitive operating conditions, and
production of secondary sludge and further the disposal are a
671
ISBN: 978-81-924893-0-8
Dhiraj Sud
Department of Chemistry
Sant Longowal Institute of
Engineering and Technology,
Longowal[Punjab]
suddhiraj@yahoo.com
costly affair [8]. Due to the problems mentioned above,
research was intensified to look for alternative options to
replace the costly and conventional methods. In last few
decades attention has been diverted towards the utilization of
microbial materials which can be suitable candidates for metal
binding. The literature survey reveals the various options that
have been explored by researchers in the removal process of
heavy metals.
2. MICROBIAL BIOMASS FOR HEAVY
METAL REMOVAL
High metal sorbing substrates such as bacterial, fungal and
algal biomasses were explored in dead / inactive or in live
form to remove heavy metals. Considerable potential was
proved by various researchers for these naturally occurring
and abundantly available small creatures. [9,10,11] Many
bacterial species (e.g. Bacillus, Pseudomonas, Streptomyces,
Escherichia, Micrococcus etc.), were tested for metal uptake.
Algae was considered very promising sorbing agents
[12,13,14] because of their prominent sorption capability and
were readily available copiously in seas and oceans [15,16].
[17] Investigated the removal of Ni from solutions by
Pseudomonas alcaliphila. It was inferred that the addition of
an excess amount of citrate encouraged the complex
degradation as well as Ni removal. [18] Evaluated the
biosorption studies of Cr (VI) on dried vegetative cell and
spore–crystal mixture of Bacillus
thuringiensis var. Thuringiensis using the batch method as a
function of pH, initial metal ion concentration and
temperature. The optimum pH observed for Chromium (VI)
ions was 2.0. Chromium (VI) ions uptake of B. Thuringiensis
spore–crystal mixture was 24.1%, whereas its vegetative cell
metal uptake was found 18.0%. [19] Studied that blue green
algae Spiruline sp. was found capable of adsorbing one or
more heavy metals including K, Mg, Ca, Fe, Sr, Co, Cu, Mn,
Ni, V, Zn, As, Cd, Mo, Pb, Se, Al in addition to the
biosorption of Cr3+, Cd2+ and Cu2+ ions. [20] Reported that the
biomass of Enterobacter sp. J1 isolated from a local industrial
wastewater treatment plant was found very effective for the
sequestering of Pb, Cu and Cd ions. The sp. was able to
uptake over 50 mg of Pb per gram of dry cell, while having
equilibrium adsorption capacities of 32.5 and 46.2 mg/g dry
cell for Cu and Cd, respectively.
[21] Isolated heavy metal resistant bacteria from the soil
samples of an electroplating industry, and the
bioaccumulations of Cr (VI) and Ni (II) by isolates were also
investigated. The optimum pH 7 indicated the applicability of
the isolated Micrococcus sp. for the removal of Cr (VI) and Ni
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
(II). [22] explored the use of powdered biomass of R.
nigricans at optimum pH 2, stirring speed of 120 rpm,
temperature of 450C and contact time of 30 minutes and
results indicated the high adsorption at low initial
concentrations. [23] Synthesized diethylenetriamine-bacterial
cellulose (EABC) by amination with diethylenetriamine on
bacterial cellulose (BC) for the adsorption properties of Cu
(II) and Pb (II) and optimization studies were also carried out.
Pseudo-second-order rate model was well fitted and
adsorption isotherm was described by the Langmuir model.
The ability of biofilm of Escherichia coli supported on kaolin
to remove Cr (VI), Cd (II), Fe (III) and Ni (II) from aqueous
solutions was investigated in batch assays for the treatment of
diluted aqueous solutions by [24]. The biosorption
performance, in terms of uptake, followed the sequence of Fe
(III) > Cd (II) > Ni (II) > Cr (VI). Recent reports [23] studied
heavy metal bioremediation by a multi-metal resistant
endophytic bacteria L14 (EB L14) isolated from the Cadmium
hyper accumulator Solanum nigrum L. and was characterized
for its potential application in metal treatment. Within 24 h
incubation, EB L14 could specifically uptake 75.78%,
80.48%, 21.25% of Cd (II), Pb (II) and Cu (II) under the
initial concentration of 10 mg/L. Similarly biosorption
studies of heavy metals by whole mycelia of A. niger, R.
orysae and Mucar rouxi for the removal of Cd, Ni and Zn.
The efficiency was found to be enhanced by treating the cell
wall fractions with 4 M NaOH at 120oC.
3. CONCLUSION
In the light of above discussion it can be concluded that
microbial biomass has a great potential for sequestering heavy
metal ions from aquatic streams under optimized experimental
conditions. Literature studies further explores the platform for
the studies which may substitute chemical intensive
conventional methods and directs towards greener
technologies for environmental remediation.
REFERENCES
[1] Friberg, L. and Elinder, C. G. 1985. Encyclopedia of
occupational Health, Third edition, International Labor
Organization, Geneva
[2] Garg U. K, Kaur M. P, Garg V. K, Sud, D. 2007. Removal
of hexavalent Cr from aqueous solutions by agricultural waste
biomass. J. Hazard. Mater. 140: 60-68
[3] Randall, J. M., Hautala, E., Waiss, A. C. Jr. 1974.
Removal and recycling of heavy metal ions from mining and
industrial waste streams with agricultutral by-products.
Proceedings of the Fourth Mineral Waste Utilization
Symposium, Chicago.
[4] Kjellstrom T, Shiroishi K, Erwin, P. E. 1977. Urinary beta/
sub 2/ microglobulin excretion among people exposed to
cadmium in the general environment. Environ. Res. 13: 318-
344
[5] Gardea-Torresdey J. L, Gonzalez J. H, Tiemann K. J,
Rodriguez O, Gamez, G. 1998. Phytofilteration of hazardous
cadmium, chromium, lead, and zinc ions by biomass of
medicago sativa (alfalfa). J. Hazard. Mater. 57: 29-39
[6] Patterson, J.W. 1985. Industrial wastewater treatment
technology, second ed. Butterorth Publisher, Stoneham, MA.
[7] Zhang L, Zhao L, Yu Y, Chen, C. 1998. Removal of lead
from aqueous solution by non-living Rhizopus nigricans.
Water Res. 32: 1437-1444
[8] Ahluwalia, S. S. and Goyal, D. 2005. Microbial and plant
derived biomass for removal of heavy metals from waste
water. Bioresour. Technol. 98: 2243-2257
672
ISBN: 978-81-924893-0-8
[9] Volesky, B. and Holan, Z. R. 1995. Biosorption of heavy
metals. Biotechnol. Progress. 11: 235-250
[10] Gadd, G. M. and Rome, L. de. 1988. Biosorption of
copper by fungal melanin. Appi. Microbial. Biotechnol.
29:610-617
[11] Paknikar K. M, Paluitkar U. S, Puranik, P. R. 1993.
Biosorption of metals from solution by mycelial waste of
Penicillium chrysogenum. In: Torma, A.E., Apel,
M.L.,Brierley, C.L. (Eds.), Biohydrometallurgical
Technologies, The Minerals, Metals and Materials Society,
Warrendale,
[12] Vieira, R. H. S. F. and Volesky, B. 2000. Biosorption: a
solution to pollution. Int. Microbiol. 3: 17-24
[13] De, Rome L. and Gadd, G. M. 1987. Copper adsorption
by to Rhizopus arrhizus, Cladosporium resinae and
Penicillium italicum. Appl. Microbiol. Biotechnol. 26: 84-90
[14] Luef E, Prey T, Kubicek, C. P. 1991. Biosorption of Zinc
by fungal mycelial wastes. Appl. Microbiol. Biotechnol. 34:
688-692
[15] Brady, D. and Duncan, J. R. 1993. Bioaccumulation of
metal cations by Saccharomyces cerevisiae. In
Biohydrometallurgical Technologies; Torma, A. E., Apel, M.
L., Brierley, C. L., Eds.; The Minerals, Metals & Materials
Society: Warrendale, PA, Vol. 2, p 711-724
[16] Puranik, P. R. and Paknikar, K. M. 1997. Biosorption of
Lead and Zinc from Solutions using Streptoverticillium
cinnamoneumWaste Biomass. J. Biotechnol. 55: 113-124
[17] Qian J, Li D, Zhan G, Zhang L, Su W, Gao, P. 2012.
Simultaneous degradation of Ni-citrate complexes and
removal of nickel from solutions by Pseudomonas alcaliphila.
Bioresour. Technol. 116: 66-73
[18] Sahin I , Keskin S. Y , Keskin, C. S. 2013. Biosorption
of cadmium, manganese, nickel, lead, and zinc ions
by Aspergillus tamari. Desalination and Water
Treatment.1–6
[19] Chojnacka K, Chojnacki A, Górecka, H. 2005.
Biosorption of Cr3+, Cd2+ and Cu2+ ions by blue-green algae
Spirulina sp.: kinetics, equilibrium and the mechanism of the
process. Chemosphere 59: 75–84
[20] Lu W. B, Shi J. J, Wang C. H, Chang, J. S. 2006.
Biosorption of lead, copper and cadmium by an indigenous
isolate Enterobacter sp. J1 possessing high heavy-metal
resistance. Journal of Hazardous Materials. 134: 80-86
[21] Congeevaram S, Dhanarani S, Park J, Dexilin M,
Thamaraiselvi, K. 2007. Biosorption of chromium and nickel
by heavy metal resistant fungal and bacterial isolates. J.
Hazard. Mater. 146: 270-277
[22] Bai, R. S. and Abraham, T. E. 2001. “Biosorption of Cr
(VI) from aqueous solution by Rhizopus nigricans”.
Bioresource Technology. 79: 73–81
[23] Guo H, Luoa S, Chena L, Xiaoa X, Xi Q, Wei W, Zeng
G, Liu C, Wan Y, Chen J, He, Yejuan. 2010. Bioremediation
of heavy metals by growing hyperaccumulaor endophytic
bacterium Bacillus sp. L14. Bioresource Technology. 101:
8599–8605
[24] Sen M, and Dastidar Ghosh, M. 2011. Biosorption of Cr
(VI) by resting cells of Fusarium Solani Iran. J. Environ.
Health. Sci. Eng. 8: 153-158
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Efficiency comparison of New and Rewound Induction

Motors used in Rice Mill

Ramanpreet Singh Jasvir Singh

Research Scholar, E.E Deptt. Assistant Professor, E.E. Deptt
Bhai Gurdas Inst. of Engg & Tech. Bhai Gurdas Inst.of Engg & Tech.
Sangrur (Punjab) Sangrur (Punjab)

ABSTRACT
Table-1 Parameters and Measuring Instruments used
To reduce energy consumption in any industry, it is necessary
to determine the efficiency of rewound induction motor and Parameters Measuring Instruments
compare it with the rated efficiency of that motor. If the
efficiency of rewound induction motor is found near to the Voltage Power Analyzer
rated efficiency of that motor, then there is no need for any Current Clamp On Transducer
change. If the efficiency of rewound induction motor is found
low as compared to rated efficiency of that motor, then it is Input Power Power Analyzer
better to replace that motor with new one. This paper explains
the analysis done on rewound induction motors to determine Speed Tachometer
the efficiency and comparison is done with new one. Winding Temp. Resistance Temperature Detector
Keywords Winding Resistance Power Analyzer
Rewound induction motors, Rice mill, efficiency, energy
losses, payback period

1. INTRODUCTION Fig.1 is showing the procedure for analyzing the motor

behaviour
We ask that authors follow some simple guidelines. In
essence, we ask you to make your paper look exactly like this
document. The easiest way to do this is simply to download
Description of machines
the template, and replace the content with your own material.
The major source of energy consumption in an industry is
electrical motors. About 70% of energy is consumed by Information about machines
induction motors in a Rice mill. It is a common practice in any
industry to rewind the induction motors in case of any fault.
This decreases the efficiency of a motor and increases the
energy losses and hence the energy consumption in any Survey of machines for energy measures
industry. Thus, it is better to replace the rewound induction
motors with the new ones.
Methods for energy conservation
2. PROBLEM DEFINITION
In the Rice mill, the rewound induction motors of different Fig-1 Process Flow Chart for Analyzing the Motor
horsepower are to be studied for different types of losses so as
to determine the overall efficiency of the induction motors. 4. RESULTS AND DISCUSSIONS
Then, these efficiencies are compared with the efficiencies of
The energy can be saved by means of replacing the rewound
new induction motors. After that, it has been found that it is
induction motors with the new ones so as to increase the
better to replace the rewound induction motors with the new
efficiency of the motor. Rated parameters of one of the
ones as the payback period is found to be existing in the range induction motors are shown in table 2.
of 1.5 years to as less as 7 months.
Table- 2 Rated Parameters
3. METHOD
No. of Phases 03
After visiting in the rice mill so many times, several rewound
induction motors are identified. After that, it is being No. of Poles 04
examined that how the machines are working. Then all the
parameters (rated, measured and calculated) of the motors are Rated Power(HP) 7.5
recorded through different measuring instruments. These
parameters are then used for determining the efficiency of the
induction motors. The equipments used for the measurements Rated Voltage, (Vrated) 415
of induction motor parameters are described in table 1.
Rated Current, (Irated) 12

Full Load Rated Speed, (Nrated) 1440

Supply frequency, f (Hz) 50

673
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Measured parameters of one of the induction motors are

shown in table 3. No-load slip, Sno-load (%) = Ns  N l*100 = 1.33
Ns
Table- 3 Measured Parameters

No-load voltage (V) 415

Ns  N fl
Full-load slip, Sfull-load (%) = *100 = 1.67
No-load current(A)
Ns
8.5

No-load input Power(W) 524

Full-load rotor losses, Protor = (S×P2) = 196.60 W
Stray losses= 1.5% of full-load input power =187.5W
Winding Temp. of still motor, T1(°C) 12
Full load output power = Pfull-load – Pstator – Piron – Pstray –
Resistance at room temp., R1( 0.52 Protor = 11585.51
Efficiency at full-load, , full-load = (Poutput/Pfull-load) ×
Winding Temp. of no load motor, T2(°C) 38 100= 92.68%
Rated Efficiency= 93.25%
Winding Temp. Of loaded motor , T3(°C) 138
Analysis done on few rewound motors according to the
Supply frequency, f (Hz) 50 formulae described above is shown below in the form of
graphs:

Full load voltage, Vfull-load(V) 415 COMPARSION BETWEEN ACTUAL

EFFICIENCY AND RATED EFFICIENCY
Full load current, Ifull-load(A) 20.5
MOTOR EFFICIENCY (η℅)
94
Full-load input Power, Pfull-load(W) 12500 92
No-load Speed, N1(RPM) 1480 90 Actual eff.
88 Rated eff.
Full-load Speed, N2(RPM) 1475
86
84
NM RM 1 RM 2 RM3 RM4 RM5
5. CALCULATED PARAMETERS TYPES OFMOTORS
Synchronous speed, Ns  120 f = 120 * 50 = 1500RPM
p 4 Fig. 15HP Motor efficiency Analysis
Stator resistance of no-load motor,

R2=R1* 235  T 2 =0.52× 235  =0.57 Ω COMPARSION BETWEEN ACTUAL

EFFICIENCY AND RATED EFFICIENCY
235  T1 235 
MOTOR EFFICIENCY (η℅)

Stator resistance of loaded motor,

94
92
R3=R1*
235  T 3 =0.52× 235 138 = 0.71Ω 90
235  T1 235  38 88
86
Actual eff.
Stator cu. loss, Pst1 = (Ino-load)2 × R1 = 43.35 W 84
82 Rated eff.
Stator cu. loss, Pst2 = (Ifull-load)2 × R2 = 231.1W
NM RM1 RM 2RM 3 RM4 RM 5
Iron losses, (Pi) = Pno-load – Pst cu loss at no-
TYPES OF MOTORS
load = 480.65 W

Fig. 20HP Motor efficiency Analysis

674
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

COMPARSION BETWEEN ACTUAL Hence, it is recommended to replace the large horsepower

motors than to make them rewound.
EFFICIENCY AND RATED EFFICIENCY
90 6. CONCLUSION AND FUTURE SCOPE
MOTOR EFFICIENCY (η℅)

88 The most energy conservation area is analyzing the rewound

86 motors and after analyzing, it was found that the efficiency of
84 new motor is 92.68 better then the rewound motor, which
82 has efficiency is 89.80.
80
78 Actual eff. Capacitor bank of determined size can also improve the
76 system efficiency. The losses of the system are reduced.
74 Rated eff. Hence play an important role in conservation of energy. A
72 future study on power factor improvement analysis and
improvement is thus suggested.
NM RM RM RM RM RM
1 2 3 4 5 7. ACKNOWLEDGMENTS
TYPES OF MOTOR I would like to express a deep sense of gratitude and thanks
profusely to my Dissertation Supervisor, Er. Jasvir Singh,
Assistant Professor, Dept. of Electrical Engineering, Bhai
Gurdas Institute of Engineering & Technology, Sangrur,
without those wise counsel and able guidance, it would have
Fig. 50HP Motor efficiency Analysis been impossible to complete the dissertation.

REFERENCES
[1]. Gilbert A. McCoy and John G. Douglass, “Energy
COMPARSION BETWEEN ACTUAL Management for Motor Driven System”
EFFICIENCY AND RATED [2]. Todd Litman, “Efficient Electric Motor Systems,” The
MOTOR EFFICIENCY (η℅)

EFFICIENCY Fairmont Press, Inc., 1995

95 [3]. Proprietary Method for Energy Conservation in Electric
94 Induction Motors Saves Energy, Saves Money, Available
93 at: www.energyconservationindustries.com
92 [4]. Alaj.n Streicher Hagler, Bailly & Company, “Energy
91 efficiency in the Sugar and Manufacturing Industries”.
Actual eff. March 1985
90
89 Rated eff.
[5]. Penrose H. W., “Financial Impact of Electrical Motor
88 System Reliability Programs”, All-Test Division, BJM
NM RM 1 Corp, 2003.
[6]. John S. H., John D. K., “Comparison of Induction Motor
TYPES OF MOTOR Field Efficiency Evaluation Method”, IEEE Transactions
on Industrial Applications, Vol. 34, No. 1, Jan/Feb 1998.

Fig. 100HP Motor efficiency Analysis [7]. Bureau of Energy Efficiency (BEE), Energy Efficiency
in Electrical Utilities: Electric Motors, Available at:
http://emtindia. com/BEE-Exam/GuideBooks/book3.pdf
After doing analysis of rewound motors, it is recommended to
[8]. Bureau of Energy Efficiency (BEE), Energy Performance
replace the motors with new motors. It is noticed after Assessment for Equipment & Utility Systems: Electric
analysis that there exists a relationship between motor Motors and Variables Speed Drives, Available at:
horsepower and its payback period. The relationship is stating http://emtindia. com/BEE-Exam/GuideBooks/book4.pdf
that with the increase of the motor size its payback period
decreases. [9]. Bureau of Energy Efficiency (BEE), General Aspect of
Energy Management and Energy Audit: Financial
Management, Available at: http://emt-india.com/BEE-
Exam/ GuideBooks/book1.pdf
[10].Ali Hasanbeigi, Lynn Price, “Industrial Energy Audit
Guidebook: Guidelines for Conducting an Energy Audit
in industrial Facilities” 2010

675
Civil Engineering
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Need of Sustainable Development & Use of Demolished
Aggregate for Highway Construction
Raj Kumar Maini Amandeep Singh
PTU, Jalandhar PTU, Jalandhar
GNDEC, Ludhiana GNDEC, Ludhiana
rajmaini70@gmail.com as.gndec@gmail.com
ABSTRACT
Huge amount of demolished waste is generated by
construction Industry which is not put to re-use, except it is
disposed off as land fill for low lying areas. Dumping of
wastes on land is not only causing shortage of space, but also
environmental problems near cities. With the ban on mining
of sand and aggregates in Punjab and other northern regions
of India, the prices of sand and aggregate have gone too high
persuading engineers to go for crushers. Recycling of
demolished waste can offer not only the solution of growing
waste disposal problem, but will also help to conserve natural
resources for meeting increasing demand of aggregates for
long time to come for construction industry and give
sustainable environment.
This paper evaluates the behaviour and the environmental
impact of a mixed recycled aggregate from non-selected
construction and demolition waste (CDW) in field conditions.
A process to get aggregate from demolition waste is
developed and its basic properties are determined. These
properties are compared with conventional and local
aggregate. Such recycled aggregate is tried to produce
concrete of grades equivalent to M25 or similar other uses. It
is found that Recycled Aggregate from demolition Waste can
be gainfully used in making fresh pavements.
Keywords
Construction and demolition waste, Recycled aggregates,
saving on use of natural materials, technical requirements,
sustainability.
1. INTRODUCTION
Any construction activity requires several materials such as
concrete, steel, brick, stone, glass, clay, mud, wood, and so
on. However, the cement concrete remains the main
construction material used in construction industries. For its
suitability and adaptability with respect to the changing
environment, the concrete must be such that it can conserve
resources, protect the environment, economize and lead to
proper utilization of energy. To achieve this, major emphasis
must be laid on the use of wastes and by products in cement
and concrete used for new constructions. The utilization of
recycled aggregate is particularly very promising as 75 per
cent of concrete is made of aggregates. In that case, the
aggregates considered are slag, power plant wastes, recycled
concrete, mining and quarrying wastes, waste glass,
incinerator residue, red mud, burnt clay, sawdust, combustor
ash and foundry sand. The enormous quantities of demolished
concrete are available at various construction sites, which are
now posing a serious problem of disposal in urban areas. This
can easily be recycled as aggregate and used in concrete.
Research & Development activities have been taken up all
676
ISBN: 978-81-924893-0-8
Saajanbir Singh
PTU, Jalandhar
GNDEC, Ludhiana
bhathal110@gmail.com
over the world for proving its feasibility, economic viability
and cost effectiveness.
The main reasons for increase of volume of demolition
concrete / masonry waste are, many old buildings, concrete
pavements, bridges and other structures have overcome their
age and limit of use due to structural deterioration beyond
repairs and need to be demolished; the structures, even
adequate to use are under demolition because they are not
serving the needs in present scenario; new construction for
better economic growth; structures are turned into debris
resulting from natural disasters like earthquake, cyclone and
floods etc; creation of building waste resulting from manmade
disaster/war.
From Indian scenario point of view, there is severe shortage
of infrastructural facilities like houses, hospitals, roads etc. in
India and large quantities of construction materials for
creating these facilities are needed. The planning Commission
allocated approximately 50% of capital outlay for
infrastructure development in successive 10th & 11th five
year plans. Rapid infrastructural development such as
highways, airports etc. and growing demand for housing has
led to scarcity & rise in cost of construction materials. Most of
waste materials produced by demolished structures are
disposed off by dumping them as land fill. Dumping of wastes
on land is causing shortage of dumping place in urban areas.
Therefore, it is necessary to start recycling and re-use of
demolition concrete waste to save environment, cost and
energy.
Central Pollution Control Board has estimated current
quantum of solid waste generation in India to the tune of 48
million tons per annum, out of which, waste from construction
industry only accounts for more than 25%. Management of
such high quantum of waste puts enormous pressure on solid
waste management system.
In certain countries, recycling techniques have been in place
since the late 1970s. For example, the reuse of concrete and
masonry as a base course for roads is common practice in the
Netherlands. Molenaar and van Nierkerk (2002) studied the
performance of unbound base course materials made from
recycled concrete and masonry rubble by measuring
parameters such as gradation, composition, and others. Their
study concluded that the degree of compaction is the most
important factor pertaining to the mechanical characteristics
of unbound base courses made of recycled materials.
Significant research initiatives are currently under way to
determine how technical characteristics, such as moisture
content, the California Bearing Ratio (CBR), and degree of
compaction, are affected when recycled construction and
demolition waste (CDW) aggregate is included in pavement
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
layers. For example, Poon and Chan (2006) studied the use of
recycled concrete aggregate and crushed clay brick in
unbound sub base materials in Hong Kong. The results of
their research indicated that the use of 100% recycled concrete
aggregate increased the optimum moisture content and
decreased the maximum dry density of the sub base materials
compared to the use of aggregate composed of natural sub
base materials. Moreover, the replacement of recycled
concrete aggregate by crushed clay brick further increased the
optimum moisture content and decreased the maximum dry
density. It was also found that CBR values (for dry and
soaked conditions) of sub base materials composed of 100%
recycled concrete aggregate were lower than those of natural
sub base materials. The CBR values further decreased when
more recycled concrete aggregate was replaced by crushed
clay brick.
2. MATERIAL AND PROPERTIES
2.1 Concrete Construction
Concrete is a heterogeneous material which is made with
Cement, Aggregate (Stone Chips), Sand & Water. Out of the
total ingredients in mix, about 50% is Coarse Aggregate. As
all these materials are not available in plenty and some of
them are energy intensive, so their use should be economized.
2.2 Properties of Recycled Concrete
Aggregate
Particle Size Distribution
The top quality natural aggregate can obtain by primary,
secondary & tertiary crushing whereas the same can be
obtained after primary & secondary crushing in case of
recycled aggregate. The single crushing process is also
effective in the case of recycled aggregate.
The particle shape analysis of recycled aggregate indicates
similar particle shape of natural aggregate obtained from
crushed rock. The recycled aggregate generally meets all the
standard requirements of aggregate used in concrete.
Water Absorption and Specific Gravity
In general, as the water absorption characteristics of recycled
aggregates are higher, it is recommend to maintain saturated
surface dry (SSD) conditions of aggregate before start of the
mixing operations.
The specific gravity (saturated surface dry condition) of
recycled concrete aggregate was found from 2.35 to 2.58
which are lower as compared to natural aggregates.
Crushing and Impact Values
The recycled aggregate is relatively weaker than the natural
aggregate against mechanical actions.
Compressive Strength
The compressive strength of RAC is lower than the
conventional concrete made from similar mix proportions.
The reduction in strength of RAC as compare to NAC is in
order of 2- 14% and 7.5 to 16% for M-20 & M-25 concretes
respectively. The amount of reduction in strength depends on
parameters such as grade of demolished concrete, replacement
ratio, w/c ratio, processing of recycled aggregate etc.
677
ISBN: 978-81-924893-0-8
Freeze-Thaw Resistance
In the freeze-thaw resistance test (cube method), loss of mass
of the concrete made with recycled aggregate was found
sometimes above and below than that of concrete made with
natural aggregate.
Carbonation
There is an increase in the carbonation depth of RAC as
compared to NAC due to the porous recycled aggregate due to
presence of mortar attached to the crushed stone aggregate.
3. OBSTACLES IN USE OF RCA & RAC
The acceptability of recycled aggregate is impeded for
structural applications due to the technical problems
associated with it such as weak interfacial transition zones
between cement paste and aggregate, porosity and transverse
cracks within demolished concrete, high level of sulphate and
chloride contents, impurity, cement remains, poor grading,
and large variation in quality.
Although, it is environmentally & economically beneficial to
use RCA in construction, however the current legislation and
experience are not adequate to support and encourage
recycling of construction & demolished waste in India. Lack
of awareness, guidelines, specifications, standards, data base
of utilization of RCA in concrete and lack of confidence in
engineers, researchers and user agencies is major cause for
poor utilization of RCA in construction. These obstacles can
be easily removed with the helping hands of government.
4. APPLICATION OF RECYCLE
AGGREGATE
In general applications of recycle aggregate are as follows:
Many types of general bulk fills, helps in bank protection, in
Base or fill for drainage structures; for road construction;
noise barriers and embankments; in construction of low rise
buildings; in manufacturing of paving blocks & tiles; in laying
of flooring and approach lanes; in sewerage structures and
sub-base course of pavement and in be siding drainage layer
in highways and retaining walls.
5. CONCLUSIONS
Recycling and reuse of building wastes have been found to be
an appropriate solution to the problem of dumping hundreds
of thousands tons of debris accompanied with shortage of
natural aggregates. The use of recycled aggregates in concrete
prove to be a valuable building materials in technical,
environment and economical respect
The use of RCAs in civil construction works will reduce
environmental pollution, and reduce the cost of production of
natural resource as well as solving the problem of
construction-waste management by putting into use this
waste. Adding RCAs to concrete resulted in increased water
demand, reduction in workability and reduced strength
compared to the control sample. This results show reduction
in strength of concrete with increase in percentage
replacement of RCAs. Here, we can say that up to 20% RCAs
utilized for economical and sustainable development of
Concrete. Uses of RCAs in concrete can save the
construction-waste disposal costs and produce a ‘greener’
concrete for sustainable construction.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES [5] Use of Recycled Aggregate in Concrete; Author: Jorge de

Brito; Nabajyoti Saikia

[6] Rahal,K ,2007 .Mecahnical properties of concrete with

[1] Robin L. Schroeder ,Autumn 1994.The Use of Recycled
Recycled Course Aggreagate
Material in Highway Construction.
[7] R.J. Collins & S.K. Giesielski,1993.Recycling & Use of
[2] YP Gupta ,2009.Use of recycled aggregates in concrete
waste materials & Byproducts in Highway Construction.
construction.
[8] Ramammurthy, K & Gumaste,K.S.,1998.Properties of
[3] Rosario Herrandor;Pablo Perez;Laura Garach;Javier
Recycled Aggregate.
Ordanez,2012.Use of Recycled construction & Demolished
Waste Aggregate.

[4] S.K. Singh,P.C. Sharma,2013.Use of Recycled

Aggregate in concrete.

678
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Applications of Acoustical & Noise Control Materials &
Techniques for Effective
Building Performance- A Review
Jashandeep Kaur K.S. Bedi
Structural Engg. G.N.D.E.C, Civil Engg. Deptt. G.N.D.E.C,
Gill Road, Ludhiana. Gill Road, Ludhiana.
jashandeepkaur18 kanwarjeet_b@yahoo.com
@gmail.com
ABSTRACT
The concept of acoustic & noise control is gaining due
attention now a days. The continued growth in urban
population has led to high density buildings close to airports
highways & cities. This has increased the exposure of
population from wide variety of sources thereby increasing
the need to provide better sound insulation for the building. A
comprehensive list of current available techniques, various
acoustical porous materials & composites are discussed in
regard to their effectiveness in the building usage. A
description of various acoustical characterizations,
composition, and application of materials is widely presented.
However, to some extent the sustainability is also accounted.
A sustainable product can thus be created repeatedly without
generating negative environmental effects, without causing
waste products or pollution, and without compromising the
wellbeing of workers or communities.
General Terms
Acoustics, Sound insulation.
Keywords
Aerogels, composites, Double leaf wall, Particle board.
1. INTRODUCTION
ACOUSTICS is a term sometimes used for the science of
sound in general. It is more commonly used for the special
branch of that science, architectural acoustics, which deals
with the construction of enclosed areas so as to enhance the
hearing of speech or music. Noise control as the name
suggests, envelops the techniques used to minimize the effects
of unwanted sound and thus optimize environmental
conditions. Building Acoustics involves both the control of
noise within an enclosed space and the reduction of noise
between rooms or from either outside or inside a building.
Acoustical performance of every adaptable structure has
long been interested & is investigated worldwide. Various
sound absorbers like organic porous materials for example
wool fiber, ceramic, rubber, hemp, aerogel etc. & inorganic
porous materials for example melamine form, polypropylene
composite[1]. Various composites have been discovered like
jute composites, composites from ground chicken quill &
polypropylene[3]. Various techniques are widely accepted for
effective sound insulation in different components of the
679
ISBN: 978-81-924893-0-8
Manu Nagpal
Geotechnical Engg, G.N.D.E.C,
Gill Road, Ludhiana.
nagpal.manu@yahoo.com
buildings.
The double wall construction with shallow gap, light
weight double leaf wall is adopted as effective sound
absorbers in the walls of the buildings. As the cavity or gap
saturated with air is intentionally left to absorb the sound
transmitted by various noise resources. Likewise the various
sound absorbing materials like glass wool, cork & other waste
matter or material is used for filling the cavity. Various types
of panels like GFP (gas filled panels) & particles board such
as cork board, corn cob paricle board are employed in
interiors of buildings[2]. Taking care of sustainability, recycled
carpet waste, recycled rubber waste, vegetable matter, hemp
& jute are largely used.
The protection against the excess of noise in the workplace is
a crucial public health problem. Machine noise can be
controlled by acoustic enclosures which limit the power of
outward sound. But this solution often proves to be
insufficient, especially for low frequencies. Two main
approaches can be envisaged to increase reduction in the noise
transmitted by enclosures. The first is wall treatment to absorb
acoustic energy inside the enclosure. For low frequencies,
however, these approaches involve an excessive thickness of
material. The second approach consists in directly acting on
the walls to prevent noise transmission by reducing wall
vibration. Generally, covering the walls with passive materials
adds mass and increases damping. In 1999, the total energy
consumption in Europe was 1780 million tons of oil
equivalents, for which 35% was used in the residential and
commercial sector. It became clear that reducing the heat
losses of buildings or in general the total energy consumption
of buildings can have a major impact on the total greenhouse
gas emissions in Europe. Traditional insulation materials were
and are being used in thicker or multiple layers, which
resulted in more complex building details, an adverse net-to-
gross floor area and possible heavier load bearing
constructions. But simultaneously, a second strategy won
interest. It became clear that air as an insulator had reached
his limit and that there was a need to research and develops
high performance thermal insulation materials and solutions.
Gas-filled panels (GFPs), are one of these new promising high
performance thermal insulating solutions for building
applications.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
1. The Acoustic Nature of Materials
Building Material is any one of various substances out of
which buildings are constructed. They come in different forms
and are also applied in various ways in building. Materials in
building construction for the purpose of this write-up will be
classified under the four major component parts of a building.
This includes the following;
1. Walls
2. Floors
3. Ceilings
4. Roofs
When we choose the materials that will make up the
structure of a building, we are making decisions that will
affect the nature of sound within the building. It is possible to
make improvements after the fact, but when the building has
been built we’ve lost the ability to affect the acoustics in two
important ways. The major problem with starting to build
before designing the acoustics is that little or no consideration
is given to the acoustic nature of the materials that make up
the structure.
First we’ll take a look at some commonly used building
materials and their acoustic properties, and then we’ll
examine the ways these materials can be used for sound
isolation and acoustic treatment. Sound isolation is the branch
of acoustics that deals with keeping sound where you want it
– in or out of the building, for instance, or keeping sounds in
one room from invading another room [4]. Sound treatment, on
the other hand, is the branch of acoustics concerned with the
perfecting the quality of the sound we hear, and using the
proper combinations of materials and shapes to create
pleasing, musically accurate sound.
1.1 Concrete, Stone & other building
material
Masonry materials are great for sound isolation, especially
when used in floors and walls where the masonry material is
quite thick. A solid concrete wall 1 ft. thick will rarely cause
clients to complain about sound isolation, for two reasons.
One is the material’s rigidity, meaning that it will not flex and
create sound waves on the quiet side of the wall. The other is
concrete’s mass. Nothing stops sound waves quite like
massive materials, and they are especially capable of stopping
the critical low frequencies that are so hard to stop with less
massive materials. Stone and brick are very similar to
concrete in mass, and concrete masonry units, although they
are lighter, can do a very good job when they are fully filled
with concrete, instead of just filling the cells that contain the
rebar.
Concrete slabs also do a good job of isolating sound between
floors – something that is very difficult to do any other way.
1.2 Wood, and wood products
Wood is much less dense than masonry, and provides much
less in the way of sound isolation for that reason. Wood
products like MDF, on the other hand, are somewhat more
massive, and are sometimes used in interior walls to add mass.
OSB is less dense than MDF, but can be useful as well, as part
of an integrated system. Plywood comes in varying densities,
680
ISBN: 978-81-924893-0-8
and again can contribute something to the equation in a multi-
layer wall.
Wood’s real beauty lies in its ability to reflect sound in a
pleasing way, meaning that it is a useful material for sound
treatment. Since wood resonates easily, it has a way of
absorbing some of the sound energy as it vibrates, letting
some of the sound pass through to the other side, and
reflecting some of the sound back from whence it came. This
genteel quality of wood is one reason it is widely used in the
making of musical instruments, and wood has a major role to
play as an interior finish material in good sounding rooms.
1.3 Steel
Steel is a quite dense material, but because of its expense it is
rarely used as a sound isolation material. Steel’s density
actually becomes a liability in structural uses where its dense
nature causes it to carry sound vibrations for long distances. If
you strike an I-beam with a hammer and place your ear to the
other end –let’s say 24 ft. away, you’ll see that the sound
carries quite well through the steel. This type of sound
transfer is called structure-borne vibration, where sound is
carried through some material other than air for a time. The
other main type of sound transfer is air-borne vibration.
Steel studs can actually transmit less structure-borne vibration
than wood, even though steel is more prone to this problem
simply because flimsy steel studs have much less cross-
sectional area to carry the vibrations between the two wall
surfaces.
1.4 Roofing materials
Asphalt shingles are fairly massive, as you know if you
hauled them up to the roof, but they are also thin. Installation
with a large overlap, heavy felt, and even double layer
sheathing can help quite a bit. Ceramic and clay tiles are more
massive than wood shakes by far, and can do a reasonable job
in residential applications. Metal roofing has mass but is thin,
and requires that the underlying structure be fairly massive.
1.5 Glass and other transparent materials
Glass is quite massive – about three times as massive as
drywall. So in a sound wall with three 5/8” layers of drywall
on one side, one layer of 5/8” glass maybe inserted to create a
window on that side, provided that it is properly sealed. A
corresponding piece of glass would be required on the other
side of the wall, at the appropriate thickness.
A relatively recent development is the invention of absorptive
glass-like products that offer pretty good transparency while
absorbing enough sound to reduce the harsh reflectivity
usually associated with glass. These products are made from
Plexiglas or thin transparent foils, perforated with tiny holes.
Their use is mainly confined to professional sound studios.
1.6 Insulating materials
Insulating materials have little mass, so they have limited
uses for sound isolation. However, fiberglass has good sound
absorption characteristics, and is very useful as a sound
treatment material for sound room interiors. Fiberglass and
rock wool, which has similar acoustic properties, absorb
sound by slowing the velocity of the air particles carrying the
wave. Wood, on the other hand, absorbs sound best when in
the pressure zone of a sound wave. Sound waves are at
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
highest pressure when at lowest velocity, so care must be
taken to place materials appropriately. Waves are generally at
highest pressure at room boundaries, particularly multiple
boundaries like dihedral and trihedral corners.
1.7 Plastics and Rubber
Plastics are sometimes used in the manufacture of low-cost
acoustical devices, but have limited usefulness. Rubber,
particularly neoprene rubber is very good as a mechanical
isolator -- for floating glass and preventing the diaphragmatic
vibrations of the glass from transmitting into the wall, for
instance.
Mass loaded vinyl can be used inside wall cavities to increase
sound isolation, and is hung in a limp, as opposed to stretched,
fashion.
1.8 Mechanical and plumbing materials
Metal and plastic pipes are often transmitters of structure
borne vibration, and can be isolated or deadened with rubber
materials. Refrigerant lines are especially bad for transmitting
high-pitched whining noises through buildings, so you want to
locate them carefully, and de-couple them from the
structure.Ductwork should be heavy sheet metal, lined with at
least 1” of acoustic liner. Flex duct is virtually acoustically
transparent, and should be avoided when you are picky about
crosstalk between the ducts in attics and other mechanical
spaces.
2. TECHNIQUES FOR SOUND ABSORPTION &
SOUND PROOFING
2.1 Active control of sound transmission through a linked
double wall system into an acoustic cavity
Noise control inside a cavity is a typical problem with great
application potential in both industry and civil engineering.
To control the interior noise, double-wall structures are
widely used in mobile vehicles, partition walls in building and
aircraft fuselage shells thanks to their superior noise insulation
performance over single-leaf structures.
In the past few years, numerous new experimental methods
have been proposed to characterize the elastic and damping
parameters of fibrous materials or open-cells and air saturated
polymer foams. These materials are widely used for sound
absorption and insulation in buildings, inside the fuselage of
airplanes, in machinery enclosures, etc. The influence of their
elastic parameters (Young’s or shear moduli, Poisson’s ratios,
loss factors, etc.) may be important when porous materials are
bounded onto the vibrating structure.
In many practical situations, however, double-wall
structures contain mechanical links to connect the two walls,
which alter the energy transmission path. Apart from the
acoustic transmitting path through the air gap between the two
walls, energy can also be transmitted from the links, such
forming a structural transmitting path [5]. As a result, the
inherent coupling between the panels and the cavities
(the air gap and the enclosure) significantly increases
the degree of complexity in terms of control.
NOISE CONTROL OF AN ACOUSTIC ENCLOSURE COVERED BY
A DOUBLE-WALL STRUCTURE WITH SHALLOW GAP
Control of sound transmission through a double-wall
structure with an acoustic enclosure is an interesting topic of
681
ISBN: 978-81-924893-0-8
research that has received much attention for years. Generally,
for the double-wall structure with a shallow gap, the strong
coupling of the mass-air-mass will deteriorate sound behavior
at low frequencies, which leads to the rapid development of
using active techniques for noise control [5].
Some typical control strategies include acoustic control using
microphones and loudspeakers, vibration control using PZT
actuators and PVDF sensors, and etc. In engineering practice,
however, it is difficult to embed a complicated control circuit
into a shallow gap from the implementation point of view.
As an alternative, passive control using Helmholtz
resonators (HRs) has been adopted extensively due to its low
cost and no need for external power. By properly arranging
tuned HRs, the acoustical damping level inside the cavity
between the double panels, i.e., air gap, can be increased, and
consequently the noise attenuation is achieved. However, the
problem arises naturally when considering the control action
of using HRs. That is, only a very narrow bandwidth can be
controlled using single HR and the design of HR network to
cover a broad frequency range apparently limit its application
due to space requirement. Therefore, it is desired to come up
with an effective design to balance these concerns. Based on
the facts that, the double-gap system is more effective for
noise attenuation than the single one and a long T-shaped
acoustic resonator array can facilitate the design a plausible
method is to design resonator-like cavities with large aspect
ratio around the shallow gap. The reason is that, such a design
might not only dampen more than one frequency (compared
with single HR), but also alter the modal coupling between
the air gap and the designed cavities, leading to the change of
vibrio-acoustic behavior between the air gap and the lower
panel, and consequently resulting in noise reduction in the
enclosure [8]. Discussion on the possibility of using resonator-
like cavity design for noise control is hence of great interest.
2.2 Aerogel insulation for building
application
In 2005, buildings emitted 8.3 Gt carbon dioxide each year
accounting for more than 30% of the greenhouse gas
emissions in many developed countries[1]. Residential and
commercial retrofit insulation has been found as one of the
most cost effective actions for greenhouse gas abatement .
Here fore, traditional insulation materials were and are being
used in thicker or multiple layers which result in more
complex building details, an adverse net-to gross floor area
and possible heavier load bearing constructions.
But simultaneously, a second strategy won interest. It
became clear that air as an insulator had reached his limit and
that there was a need to research and develop high
performance thermal insulation materials and solutions.
Figure:1 Aerogel as a high performance thermal
insulation material for building application
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Although yet discovered in the early 1930s , aerogels are –
together with vacuum insulation panels – one of these new
promising high performance thermal insulation materials for
possible building applications, but only limited commercial
products are available.
2.3 Gas-filled panels for building
applications
Figure: 2 Corncob particle board having size 50 cm x 100
cm & thickness 3 cm.
Gas-filled panels (GFPs) are one of these new promising
high performance thermal insulating solutions for building
applications.[2] Gas-filled panels are experimental and only
limited commercial products are available so far. Most of the
work carried out on GFPs in available literature is performed
by Griffith and co-workers at Lawrence Berkeley National
Laboratory (LBNL), which is also depicted in the references
of this review. In fact, some of the references cover
refrigerator applications and do not actually cover GFPs as
applied in the building envelope.
Gas-filled panels (GFPs) consist of a barrier envelope and a
gas between reflective layers (a baffle). The gas can be air or
a heavier gas to decrease thermal advection and
conduction. A low-emissivity barrier envelope is used
to enclose the gas and to decrease the heat transfer due
to radiation, while a low-emissivity baffle structure is
included to decrease inner gas convection and radiation.
As a result, both flexible and stiff GFPs are possible.
2.4 Impact sound insulation technique using
corncob particleboard
Affordability, low rate of CO2 emissions to the atmosphere,
and small energy and water consumptions are some
parameters that have to be taken into consideration when a
product is designed. Using green building materials which
must be renewable, local and abundant is a solution that
contributes to achieve these important goals. In this context,
several authors have already proposed using different
agricultural products such as bagasse, cereal, straw, corn stalk,
corn cob, cotton stalks, rice husks, rice, straw, sunflower hulls
and stalks, banana stalks, coconut coir, bamboo, durian peel,
oil palm leaves among others for product processing such as
particleboard, hardboard and fibre board, and focusing on
their thermal insulation ability. Other authors have been
studying the technical potential of using other types of residue
such as newspaper, honeycomb or polymeric wastes in the
processing of different building components. On the other
hand, new alternative sustainable sound insulation building
products have been at the centre of society’s concerns. Sound
insulation products processed with natural materials (e.g.
cotton, cellulose, hemp, wool, clay, jute, sisal, kenaf, feather
or coco) or processed with recycled materials (e.g. wood,
682
ISBN: 978-81-924893-0-8
canvas, foam, bottle, jeans, rubber, polyester, acrylic, fibre
glass, carpet or cork) are some solutions already established .
These green products or eco-products intend to be sustainable
alternative to the traditional ones (e.g. glass or rock wool) [6].
The fact that natural fibres may be economic, light weight and
environmentally friendly, justifies that they have been studied
as an alternative to the synthetic fibres in the acoustic context
[9]
.
Among the above identified agricultural products, corn cob
has an additional advantage in terms of possible application
for alternative processed products because it does not collide
with the worldwide food stock and it is generally considered
as agricultural waste.
Figure: 3 Corncob particle board having size 50 cm x 100
cm & thickness 3 cm.
2.5 Sound absorption characteristics of high
temperature sintering porous ceramic
material
Sound absorption of porous media has long been interested in
the industry of noise control including areas of mufflers of
cars, air conditioner parts, pump chambers and elevated roads,
etc.
According to the substance, current acoustical materials could
be roughly divided into three kinds: organic porous materials
(OPMs), inorganic porous materials (IPMs) and metallic
porous materials (MPMs) [7].
The organic porous materials (OPMs) include a wide area.
The use of polymeric binder, instead of the concrete typically
employed in present commercial products, allowed obtaining
light sound absorbing panels. The natural foam rubber with
the addition of sodium bicarbonate acts as a blowing agent. It
was found that natural foam rubber at the lowest foaming
temperature 140 degree Celsius indicates good sound
absorption. By means of suitable constituents and fabrication
processes, the sound absorption of hemp concrete can be
controlled and significantly enhanced. Besides of the above
materials, the utilization of industrial and agriculture waste
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
materials in the area of sound absorption has been drawing
more and more attention, such as recycled rubber, elastomeric
waste residue (tyre and carpet shreds), industrial tea-leaf-fiber
waste material and coir fiber.
The conventional inorganic sound-absorbing materials are
glass wool and rock wool. The effect of circumferential edge
constraint on the acoustical properties of glass fiber materials
with a special focused on the variation of transmission loss
with frequency.
REFERENCES
[1] Baetens Ruben , Bjørn Petter Jelle , Arild Gustavsend,
2011 “Aerogel insulation for building applications: A state-of-
the-art review” Energy and Buildings.
[2] Ruben Baetens, Bjørn Petter Jelle, Arild Gustavsend,
Steinar Grynninga 2010 “Gas-filled panels for building
applications: A state-of-the-art review” Energy and Buildings
[3] Shah Huda , Yiqi Yang ,2010 “Composites from ground
chicken quill and polypropylene”.
683
ISBN: 978-81-924893-0-8
[4] Z.S. Liu, H.P. Lee, C. Lu, 2006, “Passive and active
interior noise control of box structures using the structural
intensity method”.
[5] Y.Y. Li, 2006 “Noise control of an acoustic enclosure
covered by a double-wall structure with shallow gap”.
[6] S. Fatima 1, A.R. Mohanty, 2011 “Acoustical and fire-
retardant properties of jute composite materials”.
[7] Duan Cuiyun, Cui Guang, Xu Xinbang, Liu Peisheng,
2012 “Sound absorption characteristics of a high-temperature
sintering porous ceramic material”.
[8] Y.Y. Li, L. Cheng, 2008 “Mechanisms of active control of
sound transmission through a linked double-wall system into
an acoustic cavity”.
[9] Jorge Faustino, Luís Pereira , Salviano Soares , Daniel
Cruz, 2012 “Impact sound insulation technique using corn cob
particleboard”.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Nanocement Additives - A Carbon Neutral Strength
Enhancing Material
Jaskarn Singh Gurpyar Singh
Asst.Prof. Asst. Prof.
GNDEC, Ludhiana BGIET, Sangrur
ABSTRACT
Due to Rapid Growth in Construction Industry, the use of
Cement is Tremendously increasing for the development
of advance building materials , Some problem related to
the sustainability for cement and concrete production still
existing in the cement industries. For example, most of the
concrete with local high volume fly ash/slag replacement
cement, experienced constraint to attain the required early
strength and ultimate strength limited in the range of
60MPa to 70MPa at 28days age. Higher than 98MPa
concrete only can be produced by binary or ternary blended
cement and limited to use together with silica fume in that
case the Nanocement type material plays a important role,
In this study the palm oil fuel ash (POFA) and rice husk ash
(RHA) are used to produce the Nano Cement Additives
(NCA) for carbon neutral cement (CNC). NCA can be
produced by mechano-chemical activation in wet milling
and precipitation method. NCA performance can be
evaluated in OPC mortar by replace the OPC at dosage
0.5%, 1.0% and 1.5%. respectively.
KEYWORDS
Nano Cement, GPC, Super plasticizer, CNC, sol-gel
formation, condensation, agglomeration.
1. INTRODUCTION
Since the RHA and POFA are derived from the biomass
thus they can be categorized as the biogenic waste and the
slag term as industrial by-products. Rice husk ash(RHA)
waste generated from the rice husk processing industries,
palm oil fuel ash(POFA) from palm oil milling industries
and slag from steel milling industries are abundantly
available and proved pozzolanic waste materials, The
complex chemistry and physical structure of cement
hydrates in concrete however mean that issues of
fundamental science still need to be resolved. Research at
the nanoscale has the potential to contribute to these
debates and questions. Analysis at the nanoscale may
provide further insight into the nature of hydrated cement
phases and their interaction, Recent nano-research in
cement and concrete has focused on the investigation of the
structure of cement-based materials and their fracture
mechanisms. With new advanced equipment it is possible
to observe the structure at its atomic level and even
measure the strength, hardness and other basic properties of
the micro and nano-scopic [1] phases of materials.
684
ISBN: 978-81-924893-0-8
Parampreet Kaur Akash Bhardwaj
Asst. Prof. Student of Civil Engg.
SBSSTC, Ferozepur SBSSTC, Ferozepur
2. METHODS TO PRODUCE NANO
CEMENT ADDITIVES
The relatively small quantities, less than 1% of nano-sized
materials are sufficient to improve the performance of nano
composites. Yet, the commercial success of nanomaterials
depends on the ability to manufacture these materials in
large quantities and at a reasonable cost relative to the
overall effect of the nano product. The nanomaterials
technologies, which could lead to the industrial outputs,
involve plasma arching, flame pyrolysis, chemical vapour
deposition, electrode position[2], sol-gel synthesis,
mechanical attrition and the use of natural nanosystems .
Among chemical technologies, sol-gel synthesis is one of
the widely used “bottom-up” production methods for nano-
sized materials, such as nano-silica. The process involves
the formation of a colloidal suspension (sol) and gelation of
the sol to form a network in a continuous liquid phase (gel).
Usually, trymethylethoxysilane[3] or tetraethoxysilane
(TMOS/TEOS) is applied as a precursor for synthesizing
nanosilica. The sol-gel formation process can be simplified
to few stages
1. Hydrolysis of the precursor.
2. Condensation and polymerization of monomers to form
the particles.
3. Growth of particles.
4. Agglomeration of particles, followed by the formation
of networks and, subsequently, gel structure.
5. Drying (optional) to remove the solvents and thermal
treatment (optional) to remove the surface functional
groups and obtain the desired crystal structure.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Then 1% NCA-RHA or the 1%NCA-POFA can be blended

into the CNC dry powder or during mixing fresh mortar or
SCC and Nonsteaming[7] spun pile concrete.

Na2SiO3(Sodium silicate) + H2SO4 ----------SiO2 (silica) +

Na2SO4 + H2O

4. RESULTS

Fig.1 SEM of Nano-Additives at different concentration

3. METHODOLOGY

Samples and materials PCE superplasticizer was a comb-

type polymer and SNS is napahthalene base
superplasticizer supplied by one of the local admixture
manufacturer. The molecular weight of SNS and PCE
superplasticizer was analyzed and characterized with gel
permeation chromatography(GPC). The GPC analysis was
conducted under the following condition: Columns: Shodex
Asahipak GS series, Flow rate: 1ml/min, Temperature: 40 0
C , Eluent: Acetonitrile[4] and 50mMNaNO3 in the ratio
3/7 (v/v), Injection volume: 10µm, Detector: Refractive
index and UV detector.
Fig.2 The agglomeration results
The nano silica colloidal solution(NCA-RHA) was
prepared by first wet milling process with ball
NCA-RHA consist of 88.9%(190.9nm) and
milling(3.5hrs), ultrasound milling(10minutes), high shear
11.1%(20.92nm) particles however in the TEM test the
wet milling(2cycles). In the second extraction process of
average spherical diameter is about 10nm to 30nm and
silica using caustic soda to form the sodium silicate then
agglomerate to a cluster in diameter about 100nm. This
precipitation nano silica by using the sulphuric acid . 100g
agglomeration more obvious in the case of NCAPOFA the
of RHA samples were dissolved in 800ml of 3.0N sodium
fresh prepared NCA-POFA contain 82.3%(345.7nm) and
hydroxide solution and efflux in a 2.5L Erlenmeyer flask
17.7%(27.09nm) but after a month storage it started
for 10 hours then filtered and the residue was washed with
agglomeration to form bigger diameter particles in the
200ml boiling water. After cool down the filtrate to room
fraction of 74.3%(2.318µm), 12.2%(355.5nm) and
temperature, adjust the pH in the range 7.5 -8.5 with 5N
11.9%(30.32nm).
Sulphuric acid.

The nano silica colloidal sample was examined with TEM
test or Zeta potential and the filtrate was vacuum dried at
500 C for 2hrs then oven dried for 12hrs to proceed on for
XRD and SEM test. The submicron slurry[5] of POFA (in
short form as NCA-POFA) was prepared in the same
method as nano silica colloidal solution but only achieve
the submicron size slurry due to the nature agglomeration
of aluminosilica[6] in the laminated layer form. 100%
replacement cement(CNC) sample was prepared by
intergrinding the 60%slag, 30%POFA and 10%RHA in the
ball mill till fineness in the range from 650 to 750 m2 /kg.
5. CONCLUSION
 The nano colloidal NCA-RHA solution is successful
prepared from RHA in nano size 11nm-30nm
amorphous silica without agglomeration by wet
milling and precipitation method.
 The nano colloidal NCA-POFA solution in the initial
prepared stage is nano size particle 27nm- 300nm
amorphous of alumina silica, however it is un-stable
will agglomerate into submicron particles.

685
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

 The mortar strength indicated that at low dosage development”. Paper presented at Malaysian Construction
0.5%NCA-RHA and NCA-POFA is highly reactive in Research Journal (MCRJ), Vol.1, No.7, pp:28- 37.
pozzolanic activity and suitable for OPC cement
strength enhancer in the early age. When dosage [4] Lai, F.C. (2009). “High volume quaternary blended
beyond 1%NCA will improve the early and ultimate cement for sustainable high performance concrete”. Paper
strength. presented at 34th Conference on Our World In Concrete &
 However the NCA-POFA more significant affect the Structures: 16th-18th August 2009, Singapore, pp:175-180.
workability of mortar/concrete when dosage beyond
1%.
[5] Duxson, P, Fernandez, J, Provis, J.L, Lukey, G.C,
 The NCA is also suitable for producing the CNC
Palomo, A, Van Deventer, J.S.J. (2007). “Geopolymer
cement act as the 100% slag and POFA activator.
technology: the current state of the art”. J.Mater Sci,
 The mortar strength indicated that the CNC cement is
Vol.42, pp:2917-2933.
highly reactive in pozzolanic activity not only for high
volume replacement cement with slag and POFA
concrete but also for sustainable high strength cement [6] Ravindra, N.T and Ghosh, S. (2009). ”Effect of mix
and concrete 100MPa to 120MPa. composition on compressive strength and microstructure of
 Fullfill the sustainable high performance concrete fly ash based geopolymer composites”. ARPN Journal of
technology requirement. No need steaming/autoclave engineering and applied sciences. Vol.4, No.4, pp:68-74.
energy constraints whereby the SCC is high early
strength&ultimate strength at temperature 27 0 C to [7] Nittaya, T and Apinon, N. (2008). “Synthesis and
350 C(tropical climate) with low W/B = 0.25 by using characterization of nanosilica from rice husk ash prepared
the CNC cement with total 90% and 100% OPC by precipitation method”. CMU.J.Nat.Sci. Vol.7, No.1,
replacement with the local renewable materials :RHA, pp:59-65.
POFA and slag.
 Optimum dosage at 1%NCA is good for non-steaming
spun pile concrete achieved >40MPa at 7hrs and the
grade 80 can be delivered at 3days instead of common
practice for 14days.
 The CNC cement concrete mix design is comparable
performance in strength and durability against the
normal OPC mix as the high strength 100MPa and
water depth penetration very low

6. ACKNOWLEDGEMENT

The authors would like to thank Faculty of GNDEC

Ludhiana, & SBSSTC, Ferozepur for their full support and
encouragement in supporting this research.

REFERENCES

[1] Mohamed, E.I, Mohd Warid Hussin and Mohammad

Ismail. (2008). “High performance blended cement
concrete in Malaysia”. Paper presented at 8th International
Symposium on utilization of highstrength and high-
performance concrete, 27th-29th 2008, Tokyo, Japan,
pp:639-646.

[2] Ilham, Ade. (2004). “Mix design and properties of high

performance concrete with compressive strength from
50MPa to 100MPa”. PhD Universiti Kebangsaan Malaysia.
Kartik, H.O, Russell, L.H and Ross, S.M (2003). HVFA
Concrete-An Industry Perpective. Concrete International,
Vol.25 No.8.pp:29-34.

[3] Lee, Y.L, Koh, H.B, Chee, K.W, Suraya, H.A,

Suhaizad Sulaiman and Yung, T.H (2007). “Micronised
biomass silica and nano particles synthesis-recent

686
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Transpiring Concrete Trends: Review
Prof. K. S. Bedi Ivjot Singh
Associate Prof. M.Tech Student
Department of Civil Engg. Department of Civil Engg,
GNDEC, Ludhiana NIT Jalandhar.
Kanwarjeet_b@yahoo.com ivu.singh@gmail.com
ABSTRACT
With a thrust on infrastructure development, the advancement in
construction materials has a significance place. Recent
researches in the concrete have emphasized on strength and
durability of hardened concrete. The higher grades of concrete
are now becoming more popular with its proven utility in the
construction of important structures. The different emerging
trends of concrete production and current research scenario in
the area of Self Compacting Concrete is discussed in this paper.
Along with the recent developments in the field of concrete such
as high performance concrete (HPC), light weight aggregate
concrete, compacted reinforced concrete (CRC), high volume
fly ash concrete and green concrete using recycled materials.
Keywords: Concrete, Aggregate, Fly ash
1. INTRODUCTION
Concrete technology is a vast area in the field of
research, as concrete is mainly adopted construction material,
the recent thrust on infrastructure development has increased the
cement production. Hence innovative materials have been
developed and new applications have been emerged in.
The basic ingredients of the concrete are same as before, which
are cement, coarse aggregates, fine aggregates and water. But
the developments in material technology have introduced so
many trends in concrete like Self Compacting Concrete (SCC),
High Performance Concrete (HPC), Light Weight Aggregate
Concrete, High Volume Fly Ash Concrete and Green Concrete.
We shall discuss all these trends in brief one by one .Although
there are different types of concrete that have been developed
for use in different applications, their common virtues are
strength, durability, wide availability, fire resistance and
comparatively low cost.
2. TRENDS IN CONCRETE
2.1 Self Compacting Concrete
SCC is highly workable concrete which flows through congested
reinforced areas effectively under its own weight without any
segregation, excessive bleeding, air-popping, or any other
material separation without any need of compaction. Being
687
ISBN: 978-81-924893-0-8
Prof. Jaskarn Singh
Asst. Prof.
Department of Civil Engg.
GNDEC, Ludhiana
jaskarnsinghgne@gmail.com
highly workable SCC has different properties from the
conventional concrete. SCC have slump value 280mm+[1] at all
levels of flow ability along with maintaining the viscosity to
make the mortar suspended and maintain a homogenous
mixture. But the conventional concrete at Slump value 280mm+
don’t have that much stability like SCC.
In 1980s, Japan faced a problem of lack of skilled workers who
could construct more durable concrete structures. Professor
Hajime Okamura (University of Tokyo, now Kochi Institute of
Technology) found the use of SCC as a solution to this problem.
SCC technology in Japan was based on using conventional
superplasticizers to create highly fluid concrete, along with
using viscosity-modifying agents (VMA) which increase plastic
viscosity thus preventing segregation.
SCC offers some help in respect of the following:-
1. Reduced cost
• Improved Productivity – SCC can increase the speed of
construction, improve surface finishing and thus reduce
repair costs, reduce maintenance costs on equipment, and
provide less time consuming process.
• Reduced labor costs – SCC reduces labor demands and
compensates for lack of skilled workers to perform the
rigorous work required for quality concrete construction.
2. Improved work environment and safety – SCC reduced
the use of vibrators for concrete placement, thus
minimizing vibration and noise exposures. It eliminates trip
hazards caused by cords. It reduces fall hazards, as workers
do not have to stand on forms for compaction of concrete.
2.1.1 Properties of Self Compacting Concrete
There are no. of steps to design the optimum composition of the
SCC. At first, we need to determine the water cement ratio.
Then the most important criteria i.e. the coarse aggregate
volume should be 50% of the solid volume of the concrete
without air, and that the fine aggregate volume should be 40% of
the mortar volume, where particles finer than 0.09mm are not
considered as aggregate, but as powder[2]. If the composition of
the mixture, obtained in this way, is mathematically analyzed, it
is found that this procedure leads to a concrete composition with
a little bit of “excess paste”. It means that slightly more paste is
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
in the mixture than necessary to fill all the holes between the
particles: this implies that around any particle a very thin
“lubricating” layer exists, by virtue of which the friction
between the particles in the fluid mixture is greatly reduced in
comparison to conventional mixtures, Fig. 1
Fig. 1. Excess paste layers around the aggregate particles.
Also the modulus of elasticity of SCC is smaller than the normal
concrete for the same strength [2]. This is because of the
different stiffness of the aggregates used so the value of E
modulus is considered to scatter.
2.1.2 Applications of Self Compacting
Concrete
The advantages for using SCC are useful in the following
respects like,
- the substantial reduction of the noise level
- the absence of vibration
- the reduction of dust (quartzite!) in the air due to
vibration
- the energy saving
- the omission of the expensive mechanical vibrators
- the reduction of wear to the formwork
- the possibility to produce elements with high
architectural quality
Fig. 2. Modulus of elasticity of self-compacting concrete.
2.2 Light Weight Concrete
Concrete of substantially lower density than that made from
gravel or crushed stone;
usually made with lightweight aggregate or
by injecting air or gas into the mortar is called as light- weight
concrete. It can also be defined as a type of concrete which
includes an expanding agent in it that increases the volume of
the mixture while reducing the dead weight. It is lighter than the
688
ISBN: 978-81-924893-0-8
conventional concrete with a dry density of 300 kg/m3 up to
1840 kg/m3. Lightweight aggregates used in structural
lightweight concrete are typically expanded shale, clay or slate
materials that have been fired in a rotary kiln to develop a
porous structure. Other products such as air cooled blast furnace
slag are also used. The primary use of lightweight concrete is to
reduce the dead load of a concrete structure which then allows
the structural designer to reduce the size of columns, footing and
other load bearing elements. So the marginally higher cost of the
lightweight concrete is offset by the size reduction of structural
elements, less reinforcing steel and reduced volume of concrete,
thus resulting in lower overall cost.[3]
Except those light weight concrete has the following advantages
too:-
1. Earthquake Resistant: Since lighter than concrete & brick, the
lightness of the material increases resistance against earthquake.
2. Insulation: Superior thermal insulation properties compared to
that of conventional brick and concrete, so reduces the heating
and cooling expenses. In buildings, light-weight concrete will
produce a higher fire rated structure.
3. Workability: Products made from lightweight concrete are
lightweight, making them easy to place using less skilled labor.
4. Savings in Material: Reduces dead weight of filler walls in
framed structures by more than 50% as compared to brickwork
resulting in substantial savings.
5. Less creep and shrinkage: values of creep and shrinkage strain
for these lightweight concretes are low as compared to
conventional concrete [4]
Note:-The concrete cover to reinforcement using lightweight
aggregates in concrete should be adequate. Usually it is 25mm
more than that of normal concrete because of its increased
permeability and also concrete carbonates rapidly by which the
protection to the steel by the alkaline lime is lost.
Formation of light weight concrete:-Portland cement and sand,
so that when the mix sets and hardens, uniform cellular structure
is formed. Thus it is a mixture of water, cement and finely
crushed sand. We mix fine powder of Aluminium to the slurry
and it reacts with the calcium hydroxide present in it thus
producing hydrogen gas. This hydrogen gas when contained in
the slurry mix gives the cellular structure and thus makes the
concrete lighter than the conventional concrete
2.3 High Volume Fly Ash Concrete
In the modern scenario the cementing materials are being
replaced by some supplementary materials to a large percentage.
Near about 800 million tones fly ash is available worldwide
which points out to potential the use of fly ash. Because of its
pozzolanic, self cementious nature it can be used as mineral
admixture in the concrete.Fly ash has been used as a mineral
admixture to reduce the heat of hydration if the specific
applications do not require early strength as in case of concrete
roads, dams and other marine structures. Research investigations
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
have shown that about 50% of the cement can be replaced by the
fly ash.
The production of Portland cement is not only costly and energy
intensive but it also produces large amounts of carbon
dioxide.With large quantities of fly ash available around the
world at low costs, the use of HVFA seems to offer the best
short term solution to rising cement demands.Also, lead points
which are points awarded based on environmental performance
are available for any mixture that replaces up to 40% of the
cement in concrete by fly ash.[5]
The improvement in the durability are the result of the reduction
in carbon hydroxide which is the most soluble of the hydration
products and from changes in the pore structure. This concrete is
more crackresistant thanconventional PCC due to the decreased
shrinkage.
Flyash affects the plastic properties of concrete by improving
workability, reducing water demand as well as segregation and
bleeding, and lowering heat of hydration. Flyash increases
strength, reduces permeability, reduces corrosion of reinforcing
steel, increases sulphate resistance, and reduces alkali-aggregate
reaction. Flyash reaches its maximum strength more slowly than
concrete made with only Portland cement. The techniques for
working with this type of concrete are standard for the industry
and will not impact the budget of a job.
2.3 Triple blend concretes
With established knowledge of improvementin durability in
concretes containinggood amounts of fly ash or blast-furnace
slag, or PPC/PSC, one of the main reasonspreventing their large-
scale use has been theslower gain of compressive strengths
atearly age. One method for overcoming thisslower strength
gain is to add another more rapidly reacting supplementary
cementious material like micro-silica. Thus thepotential long-
term durability and strengthimprovements may be obtained with
minimalimpact on early age strength [6]. This provides
attractive option for specifiers looking to decrease the time
before form-work may be removed, say particularly the
timebefore bridge decks can be opened to traffic laboratory
work on triple blend concretes(or ternary mixes as they are
called),has already started. To allow the morewidespread
adoption of such mixes, it isnecessary to build up a series of test
data on its performance to allow designers andspecifiers to make
informed choices withregard to the selection of raw materials
andtheir proportions.
2.5 Green Concrete
Most people associate GREEN concrete with concrete that is
colored with pigment. However, it is also referred which has not
yet hardened. But in the context of this topic, green concrete is
taken to mean environmentally friendly concrete. This means
concrete that uses less energy in its production & produces less
carbon dioxide than normal concrete is green concrete.
How green a product is? - The lower the embodied energy, the
greener the product.
The philosophy of green concrete, in fact of any green product is
based on the principle of optimizing its embodied energy i.e. on
689
ISBN: 978-81-924893-0-8
minimizing the energy spent to put it into its final functional
form. It therefore depends on the practices related to every stage
of its production.
Green concrete should follow reduce, reuse and recycle
technique or any two process in the concrete technology. The
three major objective behind green concept in concrete is to
reduce greenhouse gas emission (carbon dioxide emission from
cement industry, as one ton of cement manufacturing process
emits one ton of carbon dioxide), secondly to reduce the use of
natural resources such as limestone, shale, clay, natural river
sand, natural rocks that are being consume for the development
of human mankind that are not given back to the earth, thirdly
use of waste materials in concrete that also prevents the large
area of land that is used for the storage of waste materials that
results in the air, land and water pollution. This objective behind
green concrete will result in the sustainable development
without destruction natural resources.
For concrete, any practice which aids to reduce the energy
associated with its production, be it energy efficient cement
production, use of blended cements, savings made on
transportation of ingredients and direct use of recycled waste
contribute towards its greenness.
3. CONCLUSION
The major developments in the concrete technology are
discussed briefly in the paper. SCC is most widely adopted
concrete in the construction era and further research in its
strength parameters is going on. Also in future research the
concretes like bacterial concrete and Nano composites will find
suitable place. Fly ash concrete has solved the problem of
carbon dioxide liberation during the hydration process along
with a new kind of triple blend concrete has more strength
gaining in the early ages of the building. Also green concrete
may be preferred over normal concrete to minimize the
environmental impact.
REFERENCES
1. Technical BulletIN TB1500, “An Introduction to Self
Compacting Concrete.
2. Joost Walraven, Delft University, The Netherland. “Self
Compacting Concrete: challenge for designer and
researcher”
3. “Advantages of Structural Lightweight Aggregate
Concrete”. Expanded Clay, Shale and Slate
Institute,www.escsi.org
4. Leming, M.L. “Creep and Shrinkage of Lightweight
Concrete”. Department of Civil Engineering, North
Carolina State University at Raliegh, North Carolina. April
16,1990.
5. K. U. Muthu, M. S. Ramaiah Institute of Technology,
INDIA. “Emerging Trends in Concrete Technology and
Structural Concrete”
6. TIWARI, A.K. and ILLYAS, MOMIN Improving early age
strength of PSC with indigenous silica fume, The Indian
Concrete Journal, October 2000, Vol 74,No 10, pp. 595-
598.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
FEASIBILTY OF FLYOVER ON UNSIGNALISED
INTERSECTION
Abhishek singla
Research scholar
Giani Zail Singh Campus, Bathinda
INTRODUCTION
The rapid urbanization and growth of
private vehicle ownership have caused an
increase in road traffic congestion and
degradation of level-of-services in most of
the urban areas in India. As a result, there
has been an increasing need for providing
relief of urban traffic through
provisions of adequate transport structure.
In recent years, efforts have
intensified for providing new roads and
widening of existing roads in many urban
areas. However, because of the frequent
roadside encroachments, non-availability
of land etc., it has been practically possible
to provide new roads or even additional
traffic lane in all situations. As a result,
there are a number of roads in urban areas
where the widening has been done
partially and these roads do not satisfy the
standard lane dimensions. The growing
mismatch between the road infrastructure
and vehicle population has led to the
traffic congestion, the reduced level-of-
service, an increase in road accidents and
environmental pollution. The study stretch
of NH-5 (Formerly known as NH-95)
ISBN: 978-81-924893-0-8
Gurpreet Singh Bohar Singh Dapinder Deep Singh
Department of Civil Engineering
Shaheed Bhagat Singh State Technical Campus
Ferozepur.
caters to both urban and regional traffic.
For the present study, an unsignalised
intersection lying on NH-5 at Moga town
has been undertaken. In the absence of a
bypass, the regional traffic carries heavy
vehicles, especially freight moves through
this corridor. As there is a restriction for
the freight movement during daytime, this
stretch remains busy during night time as
been well.
The objective of the study is to understand
the traffic operations on such roads in
terms of road congestion and level-of-
service characteristics; and thereby explore
the benefits such as increase in road width,
construction of Elevated Bypass, etc.
IDENTIFICATION OF PROBLEMS
The following problems are generally on
the urban roads
1. Congestion
2. Construction Problems
3. Utility Services
4. Road Surface at Intersection
5. Repair of Roads
6. Pollution
690
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

OBJECTIVES OF THE STUDY 2. Traffic Engineering today is much

1. To study the existing travel pattern larger a challenge due to the

on the study stretch. following reasons:

2. To conduct necessary traffic 3. The need to have designs which

studies on the selected stretch of are eco-friendly.

the road. 4. The need of faster development

3. To analyze the data and sustainable designs for

4. To provide proposal for reducing longetevity, due to ever-growing

the traffic congestion need of the present day economy.

PASSENGER CAR UNIT (PCU)

REVIEW OF LITERATURE 1. This is one of the fundamental

1. Traffic Engineering, is an measures of traffic on a road

important aspect for the traffic system. It indicates the volume of

engineers, which dictates the traffic using the road in the given

achievement of safe, efficient and interval of time.

convenient movement of the 2. Table 1 provides the guidelines

persons and goods. Traffic for the values adopted for

engineering in INDIA is a different categories of transport

complex issue due to available modes available in the country for

different modes of traffic ranging urban roads. The Indian Road

from the slowest, in the form Congress (IRC) lays down these

human/animal drawn carts, to the values. Refer MORT&H

fastest of the four wheelers. Handbook on Highway

Engineers, 2002.
3.
TABLE-1: PCU EQUIVALENT-URBAN AREA

Sr. Vehicle Type Equivalent PCU Factor % Composition

No. of Vehicle type in Traffic Stream
5% 10%
Fast Vehicles
1. Two-wheelers Motor cycles and Scooters 0.50 0.75
2. Passenger Cars, Pick-up Van 1.00 1.00
3. Auto-Rickshaws 1.20 2.00

691
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4. Light Commercial Vehicle 1.40 2.00

5. Truck of Bus 2.20 3.70
6. Agricultural Tractor-Trailer 4.00 5.00
Slow Vehicles
7. Cycles 0.40 0.50
8. Cycle-Rickshaws 0.50 2.00
9. Horse Driven Vehicles 1.50 2.00
10. Hand Cart 2.00 3.00

FUTURE TRAFFIC. P = the Volume count of the

1. Future traffic projections based on available year or current year.
previous or present day traffic r = the rate of growth of traffic
volume studies is necessary for an per year usually taken as 0.075.
estimate of the efficacy of the n = the number of years, usually
existing facilities, improvements taken as Zero.
required, if any.
2. In addition, the projection of traffic DATA COLLECTION AND
can lead to policy decision with ANALYSIS:
respect to requirements of bypasses
to city centers and increasing the METHODS AVAILABLE FOR
road capacities. TRAFFIC COUNTS
3. The formula applied for calculation
i. Manual methods
of the projected traffic volume for
ii. Combination of manual and
the next ten years is as under:
mechanical methods
A =
iii. Automatic devices
P (l+r) ^ n+10
iv. Moving Observer method
Where
v. photographic methods
A = the projected Traffic
Volume.

692
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
STUDY OF THE UNSIGNALISED
INTERSECTIONS
1 THE BHUGHIPURA CHOWK
MOGA
1.1 TRAFFIC VOLUME STUDY (0830-
1030 Hours) : WEEK DAY. The traffic
volume count for the whole of a working
day was conducted. It was found that the
peak volume in the morning existed during
the time 0830-1030 hours. The figures so
obtained have been reflected in Table 2.
For traffic flow diagram, refer Figure 1
1.2 TRAFFIC VOLUME STUDY (1030-
1230 Hours) : WEEK DAY. The traffic
volume count for the whole of a working
day was conducted. It was found that the
peak volume in the morning existed during
the time 1030-1230 hours. The figures so
obtained have been reflected in Table 3
For traffic flow diagram, refer Figure 2.
1.3 TRAFFIC VOLUME STUDY (1230-
1430 Hours) : WEEK DAY. The traffic
volume count for the whole of a working
day was conducted. It was found that the
693
ISBN: 978-81-924893-0-8
peak volume in the afternoon existed
during the time 1230-1430 hours. The
figures so obtained have been reflected in
Table 4 For traffic flow diagram, refer
Figure 3.
1.4 TRAFFIC VOLUME STUDY (1430-
1630 Hours) : WEEK DAY. The traffic
volume count for the whole of a working
day was conducted. It was found that the
peak volume in the evening existed during
the time 1430-1630 hours. The figures so
obtained have been reflected in Table 5
For traffic flow diagram, refer Figure 4.
1.5 PROJECTED FUTURE TRAFFIC
VOLUME GROWTH. The future traffic
growth for the intersection through the
years 2011-2016 has been projected as per
Table 6. It shall be seen that the most
affected approach i.e. the LUDHIAN-
MOGA approach will cross a figure of
15,000 by the year 2037. The growth has
been presumed at the existing rate of %. It
is a fact that this kind of volume of traffic
is beyond the handling scopes of a
signalized intersection
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

TABLE-2: TRAFFIC VOLUME STUDY AT THE BHUGIPURA CHOWK, MOGA

WEATHER:- GOOD
DATE:- 23 -27AUG 2011
ROAD SURFACE:- GOOD
TIME:- 08:30 - 10:30 hrs
PEAK HOUR:-09:00-10:00
TRAFFIC ENTERING INTERSECTION FROM
PCU ASR. -JAL.
Sr. VEHICLE LUDHIANA MOGA BARNALA
FAC BYPASS
No. CLASS
TOR L S R L S R L S R L S R
1 CYCLE 0.5 77 114 64 85 101 68 74 92 69 108 68 72

CYCLE
2 2.0 71 69 89 72 65 119 65 97 73 82 72 66
RICKSHAW
TRACTOR
3 4.0 62 157 120 161 190 147 95 106 97 109 104 120
TROLELY

4 CAR 1.0 101 328 107 162 335 187 156 111 114 99 62 101

5 BUS 2.2 40 153 37 43 132 59 37 27 48 46 22 38

6 TRUCK 2.2 47 99 85 52 155 71 115 107 114 120 115 151

2-
7 0.75 100 210 113 219 182 206 193 161 192 146 112 205
WHEELER
AUTO (3-
8 1.2 61 97 91 85 114 92 87 79 87 91 85 82
WH)

9 TOTAL PCU/hr 560 1227 706 879 1274 949 822 780 794 801 640 835

10 G.TOTAL PCU/hr 2543 3102 2396 2276

11 % LEFT TURNING 23.98 28.33 34.3 35.19

% RIGHT
12 27.76 30.59 33.13 36.68
TURNING
TOTAL PEAK HOUR VOLUME AT INTERSECTION -10317

Where, notations L means Left

R means Right

S means Straight

694
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

TABLE-3: TRAFFIC VOLUME STUDY AT THE BHUGIPURA CHOWK, MOGA

WEATHER:- GOOD
DATE:- 23-27 AUG 2011
ROAD SURFACE:- GOOD
TIME:- 10:30 - 12:30 hrs

PEAK HOUR:-11:00-12:00
TRAFFIC ENTERING INTERSECTION FROM
PCU ASR. -JAL.
Sr. VEHICLE LUDHIANA MOGA BARNALA
FAC BYPASS
No. CLASS
TOR L S R L S R L S R L S R

1 CYCLE 0.5 66 102 61 84 93 64 63 69 61 93 65 64

CYCLE
2 2.0 77 71 91 73 69 103 61 85 67 74 107 113
RICKSHAW
TRACTOR
3 4.0 82 138 102 123 145 104 103 72 84 88 64 107
TROLELY

4 CAR 1.0 89 236 96 145 255 113 136 98 101 71 47 82

5 BUS 2.2 37 127 41 57 105 40 25 16 31 37 29 42

6 TRUCK 2.2 31 74 58 45 126 52 79 62 56 84 73 104

2-
7 0.75 85 183 101 193 127 178 157 134 145 113 97 107
WHEELER
AUTO (3-
8 1.2 82 103 86 81 92 88 83 72 79 89 81 77
WH)

9 TOTAL PCU/hr 549 1034 636 801 1012 742 707 608 624 649 563 696

10 G.TOTAL PCU/hr 2219 2556 1939 1908

11 % LEFT TURNING 24.74 31.34 36.46 34.01

% RIGHT
12 28.66 29.02 32.18 36.47
TURNING

TOTAL PEAK HOUR VOLUME AT INTERSECTION -8622

695
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

TABLE-4: TRAFFIC VOLUME STUDY AT THE BHUGIPURA CHOWK, MOGA

WEATHER:- GOOD
DATE:- 23-27 AUG 2011
ROAD SURFACE:- GOOD
TIME:- 12:30 - 14:30 hrs
PEAK HOUR:-12:45-13:45
TRAFFIC ENTERING INTERSECTION FROM
PCU ASR.-JAL.
Sr. VEHICLE LUDHIANA MOGA BARNALA
FAC BYPASS
No. CLASS
TOR L S R L S R L S R L S R

1 CYCLE 0.5 68 109 70 69 106 69 76 87 69 115 73 65

CYCLE
2 2.0 86 106 83 78 63 114 65 93 74 72 79 73
RICKSHAW
TRACTOR
3 4.0 88 99 103 144 164 89 109 92 67 38 77 71
TROLELY

4 CAR 1.0 96 168 93 119 172 158 64 59 82 91 84 57

5 BUS 2.2 47 81 48 35 112 59 41 37 59 36 42 53

6 TRUCK 2.2 38 73 67 34 72 109 93 98 64 71 58 99

7 2-WHEELER 0.75 96 224 103 146 123 185 146 283 181 102 132 193

AUTO
8 1.2 81 101 85 89 127 87 82 76 76 67 71 84
(3-WH)

9 TOTAL PCU/hr 580 961 654 714 939 868 678 825 673 592 617 695

10 G.TOTAL PCU/hr 2193 2521 2176 1899

11 % LEFT TURNING 26.44 28.32 31.15 31.17

% RIGHT
12 29.73 34.43 30.92 36.33
TURNING

TOTAL PEAK HOUR VOLUME AT INTERSECTION -8789

696
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

TABLE-5: TRAFFIC VOLUME STUDY AT THE BHUGIPURA CHOWK, MOGA

WEATHER:- GOOD
DATE:- 23 -27AUG 2011
ROAD SURFACE:- GOOD
TIME:- 14:30 - 16:30 hrs
PEAK HOUR:-15:30-16:30
TRAFFIC ENTERING INTERSECTION FROM

PCU ASR-JAL.
Sr. VEHICLE LUDHIANA MOGA BARNALA
FAC BYPASS
No. CLASS
TOR L S R L S R L S R L S R

1 CYCLE 0.5 70 105 67 84 96 66 66 71 69 99 66 69

CYCLE
2 2.0 81 68 89 76 72 114 64 92 73 78 70 64
RICKSHAW
TRACTOR
3 4.0 75 126 97 131 151 119 107 79 89 98 95 111
TROLELY

4 CAR 1.0 82 301 14 160 271 127 148 105 107 84 52 89

5 BUS 2.2 42 100 63 57 127 63 36 27 36 34 21 31

6 TRUCK 2.2 34 79 52 47 148 59 85 69 65 95 103 109

7 2-WHEELER 0.75 87 194 96 198 129 187 161 139 157 124 105 169

AUTO
8 1.2 75 85 92 87 109 96 89 76 87 99 87 85
(3-WH)

9 TOTAL PCU/hr 546 1058 570 841 1103 831 756 658 683 711 599 727

10 G.TOTAL PCU/hr 2174 2775 2097 2037

11 % LEFT TURNING 25.11 30.31 36.05 34.9

% RIGHT
12 26.21 29.95 32.57 35.68
TURNING
TOTAL PEAK HOUR VOLUME AT INTERSECTION-9083

697
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

TABLE-6: PROJECTED FUTURE TRAFFIC AT THE BHUGHIPURA CHOWK

(BASIS MAXIMUM PCU)
Sr. APPROACH TIME CLOCK YEARS
No. OF TIMINGS 2011 2016 2021 2026 2031
DAY (HOURS)
1. LUDHIANA FN 0830-1030 2543 3561 5339 5375 10681
AN 1230-1430 2193 4471 4518 6360 9211
2. MOGA FN 0830-1030 3102 4342 6391 8996 13028
AN 1230-1430 2521 3540 5154 7311 10588
3. BARNALA FN 0830-1030 2396 3354 4936 6949 10063
AN 1230-1430 2176 3046 4483 6311 9140
4. ASR-JAL BYPASS FN 0830-1030 2276 3186 4689 6601 9559
AN 1230-1430 1899 2659 3912 5508 7976
5. TOATAL FOR FN 0830-1030 10317 14423 21255 29921 43331
INTERSECTION AN 1230-1430 8789 13716 18067 25490 36935

1. PROJECTION BASED ON FORMULAE: A=P(l+r)n+10where, A=Projected traffic; P=Present

Traffic; r=rate of growth=0.075; n=Zero.
.

698
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

FIGURE 1: TRAFFIC FLOW DIAGRAM(PCU/hr) AT THE BHUGHIPURA

CHOWK WEEK DAY: 0830-1030

699
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

FIGURE 2: TRAFFIC FLOW DIAGRAM(PCU/hr) AT THE BHUGHIPURA

CHOWK WEEK DAY: 1030-1230

700
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

FIGURE 3: TRAFFIC FLOW DIAGRAM(PCU/hr) AT THE BHUGHIPURA

CHOWK WEEK DAY: 1230-1430

701
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

FIGURE 4: TRAFFIC FLOW DIAGRAM(PCU/hr) AT THE BHUGHIPURA

CHOWK WEEK DAY: 1430-1630

702
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
CONCLUSIONS.
It is known fact the user of any asset is most
affected by the infrastructure development.
The irony is that little attention is paid to this
aspect by the hierarchy of the decision making
body. The aspects of planning, money
allocation and execution of any works need to
be coordinated and need to be far-sighted so
that the assets once created have a long life
and can be cost-effective.
The traffic engineers involved in the
nation building, therefore, have a major role to
play, both in the planning as well as the
execution stage. The planning needs to be as
dynamic as possible with the parameters of
planning based on wider scopes of road user's
requirements.
An input of the nature as discussed in
this money is pumped into projects which
otherwise would have a far-reaching
consequence of being cost in-effective. There
is, therefore a need to look at planning and
execution aspects, so that the road user's
requirements are met with the remain satisfied
over at least the life of the asset created. It is
only then that the asset so created would be
termed as cost effective.
TRAFFIC VOLUMES OF
APPROACHES AND THAT OF THE
UNSIGNALIZED INTERSECTIONS. The
summary of the values of the traffic volumes
in terms of PCU/hr for the intersection, under
study, has been considered. It is evident that
the volumes in the two major approaches for
ISBN: 978-81-924893-0-8
the intersection on five days of the week have
almost busted the laid down volumes. The
effect will worsen every year, keeping the
growth pattern of the traffic in mind.
THE BHUGHIPURA CHOWK. During the
peak hours, the traffic volumes on the two
major approaches i.e. Ludhiana and Moga are
in the range of 10,400. Flyovers need to be
planned, if the approach traffic volumes are
beyond 10,000. The approach volume on the
Asr-Jal bypass side is 22,00 and on the
Barnala side, the same is about 24,00. These
figures are for the year 2011. The situation of
traffic density is going to increase at the rate
of 37% every year, if not more.
RECOMMENDATIONS
1. On the basis of comparison of alternatives
and conclusion drawn above, it is evident
that for providing long-term solution to the
traffic congestion, we should go for lane
elevated highway for the entire study
stretch.
2. Bhughipura junction should be improved
by channelization and signalization as the
peak traffic volume from all legs is very
close to the prescribed limit of warrant for
THE
grade separation intersection.
REFERENCES
1. Khanna S.K. and Justo C.E.G.,
"Highway Engineering", Nem Chand
& Bros, 20091.
703
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

2. Kadiyali L.R., Traffic Engineering and VOL. 129, No.2, pp. 155-160, March
Transport Planning, Khanna 1,2003.
Publishers, 2003. 10. Farouki, O.T., and Nixon, W.J. (1976),
3. M.O.R.T. & H., Pocket Book for “ The Effect of Width of Suburban
Highway Engineers, IRC, 2002. roads on the Mean-free Speeds of
4. IRC: 11-1962: "Recommended Car”. Traffic Engg. Control, pp. 518-
Practice for the Design and Layout of 519.
Cycle Tracks" (Second Reprint), The 11. Gupta, Aman (1999), „Traffic Flow
Indian Road Congress. Analysis And Level- of- Service
5. IRC: 65-1976: "Recommended Evaluation of NH-1”, ME (highways)
Practice for Traffic Rotaries" (Reprint thesis, PEC, Chandigarh.
September 2002), The Indian Road 12. Hossain, M., and Iqbal, G.A. (1999),
Congress. “Vehicular Headway Distribution
6. IRC: 70-1977: "Guidelines or And Free Speed Characteristics of Two
Regulation and Control of Mixed Lane Highway of Bangladesh‟. Inst.
Traffic in Urban Areas" (Reprinted Engg. (India), pp. 77-80.
November 2002), The Indian Road 13. Leong, H.J.W. (1968) “Distribution and
Congress. Trend of Free Speed on Two Lane Two
7. IRC: 92-1985: "Guidelines for the Way Rural Highway in New South
Design of Interchanges in Urban Wales”. Proc., 4th ARRB Conf., Part-1,
Areas" December 1985, The Indian Australian Research Board, pp. 791-
Road Congress. 814.
8. IRC: 106-1990: "Guidelines for 14. Maitra, B., Sikdar, P.K. and Dhingra,
Capacity of Urban Roads on Plain S.L. (1999). “Modelling Congestion on
Areas" November 1990, The Indian Urban Roads and Assessing Level-of-
Road Congress. Service”, Journal of Transportation of
9. Chandra, Satish and Kumar, Upendra Engineering, ASCE, VOL. 125, No. 6,
(2003), “Effect of Lane wide on pp. 508-514, November/December,
Capacity under Mixed Traffic 1999.
Conditions in India”, Journal of
15. The Moga Web Site, e-Sampark.
Transportation of Engineering, ASCE,
16. The Moga Traffic Police Web Site
.

704
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Application of Geoinformatics in Automated Crop Inventory
Sandeep Kumar Singla Dr. O. P. Dubey
Research Scholar Professor
Department of Civil Engineering Department of Civil Engineering
Indian Institute of Technology Indian Institute of Technology
(IIT Roorkee) (IIT Roorkee)
sandy.dce2014@iitr.ac.in opdubey11@gmail.com
ABSTRACT
An attempt has been made in this study to review the role of
geoinformatics to discriminate different crops at various
levels of classification, monitoring crop growth and prediction
of the crop yield. The suitability of geoinformatics techniques
suited to Indian conditions has also been assessed.
Development in applications of computers and information
technology has enhanced the capability of gathering huge and
mottled data as well as information, ranging from historical
data, ground truth values and aerial photography to satellite
data. Thus remote sensing data and the information derived
from it, is attractive to agricultural management system in the
India. It is concluded that, in addition to the remote sensing
technology, the use of many other techniques such as ground
observations, reviews, GIS and soil analysis is highly
appreciable.
Keywords
Remote Sensing, Crop Yield, Geoinformatics, GIS, GPS,
RDBMS, Satellite Data, crop inventory, crop models.
1. INTRODUCTION
India covers contains about one fourth of earths geographical
area, whereas it caters about one seventh of world population.
Food grain demand is gradually increasing due to escalating
population, improved socio economic conditions and food
habits. Prognostic study indicates that in approaching 30 years
the food grain production has to be doubled to meet out the
growing need. Food grain production depends upon a variety
of earth factors. These factors may be clubbed as, above
surface, surface and below surface parameters. For optimal
and sustained food grain production new methods, monitoring
techniques and predictive crop growth and yield model are
always welcomed. Generally the required data for monitoring,
evaluation, and modelling is not available or insufficient.
Therefore there is pressing need to update and generate the
required data and automated crop inventory using the
contemporary capabilities of geoinformatics.
Geoinformatics may be broadly defined as the combination of
technology and science dealing by means of the spatial
information, its acquisition, its qualification and classification,
its processing, storage and dissemination. Geo-informatics is
an integrated tool to collect process and generate information
from spatial and non spatial data. Geoinformatics is an
appropriate blending of modules like Remote Sensing (RS),
Global Positioning System (GPS), Geographical Information
System (GIS) and Relational Data Base Management System
(RDBMS).
Data collected by remote sensing system and some other
means is processed, managed, analyzed and disseminate by
Geographical Information System (GIS). RS is the technology
used to acquire information regarding an object, a process and
some phenomena without being in contact. RS is generally
based on information collected from satellites or airplanes,
705
ISBN: 978-81-924893-0-8
Dr. R. D. Garg
Associate Professor
Department of Civil Engineering
Indian Institute of Technology
(IIT Roorkee)
garg_fce@iitr.ac.in
using sensors operating in various parts of the electromagnetic
spectrum. GPS tools are used to acquire particular
measurement of an object’s position in terms of latitude,
longitude and altitude. These technologies endow with a cost
effective way to study the atmosphere, geosphere and
biosphere interactions at global scale whereas at micro scale
also, space technology exhibits appropriate inputs for optimal
use of available natural resources.
To keep an eye on the changes in the crop cover using remote
sensing and modelling crop growth, crop yield and drafting
agricultural practices for optimal crop yield using GIS is a
good example of micro and macro-level applications.
Relational Data Base Management System (RDBMS) is
software that manages the data to produce relevant
information in a very effectual manner. Outputs of geo-
informatics provide a superb solution for the modeling and
monitoring of crop at a range of scales and thus support
planning and management of agricultural resources.
It is established fact that agricultural research has been
benefited from conglomeration of technological advances
largely developed for other industries. The industrialization
brought mechanization and chemical fertilizers to agriculture.
The technological development has offered efficient
agricultural practices including genetic engineering and
automation for more food per unit of natural resources. The
information technology improved the potential for integrating
the technological and industrial advances into sustainable
agriculture production system. The application of the
computer in agriculture research initially exploited for the
adaptation of statistical formula or complex model in digital
form for simple and precision agriculture.
Currently computers are being used for automation and to
expand decision support systems (DSS) for the agricultural
production and fortification research. Recently geographic
information systems and remote sensing technology has come
up with a capable role in agricultural research predominantly
in crop yield prediction in addition to crop suitability studies
and site specific resource allocation.
In this paper an attempt has been made to review the role of
Geoinformatics to discriminate different crops at various
levels of classification, monitoring crop growth and prediction
of the crop yield. The suitability of geoinformatics techniques
suited to Indian conditions has also been assessed.
The planning and management of agriculture goad to optimize
the food production per unit of natural resources. Information
captured on soil and water conservation and acreage
estimation of different crops using recent technologies such as
remote sensing and GIS may lead to optimal agricultural
production. Laboratory and farm level studies has clearly
brought out the fact that adaptation of integrated land water
and crop management practices, integrated manure and pest
management practices have positive impact on augmenting
the agriculture production.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Information related to agricultural inputs collectively with
reliable data on already existing acreage and land under a
range of crops, types of soils and problems related to soils,
water availability in irrigation systems and management of
natural and other crop related disasters will facilitate evolution
of suitable strategies to keep going the pace of developments
in agricultural research.
The kind of information thus needed to develop a computer
system included (1) crop signature tables showing the upper
and lower limits of crop color variation at various crop ages,
(2) physical factors such as climate, soils, salts problems (3)
cultural factors such as location of producing area to markets,
land costs, export crops, farming patterns (4) a land use code
(5) base maps and (6) a crop calendar of the area.
With a view to handle these complex problems, the
technology based on remote sensing provides a number of
benefits over conventional methods. The benefits include ease
of use and multi spectral data for providing passionate
information, potential to provide multi temporal data to give a
picture of long term and seasonal changes and availability of
descriptions with minimum distortion.
Development in the information technology has enhanced the
capability of gathering huge and mottled information, ranging
from historical data and aerial photography to space borne
data, ground truth values and other forms of ancillary data. In
addition to remote sensing, we should comprehensively
employ many other techniques such as GPS, GIS, ground
observations and soil analysis in order to get quality
estimation of crop yield management system in the India.
2. APPLICATION AREAS
From a limited study it has been found that Geoinformatics
can support the development and intensification of the quality
of agricultural research. Applications and contributions of
geo-informatics are very significant largely in the areas of
crop yield estimation, spatial modeling, spatial sampling,
classification, integrated surveys and web based applications.
2.1 Crop Yield Estimation
Estimation of Crop yield well before the harvest at regional
and national scale is imperative because of the budding need
for the planning at micro-level and predominantly the demand
for crop insurance (Anup et al. 2005). Crop yield estimation
plays a significant role in economy development (Hayes and
Decker, 1996). Currently it is being done by extensive field
surveys and crop cutting experimentation. This enables
decision makers and planners to predict the amount of crop
import and export. In most of the developing countries the
crop yield estimation is generally based on traditional
methods of data collection which is based on ground based
field surveys (Reynolds et al. 2000).
Conventional methods have been found to be expensive, time
consuming and are prone to large errors due to incomplete and
inaccurate ground observations, leading to deprived crop area
estimations and crop yield assessment. In most of the
developing countries the required data is generally available
too late for any appropriate decision making. Objective,
consistent and possibly inexpensive and or faster methods that
can be used for monitoring of crop growth and an early
estimation of crop yield are imperative. Data captured through
remote sensing has the prospective, capacity and the potential
to exhibit spatial information at global scale.
706
ISBN: 978-81-924893-0-8
3. DIFFERENT APPROACHES
This section briefly portrays the different approaches and
technologies used for crop inventory.
3.1 Aerial Photography
To obtain crop yield information, one must be able to
recognize tone, pattern, texture and other features. Crop yield
information is used in conjunction with crop acreage statistics
to obtain crop production. There are two distinct aspects of
yield determination (1) the forecast of yield based on
characteristics of the plant or crop and relationship based on
experience in prior years, and (2) estimates of the yield known
from the actual weight of the harvest crop for the current year.
After the World War II various researchers used the emerged
concept of aerial photography for the optimized use of
resources for the agriculture and crop inventory.
Goodman (1959), used black and white photography for crop
identification. Author developed the techniques primarily
based on ground appearance and the equivalent aerial
photographic form of selected fields at nine intervals during
the growing season.
Goodman (1964) used three sets of criteria that can be read or
inferred from aerial photographs, that serve as indicators for
crop identification (1) farmstead features such as barns,
granaries, and silos; (2) crop associations; and (3) the uses
that are made of particular crops.
Anson (1966) found that CIR photography have more impact
than black & white and color photographs for the extraction of
vegetative details. It permits making a ready peculiarity
between soil and vegetation that is not always possible using
black & white photography. The background can be
approximately has the same tone as the plants in case of black
and white photograph, making photo interpretation more
difficult.
Various researchers in the past found that use of photographs
or spectral values is an important information source for
predicting crop yields and has been focused on the
possibilities of forecasting yield from plant measurements.
Houseman and Huddleston (1966) cite results which have
been promising form making forecast of field crops such as
cotton, maize, wheat, soybeans and a typical example is cited
by Small (1967) for tree crops such as walnuts, oranges and
filberts.
Johnson et al. (1969) identified crops based on the image
color and developed a computer land use mapping system.
The authors indicate that overall poor results were due to
color variations based on seasonal crop variations and film
quality control.
In a photographic study by Roberts and Gialdini (1970) nine
crops were grown in small plots to evaluate tone differences
resulting from differences in the radiation reflected from the
vegetation only and not confounded by radiation reflected
from the soils through varying degrees of canopy closure. It
was shown that no single film filter combination can be used
to discriminate among all the crops.
Yost et al (1970) attempted to extract land use information by
making quantitative colorimetric measurements of additive
and subtractive color infrared film. Additive color was found
to be the best method for discrimination, separation positives
and color infrared were second and third, respectively. The
brightness or density of the image was not effective for
identification.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Coleman et al. (1974) utilized the photography to attempt to
show a more cost effective method of detecting and
subsequently regulating cotton farming practices to aid in the
control of pink bollworm. Researchers also had shown that
for the purpose of identification of crops the higher the
availability of temporal data and higher will be the expected
accuracy.
3.2 Multispectral Scanners
Multispectral scanners (MSS) have certain advantages and
disadvantages when compared to photography. Landgrebe et
al. (1967) showed the ability to differentiate wheat from other
agricultural crops using multispectral data in a computer
format with pattern recognition techniques. An important
consideration in the task of species identification is the stage
of growth of the crop.
Early work at LARS (Laboratory for Applications of Remote
Sensing) at Prudue University showed the easy separability of
MSS data into the broad surface-feature grouping of green
vegetation, water and bare soil (Kristof, 1969). The
identification and mapping of specific crop species requires
the acquisition of sufficient and accurate ground observations
as training sets for computer implemented analysis.
Hoffer and Goddrick (1971) demonstrated that the influence
of geographic area is closely related to changes in the crop
maturity. They used MSS data over four flight lines extending
across 100 miles of agricultural land in central Illions and
were able to separate wheat from other crops with over 90
percent of accuracy on test fields.
3.3 Radar
The advantages and limitation of using either airborne or
spacborne radars fro crop identification are discussed by
Morain et al., (1970). He points out that many of the radar
studies have concentrated on seasonal change between crops
and that numerous variables must be considered in making
even the simplest determinations.
Morain and Coiner (1970) and Schwarz and Caspall (1968)
worked with imagery from Radar, they shown that major
agricultural crops can be segregated, though not
unambiguously identified, using simple two-dimensional plots
of HH and HV films.
3.4 Satellite Data
Estimation models for Crop area and yield have been studied
for a long time, and numerous good quality models have been
developed, but these conventional models have been
developed primarily from the point of view of meteorology
and biology without concern of remote sensing, and thus
cannot meet the requirements of today's society. The
utilization of remote sensing data for agricultural development
was investigated in the USA in 1971 under Corn Blight Watch
Experiment (CBWE). The remote sensing data has been
proven effective in predicting crop yield and provide
representative and spatially exhaustive information on the
development of the model for the crop growth monitoring.
Another experiment carried out using Landsat data was
CITARS - Crop Identification Technology Assessment for
Remote Sensing. It aimed at identification of two major crops
corn and soybean and testing the concept of signature
extraction.
Large area crop inventory Experiment (LACIE) carried out
during 1974-78 was a major international study carried out in
major wheat growing areas of the world. The models used in
LACIE were statistical models, in which yields is modeled as
707
ISBN: 978-81-924893-0-8
function of air temperature and rainfall and the project was
reported one of the first examples in which production is
forecasted through satellite remote sensing and measured
meteorological observations on the ground (Doraiswamy et
al., 2003).
As of today a large number of researchers and academicians
are working for methodological expansion in field of
investigation. In India remarkable spurt in the remote sensing
activities has started with the launch of the IRS (Indian
Remote Sensing Satellite) 1A in the year 1988. India launched
a variety of satellites devoted to particular area of relevance
such as ResourceSat, CartoSat, and OceanSat.
The remote sensing data has been proven effective in
predicting crop yield and provide representative and spatially
exhaustive information on the development of the model for
the crop growth monitoring. Various indices based on remote
sensing have been employed to estimate the yield of several
types of crops. For instance, the normalized difference
vegetation index (NDVI) has been used to estimate the yield
of rice (Rouse et al., 1974). However, yield estimation with
remote sensing has limitations, mainly due to the indirect
nature of the link between the NDVI and biomass but also due
to the sensor spatial resolution or insufficient repeat coverage.
Tucker et al. (1980) used ground - based spectral radiometers
to identify the relationship NDVI and crop yield and proved
the high correlation among the crop yields and NDVI. Das et
al. (1993) used greenness and transformed vegetation indices
to predict wheat yield at 85–110 days before harvest in India.
These early studies led to crop yield estimation in several
countries using satellite imagery.
Lennington and Sorensen, 1984, Mccloy et al., 1987, Gallego
et al., 1993, proposed the models based primarily on remote
sensing, that congregate the requirements for speed quality
and macro management over large areas. The studies also
proved that these are different from the traditional models.
Rudoff and Batista (1990) estimated sugarcane crop in Brasil
using remote sensing and an agrometeorological model based
on a model developed by Doorenbos and Kassam (1979)
where yield is related to multiple regression approach used to
integrate the vegetation index from Landsat and the yield
from the agrometeorological model. Such estimations
explained 50, 54 and 69 percent of the yield variation in the 3
growing seasons analyzed. The authors also tested the
accuracy of sugarcane yield estimations using only the RS or
the agrometeorological model only. The results were poorer
compared to the combinations of both (Rudorf and Batista,
1990).
Goyal (1990) carried out a study in Sultanpur district of Uttar
Pradesh to assess the crop area and yield estimation. The
study demonstrated that remote sensing satellite spectral data
and consequent vegetation indices can be used for the
mapping. Conjunctive use of satellite derived information and
the ground based yield data have enhanced the estimation of
crop yield. For this study the Landsat (Thematic Mapper-TM)
satellite data and the crop yield data from crop cutting
experimentation have been used. It was observed that NDVI
as compared to RVI (Ratio Vegetation Index) exhibits higher
capability to classification of vegetation vigor and estimation
of crop yield. An effort was also made to enumerate the effect
of the misclassification. An attempt was also made to
investigate the worth of spectral data in forecasting the crop
yield and the correlation between wheat yield and the spectral
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
parameters acquired through the hand held spectral
radiometers.
Singh and Goyal (1993), Singh and Goyal (2000) and Singh et
al. (2002) carried out extensive study for estimation of wheat
crop yield for Rohtak district in Haryana. They used data from
the crop cutting experiments of the year 1995 and 1996 and
multi spectral data from the IRS-1B (LISS II) data for 17th
February, 1996. Estimation of crop yield by means of indices
RVI and NDVI have been observed. The efficiency of the
observed estimation as compared to the usual estimator
worked out to be 1.42 and 1.28 respectively. The proposed
model also confirmed that the estimation of crop yield at
district level may be obtained by dropping the number of crop
cutting experiments to nearly 2/3 with no loss in the precision
and thus ensuing the savings in cost. The study also
demonstrated that synthetic estimator is more good at your job
as compared to the direct estimator and the standardized error
of the direct estimator as well as synthetic estimator at Tehsil
level is within 5 per cent.
The NDVI from the National Oceanic and Atmospheric
Administration – Advanced Very High Resolution
Radiometer (NOAA–AVHRR) amid spatial resolution of
1000 m exhibits a strong correlation with wheat yield in Italy
(Benedetti and Rossini, 1993).
A large number of studies observed that as compared with
low-temporal resolution measurements, high-spatial
resolution sensors can more accurately forecast crop yield.
Hamar et al., (1996) proposed a linear regression model to
forecast corn and wheat yield at regional scale. The model
was purely based on vegetation spectral indices obtained
using Landsat (MSS) data.
Gupta (2002) developed an incorporated methodology for
estimation of wheat crop yield utilizing the survey data from
the crop cutting experiment as well as the spectral data from
the satellite obtained as NDVI. The study also demonstrated
that the usefulness of remote sensing data associated with the
crop yield parameters from crop cutting experiments can
greatly enhance the efficiency of the estimation methods of
crop yield for small area.
(Langley et al. 2001; Nordberg and Evertson 2003) explored
the crop cover changes over large areas and shown that the
remote sensing technology offers a realistic and economical
means. The technology of remote sensing extends possible
data collection from current time to over more than a few
decades back as well as its potential capacity for systematic
interpretation at a range of scales. Due to this fact the colossal
efforts have been made by application specialists and
researchers to delineate crop cover from local scale to global
scale by using remote sensing data. Jung et al. 2006,
highlighted the different mapping approaches with their
strong points and weaknesses.
Ahmad et al., 2003 developed a technique that supports GIS
for the identification of different crops in Yamunanagar
district of Haryana. In this paper the different factors
responsible for crop growth were recognized, index for the
suitability by means of Spatial Analytic Hierarchy Process
was identified and captured. Obtained index was also
compared with the Composite development index.
Ferencz et al., 2004, presented two methods for estimating the
yield of different crops in Hungary using remote sensing data
of Landsat (Thematic Mapper). The requirement of the pre
processing steps like atmospheric, geometric, radiometric and
scattering correction has also been discussed. They used a
708
ISBN: 978-81-924893-0-8
new vegetation index GYURI - General Yield Unified
Reference Index based on fitting of double Gaussian curve to
the NOAA-AVHRR data during the period of crop growth.
They also investigated one more method using only NOAA-
AVHRR county-level yield data. The county-level yield data
and consequently the obtained vegetation index GYURI for
eight dissimilar crops for eight years. The proposed method is
inexpensive and simple to use.
A new approach of estimation of crop yield incorporating
multi resolution satellite data was proposed by Das, 2004. The
attempt was made to incorporate the satellite spectral data and
spatial sampling values for estimation of crop yield, crop
acreage and crop yield forecasting. The proposed method used
satellite data of coarse resolution, that is inexpensive and
covers a large area as compared with higher resolution. The
study also demonstrated the higher efficiency of multiple
frame sampling estimates as compared to estimations using
single index. Supervised maximum likelihood classification
approach was used for the classification of satellite data. The
study also discussed about the noise during the classification
which is just due to the presence of the mixed pixels. A new
model of classification based on fuzzy classification
developed by indicator Kriging is also proposed in the study.
Anup et al. 2005, considered different parameters like NDVI,
surface temperature, soil moisture and rainfall data for crop
yield review and prediction using piecewise linear regression
model with breakpoint. Crop production environment contains
inherent sources of heterogeneity and their non linear
behavior. A non linear Quasi-Newton multivariate
optimization approach has been utilized, that reasonably
minimizes errors and inconsistency in yield prediction. A
function based on minimization of least square loss has been
employed through iterative convergence by predefined
empirical equation that provided tolerable lower residual
values with forecasting values very close to observed ones (R2
= 0.86) for soybean crop and (R2 = 0.78) for Corn crop. This
study also proved that crop yield predicted based on data
obtained before harvest is of acceptable accuracy.
Ren et al. 2008 proposed a method of crop yield estimation
using the MODIS-NDVI data on a regional scale. With the
intention of improving the quality of obtained remote sensing
data and the accuracy of yield estimation, the filter known as
Savitzky–Golay filter was utilized to smooth the 10 days
NDVI data. A stepwise regression method was employed to
establish a linear relationship between the spatial
accumulation of NDVI and the production of winter wheat.
To validate the obtained results the data from the ground
surveys was used and the errors were compared with the
values from agro-climate models. The obtained results proved
that the relative errors of the predicted yield using MODIS-
NDVI are between 4.62 and 5.40 percent and that calculated
RMSE was 214.16 kg/ha lower than the RMSE (233.35 kg/ ha
of agro-climate models.
Hu and Mo (2011) proposed a process based model of crop
growth which is known as VIP-Vegetation Interface Processes
model to estimate crop yield using remote sensing data over
the North China Plain. Statistical yield records and values of
NDVI from Terra-MODIS were used to obtain the spatial
pattern of one of the key parameter, maximum catalytic
capacity for assimilation. It was shown in the study that
photosynthetic parameters acquired from remote sensing data
are reliable for prediction of regional production using a
process based model.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Mkhabela et al. 2011, proposed a new model to estimate the
crop yield using MODIS data and NDVI. Regression and
correlation analyses were carried out using 10 days composite
NDVI data and running average NDVI with the maximum
correlation coefficients as the independent variables and crop
yield as the dependent variable. The ability and the robustness
of the generated regression model to predict crops grain yield
was testing with removal of one year at a time and new
regression models were obtained, which were then used to
predict the yield for the missing year. Results proved that
MODIS-NDVI values can be used very effectively to predict
the crop yield. They summarize that accurate crop grain yield
forecasts using the proposed regression models can be made
one to two months before the harvest.
Chimnarong et al., 2012 discussed the use of remote sensing
data as a reliable and efficient means of gathering the
information required in order to map crop type acreage and
condition. The study area comprised of four provinces, Khon
Kean, Chaiyaphum, Nong Bue Lum Phu and Mahasarakham
in Northeastern of Thailand. Landsat5 TM digital data (Dec,
2011) was evaluated for the potential utility of remote sensing
derived NDVI for sugarcane production estimation. Sum of
NDVI of individual sampling fields were correlated with the
actual production (ton/ha). NDVI that describes the
healthiness of crop is one of the factors of yield variability.
The result showed correlation 0.75 for sum NDVI image and
sugarcane production. The other factors which influence
variations are color of leaf and age of cane. The study
suggested the integration of remote sensing satellite data with
other parameters like age of the crop and variety difference to
improve the accuracy.
Mishra et al. 2013, proposed a model based on energy
balance known as ALEXI - Atmosphere Land Exchange
Inverse (ALEXI) model, which is used to deduce root zone
soil moisture for North Alabama, USA. The obtained soil
moisture estimates were further utilized in crop simulation
model popularly known as DSSAT - Decision Support System
for Agrotechnology Transfer. The study area contains a
mixture of irrigated and rainfed cornfields. The results
designate that the model forced with the ALEXI moisture
estimates generated yield simulations that compared
positively with observed yields. The results shown that the
ALEXI model is able to detect the soil moisture signal from
the mixed rainfed and irrigation corn fields and the signal was
of adequate strength to produce enough simulations of
recorded yields over a 10 years period.
Wang et al. 2014, proposed the model to determine the
optimal spectral index and the best time for predicting grain
yield and grain protein content in wheat by fusion of multi
temporal and multi sensor remote sensing data. Four field
experiments were carried out at different locations, cultivars
and nitrogen rates in two growing seasons of winter wheat.
The results illustrated that the NDVI estimated by fusion,
exhibits high consistency with the SPOT-5 NDVI, which
confirmed the usefulness of related algorithm. The use of RVI
at the initial filling stage obtained enhanced accuracy in wheat
yield prediction. In addition, the accumulated spectral index
from jointing to initial filling stage gave higher prediction
accuracy for protein content and grain yield, respectively, than
the spectral index at a single period. These results help
provide a technical method for the prediction of grain yield
and protein content in wheat with remote sensing at a large
scale. This prediction model based on multi temporal remote
sensing data can be suitable for the much clear sky conditions
during the main growth period of winter wheat.
709
ISBN: 978-81-924893-0-8
Here it can be concluded that RS techniques have been
extensively used in research for yield forecast but played a
small role in understanding the cause of spatial yield
variability. Also, it has been argued that while RS might not
be suitable in developing countries because of their stratified
agricultural systems and very small farm sizes. However, this
problem is hard to overcome in the near-future because of the
inability of RS to estimate yield in mixed agriculture. But, the
increased availability of high-spatial resolution RS at a
reasonable cost make this technique a possible interesting
alternative for yield forecast.
4. CONCLUSIONS
Based on the literature review the advances in the
development of international research on crop monitoring and
crop yield estimation can be separated into the following
stages (MacDonald and Hall, 1980, Sun et al., 1996):-
(1) before the 1940, qualitative analysis all the way through
comparison relating meteorological conditions and crop yield
was put forward.
(2) during 1950-70, statistics emerged very quickly, and the
regression models between the crop yield and weather
conditions were utilized very effectively. With the invent of
aerial photography and rapid expansion and application of
computers, researchers and application scientists put forward
many crop simulation models.
(3) during 1970-90, with the launch of satellites, the
researchers began to use remote sensing techniques for the
estimation of crop yield at global scale, which lift up the yield
estimation models to a higher level.
(4) in the 1990-2000, researchers focus more on the
combination of high resolution satellite images, vegetation
indices and statistical procedures to estimate global crop
yield.
(5) the current stage of the technological development
engrossed the amalgamation of the remote sensing , GIS and
GPS (Rao and Rao, 1987, Tennakoon et al., 1992). Due to the
theoretical and scientific achievements in the yield estimation
using remote sensing in the present decade, the researchers
and the application scientists frequently use multi date high
resolution satellite and meteorological data with the support of
the GIS to estimate yield, and they also operate on coarse
resolution data as a sampling tool to improve the precision.
Based on the literature review it is concluded that the crop
yield and growth monitoring both affected by many composite
factors, such as natural disasters with the intention of occur
suddenly and are beyond man's control as well as those habitat
factors that can be controlled by human. Although it is
possible to acquire the reliable and timely information about
the earth resources by the means of remote sensing, yet it is
not adequate to monitor the growth and estimate the yield of
crops in the absence of other parameters (Sun et al. 1996).
Thus, in addition to remote sensing, the use of many other
techniques such as ground observations, reviews, GIS and soil
analysis is highly appreciable. Based on the intensive studies
in the past, it is evident that the research using Geoinformatics
to obtain the agricultural statistics can be carried out in three
phases. Overall flow diagram for the crop yield model using
remote sensing is shown in Fig 1.
Phase 1 : Capture Remote Sensing Data and Field Survey data
Phase 2 : Pre-processing and analysis of the collected data
Phase 3 : Design of proposed model and obtain the results
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig 1: Overall flow diagram for the crop yield model using remote sensing
5. ACKNOWLEDGMENTS
One of the authors, Sandeep Kumar Singla is grateful to the
Roorkee College of Engineering Roorkee and IIT Roorkee for
their support to accomplish this research work.
REFERENCES
[1] Ahmad, T., Singh, R. and Rai, A., (2003). Development
of GIS based technique for Identification of Potential
Agro-forestry area. Project Report, IASRI, New Delhi.
[2] Anup, K.P., Chai, L., Ramesh, P.S. and Kafatos, M.,
(2005). Crop yield estimation model for Iowa using
remote sensing and surface parameters. International
Journal of Applied Earth Observation and
Geoinformation, 8(1), 26-33.
[3] Das, S.K., (2004). Application of multiple frame
sampling technique for crop surveys using remote
sensing satellite data. A Ph.D. thesis submitted to P.G.
School, IARI, New Delhi.
[4] Goyal, R.C., (1990). Use of Remote Sensing Planning of
Agricultural Surveys. Project Report, IASRI, New Delhi.
[5] Hayes, M.J. and Decker, W.L., (1996). Using NOAA
AVHRR data to estimate maize production in the United
States Corn Belt. International Journal of Remote
710
ISBN: 978-81-924893-0-8
Sensing, 17, 3189-3200.
[6] Ibrahim, A.E.I., (1992). Use of remote sensing data in a
markov chain model for crop yield forecasting. Project
report IASRI, New Delhi.
[7] Gupta, N.K., (2002). Applications of spatial models in
estimation of wheat production in rohtak distrct of
haryana. Unpublished M.Sc. thesis submitted to P.G.
School IARI, New Delhi.
[8] Singh, R. and Goyal, R.C., (1993). Use of remote
sensing technology in crop yield estimation surveys.
Project Report, IASRI, New Delhi.
[9] Singh R., Goyal, R.C., Pandey, L.M. and Shah, S.K.,
(2000). Use of remote sensing technology in crop yield
estimation survey-II. Project report IASRI, New Delhi.
[10] Singh, R., Semwal, D.P., Rai, A. and Chhikara, R.S.,
(2002). Small area estimation of crop yield using remote
sensing satellite data. International Journal of Remote
Sensing, 23(1), 49-56.
[11] Chimnarong, V., Rethinam, S., Seechan, M. and
Pliansinchai, U., (2012). In the proceedings of 33rd asian
conference on remote sensing, Thailand.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[12] Rudorff, B.F.T. and Batista, G.T., (1990). Yield
Estimation of Sugarcane Based on Agrometeorological-
Spectral Models. Remote Sensing of Environment, 33,
183-192.
[13] Doorenbos, J. and Kassam, A.H., (1979). Yield
Response to Water. FAO Irrigation Drainage Paper 33,
United Nations, Rome, p. 193.
[14] Reynolds, C.A., Yitayew, M., Slack, D.C., Hutchinson,
C.F., Huete, A. and Petersen, M.S., (2000). Estimation
crop yields and production by integrating the FAO Crop
Specific Water Balance model with real-time satellite
data and ground-based ancillary data. International
Journal of Remote Sensing, 21(18), 3487-3508.
[15] Wang, L., Tian, Y., Yao, X., Zhu, Y. and Cao, W.,
(2014). Predicting grain yield and protein content in
wheat by fusing multi-sensor and multi-temporal remote-
sensing images. Field Crop Research, 164, 178-188.
[16] Mishra, V., Cruise, J.F., Mecikalski, J.R., Hain, C.R. and
Anderson, M.C., (2013). A Remote-Sensing Driven Tool
for Estimating Crop Stress and Yields, Remote Sensing,
5(7), 3331-3356.
[17] Mkhabela, M.S., Bullock, P., Raj, S., Wang, S. and
Yang, Y., (2011), Crop yield forecasting on the Canadian
Prairies using MODIS NDVI data, Agricultural and
Forest Meteorology, 151(3), 385-393.
[18] Hu, S. and Mo, X., (2011). Interpreting spatial
heterogeneity of crop yield with a process model and
remote sensing. Ecological Modelling, 222(14), 2530-
2541.
[19] Tucker, C.J., Holben, B.N., Elgin, J.H. and McMurtrey,
J.E., (1980). Relationship of spectral data to grain yield
variation. Photogrammetric. Engineering and Remote
Sensing, 46, 657-666.
[20] Ren, J., Chen, Z., Zhou, Q. and Tang, H., (2008).
Regional yield estimation for winter wheat with MODIS-
NDVI data in Shandong, China. International Journal of
Applied Earth Observation and Geoinformation, 10(4),
403-413.
[21] Hamar, D., Ferencz, C., Lichtenberger, J., Tarcsai, G.
and Ferencz-Árkos, I., (1996). Yield estimation for corn
and wheat in the Hungarian Great Plain using Landsat
MSS data. International Journal of Remote Sensing,
17(9), 1689-1699.
[22] Benedetti, R. and Rossini, P., (1993). On the use of
NDVI profiles as a tool for agricultural statistics: the
case study of wheat yield estimate and forecast in Emilia
Romagna. Remote Sensing of Environment, 45(3), 311–
326.
[23] Ferencz, Cs., Bognar, P., Lichtenberger, J., Hamar, D.,
Tarcsai, Gy., Timar, G., Molnar, G., Pasztor, Sz.,
Steinbach P., Szekely B., Ferencz O. and Ferencz-Arkos,
I., (2004). Crop Yield Estimation by Satellite Remote
Sensing. International Journal of Remote Sensing,
25(20), 4113-4149.
[24] Das, D., Mishra, K. and Kalra, N., (1993). Assessing
711
ISBN: 978-81-924893-0-8
growth and yield of wheat using remotely-sensed canopy
temperature and spectral indices, International Journal of
Remote Sensing, 14(17), 3081-3092.
[25] Doraiswamy, P.C., Moulin, S., Cook, P.W. and Stern, A.,
(2003). Crop yield assessment from remote sensing,
Photogrammetric Engineering and Remote Sensing,
69(6), 665-674.
[26] Rouse, J.W., Haas, R.H., Schell, J.A. and Deering, D.W.,
(1974). Monitoring vegetation sys-tems in the Great
Plains with ERTS. Third NASA ERTS Symposium,
NASA SP-351, United States, pp. 309–317.
[27] Goodman, M. S., (1959). A technique for the
identification of farm crops on aerial photographs,
Photogrammetric Engineering, 28, 984-990.
[28] Goodman, M. S., (1964). Criteria for the identification of
types of farming on aerial photographs, Photogrammetric
Engineering, 30, 131-137.
[29] Houseman, E.E. and Huddleston, H.F., (1966).
Forecasting and estimating crop yields from plant
measurements, Monthly bulletin of Agriculture
Economics and Statistics, 15(10).
[30] Anson, A., (1966). Color photography comparison,
Photogrammetric Engineering, 32, 286-297.
[31] Small, R.P., (1967). Research report on tart cherry
objective yield surveys, Statistical Reporting Service,
USDA.
[32] Johnson C.W., Bowden, L.W. and Pease, R.W., (1969).
Studies in remote sensing of Southern California and
related environment, University of California, Riverside,
California, Status Report III, Technical Report V.
[33] Roberts, E.H. and Gialdini, M.J., (1970). Multispectral
Analysis for crop identification, A Report to USDA
Status Reporting Service by the Forestry Remote Sensing
Lab., University of California.
[34] Coleman, V.B., Johnson, C.W. and Lewis, L.N., (1974).
Remote sensing in control of pink bollworm in Cotton,
California Agriculture, 28(9), 10-12.
[35] Landgrebe, D.A. and Staff, (1967). Automatic
Identification and classification of wheat by remote
sensing, Purdue Agric. Experiment Station Res. Prog.
Report, 279.
[36] Kristof, S.J., (1969). Preliminary multispectral studies of
soil, Journal of Soil water conservation, 26, 15-18.
[37] Hoffer, R.M. and Goodrick, F.E., (1971). Geographic
considerations in automatic cover type identification, in
Proceedings of the Indiana Academy of Science, 80, 230-
44.
[38] Morain, S.A., (1970). Radar sensing in agriculture; an
overview, condensed from CRES Technical report, 177-
214.
[39] Morain, S.A., Wood, C. and Conte D., (1970). Earth
observation Survey program 90-day mission report,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
NASA/MSC mission 102, site 87, CRES Technical
Memo 169-4, Centre for Research, University of Kansas,
Lawerence, Kansas, 16.
[40] Schwarz, D.E. and Caspall, F., (1968). The use of Radar
in discrimination and identification of agricultural land
use, in Proceedings of the 5th Symposium on Remote
Sensing and Environment, University of Michigan, 233-
247.
[41] Lennington, R.K., and Sorensen, C.T., (1984). A mixture
model approach for estimating crop areas from Landsat
data, Remote Sensing of Environment, 14, 197-206.
[42] Mccloy, K.R., Smith, F.R. and Robinson, M.R., (1987).
Monitoring rice areas using Landsat MSS data,
International Journal of Remote Sensing, 8(5), 741-749.
[43] Gallego, F.J., Delince, J., and Rueda C., (1993). Crop
area estimates through remote sensing: stability of the
regression correction, International Journal of Remote
Sensing, 14(18), 3433-3445.
[44] Nordberg, M.L. and Evertson, J., (2003), Vegetation
index differencing and linear regression for change
detection in a Swedish mountain range using Landsat
TM and ETM+ imagery, Land Degradation and
Development, 16, 139-149.
712
ISBN: 978-81-924893-0-8
[45] Langley, S.K., Cheshire, H.M. and Humes, K.S., (2001).
A comparison of single date and multitemporal satellite
image classifications in a semi-arid grassland. Journal of
Arid Environments, 49(2), 401-411.
[46] Jung, M., Churkina, G., Henkel, K., Herold, M. and
Churkina, G., (2006). Exploiting synergies of global land
cover products for carbon cycle modeling. Remote
Sensing of Environment, 101(4), 534-553.
[47] Sun, Jiulin, Chen, S., Qian, H. and Zhang, D., (1996).
Series Monographs of the Study on Dynamic Monitoring
and Yield Estimation of Crops with Remote Sensing in
China, Science and Technology Press of China, Beijing,
238 p.
[48] MacDonald, R.B. and Hall, F.G., (1980). Global crop
forecasting, Science, 208, 670-679.
[49] Rao, P.P.N., and Rao, V.R., (1987). Rice crop
identification and area estimation using remotely sensed
data from India cropping patterns, International Journal
of Remote Sensing, 8(4),639-650.
[50] Tennakoon, S.B., Murty, V.V.N. and Eiumnoh, A.,
(1992). Estimation of cropped area and grain yield of rice
using remote sensing data, International Journal of
Remote Sensing, 13(3),427-439.
Basic & Applied Sciences
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Study on PRP’s (Protein Rich Pulses) by Irradiating
Co-60 Gamma Ray Photons
Manoj Kumar Gurinderjeet
Gupta, Singh,
Deparment of Department of
Applied Sciences, Physics, SLIET,
BGIET, SANGRUR, Logowal,
mkgupta.sliet@gmail SANGRUR,
.com gjs.sliet@gmail.com
ABSTRACT
The linear attenuation coefficient of some commonly
available protein rich pulses (ciceraritenium, vigna radiate,
phaseolus vulgaris, vigna mungo and canjanus cajan) has been
measured by using direct transmission method. It has been
found that the pulse: vigna radiate (VR) having more linear
attenuation coefficient than others pulses.
KEYWORDS
Protein rich pulses, linear attenuation coefficients, direct
transmission method.
1. INTRODUCTION
The attenuation coefficient is a measure of the number
of primary photons which actually interacted while traversing
a given amount of absorber. The wide range of applications of
linear attenuation coefficient in various fields includes optical
fiber, radiation dosimetry, radiation biophysics, nuclear
medicine, nuclear diagnostic, oceanography etc. Gamma ray
transmission method utilizes the application of Lambert Beer
Law for the measurement of the linear attenuation coefficient
of the samples.
Theoretical and experimental measurement of
linear/mass attenuation coefficients for elements [1-4],
compounds [5,6], alloys [7,8], biological materials [9] and
building materials [10] is carried out by various researchers.
The theoretical values of mass attenuation coefficients and
interaction cross-sections, form factor and scattering for the
element/compounds of dosimetric and radiological interest,
from Z=1 to 92 at various energy have been tabulated by
Chantler [11] and Hubbell and Seltzer [12]. In the present
communication, attempt has been made to find out linear
attenuation coefficient of protein rich pulses (Chick Peas,
Phaseolus Vulgaris, Vigna Radiate, Cicer Aritenium, Vigna
Mungo and Canjanus Cajan) experimentally.
2. EXPERIMENTAL ARRANGEMENT
Self supporting regular shaped samples from commonly
available pulses have been prepared by using the technique
given by Habbani et al. [13] and Tirasoglu [14]. The list of
pulses, their chemical composition and Molecular Formula are
713
ISBN: 978-81-924893-0-8
Shilpa Rani, Amrit Singh,
Department of Department of
Physics, SLIET, Physics, SLIET,
Logowal, Logowal,
SANGRUR, SANGRUR,
shilpamittal28991@g amritsliet@gmail.co
mail.com m
Longowal, SANGRU
shown in Table 1. The linear attenuation coefficient has been
measured by using linear transmission geometry [15] by using
incident photon energy 1332keV gamma ray from Co-60.
The geometrical setup for the experimental measurements
using direct transmission is shown in figure 1. Ortec (2x2)
inch NaI scintillation detector coupled to EG&G Ortec
multichannel analyzer has been used in present measurement.
Three collimators of aperture 2mm, 3mm and 3mm are used
as source, sample and detector collimators respectively. From
the experimental arrangement I and Io, intensity of incident
gamma ray photons with and without has been calculated
from obtained spectrum. Using I, Io and mass per unit
thickness in Beer Lambert’s law, absorption coefficient of the
samples has been calculated. The intensity of incident photons
observed on the detector in spectrum form for sample (CP) is
shown in figure 2. Each run for the observed spectrum was
taken for 3600 sec and repeated three times under similar
conditions to overcome statistical error.
3. RESULT AND DISCUSSION
In this communication, we have measured the values of
linear attenuation coefficient of some of easily available
protein rich pulses: Chick Peas, Phaseolus Vulgaris, Vigna
Radiate, Cicer Aritenium, Vigna Mungo and Canjanus Cajan
by using linear transmission geometry. Molecular formula for
all PRP’s has been obtained from Wikipedia. Experimental
values have been compared with theoretically calculated
values from Chantler et al. data tables and are tabulated in
Table 2. 1.75% variation has been found in the experimental
results from theoretical values, which shows a good
agreement. The experimental error in present measurement is
of the order of 0.15%.
Figure 1: Geometrical setup for experimental
measurements
Table1. Natural parameters of PRP’s (protein rich pulses)
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Protein Table 2. Experimentally measured results for linear

S. Rich * # $
attenuation coefficients
E C P Mol. formula
N Pulses
Sample Linear Attenuation Coefficient (μ)
(PRP) S.
code of
No.
Chick Peas PRP Theoretical Experimental
1 1,619 57 22 C17H25N305S
(CP)
1 CP 3.06 3.01
Phaseolus
2 Vulgaris 1,393 60 24 C20H18O4 2 PV 2.17 2.13
(PV)
3 VR 3.26 3.20
Vigna
3 Radiate 1,452 62.6 3.86 C21H20O10 4 CA 2.67 2.62
(VR)
5 VM 2.53 2.49
Cicer
6 CC 2.89 2.84
4 Aritenium 686 27.4 8.86 C10H13N5O
(CA)

Vigna
5 Mungo 1,603 50 24 C20H20O5 REFERENCES
(VM) [1] Colgate, S. A., Gamma-ray Absorption measurement.
Phys. Rev. 87, 592 (1952).
Cajanus
6 Cajan 569 23 7.2 C16H12O6 [2] Connar A. L., Atwater H. F., Plassmann E. H.,
(CC) McCrary J. H., Gamma-Ray. Attenuation-Coefficient
Measurements Phys. Rev. A 1, (1970) 539-544.
*
E-Energy (KJ), #C-Carbohydrates (g), $P-Protein (g)
[3] Davison C. M., Evans R. D., Measurements of gamma-
rays attenuation coefficient. Phys. Rev. 81, (1951) 404-
411.
CONCLUSION [4] Teli M. T., Nathuram R., Mahajan C. S., Single
From experimentally obtained results, we conclude that the experiment simultaneous measurement of elemental
value of linear attenuation coefficients varies along with mass attenuation coefficients of hydrogen, carbon and
sample’s natural parameters such as: Energy, amount of oxygen for 0.123-1.33MeV gamma rays. Radiation
Proteins, Carbohydrates etc. Also vigna radiate (VR) has more Measurement, 32, (2000) 329-333.
attenuation coefficient than other pulses. Thus, the pulse
containing more energy, carbohydrates and proteins values [5] Gowda, S., Krishnaveni, S., Yashoda, T., Umesh, T.
have more linear attenuation coefficient also. K., Gowda, R., Photon mass attenuation coffecients,
effective atomic numbers and electron densities of
So we can say that, there may be possibility to replace some thermoluminescent dosimetric compounds.
metallic foils with such types of materials in research Pramana journal of Physics, 63 (3), (2004) 529-541.
laboratories. In general, use of these types of pulses provide
better protection from diseases in human body. [6] Turgut, U., Simsek, O., Buyukkasap, E., Measurement
of mass attenuation coefficients in some Cr, Co and Fe
compounds around the absorption edge and the
validity of the mixture rule. Parmana Journal of
Physics. 69 (2), (2007) 199-207.

[7] Han, I., Demir, L., Studies on effective atomic

numbers, electron densities and mass attenuation
coefficients in Au alloys. Jour. of X-ray Science and
Technology. 18, (2010) 39-46.

[8] Seven, S., Karahan, I. H., Bakkaloglu O. F., The

measurement of total mass attenuation coefficients of
CoCuNi alloys. Journal of Quantitave Spectroscopy and
Radiative Transfer. 83 (2), (2004) 237-242.

[9] Singh, K., Singh, C., Singh, P. S., Mudhar, G. S.,

Effect of weight fraction of different constituent
Figure 2: X-ray spectrum for Co-60
elements on the total mass attenuation coefficients of

714
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

biological materials. Pramana Journal of physics. 59
(1), (2002) 151-154.
[10] Mavi, B., Akkurt, I., Natural radioactivity
and radiation hazards in some building materials used
in Isparta, Turkey, Radiation Physics and Chemistry
79, (2010) 933.
[11] Chantler, C. T., Olsen, K., Dragoset, R. A., Chang, J.,
Kishore, A. R., Kotochigova, S. A., Zucker, D. S. X-ray
form factor, attenuation and scattering tables, National
Institute of Standards and Technology.Available
on:/http://physics.nist.gov/ffastS (2005).
[12] Hubbell, J. H., Seltzer, S. M., Tables of X-Ray Mass
Attenuation Coefficients
and Mass Energy-Absorption Coefficients from 1 keV
to 20 MeV for Elements Z = 1 to 92 and 48 Additional
Substances of Dosimetric Interest. NISTIR. 5632
(1995).
[13] Habbani, F., Eltahir, E. Ibrahim, M. A. S.
Determination of elemental composition of air
particulates and soil in Khartoum area. Tanz. J. Sci.
33, (2007) 57-66.
[14] Tirasoglu, E. 2006. Average fluorescence yield of M4,5
subshells for thorium and uranium. Eur. Phys. J. D. 37,
177-180.
[15] Gupta, M. .K., Sidhu, B. S., Mann, K. S., Dhaliwal, A.
S., Kahlon, K. S., Advanced Two Media (ATM)
method for measurement of linear attenuation
coefficients, Annals of Nuclear Energy 56 (2013) 251-
254.

715
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Drifting effect of electron in multi-ion plasmas with
nonextensive distribution of electrons
Sheenu Juneja
Department of Mathematics, Statistics & Physics,
Punjab Agricultural University, Ludhiana.141004
pravi2506@gmail.com
ABSTRACT
In the present research work, effect of drifting velocity of
electrons have been studied in plasma systems consisting of
cold positive and negative ions and electron beam. The
electrons are assumed to obey non-extensive velocity
distribution. Standard reductive perturbation method is used to
drive dispersion relation, which comes out to be a polynomial
of four degree in phase velocity which corresponds to four
ion-acoustic modes. The expression for critical velocity is
found to be the function of various parameters including
nonextensive parameter q. The nonextensivity and electron
beam parameters play crucial role in the characterization of
solitons. We have taken (Ar+F-), (H+ H-), (H+O2-) plasma
systems for our study.
General Terms
Nonlinear wave structures
Keywords
Multi-ion plasma, Nonextensive distribution, Reductive
Perturbation method.
1. INTRODUCTION
The solitons wave is a quantum of energy or quasiparticle that
can be propagated as a travelling wave in nonlinear systems
and is neither preceded nor followed by another such
disturbance. It does not obey superposition principle and does
not dissipate. A solitary wave exists when effects on
nonlinearity and dispersion are balanced [1]. Soliton waves
exist in the sky as density wave in spiral galaxies, in plasmas
etc. Electron beam component is frequently observed in the
region of space where ion-acoustic waves exist. The
observation of solitary waves in the auroral zone suggests that
there are two classes of solitary waves: the first kind
associated with electron beam and other is associated with ion
beam [2]. The electron beam plasma system has also
considerable importance in the areas of magnetosphere and
solar physics. The high speed electrons have a considerable
influence on the excitation of the various kinds of nonlinear
waves in interplanetary space and Earth’s magnetosphere [3].
Yadev et. al. [4] showed that above a critical beam velocity
four ion-acoustic branches appear in electron beam plasma
system. Bala et. al. [5] showed that above a critical beam
velocity six ion-acoustic branches appear in a warm
multicomponent plasma consisting of warm positive and
negative ions along with nonthermal electrons and a electron
beam. However present investigation shows the existence of
four modes above a critical electron beam velocity.
The ,( and plasma composition
occur in D- region of ionosphere, where negative ions are
found [6]. The investigation of electron beam plasma has also
716
ISBN: 978-81-924893-0-8
Parveen Bala
considerable influence on the excitation of the various kinds
of nonlinear waves in interplanetary space and Earth’s
magnetosphere [3]. In the recent past, this motivated the
researchers to study multicomponent plasma with electrons in
variety of systems [4,5,7-11].
Particle distributions, offers a considerable increase in
richness and variety of wave motion that can exist in plasmas
are of two types: Maxwellian and non-Maxwellian.
Maxwellian distribution, also known as extensive distribution,
is valid universally for systems which are in equilibrium. But
in systems with long range interactions such as in plasma,
non-equlibrium stationary states i.e. nonextensive distribution
exists. Since last decade there is an increasing focus on a new
statistical approach that is Tsallis distribution [12]. It has also
been studied that nonextensive effects on ion acoustic waves
are not apparent when electron temperature is much more than
ion temperature, but they are salient when the electron
temperature is not much more than the ion temperature. As
compared with the electrons, the ions play a dominant role in
the nonextensive effects [13]. In the limit when q=1 the
Tsallis distribution leads to Boltzmann-Gibbs Statistics
(BGS). For q=1, Maxwell distribution function is obtained
where q is measure of nonextensivity. But for q<1, high
energy states are more probable than in the extensive case. On
the other hand, for q>1, high energy states are less probable
than in extensive case and there is cut off beyond where no
state exists. Tsallis q-distribution has been used with some
success in a number of research work in plasma physics [14-
22]. Regarding the organization of paper, basic equations
related to our plasma model have been given in section 2,
using nonextensive distribution of electrons and standard
reductive perturbation method, Korteweg-de Vries equation
(KdV) has been derived. Section 3 is devoted to the
discussion of numerical results and finally the conclusions are
made
2. FORMULATION OF PROBLEM
We have considered the collisionless, unmagnetized, multi-
ion plasma model containing cold positive and negative ions
and electron beam. Further, the electrons are assumed to obey
nonextensive distribution. The number density of the electron
fluid associated with non-extensivity of electrons is given by
ne  [1  (q  1) ]( q 1) / 2( q 1) (1)
Here q is the nonextensive parameter. The nonlinear
behaviour of ion-acoustic waves in present multispecies
plasma model is governed by the following set of normalized
continuity, momentum and Poisson equations:
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

n j  (n j v j ) (2)
We use (7) in equation (2) to (4) and compare various
 0 physical quantities in same order. The resulting equations are
t x
further used to eliminate other dependent parameters in
v j v j 1  (3) term . Then after a long algebraic but straightforward
 vj 
t x Q j x manipulations, we arrive at the following nonlinear equation
known as Korteweg-de Vries (KdV) equation as:
 2 n   (1)  (1)  3 (1)
 ne   b nb  1  z n2 (4)  A (1) B 0 (9)
x 2 B B    3
Where, j=1,2,b, 1 stands for positive ions, 2 stands for Where A=2Q/P is nonlinearity coefficient and B=2/P is
negative ions, b stands for electron beam. Here, Q1=-, dispersion coefficient. Also coefficient of
Q2=/z, Qb=eZ1 and
nb( 0) n(0) 4 Z12     z2  4 b (v0   ) dF (10)
B  (1   z ) /(1   b ),  b 
m
,   2( 0) ,  2 , P   
ne( 0)
n1 m1 B  (Z12 ) 2  (eZ1 (v0   ) 2 ) 2 d
me Z 1   z2 /    b / e Z1  3 2 (1   z3 )   b 3e (v0   ) 2
e  , z  2   Q     (11)
m1 Z1 B  B( 2 )3  (e (v0   ) )
2 3

Here are the densities and fluid (3  q )(q  1)


velocities of positive and negative ion species ad electron 4
beam respectively. are the equilibrium
densities of two ion components and beam respectively. In 3. DISCUSSION
equations (2) to (4), velocities  (potential), time The critical beam velocity is found numerically from
(t) and space coordinates (x) have been normalized with equations (8) and (10) with the condition that for
respect to the ion- acoustic speed in the mixture, F(λ)=1 [4]. The analytical expression for is given by:
3/ 2
, thermal potential , inverse of ion plasma   B  1/ 3
    z2 
1/ 3
 (12)
vcr 
2  b     
(1  q)B   e Z1     
frequency is the mixture , Debye length  

respectively. Ion densities are It is clear that critical beam velocity depends on electron beam
normalized with their corresponding equilibrium values, concentration negative ion concentration α, mass ratios η
whereas electron densities are normalized by . and respectively. It may be noted that in the Maxwellian
limit (q our impression for becomes same as that of
To study small but finite amplitude ion acoustic solitary Bala et al [5] in the limit β=0, where nonthermal electrons
waves in our multispecies plasma model, we construct here a were reported.
weakly nonlinear theory of ion-acoustic waves which leads to
scaling of the independent variables through the stretched co-
ordinates ξ and τ:

(5)
(6)

Where ε is small parameter measuring the weakness of the

dispersion and is the phase velocity of wave. Now to strike
balance between nonlinear and dispersive terms, we use
reductive perturbation technique where we expand all
dependent quantities in equations (2) to (4) around the
equilibrium values in power of ε in the following form:

nj  1  n (jr ) 

     (r )  (7)
 v j    k   r 1   v j 
 r
Fig 1: For the range q<0, 3D plot of critical velocity as a
   0  ( r )  function of beam density b and nonextensive parameter
     
q with =0.1, =0.476, e=1/1836 and z=Z1=Z2=1
Here k=0 for positive and negative ions and k= v0 for
electron beam, is the initial electron beam velocity. Using For plasma system, the 3D variation of critical
equations (5), (6) and (7) into Poisson’s equation (4), to the velocity as a function of nonextensive parameters q and
lowest order of ε, we get the following dispersion relation electron beam density in figures 1 (for q<0), 2 (for 0<q<1)
and 3 (for q>1) respectively. The value of decreases with
2(   z2 ) 2 b nonextensivity q for all three ranges. Further is also found
  q  1  F ( ) (8) to decrease with the electron beam density . This behavior
 2 Z1 B (v0   ) 2 eZ1 is opposite to that observed by Yadev et al [4] and Bala et al
The dispersion relation (8) is a four degree polynomial in [5]. Hence all ranges of q predict the similar behaviour as is
thereby giving four modes propagating with different phase clear from figures 1,2,3 respectively. A similar kind of
velocity. It may be further mentioned that in the limit q→1, behavior has been observed for the plasma systems H+O2-
our expression for phase velocity reduces to that of Yadev et (=32) and Ar+F- (=0.476) (not shown here).
al [4] and Bala et al [5] for .

717
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Fig 2: For the range 0<q<1, 3D plot of critical velocity as a
function of beam density b and nonextensive parameter
q with =0.1, =0.476, e=1/1836 and z=Z1=Z2=1
Fig 3: For the range q>1, 3D plot of critical velocity as a
function of beam density b and nonextensive parameter
q with =0.1, =0.476, e=1/1836 and z=Z1=Z2=1
In order to investigate the effect of mass of negative ions on
the critical velocity we have plotted vs for three
different mass ratios i.e η=0.476, η=1, η=32. The other
parameters are taken as , q=1.3(>1). The critical
beam velocity is found to decrease with increase in mass of
negative ions.
Fig 4: Variation of critical velocity with for three
different mass ratios i.e η=0.476 (solid curve), η=1 (dotted
curve), η=32 (dashed curve), , =0.1,
and z=Z1=Z2=1
Since the velocity of soliton M=λ+u and hence from Taylor
expansion
718
ISBN: 978-81-924893-0-8
Where u is very small constant velocity. Hence soliton
existence condition u <0 is similar to F(M)<1.
Fig 5: Plot of function F(λ) as a function of λ for α=0.8,
η=0.476, q=0.3, (dotted) = 1.9
(dashed), solid line corresponds to F(λ)=1.
The condition F(M)<1 also corresponds to the absence of
convective instability for the linear wave [4]. Hence
F(M)=F(λ)=1 corresponds to the dispersion curve of linear
wave. In figure 5, A plot of function F(λ) as a function of
have been given where F(λ)=1 corresponds to dispersion
relation. Given F(λ) intersects the line F(λ)=1 at four
places , thereby indicating the existence of four real
roots that correspond to four linear modes. Among them one
mode corresponds to wave mode moving in negative
direction. Two of them corresponds to slow modes with phase
velocities smaller than drift velocity and fourth one
corresponds to faster mode with λ> . From figure 5, we see
that for the fast mode, dF/d is negative and soliton
corresponding to this mode moves with supersonic speed. Out
of two slow modes, one moves with subsonic speed and the
other move with supersonic speed based on the sign of dF/d.
However, for , (dashed lines) two real roots are
possible, other two may be complex ones.
4. CONCLUSION
In the present investigation, effect of drift velocity of
electrons in multi-ion plasma system has been presented. The
electrons are taken as nonextensive ones. The dispersion
relation and KdV equation as been derived using standard
reductive perturbation method. The critical velocity of
electron beam was found to be a function of nonextensivity q,
beam concentration negative ion concentration α, mass
ratios η and respectively. It is found that above a critical
velocity of electron beam, four soliton branches appear
corresponding to four different modes. Out of which, three
move with supersonic velocity while one moves with subsonic
speed based on the sign of dF/d. Further, the critical velocity
decreases with nonextensive parameter q and electron beam
concentration
ACKNOWLEDGMENTS
P.B is thankful to UC for financial support via F. No 42-
1065/2013
REFERENCES
[1] Dodd, R. K., Eilbeck, J. C., Gibbon, J. D. and Morris, H.
C.1984 Solitons and Nolinear wave equation Academic Press,
New York.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[2] Das, G. C. 1979 Ion-a coustic solitons and shock waves in
multicomponent plasmas. Phys Plasmas 21, 257-265.
[3] Nejoh, Y. 1996 Large amplitude ion-acoustic waves in a
plasma with a relativistic electron beam. Plasma Phys. 56, 67-
76.
[4] Yadav, L.L., Tiwari R.S. and Sharma S. R.1994 Ion-
acoustic compressive and rarefactive solitons in a electron
beam plasma system. Phys Plasmas 1, 559-566.
[5] Bala P., Gill, T. S. and Kaur H. 2010 Localized nonlinear
electrostatic structures in a multispecies plasmas. J. Phys.
Conference Series 208, 012076.
[6] Swider, W. 1988 Ionospheric Modeling edited by J.N.
Korenkov, Birkhauser, Basel 403.
[7] Moslem, W.M. 1998 Propagation of ion acoustic waves in
a warm multicomponent plasma with an electron beam. J.
Plasma Phys., 61, 177-189.
[8] Bethomier, M., Pottelette, R., Malingre, M. and
Khotyaintsev, Y. 2000 Electron-acoustic soliton in electron
beam plasma system. Phys. Plasmas 7, 2987-2994.
[9] El-Taibany, W. F. and Moslem, W. M. 2005 Higher order
nonlinearity of electron-acoustic solitary waves with vortex
like electron distribution and electron beam. Phys.Plasmas 12,
032307.
[10] Esfandyari, A.R., Kourakis, I. and Shukla, P.K. 2008
Ion acoustic waves in a plasma consisting of adiabatic warm
ions, nonisothermal electrons and a weakly relativistic
electron beam :Linear and higher order nonlinear effects.
Phys.Plasmas 15, 022303.
[11] Singh, S.V., Lakhiana, G.S., Bharuthramand, R. and
Pillay, S. R. 2011 Electrostatic solitary structures in presence
of non-thermal electrons and a warm electron beam on the
auroral field lines. Phys. Plasmas 18, 122306.
719
ISBN: 978-81-924893-0-8
[12] Tsallis, C. 1988 Possible generalization of Boltzmann-
Gibbs entropy. J. Stat. Phys. 52, 479.
[13] Zhipeng, L., Liyan, L., and Jiulin, D. 2009 A
nonextensive approach for the instability of current-drive ion-
acoustic waves in space plasma. Phys. Plasmas 16, 072111.
[14] Rossignoli, R. and Canosa, N. 1999 Non additive
entropies and quantum statistics. Phys. Lett. A 281, 148-153.
[15] Abe, S., Martinrez, S. and Pennini, F. and Plastino, A.
2001 Nonextensive thermodynamic relations. Phys. Lett. A
281, 126-130.
[16] Wada, T., 2002 On the thermodynamic stability of Tsallis
entropy. Phys. Lett. A. 297, 334-337.
[17] Reynolds, A.M. and Veneziani, M. 2004 Rotational
dynamics of turbulence and Tsallis statistics. Phys. Lett. A.
327, 9-14.
[18] Sattin, F. 2005 Non-Extensive Entropy from Incomplete
Knowledge of Shannon Entropy. Phys. Scripta 71, 443-446.
[19] Wu, J. and Che, H. 2007 Fluctuation in nonextensive
reaction–diffusion systems. Phys. Scripta 75, 722-725.
[20] Tribeche, M. and Djebarni, L. and Amour, R. 2010 Ion
acoustic solitary waves in a plasma with a q-nonextensive
electron velocity distribution. Phys. Plasmas 17, 04211
[21] Bains, A. S., Tribeche, M. and Gill, T. S. 2011
Modulational instability of ion acostic waves in a plasma with
q-nonextensive electron velocity distribution. Phys. Plasmas.
18, 022108.
[22] Akhtar, N. and Al-Taibany, W.F. and Mahmmod, S.
2013 Electrostatic double layers in a warm negative ion
plasma with nonextensive electrons. Phys. Lett. A, 377, 1282-
1289.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Second Language Learner: Threads of Communication
Skills in English Language
Chhavi Kapoor
Asstt. Professor in English
Bhai Gurdas Inst. of Engg. & Tech., Sangrur
chhavikap1989@gmail.com
ABSTRACT
Time in which we are living is a changing time. The scenarios
of the market, thinking, and adjustments are altering. The
influence of change that occurs creates miscommunication.
Nothing is left behind, apart from loose threads of
understanding, communication and thinking. The process
through which communication occurs is not understood by the
people in general. The problem is in teaching and language
acquisition by the second language learner. The basic
instruction to the language learner gives the outcome of the
learning acquired by the learner. The learner needs to be
conscious in the process of learning. This paper describes the
need of learning for the second language learner in the present
scenario. Even the limitations of the teacher are exposed in
the learning process. The approach to language acquisition
tries to discover the possibility and achievability for the
effective communication for the second language learner with
advent of language introduction in the past.
Key words:
Second Language Learner, Teacher’s role, Communication
Skills, Efficiency, Language, Grammar.
1. INTRODUCTION
The process of communication appears to be simple for the
first language user, as unconsciously they are aware about the
language. But for the second language user it is difficult task.
English as a second language is used as a formal instruction
for those whose native language is not English. Such language
learners have to consciously participate in the process of
learning as well as practice more and more to bring out the
efficiency required for a language user. Here, it doesn’t mean
that the first user is good at communication; rather they even
fail like the second language learner, in conveying their ideas,
thoughts, and endeavors in social interactions as well as in
professional front. Effective communication includes four
skills Listening, Speaking, Reading and Writing. The
globalised countries have marked a pressing need for viable
English programs in those countries whose native language is
not English. This has resulted in the increase in demands of
the learners for learning these skills .As a result ,there is
valuable expansion in the production of Coaching centre’s,
Special Language classes, English in schools at primary and
720
ISBN: 978-81-924893-0-8
secondary level, Communication skills as a course in the
Engineering classroom, Public speaking classes, IELTS
classes, CELTA course, TOFEL classes and many others.
Such different learning genres have evoked the people to
acquire the language and pay hefty amounts to these centers
or so called institutes.
2. STATUS OF THE LANGUAGE
Such is the status of this foreign language that with the
passing years the worth of the language automatically marks
its flag in the enlargement of a country, a community and
particularly of an individual. The language of “Them” became
“Our” language in short span. Now the question here is “The
English” still carries the status of “The English”? Surely
English is the language of opportunities and success for life in
India and other developing countries. As mentioned in
the,“….A Critical Evaluation of ELT in India noted by the
education commission of India in 1966,when a degree holder
from India goes to any of the developed countries he is not
treated at par with a degree holder of that country…….” This
makes us realize that although we have inherited it from the
British but still we don’t acquire this language as much as we
have carried it, in all these passing years. The worth of
English which came with the lord Macaulay in 1835, who was
the first to accentuate English language teaching in India with
his “Minutes of Education”. He entrenched the roots of
English in India way back in 1835 than later English was
highlighted by Sir Charles Wood as in 1854 he stated that the
English is a medium for admission to any established
university for higher language. With spread of the language
the writes and the speakers accepted it. English became “The
Status Symbol Tag” for many. What a value a foreign
language gained! The status which Hindi, Tamil, French,
Chinese and others didn’t get in few years, impeccably
English got. The extensive practice of English and use of it,
for communication of the second language learner was
supported by the set up of the structural approaches for
teaching English in different parts of the country:
3. MINDSET OF USERS
The analyses about the whole scenario has led me evaluate the
status of this language in my country. English is not used or
produced as done by The English. For the Indians it is a way
for convenient communication. Now if people think that they
are good at it, Saddely they are having wrong perspective.
Although the rules are much clear to the second language
learner but the efficiency in using it needs confidence and flair
which comes by the language acquisition in the learning
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
process to the second language learner. While having a debate
with some relative over the importance of communication in
English particularly, and I heard my relative saying these
words , “……he speaks English ,he eats in English, he walks
in English, he is now English…”Earlier also I came across
such lines while reading about the dilemma of English
language learners. Again hearing such type of statement from
my relative on the one who returned from the foreign land
after 2 years of his stay made me realize that, the notions
about the language have changed in the Indians but the way
they express shows their weak communication skills. That
statement she made, needed to be concluded in just a single
line”…...He is good at English...”but such a bold expression
of English with Hindi along with emotional touch, showcased
the real self of the Indian user’s efficiency in this language, in
my country. This is one example there are many more to be
seen in our surrounding. Here the importance of
communication for an individual mechanically arises for
effective growth of personality. Thus right path for the second
language learner would be in acknowledging the
communication as the self-motivated interactive process that
involves the effective diffusion of facts, ideas, thoughts,
Figure:1
feelings and values for appropriate drawing of colloquial and
metaphoric phrases under the umbrella of communication. As
Halliday (1978, p. 169 explains, communication is more than
merely an exchange of words between parties; it is a
“…sociological encounter” (Halliday, p. 139) and through
exchange of meanings in the communication process, social
reality is “created, maintained and modified” (Halliday, p.
169).Such is the importance of English in Communication.
4. LEARNING TO COMMUNICATE
When dealing with the process of learning the role of the
learner as well as the teacher is integral in learning a
language. The role of the teacher in the process of learning is
721
ISBN: 978-81-924893-0-8
quite important. Communication is an interactive process. The
learner as well as the teacher has to focus and understand the
importance of the two communication agents involved in the
communication process, sender (S) and receiver(R). Both the
communication agents exert a reciprocal influence on each
other through inter-stimulation and response.
For this the teacher has to know the individual needs of the
students. And this can only be known in a better way when
the learners perform a task in the class. And they accomplish
the task to become linguistically diverse students. Task-based
approach seems to be suitable for teaching and learning the
four skills-
Figure:2
Here the knowledge of four skills in the language acquisition
works to bring the language in the coherent, cohesive manner.
This brings the overall success of a student in the learning
process. Being able to communicate effectively and clearly in
your own environment and comfort zone may seem tricky, but
it increases exponentially in a different phases of life. So the
role of the teacher moves towards making an environment
with:
o Emphasis on speaker's purpose.
o Analysis of the signals coming.
o Awareness for what has gone before.
o Positivity in attitude.
o Responsibility to the speech.
o Distractions Forefend mode.
o Materials evaluation.
o Non-verbal clues.
4. CONCULSION
For the efficiency of the language ,the teacher, the learner,
the settings and the language strands must be interwoven
The realization will accept the change in the teaching style
with address to the learner, the learner becomes motivated
here and the resources are explicating the worth of the
language for the second language learner. The skills of the
listening, reading, speaking, and writing along with the
knowledge of vocabulary, morphology, spelling,
pronunciation, syntax and understanding associate to
produce learning for authentic communication. The whole
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

purpose is to make the second language learners able users
of the language. If one is good in speaking and listening is
he good at English? Is one person is good at reading and
writing, he is good at English? So answer is automatically
clear, for communication we have to be good in all the
four skills rather than, to be just good at one or two or
three. Assimilating all the knowledge and using it for
communication, for expressing easy and even complex
situations resolves the purpose of learning English.

REFERENCES [6]National council of teachers of English: Report on English

[1]George,M.,2007.Classroom Activities for building
vocabulary. The journal of English language teaching,
India:vol.45/1:35-39.
[2]George, H.V., 1971.English for Asian learners: are we on
the right road? English language teaching,xxv:270-277
[3]Ravi.P.V, 1998. The motivational problems with references
to teaching-learning English as a second language.
[4]S.Devika Malini, 2011, English language teaching in India-
a critical evaluations of ELT in India.
language learners directed by Anne Ruggles Gere.
[7] M. Mojibur Rahman :ESP World, Issue 1 (27), Volume
9, 2010: Teaching Oral Communication Skills: A Task-based
Approach.
[8] Halliday, M.K., 1978. Language as social semiotic.
Edward Arnold, London.
[9] Corder, S.P. 1980: Second language acquisition research
and the teaching of grammar.BAAL Newsletter 10.

[5]Mccarthey,S.J.,Garcia,G.E.,Lopezvelasquez,A.M.,&Guo,S.
H.()2004).Understanding contexts for English language
learners. Research in the teaching of english38 (4):351-394.

722
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

An Experimental Investigation on Aluminium based

Composite Material reinforced with Aluminium oxide,
Magnesium and Rice Husk Ash Particles through Stir
Casting Technique

Rajiv Bharti Er.Sanjeev Kumar Er.Jaskirat Singh

Spec Lalru (Pb.) Bgiet,Sangrur (Pb.) Bgiet,Sangrur (Pb.)
er.rajiv0009@gmail.com sanjeevgoldy3@hotmail.c Jaskirat.sliet@gmail.com
om

ABSTRACT
Manufacturing of aluminum alloy based casting composite
materials via stir casting is one of the prominent and
economical routes for development and processing of metal
matrix composite materials. In this experiment Al based
composite material is manufactured and different tests are
performed knowing the properties of composite material and Figure - 1.1 Classifications of Composite
also optical photomicrograph was used for taking
observations of the microstructure revealed that the dispersion Materials wit Metal Matrices
of micron size particles were more uniform. The result
1.2 Natural Composites:
reveals that stir casting could be an economical route for the
production of composite. The composites thus produced were
Several natural materials can be grouped under natural
characterized for their mechanical properties such as hardness
composites e.g. bones, wood, shells, pearlite (steel which is a
and tensile strength. This paper represents a stir casting mixture of a phase and Fe3C) etc.
process, process parameter and preparation of aluminum,
composite like aluminium oxide, magnesium and rice husk
ash reinforcement by varying proportions. Tensile strength
and Brinell hardness number increases with on increasing
percentage of aluminium oxide, magnesium and rice husk ash.

1. INTRODUCTION
Composite materials are engineering combinations of two or
more materials in which properties are achieved by scallop shell
combinations of different constituents. The various types of
engineering composites are found in industry including Figure -1.2 Natural Composite
polymer matrix, ceramic matrix and metal matrix composites.
The field of science and technology demands the development 1.3 Man-Made Composites:
of advanced materials especially in the field of transportation,
aerospace and military engineering related areas. These area Man-made composites are produced by combining two or
demands light weight, high strength materials having good more materials in definite proportions under controlled
tribological properties. Such demand can only be met by conditions e.g. Mud mixed straw to produce stronger mud
development and processing of aluminium metal composite mortar and bricks, Plywood, Chipboards, Decorative
materials. The main challenge in the development and laminates, Fibre Reinforced Plastic (FRP), Carbon
processing of engineering materials is to control the Composites, Concrete and RCC, Reinforced Glass etc.
microstructure, mechanical properties and cost of the product
through optimizing the chemical composition , processing
method and heat treatment .

1.1 Classification of Composites

Composites are classified by the geometry of the

reinforcement, particulate, flakes, and fibres or by the type of
the matrix –metal, carbon and polymer .
Plywood Bricks
Figure-1.3 Man-Made Composites

723
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

1.4 Aluminium
During cooling stirring is started at
Pure aluminium is taken as base material which is found 98% the semi-solid condition and
pure and 2% is another element. continued until a temperature
where less than 30% of the metal is
1.5 Aluminium Oxide solidified is reached

Aluminium oxide is a chemical compound of aluminium and

oxygen with the chemical formula AL2O3.It is the most Pouring into the mould
commonly occurring of several aluminium oxides. Also called
alumina, and also be called aloxide, aloxite or launder
depending on particular forms or applications.AL2O3 is
significant in its use to produce aluminium metal, as an
Withdrawal of the composite from
abrasive owing to its hardness , and as a refractory material
owing to its high melting point. the mould

1.6 Magnesium

Magnesium is chemical element with symbol Mg and atomic Desired fabricated MMCs ingots
number 12. it is a highly flammable metal, but while it is easy
to ignite when powered or shaved into thin strips.
Figure-3.1 Flow Chart Showing Steps inInvolved in Stir
1.7 Rice Husk Ash Casting

Rice husk is known as rice husk ash (RHA).This RHA in

turn contains around 85% -90 % amorphous silica.RHA is
3.1 Work Plan for Experiment
used for high strengthness.
Initial testing for sample The
2. RESEARCH GAP Microstructure

Different materials are used for increasing mechanical

properties in composite material, for composite material
matrix and reinforcement are of prime importance .There are Sample Preparation through Stir
lots of gaps found in material selection and tests performed. Casting

Rice husk ash is used in different ratios which are used as a

good insulator and temperature is maintained. Different ratio
Keep the samples under
of Aluminium oxide and magnesium are used to maintain the
properties of composite material. varying temperatures for Time
period
3. PROBLEM FORMULATION
Obtain optical
There has been an increasing interest in composites containing
low density and low cost reinforcements. The specimens photomicrograph
produced will be tested and then subjected to varying
temperatures (1000 C to 8500 C) for a period of 60- 90 days.
Draw Comparison between
Flow Chart showing steps involved in Stir Casting initial and final condition

Collection and Preparation of the

raw materials to put Results and conclusion

Placing raw materials in a Scope for future work

graphite crucible under nitrogen
gas into a furnace
Figure-3.2 Work Plan for Experiment

Heating the crucible above the

liquid us temperature and
allowing time to become
completely liquid

724
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

4. EXPERIMENTAL PROCEDURE
4.1 Stir Casting

Stir casting is a liquid state method of composite

materials fabrication, in which a dispersed phase (ceramic
particles, short fibers) is mixed with a molten matrix
metal by means of mechanical stirring. The liquid
composite material is then cast by conventional casting
methods and may also be processed by conventional Metal
forming technologies. Stirring is necessary to help in
promoting wet ability i.e. bonding between Matrix and
Reinforcement. Stirring speed will directly control the flow Figure 4.1: Preheating the composite material
pattern of molten metal .Parallel flow will not promote good
reinforcement mixing with matrix .Hence flow pattern should 4.4 Preheating
be controlled turbulence flow. Pattern of flow from inward to
outward direction is best. In this experiment stirring speed Preheating involves heating the base metal, either in its
from 300-400 rpm is kept. As solidifying rate is faster it will entirety or just the region surrounding the joint, to a specific
increase the percentage of wet ability. Aluminum melts at desired temperature, called the preheat temperature.
6500 C-8000 C. Alumina particles are preheated at 9000 C Reinforcement was preheated at specified 5000C to 6000 C
respectively for 1hr to 3 hrs. to make their surface oxidized. temperature 30 minutes to 50 minutes in order to remove
The furnace temperature of Al near above 7500 C to melt the moisture or any other gases present reinforcement. The
Aluminum alloy and then cool down just below the liquid us preheating of also promotes the wet ability of reinforcement
to keep the slurry in semi solid state. Automatic stirring was with matrix.
carried out with help of radial drilling machine for about 10
mints. At stirring rate of 300 r.p.m. at this stage alumina 5. RESULT AND DISCUSION
particles were added manually to vortex.
5.1 Optical Photomicrograph Analysis
4.2 Stir Casting is characterized by the following
features Photomicrograph is opposed to a macrographic image, which
is at a scale that is visible to the naked eye. It is used for taken
1. Motor with stirring system at 270 r.p.m a digital image through a microscope to show a magnified
2. Heating Furnace (5000C-11000C) image of an item. The optical microscope remains the
3. Crucible fundamental tool for phase identification. The optical
4. Stirring blade (450-600) microscope magnifies an image by sending a beam of light
5. Plug through the object. At a basic level, photomicroscope may be
performed simply by hooking up a regular camera to a
4.3 Rice Husk Ash microscope, thereby enabling the user to take photographs at
reasonably high magnification.
Rice Husk is burnt in controlled temperatures which are
below 700 degrees centigrade. This ash generated is
amorphous in nature. The transformation of this amorphous
state to crystalline state takes place if the ash is exposed to
high temperatures of above 850 degrees centigrade. When this
RHA is spread as a coating over the molten metal in the ladle,
it acts as a very good insulator and the temperature is
maintained and does not cool down quickly, hence reducing
the breakdown time of the casting. Rice milling generates a
byproduct known as husk.

Table 4.1: Composition of Material and

Percentage
Figure 5.1: Schematic diagram of Optical
photomicrograph
Al (gm) Al2O3(gm) Mg (gm) Rice Husk Ash
Type (%) (%) (%) (gm) (%)

Sample- 1200 25
120 (7.29%) 300 (18.23%)
1 (72.9%) (1.519%)

Sample- 1200 300 Sample 1 Sample 2

50 (2.3%) 600 (27.9%)
2 (55.8%) (13.95%) Figure 5.2: Specimen Sample

725
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The samples are casting according to the technical form. Aluminium is used as a matrix in several fibre
specifications. reinforced composites. Al2O3, an oxide of Al is very hard and
strong and can be dispersed in the matrix of Al by powder
Stir casting process is mostly useful for composite material metallurgy to produce SAP (sintering aluminium product).
.Composites are solids made from more than one material.
Composites are designed so that the properties of the metal
and composite utilize the properties of the components.
Optical photomicrograph shows that the micro structural
changes have been found between the sample 1 and sample 2,
at different level. The incorporation of as received
reinforcement (Al2O3, Mg, and RHA) in Al alloy by liquid
metal stir casting has resulted in agglomeration of particles.

Figure 5.6: Optical photomicrograph of Al based

composite material of Sample 2 at 50 µm

At 50 µm sample 2 clearly shows grain particles of reinforced

material. Al when added in Mg in range of 3 to 10% with
small amounts of Zn ad Mn increases strength, hardness and
castability.

Figure 5.3: Optical photomicrograph of Al based

composite material of Sample 1 at 100 µm

Optical photomicrograph is carried out at 100µm on sample 1,

which are showing bonding structure between matrix
(aluminium) and reinforcement (Al2O3, Mg, RHA) in small
particle grain size. Black Particles are showing Al2O3. The
wt% of Al2O3 is 7.29, Mg is 1.519.Rice husk ash is used as
strength purposes.
Figure 5.7: Optical photomicrograph of Al based
composite material of Sample 1 at 20 µm

At 20µm reinforced particles changes their size of images.

The density of aluminium is 2.7g/cm3 but Mg having
1.74g/c.m3Mg much costlier than aluminium with it compares
for lightness.

Figure 5.4: Optical photomicrograph of Al based

composite material of Sample 2 at 100 µm

In Sample 2 the wt% of Al2O3 is taken 13.95 and wt%

change in Mg is 2.3 and RHA is 27.9,but Al alloy wt% is
constant.

Figure 5.8: Optical photomicrograph of Al based

composite material of Sample 2 at 20 µm

At 20µm in sample 2 reinforced particle are clearly visualised,

their properties are changed, strength hardness of this material
are more than sample 1.but hardness not same.

5.2 Tensile Strength Test

Figure 5.5: Optical photomicrograph of Al based
composite material of Sample 1 at 50 µm
At 50 µm images change its size and in sample 1, grain size,
alumina and Mg particles are visualized in small particles
Tensile test is performed on universal testing machine. The
shaper machine used for specimens, from sample-1 and
sample-2 to generate proper size and dimension according to
UTM machine. Tensile strength measures the force required

726
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

to pull something such as rope, wire, or a structural beam to

the point where it breaks.

Chang
Original Elongat
Breakin e in
Gauge ion
S.No. gLoad length
Length
(KN)
(mm) (%)
(mm) Diagram 5.12

Specimen
10.8 91.0 1.3 1.4 Table 5.2: Tensile Strength Test
1

Specimen
29.6 83.5 1.1 1.3
2

Percentage Elongatio = 1.4

Percentage Elongation = 1.3

During tensile test on specimen-1 elongation is 1.4% at

Figure 5.9: Universal Testing Machines
The tensile strength of a material is the maximum amount
of tensile stress that it can take before failure, for example
breaking. Tensile test used to assess the mechanical behaviour
of composites and matrix alloy. If reinforcement wt%
increases UTS are also increases. This happen may be to
dispersion motion, this May results increase in tensile strength
of reinforcement
Specimen -1 Specimen-2
breaking load of 10.8 KN.
In specimen-2 an elongation of 1.3% is found at breaking load
of 29.6KN .Tensile strength in specimen-2 is more than
specimen-1, i.e. 29.6 KN.
This may happen due to different percentage of alloying
elements in specimen-2, which results in increased tensile
strength.
5.3 Brinell Hardness Testing Machine
There are many designs of commercially manufactured
Brinell hardness testing machines. The dial indicating-gage
was the original method used in Brinell machines for
measuring the indentation depth and for calculating and
displaying the Brinell hardness number. The general principle
of its operation is to mechanically measure the movement of
the indenter through a multiplying lever system. The dial face
is calibrated to indicate the Brinell number corresponding to
the displacement of the indenter. Usually, the dial divisions
have represented whole Brinell numbers, allowing an
estimation of the hardness number to only ½ Brinell units.

Figure 5.10 Tensile Test Specimen-1 and Tensile Test

Specimen-2

Diagram 5.11
Figure: 5.11 Brinelll Hardness Tester

727
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

The hardness found in test specimen-2 is higher as compared

to test specimen-1. Its average hardness Number is 156.4.
Depth of indentation and Diameter of indentation are different
at all number of impressions. Hardness numbers increased
Specimen-1 Specimen-2 when diameter of indentation decreased.
Figure: 5.12 Specimens for Hardness Specimen-1 is soft material because of same hardness
number at different points. Its average hardness Number is
138. In specimen-1 depth of indentation are different but the
Table 5.3: Test Specimen No.1 (Steel Ball Indenter 5mm Ø
diameter of indentation are same .at different number of
and load applied 250 Kgf) impressions. Hardness number also same due to diameter of
indentation.
No. of Dia of Form Brinell Hardness Test specimen-2 from sample -2 found
Diameter of
Impress Indentation,d B.H.N more hard then specimen-1 from sample-1.
Ball,D (mm)
ion (mm)
1 138 REFERENCES
5 1.5
2 138 [1] Attia, A.N. (2001),“Surface metal matrix
5 1.5 composites”, “Production Engineering and Mechanical
3 138 Design Department”, pp. 451-457.
5 1.5
[2] Hashim, J. (2001),“The production of cast metal matrix
4 138
5 1.5 composite by modified stir casting method”, pp. 9-20.
5 138 [3] Surappa, M.K. (2003),“Aluminum matrix composites:
5 1.5
Challenges and opportunities”, Vol.28, pp. 319–334.
Average
Hardness 138 [4] Das, S. (2004),“Development of aluminum alloy
Number composite for engineering applications”, pp. 325-334.

[5] Aqida, S. N., Ghalazi, M. I. and Hashim, J.

(2004),“Effects of porosity on mechanical properties of metal
Table 5.4: Test Specimen No.2 (Steel Ball Indenter 5mm Ø
matrix composite: an overview”, pp.17-32.
and load applied 250 Kgf)
[6] Choudhury, S. K., Singh, A. K., Shivaramakrishnan, C. S.
S. and Paanigrahi, S. C. (2004),“Preparation and thermo
No. Of Dia of mechanical properties of stir castAl-2Mg-11TiO2 ”, Vol. 27,
Diameter of
Impress Indentation,d B.H.N pp. 517–521.
Ball, D (mm)
ion (mm)
148 [7] Rajan, T.P.D., Pillai, R.M., Pai, B.C., Satyanarayana, K.G.
1 5 1.45 and Rohatgi, P.K. (2007), “Fabrication and characterization of
Al–7Si–0.35Mg/fly ash metal matrix composites processed by
171
different stir casting routes Materials and Minerals Division”.
2 5 1.35
185 [8] Kumar, S. (2008),“Production and Characterization of
3 5 1.3 Aluminum –Fly Ash Composite using Stir Casting Method”.
140
4 5 1.49 [9] Singla, M., Dwived, D., Deepak, I., Singh, L., and
138 Chawla, V. (2009),“Development of Aluminum Based Silicon
5 5 1.5 Carbide Particulate Metal Matrix Composite”, „Journal of
Average Minerals & Materials Characterisation & Engineering‟, Vol.
Hardness 8, pp. 455-467.
156.4
Number

728
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Role of Youth and media in modern communication
system
Harpreet Kaur
SD College, Barnala, Punjab, India
gudluckhoney@gmail.com
ABSTRACT
Youth is always big treasure of every country .Every
country wants their youth take right path and give
positive services to them .but now a days we are living in
two worlds one is real and another is a virtual world. It is
our responsibility to give a complete healthy
environment to beginners‟ .it will be possible if we
discuss the problem of misuse of communication media
which spoils our young generation with free flow of
illegal and unneeded information. With the free flow of
information today everybody is living under the pressure
of information which is usually unrequired. Today a
single person is able to shoot a video, click a photograph,
write some texts and circulate it in the world in couple of
seconds with the use of internet or any other media. No
any certificate or registration is required to do so. There
is no any law to stop this type of flow but only education
is such a weapon which can stop youth to surf or upload
unauthentic information which they find authentic as
they are in adolescent age.
Mass circulation of bad content can be stopped by mass
educates and mass education .we should have to make a
campaign to educate young people towards good use of
media. Give significance of media for their lives.
Religion, education departments, family members, health
departments and governments play a big role to stop
youth from illegal surfing. If youth can give million s of
likes to a good moral on social networking sites then it is
not impossible stop them from surfing bad and illegal
content from sites or upload bad content. If we think
about save earth from pollution then it is very essential
factor to save our virtual world from bad information.
Keywords
Communication media, social networking, media effects
on youth
ROLE OF YOUTH AND MEDIA
Media play vital role in modern communication system
Growth of every area of life is dependent on
communication media we can find information from any
where, any time, in any mode about anything .Regional
distance does not matter in new media communication
system. but every big power demands more
responsibility towards planet . According to Paediatr
Child Health the influence of the media on the
psychosocial development of children is profound. Thus,
729
ISBN: 978-81-924893-0-8
it is important exposure to media and to provide
guidance on use of all media, including television, radio,
music, video games and the Internet(4).
The objectives of this statement are to explore the
beneficial and harmful effects of media on mental and
physical health. Every media effects growing age in both
positive and negative ways. Television is that media
which capture our growing youth easily and we do not
move from our routine. According to Paediatr Child
Health Television has the potential to generate both
positive and negative effects, and many studies have
looked at the impact of television on society, particularly
on adolescents. An individual youth s developmental
level is a critical factor in determining whether the
medium will have positive or negative effects. Music
videos may have a significant behavioral impact by
desensitizing viewers to violence and making teenagers
more likely to approve of premarital sex. Up to 75% of
videos contain sexually explicit material, and more than
half contain violence that is often committed against
women(4). Women are portrayed frequently in a
condescending manner that affects children‟s attitudes
about sex roles.
Music videos may reinforce false stereotypes. A detailed
analysis of music videos raised concerns about its effects
on adolescents‟ normative expectations about conflict
resolution, race and male-female relationships.
Music lyrics have become increasingly explicit,
particularly with references to sex, drugs and violence.
Research linking a cause-and-effect relationship between
explicit lyrics and adverse behavioral effects is still in
progress at this time. very least, parents should take an
active role in monitoring the music their children are
exposed to.
Not all television programs are bad, but data showing
the negative effects of exposure to violence,
inappropriate sexuality and offensive language are
convincing. Because of media takes time away from
exercise activities, people who watch a lot of television
are less physically fit and more likely to eat high fat and
high energy snack foods. Media makes a substantial
contribution to obesity. According to Children,
adolescents, and television American Academy of
Pediatrics Committee on Communications the fat content
of advertised products exceeds the current average
Canadian diet and nutritional recommendations, and
most food advertising is for high calorie foods such as
fast foods, candy and presweetened cereals. Commercials
for healthy food make up only 4% of the food
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
advertisements shown time of youth(7). The number of
hours of as viewing also corresponds with an increased
relative risk of higher cholesterol levels in people.
Television can also contribute to eating disorders in
teenage girls, who may emulate the thin role models seen
on television. Eating meals while watching television
should be discouraged because it may lead to less
meaningful communication and, arguably, poorer eating
habits. One more aspect of media that the amount of
violence on the rise. The average person sees 12,000
violent acts on television annually, including many
depictions of murder and rape. More than 1000 today,
television has become a leading sex educator. Between
1976 and 1996, there has been a 270% increase in sexual
interactions during the family hour of 2000 hours to 2100
hours on television (4). Media exposes children to adult
sexual behaviors in ways that portray these actions as
normal and risk-free, sending the message that because
these behaviors are frequent, „everybody does it‟. Sex
between unmarried partners is shown 24 times more
often than sex between spouses, while sexually
transmitted infections and unwanted pregnancy are rarely
mentioned.
A detailed guide to responsible sexual content on media,
in form of films and music can be found in other peer-
reviewed publications. Some people believe that the
media can influence sexual responsibility by promoting
birth control, such as condom use. No current empirical
evidence supports this concept; it is expected that the
debate will continue. Another is advertisement. There is
evidence that passive advertising, which glamorizes
smoking, has increased over the past few years.
Media not the only way that youth learn about tobacco
and alcohol use; the concern is that the consequences of
these behaviors are not accurately depicted on media.
One-half of the G-rated animated feature films available
on videocassette, as well as many music videos, show
alcohol and tobacco use as normative behavior without
conveying the long term consequences of this use. The
average person sees more than 20,000 commercials each
year(9). Advertisements targeting adolescents are
profoundly influential, particularly on cigarette use.
Its like uranium which is a great source of energy but
now whole world afraid from its misuse or carelessness
in uranium plants. New media communication system is
also like uranium because it can be use by mischievous
persons or could be with carelessness. Convergence of
communication media make it easy to take world in your
pocket and it is also very easy to become a part of
breaking news within a night. A minor user of
communication media is capable for reach to every kind
and mode of information for example text, pictures,
graphics, moving visuals etc. The flow of information
from sender to receiver is faster without any obstacle of
rule and regulation.
Free flow of information is mix up of wanted and
unwanted content, and people are lives under the
pressure of information. Sarabjit Kanganiwal adds a
quote according to American amendment on our
730
ISBN: 978-81-924893-0-8
planet, every person live under 800 megawatt pressure as
per year. It is same as atmosphere pressure but different
from gravity of earth .an d we do not feel it. Kanganiwal
also add a research study which is done by university of
California, Barkley on the base of 1999 year that
Information store is increased about 43% only in
registered matter .now every year it increase around
30%.Accordinng to professor Peter lemen ,chief of
experiment in year 2002 that 5 Exabyte new information
is present only in the mode of papers ,films, magnetic
discs and optical storage devices. In other words to save
this such information we need 5 lakh libraries equal as
American library of congress which contains 1 crore 90
lakh books and 5.6 crore fonts(1). This data is only
related to written format, TV broadcasting and telephone
conversations are not included in it. So in other words
information growth rate is more than human being
growth rate. We are totally controlled by information
.without information we cannot move a while .every
source which we use now a days are not useful without
related information .Information became s need of
human being as like air, water and food. This all
information travels by media so media is very important
in new age But free flow of information affect youth
.youth are more aggressive towards everything they also
easy learner to tackle new media(5) techniques then other
age groups so with access freedom to use these media in
any manner they does not follow cultural and civil values
and laws .They move their energy in rebellious ways
against traditions. According to Rio de janeiro Young
People & Media in the World Today Approximately one-
third of the world‟s population is made up of 2 billion
young people under 18(3). They make up half the
population in the least developed nations; less than a
quarter in the most industrialized ones. Their challenges
range from basic survival to discrimination and
exploitation. Moreover, there are myriad differences in
cultures, traditions and values. Nevertheless, children
and youth everywhere share some universal traits. They
are fundamentally more optimistic, more open and
curious than their adult counterparts. Increasingly,
children are enjoying unprecedented freedoms in many
countries. Arguably, the proliferation and globalization
of media are among the key factors that have shaped and
defined the current generation of young people. In many
countries, youth have access to a greater number of
multi-media choices than ever before— conventional,
satellite and cable TV channels; radio stations;
newspapers and magazines; the internet and computer
and video games. In addition, many are exposed to the
same programs, the same characters and the same
marketed spin-off products. Today there is greater
availability of foreign programming and media, and less
official censorship and control in many parts of the
world. Information, email and images flow around the
world faster and more freely than ever. Indeed, mass
media are making the world smaller, and culture and
media are increasingly inextricable, especially for young
people. in other words young people are not much
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
educated to use media in appropriate way. Recently
Pakistan blocked YouTube a social networking site. A
Pakistan explanation behind blocking the particular site
is that they have not an ultimate technique to remove
sensational matter from the YouTube or their have not
any way to stop people to surfing unwise or illegal
matter. Their religion and cultural values do not allow
them to permit their children or young people for
watching those type of videos .this is the authentic
answer for why we have to worry about media and youth
.but blocking the site is not a justify and proper solution
of the problem .its also looking unjustified for youth and
media.
Two another elements demand justify that are democracy
and media literacy. According to Andy Rudduck, media
influence young people are often about the nature of
democracy. He also describes the quote of Henry Giroux,
the matter of how youth use media, and how they are
permitted to do so, is the very stuff of democracy(2):
So as per law new media is totally democratic .every
person having similar right to use and distract with
information of new media. Young people feel more
democratic when they use media to give respect to
equality of human being but problem is only there when
they use it for disturb the system of regulations and
duties. We have to create criteria where youth have
permission to use media in some relevant fields. This
criteria can be maintained by some spheres of our society
.first and basic sphere of communication is our family
because family is a primary group of communication
system janeiro also describe parents at first according to
janerio, Quality of Media for Children & Youth Growing
Concerns over Lack of Quality & Control As media
options for most children have grown in recent decades,
so too have concerns about the quality of media aimed at
children(3). Growing numbers of parents, educators,
researchers and policy-makers around the world are
alarmed about the lack of quality media for children and
young people and the growing availability of low-quality
entertainment featuring violence, sexual content,
undesirable role models and lack of diversity. There are
also serious questions about the short- and long-term
effects of this material.
Janerio also add a quote of Dr. Francis B. Nyamnjoh,
University of Botswanato the impressionable,
unquestioning and imitative nature of children. How
much the mass media influence children and young
people is somewhat debatable, but sociologists and
researchers in different regions have observed some of
the following adverse effects: —growing influence of
entertainment media on youth style and identity —
decreasing role of traditional sources of influence:
family, school, community, religion, etc(3). Parents have
to monitor and control their children‟s viewing habits.
Studies show that parents play an important role in their
children‟s social learning, but if a parent‟s views are not
731
ISBN: 978-81-924893-0-8
discussed explicitly with children, the medium may teach
and influence by default. Other media, such as
magazines, radio, video games and the Internet, also
have the potential to influence children‟s eating habits,
exercise habits, buying habits and mental health. If
children are allowed to be exposed to these media
without adult supervision, they may have the same
deleterious effects.
Parents have to do their natural responsibility towards
their children. They must instruct them for meaning full
use of media .we also welcome to religion in it because
every religion can make list to their followers for avoid
misuse of communication of media .but they must not
target to principles and feelings of another religion and
casts.
Parents may feel outsmarted or overwhelmed by their
children‟s computer and Internet abilities, or they may
not appreciate that the „new medium‟ is an essential
component of the new literacy, something in which their
children need to be fluent. These feelings of inadequacy
or confusion should not prevent them from discovering
the Internet‟s benefits. The dangers inherent in this
relatively uncontrolled „wired‟ world are many and
varied, but often hidden. These dangers must be
unmasked and a wise parent will learn how to protect
their children by immersing themselves in the medium
and taking advice from the many resources aimed at
protecting children while allowing them to reap the rich
benefits in a safe environment.
The Internet has a significant potential for youth to
educational information, and can be compared with a
huge home library. However, the lack of editorial
standards limits the Internet‟s credibility as a source of
information. There are other concerns as well.
The amount of time spent watching television and sitting
in front of computers can affect postural development(4).
Excessive amounts of time at a computer can contribute
to obesity, undeveloped social skills and a form of
addictive behavior. Although rare, some persons with
seizure disorders are more prone to attacks brought on by
a flickering television or computer screen.
Other concerns use the Internet to lure young people into
relationships. There is also the potential for children to
be exposed to pornographic material. Parents can use
technology that blocks access to pornography and sex
talk on the Internet, but must be aware that this
technology does not replace their supervision or
guidance(6).
Second is educational group. High school programs
promoting media awareness have been shown to be
beneficial. They give students more understanding of
how the media may affect them socially. In Canada, the
Media Awareness Network has a number of resources
that can be used by both professionals and the public to
promote media literacy(4). Their resources are
comprehensive, current and specifically applicable to
Canadian culture(6).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

cooks is also in favor in this he said the challenges of according to UNICEF”s Voices Of Youth Website(3)
teaching media and cultural politics to young students “Many young people also appreciate media content that
who grappled with issues of race, class, gender and deals credibly with topics they may find difficult to
sexuality both inside and outside the seminar room have
discuss with parents or adults, such as personal
been recognized (e.g. Cooks, 2003)(2). To support it, it is
necessary for institutes to motivate students for authentic relationships, sexuality, AIDS, drugs, self esteem, etc.
use of media .they can teach this subject additionally or They value factual information and advice provided by
arrange workshops, seminars and conferences. But in the experts, as well as material prepared and presented by
opposite Davinia Frou Meigs said (2008) all argued that young people themselves. In focus groups Inter Media
the reason why media education has never been so has conducted in different countries, youth say they
important was because media industries have never been believe only young journalists can really understand their
so powerful and national governments have never been
problems.”(3). In nutshell media is very important but if
less enthusiastic about regulating them(2). We take it as a
suggestion so last but not least in governmental groups‟ we seeks some problems with media than we have to
organizational group because every person does work for improvise it with alter the use of media and education
his country and government. Government takes among young generation.
responsibility to educate her young generation towards
every new field .governments can block that websites REFERENCES
which contains only unwise matter and which are totally
concerned with profit holding and not for information,
[1] Refrences: Sarabjit Kanganiwal, Patarkarita Smaj
education and tolerate able entertainment. A government
also takes hard steps towards mischievous persons who Evam Bazar, Unistar books PVT.LTD,
plays with feelings of society and becomes reason of Chandigarh , 2006.
somebody‟s sorrow.
[2] Andy Ruddock ,YOUTH AND MEDIA, SAGE
Health departments can increase their limits on media
Publications Ltd , Monash University,
because health is very necessary for every person Janerio Australia,2013
also add sexually transmitted diseases, growing health
problems by media misuse. Beside it many organizations [3] BRAZI4th world summit on media for children
like UN make some media laws. United Nations and adolescents RIO DE JANEIRO, BRAZL April
Convention on the Rights of the Child The UN 2004
Convention on the Rights of the Child (CRC), adopted in [4] Paediatrics and child health
1989 and ratified by all but two countries, clearly spells www.ncbi.nlm.nih.gov may 2003
out the rights to which all children everywhere are
entitled. According to rio de janerio it contains four basic [5] Russel Nueman ,New Media,www.wikipedia.com
principles to guide political decision-making affecting 2003
the child: 1) the best interests of the child should be a
[6] Sexuality, contraception, and the media
primary consideration in such decisions; 2) opinions of committee on public education,2003
children themselves should be heard; 3) child
development, not only survival, should be ensured; 4) [7] www.aplnet.org/resources/adsummary.2003 pdf.
each child should be able to enjoy his/her rights, without
discrimination(3). Several of the CRC's key articles deal [8] www.cmpa.com/tvent/violence2003htm
with the media and children. As the article13 enshrines
[9] Depiction of alcohol, tobacco and other substances
the right to freedom of expression this right shall include in G-rated animated feature films, Thomson KM,
freedom to seek, receive and impart information and Yokota F, June 2001.
ideas of all kinds, regardless of frontiers, either orally, in
writing or in print, in the form of art, or through any
other media of the child's choice." Article 17, together
with Articles 12 and 13, should contribute not only to the
development of well-informed citizens, but to young
people's voices being heard more and more through the
mass media(3). It sends a clear message that children
should be both participants in and beneficiaries of the
information revolution. In other words we do not ignore
the rights of youth for find information from media but
we can only educate them or regulate the media. We
have to understand the world of youth, the present issues
in ways that are too serious, pedantic or patronizing. In
addition, youth in countries with widespread poverty,
corruption, political turmoil and/or disease also seek
realistic, relevant and meaningful content to help them
understand and cope with hardships they face in their
daily lives. We also do not ignore the vital role of media

732
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

A Review Study on Presentation of Positive Integers as

Sum of Squares
Ashwani Sikri
Department of Mathematics, S. D. College Barnala-148101
Email: ashwanisikri9@gmail.com

ABSTRACT stating fundamental identity which allow one to express

the product of two sums of four squares as such a sum
It can be easily observed that every positive
and some other crucial results.
integer is represented as sum of squares. In 1640, Fermat
stated a theorem known as “Theorem of Fermat” that

every prime of the form can be expressed as Keywords

sum of two squares. On December 25, 1640, Fermat Integers, Prime, Squares, Sum, Euler
communicated proof of this theorem in a letter to
Mersenne. However the proof of this theorem was first
INTRODUCTION
published by Euler in 1754, who in addition succeeded to
show that the representation is unique. Later it was We begin our efforts to characterize
proved that a positive integer n is representable as the which positive integers can be written as the
sum of two squares if and only if each of its prime factors sum of two squares, the sum of three squares
of the form occurs to an even power in the and the sum of four squares by examining the
canonical form of n.
first few positive integers.
Diophantus conjectured that no number of the form

for non negative integer λ, is the sum of three

squares which was verified by Descartes in 1638. Later
Fermat stated that a number can be written as a sum of
three square integers if and only if it is not of the form

where m and λ are non-negative integers.

This was proved in a complicated manner by Legendre in
1798 and more clearly by Gauss in 1801.
In 1621, Bachet gave a conjecture that “Every So, we see that positive integers are
positive integer can be written as sum of four squares,
represented as sum of four or less than four
counting ” and he checked this for all integers upto
squares.
325. Fifteen years later, Fermat claimed that he had a
Sum of two squares
proof but he gave no details. A complete proof of the four
square conjecture was published by Lagrange in 1772. We begin with problem of
The next year, Euler offered it is much simpler representing positive integers as sum of two
demonstration of Lagrange‟s four squares theorem by

733
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

squares, for this we will first tackle the case Theorem of Fermat[2]:- An odd prime p is
when positive integer is prime. expressible as sum of two squares if and only

if
Theorem:- No prime p of the form is Proof:- Let p be written as sum of two
written as a sum of two squares[1].
squares say … (1)

Claim
Proof:-
Suppose
Let
Then …… (2)
 ……
Also …… (3)
(1)
Suppose if possible that p is written as sum of So, (2) & (3) implies

two squares Which implies that by (1)

i.e. where a, b are positive Which further implies that (because p is

integers. prime)
Now, for any integer „a‟, we have Now



…… (2)
 by (1)
Similarly,
Which is not possible
…… (3)
So
From (2) and (3), we have
In Same way
, which
contradict (1). Now

So, our supposition is wrong. Hence, p is not 

written as sum of two square.  Congruence has unique

Solution say
Wilson’s Theorem:- If p is a prime then
 …… (4)
[1]
(1) 

Thue’s Theorem[1]:- Let p be a prime and a

Modulo p above equation by use of four
be any integer such that Then
becomes;
the congruence has an
integral solution , where, .000000

734
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

 

 has sol  [Because

 is quadratic residue of p ]

 

Converse Let So Thue‟s theorem implies that the congruence

 is a has solution

positive integer Where and x0,

Now p is prime so by Wilson theorem we have y0 are integers.
i.e.
1.2.3 …………… 
 by use
 1.2. ……….
of (5)
……….
 [Because
[Because
congruence ≡ is symmetric relation]


]
 …….. (6) [for

 1.2………. ………… some ]

Now


 1.2………. …………

  but is a natural number.

So this implies that

Put in (6)



 p is sum of two square.
[Because

Corollary[2]: Any prime p of the form

 ] 4n+1 can be represented uniquely (aside
where a = from the order of the summands) as a sum
of two squares.
1.2………….

735
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Proof: Since p is prime of the form 4n+1, = p2+ (ac -bd) 2

so it can be represented as sum of two => p2= p2+ (ac-bd) 2
squares, Now we will establish the => (ac-bd)2 =0
uniqueness assertion, suppose that => ac-bd =0
p= a2+b2 =c2+d2 => ac=bd
So (3) => either ad=bc or ac=bd - (4)
(1) Suppose for instance, that ad=bc - (5)
Where a,b,c, d are all positive integers, => bc= ad, d is
(a,b)=1, (c,d)=1 integer
2 2 2 2 2 2 2 2 2 2 2 2
Now a d - b c = a d +b d - b d - b c => a|bc
= (a2+b2) d2 - b2 => a|c [Because
(d2+c2) (a,b)=1]
= pd2 - b2p (by =>  +ve integer λ s.t
1) c=λa (6) Put in (5)
2 2
= p (d -b ) ad=bλa
≡ 0 (mod p) => d= λb -(7)
(because d2 – b2 is an integer) Now p= c2+d2 by (1)
a2d2-b2c2 ≡ 0 (mod p) p = λ2 (a2+b2) by (6), (7)
=> p|a2d2 - b2c2 => (a2+b2) = λ2 (a2+b2) by (1) because
=> p| (ad-bc) (ad+bc) a2+ b2 is not equal to zero
but p is prime => λ=1
=> p|ad-bc or p|ad+bc Put in (6), (7)
c=a, d=b
(2) In same way the condition ac=bd leads to

(1) => a,b,c,d are all less than p a=d, b=c

So uniqueness is established
=> 0≤ad-bc <p & 0< ad+bc <2p
Home stated conclusion is justified
So (2) => ad-bc=0 or ad+bc =p

Lemma[3]: If positive integers ∝ and β are

(3)
written as sum of two squares then ∝ β is also
If ad+bc=p then we would have ac=bd; for,
written as sum of two squares.
2 2 2 2 2 2 2
p = (a +b ) (c +d ) = (ad+bc) + (ac-bd)

736
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Proof :- Let and Suppose p does not divide x  gcd

where a, b, c, d are integers.  =1 where are integers

……….. (iv)

(i) & (iii) 

where

 ∝ β is sum of two squares.

Now we will prove p does not divide m
Theorem[4]:- A positive integer n is
representable as the sum of two squares if and Suppose if possible

only if each of its prime factors of the form 

occurs to an even power in the prime 
factorization of n.

………..(v)
Proof:- Suppose n is written as sum of two
(iv) & (v) 
squares i.e. …. (i)

where a & b are integers.
 Congruence has a
Let p be prime factor of n of the form
which occurs in prime factorization of n. solution

Claim:- Power of p is even  is quadratic residue mod p

Let 

Not possible [because 


…….. (ii) Our supposition is wrong
Hence p does not divide m gcd
Let and  and
[because p is prime]
…….. (iii)
Now 
(ii) and (iii) 

Now either p does not divide x or p does not
because gcd
divide y


[because otherwise if p x and p y because p is prime

then which implies that not possible as p is a prime]

737
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Let be the highest power of p in prime Now

factorization of d, where λ is a positive integer. = Sum of two squares

2 is the highest power of p in prime  Sum of two squares by
factorization of Lemma
2 is the highest power of p in prime  Sum of two squares
factorization of by Lemma
(because p does not divide m) ------------------------
2 is the highest power of p in prime ------------------------
factorization of n = Sum of two squares
 Power of p in prime factorization of n is ……..(vii)
even. Also
Converse:- Let each prime factor of n of the
form occurs to an even power in the
prime factorization of n = Sum of two
Let squares – (viii)
(vi), (vii) and (viii) & repeated use of Lemma
be prime factorization of n implies that
where
and
is sum of two squares
Since  n is sum of two squares.
 is sum of two squares
by Two squares Theorem Examples[5]
of Fermat (i) is not written as sum of two
 is sum of two squares squares as power of prime factor 3 of the form
by Lemma for k=0 in prime factorization of 135
 is sum of two squares is not even.
by Lemma (ii) is written as sum of two
------------------------ squares as power of prime 3 of the form
------------------------ for k=0 in the prime factorization of
sum of two squares 153 is even

Also
……….. (vi)

738
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

sum of two  n is not written as sum of three squares.

squares.
Case II
Sum of three squares Suppose n is sum of three squares
Theorem:[6]- No positive integer of the form Let where a, b, c are
is written as sum of three squares integers
where m and λ are non negative integers 
Proof:- Let …………. (7)
……….. (1)  even because
Case I is multiple of 4
So (1)   Either all the a, b, c are even or either two
are odd and one is even.

Suppose a, b are odd and c is even.
……….…(2)
Let
Suppose n is sum of three squares

Let
where r1, r2 and s are integers.
………….(3)

Where a, b, c are integers
Now a is any integer

  is not multiple of 4
 all a, b, c are even
 Let
………….(4) where
In same way a1, b1 c1 are integers
……….…(5)
Put in (7)


……….…(6)
………… (8)
(4), (5) & (6) 
 even
As above we can prove that;


where a2, b2 and c2 are integers

Not possible by (2)
Put in (8)
 Our supposition is wrong

739
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

 each the sum of four squares, then mn is

Repeat above process times more, we likewise so representable.

get
Lemma 2 (Euler):[7] If p is an odd prime then
where am,
bm and cm are integers. the congruence has

Which implies that,

a solution where and
Which further implies that is sum of
three squares not possible by Case I. .
So, Our supposition is wrong
Hence is not written as sum of Theorem:[7] Given an odd prime p, there
three squares. exists a positive integer such that mp
Examples is the sum of four squares.
1. 15, which is of the form 8 λ +7 for λ =1 & Proof: For an odd prime p, Lemma 2 implies
15= 3  2  1  1  sum of three squares
2 2 2 2
that there exists integers
2. 240, which is of the form for
,
m=2 and λ=1 &
……….. (1)
240 = 12  8  4  4  sum of three
2 2 2 2

squares Such that

3. 459 is not of the form for any
m and λ & 
459 = 13  13  11 = sum of three
2 2 2
………….(2)
squares where m is a positive integer
Sum of four squares 
For coming to four squares problem we …………..(3)
consider the Fundamental identity, discovered
by Euler which allow one to express the Now (1) and (2) implies that
product of two sums of four squares as such a
sum, as well as the crucial result that
congruence is i.e.

solvable for any odd prime p as lemmas. 

…………(4)
Lemma 1 (Fundamental Identity of
Euler)[7]: If the positive integers m and n are

740
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

So, (3) & (4) implies that there exists an

integer s.t. mp is sum of four squares. + +

Theorem:[8] Any prime p can be written as +

the sum of four squares.

is representation of p as a sum of four
Proof: The theorem is certainly true for
squares for a positive integer .
,
This violates the minimal nature of n, giving us
since Thus we
our contradiction.
consider the case for odd primes.
There still remains the problem of
Now p is odd prime.
showing that . Assume not, then n being
So, above theorem implies that there exists an
an odd integer, it is at least 3.
integer such that mp is the sum of four
So, it is possible to choose integers A, B, C, D
squares.
such that
Let n be the smallest positive integer such that
np is the sum of four squares; say … (2)

………… (1) and ,

Where a, b, c, d are integers and also

because Here, A, B, C, D are absolute least residue of

a, b, c, d respectively moduleo n.
Claim
Then
We make a start by showing that n is an odd
integer. For a proof by contradiction, assume
that n is even. Then a,b,c,d are all even; or all
So,
are odd; or two are even and two are odd. In
any event we may rearrange them, so that
i.e. ,
It follows that; i.e.
and so
……………
are all integers and (1) implies that
(3)
for some non-negative integer k.

741
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Because of restrictions on the size of A, B, C, i.e.

D we have;
i.e. n r
In same way, n s, n t, n u
r s t u
 , , , are all integers.
n n n n
We cannot have , since this would

signify that and in Now (4)  + + +

consequence, that n divides each of the  pk is sum of four squares.
integers a, b, c, d by (2) which implies that n2 Since , we therefore arrive at a
2 2 2 2
divide each of the integers a , b , c and d contradiction to the choice of n as the smallest
2
which further implies that n divides their sum positive integer for which np is the sum of four
i.e. by (1) squares. With this contradiction we have

Or which is impossible in light of

Put in (1)
inequality

The relation also allow us to

which implies p is sum of four squares and
conclude that .
proof is complete.
In sum; Lagrange’s four square theorem[1, 9-10]
(1) & (3)  Statement: Any positive integer n can be
written as the sum of four squares, some of
which may be zero.

Proof: Clearly, the integer 1 is written as

a sum of four squares.

i.e. Assume that and let
………… (4) be prime factorization if n into primes (not
where necessarily distinct).

We know that each is written as sum of

four squares.

Now Fundamental Identity of Euler permits us to

express the product of any two primes as a sum
by
of four squares.
use of (2)
by use of (3)

742
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Apply Fundamental Identity of Euler r times 4. K. Rasen, Elementary Number Theory

we obtain the result that is and its Applications: Addison-Wesley

written as sum of four squares. Publishing Co. 1993.

Example 5. Roberts. Joe 1977 Elementary

Write 391 as sum of four squares Number Theory Cambridge Mass:
Solution: we use fundamental identity of Euler MIT Press.
to write this. 6. Starke, Harold. 1970, An
Fundamental identity of Euler: Introduction to Number Theory
2 2 2 2 2 2 2 2
If m = a +b +c +d and n = x +y +z +t
Chicago: Markham.
Where a, b, c, d, x, y, z, t are integers.
7. Stewart, B. M. 1964, Theory of
Then mn= (a2+b2+c2+d2) (x2+y2+z2+t2)
Numbers, 2nd edition, New York:
= (ax+by+cz+dt) + (ay – bz – ct +
2

Macmillan.
dz)2 + (az + bt – cx – dy)2 + (at – bz + cy –
8. Landau, E. 1952, Elementary
dx)2
We know 391 = 17.23 Number Theory Trans. Goodman,
= (42 + 12 + 02 + 02) (32 + 32 + New York: Chelsea.
22 + 12) 9. Burton, David. 1985, The History
2
= (4.3 + 1.3 + 0.2 + 0.1) + of Mathematics: An Introduction
(4.3 – 1.3 – 0.1 + 0.2) + 2
Boston: Allyn and Bacon.
(4.2 + 1.1 – 0.3 – 0.3) + 2
10. Upensky, J. and M. A. Heaslet.
(4.1 – 1.2 + 0.3 – 0.3) 2
1939, Elementary Number Theory
= 152 + 92 + 92 + 22
New York: Mcgraw-Hill.
= sum of four squares

REFERENCES
1. David M. Burton 1999, Elementary
Number Theory, 2nd Edition: Wm. C.
Brown Company Publishers.
2. Niven I. and H. Zuckerman, 1980, An
Introduction to the theory of Numbers,
4th Edition, New York: John Wiley and
Sons.
3. Hardy, Wright, An Introduction to the
Theory of Numbers, Oxford, 1954.

743
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Analysis of Material Degradation in Chlorine
Environment of Power Plants
Harminder Singh
Guru Nanak Dev University, Regional Campus, Jalandhar, Punjab, India
harminder10@gmail.com
ABSTRACT
The chlorine containing deposits in the power plant
environment is very harmful in terms of degrading the plant
component materials. The cyclic reaction starts by the
chlorine gas shorten the life of the plant components. In this
study, this cyclic reaction is study in detail, which is required
further to find the preventive methods for slow down the
degradation of the plant components, especially in waste
incinerators.
Keywords
Boiler Tubes, Incinerator, Chlorine, Active oxidation, Hot
corrosion
1. INTRODUCTION
The degradation and hence failure of the boiler, superheater
and other material components of the power plant industry is
still a serious issue. The main reason this failure is the
presence of corrosive elements in the flue gases generated
during burning of the fuel in these plants. These flue gases
elements are more aggressive in nature in the energy
producing plants like waste incinerators, where alkali and
heavy metals becomes highly corrosive in the presence of
chlorine. The high-degradation of materials in the presence of
chlorine still needs an acceptable solution, and thus extensive
study and research is still required in this area. Another
important point which should be considered during this study
is that fuels and its elements could not be changed for power
plants which are based primarily on waste management like
incinerators [1-4].
2. HOT CORROSION
The material degradation at high temperature under the
presence of thin layer of molten salts under suitable
atmosphere is known from the year 1940. This phenomenon
of corrosive failure under the presence of molten salts is
known as hot corrosion. Hot corrosive failure of the
components is more severe under the presence of chlorine
containing molten deposits, and was first observed in the
aircraft engine failures which mainly operated above the
chlorine containing sea water [4-8]. During this phenomenon,
the protective oxide layer usually formed on the metal/alloy
surfaces is dissolved, and a non-protective layer is formed,
thereby results in accelerating the surface degradation [5,6].
The corrosive attack in boilers materials of thermal power
744
ISBN: 978-81-924893-0-8
plants and waste incinerators is also due to hot corrosion
phenomenon [9].
2. OXIDATION PRINCIPLE
It is a well known concept that metal and their alloys develop
self healing layer of oxides of metal/alloy elements during
reaction with the atmospheric oxygen. This surface layer acts
as barrier to the corrosive and environment elements and
prevent them from reacting with the metal/alloy elements.
This results in safety of the metal/alloy surface below the
oxide layer. However, there are molten deposits of the flue
gases corrosive elements on the material surface in the boiler
environments. These deposits dissolve the surface oxide
layers of the metals or alloys. Also the presence of these
deposits breaks contact of the metal/alloys from the
surrounding oxygen. The reducing atmosphere this formed
prevents the further formation of protective oxide layer on the
surface of the boiler materials [10] In incinerators and gas
turbines, the presence of salt deposits on the materials reduces
the local oxygen pressure and results in destroying protective
oxide barriers on the surfaces of alloys [11,12]. As oxygen is
a desirable component for the protective oxide layer, hence
reducing atmosphere around the substrate is more corrosive in
nature. The destruction or failure of the surface oxide layer is
the first step towards the start of the hot corrosion
phenomenon on the metal/alloy surface. The presence of
molten deposits, temperature variations and erosion caused by
flue gas elements are some of the reasons of the failure of the
surface layers. The dissolution of the surface layer by molten
deposits is known as fluxing, which can be acidic or basic
fluxing depends upon the surrounding environment. It is
observed that the acidic fluxing is more harmful over the basic
one [5, 6, 13-16]. For low oxygen ion activity in the molten
salts, it is observed that acidic fluxing takes place [16]. The
study found that alloys having high amount of Mo, V and W
faced acidic fluxing. For incinerators Hara et al. [17] reported
the basic fluxing of surface oxide layer of Cr element, as:
Cr2O3 + 3SO3+2O2- = 2 CrO42-+ 3SO2 (1)
3. CHLORINE BASED FAILURE
MECHANISM
The presence of chlorine element in the molten deposits on
the surface of metal or alloys further increases the pace of the
attack of corrosion elements. This attack is known as ‘Active-
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Oxidation’, in which combination of oxidation and
chlorination reactions takes place on the material surface.
During this mechanism chlorine gas is not consumed and just
act as catalyst to speed up the oxidation of the material
elements. This accelerated oxidation means formation of non-
protective and porous surface oxide layer, and only 0.1 %
presence of chlorine can be very harmful, since chlorine is not
consumed [9, 18-24]. Thus it is important to study the failure
of the power plant components by the chlorine containing
environment. This mode of failure mechanism generally has
following steps [10]:
a) First chlorine should be generated from the surrounding
environment and present on the material surface, b) In next
step chlorine goes inside the oxide layer to affect the
metal/alloy elements, c) Further the chlorine reacts and forms
chlorides, d) In next stage chlorides come in contact with
surrounding environment, e) Formation of oxides from the
chlorides by interaction with the available oxygen and
chlorine again ready to start the cyclic reaction [9].
1. First Step of chlorine produced on the surface
The presence of chloride containing salts at temperature
higher than their fusion range like in boilers and incinerators
is the first to start the degrading reaction. There are many
different reactions through which chlorine is produced in the
form of gas in the region close to the metal/alloy surface. It is
not only chloride compounds, but the presence of alkali and
sulfur compounds contained in waste incinerators also
activates the reaction. The sulfur compounds play a
contributory role in promoting corrosion through its chlorine
liberating action as shown in the following reaction:
4 NaCl + 2 H2O + O2 + 2 SO2 = 2 Na2SO4 + 4 HC1 (2)
4 HC1 + O2 = 2 Cl2 + 2 H2O (3)
2. Second step of generation of chlorides
After the generation of chlorine in the form of gas, it is able to
enter into the surface oxide layer of the materials and starts
interacting with the base material elements. The entrance path
for the chlorine is expected to be cracks and pores in the
surface layer. At lower surface the partial pressure of oxygen
is less and that of chlorine is high due to the presence of
chloride deposits in the incinerator conditions. This pressure
of 10-10-10-13 bar is enough for the formation of chlorides of
metal/alloy elements, and for these reactions it is found that
Gibbs free energy has high value towards negative side. Thus,
the thermodynamics is in favor for the formation of chlorides,
in gaseous or volatile solid form. The general reaction for this
interaction of elements with chlorine is:
Me(s)+x/2Cl2(g) = MeClx(s,g). (4)
As the high negativity of the Gibbs free energy, the chloride
of chromium has high preference of formation in comparison
of iron and nickel. The growth of chlorides between oxide and
metal surface will weaken the bonding of the oxide layer with
745
ISBN: 978-81-924893-0-8
metal and thus decreases the protective ability of the oxide
layer [9-12, 19].
3. Third Step of chloride vaporization
In next step after the formation of chlorides, these become
vaporized because of enough required vapor pressure as:
MeClx (s)=MeClx (g) (5)
4. Last step of reaction of gaseous chlorides
The gaseous chlorides, formed in third step, come out through
the passages in the oxide layer and interact with the
surrounding environment. Now the atmosphere outside the
oxide scale is oxidizing and thus has high partial pressure of
oxygen. Due to this high value of oxygen pressure the
chlorides come out in gaseous form interacts with oxygen as:
MeCl2 (g) + 3/2 O2 (g) = Me2O3 (s) + 2 Cl2 (g). (6)
It is noticed that oxides of metal/alloy elements formed and
chlorine which was consumed in second step is again released
in the atmosphere. This chlorine is again ready to interact with
the metal elements and cycle of reactions starts.
Also the oxide formed in this cycle of four steps and is not
through direct interaction between metal/alloy elements and
oxygen. This type of oxide formed on the surface is noticed to
be porous and loosely bonded with surface. Thus, this oxide
layer is not able to provide blockage to the corrosive and
damaging environment elements.
For alloy containing different elements, depending upon the
vapor pressure of chlorides and partial pressure of oxide
formation, the oxide layer consists of a layered structure. The
chromium oxide formed at low oxygen pressure in
comparison to iron and nickel. Thus the region of layer close
to surface is rich in oxide of chromium and upper region
noticed to be rich in nickel oxide, and in-between mixture of
oxide of chromium, iron and nickel is observed. Thus, if
during study this type of layered oxide structure is noticed on
the boiler or other components, then it can be concluded that
‘Active oxidation’ the possible phenomenon in that
environment conditions [11, 12, 19].
Thus, the ways should be found out to stop or hinder that
phenomenon by various available techniques. The study of
these techniques is not in the scope of this study.
4. CONCLUSION
The presence of chloride deposits, such as NaCl, accelerates
the corrosion in waste incinerators and marine based gas
turbines. The NaCl plays as a catalyst accelerating the
corrosion reaction. The mechanism of chlorine based active
oxidation especially under NaCl depsoits is the oxy-
chloridation, chloridation and re-oxidation process. This
mechanism is cyclic in nature and is harmful for the
degradation of the materials used in these plants. Thus, still a
detailed study is required to gain in-depth view of this
mechanism. Also research should be focused develop easy
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
and reliable methods to protect the precious materials from
degradation at low cost.
REFERENCES
[1] Kuo, J-H., Tseng, H-H., Rao, P. S., and Wey M-Y. 2008.
The prospect and Development of Incinerators for
municipal solid waste treatment and characteristics of
their pollutants in Taiwan. Applied Thermal Engineering
28 (17-18), 2305-2314.
[2] Ganapathy, V. 1995. Recover heat from waste
incineration. Hydrocarbon Processing (September 1995).
[3] Rademakers, P. 2008. Review on corrosion in waste
incinerators, and possible effect of bromine, TNO report.
[4] Fordham, R.J., and Baxter, D. 2003. The impact of
increasing demand for efficiency and reliability on the
performance of waste-to-energy plants. Materials at high
temperature 20(1), 19-25.
[5] Sidhu, T. S., and Prakash, S. 2006. Hot corrosion and
performance of nickel-based Coatings. Current Science
90 (1), 41-47.
[6] Sidhu, T.S., and Agarwal, R. D. 2005. Hot corrosion of
some superalloys and role of high-velocity oxy-fuel
spray coatings-a review. Surface & Coatings Technology
198, 441-446.
[7] Rapp, RA. 1986. Chemistry and electrochemistry of the
hot corrosion of metals. Corrosion 42(10), 568-577.
[8] Rapp, R.A. 2002. Hot Corrosion of Materials: A fluxing
mechanism?, Corrosion Science 44, 209-221.
[9] Sorell, G. 1997. The role of chlorine in high temperature
corrosion in waste-to-energy plants. Science and
Technology Letters, Materials at high temperatures 137-
150.
[10] Albina, D. O. 2005. Theory and experience on corrosion
of Waterwall and superheater tubes of waste-to-energy
facilities. Thesis 2005, available online.
[11] Uusitalo, M. A., Vuoristo, P. M. J., and Mantyla T. A.
2004. High Temperature corrosion of coatings and boiler
steels below chlorine containing salt deposits. Corrosion
Science 46(6), 1311-1331.
[12] Uusitalo, M. A., Vuoristo, P. M. J., and Mantyla, T. A.
2003. High Temperature corrosion of coatings and boiler
steels in oxidizing chlorine containing atmosphere.
Material Science and Engineering 346, 168-177.
[13] Eliaz, N., Shemesh, G., and Latanision R. M. 2002. Hot
corrosion in gas turbine components. Engineering Failure
Analysis 9, 31–43.
746
ISBN: 978-81-924893-0-8
[14] Goebel, J.A, Pettit, F.S. 1970. Na 2SO4-induced
accelerated oxidation (hot corrosion) of nickel. Metall.
Trans. 1, 1943-1954.
[15] Goebel, J.A., and Pettit, F.S. 1970. The influence of
sulfides on the oxidation behavior of nickel-base alloys.
Metall. Trans. 1, 3421-3429.
[16] Stringer, J. 1987. High-temperature corrosion of
superalloys. Material Science Technology 3(7), 482-493.
[17] Hara, M., and Shinata, Y. 1992. Electrochemical studies
on hot corrosion of Ni−Cr−Al alloys in molten
Na2SO4NaCl. Materials Transactions JIM, 33(8),
758−765.
[18] Montgomery, M., and Larsen, O.H. 2001.
Characterization of deposits and their influence on
corrosion in waste incineration plants in Denmark.
NACE international, Corrosion 2001 paper no. 01184.
[19] Zahs, A., Spiegel, M., and Grabke, H-J. 2000.
Chloridation and oxidation of iron, chromium, nickel and
their alloys in chloridizing and oxidizing atmospheres at
400-700oC. Corrosion Science 42, 1093-1122.
[20] Singh, H., Sidhu, T. S., and Kalsi, S.B.S. 2014. Behavior
of cold sprayed superalloy in incinerator at 900oC. Surf.
Eng. DOI: 10.1179/1743294414Y.0000000390.
[21] Singh, H., Sidhu, T. S., Kalsi, S.B.S., and Karthikeyan, J.
2014. Hot corrosion behavior of cold sprayed Ni-50Cr
coating in an incinerator environment at 900oC. J.
Therm. Spray Technol. DOI: 10.1007/s11666-014-0213-
z.
[22] Singh, H., Sidhu, T. S., Karthikeyan, J., and Kalsi, S.B.S.
2015. Evaluation of characteristics and behavior of cold
sprayed Ni-20Cr coating at elevated temperature in waste
incinerator plant. Surf. Coat. Technol. 261, 375–384.
[23] Singh, H., and Sidhu, T. S. 2013. High temperature
corrosion behavior of Ni-based superalloy Superni-75 in
the real service environment of medical waste
incinerator. Oxid. Met. 80, (5–6), 651–668.
[24] Singh, H., Sidhu, T. S., and Kalsi, S.B.S. 2014. Behavior
of Ni-Based Superalloys in an actual waste incinerator
plant under cyclic conditions for 1,000 h at 900°C.
Corrosion. DOI: http://dx.doi.org/10.5006/1163.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Multiple scattering effects of gamma ray in some
titanium compounds
Lovedeep Singh & Pooja Rani Amrit Singh
Sant Longowal Institute of Sant Longowal Institute of
Engineering and Technology, Engineering and Technology,
Longowal, 148106, Sangrur, Punjab Longowal, 148106, Sangrur, Punjab
(India) (India)
lovedeepgehal@gmail.com amritsliet@gmail.com
ABSTRACT
Absorption buildup factors for some titanium compounds like
Titanium dioxide (TiO2), Titanium Carbide (TiC), Titanium
Nitride (TiN) and Titanium Silicate (TiSi) has been calculated
using the G.P. fitting technique upto penetration depth of 40
mean free path (mfp). The variation of energy absorption
buildup factor with incident photon energy for the selected
compounds of titanium has been studied. It has been found
that the maximum value of energy absorption buildup factors
shifts to the slightly higher incident photon energy with the
increase in equivalent atomic number of the selected
compounds of titanium.
Keywords
Titanium compounds, multiple scattering, buildup factor.
1. INTRODUCTION
Titanium is the ninth most occurring element in the nature.
Due to its hardness, brightness and strongness, it is widely
used in aerospace, sports and medicine fields. Titanium
compounds are also found useful in various fields. They found
applications in paint, coloring food and cosmetics, crayons,
UV protection fields, lubricants, wear resistant tools and many
more. Due to many applications of compounds of titanium an
attempt has been made to check its possibility in radiation
shielding. Radiation physicists face a main problem of
leakage of radiation due to the Compton multiple scattering
events. This multiple scattering is the main reason for
violation of the Lambert-Beer law i.e. I = Ioeµx. In order to
maintain this law, a correction factor B called the buildup
factor is used. Buildup factor measures the degree upto which
the Lambert-Beer law is violated. Then the intensity equation
after modification becomes I = BIoeµx where B is the buildup
factor. Remember buildup factor is always equals to or greater
than unity.
There are two types of buildup factors – one is energy
absorption buildup factor and the other is exposure buildup
factor. In the former, the quantity of concern is absorbed or
deposited energy in the material and detector response
function is that of the absorption in the material whereas in
the latter, the quantity of concern is the exposure of energy
and detector response function is that of absorption in air.
There are several different methods such as G.P. fitting
method given by Harima et al. [1], invariant embedding
method given by Shimizu and Hirayama [2] and Shimizu et al
[3] are available for computing buildup factors. American
National Standards ANSI/ANS 6.4.3 [4] (American National
Standard, 1991) used G.P. fitting method and provided
buildup factor data for 23 elements, one compound and two
747
ISBN: 978-81-924893-0-8
Manoj Kumar Gupta
Department of Applied sciences,
BGIET,Sangrur, Punjab (India)
mkgupta.sliet@gmail.com
mixtures viz. water, air with suitable interval up to the
penetration depth of 40 mean free paths. M.J. Berger and J.
Hubbell [5] provided for the first time the database of mass
attenuation coefficient as well as cross-sections for about 100
elements in the form of software package named as XCom,
which is also capable of generating mass attenuation
coefficients for compounds and mixtures. Y. Harima [6] has
given an historical review and current status of buildup factor
calculations and applications for the materials water, concrete
and elements Fe, Pb, Be, B, C, N, O, F, Na, Mg, Al, Si, P, S,
Ar, K, Ca, Cu, Mo, Sn, La, Gd, W, U in the energy range
0.01 to 0.3 MeV and 0.5 to 10 MeV with penetration depth up
to 40 mfp, using various codes ADJ-MOM, PALLAS and
ASFIT. H. Hirayama & K. Shin [7] had used EGS4 Monte
Carlo code to study multilayer gamma ray exposure buildup
factors up to 40 mfp for water, iron and lead at energies 0.1,
0.3, 0.6, 1.0, 3.0, 6.0 and 10 MeV.G. S. Sidhu et al. [8] had
computed energy absorption buildup factor for some
biological samples viz. Cholesterol, chlorophyll, hemoglobin,
muscle, tissue, cell and bone in the energy range of 0.015 to
15.0 MeV with penetration depth upto 40 mfp, using G.P.
fitting method. Shimizu et al.[9] compared the buildup factor
values obtained by three different approaches (G.P. fitting,
invariant embedding and Monte Carlo method) and only small
discrepancies were observed for low-Z elements up to 100
mean free path. K. Trots et al.[10] proposed vector regression
model for the estimation of gamma ray buildup factors for
multi–layer shields for Al, Fe, Pb, water and concrete in the
energy range of 5 to 10 MeV with penetration depth more
than 10 mfp. P.S. Singh et al. [11] measured variation of
energy absorption build up factors with incident photon
energy and penetration depth for some commonly used
solvents. T. singh et al [12] worked on Chemical composition
dependence of exposure buildup factors for some polymers
After going through the literature, it has been observed that
with the ever increasing use of gamma ray photons in
medicine and bio-physics, there is a dire need of proper
investigations concerning gamma rays multiple scattering
effects on some Titanium compounds.
2. COMPUTATIONAL WORK
The computations of energy absorption buildup factor have
been divided into three parts, which are given following:-
2.1. Computations of equivalent atomic
numbers (Zeq)
Equivalent atomic number is a quantity similar to atomic
number of elements. It is the number given to
compound/mixture by giving proper weightage to the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Compton multiple scattering processes. However, the
equivalent Z mostly possesses the real values and it is an
energy dependent parameter. As buildup factor is a direct
consequence of multiple scattering, hence equivalent atomic
number (Zeq) is used for the calculation of buildup factors. For
the calculation of (Zeq), the values of Compton partial
attenuation coefficient comp and the total attenuation
coefficients total were obtained in cm2/g fistly for the selected
compounds of titanium in the energy value from 0.015 to 15.0
MeV, using WinXCom computer program (Gerward et al.,
2001) The values of Zeq for the titanium compounds will be
calculated by the following formula:
Z1 (log R 2  log R )  Z2 (log R  log R1 )
Zeq 
(log R 2  log R1 )
Where Z1 and Z2 are the atomic numbers of elements
corresponding to the ratios of comp and total, R1 and R2
respectively.R (Comp/total) is the ratio for the selected
titanium compounds at a particular energy value, which lies
between ratios R1 and R2 such that R1 < R < R2.
2.2. Computations of G.P.
parameters
American National Standard (1991) has provided the energy
absorption G.P. fitting parameters of 23 elements, one
compound (H2O) and two mixtures (air and concrete) in the
energy range of 0.015–15.0 MeV and up to a penetration
depth of 40 mfp. The calculated values of Zeq for the selected
solvents were used to interpolate G.P. fitting parameters (b, c,
a, Xk and d) for the energy absorption buildup factor, in the
energy range (0.015–15.0 MeV) and penetration depth (1–40
mfp). The formula (Sidhu et al., 2000) used for the purpose of
interpolation of the G.P. fitting parameters is as follows:
P1(log Z2 log Zeq )P2 (log Zeq log Z1 )
P
log Z2 log Z1
where Z1 and Z2 are the atomic numbers of elements between
which the equivalent atomic number Zeq of the selected
titanium compounds lies. Here P 1 and P2 are the values of
G.P. fitting parameters corresponding to the atomic numbers
Z1 and Z2 respectively at a given energy.
2.3. Computations of buildup factors
The computed G.P. fitting parameters (b, c, a, Xk and d) were
then used to calculate the energy absorption buildup factors
for the selected compounds of titanium at some standard
incident photon energies in the range of 0.015–15.0 MeV and
upto a penetration depth of 40 mfp, with the help of G.P.
fitting formula, as given by following equations (Harima et
al., 1986)
b 1 X
B ( E, X )  1  ( K  1) for K 1
K 1
B( E, X )  1  (b  1) X for K= 1
where
 x 
tanh  2   tanh(2)
 Xk  for X  40 mfp
K ( E , x)  cx a  d
1  tanh(2)
ISBN: 978-81-924893-0-8
3. RESULTS AND DISCUSSION
The energy absorption buildup factor for the selected
compounds of titanium has been shown in Figs. 3.1 to 3.4.
From these figures it is found that energy absorption buildup
factor for all the selected compounds of titanium in the energy
region of 0.015–15.0 MeV up to the penetration depth of 40
mean free path is always greater than one. This is due to build
up of photons from scattering due to larger penetration depth
of the titanium compounds. The dependence of energy
absorption buildup factor on incident photon energy and
penetration depth has been discussed as following:-
Figs. 3.1 – 3.4 show the variation of energy absorption
buildup factor with incident photon energy for all the selected
compounds of titanium at 1, 5, 10, 20, 30 and 40 mean free
path respectively. It has been found that in spite of different
equivalent atomic numbers (Zeq) of the selected titanium
compounds shows almost similar pattern with the increase in
incident photon energy. Initially, energy absorption buildup
factor increases with the increase in incident photon energy
for all of the selected compounds of titanium.
fitting
1000
1mpf
TiC 5
10
20
30
Absorption buildup factor
100 40
10
1
0.1 1 10
photon Energy(MeV)
Fig. 3.1: Variation of energy absorption buildup factor
with incident photon energy in case of titanium carbide.
The dominance of absorption processes in the lower and
higher energy regions (photo -electric absorption in the lower
and pair-production/triple production in the higher photon
energy region) is the reason for this variation of energy
absorption buildup factor with incident photon energy. In the
initial stage, in the lower photon energy region, photo-electric
absorption is the dominant photon interaction process; so
energy absorption buildup factor shows minimum values for
these compounds of titanium.
With the increase in the incident photon energy, the Compton
scattering process overtakes photo-electric absorption process.
It results in the multiple Compton scattering events, which
results in increasing the absorption buildup factors. Since
scattering process decreases the energy of incident photon, so
multiple scattering events results in the maximum value of the
energy absorption buildup factors for these titanium
compounds. Further increase in incident photon energy,
almost identical values of energy absorption buildup factors
for titanium compounds has been observed.
748
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

1000
1000
1 mfp
1mpf TiSi2 5
TiN
5 10
10 20
20 30

Absorption buildup factor

30 100
Absorption buildup factor

100 40
40

10
10

1
1
0.1 1 10
0.1 1 10
Photon Energy(MeV)
Photon Energy(MeV)

Fig. 3.2: Variation of energy absorption buildup factor Fig. 3.4: Variation of energy absorption buildup factor
with incident photon energy in case of titanium nitride with incident photon energy in case of titanium silicate

In the energy region from 3.0 to 15.0 MeV, one more
absorption process, i.e. pair/triplet production starts
dominating which not only decrease the absorption buildup
factor values but also exhibit a significant variation to a small
extent due to the chemical composition of the selected
titanium compounds. It may be due to the fact that
dependence of the cross-section for this absorption process on
the equivalent atomic number (Zeq) is not so much significant
as for the photo-electric absorption process.
1000
TiO2
Absorption buildup factor
4. CONCLUSION
From the above studies, it can be concluded that the degree of
violation of the Lambert–Beer law i.e. value of energy
absorption buildup factor is less in the energy regions where
absorption processes are dominant over the scattering process
and when the penetration depth of the material is least. It is
also found that for the higher equivalent atomic number (Zeq)
of the interacting material, the value of energy absorption
buildup factor is least.
The energy absorption buildup factor depends strongly on the
nature of the material in the lower energy region, becomes
almost independent in the intermediate energy region and
shows a little dependence in the higher energy region.
1mpf
5 5. ACKNOWLEDGMENTS
10
20
Authors are thankful to staff of department of physics, Sant
30 Longowal Institute of Engineering and Technology,

100 40 Longowal, Sangrur, Punjab, India for their cooperation for

doing this work.

REFERENCES
[1] Harima Y., Tanaka S., Sakamoto Y. & Hirayama H. 1990.
10 Development of New Gamma-Ray Buildup Factor and
Application to Shielding Calculations, Nucl. Sc. & Tech., 74-
84.
[2] Shimizu A. & Hirayama H. 2003, Calculation of gamma-ray
1
buildup factors up to depths of 100 mfp by the method of
0.1 1 10 invariant embedding. Improved treatment of bremsstrahlung.
Photon Energy(MeV) Nucl. Sci. & Eng. 40, 192-200.
[3] Shimizu A. 2002, Calculations of gamma-ray buildup factors
Fig. 3.3: Variation of energy absorption buildup factor up to depth of 100 mfp by the method of invariant embedding
with incident photon energy in case of titanium dioxide . Nucl. Sc. & Tech. 39, 477-486.
[4] American National Standard, ANSI/ANS - 6.4.3. (1991).
[5] Berger, M.J., Hubbell, J.H., 1987. N B S I R87-3597: Photon
Cross Sections on A Personal Computer.National Institute of
Standards and Technology, Gaithersburg, MD.

749
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[6]. Harima Y. ,1993 An historical review and current status of
buildup factor calculations and applications. Radiat. Phy.
Chem. 41, 631-672
[7] Hirayama H. & Shin K., 1998 Application of the EGS4
Monte Carlo code to a study of multilayer gamma-ray
exposure buildup factors of up to 40 mfp. J. Nucl. Sci.
Technol. 35, 816-829
[8] Sidhu G.S., Singh P.S. & Mudahar G.S., 1999 Energy
absorption buildup factor studies in biological samples.
Radiat. Protect. Dosim. 86, 207-216.
[9] Shimizu A., Onda T. and Sakamato Y., 2004, Calculation of
Gamma-Ray Buildup Factors up to Depths of 100 mfp by the
Method of Invariant Embedding, (III), . Nucl. Sc. & Tech, 41,
413-424
ISBN: 978-81-924893-0-8
[10] Trots K. , Smuc T. & Pevec D. 2007, Support vector
regression model for the estimation of gamma ray build up
factors for multi-layer shields. Annal. Nucl. Energy. 34, 939-
952.
[11] Singh P.S., Singh T. and Kaur P. ,2008, Variation of energy
absorption build up factors with incident photon energy and
penetration depth for some commonly used solvents. Annal.
Nucl. Energy, 35, 1093-1097
[12] Singh T., Kumar N., Singh P.S. , 2008, Chemical composition
dependence of exposure buildup factors for some polymers, .
Annal. Nucl. Energy, 36, 114-120
750
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Measurements of radon gas concentration in soil
Navpreet Kaur Amrit Singh
Sant Longowal Sant Longowal
Institute of Institute of
Engineering and Engineering and
Technology, Technology,
Longowal, 148106, Longowal, 148106,
Sangrur, Punjab Sangrur, Punjab
(India), (India),
navpreetkarhwal@g amritsliet@gamil.com
mail.com
ABSTRACT
Radon and their decay products are the main contributors of
total inhalation dose in the living environment. Concentration
of radon soil gas is about thousand times higher as compared
to environment. Thus, it is necessary to measure radon soil
gas. Soil gas 222Rn (radon) concentrations were measured at 5
locations in Sant Longowal Institute of Engineering and
Technology (SLIET), Longowal, by using RAD7 (Durridge
Company Inc., USA). Measurements were carried out at
sampling depths of 30, 40 and 50 cm. The average
concentrations for 30 and 40 cm varied from 298 Bqm-3 to
528 Bqm-3 and 1390 Bqm-3 to 3327 Bqm-3 for 222Rn
respectively. At 50 cm 222Rn average concentrations ranged
from 9685 Bqm-3 to 52958 Bqm-3. At the location point 5 has
the maximum Radon concentration for all the three depths
compared with other locations. The high radon soil gas in any
area leads to the chance of having lung cancer.
Keywords
Radon, RAD7, soil probe
1. INTRODUCTION
Radon is a radioactive, colorless, tasteless, toxic noble gas
occurring naturally as an indirect decay product of uranium
and thorium. It is monatomic gas. Its most stable isotope is
222
Rn, has a half life of 3.8 days. 222Rn decays into radioactive
products or progeny of 218Po, 214Pb, 214Bi, and 214Po until it
reaches the final stable isotope 210Pb. Radon comes from the
soil, building and decoration materials, outdoor air etc. The
world average soil radon concentration is 7400 Bq/m3. People
are not vigilant because Radon is invisible and intangible.
Nazaroff and Nero [1] observed that radon enters the body
through breathing and the short-lived radionuclide from decay
of radon will be deposited in the bronchial, lung and kidney
tissue, they release α-particle which produces radiation
injuries from internal. This can damage lung tissue and lead to
lung cancer over the course of lifetime. Kullab et al. [2] and
report of UNSCEAR 1988 [3] gives information that thoron
and their decay products contributes 55% of total inhalation
doses to human population. Gupta et al. [4], Khatibeh et al.
[5] and Patra et al. [6] described that radon– thoron comes
from the soil and building materials, because the uranium and
radium are uniformly distributed in these materials from the
time of origination of earth. The indoor radon–thoron levels
depend upon so many factors like geological setting of area,
nature of soil, meteorological conditions, living style of the
dwellers and type of building material used for the house
construction [7-9]. Przylibski and Zebrowski, [10], and
751
ISBN: 978-81-924893-0-8
Manpreet Kaur A S Dhaliwal
Sant Longowal Sant Longowal
Institute of Institute of
Engineering and Engineering and
Technology, Technology,
Longowal, 148106, Longowal, 148106,
Sangrur, Punjab Sangrur, Punjab
(India) (India),
dhaliwalas@hotmail.
com
Przylibski et al. [11] have also measured radon concentrations
in groundwater and its concentrations varied from 0.2 to 1645
Bq dm-3 and values exceeding 1000 Bq dm-3 constituted 3.9%
of their results. A national residential radon survey was
launched in April 2009 in Canada, this survey uses alpha track
detectors used for a minimum of three months (Oct-April)
with the objective of testing is of about 18,000 homes over a
two year period [12]. Chauhan and Kumar [13] gave an idea
that radon gas concentration inside the soil is 103–104 times
higher than that of the environment.
The aim of the present work is to find out the radon
concentration in soil gas at explicit depth within the soil. To
do this, the air must be removed from the soil and delivered to
a RAD7 (radon monitoring system) of Durridge Company
(USA), without dilution by outside air. The volume of gas
removed depends on the technique used to extract it and the
porosity of the soil. In the present measurement we measured
the dependence of radon concentration with depth in soil of
Sant Longowal Institute of Engineering and Technology
(SLIET) at different locations. The high radon soil gas in
particular area leads to the chance of having lung cancer.
Keeping this in mind the concentration of radon soil gas is
measured.
2. MATERIALS & METHODOLOGY
Present measurements of radon concentrations in soil gas
were carried out using the RAD7 portable radon detector
(Durridge Company Inc. USA). The experimental setup is
shown in Fig 2. This system contains a solid-state ion-
implanted planar silicon detector and a built-in pump with a
flow rate of 1 L min-1. Desiccant (CaSO4) tubes is used to
absorb the moisture in the soil air, an infra-red HP8224OB
alpha-numeric printer placed on the top of the RAD7 and
nylon inlet filters (pore size 0.45 µm) that block fine dust
particles and radon daughters from entering the RAD7
chamber. The RAD7’s internal sample cell is a 0.7 L
conducting hemisphere with an average potential of 2200 V
relative to the detector that is placed at the center of the
hemisphere. The detector operates in external relative
humidity ranging from 0% to 99% and internal humidity of
0% to10%. The spectra are in 200 channels and the RAD7
groups them into eight windows of energy ranges. A, B, C,
and D are the major windows and E, F, G, and H are the
diagnostic windows. Window A covers the energy range from
5.40 to 6.40 MeV, showing the total counts from 6.00 MeV
particles from the 218Po decay. Window B covers the region
6.40 MeV to 7.40 MeV, showing the total counts of 6.78 MeV
particles from the 216Po. Window C represents total counts of
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

the 7.69 MeV a particles from 214Po, while the window D
represents the total counts of the 8.78 MeV a particles from
the decay of 212Po. In other words, windows A and B
represent ‘‘new’’ 222Rn (radon) and 220Rn (thoron), while
windows C and D represent ‘‘old’’ 222Rn and 220Rn,
respectively. The RAD7 separates radon and thoron signals by
their daughters products unique alpha particle energies with
little cross-interference (Durridge Company Inc., 2000).
In the present measurements sniff mode of the system is used,
which means that the RAD7 calculates radon concentrations
from the data in window A only and thoron concentrations
from the data in window B, while the data from windows C
and D are ignored. In this mode, the built-in pump runs
continuously. The soil gas probe used in our study was made
concentrations and the depth for the same location point.
However large variation of Radon concentration in soil gas
with depth. At the location point 5 has the maximum Radon
concentration for all the three depths compared with other
locations. The average Radon concentration in depth 50cm is
22763±418 Bqm-3, in depth 40cm is 2322±253Bqm-3, in depth
30cm is 412±36 Bqm-3.The average radon concentration level
in areas with higher depth may be due to the presence of
Uranium prospect beneath the soil.
550
Average Radon Concentration in Soil of Depth 30 cm
500
(a)

Radon Concentration (Bqm )

-3
of stainless steel with length of 106cm. This probe has an
450
inner rod inside a hollow tube and a sampling outlet. The
probe was inserted into the soil at depths of 30, 40, and 50cm.
After inserting the probe at the specified depth, the sampling 400

outlet was connected to the inlet of the RAD7 via a small

drying tube. Before each measurement the detector was 350

purged for at least 5 to 10min. After detecting high

concentrations of radon, the purging time was much longer. In 300
all the measurements the cycle time was 15min and three
cycles were performed. Thus the total duration of a single run 1 2 3 4 5
Location Point No.
at a specified depth was 20min. The final result is an average
from these 4 measurement cycles. The experimental results
are shown in the table 1 and the variation of the radon
concentration with the location points are shown in Fig. 1.
3500
Average Radon Concentration in Soil of depth 40 cm
3. RESULTS AND DISCUSSION
3000
(b)
An average value of Radon concentration was calculated for
Radon Concentration (Bqm )
-3

each location point in Bqm-3. In Table-1 all the results were

listed , and Fig. 1 shows the average Radon concentrations as 2500
a function of location point number .The radioactive level of
222
Rn for soil samples, as shown in Table-1, range from
2000
9958±130 Bqm-3 for location No.1 at depth 50 cm
underground surface, to 9430±40 Bqm-3 with the same depth.
For depth 40 cm the concentration varied from 1850±590 1500

Bqm-3 to 123±93 Bqm-3. While in the depth 30 cm, the Radon

concentration is varies from 614±58 Bqm-3 to 490±19 Bqm-3.
1000
1 2 3 4 5
For location No.2 at depth 50cm underground surface, Radon Location Point No.
concentration varied from 11608±310 Bqm-3 to 10300±240
Bqm-3. For depth 40cm the concentration varied from
3480±110 Bqm-3 to 2249±330 Bqm-3. While in the depth 30
cm, the Radon concentration is varies from 610±87 Bqm-3 to 60000
418±38 Bqm-3.For location No.3 at depth 50 cm underground Average Radon Concentration in Soil of Depth 50 cm
surface, Radon concentration varied from 27900±590 Bqm-3
50000
to 25702±1300 Bqm-3. For depth 40 cm the concentration (c)
Radon Concentration (Bqm )
-3

varied from 1428±110 Bqm-3 to 1290±2804 Bqm-3. While in

40000
the depth 30 cm, the Radon concentration is varies from
397±13 Bqm-3 to 319±90 Bqm-3.
30000
For location No.4 at depth 50 cm underground surface, Radon
concentration varied from 14800±220 Bqm-3 to 11294±900
20000
Bqm-3. For depth 40cm the concentration varied from
2530±310 Bqm-3 to 2110±600 Bqm-3 While in the depth
30cm, the Radon concentration is varies from 297±42 Bqm-3 10000

to 218±90 Bqm-3. For location No.5 at depth 50 cm

1 2 3 4 5
underground surface, Radon concentration varied from Location points No.
54328±900 Bqm-3 to 52108±100 Bqm-3. For depth 40cm the
concentration varied from 3469±30Bqm-3 to 3158±30 Bqm-3.
While in the depth 30cm, the Radon concentration is varies Fig. 1. Radon concentration as a function of the location
from 407±30 Bqm-3 to 249±20 Bqm-3. point number: (a) at depth 30cm, (b) at depth 40cm, and
(c) at depth 50 cm
By observing data from the table-1, one can see that in the
majority of locations there is linearity between the radon

752
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 1. Radon Concentrations in different depths for the

five location points in SLIET

Radon gas Concentrations in Soil

measured in Bqm-3 for different
Soil Probe
Location depth from ground surface
Point Desiccant (CaSO4) tube

30 cm 40 cm 50 cm
1 394±35 1760±252 10852±418
2 342±34 1390±254 9548±419
3 474±36 2783±253 27253±516 Connecting Tubes

4 325±36 2348±253 13205±450 RAD7 Detector

5 524±37 3327±252 52958±556
Fig 2: Experimental setup of RAD7 for measuring soil
radon gas at SLIET, Longowal.

ACKNOWLEDGMENTS
We thank Dr. A.S Dhaliwal and Dr. M. M. Sinha from
department of physics, SLIET, Longowal for providing RAD7
detector for radon concentration measurements. We would
like to thank them for their full motivation and appreciation
our work.
1. REFERENCES
[1] Nazaroff, W.W., Nero Jr., A.V. 1988. Radon and Its
Decay Products in Indoor Air, United States of America.
John Wiley & Sons.
[2] Kullab, M.K., Al-Bataina, B.A., Ismail, A.M., and
Abumurad, K.M. 2001. Seasonal variation of radon-222
concentrations in specific locations in Jordan. Radiat.
Meas. 34, 361–364.
[3] UNSCEAR, 1988. Sources, effects and risks of ionizing
radiations. United Nations Scientific Committee on the
effects of atomic radiation. Report to the General
Assembly on the Effects of Atomic Radiation. United
Nations, New York.
[4] Gupta, M., Chauhan, R.P. 2011. Estimating radiation
dose from building materials. Iran. J.Radiat. Res. 9, 187–
194.
[5] Khatibeh, A.J.A.H., Ahmed, N., Matiullah Kenawy,
M.A. 1997. Natural radioactivity in marbles stones.
Jordan Radiat. Meas. 28, 345–348.
[6] Patra, A.C., Sahoo, S.K., Tripathi, R.M., Puranik, V.D.
2013. Distribution of radionuclides in surface soils,
Singhbhum Shear Zone, India and associated dose.
Environ. Monit. Assess. 185, 7833–7843.
[7] Mehra, R., Bala, P. 2013. Estimation of annual effective
dose due to radon level in indoor air and soil gas in
Hamirpur district of Himachal Pradesh. J. Geochem. 142,
16-20.
[8] Plant, J.A., Saunders, A.D. 1996. The radioactivity earth.
Radiat. Protect. Dosim. 68, 25–36.
[9] Singh, B., Singh, S., Bajwa, B.S., Singh, J., Kumar, A.,
2011. Soil gas radon analysis in someareas of Northern
Punjab, India. Environ. Monit. Assess. 174, 209–217..
[10] Przylibski, T.A., Zebrowski, A. 1996. Origin of radon in
medical waters of Swierado´w Zdro´j. Nukleonika. 41
(4),109-115.
[11] Przylibski, T.A., 2004. Concentration of 226Ra in rocks
of the southern part of Lower Silesia (SW Poland).
Journal of Environmental Radioactivity 75 (2), 171-191..
[12] Health Canada. (2010). Cross Canada Residential
Survey. Retrieved September 27, 2010, from
http://www.hc-sc.gc.ca/ewh-emt/radiation/radon/survey-
sondage-eng.php.
[13] Chauhan, R.P., Kumar, A. 2013. Study of radon transport
through concrete modified with silica fume. Radiat.
Meas. 59, 59–65.

753
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

DETERMINATION OF CONDUCTIVITY OF HUMAN

TEAR FILM AT 9.8 GHZ
Namita Bansal A.S. Dhaliwal K.S. Mann
Department of Physics
Sant Longowal Institute of Engineering and Technology, Longowal, Punjab, India
namitabansal.physics@gmail.com

ABSTRACT
In view of increasing concern about the interaction of microwaves generated from various sources such as cell phones and
their base stations, televisions, radar, Bluetooth devices etc, with human body particularly eye which is the most sensitive
organ to microwave heating due to its low heat dissipating properties, present research deals with determining the
conductivity of human tear film at 9.8 GHz which in turn is expected to be helpful in determining the specific absorption rate
of 9.8 GHz microwaves in this film. The apparatus consists of an X- band rectangular resonant cavity designed to resonate at
9.8 GHz in H103 mode and a vector network analyzer. Due to difficulty in measuring accurately the very small volume of tear
film which is of the order of one micro-litre, indirect measurements are made. In other words, method used presently does
not require the knowledge of volume of tear film. Experimentally it has been observed that resonance frequency in the
presence of pure water is almost same as that of tear film, therefore conductivity of film is determined by measuring directly
the loss tangent of tear film using Slater’s technique and well known calculated value of real permittivity of pure water. Due
to individual physiological differences, the average conductivity of tear film of small population consisting of six subjects is
reported. Survey of literature shows that electrical properties of tear film are not available at any radio as well as microwave
frequencies; therefore presently reported results are first of its kind.

Key Words: Tear Film, Conductivity, Resonant Cavity, Slater’s Technique

REFERENCES
[1]. C. Gabriel, S. Gabriel and E. Corthout, Phys. Med. Biol. 41, 2231-2249 (1996).
[2]. S. Gabriel R. W. Lau and C. Gabriel, Phys. Med. Biol. 41, 2251-2269 (1996).
[3]. A. Peyman, S. Holden and C. Gabriel, Final Tech. Rep., MTHR Department of Health, UK, 2005.
[4]. J.C. Slater, Rev. Mod. Phys. 18, 441-511 (1946).
[5]. K. Hutcheon, M. deJong and F. Adams, J. Microw. Power Electromagn. Energy 27, 87-92 (1992).
[6]. U. Kaatze, J. Chem. Eng. Data 34, 371-374 (1989).

754
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Biological Significance of Nitrogen Containing

Heterocyclic compounds - A Mini Review
Rajni Gupta
Department of Chemistry
S.D. College, Barnala-148101(Pb.)
guptarajni024@gmail.com

ABSTRACT compounds. Among all these compounds, pyrimidines are one

of the most important categories of compounds owing their
Heterocyclic compounds are found in abundance in nature and importance to pharmacological activities. It is one of the
are of great significance to biological system because of their essential constituent of all the cells in living beings (3).
unique structural features. They are found in a number of Pyrimidines are important constituents of nucleic acids, as a
natural products like nucleic acid, vitamins, antibiotics, part of bases like thiamine, uracil and cytosine. (4)
hormones etc. Nitrogen containing heterocyclic compounds
are an important class of heterocyclic compounds that has paid
significant contribution towards medicinal chemistry. The
types of compounds depend upon number of nitrogen atoms
and their position. E.g. Pyrimidine contains one nitrogen atom
in ring skeleton. With two nitrogen atoms it is called diazine,
pyrazine etc. However, the review tends to focus on the
importance of Pyrimidine class of compounds and their role as
antibacterial, antifungal, anti-malarial, anticancer and other
agents. The review also includes some of the marketed drugs Fig. 2 Cytosine
having Pyrimidine ring nucleus and their application.
Pyrimidine skeleton is present in vitamins, riboflavin,
Keywords- Heterocyclic compounds, Pyrimidine, anti- thiamine, and folic acid (5).
bacterial, antifungal, anti malarial, anticancer.

INTRODUCTION
Pyrimidines are heterocyclic compounds similar to pyridine.
Pyridine is a 6-membered cyclic compound that contains 4-
carbon atoms and 2-nitrogen atoms at position 1 and 3 (1).
Though, pyrimidine itself is not very active, its derivatives are
very important in medicinal chemistry.

Fig.3 Riboflavin

Fig. 1 Pyrimidine

Heterocyclic rings are important components of hormones,

vitamins, amino acids and synthesized drugs. Pyrrole,
thiophene, piperidine, furan, pyridine, pyrrolidine, thiazole
etc. Are very important heterocyclic compounds used in
synthesis. (2) Fig. 4 Thiamine

In the family of heterocyclic compounds, nitrogen containing

heterocyclic compounds find an important place in medicinal
chemistry. Azine, pyridine, diazine, pyrimidine, pyrazine are
various examples of nitrogen containing heterocyclic

755
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig. 8 Flucytosine

Sacchi et al (15). prepared compounds (9) and (10) that showed

anti-inflammatory activities
Fig. 5 Folic acid

Pyrimidine skeleton is present in many synthetic compounds

such as barbituric acids and veranal, a derivative of barbituric
acid that are used as hypnotics (6).

Fig. 9

Fig. 6 Barbituric acid

Fig. 10

Cottom et al (16). synthesized (11) as inhibitors of adenosine

kinase. The compound (11) co as found to exhibit anti
inflammatory activity.

Fig. 7 Veranal

The presence of pyrimidine ring in bases of DNA and RNA is

linked with their widespread biological activities. The
literature survey indicated that the compounds containing
pyrimidine nucleus exhibit pharmacological activities like
anti-microbial(7)., anti-viral(8)., anti tumor(9)., anti-malarial(10).,
anti-neoplastic(11)., anti-HIV(12)., cardiovascular agents(13).,
anti-fungal, anti-histaminic, anti-diabetic and herbicidal.

Most drugs within pyrimidine nucleus find their place in four

categories i.e. sulphonamides, anti-tumor, barbiturates and
anti-microbial agents. Fig. 11

Kompis I et al (17). Synthesized Brodimoprim (12) and

Polak A. and co-workers (14). synthesized Flucytosine, a
indicated that the compound is found to have anti bacterial
fluorinated pyrimidine compound exhibiting antifungal
activities.
activities towards infections caused by strains of Cryptococcus
and Candida.

756
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig. 16

Fig. 12 Gogia and co workers (20). synthesized 1, 3, 4-thiadizolo-(3, 2-

a) pyrimidine-5-one (17) and showed antifungal activity.
Brodimoprim

Molina et al (18). Synthesized a number of pyrido (1, 2-c)

pyrimidine derivatives (13),(14) and (15) that showed their
effects on leucocytes.

Fig. 17

Sondhi S.M. and co workers (21). synthesized pyrimidine

derivative (18, 19) that were reported to exhibit analgesic and
anti inflammatory activities.

Fig. 13

Fig. 18

X=O, S

Fig. 14

Fig. 19

Rathod I.S. and co workers (22). synthesized derivatives of

thieno (2, 3-d) pyrimidine-4(3H) - ones (20) and reported their
analgesic activities.

Fig. 15

Bruno et al (19). Synthesized a series of 2, 5-cycloamino-5H,

benzopyrano (4, 3-d) pyrimidines (16) that showed anti-
platelet activity.

757
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

R= -CH3, -NHPh R1=R2= Ph, o-Anisyl

Fig. 20

Fig. 21

Some of the pyrimidines and fused pyrimidines drugs

Gaby, Hamide and Gharab (23). prepared a series of pyrimidine marketed along with their biological activities are tabulated as
-2-thione (21). Some of them displayed anti- cancer activities. follows:-

Biological activity Compound Structure

Afloqualone

Anti-inflammatory and
Analgesics

Epirizole

Celecoxib

758
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Nilotinib

Anti-cancer

Dasatinib

Bosutinib

Trimephoprim

Anti-bacterial

Metiotrim

Tetroxoprim

759
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Anti-fungal Flucytosine

Broxuridine

Anti-viral

Idoxuridina

Respiratory tract Brodimoprim

infections

Urinary tract infections Pipemidic acid

Hyperuricaemia Tisopurine
disorders

760
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

CONCLUSION 15. A. Sacchi, S. Laneri, F. Arena, E. Luraschi and F.

Pyrimidine has a unique and a characteristic role in our life
as it is present in all types of living cells. The heterocyclic
skeleton exhibits vast medicinal and biological
significance. The reviewed paper reveals a vast range of
pharmacological activities exhibited by heterocyclic drugs
having pyrimidine moiety. These days pharmaceutical
companies are preparing pyrimidine based drugs.
Rossi, Eur. J. Med. Chem.,32,667(1997)
16.H.B. Cottom, D.B. Wasson, H.C. Shih, G.D Pasquale
and D.A. Carson, J. Med. Chem.,36,3424(1993)
17. Komis I and Wick A; Helv. Chim. Acta, 1997; 60:3025
18.P. Molina; E. Aller, A. Lorengo, P.L. Cremadis, I.Rioja
and M.J. Alcaraz, J. Med. Chem.,44,1011(2011)

REFERENCES 19. O. Bruno, C. Brullo; A. Ranise, S. Schenone, S.

1. Gilchrist, Thomas Lonsdale; Gilchrist, T.L. Heterocyclic
Chemistry, New York; Longman.(1997)
2. Devprakash, AB Udaykumar, Journal of Pharmaceutical
Research, 2011; 4(7):2436-2440
3. T. Sasada, F.Kobayashi, N. Sakai, T. Konakahara,
Organic Letters, 2009; 11:2161-2164
4. Amir M, Javed S. A. and Kumar H; Indian J. Pharm.
Sciences, 2007; 69(3):337-343
5. O. Stanislaw, (2009), Jord. J.Chem, 4:1-15
Bondavalls, M. Tognolini and M. Impicciatore, Bioorg.
Med. Chem. Lett., 11, 1379(2001)
20. Gogia, Prabin Chandera (Reg Research Lab.) Jorhat
785006. Indian Heterocycles, 1991; 32(10)
21. Sondhi SM, Verma RP; Indian Drugs, 1999; 36(1):50
22. Rathod IS, Pillai AS and Shirsath VS; Indian J.
Heterocyclic Chem.; 2000; 10; 93
23. M.S. El-Gaby, S.G. Abdel-Hamide and M.M. Gharab,
Acta. Pharm., 49(3), 149(1999); Chem. Abstr, 132, 93278d
(2000)

6. Jain M.K., Sharnevas S.C.; Organic Chem.; 2008;

3:997-999

7.Desai K, Patel R,Chickhalia K J. Ind.

Chem.,2006;45:773-778

8. Amr EA, Nermien MS, Abdulla MM. Monatsh Chem.,

2007; 138:699-707

9.Wagner E, Al-Kadsi K, Zimecki M, Sawka-

Dobrowolska W. Eur J Med Chem.,2008;43:2498-2504.
Some of these marketed drugs are listed above. The
biological significance of pyrimidine reflects its versatility
and it offers the medicinal chemist a continued interest in
planning and developing new drug to ensure heterocyclic
chemistry, an area of great interest.

10. Gorlitzer K, Herbig S, Walter Rd. Pharmazie, 1997;

52:670-672

11. Jean-Damien C, David B, Ronald K, Julian G, Pan L,

Robert D. Vertex Pharmaceuticals Incorporated, USA,
PCT Int. Appl. 2002; 22:608

12.Fujiwara N, Nakajima T, Ueda Y, Fujita HK, Awakami

H. Bioorg Med. Chem. Lett.,2007;17:1736-1740

13.Kurono M, Hayashi M, Miura K, Isogawa Y, Sawai K,

Kokai Tokkyo Koho JP 1987;62:267-272, Chem. Abstr,
1988;109:37832

14. Polak A. and Scholer HJ; Chemotherapy, 1975; 21:113

761
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Steady State creep Behavior of Functionally Graded
composite by using analytical method
Ashish Singla Manish Garg
Department of Mechanical Department of Physics
Engineering S.D. College, Barnala, Punjab
BGIET, Sangrur, Punjab
manishgarg189@gmail.com
er.ashishsingla@hotmail.com
ABSTRACT
The Steady state creep behaviour of a functionally graded
cylinder made of isotropic composite containing varying
distribution of silicon carbide particles has been investigated
by a mathematical model. The creep behaviour of the FGM is
described by a Norton’s Power law. The effect of varying
distribution of SiCP particles of creep stresses and creep rates
in the FGM cylinder has been analyzed and compared with a
cylinder, having uniform distribution of reinforcement. The
study reveals that the increasing particle content in the
cylinder, tangential and effective stresses increase near the
inner radius but decrease near the outer radius. The strain
rates in FGM cylinder decreases with the increase in SiCP
reinforcement. The magnitudes of tangential and radial strain
rates in FGM discs are significantly lower than in a uniform
composite disc.
Keywords
Functionally Graded Material, Cylinder, Creep.
1. INTRODUCTION
Functionally Graded Material (FGM) is characterized by a
continuous variation of volume fractions of the constituent
phases in either one (thickness) or several directions. FGMs
possess a number of advantages that make them attractive in
potential applications, including a potential reduction of in-
plane and transverse through-the-thickness stresses, an
improved residual stress distribution, enhanced thermal
properties, higher fracture toughness, and reduced stress
intensity factors (Noda et. al., 1998). FGMs have been
developed as ultra high temperature resistant materials for
potential applications in aircrafts, space vehicles and other
structural components exposed to elevated temperature
(Birma and Byrd, 2007). In most of these applications,
cylinder is subjected to severe mechanical and thermal loads,
causing significant creep and reducing its service life (Gupta
and Pathak, 2001, Hagihara and Miyazaki, 2008 and,
Tachibana and Iyoku, 2004).
Arya and Bhatnagar (1976) analyzed creep analysis of thick-
walled anisotropic cylinder subjected to combined internal
and external pressures by considering elastic strains. The time
hardening law was used to obtain the fundamental equations
of creep in an orthotropic cylinder. The results obtained for
the anisotropic cylinder were compared with those estimated
for isotropic cylinder. Mishra and Samanta (1981)
investigated finite creep in an orthotropic thick-walled
cylindrical shells operating at high pressure and temperature.
It is observed that the temperature variation has a significant
effect on the strain as well as the strain-rate, particularly when
the molecular anisotropy of the material is taken into account.
Shukla (1997) obtained the expressions for elastic-plastic
762
ISBN: 978-81-924893-0-8
V. K. Gupta
Department of Mechanical
Engineering
UCoE, Punjabi University
Patiala, Punjab
guptavk_70@yahoo.co.in
transitional stresses and axial strain in a compressible cylinder
subjected to internal pressure by using Seth’s transition
theory. The study indicates that the presence of
compressibility having lesser value at the internal surface of
the cylinder reduces the axial contraction and the stresses,
increases the pressure required for the initial yielding and
decreases its value for fully plastic state. Chen et. al. (2007)
analyzed the creep behavior of thick walled cylinders made of
FGM and subjected to both internal and external pressures.
Derived the asymptotic solutions on the basis of a Taylor
expansion series and compared with the results of Finite
Element analysis (FEA) obtained by using ABAQUS
software. You et. al. (2007) analyzed steady state creep in
thick-walled FGM cylinders subjected to internal pressure by
using Norton’s power law. The impact of radial variations of
material parameters was investigated on stresses induced in
the cylinder. Sharma et. al. (2010) estimated creep stresses in
internally pressurized thick-walled rotating cylinder made of
isotropic and transversely isotropic materials by using Seth’s
transition theory. It is seen that a rotating circular cylinder
made of transversely isotropic material is on the safer side of
the design as compared to a rotating circular cylinder made of
isotropic material.
In the light of above mentioned, it has been decided to
investigate the effect of varying reinforcement (SiCp) gradient
on the creep behavior of the FGM cylinder by using Norton
Law. The study carried out is an attempt to evolve
understanding of the creep behavior and content of the
reinforcement on the creep stresses and strain rate in the FGM
cylinder
2. DISTRIBUTION OF
REINFORCEMENT
The distribution of SiCp in the FGM cylinder decreases
linearly from the inner to outer radius. The amount (vol %) of
SiCP, V(r), at any radius r, is given by (Singh and Gupta,
(2011).
V r   Vmax 
r  a  V  V  (1)
b  a  max min
Where Vmax and Vmin are respectively the maximum and
minimum content of SiCP at the inner and the outer radii of
the cylinder respectively
The average SiCp content in the cylinder can be expressed as,
b b
 
2rlV (r )dr 2 rV (r )dr
Vavg  a
 a
(2)
 (b 2  a 2 )l (b 2  a 2 )
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Where l is the length of cylinder. d r

   r
r (12)
Substituting V(r) from Eq. (1) into Eq. (2) and integrating, we dr
get, The material of the cylinder is incompressible, therefore,
r     z  0
   
(13)
3Vavg 1  2 1     Vmax 1  32  23 The constitutive equations under multi axial creep in an
Vmin  (3)
2  3  
3 orthotropic cylinder, when the principal axes are the axes of
reference, Bhatnagar and Gupta [2] are given by,
Where   a b 
r  e 2 r      z  (14)
2 e
3. CREEP LAW AND PARAMETERS
e
The creep behavior of the FGM cylinder is described by   2    z   r  (15)
Norton’s power law as, 2 e
e  B en e
(4)  z  2 z      r  (16)
2 e
Where  e is the effective strain rate,  e is the effective stress, Where e and  e are respectively the effective strain rate
B and n are material parameters describing the creep and effective stress in the FGM cylinder.
performance in the cylinder. The Principal axes of isotropy are the axes of reference, Dieter
It is evident from the study of Singh and Ray (2001) that the [5], is given by,

 
values of creep parameters B and n appearing in the Norton’s 1
12

law depend on the content of reinforcement, which vary with  e   (   z )2  ( z   r )2  ( r   )2  (17)
the radial distance. 2 
Since Under plain strain condition (  z  0 ), one may get

 V (r )  from Eqs. (7), (8) and (13),
B(r )  Bo   (5) C
 Vavg  u r  (18)
r
 Where C is a constant of integration. Using Eq. (18) in Eqs.
 V (r )  (7) and (8), we get,
n( r )  n o   (6)
 Vavg  r   2
C
(19) and
C
  2 (20)
r r
Where Bo and no are respectively the values of creep
Under plane strain condition, Eq. (16) becomes,
parameters B and n respectively and ϕ is the grading index.
(    )
The values of Bo , n and ϕ are respectively taken as 2.77 x z  r (21)
10-16 , 3.75 and 0.7 as reported in the study of Chen et. al., 2
(2007). Substituting  z from Eq. (21) in to Eq. (17), we get,

4. MATHEMATICAL FORMULATION 3 (    r )
e  (22)
Consider a FGM thick-walled hollow cylinder with an inner 2
radius a and outer radius b subjected to an internal and Substituting  r and  z respectively from Eqs. (19) and (21)
external pressures p and q respectively. The cylinder is made into Eq. (14), we obtain,
of orthotropic material and is sufficiently long and hence is
assumed under plain strain condition (i.e. axial strain rate, 1.33 e C
 z  0 )    r  (23)
e r 2
The radial (  r ) and tangential (  ) strain rates in the Using Eqs. (4) and (22) in Eq. (23) and simplifying, one gets,
cylinder are given by: I1
du u    r  2/n
(24)
 r  r (7) and   r (8) r
dr r 1
n 1
Where u r  du dt is the radial displacement rate and u is I 1  1.33
C n
Where, 2n (25)
1
the radial displacement. B n
Eqs (7) and (8) may be solved to get the following Substituting Eq. (24) into Eq. (12) and integrating, we get,
compatibility equation,  r  X1  p (26)
d
r    r   (9) r


dr I1
Where, X1  n2
dr (27)
The cylinder is subjected to the following boundary
conditions, a r n

 r   p at r  a (10) Substituting Eq. (26) into Eq. (24), we obtain,

 r  q at r  b I
(11)   X1  21/ n  p (28)
Where the negative sign of  r implies the compressive nature r
To estimate the value of constant C, needed for estimating I 1 ,
of radial stress.
By considering the equilibrium of forces acting on an element the boundary conditions given in Eqs. (10) and (11) are used
of the cylinder in the radial direction, we get, in Eq. (26) with X1(Eq. 27) integrated between limits a to b. to
get,

763
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

b 60


I1
n 2
dr  p  q (29)
a r n
55
Substituting the value of I1 from Eq. (25) in to Eq. (29) and
simplifying, we obtain,
n
 p q 50
C  (30)

(MPa)
 X2 
n 1
1.15 n
b
45
Where, X 2 
 n2 1
a r n Bn
dr (31)

40 tangential stress (present study)

Using Eqs. (21) and (22) into Eqs. (14) and (15), one obtains,
3e
  r  (32)
2 35
The analysis presented above yields the results for isotropic
FGM cylinder.
5. NUMERICAL SCHEME OF
COMPUTATION
Following the procedure described in section 4 and to begin
the computation procedure, the vlaues of X 2 Eq.(31) is
estimated by substituting the value of the Creep parameters B
and n from Eqs(5) and (6) respectively.To obtain the value of
constant C by substituted the vlaue of X 2 in Eq.(30) and using
this value in Eq.( 25), the value of I1 is obtained. By using this
value of I1 in Eq.(27), the value of X1 is obtained. After
getting the value of X1, the Stresses  r and   are obtained
from Eqs.(26) and (28) respectively. Now, to estimate the
distribution of axial stress  z , the value of  r and   are
substituted in Eqs.(21), after obtaining the value
of  r ,   and  z , the values of  e and e are calculated
from Eqs. (22) and (4) respectively. Finally the strain rates
 r and  are calculated respectively from Eqs. (14) and (15).
The results have been obtained for three different composite
cylinders, as described in Table 5.1.
Table 5.1: Details of different composite cylinders
tangential stress (Chen et al)
10 12 14 16 18 20
r(mm)
Figure.1: Validation of present study vs Chen et. al. (2007)
6.1 Variation of Creep Parameters
Figure 2 shows the variation of creep parameters B with radial
distance in FGM and Non-FGM cylinders. In FGM cylinders
C2 and C3, the value of parameter B decreases with increase
in radius, but the value of B parameter remains constant for
Non-FGM cylinder due to constant amount of SiCP content.
The variation of creep parameters B and n exhibits a crossover
at a radius of around 15.8 mm. Figure 3 shows the variation of
creep parameters n with radial distance in FGM and Non-
FGM cylinders. In FGM cylinders C2 and C3, the value of
parameter n increases with increase in radius, but the value of
n parameter remains constant for Non-FGM cylinder due to
constant amount of SiCP content. Figure 4 shows the variation
of SiCP Content in FGM and Non-FGM cylinders. It is
observed that the distribution of SiCP reinforcement in FGM
cylinder C2 and FGM Cylinder C3 decreases from inner to
outer radius. However, the Non-FGM Cylinder C1 has
uniform value because it remains 20% throughout. The
variation of SiCP Content exhibits a crossover at a radius of
around 15.8 mm.

Cylinder Vmax. Vavg Vmin 3.5

Non-FGM(C1)
vol.% vol.% vol.%
FGM(C2)
Non-FGM (C1) 20 20 20 FGM(C3)
B*10 (MPa /s)

3.0
FGM (C2) 25 20 16
-n

FGM (C3) 30 20 12
2.5
-16

6. RESULTS AND DISCUSSION

Before presenting the result completed, it is necessary to
check the validity of the mathematical formulation carried
out. To accomplish this task, the tangential stress in a cylinder 2.0
for which the results are reported by the Chen et. al., 2007.
The values of Bo , n and ϕ are respectively taken as 2.77 x
10-16 , 3.75 and 0.7 as reported in the study of Chen et. al.,
10 12 14
(2007). The tangential stress obtained in the cylinder is r (mm)16 18 20
compared with that reported by Chen et. al. (2007). A good
agreement is observed in Fig. 1 between the results obtained Figure 2: Variation of creep parameter B in cylinders
in present study and those of Chen et. al. (2007).

764
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

5.5

Figure 8 shows the variation of radial and tangential strain

5.0 Non-FGM(C1) rates in the FGM and Non-FGM cylinders. It is observed that
FGM(C2) the effect of radial and tangential strain rates in the cylinders
FGM(C3) decreases with increasing radius. The radial and tangential
4.5
strains rates of Non-FGM cylinder C1 decreases as the radius
increases, when Non-FGM cylinder C1 is compared with
4.0 FGM cylinder C2 and C3, It is observed that in case of FGM
Cylinder C2, the radial and tangential strain rates increases at
n

3.5
inner radius and decreases at outer radius, while in case of
FGM cylinder C3 the radial and tangential strain rate less than
Non-FGM cylinder C1 and decreases as moves from inner
3.0 radius to outer radius. Figure 9 shows the variation of
effective strain rate in the FGM and Non-FGM cylinders
2.5
similar those described for radial and tangential strain rates.
10 12 14 16 18 20 The strain rates show a little decrease in the middle of the
r(mm) cylinder with the increase in SiCP reinforcement.
0
Fig.3: Variation of stress exponent n in cylinders

-10
30

28
Non-FGM(C1)
-20
26 FGM(C2) r(MPa)
FGM(C3)
24
-30 Non-FGM(C1)
22
FGM(C2)
V (%)

20 FGM(C3)
-40
18

16
-50
14
10 12 14 16 18 20
12
r(mm)

10 12 14 16 18 20 Fig.5: Variation of radial Stress in cylinders

r (mm)
Fig.4: Variation of SiCP Content in cylinders
270

240
6.2 Distribution of stresses and strains
Figure 5 shows the variation of radial stress in the FGM and 210
Non-FGM cylinders. It is observed that the radial stress 180 Non-FGM(C1)
remain compressive over the entire cylinder with a maximum
(MPa)

150 FGM(C2)
(compressive) and zero value reported at the inner and outer
FGM(C3)
radii respectively, under the imposed boundary conditions 120
given in Eqs. (10) and (11). It is observed which the radial
stress is increasing over the entire cylinder radii with the 90
increasing SiCP reinforcement in the cylinder and the value of 60
radial stress in FGM cylinder is higher than the Non-FGM
Cylinder. Figure 6 shows the variation of tangential stress in 30
the FGM and Non-FGM cylinders. The tangential stress 0
remains tensile throughout the FGM and Non- FGM
10 12 14 16 18 20
cylinders. By increasing Particle gradient in the FGM r(mm)
Cylinder, the tangential stress increases near the inner radius
but decreases toward the outer radius when compared with the Fig. 6: Variation of Tangential Stress in cylinders
distribution of tangential stress in Non-FGM cylinder C1. At
inner radius the value of stress of FGM cylinder C2 is less
than FGM cylinder C3. Whereas at outer radius its vice versa
7. CONCLUSIONS
i.e value of stress of FGM cylinder C2 is more than FGM A. The study carried out has led to the following
cylinder C3. And the values of all these cylinders intersect conclusions:
each other in between 12.3 to 14.3. Figure 7 shows the B. The radial stress (compressive) in the composite
variation of effective stress in the FGM and Non-FGM cylinder decreases with the increase in gradient in
cylinders. It is observed that the effective stresses increase the distribution of SiCp reinforcement.
near the inner radius but decrease towards the outer radius, C. In the presence of particle gradient in the FGM
when compared with composite Non-FGM cylinder C1 cylinder, the tangential and effective stresses
having uniform distribution of SiCp reinforcement.

765
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

increase near the inner radius but decrease towards REFERENCES

the outer radius, when compared with cylinder
having uniform distribution of SiCp reinforcement.
D. The radial, tangential and effective strains in the
composite cylinder decreases significantly with
increasing particle content in the cylinder. The
reduction observed near the inner radius is higher
than those observed towards the outer radius.
The strain rates shows a little decrease in the middle of the
cylinder with the increase in SiCP reinforcement
270
240
[1] Arya, V.K. and Bhatnagar, N.S. (1976) Creep of thick
walled orthotropic cylinders subjected to combined
internal and external pressures, Journal of Mechanical
Engineering Science, Vol. 18, No. 1, pp. 1–5
[2] Bhatnagar, N.S. and Gupta, S.K., (1969) Analysis of thick-
walled orthotropic cylinder in the theory of creep,
Journal of the Physical Society of Japan, Vol. 27, no. 6,
pp. 1655- 1662
[3] Birman, V. and Byrd, L. W. (2007) Modeling and
Analysis of Functionally Graded Materials and
Structures, Applied Mechanics Reviews, Vol. 60, pp.
195-216

210
[4] Chen, J.J., Tu, S.T., Xuan, F.Z. and Wang, Z.D.(2007),
Creep analysis for a functionally graded cylinder
180 subjected to internal and external pressure, Journal of
150 Non-FGM(C1) Strain Analysis of Engineering Design, Vol. 42, no. 2,
e(MPa)

FGM(C2) pp. 69-77

120 FGM(C3)
[5] Dieter, G.E. (1988) Mechanical Metallurgy, 3rd ed.
90 London, McGraw-Hill Publications.
60 [6] Gupta, S.K., Pathak, S. (2001) Thermo creep transition
in a thick walled circular cylinder under internal
30
pressure, Indian Journal of Pure and Applied
0 Mathematics., vol. 32, issue. 2 , pp.237–253
10 12 14
r(mm) 16 18 20 [7] Hagihara, S., and Miyazaki, N. (2008) Finite element
analysis for creep failure of coolant pipe in light water
Fig. 7: variation of Effective Stress in cylinders reactor due to local heating under severe accident
condition, Nuclear Engineering Design, Vol. 238, issue
1, pp. 33–40.
-9
4.0x10
[8] Mishra, J.C., and Samanta, S.C. (1981) Finite creep in
-9
3.5x10 thick walled cylindrical shells at elevated temperature,
-9 Acta Mechanica, Vol. 41, nos. 1-2, pp. 149-155
3.0x10
[9] Noda, N., Nakai, S., Tsuji, T. (1998) Thermal stresses in
Non-FGM(C1)
  = -  r (s )

-9
2.5x10
-1

FGM(C2) functionally graded materials of particle-reinforced

2.0x10
-9
FGM(C3) composite, JSME International Journal Series, Vol. 41,
.

-9
No.2, pp. 178-184
1.5x10
[10] Shukla, R.K. (1997) Elastic-plastic transition in a
.

-9
1.0x10 compressible cylinder under internal pressure, Indian
5.0x10
-10 Journal of Pure and Applied Mathematics, Vol. 28, issue
2, pp. 277–288.
0.0
[11] Singh, S.B. and Ray, S. (2001) Steady-state creep
10 12 14 16 18 20
r (mm) behavior in an isotropic functionally graded material
Fig. 8: variation of radial and tangential strain rate in rotating disc of Al-SiC composite, Metallurgical and
Materials Transactions, Vol. 32, Issue. 7, pp. 1679-1685.
cylinders
[12] Singh, T. and Gupta, V.K. (2011) Effect of anisotropy on
4.5x10
-9 steady state creep in functionally graded cylinder,
-9
Composite Structures, Vol. 93, Issue 2, pp. 747-758.
4.0x10

3.5x10
-9 [13] Sharma S., Sahni M and Kumar R. (2010) Thermo creep
-9
transition of transversely isotropic thick-walled rotating
3.0x10
Non-FGM(C1) cylinder under internal pressure, International Journal of
2.5x10
-9
FGM(C2)
 e(s )

Contemporary Mathematical Sciences, Vol. 5, no. 11, pp.

-1

FGM(C3)
517 – 527
-9
2.0x10
.

-9
1.5x10
[14] Tachibana, Y., Iyoku, T. (2004) Structural design of high
-9
1.0x10 temperature metallic components, Nuclear Engineering
5.0x10
-10
Design, vol. 233, Issue 1-3, pp. 261–272.
0.0
10 12 14 16 18 20
r(mm) [15] You, L.H., Ou, H. and Zheng, Z.Y. (2007) Creep
deformations and stresses in thick-walled cylindrical
Fig. 9: Variation of effective strain rate in cylinders vessels of functionally graded materials subjected to
internal pressure, Composite Structures, Vol. 78, Issue 2,
pp. 285–291.

766
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
GETTING ENERGY AND A CLEANER
ENVIRONMENT WITH NANOTECHNOLOGY
Savita Sood
Department of Chemistry, S D College, Barnala
savita_sood2007@yahoo.com
ABSTRACT
Nanotechnology involves research and technology
development at the 1nm-to-100nm range. It creates and
uses structures that have novel properties because of their
small size. Chemists have been doing nanoscience for
hundreds of years. Stained-glass windows found in
medieval churches contain different sized gold
nanoparticles incorporated into the glass- the specific
size of particles creating orange, purple, red or greenish
colours. Einstein calculated the size of sugar molecule as
1nm. Nanotechnology is, at heart, interdisciplinary
subject. Chemists, physicists, and doctors are working
alongside engineers, biologists and computer scientist to
determine the applications, direction and development of
nanotechnology. This paper is the review of the use of
nanotechnology in cleansing the environment. One of the
major problems is the emission of carbon dioxide due to
the burning of coal in power plants. By using
nanocrystals composed of cadmium, selenium, indium in
smoke tracks the emission of harmful gases can be
minimized. Mercury vapours emitted by coal-fired power
plants can be rendered harmless using titanium oxide
nanocrystals under UV light. Bio friendly corporations
have developed nanocatalyst which when added to diesel
fuel causes it to burn more completely. We can use
nanotechnology to produce energy with more effective
solar cells, more efficient hydrogen production and more
efficient batteries. Scientists have developed solar cells
that use titanium oxide nanocrystals embedded in
plastics. These cells can be used in devices such as
laptops and mobile phones. Researchers are projecting
that light bulbs made with quantum dots will turn almost
hundred per cent of the power from electricity into light.
So very little energy will be wasted as heat. Hence,
nanotechnology has revolutionised our lives.
Keywords
Nanocrystals, Quantum dots, Nanocatylst
1 INTRODUCTION
Nanotechnology is the understanding and control of
matter and processes at the nanoscale, typically, but not
exclusively, below 100 nanometres in one or more
dimensions where the onset of size-dependent
phenomena usually enables novel applications.
767
ISBN: 978-81-924893-0-8
Nanotechnology is cross-disciplinary in nature, drawing
on medicine, chemistry, biology, physics and materials
science. Nanotechnology promises to be the tool we
need. Designing and developing new material properties
on the nanoscale enables new applications and solutions.
We are in fact already seeing products such as energy-
efficient LED lights, new nanomaterials for thermal
insulation, low friction nanolubricants and lightweight
nanocomposites on the market. This is just the beginning.
Mankind has tendency to use energy on everything from
heating our homes to driving to work. With shrinking
supplies of fossil fuels, we can use nanotechnology to
produce energy with cost effective solar cells, more
efficient hydrogen production and batteries. Many nano
materials have properties of adsorbents, depend on size.
Chemically modified nanamaterial have also attracted a
lot of attention especially nanoporous materials due to
their exceptionally high surface area. TiO2
functionalized with ethylenediamine as such, tested for
its ability to remove anionic metals from contaminated
groundwater. Scientific and technical methods to
mitigate environmental pollution rely on many
approaches and vary for the cases of soil, water and air
purification. The remediation approach chosen depends
on the complexity and nature of the contaminated media
and economic costs of the treatment. Environmental
remediation plays a pivotal role in the decision to employ
a particular technology.
2 ENERGY EFFICIENCY
The International Energy Agency (IEA) estimates that
energy savings corresponding to almost one fifth of the
current worldwide energy consumption can be achieved
by improved energy efficiency. Nanotechnology enables
large energy and cost savings, especially in the building,
transportation and manufacturing industries.
3 ENERGY PRODUCTION AND
POWER TRANSMISSION
Nanotechnology is a key enabling technology both to
exploit traditional energy sources in a more efficient,
safe and environmentally friendly manner, and to tap into
the full potential of sustainable energy sources such as
biomass, wind, geothermal and solar power. It also offers
solutions to reduce energy losses in power transmission,
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
and to manage complex power grids with dynamically
changing loads and decentralised feed-in stations.
4 BRIGHT PERSPECTIVES FOR
SOLAR ENERGY
The conversion efficiency of photovoltaic and
photochemical solar cells is traditionally governed by a
compromise – in order to absorb enough light, at least
micrometre-thick layers are required, while charge car-
rier collection is more efficient the thinner the active
layer is. Several types of nanomaterial that absorb light
very efficiently are currently under development; they
include quantum dots, plasmonically active metallic
nanoparticles and nanowires. Charge carrier collection
can be improved by designing nanostructures which
exhibit short collection paths with reduced recombination
losses. Consequently, less active material is needed and
purity requirements can be relaxed. Graphene is a
promising alternative to indium tin oxide, a scarce
material commonly used to fabricate transparent
electrodes in solar cells and LCD displays.
Nanotechnology-enabled solar cells can thus be produced
at a lower cost and in a more resource-efficient way.
Since they can be made flexible, integrating them into
buildings is possible [2].
5 TURNING WASTE HEAT INTO
VALUABLE ELECTRICITY
Thermoelectric materials convert heat directly into
electricity (and vice versa) and can thus recycle some of
the energy contained in, for instance, hot exhaust
streams. While low efficiency has traditionally limited
the use of thermoelectric to niche markets, recently
developed nanostructured thermoelectric, with much
better performance than bulk thermo electric[2], mark the
beginning of a new era. Progress has also been made
towards inexpensive, large-scale production methods.
Beyond transport and industrial production, interesting
application areas include the transformation of low-grade
solar thermal or geothermal energy, or the use of human
body heat to power portable electronics. Actually only
about 5 or 10 percent of the power from an electric
current running through an incandescent light bulb
generates light; about 90 percent I is spent generating
heat. Researchers are projecting that light bulbs made
with quantum dots (nanocrystals that emit visible light
when exposed to ultraviolet light, will turn almost 100
percent of the power from electricity into light. With
quantum dot bulbs [3], very little energy will bewasted as
unneeded heat. Given that about 20 percent of the
electric power consumed in the world issued to generate
light, adopting light bulbs based on quantum dots[4]
could cause significant reduction in overall energy
consumption worldwide.
768
ISBN: 978-81-924893-0-8
6 USING NANOTECHNOLOGY TO
ENERGIZE BATTERIES
Of all batteries currently in use, the lithium-ion type
stores the most electrical power for its weight. The bad
news is that (for now, at least) you can only use this type
of battery in things like watches and laptop computers.
These are devices that do not have sudden demands for a
lot of power, as do power tools. No surprise that
researchers are using nanotechnology to improve
lithium-ion batteries so they can be used in more devices.
When a battery runs your radio or other gadget, the
reaction of chemicals in the battery transfers electrons to
the anode — a piece of metal that makes up the negative
terminal of the battery. Those electrons become the
electric current that powers your gadget. One way to
improve batteries is to make the anode out of material
that lets you maximize its surface area. In a lithium-ion
battery[1], the anode is currently made of carbon. Altair
Nanotechnologies, Inc., is developing an improved
lithium-ion battery that replaces the carbon anode with
one made up of lithium titanate nanocrystals. An anode
made up of these nanocrystals provides about 30 times
greater surface area than one made up of carbon. If the
anode has greater surface area, electrons come out of the
battery faster; this means that a higher electric current —
therefore more power — is available to run your gadget.
If electrons can leave a battery faster, they can also go
back in faster, trimming the time it takes to recharge the
battery. Assume it takes an hour to recharge your battery-
powered drill, and that you have to get a new battery
after only 500 charges. Altair Nanotechnologies projects
that you can recharge their nano-batteries in a few
minutes, and the batteries will last for several thousand
recharges.
7 PRODUCING HYDROGEN WITH
DESIGNER MOLECULES
Researchers are attempting to design molecules that
absorb sunlight and produce hydrogen from water, just as
chlorophyll produces oxygen from water. At Virginia
Tech, some folks have noted that molecules containing
atoms of ruthenium can absorb light and produce
electrons, so they put an atom of ruthenium at each end
of a designer molecule. They also put an atom of
rhodium in the centre of the molecule to transfer
electrons to water. They filled out the structure of their
designer molecule with atoms of carbon, hydrogen,
chlorine, and nitrogen — and came up with a molecule
that produces hydrogen from sunlight and water, just as
chlorophyll produces oxygen[1]. Although still in the
laboratory stages, this research holds out the promise of
using a clean process — similar to one in nature — to
produce hydrogen for generating energy.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
8 ENERGY STORAGE AND
CONVERSION
Many sustainable energy sources like wind and solar
power deliver significant power only part of the time.
Strategies to store energy are therefore needed. While the
particularly stringent requirements posed by the transport
sector are currently only met by fossil fuels,
nanotechnology will make novel types of energy stores,
including electrical stores such as batteries and chemical
stores such as hydrogen, more competitive.
9 PUTTING PRESSURE ON
HYDROGEN STORAGE
Figure 1: Formation of MgH2
Scientists at the Lawrence Berkeley National Laboratory
have recently developed a new, air-stable nanocomposite
material for hydrogen storage, where magnesium
nanoparticles are embedded in a plastic matrix that
protects the magnesium from oxidation. The
nanocomposite rapidly absorbs and releases hydrogen at
modest temperatures.
769
ISBN: 978-81-924893-0-8
Hydrogen has a very high energy density by weight, but
its low energy density by volume turns its storage into a
major challenge. Nano composite materials with
exceptional strength-to-weight ratio can be used to
construct lightweight storage tanks with pressure ratings
that exceed the performance of traditional materials.
High surface area materials such as carbon aerogels,
carbon nanofibres or graphene constitute another
nanotechnology-based storage option. Current research
focuses largely on chemical methods, where hydrogen
reversibly reacts with a solid-state material such as
magnesium. Reducing the dimensions of the storage
medium to nanoscale dimensions can alleviate traditional
performance barriers of chemical stores, such as high
release temperatures and slow charge/discharge rates[3].
10 NANO-MATERIALS AND THEIR
APPLICATIONS IN CLEANSING
ENVIRONMENT
Titanium dioxide (TiO2) is one of the popular materials
used in various applications because of its
semiconducting, photo catalytic, energy converting,
electronic and gas sensing properties. Titanium dioxide
crystals are present in three different polymorphs in
nature.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Figure 1. The crystal structures of A) rutile, B) anatase, C) brookite
Many researchers are focused on TiO2 nanoparticle and
its application as a photo catalyst in water treatment.
Nanoparticles that are activated by light, such as the
large band-gap semiconductors titanium dioxide (TiO2)
and zinc oxide (ZnO), are frequently studied for their
ability to remove organic contaminants from various
media. These nanoparticles have the advantages of
readily available, inexpensive, and low toxicity. The
semiconducting property of TiO2 is necessary for the
removal of different organic pollutants through excitation
of TiO2 semiconductor with a light energy greater than
its band gap, which could generate electron hole pairs.
These may be exploited in different reduction processes
at the semiconductor/solution interface [6].
11 CONTROLLING AIR
POLLUTION
Air pollution can be remediated using nanotechnology in
several ways. One is through the use of Nano-catalysts
with increased surface area for gaseous reactions.
Catalysts work by speeding up chemical reactions that
transform harmful vapours from cars and industrial
plants into harmless gases. Catalysts currently in use
include a nanofiber catalyst made of manganese oxide
that removes volatile organic compounds from industrial
smokestacks [6]. Other methods are still in development.
Another approach uses nanostructured membranes that
have pores small enough to separate methane or carbon
dioxide from exhaust (Jhu etal 2008). John Zhu of the
University of Queensland is researching carbon
nanotubes (CNT) for trapping greenhouse gas emissions
caused by coal mining and power generation. CNT can
trap gases up to a hundred times faster than other
methods, allowing integration into large-scale industrial
plants and power stations. This new technology both
processes and separates large volumes of gas effectively,
unlike conventional membranes that can only do one or
the other effectively [5],[7].
12 KEEPING WATER CRYSTALS
CLEAR WITH
NANOTECHNOLOGY
Life needs water, but many of our lakes and streams
have been contaminated by wastes from industrial plants
— add to that the pesticides used in our gardens or by
770
ISBN: 978-81-924893-0-8
farms and you’ve got a serious problem. While current
laws have reduced the amount of contamination going
into our waters, there are still lakes and streams that are
significantly contaminated. Researchers are looking at
ways that nanomaterial can help to clean up our water
act[1].
13 GETTING RID OF TCE
One example is a joint venture: Rice University and
Georgia Institute of Technology are developing a better
way to remove TCE (trichloroethylene) from water. TCE
has been found at a majority of sites on the EPA’s
Superfund list, and it’s pretty horrible stuff that can cause
heart problems, nausea, vomiting, and eye irritation. TCE
is primarily used to degrease components during
manufacturing operations but it is also used in products
such as spot removers for clothing (cleanliness comes at
a price). Palladium acts as a catalyst to convert TCE to
ethane, which is not horrible. But there’s a problem:
Palladium is a rare metal, more expensive than gold.
Scientists are in search of the most efficient way to use
palladium to neutralize TCE. Given the large number of
sites that must be decontaminated, it’s important to find a
way to use as little of this expensive metal as possible.
Both nanoparticles made of palladium and nanoparticles
made of gold coated with a layer of palladium atoms are
possible options. Coating gold nanoparticles with
palladium atoms makes all the palladium atoms available
to catalyzethe TCE molecules, and seems to be the most
cost-effective use of palladium. One way to get
nanoparticles into the contaminated groundwater to do
their work is to place a filter containing the nanoparticles
in a pump that is used to circulate contaminated water.
As the water passes through the pump, the TCE is broken
down.
14 NANOTECHNOLOGY FOR
HAZARDOUS WASTE CLEAN-UP
Nano scale materials can make a huge difference in the
clean-up of hazardous waste. There are two reasons for
the optimism: firstly, the size of nano materials lets them
penetrate otherwise impossible- to-reach ground water or
soil and secondly, their engineered coatings allow them
to stay suspended in groundwater, a major asset in clean-
ups. If practically feasible, nanomaterial could slash
clean-up prices by avoiding the extraordinary costs and
risks of hauling waste away for burning or burial. Most
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

nanoremediation research projects undertaken by the

department of defence are focused on cleaning up ground REFERENCES
water contaminated by chlorinated solvents like
trichloroethylene. Research shows that results have been
[1]. Booker R., Boysen E., Nanotechnology (2008)
promising in most demonstrations with most of the
contaminant being destroyed – a finding that has been
replicated by researchers [8]. [2]. Pandey Bhawana and Fulekar M.H., Research
Journal of Chemical Sciences Vol. 2(2), 90-96, Feb.
(2012)
15 CONCLUSION
[3]. Ramachandra M. S., Singh S., Nanoscience and
Nanotechnology
In view of a globally increasing energy demand,
threatening climate changes due to continuously
increasing carbon dioxide emission as well as [4]. Ramsdon J., Essentials of Nano technology
foreseeable scarcity of fossil fuels the development and
provision of sustainable methods for power generation [5]. Rheil A., Schmid J., Aktionslinie Hessen-Nanotech
seems to be the most urgent challenges of mankind. series (volume 9)
Massive efforts at political and economic level are
required to basically modernise the existing energy [6]. www.nano-connect.org
system. To enable the immediate practical
implementation of nano technological innovations in a [7]. Pidgeon N., Nature Nanotechnology 4, 95 - 98
broad field like the energy sector and interbranch and (2009)
inter-disciplinary dialogue with all players involved will
be required. [8]. J Schummer - Scientometrics, 2004

771
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Optimal Real-time Dispatch for Integrated Energy Systems
Sirdeep Singh
Department of Applied Science, Bhai Gurdas Institute of Engineering and Technology, Sangrur
preetisethi.84@gmail.com
ABSTRACT
On-site cogeneration of heat and electricity, thermal and electrical
storage, and curtailing/rescheduling demand options are often cost-
effective to commercial and industrial sites. This collection of
equipment and responsive consumption can be viewed as an
integrated energy system (IES). The IES can best meet the site’s
cost or environmental objectives when controlled in a coordinated
manner. However, continuously determining this optimal IES
dispatch is beyond the expectations for operators of smaller
systems. A new algorithm is proposed in this paper to
approximately solve the real-time dispatch optimization problem
for a generic IES containing an on-site cogeneration system subject
to random outages, limited curtailment opportunities, an
intermittent renewable electricity source, and thermal storage. An
example demonstrates how this algorithm can be used in simulation
to estimate the value of IES components.
I. INTRODUCTION
Integrated Energy Systems (IES) combine on-site power or
distributed generation technologies with thermally activated
technologies to provide cooling, heating, humidity control,
energy storage and/or other process functions using thermal
energy normally wasted in the production of
electricity/power. IES produce electricity and byproduct
thermal energy onsite, with the potential of converting 80
percent or more of the fuel into useable energy. Integrated
Energy Systems have the potential to offer the nation the
benefits of unprecedented energy efficiency gains, consumer
choice and energy security. This study supports and guides
IES projects by assessing technologies and markets where
IES is positioned for growth. Furthermore, this effort will
identify areas where technology needs improvement and
where substantial barriers exist, and the potential market
effects of overcoming these obstacles. As a result, this study
sought to quantify the buildings market for IES, identify key
market drivers and barriers, and explore potential areas for
technology research and development that could improve the
prospects for IES.
II. BASIC ADVANTAGES OF IES
1. Dramatically reduce fossil fuel use and air pollutant
emissions
2. Improve the electric grid’s power quality, efficiency,
reliability and return on investment
3. Enhance energy security
IES Components IES for a site may consist of a large range
of energy conversion and storage devices, as well as demand
response options, giving the site control of both its supply of
772
ISBN: 978-81-924893-0-8
Prabhpreet Kaur
and demand for electrical and thermal energy. The
economically optimal dispatch of any IES must be in
response to current and forecasted energy prices, energy
demand, and DER equipment availability. Dispatch must be
within mechanical and regulatory constraints on the IES.
Typical electricity generation equipment found on-site
includes natural gas-, propane or biogas-fueled gas turbines,
reciprocating engines, micro turbines, and fuel cells. Heat
recovery from these devices can be used for site steam or
heating needs or for thermally-activated cooling. Often this
use for the waste-heat from electricity generation is what tips
the scales in favor of on-site generation. Renewable
electricity sources (photovoltaic’s and small-scale wind
turbines) and thermal sources (solar thermal collectors and
ground-source heat pumps) are also present. Thermally-
activated cooling is achieved through absorption or
adsorption chillers, which utilize a modified compression-
chiller cycle to replace much of the electric energy input
requirement with a thermal energy
requirement. Desiccant dehumidifiers use heat to remove
moisture from air before cooling it, which reduces the
energy required to cool the air.
Electrical and thermal storage technologies can add value to
an energy source by shifting its utilization from times of low
value to times of high value. For example, the waste-heat
from a continuously running generator can be stored
throughout the day and used during times of high thermal
load. Similarly, low-priced electricity such as off-peak
power or excess wind-power can be stored for use during
high priced on-peak hours using a battery or other electrical
storage device.
III. DEMAND RESPONSE
The high price of peak electricity has encouraged price
responsiveness among some customers. Some customers
may respond to price or control signals from their utility to
reduce or reschedule electric loads, a practice known as
demand response. Demand response opportunities can be
characterized as 1) curtail able, such as non-essential
lighting (e.g. hallways, parking garages), 2) re-schedulable,
such as energy-intensive industrial processes, or 3) part-
curtail able/part re-schedulable, such as cooling loads. In
pilot programs where the hourly and daily volatility of prices
is passed directly to consumers, rather than monthly
averaging, demand response behavior increases. This holds
promise for bringing demand elasticity to the electricity
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
market, a valuable step towards reducing peak capacity costs
and mitigating the threat of market power abuse.
Figure 1 Load-Duration Curve and System Dispatch in Long-range Energy
Alternatives Planning System (LEAP)
Electricity Utilities incur both variable and fixed expenses;
tariffs are typically designed to cover three kinds of costs:
• Fixed charges are invariant, Rs/month. These are
infrastructure costs of supply and delivery required by the
customer regardless of their energy consumption for that
month.
• Volumetric charges are proportional to the amount of
energy consumed. They are expressed in Rs/kWh and may
vary by time of day within a month. Volumetric rates are
intended to cover the variable costs of producing electricity,
such as fuel and some maintenance, in addition to the fixed
costs that generators recover in their volumetric sales of
electricity
Demand charges are expressed in Rs/kW and levied on the
maximum power consumption during a specified time range
(such as the on-peak hours of the month), regardless of the
duration or frequency of that level of power consumption.
Demand charges are intended to collect the fixed costs of
infrastructure shared with other customers by raising
revenue in proportion to the amount of power required by
the individual.
IV. THE OPTIMIZATION PROBLEM
FOR INTEGRATED ENERGY
SYSTEMS
Dispatch to a site’s DER options must be made continuously
and includes the set points of generators, the charging or
discharging of storage, and DSM commands. Typical
constraints on the system include
• Engineering constraints on equipment such as ramping
rates and maximum and minimum operating levels
• Regulatory constraints on noise, operation hours, or overall
DG system efficiency (i.e. utilization of waste heat)
• Magnitude, duration, and frequency constraints on DSM.
As with any set of decisions that affect a common objective,
the dispatch decisions to all DER options can best meet site
energy objectives if the decisions are coordinated. This
773
ISBN: 978-81-924893-0-8
introduces the concept of the integrated energy system (IES),
a holistic view of all site energy options. Another common
problem for a wider range of IES systems is making the best
use of limited opportunities.
Examples of limited opportunities include
• Profitable DG systems that are operationally constrained
by regulatory efficiency constraints (where there is only
limited use for waste heat), maximum run-time regulations,
or limited fuel supply, and
• DSM measures that a site’s occupants will only
accommodate a limited number of times. Optimally
exploiting limited opportunities is challenging because it is
dependent on uncertain future conditions, such as DG
intermittency (generator outages or variation in renewable
output), end-use demand, and energy pricing. The IES
dispatch problem is to minimize, at each time step, the
expected cost (or other site energy objective) of all energy
consumption, given past system operation, present
conditions, and forecasts of future conditions. This is done
by simultaneously solving the unit commitment and set point
level problems for the current time step and all future time
steps, conditional on future conditions.
V. AN ALGORITHM FOR
OPTIMIZATION OF REAL-TIME IES
DISPATCH
Because of the complexity of the IES dispatch optimization
problem and large number of time steps to be solved over
(ideally time steps of several minutes over the course of a
month or more), an exact solution to the problem,
conditional on the statistical description of stochastic
parameters, is infeasible. A feasible approach is to optimize
the current dispatch and future dispatch strategy relative to a
finite number of future scenarios. This section describes a
simple IES dispatch optimization algorithm from which
more complicated; practical algorithms could be built upon.
The algorithm considers a finite number of possible future
scenarios as an approximation of the future. Scenarios are
generated randomly; each scenario contains values for each
stochastic parameter at each time step. Because of the
similarity of days in a month, a relatively small number of
scenarios can be used to represent the most probable future
conditions. The dispatch problem, then, is to select a
dispatch decision for the current time-step and a dispatch
strategy for all future time steps, given historic load and
dispatch information. This algorithm considers optimization
over the course of a month for a site with a DG system
comprised of one generator with heat recovery for heating
and absorption cooling, a photovoltaic (PV) system, and
limited curtailment options. A limited amount of thermal
storage is considered by relaxing the synchronous constraint
on thermal demand. Two dispatch decisions are considered:
the set point of the generator in the CHP system and a
curtailment command.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
V.I the modular integrated energy system
Figure 2 shows the concept of a modular system in which all
components would be skid mounted to facilitate transporting
them to the installation sites and to simplify connection to
the site’s utilities. The initial concept was to have the entire
IES mounted on one skid, however, a single skid design is
too large to ship and maneuver. Therefore, the following
two-skid design was developed:
Figure 2 Integrated Energy Systems
On-site generation is only allowed when the DG system is
available, and must be less than or equal to the capacity of
the system. Availability at each time step and for each
scenario is a binary variable equal to zero if the generator is
unavailable and one if it is. Electricity loads must be met
instantaneously by the sum of electricity purchase, on site
generation (including PV generation)
Stochastic Parameters, SP (Electric load at time t) =
Electricity Purchased (at time t) + Dispatch (Generation at t)
+ PV capacity × SP (Solar insolation) + electric load (kWh)
offset by absorption chiller + magnitude (kW) of curtailed
load.
V.II Example: DSM Value When Coordinated With
Intermittent DG
Considering a load of 1 MW in the locality of large hotel,
nursing home, large office and for large school, for each
case and scenario, a building energy simulation for each
month of the study year was performed using hour long time
steps. Simulation entails
1) Considering forecasts of each parameter value at each
time step for each of the S stochastic scenarios
2) Determining the optimal dispatch for the current time step
3) Executing the dispatch and recording the resulting system
performance data
Other IES components considered were
774
ISBN: 978-81-924893-0-8
1) A DG system: 500 kW reciprocating engine with heat
recovery and a 500 kW (capacity for heat removal)
absorption chiller, 2) a 200 kW photovoltaic system.
Incentives, the DG system were constrained to utilize 60%
of input fuel energy in the form of electricity or useful
thermal energy. The following cases were considered
1) Curtailment only
2) DG and curtailment
3) PV and curtailment
4) DG, PV, and curtailment
Table 1: Financial Value of Heat Recovery to DG
Systems in various Load areas
VI. CONCLUSION
The IES dispatch optimization problem is a multi-stage
problem (hundreds of stages) with several stochastic
parameters. Vertically-integrated utilities have tackled
similar (and much more complicated) problems by
developing heuristic approaches (often tailored to specific
systems), thus making a tractable problem. This research
takes a different approach, developing a general method for
solving the multi-stage problems with multiple stochastic
parameters.
The system met the stated goal of achieving 70% thermal
overall HHV efficiency. The overall efficiency of actual
installations will depend on the individual customer’s
thermal energy needs and the temporal patterns of those
needs. Although this example should not be considered
exemplary of the buildings, it does illustrate how valuable
IES components and systems can be in a location with
significant demand charges. This example suggests the
proposed algorithm’s usefulness as a screening and design
tool for a wide variety of sites considering IES projects. For
sites where this integrated approach suggests significant
costs savings over current control strategies, this algorithm
would be useful in the actual real-time dispatch of IES
systems.
REFERENCES
[1] Ryan Firestone, Michael Stadler, and Chris Marnay
“Integrated Energy System Dispatch Optimization” IEEE
International Conference, 2006; P 357 - 362
[2] Quelhas, A.; Gil, E.; McCalley, J.D.; Ryan, S.M.; “A
Multiperiod Generalized Network Flow Model of the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
U.S. Integrated Energy System”, IEEE Transactions on
power system 2007, Page(s): 829 – 836
[3] Stanislav, P.; Bryan, K.; Tihomir, M.; “Smart Grids
better with integrated energy system” Electrical Power &
Energy Conference (EPEC), 2009 IEEE, Page(s): 1 – 8
[4] Zhengping Xi; Parkhideh, B.; Bhattacharya, S.;
“Improving distribution system performance with
integrated STATCOM and super capacitor energy storage
system” Power Electronics Specialists Conference, 2008.
PESC 2008. IEEE pp 1390 – 1395
[5] Perry Tsao; Senesky, M.; Sanders, S.R.; “An integrated
flywheel energy storage system with homo-polar inductor
motor/generator and high-frequency drive” Industry
Applications, IEEE Transactions on 2003, pp 1710 –
1725
775
ISBN: 978-81-924893-0-8
[6] Martyak, M.S.; Devgan, S.S.; “An optimization model
for the application of an integrated cogeneration-thermal
energy storage system”, IEEE Proceedings of
Southeastcon '91, vol.1 pp 558 - 562
[7] Valsalam, S.R.; Muralidharan, V.; Krishnan, N.; Sarkar,
T.K.; Khincha, H.P.; “Implementation of energy
management system for an integrated steel plant” Energy
Management and Power Delivery, 1998. Proceedings of
EMPD'98. 1998 International IEEE Conference on 1998,
pp 661 – 666; vol.2
[8] Mandi, R.P.; Yaragatti, U.R.; “Solar PV-diesel hybrid
energy system for rural applications” IEEE Conferences
Industrial and Information Systems (ICIIS), 2010,
Page(s): 602 – 607
[9] K. Qiu and A.C.S. Hayden “A Natural-Gas-Fired
Thermoelectric Power Generation System” Journal of
Electronic Materials, 2009, Volume 38, Number 7, Pages
1315-1319
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Engineering Fluorescence Lifetimes of II-VI

Semiconductor Core/Shell Quantum Dots
Gurvir Kaur S.K. Tripathi
Department of Physics Sant Longowal Institute of Engineering &
Centre of Advanced Study in Physics Technology, Longowal, Sangrur
Panjab University, Chandigarh. mailtogurvir@yahoo.com

ABSTRACT
Quantum dots (QDs) are nanocrystals of semiconductors materials. As each material has different bandgap, the composition
acts as an additional degree of freedom by which the properties of the QDs can be tuned. The work is concerned with the
tuning of fluorescence emission as well as their relaxation lifetimes with growth of a different shell over the core nanocrystal
of II-VI group. In relevance to bulk band alignment the systems with CdSe core and CdS, ZnSe or ZnS shell ensure a Type-I
heterostructure. However, some semiconductor material combinations (e.g., ZnSe/CdS, ZnTe/CdSe, CdTe/CdSe) allow the
charge carrier localization regime in core/shell HNCs to be gradually tailored from type-I to type-II by varying the shell
thickness and core diameter. Study involves the variation in the shell thickness on the CdSe core and systematically
investigated the steady and transient optical properties of the materials. The results presents the suppression of the deep trap
emission by passivation of most of the vacancies and trap sites on the crystallite surface, and enhances the number of
initially populated excitonic states resulting in emission which is dominated by band-edge excitonic recombinations

Keywords: Quantum dots, Core/shell structures, Time resolved fluorescence.

REFERENCES
[1] Javier A, Magana D, Jennings T, Strouse GF, Appl. Phys. Lett. 83 (2003) 1423.
[2] Donega CD, Hickey SG, Wuister SF, Vanmaekelbergh D, Meijerink A, J. Phys. Chem. B 107 (2003) 489.
[3] Wuister SF, Donegá CM, Meijerink A, J. Phys. Chem. B 108 (2004) 17393.

776
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Human Values and Ethics in the Modern Technology
Driven Global Society
Dr. Sunita Rani Vandana Sharma
Asstt. Professor in English Asstt. Professor in English
Punjabi University College of Engg. & Bhai Gurdas Inst. of Engg. & Tech.,
Management, Rampura Phul, Bathinda. Sangrur
sunita.23cs@gmail.com vandana.bgiet@gmail.com
ABSTRACT
Human values are a set of consistent behaviors and measures
that guide human beings in doing what is right and acceptable
by the society. Values and ethics may be treated as keys to
solve many world problems. They operate at the level of
individuals, of institutions, and of entire societies. Scientific
and technological advancement has revolutionized every
aspect of human life. New and expanding technological
capabilities confront people with ethical dilemmas. It has been
felt that for the welfare of society, technocrats and engineers
must be morally committed and conscious about human
values and ethics to grapple with ethical dilemmas they
confront. The present paper endeavours to explore the
significance of human, values and ethics in the modern
technology driven global society.
Keywords
Human values, Ethics, Morals, Technology, Engineering,
Ethical Conduct.
1. INTRODUCTION
The present paper is an attempt to explore the importance of
human values in the modern technology driven global society.
There is no denying the fact that the present global society is
facing a lot of crises. Human society may not significantly
sustain without human values and ethical conduct. Now a
days there is a lot of concern about techno-genic maladies
such as energy and natural resource depletion, environmental
pollution, global warming etc all of which are manmade and
are threatening the very existence and survival of man on
earth. On the other hand there is rapidly growing danger
because of nuclear proliferation, terrorism, large scale
corruption, scams, breakdown of relationships, depression etc.
Root cause of all the above mentioned maladies and threats to
human happiness and peace is the lack of understanding of
human values and ethical conduct. Hence, it is necessary to
talk on the subject and bring about awareness of human values
and ethics into the modern society. Our actions must
increasingly be based on an acknowledgment of global and
universally accepted values. Because, it is the human values
which are to be treated as the keys to solving the global
problems.
2. VALUES, MORALS AND ETHICS
2.1. Human values
Human values can be defined as- the eternal qualities that an
individual must possess for quality life and which does not
change with the change in the society or situation. Human
values embrace the entire range of values pertinent to the
777
ISBN: 978-81-924893-0-8
Neetika
Asstt. Professor in Computer Science
Punjabi University College of Engg. &
Management, Rampura Phul, Bathinda
human condition, interest, behavior, and aspiration. Values
can be defined as desirable, trans-situational goals, varying in
importance that serves as guiding principles in people‘s lives.
As stated by Rokeach, ―The value concept… [is] able to unify
the apparently diverse interests of all the sciences concerned
with human behavior.‖1 Human values are a set of consistent
behaviors and measures that guide human beings in doing
what is right and acceptable by the society. They attract
dignity, respect and appropriateness among people. Values are
the essence of our personality, and influence us in making
decisions, trust people, and arrange our time and energy in our
social life. Values may be treated as keys to solving many
world problems. They operate at the level of individuals, of
institutions, and of entire societies. Values are a motivational
construct. They refer to the desirable goals people strive to
attain. They transcend specific actions and situations. They
are abstract goals. The abstract nature of values distinguishes
them from concepts like norms and attitudes, which usually
refer to specific actions, objects, or situations. Values guide
the selection or evaluation of actions, policies, people, and
events and serve as standards or criteria. They are ordered by
importance relative to one another. People‘s values form an
ordered system of value priorities that characterize them as
individuals. This hierarchical feature of values also
distinguishes them from norms and attitudes.
According to Schwartz values are "responses to three
universal requirements with which all individuals and
societies must cope: needs of individual biological organisms,
requisites of coordinated social interaction and requirements
for smooth functioning and survival of groups‖2. Ten
motivationally distinct, broad and basic values are derived
from these three universal requirements of the human
condition. Schwartz details the derivations of these ten basic
values.3 Each of the ten basic values can be characterized by
describing its central motivational goal:
 Self-Direction: Independent thought and action;
choosing, creating, exploring.
 Stimulation: Excitement, novelty, and challenge in
life.
 Hedonism: Pleasure and sensuous gratification for
oneself.
 Achievement: Personal success through
demonstrating competence according to social
standards.
 Power: Social status and prestige, control or
dominance over people and resources.
 Security: Safety, harmony, and stability of society,
of relationships, and of self.
 Conformity: Restraint of actions, inclinations, and
impulses likely to upset or harm others and violate
social expectations or norms.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 Tradition: Respect, commitment, and acceptance
of the customs and ideas that traditional culture or
religion provide the self.
 Benevolence: Preserving and enhancing the welfare
of those with whom one is in frequent personal
contact (the ‗in-group‘)
 Universalism: Understanding, appreciation,
tolerance, and protection for the welfare of all
people and for nature.
Figure 1. Theoretical model of relations among ten
motivational types of values
In addition to identifying ten motivationally distinct basic
values, Schwartz‘s Values Theory explicates a structural
aspect of values, namely, the dynamic relations among them.
Actions in pursuit of any value have psychological, practical,
and social consequences that may conflict or may be
congruent with the pursuit of other values. The circular
structure in Figure 1 portrays the total pattern of relations of
conflict and congruity among values postulated by the theory.
The circular arrangement of the values represents a
motivational continuum. The closer any two values in either
direction around the circle, the more similar their underlying
motivations. The more distant any two values, the more
antagonistic their underlying motivations.
The human values evolve because of the following factors:
 The impact of norms of the society on the fulfillment of
the individual‘s needs or desires.
 Developed or modified by one‘s own awareness, choice,
and judgment in fulfilling the needs.
 By the teachings and practice of Preceptors (Gurus) or
Saviors or religious leaders.
 Fostered or modified by social leaders, rulers of
kingdom, and by law (government).
2.2. “Ethics” or “Morals‖
We regularly use these two terms interchangeably—means
those habits or customs that are standards of good conduct or
character. Ethics refers to a body of moral principles. To be
ethical is to do the right thing; to consider the well-being of
others as equal to your own; and to act in ways that aim to
maximize the good. To be ethical is to be righteous, in the
sense that our conduct and character are grounded on
principle and a commitment to doing our duty regardless of
narrow self-interest. To be moral is to be fair and considerate
of others, particularly to show them the respect we ourselves
demand that acknowledges rights to life, liberty and property,
Morals and ethics are self imposed or regulated and voluntary
778
ISBN: 978-81-924893-0-8
when broadly interpreted. Engineering educator P. Aarne
Vesilind defines ethics as ―the study of systematic
methodologies which, when guided by individual moral
values, can be useful in making value-laden decisions‖4 Work
ethic is a set of values based on hard work and diligence. It is
also a belief in the moral benefit of work and its ability to
enhance character. A code of ethics prescribes how
professionals are to pursue their common ideal so that each
may do the best at a minimal cost to oneself and those they
care about. An individual in his professional capacity has
responsibility for the regular tasks he is assigned, for the
outcomes of the actions and decisions. A professional has
obligations to the employer, to customers, to other
professionals- colleagues with specific expectations of
reciprocity. He is answerable and liable for the actions. He
should have the capacity and moral strength to defend his
actions and decisions.
2.3. The Ethics of Technology:
It is a sub-field of Ethics and generally sub-divided into two
areas:
 The ethics involved in the development of new
technology – whether it is always, never, or
contextually right or wrong, to invent and implement a
technological innovation.
 The ethical questions that are exacerbated by the ways
in which technology extends or curtails the power of
individuals – how standard ethical questions are
changed by the new powers.
2.4. Engineering Ethics:
It is defined as ―(1) the study of the moral issues and decisions
confronting individuals and organizations involved in
engineering; and (2) the study of related questions about
moral conduct, character, policies, and relationships of people
and corporations involved in technological activity‖5
Engineering ethics is a form of professional ethics, however,
which requires reflection on the specific social role of
engineers. ―Engineering ethics is a type of professional ethics
and as such must be distinguished from personal ethics and
from the ethical obligations one may have as an occupant of
other social roles. Engineering ethics is concerned with the
question of what the standards in engineering ethics should be
and how to apply these standards to particular situations.‖6 An
ethical individual is inspired by a vision of excellence, and
being ethical and adopting the moral points of view define the
essence of a good and happy life. The scope of professional
ethics envelopes diverse activities like
 Engineering as a social experimentation
 Responsibility of technocrats and engineers for
safety
 Role of engineers, managers, consultants etc.
 Rights of professionals and engineers
 Moral reasoning and ethical theories
 Responsibility to employers
 Global issues and concerns
3. NEED OF VALUES AND ETHICS
FOR ENGINEERS:
Natural sciences and engineering are important forces
shaping the future of humanity. Technology has a pervasive
and profound impact on contemporary world. Technocrats and
engineers have made possible the spectacular human triumph
once dreamed of only in the myth and science fiction. The
technological advances have significantly improved our
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
quality of life in ways so numerous that we cannot imagine
the modern world without them. However new challenges,
opportunities and threats continue to bother humanity with
advent of newer technologies. Very often technological
development is Janus faced and morally ambiguous as time is
not devoted to conduct research on social, economic and
medical impacts they may have on the lives of people. New
and expanding technological capabilities confront people with
ethical dilemmas. Technocrats and engineers are expected to
exhibit the highest standards of honesty and integrity. It has
been felt that for the welfare of society, technocrats and
engineers must be morally committed and conscious about
human values and ethics to grapple with ethical dilemmas
they confront. The services provided by them require honesty,
impartiality, fairness, and equity, and they must be dedicated
to the protection of the public health, safety, and welfare.
Engineers must perform under a standard of professional
behavior that requires adherence to the highest principles of
ethical conduct.
4. CAN VALUES AND ETHICS BE
TAUGHT?
Keeping in mind the enriched view of ethics, one may wonder
if the ethics can be taught. There can be no doubt but the
answer is certainly yes! Each generation recognizes the need
to prepare the next one for the responsibilities it must assume
in protecting critical human values, in maintaining order and
in reducing conflict. In the professions, especially in
engineering, preparing aspiring professionals to assume the
mantle of responsibility that is central to professional ethics is
crucial. While the education of engineers focuses almost
exclusively on developing the technical capacities of aspiring
engineers for solving a host of technical problems facing
society, it has not also sufficiently advanced the moral
character of those who call themselves ―Engineers‖. Teaching
values and engineering ethics in academic institutions is
undertaken largely through many case studies for creating
awareness interactively among engineering students of all
disciplines. By studying value education and engineering
ethics, the students develop awareness and assessment skill of
the likely impact of their future decisions on moral and ethical
grounds. Ethical standards in engineering are influenced by
many factors: 1.Engineering as an experimentation for the
good of mankind is a notable factor involving far reaching
consequence. 2. Ethical dilemmas make engineering decisions
relatively difficult to make. 3. Risk and safety of citizens as a
social responsibility is a prime concern of an engineer. 4.
Technological advancement can be very demanding on the
engineering skill in the global context. 5. Moral values and
responsible conduct will play a crucial role in decision
making.
The study of engineering ethics within an engineering
program helps students prepare for their professional lives. A
specific advantage for engineering students who learn about
ethics is that they develop clarity in their understanding and
thought about ethical issues and the practice in which they
arise. The study of ethics helps students to develop widely
applicable skills in communication, reasoning and reflection.
These skills enhance students' abilities and help them engage
with other aspects of the engineering program such as group
work and work placements. And while the education of
engineers focuses almost exclusively on developing the
technical capacities of aspiring engineers for solving a host of
technical problems facing society, it has not also sufficiently
779
ISBN: 978-81-924893-0-8
advanced the moral character of those who call themselves
―Engineers‖.
5. CONCLUSION
Human values and ethics possess a significant position in the
society. Values are a cognitive structure that describes the
ideals of life of individuals, their preferences, priorities,
principles and the behaviour of a cognitive. Human value is a
theory about ―what things in the world are good, desirable,
and important.‖7 Today‘s human society is deeply engrossed
in materialism and human values are now withering very fast.
Scientific and technological advancement has revolutionized
every aspect of human life and has contributed a lot making a
better and more efficient world. But the craze of materialism
has been quite detrimental to the traditional social and moral
system. Loss of moral integrity has always been responsible
for the destruction of civilization in the past. Consequently,
human values play a vital role both for the integrity and
longevity of any human society. Today efforts are required to
impart value education to make young technocrats aware of
their social responsibilities and to tell them that first a person
is a human being and then scientist, engineer, technocrat or
professional. It is evident that the human values and
engineering ethics are roadmap of behavior of technocrats and
engineers and points out the values and traditions of the
profession in leading humanity to make crucial choices and
confront the challenges necessary for a better and more
meaningful life. In the reports commissioned by the Club of
Rome there is a concern for developing a ―new world
consciousness..., a new ethic in the use of material resources,
a new attitude towards nature, based on harmony rather than
on conquest ... a sense of identification with future
generations‖8 to avoid global catastrophe caused by
unrestrained economic growth. The academic engineering
community has the difficult and responsible task and
challenge of ensuring that future practitioners of the
profession are educated and equipped with the skills of
confronting the ethical problems, examining the standards of
conduct with critical thinking and the competence and ability
that are illustrated and taught in engineering classes. It is
evident that at the end of the day, it is the human values and
ethics which will save the mankind.
REFERENCES
[1] Rokeach, M. 1973. The Nature of Human Values. New
York: Free Press. p.3.
[2] Schwartz, S. H. ―Are There Universal Aspects in the
Content and Structure of Values?‖ Journal of Social
Issues. April 2014. Volume 50. Issue 4. pp. 19-45.
[3] Schwartz, S. H. ―Basic Human Values: Their Content and
Structure Cross Countries.‖ French Journal of Sociology,
2006. Volume 47. Issue 4. pp. 21-55.
[4] Vesilind, P. Aarne. 1988. ―Rules, Ethics and Morals in
Engineering Education‖. Engineering Education,
February. p. 290.
[5] Martin, Mike W. and Roland Schinzinger. 1996. Ethics in
Engineering. New York: McGraw-Hill. p. 23.
[6] Harris, Charles E., Jr., Michael S. Pritchard, and Michael
Rabins. 1995. Engineering Ethics: Concepts and Cases.
Belmont. CA: Wadsworth. p.14
[7] Sinha, S.C. 1990. Anmols Dictionary of Philosophy. New
Delhi: Anmol Publications. p. 196.
[8] Mesaroric, M.D. and Pestel, E. (1974). Mankind at the
Turning Point. New York: E.P. Dutton, quoted from
Fromm. 1988. p. 148.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

RFID: A Boom for Libraries

Arvind Mittal Amit Mittal Uma Sharma
Senior Librarian Assistant Librarian Assistant Librarian
Bhai Gurdas Group of Main Library Bhai Gurdas Institute of
Institutions, Sangrur Punjabi University, Patiala Engg. & Tech. Sangrur
arvindmittal14@gmail.co amitmittal96@gmail.com umasharma762@gmail.com
m

ABSTRACT reader that converts the radio waves returned from the
As we know libraries are always ready to face new challenges RFID tag into a usable form of data. RFID system
for providing best services to their patrons. As the technology consists of the following components that jointly for to
is developing, libraries are also accepting new technologies make this system effective.
and converting into modern libraries. Among the new
technologies Radio Frequency identification (RFID) is the
most used technology by the libraries. The present paper
3.1. RFID Tags
This is a silicon chip encapsulated in glass of plastic and it is
provides the brief introduction of RFID and its application in
flexible, paper thin smart label, approximately 2x2 inches in
libraries. RFID based Library Management Systems provides
size that is applied directly on the books. Each tag contains
the timely and easy services to the library users. RFID system
microchip and an antenna. This assembly is generally covered
enhances the efficiency of circulation counter with self check
with a protective overlay. It can be applied on any product,
out/in system, fast acquisition and inventory control system
animal, or person for the purpose of identification using radio
and easy stock verification of the library material. This system
waves. Some tags have more power that it can read from
also provides proper security against theft.
many meters away.

Keywords
RFID, Library Security, Library services

1. INTRODUCTION
Now the technologies are changing with the speed of blink of
eyes. So our lifestyle had also changed, everyone want quick
and easy access of everything. So, in library science there is a
technology that had changed the pattern of libraries i.e. RFID
(Radio Frequency Identification). RFID had fasten the
working environment of the library like easy access of any
book on the stacks, multiple books issued at the same time,
easy and fast stock verification of the library material, we
apply routine figure arrest technology that relies on radio-
frequency electromagnetic fields. This technology is known as Figure1: RFID Tag
Radio-Frequency Identification or RFID. This tool is also
antitheft tool. 3.2. RFID Readers
Generally there are two types of RFID readers one is passive
and the other is active. Passive readers gives energy to the tag
2. History OF RFID that don’t has its own energy and the tags use the backscatter
This technology is not much older, first time it has been used technology for forwarding information to the reader. On the
in 1940 for classify airplanes during Second World War, after other hand active reader receives energy transmitted from an
that it has not been used and developed by any one. After active RFID tag that has its own in built power. We use
thirty years this technology had been again used for military different types of RFID readers in the libraries:
purpose. Now this technology is used at different places and
regularly updating. In 1990 Regularity for the interoperability
of RFID tool began and in 1999 MIT (Massachusetts Institute
of Technology) generates auto-id axis regular recognition. In
2004 MIT auto-id axis turn into worldwide EPC (Electronic
Product Code). From 2005 this technology is being used in
almost every field like offices, shopping malls, banks, office,
and extensively used at libraries.

3. RFID SYSTEM
RFID is a combination of two a microchip and other is
antenna. The microchip of RFID consists of EPC and
other related information, on the hand antenna assists in
transmitting the data on the chip. Both of these together
constitute an RFID tag. The antenna assists in
transmitting the information on the chip to a RFID

780
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Figure2: RFID Gate transponder uses an antenna equivalent to a resonance circuit

The RFID gate works for controlling the theft in the libraries.
At the exit gate sensor receives the information of the exit
item and send it to the server, then server checks it that is it
properly issued or not then send back this information to the
gate. If the item is issued then it allows to exit from the gate
on the other if item is not issued the it gives an alarm that
indicates that the particular item is not issued.
Figure 3: RFID Handheld Reader
RFID handheld scanner used to identify particular item on the
self or find proper placing of any item on the shelf. We can
also find out a particular item from the bulk of items even if it
is on the wrong place. We can also use it for annual stock
inventory purpose.
3.3. Server
The server is the main part of RFID system. It is the
communication gateway among the various components. It
receives the information from one or more of the reader and
exchanges information with the system database. Its software
includes the SIP/SIP2 (Session Initiation Protocol), APIS
(Application Programming Interface) and NCIP or SLNP
necessary to interface it with integrated library software.
consisting of coil and capacitor, circuit tuned to the frequency
of electromagnetic field issued by reader. Magnetic field lines
issued by reader antenna cross coil turns inducing an electric
signal rectified and internally stabilized on the chip and then
used for the entire transponder supply. When the transponder
is in the magnetic field created by the reader, the energy
absorption towards the resounded circuit at frequency takes
place. This absorption, rather small, is nevertheless perfectly
detectable, as a tension drop at the inductive coil terminals
(the reader’s antenna) or as an increase of the power through
it. What really happens is a drop of the charge resistance
equivalent at the amplifier’s terminals which supply the
reader’s antenna. In order to send data from transponder to
reader it suffices that the LC circuit be out of tune in accord
with the issued data. Thus, the signal at the entrance of the
reader’s antenna will suffer a mild modulation in amplitude.
Now days, this amplitude modulation (AM) signal can be
separated and demodulated to retrieve data. In conclusion,
RFID is a technology that enables wireless data capture and
transaction processing at a very attractive cost. There are two
main areas of application, defined broadly as proximity (short
range) and vicinity (long range). Long range or vicinity
applications can generally be described as track and trace
applications, but the technology provides additional
functionality and benefits for product authentication. Short
range or proximity applications are typically access control
applications.
4.1. Check in, check out and sorting
System
RFID system allows the self check in and checkout of reading
material in the library. In this system there is self issued
system of books where any user can himself/herself issued
their books by placing his/her id card and books. Even many
books can be issued at single time.

4. Implementation of RFID in Libraries

Radio Frequency Identification (RFID) systems are using
readers and cards or tags. Data is stored on an electronic data-
carrying device. The power supply given to the data-carrying
device and the data exchange between the data-carrying
device and the reader are achieved without the use of galvanic
contacts, using instead magnetic or electromagnetic fields.
The underlying technical procedure is drawn from the fields Figure4: Self Issue system
of radio and radar engineering. Communication between In the self returning system, there are drop boxes installed by
transponder and reader is realized through the same the library at different locations in the whole campus. Users
electromagnetic field used for supply. Thus, reader transmits can drop the issued books in any drop box any time. On the
interrogation signal and transponder answers communicating same time the book /books will be returned from the use’s
stocked data in its EEPROM memory. The communication account.
method used for most transponders. The LC circuit equivalent
to the transponders antenna resounds on the f0 frequency. The
generator, at the reader’s signal, injects power in its antenna.
The power, therefore the field created by the coil, is with a
frequency which RFID systems use passive and active
transponders. Active transponders are used for long-range
applications but because a battery is included, their cost is
much higher. Passive transponders do not contain a proper
source of supply, the necessary energy for functioning being
drawn out of the electromagnetic field of the antenna of a
reader to which it is connected, placed in close vicinity, but
with no electrical contact between transponder and reader. In
order to obtain this energy out of electromagnetic field, the Figure 5: Drop Box for Self Return

781
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Self sorting system allows for the implementation of self-
sorting machines that sort every book in according to there
subject and category.
Figure 6: Self Sorting System
5. Advantages of RFID in Libraries
Basically RFID is mainly useful for theft security, inventory
management, users autonomy, automated material handling,
charging /discharging transactions etc. The main advantages
of RFID system are explained as follow:
 RFID system speed up the circulation system of the
library by installing self check-in/check-out counters as well
as drop boxes at different location in the campus.
 Quickly Find out the wrong placed material on the
stacks in the library.
 Easy and fast stock inventory in the libraries.
 Save the time of users as well as library staff
through self check-in/ check-out counter and drop boxes.
 Replaces the old library technologies like Barcode
and EM security strips.
REFERENCES
1. Campbell, Brian. 2003. Background Information on RFID
and Automated Book Sorting,Vancouver, B.C.,
Vancouver Public Library. November 12, 2003.
2. Chavan, S.P. 2012. Use of RFID technology in libraries.
Online International Interdisciplinary Research Journal,
2(4), 235-341.
3. Coyle, K. 2005. Management of RFID in libraries. The
Journal of Academic Librarianship, 31(5), 486-489.
782
ISBN: 978-81-924893-0-8
4. Daniel, H., Puglia, A. and Puglia, M. 2007. RFID: a guide
to radio frequency identification, New York: John Wiley
& Sons, Inc.,1.
5. Dawes, T.A. 2004. Is RFID right for your library? Journal
of Access Services, 2(4), 7-13.
6. Givens, B. 2006. Activists: Communication with
consumers, speaking truth to policy makers. RFID
Applications, Security and Privacy, Addison Wesley, 432
7. Handa, T.S. 2010. Radio frequency identification (RFID)
application in libraries. In: Amudhaveli, A. and Singh, J.,
Ed. Challenges and changes in Librarianship: Papers in
honour of Prof. Sewa Singh, 2 Vols. 2010. B.R.
Publications: Delhi, 829-837.
8. Karen Coyle, Management of RFID in Libraries, Preprint
version of article published in the Journal of Academic
Librarianship, v. 31, n. 5, 486-489
9. Lahari, S. 2006. RFID Sourcebook, IBM Press. 9-10
10. Mamdapur, G.M.N. and Rajgoli, I.U. 2011. Implementing
radio frequency identification technology in libraries:
advantages and disadvantages. International Journal of
Library and Information Science, 3(3),46-57.
11. Molnar, D. and Wagner, D. 2004. Privacy and security in
library RFID - Issues, practices and architectures CCS’04
October 25-29 2004 Washington DC, USA
12. Nisha, F., Bakshi, S. and Ali, N. 2006. RFID system: a
boon for libraries. In 4th International Convention
caliber-2006, Ahmedabad: Inflibnet, 554-555.
13. "Radio Frequency Identification. Rachel Wadham.
Library Mosaics v14 no.5 (S/O 2003), 22.
14. RFID Poses No Problem for Patron Privacy. American
Libraries, v34 no11 (D 2003), 86.
15. Sarma, S. 2008. RFID technology and its applications. In
Miles, S.B.; Sarma, S.E.and Williams, J.R. Eds. RFID
Technology and Applications, Cambridge University
Press: Cambridge,16-32.
16. Shepard, S. 2005. Radio Frequency Identification Mc
Graw Hill, 42
17. Singh, G. and Midha, M. 2008. RFID: A new technology
in library management systems. Journal of Interlibrary
Loan, Document Delivery & Electronic Reserve, 18(04),
439-447.
18. Smart, Laura. Making Sense of RFID. Library Journal,
Net Connect Fall 2004. Vol 129. New York.
19. Sujatha, G. 2007. Radio frequency identification (RFID)
in library management. Pearl, 1(22-24) Online:
http://www.wikipedia.com
20. Ward, D. 2003. Radio frequency identification systems
for libraries and archives: an introduction. Library &
Archival Security, 18(2), 7-21.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Toolkit for Fast Neutron Removal Cross-Section
Kulwinder Singh Mann Manmohan Singh Heer
Department of Physics, D.A.V. Department of Physics, Kanya
College, Bathinda-151001, Punjab, Maha Vidyalaya, Jalandhar-
India 144001, India
manmohan.heer@yahoo.com
ksmann6268@gmail.com
ABSTRACT
For calculation of macroscopic effective mass removal cross-
section (ΣR/ρ, in cm2/g), macroscopic effective removal cross
section (ΣR, cm-1) parameters in mixtures and composite
materials, computer programs MERCSF-N and NXcom are
available. A toolkit named WinNC-toolkit, is designed by
reengineering of these programs with objective of providing
the missing values of the parameter for nine elements and
improving the user interface. The estimation of the parameters
was done by using bi-quadratic polynomial fitting
interpolation method. The program is designed in MS-Excel,
2007 and has some extended capabilities, over the previous
programs, such as to simplify the input procedure, provide
tabulated, graphical results and calculates the relaxation
length λ (cm). In addition, the present work reported the
calculated values of ΣR/ρ for some compounds of those nine
elements (Tc, Pm, Po, At, Rn, Fr, Ra, Ac and Pa) are provided
for the first time. The toolkit results for effective removal
cross-sections were qualified an excellent agreement with the
manually calculated values of the same parameter. The
WinNC-toolkit is useful for investigations of the neutron
shielding behaviours of engineering materials used in nuclear-
reactors.
Keywords
WinNC-toolkit, Effective removal cross-section, Fast neutron
attenuation parameters, Fast-neutron shielding.
1. INTRODUCTION
Shielding material for nuclear reactor requires hydrogenous
materials, heavy metal elements, and other neutron absorbers.
An approximate method for calculating the attenuation of fast
neutrons (2-12MeV) can be achieved by using the
macroscopic effective removal cross-section concept.
Theoretical, calculations of fast neutron removal cross-
sections [ΣR (cm-1)] of various shielding materials (compound,
composite and mixture) have attained a great importance as
the calculated values by using additivity formula [1,2] have
been found in good agreement with experimental
measurements [3-8]. For calculations of the removal cross-
sections, El-Khayatt et al. [9-10] developed two computer
programs, MERCSF-N and NXcom for fast neutrons. In these
programs, the required physical data for calculations had been
collected from literatures [11-13]. However, working with
these programs is not user friendly, as they require preparation
of input data file with a specific format which is time
consuming and error prone. Moreover, the mass removal
cross-section values of nine elements (Tc, Pm, Po, At, Rn, Fr,
Ra, Ac and Pa ) have not been included in the database-files
of these programs. Recently, a computer program ParShield
[14] has been developed by using the same equations and the
same database files of MERCSF-N and NXcom. The only
783
ISBN: 978-81-924893-0-8
Asha Rani
Department of Applied Sciences,
Ferozpur College of Engineering
and Technology,
Ferozpur-142052, India
ashasachdeva78@gmail.com
difference between them is that the ParShield was written in
C++, MERCSF-N and NXcom were written in FORTRAN 90.
But as the mass removal cross-sections values of the nine
elements have not been included in the database-files of these
programs. These programs are incapable to calculate the
removal cross section of the compounds, which contain one or
more of these elements, as zero values were assigned to these
nine elements in their database files.The present study reports
a new program reengineered with the aim of transforming
NXcom to the Windows platform, to modernizing its user
interface, updating the database file of ΣR/ρ values and
simplifying the input procedure of data file. The present work
has been done in the extension of our previously published
study on gamma rays interaction parameters, GRIC-toolkit
[15]. The WinNC-toolkit is capable to compute different
interaction parameters for the fast neutrons.
2. THE WINNC-TOOLKIT
WinNC-toolkit has been programmed in MS Excel-2007 to
facilitate improved automation of the calculations and results.
The database-file required in the execution of the toolkit has
been constructed in the form of a matrix containing several
physical quantities such as; ΣR/ρ, atomic number, atomic mass
and density as its matrix-elements.
The input data of sample material (composite material,
mixture and alloy) in its compound or elemental fractional
composition (by wt.) and density are required as input data.
The toolkit opens in MS-excel 2007 or above in user friendly
window. It can calculate the value of macroscopic effective
mass removal cross-section (ΣR/ρ, in cm2/g), macroscopic
effective removal cross section (ΣR, cm-1) and removal
relaxation length (λ, in cm) for any compound, mixture or
composite material. In addition, the toolkit presents the output
of results in both tabulated and graphical forms. Fig.1 shows
the flow chart the execution of WinNC-toolkit program.
1.1 Values of macroscopic effective mass
removal cross-section, ΣR/ρ (cm2/g)
The values of ΣR/ρ for the elements Tc, Pm, Po, At, Rn, Fr,
Ra, Ac and Pa are missing (zero values were assigned) in the
database-file of the pervious programs. In the present work,
values of ΣR/ρ for the missing elements have been interpolated
using bi-quadratic polynomial fitting method with the
LINEST function of Excel thereby updated in the database-
file of the toolkit. Thus the present toolkit contains a database
file for a complete range of macroscopic cross sections of all
the elements up to Uranium (U). Fig.2 authenticates the use of
bi-quadratic polynomial fitting method for the interpolation of
ΣR/ρ (cm2/g) values of some elements (with Z: 5, 10, 15, 20
and 25) whose ΣR/ρ values are already available in literature
[10]. Fig. 3 (a-c) shows the interpolation of ΣR/ρ values of the
elements (with Z: 43, 61, 84, 85, 86, 87, 88, 89 and 91).
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

1.2 Calculation of macroscopic effective PoO2 0.0143

removal cross section, ΣR (cm-1)
PmCl3 0.0177
Macroscopic effective removal cross section, ΣR is defined as
the probability that a fast or fission-energy neutron undergoes
a first collision, which removes it from the group of Pm2O3 0.0163
penetrating, uncollided neutrons [16].
PaCl4 0.0156
WinNC-toolkit calculates the value of ΣR (cm-1) for fast
neutrons of any compound, mixture, and composite material
Tc(CN)2 0.0261
using the updated database-file of ΣR/ρ and additivity formula
given by Eq. (1) [1, 2].
TcO2.2H2O 0.0389

TcO3 0.0233

Tc2O7 0.0242
where ρi is the partial density (g cm-3) (the density
of each element as it appears in the sample material), ρ refers Tc2S7 0.0217
to the material density (g cm-3) and (ΣR/ρ)i is the macroscopic
effective mass removal cross-sections of the ith constituent.
TcS2 0.0200
1.3 Calculation of removal relaxation
Tc(MnO4)2 0.0264
length, λ (cm)
The average distance travelled by a neutron before interaction
TcCO3 0.0244
is known as the Mean Free Path (mfp) for that interaction. The
mfp is also termed as „removal‟ relaxation length, λ (cm) and
defined by Eq. (2) [17]. Tc3N2 0.0175

TcCl4 0.0210

Tc3(AsO4)2 0.0213

Tc3As2 0.0157
Table 1.Calculated values of ΣR/ρ for some compounds.
Compound Formula ΣR/ρ (cm2/g)

AcH2 0.0151 1.4 Calculations for ΣR/ρ (cm2/g) of sample

The ΣR/ρ (cm2/g) is given by
AcF3 0.0151
R
R /   . (3)
AcCl3 0.0148 
Ac2S3 0.0130 where ρ is sample density. For the sample with unknown
value of the mass density, by putting the value of density for
Ac2O3 0.0128 that sample as one (1 gcm-3), the toolkit selects the ΣR/ρ value
for ΣR and provides the results.
Fr2S 0.0112
Table 2. Comparison of calculated values of effective
Fr3P 0.0109 removal cross-sections using the toolkit.

PoH2 0.0159 Concrete Density Measured values of ΣR (cm-1)

Samples
PoCl2 0.0140 (gcm-3) WinNC- Experim
Manually
toolkit entally
[18]
PoCl4 0.0163 [18]

Ordinary-
PoBr4 0.0142 2.30 0.0930 0.0937 0.1083
concrete
Hematite-
PoI2 0.0119 2.50 0.0978 0.0967 0.1160
serpentine
Ilmenite-
PoI4 0.0124 2.90 0.0943 0.0950 0.1433
limonite
Basalt- 3.05 0.1108 0.1102 0.1270

784
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
magnetite
Ilmenite 3.50 0.1111 0.1121 0.1625
Steel
Scrap
4.00 0.1226 0.1247 0.1654
Steel-
5.11 0.1421 0.1420 0.1680
magnetite
2. WORKING PROCEDURE OF WINNC-
TOOLKIT
The input procedure to feed the data (information of the
samples) is very simple and user friendly as compared to old
programs like NXcom. The program structure is such that
after pressing the TAB key from key-board the curser will
move to the box (cell) where user can feed data as instructed
at each step. The user has to feed the information about the
sample such as Name, Density (g cm-3) and Fractional
Composition (either compound or elemental). User should
feed the data in these files and save as WinNX-Tookit_S1,
WinNX-Tookit_S2 and so on for different samples. After
completing the input data the toolkit program automatically
calculates (within fraction of a second) the values of removal
cross sections for the sample. The tabulated results can be
seen by clicking on the tab „OUTPUT‟ at the bottom of the
window as indicated in Fig. 4. The graphical results can be
seen on clicking on; the tab „GRAPH_Ele.‟ if elemental
composition is provided and the tab „GRAPH_Comp.‟ if
compound composition is provided. The procedure of using
the WinNC-toolkit program will be clearer with the following
example and Fig. 4. For cement sample, the input of data
using compound chemical composition: Start of the program
and feed the information in specified boxes. The control goes
to next box by pressing TAB from keyboard. Finally click on
ENTER COMPOSITION. Input: A new window will open
which requires the compound chemical composition of the
sample. Replace the data already present in it. If the numerical
total of fractional composition ≠ 1 then at the top and bottom
of the window show a warning “Please Recheck, The
Composition is Incomplete”. It also indicates the numerical
value of the pending composition. Output: Click on the tabs
„OUTPUT‟ the result of the sample appears in a tabular form.
For getting the output of results in graphical form click on
„GRAPH_Comp.‟ the obtained results as shown in Fig.4. If
Fig.1: Flow-Chart of the program
785
ISBN: 978-81-924893-0-8
the user encounters any problem or difficulty then he/she feels
free to contact to the authors
3. RESULTS AND DISCUSSION
WinNC-toolkit provides the window platform and
user friendly interface for the investigation of fast neutron
shielding behaviour for composite materials by using their
chemical composition (by wt.). The toolkit has been used to
calculate ΣR/ρ values for some compounds which contain
elements missing in the database files of MERCSF-N and
NXcom programs for the first time and listed in Table 1 . Thus
the reengineered program WinNC-toolkit has the capability to
investigate the fast neutron attenuation parameters in mixtures
and composite materials of elements from 1H-92U. Table 2
shows the excellent agreement of the WinNC-toolkit
calculated values with the literature values of effective
removal cross-sections for seven concrete samples [18].
4. CONCLUSIONS
The WinNC-toolkit is a user‟s friendly computer program
for quick investigation of fast neutron shielding parameters
[such as macroscopic effective removal cross-section ΣR (cm-
1
), effective mass removal cross-section ΣR/ρ (cm2/g), and
removal relaxation length λ (cm)] for any composite material
by using its chemical composition (by wt. fraction). Some
specific conclusions of the present work are as follows:
 Using bi-quadratic polynomial fitting interpolation
method the values of ΣR/ρ for 43Tc, 61Pm, 84Po, 85At,
86Rn, 87Fr, 88Ra, 89Ac and 91Pa have been used in the
updated database of the previous programs (MERCSF-N
and NXcom).
 The-toolkit, is a reengineering of the NXcom program in
MS-Excel-2007 which leads to improvement in user‟s
interface results for those composites which contain one
or more of the following elements; Tc, Pm, Po, At, Rn,
Fr, Ra, Ac and Pa.
 The output of WinNC-toolkit can be easily transferred to
new MS-Excel file.
 A good agreement of the manually calculated literature
values and the toolkit results of effective removal cross-
sections confirm and authenticate the toolkit for use.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig. 2

Fig. 3a Fig. 3 b Fig. 3 c

786
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Fig. 3

787
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

5. ACKNOWLEDGMENTS [9] A.M. El-Khayatt, “Calculation of fast neutron removal

Our thanks to Dr. A.M. El-Khayatt for providing the NXcom- cross-sections for some compounds and materials,” Ann.
program. Nucl. Energy, 37, pp. 218-222, 2010.

REFERENCES [10] A.M. El-Khayatt, “NXcom - a program for calculating

[1] J. Wood, Computational Methods in Reactor Shielding, attenuation coefficients of fast neutrons and gamma-rays,”
Pergamon Press, Inc., New York, USA, 1982. Ann. Nucl. Energy, 38 (1), pp.128-132, 2011.

[2] M.F. Kaplan, Concrete Radiation Shielding, John Wiley & [11] A.E. Profio, Radiation Shielding and Dosimetry, John
Sons, New York, USA, 1989. Wiley & Sons, Inc., New York, 1979.

[3] A.M. El-Khayatt, A. El-Sayed Abdo, “MERCSF-N [12] A.B.Chilton, J.K.Shultis, R.E. Faw, Principles of
calculation program for fast neutron removal cross-sections in Radiation Shielding, Prentice-Hall, Englewood Cliffs, NJ.,
composite shields,” Ann. Nucl. Energy, 36 (6), pp. 832-836, 1984.
2009.
[13] M.E. Wieser, “Atomic weights of the elements 2005
[4] E. Yilmaz, H. Baltas, E. Kirisa, İ. Ustabas, U. Cevik, (IUPAC technical report),” Pure Appl. Chem., 78 (11), pp.
A.M. El-Khayatt, “Gamma ray and neutron shielding 2051–2066, 2006.
properties of some concrete materials,” Ann. Nucl. Energy, 38
[14] Y. Elmahroug, B. Tellili, C. Souga, K. Manai,
(10, pp. 2204–2212), 2011.
“ParShield: A computer program for calculating attenuation
[5] G. Osman, A. Bozkurt, E. Kamc, T. Korkut, parameters of the gamma rays and the fast neutrons,” Ann.
“Determination and calculation of gamma and neutron Nucl. Energy, 76, pp.94–99, 2015.
shielding characteristics of concretes containing different
[15] K.S. Mann, A. Rani, M.S. Heer, “Shielding behaviors of
hematite proportions,” Ann. Nucl. Energy, 38, pp. 2719–2723,
some polymer and plastic materials for gamma-rays,” Radiat.
2011.
Phys. Chem., 106, pp. 247–254, 2015.
[6] M. Kurudirek, Y. Ozdemir, “Energy absorption and
[16] E.P. Blizard, L.S. Abbott, Reactor Handbook, vol. III,
exposure buildup factors for some polymers and tissue
Part B, Shielding, John Wiley & Sons, Inc., 1962.
substitute materials: photon energy, penetration depth and
chemical composition dependence,” J. Radiol. Prot.,31,
[17] M.A. Ibrahim, “Attenuation of fission neutrons by some
pp.117–128, 2011.
hydrogenous shield materials and the exponential dependence
of the attenuated total neutron dose rate on the shield
[7] A.M. El-Khayatt, I. Akkurt, “Photon interaction, energy
thickness,” Appl. Radiat. Isot.,52, pp. 47-53, 2000.
absorption and neutron removal cross section of concrete
including marble,” Ann. Nucl. Energy, 60, pp. 8-14, 2013.
[18] I. I. Bashter, “Calculation of radiation attenuation
coefficients for shielding concretes,” Ann. Nucl. Energy,
[8] B. Tellili, Y. Elmahroug, C. Souga, “Calculation of fast
24(17), pp. 1389-1401, 1997.
neutron removal cross sections for different lunar soils,”
Advances in Space Research, 53, pp. 348–352, 2014.

788
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
GREEN COMPUTING
Sarbjit Kaur
PGGCG, Sector 42
Affiliated to PU, Chandigarh
sarbjitkaur1981@gmail.com
ABSTRACT
Green computing whose goals are to reduce the use of
hazardous materials, maximize energy efficiency during the
product's lifetime, and promote the recyclability or
biodegradability of defunct products and factory waste.
Computers today not only used in offices but also at homes.
As the number of computers is increasing day by day, so is
the amount of electricity consumed by them which in turn is
increasing the carbon content in atmosphere. This problem
has been realized by people and measures are being taken
which help in minimizing the power usage of computers.
Therefore, this can be called as Green Computing. This paper
will take a look at several green initiatives currently under
way in the computer industry.
Keywords
Data centers, Virtual Machines, WEEE & RoHS, Recycling,
Telecommuting
1. INTRODUCTION
Green computing, refers to environmentally sustainable
computing or IT. Basically it is the study and practice of
designing, manufacturing, using, and disposing of computer
devices like CPU, servers, and associated peripheral devices
like: display monitors, keyboards, printers, storage devices,
and networking systems efficiently and effectively with
minimal or zero impact on the existing environment. Green IT
includes the dimensions of environmental sustainability, the
economics of energy efficiency, and the total cost of
ownership, which includes the cost of disposal and recycling.
It can be termed as the study and practice of using computing
resources very efficiently.
If we look global environment situation currently, gas
emissions are a major contributing factor to global warming
and therefore now, governments and society at large have an
important new agenda i.e. tackling environmental issues and
adopting environmentally sound practices. IT is a required
revolution and greening our IT products, applications,
services, and practices is both an economic and an
environmental imperative, as well as our social responsibility.
Therefore, a growing number of IT vendors and users are
moving toward green IT and thereby assisting in building a
green society and economy.
789
ISBN: 978-81-924893-0-8
Sonika
PGGCG, Sector 42
Affiliated to PU, Chandigarh
sonikahi2000@gmail.com
Adding contribution onto this, in 1992 U.S. Environmental
Protection Agency launched Energy Star Rating labeling
program which is designed to promote and recognize energy-
efficiency in monitors, climate control equipment, and other
technologies. This resulted in the widespread adoption of
sleep mode among consumer electronics.
2. GREEN COMPUTING
Now days almost in every existing or emerging sector
machinery being used requires large amount of power and
money for its effective functioning. We now have advanced
machines and equipment’s to accomplish our industrial tasks,
great gadgets with royal looks and features make our lives
more impressive and smooth.
2.1 PURPOSE OF GREEN COMPUTING
Green computing whose goals are to reduce the use of
hazardous materials, maximize energy efficiency during the
equipment’s lifetime, and promote the recyclability or
biodegradability of improper / dysfunctional products and
factory waste. Thus we use Green Computing for following
advantages-
1. Using ENERGY STAR Rating qualified products
help in energy conservation. This qualifies the
product to be environment friendly
2. Donating used computers and other peripherals can
reduce the rate of e-waste creation. Moreover, it
helps those who cannot afford to buy computer.
3. Through proper disposal of computers and its
accessories, it is possible to reduce environmental
pollution.
4. Surge protectors offer the benefit of green
computing by cutting off the power supply to
peripheral devices when the computer is turned off
or are at sleep mode.
5. On other prospective, considering benefits of
computers, we are saving the woods by promoting
computer revolution. Therefore more electronic
data, less paper work.
6. With download option direct from the website /
URL selling for loaded data on compact disks have
reduced drastically which is eventually saving the e-
wastage.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2.2 APPROACHES TOWARDS GREEN
COMPUTING
In today’s computerized world, where computers are involved
in every sector, large amount of computer data needs proper
storage and management. The data could be in either form
including audio, video, image or text it takes the storage.
Consider the example of social networking sites of search
engines like Facebook, Google respectively where huge data
is being added every day. Data centers here come in picture
(Figure: 1 below) and such service providers like Google,
amazon need extraordinarily high energy and are a primary
focus for proponents of green computing.
2.2.1. Data centers:
Data centers can potentially improve their energy and space
efficiency through techniques such as storage consolidation
and virtualization. Many organizations are starting to
eliminate underutilized servers, which results in lower energy
usage. The U.S. federal government has set a minimum 10%
reduction target for data center energy usage by 2011. With
the aid of a self-styled ultra-efficient evaporative cooling
technology. Google Inc. has been able to reduce its energy
consumption to 50% of that of the industry average.
Figure 1: Data Centre
2.2.2 Virtual Machines (VM):
Computer virtualization refers to the abstraction of computer
resources, such as the process of running two or more logical
computer systems on one set of physical hardware. This
virtualization concept originated with the IBM mainframe
operating systems during 1960s, but was commercialized for
x86-compatible computers only in the 1990s. With
virtualization, a system administrator could combine several
physical systems into virtual machines on one single,
powerfully configured system, by unplugging the original
hardware which reducing power and cooling
consumption(Figure: 2 above). Many commercial companies
and open-source projects now offer software packages to
enable a transition to virtual computing. Major companies like
Apple, Intel and AMD have built proprietary virtualization
enhancements to the x86 instruction set into each of their CPU
product lines, in order to facilitate virtualized computing.
790
ISBN: 978-81-924893-0-8
Virtual machine can be more easily controlled and inspected
from outside than a physical one, its configuration is also
more flexible. Virtual machine can be easily re-located from
one physical machine to another as needed. For example, a
sales person going to a customer can copy a virtual machine
with the demonstration software to its laptop, without the need
to transport the actual physical computer. At the same time
and error inside a virtual machine does not harm a host
system, so there is no risk of breaking down the operating
system in said laptop.
Figure 2: Virtual Computing Architecture
2.2.3 Hardware Material Management:
WEEE & RoHS Directives implementation in India:
Several government agencies at global level have adopted the
Restriction of Hazardous Substances Directive (RoHS).
Government of India passed Rules in 2011, regulations that
cover RoHS specifications in all electronic and electrical
components and equipment. It also covers the equivalent of
the European Union’s WEEE e-waste regulations that guide
the disposal of electronic and electrical equipment. It is
applicable to all producers and distributors involved in the
manufacture, sale, and processing of electronic and electrical
equipment or components. The restrictions also affect waste
collection centers, product dismantlers, and recyclers.
Similarly the waste-related provisions is enforced from May
1, 2012.
Such agencies are closely linked with the Waste Electrical and
Electronic Equipment Directive (WEEE), which sets
collection, recycling, and recovery targets for electrical goods
and are part of a legislative initiative that aims to reduce the
huge amounts of toxic e-waste. Example: In 2001, they
focused on lead-free manufacturing, introducing the Enhanced
Ball Grid Array (EBGA) package for power efficient VIA
processors and the Heat Sink Ball Grid Array (HSBGA)
package for their chipsets.
Advanced Configuration and Power Interface:
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ACPI (Advanced Configuration and Power Interface) is an
open industry specification co-developed by many electronic
device and chipset manufacturers like Hewlett-Packard, Intel,
Microsoft, Phoenix, and Toshiba. ACPI establishes industry-
standard interfaces enabling OS-directed configuration, power
management, and thermal management of mobile, desktop,
and server platforms. When first published in 1996, ACPI
evolved an existing collection of power management BIOS
code, Advanced Power Management (APM) application
programming interfaces (APIs), PNPBIOS APIs, and
Multiprocessor Specification (MPS) tables into a well-defined
power management and configuration interface specification.
This specification enables new power management
technologies to evolve independently in operating systems
and hardware while ensuring that they continue to work
together for an ecofriendly environment. Latest specifications
version 5.0a is being used for devices manufactured after
2013. Every change is integrated in form of new versions that
describes the structures and mechanisms necessary to design
operating system-directed power management and make
advanced configuration architectures possible.
2.2.4 Recycling:
Computer recycling refers to recycling or reuse of a computer
or electronic waste. This can include finding another use for
the system (i. e. donated to charity), or having the system
dismantled in a manner that allows for the safe extraction of
the constituent materials for reuse in other products.
Additionally, parts from outdated systems may be salvaged
and recycled through certain retail outlets and municipal or
private recycling centers
The recycling of old computers raises an important privacy
issue. The old storage devices still hold private information,
such as emails, passwords, and credit card numbers, which
can be recovered simply by someone's using software
available freely on the Internet. Deletion of a file does not
actually remove the file from the hard drive. Before recycling
a computer, users should remove the hard drive, or hard drives
if there is more than one, and physically destroy it or store it
somewhere safe. There are some authorized hardware
recycling companies to whom the computer may be given for
recycling, and they typically sign a non-disclosure agreement.
What can be recycled? Darned near everything! A few key
examples:
Computer monitors (CRTs) contain an average of 4 lbs. of
lead, a lot of reusable glass, chromium and mercury. All of
these elements can be extracted and reused. For example, our
recycler takes the glass from old monitors, and sends them to
Samsung for use on flat screen monitors and TVs.
CDs/DVRs contain gold, glass, plastic, nickel and other
elements that are completely recoverable and reusable.•
Batteries – everything from the batteries that power your
phone, laptop, and mouse can be recycled, whether single-use
or rechargeable.
791
ISBN: 978-81-924893-0-8
Computers, printers, TVs, microwave ovens, power strips,
lamps, and all other electronic items.
2.2.5 Telecommuting:
Teleconferencing and telepresence technologies are often
implemented in green computing initiatives. The advantages
are many; increased worker satisfaction, reduction of
greenhouse gas emissions related to travel, and increased
profit margins as a result of lower overhead costs for office
space, heat, lighting, etc. The savings are significant; the
average annual energy consumption for U.S. office buildings
is over 23 kilowatt hours per square foot, with heat, air
conditioning and lighting accounting for 70% of all energy
consumed. Other related initiatives, such as hostelling, reduce
the square footage per employee as workers reserve space
only when they need it. Many types of jobs, such as sales,
consulting, and field service, integrate well with this
technique.
3. BEST PRACTICES FOR GREEN
COMPUTING
As IT users, we can contribute our own effort to protect the
environment by operating the IT equipment wisely.
Do not keep computer monitor running overnight and on
weekends. The life of a monitor is related to the amount of
hours it is in use. If large amount of time is being spent on
computer, reduce the light level because it eventually
improved monitor life by being less heated and good for user
health too.
Do not turn on the printer until you are ready to print. Printers
consume energy even while they are idle. Avoid unnecessary
use of printer. Always buy and use recycled-content paper
Use "paperless" methods of communication such as email and
fax-modems or SMS.
Request recycled / recyclable packaging from your computer
vendor.
4. CONCLUSION
Green computing is not about going out and designing
biodegradable packaging for products. Now the time came to
think about the efficiently use of computers and the resources
which are non renewable. It opens a new window for the new
entrepreneur for harvesting with E-waste material and scrap
computers. Green Computing strategies does not saves money
as the set up cost for eco- friendly electronics is more than
what we save but we personally feel that even if the set up
cost is higher than what we save we still can aim towards
saving our mother earth using these green computing
techniques.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

REFERENCES
[7] Green IT: Why Mid-Size Companies Are Investing
[1] Maria Kazandjieva, Brandon Heller, Omprakash
Now.www.climatesaverscomputing.org.
GnawaliGreen Enterprise Computing Data Assumptions
[8] Software or Hardware: The future of green Enterprise
and Realities
computing Page 185.14 pages.
[2] Er. Navdeep Kochhar, Er. Arun Garg),’Eco-Friendly
[9] A Greener Approach to Computing by Volume 2, Issue
Computing:
2, February 2012.
[3] Green Computing.Joseph Williams and Lewis Curtis,
[10] Green : The new computing coat of Arms by Joseph
“Green: The New Computing Coat of Arms?”
Willium and Lewis Curtis IT Pro January/February 2008
[4] “GREEN COMPUTING”, Department of the Premier
published by the IEEE computer society.
GJPB Willemse, www.fs.gov.za
[5] Er. NavdeepKochhar, Er. Arun Garg),’Eco-Friendly
Computing: Green Computing’.
[6] Jones, Ernesta "New Computer Efficiency Requirements".
U.S. EPA.

792
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

793
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Recent Modified Fibers with Their Technological
Developments in Different Fields of Application - An
Overview
Nisha
Department of Textile Engineering
GZSPTU Campus Bathinda
aroranishatxtle@gmail.com
ABSTRACT
The applications of the textile fibers in todays era are
growing at a very faster rate. The textile fibers have not
been limited to the yarn and fabric manufacturing
applications. Infact, the future of polymer based fiber
technology for different applications depends largely on
the future needs of our civilization. According to
different application areas the technology of fibers varies.
The important research findings of this paper give idea
about some recent polymer based modified fibers with
their technological developments in different field of
application. In this paper, the characteristics of recent
fibers are outlined and deal with various types of
modified fibers, applications, advantages.
Key-Words- Modified Fibers, Wound Dressing
Fibers and Nano-electrospun Fibers
1.INTRODUCTION
At a molecular level, there are close similarities between
the biological modification of a fiber with an enzyme and
the biological activity of a modified fiber through
inhibition or promotion of the future of modified fibers
enzyme activity. At this chemical/biological interface of
subject areas, interest often becomes interdisciplinary
and new ideas may be spawned. It is also very evident
that the scientific community is now turning to enzymes
in an effort to make our world more renewable and
sustainable. Although enzymes have been used in textile
processing for many years, it is only in the last 20 years
that growing interest has been given to using a variety of
enzymes for textile and fiber applications. Natural fibers
are readily available and easily produced owning to their
remarkable molecular structure that affords a bioactive
matrix for design of more biocompatible and intelligent
materials. On the other hand, specific material properties
including the modulus of elasticity, tensile strength, and
hardness are largely fixed parameters for a natural fiber
but have been more manageable within synthetic fiber
design. The molecular conformation native to natural
fibers is often key to interactions with blood and organ
cells, proteins, and cell receptors, which are currently
being studied for a better understanding to improve
medical textiles. The native conformation or periodicity
of structural components in native fibers such as collagen
and cellulose offers unique and beneficial properties for
biomedical applications. An extension of the bioactive
conformation property in fibers to rationally designed
fibers that would inhibit enzymes or trigger a cell
receptor is a premise of current research.(1)
794
ISBN: 978-81-924893-0-8
Amit Madahar
Department of Textile Engineering
GZSPTU Campus Bathinda
amitbtechtex@gmail.com
All the modified fibers have some significant role in the
different application areas.(1) . But here we study on two
modified fibers that are:
Modified fibers
Wound dressing modified Nano-electrospun
fibers modified fibers
2. Fibers used in wound dressing and
wound healing:
Recently, the molecular modes of action have been
investigated for skin substi-tutes, interactive
biomaterials, and some traditional material designs as
balancing the bio-chemical events of inflammation in the
chronic wound to improve healing. The interactive
wound dressings have activities including up-regulation
of growth factors and cytokines and down-regulation of
destructive proteolysis(1) Carbohydrate-based wound
dressings have received increased attention for their
molecular interactive properties with chronic and burn
wounds. Traditionally, the use of carbohydrate-based
wound dressings including cotton, xe-rogels, charcoal
cloth, alginates, chitosan, and hydrogels have afforded
properties such as absorbency, ease of application and
removal, bacterial protection, fluid balance,
occlusion,and elasticity. Recent efforts in our lab have
been underway to design carbohydrate dressings that are
interactive cotton dressings as an approach to regulating
destructive proteolysis in the non-healing wound.
Elastase is a serine protease that has been associated with
a variety of inflammatory diseases and has been
implicated as a destructive protease that impedes wound
healing. The presence of elevated levels of elastase in
non-healing wounds has been associated with the
degradation of important growth factors and fibronectin
necessary for wound healing. Focus will be given to the
design, preparation, and assessment of a type of cotton-
based interactive wound dressing designed to intervene
in the pathophysiology of the chronic wound through
protease sequestration(2)
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.Characteristics of wound dressing

fibers and wound healing:

As we go through the ages, both vegetable and animal

fibers have been applied to human wounds to stop
bleeding, absorb exudate, alleviate pain and provide a
protective barrier for the formation of new tissue. So,
These fibers have some chracterestics in them
 Wound dressing fibers merged with natural
ingredients and helps to cure human body from
wounds. The development of wound dressing
occure through the ages are summarized in
Early humankind employed many different
materials from the natural surroundings
including resin-treated cloth, leaves, and wool- Reference of the fig: Fiber Optic Dressing
based materials with a variety of substances Monitors Wound Healing by Gavin Corley
including eggs and honey. Recent studies
suggest that honey may promote wound  Absorbency
healing through stimulation of inflammatory  Ease of application and removal
cytokines from monocytic cells. For example,  Adherence
the antibacterial activ-ity of honey in the
 Elasticity
treatment of wounds has been established (3),
 Bacterial barrier
and honey is now being reconsidered as a
dressing when antibiotic-resistant strains  Gaseous exchange
prevent successful antibiotic therapy.  Comfort
 Hemostatic
 Conformability
4.Fiber used in wound dressing are:
 Non-antigenic and non-toxic
 Drug delivery
 Thin films (bioclusive, tegaderm, opsite) :  Sterilizability
Semipermeable, polyurethane membrane with  Durability
acrylic adhesive
 Water vapor transmissibility
 Sheet hydrogels (clearsite, nu-gel, vigilon,
geliperm, duoderm gel, intrasite gel, geliper
granulate) : . Solid, non-adhesive gel sheets
that consist of a network of cross-linked,
6.Application: The design and preparation of
hydrophilic polymers that can absorb large interactive chronic wound dressings have become
amounts of water without dissolving or losing increasingly important as part of a solution to
its addressing the critical worldwide health crisis of the
growing number of chronic wound patients. Some
applications of the wound dressing fiber are:
 Hydrocolloid(duoderm, comfeel) :
Semipermeable polyurethane film in the form
of solid wafers; contain hydroactive particles as
sodium carboxymethyl cellulose
that swells with exudate or forms a gel.

5. Ideal properties of a wound dressing

as compared between cotton and
alginate materials.

795
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Reference : Fiber Optic Dressing Monitors Wound
Healing by Gavin Corley
i. Used to help who suffer from chronic wounds due
to the formation of decubitus bedsores brought on in
the elderly nursing home or spinal chord paralysis
patient.
ii. Helpful for diabetes accounts for at least 60,000
patients annually who also suffer with foot ulcers
iii. Recent efforts to develop wound dressings that do
more than simply offer a moist wound environment
for better healing have prompted most major wound
dressing companies to develop research and
approaches on interactive chronic wound dressings.
7. Electrospun nanofibers from
biopolymers and their biomedical
applications:
796
ISBN: 978-81-924893-0-8
Reference: Macromolecular Materials and
Engineering Volume 295, Issue 10, pages 958–965,
October 12, 2010
Electrospun fibers are more exciting Than most other
nanofibers because their composition is highly diverse.
Until Recently, nanofibers have consisted largely of
carbon nanotubes and other inor-ganic fibers. However,
electrospun fibers can be fabricated of almost limitless
Materials from synthetic to natural polymers.(4) Thus, the
surface chemistry can Be tailored to meet a large number
of applications. The focus for electrospun Products has
so far included nonwovens for filtration membranes for
aerosol Purification thin coatings for defense and
protection, and structures in-corporated in composites.
Biomedical applications include more efficient Wound
healing and drug delivery devices, biocompatible
scaffolding for tissue Regeneration, bioerodable implant
structures, and others . The purpose of This paper is to
review some of the natural and synthetic biopolymers
That can be electrospun into micro- and nanofibers and
to show their value for Future medical applications. Due
to the enormous amount of research published In recent
years only a brief review will be presented here, with the
scope Of this article being to introduce the reader to this
rapidly emerging field.(5)
7.1 Fibers used in nanofiber
electrospinning technology:
Reference of the fig: Preparation of Fibers With
Nanoscaled Morphologies: Electrospinning of Polymer
Blends. M. Bognitzki; T. Frese; M. Steinhart A. Greiner;
J.H. Wendorff, Polym. Eng. Sci. 41, 6, 982-989 (2001)
Electro-spinning has originated from electro-spraying,
where an electric charge is provided to a conducting
liquid and produces a jet which splits into fine particles
that resemble a spray, hence the name electro-spraying
(Rayleigh 1882; Zeleny 1914). However, when a
polymer is used in place of allow-molecular-weight
substance for the electro-spraying process, the long-chain
nature of polymers does not allow the splitting of the jet
into particles. Instead, the jet undergoes instabilities and
thins to form nano fibers. Therefore, one has to use
polymers (natural or synthetic) to form nano fibers using
the electro-spinning/electro spraying technique.
The physical compatibility of biomaterials includes
variables such as struc-tural integrity, strength,
deformation resistance, fatigue properties, and modulus
of elasticity. For prosthetic devices, carefully engineered
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
metallic or ceramic biomaterials have adequate
mechanical properties, wear, and corrosion resistance.
However, metals and ceramics do not match both
modulus and resiliency of living bone. Bone is
continually undergoing fracture and repair processes
whereas current synthetic materials do not have this
property. Attempts to over-come this challenge have
included making the surface or the entire material porous
or biodegradable. Porous materials are used to encourage
tissue growth into the prosthetic. Biodegradable materials
are chosen so that the prosthetic 5. Electro-spun
nanofibers from biopolymers will gradually disappear
and be replaced by living tissue. To date, neither
approach has been highly successful. Biopolymers are
better suited for applications that require flexibility,
elasticity, and shape-ability. Examples for biopolymer
stets include wound dressings, drug release devices, soft
tissue replacements, cardiovascular grafts, and sutures.
Research in biodegradable polymers has increased
dramatically over the past decade and good reviews are
available in the literature. So, according to above
mentioned priorties the nano-polymer fibers used A wide
range of polymers has been used to electro-spin nano
fibers. Natural polymers such as collagen), chitosan
(Bhattarai et al 2005; Geng et al 2005), hyaluronic acid
(Um et al 2004), and silk fibrion (Jin et al 2002, 2004)
have been used to produce nanofibers that can form
potential scaffolds for tissue engineering applications.
More recently, nanofibersof protein (Li et al 2005;
Woerdeman et al 2005) have been demonstrated to have
promising use in tissue engineering. Among the synthetic
polymers explored for the fabrication of nanofibers,
poly(lactic acid) (PLA) (Yang et al 2004, 2005),
polyurethane (PU) (Verreck et al 2003b; Riboldi et al
2005), poly(ε-caprolactone) (PCL) (Reneker et al 2002;
Li et al 2003; Li et al 2005c), poly(lactic-co-glycolic
acid) (PLGA) (Luu et al 2003;Kim et al 2004; Uematsu
et al 2005), poly(ethylene-co-vinylacetate) (PEVA)
(Kenawy 2002), and poly(l-lactide-co-ε-caprolactone)
(PLLA-CL) (Mo et al 2004; Mo and Weber 2004) have
been well studied. (6)
 Electrospun PLGA fibers: these fibers are made
up of Poly(lactic acid), poly(glycolic acid), and
poly(lactide-co-glycolide) Biocompatible and
biodegradable, poly(lactic acid) (PLA),
poly(glycolic acid) (PGA), and their copolymers are
interesting materials for implants, sutures, and
especially controlled drug release at high loading
concentrations. The rate at which the drug is
discharged into the biological system is determined
by the degradation rate of the polymeric carrier. The
degradation products, for in-stance lactic acid in the
case of PLA decomposition, can easily be
metabolized by the body. PGA fiber formation has
so far been limited to melt extrusion and drawing,
producing fibers in the micrometer range. Boland et
al. (5)could demonstrate that PGA.
 PHB fibers: usually made from Poly(3-
hydroxybutyrate) and copolymers. PHB and
copolymers have been investigated for tissue and
cartilage repair as it is compatible with various cell
lines. Due to the lowmechanical strength of PHB,
blends with other polymers have been
explored.PHB can be electrospun from 5%
chloroform solution to fibers of less than1µm.These
fibers produced at a voltage of 10 kV and 7.5 cm
797
ISBN: 978-81-924893-0-8
elec-trode distance. The fibers had an average
diameter of 860–720 nm (±100), de-pending on the
specific experimental conditions, and a somewhat
rough surface.
 Nanoscale silk fibroin fibers: Electro spinning was
used to produce silk fibroin fibers from Bombyx
mori and Samia cynthia riciniby dissolving the
fibroin in hexafluoroacetone (HFA)
 Cellulose-based nanofibers: Cellulose-based
materials are useful for wound dressings and, less
importantly, for sutures and related applications.
Natural cellulosic materials, such as cotton,
decompose before they melt, and cannot be melt-
spun. Efforts have been made to regenerate cellulose
from solution so as to form nanofibers. Frey
successfully produced electro spun cellulose fibers
from polar fluid/salt solutions. It is clear from this
work that cellulose nano fibers could potentially be
spun from inexpensive renewable resources or
reclaimed cellulosic material. Another experimental
route to the production of nanofibers based on
cellulose consists of derivatizing cellulose and
subsequently removing the substituents at the
cellulosic hydroxyl groups. (7)
8. Application of these fibers:
With the help of the electrostatic spinning technology,
biopolymers can be formed into nanofibrous structures
which have great potential for medical applications.
 Due to their small size, the electrospun fibers
provide a large surface-to-volume ratio and could be
used for drug delivery, scaffolds for tissue
engineering, or provide support for bone repair.
 Due to the relative ease of the electrospinning
technique a large number of different polymeric
materials including natural fibers have already been
explored or will be in the near future. Carefully
tailored surface chemistries of these micro- and
nanofibers will continue to expand their applications
in the medical field Like wound closture & wound
healing, Also used for artificial lung transplantation.
 Many materials (natural and synthetic) have been
explored as nanofibrous scaffolding materials for
bone, cartilage, ligament, and skeletal muscle tissue
engineering, including HA (Ramay and Zhang
2003),chitosan (Bhattarai et al 2005), PLGA
(Uematsu et al 2005), carbon (Price et al 2003b) and
aluminum nanofibers (Webster et al 2005).
Although nanofibers have been studied as scaffolds
for multiple tissue types, musculoskeletal tissue is
probably the most well studied.
 Nanofibers have significant applications in the area
of filtration since their surface area is substantially
greater and have smaller micropores than melt
blown (MB) webs. High porous structure with high
surface area makes them ideally suited for many
filtration applications. Nanofibers are ideally suited
for filtering subm icron particles from air or water.
CONCLUSION
From the above study it is clear that all modified fibers
have great impact in the medical and as well as in other
application areas. All the modified fibers are one of the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

body’s key natural resources and a component of skin 3) Cooper, R. A.; Molan, P. C.; Harding, K. G.
tissue that can benefit all stages of the wound healing Antibacterial activity of honey against
process. When the modified fiber made available to the strainsofStaphylococcus aureusfrom infected wounds.J.
wound bed, closure can occur. Wound deterioration, R. Soc. Med.1999,92, 283–285.
followed sometimes by procedures such as amputation, 4) (Huang et al 2001; Matthews et al 2002; Gersbach et
can thus be avoided. Therefore it is used as a natural al 2004; Shields et al 2004), gelatin (Zhang et al 2005
wound dressing and has properties that artificial wound 5) Clark, R. A. F. Wound repair: Overview and general
dressings do not have.All these fibers have resistant considerations. In: R C.(Ed.)TheMolecular and Cellular
against bacteria, which is of vital importance in a wound Biology of Wound Repair. Plenum Press, New
dressing and in other applications. These fibers help to York,1996,
keep the wound sterile, because of their natural ability to pp. 3–35.
fight infection and other diseases. 6) J. V. Edwards et al. (eds.), Modified Fibers with
Medical and Specialty Applications,67–80.C
2006Springer.
REFERENCES 7) Int J Nanomedicine. 2006 March; 1(1): 15–30.
8) www. Enfermagemcurativos.com
1) www.springer.com, ISBN-13 978-1-4020-3794-8 (e-
book)
2) Grimsley, J. K.; Singh, W. P.; Wild, F. R.; Giletto, A.
A novel, enzyme-based method forthe wound surface
removal and decontamination of organophosphorus nerve
agents. In:Edwards, J. V.; Vigo, T. L.
(Eds.)BioactiveFibers andPolymers. American Chemical
Society,Washington, DC,2001, 35–4

798
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
INNOVATIONS IN TEXTILE COMPOSITE DESINING
AND THEIR APPLICATIONS
Rajeev Varshney
Department of Textile Engineering
GZSPTU Campus, Bathinda
rajeev_varshney2002@yahoo.co.in
.Abstract: Textile composites are the materials in
which the composition and internal structure are varied in a
controlled manner so as to match their performance to the
most demanding structural or non-structural roles. Textile
reinforcement structure can be made of fibers, yarns or
fabrics (woven, braided, knitted or non wovens) and are
generally flexible. The application of traditional textile
technology to organize high performance fibers for
composite material applications has provided a route to
combining highly tailored materials with enhanced process
ability. Many commercially produced composites use a
polymer matrix material often called a resin solution. There
are many different polymeric materials available depending
upon the starting raw ingredients. There are several broad
categories, each with numerous variations. The most
common are known as polyester, vinyl ester, epoxy,
phenolic, polyimide, polyamide, polypropylene, PEEK, and
others. This paper covers the innovations in Textile
Structural composite designing and their areas of
application.
Keywords: Braided, Non woven, Matrix, Polymer,
Woven, Knitted
1. INTRODUCTION
The Textile composites represent advanced materials which
are reinforced with textile performs for structural or load
bearing applications. Currently, textile structural
composites are a part of a huge category of composite
materials: textile composites. Textile composites can be
defined as the combination of a resin system with a textile
fiber, yarn or fabric system. They may be either flexible or
rigid. Flexible textile composites may include heavy duty
conveyor belts or inflatable life rafts. On the other hand,
Inflexible or rigid textile composites are found in a variety
of products referred to as fiber reinforced plastic (FRP)
systems. These textile composites have been in use since
the 1950’s mostly in interior and exterior panels and in
parts for the automotive and aircraft industry and represent
a good alternative for metal and wood applications. Textile
structural composite are mainly used as structural materials
to resist heavy loads that occur in the basic framework for
buildings, bridges, vehicles, etc. They are made of a textile
composite perform embedded in a resin, metal or ceramic
matrix. The matrix system provides rigidity and holds the
textile reinforcement material in a prescribed position and
orientation in the composite. The composite perform is
obtained from the assemblage of unrigidized fibrous
799
ISBN: 978-81-924893-0-8
Amit Madahar
Department of Textile Engineering
GZSPTU Campus, Bathinda
amitbtechtex@gmail.com
material such as fibers, yarns or fabrics and its structure can
vary from a simple planar sheet to a complex 3D net shape.
2. Step wise procedure for
manufacturing Textile Composites: With the
growth and rapid developments in machinery and textile
manufacturing techniques have advanced the science of
textiles There are usually four important levels in the
manufacturing process of textile composites:
FIBER > YARN > FABRIC > COMPOSITE
The first step represents the choice of the fibers in the
fabrication of textile structural composites. To resist high
loads in structural applications, textile structural composite
products should be made from high modulus fibers, such as
glass, graphite, aramid, ceramic or steel fibers.
The second step of the composites manufacturing process
consists of grouping together the fibers (or filaments) in a
linear assemblage to form a continuous strand having
textile like characteristics. The yarns may be composed of
one or more continuous filaments, or even discontinuous
chopped fibers, and finally, two or more single yarns can be
twisted together to form ply or plied yarns.
The third step in the textile structural composites
manufacturing process involves bonding and interlocking
of the yarns together to produce a flat sheet with a specific
pattern. Fabric types are categorized by the orientation of
the yarns used, and by the various construction methods
used to hold the yarns together.
The four basic fabric structure categories are woven,
knitted, braided, and nonwoven.
3. Preforms in Composites –
Manufacturing:
The reinforcement materials used during manufacturing of
composites may be in form of a thick woven cloth or the
laminates which are can be combined to get the required
thickness. So on the basis of reinforcement material used,
The composites can be broadly categorized as:
(A) Laminated Composites
(B) 3-D Composites
3.1 Laminated Composites: In case of laminar
composites the layers of reinforcement material are stacked
in a particular pattern in order to obtain the desired
properties in the resulting composite material. These layers
are termed as plies or laminates.
The Laminates may be composed of reinforcement
materials including
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
• Woven
• Non woven
• Matt
• Braided
• Fiber reinforced
• Uni-directional fibers
The advantages of laminated composites includes a
relatively well defined arrangement of the fibres in the final
composite material, higher fiber to volume ratio, higher
strength where as their disadvantages includes relatively
poor thickness properties and problems of process induced
deformations. The unidirectional fibers are mostly used in
the form of pre-preg for carbon/epoxy and in the form of
non-crimp fabric in case of glass/polyester.
3.2 3-D Composites: The textile preforms can be
broadly classified as two- and three-dimensional on the
basis of degree of reinforcement in the thickness direction.
But the three-dimensional textile performs are more
attractive as they offer the benefit of near net shape
manufacturing with improved damage tolerance.
Three-dimensional textile preforms are basically the fully
integrated continuous-fiber assemblies with multi-axial in-
plane and out-of-plane fiber orientations. The composites
which are reinforced with three-dimensional preforms
provides several distinct advantages which are not realized
in traditional laminates. Firstly, due to the out-of-plane
orientation of some fibers, the three dimensional preforms
provide enhanced stiffness and strength in the thickness
direction. Secondly, the fully
integrated nature of fiber arrangement in three dimensional
preforms eliminates the inter laminar surfaces characteristic
of laminated composites. The superior damage tolerance of
three-dimensional textile composites based upon polymer,
metal and ceramic matrices has been demonstrated in
impact and fracture resistance. Third, the technology of
textile performing provides the unique opportunity of near-
net-shape design and manufacturing of composite
components and, hence, minimizes the need for cutting and
joining the parts. The potential of reducing manufacturing
costs for special applications is high. The overall
challenges and opportunities in three-dimensional textile
structural composites are very fascinating. As shown in Fig.
1, three-dimensional preforms can be further classed by
their manufacturing techniques: woven, non-woven,
knitted, braided and stitched.
Fig. 1. 3-D Textile performs
800
ISBN: 978-81-924893-0-8
The design of a composite structural component illustrates
which fiber preform manufacturing technique should be
employed.
3.2.1. Woven Preform
The most widely used textile manufacturing technique,
weaving accounts for nearly 70%
of the two-dimensional fabric produced. The weaving
process is suited for the production of panels and woven
fabric textiles have been used for a number of years in two-
dimensional laminated composites. However, these
composites had poor impact resistance, delaminating
strength and, since typical two-dimensional weaves only
possess fibers in the 0⁰ ie warp and 90⁰ ie. weft or filler
directions, reduced in-plane shear properties. To improve
the impact and inter laminar properties, through-the-
thickness reinforcement material was required. This
reinforcement was achieved by angle-interlock weaves
which use fibers to either weave together all fabric layers
ie. through-the-thickness interlock or weave together
adjacent fabric layers ie. layer-to-layer interlock. Although
this caused an increase in the through-the thickness
properties, these preforms still had poor in-plane shear
resistance since the in-plane fibers are only in the warp and
weft directions. Thus, In order to improve the in-plane
shear characteristics O€-axis (bias) fibers were needed and
there has been several multi-axial 3- D weaving techniques
developed to introduce bias fiber layers. Fig 2 Shows some
of 3-D woven designs.
Fig.2. 3-D woven designs.
3.2.2 Stitching/nonwoven preform: Stitching
is the simplest technique of fabricating 3-D textile
performs. However, stitching also causes significant in-
plane fiber damage that results in a degradation of the in-
plane mechanical properties of the composite. On the other
hand, By using a non-woven through-the thickness
reinforcement can be introduce without causing significant
in plane fiber damage.
3.2.3 Knitted Preform: Knitting is an inherently
fast process with which multi-axial fabrics can be produced
on commercially available multi-axial warp knitting
machines. Several three-dimensional knitted fabrics are
also produced by using knitting needles to stitch together
the in-plane fibers that can be oriented at 0̊⁰ and 90⁰.
3.2.4 Braiding: The braiding is quite suitable for the
production of cylinders, rods, beams of various cross
sections and more elaborate structures when coupled with
the use of a mandrel. Track and column braiding processes
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
such as two-step, four-step and multi step have all been
successfully used to produce a variety of performs.
Produced by intertwining three or more yarn groups in a
maypole type fashion, traditional solid braiding has been
limited to simple cross-sectional shapes. However, recent
advances have allowed for the production of complex 3-D
shapes.
4. Selection of Resin/ Matrix Materials
The composites can be classified into two categories
depending upon the type of resin used:
4.1 Thermoplastic composites
These are the composite materials with thermoplastic resin
like polyester, HDPE etc. However, they are lesser used as
high-tech materials due to their higher viscosity which
cause problem during their penetration into the
reinforcement. Their manufacturing requires the equipment
which may withstand at high temperature and pressure
conditions that causes an increase in the manufacturing
cost. However, they offer some advantages such as non
toxicity and recyclability.
4.2 Thermosetting composites
These are the composites in which thermosetting polymers
like epoxy, unsaturated polyester and vinyl-ester are used
as resin. These are most used type of composites materials
in automotive, naval, aeronautical and aerospace
applications. They are preferred over thermoplastic resin
due to their lesser viscosity thermoplastics which help them
to penetrate in reinforcement easily even at room
temperature. Moulding equipments used are relatively
cheaper as there is no need to rise till very high temperature
and pressure. However, the disadvantage is that they are
toxic, non-recyclable and lesser availability for penetration
time once polymerization starts.
5. Applications and Advantages of Textile
Structural composites
The worth of textile composites originates from many
advantages, such as speed and ease of manufacture of even
complex components, consequent economy compared to
other composite materials, and out-ofplane reinforcement
that is not seen in traditional laminated composites. Further,
textile composites do not lose the classically valued
advantage that composite materials possess over their metal
or traditional counterparts, in that textile composites have
an inherent capacity for the material itself to be adapted to
the mechanical needs of the design. This is to say that the
strength and stiffness of the material can be oriented in
needed directions, and no material weight is wasted in
providing reinforcement in unnecessary directions. For a
conventional laminated composite, this is accomplished by
oriented stacking of layers of unidirectional resin
impregnated fibers, such that fibers are aligned with any
preferred loading axes. A textile composite may also be so
adapted by several methods including unbalanced weaves.
The woven fiber tows in a preferred direction may be larger
(containing more constituent fibers per tow) than in other
directions. Also, an extremely diverse set of woven or
braided patterns may be employed, from a simple 2D plain
801
ISBN: 978-81-924893-0-8
weave to an eight-harness satin weave or a 3D orthogonal
weave pattern, any of which may exhibit a useful bias in
orientation of material properties. The economy of textile
composites arises mainly from the fact that manufacturing
processes can be highly automated and rapidly
accomplished on loom and mandrel type machinery. This
can lead to easier and quicker manufacture of a finished
product, though curing times may still represent a weak
link in the potential speed of manufacture. Composite
materials have been used for the past 30 years in many
sectors such as aeronautics, space, sporting goods, marine,
automotive, ground transportation and off-shore. Due of
their high stiffness and strength at low density, high
specific energy absorption behavior and excellent fatigue
performance these materials have emerged in such areas.
6. Conclusion
Thus, The Textile Composite are composed of a matrix
material which surrounds and supports the fiber re-
enforcement material and the re-enforcement material itself
imparts its special characteristics to the matrix material in a
composite structure. The unique combination of two
material components leads to singular mechanical
properties and superior performance characteristics not
possible with any of the components alone. Additionally
composite materials are often overwhelmingly superior to
other materials (e.g. metals) on a strength-to-weight or
stiffness-to-weight basis. With this reassurance, the range
of applications for composite materials appears to be
limitless. With the advances in textiles and polymer
technology, textiles reinforced composites have attracted a
substantial amount of interest. When coupled with a cost-
effective manufacturing method such as resin-transfer
molding, two- and 3-D textile preforms offer the potential
of low cost, mass-produced composite structures.
REFERENCES
[1]. Nicolas Chretien, Numerical Constitutive Models Of
Woven And Braided Textile Structural Composites,
MS Thesis, Blacksburg,Virginia.
[2]. Composite materials Wikipedia.
[3]. Adanur Sabit, Wellington Sears Handbook of
Industrial Textiles, Technomic Publishing Co. Inc
[4]. Tsu-Wei Chou, Microstructural Design of Fiber
Composites, Cambridge Solid State Science Series
[5]. Technical yarns and textiles handbook.
Food Technology
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Effect of plasticizer on the properties of pellets made
from agro-industrial wastes
Shumaila Jan Kulsum Jan
Department of Food Department of Food
Engineering and Engineering and
Technology Technology
SLIET, Longowal- SLIET, Longowal-
148106 (India) 148106 (India)
kulsumnissar@gmail.co kulsumnissar@gmail.co
m m
ABSTRACT
Extruded pellets were made based on deoiled rice bran and
paddy husk using glycerol and cashew nut shell liquid as
plasticizer. Effects of incorporation level of glycerol levels
(GL, 6 to 14 %) and cashew nut shell liquid (CNSL, 6 to
14%) on the physical and functional characteristics of
extruded pellets based on deoiled rice bran and paddy husk
powders were studied. For A3 (12% GL) samples radial
expansion (RE- 1.08), bulk density (BD-0.892 g/cm3), water
solubility index (WSI-13.000%), water binding capacity
(WBC -4.785%) and hardness (HD-498.253 N) were
observed. However, in case of B3 (12% CNSL), radial
expansion (RE-1.202), bulk density (BD-0.892 g/cm3), water
solubility index (WSI- 15.037 %), water binding capacity
(WBC-5.237) and hardness (HD- 495.027 N) were observed.
Results indicated that GL and CNSL had a significant effect
on physical and functional properties. The results suggest that
deoiled rice bran and paddy husk powder can be plasticized
with glycerol and cashew nut shell liquid for the development
of durable pellets using extrusion technology.
General Terms
Biodegradable pellets, extrusion, injection molding.
Keywords
Cashew nut shell liquid, Glycerol, physical and functional
properties.
1. INTRODUCTION
Extrusion cooking as a continuous cooking, mixing,
and forming process, is a versatile, low cost, and very
efficient technology in food processing. During extrusion
cooking, the raw materials undergo many chemical and
structural transformations, such as starch gelatinization,
protein denaturation, complex formation between amylose
and lipids, and degradation reactions of vitamins, pigments,
etc. [1]. Technologies like extrusion have found its application
in other sectors like packaging technology (pellets for film
and molded product development) besides being used for
development of food products. The thermal energy generated
by viscous dissipation during extrusion, combined with
shearing effect, quickly cooks the raw mixture so that the
properties of materials are modified due to physico-chemical
changes of the biopolymers [2]. Polymers from renewable
resources have attracted an increasing amount of attention
over the last two decades, predominantly due to two major
reasons: firstly environmental concerns, and secondly the
realization that our petroleum resources are finite. Generally,
polymers from renewable resources contain natural polymers,
802
ISBN: 978-81-924893-0-8
C.S.Riar D.C.Saxena
Department of Food Department of Food
Engineering and Engineering and
Technology Technology
SLIET, Longowal- SLIET, Longowal-
148106 (India) 148106 (India)
kulsumnissar@gmail.co kulsumnissar@gmail.co
m m
such as starch, protein and cellulose. The demand for
relatively inexpensive sources of protein, which can be used
as a value added products is increasing in recent years [3]. As
one of the important renewable and abundant resources,
protein has attracted much attention in the field of packaging
due to its biodegradability [4]. Deoiled Rice bran (DOB) is a
valuable source of inexpensive protein, contains about 12-
20% protein [5] and is an underutilized agro industrial by-
product [6]. Proteins are highly complex polymers, and
constituents are linked via substituted amide bonds. Due to the
complexity in their composition and structure, proteins
possess multiple function properties; such as solubility,
gelation, elasticity, emulsification, and cohesion-adhesion [7]
and Damodaran [8] have reported that protein have an ability
to interact with the neighbouring molecules and form a strong
cohesive, viscoeleastic sheets and composites that can
withstand thermal and mechanical motions [9]. Manisha [10]
developed extruded pellets with proteins isolated from
Deoiled Rice Bran for the development of biodegradable
molded sheets and determined the effect of glycerol on the
properties of the sheet.
Paddy husk is one of the major agricultural residues
produced during rice processing containing cellulose in
similar amounts with wood [11]. Usually paddy husk has been
a problem for rice farmers due to its resistance to
decomposition in the ground, difficult digestion, inadequate
final disposal (burning) and low nutritional value for animals
[12,13]. According to Martiferrer [14] the lignin and
hemicellulose contents of paddy husk are lower than wood.
For this reason paddy husk can be processed at higher
temperatures than wood. Therefore, the use of paddy husk in
the manufacture of biodegradable pellets using extrusion
technology is attracting much attention. Simone [12] has
successfully developed biodegradable thermoplastics
composites by melt extrusion using paddy husk flour as filler
and found that density of composites slightly increased with
filler. The group of Yang [15, 16, 17] has published many
studies dealing with paddy husk composites. They observed
that tensile and impact strengths (notched and unnotched
specimens) decreased with increasing filler loading while the
elastic modulus increased. Han [18] determined the possibility
of using lignocellulosic materials as reinforcing fillers in the
thermoplastic polymer composite, and found that paddy husk
could be utilized as biodegradable filler at end of-use in
polymeric materials to minimize environmental pollution.
In view of the vast availability of these two types of
by-products and waste materials: extruded pellets were
developed and characterized. Moreover, no research till date
has been published on pellets developed from these two
biodegradable agro industrial wastes using GL and CNSL as
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

plasticizer. Hence, the main aim was to study the aspects

related to the effect of the different types of plasticizer on the 2.4. Bulk density (BD)
properties of the pellets and to establish correlations between Bulk density was calculated according to the
these properties. method of Alvarez [20]. About 10 pieces of extrudates were
used to determine the bulk density.
2. MATERIALS AND METHODS
2.1. Procurement of raw material: BD (g/cm3) = (2)
Deoiled rice bran (DOB) used for the present study was Where m is mass (g) of an extrudate with L (cm)
kindly donated by M/s. AP Solvex Ltd., Dhuri (Punjab, India) length and d (cm) diameter.
which contain high level of protein. Glycerol, used as a
reference plasticizer in this study was of analytical grade 2.5. Static coefficient of friction (COF) and Angle
(M/s. Merck Specialities Pvt. Ltd., Mumbai, India). Other
plasticizer used in this study was CNSL which was kindly
of repose (AR)
The static coefficient of friction and angle of repose
donated by M/s. Allen Petrochemicals Pvt Lt., Meerut (India).
was calculated according to the method of Maurice [21]. The
Paddy husk (PDH) was also provided from M/s. AP Solvex
Ltd., Dhuri. Paddy husk and DOB was ground in a Laboratory static coefficient of friction ( ) is calculated from the
grinding mill (M/s. Philips India Limited, Kolkata, India) and following equation:
passed through screen (80 mesh) to obtain fine powder. µ = tanα (3)
The angle of repose is derived from the following
2.2 Extrusion process for the preparation of pellets
In the blend preparation, DOB, PDH, CNSL and GL equation (4)
were used. Different formulations used for different samples Where, H and D are the height and diameter of the
are tabulated in Table. 1. The moisture was adjusted to 10%. heap, respectively.
All the ingredients were weighed and then mixed in a Hobart
mixer (M/s. Continental Equipment India Pvt. Ltd, Delhi, 2.6.Water binding capacity (WBC) and water
India) for 20 min at 328 rpm using sigmoid shape blade. This solubility index (WSI)
mixture was then passed through an 80 mesh sieve to WBC and WSI were estimated as per the method described by
eliminate the lumps formed due to addition of moisture. After Anderson [22].
mixing, samples were stored in polyethylene bags at room
temperature for 24h.
Extrusion was performed using a co-rotating twin-
WBC=
screw extruder (M/s. Basic Technology Pvt. Ltd., Kolkata,
India). Screw speed was set at 277 rpm and extrusion was
done for different samples. The specific mechanical energy
(SME) of extrusion was calculated as WSI =
SME = (ω/ωr) x (τ/100) x (Zr/Q) (1) ×100
where ω is screw speed, ωr is the rated screw speed,
τ is percent torque, Zr is rated power and Q is the feed rate. 2.7. Hardness
Screw speed was set at 274 rpm, feed rate at 107.5 g/min, Texture profile analysis (TPA) of all the extruded
barrel temperature at 110oC and rated power was 4755.75 hp. puffs was performed in triplicate using Texture analyzer (TA-
Table 1. Formulations and specific mechanical energy of X2Ti, Stable Microsoft System, UK). Hardness (N) of the
the pellets samples was recorded by analysing the TPA graph using the
Code DOB PDH GL (%) Water SME kJ/Kg Texture Exponent 32 software (Stable Microsoft system, UK).
(%) (%) (%) Hardness was determined by placing five pellets from each
A1 50 50 6 10 27.064 sample on the platform of the analyzer with a probe SMS –
A2 50 50 10 10 36.085 P/75 – 75mm diameter at a crosshead speed of 2 mm/sec with
36.085 a target mode of 2 mm distance. The compression generates a
A3 50 50 12 10
curve with the force over distance. The highest first peak
A4 50 50 14 10 45.106 value was recorded as this value indicated the first rupture of
DOB PDH CNSL Water pellet at one point and this value of force was taken as a
Code SME kJ/Kg
(%) (%) (%) (%) measurement for hardness [23].
B1 50 50 6 10 23.064
B2 50 50 10 10 31.085 2.8. Statistical analysis
B3 50 50 12 10 30.085 Statistical analysis was conducted using a
B4 50 50 14 10 38.995 commercial statistical package, Design-Expert version 6.0.10
(Stat-Ease Inc., Minneapolis, USA). The analyses of extruded
samples were conducted in triplicates.
2.3. Radial expansion
The ratio of diameter of extruded pellet and the
diameter of die was used to express the radial expansion of
3. RESULTS AND DISCUSSION
extruded pellet [19]. The diameter of extruded pellets was The proximate analysis of DOB revealed 8.09%
determined as the mean of 10 random measurements made moisture, 14.69% protein, 0.69% fat, fiber 8.75% and 8.42%
with a Vernier calliper. The radial expansion ratio was ash. The chemical composition of rice husk is similar to that
calculated using the following formulae: of many common organic fibers and it contains of cellulose
Radial Expansion ratio = 40-50 %, lignin 25-30 %, ash 15-20 % and moisture 8- 15 %
Extrudates’ diameter/die diameter [24].

803
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 2 Effect of plasticizer on functional properties of

3.1 Specific mechanical energy (SME) pellets
As shown in Table 1, the SME increased with the Functional Properties of Formulations
concentration of plasticizer in the formulation for both the A1 A2 A3 A4

WBC ( %)
cases. This is due to the increased consistency of the feed with 3.395±0.12 3.734±0.10 4.785±0.11 4.795±0.42
the increased concentration of plasticizer (increased B1 B2 B3 B4
viscosity). Similar effects were observed for SME by Andreas 4.785±0.11 4.965±0.16 5.237±0.46 6.355±0.16
[25] wherein they reported lowest SME for lowest glycerol
content. A1 A2 A3 A4
1.200±0.05 1.09±0.02 1.08±0.27 1.010±0.53

RE
3.2. Radial expansion (RE) B1 B2 B3 B4
The range of expansion was between 1.200 to 1.010 1.390±0.25 1.284±0.54 1.202±0.48 1.170±0.57
in case of (A) samples and 1.390 to 1.170 for (B) samples
(Table 1). It was observed that expansion decreased with the A1 A2 A3 A4

increase in the amount of plasticizer for both the samples (A
and B) this behaviour can be attributed to the increased
binding properties of the plasticizers with the particles at
elevated levels. Moreover, this behaviour can also be
attributed to the effect of the temperature and shear on the
expansion of the pellets [26]. Another reason may be due to
the amount of high protein content in DOB and high fiber
contents in paddy husk. Proteins affect the RE through their
ability to influence water distribution in the matrix and
through their macromolecular structure that affects the
extensional properties of the extruded melts [26]. Onwulata
and co-workers [27] investigated the effects of whey protein
concentrate and isolate on the extrusion of corn and rice starch
and reported a reduction in expansion at higher concentrations
of protein. This may be due to modification in the viscoelastic
properties of the dough as a result of competition for the
available water between the starch and protein fractions,
leading to a delay in starch gelatinization and a lower
expansion in the products.
3.3. Water solubility index (WSI)
In this experiment the WSI ranged from 17.120 to
20.880 % for (A) samples and 16.270 to 19.542 % for (B)
samples (Table 1). There was an inverse relation of the water
binding capacity and the water solubility index of the pellets
and pots. William [28] also shows that water solubility index
is inversely proportional to water absorption index. It was also
observed for both the cases that there was a significant rise in
the WSI with the increase of the plasticizer upto 10% which
then reduces for sample A3 and B3 this behaviour can be
attributed to the binding effect of the plasticizer at the
particular percentage.
3.4. Water binding capacity (WBC)
The increase in the amount of plasticizers (from 6 to
14%) increases water binding capacity from 3.395 to 4.795%
in case of ‘A’ samples and 4.785 to 6.355 % for B samples.
This behaviour may be attributed to the hygroscopic nature of
the plasticizer (Table 1). Another reason may be due to the
presence of fiber and protein in PDH and DOB respectively.
The water absorption is the characteristic feature of fiber
supplemented powders as reported by several researchers [29,
30]. Fibre may interact with water by means of polar and
hydrophobic interactions, hydrogen bonding and enclosure.
The results of these interactions vary with the flexibility of the
fiber surface [31]. This may due to the hydrophilic and
hygroscopic nature of the plasticizers and forming the large
hydrodynamic plasticizer-water complex [32]. Moreover,
number of hydroxyl group which exist in the fibre structure is
mainly caused by water, allowing absorption and interaction
through hydrogen bonding [33].
WSI (%)
17.120±0.28 17.591±0.53 13.000±0.55 20.880±0.94
B1 B2 B3 B4
16.270±0.54 16.481±0.24 15.037±0.65 19.542±0.27
All the values are Mean ± SD, WBC: water binding capacity,
WSI: water solubility index, RE: radial expansion
3.5. Bulk density (BD)
The density of extrudates varied between 0.593 and
0.975 g/cm3 for (A). However, for B samples observed results
in the range of 0.589 to 0.735 g/cm3 (Table 2). There is an
obvious increase of bulk densities of biodegradable pellets
which indicates that the extruded biodegradable pellets bear a
good compaction and in turn a dense product [34]. Good
compaction may be due to the plasticizers used for binding
purpose. Highest value was observed for A4 (0.975 g/cm3)
and B4 (0.735 g/cm3). Lowest values were observed in
sample A1 (0.593 g/cm3) and B1 (0.589 g/cm3).
3.6. Static coefficient of friction (COF) and Angle
of repose (AR)
The static coefficient of friction on stainless steel
for both the samples decreased with the increase in processing
temperature as shown in (Table 3). As the plasticizer increases
surface of the pellets becomes smoother and in turn apply less
friction towards the surface. Correa [35] reported similar
results for rice grains applying less friction onto the surfaces.
The angle of repose (Table 3) for both the samples
did not show significant change but there was an increase in
the values upon increasing the amount of plasticizer. The
parameter is important in proper design of hoppers to
maintain continuous flow of the pellets, which must be larger
than the pellet’s angle of repose.
3.7. Hardness (HD)
The range of HD was found to be in between
439.805 to 460.897 N for A samples and 392.454 to 487.044
N for B samples (Table 1). For HD the increase in the
plasticizer amount showed a significant effect on pellets. This
could be attributed to the lower expansion of products leading
to increased HD as observed from expansion values, due to
increased binding effects of plasticizer and high protein/ fiber
in DOB and PDH. As proteins affect the RE through their
ability to influence water distribution in the matrix and
through their macromolecular structure and conformation that
affects the extensional properties of the extruded melts [26].

804
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 3 Effect of plasticizer on physical properties of concentration and temperature. Journal of Cereal Science, 60,
pellets 514-519.

[4] Cuq, B., Gontard, N. & Guilbert, S. 1998. Proteins as

Physical Properties of Formulations agricultural polymers for packaging production. Cereal
A1 A2 A3 A4 Chem., 75, 1-1.
BD (g/cm3)

0.593±0.76 0.689±0.85 0.892±0.43 0.975±0.43

[5] Hamada, J.S. 2000. Characterization and functional
B1 B2 B3 B4
properties of rice bran protein modified by commercial
0.589±0.85 0.591±0.43 0.697±0.43 0.735±0.54 exoproteases and endoproteases. J. Food Sci., 65, 305-310
A1 A2 A3 A4 [6] Yoon, J.I, Shin., Sung-AE, J., & Kyung, B. S. 2011.
HD (N)

439.805±0.02 448.583±0.16 498.253±0.16 460.897±0.08 Preparation and Mechanical Properties of Rice Bran
B1 B2 B3 B4 Protein Composite Films Containing Gelatin or Red Algae.
392.454±0.14 448.592±0.05 495.027±0.15 487.044±0.14 Food Sci. Biotechnol. 20(3): 703-707
A1 A2 A3 A4 [7] Zhang, W. & Xu, S.Y. 2003. Food chemistry, 3rd edn.
0.613 0.597 0.522 0.454
COF

China Light Industry Press, Beijing, pp 267–302

B1 B2 B3 B4
0.574 0.568 0.561 0.555 [8] Damodaran, S. 1994. Protein functionality in food
system. Marcel Dekker, New York, pp 1–38
A1 A2 A3 A4
25.641 38.234 45.000 46.397 [9] Phillips, M.C. 1981. Food Technol, (Chicago), 35:50.
AR

B1 B2 B3
33.690 36.607 37.117
All the values are Mean ± SD
BD: bulk density, HD: hardness, COF: coefficient of friction,
AR: angle of repose
4. CONCLUSION
The responses for pellets include RE, BD, WSI,
WAI and hardness were affected by both GL and CNSL. It
was concluded that the studies on the properties of the
biodegradable pellets and ingredients used for their
production can be helpful in designing of equipments for
further processing of these pellets (injection molding).
Amount of plasticizer and extrusion temperature showed
significant effect on functional and physical properties. The
findings of this study investigated the feasibility of developing
value added products (pots) from mixture of DOB and PDH
with in combination GL and CNSL by extrusion processing.
B4
43.452 [10] Manisha, J., Srivastava, T. & Saxena, D.C. 2012.
Extrusion processing of Deoiled rice bran in the
development of biodegradable molded sheets. Scholarly
Journal of Agricultural Science, 2: 163-178.
[11] Yang, H.S., Kim, H.J., Son, J., Park, H.J, Lee, B.J. &
Twang, T.S. 2004. Rice-husk flour filled polypropylene
composites; mechanical and morphological studies.
Composite Structures., 63, 3-4, 305-312.
[12] Simone, M., Leal, R., Evelise, F. S., Carlos, A, F., &
Sonia, M.B. N. 2009. Studies on the Properties of Rice-Husk-
Filled-PP Composites – Effect of Maleated PP. Materials
Research, 12, 3, 333-338,
[13] PIVA, A.M., Steudner, S.H. & Wiebeck, H. (2004):
Physico-mechanical properties of rice husk powder filled
polypropylene composites with coupling agent study. In:
Proceedings of the Fifth International Symposium on Natural
Polymer and Composites; Sao Pedro/SP, Brazil

ACKNOWLEDGMENT [14] Marti-Ferrer, F., Vilaplana, F., Ribes-greus, A.,

This work was financially supported by Council of Scientific
and Industrial Research (CSIR), MHRD, Govt. of India.
REFERENCES
[1] Ilo, S., Tomschik, U., Berghofer, E. & Mundigler, N.
1996. The effect of extrusion operating conditions on the
apparent viscosity and the properties of extrudates in twin-
screw extrusion cooking of maize grits. Food Science and
Technology, 29(7), 593–598.
[2] Jan K, Riar CS, Saxena DC (2014) Mathematical
Modelling of Thin Layer Drying Kinetics of Biodegradable
Pellets. J Food Process Technol 5: 370. doi:10.4172/2157-
7110.1000370
[3] Ali, R., Seyede, S. M. & Seyed, A. S. 2014. Dynamic
rheological behavior of rice bran protein (RBP): Effects of
Benedito-Borras, A., & Sanz-Box, C. 2006. Flour rice husk as
filler in block copolymer polypropylene: Effect of different
coupling agents. Journal of Applied Polymer Science, 99, 4,
1823-1831.
[15] Yang , H.S, Kim, H.J, Park, H.J, Lee, B.J & Twang, T.S.
(a). (2006): Water absorption behavior and mechanical
properties of lignocellulosic filler-polyolefin bio-composites.
Composite Structures. 72, 4, 429-437.
[16] Yang HS, Kim HJ, Park, HJ, Lee B.J. & Hwang TS. (a)
2007. Effect of compatibilizing agents on rice –husk flour
reinforced polypropylene composites. Composite Structures.
77(1):45-55.
[17] Yang, HS., Wolcott, M.P, Kim, H.S, Kim, S. & Kim,
H.J. (b). 2006. Properties of lignocellulosic material filled
polypropylene bio-composites made with different
manufacturing processes. Polymer Testing. 25(5):668-676.

805
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[18] Han-Seung, Y., Hyun-Joong K., Jungil, S., Hee-Jun, P.,
Bum-Jae, L., Taek-Sung, H. 2004. Rice-husk flour filled
polypropylene composites; mechanical and morphological
study. composite structures, 63, 305–312.
[19] Fan, J., Mitchell, J.R. & Blanchard, J.M.V. 1996. The
effect of sugars on the extrusion of maize grits: I. The role of
the glass transition in determining product density and shape.
International Journal of Food Science and Technology, 31,
55– 65.
[20] Alvarez-Martinez, L., Kondury, K.P. & Karper, J.M.
1988. A general model for expansion of extruded products.
Journal of Food Science, 53, 609–615.
[21] Maurice A. C. 1970. Experiments on the angles of repose
of granular materials, Sedimentology, 14 147-158
[22] Anderson, R.A., Conway, H.F., Pfeifer, V.F. & Griffin,
E.L. 1969. Gelatinization of corn grits by roll and extrusion
cooking. Cereal Science Today, 14, 4–12.
[23] Stojceska, V., Ainsworth, P., Plunkett, A., Ibanoglu, E. &
Ibanoglu, S. 2008. Cauliflower by-products as a new source of
dietary fibre, antioxidants and proteins in cereal based ready
to- eat expanded snacks. Journal of Food Engineering, 87,4,
554-563.
[24] Hwang, C.L. & Chandra, S. 1997. The Use of Rice Husk
Ash in Concrete. Waste Materials Used in Concrete
Manufacturing. Edited: Chandra, S., Noyes Publications,
USA, p. 198.
[25] Andreas R, Marie H M, Joelle B, Stephane G, Bruno V.
1999. Rheological properties of gluten plasticized with
glycerol: dependence on temperature, glycerol content and
mixing conditions. Rheol Acta, 38: 311-320.
[26] Moraru, C.I. & Kokini, J.L. 2003. Nucleation and
Expansion During Extrusion and Microwave Heating of
Cereal Foods. Comprehensive reviews in food science and
food safety, 2.
806
ISBN: 978-81-924893-0-8
[27] Onwulata, C.I., Smith, P.W., Konstance, R.P., Holsinger,
V.H., 2001. Incorporation of whey products in extruded corn,
potato or rice snacks. Food Research International, 34, 679–
687.
[28] Williams, M.A., Horn, R.E. & Rugula, R.P. 1977.
Extrusion: An indepth look at a versatile process. I. J. Food
Eng., 49(10), 87-89.
[29] Dreese P.C. & Hoseney R.C. 1982. Baking properties of
bran fractions from brewer’s spent grains. Cereal Chemistry
59, 89–91.
[30] Haridas R.P. & Hemamalini R., 1991. Effect of
incorporating wheat bran on rheological characteristics and
bread making quality of flour. Journal Food Science and
Technology, 28, 92–97.
[31] Gamlath, S. & Ravindran G. 2009. Extruded products
with Fenugreek (Trigonella foenum-graecium) chickpea and
rice: Physical properties, sensory acceptability and glycaemic
index. Journal of Food Engineering, 90, 44–52.
[32] Krochta, J.M. 2002. Proteins as raw materials for films
and coatings: definitions, current status, and opportunities.
Protein-based films and coatings. 1-41.
[33] Sudha, M.L., Vetrimani, R. & Leelavathi, K. 2007.
Influence of fibre from different cereals on the rheological
characteristics of wheat flour dough and on biscuit quality.
Food Chem. 100, 1365-1370.
[34] Igathinathane, C., Jaya, S.T., Sokhansanj, S., Bi, X., Lim,
C.J, Melin, S. & Mohammad, E. 2010. Simple and
inexpensive method of wood pellets macro-porosity
measurement. Bioresource Technology, 101, 16, 6528–6537
[35] Correa, P. C., Schwanz, F., Silva, D.A., Jaren, C.,
Afonso, P. C., Junior., & Arana, I. 2007. Physical and
mechanical properties in rice processing. J. Food Engg.,79,
137–142.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Textural and Microstructural Properties of Extruded
Snack prepared from rice flour, corn flour and deoiled
rice bran by twin screw extrusion
Renu Sharma Raj Kumar
Deptt. of Applied Deptt. of Applied
Sciences BGIET, Sciences, PTU,
Sangrur, jalandhar
renu.sharma6286@g raj.scientia@gmail.co
mail.com m in
ABSTRACT
Rice flour, corn flour and deoiled rice bran blends were used
to prepare ready-to-eat extrudates at barrel temperature
(1100C, 1200C and 1300C) and moisture content (14%, 15%
and 16%). A three-level, two-factor central composite
rotatable design was employed to investigate the effect of
temperature and feed moisture content and their interactions,
on the mechanical hardness of extruded product. It was found
that the increase in feed moisture content leads to increase in
hardness of extrudates while increasing temperature leads to
decrease in hardness of product. A numerical optimization
technique was used to obtain compromised optimum
processing conditions of barrel temperature (1200C) and
moisture content (15%). A good agreement between the
predicted (14.91N) and actual value (15.105N) of the response
confirms the validation of RSM model. The surface
morphology of extrudates, examined through scanning
electron microscopy (SEM) showed large number of sheared
and flattened granules at varied temperature. The more
damage of starch granules was observed at higher temperature
i.e. at 1300C.
Keywords
RSM, barrel temperature, hardness, SEM, extruded product.
1. INTRODUCTION
Cereals and starch-based products provide a large proportion
of energy to all the humans. Besides, providing energy, starch
also contributes to the texture as well as the structure of the
food that we consume. The textural as well as the functional
properties of the final product depends upon the
gelatinization, molecular degradation and/or reassociation of
the raw material [1]. The technology of extrusion cooking is
no exception. The extrusion technology is growing day by day
because of its versatility and economical production. It
produces variety of food products with attractive texture, size
and shape [2]. It can be considered as continuous cooking,
mixing and forming process in which raw material undergo
many chemical and structural transformations. In the food
industry, the extrusion cooking plays a significant role and
considered as efficient technology for the production of
breakfast cereals, baby foods, flat breads, snacks, meat and
cheese analogues and modified starches, etc. [3,4].
The process of food extrusion is very complicated process in
which small variations in the processing conditions affect
process variables as well as the quality of final product [5].
The use of extruders has widened the scope of extrusion
technology. Due to several advantages, the twin screw
807
ISBN: 978-81-924893-0-8
Tanuja Srivastava D.C. Saxena
Deptt. of Food Deptt. of Food Engg.
Technology BGIET & Tech.SLIET,
Sangrur Longowal
tanusriva@yahoo.co. dcsaxena@yahoo.
com
extruders used to large extent for the production of starch
based food products as compared to single screw extruders.
Inspite of high cost and complexity, twin screw extruders,
allows greater flexibility of operating conditions for the
achievement of desired time, temperature and shear history
for the processed material [6]. The product coming out of the
extruder depends upon several factors like type of raw
material, moisture content of raw feed, temperature of the
barrel section, screw speed, type of extruder, screw
configuration etc. [7]. A lot of work has been reported on
extrusion cooking of rice flour. It remains an attractive
ingredient in extrusion industry, due to its ease of digestion,
attractive white colour and hypoallergenicity [8]. It is the most
important cereal product used as staple food for many
populations over the worldwide. The major product obtained
during rice milling is 70% rice (endosperm) and remaining are
by-products consisting of 20% rice husk, 8% rice bran and 2%
rice germ [9-11].
During de-husking and milling of paddy, the brownish portion
of rice taken out in form of fine grain, is the rice bran which is
nearly 8% of milled rice [12, 13]. Rice bran is highly
nutritious compound. It contains micronutrients like
oryzanols, tocopherols, tocotrienols, phytosterols which
comprises of vitamin E and exhibit significant antioxidant
activity. Rice bran also contains 20% oil, 15% protein, 50%
carbohydrates (mainly starch), dietary fibers like pectin, beta-
glucan and gum [14-17].
In the earlier times, rice bran was used as either fertilizer or
animal feed. But in these days, it is used for extraction of oil
namely rice bran oil (RBO) [9, 18, 19]. Rice bran is rich in
proteins, dietary fiber and bioactive compounds [20] that help
in reducing the risk of coronary heart disease. It helps in
lowering blood cholesterol [21, 22], decrease of
arthrosclerosis disease [23] and it posses laxative effect [20].
The substitution of rice bran in food products will increase the
nutritional value as well as provide health benefits to
consumers. Deoiled cake, a residue of rice bran after
extraction of oil, possesses high protein and vitamin contents.
It can be utilized to prepare functional food which keeps
humans healthy due to low fat content. So, value added,
edible food products can be obtained by utilizing defatted rice
bran through extrusion cooking.
Although, deoiled rice bran is highly nutritious compound and
possesses several health benefits, but it is still underutilized
for the development of functional foods. The research work
concerning the use of rice bran in the preparation of extruded
product is very scanty. Jadhav et al.,(2012) used deoiled rice
bran for the development of biodegradable and medium water
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

resistant agriculture planting containers by the application of plate of the die fixed by a screw nut tightened by a special
twin screw extruders [24]. Keeping in view, the nutritional wrench provided. The automatic cutting knife is fixed on
value as well as health benefits of deoiled rice bran, an rotating shaft. The extruder barrel temperature was maintained
attempt has been made to prepare ready to eat extruded at 1100c, 1200c and 1300c respectively and the moisture was
product. The functional properties of extruded product are adjusted to 14%, 15% and 16% by adding required amount of
highly dependent upon extrusion conditions and type of raw water to all the flours. The twin screw extruder was kept
material. So, in the present research work, the effect of barrel running for suitable period of time to stabilize the set
temperature (1100c-1300c) and moisture content (14%-16%) temperatures and sample were then poured in to feed hopper
on the textural properties (hardness) of the product during and the feed rate was adjusted to 4kg/h for easy and non-
twin screw extrusion cooking of deoiled rice bran and the choking operation. The die diameter of 4 mm was selected as
surface morphology of the extrudates through scanning recommended by the manufacturer for such product. The
electron microscopy have been studied. product was collected at the die end and packed in already
numbered zipped lock packets for proper storage.
2. MATERIALS AND METHODS Table 1. Values of independent variables at three levels of
the CCRD design
2.1 Materials
Ingredients for the production of highly nutritious ready-to-eat Independent variables coded Levels in uncoded form
snack food consisted of deoiled rice bran, corn flour, rice
flour. Deoiled rice bran used for present study was procured
from M/s. AP Solvex Ltd., Dhuri. Corn flour and rice flour Feed moisture (%) X1 14 15 16
were purchased from local market Sangrur, Punjab, India.
Barrel temperature (°c) X2 110 120 130
2.2 Experimental Design
Response surface methodology (RSM) was adopted in the
experimental design. [25]. The main advantage of RSM is Table 2. Central Composite Rotatable Experimental
reduced number of experimental runs needed to provide design in actual levels for extruded snacks
sufficient information for statistically acceptable result. A
three level, two factor central composite rotatable design was Independent Variables Dependent
employed. Table 1 shows independent variables and their Variables
levels which were chosen by taking trials of samples. The
ranges having good expansion are taken. Experimental Design S. Moisture Content Barrel Temperature Hardness
comprises of 13 experiments. The independent variables No. (%) 0
( C) (N)
chosen for study were barrel temperature and moisture content
of the raw material while the response variable was hardness. 1. 15.00 134.14 14.76
The three levels of the process variables were coded as -1, 0, 1 2. 14.00 130.00 11.57
[25] and experimental design in terms of actual levels is given
in Table 2. 3. 15.00 120.00 14.91
4. 16.41 120.00 18.71
2.3 Preparation of Sample
For the preparation of value added extruded product, the 5. 15.00 105.86 16.02
different powdered ingredients like rice flour, deoiled rice 6. 15.00 120.00 14.91
bran and corn flour were mixed in the 70:20:10 ratio. The feed
composition and screw speed of 300 rpm was kept constant 7. 14.00 110.00 12.78
for all the experimental runs. The moisture content of all the 8. 16.00 110.00 17.56
flours was determined before extrusion by using the hot air
oven method [26]. The required moisture was adjusted by 9. 15.00 120.00 14.91
sprinkling the stilled water to all the dry ingredients. All the 10. 15.00 120.00 14.91
ingredients were weighed and then mixed in the food
processor with mixer attachments for 20 min. This mixture 11. 16.00 130.00 19.27
was then passed through a 2 mm sieve to reduce the lumps
12. 15.00 120.00 14.91
formed due to addition of moisture. After mixing, samples
were stored in polyethylene bags at room temperature for 24h 13. 13.59 120.00 11.89
[27].

2.5 Evaluation of textural characteristics of

2.4 Extruder and Extrusion cooking
A co-rotating twin-screw extruder (G.L. Extrusion Systems
Pvt. Ltd., Delhi) having barrel with two electric band heaters
and two water cooling jackets received the raw feed from a
variable speed feeder was used. The main drive is provided
with 7.5 HP motor (400 V, 3ph, 50 cycles) and a temperature
sensor was fitted on the front die plate. The output shaft of
worm reduction gear was provided with a torque limiter
cooling. The standard screw configuration design for
processing cereals and flour-based products was used. The die
extrudates
2.5.1 Hardness
Mechanical properties of the extrudates were determined by a
crushing method using a TA – XT2 texture analyzer (Stable
Micro Systems Ltd., Godalming, UK) equipped with a 500 kg
load cell. An extrudate 40 mm long was compressed with a
probe SMS – P/75mm diameter at a crosshead speed 5
mm/sec to 3 mm of 90% of diameter of the extrudate. The
compression generates a curve with the force over distance.
The highest first peak value was recorded as this value

808
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

indicated the first rapture of snack at one point and this value significant, whereas lack-of-fit value of 0.55 was not
of force was taken as a measurement for hardness [27]. significant. The chance of large model F-value due to noise
was only 0.01%. The fit of model was also expressed by the
coefficient of determination R2, which was found to be
2.6 Statistical Analysis of Responses 0.9751, indicating that 97.51 % of the variability of the
The response (hardness) for different experimental
response could be explained by the model, whereas Adjusted
combinations was related to the coded variables (xi, i=1 and
R2 was 0.9573. Adequate Precision was 23.774 which are
2) by a second degree polynomial equation.
greater than 4 suggesting that model may be used to navigate
Y = β0 + β1x1 + β2x2 + β11x12 + β22x22 + β12x1.x2 + ε
the design space. The quadratic model for hardness (H) in
Where x1 and x2 are the coded values of moisture content of terms of coded levels of variables was developed as follows:
feed (%) and temperature of barrel (0c). The coefficients of the
polynomial were represented by β0 (constant), β1, β2 (linear H = 14.91 + 2.77 Xl – 0.16 X2 + 0.18 X12 - 0.23 X22 + 0.73
effects); β12 (interaction effects) ; β11 , β22, (quadratic effects) X1X2 …………………….. …………………………. Eq. (1)
; ε (random error). Multiple regression analysis was used for
data modeling and for each response, the statical significance
of the terms were examined by analysis of variance. Design Table 3. Analysis of variance for Hardness
expert 6.0 (version 6.0, by STAT-EASE inc., USA) was used
for statistical analysis of the data To check the adequacy of Coeff. of
the regression model, R2, Adjusted R2, Adequate Precision Sum of Mean F
and F-test were used [25]. In order to generate three Source Model DF Prob > F
squares square Value
dimensional plots for the regression model, statistical terms
calculations were made by using regression coefficients. Model 14.91 64.07 12.81 5 54.78 <0.0001***
X1 2.77 61.21 61.21 1 261.65 <0.0001***
2.7 Microstructural Analysis
X2 -0.16 0.21 0.21 1 0.88 0.3800
2.7.1 Scanning Electron Microscope (SEM)
2
Scanning electron microscope (Jeol JSM-7500, Jeol Ltd, X1 0.18 0.23 0.23 1 0.99 0.3531
Tokyo, JAPAN)) was used to view extrudate in three X22 0.23 0.36 0.36 1 1.54 0.2552
dimensions and to determine the shape and surface of
extrudate. The sample was mounted on SEM stub using X1 X2 0.73 2.13 2.13 1 9.11 0.0194**
double sided adhesive tape and was coated with platinum. An Lack of 0.55
accelerating potential of 5KV was used during micrography. Fit
R2-value 0.9751
3. RESULT AND DISCUSSION 2
Variation of response (hardness) of extrudates with Adj. R 0.9573
independent variables (moisture content and barrel Adequate 23.774
temperature) was analyzed. A complete second order Precision
quadratic model employed to fit the data and adequacy of the
model was tested to decide the variation of responses with F – value 54.78
independent variables. The analysis of variance tables were **Significant at P<0.05, *** Significant at P<0.001,
generated and the effect and regression coefficients of df: degrees of freedom
individual linear, quadratic and interaction terms were From the analysis of Equation (1), it was found that the linear
determined. The significances of all terms in the polynomial term feed moisture content (X1) has significant positive effect
were jugged statistically by computing the F-value at while barrel temperature (X2) has significant negative on the
probability (p) of 0.01 or 0.05. The regression coefficients hardness of rice flour, corn flour and rice bran extrudates. It
were then used to make statistical calculation to generate means hardness of extruded product increases with increase in
contour maps from the regression model. Optimization of moisture content of raw material while it decreases with
parameters was done by partially differentiating the model increase in barrel temperature. In this case, for the linear term
with respect to each parameter, equating zero and moisture content (X1), the F value is 261.65 and P value is
simultaneously solving the resulting functions. Design expert less than 0.0001(P<0.01), indicating term is significant. The
6.0 (version 6.0, by STAT-EASE inc., USA) was used for negative significant effect of barrel temperature on hardness
optimization of selected parameters. may be due to reduced expansion. F-value for interaction term
of feed misture and barrel temperature (X1X2) was 9.11 and p
3.1 Effect of Process Variables on value 0.0194 (P<0.1) predicting the terms are significant.
Response surface plot (Fig.1), showing that hardness
Mechanical Hardness of extrudates increased with increasing feed moisture (X1) and decreased
The textural properties of extrudates are very important
with increasing barrel temperature (X2). As temperature has
properties and are closely related to the acceptance of the
significant negative effect on hardness of extrudates.
product. Hardness and crispness of the ready-to-eat extrudates
Therefore, a crispy texture was obtained with increasing
are found to be associated with expansion and cell structure.
temperature. This result is in agreement with [28-31]. The
The instrumental method for the determination of hardness is
results are also similar to the earlier findings of Tanuja et al.,
by measuring the force (Newton) required to break the
(2014) [32]. The increase or decrease of hardness with
extrudates. In our study, hardness of the extrudates varied
moisture content and barrel temperature is shown in Fig.2 and
between 11.57 and 19.27 (Table 2). Table 3 shows the
Fig.3.
coefficients of the model and other statistical attributes of
hardness. Regression model fitted to experimental results of
hardness (Table 3) shows that model F-value of 54.78N was

809
.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3.3 Verification of results

The suitability of the model developed for predicting the
optimum response values was tested using the recommended
optimum conditions of the variables and was also used to
validate experimental and predicted value of the responses. The
optimized processing conditions for extrusion as well as results
of predicted and actual values of textural properties of
extrudates are shown in Table 4.

Table 4. Optimum Processing Conditions for extrusion.

Fig.1. Response surface plot of hardness as a function of
moisture content Optimum Processing Conditions Values of Response

19.27 .

Moisture Barrel Hardness

17.345
0
Content (%) Temperature ( C)
Hardness

15.42

13.495
Coded Actual Coded Actual Predicted Actual

11.57
Value Value
14.00 14.50 15.00 15.50 16.00

Moisture Content

0 15 0 120 14.91 15.105

Fig. 2 : Effect Moisture content upon hardness of
extrudates

3.4 Microstructural Analysis

19.27 .
Extruded samples had porous, open-celled structures. Fig.4
. shows the damage of starch molecules which takes place during
17.345
extrusion process. The extruded product show large no. of
Hardness flattened and sheared granules. Damage of granules was started
at 1100C and it was highest in case of extrusion at 1300C
15.42

followed by 1200C. The results are in agreement with the

13.495

results of Bhattacharya et al. (2005) [33]. The damage of starch

11.57
molecules increases with increase in temperature
110.00 115.00 120.00 125.00 130.00

Barrel Temp.

Fig. 3 : Effect Barrel temperature upon hardness of

extrudates

3.2 Optimization
A numerical multi-response optimization technique was applied
to determine the optimum combination of feed moisture
content, and barrel temperature for the production of extrudates
containing rice bran, rice flour and corn flour. The assumptions
were to develop a product which would have maximum score
in sensory acceptability so as to get market acceptability and
minimum hardness. Therefore, among responses, these
parameters were attempted to be maintained whereas other
parameters were kept within range. Under these criteria, the
uncoded optimum operating conditions for development of rice
bran, rice flour, corn flour extrudate were 120°C of barrel
temperature and 15% of feed moisture. The responses predicted
by the Software for these optimum process conditions resulted
hardness, 14.91N. Table 4 shows the different condition of the
constraints for optimization. Fig. 4. SEM picture of extruded product of rice, corn and
deoiled rice bran at 1100C, 1200C and 1300C

810
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
4. CONCLUSION
The process of extrusion cooking not only utilize rice milling
by-product but also add value to commercialized product with
health benefits. The application of response surface
methodology helps to interpret the relationship between the
effects of barrel temperature and moisture content of raw
material on the mechanical properties of the product. Increasing
feed moisture content leads to increase in hardness of
extrudates while increasing temperature leads to decrease of
hardness of product. Microstructural studies reveals that the
surface morphology of extrudates was also affected and the
organized structure of starch molecules modified to flattened
and sheared granules during extrusion process.
REFERENCES
[1] Guha, M. and Ali, S.Z. 2006. Extrusion cooking of
rice: Effect of amylase content and barrel temperature
on product profile. Journal of Food Processing and
Preservation, vol.30, pp.706-716.
[2] Smith, A.C., and Singh, N. 1996. New applications of
extrusion technology. Indian Food Ind., vol.15,
pp.14-23.
[3] Anderson, R.A., Conway, H.F., Pfeifer, V.E. and
Griffin, E.L. 1969. Gelatinization of corn grits by roll
and extrusion cooking. Cereal Science Today,
vol.14, pp.4-12.
[4] Meuser, F.and Van Lengerich, B. 1992. System
analytical model for the extrusion of starches. In J. L.
Kokini, C. Ho, and M. V. Larwe (Eds.), Food
extrusion science and technology New York: Marcel
Dekker. pp 619-630.
[5] Desrumaux, J.A., Bouvier, J. M. and Burri, J. 1999.
Effect of free fatty acids addition on corn grits
extrusion cooking. Cereal Chemistry, vol. 76, pp.
699-704.
[6] Gogoi, B.k., Oswalt, A.j. and Choudhury, G.S. 1996.
Reverse screw element(s) and feed composition
effects during twin-screw extrusion of rice flour and
fish muscle blends. J. Food Sci., vol.61, pp.590–595.
[7] Ding, Q.B., Ainsworth, P., Tucker, G., Marson, H.
2005. The effect of extrusion conditions on the
physicochemical properties and sensory
characteristics of rice based expanded snacks. J. food
Eng., vol.66, pp.283-289.
[8] Kadan, R.S., Bryant, R.J., & Pepperman, A.B. 2003.
Functional properties of extruded rice flours. Cereal
Chemistry, vol.68, pp.1669–1672.
[9] Van Hoed, V., Depaemelaere, G., Villa Ayala, J.,
Santiwattana, P., Verhe, R., De, et al. 2006. Influence
of chemical refining on the major & minor
components of rice bran oil. JAOCS, vol.83, pp.315-
321.
[10] De Deckere, E.A.M., Korver, O. 1996. Minor
constituents of rice bran oil as functional foods. Nutr
Rev., vol.54, pp.S120-S126.
811
ISBN: 978-81-924893-0-8
[11] Anonymus. Sea Handbook-2009. 9th ed. The solvent
extractor’s association of India: India, 885-891.
[12] Hernandez, N., Rodriguez-Alegría, M.E., Gonzalez ,
F., Lopez-Munguia, A. 2000. Enzymatic treatment of
rice bran to improve processing. JAOCS, vol.77,
pp.177-180.
[13] Takeshita, Y., Iwata, F. 1988. Recent technical
advances in rice bran oil processing (II About
refining process). Transactions of the Kokushikan
Univ, Faculty of Engineering, vol.21, pp.118-124.
[14] Wells, J.H. 1993. Utilization of rice bran & oil in
human diets. Louisiana Agriculture, vol.36, pp.4-8.
[15] Jiang, Y., Wang, T. 2005. Phytosterols in cereal by
products. JAOCS, vol.82, pp.439-444.
[16] Piironen, V., Lindsay, D.G., Miettinen, T.A., Toivo,
J., Lampi, A.M. 2000. Plant Sterols: biosynthesis,
biological function and their importance to human
nutrition. J Sci Food Agric, vol.80, pp.939-966.
[17] Hu, W., Wells, J.H., Tai-Sun, S., Godber, J.S.1996.
Comparison of Isopropanol and Hexane for
Extraction of Vitamin E and Oryzanols from
Stabilized Rice Bran. JAOCS. vol.73, pp.1653-1656.
[18] Barber, S., Camacho, J., Cerni, R., Tortosa, E.,
Primo, E. 1974. Process for the stabilization of rice
bran I Basic research studies. In Proceedings of Rice
byproducts utilization (International Conference,
Valencia, Spain), pp.49-62.
[19] Hammond, N. 1994. Functional & nutritional
characteristics of rice bran extracts. Cereal foods
world, vol.39, pp.752-754.
[20] Saunders, R.M. 1990. The properties of rice bran as a
food stuff. Cereal Foods World, vol.35, pp.632-635.
[21] Chotimarkorn, C. and Silalai. 2007. Oxidative
stability of fried dough from rice flour containing rice
bran powder during storage. LWT., vol.41, pp.561-
568.
[22] Kahlon, T.S., Chow, F.I. and Sayre, R.N. 1994.
Cholesterol lowering properties of rice bran. CFW.,
vol.39, pp.99-103.
[23] Saunders, R.M. 1985. Rice Bran: Composition and
Potential food uses. Food Rev Int., vol.1, pp.465-495.
[24] Jadhav, M., Srivastava, T., Saxena, D.C. 2012.
Extrusion process of deoiled rice bran in the
development of biodegradable molded sheets.
Scholarly Journal of Agricultural Science, vol.2,
pp.163-178.
[25] Montgomery, D.C. 2001. Design and Analysis of
Experiments. New York Wiley, pp.416-419.
[26] Ranganna, S. 1995. Handbook of Analysis and
Quality Control for Fruit and Vegetable Products,
India. Tata Mc Graw Hill Publishing Company
Limited, New Delhi.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[27] Stojceska, V., Ainsworth, P., Plunkett, A., Ibanoglu,
E., Ibanoglu, S. 2008. Cauliflower by-products as a
new source of dietary fiber, antioxidants and proteins
in cereal based ready-to-eat expanded snacks. Journal
of Food Engineering, vol.87, pp.554-563.
[28] Bhattacharya, S. and Choudhary, G.S. 1994. Twin
screw extrusion of rice flour: Effect of extruder
length-to-diameter and barley temperature on the
extrusion parameters and product characteristics. J.
Food Pro. Preserve., vol.18, pp.389-94.
[29] Ryu, G.H and Walker, C.E. 1995. The effects of
extrusion conditions on the physical properties of
wheat flour extrudates. Starch – Starke, vol.47,
pp.33-36.
[30] Duizer, L.M., Winger, R.J. 2006. Instrumental
measures of bite force associated with crisp products.
Journal of Texture studies, vol.37, pp.1-15.
812
ISBN: 978-81-924893-0-8
[31] Ding, Q.B., Ainsworth, P., Plunkett, A., Tucker, G.,
Marson, H. 2006. The effect of extrusion conditions
on the functional and physical properties of wheat
based expanded snacks. J. food Eng. 2006, vol.73,
pp.142-148.
[32] Srivastava, T., Saxena, D.C., Sharma, R. 2014.
Effects of twin screw parameters upon the
mechanical hardness of ready-to-eat extrudates
enriched with de-oiled rice bran. Journal of Food
Engineering & Environment safety, vol.13, pp.299-
308.
[33] Bhattacharyya, P., Ghosh, U., Gangopadhyay, H.,
Raychaudhuri, U. 2006. Physico-chemical
characteristics of extruded snacks prepared from rice
(Oryza sativa L), corn (Zea mays L) and taro
[Colocasia esculenta (L) Schott] by twin screw
extrusion. Journal of Scientific & Industrial
research,vol.65, pp.165-168.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Extruded Products Analog To Meat
Raj Kumar Renu Sharma,
Deptt. of Applied Sciences Deptt. of Applied Sciences
PTU, Jalandhar BGIET, Sangrur.
raj.scientia@gmail.com renu.sharma6286@
gmail.com
ABSTRACT
Consumption of meat and plant based meat analogues
are a growing market segment. In Europe soy steaks,
cutlets and other meat analogues have proved very
successful in the market owing to their fibrous
structure and nutritional value, similar to that of meat
products. Such products are in demand with
vegetarians but also highly recommended by
dieticians. Texturized proteins, a unique product made
by extrusion, can be produced from a wide range of
raw ingredient specifications, while controlling the
functional properties such as density, rate and time of
rehydration, shape, product appearance and mouth
feel. Formed meat analogs are blends of various
protein sources such as isolates, glutens, albumin,
extrusion-cooked vegetable proteins and others which
are blended with oils, flavors and binders before
forming them into sheets, patties strips or disks.
Literature on extruded products along to meat has
been reviewed.
Key words
Extrusion, Protein texturization, Rheology meat
analog Twin screw extruder.
1. INTRODUCTION
Meat analog is a major type of texturized plant
protein (TPP) which is extensively used to imitate
meat products [1]. It is possible to produce an
extruded meat analog which has a remarkable
similarity to meat in appearance, texture and mouth
feel [2] The introduction of meat analogues (also
termed meat substitutes, meat surrogates and meat
replacement food) in Western markets is a relatively
recent development, starting in the early 1960s [3,4] A
growing awareness in the population about health and
sustainable foods has led to a rising interest in plant
protein based meat alternatives in many European
Countries and worldwide. The new consumer group of
“flexitarians.” Who reduce their meet consumption in
their daily diet is growing rapidly [5]. Extrusion
cooking is the principle processing method used to
fabricate meat like texture and plexilamellar structure
for soy protein products [6].It also offers some
advantages in terms of cost and compatibility for high
volume production [7].
Extruded meat analog : It is possible to
produce an extruded meat analog which has a
remarkable similarity to meat in appearance, texture
813
ISBN: 978-81-924893-0-8
Tanuja Srivastava, D. C. Saxena,
Deptt. of Food Technology Deptt. of Food Engg. &
BGIET, Sangrur, Tech.SLIET, Longowal,
tanusriva@yahoo.co.in dcsaxena@yahoo.com
and mouth feel [2]. Two types of textured meat like
products are manufactured by employing the extrusion
– textrization process. The meat extenders is produced
by employing a single – screw extruders operating at
high temperatures and pressures, followed by drying.
After hot water hydration, this texturized vegetable
protein (TVP) is used to extend / replace meat for use
as pizza toppings, meat sausages and fabricated food
formulations.
The second type of product is meat analogs that can be
used in place of meat. Both these products exhibit
fiber formation due to extrusion cooking of defatted
soybean flovr and consequent alignment when passing
throught the restriction or die. [8]. Textured proteins
of vegetable or animal origin can be processed into
meat like extruded compounds by two methods :dry
and / or wet texturization. Dry expanded products are
characterized by a spongy texture, they are usually
dried and rehy drated for final use (targeted water
absorption 2-3.5). Wet extruded products are
processed near the final moisture content and therefore
do not need to be expanded for more water absorption.
They generally have a more fibrous, less expanded
texture than dry extruded. Meat analogues must be
rehydrated with water or flavoring liquids. A spongy
structure produces products with poor flavor retention
and lack of real texture. [9]
Wet texturization to produce meat
analog : Wet extrusion has made possible
unconventional products such as texturized proteins.
Some of there products have already been
commercialized in Japan, China, and USA. Examples
include extruded crab analog made from Alaska
Pollack surimi with egg white and 1% starch and
texturized soybean foods such as „fupi‟ [10].
Texturization process via extrusion can make products
that imitate the texture, test and appearance of meat or
seafood with high nutritional value [11].
Creating a Meat-like Structure :- Plant
and animal based proteins need to unfold, cross-link
and align themselves to form microscopic and
macroscopic fibres. The high moisture cooking
extrusion process, which is characterised by water
levels up to 70 percent, provides the required process
conditions. Co-rotating twin screw extruders equipped
with long screws and specially adapted long cooling
dies proved to be effective for processing the low
viscosity mass into a protein strand with a distinctive
fibrous structure (Figure 1) [12,13]. In a first step the
ingredients, in particular food protein powders and
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

water, are continuously fed into a long extruder barrel.
The co-rotating screws mix the ingredients thoroughly
while the mass is steadily heated to temperatures of
130-180°C and is moved towards the die section.
During the hydrothermal treatment, the proteins
unfold and form new covalent intermolecular bonds.
Once the mass enters the cooling die section, drag and
shear flows align the proteins in the flow direction.
The strong cooling in the long die section has several
effects. The temperature gradient from the core of the
strand to the die wall increases the shear flow, effects
the cooling of the mass to a core temperature below
100°C and avoids product expansion caused by
evaporation of superheated water. Along with the
cooling, non-covalent hydrogen bonds, electrostatic
interactions and van der Waals interactions develop.
The viscosity rises and the mass solidifies to a strand
with a meat-likestructure [14,15,16] .
bite and a juicy mouth-feel as well as for avoiding
dominant, disturbing flavours from single ingredients.
enzymes lose activity within the extruder unless they
are stable to heat and shear. Protein solubility in water
or dilute salt solutions is decreased after extrusion.
Although denaturation and loss of solubility are by
increased barrel temperature, specific mechanical
energy (SME) appears to be important [19] .Even
under the low temperature (<1000
Changes in protiens during extrusion:
Several changes in protein occur during extrusion,
denaturation is undoubtedly the most important. Most
C) of pasta extrusion, wheat protein solubility is
reduced [20]. During extrusion, disulfide bonds are
broken and may re-form. Electrostatic and
hydrophobic interaction favour formation of insoluble
aggregates. The creation of new peptide bonds during
extrusion is controversial. High molecular weight
protein can dissociate into smaller subunits. Exposure
of enzymes susceptible sites improves digestibility.
Maillard reactions occur during extrusion, particularly
at higher barrel temperature lower feed moistures.
Free sugars may be produced during extrusion to react
with lysine and other amino acids with free terminal
amines. Starch and dietary fibre fragments as well as
sucrose hydrolysis products are available for maillard
reactions. Lower pH favoured maillard reactions, as
measured by increased colour in a model system
consisting of wheat starch, glucose, and lysine [21].

Table 1: Protein changes during extrusion

Figure 1. Twin screw extruder with opened barrel.

Source of all figures: Fraunhofer IVV, Freising, Functional Changes Nutritional Changes
Germany The processing of meat analogues in such
cooking extruders involves a multitude of machine
and process parameters. Furthermore, the composition Reduced solubility in
Reduced lysine
of the matrix, the variety of ingredients and the water water and diluted buffer
content has a major effect on the final product.
However, literature data about the individual impacts Texturization Improved digestibility
of each parameter and their interactions on fibre
formation and the final product quality are scarce and
are limited to soy, wheat and pea protein. High protein Source (Della Valle et al; 1994)
levels in the recipe and the use of proteins with an During extrusion,protein structures are disrupted and
adequate cross-linking capability have been shown to alerted under high shear,pressure,and temperature[22].
be favourable [12,13,17,18]. Protein solubility decreases and cross-linking
The approach to mix protein ingredients and reactions occur. Possibly, some covalent bonds form
further components such as starches and fibres was at high temperatures [23].
very effective for creating products with a meat-like

Table 2–. Typical meat analog ingredients and their purpose (Egbert and Borders 2006).

Ingredient Purpose Usage level

Water
Textured vegetable proteins: textured soy
flour, textured soy concentrate, textured
wheat gluten, textured protein
combinations such as soy and wheat
Nontextured proteins: isolated soy
proteins, functional soy concentrate, wheat
gluten, egg whites, whey proteins
Flavors/spices
Ingredient distribution Emulsification, juiciness, cost 50 to 80
Water binding, Texture/mouthfeel Appearance; protein 10 to 25
fortification/nutrition Source of insoluble fiber
Water binding, emulsification Texture/mouthfeel Protein 4 to 20
fortification/nutrition
Flavor: savory, meaty, roasted, fatty, serumy Flavor 3 to 10

814
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

enhancement (for example, salt) Mask cereal notes

Fat/oil
Binding agents: wheat gluten, egg whites,
gums and hydrocolloids, enzymes, starches
Coloring agents: caramel colors, malt
extracts, beet powder, FD&C colors
Flavor, texture/mouthfeel Succulence, Maillard 0 to 15
reaction/browning
Texture/“bite,” water binding, may contribute to fiber 1 to 5
content, can determine production processing conditions
Appearance/eye appeal Natural or artificial 0 to 0.5

Table 3 Major nonmeat protein sources

Type of protein Sources References

Koshiyama and Fukushima (1976), Mitsuda and
others (1965), Thanh and Shibasaki
β-conglycinin, Glycinin Soybean
(1977), Staswick and others (1984), Sun and
others (2008)
Vicilin, Legumin Duranti and Gius (1997), Kang and others
Legumes
(2007), Plietz and others (1984),
Albumins, Globulins , Prakash and Narasinga Rao (1986), Marcone
Oil seeds
Glutelins (1999),
Singh and MacRitchie (2001), Green and Cellier
Gluten, Gliadins, Glutenins Wheat, rye, and barley
(2007)
Fusarium venenatum(Filamentous
Mycoprotein Rodger (2001), Denny and others (2008)
fungus)

Raw materials
Protein dispersibility Index (PDI) : below 5.0.
Textured soy products have been produced with raw
materials ronging from 20 to 70 PDI.
Fat level : Raw materials have been texturized
containing 0.5 to 6.5% fat levels. This higher range of
fat (5.5%) allows mechanically extracted soybean
meal to be texturized into meat extenders and meat
analogs.
Fiber level : The presence of fiber in extruded soy
protein in hibits b blocks the interaction or cross -
linking of protein molecules neceessary for good
textural integrity.
Particle size ; with regard to ssuccessful
production, twin screw extruders can, sometimes use
raw materialwith a particle size range up to properties
of the final product 8 mesh (2360 micron) without
affecting the textural.
Adjustments in pH : increasing the pH of
vegetable protein before or during the extrusion
process will aid in texturization of the protein.
Extreme increases in pH will increase the solubility
and decrease the final product [39] .
Lowering the pH has the opposite effect and will
decrease protein solubility, making the protein more
difficult to process[40].
Modifying the pH to the alkaline side will increase the
water absurption. This is generally done by using
calcium hydroxide or the more widely used sodium
hydroxide at about 0.1% or as required.
Calcium chloride : Calcium chloride (CaCl2) is
very effective in increasing the textural integrity of
extruded vegetable protein and also aids in smoothing
its surface with the addition of CaCl2 and small
amounts of sulfur, soybean meal containing 7.0% fiber
may be texturized, retorted for one hour at 110°c and
still maintain a strong meat like texture. [41].
Color enhancers : When supplementing light
colored meats with meat extenders made from
textured vegetable proteins, it is desirable to bleach or
lighten the color of the extruded meat extendder.
Bleaching agents such as hydrogen peroxide are often
used for this purpose. Dosing levels for the hydrogen
peroxide range from 0.25 to 0.5% Pigments such as
titanium dioxide are also used at levels between 0.5
and 0.75% to lighten color.
2. Conclusion
The literature survey reviewed that the processing
conditions and the composition of the matrix, the
variety of ingredients and the water content has a
major effect on the final product with can substitue the
meat.

Vnderirable sour flavours in the texturized vegetable 3. REFERENCES

protein products may be evident, if the pH is adjusted

815
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[1] SHEARD, P. R., LEDWARD, D. A. and
MITCHELL, J. R. 1984. Role of carbohydrates in
soya extrusion. International Journal of Food Science
& Technology, vol.19, pp. 475–483.
[2] Smith, O.B.1975. "Textured Vegetable Proteins"
presented at the World (19Soybean Research
Conference, University of Illinois.
[3] Sadler M.J.2004. Trends Food Sci. Technol, vol.
15 (5), pp 250-260 .
[4] Davies J., Lightowler H., Nutrition and Food
Science 98 (2), 90-94 98\
[5] http://blog.euromonitor.com/2011/08/
[6] Burgess, L.D., and Stanley, D.W. 1976. A possible
mechanism for thermal texturization of soybean
protein. J. Ints. Can. Sci. Technol. Aliment. Vol.9(4),
pp 228-229.
[7] Harper, J.M. 1981. Extrusion of foods II. CRC
Press. Florida, USA.pp. 174.
[8] Book: Advances in Food Extrusion Technology.
pp. 78
[9] Book: Extrusion Cooking. pp. 123
[10] Shen, Z. C. & Wang, Z. D. 1992. A novel
extruder for soybean texturization. In: Food Extrusion
Science and Technology (edited by J. L. Kokini, C. T.
Ho & M. V. Karwe). pp. 725–732. New York: Marcel
Dekker, Inc
[11] Cheftel, J. C., Kitagawa, M. & Queguiner, C.
1992. New protein texturization processes by
extrusion cooking at high moisture levels. Food
Reviews International, 8, pp 235–275.
[12] Cheftel J.C., Kitagawa M., Queguiner C.1992.
Food Reviews International 8 (2),pp 235-275
[13] Akdogan H. 1999. Int. J. Food Sci. Techn.
Vol.34, pp 195–207.
[14] Prudêncio-Ferreira S.H., Arêas J.A.G.1993. J.
Food Sci., vol.58, pp 378-381
[15] Liu K., Hsieh F.H.2008. Journal of Agricultural
and Food Chemistry, vol. 56, pp 2681-2687.
[16] Lee G., Huff H. E., Hsieh F.2005. Transactions of
the ASAE. Vol. 48 (4), pp 1461-1469.
[17] Lin S., Yeh C.S., Lu S.2002. J. Food Sci., vol.
67(3), pp 1066-1072 .
[18] Wild F., Zunabovic M., Domig K.J., Die
Ernährung / Nutrition (in press).
[19]Della Valle, G., Quillien, L. and Gueguen, J.
1994. Relationships between processing conditions
and starch and protein modifications during extrusion
cooking of pea flour. Journal of Science Food
Agriculture. Vol.64, pp 509 – 517.
[20] Ummadi, P., Chenoweth, W.L., and P.K.W.
Nigeria. 1995a . Changes in solubility and distribution
of semolina proteins due to extrusion processing.
Cereal Chemistry. Vol.72, pp 564 – 567.
[21] Bates, L., Ames, J. and MacDougall, D.B. 1994.
The use of a reaction cell to model the development
and control of colour in extrusion cooked foods.
Lebensm. – Wiss. U. Technology, vol.27, pp 375 –
379.
816
ISBN: 978-81-924893-0-8
[22] Harper, J.M. 1989. Food extruder and their
applications. In C. Mercier, P. Linko and J.M. Harper
(Eds.), Extrusion cooking (pp 1-16). St. Paul,
Minnesola, USA: America Association of Cereal
Chemists Inc.
[23] Areas, J. A. G. 1992. Extrusion of Food Proteins.
Critical Review of Food Science Nutrition, vol. 32, pp
365 – 392.
[24] Egbert, R. and Borders, C. 2006. Achieving
success with meat analogs. Food Technol-Chicago,
vol. 60, pp 28–34.
[25] Koshiyama I, Fukushima D. 1976. Identification
of the 7S globulin with β-conglycinin in soybean
seeds. Phytochemistry, vol.15, pp 157–9.
[26] Mitsuda H, Kusano T, Hasegawa
K. 1965. Purification of the 11S component of
soybean proteins. Agr Biol Chem Tokyo, vol. 29, pp
7–12.
[27] Thanh VH, Shibasaki K. 1977. Beta-conglycinin
from soybean proteins. BBA-Protein Struct M 490, pp
370–84.
[28] Staswick PE, Hermodson MA, Nielsen
NC. 1984. Identification of the cysteines which link
the acidic and basic components of the glycinin
subunits. J Biol Chem, vol. 259, pp. 13431–5.
[29] Sun P, Li D, Li Z, Dong B, Wang
F. 2008. Effects of glycinin on IgE-mediated increase
of mast cell numbers and histamine release in the
small intestine. J Nutr Biochem, vol. 19, pp 627–33.
[30] Duranti M, Gius C. 1997. Legume seeds: protein
content and nutritional value. Field Crop Res 53, pp
31–45.
[31] Kang IH, Srivastava P, Ozias-Akins P, Gallo
M. 2007. Temporal and spatial expression of the major
allergens in developing and germinating peanut
seed. Plant Physiol, vol.144, pp 836–45.
[32] Plietz P, Zirwer D, Schlesier B, Gast
K, Damaschun G. 1984. Shape, symmetry, hydration
and secondary structure of the legumin from Vicia
faba in solution. BBA-Protein Struct M 784, pp 140–
6.
[33] Prakash V, Narasinga Rao
MS. 1986. Physicochemical properties of oilseed
proteins. CRC Crit Rev Biochm Mol 20: pp 265–363.
[34] Marcone MF. 1999. Biochemical and biophysical
properties of plant storage proteins: a current
understanding with emphasis on 11S seed
globulins. Food Res Int 32, pp 79–92.
[35] Singh H, MacRitchie F. 2001. Application of
polymer science to properties of gluten. J Cereal Sci.,
vol.33, pp 231–43.
[36] Green PHR, Cellier C. 2007. Celiac disease. New
Engl J Med, vol. 357, pp 1731–43.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[37]Rodger G. 2001. Production and properties of

mycoprotein as a meat alternative. Food Technol-
Chicago 55, pp 36–41.
[38] Denny A, Aisbitt B, Lunn J. 2008. Mycoprotein
and health. Nutr Bull 33, pp 298–310
[39] Simonsky, R.W., and D.W. Stanley. 1982 Can.
Inst.Food Sci. Technol. J. vol.15, pp.294 .
[40] DeGroot, A.P., P. Slump,V.J. Feron and L. Van
Beek.1976. J. Nutr., vol. 106, pp.1527.
[41] Joseph Kearns and et .al Extrusion Of Texturized
Proteins. muyang.com 2013.

817
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Biotechnology & Genetic Engineering: Enhancement in
food quality and quantity
Joni Lal
S.D.COLLEGE, BARNALA
ABSTRACT
Biotechnology and genetic Engineering is now able to increase
food quality and quantity by introducing modified recombinant
genes into the crop plant. University of Hawaii and Cornell
University developed two varieties of papaya to papaya
resistant virus by transferring genes from virus. Crops like
cotton potato have been successfully transformed to make a
protein; cry protein to kill harmful insects. Indian agricultural
research institute, New Delhi has also developed many
vegetable crops that are rich in vitamin and minerals.
Biotechnology and Genetic engineering has developed GM
crops like „Golden rice‟ and „Flavr Savr‟ which are far better
than natural varieties.
Keywords
1. Transformation
2. rDNA
3. Biofortification
4. Genetic Engineering
5. Agrobacterium
1. INTRODUCTION
Biotechnology in combination with genetic engineering, now,
able to increase food quality and quantity by introducing
modified recombinant genes into the crop plants. These genes
are modified for their better expression. Researchers can select
these genes from other species and transform them into the
crop plants. In plants the DNA is generally inserted using
Agrobacterium mediated recombination or biolistics. In Agro
bacterium-mediated recombination, the plasmid is constructed
that contains T-DNA, which is responsible for insertion of r-
DNA into the lost plants. Modified genes can also be
transformed through electroporation method in plants and
animals. University of Hawaii and Cornell University
developed two varieties of papaya resistant to 'papaya' ringspot
virus' by transferring gene from virus. Farmers can also use
modern biotechnology techniques to prevent their crop plants
by developing disease resistant, pest resistant and drought
resistant. Certain crops like cotton, corn, potato have been
successfully transformed to make a protein e.g.. Cry protein
from Bacillus thuringiensis which can kill certain harmful
insects .Biotechnology is, also, now able to increase nutritional
value ,flavor and texture of foods. Transgenic crops in
development include soybeans with higher protein content,
potato with more starch and improved amino acid content. Rice
with improved ß-Carotene content (Golden Rice), a precursor
of vitamin A, to help prevent 'Night Blindness' in peoples who
have low ß-Carotene content in their diets. Biofortification is
also come from biotechnology in which breeding of crops with
higher levels of vitamins, minerals, proteins and fats is done.
Maize hybrids which had twice the amount of amino acid-
lysine and tryptophan, as compared to existing maize hybrids
were developed in 2000. Indian Agricultural Institute IARI,
818
ISBN: 978-81-924893-0-8
Kulbhushan Rana
New Dehli, has also developed many vegetable crops that are
'rich' in minerals and vitamins. e.g. Vitamin A enriched
carrots, pumpkin and spinach. Vitamin C enriched Bathua,
tomato, mustard and calcium and iron enriched spinach and
Bathua etc. Artificial seeds can also be produced with the help
of Biotechnology. In India artificial or synthetic seeds in being
done for sandal wood and mulberry at BARC ( Bhaba Atomic
Research Centre, Mumbai). Post-Harvest-losses can also be
reduced with the help of biotechnology by delayed fruit
ripening. In 'Flavr Savr' transgenic tomato, expression of gene
producing enzyme-galacturonase which promotes softening of
fruits has been blocked Non-availability of this enzyme
prevents over-ripening and enhance the shelf life of fruit.
2. DISEASE RESISTANT CROPS
Plants are mainly infected with certain pathogens bacteria,
virus, fungi, nematodes etc. Very important crop plants like
wheat, potato are infected with fungi. Fungi causes 'Loose
Smut of Wheat', 'Black Smut of Wheat' diseases in wheat and
early 'Blight of Potato' and 'Late blight of Potato'. Due to these
fungal infections their is great loss to crop plant and food
production, So Biotechnology with Genetic Engineering is able
to introduce those genes which can protect these plants from
great destruction. Genes encoding enzymes, chitinase and
gluacanase which are selected from other plants or bacteria and
transform in to the crop plants. These enzymes can easily
destruct the chitin formed cell wall of fungi. In viral infected
plants, genes encoded for 'viral coat protien are introduced to
protect and develop viral resistant plants by introducing such
modified genes in to the crop plants will increase the crop
productivity.
3. PEST RESISTANT CROPS
Insect pest is a serious agricultural problem leading to yield
losses and decreases food production. Researchers have used
genetic engineering to take the bacterial genes needed to
produce Bt toxins and introduce them in to plants. If plants
produce Bt toxin on their own, so they can defend themselves
against harmful insects. So farmers no longer have to use
chemical pesticides to control these insects. This strategy is an
eco-friendly, which protect the plants from harmful insects and
also keep the environment safe from harmful chemicals.
4. STRESS RESISTANT CROPS
The transcription factors DREB 1 and DREB2 are important in
the ABA- independent drought tolerant pathway; that induces
the expression of stress response genes. Genes for the these
transcription factor increases the tolerance of transgenic
Arabidopsis plants to drought, high salinity and cold. But study
shows that these DREB genes also reported in important, food
crops such as rice, potato, barley, maize, wheat. It means that
this is a conserved, universal stress defense mechanism in
plants. So DREB genes are important targets for crop
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

improvement for drought through genetic engineering and Gareth; Wright, Susan Y; Hinchliffe, Edward; Adams,
enhancement of food production. Jessica l(2005).‟Improving the nutritional value of Golden
Rice through increased pro vitamin A content “. Nature
biotechnology 23 (4): 482-7.doi:10.1038/nbt 1082. PMID
5. IMPROVEMENT OF SHELF LIFE 15793573.
Through genetic engineering shelf life of fruits can be improve 3. Martineau, Belinda 2001. First Fruit: The creation of the
by delaying the fruit ripening. This makes the long distance Flavr Savr tomato and the Birth of Biotech Food. Mc
transport of fruits like tomato easy. Slow ripening also Graw Hill.
improves the flavor. Most of this work for delayed fruit 4. Zupan,J; Muth.TR;Draper,O; Zambryski,P.(2000)”The
ripening has been done on tomatoes. Fruit ripening in fruits transfer of DNA from Agrobacterium tumefaciens into
normally promoted by increased respiration and increased and plants; a feast of fundamental insights” Plant J.23:11 – 28.
rapid ethylene production. Fruits gets softened by the activity doi:10.1046/j . 1365-313x.2000.00808.x.
of enzyme like polygalacturonase and methyl esterase. But with 5. Rebecca Bailey,‟Biofortifying‟ one of the word‟s primary
the application of genetic engineering the activity of these foods, Retrieved on July22,2008‟.
enzyme can be blocked. 6. Babu M, Geetha M. “DNA shuffling of cry proteins”
Retrieved 2008-11-23.
7. Broderick, nichole A; Raffa, Kenneth F; Handelsman, To
6. BIOFORTIFICATION (2006) “Midgut bacteria required for Bacillius thuringienis
Biofortification is a process through which nutritional value of insecticidal activity”. Proceeding of the national Academy
food can be increased. This can be achieved through selective of sciences 103 (41); 15196-9.
breeding and genetic engineering. Biofortification is an 8. International rice research Institute: About Golden rice.
upcoming or rapidly expanding technology for dealing with 9. Biofortification: Harnessing agricultural technology to
deficiency of micronutrients in the world. WHO estimated that improve the health of the poor, IFPRI and CIAT pamphlet,
biofortication could help curing the 2 billion people suffering (2002).
from iron-deficiency anemia. Golden rice is an example of a 10. Watson, Janes D. (2007). Recombinant DNA: Genes and
GM crops developed for its nutritional value. genomes: A short course. San Francisco: W.H. Freeman.
ISBNO-7167-2866-54
11. Donna U. Vogt and Mickey Parish.(1999) food
REFERENCES biotechnology in the United States: Science, Regulation,
1. The European parliament and the council of the European and issues.
Union(12 march 2001)”Directive on the release of 12. Peters, Pamela.” Transforming Plants. Basic Genetic
genetically modified organisms. Directive Engineering Techniques”.
2001/18/ECANNEX1A”.Official journal of the European 13. 13 Segelken, Roger (14 may 1987). “Biologists invent gun
communities ,p.page 17. for shooting cells with DNA”.
2. Paine Jacqueline A; Shipton , Catherine A; Chagger,
Sunandha; Howells, Rhian M; Kennedy,MikeJ; Vernon,

819
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Effect of physical properties on flowability of
commercial rice flour/powder for effective bulk handling
Shumaila Jan Syed Insha Rafiq
Department of Food Engineering and Technology
Sant Longowal Institute of Engineering and Technology,
Longowal- 148106 (India)
shumailanissar@gmail.com
ABSTRACT
This work evaluates the physical properties affecting the
flowability of the commercial rice flour. This flour/ powder
were selected because of the flow issues encountered by the
mills/ industries during bulk handling. A number of powder
physical properties, including moisture content, particle size
distribution, bulk density, compressibility index, angle of
repose and co-efficient of friction were measured. Powder
flowability was measured in terms of cohesive index, caking
strength and powder flow speed dependency. These properties
are used in interpreting the flow behaviour of the commercial
rice flour.
General Terms
Flowability, bulk handling, commercial rice flour.
Key words: Physical properties, cohesive index, caking
strength, powder flow speed dependence.
1. INTRODUCTION
Food powders are mostly used materials, both in industry
as well as in households all around the world and are
considered among the most difficult materials to characterise.
Much research regarding handling and storage characteristics
of bulk solids has been conducted over the years. The powders
are usually surrounded by air (or other fluid) and it is the
solids plus fluid combination which determines the bulk
properties of the powder and the amount of fluid can be
variable. Powders are the least predictable of all materials in
relation to flowability because of the large number of factors
that can change their rheological properties. Powders are
blends of solids, liquids and gases, usually air. Their flow
properties or rheology may be affected by perhaps 100 or
more factors. Broadly, powders are either cohesive or non-
cohesive. A free flowing powder is non-cohesive wherein
particles are separate and when unconfined are able to move
individually. Generally speaking the interparticle forces are
negligible in such case. As long as the powder is free flowing,
the major obstruction to flow is the internal friction.
The most vulnerable industrial powder problems are
obtaining reliable and consistent flow out of hoppers and
feeders without excessive spillage and dust generation. These
problems are usually associated with the flow pattern inside
the silo and hoppers. The worst-case scenario is no flow. This
can occur when the powder forms a cohesive arch across the
opening, which has sufficient strength within the arch to be
self-supporting. Another flow which is termed as mass flow is
the ideal flow pattern where all the powder is in motion and
moving downwards towards the opening. Funnel flow is
where powder starts moving out through a central ‗‗funnel‘‘
that forms within the material, after which the powder against
the walls collapse and move through the funnel. This process
820
ISBN: 978-81-924893-0-8
D.C. Saxena
continues until the silo empties or until another no-flow
scenario occurs with the development of a stable rathole [1]
Furthermore, these flow properties could be again governed
by the material physical properties, for instance; particle size
and shape, the granular surface structure and particle density,
the packing properties and other external factors. External
conditions could include water content, temperature and the
presence of other materials or ingredients [2].
Physical properties of granular solids play a significant
role in their resulting flow behaviour and storage and thus are
essential to design appropriate, efficient, and economic bulk
solids handling and storage equipment and structures [3].
These properties are important in determining the flow
behavior of the flour, thus being helpful in their proper
handling during the various stages of processing, conveying
and storage. Bulk density, kernel density and porosity affect
the structures, loads and in sizing grain hoppers and storage
facilities. The angle of repose is important in designing of
storage and transporting structures. The static coefficient of
friction of the grain, against the various surfaces is used to
determine the angle at which the grains or their flour must be
positioned in order to achieve consistent flow of material.
In addition, it is also important in the designing of
conveyors because friction is necessary to hold the grains or
flour to the conveying surface without slipping or sliding
backward. The frictional properties data will be useful in
hopper design, since inclination angle of the hopper walls
should be greater than the angle of repose to ensure the
continuous flow of the crops (gravity flow) thus these
parameters are also necessary in designing of conveying,
transporting and storing structures. The Hausner ratio and
Carr‘s index are two widely used measurements to indicate
flowability of bulk solids, and are commonly referred to as the
compressibility index. The present study has been conducted
with the commercial rice flour which has been assessed for
particle size analysis, bulk density, tapped density,
compressibility index, angle of repose, static co-efficient of
friction cohesive index, caking strength and powder flow
speed dependency test.
2. MATERIALS AND METHODS
2.1. Physical properties
2.1.1. Procurement of sample: Rice flour sample was
obtained from local Flour Mill, Longowal, Sangrur (Punjab).
2.1.2. Particle size analysis
Particle size analysis was done by using Laser
Diffraction Particle Size Analyzer (Model SLAD-2300, M/s.
SHIMADZU Corporation, Kyoto, Japan). Measuring method
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
used was laser diffraction and laser scattering intensity
pattern, with a measuring range of 0.017µm to 2500µm. Light
source used was semi-conductor laser with a wavelength of
680nm and an output of 3Mw. Operating temperatures were
10oC to 30oC, with an operating humidity of 20% to 80%
(with no condensation). A suspension was prepared with 0.5g
powder and 1ml ethanol (refractive index: 1.36) by continuous
stirring on a magnetic stirrer for 3-5 min. The prepared sample
was filled into the cuvette and readings were taken.
2.1.3. Moisture content
Moisture content (wet basis) was measured by weighing
5 g of a sample before and after drying in an oven at 105oC for
3 hours. Each test was carried out in triplicates.
2.1.4. Bulk density and loose density of rice flour
The loose bulk density of rice flour was determined by
carefully filling a standard graduated cylinders of Vankle‘s
design (100 ml) (M/s. Standard Instrument Corporation,
Patiala, India) with a sample. Initially, the material was filled
up to the 25 ml volume of the cylinder. At this point, the
material was weighed. The cylinder was tapped on a flat
surface about 10 times to allow the material to settle. The
cylinder was further filled with material. The material was
again weighed, and the bulk and tapped density were
calculated based on the volume of the cylinder and weight of
material [4].
𝑊𝑙
𝜌𝑙 = (1)
𝑉𝑙
𝑊𝑡
𝜌𝑡 = (2)
𝑉𝑡
The bulk and tapped densities were used to calculate the
Hausner ratio (HR) (Eq. 3) and Carr‘s index (CI) (Eq. 4).
Hausner ratio (HR) was expressed in decimals; and is defined
as the ratio of a material tapped bulk density to its loose bulk
density [5, 6] and is given as:
CI = 100 × [(ρt – ρl ) / ρt ] (3)
𝜌𝑡
HR = , (4)
𝜌𝑙
Where ρl and ρt are the bulk densities (kg m-3), Wl and
Wt are the masses (kg), V l and Vt are the volumes (m3) of
flour in loose and tapped fill conditions, respectively.
2.1.5. Angle of repose
The angle of repose is the angle formed by the
horizontal base of the bench surface and the edge of a cone-
like pile of granules. The cylinder was placed over a plain
surface and rice flour was filled in. Tapping during filling was
done to obtain uniform packing and to minimize the wall
effect if any. The tube was slowly raised above the floor so
that whole material could slide and form a natural slope. The
height of heap above the floor and the diameter of the heap at
its base were measured and the angle of repose (φ) was
measured by following relations.
2𝑕
Angle of Repose ϕ (°) = 𝑡𝑎𝑛−1
𝐷 positive (force vs distance) and negative areas. The average is
where, Φ = angle of repose (◦);h = height of the pile
(mm);D = diameter of the pile (mm).
821
ISBN: 978-81-924893-0-8
2.1.6. Co efficient of friction
The coefficient of static friction (μ) was determined
from three structural materials namely glass, galvanized steel
sheet and plywood. A plastic cylinder of 30 mm diameter and
35 mm height was placed on an adjustable tilting flat plate
faced with the test surface and filled with the sample. The
cylinder was raised slightly so as not to touch the surface. The
structural surface with the cylinder resting on it was inclined
gradually, until the cylinder just started to slide down. The
angle of tilt was noted from a graduated scale [7, 8, 9] The
angle of inclination was calculated as:
μ = tan α
2.1.7. Flow property measurement by powder
flow analyzer
2.1.7.1. Cohesion index
Cohesion Index (CI), which is defined as the ratio of
―Cohesion Coefficient/sample weight‖, was measured by
using a Stable Micro Systems TA.XT2i Plus texture analyzer.
The cohesion coefficient (g.mm) is the work required to lift
the blade up through the powder column during the
decompression phase at the speed of 50 mm sec-1, which is
determined by integrating the negative areas under the force
displacement curve
CI (mm) =
𝐶𝑜𝑕𝑒𝑠𝑖𝑜𝑛 𝑐𝑜𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡 (𝑔.𝑚𝑚 )
𝑆𝑎𝑚𝑝𝑙𝑒 𝑤𝑒𝑖𝑔 𝑕𝑡 (𝑔)
2.1.7.2. Caking test
The rotor moves to a force of 5 g at 20 mm/s. This step
levels off the powder and allows to record the rate at which
the column height reduces during the caking process. Once
target force is reached, the data is recorded as it moves down
through the powder column at 20mm/s until it reaches a force
of 500 g. Then the rotor moves upwards at 10 mm/s
subjecting powder column to minimum displacement. This is
repeated for five compactions. At the end, the rotor slices
through the compacted cake recording hardness of the cake,
i.e. the force required to get the compacted powder flowing
freely. Finally the rotor moves back to the top. The data
analysis is done using the data on column height at the start of
each compaction cycle, the distance at the point the final 500
g force is reached (the cake height) for each cycle, and finally
the mean force and work required (g.mm) to slice through the
caked area. Cake height ratios (ratio of the initial column
height) and also the cake strength (both as the mean force and
also the work required—the area under the curve) are
calculated.
2.1.7.3. Powder Speed Flow Dependence (PFSD)
test
The rotor moves down through the powder column at
10 mm/s. The data is recorded to measure the resistance of the
powder to being pushed at a controlled flow, i.e. the
interparticle friction of the powder thus measures the flow
stability index. At the bottom of the powder column, the rotor
slices through the powder to avoid hard compact. The rotor
then moves up through the powder at 20 mm/s twice followed
by two cycles of 50 mm/s, two cycles at 100 m/s, and two
cycles at 10 mm/s. The analysis is performed on both the
taken for the two areas for the compaction (as the rotor moves
down through the powder column) at each flow rate. These
are recorded as the compaction coefficient at 10, 20, 50 and
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

100 mm/s. The compaction coefficient for the final two cycles Bulk and tapped density of commercial rice flour was
at 10 mm/s is averaged and ratio with that from the initial two measured and the results are presented in Table 1. As
cycles at 10 mm/s to assess whether the powder has broken obvious, particle size of rice flour has a direct relation with
down during the testing to get a value of PFSD. A value close bulk density. It was found that commercial rice flour had
to 1 means it has not changed at all during the testing. If the lower bulk (0.644 kg m-3) and tapped (0.762 kg m-3) densities.
figure is >1 means the product has changed during testing CI is a measure of powder bridge strength and stability,
(giving a higher compaction coefficient) if <1 means it has and the Hausner ratio (HR) is a measure of the interparticulate
changed giving it a lower compaction coefficient. friction. The Hausner ratio (HR) and Carr‘s compressibility
index (CI, %) were calculated based on Eqn. 3, 4 respectively.
3. RESULTS AND DISCUSSION CI (15.480) and HR (1.183) were shown in Table 1. This is in
accordance with density measurements. The Hausner ratio
(1.183) and Cars index (15.48) showed the fair flowability as
3.1. Particle size analysis per the scale described Table 2 [14].
Particle size analysis of commercial rice flour is shown
in Fig. 1 and the data are summarized in Table 1. The TABLE 2. Scale of flowability
particles of commercial rice flour showed a unimodal
distribution profile for granular size. The results showed that Carr’s Angle of Hausner Flow
particle diameter of commercial rice flour had a widest size Index Repose Ratio Characteristics
distribution with a median granule diameter of 102.429 µm. It 10 25-30 1.00- EXCELLENT
is generally considered that powders with particle sizes larger 1.11
than 200 μm are free flowing, while fine powders are subject 11-15 31-35 1.12- GOOD
to cohesion and their flowability is more difficult. Our results 1.18
indicate a slight contribution of physical factors mainly due to 16-20 36-40 1.19- FAIR
median particle size. An increase in flow difficulties and 1.25
cohesiveness in conjunction with a reduction in particulate 21-25 41-45 1.26- PASSABLE
size is observed for the selected commercial rice flour. The 1.34
effect may be due to the reducing particle size tends to 26-31 46-55 1.35- POOR
increase cohesion behaviour because the particle surface area 1.45
per unit mass increases, favours a greater number of contact
32-37 56-65 1.46- VERY POOR
points for interparticulate bonding and additional interactions,
1.59
resulting in more cohesive and less free flowing powders
>38 >66 >1.60 VERY, VERY
[10,11,12]. Similar results have been obtained for wheat flour
POOR
[13].
3.4. Angle of repose and Co efficient of friction
The angle of repose for commercial rice flour was
found to be 66.571. The parameter is important in proper
design of hoppers to maintain continuous flow of the rice
flour, which must be larger than the angle of repose of rice
flour. The angle of repose αr is increased by the cohesion. The
highest average values of the static coefficient of friction
against plywood, glass and Galvanized steel sheet for
commercial rice flour were 0.587, 0.555 and 0.682,
respectively as shown in Table 3. However, for higher friction
Fig. 1: Particle size analysis of commercial rice flour coefficients, more stable open bridged structures can develop
within the body of the powder, creating a lower overall
TABLE 1. Physical properties and flow characteristics packing density.

Properties Values TABLE 3: Co-efficient of friction of commercial rice flour

Moisture Content (%) 11.6
Particle size ( μm) 102.429 Plywood Glass Galvanized steel sheet
Loose bulk density (kg m-3) 0.644 0.587214 0.555 0.682
Tapped bulk density(kg m-3) 0.762
Angle of repose (o) 66.571
Carr‘s index 15.480 3.5. Cohesion index
Hausner ratio 1.183 Force vs distance curves for commercial rice flour is
Flow stability index 0.987 shown in Fig.2. Based on these curves recoded, cohesion
Cake strength (gmm) 322.097 index (the ratio of cohesion coefficient and the sample weight)
Cohesion index 14.18 is calculated by integrating the negative areas under the curve
using the MACRO software supplied along with the texture
analyzer. The results are presented in Table 2. Each
measurement is an average of 6 cycles in each mode designed
3.2. Moisture content by standard operating procedure itself. As observed
The commercial rice flour had 11.6% moisture content. commercial rice flour exhibited a cohesive behaviour shown
in fig 2. This property can be attributed to the decreased
3.3. Bulk density and loose density of rice flour particle size of the rice flour as described by [15] for
commercial Infant Formula Powders. On comparing the

822
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
obtained values of rice flour with the standard scale of
cohesion it was again predicted that commercial rice flour had
a cohesive behaviour.
Fig 2. Cohesive index of the commercial rice flour
3.6. Caking test
A typical curve for Cake strength and mean cake
strength are calculated using texture exponent software and is
shown in Fig. 3. As received commercial rice flour showed an
average cake height ratio this can be attributed to the factor
that Powders with larger particles are not as submissive to
caking as powders with smaller particles [15]. Results are
shown in Table 2.
Fig. 3: Caking Strength of the commercial rice flour
3.7. Powder Speed Flow Dependence (PFSD) test
Powder flow stability distribution (PFSD) was
analyzed to quantify the dependence of flow characteristics on
flow rate for powders. It also measures flow stability or how
the powder breaks down during testing. A typical force
displacement profile for PFSD test is shown in Fig. 4. Values
are described in Table 2 FSI (0.987). Flow stability index
below 1 is associated with granulation effects during the
flowability test [13]. Flow stability index up to 1 is associated
with no-granulation effects during the flowability test.
Fig. 4: Powder flow speed dependency of the commercial
rice flour
823
ISBN: 978-81-924893-0-8
4. CONCLUSION
An increase in flow difficulties and cohesiveness in
conjunction with a reduction in particulate size is observed for
the selected commercial rice flour. The static coefficient of
friction for commercial rice flour was higher on galvanized
steel plywood, followed by and glass. Cake height ratio and
compaction coefficient of as-received commercial rice flour
indicated the poor compactability of these powders. Powder
flow analysis is an effective tool to characterize the flow
properties of commercial rice flour to elucidate the effect
powder granule size and their distribution on flow behaviour
and subsequent compaction processing. To reach a better
understanding of the contribution of physical properties of rice
flour in the flowability and cohesive properties of rice flour, it
would be interesting to evaluate the surface composition of
rice flour particles. The biochemical surface composition can
be supposed to be more relevant to evaluate the flowability
and cohesive properties, than the bulk composition of the
flour.
REFERENCES
[1] Fitzpatrick J J, Barringer S A, Iqbal T, 2004. Flow
property measurement of food powders and sensitivity of
Jenikes hopper design methodology to the measured values.
Journal of Food Engineering. 61, 399–405
[2] Abu-hardan M, & Hill S E. 2010. Handling properties of
cereal materials in the presence of moisture and oil. Powder
Technology 198, 16–24.
[3] Ganesan V, Rosentrater K A, Muthukumarappan K.. 2008.
Flowability and handling characteristics of bulk solids and
powders – a review with implications for DDGS. Bio systems
engineering 101, 425 – 435
[4] Tumuluru J S, Tabil L G, Song Y. , Iroba K L, Meda V.
2014. Grinding energy and physical properties of chopped and
hammer-milled barley, wheat, oat, and canola straws. Biomass
and bio energy 6 0, 58- 67
[5] Grey RO, Beddow J K. 1969. On the Hausner ratio and its
relationship to some properties of metal powders. Powder
Technology, 2(6), 323–326
[6] Garcia RA, Flores RA, Mazenko CE. 2007. Factors
contributing to the poor bulk behavior of meat and bone meal
and methods for improving these behaviours. Bioresource
Technology, 98(15), 2852–2858
[7] Dutta S.K., Nema V.K. and Bhardwaj R.K. 1988. Physical
properties of gram. Journal of Agricultural Engineering
Research, 39:259-268.
[8] Fraser B.M., Verma S.S. and Muir W.E. 1978. Some
physical properties of faba beans. Journal of Agricultural
Engineering Research, 23:53–57.
[9] Shefherd H. and Bhardwaj R.K. 1986. Moisture-dependent
physical properties of pigeon pea. Journal of Agricultural
Engineering Research, 35:227–234.
[10] Fitzpatrick, J. J., Barringer, S. A., & Iqbal, T. 2004. Flow
property measurement of food powders and sensitivity of
Jenike’s hopper design methodology to the measured values.
Journal of Food Engineering, 61, 399–405.
[11] Katikaneni, P. R., Upadrasha, S. M., Rowlings, C. E.,
Neau, S. H., & Hileman, G. A. 1995. Consolidation of
ethylcellulose: Effect of particle size, press speed, and
lubricants. International Journal of Pharmaceutics, 117, 13–
21.
[12] Teunou, E., & Fitzpatrick, J. J. 1999. Effect of relative
humidity and temperature on food powder flowability. Journal
of Food Engineering, 42, 109–116.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[13] Landillon V, Cassan D, Morel MH, Cuq B. 2008.

Flowability, cohesive, and granulation properties of wheat
powders, Journal of Food Engineering 86,178–193
[14] Igathinathane C, Jaya ST, Sokhansanj S, Bi X, Lim CJ,
Melin S, Mohammad E. 2010. Simple and inexpensive
method of wood pellets macro-porosity measurement.
Bioresource Technology, 101(16), 6528–6537
[15] Benkovic M, Bauman I. 2009. Flow Properties of
Commercial Infant Formula Powders. World Academy of
Science, Engineering and Technology 30.

824
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Extraction of starch from differently treated horse
chestnut slices
Syed Insha Rafiq Shumaila Jan
Department of Food Engineering and Technology
Sant Longowal Institute of Engineering and Technology,
Longowal- 148106 (India)
syedinsha12@gmail.com
ABSTRACT
Starch was extracted from dehydrated horse chestnut slices
dried at temperature of 50, 60, 70, 80 and 90°C and
rehydrated chips (dried at 50 and 60°C) at rehydration
temperature of 25 and 40°C. Optimization was done on the
basis of starch yield. The highest yield was found in the
sample dried at 50°C. Physicochemical properties of
optimized starch were determined. Color values indicate that
the starch was light in color with L value of 96.4. The starch
was having a neutral pH with zero carboxyl content. The bulk
density value was 0.85g/ml and sediment value was 36ml.
Light transmittance showed a decreased trend with increased
storage period of 120hrs. Syneresis and freeze thaw values
were increased from 0 to 3.24 % and 0 to 20.21 % with
storage period.
General Terms
Horse chestnut starch, centrifuge, spectrophotometer, grinder
Keywords
Horse chestnut starch, Bulk density, Sediment value, Paste
clarity, Color, Syneresis
1. INTRODUCTION
Indian Horse Chestnut or Himalayan chestnut
(Aesculus indica), locally known as Han dun is a large
deciduous tree found in moist and shady ravines of Jammu
and Kashmir, Himachal Pradesh and Uttar Pradesh [1, 2]
yielding large number of seeds, which ripen in October [3].
The seeds are about 3.5 cm in diameter with a hard shining
black rind from outside and lime white cotyledons inside [4].
The seeds possess edible uses. In Himachal Pradesh, seeds
with reduced level of bitterness after being kept in running
water are dried and ground into flour called Tatttwakhar, used
for making Halwa (porridge) and also mixed with wheat flour
to make chapattis [5]. During famine times, the seeds have
been used as food by various tribes of North and North
Eastern India [6]. The seeds constitute about 50.5% moisture,
5.85%, sugars, 0.39% protein, 1.93% ash [4] and about 38.3%
starch on dry weight basis [7]. Due to this satisfactory starch
content, horse chestnut seeds can prove as an inexpensive
non-conventional source of starch.
The utilization of starch as additive in various
industrial applications has stimulated the development of
various extraction methodologies with high purity and well
defined physical and functional properties. Important
advances have been made during the last decades in the
development of methods for starch extraction. However, the
successful characterization of starch mainly depends upon the
825
ISBN: 978-81-924893-0-8
Sukhcharn Singh D. C. Saxena
purity of the isolated starch. A good representative starch
sample must contain >96 % (w/w) pure starch and be devoid
of other plant components, such as fiber (soluble and
insoluble), protein, and lipids.
The objective of the present study was to
standardize the extraction of starch from dried and rehydrated
horse chestnut slices.
2. MATERIALS AND METHODS
2.1 Materials
Indian Horse Chestnut seeds were harvested from
trees located in rural areas of Anantnag, J and K, India during
the month of October, 2013. The seeds were washed with
water, oven dried at 60oC to remove excess moisture and
stored at 5o C until further use. All the reagents and chemicals
used in the study were of analytical grade and were obtained
from M/s. Loba Chemie Pvt. Ltd, Mumbai (India).
2.2. Sample preparation
Seeds were peeled manually and the kernels were
cut into slices of 4 ± 0.4 mm. The slices were dipped into
water containing 0.5% KMS and 1.0% citric acid for 30 min
[8]. The slices were then dried at temperatures of 50, 60, 70,
80, and 90°C and the sample dried at 50 and 60 °C was
rehydrated at 25 and 40 °C. All the prepared slices were then
taken for starch extraction.
2.3. Starch isolation
Starch was extracted from dried and rehydrated
horse chestnut slices, using alkaline steeping method [9].
Dried and rehydrated horse chestnut slices were steeped in
0.25 % NaOH solution (w/v) with ratio of 1:3 and stored at
4°C for 2 hrs. The steeped chips were ground along with alkali
with a laboratory grinder and filtered through 100 mesh sieve,
kept for settlement followed by 2-3 washings with distilled
water. The slurry was again filtered through 300 mesh sieve
and then centrifuged at 3000 rpm for 15 min. The aqueous
phase obtained on centrifugation was discarded and the upper
non-white layer was scraped off. The white starch layer was
re-suspended in distilled water and centrifuged 2-3 times. The
starch was then collected and dried in hot air oven at 40oC.
2.4 Physicochemical properties of starch
2.4.1 Yield and composition
Optimization was done on the basis of yield and the
sample with highest yield was taken for further analysis.
Moisture content, crude protein, fat, and ash content of the
purified starch was determined [10].
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2.4.2 Color
Color measurements of HCN starch was carried out
in triplicates, using Color Flex Spectrocolorimeter (Hunter
Lab Colorimeter D-25, Hunter Associates Laboratory, Ruston,
USA), and results were expressed in terms of L*, a* and b*
values. The L* value indicates the lightness/ darkness of the
sample, 0–100 representing dark to light. The a* value gives
the degree of redness/greenness of the sample, with a higher
positive a* value indicating more red. The b* value indicates
the degree of yellowness/blueness of the sample, with a higher
positive b* value indicating more yellow. The functions
chroma [C* = (a*2 + b*2)1/2] and hue angle [h* = tan-1(b*/ a*)
were also calculated.
2.4.3 pH of starch suspension
The pH of each starch suspension was determined
using a digital pH meter (Hanna, USA). Starch samples for
pH measurements were prepared by suspending 1 g of starch
in 25 mL of water at 25°C and agitating for 5-10 min [11].
2.4.4 Carboxyl content
The carboxyl content of HCN starch was
determined by the standard method [12].
2.4.5 Bulk density
Bulk density of HCN starch was measured by the
method of Wani, et al. (2013). Flour sample was gently
transferred into 10ml previously weighed graduated cylinder.
The sample was then packed by gently tapping the cylinder on
a laboratory bench several times until no further diminution of
the sample level was observed after it was filled up to the
mark. The weight of the filled cylinder was taken, and the
bulk density was calculated as the weight of sample per unit
volume of sample (g/mL). The measurements were made in
triplicates [13].
2.4.6 Paste clarity
The clarity (% transmittance at 650 nm) of starch
paste was determined with slight modification to the method
described by Sandhu and Singh (2007). A 1% aqueous
suspension of starch adjusted to pH 7.0 was heated in boiling
water bath for 30 min with intermittent shaking. After that the
suspension was cooled down to 25°C. The light transmittance
was read at 650 nm against water blank [14].
2.4.7 Sediment volume
Sediment volume of HCN starch was determined
with slight modification to the method of Tessler (1978).
Starch (1g, dry basis) was weighed into beaker and 95 ml of
distilled water was added. The pH of the starch slurry was
then adjusted to 7.0 using 5% NaOH or 5% HCl following
which the slurry was cooked in a boiling water bath for 15
min. The mixture was then stirred thoroughly and transferred
to a 100 ml graduated cylinder, the volume was made up to
100ml with distilled water. The cylinder was then sealed and
kept at room temperature for 24 hrs for settlement of starch
granules. The volume of the sediment consisting of starch
granules was then measured for sediment volume [15].
2.4.8 Light transmittance
Transmittance of HCN starch was measured
according to the method followed by Craig, et al. (1989). A
1% aqueous suspension of starch sample was heated in a
boiling water bath for 1 h with constant stirring. The
suspension was then cooled for 1 h at 30°C. The samples were
826
ISBN: 978-81-924893-0-8
stored at 4°C in a refrigerator and transmittance was
determined after storage period of 0, 24, 48, 72, 96 and 120h
at 640 nm against water blank with a UV spectrophotometer
(Shimadzu UV-1601, Japan) [16].
2.4.9 Syneresis
Syneresis of HCN starch was determined by the
modified method of Wani, et al. (2010). Starch suspensions
(6%, w/w db) were heated at 90°C for 30 min in a water bath
(SWB-10L-1- Taiwan) with constant stirring at 75 rpm. The
starch sample was stored for 0, 24, 48, 72, 96, and 120 h at
4°C in separate tubes for each day. Syneresis was measured as
% amount of water released after centrifugation at 3000х g for
10 min (5810R, Eppendorf, Hamburg, Germany) [17].
2.4.10 Freeze thaw stability
Freeze thaw stability of HCN starch was determined
by the method of Hoover and Ratnayake (2002). Aqueous
starch slurry (6%, w/v db) was heated in a water bath (SWB-
10L-1-Taiwan) at a temperature of 90°C, for 30 min. The gels
were subject to cold storage at 4°C for 16 and then frozen at -
16 °C. To measure freeze thaw stability, the gels frozen at -16
°C for 24 h, were thawed at 25°C for 6 h and then refrozen at -
16°C. Five cycles of freeze thaw were performed. The tubes
were centrifuged at 1000х g for 20 min at 10°C and the
released water was measured as freeze thaw stability [18].
2.4.11 Statistical analysis
The reported data in tables are an average of
triplicate observations and were subjected to statistical
analysis using Statistica-log software package version 7
(StatSoft Inc., OK, USA).
3. RESULTS AND DISCUSSION
3.1 Physicochemical properties
3.1.1 Proximate composition
Highest yield starch was extracted from chips dried
at 50°C as shown in Table 1. The proximate analysis of HCN
starch revealed 10.97 ± 0.23% moisture, 0.31 ± 0.14%
protein, 0% fat and 0.29 ± 0.9% ash. The physicochemical
properties of native starch are shown in Table 2.
Table 1. Yield of starch extracted from various treated
HCN slices
Starch Yield (%)
Sample dehydrated at 50°C (D1) 28±1.4
Sample dehydrated at 60°C (D2) 20±1.32
Sample dehydrated at 70°C (D3) 15±1.54
Sample dehydrated at 80°C (D4) 10±1.37
Sample dehydrated at 90°C (D5) 5±0.64
D1sample rehydrated at 25°C (25D1) 9.24±1.2
D1 sample rehydrated at 40°C (40 D1) 8.09±1.03
D2 sample rehydrated at 25°C (25 D2) 8.49±0.95
D2 sample rehydrated at 40°C (40 D2) 6.25±0.87
The values are means ± standard deviation of three
replicates.
3.1.2 Color measurement
As shown in Table 2, a high degree of whiteness
was observed for HCN starch with L* value of 96.4.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Boundries et al., (2009) have concluded that L* values greater
than 90 give a satisfactory whiteness for starch purity [19].
The chroma (c°) and hue (h°) values of starch sample was
96.23 and 84.30, respectively.
Tab. 2. Physicochemical properties of HCN starch
Parameters HCN starch
Color values
L 96.4±0.12
A 96.2±0.09
B 96.0±0.08
c* 96.23 ± 0.03
°
h 84.30±0.05
Yield (%) 28±1.02
Amylose (%) 26.10±0.51
Ph 7±0.11
Carboxyl content (%) 0 indicate the clarity of starch paste and depends on the level of
Bulk density (g/mL) 0.85±.025
Sediment value (ml) 36±0.34
Paste clarity (A) 0.832±0.14
The values are means ± standard deviation of three
replicates.
3.1.3 pH of starch suspension
The pH of HCN starch suspension is shown in
Table 2. The starch suspension is having a neutral pH and any
modification done to the starch results in increase or decrease
in pH value. Results have reported decreased pH value due to
the breakdown of starch molecules [11], which presumably
induce COOH formation that could be responsible for
increase in acidity of the modified starch.
3.1.4 Carboxyl content
The carboxyl content of native starch is listed in
Table 2. The carboxyl content value is zero due to the neutral
pH of the starch. Any modification involving use of chemical
treatment results in increase in carboxyl content. Reports on
the increase in carboxyl content after the oxidative treatment
has been discussed by different researchers [20, 21]. Acids
like formic, pyruvic, acetic and glucouronic acids are said to
be responsible for the elevation in carboxyl content [22].
3.1.5 Bulk density
Bulk density (BD) is a reflection of the load a
sample can carry if allowed to rest directly on another. The
bulk density of native starch as presented in Table 2 was 0.85
g/mL. Bulk density is generally affected by the particle size
and density of powder. However, smaller the particle size, the
more is the resistance for flow of powders. The high bulk
density of material suggests their suitability for use in food
preparations. In contrast, low BD would be an advantage in
the formulation of complementary foods [23].
3.1.6 Paste clarity
Paste clarity of starch suspension is presented in
Table 2. The paste clarity of the suspension is because of
variation in water penetration and absorption of the starch
granules, which ultimately led to difference in swelling of
starch and resulting in more or less transmittance of light [16].
Bhandari and Singhal (2002) observed in amaranth starch that
827
ISBN: 978-81-924893-0-8
the starch paste clarity is directly affected by degree of
swelling of starch [24].
3.1.7 Sediment value
The sediment volume of HCN starch is 36ml as
presented in Table 2. HCN starch is having highest sediment
value and upon modification of any starch sample there is
decrease in sediment value. The decreased values in modified
starch are due to the disruption of granules resulting in
decreased swelling and low volume makeup. Studies were
done for acetylated and cross-linked rice starch which
reported reduced sedimentation volume, due to decreased
interaction between starch molecules by acetyl group, and
inhibit swelling by cross-linking [25]. The decreased sediment
volume may also be due to large starch granules which caused
decrease in bond strength upon heating [26].
3.2.1 Light transmittance
Light transmittance which provides the insight of
starch paste when light passes through it can be used to
swollen and non-swollen granule remnants. Transmittance is
the fraction of incident light that passes through a sample at a
specified wavelength. The percent transmittance (%T) was
measured as a function of wavelength for various starch
pastes and it was observed that more opaque pastes gave a
lower %T [27]. The effect of storage period on percent
transmittance of investigated starches is presented in Table 3.
The percent transmittance was reduced with increased storage
period of the paste. Similar time-dependent reduction in
transmittance has been reported for banana starch [28].
3.2.2 Syneresis
As presented in Table 3, the syneresis of pastes
increased with storage period and HCN starch paste displayed
highest syneresis (0.00-3.24%) during 120 h of storage. [29]
Perera and Hoover (1999) reported that the increase in
percentage syneresis during storage is due to the interaction
between leached amylose and amylopectin chains, which lead
to the development of junction zones and release of water.
Amylose aggregation and crystallization have been reported
to be completed within the first few hours of storage while
amylopectin aggregation and crystallization occurs during
later stages [30, 31].
3.2.3 Freeze-thaw stability
Freeze-thaw stability of gelatinized starch pastes is
presented in Table 3. The lowest freeze-thaw stability
(20.21% syneresis) was observed at 5thaw for HCN starch
after five freeze thaw cycles. Freeze thaw stability of native
starch was in the range of 0 - 20.21%. This may be attributed
to degradation of molecular structure of starch and formation
of smaller fragments which retain more water. The amount of
water separated from the gels increased with storage time.
Baker and Duarte (1998) have reported this behavior for corn
starches, mentioning low freeze–thaw gel stability for corn
and amaranth starches [32]. Likewise, Bello-Perez et al.,
(1999) found low gel stability in the same processes for
banana starch [33]. Low gel stability under these conditions
suggests it is not convenient for use in food systems involving
refrigeration or freezing processes.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Tab. 3. Light transmittance, syneresis and freeze thaw [3] Wani, I. A., Jabeen, M., Geelani, H., Masoodi, F.A. Saba,
stability of HCN starch I., & Muzaffar, S. (2014).Effect of gamma irradiation on
Parameter HCN starch physicochemical properties of Indian Horse Chestnut
Light transmittance (Aesculus indica C.) starch. Food Hydrocolloids, 35,
253–263.
0h 5.8±1.7 [4] Parmar, C., and Kaushal, M. K. (1982). Aesculus indica.
24h 3.2±1.2 In wild fruits; Kalyani Publishers, New Delhi, India, pp
6-9.
48h 2.1±0.9
[5] Rajasekaran, A., & Singh, J. (2009). Ethnobotany of
72h 1.5±1.3 Indian horse chestnut (Aesculus indica) in Mandi district,
96h 1.2±1.0 Himachal Pradesh. Indian Journal of Traditional
Knowledge,Vol. 8(2), pp. 285-286.
120h 0.9±1.5 [6] Singh, G., & Kachroo, P. (1976). Forest flora of Srinagar.
Syneresis cf http://www.ibiblio.org/pfaf/cgi-bin/arr_html. Aesculus
0h 0 indica.
[7] Singh, B., Katoch, M., Ram, R., and Aijaz, Z. (2003). A
24h 0.24±0.5 new antiviral agent from Indian Horse Chestnut
48h 0.67±1.2 (Aesculus indica). European Patent Specification,
International publication No. WO 2003/079795.
72h 2.1±0.6
[8] Singh, G. D., Sharma, R., Bawa, A. S., & Saxena, D. C.
96h 2.43±0.9 (2008). Drying and rehydration characteristics of water
120h 3.24±1.4 chestnut (Trapa natans) as a function of drying air
temperature. Journal of Food Engineering, 87, 213–221.
Freeze thaw stability [9] Sun, Q., Han, Z., Wang, L., & Xiong, L. (2014).
0thaw 0 Physicochemical differences between sorghum starch
1thaw 2.04±1.3 and sorghum flour modified by heat-moisture treatment.
Food Chemistry, 145, 756–764.
2thaw 10.28±0.9 [10] AOAC, (1995). Official methods of analysis.
3thaw 15.66±0.7 Washington, D.C., U.S.A. Association of Official
Analytical Chemists.
4thaw 18.61±1.1
[11] Sokhey, A. S., & Chinnaswamy, R. (1993).
5thaw 20.21±0.8 Physicochemical properties of irradiation modified starch
The values are means ± standard deviation of three extrudates. Food Structure, 11, 361-371.
replicates. [12] Chattopadhyay, S., Singhal, R. S., & Kulkarni, P. R.
(1997). Optimization of conditions of synthesis of
oxidized starch from corn and amaranth for use in film-
forming applications. Carbohydrate Polymers, 34, 203-
CONCLUSION 212.
Horse chestnut seeds having high content of starch
[13] Wani, I. A., Sogi, D. S., Wani, A. A., Gill, B. S. (2013).
presently go waste, but can be utilized for the production of
Physico-chemical and functional properties of flours
starch. The isolated starch showed ash, protein, lipid as
from Indian kidney bean (Phaseolus vulgaris L.)
0.29%, 0.31%, and 0%, respectively with a yield of 28%. The
cultivars. Food Science and Technology 53, 278-284.
characteristics of HCN starch displayed high light
[14] Sandhu, K. S., & Singh, N. (2007). Some properties of
transmittance and low syneresis. Thus they can be used in
corn starches II: Physicochemical, gelatinization,
food products which need refrigeration. The analysis of
retrogradation, pasting and gel textural properties. Food
physicochemical properties of starch provides valuable
Chemistry, 101, 1499–1507.
information associated with the functional properties of
[15] Tessler, M. M. (1978). Process for preparing cross-
starch. There is thus, a need for detailed investigation of horse
linked starches. US Patent 4098997.
chestnut to gather more information related to various
[16] Craig, S. A. S., Maningat, C. G., Seib, P. A., & Hoseney,
properties of starch.
R. C. (1989). Starch paste clarity. Cereal Chemistry,
66(3), 173-182.
ACKNOWLEDGMENTS [17] Wani, A. I., Sogi, S. D.,Wani, A. A., Gill, S. B., &
Shivhare, S. U. (2010). Physicochemical properties of
The authors are grateful to Maulana Azad National
starches from Indian kidney beans. International Journal
Fellowship (MANF) for providing financial assistance in the
of Food Science & Technology, 45, 2176-2185.
form of Junior Research Fellowship.
[18] Hoover, R., & Ratnayake,W. S. (2002). Starch
characteristics of black bean, chick pea, lentil, navy bean
and pinto bean cultivars grown in Canada. Food
REFERENCES Chemistry, 78, 489-498.
[1] Singh, B. (2006). Simple process for obtaining beta Aescin [19] Boudries, N., Belhaneche, N., Nadjemi, B., Deroanne, C.,
from Indian horse chestnut. United States patent Mathlouthi, M., Roger, B., Sindic, M., (2009).
application pub. no. US 2006/0030697. Physicochemical and functional properties of starches
[2] Zhang, Z., Li, S., & Lian, X. Y. (2010). An overview of from sorghum cultivated in the Sahara of Algeria.
genus Aesculus L.: ethnobotany, phytochemistry, and Carbohydrate Polymers, 78 (3), 475–480.
pharmacological activities. Pharmaceutical Crops, 1, 24- [20] Wang, Y. J., & Wang, L. (2003). Physicochemical
51. properties of common and waxy corn starches oxidized

828
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
by different levels of sodium hypochlorite. Carbohydrate
Polymers, 52, 207-217.
[21] Zhou, M. X., Robards, K., Glennie-Holmes, H., &
Helliwell, S. (1998). Structure and pasting properties of
oat starch. Cereal Chemistry, 75, 273-281.
[22] Ghali, Y., Ibrahim, N., Gabr, S., & Aziz, H. (1979).
Modification of corn starch and fine flour by acid and
gamma irradiation. Part 1. Chemical investigation of the
modified product. Starch/Starke, 31, 325-332.
[23] AAkpata, M. I., & Akubor, P. I. (1999). Chemical
composition and selected functional properties of sweet
orange (Citrus sinensis) seed flour. Plant Foods for
Human Nutrition, 54, 353-362.
[24] Bhandari, P. N., Singhal, R. S. (2002), Effect of
succinylation on the corn and amaranth pastes.
Carbohydrate Polymers, 48, 233–240.
[25] Raina, C. S., Singh, S., Bawa, A. S., & Saxena, D. C.
(2006). Some characteristics of acetylated, cross-linked
and dual modified Indian rice starches. European Food
Research Technology, 223, 561-570.
[26] Moorthy, S. N. (2002). Physicochemical and functional
properties of tropical tuber starches: a review.
Starch/Starke, 54, 559-592.
[27] Stuart, A. S. C., Claduaoldoc, M., Paul, A. S., &
Hosenney, R. C. (1989). Starch paste clarity. Cereal
Chemistry, 66, 173-182.
[28] Bello-Perez, L. A., Romero-Manilla, R., Paredes-Lopez,
O. (2000), Preparation and properties of physically
829
ISBN: 978-81-924893-0-8
modified banana starch prepared by alcoholic alkaline
treatment. Starch, 52, 154–159.
[29] Perera, C., & Hoover, R. (1999). Influence of
hydroxylpropylation on retrogradation properties of
native, defatted and heat-moisture treated potato starches.
Food Chemistry, 64, 361-375.
[30] Miles, M. J., Morris, V. J., Orford, R. D., & Ring, S. G.
(1985a). Recent observation on starch retrogradation. In
R. D. Hill, & L. Munck (Eds.), New approaches to
research on cereal carbohydrates (pp. 109-115).
Amsterdam: Elsevier.
[31] Miles, M. J., Morris, V. J., Orford, R. D., & Ring, S. G.
(1985b). The roles of amylose and amylopectin in the
gelation and retrogradation of starch. Carbohydrate
Research, 135, 271-281.
[32] Baker, L. A.; Rayas-Duarte, O.(1998), Freeze-thaw
stability of amaranth starch and the effects of salts and
sugars. Cereal Chemistry, 75, 301–307.
[33] Bello-Perez, L. A., Agama-Acevedo, E., Sanchez-
Hernandez, L., Paredes-Lopez, O. (1999), Isolation and
partial characterization of banana starches. Journal of
Agricultural and Food Chemistry, 47, 854–857.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
INDUSTRIAL EFFLUENTS AND HUMAN HEALTH
Anchla Rupal
Deptt. Of Chemistry, S.D. College, Barnala
e.mail: anchlarupal@gmai.com
ABSTRACT
Punjab is one of the most prosperous states of India, pioneering
in the green revolution. Despite being one of the richest states of
country in terms of per capita income, the health indices of the
state are not the best. Due to rapid industrialization and
urbanization in the state a huge amount of waste water is
generated and untreated water is drained leading to pollution of
the drains. Hence the water resources are getting polluted and
most of the effluent is generated by different kind of industries,
municipal sewerage, urban storm water etc.
Keywords
Industrialization, revolution, resources
INTRODUCTION
The present study was conducted to find the effect of effluent
water pollution on human health among the people living near
Budha Nallah. Samples of water, vegetable and milk were
collected to ascertain the effect of pollution. Hence, physical and
chemical tests were carried along with testing of contamination
by heavy matter and pesticides. It was found there is significant
occurrence of gastrointestinal problems, water borne diseases,
skin and eye problem among the people residing in the reference
area. The study also revealed mercury, cadmium, chromium,
copper to be much higher in water samples and in green
vegetable grown in the fields irrigated with water from the
drains. The water samples were analyzed and the testing was
conducted for heavy metal and pesticides analysis. The major
reason for contamination can be due to industrial units including
hosiery units, involved in dying which discharge their effluent
into the drain. Mercury level were found to be more than
permissible limits in most of the ground water samples. Mercury
affects the central nervous system causing tremors, insomnia,
memory loss and headache. It also causes gastrointestinal
symptoms like nausea, vomiting, diarrhea and burning of eyes.
Sources of mercury include broken thermometer and BP
apparatus, electrical switches, florescent bulbs, batteries and
paints. The city of Ludhiana where Budha Nala passes has about
400 electro plating units. The waste from these units could be
the cause of mercury contamination. Beside mercury heavy
830
ISBN: 978-81-924893-0-8
metal likes cadmium, chromium, copper and lead. Cadmium
compounds are used in nickel cadmium batteries and used
batteries are dumped together as a waste. Hence cause
contamination. The other noted effect of heavy metal
contamination is on aquatic life and increase human
consumption of heavy metals, hence leading to various diseases.
The study also observed the high pesticide levels in the ground
and tap water and higher level of pesticides enters the human
food chain through vegetables grown in soil. Health problems
caused by pesticides include gastrointestinal effect like nausea,
vomiting and loss of appetite. Even chronic exposure to
pesticides leads to carcinogenic diseases, reproductive toxicity,
and lung and kidney diseases as the study revealed during the
survey carried out on a sample population. It was also found that
most common source of drinking water is hand pump water and
most of the people use polluted Nallah water for irrigation and
growing vegetables. As the study reveals that there is a
significant effect of effluent disposal on water quality and
human health among the people living in close proximity to the
drain and as human health is the major concern and metal
industries and electroplating unit are incriminating sources of
heavy metal pollution.
DISCUSSION
The potential adverse impact of chemical and heavy metals as
well as pesticide found in much higher concentration leads to
various health problems as even significant pesticide residue
levels have been found in milk samples also. So certain steps
must be taken for improving the quality of life, hence
 There should be regular monitoring of drinking water
quality for physical and chemical parameters, heavy
metals and pesticides.
 There is a need for regular monitoring of water quality
of drains, industry and municipal bodies for pollution.
 Health department should have a continued survey to
identify acute and chronic effect due to heavy metals
and pesticides.
 Biomedical waste management must be done to
prevent contamination of drinking water
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
 Agriculture department should also undertake regular
monitoring of pesticides and heavy metals in food
grains, vegetables, fruits and milk.
 Finally sources of water pollution from industry must
be identified, so that timely improvement of water
quality can be carried out and industries should treat
their effluent before discharging into water bodies.
REFERENCES
1 Charles Ford Runge (1987), “Induced Agricultural
Innovation and
2 Environmental Quality: The Case of Groundwater
Regulation”, Land
3 Economics vol63. No.3 August.
4 Charlisle W. Abdalla, Brain A. Roach, and Donald J.
Epp (1992), “Valuing
5 Environmental Quality Changes using Averting
Expenditures: An Application to Groundwater
Contamination”, Land Economics, vol. 68(2) May.
6 Ecological Economist Unit – Institute for Social and
Economic Change, (1999),
7 “Environment in Karnataka” A Status Report,
Economic and Political Weekly, Sep.18.
8 Gunnar S. Eskeland and Emmanuel Jimenez (1992),
“Policy Instruments for Pollution Control in
Developing Countries”,The World Bank Research
Observer, vol.7, No.2.
831
ISBN: 978-81-924893-0-8
9 Gunnar S. Eskeland and Emmanuel Jimenez (1992),
“Policy Instruments for Pollution Control in
Developing Countries”,The World Bank Research
Observer, vol.7, No.2.
10 Living Standards Measurement Survey Unit, (2002),
“Survey of Living Conditions-Village Questionnaire
(Uttar Pradesh and Bihar) ”, World Bank.
11 Murthy.M.N., James A.J. and Smitha Misra.(2000),
“Economics of Water Pollution The Indian
Experience”,Oxford University Press, New Delhi.
12 Nemat Shafik (1994), “Economic Development and
Environmental Quality-An Econometric Analysis”,
Oxford Economic Papers 46.
13 Richard E. Just and David Zilberman (1988), “A
Methodology for Evaluating Implications of
Environmental Policy Decisions in Agriculture”, Land
Economics, vol64. No.1 February.
14 Ronald.H. Coase. (1960), “The Problem of Social
Cost”, Journal of Law and Economics, No.3.
15 Water Resource Organisation, (2001), “Noyyal River
System- Hydraulic Particulars- Report”, PWD,
Coimbatore
16 Water Resource Organisation, (2001), “Report on
Noyyal Orathupalayam Dam Schemes”, PWD,
Coimbatore.
17 Xia Guang (2000), “An Estimate of the Economic
Consequences of Environmental Pollution in China”,
Policy research Center of the National Environmental
Protection Agency, Beijing, China.
Agriculture Sciences
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Determination of attenuation coefficient and water
content of Broccoli leaves using beta particles
Komal Kirandeep Parveen Bala
Department of Mathematics, Statistics and Physics,
Punjab Agricultural University Ludhiana, India-141004
adsphy@gmail.com
ABSTRACT
Water content in the leaves of Broccoli is determined based
on their attenuating characteristics to beta particles of 204Tl.
The mass attenuation coefficient is obtained as the slope of
leaf thickness versus logarithm of relative transmission
intensity. As the water content in the leaves varies, these
parameters also vary. The transmission intensity decreases
with increase of water amount in plant leaves. Beta
attenuation is a fast, reliable and non destructive method that
provides continuous monitoring of plant water status.
Keywords
Mass attenuation coefficient, Water content of leaves, Beta
particle transmitted intensity, Non- destructive inspection
1. INTRODUCTION
Mass attenuation coefficient of a material is the measurement
of its capability to absorb or scatter radiations as they pass
through them. The attenuation studies in matter have helped a
lot in solving variety of problems in physical sciences, bio-
sciences, agricultural science and medical physics [1]. Beta
particle attenuation yields fundamental information on
material composition such as thickness, water content etc.
Nathu Ram et al. [2], Thontadarya [3], Batra et al. [4] have
witnessed the measurement of mass attenuation coefficients
through different materials as a function of energy, atomic
number of the absorber and experimental geometries.
Mahajan [5] measured attenuation coefficients for some
elements and found to be in agreement with empirical
relation.
Water content of the leaves and vegetation on the larger scale
is an important variable in physiological plant activities. It
maintains their vitality, photosynthetic efficiency and hence is
an important production limiting factor. Actual water content
of the leaves and plants varies with its type and the
environmental conditions. When leaves dry up, they mainly
lose their water content, hence water content is a strong
indicator of vegetation stress also. Mederski [6] introduced
beta radiation gauge for measuring relative water content in
leaves of soyabean plant. Jarvis and Slatyer [7], Obrigewitsch
et al. [8] made an attempt to calibrate the beta gauge for
determining the leaf water status using cotton leaf as absorber.
For calibration purpose, the methods require the fully turgid
leaf in addition to completely dry and fresh leaves. Beta
gauging technique makes the method little awkward due to
the loss of organic matter. However, in present work the
technique is modified by estimating the absolute water content
through fresh leaves using Geiger Muller counter.
Some spectroscopic methods have also been used to
determine water content in leaves. Xiangwei et al. [9] used
parameters such as leaf reflectance, correlation coefficients
and spectral index for determining crop water content. Ullah
832
ISBN: 978-81-924893-0-8
Amandeep Sharma
et al. [10] estimated leaf water content from the mid to
thermal infrared (2.5–14.0 μm) spectra, based on continuous
wavelet analysis. Yi et al. [11] used hyperspectral indices to
estimate water content in cotton leaves. It aimed on the
relation between water content and hyperspectral reflectance.
It aimed to identify an index for remote water content
estimation and correlated field spectral measurements to leaf
water content. Recently, Giovanni et al. [12] detected crop
water status in mature olive groves using vegetation spectral
measurements and regression. However, this technique
requires the availability of full spectra with high resolution,
which can only be obtained with handheld spectro-
radiometers or hyper-spectral remote sensors.
A more reliable beta attenuation technique overcomes the
sophistication of instruments/techniques used in spectroscopic
methods and measures the water content in a convenient way.
Although the beta-gauging technique has been explored in the
past for several applications, yet the direct use of measured
mass attenuation coefficient has not been utilized successfully
for applied work. To the best of our knowledge there is no
study of this type, plotting moisture content versus transmitted
intensity, for Broccoli leaves using beta particles from 204Tl.
2. THEORY
Water constitutes the major portion in a plant leaf, thus
changes in water content of plant leaves are reflected by
changes in the absorber thickness. The attenuation of beta
radiation through a leaf depends upon mass per unit area of
the leaf. The intensity of transmitted beta radiation through a
plant leaf , is given as;
I= (1)
Where I0 is the intensity of the unattenuated beta radiation, t
and µ are the thickness and mass attenuation coefficient
respectively of leaf (organic matter and water). From this
equation mass attenuation coefficient (µ) can be calculated by
knowing the other quantities. Rewriting equation (1) for a
fresh leaf as
ln (2)
And for a completely dry leaf
(3)
Where td, Id and µd are the mass per unit area, intensity and
mass attenuation coefficient respectively of completely dry
leaf (organic matter).
Since leaves contain organic matter and water, we can write
tw = t f - td (4)
Where tw is the mass of water per unit leaf area. Using
equations (2), (3) and (4), we get,
(5)
And n = µd/µf ; the ratio of mass attenuation coefficients of
completely dry leaves to those of fresh leaves. Thus, using the
experimental values of µd, µf and Id/I0 and measuring If/I0 for
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
a fresh leaf, equation (5) provides the absolute water content
in the plant leaf. For direct weighing measurements of leaf,
the percentage water content is given by the following
formula [8]:
% water content = x100 (6)
3. EXPERIMENTAL
The picture of experimental arrangement used in present
investigations is shown in Fig. 1. Radioactive source 204Tl
Fig 1: Experimental set-up for measurements
(end point energy 0.766 MeV) have been used as a source of
beta particles. The Geiger Muller counter is used for intensity
measurements of experimental study. The plant leaves of
broccoli that act as attenuating medium are held between two
rectangular equal sized aluminum sheets, having 2.5 cm
diameter matching holes. The distance between beta source
and GM window is kept 4.3 cm while placing leaf sample
almost at the middle of this gap. The source-absorber-detector
geometry is centrally aligned. This geometry is kept same
during the experiment, resulting in non-varying scattering and
air absorption effects. A Geiger Muller tube operating at the
middle of the beta plateau, at 450 Volt, is used for measuring
the beta intensity. The output of the tube is amplified and fed
to the discriminating and scaling units of a counter.
Leaves of Broccoli are taken from fields of Punjab
Agricultural University, Ludhiana. Leaves to be investigated
are washed with water and then soaked for a few minutes in
layers of blotting paper. Circles of radius 3.1 cm were cut
from the leaves and thickness of each circular leaf is
determined by weighing with an electrical balance having an
accuracy of 10-4 gm. The transmission studies of beta particles
are made through these fresh leaf circles. The observation
time chosen for each absorber thickness is 200 sec and
statistical error in observed counts remains below 2%. The
stability of the apparatus was checked by keeping it on for
sometimes and also by taking three or more readings for the
selected plant leaf.
The transmission studies of beta particles are made through
one fresh leaf circle. Another leaf circle was placed exactly
above this leaf circle and transmitted intensity was noted.
Likewise leaf circles are placed one above the other and their
transmission study was done. The counts are noted for the
increasing leaf circles till they showed sensitivity to the beta
particles and the apparatus. In second part of this work, for
variation in water content of leaves, one circular leaves is
833
ISBN: 978-81-924893-0-8
selected for investigations. The circular leaf is kept under an
IR lamp for one minute. This evaporates some amount of leaf
water and reduces its thickness (mg/cm2). Transmission of
beta particles is measured through this leaf and counts are
noted. The same leaf sample is again exposed to one minute
IR radiation, which causes further drying and reduction in
thickness. The transmitted intensity is measured again for this
dried leaf. This process is repeated till it shows sensitivity for
transmission intensity.
4. RESULTS AND DISCUSSION
The data for broccoli leaf thickness and logarithm of relative
transmission intensity has been shown in Table 1. The column
2 in data table contains the values for thickness of leaf. This
thickness (mass per unit area) includes water content and
organic matter of selected leaf. The column 3 shows the
logarithmic values of relative transmission through leaves
with different thickness.
The plot for this data of leave thickness versus logarithm of
relative transmission intensity has been shown in Fig.2. The
equations for the best fitted regression lines is linear one and
Table 1: Thickness versus counts of Broccoli with 204Tl
Sr. No. Thickness
-ln(I/I0)
(mg/cm2)
1. 28.62 0.713
2. 66.60 1.433
3. 100.80 2.060
4. 138.92 3.005
5. 174.58 3.730
6. 209.63 4.598
Fig.2.: The relative transmission (logarithmic) as a
function of leaf thickness
have been shown in the plot. This plot shows that relative
transmission intensity decreases linearly with increase of leaf
thickness. The slope of this fitted line gives the mass
attenuation coefficient (as per equation 1) and determined
value of µ is 0.0215 cm2/mg. A small value of attenuation
coefficient indicates that the material in question is relatively
transparent, while larger values indicate greater degrees of
opacity. Table 2 shows variation in water content, with
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Table 2: Data for Broccoli leaf and 204Tl beta source. The 5. CONCLUSION
errors in count rate indicate statistical uncertainties only The mass attenuation coefficient values are useful for
quantitative evaluation of interaction of radiations with leaves
Thickness
Absolute Moisture content (%) of plants. Measuring leaf water content can build knowledge
moisture Transmitted of the soil moisture status aiding in effective irrigation water
of leaf
content intensity management. The beta attenuation method overcomes the
(mg/cm2) Beta Direct
tw attenuation weighing sophistication of techniques used in spectroscopic methods.
34.47 9.87 28.63 28.22 5027±71 Moreover, the method is fast, non-destructive, an easy-to-
handle and hence can be utilized for planted leaves.
32.38 7.71 23.81 23.59 5228±72 Investigations based on beta transmission methods are rarely
30.88 6.27 20.33 19.88 5652±75 available for selected vegetable leaves that are grown in
seasonal conditions of this region. It will lay an important
29.66 4.93 16.62 16.58 5844±76
foundation for sustainable development and modern
28.50 3.81 13.36 13.19 6205±79 agricultural technology. There is also a need to simulate the
27.51 2.83 10.29 10.06 6429±80 present experiment with some suitable Monte Carlo
Simulation code for better understanding of present work to
26.52 1.99 6.37 6.71 6673±82 prototype the method in field practice.
25.63 0.98 3.82 3.47 6879±83
REFERENCES
exposure of leaf to IR heat radiation, and corresponding [1] Nilsson, B., Brahme, A. 2014. Interaction of ionizing
change in transmitted intensity. The Column 2 of this Radiation with matter. Reference module in Biomedical
table shows decreasing values for the thickness of water Sciences, from Comprehensive Biomedical Physics. 9,
content (calculated by equation 5) and is also known as the 1-36.
absolute moisture content. The percentage moisture content of [2] Nathu, R., Sundra Rao, I.S. and Mehta, M.K. 1968. Mass
the leaf by beta attenuation method and by direct weighing absorption coefficients and range of beta particles in Be,
(calculated by equation 6) has been shown in columns 3 and 4 Al, Cu, Ag and Pb. Pramana.18,121-126.
respectively. A comparison and close agreement of measured
values by two methods provides authenticity of beta [3] Thontadarya, S.R. 1984. Effect of geometry on mass
attenuation technique. Column 5 shows the transmitted attenuation coefficient of beta particles. Appl. Radiat.
intensity values, for different leaf thickness, increases with Isot.,35,981-982.
decrease in water content of leaves which must be obvious [4] Batra, R.K., Singh B. and Singh K. 1992. Determination
too. The errors quoted (less than 2%) in count rate indicate of water content of Plant Leaves by Beta attenuation.
statistical uncertainties only. The slope of fitted lines (Fig.3) Appl. Radiat. Isot.,43,1235-1239.
is negative because increase of water content causes
more absorption of beta particles and hence decrease of [5] Mahajan, C.S. 2012. Mass attenuation coefficients of beta
transmitted intensity. The best-fit straight line serving as particles in elements. Science Research Reporter, 2, 135-
calibration curves provide an alternative way to measure 141.
moisture content. We believe that the present experimental
[6] Mederski, H.J. 1961. Determination of internal water
findings with regard to agricultural fields will be quite useful
status of plants by beta ray gauging. Soil Sci., 92, 143-
to other investigators in improving their design for field
146.
instruments.
[7] Jarvis, P.S., Slatyer, R.O. 1966. Calibration of beta gauge
for determining leaf water status. Sci.,153, 78-79.
[8] Obrigewitsch, R.P., Rolston, D.E, Neilson, D.R.,
Nakayama, F.S. 1975. Estimating relative leaf water
content with a simple beta gauge calibration. Agron
J.,67, 729-732.
[9] Xiangwei, C., Wenting, H. and Min, L., 2011.
Spectroscopic determination of leaf water content using
linear regression and artificial neural network. African J.
biot., 11, 2518-2527.
[10] Ullah, S. , Skidmore, A.K., Mohammad, N., Schlerf, M.
2012. An accurate retrieval of leaf water content from
mid to thermal infrared spectra using continuous
wavelet analysis. Sci Total Environ., 431, 145-152.
[11] Yi, Q., Bao, A., Wang, Q., Zhao, J., 2013. Estimation of
leaf water content in cotton by hyperspectral indices.
Comput & Electr Agri., 90, 144-151.
[12] Giovanni, R., Mario, M., Giuseppe, C., Guiseppe P.,
Fig3: Variation of transmitted intensity as a function of
2014. Dectecting crop water status in mature olive
water content and thickness of broccoli leaf
groves using vegetation spectral measurements, Biosys
Engin.,128, 52-68.

834
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
The Study of Cloud Computing Challenges in Agriculture with
Special Reference to Sangli District (MS)
Dalvi Teja Satej
Research Scholer,
JJT University, Zunzunu,
Rajasthan, India.
tejudal@gmail.com
ABSTRACT
In the present paper concepts and Cloud Computing
challenges in agriculture are highlighted. Cloud Computing is
delivery of computing services rather than the product. Where
by shared resources, software and information are provided to
computers and other devices as a utility over a network. Cloud
computing will gives us great facility to store our data
remotely and use that data on demand. Cloud computing
technology is nothing but on-demand resource sharing
technology. As we all know that agriculture is the main part
of Indian Economy, in different manner like food supply,
main source of employment as well as earning of foreign
exchange through export of agricultural commodities like
grapes, sugar, turmeric, other food grains, etc. so there is need
to improve the productivity of such products along with the
quality. This will help us to improve the economic status of
Sangli district people and that’s why one need’s to use cloud
computing technology for better results. The lack of
knowledge regarding the ICT and its use in the development
is necessary. Some of the challenges such as availability,
connectivity, literacy, ICT awareness are in Sangli district
(MS) for use the cloud computing in agriculture.
Keywords
Cloud Computing, Krushi Mitra Cloud, Challenges in cloud
computing.
1. INTRODUCTION
Overview of cloud computing
Cloud computing, often referred to as simply “the cloud,” is
the delivery of on-demand computing resources, everything
from applications to data centers over the internet on a pay-
for-use basis. Cloud computing is not application oriented but
service oriented. It offers on-demand basic cloud computing.
Environment virtualized resources as measurable and billable
utilities. The main idea behind cloud computing is to provide
the information to the used as and when required. John
McCarthy [1] has already discussed regarding the facility in
the computing field. This facility provides the information to
the public. The cloud computing facility is provided [4] by the
service provider depending on the certain condition and the
requirement for the betterment of the user. Government is
providing many agricultural and development facilities using
the cloud. The cloud facility is prepared using the various
geographical, economical, metrological basis. Bohem and
et.al. stated different types of clouds [2]. The treats in the
cloud computing are given by Ashktorab and Taghizadeh [3].
835
ISBN: 978-81-924893-0-8
Kumbhar S.R.
Department of Electronics,
Willingdon College, Sangli,
srkumbhar@yahoo.co.in
For the deployment of the information many strategies are
used. A cloud can be deployed using any of the below
mentioned strategies.
1. Public Cloud can be accessed by any subscriber with
an internet connection and access to the cloud space for
its use in the public interest.
2. Private Cloud is established for a specific group or
organization and limits access to just that group and the
information is also dealt for the specific group..
3. Community Cloud is shared among two or more
organizations that have similar cloud requirements.
4. Hybrid Cloud is essentially a combination of at least
two clouds, where the clouds included are a mixture of
public, private or community.
There are three types of cloud providers [2] that user can
subscribe to:
 Software as a Service (SaaS)
 Platform as a Service (PaaS)
 Infrastructure as a Service (IaaS).
1. Software as a Service (SaaS)
SaaS is a hosted set of software that user didn’t own but
pay for the same element of utilization by user or some
other kind of consumption basis here you do not have to do
development or programming but you may need to come in
and configure the software you don’t have to purchase any
software.
2. Platform as a Service (PaaS)
This provides the hardware and the software together for
some application with certain services for common
function.
3. Infrastructure as a Service (IaaS)
IaaS is a delivery of hardware i.e. server, storage network
and associated software operating systems, virtualization
technology, file system as a service.
The business model of cloud computing [4-5] is depicted by
Fig. 1. According to the layered architecture of cloud
computing, it is entirely possible that a PaaS provider runs
its cloud on top of an IaaS provider’s cloud. However, in
the current practice, IaaS and PaaS providers are often
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

parts of the same organization. This is why PaaS and IaaS 2. CHALLENGES OF CLOUD
providers are often called the infrastructure providers or
cloud providers. COMPUTING IN AGRICULTURE
India is principally an agricultural country.
End User The agriculture sector accounts for about 18.0% of the
Interface (Web)
GDP and employs 52% of the total workforce. In this
paper Sangli District is taken as a research area.
The Indian climate divided in to six major climatic
Service Provider subtypes and Maharashtra state is having tropical monsoon
climate. One part of Sangli district is situated in river basins
Utility computing of Krishna and Warana and another part is famine. Sangli
district can be broadly divided into three agro-climatic zones
as under
Infrastructure Provider A. Western part of Shirala tahasil
B. Tahsils of shirala(East), Walwa , Miraj(West)
Fig. 1 business model of cloud computing
C. Tahsils of khanapur, Atpadi, Kavthe Mahankal,
Jat, Miraj(East) and Tasgaon(East)
Depending on the type of provided capability clouds
are used for various models such as service, business or Agriculture plays vital role in economic point of
agricultural model. The Fig 2 shows the four basic layers in view. The agricultural growth is totally depending on different
which resources are managed. kinds of cycles those are seasonal, climatic, topographic, etc.
Many time farmers from Sangli District may have to face with
one of the problem due to climate changes and all.
End user (SaaS) Application
In other countries like china, Japan fujitsu has
designed the cloud for agricultural development but
economical and technological point of view these countries
(PaaS) Platform are developed. India is developing country and economical
share of Sangli district’s in India’s economy is considerably
higher through agriculture. Sangli district is famous for
turmeric, Grapes etc. So to improve the productivity of Sangli
district farmers should know all the basic information
(IaaS) Infrastructure regarding market conditions, market demands etc.
Considering basic requirement of farmers from
Sangli district Krushi Mitra Cloud is designed. That will help
the farmer to get better results. This Krushi Mitra Cloud is
Hardware beneficial to farmers for better productivity and government
for economical development.
Cloud Computing is better solution to provide all
Fig. 2 Resource management layers
the facilities to the farmer as Cloud Computing is having
The four layer resource management has some specific various benefits like
function applicability. The application layer is at the top
which is related to the end user having the software as the  Data and applications are accessible from any
main functional part. Below that the platform layer which connected computer.
contains the software framework storage as PaaS layer. The  No data is lost if your computer breaks, as data is in
infrastructure layer has computation and storage block. And at the cloud.
the bottom the data containers consists of CU, memory, disks
and the bandwidth for the service. The four layers works  The service is able to dynamically scale to the usage
together to form the resource management layer. needs of your organization.
 Location Independent.
Characteristics of Cloud Computing  Cost Saving
The characteristics of the cloud computing are import from For all the above benefits of cloud computing, there
the cloud point of view. The various characteristics are given - are some challenges they are given bellow.
A. On-demand self-service.
The Krushi Mitra Cloud is specially designed for
B. Independency Sangli district according to the climate, soil patterns, etc. In
C. Elasticity of workload this cloud testing of soil will be done through soil sensors and
that will gives results regarding type of soil, total moisture in
D. Disaster Recovery soil, humidity of soil, rainfall and using this data experts will
E. Security. gives suggestion about which crop will gives more benefits or
maximum productivity from that soil. There are some more
facilities given by Krushi Mitra Cloud, instead of these

836
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

facilities there are some challenges regarding implementation 3. CONCLUSION

of cloud in agricultural sector in Sangli district.
 Computer availability
 Connectivity
 Computer Literacy
 Internet Awareness
1. Computer availability
Most of the part of Sangli district comes under rural area
and the financial condition of these people is very poor. So
to buy the computer systems are not affordable to the
respondent. The electricity supply is also not available
during 24 hours almost half the day load shedding is
applicable. The
Cloud Computing is really great technology which is
having various benefits. To implement these types of
technology in India is necessary because in case of ICT the
respondent should have to invest his money more as compare
to Cloud Computing. From the investment point of view the
respondent only invest his money to buy computer system and
internet connection. The expectations from the government of
India are the basic requirement is 24x7 power supply, strong
network connectivity. The government should provide special
schemes to access these things easily, like as we access
electricity, telephone connection having minimum charges for
rural areas. Because the success of this Cloud Computing in
Sangli district is totally depends on the rural area. Creating
awareness to these people about to adoption of this kind of
technology in their daily practices for better results.

2. Connectivity REFERENCES
Due to poor network, internet access is not much available [1] Andrei, T., & Jain, R. (2009). Cloud computing
for the villagers. The villagers are not able to by the
internet connections due to their economical condition and challenges and related security issues. … 
in the remote area of mountains and vast dry land the [2] Gao, J., Bai, X., & Tsai, W. (2011). Cloud testing-issues,
connectivity is not provided. Now attempts are mode to
provide the internet through the mobile services but still it challenges, needs and practice. Software Engineering: An
is not enough to reach to the common poor people. International Journal, 1(1), 9–23.
3. Computer Literacy [3] Ashktorab, V., & Taghizadeh, S. R. (2012). Security
As we all know Sangli district is having higher literacy Threats and Countermeasures in Cloud Computing.
ratio but in rural area in district these people unable to
International Journal of Application of Innovation in
aware of computer due to less number of computers are
available here. The use of ICT is least used in the district. Engineering & Management (IJAIEM), 1(2), 234–245.
4. Internet awareness. [4] Dalvi, T. S., and Kumbhar, S. R. (2014). Need of
Most of the people are not knowing the internet services. KRUSHI MITRA Cloud Model in Agriculture with
The cost of the internet services and speed is also not up Special Reference to Sangli District ( MS ),IJRCSIT Vol.
the desired level.
3(1), 28–31.
These are some challenges which are the main
barriers in implementation of Cloud Computing in [5] Application of Cloud Computing in Agricultural
agriculture sector in Sangli district. To avoid these barriers Development of Rural India, 4(6), 922–926.
government has to initiate because Krushi Mitra Cloud
provides various facilities to farmers to get profit from his
farm, and that is directly proportional to the economical
development of India. Then the question is what kind of
efforts government of India or Ministry of Agriculture
should have to take –
 Government of India should have to provide computer
systems in affordable price.
 They have to start training centers to avoid computer
illiteracy.
 To implement cloud computing there should be better
network coverage and government of India has to provide
better connectivity in low price.
 As these people got network connectivity easily then they
will automatically aware about use Internet.

837
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
BALER TECHNOLOGY FOR THE PADDY RESIDUE
MANAGEMENT – NEED OF THE HOUR
Er. Ankit Sharma
Assistant Prof. in Agri. Engg.,
PAU, Krishi Vigyan Kendra, Mansa
ankitsharma@pau.edu
ABSTRACT
Problems associated with the burning of paddy residues,
sincere efforts are needed to find ways and means to
efficiently utilize the huge amount of surplus rice
residues produced in the state for maintaining soil,
human and animal health, and increasing farmer’s
profits. To overcome this problem, a straw baler was
introduced by Punjab Agricultural University,
Ludhiana. Accordingly, the baler is used in Mansa
district of Punjab state since the last three years for
collecting and baling paddy straw in the combine
harvested fields. With the awareness of technology
among the farmers, there is continuously increase in
area under baler machine which is benefit for the farmer
community in terms of revenue and avoid serious
problem of straw burning.
KEYWORDS
Baler, paddy straw management, biomass
plant, income, pollution.
1. INTRODUCTION
In Punjab, the total production of paddy straw alone
contributes more than 22 million tonnes, from the 2.82 million
hectare cultivated area. Out of the total area under paddy
around 91% per cent paddy is harvested by combines (Gajri et
al 2002). Paddy straw is considered poor dry fodder for
animals due to high silica content. Therefore, the farmers are
burning it without bothering about the damage to ecology.
Burning of straw causes environmental pollution leading to
many diseases. Burning also produces CO2, which creates
green house effect during the short span of 15 - 20 days. The
Green house effect disturbs the natural climate of the planet.
In addition, burning also decreases the efficiency of some
herbicides used for controlling weeds in wheat crop (Singh et
al, 2012). Sincere efforts are needed to find ways and means
to efficiently utilize the huge amount of surplus paddy
residues produced. The paddy straw baler machine, which can
be used for making the bales of loose paddy straw, may be the
possible solution for the paddy residue management.
.
838
ISBN: 978-81-924893-0-8
Dr. Bharat Singh Bhattu
Incharge –cum- Associate Prof.
(Animal Science),
PAU, Krishi Vigyan Kendra, Mansa
bharatsingh@pau.edu
2. BALER TECHNOLOGY
The straw baler is used for collecting and baling
straw in the combine-harvested field. Before baling, first
stubble shaver is operated to harvest the stubbles from base
level. It can form bales of varying length from 40 to 110 cm.
The height and width of the bales is generally fixed at 36 cm
46 cm respectively. The weight of bales varies from 20 to 30
kg depending on moisture content of straw and length of
bales. The capacity of the baler varied from 0.30-0.35 ha/h.
Krihi Vigyan Kendra (KVK) Mansa has promoted the use of
commercially available paddy straw baler in the district with
the help of Punjab Agricultural University (PAU) Ludhiana,
Punjab. The management of paddy straw by use of baler was
practiced in 40 villages of Mansa district during the year
2013-14. Total area under management of paddy straw was
more than 550 ha in district Mansa. The bales were prepared
and sold @120/- quintal to the Bio-mass plant situated very
near to KVK Mansa. The area was covered by total 05 balers
including one baler of PAU, Ludhiana. Total quantity of
paddy straw including bales and loose straw received by bio-
mass plant from the farming community of various districts
was 12000 tonnes during the year 2013-14. Instead of selling
the paddy straw at bio-mass plants it can also be utilized in the
following industry for additional income:
 Paper industries use this as raw material for paper
production
 Dairy/cattle owners use it for fodder application and
urea treatment projects of straw.
 Packaging industry, mushroom industry, straw/board
manufactures, natural manure (wormi-compost) and
many more.
Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

3. ADVANTAGES OF USING PADDY

STRAW BALER
The straw baler technology creates the following advantages:
Avoid the serious problems associated with the burning of
paddy residues.
 Efficient utilization of the huge amount of surplus rice
residues produced in the state.
 Maintain soil, human and animal health.
 Increasing farmer’s profits to the tune of Rs. 2400/acre.
 It clean the field for sowing of next crop.
 It generates the employment as various peoples are
involving in collecting and transporting the straw from
field to the desire location.

Due to the interventions of KVK Mansa and

demand of paddy straw in the biomass plant, farmers have
started collecting the paddy straw for sale to biomass plants.
Total area where straw was collected by paddy straw bale
reached to more than 550 ha from Nil. Similarly total village
where this technology has spread is 40. Farmers have even
started collecting loose straw for sale.

REFERENCES
[1] Gajri, P R, Ghuman B S and Singh S 2002. Tillage
and residue management practices in rice-wheat
system of Indo-Gengetic plains – Diagnostics survey,
Technical report of NATP at PAU, Ludhiana by
ICAR Pp. 1-12.

[2] Singh Avtar, Kaushal Meenakshi and Singh Harmeet

2012. Improvement in productivity of wheat with
crop residue and nitrogen-a review. Asian Journal of
Biological and Life Sciences 1 (3): 139-46.

839
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Study on Constraints of Broiler Farming
Entrepreneurship in Mansa District of Punjab
Dr. Bharat Singh Bhattu, Er. Ankit Sharma
Incharge –cum- Associate Prof. Assistant Prof. in Agri. Engg.,
(Animal Science), PAU, PAU, Krishi Vigyan Kendra,
Krishi Vigyan Kendra, Mansa Mansa
bharatsingh@pau.edu
ABSTRACT
A survey work was designed to study the present management
status, impact of farm sizes on adoptability of various
recommended practices and major constraints faced by broiler
farmers in adoption of improved broiler farming technologies
in Mansa districts of Punjab. To undertake this survey work,
total 25 broiler farmers were selected for the collection of
data. Analysis of data revealed that 40.00 per cent farmers
complained about non-availability of quality day old chicks.
Overall 60.00 per cent farmers expressed their views
regarding the high cost and poor quality of inputs including
costs of quality day old chicks, constructional material, feed,
medicines, equipments and machineries. Total 80.00 per cent
farmers also complained about non-availability of loan
including rigid procedure for supply of loans. Total 24.00 per
cent farmers also complained about high cost of electricity.
Total 48.00 per cent farmers faced the problem of oligopsony
marketing structure for purchase of quality day old chicks,
feed, medicines and sale of broilers including high cost of
transportation whereas total 72.00 per cent farmers also
showed about their lack of knowledge of scientific broiler
farming including construction of shed, winter and summer
management, feeding and watering. Total 44.00 per cent
farmers criticized the non-remunerative prices of broilers,
24.00 farmers faced the problem of non-availability and
higher costs of labours whereas 64.00 farmers also faced the
problem regarding incidence of diseases including lack of
diseases investigation and monitoring facilities at proper time.
KEYWORDS
Broiler farming, Adoption, Feeding, Production,
Management, Constraint.
1. INTRODUCTION
Punjab is predominantly dependent on agricultural
economy and the size of average land holding is very
small. Moreover, the agricultural production has
reached its plateau and there is not much scope of
further improvement unless we increase the soil fertility
and water resources that are costly inputs. At present,
income from arable farming alone is hardly efficient to
maintain the livelihood of farmers and their families.
Therefore, adoption of mixed farming is the solution for
increasing agricultural production and raising the
economic status of the farmers. Mixed farming ensures
judicious utilization of resources for agriculture and
adopted suitable animal science enterprise viz. Layer
farming, broiler farming, dairy farming, pig farming,
840
ISBN: 978-81-924893-0-8
Dr. Gurdeep Singh
Asstt. Professor, Extension
Education, PAU,
Krishi Vigyan Kendra, Mansa
rabbit farming, sheep and goat farming, Kennel/dog
farming etc.
The main aim of animal science enterprise with crop
farming is to improve the employment opportunities
and income potential. The major thrust is to increase
quality milk and milk products, meat, wool, pups
production with crop production through transfer of
improved animal husbandry technologies. The results of
existed animal science enterprise with crop production
inferred that mixed farming system increase
productivity and enhance the per capita income and
provide employment throughout the year for the small
and medium farmers in particular and large farmer in
general. Therefore, we can say animal science
enterprise with arable farming has immense potential to
address the burning problems like unemployment,
nutritional security and socio-economic upliftment of
the people.
However, setting up of these enterprises and securing
loans for them is not a planned option. The prospective
borrowers set up these enterprises as a means of their
livelihood, as they do not have the required background
or training. Even, the educated youths, rural and/or semi
urban dwellers do not possess the adequate knowledge
of preparing a viable plan/project for these enterprises.
Yet, bankers extend financial assistance to these
untrained persons under compulsion, so as to meet the
financial targets. The entire process, though not very
scientific, has come to stay as proposals carry some
short comings, which include:
 Higher investment in fixed assets;
 A little or no training;
 Higher borrowings;
 Non-profitability of enterprises and
 No background or forward linkage.
These lacunae lead to high rate of failures. In view of
these facts and providing avenues for self employment
and income generation, there is urgent need to sensitize
the farmers/farm women, educated youths, rural and/or
semi-urban dwellers to establish scientific broiler
farming units as a subsidiary occupation amongst the
animal science enterprises. In Punjab, broiler farming
has emerged as the fastest growing segment of
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

agriculture registering a phenomenal growth in frequencies of each response/constraint were worked

production. out and expressed in percentage.
Hardly any survey work has been carried out to study 4. IDENTIFICATION, DESCRIPTION
constraints of broiler farming in Punjab. Accordingly,
the identification/recognition of non-adoption of AND ANALYSIS OF EXISTING
recommended technologies is essential to formulate DAIRY FARMING SYSTEMS
adequate measures to circumvent the crisis befalling the
broiler industry. Therefore, the present survey work has
The data presented in table-2 shows that total number of
been designed to study the present management status
in adoption of scientific methods of broiler farming in poultry units is 90 in district Mansa. Out of these, two
Punjab. Keeping these points in view, the present work are layer units whereas 90 are broiler units. In addition
will be undertaken with following specific objectives. of these, about 20 broiler units are under construction.
There is no hatchery in District Mansa. Generally, the
1. To study the existing management practices adopted
by the broiler farmers. farmers purchased their day old chicks from Guargoan,
Jind, Jalandhar, Hisar and, Malerkotla @ Rs. 22-28/
2. To study major constraints faced by broiler farmers
chick. They purchased the feed for broilers from
in adoption of dairy technologies.
Rajpura, Khanna, Dhuri, Lehragagga, Patiala, Jind,
2. AREA OF THE STUDY bathinda, Hisar, Dabawali @ Rs. 2700-2800/ quintal for
To undertake this work all blocks of Mansa district was starters and @ Rs. 2500-2600/ quintal for finishers.
selected. Out of each block, two or three villages were A gap was observed in adoption of recommended
selected where broiler farming was highly concentrated.
practices regarding poor quality of day old chicks,
In each block, 05 broiler farmers were selected at
random. Accordingly, total 25 broiler farmers were balance feeding, deworming, and health care. Table-2
selected for the collection of data by survey method as also reveals that farmers have lack of accurate
detail is given below in knowledge to prepare domestic ration. It was also
Table-1: Selection of broiler farmers for collection of observed that broilers farmers do not prepare their own
data in Mansa district of Punjab domestic feed. Farmers are also facing the difficulty in
timely detection of diseases due to lack of knowledge
and diseases diagnostic laboratories. Major reasons for
Name Name of the Name of the Total no. of low productivity are poor genetical potential of chicks,
of the Block selected farmers
District villages selected higher feed conversion ratio, poor management due to
lack of knowledge of recommended broiler
Mansa Mansa Khiala Kalan, 05 management practices and birds are infected by
Tamkot,
numbers of diseases due to harsh climatic conditions.
Aliser
Table-2: Identification, description and analysis of
Sardulgarh Ahloopur, 05
Fattamaluka existing broiler farming systems
Bhikhi Kotra Kalan, 05
Kishangarh
Pharmahi
Budhladha Boha, Bareta, 05
Fafrebhaike
Jhunir Bajewala, 05
Dasomdia
Total 25

3. COLLECTION OF DATA
By reviewing the literature and through discussions
with university experts and extension personnel, a
questionnaire was prepared. The responds of broiler
farmers were collected on a two point response category
viz. “agree” and “disagree”. The data collection
commenced from the beginning of the July, 2014 and
was carried through the end of December, 2014. The

841
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Sr. of knowledge of
Particulars Existing situation
No. recommended broiler
management practices
1. Total poultry units 92
Age at the time of
2. Total layer units 02 17. 35-44 days
sale of broilers
3. Total broiler units 90
Weight at the time
18. 1.5-3.0 kg
Broiler units of sale of broilers
started after 1.5:01 to 1.8:01
4. obtaining the 60 FCR at the time of
training from 19. (Feed in kg : weight in
sale of broilers
KVK, Mansa kg)
Total broiler units Generally sales @ Rs.
5. 20 20. Sale rate of broilers
under construction 70-120/ kg live weight
No. of hatcheries in 21. Mortality 04-08%
6. Nil
District Mansa
Source of Guargoan, Jind,
7. availability of day Jalandhar, Hisar,
5. GENERAL EXISTED
old chicks malerkotla MANAGEMENT PRACTICES
ADOPTED BY VARIOUS
Existing rate of day Generally @ Rs. 22-28/
8.
old chicks chick CATEGORIES OF BROILER
FARMERS
Rajpura, Khanna, Dhuri,
Source of Do Overall 60 per cent farmers acquired broiler
Lehragagga, Patiala,
9. availability of entrepreneurial development training programme before or
Jind, bathinda, Hisar,
broiler feed after starting the broiler farms whereas total 20 per cent
Dabawali farmers have taken loan from various financial institutions for
Generally @ Rs. 2700- establishment of broiler farms. The orientation of broiler
Existing rate of 2800/ quintal for starters sheds should be East to West lengthwise and 70.00%, broiler
10. farmers established correct broiler houses according to their
broiler feed and @ Rs. 2500-2600/
directions. All the farmers are adopting deep-litter system of
quintal for finishers housing. They are adopting all-in all-out system (single batch
Preparation of Lack of accurate at a time).Only 4.0% farmers analysed their feed and or water
sample from various resources. As per the recommendations,
11. balanced feed at knowledge to prepare
height of roofs of broiler house should be minimum 10 feet,
domestic level domestic feed whereas height of side walls of house should not be more than
Use of vitamins, 2 feet and rest of the space should be covered with wire
netting which offer less resistance to air movement, the
mineral mixtures,
farmers do not adopted these recommendations due to lack of
antibiotics, accurate knowledge and higher initial costs. Most of the
probiotics (growth Mainly use by medium farmers know very well that sprinklers on roof help in
12. promoters) for and large broilers reducing the temperature even upto 100°F during the hot and
better productivity farmers dry weather. Fogging is an effective method for reducing the
and health temperature in the house especially when relative humidity is
maintenance of the low. Shade is the simplest and relatively inexpensive tool for
birds combating heat. Shade trees scattered around the sheds help to
keep the sheds cool during the season but the adoption of
Winter/summer stress these recommendations is also very rare. Only 16% farmers
Reasons for spread
13. conditions and poor are adopting vaccination schedule in broilers to control
of various diseases diseases (Marek’s at 1st day, RDV F1 at 5-7th day, IBD
management
Vaccine at 14thday, RDV La Sota at 21st day and IBD
14. Deworming Lack of knowledge Vaccine-Booster at 28th day of age). Most of the farmers are
adopting the proper floor space/bird, feeder space/bird and
Proper FYM pits are not waterer space/bird as per the recommendations (450 cm2, 3
Correct practice of
available. Generally sold cm and 1.5 cm up to the age of 18 days and1000 cm2, 6-7 cm
disposal of manure/
15. to owners of Bricks Kiln and 3 cm, respectively at the age from 19 days to 42 days).
excreta produced
or farmers as a manure The broilers farmers don’t know about the maximum levels of
waste certain ingredients in a safe water supply for broilers (total
@ Rs. 100/ quintal
dissolved solids =1000ppm, total alkalinity = 400ppm, pH =
Major reasons for Poor genetical potential 8.0, Nitrates = 45ppm, Sulphates =250ppm, Sodium Chloride-
16. of chicks and poor growers=500ppm). They used fresh water but don’t aware
low productivity
management due to lack about water temperature and feed consumption (water

842
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

temperature should be 65°F to 70°F and generally at 70°F machineries. Total 80.00 per cent farmers also
chickens will consume two litter of water for one kg of feed complained about non-availability of loan including rigid
consumed). Most of the farmers having lack of accurate procedure for supply of loans. Total 24.00 per cent
knowledge about proper ventilation, litter management, light farmers also complained about high cost of electricity.
management, feed management and water management.
Total 48.00 per cent farmers faced the problem of
Table 3: Constraints encountered by the broiler oligopsony marketing structure for purchase of quality
farmers in adoption of recommended technologies day old chicks, feed, medicines and sale of broilers
(in percent) Place Tables including high cost of transportation whereas total 72.00
per cent farmers also showed about their lack of
Sr. Existing knowledge of scientific broiler farming including
Constraints
No situation construction of shed, winter and summer management,
feeding and watering. Total 44.00 per cent farmers
1. Non-availability of quality day old chicks 40 (10) criticized the non-remunerative prices of broilers, 24.00
farmers faced the problem of non-availability and higher
High cost and poor quality of inputs
costs of labours whereas 64.00 farmers also faced the
including costs of day old chicks,
problem regarding incidence of diseases including lack of
2. constructional material, feed, 60 (15)
diseases investigation and monitoring facilities at proper
medicines, equipments, machineries
etc.
time.

Non-availability of loan including rigid 7. RESULTS AND DISCUSSION

3. 80 (20)
procedure for supply of loans
An in-depth analysis of practices followed under
feeding aspect revealed that all the respondents fed
4. High cost of electricity 24 (06)
purchased unanalyzed rations. Use of minerals, vitamins,
Oligopsony marketing structure for antibiotics, pro-biotics, enzymes etc. for broiler feeding
purchase of quality day old chicks, feed, on regular basis was not common practice. High cost and
5. 48 (12) poor quality of inputs, oligopsony marketing structure,
medicines and sale of broilers including
high cost of transportation non-remunerative prices of broilers including high cost of
transportation, lack of knowledge of scientific broiler
Lack of knowledge of scientific broiler farming, incidence of diseases including lack of diseases
farming including construction of shed, investigation and monitoring facilities, high cost of
6. 72 (18)
winter and summer management, electricity, non-availability of loan including rigid
feeding and watering procedure for supply of loans and higher costs of labours
are the major constraints of broiler farming.
Incidence of diseases including lack of
7. diseases investigation and monitoring 64 (16) On the basis of findings it could be concluded
facilities that the respondents scored highest in response to lack of
accurate knowledge of different recommended
8. Non-remunerative prices of broilers 44 (11) management practices, feeding and health aspect. Similar
results were also reported by Balamurugan and
Lack of availability and higher costs of
9. 24 (06) Manoharan (2014), Shaikh and Zala (2011) and Varinder
labours
Pal Singh, et. al., (2010) who observed that maximum
Figures in parenthesis indicate number of broiler farms constraints were found in management, feeding and
health care practices.
6. CONSTRAINTS ENCOUNTERED BY
8. CONCLUSION
THE VARIOUS CATEGORIES OF
BROILER FARMERS IN ADOPTION There was difference in adoption levels between
OF DAIRY TECHNOLOGIES different categories of respondents with regard to
procurement of day old chicks, feeding and management
practices of broiler rearing. The finding of the study
The broiler farmers were asked to express their
revealed that non-availability of quality day old chicks,
responses on constraints faced by them in adoption of
high cost of ration, rigid procedure for supply of loans,
broiler farming technologies. Their responses on
high cost and poor quality of construction materials,
constraints are presented in Table-3.
oligopsony marketing structure, incidence of diseases,
The data presented in Table-3 show that 40.00
lack of knowledge of scientific housing/feeding/lighting
per cent farmers complained about non-availability of
including temperature maintenance were the main
quality day old chicks. Overall 60.00 per cent farmers
constraints expressed by broiler farmers. To increase the
expressed their views regarding the high cost and poor
adoption of broiler technologies, emphasis should be
quality of inputs including costs of quality day old chicks,
given to overcome all these constraints.
constructional material, feed, medicines, equipments and

843
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

9. SUGGESTIONS
For upliftment of broiler production and to
sustain the present pace of growth, certain steps are
required to be taken like licensing of hatcheries, so that
desired pressure is maintained for production and supply
of quality chicks to the producers. Strengthening and
establishments of disease diagnostic and feed testing
laboratories are immediately required. Producers have to
incur heavy losses for want of immediate diagnosis of
diseases. Some kind of legislation is also required so that
feed manufactures are obliged to put proper label on
feedbags with respect of composition. Timely information
about out-break of diseases must be monitored and
supplied to producers. The efforts may be made to
remove intermediatries by creating cooperative societies
both at the level of producers and consumers.
REFERENCES
[1] Balamurugan, V. and Manoharan, M. (2014). Cost
and benefit of investment in integrated broiler
farming - A case study. International journal of
Current Research and Academic Review, Vol.2 (4)
pp. 114-123.
[2] Shaikh and Zala, Y.C.(2011). Production
Performance and Economic Appraisal of Broiler
Farms in Anand District of Gujarat , Agricultural
Economics Research Review, Vol.23 pp 311-323.
[3] Varinder Pal Singh, et. al., (2010). Broiler
Production in Punjab - An Economic Analysis ,
Agricultural Economics Research Review, Vol.23
pp 315-324.

Moreover, to adopt broiler farming on

commercial scale, the economic feasibility and up to date
management knowledge is a pre-requisite. Therefore,
apart from PAU/GADVASU/KVK’s, other departments
and financial agencies must provide practical training and
guidance on scientific management of broilers and framed
the different schemes for the benefit of users according to
the continuous changing scenario of feed and meat prices.

844
Business Administration
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
Constraints and Opportunities Faced by Women
Entrepreneurs in Developing Countries- with Special
Contest to India
Kamaljit Singh
Assistant Professor
Bhai Gurdas Institute of Engg. & Tech
Sangrur
ABSTRACT
Woman constitutes the family, which leads to society and
Nation. Social and economic development of women is
necessary for overall economic development of any society
or a country. Entrepreneurship is the state of mind which
every woman has in her but has not been capitalized in
India in way in which it should be. Due to change in
environment, now people are more comfortable to accept
leading role of women in our society, though there are
some exceptions. Our increasing dependency on service
sector has created many entrepreneurial opportunities
especially for women where they can excel their skills with
maintaining balance in their life. Propose of this empirical
study is intended to find out various motivating and de-
motivating internal and external factors of women
entrepreneurship. It is an attempt to quantify some for non-
parametric factors to give the sense of ranking these
factors. It will also suggest the way of eliminating and
reducing hurdles of the women entrepreneurship
development in Indian Context.
1. INTRODUCTION
Entrepreneurship refers to the act of setting up a new
business or reviving an existing business so as to take
advantages from new opportunities.
Thus, entrepreneurs shape the economy by creating new
wealth and new jobs and by inventing new products and
services. However, an insight study reveals that it is not about
making money, having the greatest ideas, knowing the best
sales pitch, applying the best marketing strategy. It is in reality
an attitude to create something new and an activity which
creates value in the entire social eco-system. It is the psyche
makeup of a person. It is a state of mind, which develops
naturally, based on his/ her surrounding and experiences,
which makes him/ her think about life and career in a given
way.
The women have achieved immense development in their
state of mind. With increase in dependency on service sector,
many entrepreneurial opportunities especially for women have
been created where they can excel their skills with
maintaining balance in their life. Accordingly, during the last
two decades, increasing numbers of Indian women have
entered the field of entrepreneurship and also they are
gradually changing the face of business of today, both literally
845
ISBN: 978-81-924893-0-8
Deepak Goyal
Student MBA
Bhai Gurdas Institute of Engg. & Tech
Sangrur
and figuratively. But still they have not capitalized their
potential in India the way it should be.
The first part of this paper deals with the ideas why to boost
the women entrepreneurship and what are the reasons that
propel women to undertake such profession. This part also
depicts the factors of hindrance of women entrepreneurship
and also the likely measures to be taken for removing such
obstacles that are affecting women entrepreneurship. The
second part deals with a review of various research studies
done on women entrepreneurship along with study on their
impact on various economies. The third part deals with
objectives and research methodologies. The fourth part
concentrates on analysis of data collected through
questionnaires to establish motivating and de-motivating
internal and external factors of women entrepreneurship. The
attempt has been made to rank these factors in regard to their
severity of impact on women entrepreneurship. The last part
of this study includes the suggestive measures for eliminating
and reducing the hurdles for the women entrepreneurship
development in Indian context.
Reasons for Boosting Women
Entrepreneurship
The role of women entrepreneurs in the process of economic
development has been recognized form nineties in various
parts of the world. Today, in the world of business, women
entrepreneurship has become an essential movement in many
countries and has been accepted in all areas of working. The
United Nations report has also concluded that economic
development is closely related to the advancement of women.
In nations where women have advanced, economic growth has
usually been steady. By contrast, in countries where women
have been restricted, the economy has been stagnant. The data
on correlation between Gender related development index and
GDP per capital reinforces the above fact:-
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

TABLE NO. 2

COUNTRY BUSINESS ASSOCIATION

TABLE NO. 1
GENDER RELATED DEVELOPMENT INDEX AND ITS Russia Novgorod Women’s Parliament,
COMPONENT Perm Business Women's Club,
St. Petersburg Institute for International
Gender Entrepreneurship Development.
related As a GDP per
development per % Capital
Rank Country of HDI US Business and Professional Women,
index (US$) National Association of Women
Business Owners (NAWBO)

1 Australia 0.966 98.9 34923 Nepal Women Entrepreneurs Association of

Nepal (WEAN)
2 Norway 0.961 99.6 53433
Malawi National Association of Business
3 Iceland 0.959 99.0 44613 Women (NABW)
4 Canada 0.959 99.2 35812
5 Sweden 0.956 99.3 36712 Reasons for women opting for
6 France 0.956 99.4 33674 entrepreneurship
7 Netherland 0.954 98.9 38694
Self-determination, expectation for recognition, self-esteem
8 Finland 0.954 99.5 34526 and career goal are the key drivers for taking up
entrepreneurship by women (Moore & Buttner, 1997).
9 Spain 0.949 99.4 31560 Sometimes, women chose such career path for discovering
their inner potential, calibre in order to achieve self-
10 Ireland 0.948 98.2 44613
satisfaction. It can also provide a mean to make best use of
14 India 0.594 97.1 4102 their leisure hours.
However, dismal economic conditions of the women arising
out of unemployment in the family and divorce can compel
As shown in the above table, Gender related development women into entrepreneurial activities.
index is significantly correlated with GDP per capita. The
value of correlation coefficient comes 0.857371. Therefore, it
can be treated as one of the parameter to show the economic Obstacles for women entrepreneurship
condition & growth of the country.
The entrepreneurial process is same for men and women.
Business association and Women Successful men and women entrepreneurs undergo similar
Entrepreneurship motivations and thus achieve success in largely same way
under similar challenges. They are also found to have access
Structural association and group of people also promote to fund from the same sources. The same condition both men
women entrepreneurship. A vital link to economic decision- and women can be successful entrepreneurs. (Cohoon et.al.
making processes, the business associations has made their 2010). However, in practice most of the upcoming women
members’ visions and priorities a part of the national political entrepreneurs face problems that are of different dimensions
and economic agenda. Around the globe many more and magnitudes than that faced by their male counterparts.
organizations are contributing in similar ways. Table 2 depicts These problems, generally, prevent these women
some of the business associations of some countries. These entrepreneurs from realizing their potential as entrepreneurs.
associations undertake wide varieties of activate The major hurdles that the women face during starting and
encompassing credit, business skill training,technical and running a company generally come from financing and
technology training, employment creation, marketing balancing of life. The balancing of life is caused due to lack of
services, legal assistance, psychological counselling and family support for the women.
some social welfare trade programs. These associations have
also played a positive and vital role in promoting international
trade for women entrepreneurs.
2. LITERATURE REVIEW

Darrene, Harpel and Mayer, (2008) performed a study on

finding the relationship between elements of human capital
and self-employment among women. The study showed that
self-employed women differ on most human capital variable
as compared to the salary and wage earning women. The
study also revealed the fact that the education attainment level
is faster for self employed women than that for other working
women. The percentage of occupancy of managerial job is
found to be comparatively higher in case of self employed

846
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

women as compared to other working women. This study also This table depicts the various internal and external factors that
shed light on similarity and dissimilarity of situations for self- affect the development of women entrepreneurship in various
employed men and self-employed women. Self-employed countries level, personal motivations, self-employed father,
men and women differ little in education, experience and social adroitness, interpersonal skills etc. There is a worldwide
preparedness. The analysis is based on data from the Current pool of economically active persons, known as the Women’s
Population Survey (CPS) Annual Social and Economic Indicators and Statistical Data Base (WISTAT), from which
Supplement (ASEC) from 1994 to 2006. one can extrapolate the general number of women
entrepreneurs. WISTAT titles the category “employers and
Jalbert, 2000 performed a study to explore the role of women own-account workers,” The category describes those who are
entrepreneurs in a global economy. It also examined how economically independent and who could be entrepreneurs.
women’s business associations can strengthen women’s The number of women to 100 men in each region is
position in business and international trade. The analysis is represented for three decades spanning 1970 to 1990. The
performed on the basis of facts and data collected through study revealed that the gap between men and women business
field work (surveys, focus groups and interviews) and through owners has narrowed significantly. In 1970 women numbered
examining the existing published research. The study has 26 for each 100 men, but by 1990 women numbered 40 for
shown that the women business owners are making significant each 100 men who were self employed Tambunan, (2009),
contributions to global economic health, national made a study on recent developments of women entrepreneurs
competitiveness and community commerce by bringing many in Asian developing countries. The study focused mainly on
assets to the global market. As per the analysis of the research women entrepreneurs in small and medium enterprises based
study, women entrepreneurs have demonstrated the ability to on data analysis and review of recent key literature. This study
build and maintain long-term relationships and networks to found that in Asian developing countries SMEs are gaining
communicate effectively, to organize efficiently, to be fiscally overwhelming importance; more than 95% of all firms in all
conservative, and to be aware of the needs of their sectors on average per country. The study also depicted the
environment and to promote sensitivity to cultural differences. fact that representation of women entrepreneurs in this region
Researchers contend that women business owners possess is relatively low due to factors like low level of education,
certain specific characteristics that promote their creativity lack of capital and cultural or religious constraints. However,
and generate new ideas and ways of doing things. These the study revealed that most of the women entrepreneurs in
characteristics include focus, high energy SMEs are from the category of forced entrepreneurs seeking
for better family incomes.
S.N. Country Factor
1. United States • access to information
• access to networks 3. OBJECTIVES
• To identify the reasons for women for involving
2. Korea • financing themselves in entrepreneurial activities
• the effort to balance work • To identify the factors of hindrance for women
and family entrepreneurship
3. Indonesia • exporting their product • To determine the possible success factors for
overseas women in such entrepreneurial activities.
• increasing the volume of • To make an evaluation of people’s opinion about
production women entrepreneurship.
4. Vietnam • formal education, ownership
of property, and social
mobility 4. METHODOLOGY
• business experiences
5. Bangladesh • Inadequate financing The research is based on secondary & primary data. It’s an
• balancing time between the exploratory & descriptive in nature. The secondary data is
enterprise and the family collected from review of past researches and other reports.
6. Uganda • lack of training and advisory The factors have been identified then classified into three
services categories factors responsible for hindrance, reasons for
• processes and starting the business & reasons for success in women
• difficulties in accessing entrepreneurship. Then these factors with their sub-
loans classification rated on likert scale of 1 to 5, where 1 denotes
7. Rwanda • restricted mobility least important & 5 denote most important. Then these factors
• security have been further analyzed through Chi square test to check
the difference between opinions collected from different sets
8. Morocco • lack of operational and
of people. PSW 18 has been use for calculation purposes.
managerial skills
• Cultural constraints
The data has been collected from the female students &
9. Kenya • lack of technical skills, faculty members only. It is just have common areas of
• confidence, concerns in both the sample group. All the three forms of
• strong individual factors analyzed from the viewpoints of marital status &
involvement occupation. Results show that one basis of marital status we
10 Mauritius • the hassle of getting permits find major differences of opinion at significance level of 5.
• the lack of market These are need for Money & others factors on which these
two sets of people have different opinion. However in
Table No. 3: SNAPSHOT OF KEY FACTORS hindrance reason we could not find any significant difference.
When it comes on success factors Marketing skills &

847
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

Preservation also have significant difference. (Refer No Obstacle 33 33%

hypothesis test summary for marital status in annexure) believing in your abilities 16 16%
Lack of information 8 8%
On the basis of occupation differences are more because two
sets have difference in generation also. Students & faculty Access to business support 18 18%
members have significant differences on various issues almost Entrepreneurial skills 12 12%
in every set of factors. Starting from hindrance factors they Combining family & work 10 10%
significantly differ on Raising Capital, Information & advice, life
skills & expertise, Gender discriminations & others. In the
second category of factors i.e. reasons for starting business Gender discrimination 3 3%
factors for significant difference are passion; need for money,
to become independent, self-satisfaction & others. In the When you face any problem in business with who will
category of success factors difference are on the issues like you?
quality of product & service, uniqueness of design & services, Own 23 23%
management skills & marketing skills & preservation. Advice from Husband & 50 50%
family
5. Results Advice from others 27 27%
Demographic Profile of the respondents is presented in Table
4.

Demographic Frequency Percentage Demographic Profile of the Sample

Age How is your self-confidence and self-esteem after
Under 25 Years 7 7% becoming anEntrepreneur?
25-34 Years 45 45% Very much 56 56%
35-44 Years 13 13% increased
45+ Year 35 35% Increased 38 38%
Education Qualification Not Increased 6 6%
Secondary Education 8 8% How important are the following success factors for
Graduation 32 32% women to get ahead?
Post-Graduation 55 55%
Formation/Training Course 5 5% 1 2 3 4 5
Who Advised You Undertake Present Line of Activity? Not Rele Neither Import Ver
Parents 19 19% Rele vant importa ant y
Husband 43 43% vant nt nor imp
Self-decision Making 26 26% relevant orta
Friends And Others 12 12% nt
What made you start your own business?  Optimisi
Profit making money 4 4% ng
Did not want to work for others 20 20% entrepren
eurial
Want for control & freedom 8 8%
spirit and
To make my own decision 12 12% skills
Social status 14 14%  Successf
Self-achievement 16 16% ully
Threat of losing my job 26 26% managin
How do you find the Attitude of the Family Members as g others
an Entrepreneur?  Successf
Helpful 78 78% ully
Not helpful 10 10% managin
Flexible 7 7% g myself
Sympathetic 5 5%  Having
Did you benefit from external support to set up your recognize
business? d
Financial Support 70 70% expertise
Legal Advice 8 8% in a
Technological support 12 12% specific
Networking 10 10% area
When you started your business, what were the main  Gaining
problems you faced? intercultu
ral and

848
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
language
skills
Total 2% 4% 12% 52% 30%
From the above information we found that 52% candidates are
agree with these factors are important for woman to go ahead
nd 30% are with these are very important factors. 12% are
said these are neither important nor relevant. And only 6% are
told these factors are relvent for woman to go ahead.
6. FINDINGS
 The elimination of obstacles for women entrepreneurship
requires a major change in traditional attitudes and mind-
sets of people in society rather than being limited to only
creation of opportunities for women. Hence, it is
imperative to design programmes that will address to
attitudinal changes, training, supportive services.
 The basic requirement in development of women
entrepreneurship is to make aware the women regarding
her existence, her unique identity and her contribution
towards the economic growth and development of
country.
 The basic instinct of entrepreneurship should be tried to
be reaped into the minds of the women from their
childhood. This could be achieved by carefully designing
the curriculum that will impart the basic knowledge
along with its practical implication regarding
management (financial, legal etc.) of an enterprise.
 Adopting a structured skill training package can pave the
way for development of women entrepreneurship. Such
programmes can train, motivate and assist the upcoming
women entrepreneurship in achieving theirultimate goals.
 As a special concern, computer illiterate women can be
trained on Information Technology to take the advantage
of new technology and automation.
 The established and successful women entrepreneurs can
act as advisors for the upcoming women entrepreneurs.
The initiatives taken from these well established
entrepreneurs for having interaction with such upcoming
women entrepreneurs can be proved to be beneficial in
terms of boosting their morale and confidence. It may
result in more active involvement of women
entrepreneurs in their enterprises.
 Infrastructure set up plays a vital role for any enterprise.
Government can set some priorities for women
entrepreneurs for allocation of industrial plots, sheds and
other amenities.
 Even in today’s era of modernization the women
entrepreneurs depend on males of their family for
marketing activities. This is simply because they lack the
skill and confidence for undertaking such activities.
Women development corporations should come forward
to help the women entrepreneurs in arranging frequent
exhibitions and setting up marketing outlets to provide
space for the display of products or advertisement about
services made by women.
7. CONCLUSION
The study tried to find out the difference among various set of
people of the crucial factors which are concerned with the
women entrepreneurial opportunities at large. Issues have
been identified through various review of literature. It should
be cross checked with the real entrepreneurs. These factors
849
ISBN: 978-81-924893-0-8
may vary from place to place business to business but women
entrepreneurship is necessary for the growth of any economy
weather it large or small.
REFRENCES
[1] Ayadurai, Selvamalar , (2005), An Insight into The
“Constraints” Faced by Women Entrepreneurs in A War-
Torn Area: Case Study
[2] of The Northeast of Sri Lanka, presented at the 2005 50th
World Conference of ICSB Washington D.C.
[3] Bowen, Donald D. & Hirsch Robert D. (1986), The
Female Entrepreneur: A career Development Perspective,
Academy of Management Review, Vol. 11 no. 2, Page
No. 393-407.
[4] Cohoon, J. McGrath, Wadhwa, Vivek& Mitchell Lesa,
(2010), The Anatomy of an Entrepreneur- Are Successful
Women Entrepreneurs Different From Men? Kauffman,
The foundation of entrepreneurship.
[5] Greene, Patricia G., Hart, Myra M, Brush, Candida G, &
Carter, Nancy M, (2003), Women Entrepreneurs:
Moving Front and Center: An Overview of Research and
Theory, white paper at United States Association for
Small Business and Entrepreneurship.
[6] Hackler, Darrene; Harpel, Ellen and Mayer, Heike,
(2008), “Human Capital and Women’s Business
Ownership”, Arlington, Office of Advocacy U.S. Small
Business Administration, August 2006, VA 22201 [74],
No. 323.
[7] Handbook on Women-owned SMEs, Challenges and
Opportunities in Policies and programmes, International
Organization for Knowledge Economy and Enterprise
Development.
[8] http://www.nfwbo.org/Research/8-21-2001/8-21-
(2001).htm
[9] Jalbert, Susanne E., (2008), Women Entrepreneurs in the
Global Economy, education research.
http://research.brown.edu/pdf/1100924770.pdf.
[10] Lall, Madhurima, &SahaiShikha, 2008, Women in
Family Business, presented at first Asian invitational
conference on family business at Indian School of
Business, Hyderabad.
[11] Mathew, Viju,(2010), “Women entrepreneurship in
Middle East: Understanding barriers and use of ICT for
entrepreneurship development”, Springer Science +
Business Media, LLC 2010
[12] Moore, D. P. &Buttner, E. H. (1997). Women
entrepreneurs: Moving beyond New Generation of
Women Entrepreneurs Achieving Business Success.
[13] Orhan M. & Scott D. (2001), Why women enter into
entrepreneurship: an explanatory model.
[14] Women in Management Review, 16(5): 232-243.
[15] Singh, Surinder Pal, (2008), An Insight Into The
Emergence Of Women-owned Businesses As An
Economic Force In India, presented at Special
Conference of the Strategic Management Society,
December 12-14, 2008, Indian School of Business,
Hyderabad.
[16] Tambunan, Tulus, (2009), Women entrepreneurship in
Asian developing countries: Their development and main
constraints, Journal of Development and Agricultural
Economics Vol. 1(2), Page No. 027-040.the glass ceiling.
Thousand Oaks, CA: Sage.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

ANNEXURE

Questionnaire

1. What is your age category?

Under 25 Year [ ] 25 - 34 Year [ ]
35 – 44 Year [ ] 45+ Year [ ]

2. What is your educational background?

Secondary Education [ ] Graduation [ ]
Post-Graduation [ ] Formation/Training Course [ ]

3. What made you start your own business?

Profit making money [ ] Did not want to work for others [ ]
Want for control & freedom [ ] To make my own decision [ ]
Social status [ ] Self-achievement [ ]
Threat of losing my job [ ]

4. Who Advised You Undertake Present Line of Activity?

Parents [ ] Husband [ ]
Self-decision Making [ ] Friends And Others [ ]

5. How do you find the Attitude of the Family Members as an Entrepreneur?

Helpful [ ] Not helpful [ ]
Flexible [ ] Sympathetic [ ]

6. Did you benefit from external support to set up your business?

Financial Support [ ] Legal Advice [ ]
Technological support [ ] Networking [ ]

7. When you started your business, what were the main problems you faced?
No Obstacle [ ] A question of self-confidence (believing in your abilities) [ ]
Lack of information [ ] Awareness/Access to business support [ ]
Entrepreneurial skills [ ] Combining family and work life [ ]
Gender discrimination [ ]

8. When you face any problem in business with who will you?
Own [ ] Advice from Husband & family [ ]
Advice from others [ ]

9. How is your self-confidence and self-esteem after becoming an Entrepreneur?

Very much increased [ ] Increased [ ]
Not Increased [ ]

10. How important are the following success factors for women to get ahead?

1 2 3 4 5
Not relevant Relevant Neither important nor Important Very important
relevant
 Optimising
entrepreneurial
spirit and skills
 Successfully
managing others
 Successfully
managing myself
 Having
recognized
expertise in a
specific area
 Gaining
intercultural and
language skills

850
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Descriptive Study of the Marketing Mix Strategies of
Milkfood Ltd.
Kamaljit Singh
Assistant Professor
BGIET, Sangrur
ABSTRACT
The Marketing Mix model (also known as the 4 P’) can be used by
marketers as a tool to assist in implementing the Marketing
strategy. Marketing managers use this method to attempt to
generate the optimal response in the target market by blending 4
variables in an optimal way. It is important to understand that the
Marketing Mix principles are controllable variables. The
Marketing Mix can be adjusted on a frequent basis to meet the
changing needs of the target group and the other dynamics of the
Marketing environment. The function of the Marketing Mix is to
help develop a package (mix) that will not only satisfy the needs
of the customers within the target markets, but simultaneously to
maximize the performance of the organization.
1. INTRODUCTION
Marketing your business is about how you position it to satisfy
your market’s needs. There are four critical elements in marketing
your products and business. They are the four P’s of marketing.
1. Product: - The right product to satisfy the needs of your target
customer.
2. Price: - The right product offered at the right price.
3. Place: - The right product at the right price available in the
right place to be bought by customers.
4. Promotion: - Informing potential customers of the availability
of the product, its price and its place.
Each of the four P’s is a variable you control in creating the
marketing mix that will attract customers to your business. Your
marketing mix should be something you pay careful attention to
because the success of your business depends on it. As a business
manager, you determine how to use these variables to achieve
your profit potential. This publication introduces the four P’s of
marketing and includes worksheets that will
help you determine the most effective marketing mix for your
business.
PRODUCT
“Product” refers to the goods and services you offer to your
customers. Apart from the physical product itself, there are
elements associated with your product that customers may be
attracted to, such as the way it is packaged. Other product
attributes include quality, features, options, services, warranties,
and brand name. Thus, you might think of what you offer as a
bundle of goods and services. Your product’s appearance,
function, and support make up what the customer is actually
buying. Successful managers pay close attention to the needs their
product bundles address for customers.
851
ISBN: 978-81-924893-0-8
Ramandeep Kaur
Student MBA
BGIET, Sangrur
PRICE
“Price” refers to how much you charge for your product or
service. Determining your product’s price can be tricky and even
frightening. Many small business owners feel they must
absolutely have the lowest price around. So they begin their
business by creating an impression of bargain pricing. However,
this may be a signal of low quality and not part of the image you
want to portray. Your pricing approach should reflect the
appropriate positioning of your product in the market and result in
a price that covers your cost per item and includes a profit margin.
The result should neither be greedy nor timid. The former will
price you out of the market; pricing too low will make it
impossible to grow. As a manager, you can follow a number of
alternative pricing strategies.
PLACE
“Place” refers to the distribution channels used to get your product
to your customers. What your product is will greatly influence
how you distribute it. If, for example, you own a small retail store
or offer a service to your local community, then you are at the end
of the distribution chain, and so you will be supplying directly to
the customer. Businesses that create or assemble a product will
have two options: selling directly to consumers or selling to a
vendor.
PROMOTION
“Promotion” refers to the advertising and selling part of
marketing. It is how you let people know what you’ve got for sale.
The purpose of promotion is to get people to understand what
your product is, what they can use it for, and why they should
want it. You want the customers who are looking for a product to
know that your product satisfies their needs.
2. REVIEW OF LITERATURE
Marketing mix is originating from the single P (price) of
microeconomic theory (Chong, 2003). McCarthy (1964) offered
the “marketing mix”, often referred to as the “4Ps”, as a means of
translating marketing planning into practice (Bennett, 1997).
Marketing mix is not a scientific theory, but merely a conceptual
framework that identifies the principal decision making managers
make in configuring their offerings to suit consumers’ needs. The
tools can be used to develop both long-term strategies and short-
term tactical programmers’ (Palmer, 2004). The idea of the
marketing mix is the same idea as when mixing a cake. A baker
will alter the proportions of ingredients in a cake depending on the
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

type of cake we wishes to bake. The proportions in the marketing

mix can be altered in the same way and differ from the product to
product (Hodder Education, n.d). The marketing mix management RESEARCH DESIGN
paradigm has dominated marketing thought, research and practice
Data Source : Primary& Secondary
(Grönroos, 1994), and “as a creator of differentiation” (Van
Research Approach : Observations, Survey
Waterschoot, n.d) since it was introduced in 1940s. Kent (1986)
Research Instrument :Questionnaire
refers to the 4Ps of the marketing mix as “the holy quadruple…of
Research Type : Descriptive
the marketing faith…written in tablets of stone”. Marketing mix
Sampling Unit : Respondents
has been extremely influential in informing the development of
Sampling Size : 50 people
both marketing theory and practise (Möller, 2006).
Contact Method : Personal
4Ps delimits four distinct, well-defined and independent
Sample Type : Simple Random Sampling
management processes. Despite the consistent effort by many
physical businesses to deal with the 4P in an integrated manner,
DATA COLLECTION SOURCE
the drafting but mainly the implementation of the P policies
remains largely the task of various departments and persons within
Data collection process has been completed by gathering data
the organisation. Even more significant thought is the fact that the
from primary and secondary source. Direct information is
customer is typically experiencing the individual effects of each of
advisable as it gives the correct information. The data collection
the 4Ps in diverse occasions, times and places, even in case that
was carried out by directly interviewing the rural and urban
some companies take great pains to fully integrate their marketing
people.
activities internally (Constantinides, 2002; Wang, Wang and Yao,
2005). However, a study by Rafiq and Ahmed (1995) suggested
APPROACH FOR COLLECTION OF DATA
that there is a high degree of dissatisfaction with the 4Ps
framework. Even, Overall these results provide fairly strong 1. Survey:
support Booms and Bitner’s (1981) 7P framework should replace A survey of 4 weeks was carried out in village to collect
McCarthy’s 4Ps framework as the generic marketing mix. information. Questionnaire was prepared and used as an
Development of marketing mix has received considerable instrument to gather information from the people.
academic and industry attention. Numerous modifications to the
4Ps framework have been proposed, the most concerted criticism 2. Observation:
has come from the services marketing area (Rafiq and Ahmed, While interviewing, the respondent was observed and all
1995). The introductory marketing texts suggest that all parts of additional information was jotted down which did not form the
the marketing mix (4Ps) are equally important, since a deficiency part of the questionnaire directly.
in any one can mean failure (Kellerman, Gordon and Hekmat,
1995). Number of studies of industrial marketers and purchasers Some of the questions of the research are listed below:-
indicated that the marketing mix components differ significantly a) To study whether people like "Milkfood" products?
in importance (Jackson, Burdick and Keith, 1985). Two surveys b) Which brand does people prefer the most?
focused on determination of key marketing policies and c) From which outlet do they prefer?
procedures common to successful manufacturing firms (Jackson, d) Are they satisfied with its prices?
Burdick and Keith, 1985). Thus, it appears from these studies that e) What changes they want to make in 'Milkfood' products?
business executives do not really view the 4 Ps as being equally f) Is 'Milkfood' products easily available in the society?
important, but consider the price and product components to be
the most important (Kellerman, Gordon and Hekmat, 1995). The I took a sample size of 50 rural and urban people which were
concept of 4Ps has been criticised as being a production-oriented divided into 4 age groups, viz.
definition of marketing, and not a customer-oriented (Popovic, a) Under 25 Years
2006). It’s referred to as a marketing management perspective. b) 25 - 34 Years
Lauterborn (1990) claims that each of these variables should also c) 35 - 44 Years
be seen from a consumer’s perspective. d) 45+ Years

3. OBJECTIVS OF STUDY A sample of rural and urban people was taken from each age
group. The samples were chosen on a random basis, which
The research conducted by me related Marketing Mix of Milkfood included people from all life styles
Products as key revival of Milk Plant.
1. To study marketing Mix strategies of Milkfood. Result
2. To study the various marketing mix that influence the customer Demographic Profile of the Sample
behavior.

Demographic Frequency Percentage

4. RESEARCH METHODOLOGY
AGE
I conducted a research on "4 P’s of Marketing - Key revival to Under 25 Years 12 24%
Milk Plant" Milkfood Products. The main reason of the research is 25-34 Years 12 24%
to study the 4 P’s of Marketing of Milkfood products among the
rural and urban people of various age groups. 35-44 Years 12 24%

852
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

45+ Year 14 28% Gain energy 30 60%

GENDER Advised by doctor 2 4%
For taste 7 14%
Male 36 72%
As a substitute of home 11 22%
Female 14 28% products
What is your occupation? Are Milkfood products easily available in the society?
Farming 9 18% Yes 39 78%
Shopkeeper 6 12% No 11 22%
Student 12 24% Why do you buy Milkfood products?
Buy when you don’t have home made 11 22%
Unemployed 13 26% products.
Homemaker 10 20% These are cheaper than the home 39 78%
How did you come to know about this brand? made products.
Glow Sign 0 0%
FINDINGS
Posters 17 34%
Human Source 17 34% After analyzing the primary data collected on the demand and
preferences of Milkfood products in the rural and urban area
Painting’s on 7 14% regarding 4 P’s of Marketing. I have come across some findings
dealers shop i.e. what is the choice of people, what are their preferences,
whether they are satisfied with the quality and what changes they
Magazines 9 18%
want to make in Milkfood's products. These findings can be
Have you ever purchased Milkfood products? summed up as follows:-
Daily 1 2% 1) People of all age groups had different choices of outlets from
Frequently 9 18% which they prefer to buy Milkfood products. Majority with a
choice of milk bars, which are liked by children and
Occasionally 18 36%
teenagers. Other like to buy from the societies.
Never 22 44% 2) Majority of people is satisfied with the prices but adult
Do you like milkfood products? citizens say that they want the prices should be reduced
Very much 35 70% 3) About the changes they want to make in Milkfood products,
Not much 1 2% majority of them said that they want the quantity to be
changed followed by a change in the price. They were
Average 9 18%
satisfied with the quality of Milkfood products.
Like 5 10% 4) Rural and urban people prefer buying Milkfood products as
Dislike 0 0% these are cheaper than home made products rather than
If you like Milkfood product, then from which outlet do you buying when they have not taken their home made products.
prefer? 5) Lastly, I found that advertisements and distribution system
plays an important role in shaping consumer behaviour
Shop 13 26% towards a particular product. If there will be slight
Milk bar 22 44% improvement in the advertising strategy of Milkfood, it will
surely help to boost up its sales and increase awareness
Society 15 30% amongst all classes and age groups of rural and urban areas.
What you think about its prices?
Affordable 37 74% 5. CONCLUSION
Expensive 8 16%
Very expensive 3 6% Working at Milkfood Milk Plant, Bahadurgarh gave me an
Not affordable 2 4% opportunity to apply my skills and knowledge, which I had gained
Are you satisfied with quality of the product? previously. Majority of people is satisfied with the prices but adult
citizens say that they want the prices should be reduced. Rural and
Excellent 31 62% urban people prefer buying Milkfood products as these are
Good 16 32% cheaper than home made products rather than buying when they
Average 3 6% have not taken their home made products. About the changes they
Satisfactory 1 2% want to make in Milkfood products, majority of them said that
Not Satisfactory 0 0% they want the quantity to be changed followed by a change in the
What changes you want in Milkfood products? price. They were satisfied with the quality of Milkfood products.
Price 10 20%
Quantity 14 28% REFERENCES
Quality 16 32%
Flavour 5 10% [1] Czinkota and Ronkainen (2002), Marketing Mix, Thomson
Availability 5 10% South-Western.
No Change 0 0% [2] De Mooij (2003), Global Marketing and Advertising,
Why do you take Milkfood products? Understanding Global Paradoxes, Sage.

853
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

[3] Keegan and Green (2005), Global Marketing, Prentice Hall. (f) Magazine [ ]
[4] Kotler and Armstrong (2006), Principles of Marketing, [3] Have you ever purchased Milkfood products?
Prentice Hall. (a) Daily [ ]
[5] Prime et Usunier (2004), Marketing mix, Development des (b) Frequently [ ]
marches et management intercultural, Vuibert. (c) Occasionally [ ]
[6] Usunier (2000), Marketing across Cultures, Prentice Hall. (d) Never [ ]
[7] Periodicals: MOCI, HBR, JIBS, JM, JMR. [4] Do you like Milkfood products?
[8] www.milkfoodltd.com (a) Very much [ ]
[9] www.indiaagronet.com/indiaagronet/Dairy.htm (b) Not much [ ]
[10] www.hindu.com/thehindu/2008/10/11/stories/0611000c.html (c) Average [ ]
[11] Steve Crabtree – (2004) Getting personnel in the work place (d) Dislike [ ]
– Are negative relationships squelching productivity in your [5] If you like Milkfood products, then from which
company? – Gallup Management Journal, June 10, 2004. outlet do you prefer?
[12] http://www.siescoms.edu/images/pdf/reserch/working_papers (a) Shop [ ]
/marketing mix.pdf (b) Milk bar [ ]
[13] http://en.wikipedia.org/wiki/Marketing mix (c) Society [ ]
[14] Associated chambers of commerce and industry of india [6] Are you satisfied with its prices?
2005. (a) Affordable [ ]
[15] Boyd, Walker & Larréché (1995). Advertising, personal (b) Expensive [ ]
selling and sales Promotion, Define PR on (p 352) as non- (c) Very expensive [ ]
paid, non-personal stimulation of demand for a product, (d) Not affordable [ ]
service or business unit by planting significant news about it [7] Are you satisfied with quality of the products?
or favorable presentation of it in the media (looks (a) Excellent [ ]
suspiciously similar to other definitions of publicity). (b) Good [ ]
[16] Chong, K. W. (2003). The Role of Pricing in Relationship (c) Satisfactory [ ]
Marketing - A Study of the Marketing Mix strategy of (d) Not satisfactory [ ]
Milkfood Pvt. Ltd., Industrial Marketing Management, 26(1), [8] What changes you want in Milkfood products?
1-13. (a) Price [ ]
[17] Christo Boshoff, (2002) “service advertising”, Journal of (b) Quantity [ ]
service research, Vol.4, November2012; pp 290-298. (c) Quality [ ]
[18] Dhar, Ravi.Stephen M.Nowlis, and steven J Sherman (1999), (d) Availability [ ]
“comparison effect on preference construction”, Journal of (e) Flavour [ ]
consumer research 26th dec.pp.293-306. (f) No change [ ]
[9] Why do you take Milkfood products?
QUESTIONNAIRE (a) Gain energy [ ]
(b) Advised by doctor [ ]
I am doing main research paper on “Product, Price, Place and (c) For taste [ ]
Promotion of Marketing” at Milkfood Ltd. I request you to (d) As a substitute of home products [ ]
provide the required information for the completion of my study. [10] Are Milkfood products easily available in the
Promise that the information is used exclusively for academic society?
purpose only. (a) Yes [ ]
(b) No [ ]
Name: ________________________________ [11] Why do you buy Milkfood products?
(a) Buy when you don’t have home made products.
YOUR AGE: (a) under 25year [ ] [ ]
(b) 25-34 [ ] (b) These are cheaper than the home made products.
(c) 35-44 [ ]
(d) 45+years [ ] [ ]
SEX: (a) Male [ ]
(b) Female [ ]
[1] What is your occupation?
(a) Farming [ ]
(b) Shopkeeper [ ]
(c) Unemployed [ ]
(d) Homemaker [ ]
(e) Student [ ]

[2] How did you came to know about this brand?

(a) Human source [ ]
(b ) Glow sign [ ]
(c) Posters [ ]
(e) Painting’s on dealers shop [ ]

854
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
COHORTS IN MARKETING: A REVIEW PAPER
Amandeep Singh
Guru Kashi University,
Talwandi Sabo (Bathinda) Punjab
amandeep.garai@gmail.com
ABSTRACT
Marketers often segment consumers on factors such as age,
gender, income, stage of life, and geography. Another
innovative approach is to group consumers into cohorts.
Cohorts are groups of individuals who are born and travel life
together and experience similar external events during their
late adolescent/early adulthood years. These events influence
people to create values, attitudes, and preferences that remain
with them for their lifetime. This article reviews and assesses
the current literature on American cohorts. The value and the
validity of cohorts as a segmentation technique are discussed,
as well as areas for future research.
Keywords
Marketing, Cohorts, Theory.
1. INTRODUCTION
Originally used to describe a military unit in ancient Rome,
the word cohort retains some of its original meaning by
describing a group of people that shares a common statistical
or demographic trait. The word is widely used in academia in
a variety of disciplines that study groups of people based on
shared characteristics, such as economics, health sciences and
sociology. Cohort in marketing, however, is commonly
accepted to mean "age-based marketing
When it comes to marketing, the term "cohort" refers to
specific experiences, events or other factors shared by a
group of consumers. These cohorts are used to identify and
target segments of the market that, although they may fit into
other models, are more effectively grouped and treated as one
2. COHORTS VS DEMOGRAPHICS
Cohorts are often confused with the general demographics
that are typically used to segment the marketplace.
Demographic groupings such as income level or age are not
considered marketing cohorts. Cohorts are the things that
separate specific groups of people even within their
demographic groupings. For example, men between the ages
of 55 and 70 are a demographic grouping. Men between the
ages of 55 and 70 who share the experience of having served
in the Navy on board aircraft carriers are a cohort. Cohorts
are far more specific than standard demographic groupings
and as such are a valuable tool for precisely targeted
marketing campaigns and niche businesses.
855
ISBN: 978-81-924893-0-8
Gurbir Singh
Guru Kashi University,
Talwandi Sabo (Bathinda) Punjab
gurbir_ubs@yahoo.co.in
3. COHORTS IN MARKETING
Similar to demographics, cohorts use quantifiable descriptors
to identify target markets. Demographics, however, are the
quantifiable descriptors themselves, such as the
aforementioned age and household income. Cohorts in
marketing use age descriptors as demographic markers to
make inferences about attitudes and behavior of people in the
same age group based on common experiences. The basic
premise is that people are profoundly influenced by seismic
experiences and events remembered from late adolescence
and early adulthood—their coming-of-age years. These
"defining moments" tend to inform people's attitudes,
preferences and shopping behavior for the remainder of their
lives.
3.1 Generational Cohorts
Charles Schewe, Geoffrey Meredith and Janice Karlovich
identified seven generational cohorts in their year 2000 book
titled "Defining Markets, Defining Moments." These include
the Great Depression Cohort with people born between 1912
and 1921, the World War II Cohort born between 1922 and
1927, the Post-WW II Cohort born between 1928 and 1945,
the Baby Boomers I born between 1946 and 1955, the Baby
Boomers II born between 1956 and 1965, Generation X born
between 1966 and 1976, and N-Gens born between 1977 and
1987. Generational cohorts do not suggest "generations,"
which are typically 20 to 25 years. Cohorts vary in the
number of years covered. For marketing purposes, the
relevance is in the years when the cohorts came of age.
3.2 Defining Moments
Cohorts are shaped by significant defining moments that
affect their attitudes and behavior for the remainder of their
lives. For instance, the Great Depression Cohort came of age
during the Great Depression, 1930-1939. As a defining
moment, the Great Depression, defined by financial
insecurity, had a profound effect on this group in terms of
frugal spending, saving as a priority and a high premium on
financial security. Each cohort group has its defining
moments that translate into hot buttons in terms of attitudes,
tastes and preferences.
3.3 Improved Target Marketing
Understanding and using cohort analysis can help you
identify target markets with greater precision to get new
customers. It requires a bit of extra effort, but small-business
owners typically increase their chances of coming up with
winners when they aim for smaller target markets, such as
those associated with a specific cohort.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
3.4 Events
Special events are a natural cohort, and marketing teams are
quick to seize upon them for promotional gain. For example,
people attending a concert of some note will often feel as
though they were present for something that was meaningful
in their lives. This cohort creates an opportunity to promote
and sell items that commemorate the event and focus on the
concert as a defining moment.
3.5 Experiences
Shared experiences can account for valuable marketing
cohorts that bank on the consumer's desire to remain a part of
the past. The great depression was for all its trauma and
hardship an experience that shaped many people, in particular
their outlook on spending and saving. People who have lived
through the lean times have a better understanding that they
may return at any time and they live their lives in a state of
semi-preparedness as a result. Marketing professionals may
use such an experience as a cohort to identify segments of the
population who may be more receptive to financial products
like bank accounts, gold shares or life insurance.
3.6 Research on Age Cohorts
Existing literature on the topic of market segmentation, and
more specifically age cohorts, has shown a variety of articles
on the topic and the history of market segmentation
beginning from the 1970s. The beginning of this research
dates back to 1974, where the Journal of Marketing,
published a section on selecting the best segmentation
correlate. This article conducted a study on the significance
of certain segmentation variables in consumer behavior,
regarding weak associations with the actual marketed product
or service. A conclusion discovered in this study showed that
a segmentation correlate used in one market may not be
effective in another. The findings indicated that in order to
achieve the most24 significant segmentation correlate for a
product or service, various variables must be tested in each
individual market in order to determine the most successful
correlate for the product or service. It was also discovered
that in determining the most effective market correlate,
frequency of use is an important factor (Hirsch and Peters,
1974). In 1987 research, the marketer was encouraged to
choose a market segmentation variable and adapt the product
or service in order to fit the criteria of that specific market
correlate, rather than adapting a segmentation correlate to the
product or service- the current method of choosing
segmentation variables. This illustrates a difference in market
segmentation theories that have developed since the 1980s. In
the 1980s, four factors were discussed that were considered
helpful in evaluating the desirability of a segmentation
variable; these factors include measurability, accessibility,
substantiality, and action-ability. Furthermore, consideration
was also needed to determine the specific type of segment
categories desired, identified as geographic, demographic,
psychological, and behavioral variables. Overall the theory
behind this marketing segmentation concept stated that “once
a segment has been identified which fulfils the requirements
of measurability, accessibility, substantiality and action-
ability it is possible to develop a product or service to meet
the needs of the segment” (Drayton and Tynan, 1987). This
856
ISBN: 978-81-924893-0-8
research provided an understanding of market segmentation
that has development over time and helped to contribute to
modern segmentation concepts and theories. Continuing on
the timeline of segmentation concepts, research from the new
millennium showed signs of development into what
marketing segmentation is today. In a 2000 study, it was
found that individual product or service needs of consumers
are all different, but that rather than a heterogeneous market
segmentation approach as used in the past, a homogeneous
approach is needed to satisfy more consumers and develop
better marketing strategies (Blois and Dibb, 2000). In 2004,
Schewe and Meredith were more focused on the topic of
market segmentation by generational cohorts, and determined
that generational cohorts were a new concept in marketing
segmentation at25 this point in history. The authors discussed
the values and beliefs that motivate different age groups, such
as consumers from Generation X and the Baby Boomer
Generation. This research took into consideration the
experiences, values, beliefs, attitudes and preferences of
specific generational cohorts. It expressed that consumers of
the same generation go through the same external factors and
events, and that these factors helped to shape their attitudes
toward spending. The authors noted the presence of more
„tech-savvy‟ consumers than ever before, creating a need for
more personal and well-guided advertising towards ideal
consumers of the product or service (2004). Targeting a
specific generation by researching the celebrities, movie
stars, and athletes that are considered to be heroes of their
childhood, gives marketers an effective use of nostalgia.
Appealing to nostalgic feelings and memories gives
consumers the feeling that the product is being specifically
directed towards them, and allowing them to connect to the
product or service on a personal level. Market segmentation
by generational cohort is a more personal and well adapted
method of connecting to individual consumer‟s attitudes and
values. Understanding different generations of consumers
gives marketers a way of researching buying habits and will
aid in forecasting future product trends that may apply to
future promotional strategies (Schewe and Meredith, 2004).
In another example of research on age cohorts, Bennett, Dees
and Sagas review the differences between Generation X and
Generation Y consumers. This work describes the difference
in media preferences of action sports consumers, like
attending traditional sports games versus watching action
sports on television or playing sport video games. The
authors describe the difficulty in appealing effectively to
youth markets over marketing history (2006). As the current
youth consumers are Generation Y, marketers work harder
and more effectively to appeal to these consumers, because
achieving brand loyalty earlier in a consumer‟s life will
create a future of loyal customers. Appealing to Generation Y
earlier will also be beneficial because this generation is three
times larger than its predecessor,Generation X.
Characteristics researched on Generation Y shows that they
are more brand conscious than previous generations and have
been exposed to a wider range of media and advertising. For
example television, movies, video games, magazines, and the
internet are more exposed to this generation than Generation
X consumers, due to the rapid technological advances
established during the childhood of Generation Y (Bennett et
al., 2006). Research has lead to the conclusion that
Generation Y consumers are less inclined to watch or attend
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
traditional sporting events like NBA basketball and MLB
baseball, than that of Generation X. Generation Y prefers
watching action sports or playing action sport video games,
like skateboarding and BMX (Bennett et al., 2006). Further
research highlights the differences in people born in
Generation X and those born in Generation Y, in terms of
characteristics that are present in the workplace. Generation
Y are believed to be more optimistic and entrepreneurial than
that of Generation X, who appear to be more pessimistic and
mistrustful people. One of the most evident characteristics
that apply to Generation Y in the workplace, is that they are
the most rewarded and recognized of any generation in terms
of childhood accomplishments (Galagan, 2006). This
characteristic leads them to feel more entitled when they
enter the workforce for the first time. Curbing this sense of
selfentitlement in Generation Y employees is the most
difficult challenge for managers of a different generation,
who believe they must work hard for what they earn
(Galagan, 2006). Characteristics of Generation X and
Generation Y in the workplace can also transfer over into
consumption habits of each group. Research has also been
conducted on the tendency that marketers have to divide baby
boomers into two segments: older baby boomers born
between 1946 and 1955, and younger baby boomers born
between 1956 and 1965. The results of this work showed that
even though the whole group is large in number, there are
more similarities than differences between the younger and
older baby boomers; therefore marketers should use caution
in dividing age cohorts into 2627 further segments. More
conclusions state that generational segmentation is a good
starting point, but marketers should consider other
demographic and/or psychographic methods in segmenting
markets for the most effective results (Iyer and Reisenwitz,
2007).
4. COHORT ANALYSIS
A cohort is a group of users who were acquired from a
mobile marketing initiative over a certain period of time, for
example, one week. Cohort analysis tools simply follow this
group week over week and monitor their return. This type of
analysis offers marketers a tremendous level of insight into
users‟ lifetime value, improves marketing funnel conversions
and helps optimize campaigns directly to revenue generated.
4.1 Benefits of cohort analysis
One popular way to look at cohort is to monitor the rate of
return for the first week and set a target, such as 25% return
on ad spend. Over time, you monitor your return and improve
your marketing, which should enable you to beat your target.
By looking at different cohorts, the true performance of your
marketing becomes clear. When you make a change, it is
represented in that week‟s data. You don‟t have the
performance from a previous week masking the true
performance.
Over a longer period of time, such as 12 weeks, the lifetime
value of users acquired becomes very easy to understand.
You simply add up the 12 week return of each cohort and
compare. Some weekly cohorts will be stronger than others,
but an average 12-week trend should emerge once you have
collected enough data.
857
ISBN: 978-81-924893-0-8
Cohorts are also good for spotting weekly, monthly or
seasonal trends. In most mobile retail cohorts, you see a sharp
drop in purchases seven days before a major holiday.
4.2 How does it work
First, marketers need to have a conversion tracking solution
in place to capture all the data they need to do cohort
analysis. The data required to track differs by vertical.
Retailers may want to measure registrations, purchase data,
repeat purchases and total revenue per purchase. Travel
marketers often measure hotel bookings, airline reservations
and car rentals. For other verticals, marketers should measure
data that is most relevant to their business.
Once conversion tracking is up and running, you can access
the raw data you need. The more data you have, the more
options you have to segment cohorts. Create cohorts based on
the week in which newly acquired mobile app users
downloaded your app. Then measure all purchases that cohort
makes over time. The final product of a cohort analysis is an
easy to read table or chart showing the breakdown of total
marketing spend compared to data tracked and lifetime value
for each cohort.
5. RELIABILITY OF COHORTS IN
MARKETING
Why Age Cohorts are a Reliable Segmentation Target
Segmenting a market by age cohorts is very effective and
helps to narrow down the most ideal target market for a
product or service. The external factors and events that were
experienced by consumers in a specific generation, impact
the interests and consumption habits of those specific
members of the generation. Understanding the differences in
consumption between members of Generation X, Generation
Y, and the Baby Boomer Generation allow for advertisers to
effectively advertise products to those generations. The three
generations focused on in the research are completely
different in terms of how members of each generation
consume, behave, and spend. The range of differences found
in each generation, shows the need for different marketing
and advertising strategies specific to each generation. Schewe
and Meredith stated that “when such similarities exist,
marketers can offer the same (or very similar) products,
distribution and/or communications programs to alarge
number of potential customers who are more likely to
respond in the way desired. Efficiency in marketing is
realized and marketers and consumers benefit” (2004). The
main benefit of generational cohort segmentation is the
potential for specifically-tailored advertising and overall
effective promotion toward the ideal target market.
Furthermore, Schewe and Meredith state that events and
experiences within a specific generation‟s history transform
the values, beliefs, and attitudes of its members. These
values, beliefs, and attitudes shape the consumption habits
and patterns of each generation of consumer. The
development of consumer‟s interests, attitudes, values, and
beliefs does not fully occur until the consumer generation is
in young adulthood. Marketers who understand generational
cohorts can appeal to the defining moments or events that are
of importance to certain generations. Appealing to defining
events in a consumer‟s life can influence emotional feelings
such as nostalgia, happiness, or youthfulness. Marketers can
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

take advantage of these feelings because the consumer would then organizing the very specific data required to segment
be more likely to buy a product that invokes these attitudes cohorts are also often prohibitive for many companies.
and emotions. Modern consumers look for personal
connections that appeal to their emotions, beliefs, values, and 7. CONCLUSION
attitudes. Also they look for products that appeal to their
Research on this topic has confirmed the benefits that this
lifestyle and help to promote their ideal self. These
type of market segmentation contributes to determining target
relationships that consumers are looking to establish with
markets and32 marketing overall. The personal connection
brands and products are what marketers try to capture in their
between product and consumer is of crucial importance in
advertisements. Obtaining long-term relationships with
this age of consumerism. Companies who effectively appeal
consumers will provide companies with brand loyalty and a
to ideal consumers will establish brand loyalty and develop
strong future. For example, members of Generation Y tend to
trust within their customer base for years to come. In a
be more techsavvy, music-oriented, and fashion conscious.
society of conspicuous and comparative consumption
Also they tend to spend more money than any other
advertisers have a better understanding of which generations
generation of consumers. Identifying appropriate products
tend to spend more or consume more than others. Marketers
and using techniques such as using members of the same
have to have thorough knowledge of generational cohort
generation in advertising, and by appealing to this
segmentation in order for the concept to work effectively.
generation‟s sense of fashion and love of music, will make
Research, development, and experimentation are crucial in
for very appropriate and effective advertisement. 3031 The
the early stages of developing a suitable segmentation
Baby Boomer generation is on the verge of retirement age
variable. Generational cohort segmentation may not be the
and tends to gravitate toward products that bring a sense of
best suited method of segmentation for a specific market. A
nostalgia and a reminder of their earlier years. Even though
marketing department needs to be able to determine
this generation is the wealthiest of them all, they are
relevancy and accuracy of the potential segmentation
beginning to save money and live frugally. Advertisements
variables to that of the specific market. In order for
that are simple and act as reminders to Baby Boomers that
generational cohort segmentation to be effective, consumers
retirement is around the corner, will potentially appeal to this
need to feel that the product is „meant‟ for them and the
audience. Generation X consumers are mid-way through their
company understands them as a person. If consumers do not
careers and tend to have more family-oriented and casual
feel a sense of connection to the product through its
lifestyles. They look for balance and perspective in their lives
advertising, the marketers have failed to accurately portray
and make time for leisure activities (Foley and LeFevre,
the product or have failed in their cohort analysis (Hirsch and
2001). Advertisements that appeal to the sense of family,
Peters, 1974). Therefore in order to correctly develop and
more specifically the „ideal family‟ lifestyle that members of
understand generational segmentation, marketers and
Generation X value, are more likely to be successful with this
advertisers need to understand market segmentation as a
cohort. Since they are well-defined within their careers, an
whole. Being able to compare and contrast segmentation
established and balanced lifestyle at their current age is very
variables is the first step to accurately portraying an ideal
important. Products that are geared towards these beliefs and
target audience. Further research on market segmentation is
sell family-values, will appeal most to Generation X. Market
also needed in order to develop standard methods and
segmentation by generational cohort helps marketers to
accurate experiments that will help advertisers determine
narrow down potential target audiences and find the
what segmentation variables are suitable, and which ones are
consumers who would be genuinely interested in the product
not suitable for different types of products and services. If
or service. Understanding this type of segmentation helps
marketers do thorough and efficient research on what type of
advertisers determine what values and beliefs different
consumer would be interested in their product, they are
consumers associate with their product. Knowing the
destined for a successful marketing campaign that will help
generation of consumer that is most likely to purchase the
define a new age of innovative advertising. Market
product helps companies to effectively advertise. Developing
segmentation is a key factor in the advertising and
brand loyalty for the company starts with correctly marketing
promotional process, and determining which type of
the product or service. Therefore consumers, who find the
market33 segmentation to choose is crucial. Generational
product worth their while, will develop strong relationships
cohort segmentation is only one of many segmentation
with that company through the future. Generational
variables, but it provides many benefits that if researched
segmentation is one of the more basic segmentation variables,
correctly and applied accurately can be very effective. The
and has helped to develop reliable target markets today.
study of consumer behavior, which is practiced in the
6. DRAWBACKS development of market segmentation, is a driving force in the
advertising world. Thorough knowledge of consumer
For all their marketing value, cohorts do have significant behavior will allow for marketers to apply the most effective
drawbacks. They are often too precise for most companies to segmentation variables in a world of complex consumerism
use as a general marketing tool and can only be employed in
cases where extreme drilling down of marketing methods and REFERENCES
approaches are warranted. If your company handles the
[1] Bennett, G., Sagas, M., and Dees, W. (2006). Media
litigation for a specific type of illness contracted in a specific
preferences of action sports consumers: differences
place and time, cohort marketing is the way to go. If you are
between generation X and Y. Sport Marketing
advertising a general legal practice, there are better ways to
Quarterly, 15(1), 40-49. Retrieved from Business Source
reach a broader audience. The costs involved with collecting,
Premier database.

858
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
[2] Blois, K., and Dibb, S. (2000). Market segmentation. (p.
380). Oxford University Press 2000. Retrieved from
Business Source Premier database.
[3] Foley, E., & LeFevre, A. (2001). Understanding
generation X. Zagnoli, McEvoy, Foley LLC. Retrieved
from http://www.voirdirebase.com/pdfs/gen_x.pdf.
[4] Galagan, P. (2006). Engaging generation Y. T+D, 60(8),
27-30. Retrieved from Business Source Premier
database.
[5] Geoffrey E. Meredith & Charles D. Schewe. Defining
Markets, Defining Moments: America's 7 Generational
Cohorts, Their Shared Experiences, and Why Businesses
Should Care.
[6] Hisrich, R., and Peters, M. (1974). Selecting the superior
segmentation correlate. Journal of marketing, 38(3), 60-
63. Retrieved from Business Source Premier database.
[7] Reisenwitz, T., and Iyer, R. (2007). A comparison of
younger and older baby boomers: investigating the
viability of cohort segmentation. Journal of Consumer
Marketing, 24(4), 202-213. Retrieved from Business
Source Premier database.
[8] Reisenwitz, T., and Iyer, R. (2009). Differences in
generation X and generation Y: implications for the
organization and marketers. Marketing management
859
ISBN: 978-81-924893-0-8
journal, 19(2), 91-103. Retrieved from Business Source
Premier database.
[9] Rowe, M. (2008). Generation revelations. Restaurant
hospitality, 92(1), 26-30. Retrieved from Business
Source Premier database.
[10] Schewe, C., and Meredith, G. (2004). Segmenting
global markets by generational cohorts: determining
motivations by age. Journal of consumer behaviour,
4(1), 51-63. Retrieved from Business Source Premier
database.
[11] Solomon, M. R. (2010). Consumer behavior: buying,
having, and being, 9th edition. Prentice Hall.
[12] Tonks, D. (2009). Validity and the design of market
segments. Journal of marketing management, 25(3/4).
341-356. Retrieved from Business Source Premier
database.
[13] Tynan, A., and Drayton, J. (1987). Market segmentation.
Journal of marketing management, 2(3), 301-335.
Retrieved from Business Source Premier database.
[14] Welch, D., and Kiley, D. (2009). The incredible
shrinking boomer economy. BusinessWeek, (41), 26-30.
Retrieved from Business Source Premier database.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
A Study of Corporate social responsibility in India
Sandeep Kaur
Bhai Gurdas Institute of
Engineering and Tecnology.
Sangrur.
sandeepbgiet@gmail.com
ABSTRACT
Socially responsible human resource management
(SRHRM), defined as corporate social responsibility
(CSR) directed at employees, underpins the successful
implementation of CSR. While its relationship with
employee social behavior has been conceptualized and
received some empirical support, its effect on employee
work behaviors has not been explored. In this article we
develop and test a meso-mediated moderation model that
explains the underlying mechanisms through which
(CSR) affects employee task performance and extra-role
helping behavior. The results of multilevel analysis show
that organization-level (CSR) is an indirect predictor of
individual task performance and extra-role helping
behavior through the mediation of individual-level
organizational identification. In addition, the mediation
model is moderated by employee-level perceived
organizational support and the relationship between
organizational identification and extra-role helping
behavior is moderated by organization-level cooperative
norms. These findings provide important insights into
why and when (CSR) influences employee work
behavior
Keywords: corporate social responsibility; society;
organizational development.
1. INTRODUCTION
Corporate social responsibility (CSR, also called
corporate conscience, corporate citizenship or sustainable
responsible business/ Responsible Business) is a form of
corporate self-regulation integrated into a business
model. CSR policy functions as a self-regulatory
mechanism whereby a business monitors and ensures its
active compliance with the spirit of the law, ethical
standards and international norms. With some models, a
firm's implementation of CSR goes beyond compliance
and engages in "actions that appear to further some social
good, beyond the interests of the firm and that which is
required by law. CSR aims to embrace responsibility for
corporate actions and to encourage a positive impact on
the environment and stakeholders including consumers,
employees, investors, communities, and others.
The term "corporate social responsibility" became
popular in the 1960s and has remained a term used
indiscriminately by many to cover legal and moral
responsibility more narrowly construed. Proponents
860
ISBN: 978-81-924893-0-8
Seema Jain
Bhai Gurdas Institute of
Engineering and Tecnology.
Sangrur.
seema.cics@gmail.com
argue that corporations increase long term profits by
operating with a CSR perspective, while critics argue
that CSR distracts from business' economic role. A 2000
study compared existing econometric studies of the
relationship between social and financial performance,
concluding that the contradictory results of previous
studies reporting positive, negative, and neutral financial
impact, were due to flawed empirical analysis and
claimed when the study is properly specified, CSR has a
neutral impact on financial outcomes. Critics questioned
the "lofty" and sometimes "unrealistic expectations" in
CSR or that CSR is merely window-dressing, or an
attempt to pre-empt the role of governments as a
watchdog over powerful multinational corporations.
1.1 Consumer Perspectives
Most consumers agree that while achieving business
targets, companies should do CSR at the same time Most
consumers believe companies doing charity will receive
a positive response Somerville also found that consumers
are loyal and willing to spend more on retailers that
support charity. Consumers also believe that retailers
selling local products will gain loyalty. Smith shares the
belief that marketing local products will gain consumer
trust. However, environmental efforts are receiving
negative views given the belief that this would affect
customer service.
1.2 Approaches
A more common approach to CSR is corporate
philanthropy this includes monetary donations and aid
given to nonprofit organizations and communities.
Donations are made in areas such as the arts, education,
housing, health, social welfare and the environment,
among others, but excluding political contributions and
commercial event sponsorship.
Another approach to CSR is to incorporate the CSR
strategy directly into operations. For instance,
procurement of Fair Trade tea and coffee.
Creating Shared Value, or CSV is based on the idea that
corporate success and social welfare are interdependent.
A business needs a healthy, educated workforce,
sustainable resources and adept government to compete
effectively. For society to thrive, profitable and
competitive businesses must be developed and supported
to create income, wealth, tax revenues and philanthropy.
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
2. OBJECTIVE OF THE STUDY
 The aim of this research is to examine how CSR can
contribute to building organizational-level social
capital.
 The study focuses on investigating the strategic role
that CSR activities play in yielding better
organizational performance/profitability through
development of intangible organizational resources
(social capital/reputational capital).
 To study the issues and challenges faced by CSR in
India.
 To make suggestions for accelerating CSR
initiatives
3. A LITERATURE REVIEW
In recent years the business strategy field has
experienced the renaissance of corporate social
responsibility (CSR) as a major topic of interest. The
concept has not surfaced for the first time. CSR had
already known considerable interest in the 1960s and
70s, spawning a broad range of scholarly contributions
(Cheit, 1964; Heald, 1970; Ackermann & Bauer, 1976;
Carroll, 1979), and a veritable industry of social auditors
and consultants. However, the topic all but vanished
from most managers' minds in the 1980s (Dierkes &
Antal, 1986; Vogel, 1986). Having blossomed in the
1970s CSR all but vanished and only re-emerged in
recent years. CSR resurfaced forcefully over the past ten
years in response to mounting public concern about
globalization. Firms find themselves held responsible for
human rights abuses by their suppliers in developing
countries; interest groups demand corporate governance
to be transparent and accountable; rioters from Seattle to
Genoa protest violently against the cost of free trade and
other perceived negative consequences of globalization.
3.1 Individual Level:
CSR as Moral Choices of Managers At the individual
level, CSR has been constructed by Ackermann (1975)
861
ISBN: 978-81-924893-0-8
as managerial discretion. According to this view
managerial actions are not fully defined by corporate
policies and procedures. So although managers are
constrained by their work environ-ment they nonetheless
have to weigh the moral consequences of the choices
they make. “The purpose of stakeholder management
was to devise a framework to manage strategically the
myriad groups that influenced, directly and indirectly,
the ability of a firm to achieve its objectives.” (Freeman
& Velamuri, 2006) The aim of stakeholder management
is thus to analyze how a company can serve its customers
and be lucrative while also serving its other stakeholders
such as suppliers, employees, and communities. Recently
the stakeholder perspective has dominated the
reinterpretation of CSR pushing the question of the
legitimacy of corporate power as well as the moral
dimension of managerial decisions more into the
background
3.2 Organizational Level:
CSR as Stakeholder Management With Freeman‟s
(1984) seminal book the focus moved from legitimacy
and morals towards a new theory of the firm. Social
considerations are thus no longer outside an
organization but are part of its purpose of being. CSR
thus becomes a question of stakeholder identification,
involvement, and communication (Mitchell, Agle, &
Wood, 1997; Morsing & Beckmann, 2006; Morsing &
Schultz, 2006).
3.3 Global Level:
CSR as Sustainable Development The latest literature
tradition to have impacted our understanding of
corporate social responsibility is that of sustainable
development. It was the Brundtland Commission (1987)
that for the first time systematically emphasized the link
between poverty, environmental degradation, and
economic development. Its definition of sustainable
development, as meeting the needs of the present,
without compromising the ability of future generations to
meet theirs, extends the responsibility of firms both inter-
and intra-generationally. Thus firms are expected to also
consider traditionally unrepresented stakeholders such as
the environment and as well as future generations.
Although many CSR authors have taken up the notion of
a “triple bottom line” (Elkington, 1997) there remain
important tensions between the CSR and the sustainable
development debate (i.e. Dyllick & Hockerts, 2002).
4. RESEARCH METHODOLOGY
The research paper is an attempt of exploratory research,
based on the secondary data sourced from journals,
magazines, articles and media reports. Looking into
requirements of the objectives of the study there search
design employed for the study is of descriptive type.
Keeping in view of the set objectives, this research
design was adopted to have greater accuracy and in depth
analysis of the research study. Available secondary data
 Proceedings of 3rd International Conference on Advancements in Engineering & Technology (ICAET-2015)
ISBN: 978-81-924893-0-8

was extensively used for the study. The investigator the business out of the water. Some of the drivers
procures the required data through secondary survey pushing business towards CSR include:
method. Different news articles, Books and Web were 5.1 The Shrinking Role of Government
used which were enumerated and recorded.