Part 1 IReseau

Advances in Intelligent Systems and Computing 243
Durga Prasad Mohapatra

Srikanta Patnaik Editors
Intelligent
Computing,
Networking,
and Informatics
Proceedings of the International
Conference on Advanced Computing,
Networking, and Informatics, India,
June 2013
Advances in Intelligent Systems
and Computing
Volume 243
Series editor
Janusz Kacprzyk, Polish Academy of Sciences, Warsaw, Poland
kacprzyk@ibspan.waw.pl
For further volumes:

http://www.springer.com/series/11156
About this Series
The series ‘‘Advances in Intelligent Systems and Computing’’ contains publications on theory,
applications, and design methods of Intelligent Systems and Intelligent Computing. Virtually all
disciplines such as engineering, natural sciences, computer and information science, ICT, eco-
nomics, business, e-commerce, environment, healthcare, life science are covered. The list of
topics spans all the areas of modern intelligent systems and computing.
The publications within ‘‘Advances in Intelligent Systems and Computing’’ are primarily
textbooks and proceedings of important conferences, symposia and congresses. They cover
significant recent developments in the field, both of a foundational and applicable character. An
important characteristic feature of the series is the short publication time and world-wide
distribution. This permits a rapid and broad dissemination of research results.
Advisory Board
Chairman
Nikhil R. Pal, Indian Statistical Institute, Kolkata, India
e-mail: nikhil@isical.ac.in
Members
Emilio S. Corchado, University of Salamanca, Salamanca, Spain
e-mail: escorchado@usal.es
Hani Hagras, University of Essex, Colchester, UK

e-mail: hani@essex.ac.uk
László T. Kóczy, Széchenyi István University, Gy}or, Hungary

e-mail: koczy@sze.hu
Vladik Kreinovich, University of Texas at El Paso, El Paso, USA

e-mail: vladik@utep.edu
Chin-Teng Lin, National Chiao Tung University, Hsinchu, Taiwan

e-mail: ctlin@mail.nctu.edu.tw
Jie Lu, University of Technology, Sydney, Australia

e-mail: Jie.Lu@uts.edu.au
Patricia Melin, Tijuana Institute of Technology, Tijuana, Mexico

e-mail: epmelin@hafsamx.org
Nadia Nedjah, State University of Rio de Janeiro, Rio de Janeiro, Brazil

e-mail: nadia@eng.uerj.br
Ngoc Thanh Nguyen, Wroclaw University of Technology, Wroclaw, Poland

e-mail: Ngoc-Thanh.Nguyen@pwr.edu.pl
Jun Wang, The Chinese University of Hong Kong, Shatin, Hong Kong
e-mail: jwang@mae.cuhk.edu.hk
Srikanta Patnaik
Editors
Intelligent Computing,
Networking, and Informatics
Proceedings of the International Conference
on Advanced Computing, Networking,
and Informatics, India, June 2013
123
Editors
Durga Prasad Mohapatra Srikanta Patnaik
Computer Science and Engineering Computer Science and Engineering
National Institute of Technology Rourkela SOA University
Rourkela, Orissa Bhubaneswar
India India
ISSN 2194-5357 ISSN 2194-5365 (electronic)

ISBN 978-81-322-1664-3 ISBN 978-81-322-1665-0 (eBook)
DOI 10.1007/978-81-322-1665-0
Springer New Delhi Heidelberg New York Dordrecht London
Library of Congress Control Number: 2013955257
Springer India 2014

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of
the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations,
recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or
information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar
methodology now known or hereafter developed. Exempted from this legal reservation are brief
excerpts in connection with reviews or scholarly analysis or material supplied specifically for the
purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the
work. Duplication of this publication or parts thereof is permitted only under the provisions of
the Copyright Law of the Publisher’s location, in its current version, and permission for use must
always be obtained from Springer. Permissions for use may be obtained through RightsLink at the
Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this
publication does not imply, even in the absence of a specific statement, that such names are exempt
from the relevant protective laws and regulations and therefore free for general use.
While the advice and information in this book are believed to be true and accurate at the date of
publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for
any errors or omissions that may be made. The publisher makes no warranty, express or implied, with
respect to the material contained herein.
Printed on acid-free paper
Springer is part of Springer Science+Business Media (www.springer.com)

Preface
The proceedings of the International Conference on Advanced Computing,

Networking, and Informatics (ICACNI 2013), at Central Institute of Technology
Raipur, Chhattisgarh, India during 12–14 June record scientific and engineering
progress in both theoretical and applied sections of Computer Science and related
fields. The proceedings contain technical articles, reports, and case studies on
computing, networking, and informatics. Along with these main tracks, there were
two special sessions organized for recording specific advancements in the domains
of image and video processing and biometric security. The conference also sported
a special industrial track to mark the relevant research achievements from the
industry. Out of 458 articles received for consideration for publication, 135 have
been selected through a single-blind peer review process. Each article has been
reviewed by at least two reviewers. Academicians, scholars, industry profession-
als, and practitioners have contributed to this conference by submitting their
valuable research works, which has led this conference to a success.
A dedicated committee of several professors and academicians from premier
institutes, such as the IITs and the NITs, has served to manifest the conference
successful. We sincerely thank all our chairs and committees. We are grateful to
the reviewers who, despite their busy schedules, have supported us by providing
review reports within the stipulated time. We would like to thank Central Institute
of Technology Raipur for organizing and providing the venue for the conference.
Our hearty thanks go to the Department of Computer Science and Engineering,
National Institute of Technology Rourkela for overall support in executing the
conference.

Srikanta Patnaik
v
Committee
Advisory Committee
Ajith Abraham, Technical University of Ostrava, Czech Republic

Massimo Tistarelli, University of Sassari, Italy
Phalguni Gupta, Indian Institute of Technology Kanpur, India
George A. Tsihrintzis, University of Piraeus, Greece
Atilla Elçi, Aksaray University, Turkey
Rajib Mall, Indian Institute of Technology Kharagpur, India
Manoj Kumar Singh, IIT-Banaras Hindu University, India
Shobha Lata Sinha, National Institute of Technology Raipur, India
Srikanta Patnaik, Institute of Technical Education and Research, India
Ajita Rattani, University of Cagliari, Italy
R. C. Hansdah, Indian Institute of Science Bangalore, India
Badrinath G. S., Samsung Electronics, India
Partha Pratim Goswami, Calcutta University, India
Paresh Kumar Majhi, Institut für Anorganische Chemie, Germany
Sanjay Kumar Saha, Jadavpur University, India
Asim K. Roy, Visva Bharati University, India
Shambhu Upadhyaya, University at Buffalo, The State University of New York,
USA
A. P. James, Indian Institute of Information Technology and Management, India
Rajkumar Buyya, University of Melbourne, Australia
Sanjay Kumar Jena, National Institute of Technology Rourkela, India
Banshidhar Majhi, National Institute of Technology Rourkela, India
Harish Agarwal, Oracle Apps Supply Chain/Customer Services, UK
Krishna Pramanik, National Institute of Technology Rourkela, India
Sabu M. Thampi, Indian Institute of Information Technology and Management,
India
Vinod P. Narayanan, Evonik Industries, Germany
Swati Sanganeria, Oracle Apps, UK
vii
viii Committee
Amulya Ratna Swain, Indian Institute of Science Bangalore, India

Pankaj K. Sa, National Institute of Technology Rourkela, India
Binod K. Pattanayak, Institute of Technical Education and Research, India
Sidharth Sankar Das, Amdocs Inc., Texas, USA
Chief Patron
Prakash Davara, Chairman, Central Institute of Technology Raipur, India
Patron
Arindam Ray, Director, Central Institute of Technology Raipur, India
General Chairs
Sipi Dubey, Rungta College of Engineering and Technology, India

Rajib Sarkar, Central Institute of Technology Raipur, India
Programme Chair
Manoj Kumar Singh, DST-CIMS, Banaras Hindu University, India
Programme Co-Chairs
Ashok Kumar Turuk, National Institute of Technology Rourkela, India

Umesh Ashok Deshpande, Visvesvaraya National Institute of Technology Nagpur,
India
Proceedings Volume Editors
Durga Prasad Mohapatra, National Institute of Technology Rourkela, India

Srikanta Patnaik, Institute of Technical Education and Research, India
Committee ix
Technical Track Chairs
Bidyut Kumar Patra, National Institute of Technology Rourkela, India

Ramjeevan Singh Thakur, Maulana Azad National Institute of Technology
Bhopal, India
Debasish Jena, International Institute of Information Technology Bhubaneswar,
Odisha, India
Manmath Narayan Sahoo, National Institute of Technology Rourkela, Odisha,
India
Debasis Giri, Haldia Institute of Technology, India
Korra Sathyababu, National Institute of Technology Rourkela, Odisha, India
Industrial Track Chairs
Bibhudutta Sahoo, National Institute of Technology Rourkela, India

K. Sridhar Patnaik, Birla Institute of Technology Mesra, India
Umesh Chandra Pati, National Institute of Technology Rourkela, India
Publication Chairs
Anil Kumar Vuppala, International Institute of Information Technology

Hyderabad, India
Priyadarshini Sabut, Oracle India Pvt. Ltd., India
Steering Committee Chair
Savita Gupta, National Institute of Technology Rourkela, India
Organising Chairs
Jayanta Pothal, Scientist, Council of Scientific and Industrial Research, India

Rahul Raman, National Institute of Technology Rourkela, India
x Committee
Publicity Chair
Sambit Bakshi, National Institute of Technology Rourkela, India
Programme Committee
Parantapa Goswami, University Joseph Fourier, France

Azadeh Ghandehari, Islamic Azad University, Iran
A. Vadivel, National Institute of Technology Trichy, India
Devesh C. Jinwala, Sardar Vallabhbhai National Institute of Technology, India
Jitender Kumar Chhabra, National Institute of Technology Kurukshetra, India
Suvendu Rup, International Institute of Information Technology, India
Snigdha Bakshi, Central Bank of India, India
Parthasarathi Roop, University of Auckland, New Zealand
Priyadarsi Nanda, University of Technology Sydney (UTS), Australia
Jamuna Kanta Sing, Jadavpur University, India
Sanjay Kumar Jain, National Institute of Technology Kurukshetra, India
Binod Mishra, Tata Consultancy Services, India
Arun Kumar Mishra, UCET, Vinoba Bhave University, India
Dilip Singh Sisodia, National Institute of Technology Raipur, India
Arunanshu Mahapatro, National Institute of Science and Technology, India
Aruna Chakraborty, St. Thomas’ College of Engineering & Technology, India
Anil Kumar Vuppala, International Institute of Information Technology
Hyderabad, India
Dilip Kumar Sharma, Member, Executive Committee, UP Section, IEEE
Harish Kumar Sahoo, International Institute of Information Technology, India
Trilochan Panigrahy, National Institute of Science and Technology, India
Hunny Mehrotra, National Institute of Technology Rourkela, India
Anup Kawtia, Oracle India Pvt. Ltd., India
Mukesh A. Zaveri, Sardar Vallabhbhai National Institute of Technology, India
Saroj Kr. Panigrahy, Sir Padampat Singhania University, India
Raksha Shetty, IBM, India
G. R. Gangadharan, Institute for Development and Research in Banking
Technology, India
Shila Samantaray, Padmanava College of Engineering, India
Suraj Sharma, International Institute of Information Technology Bhubaneswar,
India
Pradeep Singh, National Institute of Technology Raipur, India
Swati Vipsita, International Institute of Information Technology Bhubaneswar,
India
Ranjan Jana, Department of MCA, RCC Institute of Information Technology,
India
Committee xi
Amit Trivedi, National Institute of Technology Raipur, India

Umakanta Majhi CSIT Durg, Chhattisgarh, India
Rahul Dubey, Manipal University, Bangalore, India
Haider Banka, Indian School of Mines, India
Subrajeet Mohapatra, Birla Institute of Technology Mesra, Ranchi, India
Anukul Chandra Panda, Centre for Development of Telematics, India
Jayan Basak, Mahindra Satyam, India
Sanjay Prasad Kushwaha, Nepal College of Information Technology, Nepal
Tapas Kumar Panigrahi, International Institute of Information Technology
Bhubaneswar, India
Steering Committee
Santanu Bakshi, University of Florida, USA

Manu Kumar Mishra, Bharat Heavy Electrical Ltd., India
Ram Shringar Raw, AIACTR, India
Auroprasad Mohanty, Hindalco—Aditya Birla Management Corporation Pvt. Ltd.,
India
Om Prakash Pahari, Central Institute of Technology Raipur, India
Mohit Agarwal, Razorsight Corporation, India
Asish Dalai, National Institute of Technology Rourkela, India
Alekha Mishra, National Institute of Technology Rourkela, India
Contents
Image and Template Security for Palmprint . . . . . . . . . . . . . . . . . . . 1

Munaga V. N. K. Prasad and B. Adinarayana
Extending Network Lifetime by Time-Constrained Data

Aggregation in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . 11
K. B. Ashwini and G. T. Raju
The Complex Network Analysis of Power Grid: A Case Study

of the West Bengal Power Network . . . . . . . . . . . . . . . . . . . . . . . . . . 17
Himansu Das, Gouri Sankar Panda, Bhagaban Muduli
and Pradeep Kumar Rath
Comparison and Analysis of Node Deployment for Efficient

Coverage in Sensor Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
Ram Shringar Raw, Shailender Kumar, Sonia Mann and Sambit Bakshi
Performance Analysis of Routing Protocols for VANETs

with Real Vehicular Traces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
Sanjoy Das, Ram Shringar Raw, Indrani Das and Rajib Sarkar
A Bluetooth-Based Autonomous Mining System . . . . . . . . . . . . . . . . . 57

Saikat Roy, Soumalya Sarkar and Avranil Tah
Transistor Representation of a Low-Power Reversible

32-Bit Comparator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
A. V. AnanthaLakshmi and G. F. Sudha
Performance Enhancement of Brillouin Distributed Temperature

Sensor Using Optimized Fiber . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
P. K. Sahu and Himansu Shekhar Pradhan
xiii
xiv Contents
To Study the Architectural Designs of a Proposed Comprehensive

Software Extractor for Reengineering Tool: A Literature Survey . . . . 91
Rashmi Yadav, Abhay Kothari and Ravindra Patel
Detection of Web-Based Attacks by Analyzing

Web Server Log Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
Nanhay Singh, Achin Jain, Ram Shringar Raw and Rahul Raman
A Survey of Energy-Aware Routing Protocols and Mechanisms

for Mobile Ad Hoc Networks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
Charu Gandhi and Vivek Arya
Lexical Ontology-Based Computational Model to Find

Semantic Similarity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
Jagendra Singh and Aditi Sharan
Energy-Efficient Cluster-Based Aggregation Protocol

for Heterogeneous Wireless Sensor Networks . . . . . . . . . . . . . . . . . . 129
Prakashgoud R. Patil and Umakant P. Kulkarni
Digital Watermarking Based on Magic Square

and Ridgelet Transform Techniques. . . . . . . . . . . . . . . . . . . . . . . . . 143
Rama Seshagiri Rao Channapragada and Munaga V. N. K. Prasad
Circle of Trust: One-Hop-Trust-Based Security Paradigm

for Resource-Constraint MANET. . . . . . . . . . . . . . . . . . . . . . . . . . . 163
K. M. Imtiaz-Ud-Din, Touhid Bhuiyan and Shamim Ripon
Design of a Biometric Security System Using Support

Vector Machine Classifier . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173
J. Manikandan, V. K. Agrawal and B. Venkataramani
Impact of Distance Measures on the Performance

of Clustering Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183
Vijay Kumar, Jitender Kumar Chhabra and Dinesh Kumar
Gender Identification Using Gait Biometrics . . . . . . . . . . . . . . . . . . 191

Richa Shukla, Reenu Shukla, Anupam Shukla and Nirupama Tiwari
A Survey on Business Context . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199

Danijel Novakovic and Christian Huemer
Contents xv
Enhanced Caching for Geocast Routing in Vehicular

Ad Hoc Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213
Omprakash Kaiwartya and Sushil Kumar
Cooperation Enforcement and Collaboration Inducement

in Mobile Ad Hoc Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221
Ghyani Umesh Kumar Maurya and Sushil Kumar
Uncoupling of Mobile Cloud Computing Services:

An Architectural Perspective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
Sohini De and Suddhasil De
Non-subsampled Contourlet Transform-Based Image Denoising

in Ultrasound Images Using Elliptical Directional Windows
and Block-Based Noise Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . 241
J. Jai Jaganath Babu and Gnanou Florence Sudha
Marathi Parts-of-Speech Tagger Using Supervised Learning. . . . . . . 251

Jyoti Singh, Nisheeth Joshi and Iti Mathur
Design and Evaluation of N-Module Reconfigurable Systems . . . . . . 259

Kunal Yogeshkumar Parikh, J. Manikandan and V. K. Agrawal
Genre-Based Classification of Song Using Perceptual Features . . . . . 267

Arijit Ghosal, Rudrasis Chakraborty, Bibhas Chandra Dhara
and Sanjoy Kumar Saha
Novel Distributed Dual Beamforming for Randomly Distributed

Sensor by Phase Tracking Using Bilateral Probability Function . . . . 277
G. Vaikundam and G. F. Sudha
Electrical Network Modeling of Amino Acid String

and Its Application in Cancer Cell Prediction . . . . . . . . . . . . . . . . . 293
T. Roy, S. Das and S. Barman
Generation of AES-like 8-bit Random S-Box and Comparative

Study on Randomness of Corresponding Ciphertexts
with Other 8-bit AES S-Boxes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303
S. Das
BCube-IP: BCube with IP Address Hierarchy . . . . . . . . . . . . . . . . . 319

A. R. Ashok Kumar, S. V. Rao and Diganta Goswami
xvi Contents
Image Retrieval Using Fuzzy Color Histogram and Fuzzy String

Matching: A Correlation-Based Scheme to Reduce
the Semantic Gap . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327
Nidhi Goel and Priti Sehgal
A Multi-Objective Optimization Approach for Lifetime

and Coverage Problem in Wireless Sensor Network . . . . . . . . . . . . . 343
Anil Kumar Sagar and D. K. Lobiyal
Evaluation of English-to-Urdu Machine Translation . . . . . . . . . . . . . 351

Vaishali Gupta, Nisheeth Joshi and Iti Mathur
A Novel Edge Detection Technique for Multi-Focus Images

Using Image Fusion. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 359
Priya Ranjan Muduli and Umesh Chandra Pati
Event Detection Refinement Using External Tags

for Flickr Collections. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 369
Sheba Selvam, B. Ramadoss and S. R. Balasundaram
Proposed Threshold Based Certificate Revocation in Mobile

Ad Hoc Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377
Priti Swapnil Rathi and Parikshit N. Mahalle
‘‘Bin SDR’’: Effective Algorithm for Wireless

Sensor–Actor Network. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 389
M. E. Sanap and Rachana A. Satao
An Elliptic-Curve-Based Hierarchical Cluster Key Management

in Wireless Sensor Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397
Srikanta Kumar Sahoo and Manmanth Narayan Sahoo
Probabilistic Approach-Based Congestion-Aware Swarm-Inspired

Load-Balancing Multipath Data Routing in MANETs. . . . . . . . . . . . 409
Subhankar Joardar, Debasis Giri and Vandana Bhattacherjee
Integration of Eco-Friendly POF-Based Splitter and Optical Filter

for Low-Cost WDM Network Solutions . . . . . . . . . . . . . . . . . . . . . . 423
Archana Rathore
Sensor Cloud: The Scalable Architecture for Future

Generation Computing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 433
Subasish Mohapatra, Banshidhar Majhi and Srikanta Patnaik
Contents xvii
Partial Fingerprint Matching Using Minutiae Subset . . . . . . . . . . . . 445

S. Asha and C. Chellappan
Genetic Algorithm-Based Approach for Adequate Test

Data Generation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
Swagatika Swain and D. P. Mohapatra
ISA: An Intelligent Search Algorithm for Peer-to-Peer Networks . . . 463

Mahdi Ghorbani, Mohammad Jooyan and Mostafa Safarpour
Modified Graph-Cut Algorithm with Adaptive Shape Prior . . . . . . . 473

Adonu Celestine and J. Dinesh Peter
Analysis on Optimization of Energy Consumption in Mobile

Ad Hoc Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 481
A. Karmel and C. Jayakumar
Accuracy of Atomic Transaction Scenario for Heterogeneous

Distributed Column-Oriented Databases . . . . . . . . . . . . . . . . . . . . . 491
Ramesh Dharavath, Amit Kumar Jain, Chiranjeev Kumar
and Vikas Kumar
Implantable CPW-fed Double-Crossed-Type Triangular Slot

Antenna for ISM Band . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 503
S. Ashok Kumar and T. Shanmuganantham
Training a Feed-Forward Neural Network Using Artificial

Bee Colony with Back-Propagation Algorithm . . . . . . . . . . . . . . . . . 511
Partha Pratim Sarangi, Abhimanyu Sahu and Madhumita Panda
Navigation of Autonomous Mobile Robot Using Adaptive

Neuro-Fuzzy Controller. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
Prases Kumar Mohanty and Dayal R. Parhi
Performance Estimation of Fuzzy Logic-Based Mobile Relay

Nodes in Dense Multihop Cellular Networks . . . . . . . . . . . . . . . . . . 531
Devendra Gurjar, Ajay Bhardwaj and Ashutosh Singh
Local Binary Pattern as a Texture Feature Descriptor

in Object Tracking Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 541
Prajna Parimita Dash, Dipti Patra and Sudhansu Kumar Mishra
xviii Contents
A Sensor-Based Technique for Speed Invariant Human

Gait Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 549
Anup Nandy, Soumabha Bhowmick, Pavan Chakraborty
and G. C. Nandi
High-Speed 100 Gbps/Channel DWDM System Design

and Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 557
Bijayananda Patnaik and P. K. Sahu
Performance Analysis of Contention-Based Ranging Mechanism

for Idle-Mode Mobility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 565
Rajesh Anbazhagan and Nakkeeran Rangaswamy
A Novel Approach to Face Detection Using Advanced Support

Vector Machine. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 573
Swastik Mohapatra, Asutosh Kar, Satyanarayan Dash,
Sidhant Mohanty and Prasant Swain
Concept Based Clustering of Documents with Missing

Semantic Information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 579
E. Anupriya and N. Ch. S. N. Iyengar
Theoretical Validation of New Class Cohesion Metric

Against Briand Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 591
Sandip Mal and Kumar Rajnish
RF-SEA-Based Feature Selection for Data Classification

in Medical Domain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 599
S. Sasikala, S. Appavu alias Balamurugan and S. Geetha
Optimizing Delay for MAC in Randomly Distributed

Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 609
Ajay Sikandar, Sushil Kumar and Ghyani Umesh Kumar Maurya
An Ontology-Based Software Development Environment Using

Upgraded Functionalities of Clojure. . . . . . . . . . . . . . . . . . . . . . . . . 619
Mary Alias and C. R. Rene Robin
Using a Cluster for Efficient Scalability Evaluation

of Multithreaded and Event-Driven Web Servers . . . . . . . . . . . . . . . 627
Syed Mutahar Aaqib and Lalitsen Sharma
An Overview of Detection Techniques for Metamorphic Malware. . . 637

Pratiksha Natani and Deepti Vidyarthi
Contents xix
Temporal Forensics of MPEG Video Using Discrete Wavelet

Transform and Support Vector Machine . . . . . . . . . . . . . . . . . . . . . 645
Sunil Jaiswal and Sunita Dhavale
Securing the Root Through SELinux . . . . . . . . . . . . . . . . . . . . . . . . 653

Ananya Chatterjee and Arun Mishra
Automatic Ontology Extraction from Heterogeneous Documents

for E-Learning Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 661
J. Jeslin Shanthamalar and C. R. Rene Robin
An Appraisal of Service-Based Virtual Networks and Virtualization

Tools Paves the Way Toward Future Internet . . . . . . . . . . . . . . . . . 667
Bhisham Sonkar, Devendra Chaphekar and Gupteshwar Gupta
Comparative Analysis and Research Issues in Classification

Techniques for Intrusion Detection . . . . . . . . . . . . . . . . . . . . . . . . . 675
Himadri Chauhan, Vipin Kumar, Sumit Pundir and Emmanuel S. Pilli
An Apriori-Based Vertical Fragmentation Technique

for Heterogeneous Distributed Database Transactions . . . . . . . . . . . 687
Ramesh Dharavath, Vikas Kumar, Chiranjeev Kumar and Amit Kumar
A Speech Recognition Technique Using MFCC with DWT

in Isolated Hindi Words . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 697
Neha Baranwal, Ganesh Jaiswal and G. C. Nandi
Mechanism for Preventing Registration Flooding Attack in SIP . . . . 705

Bosco Sebastian, Paromita Choudhury and C. D. Jaidhar
A Combined Approach: Proactive and Reactive Failure Handling

for Efficient Job Execution in Computational Grid . . . . . . . . . . . . . . 713
P. Latchoumy and P. Sheik Abdul Khader
A Comparative Analysis of Keyword- and Semantic-Based

Search Engines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 727
Yogender Singh Negi and Suresh Kumar
Slicing MATLAB Simulink/Stateflow Models . . . . . . . . . . . . . . . . . . 737

Adepu Sridhar and D. Srinivasulu
Link Mining Using Strength of Frequent Pattern of Interaction . . . . 745

Seema Mishra and G. C. Nandi
xx Contents
Integration of HSV Color Histogram and LMEBP Joint

Histogram for Multimedia Image Retrieval . . . . . . . . . . . . . . . . . . . 753
K. Prasanthi Jasmine and P. Rajesh Kumar
DBC Co-occurrence Matrix for Texture Image Indexing

and Retrieval . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 763
M-Band and Rotated M-Band Dual-Tree Complex Wavelet

Transform for Texture Image Retrieval . . . . . . . . . . . . . . . . . . . . . . 775
A Rank-Based Hybrid Algorithm for Scheduling Data-

and Computation-Intensive Jobs in Grid Environments . . . . . . . . . . 785
Mohsen Abdoli, Reza Entezari-Maleki and Ali Movaghar
Performance Evaluation of Video Communications

Over 4G Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 797
Gaurav Pande
Online Hybrid Model for Online Fraud Prevention and Detection . . . 805
Ankit Mundra and Nitin Rakesh
An Efficient Approach to Analyze Users’ Interest on Significant

Web Access Patterns with Period Constraint . . . . . . . . . . . . . . . . . . 817
M. Thilagu and R. Nadarajan
Efficient Privacy Preserving Distributed Association Rule Mining

Protocol Based on Random Number . . . . . . . . . . . . . . . . . . . . . . . . 827
Reena Kharat, Madhuri Kumbhar and Preeti Bhamre
Directional Local Quinary Patterns: A New Feature Descriptor

for Image Indexing and Retrieval . . . . . . . . . . . . . . . . . . . . . . . . . . 837
Santosh Kumar Vipparthi and S. K. Nagar
Data Mining Approach for Developing Various Models Based

on Types of Attack and Feature Selection as Intrusion
Detection Systems (IDS) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 845
H. S. Hota and Akhilesh Kumar Shrivas
Facial Expression Recognition Using Local Binary Patterns

with Different Distance Measures. . . . . . . . . . . . . . . . . . . . . . . . . . . 853
Sarika Jain, Sunny Bagga, Ramchand Hablani, Narendra Chaudhari
and Sanjay Tanwani
Contents xxi
Cluster-Based Routing for Optimal Communication

in Port Logistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 863
J. Thejo Kishan, M. M. Manohara Pai and Radhika M. Pai
Secure Adaptive Traffic Lights System for VANETs . . . . . . . . . . . . . 873

Kishore Biradar, Radhika M. Pai, M. M. Manohara Pai
and Joseph Mouzana
Analysis of Image Segmentation Techniques on Morphological

and Clustering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 885
M. Sivagami and T. Revathi
Performance Impact of TCP and UDP on the Mobility Models

and Routing Protocols in MANET . . . . . . . . . . . . . . . . . . . . . . . . . . 895
Sunil Kumar Singh, Rajesh Duvvuru and Jyoti Prakash Singh
A Survey on Video Segmentation . . . . . . . . . . . . . . . . . . . . . . . . . . . 903

Dalton Meitei Thounaojam, Amit Trivedi, Kh. Manglem Singh
and Sudipta Roy
A New Paradigm for Open Source Software Development . . . . . . . . 913

Sushil Kumar, Ranjeet Ranjan and Amit Kumar Trivedi
A Real-Time Signature Verification Technology Using Clustering

and Statistical Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 919
Joshane Kelsy and Rajib Sarkar
Component-Aspect Separation-Based Slicing

of Aspect-Oriented Programs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 931
Jagannath Singh, Durga Prasad Mohapatra and Pabitra Mohan Khilar
Evaluation of Software Understandability Using Rough Sets . . . . . . . 939

D. Srinivasulu, Adepu Sridhar and Durga Prasad Mohapatra
HCDLST: An Indexing Technique for Current and Recent-Past

Sliding Window Spatio-Temporal Data . . . . . . . . . . . . . . . . . . . . . . 947
Kuleshwar Sahu, Sangharatna J. Godboley and S. K. Jain
Solving Planar Graph Coloring Problem Using PSO

with SPV Rule . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 955
Vaibhav Bhardwaj and Sudhanshu Prakash Tiwari
xxii Contents
Weather Prediction Using Error Minimization Algorithm

on Feedforward Artificial Neural Network . . . . . . . . . . . . . . . . . . . . 967
Arti R. Naik, Pathan Mohd. Shafi and Shyamsunder P. Kosbatwar
Mining Association Rules Using Adaptive Particle

Swarm Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 975
K. Indira, S. Kanmani, V. Ashwini, B. Rangalakshmi,
P. Divya Mary and M. Sumithra
Study of Framework of Mobile IP and MANET Integration . . . . . . . 985

Devendra Chaphekar, Bhisham Sonkar and Gupteshwar Gupta
Delay Analysis of Various Links Using OPNET Simulator . . . . . . . . 993

Pooja Singh, Chitosia Anamika, C. K. Jha and Anup Bhola
GenSeeK: A Novel Parallel Multiple Pattern Recognition Algorithm

for DNA Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1001
Kaliuday Balleda, D. Satyanvesh and P. K. Baruah
Improvement of PAPR in OFDM Systems Using SLM Technique

and Digital Modulation Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . 1007
Srinu Pyla, K. Padma Raju and N. BalaSubrahmanyam
Radioactive Pollution Monitoring Using Triangular Deployment

in Wireless Sensor Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1019
Ankit Khare and Nitin Nitin
Securing Networks Using Situation-Based Firewall

Policy Computations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029
Vijender Kumar Solanki, Kumar Pal Singh, M. Venkatesan
and Sudhanshu Raghuwanshi
Color Image Quantization Scheme Using DBSCAN

with K-Means Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1037
Kumar Rahul, Rohit Agrawal and Arup Kumar Pal
A Novel Approach to Text Steganography Using Font Size

of Invisible Space Characters in Microsoft Word Document . . . . . . . 1047
Susmita Mahato, Dilip Kumar Yadav and Danish Ali Khan
Personalizing News Documents Using Modified Page

Rank Algorithms. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1055
S. Akhilan and S. R. Balasundaram
Contents xxiii
Understanding Query Vulnerabilities for Various SQL

Injection Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1063
U. Chandrasekhar and Digvijay Singh
Effective Ontology Alignment: An Approach for Resolving

the Ontology Heterogeneity Problem for Semantic
Information Retrieval . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1077
Ankita Kandpal, R. H. Goudar, Rashmi Chauhan,
Shalini Garg and Kajal Joshi
Classification Technique for Improving User Access

on Web Log Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1089
Bina Kotiyal, Ankit Kumar, Bhaskar Pant and R. H. Goudar
A Review on Methods for Query Personalization . . . . . . . . . . . . . . . 1099

Shivangi Sharma and Prachi Gupta
A Wideband Compact Microstrip Antenna

for DCS/PCS/WLAN Applications . . . . . . . . . . . . . . . . . . . . . . . . . . 1107
Vinod Kumar Singh, Zakir Ali, Ashutosh Kumar Singh
and Shahanaz Ayub
Analysis of Type-2 Fuzzy Systems for WSN: A Survey . . . . . . . . . . . 1115

Megha Sharma and Ashutosh Kumar Singh
Fusion of Entropy-Based Color Space Selection and Statistical

Color Features for Ripeness Classification of Guavas . . . . . . . . . . . . 1125
Suchitra Khoje and S. K. Bodhe
Optimal Positioning of Base Station in Wireless Sensor

Networks: A Survey . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1135
Prerna Meena, Devendra Gurjar, Ashutosh Kumar Singh
and Shekhar Verma
Testing and Implementation Process in Automation

of a University . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1145
Vaibhav Sharma, Jyoti Singh and A. S. Zadgaonkar
Performance of Spectral Efficiency and Blocking Probability

Using Distributed Dynamic Channel Allocation . . . . . . . . . . . . . . . . 1153
Y. S. V. Raman, S. Sri Gowri and B. Prabhakara Rao
xxiv Contents
An Effective Content-Based Image Retrieval Using Color,

Texture and Shape Feature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1163
Milind V. Lande, Praveen Bhanodiya and Pritesh Jain
Underwater Communication with IDMA Scheme . . . . . . . . . . . . . . . 1171

Tanuja Pande, Kulbhushan Gupta, M. Shukla, Prachi Tripathi
and Ashutosh Singh
M-ARY PSK Modulation Technique for IDMA Scheme . . . . . . . . . . 1179

Pratibha Verma, Sanjiv Mishra, M. Shukla and Ashutosh Singh
A Novel Approach for Eye Gaze and Tilt Estimation . . . . . . . . . . . . 1187

Sambit Bakshi, Rahul Raman and Pankaj K. Sa
Enhanced Single-Pass Algorithm for Efficient Indexing Using

Hashing in Map Reduce Paradigm. . . . . . . . . . . . . . . . . . . . . . . . . . 1195
Piyush Kumar Sinha, Prashant Joshi, Pooja Pundir, Manisha Negi
and R. H. Goudar
Data Structures for IP Lookups, A Comparative Analysis

with Scalability to IPV6. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1201
Soumyadeep Ghosh, Oaindrila Das and Arindam Majumdar
Multiobjective Clustering Using Support Vector Machine:

Application to Microarray Cancer Data . . . . . . . . . . . . . . . . . . . . . . 1209
Anita Bai
Prediction of Warning Level in Aircraft Accidents using

Classification Techniques: An Empirical Study. . . . . . . . . . . . . . . . . 1217
A. B. Arockia Christopher and S. Appavu Alias Balamurugan
Fuzzy TOPSIS Method Applied for Ranking of Teacher

in Higher Education . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1225
H. S. Hota, L. K. Sharma and S. Pavani
Performance Analysis of Transformation Methods

in Multi-Label Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1233
P. K. A. Chitra and S. Appavu Alias Balamurugan
Predictive Data Mining Techniques for Forecasting Tamil Nadu

Electricity Board (TNEB) Load Demand: An Empirical Study . . . . . 1241
T. M. Usha and S. Appavu Alias Balamurugan
Contents xxv
Novel Approach for Finding Patterns in Product-Based

Enhancement Using Labeling Technique . . . . . . . . . . . . . . . . . . . . . 1249
Hemant Palivela, H. K. Yogish, N. Shalini and S. N. Raghavendra
Optimal Path and Best-Effort Delivery in Wireless

Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1257
Vipin Kumar and Sushil Kumar
Spanning-Tree-Based Position-Based Routing in WSNs. . . . . . . . . . . 1267

Vipin Kumar and Sushil Kumar
Feature Extraction and Classification of Microarray Cancer

Data Using Intelligent Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . 1277
Anita Bai and Anima Pradhan
Survey of Route Choice Models in Transportation Networks . . . . . . 1285

Madhavi Sharma, Jitendra Kumar Gupta and Archana Lala
Secure Routing Technique in MANET: A Review. . . . . . . . . . . . . . . 1291

Aartika Chandrakar and Rajib Sarkar
About the Editors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1309
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1311

Image and Template Security
for Palmprint
Munaga V. N. K. Prasad and B. Adinarayana
Abstract The wide spread use of biometrics in real world causes more security
and privacy concerns to be raised, because conventional biometric systems store
biometric templates as it is in database without any security, and this may lead to
the possibility of tracking personal information stored in database; moreover,
biometric templates are not revocable and are unusable throughout their life time
once they are lost or stolen. To overcome this non-revocability of biometrics, we
proposed two methods for image security and template security in this paper (these
methods are also applicable for some of the biometric traits); for image security,
we used chaotic mixing with watermarking technique; first chaotic mixing is
applied to the host image, and then, this resultant image is embedded in a sample
(cover or carrier) image, and if the intruder gets the chaotic mixed image, he/she
cannot get back the original host image, and for template security, we shuffled
the palmprint template according to the input random number. This shuffling
scheme increases the imposter matching score leaving genuine matching score.

Keywords Chaotic mixing Watermarking Cryptography Log-Gabor filter
Pearson correlation coefficient
1 Introduction
Use of biometrics in today’s networked world increased drastically over last

decades. Palmprint is one of the biometric traits; a lot of work have been done on
palmprint identification and verification [1, 2], compared to the security on the
M. V. N. K. Prasad (&) B. Adinarayana

IDRBT, Castle Hills, Road No 1, MasabTank, Hyderabad, India
e-mail: mvnkprasad@idrbt.ac.in
B. Adinarayana
e-mail: contact.adinarayana@gmail.com
D. P. Mohapatra and S. Patnaik (eds.), Intelligent Computing, Networking, 1

and Informatics, Advances in Intelligent Systems and Computing 243,
DOI: 10.1007/978-81-322-1665-0_1, Springer India 2014
2 M. V. N. K. Prasad and B. Adinarayana
palmprint data (i.e., template and image). Security of the biometric data must be
provided in order to increase the widespread utilization of biometric traits.
According to Ratha et al. [3], there are eight basic types of attacks on the
biometric system. Kong et al. proposed different security methods to avoid replay
and database attacks [4] in palmprint recognition system, Lifang Wu et al. pro-
posed fuzzy vault scheme to provide the template protection online authentication
on the face database [5], Zhifang Wang et al. developed a secure face recognition
system using principle component analysis (PCA) [6], Brenden Chen et al. used
higher-order spectral (HOS) transform applied to biometric data as a secure hash
function [7], Feng Hao et al. proposed combining crypto with biometrics
effectively [8] using different coding techniques like Hadamard code and Reed-
Solomon code, Mayank Vatsa et al. developed a multimodal biometrics system
using watermarking [9], Thian Song Ong et al. used fuzzy commitment scheme for
biometric template protection [10], and Shenglin Yang et al. developed a secure
iris verification system based on error correcting code (ECC) cryptographic
technique [11].
Encryption and watermarking are two widely used techniques to achieve
security in biometrics. Encryption system does not give complete solution to the
problem, because once the password is known, everything is gone. With the help
of watermarking technique in biometric systems is good way to solve the prob-
lems. Watermarking [12–14] is simply known as embedding the watermark into
cover image in order to protect the copyright and authorization.
The rest of the paper is organized as follows: Sect. 2 explains about image
security with chaotic mixing and watermarking. Template security and proposed
system are explained in Sect. 3. Conclusion is given in Sect. 4.
2 Image Protection
Proposed approach uses both chaotic mixing and watermarking for image security.
Many researches have been done in watermarking and chaotic mixing for copy-
right protection. Voyatizis G et al. used strong chaotic mixing-based watermarking
algorithm for embedding logo; the security of the system lies in the strong
parameters of the chaotic mixing system [15]. Tefas et al. proposed a novel
approach for image authentication with chaotic mixing system because it increases
the security of the proposed method [16].
2.1 Chaotic Mixing
A two-dimensional chaotic mixing can be given as spatial transformation of planar

regions. The chaotic mixed images with different iteration (n) values are shown in
Fig. 1. It can be represented by map:
Image and Template Security for Palmprint 3
Fig. 1 a Binary palmprint image and b chaotic mixed image after n = 3, c n = 5, and d n = 15
A : U ! U; U ¼ ½0; 1Þ ½0; 1Þ R2 ð1Þ

and the formula for the above equation is
r 0 ¼ Ar ðmod 1Þ ð2Þ

xnþ1 a11 a12 xn
¼ ðmod 1Þ ð3Þ
ynþ1 a21 a22 yn
where aij € Z, det A = 1, and A1, 2 {-1, 0, 1} are the eigenvalues of A. Iterated
actions of A on a point r0 € U from a dynamic system A(n):U ? U, given by the
iterative process:
Where n = 0, 1, 2,… The set of points hðr0 Þ ¼ fr0; r1; r3; . . .g is an orbit of
the system. Roughly speaking, if V0 is a dense subset of U, then its image Vn under
the map A(n) spreads chaotically over the entire space of U while preserving its
area, because det A = 1.
Equation (4) strongly explains about chaotic mixing, and it possesses a dense
set of periodic orbits. An orbit hðr0 Þ ¼ fr0; r1; r3; . . .g is periodic; if it is finite,
i.e., there exists a number ‘T’ of iterations such that r0 = rT. The necessary and
sufficient condition for an orbit to be periodic is that the initial position r0 has
rational coordinates. The inverse chaotic mixing is applied to get the
rnþ1 ¼ An r0 ðmod 1Þ or rnþ1 ¼ Arn ðmod 1Þ ð4Þ
original image from the chaotic mixed image; in our proposed method, we
embedded this chaotic mixed image into cover image for enhancing security.
2.2 Watermarking
Watermarking is mainly used in copyright protection and to hide the intended

information into a digital image, etc., and this must be performed in such a way
that the added information does not cause degradation of the perceptual quality
and cannot be removed [16]. Basically, image watermarking techniques can be

classified into two groups with respect to the domain of application of water-
marking. First, in spatial domain methods, the pixel values in the image channel(s)
are changed, whereas in spectral-transform domain method, a signal is added to the
host image in a transform domain such as the full-frame DCT domain. Many
algorithms are proposed for watermarking purpose [16–19].
There have been few published papers on watermarking on biometric traits
(palmprint, fingerprint, face, etc.). Jain et al. proposed a biometric data-hiding
technique in which they have selected to use one type of biometric data to secure
another type of biometric data to increase the overall security of the system [20].
Changjiang et al. proposed a watermarking approach based on the concept of
discrete stationary wavelet transform (DSWT) for the copyright protection
application, and they used Arnold and inverse Arnold transform for the watermark
scrambling and reconstruction [19]. Mayank Vatsa et al. proposed a digital image
watermarking for secure multimodal biometric system in which two phases of
security are proposed for simultaneously verifying any individual and protecting
the biometric template; first, the iris code (template) generated by 1D Log-Gabor is
watermarked in face image [9], such that the face is visible for verification, and the
watermarked iris is used to cross-authenticate the individual and securing the
biometrics data (face) is also possible. For watermarking, they used two algorithms
namely modified correlation-based algorithm (MCBA) and modified 2D discrete
cosine transform-based algorithm (M2DCT). Cao et al. [21] developed a multiple
watermarking scheme for GIS vector data to improve the robustness and combine
the advantages of single watermarking scheme; finally, they concluded that their
technique increases the robustness and this technique plays an increasing role in
copyright protection.
In this paper, we used watermarking along with chaotic mixing technique, and
we applied watermarking on the image which is obtained after applying chaotic
mixing. The whole process is explained in Fig. 2, first take binary palmprint image
(of size 150 9 150) as a host image because our main intension is to hide this host
image into another sample(cover or carrier) image, then apply the chaotic mixing
on the host image i.e., palm image after chaotic mixing the images as shown in
Fig. 2. Here, chaotic mixing is dependent on the ‘n’ value; if ‘n’ value changes, the
resulting image is varied so here ‘n’ value is confidential. This can be clearly
observed from the Fig. 1. Then, take a sample gray scale image as a cover or
carrier image (of size 150 9 150). Here, we have taken person as a cover image.
Then, we embedded the host image in the cover image. For this, we used the well-
known LSB technique. Take each pixel value from the host image (i.e., here, host
image is binary image so ‘0’ and ‘1’ will be the possible values), and replace the
least significant bit pixel value in the cover image with the appropriate value in
the host image pixel value, so the resultant image is the watermarked image
(of size 150 9 150); these images are stored in the database, even intruder cannot
observe the palmprint image with naked eye, and if he came to know that the
watermarking is applied, he cannot get the original palmprint image; instead,
Water-
Marking
Chaotic
Mixing
Fig. 2 Watermarking procedure
he will get the chaotic mixed palmprint image. With this, he cannot roll back to the
original palmprint image without knowing the ‘n’ value. To get back original
image, we used the reverse chaotic mixing.
3 Template Security
Biometrics authentication systems are to authenticate a person depending upon his

physical and behavioral characteristics, but unfortunately, these biometric-based
authentication systems are facing new challenges related to personal data pro-
tection, because of these security and privacy issues, many researchers came up
with new techniques toward protecting the biometric templates against possible
attacks. In today’s biometric systems, biometrics data are not protected, and if it is
compromised or lost or stolen at any phase in the authentication process, it cannot
be used again (difficult to revoke or replace) as an identity, because of its per-
manence nature since they should remain stable over the life time of an individual.
Secure storage of user data is not a new problem, basically in UNIX based
systems, where user credential are stored in a shadow password file, there the
passwords are hashed using a one-way hash function and computed hash values
are stored in database. When user enters a password to enter into the system,
password is hashed and matched against the stored hash value; user is considered
as a legitimate user if and only if both hash values are same. But, these techniques
cannot be adapted thoroughly to protect biometric template because biometric
image is dependent on many factors like capturing device, rotation, etc., but tra-
ditional cryptographic techniques do not allow even a single bit of error. So,
storage of biometric template in a secure way has become an increasing important
issue in biometric authentication systems; to address these types of problems,
several methods have been proposed in the literature, and these methods can be
classified into biocryptosystems and cancellable systems. Biocryptosystems means
integration of biometrics with cryptography, and numerous advantages can be
obtained by this combination. Cancellable biometrics have been introduced in
Kanade et al. [22], where the template protection has been achieved by trans-
forming the template into other domain, where data cannot be reverted back to its
original form; for recognition, the input template is also transformed and then
matched. If the data are lost, then biometric template can be reissued with can-
cellable systems.
3.1 Proposed System
The main objective of this method is to enhance security to the palmprint template
which is stored in the database. First is template construction then security; well-
defined methods are used for template construction. Log-Gabor filter is used for
feature extraction in palmprint images. This filter is already used for texture
extraction in iris images [23]. For all our experiments, we used IIT-Delhi database
[24]; local features as for template construction for that palmprint image are
divided into 25 (5 9 5) non-overlapping sub-blocks (images). Then, compute
standard deviation on each sub-block that gives the feature vector (FV) of the
particular image. FV = [SD(1), SD(2),…SD(n)] where SD(i) is the standard
deviation of the ith block and ‘n’ is 25, so that here every template consists of
25 values.
First generate random number range in 1–25, then arrange the generated tem-
plate according to the input random number as shown in Fig. 3. If our first random
number is 10, then get tenth standard deviation value from original template and
store it in the first position in the new template and so on, but in this approach, the
constraint is duplicate random numbers are not allowed. If it is allowed, there is
possibility of losing some features. Then for every template, store both shuffled
template and random numbers in the database, but an intruder can access the
random numbers, and he can reshuffle the transformed template to the original
form with this random number. So, to avoid such problems, here we encrypted the
random numbers and stored the encrypted form (cipher text) of random numbers in
the database instead of storing them as it is in the database. The password for
encryption of random numbers is with the administrator of the database so that
nobody else cannot access the template; here, it is very difficult to the attacker to
find the original template from the shuffled template because the number of
possibilities is around 25. It is computationally infeasible. Figure 4 shows the
procedure for matching input template to the enrolled template. Here, first decrypt
Securing
Random
Random no.
numbers
Shuffling
Template template w.r.t Data-
of 25 std random base
values number
Fig. 3 Template protection procedure
Template of Matching Score >

Enrolled Thresh- Accept
Palmprint. old
Database
Input Palmprint
Template
Reject
Fig. 4 Template matching procedure
the random numbers. Then, reshuffle the enrolled template according to the ran-
dom numbers. Then matching is done with the input template in our experiment.
For matching, we used Pearson correlation coefficient. This will give the matching
score between two templates or a value means how they are correlated. We got
satisfactory results using this method.
4 Conclusion
In this paper, image security and template security have been discussed. First,
image security is provided with the help of watermarking and chaotic mixing.
These two methods enhanced the security to the image, and for template security,
random number encryption and shuffling are used. These two methods are simple
methods for providing security to some of the biometric traits so these techniques
can be used for enhancing security to image database as well as for template
database.
References
1. Huang, D.S., Jia, W., Zang, D.: Palmprint verification based on principal lines. Pattern
Recogn. 41(4) (2008)
2. Laadjel, M., Bouridane, A., Kurugollu, F., Boussakta, S.: Palmprint recognition using Fisher-
Gabor feature extraction. In: IEEE International Conference on Acoustics, Speech and Signal
Processing (ICSSP), pp. 1709–1712 (2008)
3. Ratha, N.K., Connell, J.H., Bolle, R.M.: Enhancing security and privacy in biometrics-based
authentication systems. IBM Syst. J. (End-to-End Security), 40 (2001)
4. Kong, A., Zhang, D., Kamel, M.: Three measures for secure palmprint identification. Pattern
Recogn. 41 (2008)
5. Wu, L., Yuan, S.: A face based fuzzy vault scheme for secure online authentication. In:
Second International Symposium on Data, Privacy and E-Commerce (ISDPE), Nov 2010,
pp. 45–49
6. Wang, Z., Wang, S., Ding, Q.: A secure face recognition algorithm based on adaptive non-
uniform quantization. In: First International Conference on Pervasive Computing, Signal
Processing and Applications (PCSPA), pp. 1115–1118 (2010)
7. Chen, B., Chandran, V.: Biometric template security using higher order spectra. In: IEEE
International Conference On Acoustics Speech and Signal Processing (ICASSP),
pp. 1730–1733 (2010)
8. Hao, F., Anderson, R., Daugman, J.: Combining crypto with biometrics effectively. IEEE
Trans. Comput. 55, 1081–1088 (2006)
9. Vatsa, M., Singh, R., Mitra, P., Noore, A.: Digital watermarking based secure multimodal
biometric system. In: IEEE International Conference on Systems, Man and Cybernetics, vol.
3, pp. 2983–2987 (2004)
10. Teoh, A.B.J., Ong, T.S.: Secure biometric template protection via randomized dynamic
quantization transformation. In: International Symposium on Biometrics and Security
Technologies (ISBAST), pp. 1–6 (2008)
11. Yang, S., Verbauwhede, I.: Secure IRIS verification. In: IEEE International Conference on
Acoustics, Speech and Signal Processing (ICASSP), pp. 133–136 (2007)
12. Barni, M., Bartolini, F., Cappllini, V., Piva, A.: Copyright protection of digital images by
embedded unperceivable marks. Image Vis. Comput. 16 (1998)
13. Pereira, S.: Robust digital image watermarking. Doctoral Thesis, University of Geneva
(2000)
14. Pitas, I.: A method for watermark casting on digital image. IEEE Trans. Circuits Syst. Video
Technol. 8, 775–780 (2002)
15. Voyatzis, G., Pitas, I.: Digital image watermarking using mixing systems. Comput. Graph.
22, 405–416 (1998)
16. Tefas, A., Pitas, L.: Image authentication using chaotic mixing systems. In: IEEE
International Symposium on Circuits and Systems (ISCAS), vol. 1, pp. 216–219 (2000)
17. Shu, Z., Li, G., Gan, L., Zhan, L., Fang, W.: Image watermarking based on wavelet-based
contourlet packet transform with best tree. In: Second International Symposium on Electronic
Commerce and Security (ISECS), vol. 1, pp. 203–207 (2009)
18. Zhao, H.: Algorithm of digital image watermarking technique combined with HVS. In: IEEE
International Conference on Computer Science and Information Technology (ICCSIT),
pp. 774–777 (2010)
19. Zhang, C., Wang, J.: Digital image watermarking algorithm with double encryption by
Arnold transform and logistic. In: Fourth International Conference on Network Computing
and Advanced Information Management, vol. 1, pp. 329–334 (2008)
20. Jain, A.K., Uludag, U.: Hiding biometric data. IEEE Trans. Pattern Anal. Mach. Intell. 25,
1494–1498 (2003)
21. Cao, J., Li, A., Lv, G.: Study on multiple watermarking scheme for GIS vector data. In: 18th
International Conference on Geoinformatics, pp. 1–6 (2010)
22. Kanade, S., Petrovska-Delacretaz, D., Dorizzi, B.: Cancelable iris biometrics and using error
correcting codes to reduce variability in biometric data. In: IEEE Conference on Computer
Vision and Pattern Recognition (CVPR), pp. 120–127 (2009)
23. Fan, L., Duan, H., Long, F.: Face recognition by subspace analysis of 2D Log-Gabor
wavelets features. In: Third International Conference on Intelligent system and Knowledge
Engineering (ISKE), vol. 1, pp. 1167–1172 (2008)
24. IITD Touchless Palmprint Database: http://web.iitd.ac.in/*ajaykr/Database_Palm.html
Extending Network Lifetime by Time-
Constrained Data Aggregation in Wireless
Sensor Networks
K. B. Ashwini and G. T. Raju
Abstract The most important challenge in wireless sensor network is to reduce

the energy consumption of each node and increase the network lifetime. Many
networking schemes are used to minimize the amount of data transmission by data
aggregation. Three main factors affecting the lifetime of sensor nodes are as
follows: (1) the consumed energy for sending data from the leaves to the sink,
(2) queuing delay during aggregation, and (3) the tree’s delay, which is equal to
the tree’s depth, should be considered. We analyze the optimal time allotted for
intermediate node data aggregation and optimal delay at each higher aggregation
node. The adaptive scheme then dynamically adjusts the time constrain at the
sensor node.
Keywords Data aggregation Wireless sensor networks (WSN)
1 Introduction
Recent advances in technology have made wireless sensors compact and inexpen-
sive. Networks formed from such sensors are known as wireless sensor networks and
are used in a wide range of applications such as environmental surveillance, military
operation, and other domains. The wireless sensor network consists of groups of
nodes, which captures and transmits the data to the base station. The base station has
continuous power supply, while the nodes are battery-powered. If a sensor node runs
K. B. Ashwini (&)
Deeksha Integrated, Bharathiar University, Coimbatore, Tamil Nadu, India
e-mail: k.b.ashwini13@gmail.com
G. T. Raju
RNSIT, Bangalore, Karnataka, India
e-mail: drgtraju_rnsit@gmail.com

12 K. B. Ashwini and G. T. Raju
out of power, its coverage is lost. The network lifetime of a wireless sensor network
is determined by the time duration before the first node fails in the network [1].
Therefore, it is very important to manage the sensor nodes in an energy-efficient way
to extend the lifetime of the sensor network [2].
To increase the network lifetime, the number of packet transmission between
the sensor node and the sink must be decreased. Data aggregation is a technique
used to combine the information from the sensor nodes surrounding the event and
send the information to the end point, which thereby reduces congestion [3].
Wireless sensor networks offer different methods of data gathering in distributed
system architectures and dynamic access via wireless connectivity.
2 Related Work
Different aggregation algorithms have been implemented to prolong the network

lifetime and energy-aware optimization in wireless sensor network. In [4], data-
centric routing is compared with traditional end-to-end routing schemes. The
author examines the impact of source–destination placement and communication
network density on the energy, cost, and delay associated with data aggregation. In
[1], online data aggregation problem in sensor network is considered where the
author shows the problem to be NP complete and propose several heuristic
algorithms in terms of network lifetime delivered. In [2], the optimal precision in
network lifetime is analyzed and an adaptive scheme that dynamically adjusts the
precision constraints at the sensor nodes is proposed. In [5], to increase the net-
work lifetime, an energy-aware algorithm is proposed for constructing the
aggregation tree; it considers both the energy and distance parameters to construct
the tree. In [6], the problem of constructing efficient trees to send aggregated
information to the sink is analyzed. In [7], data gathering protocols are presented
that efficiently collect data.
3 System Model and Problem Definition
Consider a connected graph G with N nodes (v1, v2…vn) powered by batteries with
non-replenishable energy E(i) and a base station v0 connected to an unlimited
power supply with energy E(o). The nodes monitor the environment and period-
ically report to the base station. Each sensor node generates one B-bit message per
time stamp. The messages from all sensors are collected at each time stamp and
aggregated at the intermediate sensor into a single outgoing message of size B-bit
and sent to the base station. The amount of time required to send or receive one bit
of data is as and ar.
Consider Fig. 1a where node 4 has to aggregate the data collected by the
children nodes 1, 2, and 3 and forward that to node 5. In Fig. 1b, four columns are
Extending Network Lifetime by Time-Constrained Data Aggregation 13
Fig. 1 Case 1: an example of data aggregation constraint
displayed where the first three represents the queues which store the packets
coming from nodes 1, 2, and 3. The last column stores the aggregated packets of 1,
2, and 3. The vertical axis denotes the time when the data packet is collected. Data
collected at the same time usually contain the information about the same event. In
this paper, we consider that data aggregation is done only on data collected at the
same time. Suppose a packet coming from node 1 at time stamp 5 has no packets at
that time stamp from nodes 2 and 3, the aggregation node just forwards packet
from node 1.
If the tree T has a lifetime L(T)
Data aggregation is required to maximize the network lifetime (A) max L(T) such
that T € A(G)
where A(G) is the set of data gathering trees in G.
Let C(T,i) be the number of children for node vi in T. B is the energy required by vi
to aggregate the data received from all children. During each time stamp node vi
receives B-bit message from each child. The energy consumption of node vi for
each time stamp after aggregating the received message and transmitting B-bit
message to its parent is ar B C(T,i) + at, its lifetime is L(T,i) = Ei-(ar B C (T,i) + at).
In Fig. 1c, node 2 postpones all its data collection by one slot, similarly with
node 3. Data aggregation cannot be done, since all the packets are collected at
different time stamps. As a result, the number of packets in queue 4 is the sum-
mation of packets of queues 1, 2, and 3’s. To keep the network stable and to
prevent the queue of node 4 from overflow, it has to transmit faster than the
aggregate rate of nodes 1, 2, and 3. This example reveals that as the transmission
rate of an aggregation node increases, the energy consumption increases and in
turn the network lifetime decreases.
Consider Fig. 2a where nodes 0, 1, and 2 work as source nodes. Nodes 1 and 2
are directly connected to the aggregation node 4, whereas node 0 depends on the
intermediate node 3 to transfer the data to aggregator 4. Suppose at a particular
time t1, as shown in Fig. 2b, nodes 1 and 2 have delivered some data to 4, whereas
there is a delay in the arrival of data from node 0.
1. At that time if node 4 has to wait till time t2, to receiving the data from node 0
and then aggregate as shown in Fig 2b at time t2 the delay increases.
2. At time t1, if node 4 delivers packets, it has to do the same job again after
receiving packet from node 0, which results in the increased network traffic and
decreased network lifetime.
4 Solution and Implementation
Data aggregation aims to combine responses from multiple sensors into a single
message. By reducing the number of message transmission in the network, the
energy consumption can be reduced and the network lifetime is increased. In
practice, this is complicated by the fact that not every node has a response ready at
exactly the same time as in Fig. 1.
A: Time Approximation Algorithm for data aggregation at intermediate nodes.
Let each aggregation node estimate and report to the base station, the number of
children for the aggregation node vn, the minimum time required to receive B-bit
message from one child, and the maximum time required to receive B-bit message
from at least vn/2 nodes. The base station optimizes time allocation for the
aggregation node to extend network lifetime. Optimal Time Allocation Algorithm
Input: Aggregation node va with the number of children v1, v2, v3
Output: B-bit message from the aggregation node.
1. for time = min to max
2. B-bit message = aggregated result of any two children of node va
3. min = min +1
Extending Network Lifetime by Time-Constrained Data Aggregation 15
Fig. 2 Case 2: an example of data availability constraint
4. end for
5. Send B-bit message generated by the aggregator to its parent.
B: Time Approximation Algorithm for data aggregation Tree
In an unbalanced network as in Fig. 2, the response time will vary depending on
the difference in tree levels of the responding nodes.
1. The leaf nodes respond as soon as the event occurs and send the sensed data to
the aggregator.
2. The aggregator waits for a specific time before aggregating the response
received and sends the result to the parent.
3. The process continues till the sink receives a single B-bit message.
4. This also allows the sink to recalculate a more appropriate time for the next
query if necessary.
5 Conclusion
In this paper, we identify the unique challenges faced during data aggregation in
wireless sensor networks. We analyzed the importance of time when aggregating
data in WSN and formulated this problem as network utility maximization prob-
lem. We also proposed as algorithm to be implemented to solve the problem. In
future work, we plan to implement several algorithms to determine the optimal
time to be allocated for data aggregation.
References
1. Liang, W., Liu, Y.: Online data gathering for maximizing network lifetime in sensor networks.
IEEE Trans. Mob. Comput. 6(1), 2–11 (2007)
2. Tang, X., Xu, J.: Optimizing lifetime for continuous data aggregation with precision
guarantees in wireless sensor networks. IEEE/ACM Trans. Networking 16(4), 904–917 (2008)
3. Vaidyanathan, K., Sur, S., Narravula, S., Sinha, P.: Computer science and engineering. The
Ohio State University, Columbus (2004). OH, 43210
4. Krishnamachari, B., Estrin, D., Wicker, S.: The impact of data aggregation in wireless sensor
networks. Int. J. Comput. Telecommun. Netw. (2003)
5. Eskandari, Z., Yaghmaee, M.H., Mohaierzabeh A.H.: Energy efficient spanning tree for data
aggregation in wireless sensor networks. 978-1-4244-2390-3/08, IEEE (2008)
6. Thepvilojanapong, N., Yoshito, K.S.: On the construction of efficient data gathering tree in
wireless sensor networks. ieeexplore.ieee.org (2005)
7. Kulik, L., Tanin, E., Umer, M.: Efficient data collection and selective queries in sensor
networks, pp. 25–44. Springer, Heidelberg (2008). GSN 2006, LNCS 4540
The Complex Network Analysis of Power
Grid: A Case Study of the West Bengal
Power Network
Himansu Das, Gouri Sankar Panda, Bhagaban Muduli

and Pradeep Kumar Rath
Abstract Complex network analysis is a new multidisciplinary approach to

characterize the structure and function of power grid as a complex network to
establish the communication topology between the grid stations. By taking this
into consideration, we are trying to design a reliable system which continuously
supplies power to the grid station which can able to avoid the cascading failures,
i.e., blackouts. In this article, we model the power grid as an undirected graph
through which the different connectivity of power grid is represented as a measure
to evaluate structure and function of power grid. The goal of this paper is to
characterize the topological structure of the West Bengal of India power grid and
evaluate the performance of electricity infrastructures.
Keywords Grid computing Power grid Complex network Topological

analysis Power system
H. Das (&)
Department of CSE, Roland Institute of Technology, Berhampur, Odisha, India
e-mail: das.himansu2007@gmail.com
G. S. Panda
Department of EEE, Roland Institute of Technology, Berhampur, Odisha, India
e-mail: gourisankar.panda@gmail.com
B. Muduli P. K. Rath
Department of MCA, Roland Institute of Technology, Berhampur, Odisha, India
e-mail: bhagaban.muduli@gmail.com
P. K. Rath
e-mail: pradeep.ratha@gmail.com

18 H. Das et al.
1 Introduction
The current power system is based on the renewable energy sources [1] such as
coal, natural gas, and oil, which emits CO2 to the atmosphere. To maintain the
nature clean and green, the power system should be changed toward renewable
energy sources [2] such as wind, solar, tide, and water. The future power system
(smart grid) is the integration of secure, reliable, and high-speed communication
infrastructure to manage the complex power grid network [3] toward more intel-
ligently. Although the technologies are enhancing, but still the rate of cascading
failures is not decreased, which leads to major blackouts in the power grid. The
major cause of the cascading failure is that there is some flaw in power trans-
mission line, which leads to blackouts in power grid. By taking this into consid-
eration, we modeled the power grid as a graph to trace the cause of failure in the
power grid, and in the same time, it also monitors [4] the power grid continuously
to provide harness power supply to the power network.
To study the power grids as a complex network, some simplifications are
necessary. In the undirected graphs, each node represents a bus. In physical grid,
the buses having different electrical properties, like nodes, are assumed to be
homogeneous. This representation ignores whether transformers, generators, loads,
or transmission lines attach to the bus. All communication lines are modeled as
edges with equal weights. Physical length and electrical impedance are ignored in
the undirected graph representation.
Most of the complex problems such as World Wide Web, Internet, social
interacting species, neural networks, chemical systems, and coupled biological
systems are solved by using topological analysis of the graph [3]. Though power
system is a complex network, it is necessary to go for topological analysis of
power grid. Topological analysis is performed based on the physical significance
[5] as the geographical distance of the network structure of the graph. But it will
ignore the electrical properties [5, 6] of power grid such as resistance, impedance
of the network. The comparison between the traditional power system and the
future power system [1, 2] is shown in Table 1.
Table 1 Represents the difference between traditional power system and future power system
Sl. Traditional power system Future power system
No.
1. It was centralized in nature It will be distributed in nature
2. Small number of large generators is used Large number of small generators will be used
3. High-capacity generators were used Low-capacity generators will be distributed
throughout the globe
4. Non-renewable energy sources were used Renewable energy sources will be used in
future
5. No computational and communication Having computational and communication
facility of generators facility of generators
6. It was expensive and not so reliable It will inexpensive and reliable
The Complex Network Analysis of Power Grid 19
In this paper, a framework for communication between different buses of

electric power grid has been presented, which employs the grid computing as the
backbone of ICT infrastructure. The remaining part of this paper is organized as
follows: Sect. 2 gives a brief overview of graph theoretic interpretation of the
power grid. Section 3 provides the graph theoretic model of power grid as a
complex network and also gives different parameters that are associated with
power network. Section 4 gives the case study of West Bengal power grid and
presented the results. Section 5 concludes the paper. In this paper, a number of
PCs have been aggregated together to set up a grid environment that employs Grid
Gain 2.0 as a middleware [7]. It is a collection of software components which
provide many of the building blocks (services) necessary to create a grid-based
application. The most attractive feature of Grid Gain 2.0 was its java-based nature.
2 Fundamentals of Power System as a Graph

Theoretic Model
In this section, we present the basic concepts of modeling power system as a graph.
An undirected graph is defined as a pair of sets G (n, m) such that n is the number
of nodes and m is the number of edges. There are some basic definitions of graph
that are as follows.
Definition 1 (Graph): A graph G (V, E) is a pair of sets where V is the set of
vertices and E is the set of edges.
Definition 2 (Power Grid as Graph): A graph G (V, E) is called power grid graph
if and only if each element vi Æ V is a transformer, substation, generating station,
or load unit of physical power grid and if there is an edge ei,j Æ E representing the
existence of physical cable between two nodes vi to vj in the power grid from
vertex vi to vj.
Definition 3 (Degree of Graph): In an undirected graph, the degree of vertex is
the number of edges e Æ E incident in a vertex v Æ V and is called degree of that
vertex in the graph. Simply, we can say that the degree of a node specifies the
number of nodes adjacent to that node.
Definition 4 (Adjacency Matrix): Let Vi be the vertices of graph G (V, E), then the
adjacency matrix A is the n 9 n matrix, where A represents the configuration of
the graph, such that aij = 1 if and only if there is an edge between the nodes i and
j otherwise 0.

1; when Vi and Vj are adjacent
A ¼ aij ¼ ð1Þ
0; otherwise
20 H. Das et al.
Definition 5 (Incidence Matrix): Let vi be the vertices and ei be the edges of graph
G (V, E), then the incidence matrix I is the n 9 m matrix where
8
< 1 If there is a direct path between i to j
I ¼ 1 If there is a direct path between j to i ð2Þ
:
0 if branch j is not incident at node i:
Definition 6 (Laplacian Matrix): Let D be the degree matrix having n 9 n diag-

onal matrix where Dii = d(vi) is the degree of vi in graph G(V, E) and A be the
adjacency matrix, then Laplacian matrix can be defined as follows:
L¼DA ð3Þ
3 Modeling the Topology of Power Grid as a Complex

Network
To represent the power grid as a complex network [3], we build an unweighted and
undirected graph [8] composed of nodes and edges. Using metrics from graph
theory and modern complex network analysis, the results provide insight into the
properties of power grids [9], considering only topological information. The goal
is to characterize the topological structure of the West Bengal power grids and
highlight implications for the performance of electricity infrastructures.
3.1 Topological Analysis of Power Grid
An undirected graph [5, 6, 8, 9] is defined in graph theory as a pair of vertices and

edges, G = {N, m} where jN j is the number of nodes and jM j is the number of
edges. There are many useful statistical measures for graphs. Among the most
useful are degree distributions, characteristic path length, graph diameter, clus-
tering coefficient, and degree assortativity. These measures provide a useful set of
statistics for comparing power grids with other graph structures.
3.1.1 Number of Links (m)
The total number of links [8] of any graph is

1X
m¼ Lði; iÞ ð4Þ
2 i
P
where L(i, i) is the sum of all diagonal values of L matrix.
3.1.2 Average Nodal Degree (hki)
The nodal degree vector is determined from the Laplacian matrix

K ¼ fk1 ; k2 ; k3 ; . . .; kN g ¼ diagonal ðLÞ: ð5Þ
The average nodal degree [8, 9] can be represented as the average numbers of
edges that are connected to a node. The average nodal degree is defined as follows:
1X
hki ¼ Lði; iÞ ð6Þ
N i
P
where L(i, i) is the sum of all diagonal values of L matrix.
The average degree of a node seen at the end of a randomly selected edge is
X X hk2 i
k ¼ ð2 mÞ1 ki þ kj ¼ ð2 mÞ1 ki2 ¼ ð7Þ
ði; jÞ ðiÞ
hki
3.1.3 Ratio Parameter (r)
It determines the maximum node degree of the nodes of graph of a network.

Then, the ratio r {k [ k} can be obtained as follows:

ki ; ki [ k

r fk [ kg¼ 1
ð8Þ
N
where ki is the individual node degree.
3.1.4 Pearson Coefficient (q)
The Pearson coefficient (q) is also called correlation coefficient [5, 8, 9], which
gives a measure to evaluate the correlation of node degrees in the network. It tells
us about the assortativity of the electrical networks.
P

ði; jÞ ðki k Þ kj k
q ¼ qffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
P ffi ð9Þ
ð k i kÞ2 kj k 2
ði; jÞ
where, for a network having m links, we define

X X
k ¼ m1 ki and k ¼ m1 kj ð10Þ
ði; jÞ ði; jÞ
22 H. Das et al.
Pearson coefficient for some kinds of networks is consistently positive, which

means less assortative, while for others, it is negative, which means more assor-
tative. So we can say that Pearson coefficient can be used to differentiate tech-
nological networks from social networks.
3.1.5 Degree Distribution
The degree of a node indicates the number of nodes adjacent to that node. In
degree distribution [8, 9], we can represent the global connectivity of the network.
The first and second statistical distributions provide the average number of con-
nections per node and the variance. But for some distribution such as power laws,
these statistical moments do not provide a realistic presentation because the degree
varies over several orders of magnitudes. So it is useful to visualize the parameter
of probability mass function. The degree of node i in a graph with adjacency
matrix A is
X
N
ki ¼ aij ð11Þ
j¼1
3.1.6 Clustering Coefficient
The clustering coefficient [8] C, is a common metric that provides information

about the transitivity of a network, i.e., if two pairs of nodes, {x, y} and {y, z}, are
clustered, then there also exists an edge between nodes x and z. In that case, they
would form a cluster. C is defined as follows in terms of the coefficient ci or the
individual clustering coefficient for each node. The clustering is measured with the
clustering coefficient described in [8] as the average of the clustering coefficient
for each node. It is defined as follows:
1X N
CðGÞ ¼ Ci ð12Þ
N i¼1
where the clustering of node i (Ci ) is

kG ðiÞ
Ci ¼ ð13Þ
sG ðiÞ
where kG ðiÞ is the number of edges between the neighbors of node i and sG ðiÞ is
the total number of edges that could possibly exist among the neighbors of node.
For undirected graphs, sG ðiÞ ¼ ki ðki 1Þ=2 is the node degree.
The clustering coefficient for a random graph network theoretically equals the
probability of randomly selecting links from all possible links.
2m hki
C ð RÞ ¼ ¼ ð14Þ
NðN 1Þ N 1
3.1.7 Average Shortest Path
The average shortest path or characteristic path length, hli, is used to measure the
shortest path between any given pair of nodes relative to the size of the network
[8]. hli is determined from the distance matrix as the average value of all the
possible entries for every combination of nodes, given that the entry dij is the
number of edges along the shortest path from i to j.
1 X
hli ¼ dij ð15Þ
nðn 1Þ
8i; j
i 6¼ j
It can also be determined by using Floyd–Warshall algorithm directly.
3.2 Random Graphs (ER)
In this paper, random graphs are created following the standard algorithm
described in Erdos and Renyi [10] for a given number of nodes and edges such that
they are comparable to the power grid under study, namely the West Bengal power
system. In the random graph (ER) model, every edge is generated by randomly
selecting endpoints from a uniform distribution.
3.3 Preferential Attachment (PA)
The generation of scale-free graphs was described by Barabasi and Albert [11].
This model has introduced variations in the degree distribution by modifying the
attachment mechanisms, implementing dynamic edge rewiring, etc. In every
24 H. Das et al.
iteration, it will generate a new node and approximately m/n edges; the result is a
graph with n nodes and roughly m edges.
4 Experimental Results and Discussions
This section presents the detailed methodology involved to present the topological
properties of West Bengal power system and how a grid service is deployed
subsequently. The service efficacy has been demonstrated by means of a case study
that considers the West Bengal power system as a test case. The power network of
West Bengal has been shown in Fig. 1, and its corresponding single-line diagram
is shown in Fig. 2. The power network graph and single-line diagram in this
network have been taken from West Bengal Power Transmission Corporation
Limited Web site [12], a state-owned company responsible for power transmission
in the state of West Bengal.
The ER graph of West Bengal power grid is shown in Fig. 3, and Fig. 4 shows its
scale-free graph. Table 2 shows the topological degree and clustering coefficient of
each node of the West Bengal power network. Node degree distribution of the same
power network is shown in Fig. 5 by considering the node degree of the individual
Fig. 1 Power network of

West Bengal
Fig. 2 Single-line diagram of West Bengal power network
nodes with the probability of these nodes. West Bengal power grid follows the
exponential degree distribution. The physical topology of West Bengal power grid is
shown in Fig. 6 by considering the physical connection between nodes. The different
topological properties of West Bengal power grid is shown in Table 3.
26 H. Das et al.
Fig. 3 Random graph of

West Bengal
Fig. 4 Scale-free network of

West Bengal
Table 2 Individual topological degree and clustering coefficient of West Bengal power network
Node Topological degree Clustering coefficient
1 3 0
2 3 0
3 3 0
4 3 0
5 1 0
6 2 0
7 4 0.167
8 5 0.2
9 1 0
10 3 0
11 5 0
12 2 0
13 1 0
14 3 0
15 3 0
16 1 0
17 2 1
18 2 0
19 3 0.333
20 2 1
21 1 0
22 3 0
23 2 0
24 2 0
Fig. 5 Node degree

distribution of West Bengal
power grid
28 H. Das et al.
Fig. 6 Regular graph of

West Bengal power grid
Table 3 Topological Topological parameters of West Bengal power grid

parameters of West Bengal
power grid Nodes (N) 24
Edges (m) 30
Average nodal degree hKi 2.5
Average shortest path hli 3.524306
Diameter (D) 9
Pearson coefficient (q) -0.2821
r{k [ k bar} 0.125
C (G) 0.1125
C (R) 0.1087
5 Conclusions
Complex network analysis is an emerging technology to characterize the structural

and functional connectivity of the power grid. In this paper, we have described and
presented a number of measures that characterize the topological structure of the
West Bengal power network. The topology determines the physical connectivity of
the network. It provides the physical parameters and constraints characterizing the
power network. It only focuses the physical significance of the network rather the
electrical parameters. It may present the strategies to evolve physical topologies to
improve the forthcoming smart grid which might require reshaping of the power
network in case of cascading failures, which leads to blackouts.
References
1. Irving, M., Taylor, G., Hobson, P.: Plug into grid computing. Power Energy Mag. IEEE 2(2),
40–44 (2004)
2. Taylor, G.A., Irving, M.R., Hobson, P.R., Huang, C., Kyberd, P., Taylor, R.J.: Distributed
monitoring and control of future power systems via grid computing. In: Power Engineering
Society General Meeting, 2006. IEEE, p. 5. IEEE, (2006)
3. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.-U.: Complex networks:
structure and dynamics. Phys. Rep. 424(4), 175–308 (2006)
4. Himansu, D., Roy, D.S.: Article: a grid computing service for power system monitoring. Int.
J. Comput. Appl. 62(20), 1–6 (2013)
5. Cotilla-Sanchez, E., Hines, P.D.H., Barrows, C., Blumsack, S.: Comparing the topological
and electrical structure of the North American electric power infrastructure. pp. 1–1. (2012)
6. Hines, P., Blumsack, S., Cotilla Sanchez, E., Barrows, C.: The topological and electrical
structure of power grids. In: System Sciences (HICSS), 2010 43rd Hawaii International
Conference on, pp. 1–10. IEEE, (2010)
7. Grid Gain: www.gridgain.com. Last accessed on 13 May 2013
8. Wang, Z., Scaglione, A., Thomas, R.J.: Generating statistically correct random topologies for
testing smart grid communication and control networks. Smart Grid IEEE Trans. 1(1), 28–39
(2010)
9. Wang, Z., Thomas, R.J., Scaglione, A: Generating random topology power grids. In:
Proceedings of the 41st Annual Hawaii International Conference on System Sciences,
pp. 183–183. IEEE, (2008)
10. Erdos, P., Renyi, A.: On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)
11. Watts, D.J., Strogatz S.H.: Collective dynamics of ‘small-world’ networks. Nature
393(6684), 440–442 (1998)
12. http://www.wbsldc.in/docs/2.%20WBSETLC%20POWER%20MAP.gif. Last accessed on 13
May 2013
Comparison and Analysis of Node
Deployment for Efficient Coverage
in Sensor Network
Ram Shringar Raw, Shailender Kumar, Sonia Mann

and Sambit Bakshi
Abstract Wireless sensor network (WSN) is composed of sensor nodes, which

have capability of perception, computing, sensing, and communication. In wireless
sensor network, the number of nodes deployed in a region is directly proportional
to the cost of network, performance, and robustness. Sensor node deployment is an
essential issue to be resolved in WSNs. A proper node deployment method can
reduce the complexity of problems in WSNs. In this paper, we calculate the
efficiency of some popular regular deployment patterns such as square grid, tri-
angular lattice, and rhomb in terms of the number of sensors required to provide
coverage and connectivity. We have shown comparison between these patterns in
terms of total coverage area and net efficient coverage area ratio for varying
number of nodes. Simulations have been done using MATLAB R2010a.

Keywords Wireless sensor network (WSN) Deployment Seamless coverage

Total coverage area Efficient coverage area ratio Net efficient coverage area ratio
R. S. Raw (&) S. Kumar S. Mann

Ambedkar Institute of Advanced Communication Technologies and Research, Delhi, India
e-mail: rsrao08@yahoo.in
S. Kumar
e-mail: shailenderkumar.verma@gmail.com
S. Mann
e-mail: sonia29aprmann@gmail.com
S. Bakshi
National Institute of Technology, Rourkela, India
e-mail: sambitbaksi@gmail.com

32 R. S. Raw et al.
1 Introduction
Wireless sensor networks are applied to various special application fields such as
industrial machine measurement, wild environment monitoring, and security sur-
veillance in military purpose measurement to daily applications fields such as fire
monitoring, pollution monitoring, and battlefields. Wireless sensor networks
ensure a wide range of applications such as previously unobserved environmental
phenomena, smart homes, and offices, improved healthcare, industrial diagnosis,
near the crater of a volcano to measure temperature, pressure, and seismic
activities.
Sensor deployment is a critical and an important issue since it reflects the cost
and detection capability of a WSN. It is categorized as random and planned
deployment. Within planned deployment, sensors are placed at planned locations,
whereas in random deployment, sensor nodes are scattered randomly creating an
infrastructure in an ad hoc manner. Random deployment of sensors may not satisfy
the basic requirements of deployment due to the hostile environment.
A good deployment should consider both coverage and connectivity. Coverage
is the physical sensing range of a node within which it is able to perform its
operation. Each location in the physical space of interest should be within the
sensing range of at least one of the sensors. In WSNs, the simple reason for
checking coverage is to provide the high quality of information in the region of
interest. This is also known as the area coverage, which is important for most WSN
applications. A full and partial coverage are both considered for WSN applica-
tions. To fulfill the desired coverage of a region, adjusting the sensing range has its
limitations due to the expensive energy consumption and restricted node capa-
bilities. Therefore, node deployment becomes very important. K-coverage is the
usual way of specifying conditions on coverage.
Connectivity is the communication radius within which it can communicate
with another node. In general, finding the optimal deployment pattern (in the
context of no. of sensors) has practically more significant. First, significance is
deploying the minimum number of sensors needed has obvious economic benefits.
Second, optimal deployment can be used to guide the development of heuristic
algorithms for topology control and sensor scheduling for better quality of service.
This paper analyzes several sensor deployments and computes total coverage area,
total coverage area ratio, net efficient coverage area and net efficient coverage area
ratio of nodes under the condition of seamless coverage. In this paper, we compare
various deployment patterns.
Our paper is organized as follows. We introduce problem formulation in Sect.
2. In Sect. 3, sensor node deployment and coverage area calculation are explained
mathematically. Section 4 presents the simulation results, comparison and analysis
of different node deployment patterns. Finally, we conclude the work presented in
this paper in Sect. 5.
Comparison and Analysis of Node Deployment 33
2 Problem Formulation
In this work, we consider the problem of how to deploy wireless sensor nodes in
order to computes efficient coverage areas and their efficient coverage area ratios.
Before we define the considered sensor and coverage model, we briefly describe
the efficient coverage area ratio and its calculation.
2.1 Efficient Coverage Area Ratio Calculation
There are several key requirements in sensor deployments. First is covering the
sensor fields effectively and efficiently. Second is ensuring proper detection of
events and maintenance of connectivity throughout the entire network. Third is
strictly preserving the energy of the individual nodes in order to provision
acceptable network lifetime. A good sensor deployment pattern is necessary to
fully and seamlessly cover the sensor field.
2.2 Sensor and Coverage Model
As shown in Fig. 1, assumptions are given as same as in [1]. A sensor’s coverage

ability is omnidirectional, which has a disk whose radius is r and area is D, where
D = pr2. In a sensor field, all sensors radio power is equal, uniform, and in the
same plane. Each node is placed at the center of the circle of radius r.
In the sensor field of WSN, a piece of area is possibly covered by several sensor
nodes (as shown in Fig. 2) that are called as overlapped coverage area. In this case,
the coverage resulted from node C1 among these nodes are redundant for over-
lapped coverage area. It is because the information of overlapped node can be
sensed and collected by other nodes. In Fig. 2, we define and calculate the
following terms:
Total coverage area (STCA): STCA is the total coverage area that is overlapping
coverage area of nodes C1 and C2 and unoverlapped coverage area under
consideration.
STCA ¼ overlapped area þ unoverlapped area
Efficient coverage area ratio (RTCA): Ratio of total coverage area to the node
C10 s coverage area D.
STCA
RTCA ¼
D
Net efficient coverage area (SNECA): Area that is not covered by other nodes is
defined as efficient coverage area
SNECA ¼ D Overlapped Coverage Area
34 R. S. Raw et al.
Fig. 1 Sensors’ coverage

range and WSN’s sensor field
Fig. 2 Overlapping area and

efficient coverage area
Net efficient coverage area ratio (RNECA): Ratio of the area that is not covered
by other nodes to the total area of the node itself.
SNECA
RNECA ¼
D
3 Sensor Node Deployment and Coverage Area

Calculation
Wireless sensor network coverage to a large amount depends on the deployment of

wireless sensor node in the networks. Sensor node deployments can be geomet-
rically classified as follows:
3.1 Sensor Node Deployment Based on Square Pattern
3.1.1 Nine Sensors at the Vertices of Square
Sensor nodes are deployed at the center of nine circles, which forms a square. As
shown in Fig. 3, each circle has sensor node at the center of the circle. From the
figure, geometrically it is represented that sensor nodes are deployed at A, B, C,
and D that is at the corners of the square where the edge length of the square
Fig. 3 Sensors at the

meeting point of nine circles
ABCD is equal to the 2r. The radius of the circle r is equal to the maximum
transmission range of the sensor node. These sensor nodes form a square ABCD.
Edge length of square ABCD ¼ AB ¼ 2r
In Fig. 3, we have calculated the total coverage area, total coverage area ratio,
and net efficient coverage area ratio of nine sensors at the vertices of square as
given below:
Total coverage area for sensor nodes at the meeting point of the nine circles
(STCA1 )
STCA1 ¼ Area of sector EAF 4 þ Area of DAEX 8 þ Area of square ABCD
pffiffi
150 2 3 2
STCA1 ¼ pr 4 þ r 8 þ 4r 2
360 4

5 pffiffi
STCA1 ¼ p þ 2 3 þ 4 r2
3
Total coverage area ratio for sensor nodes at the meeting point of the nine
circles (RTCA1 )
pffiffi
STCA1 STCA1 5 2 3 4
RTCA1 ¼ ¼ ¼ þ þ ¼ 0:44 ð1Þ
D 9 pr 2 27 9p 9p
Net efficient coverage area for sensor nodes at the meeting point of the nine
circle (SNECA1 )
pffiffi
2 2 3 2 pr 2
SNECA1 ¼ D pr r þ
3 2 4
pffiffi pffiffi
2 11 2 3 2 pþ6 3 2
¼ pr pr r ¼ r
12 2 12
36 R. S. Raw et al.
Net efficient coverage area ratio for sensor nodes at the meeting point of the
nine circles (RNECA1 )
pffiffi pffiffi
SNECA1 ðp þ 6 3Þr 2 1 7 3
RNECA1 ¼ ¼ ¼ þ ¼ 0:35 ð2Þ
D 12 pr 2 12 44
3.1.2 Sensor Nodes at the Center of Sixteen Circles
As shown in Fig. 4, sensor nodes are placed at the center of sixteen circles.
Mathematically, it is represented by the square PQRS. Therefore, the edge length
pffiffi
of square is given as 3 2 r: The efficient coverage area of a meeting point is
shown in Fig. 4.
In Fig. 4, we have calculated the total coverage area, total coverage area ratio,
and net efficient coverage area ratio of nine sensors at the vertices of square as
given below:
Total coverage area of sensor nodes at the center of the sixteen circles (STCA2 )
STCA2 ¼ Area of sector UPT 4 þ Area of DPTQ 4 þ Area of square PQRS
180 2 r2
STCA2 ¼ pr 4 þ 4 þ 2 r 2
360 2
¼ 2pr 2 þ 2r 2 þ 2r 2 ¼ 2ðp þ 2Þr 2
Total coverage area ratio for sensor nodes at the center of the sixteen circles
(RTCA2 )
STCA2 2ðp þ 2Þr 2

RTCA2 ¼ 2
¼ ¼ 0:81 ð3Þ
4 pr 4 pr 2
Net efficient coverage area for sensor nodes at the center of the sixteen circles
(SNECA2 )
Fig. 4 Coverage areas of

sensors at the center of
sixteen circles

45 2 r 2
SNECA2 ¼D pr 4
360 4
¼ pr 2 pr 2 þ 2r 2 ¼ 2r 2
Net efficient coverage area ratio for sensor nodes at the center of the sixteen
circles (RNECA2 )
SNECA2 2r 2
RNECA2 ¼ ¼ 2 ¼ 0:63 ð4Þ
D pr
3.2 Sensor Node Deployments Based on Triangular Pattern
3.2.1 Sensor Deployment at the Three Vertices of a Triangle
As shown in Fig. 5, sensor node has maximum efficient coverage area. We can
calculate the total coverage area and efficient coverage area ration as given below.
Total coverage area for sensor nodes at the center of the six circles (STCA3 )
STCA3 ¼ Area of sector FAG 5 þ Area of DAFB 5 þ Area of DABO 5
162 2 r2 2r 2
STCA3 ¼ pr 5 þ 5 þ 5
360 2 4 tan 36

9 9
STCA3 ¼ pr 2 þ 2:5r 2 þ 3:6r 2 ¼ p þ 6:1 r 2
4 4
Total coverage area ratio for sensor nodes at the center of the six circles (RTCA3 )
STCA3 9p 6:1
RTCA3 ¼ ¼ þ ¼ 0:70 ð5Þ
D 6 24p 6p

sensors at the center of six
circles
38 R. S. Raw et al.
Net efficient coverage area for sensor nodes at the center of the six circles
(SNECA3 )

108 2 45 2 11 9
SNECA3 ¼ D pr þ pr 2 ¼ pr 2 pr 2 ¼ pr 2
360 360 20 20
Net efficient coverage area ratio for sensor nodes at the center of the six circles
(RNECA3 )
SNECA3 9
RNECA3 ¼ ¼ ¼ 0:45 ð6Þ
D 20
3.2.2 Sensor Deployment at Vertexes of the Rhomb
As shown in Fig. 6, sensor nodes are deployed at the center of each circle that
makes a small rhomb STUV. The central circle with sensor node at U intersects
with six peripheral circles at six points. In this case, the edge length of small
pffiffi pffiffi
rhomb STUV is equal to the 3 r and edge length of PQRS is 2 3 r. The authors
in [3–5] have solved WSN’s coverage problem and given some algorithmic
solutions. The efficient coverage area and its ratio are calculated as given below.
S2 is calculated as given in [2].
Total coverage area for sensor nodes at the vertexes of rhomb (STCA4 )
pffiffi
2 2 2p 3 3
STCA4 ¼ pr 9 S2 16 ¼ 9pr r 2 16
6

sensors at vertexes of rhomb
pffiffi
11p þ 24 3
STCA4 ¼ r2
3
Total coverage area ratio for sensor nodes at the vertexes of rhomb (RTCA4 )
pffiffi
STCA4 11p þ 24 3
RTCA4 ¼ 2 ¼ ¼ 0:88 ð7Þ
pr 9 27p
Net efficient coverage area for sensor nodes at the vertexes of rhomb (SNECA4 )
pffiffi pffiffi
2 2 2p 3 3 2 pþ3 3
SNECA4 ¼ pr 2 S2 ¼ pr 2 r ¼ r2
6 3
Net efficient coverage area ratio for sensor nodes at the vertexes of rhomb
(RNECA4 )
pffiffi
pþ3 3
RNECA4 ¼ ¼ 0:88 ð8Þ
3p
3.2.3 Sensor Deployment at a Meeting Circle of Six Circles
As shown in Fig. 7, sensor nodes are deployed at the center of each circle that makes
a hexagon EFGHIJ. The central circle with sensor node at K intersects with six
peripheral circles at six points, which divide the central circle into six equal parts.
In this case, the edge length of hexagon is equal to the transmission range r. The
efficient coverage area and its ratio are calculated as given below.
Total coverage area for sensor nodes at the meeting circle of six circles (STCA5 )
STCA5 ¼ Area of a circle 7 Area of overlapped circles 12
Fig. 7 Coverage area of a

meeting circle of six circles
40 R. S. Raw et al.
STCA5 ¼ pr 2 7 S2 12
pffiffi
2 2p 3 3 2 pffiffi
¼ 7pr 12 r ¼ ð3p þ 6 3Þr 2
6
Total coverage area ratio for sensor nodes at the meeting circle of six circles
(TCA5 )
pffiffi
3p þ 6 3Þ
RTCA5 ¼ ¼ 0:90 ð9Þ
7p
Net efficient coverage area for each sensor node at the meeting circle of six
circles (SNECA5 )
pffiffi
2 2p 3 3 2
SNECA5 ¼ D 3 S2 ¼ pr 3 r
6
pffiffi
3 3 2
SNECA5 ¼ r
2
Net efficient coverage area ratio for each sensor node at the meeting circle of
six circles (RNECA5 )
pffiffi
SNECA5 3 3
RNECA5 ¼ ¼ ¼ 0:82 ð10Þ
D 2p
4 Comparison and Result Analysis
In this section, we present some experimental results to verify the effectiveness of

the proposed sensor deployment patterns. We have compared all three node
deployment patterns through mathematical calculations. We present a simulation-
based comparison between square, triangular, and rhomb sensor deployment. The
simulation has been implemented in MATLAB R2010a. In the simulations, results
have been computed in terms of total coverage area and net efficient coverage area
ratio for effect of varying number of nodes (500–2500). The coverage range of
each node is fixed at D ¼ pr 2 (Table 1).
Table 1 Simulation setup and considered assumptions

Parameter Value
Simulated area 2; 000 2; 000 m
Number of nodes 500–2500
Net efficient coverage area ratio percentage 2–94 % and 3–90 %
4.1 Total Coverage Area Versus Number of Nodes
In Fig. 8, the effect of total coverage area for varying number of nodes is shown.
We notice that the total coverage area of all three sensor node deployment patterns
decreases as the number of sensor node increase. But total coverage areas of
square and rhomb patterns are significantly lower than triangular pattern sensor
node deployment. This difference is clearly evident from the figure, when a
number of nodes are 1,000. For this density, the total coverage area for triangular
pattern is 45 %; for square pattern, it is 35 %; and for rhomb pattern, it is 20 %.
According to the simulation analysis, it is clear that the triangular pattern is far
better than square and rhomb patterns in the context of minimum number of nodes.
The total number of nodes is varied to obtain the total coverage area.
Formula of minimum number of nodes in relation to RTCA5 is
F F F 0:2 F
N¼ pffiffi ¼ ¼ ¼
ð3p þ 6 3Þr 2 D R TCA5 D 6:3 D
4.2 Net Efficient Coverage Area Ratio Versus Number

of Nodes
In Fig. 9, we present one more simulation-based comparison between square,

triangular, and rhomb sensor deployment. In the simulations, results have been
computed for effect of varying number of nodes and net efficient coverage area
ratio while considering a meeting circle of six peripheral circles as shown in
Fig. 9. The coverage range of each node is fixed at D ¼ pr 2 :
100
Ratio for square node deployment
90 Ratio for triangular node deployment
Ratio for rhomb node deployment
80
Total coverage area
70
60
50
40
30
20
10
0
0 500 1000 1500 2000 2500
Number of nodes
Fig. 8 Comparison curve between total coverage area ratio and number of nodes
42 R. S. Raw et al.
70
Ratio for square node deployment
Ratio for triangular node deployment
Net efficient coverage area ratio 60 Ratio for rhomb node deployment
50
40
30
20
10
0
0 500 1000 1500 2000 2500
Number of nodes
Fig. 9 Comparison curve between net efficient coverage area ratio and nodes
We again notice that the net efficient coverage area of all three sensor
deployment patterns decreases as the number of node increases. But net efficient
coverage areas of square and rhomb patterns are significantly lower than the
triangular pattern deployment. This difference is clearly evident from the figure,
when a number of nodes are 1,000. For this density, the net efficient coverage area
for triangular pattern is 34 %; for square pattern, it is 22 %; and for rhomb pattern,
it is 16 %. According to the simulation analysis, it is clear that the triangular
pattern is far better than square and rhomb patterns in the context of minimum
number of nodes. Formula of minimum number of sensor nodes with respect to
RNECA5 is
F F 1:21 F
N¼ pffiffi ¼ ¼
3 3 2 D RNECA5 D
2 r
5 Conclusion
In this paper, we study the sensor node deployment patterns in wireless sensor
networks. We have mathematically calculated the efficiency of some regular
deployment patterns such as square grid, triangular lattice, and rhomb in terms of
the number of sensor nodes required to provide coverage and connectivity. In the
simulation section, results have been computed in terms of total coverage area and
net efficient coverage area ratio for effect of varying number of nodes. After
comparison and results analysis, it is clearly shown an equilateral triangle sensor
node deployment pattern gives better results than the square and rhomb sensor
node deployment patterns. Therefore, according to the simulation analysis, it is

clear that the triangular pattern is far better than square and rhomb patterns in the
context of minimum number of nodes.
References
1. Wang, X., Zhang, S.: Research on efficient coverage problem of node in wireless sensor
networks. In: The proceedings of 2009 International Conference on Industrial Mechatronics
and Automation, pp. 9–13 (2009)
2. Wang, X., Sun, F., Kong, X.: Research on optimal coverage problem of wireless sensor
networks. Proc. 2009 WRI Int. Conf. Commun. Mobile Comput. 1: 548–551 (2009)
3. Wang, X., Yang, Y., Zhang, Z.: A virtual rhomb grid-based movement-assisted sensor
deployment algorithm in wireless sensor networks. Proc. First Int.l Multi-Symp. Comput.
Comput. Sci. 1, 491–495 (2006)
4. Wang, X., Yang, Y.: k-Variable movement assisted sensor deployment based on virtual rhomb
grid in wireless sensor networks. In: The proceedings of 2nd IEEE International Workshop on
Self-Managed Networks, Systems, and Services, SelfMan, 3996 LNCS, pp. 179–183 (2006)
5. Wang, X., Yang, Y., Song, Y.: e-redundant movement-assisted sensor deployment based on
Virtual Rhomb Grid in wireless sensor networks. In: The proceedings of 2006 IEEE
International Conference on Mechatronics and Automation, pp. 775–779 (2006)
Performance Analysis of Routing
Protocols for VANETs with Real
Vehicular Traces
Sanjoy Das, Ram Shringar Raw, Indrani Das and Rajib Sarkar
Abstract In this study, we have evaluated the performance vehicular ad hoc

network (VANET) with real vehicular traces. The vehicular movements are gen-
erated with IDM_IM mobility model. This mobility model used to emulate the
movement pattern of nodes, i.e., vehicles on streets defined by maps. Our objective
is to provide a comparative performance analysis among various ad hoc routing
protocols, i.e., LAR1, AODV, and DSR protocols. The simulation work has been
conducted using the Glomosim 2.03 simulator. The results show that LAR1 pro-
tocol achieves maximum packet delivery ratio is 100 % in the sparsely populated
network. The results show that LAR1 outperforms DSR and AODV in terms of
packet delivery ratio.

Keywords LAR1 AODV DSR VANET Mobility model IDM_IM model
Packet delivery ratio
S. Das (&)
Galgotias University, Greater Noida, India
e-mail: sdas.jnu@gmail.com
R. S. Raw
Ambedkar Institute of Advanced Communication Technologies and Research, Delhi, India
e-mail: rsrao08@yahoo.in
I. Das
Department of Computer Science, Assam University, Assam, India
e-mail: indranidas2000@gmail.com
R. Sarkar
Central Institute of Technology, Raipur, India
e-mail: sarkar.rajibrcciit@gmail.com

46 S. Das et al.
1 Introduction
VANET is a special class of mobile ad hoc network (MANET), where every node
is a vehicle moving on the road. In this network, a node behaves like a router to
relay a message from one node to another. In VANET mobility of vehicles, the
structure of the geographic areas since node movement depends on it, timely
delivery of messages, and privacy are very important characteristics. VANET uses
two types of communication methods—one from vehicle to vehicle (V2V) and the
other is vehicle to fixed roadside equipment (V2R). In both the methods, vehicles
can communicate to other vehicles or roadside unit either directly or through
multiple hops. This totally depends on the position of the vehicles [1]. Further, the
roadside units (RSU) can also communicate with other RSU via single or multiple
hop fashion. The RSU supports numerous applications such as road safety, mes-
sage delivery; maintain connectivity by sending, receiving, or forwarding data in
the network. The main focus of the VANET is to provide real-time and safety
applications for drivers and passengers. By delivering message on time can min-
imize road accidents and save total journey time. The RSU can improve traffic
management system by providing drivers and passengers with vital information,
i.e., collision warnings, road sign alarms, blind turn warning. There are various
services currently support by VANET are internet connections facility, electronic
toll collection, and a variety of multimedia services. Various ad hoc routing
protocols have been proposed in recent years, whereas two main categories of
unicast protocols can be classified: position-based and topology-based protocols.
Unlike topology based such as AODV, DSR, position-based routing protocols such
as LAR, GPSR present challenging and interesting properties of VANETs [2, 3]. A
position-based routing protocol does not require any information on the global
topology, but uses the local information of neighbouring nodes that restricted to
the transmission range of any forwarding node. Due to this restrictions, it gives
low overhead of their creation and maintenance. Generally, position-based routing
is based on greedy forwarding scheme that guarantees loop-free operation. Over
the last few years, there have been numerous variations of position-based routing
protocols such as LAR, GPSR, and DIR protocols examined in the literature [4]. It
is desirable that routing protocols should maintain the low end-to-end delay and,
high delivery ratio, low overheads and minimum numbers of hops between source
and destination node during message transmission.
In this paper, we have evaluated the performance of VANET using ad hoc
routing protocols (both topology and position based). The rest of the paper is
organized as follows. We discuss the related work in Sect. 2. In Sect. 3, we
introduce the brief overview of LAR, AODV, and DSR routing protocols. Sec-
tion 4 presents simulation results and its analysis. Finally, we conclude this paper
in Sect. 5.
Performance Analysis of Routing Protocols for VANETs with Real Vehicular Traces 47
2 Related Works
Extensive works have been carried out by researchers, academicians, and indus-
tries for successfully routing of messages in VANET. There are several research
projects [5–8] on VANET being carried out by researchers. Some of them are
[CarTalk, FleetNet–Internet on the Road, NoW (Network on Wheel)] with
emphasis on deployment in the real world. The main focus of all these projects is
to provide safety and timely dissemination of message from one location to
another location. In [9], the authors have only considered the energy consumption
parameter for performance analysis of LAR1 protocol with DSR and AODV in
highly dense ad hoc networks. The results reported show that LAR1 performs
better than DSR and AODV protocols in highly dense network. But in low density,
DSR performs better than others in terms of energy consumption. In [10], the
authors show a wide analysis of their proposed protocol geographic source routing
(GSR) with DSR, AODV for VANET in city scenarios. They have done simulation
analysis of these protocols on realistic vehicular traffic for a particular city. The
real city map is considered and converted to graph for the analysis. Their result
shows that GSR performs better than DSR and AODV in terms of end-to-end
delivery and latency. In [11, 12], the authors proposed different modified LAR
algorithms. They have modified the request zone. Through simulation, the authors
have established that their proposed algorithms reduce route request overhead as
compared to original LAR. The performance analysis shows that their method
outperforms original LAR, especially in a dense and highly dynamic ad hoc net-
work such as VANET. In [13], the authors have proposed a greedy version of LAR
protocol known as Greedy Location-Aided Routing Protocol (GLAR). This
scheme improved the performance of LAR. In GLAR method, to find a route
between source and destination, a baseline is drawn between them. The route
request packets are broadcast within the request zone. The neighbouring node,
which has shortest distance towards baseline, is selected as a next broadcasting
node. The authors considered various network performance parameters to compare
LAR with GLAR. Their results revealed that GLAR reduces the number of route
discovery packets and increases the average network route lifetime. Most of these
protocols use random waypoint mobility model for performance analysis. The
protocols proposed in [10–13] did not consider structured city scenarios for the
performance analysis of LAR1 protocol in VANET.
3 Overview of LAR, DSR, and AODV Protocols
Ko et al. in [14] proposed two different location-aided schemes for transmitting a

message from source to destination known as LAR scheme 1 and LAR scheme 2.
Both the schemes used the location information of source and destination nodes to
reduce the routing overhead. It assumes that the local geographic information is
48 S. Das et al.
obtained using the global positioning system (GPS). In LAR scheme 1, an

expected zone is computed for the possible position of the destination node. It is a
circle around the destination that contains the estimated location of the destination
node. The request zone is a rectangle with source node S in one corner (Xs, Ys),
and the expected zone containing destination D in the other opposite corner (Xd,
Yd). In this protocol, only those neighbours of source node that are present within
the request zone forwards the route request packet further. The source node
S knows the location of destination node D (Xd, Yd) at time t0 and average speed v
with which D is moving. Every time node S initiates a new route discovery
process, it is the circular expected zone at time t1 with the radius R = v 9 (t1 -
t0) and centre at location (Xd, Yd). In Fig. 1, I and J are neighbours of source node
S. But only node I forward the packets received from S to its neighbours, since
node I is within the request zone. The node J discards the message received from S
since J is outside the request zone.
In [16], dynamic source routing (DSR) is a source routing protocol. It does not
depend on the routing table. This is a kind of reactive routing protocol. Nodes in
this protocol dynamically discover a route in the multi-hop network for data
delivery to destination. The work of the protocol is divided into two parts: (1) route
discovery and (2) route maintenance. The optimal path for data delivery is
established between a source and destination node during route discovery process.
The route maintenance phase ensures that the path remains optimum and loop free
even if changes in the network. In [17] Ad hoc On-Demand Distance Vector
(AODV), whenever a source node wants to send data packets to a destination node,
it first initiates a route discovery process. The source node will broadcast a route
request (RREQ) packet. The broadcasting of RREQ packet helps source node to
find an appropriate route to the destination. The neighbour nodes those do not
know an active route to destination node further forward the RREQ packet to their
neighbours. This process of forwarding RREQ will continue till an active route is
Fig. 1 LAR1 routing

protocol [15]
found. This process will abort when the maximum number of hops is reached. If
any intermediate node knows an active route to the destination node, it will send a
reply message route reply (RREP) back to source node. After receiving RREP
packet, source node will start sending data packet.
4 Problem Formulation
To evaluate the performance of VANET, there is a need to deploy a real-world

traffic scenario with all the vehicular constraints. To correctly simulate three
routing protocols, LAR1, DSR, and AODV for VANETs, it is necessary that a
correct and efficient mobility model is used. The performance analysis of above
three routing protocols is carried out by using an open-source simulation tool
Glomosim 2.03 and intelligent driver model with intersection management
(IDM_IM) mobility model on realistic scenario of traffic. In this paper, we are
going to describe the working principle of simulation tools used, simulation setup,
metrics used, and performance comparison using graphs. Before we describe the
simulation environments and result analysis, we briefly describe the assumption
for the work and intelligent driver mobility model with intersection management
(IDM_IM), a real-world mobility model.
4.1 Assumption
We have considered a sparsely populated network, where it is very rare that source
and destination node fall in each other transmission range. All nodes in the net-
work are equipped with GPS receivers, digital maps, optional sensors, and onboard
units (OBU). Location information of all vehicles can be collected through GPS
receivers. The only communications paths available are via the ad hoc network,
and there is no any other communication infrastructure. All the communications
are message oriented. The transmission range of each node in the vehicular net-
work environment is 250 m.
4.2 Intelligent Driver Model with Intersection Management
IDM_IM mobility model is a macroscopic car-following model that adapts a

vehicle speed according to other vehicles driving ahead. IDM_IM model uses a
quite small set of parameters, which can be evaluated with the help of real traffic
measurements. In the IDM_IM [18, 19], mobility model nodes movement depends
on the neighbouring nodes movement. Suppose the front vehicle is slow down than
vehicle followed will also slow down their speed. The vehicles movement is
50 S. Das et al.
controlled by smart intersection management. The vehicles stop according to

traffic lights, slow down their speed, and stop at intersections point. Any vehicle
stop at stop sign will cross the road if no vehicles present in front of the vehicle;
otherwise, it will wait for its turn on first arrived first served basis and right hand
rule.
5 Simulation Environments and Result Analysis
The simulation has been carried out to evaluate the performances of LAR
scheme 1, AODV, and DSR protocols in VANETs. We have used the network
simulator Glomosim 2.03 [18]. It is one of the widely used simulation tools for
research in mobile ad hoc networks and freely available simulator. The vehicular
movements and scenarios are generated using VanetMobiSim [19, 20]. Table 1
shows different simulation parameters, and Table 2 shows the different parameters
values considered for simulation. The results analysis done based on packet
delivery ratio for all three protocols. The values of packet delivery ratio are
presented in Table 3.
Table 1 Simulation parameters

Parameter Specifications
MAC protocol IEEE 802.11
Data type Constant bit rate (CBR)
Radio propagation model Two-ray ground reflection model
Channel type Wireless channel
Antenna model Omnidirectional
Routing protocol LAR1, DSR, AODV
Mobility model IDM_IM
Table 2 Values of simulation parameters

Parameter Values
Simulation time 1,000 s
Simulation area 1,000 9 1,000
Bandwidth 2 Mbps
No of nodes (Vehicles) 10, 20, 30, 40
Data packet sizes 512 bytes
Transmission range 250 m
Speed of nodes (m/s) 10, 20, 30, 40, 50
Table 3 Packet delivery ratio

Routing protocols No. of nodes Speed
10 20 30 40
AODV 10 89 92 87 82.32
20 89.3 83.6 93.3 92
30 92.11 76.22 84.33 79.26
40 93.33 92.12 86.23 86.45
DSR 10 99 99.5 78.4 76
20 87.33 89.12 75.22 90.33
30 76.45 70.34 81.44 80.22
40 77 73.34 79.23 81.45
LAR1 10 100 100 100 100
20 100 99.7 99.4 99.3
30 99.93334 97.80002 97.73334 99.53334
40 99.25 97.6 99.35 98
5.1 Packet Delivery Ratio
Packet delivery ratio (PDR) is a very important factor to measure the performance
of routing protocol in any network. The performance of the protocol depends on
various parameters chosen for the simulation. The major parameters are packet
size, number of nodes, transmission range, and the structure of the network. The
packet delivery ratio can be obtained from the total number of data packets arrived
at destinations divided by the total data packets sent from sources.
Figure 2 shows the packet delivery ratio for the sparse network for fixed
number of nodes that is 10 with varying node speed. In the figure, PDR of LAR1 is
nearly 100 % throughout the varying speed. As the speed of node increases, PDR
decreases at speed 50 m/s. In DSR protocol, PDR is initially 99 % at speed 10 m/s
and slightly increases noticed at speed 20 m/s and minimum value of PDR is
11.33 % for node speed 40 m/s. In AODV protocol, maximum achievable PDR is
93.6 % at speed 20 m/s. In AODV, PDR value increases as speed of the nodes
increases from 10 to 20 m/s but after that PDR decreases.
Figure 3 shows the packet delivery ratio for 20 nodes with varying node speed.
Figure shows that PDR of LAR1 is nearly 100 % up to speed 20 m/s and as the speed
of node increases between 20 and 50 m/s, PDR decreases lightly. In case of AODV
protocol, PDR value decreases at the speed from 10 to 20 m/s, after that increases up
to 30 m/s and maximum achievable PDR is 94.2 % at speed 30 m/s. Also, again
PDR value decreases as speed of the nodes increases from 30 to 50 m/s. As shown in
the figure, in DSR protocol, PDR is initially 87 % at speed 10 m/s and slightly
increases noticed at speed 20 m/s. The PDR decreases drastically up to speed 30 m/s
and increases drastically up to speed 40 m/s and again decreases after that for the
same number of nodes.
In Fig. 4, simulation is carried out for 30 vehicular nodes with varying node
speeds for the same three protocols. Results analysis shows that position-based
52 S. Das et al.
Fig. 2 Packet delivery ratio 100

for node 10 with varying LAR1
AODV
node speed
DSR
95
Packet Delivery Ratio

90
85
80
75
10 15 20 25 30 35 40 45 50
Speed (in m/s)
Fig. 3 Packet delivery ratio 100

for node 20 with varying
LAR1
node speed
AODV
95 DSR
90
85
80
75
10 15 20 25 30 35 40 45 50
Speed (in m/s)
routing protocol LAR1 gives better performance than AODV and DSR in terms of
PDR. It is nearly 98–100 %. The node movement in the network is shown in
Fig. 5, when there are 30 nodes moving at the speed of 10 m/s.
In Fig. 6, further simulation is carried out for 40 vehicular nodes with varying
node speeds for the same three protocols. Comparison analysis among the pro-
tocols shows that position-based routing protocol LAR1 gives better performance
than AODV and DSR in terms of PDR as the nodes speed increases. The node
movement in the network is shown in Fig. 7, when there are 40 nodes moving at
the speed of 30 m/s.
100
LAR1
AODV
95
DSR
90
85
80
75
70
10 15 20 25 30 35 40 45 50
Speed (in m/s)
Fig. 4 Packet delivery ratio for node 30 with varying node speed
Fig. 5 Node movements in VanetMobiSim (number of node 30 and speed 10)
By analysing results as shown in the above figures, it clearly appears that in all
the cases, LAR1 gives better performance in terms of PDR than AODV and DSR
routing protocols. This may reflect the need for optimizing the number of nodes in
54 S. Das et al.
100
95
LAR1
AODV
DSR
90
85
80
75
70
10 15 20 25 30 35 40 45 50
Speed (in m/s)
Fig. 6 Packet delivery ratio for node 40 with varying node speed
Fig. 7 Node movements in VanetMobiSim (number of node 40 and speed 30)
the network to give better performance through LAR1 routing protocol. It means
for the minimum number of nodes and at minimum speed LAR1 gives better
results. Table 3 shows the PDR values for different routing protocols.
6 Conclusions
In this paper, we have analysed the performance of LAR1, AODV, and DSR
protocols for vehicular ad hoc networks through IDM_IM mobility model. The
performance of the protocols is thoroughly studied with varying node speeds. We
have calculated packet delivery ratio for LAR1, AODV, and DSR protocols. From
the result analysis, it is clearly evident that when the network is sparsely populated
the successful delivery of message is nearly 100 % in LAR1 protocol. Therefore,
the results show that LAR1 outperforms DSR and AODV in terms of packet
delivery ratio.
References
1. Moustafa, H., Zhang, Y.: Vehicular networks: Techniques, standards, and applications. CRC
Press, US (2009)
2. Lee, K.C., Lee, U., Gerla, M.: Survey of routing protocols in vehicular ad hoc networks. IGI
Global, pp. 149–170 (2010)
3. Shringar Raw, R., Das, S., Singh, N., Kumar, S., Kumar, S.: Feasibility evaluation of VANET
using Directional-Location Aided Routing (D-LAR) Protocol. Int. J. Comput. Sci. Issues 9(5,
No. 3), 404–410 (2012)
4. Stojmenovic, I., Ruhil A.P., Lobiyal, D.K.: Voronoi diagram and convex hull based
Geocasting and routing in wireless networks. Wireless Communications and Mobile
Computing Special Issue on Ad Hoc Wireless Networks. Wiley and Sons, Ltd. 6(2), 247–258
(2006)
5. The NoW: Network on wheels Project. http://www.network-on-wheels.de/about.html
6. http://www.cartalk2000.net/
7. FleetNet. http://www.fleetnet.de/
8. http://vanet.info/projects
9. Ahvar, E., Fathy, M.: Performance evaluation of routing protocols for high density ad hoc
networks based on energy consumption by GlomoSim simulator. World Acad. Sci., Eng.
Technol. 5, 97–100 (2007)
10. Lochert, C., Hartenstein, H., Tian, J., Füßler, H., Hermann, D., Mauve, M.: A Routing
strategy for vehicular ad hoc networks in city environments. In: Proceedings of IEEE
Intelligent Vehicles Symposium, pp. 156–161 (2003)
11. DeRango, F., Lera, A., Molinaro, A., Marano, S.: A modified location aided routing protocol
for the reduction of control overhead in ad-hoc wireless networks. ICT2003, vol. 2, Feb 23–
March 1, pp. 1033–1037 (2003)
12. Senouci, S.M., Rasheed, T.M.: Modified location aided routing protocols for control
overhead reduction in mobile ad hoc networks. The International Federation for Information
Processing, vol. 229, pp. 137–146 (2007)
13. Wang, N.C., Chen, J.S., Huang, Y.F., Wang, S.M.: A greedy location aided routing protocol
for mobile ad hoc networks. In proceedings of the 8th WSEAS International Conference on
Applied Computer and Applied Computational Science (ACACOS ‘09), pp. 175–180,
Hangzhou, China (2009)
14. Ko, Y.B., Vaidya, N.: Location-aided routing (LAR) in mobile ad hoc networks. ACM/IEEE,
MOBICOM’98, pp. 66–75 (1998)
56 S. Das et al.
15. Ahvar, E., Fathy, M.: Performance evaluation of routing protocols for high density ad hoc
networks based on energy consumption by GlomoSim simulator. In: The proceedings of
world academy of science, engineering and technology, vol. 23, pp. 97–100, Aug 2007
16. Broch, J., Johnson, D., Maltz, D.: The dynamic source routing protocol for mobile ad hoc
networks. http://www.ietf.org/internetdrafts/draft-ietfmanet-dsr-03.txt, IETF Internet draft,
Oct 1999
17. Perkins, C.E., Royer, E.M.: Ad hoc on-demand distance vector routing. In: Proceedings of
2nd IEEE workshop on mobile computing systems and applications, pp. 90–100, Feb 1999
18. UCLA, Glomosim. http://pcl.cs.ucla.edu/projects/glomosim
19. Haerri, J., Filali, F., Bonnet, C., Fiore, M.: VanetMobiSim: Generating realistic mobility
patterns for VANETs, Los Angeles, California, USA, 29 Sep 2006
20. Harri, J., Filali, F., Bonnet, C.: Mobility models for vehicular ad hoc networks: A survey and
taxonomy. EURECOM, 26 Mar 2007
A Bluetooth-Based Autonomous
Mining System
Saikat Roy, Soumalya Sarkar and Avranil Tah
Abstract This chapter encompasses the description of a Bluetooth-based

automated wireless communication system. The proposed system would equip
underground and open-cast mines with a wireless system which would enable
communication within the various layers of the mine and also enhance the security
facilities for the miners. It would allow a two-way communication process
between the ‘administrators’ or the people in charge outside the mine, within its
premises, and the supervisors present inside the mine at that time. The system
would be implemented by placing servers in each part of the mine such that each
server covers a designated area. The Bluetooth signals are to be transmitted to and
from the servers using a network of intermediate ‘epidemic’ servers which would
pass on information along the line. Every server in the mine would have its own
independent series of ‘gossip’ servers to communicate with the targeted server
located on the surface or inside the mine.

Keywords Bluetooth Scanners Wireless Mine Database GUI Locus

tracking Vehicle collision Mac ID
S. Roy (&) S. Sarkar

IEM, WBUT, Kolkata, West Bengal, India
e-mail: roysaikat98@gmail.com
S. Sarkar
e-mail: soumalyasarkar10@gmail.com
A. Tah
The University of Texas at El Paso, El Paso, USA
e-mail: eschoollearning@gmail.com

58 S. Roy et al.
1 Motivation
As we conducted an overview on the state of affairs of mining in India, we became

aware of the abysmal conditions under which the laborers had to work. We found
that Indian mines have considerably higher accident and fatality rates compared to
those in the USA and South Africa, respectively. While open-cast mines are
generally known to be safer than underground mines, the Indian open-cast mines
were found to be at least as hazardous to the workers as the Indian underground
mines.
As a result, we were made to wonder about the possibility of constructing a
system customized to meet the requirements of the mine. This is what led to our
thinking about making a communication system which would induce a bit of
transparency into the day-to-day operations of the mine. But, the crucial objective
of the system would be to help prevent or at least reduce the probability of mining
hazards to some extent. And even if an accident does occur, rendering the whole or
part of the system ineffective, it would play an important role in damage limitation,
both in terms of lives as well as fixed assets.
2 Why a Wireless System?
This project poses its goal to implement a cost-effective and efficient communi-
cation system for mines using a wireless system as needless to say, a mechanism
without wires or cables would be the most convenient in case of any mine.
Wireless networks work without limitations of cabling, using as a medium either
infrared light (IR) or radio frequencies (RF). The current WLAN and Bluetooth
technology use the 2.4-GHz frequency band, which is the only unlicensed band in
most of countries. There are certainly many advantages in replacing cables by a
wireless medium. The most significant are mobility, flexibility, cost saving,
installation in difficult-to-wire areas, and reduction in installation time.
3 Why Bluetooth?
Underground mine mapping using GPS technology is not an easy task because
satellite signals do not penetrate through earth strata down to the underground
mine works. In most cases, the use of GPS data collection for underground mines
is limited to capturing the point locations such as mine entry, shaft locations, and
approximate mine location and then using traditional underground mine surveying
techniques to capture spatial data.
The radio-frequency identification (RFID) is a method that relies on storing and
remotely retrieving data via transmitting radio waves using devices called RFID
A Bluetooth-Based Autonomous Mining System 59
tags or transponders. This technique has been successfully used in facilities

management such as airports. RFID can only be used to transfer small amounts of
data, which is a major limitation. Thus, other alternatives had to be found to
implement the proposed system.
802.11b or Wi-Fi is a standard for wireless LANs operating in 2.4-GHz spec-
trum with a bandwidth of 11 Mbps. But, Wi-Fi employs a signal whose strength is
considerably higher as compared to Bluetooth or RFID. In case of a mine, we
would obviously have to implement the system using battery power backup. But,
Wi-Fi can only be implemented using an electrical circuit or a higher-power
battery, which could be extremely hazardous or non-permissible for a mine.
Bluetooth is a short-range radio standard that allows various wireless equip-
ments to communicate over relatively short distance (up to about 100 m). Blue-
tooth functions in the free ISM 2.4-GHz band which is also applied to other
technologies such as 802.11 b/g and microwave ovens. Unlike Wi-Fi devices
which stick to a predefined channel, Bluetooth devices hop though 1,600 fre-
quency channels per second, of which 800 channels are transmit channels and
other 800 channels are receive channels. The goal of adaptive frequency hopping
(AFH) is to allow Bluetooth to coexist with other non-frequency hopping tech-
nologies and interferers in the ISM band. The Bluetooth devices keep static to a
minimum over good and bad channels.
Thus, in a nutshell, the main factors justifying the choice of Bluetooth tech-
nology for this project are as follows:
1. Wireless.
2. Cost-effective.
3. Easily available.
4. Ability to set up connection automatically as soon as two devices are within a
specific range.
5. Low interference as compared to other wireless systems.
6. Low maintenance cost.
7. Bluetooth being a standardized wireless specification, a high level of compat-
ibility between devices is guaranteed.
8. Each device has a unique identification code, known as media access control
(MAC) ID which is useful to recognize any specific device.
4 Methodology
Every person entering the mine would be given a Bluetooth device. This device
would facilitate the tracking of the personnel present in the mine and also allow
audio-visual communication.
The salient features of our Bluetooth-enabled wireless communication system
are as follows:
60 S. Roy et al.
• Employee database—All the personal details and records of each employee are
maintained on a daily basis using a database management system. The personal
data pertaining to each employee are initially entered into the database by means
of a graphic user interface (GUI).On the other hand, the daily records of the people
involved in the mining operations are automatically updated into the database at
periodic intervals. We will explain the mechanism of this process in due course.
• Use of database—The database contains all the important information
regarding the daily activities of the mine workers. As the database gets filled
with information, we may need to access certain data from it as and when
required. This can be done again using another GUI. This particular GUI
matches the given name with those in the database. In case that particular name
occurs multiple times in the database, it asks for more information regarding the
employee. In case the combination of all the provided fields occurs multiple
times, it asks for the employee ‘MacID’ or the ‘MacID’ of the device assigned to
that employee. Moreover, only authorized personnel can access the database.
• Scanning—The servers located at designated areas within the mine carry out the
function of detecting every Bluetooth device within their range. Each server
constantly checks for the devices in its range and feeds the updated data back
into the database attached to the mainframe. In this way, we are able to maintain
track of the location of people in the mine at a given time. The servers would
also detect any vehicles or other machines in the mine, thus enabling us to also
keep track of materials and equipment which would be in the mine at that time.
• Locus tracking—By checking the sequence of servers through which a device
has passed within the mine, we can determine the path traversed by a person or
vehicle inside the mine over a certain period of time. This is also updated to the
database at periodic intervals.
• Vehicle collision—We have made a provision to ensure that the chances of
vehicles colliding inside the mine are minimized. This has been done by using a
simple logic. Whenever any two or more vehicles in the mine are deemed to be
on a collision course, that is, when they are present under adjacent servers, a
warning is issued to them. This warning is in the form of an audio-visual output
in the Bluetooth device of the vehicle, showing its current location as well as
that of its counterpart(s).
• General warning issuing—In case of an emergency situation in the mine
brought about by an accident or any other unforeseeable circumstance, warnings
need to be issued to the people present inside the mine. This can be done by
playing one of several recorded audio messages in the servers, vehicles, or the
devices held by the mine superintendents.
5 Flowcharts
6 Algorithms
6.1 Database Entry
Step 1: Start.
Step 2: The devices to be used in the mine by workers, and for vehicles and other
equipment are scanned.
Step 3: The system administrator uses a graphical user interface to input the data
pertaining to each device.
Step 4: If entered data are in uppercase, proceed to step 6.
Step 5: The data are automatically converted into uppercase and then put into the
database.
Step 6: Once the data for all the scanned devices are entered into the database, a
message ‘All records are entered’ is displayed.
Step 7: Stop.
6.2 Advance Search
Step 1: Start.
Step 2: The system administrator uses a graphical user interface to access the
data present in the database.
62 S. Roy et al.
Step 3: If a particular record is to be searched, proceed to step 5; otherwise, if all

the records are to be seen, proceed to step 4.
Step 4: All the records present in the database are displayed.
Step 5: The name of the employee whose records are to be accessed is entered.
Step 6: If there is only 1 employee in that name, proceed directly to step 10, or
else not.
Step 7: The designation and department of the relevant employee are entered.
Step 8: If there is only 1 employee in the given name in the given department
having the given designation, proceed directly to step 10, otherwise not.
Step 9: The MacID of the device allotted to the relevant employee is entered.
Step 10: All the records pertaining to that particular employee, present in the
database, are displayed.
Step 11: A prompt is used to ask whether any other record is to be searched.
Step 12: If that is the case, go to step 5, otherwise not.
Step 13: Stop.
6.3 Scanning
Step 1: Start.
Step 2: The system administrator enters employee data into database on employ-
ment after Bluetooth device is assigned; a GUI is used to facilitate the
process.
Step 3: The scanners are activated at the start of each shift as the workers enter
the mine.
Step 4: There are two parallel process levels of the system.
Step 5: The actual scanning taking place in the mine is described from step 6,
whereas the system at surface level is described from step 14.
Step 6: Scanners detect the presence of Bluetooth devices and send data to
mainframe through the server network.
Step 7: If a device is detected for the first time, proceed to next step; otherwise,
proceed directly to step 9.
Step 8: The Mac ID of the device is added as a key of the dictionaries, and the
entry time to the time dictionary and presence flag is made 1.
Step 9: If a device previously present is not detected, proceed to next step;
otherwise, proceed directly to step 11.
Step 10: The exit time is added to the time dictionary, and the presence flag is
made 0.
Step 11: The entry and exit times of each device are stored into tuples with each
Mac ID being the key, and the whole data, in the dictionary, are put into
the database through the network.
Step 12: The sequence of servers detecting a particular worker or vehicle,
forming a locus, is also sent to mainframe.
Step 13: Proceed directly to step 17.
Step 14: The system administrator gets access to data sent by the scanners into
the mainframe database.
Step 15: The administrator can check relevant data sent by scanners (entry, exit
time, etc.) to keep constant track of miners, vehicles, etc.
Step 16: The administrator can check the path traversed by any worker or vehicle
over a certain period of time.
Step 17: Stop.
7 Results/Conclusion
All the Bluetooth devices are scanned, and each device is assigned to an employee
by adding the details of the employee pertaining to each device. All the details are
entered into their respective fields and subsequently put into the database. Through
the following GUI, the user can search for a specific record of a person at a
particular time or obtain all the records pertaining to a particular employee.
On entering the username and password, a GUI appears containing a list of all
the employees. The employee whose records are to be accessed is chosen. From
here, the user can obtain—(1) personal details of the employee. (2) path followed
by a person in the mine, (3) The most recent position of the person in case of
emergency situation. In case of accidents, we can send over a message to the
detected server and warn or reassure employees of rescue team making their way
toward them. There is also audio–video alarm provision to prevent vehicle colli-
sion in the cluttered mine environment.
64 S. Roy et al.
8 Related Work
Security systems in a mine depend on the knowledge of workers’ positions. For

example, the administrator may want messages to reach workers in a specific
location. This is possible if the locations are estimated correctly. The required
precision of estimated locations varies with applications. For example, a system
that selects which message a worker should receive based upon the prevailing
circumstances within the mine may require very accurate location estimation.
Location-tracking systems are usually designed to provide location information
of the tracked person/item. We are examining applications that require interper-
sonal interaction information such as the meeting of two or more vehicles within
the mine and the time of the meeting. To simplify and organize the discussion of
related works in the area of wireless tracking system, I used the following two
categories: (1) tracking systems based on triangulation method and (2) tracking
systems based on scanning technique.
8.1 Tracking Systems Based on Triangulation Method
The RADAR [1] is a triangulation-based location-tracking system which uses

radio frequency (RF) for locating and tracking users inside buildings. It operates
by recording and processing signal strength information at multiple base stations

positioned to provide overlapping coverage in the area of interest. It uses signal
strength information gathered at multiple receiver locations to triangulate the
users’ coordinates.
8.2 Tracking Systems Based on Scanning Technique
The Active Badge system [2] was one in which sensors placed at known positions
within a building pick up the unique identifiers emitted from the IR badges and
relay these to the location manager software. Though this system provides accurate
location information, it has some drawbacks as well: (1) it performs poorly due to
the limited range of IR, (2) it incurs high installation and maintenance costs, and
(3) it performs poorly in the presence of direct sunlight.
A Bluetooth-based tracking system is described in [1]. This system uses mobile
phone terminals to build a virtual networking by combining GPS and Bluetooth
technology with mobile Internet. The Bluetooth scanners perform Bluetooth dis-
covery process and assign location information to found Bluetooth IDs based on
GPS coordinates. Another popular technology used for personnel and/or asset
tracking is radio-frequency identification (RFID) [2], which works by means of
electromagnetic induction.
8.3 Epidemic Communication
Data transmission protocols play an important role in building these tracking

systems. Distributing dynamic information across a large number of computers is a
central problem in distributed systems design. Epidemic protocols offer a mech-
anism for information distribution without relying on central servers. Their sim-
plicity, scalability, and good performance characteristics have made them suitable
for information dissemination in ad hoc networks [1, 2]. Epidemic refers to
information exchange mechanism where each node can be a source of information
and is capable of information transfer.
References
1. RADAR: An in-building RF-based user location and tracking system

2. The active badge location system by Roy Want, Andy Hopper, Veronica Falcão and Jonathan
Gibbons Olivetti Research ltd. (ORL) Cambridge, England
3. CS 268: Lecture 20 classic distributed systems: Bayou and BFT by Ion Stoica computer
science division, Department of electrical engineering and computer sciences, University of
California, Berkeley, CA 94720-1776
Transistor Representation
of a Low-Power Reversible 32-Bit
Comparator
A. V. AnanthaLakshmi and G. F. Sudha
Abstract In recent years, reversible logic has emerged as a major area of research
due to its ability to reduce the power dissipation, which is the main requirement in
the low-power digital circuit design. It has wide applications such as low-power
CMOS design, nanotechnology, digital signal processing, communication, DNA
computing, and optical computing. In this paper, two new 3 9 3 reversible gates
are proposed and these are being used to realize the classical set of logic gates in
the reversible domain. An important aspect of the two newly proposed reversible
gates is that a novel optimized 1-bit comparator can be realized. The proposed
reversible 1-bit comparator is better and optimized in terms of the number of
reversible gates used, the number of transistor counts, and the number of garbage
outputs. Also, a 4-bit comparator has been designed by cascading 1-bit compar-
ators in series. Using this, a 32-bit reversible comparator has been proposed.
Proposed circuits have been simulated using Modelsim.
Keywords Reversible comparator Reversible logic FPGA
1 Introduction
Power dissipation is an important factor in VLSI design. Conventionally, digital

circuits have been implemented using the basic logic gates, which were irre-
versible in nature. These irreversible gates produce energy loss due to the
A. V. AnanthaLakshmi (&) G. F. Sudha

Department of Electronics and Communication Engineering,
Pondicherry Engineering College, Puducherry, India
e-mail: anantha_av@pec.edu
G. F. Sudha
e-mail: gfsudha@pec.edu

68 A. V. AnanthaLakshmi and G. F. Sudha
information bits lost during the operation. Information loss occurs because the
total number of output signals generated is less than the total number of input
signals applied. Thus, conventional combinational logic circuits dissipate heat for
every bit of information that is lost during their operation. In 1961, R. Landauer
proved that a single bit of information loss dissipates KTln2 joules of energy
where K is the Boltzmann’s constant and T is the temperature at which the
computation is performed [1]. In 1973, Bennett showed that in order to avoid
energy loss, it is necessary that all the computations have to be performed in a
reversible way [2]. Thus, to avoid power dissipation, circuits must be constructed
from reversible logic gates. Thus, every future technology has to use reversible
gates in order to reduce power dissipation. A circuit is said to be reversible if the
input vector can be uniquely recovered from the output vector and if there is a one-
to-one correspondence between its input and output assignment. A reversible
circuit maps each input vector into a unique output vector and vice versa. Thus,
reversible logic has application in various research areas such as digital signal
processing, quantum computing, low-power CMOS design, communication, bio-
informatics, and nanotechnology-based systems [3]. Synthesis of reversible logic
circuits is significantly more complicated than traditional irreversible logic circuits
because in a reversible logic circuit, we are not allowed to use fan-out and
feedback [4]. A reversible logic circuit should have the following features [5]:
Use minimum number of reversible gates
Use minimum number of garbage outputs
Use minimum constant inputs.
The output that cannot be used further for computation process is known as
garbage output. The input that is added to an nxk function to make it reversible is
called constant input [6]. The quantum cost of a reversible or quantum circuit is
defined as the number of 1 9 1 or 2 9 2 gates used to implement the circuit. The
major objective of a reversible logic design is to minimize the quantum cost and
the number of garbage outputs [7]. Hence, one of the major issues in reversible
circuit design is garbage minimization to minimize the power dissipation. Another
significant criterion in designing a reversible logic circuit is to minimize the
number of reversible gates used [8]. In this paper, we propose two new 3 9 3
reversible logic gates. The paper also focuses on the design of a reversible 1-bit
comparator using the two proposed reversible gates. The transistor representation
of the proposed circuit is better in terms of transistor count. The proposed work is
then compared with the existing comparator circuits. Also, a 4-bit reversible
comparator is designed using the 1-bit comparator. Using this, a 32-bit reversible
comparator has been designed. All the proposed circuits have been implemented
using VHDL and simulated using Modelsim. The paper is organized as follows:
Sect. 2 gives an overview of the reversible gates. Section 3 deals with the survey
of the existing work. Section 4 represents the design of the proposed reversible
gates. Section 5 represents the transistor implementation of the proposed gates.
Section 6 describes the proposed design of a 1-bit comparator using the two newly
proposed gates. Section 7 describes the design of a 4-bit comparator. Section 8
Transistor Representation of a Low-Power Reversible 32-Bit Comparator 69
describes the design of a 32-bit comparator. Simulation results of the proposed

design are presented in Sect. 9, and conclusions are given in Sect. 10.
2 Reversible Logic Gates
Some of the important reversible logic gates are Feynman gate, Fredkin gate,
Toffoli gate, Peres gate, URG gate, BJN gate, TR gate, M gate, and L gate. Brief
introduction about these gates are as given in Table 1.
3 Literature Survey
Nagamani et al. [9] proposed a reversible 1-bit comparator design using the
existing reversible gates such as Fredkin, Peres, Toffoli, R, URG, TR and the
newly proposed gate BJN. The drawback of their work is that the number of
reversible gates required for each implementation is more. Also, it produces more
number of garbage outputs and the circuit uses more number of constant inputs.
Sengupta et al. [10] proposed a reversible 1-bit comparator design using a single
SCG gate. The number of garbage outputs produced is 1. It uses 2 constant inputs.
The transistor representation of their circuit is not given. Since the logical
expressions involved in SCG are complex, definitely it requires more number of
transistors to implement. To minimize the transistor count, we have proposed two
new 3 9 3 reversible gates, which can be combined for its use as a reversible 1-bit
comparator.
4 Proposed 3 3 3 Reversible Gates
4.1 Proposed Reversible Gate1
The logic diagram of the proposed new reversible gate1 is shown in Fig. 1.
Reversible gate1 is a 3 9 3 gate with inputs (A, B, C) and outputs P = B’,
Q = AB’ ? BC, and R = A C.
The truth table for the corresponding gate is shown in Table 2.
Table 1 Reversible logic gates

SI. No Gate Block diagram Function
1. Feynman P=A
Q=AB
2. Toffoli P=A
Q=B
R = AB C
3. URG P = (A ? B) C
Q=B
R = AB C
4. TR P=A
Q=AB
R = AB’ C
5. BJN P=A
Q=B
R = (A ? B) C
6. Fredkin P=A
Q = A’B ? AC
R = AB ? A’C
7. Peres P=A
Q=AB
R = AB C
8. M P=A
Q = (A B)’
R = AB’ C
9. L P=A
Q=B
R = (A ? B)’ C
Fig. 1 Proposed 3 9 3
reversible gate1
Table 2 Truth table of reversible gate1

A B C P Q R
0 0 0 1 0 0
0 0 1 1 0 1
0 1 0 0 0 0
0 1 1 0 1 1
1 0 0 1 1 1
1 0 1 1 1 0
1 1 0 0 0 1
1 1 1 0 1 0
Fig. 2 Proposed 3 9 3
reversible gate2
4.2 Proposed Reversible Gate2
The logic diagram of the proposed new reversible gate2 is shown in Fig. 2.
Reversible gate2 is a 3 9 3 gate with inputs (A, B, C) and outputs P = A’B’ C,
Q = A’ B’, and R = A.
The truth table for the corresponding gate is shown in Table 3.
4.3 Realization of the Classical Operations
Proposed Reversible Gate1

The proposed reversible gate1 can implement OR, AND, XOR, NOT, and
COPY operations. Also, the COPY operation is an important operation, which can
be realized using the proposed reversible gate1. If the input A is set as 1, the output
Table 3 Truth table of reversible gate2

A B C P Q R
0 0 0 1 0 0
0 0 1 0 0 0
0 1 0 0 1 0
0 1 1 1 1 0
1 0 0 0 1 1
1 0 1 1 1 1
1 1 0 0 0 1
1 1 1 1 0 1
Q represents the OR operation. If the input A is set as 0, the output Q represents

the AND operation. If the input B is set as 0, the output R represents the XOR
operation. If the input B is 1 and C is 1, the output Q represents the COPY
operation and output R represents the NOT operation.
Proposed Reversible Gate2
The proposed reversible gate2 can implement OR, NOR, XNOR, NOT, and COPY
operations. The fact that the proposed gate can implement NOR operation signifies
that any boolean function can be implemented using this gate as NOR gate is a
universal gate. If the input C is 0, P represents the NOR operation and Q represents
the XNOR operation. If C is set as 1, P represents the OR operation. If B is 0 and C is
0, P represents the NOT operation and Q represents the COPY operation.
5 Transistor Implementation of the Proposed Reversible

Gates Using GDI Method
To construct reversible gates with minimum transistor count, two-input XOR, OR,
and AND gates are implemented using GDI method [11]. Most of the boolean
functions require a complex (6–12 transistors) gate in CMOS (as well as in
standard PTL implementations), but are very simple (only two transistors per
function) in the GDI design methodology. GDI enables simpler gates, lower
transistor count, and lower power dissipation.
5.1 Transistor Implementation of Proposed Reversible Gate1
The transistor representation of proposed reversible gate1 is shown in Fig. 3. Thus,

a total of 12 transistors are required to implement the reversible gate1.
5.2 Transistor Implementation of Proposed Reversible Gate2
The transistor representation of proposed reversible gate2 is shown in Fig. 4. Thus,

a total of 10 transistors are required to implement the reversible gate2.
6 Proposed Design of 1-Bit Comparator
To minimize the transistor count, we have implemented a reversible 1-bit com-

parator using the proposed reversible gate1 and gate2. The symbolic representation
of the proposed reversible 1-bit comparator is shown in Fig. 5.
Fig. 3 Transistor representation of proposed reversible gate1
From reversible gate1, when C is 0, P = B’, R = A, and Q = AB’, which

represents the greater function. The outputs P and R from reversible gate1 are
given as the inputs A and B to the reversible gate2. From reversible gate2, when C
is 0, P = A’B, which represents that A \ B, Q = A XNOR B, which represents
that A = B, and R = A, which is the garbage output. Thus, the proposed 1-bit
comparator circuit requires 2 reversible gates. The circuit accepts two constant
inputs and produces one garbage output, which is an optimized circuit. The
transistor representation of the proposed reversible 1-bit comparator circuit is
shown in Fig. 6. The number of transistors required to implement the proposed
circuit is 18.
In Fig. 6, the transistors from T1 to T10 represent the functionality of the
reversible gate1. The transistors from T11 to T18 represent the functionality of the
reversible gate2. Hence, in total, 18 transistors are required to implement a
reversible 1-bit comparator.
Fig. 4 Transistor representation of proposed reversible gate2
Fig. 5 Symbolic
representation of proposed
reversible 1-bit comparator
gate1 and gate2
7 Realization of Proposed 4-Bit Comparator
7.1 Logic Diagram to Find the Greater of Two 4-Bit

Numbers
Let the two 4-bit numbers to be compared for match be A=A3A2A1A0 and
B=B3B2B1B0. Each pair of bits (Ai B) is fed to each comparator. For efficient
realization of the greater of the two numbers, the Gi outputs are employed using
the following logical equation:
G ¼ G3 þ G2E3 þ G1E3E2 þ G0E3E2E1
On simplification, the above expression can be written as
Fig. 6 Transistor representation of proposed reversible 1-bit comparator
G ¼ G3 þ E3 ðG2 þ E2 ðG1 þ G0E1Þ ð1Þ

The number of gates required to find the greater of two 4-bit numbers is shown
in Table 4.
7.2 Logic Diagram to Find the Equality of Two 4-Bit

Numbers
G0, G1, G2, G3, E0, E1, E2, E3, L0, L1, L2, and L3 are the outputs of the 1-bit
comparator block. The signal E = E3E2E1E0 will be high when the input A is
equal to B. Three Reversible Gate1s are required to realize the equality condition.
Table 5 shows the number of gates required to implement the equality of two 4-bit
numbers.
Table 4 Number of gates required to find the greater of two 4-bit numbers
SI. No Number of gates required Number of garbage outputs produced
1. Existing work [10] 10 22
2. Proposed work 14 16
Table 5 Number of gates required to find the equality of two 4-bit numbers
7.3 Logic Diagram to Find the Smaller of Two 4-Bit

Numbers
Since it can be detected whether two 4-bit numbers are equal or a number is
greater than the other, it can be inferred that the architecture of whether a number
is smaller than the other can also be designed simply by the logical expression:
L ¼ ðE þ GÞ0 ¼ E0 G0 ð2Þ
Thus, two outputs E and G are fed as the inputs to a reversible gate2 to realize
Eq. 2. Thus, the signal L will be high when the input A is smaller than B. Table 6
shows the number of gates required to implement the reversible 4-bit comparator
circuit.
From Table 6, it is inferred that the number of gates required to implement the
4-bit comparator circuit to find the greater, equality, and smaller of two numbers is
more when compared with the existing work [10]. Though the proposed work has
increased the number of gates required, it has scaled down the garbage outputs
produced, which is the most important criterion while designing a reversible cir-
cuit. The power dissipation gets reduced as the number of garbage outputs is
minimized.
8 Realization of 32-Bit Comparator
The two 32-bit operands A and B are decomposed into four bits each. Thus, a
reversible 32-bit comparator is designed by using eight 4-bit comparators.
Table 6 Number of gates required to implement the reversible 4-bit comparator circuit
Table 7 Number of gates required to find the equality of two 32-bit numbers
1. Proposed Work 71 46
Table 8 Number of gates required to find the greater of two 32-bit numbers
Table 9 Number of gates required to implement the reversible 32-bit comparator circuit
Tables 7, 8, and 9 represent the number of gates required to find the equality and
greater of two 32-bit numbers and to implement the reversible 32-bit comparator
circuit.
9 Simulation Results
The entire unit was functionally verified. A test bench is used to generate the
stimulus and applies it to the implemented reversible 1-bit, 4-bit, and 32-bit
comparators. The design was simulated using Modelsim and synthesized using
synthesis tool targeting Xilinx Virtex- V1000EFG680 FPGA.
Figure 7 shows the simulation result of the reversible 1-bit comparator. The
signals a, b, c represent the input and signals p, q, r represent the output, where p
denotes the greater condition, q represents the smaller condition, and r denotes the
equality condition. Thus, for the input combination a = 0, b = 1, and c = 0, the
outputs are p = 0, q = 1, and r = 0. Thus, the result indicates that a is smaller
than b.
Figure 8 depicts the simulation result of the reversible 32-bit comparator. The
inputs a and b represent two 32-bit signals, and gr, eq, and lt represent the output
Fig. 7 Simulation result of the reversible 1-bit comparator

Fig. 8 Simulation result of the reversible 32-bit comparator
signals to indicate the greater, equality, and smaller conditions. Thus, for inputs
a = 11110011011111111111111111111111 and b = 1111001100111111111111
1111111111, the outputs are gr = 1, eq = 0, and lt = 0. Thus, it indicates that a is
greater than b.
10 Conclusion
In this paper, an optimized reversible 1-bit comparator is presented with the

proposed new reversible gate1 and gate2. Then, a 4-bit reversible comparator is
designed using the optimized 1-bit comparator. Finally, a 32-bit reversible com-
parator is designed using eight stages of 4-bit comparator. The design is very
useful for the future computing techniques like ultra-low-power digital circuits and
quantum computers. It is shown that the proposal is highly optimized in terms of
number of reversible logic gates, number of garbage outputs, and number of
constant inputs.
References
1. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev.
5(3), 183–191 (1961)
2. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(1), 525–532 (1973)
3. Peres, A.: Reversible logic and quantum computers. Phys. Rev. 32, 3266–3276 (1985)
4. Perkowski, M., Al-Rabadi, A., Kerntopf, P., Buller, A., Chrzanowska-Jeske, M., Mish
chenko, A., Azad Khan, M., Coppola, A., Ya Nushkevich, S., Shmerko, V.P., Jozwiak, L.: A
general decomposition for reversible logic. Proc. RM 1, 119–138 (2001)
5. Perkowski, M., Kerntopf, P.: Reversible logic. In: Proceedings of EURO-MICRO Warsaw,
Poland (2001)
6. Himanshu, T., Srinivas, M.B.: Novel reversible TSG gate and its application for designing
reversible carry look ahead adder and other adder architectures. In: Proceedings of the 10th
Asia-Pacific Computer Systems Architecture Conference (ACSAC 05) Lecture Notes of
Computer Science, 3740, pp. 775–786, Springer (2005)
7. Benett, C.H.: Notes on the history of reversible computation. IBM J. Res. Dev. 32, 16–23
(1998)
8. Haghparast, M., Navi, K.: Design of a novel fault tolerant reversible full adder for nano
technology based systems. World Appl. Sci. J. 4, 114–118 (2005)
9. Nagamani, A.N., Jayashree, H.V., BhagyaLakshmi, H.R.: Novel low power comparator
design using reversible logic gates. Indian J. Comput. Sci. Eng. 2, 574–576 (2011)
10. Sengupta, Digantha, Sultana, Mahamuda, Chaudhuri, Atal: Realization of a novel reversible
SCG gate and its application for designing parallel adder/subtractor and match logic. Int.
J. Comput. Appl. 31, 30–35 (2011)
11. Morgenshtein, A., Moreinis, M., Ginosar, R.: Asynchronous Gate-Diffusion-Input (GDI)
Circuits. IEEE Transactions Very Large Scale Integration (VLSI) Systems (2004)
Performance Enhancement of Brillouin
Distributed Temperature Sensor Using
Optimized Fiber
P. K. Sahu and Himansu Shekhar Pradhan
Abstract The improvement of signal-to-noise ratio (SNR) and the suppression of

stimulated Brillouin scattering (SBS) effects in a long-range distributed sensor are
presented in this paper. We have designed a simple Brillouin distributed tem-
perature sensor using phase modulation and optimization technique. Global evo-
lutionary computing-based optimization technique [particle swarm optimization
(PSO)] is applied for fiber and receiver optimization. The simulated results of the
sensing system are reported in this paper. The combination of phase modulation
and the global evolutionary computing technique improved the SBS threshold
power to an extent of 6.8 and 6.3 dBm for 50 and 75 km of sensing range,
respectively. However, with both receiver and fiber optimization, a 20 dBm
improvement of SNR for an input power of 5 dBm and 75 km of sensing range is
reported.
Keywords Evolutionary computing PSO SBS SNR
1 Introduction
Brillouin distributed fiber optic sensor has become more popular due to its unique
advantage of simultaneously measuring the temperature and strain. The distributed
fiber sensors are attractive because a single fiber optic cable can potentially replace
thousands of individual point sensors. Besides, this sensor installation and main-
tenance issue is simplified using distributed sensor. Fiber sensors offer several
P. K. Sahu (&) H. S. Pradhan

School of Electrical Sciences, IIT, Bhubaneswar, Odisha, India
e-mail: pks@iitbbs.ac.in
H. S. Pradhan
e-mail: hsp10@iitbbs.ac.in


Part 1 IReseau

Uploaded by

Copyright:

Available Formats

Part 1 IReseau

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Part 1 IReseau

Uploaded by

Copyright:

Available Formats

Advances in Intelligent Systems and Computing 243

Durga Prasad Mohapatra

For further volumes:

Hani Hagras, University of Essex, Colchester, UK

László T. Kóczy, Széchenyi István University, Gy}or, Hungary

Vladik Kreinovich, University of Texas at El Paso, El Paso, USA

Chin-Teng Lin, National Chiao Tung University, Hsinchu, Taiwan

Jie Lu, University of Technology, Sydney, Australia

Patricia Melin, Tijuana Institute of Technology, Tijuana, Mexico

Nadia Nedjah, State University of Rio de Janeiro, Rio de Janeiro, Brazil

Ngoc Thanh Nguyen, Wroclaw University of Technology, Wroclaw, Poland

ISSN 2194-5357 ISSN 2194-5365 (electronic)

Library of Congress Control Number: 2013955257

Springer India 2014

Printed on acid-free paper

Springer is part of Springer Science+Business Media (www.springer.com)

The proceedings of the International Conference on Advanced Computing,

Durga Prasad Mohapatra

Ajith Abraham, Technical University of Ostrava, Czech Republic

Amulya Ratna Swain, Indian Institute of Science Bangalore, India

Prakash Davara, Chairman, Central Institute of Technology Raipur, India

Arindam Ray, Director, Central Institute of Technology Raipur, India

Sipi Dubey, Rungta College of Engineering and Technology, India

Manoj Kumar Singh, DST-CIMS, Banaras Hindu University, India

Ashok Kumar Turuk, National Institute of Technology Rourkela, India

Proceedings Volume Editors

Durga Prasad Mohapatra, National Institute of Technology Rourkela, India

Technical Track Chairs

Bidyut Kumar Patra, National Institute of Technology Rourkela, India

Industrial Track Chairs

Bibhudutta Sahoo, National Institute of Technology Rourkela, India

Anil Kumar Vuppala, International Institute of Information Technology

Steering Committee Chair

Savita Gupta, National Institute of Technology Rourkela, India

Jayanta Pothal, Scientist, Council of Scientific and Industrial Research, India

Sambit Bakshi, National Institute of Technology Rourkela, India

Parantapa Goswami, University Joseph Fourier, France

Amit Trivedi, National Institute of Technology Raipur, India

Santanu Bakshi, University of Florida, USA

Image and Template Security for Palmprint . . . . . . . . . . . . . . . . . . . 1

Extending Network Lifetime by Time-Constrained Data

The Complex Network Analysis of Power Grid: A Case Study

Comparison and Analysis of Node Deployment for Efficient

Performance Analysis of Routing Protocols for VANETs

A Bluetooth-Based Autonomous Mining System . . . . . . . . . . . . . . . . . 57

Transistor Representation of a Low-Power Reversible

Performance Enhancement of Brillouin Distributed Temperature

To Study the Architectural Designs of a Proposed Comprehensive

Detection of Web-Based Attacks by Analyzing

A Survey of Energy-Aware Routing Protocols and Mechanisms

Lexical Ontology-Based Computational Model to Find

Energy-Efficient Cluster-Based Aggregation Protocol

Digital Watermarking Based on Magic Square

Circle of Trust: One-Hop-Trust-Based Security Paradigm

Design of a Biometric Security System Using Support

Impact of Distance Measures on the Performance

Gender Identification Using Gait Biometrics . . . . . . . . . . . . . . . . . . 191

A Survey on Business Context . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199

Enhanced Caching for Geocast Routing in Vehicular