Communication, Networks and

Computing: First International

Conference, CNC 2018, Gwalior, India,
March 22-24, 2018, Revised Selected
Papers Shekhar Verma
Visit to download the full and correct content document:
https://textbookfull.com/product/communication-networks-and-computing-first-internati
onal-conference-cnc-2018-gwalior-india-march-22-24-2018-revised-selected-papers-s
hekhar-verma/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Communication, Networks and Computing: First

International Conference, CNC 2018, Gwalior, India,
March 22-24, 2018, Revised Selected Papers Shekhar
Verma
https://textbookfull.com/product/communication-networks-and-
computing-first-international-conference-cnc-2018-gwalior-india-
march-22-24-2018-revised-selected-papers-shekhar-verma/

Applications of Computing and Communication

Technologies: First International Conference, ICACCT
2018, Delhi, India, March 9, 2018, Revised Selected
Papers Ganesh Chandra Deka
https://textbookfull.com/product/applications-of-computing-and-
communication-technologies-first-international-conference-
icacct-2018-delhi-india-march-9-2018-revised-selected-papers-
ganesh-chandra-deka/

Communication Systems and Networks: 10th International

Conference, COMSNETS 2018, Bangalore, India, January
3-7, 2018, Extended Selected Papers Subir Biswas

https://textbookfull.com/product/communication-systems-and-
networks-10th-international-conference-comsnets-2018-bangalore-
india-january-3-7-2018-extended-selected-papers-subir-biswas/

Soft Computing Systems Second International Conference

ICSCS 2018 Kollam India April 19 20 2018 Revised
Selected Papers Ivan Zelinka

https://textbookfull.com/product/soft-computing-systems-second-
international-conference-icscs-2018-kollam-india-
april-19-20-2018-revised-selected-papers-ivan-zelinka/
Information and Communication Technologies for Ageing
Well and e-Health: 4th International Conference,
ICT4AWE 2018, Funchal, Madeira, Portugal, March 22–23,
2018, Revised Selected Papers Panagiotis D. Bamidis
https://textbookfull.com/product/information-and-communication-
technologies-for-ageing-well-and-e-health-4th-international-
conference-ict4awe-2018-funchal-madeira-portugal-
march-22-23-2018-revised-selected-papers-pana/

Futuristic Trends in Network and Communication

Technologies: First International Conference, FTNCT
2018, Solan, India, February 9–10, 2018, Revised
Selected Papers Pradeep Kumar Singh
https://textbookfull.com/product/futuristic-trends-in-network-
and-communication-technologies-first-international-conference-
ftnct-2018-solan-india-february-9-10-2018-revised-selected-
papers-pradeep-kumar-singh/

Sensor Networks 6th International Conference SENSORNETS

2017 Porto Portugal February 19 21 2017 and 7th
International Conference SENSORNETS 2018 Funchal
Madeira Portugal January 22 24 2018 Revised Selected
Papers César Benavente-Peces
https://textbookfull.com/product/sensor-networks-6th-
international-conference-sensornets-2017-porto-portugal-
february-19-21-2017-and-7th-international-conference-
sensornets-2018-funchal-madeira-portugal-
january-22-24-2018-revised-sel/
Advances in Computing and Data Sciences Second
International Conference ICACDS 2018 Dehradun India
April 20 21 2018 Revised Selected Papers Part I Mayank
Singh
https://textbookfull.com/product/advances-in-computing-and-data-
sciences-second-international-conference-icacds-2018-dehradun-
india-april-20-21-2018-revised-selected-papers-part-i-mayank-
singh/

Advances in Computing and Data Sciences Second

International Conference ICACDS 2018 Dehradun India
April 20 21 2018 Revised Selected Papers Part II Mayank
Singh
https://textbookfull.com/product/advances-in-computing-and-data-
sciences-second-international-conference-icacds-2018-dehradun-
india-april-20-21-2018-revised-selected-papers-part-ii-mayank-
Shekhar Verma · Ranjeet Singh Tomar
Brijesh Kumar Chaurasia · Vrijendra Singh
Jemal Abawajy (Eds.)

Communications in Computer and Information Science 839

Communication, Networks
and Computing
First International Conference, CNC 2018
Gwalior, India, March 22–24, 2018
Revised Selected Papers

123 CNC - 2018

Communications
in Computer and Information Science 839
Commenced Publication in 2007
Founding and Former Series Editors:
Phoebe Chen, Alfredo Cuzzocrea, Xiaoyong Du, Orhun Kara, Ting Liu,
Dominik Ślęzak, and Xiaokang Yang

Editorial Board
Simone Diniz Junqueira Barbosa
Pontifical Catholic University of Rio de Janeiro (PUC-Rio),
Rio de Janeiro, Brazil
Joaquim Filipe
Polytechnic Institute of Setúbal, Setúbal, Portugal
Igor Kotenko
St. Petersburg Institute for Informatics and Automation of the Russian
Academy of Sciences, St. Petersburg, Russia
Krishna M. Sivalingam
Indian Institute of Technology Madras, Chennai, India
Takashi Washio
Osaka University, Osaka, Japan
Junsong Yuan
University at Buffalo, The State University of New York, Buffalo, USA
Lizhu Zhou
Tsinghua University, Beijing, China
More information about this series at http://www.springer.com/series/7899
Shekhar Verma Ranjeet Singh Tomar
•

Brijesh Kumar Chaurasia Vrijendra Singh

•

Jemal Abawajy (Eds.)

Communication, Networks
and Computing
First International Conference, CNC 2018
Gwalior, India, March 22–24, 2018
Revised Selected Papers

123
Editors
Shekhar Verma Vrijendra Singh
Indian Institute of Information Technology Indian Institute of Information Technology
Allahabad Allahabad
India India
Ranjeet Singh Tomar Jemal Abawajy
ITM University School of Information Technology
Gwalior Deakin University
India Burwood, VIC
Australia
Brijesh Kumar Chaurasia
ITM University
Gwalior
India

ISSN 1865-0929 ISSN 1865-0937 (electronic)

Communications in Computer and Information Science
ISBN 978-981-13-2371-3 ISBN 978-981-13-2372-0 (eBook)
https://doi.org/10.1007/978-981-13-2372-0

Library of Congress Control Number: 2018953421

© Springer Nature Singapore Pte Ltd. 2019

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.
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.
The publisher, the authors and the editors are safe to assume that the advice and information in this book are
believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors
give a warranty, express or implied, with respect to the material contained herein or for any errors or
omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in
published maps and institutional affiliations.

This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
 Preface

The book focuses on communication, networks, and computing to simplify the

real-time problems occurring in different domains of communication, networks, and
computing. Presently, research is entering a new era of convergence of these domains
wherein the established models and techniques are being challenged. New ideas are
being proposed and established ideas are being retested. Evaluating the performance of
emerging smart technologies, however, poses a huge challenge.
The book includes high-quality papers presented at the International Conference on
Communication, Networks, and Computing (CNC 2018), organized by ITM University
Gwalior, India. Offering significant insights into this domain for academics and
industry alike, the book inspires more researchers to work in the field of intelligent
networks for communication systems. The theme of the conference was “Intelligent
Networks for Communication Systems.” This theme covers the exciting new areas of
wired and wireless communication systems, high-dimensional data representation and
processing, networks and information security, computing techniques for efficient
networks design and electronic circuits for communication systems that promise to
make the world a better place to live in.
ITM University Gwalior, India, is a multidisciplinary university with an interna-
tional reputation for the quality of its research and teaching across the academic
spectrum. The university has received more than 20 awards and has been ranked in the
top category by a number of governmental and other agencies. The university is ranked
32nd in management and 58th in engineering in 2016 by the National Institutional
Ranking Framework, Ministry of HRD, Government of India. The university is
approved by the regulatory bodies required to run courses in engineering, management,
pharmacy, commerce, agriculture, architecture, computer applications, teacher educa-
tion, art and design, physical education, sciences, law, India and South Asia studies,
journalism, nursing etc. It is at the forefront of learning, teaching, and research and the
leader in different fields. It seeks to sustain and enhance its excellence as an institution
of higher learning through outstanding teaching and world-class societies it serves.
The ITM School of Engineering and Technology is one of the flagship and leading
schools of central and north India. The school is unique in that it tries to assimilate
cutting-edge ideas in engineering and technology through a variety of projects in
association with industry. In addition, prominent industries directly contribute to the
knowledge and skill sets of students through various augmentation programs cus-
tomized for students of ITM University. A mix of lectures, tutorials, laboratory studies,
seminars, and projects are used to groom the conceptual and analytical abilities of
students. For the first time in India, ITM University Gwalior has taken the initiative to
introduce activity-based continuous assessment (ABCA) in order to increase the
employability of students.
This conference was successful in facilitating academics, researchers, and industry
professionals to deliberate upon the latest issues, challenges, and advancements in
VI Preface

communication, networks, and computing. In total, 182 papers were submitted for five
tracks. After a thorough review process, 70 papers were selected for oral presentation
during the conference. Out of these, 57 papers were selected for presentation at the
conference and only those best papers are published in the book.
This conference proceedings volume will prove beneficial for academics,
researchers, and professionals from industry as it contains valuable information and
knowledge on the recent developments.

September 2018 Shekhar Verma

Ranjeet Singh Tomar
Brijesh Kumar Chaurasia
Vrijendra Singh
Jemal Abawajy
 Organization

Chief Patron
Shri Ramashankar Singh ITM University Gwalior, India
(Chancellor)

Patrons
Kanupriya Singh Rathore ITM Universe Vadodara, India
(Chairperson)
Ruchi Singh Chauhan ITM University Gwalior, India
(Pro Chancellor)
Shri Ravindra Singh ITM Universe, Vadodara, India
Rathore (Managing
Director)
Daulat Singh Chauhan ITM University Gwalior, India
(Managing Director)
Kamalkant Dwivedi ITM University Gwalior, India
(Vice-chancellor)
R. D. Gupta (Advisor ITM University Gwalior, India
to Chancellor)
Omveer Singh (Registrar) ITM University Gwalior, India

General Chairs
Shekhar Verma IIIT, Allahabad, India
Ranjeet Singh Tomar ITM University Gwalior, India

Program Chairs
Pao Ann Hsiung National Chung Cheng University, Taiwan
Brijesh Kumar Chaurasia ITM University Gwalior, India

Technical Committee Chairs

Jemal Abawajy Deakin University, Australia
Vrijendra Singh IIIT Allahabad, India

Publications Chairs
Shyam Akashe ITM University Gwalior, India
Sanjay Jain ITM University Gwalior, India
VIII Organization

Publicity Chairs
Pallavi Khatri ITM University Gwalior, India
Shashikant Gupta ITM University Gwalior, India

Workshop/Tutorial Chairs
Arun Kumar Yadav ITM University Gwalior, India
Rajendra Singh Kushwah ITM-GOI, Gwalior, India
R. Jenkin Suji ITM University Gwalior, India

Hospitality Chairs
Mukesh Kumar Pandey ITM University Gwalior, India
Rishi Soni ITM-GOI, Gwalior, India

Local Organizing Committee

Ratan Kumar Jain ITM University Gwalior, India
Geetanjali Surange ITM University Gwalior, India
Deepak Motwani ITM University Gwalior, India
Kapil Govil ITM University Gwalior, India
Anshul Agarwal ITM University Gwalior, India
Shailendra Singh Ojha ITM University Gwalior, India
Ashish Garg ITM University Gwalior, India
Kapil Sharma ITM University Gwalior, India

Organizing Secretariat
Sumit Mohanti ITM University Gwalior, India
Mayank Shastri ITM University Gwalior, India
 Contents

Wired and Wireless Communication Systems

Properties and Performance of Linearly Extensible Multiprocessor

Interconnection Networks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Savita Gautam and Abdus Samad

An Analysis on Improvement of Lifetime in Wireless Sensor Network . . . . . 13

Shubhi Malhotra, Shushant Kumar Jain, and Vineet Shrivastava

A Novel Solution for Cloud Enabled E-Governance Using Openstack:

Opportunities and Challenges . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
Bhushan Jadhav and Archana B. Patankar

Frequency of Meeting with Node and Visit to Physical Location

Based on Mobility Pattern . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
Binod Kumar, R. R. Suman, and Binod Kumar Singh

A New Lightweight Approach for Multiuser Searchable Encryption

in the Cloud . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
Nitish Andola, Sourabh Prakash, Raghav, S. Venkatesan,
and Shekhar Verma

Performance Evaluation of Multi-functional Defected Ground Structure

Embedded with Microstrip Patch Antenna for ISM
Band Wireless Communications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
Guru Prasad Mishra, Sumon Modak, Madhu Sudan Maharana,
and Biswa Binayak Mangaraj

Evaluation of Character Recognition Algorithm Based

on Feature Extraction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
Bishakha Sharma and Arun Agarwal

A High Performance BPSK Trans Receiver Using Level Converter

for Communication Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
Akula Rajesh, B. L. Raju, and K. Chenna Kesava Reddy

Connectivity Analysis of Mobile Ad Hoc Network Using Fuzzy

Logic Controller . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
Poonam Rathore and Laxmi Shrivastava
X Contents

Improved Election of Cluster Head Using CH-PSO for Different

Scenarios in VANET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
Bhairo Singh Rajawat, Ranjeet Singh Tomar,
Mayank Satya Prakash Sharma, and Brijesh Kumar Chaurasia

Utilizing Clustering Techniques for Improving the Boxplots . . . . . . . . . . . . . 121

Kalpak Patil, Naresh Kumar Nagwani, and Sarsij Tripathi

Mathematical Model for Sink Mobility (MMSM) in Wireless Sensor

Networks to Improve Network Lifetime . . . . . . . . . . . . . . . . . . . . . . . . . . . 133
Mohit Kumar, Dinesh Kumar, and Md. Amir Khusru Akhtar

Detection of High Transmission Power Based Wormhole Attack

Using Received Signal Strength Indicator (RSSI) . . . . . . . . . . . . . . . . . . . . 142
Prachi Sharma and Rajendra Kumar Dwivedi

Effective Data Storage Security with Efficient Computing in Cloud. . . . . . . . 153

Manoj Tyagi, Manish Manoria, and Bharat Mishra

Privacy Preserving Multi Keyword Ranked Search with Context Sensitive

Synonyms over the Encrypted Cloud Data . . . . . . . . . . . . . . . . . . . . . . . . . 165
Anu Khurana, Rama Krishna Challa, and Navdeep Kaur

An Optimized High Gain Microstrip Patch Array Antenna

for Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181
Chandra Shekhar

An Efficient Data Aggregation Algorithm with Gossiping for Smart

Transportation System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
Sudhakar Pandey, Ruchi Jain, and Sanjay Kumar

Lane Change in Roundabout for Reduced Trip Time . . . . . . . . . . . . . . . . . . 201

Hitender Vats and Ranjeet Singh Tomar

High Dimensional Data Representation and Processing

Fundamental Survey of Map Reduce in Bigdata

with Hadoop Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
Maulik Dhamecha and Tejas Patalia

Improve Tampered Image Using Watermarking Apply

the Distance Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 223
Nisha Chauhan and Arun Agarwal

A Novel Approach for Image Fusion with Guided Filter

Based on Feature Transform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235
Krishnavijay Tripathi and Ashutosh Sharma
 Contents XI

Networks and Information Security

Man in the Middle Attack on NTRU Key Exchange . . . . . . . . . . . . . . . . . . 251

Vijay Kumar Yadav, S. Venkatesan, and Shekhar Verma

Information Theoretic Analysis of Privacy in a Multiple Query-Response

Based Differentially Private Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . 262
Bodhi Chakraborty, Debanjan Sadhya, Shekhar Verma,
and Krishna Pratap Singh

Security in MQTT and CoAP Protocols of IOT’s Application Layer . . . . . . . 273

Anup Burange, Harshal Misalkar, and Umesh Nikam

Forensic Analysis of a Virtual Android Phone . . . . . . . . . . . . . . . . . . . . . . 286

Aman Sharma, Animesh Kumar Agrawal, Bhupendra Kumar,
and Pallavi Khatri

Implementation of Security Algorithm and Achieving Energy Efficiency

for Increasing Lifetime of Wireless Sensor Network . . . . . . . . . . . . . . . . . . 298
Harshal Misalkar, Umesh Nikam, and Anup Burange

Secure Portable Storage Drive: Secure Information Storage . . . . . . . . . . . . . 308

Ashish Dhiman, Vishal Gupta, and Damanbir Singh

Performance Evaluation of Facenet on Low Resolution Face Images . . . . . . . 317

Monika Rani Golla and Poonam Sharma

Computing Techniques for Efficient Networks Design

Grading and Defect Detection in Potatoes Using Deep Learning . . . . . . . . . . 329

Nikhil Pandey, Suraj Kumar, and Raksha Pandey

Rough Fuzzy Technique for Giant Cell Tumor Detection . . . . . . . . . . . . . . . 340

Krupali Mistry, Sweta Dargad, and Avneet Saluja

Face Recognition in Surveillance Video for Criminal Investigations:

A Review . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 351
Napa Lakshmi and Megha P. Arakeri

Prototype to Control a Robot by Android System Remote Controller. . . . . . . 365

Tanvir Rahman, Fazal Mahmud Hassan, Shamma Binte Zakir,
Md. Ashraful Alam, Bir Ballav Roy, and Hasib Ahmed

Plane-Wise Encryption Based Progressive Visual Cryptography

for Gray Image . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 373
Suresh Prasad Kannojia and Jasvant Kumar
XII Contents

An Advanced Throttled (ATH) Algorithm and Its Performance Analysis

with Different Variants of Cloud Computing Load Balancing Algorithm . . . . 385
Saurabh Gupta, Nitin Dixit, and Pradeep Yadav

Role of Cache Replacement Policies in High Performance Computing

Systems: A Survey . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 400
Purnendu Das

Edge Detection Techniques in Dental Radiographs

(Sobel, T1FLS & IT2FLS) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 411
Aayushi Agrawal and Rosepreet Kaur Bhogal

Review of Deep Learning Techniques for Object Detection

and Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 422
Mohd Ali Ansari and Dushyant Kumar Singh

Improved Symmetric Key Technique Using Randomization . . . . . . . . . . . . . 432

Anshu Chaturvedi and Hirendra Singh Sengar

An Interpretable SVM Based Model for Cancer Prediction

in Mammograms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
Abhishek Verma, Prashant Shukla, Abhishek, and Shekhar Verma

DPVO: Design Pattern Detection Using Vertex Ordering a Case

Study in JHotDraw with Documentation to Improve Reusability . . . . . . . . . . 452
Arti Chaturvedi, Manjari Gupta, and Sanjay Kumar Gupta

Intelligent Aggregation for Ensemble LSTM. . . . . . . . . . . . . . . . . . . . . . . . 466

Ashima Elhence, Abhishek, and Shekhar Verma

Optimal Low Rank Tensor Factorization for Deep Learning . . . . . . . . . . . . . 476

Antra Purohit, Abhishek, Rakesh, and Shekhar Verma

Performance Analysis of Naive Bayes Computing Algorithm

for Blood Donors Classification Problem . . . . . . . . . . . . . . . . . . . . . . . . . . 485
Anil Kewat, P. N. Srivastava, and Arvind Kumar Sharma

Electronic Circuits for Communication Systems

Design of a Single-Ended 8T SRAM Cell for Low Power Applications . . . . . 499

S. R. Mansore, R. S. Gamad, and D. K. Mishra

Y-Shaped Cantilever Beam RF MEMS Switch for Lower

the Actuation Voltage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 509
Aamir Saud Khan and T. Shanmuganantham
 Contents XIII

Concentric Circular Ring Arc Antenna at Dual Band

for Ku Band Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 518
T. Srinivasa Reddy, S. K. Nannu Saheb, P. Koteswara Rao,
and Ashok Kumar Balijepalli

Design of Spider Shaped Microstrip Patch Antenna for IoT Application. . . . . 528
S. K. Vyshnavi Das and T. Shanmuganantham

Design of Microstrip Polygon Shaped Patch Antenna for IoT Applications. . . 538
S. K. Vyshnavi Das and T. Shanmuganantham

A Novel Microstrip Patch Antenna with Single Elliptical CSRR

for Multiband Applications. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 548
V. Priyanka, T. Shanmuganantham, and Daisy Sharma

Analysis of Circular Ring Patch Antenna for Enhancement of Wide

Bandwidth with Defected Ground Structure . . . . . . . . . . . . . . . . . . . . . . . . 557
T. Srinivasa Reddy, Ashok Kumar Balijepalli, P. Koteswara Rao,
and S. K. Nannu Saheb

The Analysis of U Slotted Rectangular Patch with Geometric Series DGS

for Triple Band Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 568
T. Srinivasa Reddy, P. Koteswara Rao, Ashok Kumar Balijepalli,
and S. K. Nannu Saheb

A Dual Band Coplanar Concentric Ring Patch Antenna for Ku

Band Applications. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 579
T. Srinivasa Reddy, Ashok Kumar Balijepalli, S. K. Nannu Saheb,
and P. Koteswara Rao

Optimal Design of CMOS Amplifier Circuits Using Whale

Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 590
M. A. Mushahhid Majeed and Patri Sreehari Rao

Reliability Analysis of Comparator: NBTI, PBTI, HCI, AGEING . . . . . . . . . 606

Seelam V. Sai Viswanada Prabhu Deva Kumar and Shyam Akashe

Sag Calculations in Transmission Line with Different Case Studies . . . . . . . . 620

Sandeep Gupta and Shashi Kant Vij

Dual Band Slotted Patch Microstrip Antenna Array Design for K

Band Application . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 632
Ritesh Kushwaha and R. K. Chauhan

A 6-Bit Low Power SAR ADC. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 642

K. Lokesh Krishna, K. Anuradha, and Alfakhri M. Murshed

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 653

Wired and Wireless Communication
Systems
 Properties and Performance of Linearly
Extensible Multiprocessor Interconnection
Networks

Savita Gautam and Abdus Samad(&)

F/O Engineering and Technology, University Women’s Polytechnic,

Aligarh Muslim University, Aligarh, India
savvin2003@yahoo.co.in, abdussamadamu@gmail.com

Abstract. Interconnection networks arise as the basic bone of research related

to parallel computing, high-performance system design, distributed computing
or computer networks. There has been a strong interest in the design of modern
interconnection topologies to achieve the desired performance. This paper
presents the performance study of a new class of parallel architectures known as
linearly extensible multiprocessor architectures. It describes the properties and
parameters to evaluate the performance of newly designed interconnection
networks. The comparative study is carried out which shows that the proposed
class posses the desirable topological properties of hypercube as well as tree
type topologies. The performance of these architectures is also evaluated in
terms of load balancing by applying standard scheduling algorithm on them. The
simulation results show that the proposed architectures are performing on equal
footing and their performance are compatible with standard hypercube archi-
tecture. The comparative study implies the various aspects while designing and
efficient multiprocessor interconnection network.

Keywords: Linearly extensible network
Diameter
Load balancing accuracy

Scheduling algorithm
Interconnection network topology
Hypercube

1 Introduction

The study of interconnection networks is an emerging research area in the design of high
performance parallel system, computer networks and also in distributed computing
environment. To satisfy the requirements of modern ICT technologies and to take services
of massively parallel systems, computer architects have always strived to increase the
performance of their architectures by designing high quality networks. It is anticipated that
large parallel applications shall be deployed on next generation High Performance
Computing systems [1, 2]. Therefore, it is apparent that low cost, efficient and scalable
architectures design has a deep concern while working with parallel applications.
There are several challenges while designing an interconnection networks. The
most important are scalability, simple and cost effective topology. Meshes and
hypercube based topologies have been utilized extensively in the design of parallel
computers in the recent years [3]. As the density of processor package increases,
scalability and extensibility is becoming a critical issue in the design of interconnection
© Springer Nature Singapore Pte Ltd. 2019
S. Verma et al. (Eds.): CNC 2018, CCIS 839, pp. 3–12, 2019.
https://doi.org/10.1007/978-981-13-2372-0_1
4 S. Gautam and A. Samad

networks. The primary objective of any interconnection network is to maintain the

appealing topological properties of both, hypercube and tree type architectures. Several
interconnection topologies have been investigated with many attractive properties such
as small diameter, constant node degree, lesser complexity and cost. Cube-based
architectures are one of major class of such architectures [4–6]. However, purely cube-
based architectures suffer from a common drawback of complexity when extended to
higher levels. Another major disadvantage of cube-based systems is difficulty of its
VLSI layout [7, 8].
Recently a new class of multiprocessor interconnection network has been reported
which preserves most of the desirable properties of hypercube as well considered to be
cost effective. The important characteristic of these networks is the accommodation of
more number of processing elements with lesser complexity and interconnection
hardware. They do not suffer from exponential expansion which has always been a
major drawback of hypercube networks [9–11]. This paper describes the various
topological properties of linearly extensible networks. A comparative study is carried
out to demonstrate their advantages and limitations.
The performance measure is essential to monitor the efficiency of a particular
multiprocessor network with appropriate routing algorithm. The efficiency of such
system depends upon the effective and efficient utilization of processing elements
(nodes). The process of assigning the load to various processors in the network and
making the optimal use of resources is called scheduling. In the present paper the
performance evaluation of the proposed class of networks is also discussed by applying
standard scheduling algorithm on them.
The rest of the paper is organized as follows: Sect. 2 gives a background of linearly
extensible multiprocessor interconnection networks. Section 3 identifies the various
topological properties and a comparative study is carried out. In Sect. 4 standard
scheduling algorithm with performance parameter is discussed and results have been
presented. Finally the conclusion is drawn in Sect. 5.

2 Background and Related Work

The interconnection network allows computer nodes to interchange messages in terms

of tasks with high throughput and low communication latency. High throughput is a
key element of massively parallel systems and communication latency has a definite
impact on the overall execution time of parallel applications. Delay, if found by the
messages traveling through the network will significantly affect the execution time.
This is the reason why we should not decide lightly while designing an interconnection
network that interconnects computing elements and work in coordination in a high
performance system. The evaluation of an interconnection network is a difficult task
that requires deep knowledge about how parallel applications make use of the network.
Prior to the evaluation of the considered topologies for performance parameter an
analytical comparison of their properties is carried out.
The binary tree is the basic architecture which is considered as scalable architecture
having constant node degree and bisection width. At n-level complexity the binary tree
is having N = 2n − 1 nodes with diameter 2(n − 1). Several variations of binary tree
 Properties and Performance of Linearly Extensible Multiprocessor Interconnection 5

are reported in the literatures which possess desirable topological properties. Some
examples are FAT Tree, Linearly Extensible Tree (LET), Linearly Extensible Triangle
(LED), Chain Cubic Tree (CCN) etc. [12–14].
Fat-tree interconnection network is a general purpose scalable network having
simple topology. It has the structure of a tree network, however, its links have different
bandwidth at each level. The larger bandwidth could be obtained by placing the link
closer to root. Intermediate switches are used to communicate messages to nodes
located at the leaf. The important feature of Fat-tree network is that any network can be
embedded with this on the same chip [13]. The LET network is based on binary tree,
however, in a binary tree, the number of nodes at level n is 2^n whereas in LET
network the number of nodes is (n + 1). The LET network combines the properties of
linear extensibility with small number of nodes per extension [9]. Figures 1 and 2
demonstrate the FAT and LET architectures respectively.

Fig. 1. 16-node two-level FAT tree.

The triangle-based multiprocessor network known as Linearly Extensible Triangle

(LED) is basically having the concept of simple geometry and is designed using the
concept of isosceles triangle shown in Fig. 3. The links between nodes could easily be

Fig. 2. 6-node 1-level linearly extensible tree.

6 S. Gautam and A. Samad

obtained by forming two isosceles triangles and joining their corresponding vertices.
The main attraction of this architecture is having the properties of a linearly extensible
multiprocessor architecture and it can easily be extended to higher levels without
increasing the complexity of network [12].

Fig. 3. 4-node 1-level linearly extensible triangle.

Fig. 4. 12-node 1-level chained-cubic tree.

The Chained-Cubic Tree (CCT) interconnection network topology is recently

proposed topology. The CCT combines the desirable properties of the hypercube and
tree topologies. The CCT could be formed by replacing each of the 2h+1 − 1 nodes of
the tree (Th) by a d-dimensional hypercube, where h is the height of the tree and d is the
hypercube’s dimension [14]. The CCT constructed in this way is represented as CCT
(h, d). Figure 4 demonstrates the CCT (1, 2) network in which the tree’s height is 1 and
it consists of 2-D hypercube networks.
Another class of network is the hybrid model architecture. This type of architec-
tures are like CCT which are based on hypercube, however, they overcome the un-
desirable properties of hypercube such as high complexity at higher levels. The CCT
may also be considered in this category as the number of nodes could be arranged in a
number of dimensions fewer than that of hypercube architecture. These networks shape
 Properties and Performance of Linearly Extensible Multiprocessor Interconnection 7

Fig. 5. 6-node linearly extensible cube.

P0 P1

P2 P3

P4 P5

P6 P7

Fig. 6. 8-node linear crossed cube.

are like cube-based architecture, but they posses the properties of linearly extensible
architectures. The two famous topologies are linearly Extensible Cube (LEC) and
Linear Cross Cube (LCQ) [10, 11] shown in Figs. 5 and 6 respectively.

3 Comparative Study

The performance of various interconnection networks could be evaluated analytically

by considering various topological parameters and experimentally by applying
appropriate scheduling scheme on them. In this section the topological properties of
linearly extensible multiprocessor networks are described. The performance based on
simulation is discussed in the next section.
8 S. Gautam and A. Samad

3.1 Number of Nodes

One of the most important parameter to judge the complexity of network is number of
nodes allowed at higher level of architecture. Number of nodes also plays significant
role in the performance of network. For instance the CCT and FAT networks consumes
lesser execution time with large number of nodes (i.e. more than 64) however, at the
cost of greater complexity. The LET, LEC, LCQ and LED has reasonable number of
processors at higher levels.

3.2 Node Degree

The degree of a network means the number of links at a particular node. Larger number
of links may also make the network complex such as hypercube. In order to make the
network simple and to reduce complex routing, small node degree is desirable. In CCT,
effort is made to reduce the number of links. LEC and LCQ have constant node degree
of 4. LED has smaller degree in general, however, at an individual node it is increasing
at each level which makes the network complex at higher levels.

3.3 Diameter
It is the maximum shortest path between any pair of distinct vertices. Interestingly LED
has a constant value of diameter at all level of architectures. The LET, LEC and LCQ
has lower diameter which ultimately reduces the communication cost. The CCT has an
average value of diameter.

3.4 Extensibility
In order to extend the existing network it is must that it should preserve all the desirable
topological properties and achieve better performance with the increase in the number
of nodes in it. Cube-based networks have a common drawback of exponential
expansion. Since FAT and CCT are more closer to cube, they result high complexity at
higher level. LEC has a constant expansion with 2 nodes at a level and LET and LED
has linear expansion. The summary of parameters is demonstrated in Table 1.

Table 1. Topological parameters of linearly extensible networks

Name of architectures Number of nodes Degree Diameter Cost
LET N P 4 √N 4√N
N= k
k=1
LEC N=2*n 4 └N┘ 4
└N┘
P
LCQ k 4 (└√N┘) 4(└√N┘)
LED N P N−1 2 2(N − 1)
N= k
k=3
 Properties and Performance of Linearly Extensible Multiprocessor Interconnection 9

3.5 Cost
Cost can be measured in different ways. When simulating a network cost may represent
number of communication steps. However, the overall communication depends upon
the topological characteristics of a network. The most effective parameters for cost are
diameter and degree. Taken these parameters into consideration the cost of similar
architectures is evaluated and depicted in Fig. 7. The results in the given graph
demonstrate similar behavior of increments in cost when architectures are extended to
higher levels.

Cost Vs. Level

45
40
35
30 LEC
25 LCQ
Cost

20 LET
15 LEΔ
10
5
0
1 2 3 4 5 6 7 8 9 10
Level

Fig. 7. Cost analysis of different interconnection networks.

4 Performance Evaluation

Task scheduling has an important role to assess the performance of parallel systems.
An efficient task scheduling is the key of effective utilization of nodes to execute
parallel applications. The literature is full with enormous work related the problem of
scheduling. The scheduling problem has been tackled using different approaches on
different architectures/topologies [15–17, 19]. In general problem of task scheduling on
tree type architectures is NP-hard. As a solution to the scheduling problem on linearly
extensible networks the Two Round Scheduling (TRS) scheme is taken into consid-
eration [18, 20]. The TRS algorithm is based on minimum distance property; however,
it covers the entire network for exchanging the tasks with two hopes by considering one
intermediate node in communication. Although it requires traveling one extra hop by
the tasks still this mechanism helps in reducing the load imbalance. The performance of
various linearly extensible networks studies in this paper is evaluated in terms of load
balance accuracy when TRS algorithm is applied on them. To calculate load balance
accuracy the average load on the network is evaluated first. The average load is
10 S. Gautam and A. Samad

calculated as T/N, where T is the total number of tasks at a particular level and N is the
number of nodes available in the network. Keeping the network size same the simu-
lation is carried out in order to compare the accuracy of load balance.
Figure 8 shows a comparison of load balance accuracy of various networks against
different set of tasks represented by levels. In general the performance of parallel
scheduling when applied on tree is limited to certain range beyond which the cost
increases due to more distance between under loaded and over loaded nodes. On the
other hand cube-based networks consume lesser steps for load migration since the same
numbers of processors are arranged in fewer dimensions.

Performance of Linear Networks

60
Load Balance Accuracy (%)

50
40 LCQ
LEC
30
LET
20 LEΔ
10

0
1 2 3 4 5 6 7 8 9
No. of levels

Fig. 8. Performance of different interconnection networks.

The attained results are depicted in Fig. 8, which make it evident that approxi-
mately the similar accuracy is achieved by both tree type networks as well as hybrid
networks. This refers to the fact that hybrid networks inherit the properties of tree type
architectures. In particular the LED network has fast rate of balancing and produces
better results at higher stages of task structure. This is due to increasing node degree in
LED at higher levels. The CCT and FAT networks are not taken into consideration as
they consist of larger number of nodes at first level of architecture.

5 Conclusion

A new class of interconnection topology knows as linearly extensible network has been
studied and discussed. These networks inherit the desirable properties of tree archi-
tectures as well as cube-based architectures. The major advantage of these networks is
their simple structure when extended to higher levels. The effectiveness of these net-
works is approved in this paper by carrying out analytical study.
 Properties and Performance of Linearly Extensible Multiprocessor Interconnection 11

The performance, however, is evaluated experimentally by applying appropriate

scheduling algorithm on them. The TRS scheme which is originally designed for such
networks is considered and applied on different linearly extensible architectures and
load balance accuracy is evaluated to judge the performance of these networks. Sim-
ulation results show that same degree of accuracy is achieved on both tree type
architectures as well as on those which have more characteristics of cube-based
architectures. For better results a new algorithm could be investigated particularly for
linearly extensible networks.

References
1. Koibuchi, M., Fujiwara, I., Matsutani, H., Casanova, H.: Layout-conscious random
topologies for HPC off-chip interconnect. In: 19th International Conference on High-
Performance Computer Architecture (HPCA), pp. 484–495 (2013)
2. Le, N.T., Nguyen, V.K.: Interconnection networks with efficient custom routing, exploiting
small-world effect. In: IEEE International Conference on Computing and Communication
Technologies-Research, Innovation, and Vision for the Future (RIVF), pp. 41–46 (2013)
3. Prasad, N., Mukkherjee, P., Chattopadhyay, S., Chakrabarti, I.: Design and evaluation of
ZMesh topology for on-chip interconnection networks. J. Parallel Distrib. Comput. 113, 17–
36 (2018)
4. Monemizadeh, M., Azad, H.S.: The necklace-hypercube: a well scalable hypercube-based
interconnection network for multiprocessors. In: ACM Symposium on Applied Computing,
pp. 729–733 (2005)
5. Mohanty, S.P., Ray, B.N., Patro, N.S., Tripathy, A.R.: Topological properties of a new fault
tolerant interconnection network for parallel computer. In: Proceeding of ICIT International
Conference on Information Technology, pp. 36–40 (2008)
6. Khan, Z.A., Siddiqui, J., Samad, A.: Topological evaluation of variants hypercube network.
Asian J. Comput. Sci. Inf. Technol. 3(9), 125–128 (2013)
7. Alam, M., Varshney, A.K.: A comparative study of interconnection network. Int. J. Comput.
Appl. (0975-8887) 127(4), 37–43 (2015)
8. Patelm, A., Kasalik, A., McCrosky, C.: Area efficient VLSI layout for binary hypercube.
IEEE Trans. Comput. 49(2), 160–169 (2006)
9. Khan, Z.A., Siddiqui, J., Samad, A.: Performance analysis of massively parallel architec-
tures. BVICAM’s Int. J. Inf. Technol. 5(1), 563–568 (2013)
10. Samad, A., Rafiq, M.Q., Farooq, O.: LEC: an efficient scalable parallel interconnection
network. In: Proceeding of International Conference on Emerging Trends in Computer
Science, Communication and Information Technology, Nanded, India, pp. 453–458 (2010)
11. Khan, Z.A., Siddiqui, J., Samad, A.: Linear crossed cube (LCQ): a new interconnection
network topology for massively parallel architectures. Int. J. Comput. Netw. Inf. Sci.
(IJCNIS) 7(3), 18–25 (2015). ISSN/ISBN NO: 2074-9090
12. Manullah: A D-based linearly extensible multiprocessor network. Int. J. Comput. Sci. Inf.
Technol. 4(5), 700–707 (2013)
13. Ding, Z., Hoare, R.R., Jones, K.A.: Level-wise scheduling algorithm for fat tree
interconnection networks. In: Proceedings of the 2006 ACM/IEEE SC|06 Conference (SC
2006), pp. 9–17 (2006)
14. Mahafzah, B.A., Jaradat, B.A.: The hybrid dynamic parallel scheduling algorithm for load
balancing on chained-cubic tree. J. Supercomput. 52, 224–252 (2010)
12 S. Gautam and A. Samad

15. Dutot, P.: Complexity of master-slave tasking on heterogeneous trees. Eur. J. Oper. Res. 164
(3), 690–695 (2005)
16. Haung, K., Wang, Z., Weng, X., Lin, W.: A scheduling algorithm on heterogeneous star and
tree grid computing platform. In: International Conference on Convergence Information
Technology, pp. 347–351. IEEE (2007). https://doi.org/10.1109/icct.2007.275
17. Birmpilis, S., Aslanidis, T.: A critical improvement on open shop scheduling algorithm for
routing in interconnection networks. Int. J. Comput. Netw. Commun. (IJCNC) 9(1), 1–19
(2017)
18. Samad, A., Khan, Z.A., Siddiqui, J.: Optimal dynamic scheduling algorithm for cube based
multiprocessor interconnection networks. Int. J. Control Theory Appl. 9(40), 485–490
(2016)
19. Mohammad, S.B., Ababneh, I.: I Improving system performance in non-contiguous
processor allocation for mesh interconnection networks. Int. J. Simul. Model. Pract. Theory
80, 19–31 (2018)
20. Samad, A., Rafiq, M.Q., Farooq, O.: Two round scheduling (TRS) scheme for linearly
extensible multiprocessor systems. Int. J. Comput. Appl. 38(10), 34–40 (2012)
 An Analysis on Improvement of Lifetime
in Wireless Sensor Network

Shubhi Malhotra(&), Shushant Kumar Jain, and Vineet Shrivastava

Department of Electronics and Communication Engineering,

Institute of Technology and Management Gwalior, Gwalior, M.P., India
shubhimalhotra@rocketmail.com,
shushant.or.jain@gmail.com,
mr.veenit.shrivastav@itmgoi.in

Abstract. Wireless sensor networks (WSNs) are uncommon networks wherein

nodes are furnished to study the tangible world by abundant minute, economical
and intelligent sensor nodes(junction) scattered across required field of interest.
All of sensor nodes are independently self-reliant in detecting, strategy and
wirelessly specific surroundings situations at the base station (BS). Clustering is
the form of grouping nodes into clusters and LEACH is mainly used in cluster
formation in which it regularly change the cluster head to send the data towards
destination. MTE algorithm is also useful in multihop environment for trans-
mitting data from one cluster head to another and distance is calculated to send
the data accurately. In the existing approach, they used hybrid technique like
multi-hop and clustered routing technique to diminish energy consumption this
is based totally on LEACH and minimum transmission energy (MTE) protocols
for distributing facts to the BS. In our proposed work, we improve the network
performance by forwarding the data to the nearby Cluster Head (CH). This get
better the consumption of energy at each node if the distance of the node is
larger to transmit it towards the BS.

Keywords: WSN
Base station
Node
Energy

Cluster based routing algorithm
Cluster head
LEACH and MTE

1 Introduction

WSNs are unrecognized correspondence shape that makes utilization of a massive

variety of self competent sensor nodes, to shape a network. Every node in a WSN is
prepared for detecting environment, processing locally the records and sending it to one
or more prominent assortment of goals through a wireless link (Fig. 1).
WSNs or sensors are hardware devices that are small in length, utilize low energy,
feature in excessive densities, are self reliant and trademark dismissed, and are robust to
the climate. The chronic analog sign got from the sensors is changed over through
method for an analog-to-digital converter into digitized sign and sent to controllers for
in like manner dealing with [1]. There are various other networks which have different
security requirements and challenges to overcome the problems [2].

© Springer Nature Singapore Pte Ltd. 2019

S. Verma et al. (Eds.): CNC 2018, CCIS 839, pp. 13–23, 2019.
https://doi.org/10.1007/978-981-13-2372-0_2
14 S. Malhotra et al.

Fig. 1. WSN architecture

2 Classification of Custer Based Routing Algorithm in WSNs

Clustering algorithms play a pivotal role in reaching software specific goals. Cluster
based routing algorithms are characterized into 3 wide classes as appeared in Fig. 2.
The protocols mentioned underneath schemes are in brief discussed in this text [14].
(a) Block Cluster based Routing Algorithms
(b) Grid Cluster based Routing Algorithms.

3 Leach (Low Energy Adaptive Clustering Hierarchical

Routing Protocol)

LEACH is oneself- devise with reconstructable cluster grounded routing protocol. This
uses hierarchical procedure to pass on the data. Data is grouped and sended to the BS.
Each and every one of the points is confined to the groups of invariant size and the CH

Cluster
Cluster

Cluster Cluster

Base
Station

Fig. 2. Clustering
 An Analysis on Improvement of Lifetime in Wireless Sensor Network 15

is investigated each group [3]. All junctions gather the real data and sent to its specific
CH utilizing TDMA motivation [4].
CHs will other than propagate the data to the BS. Vitality will be depleted, if a
proximity junction will holdout the CH and that CH junction will fail miserable which
will decrease the life being of the network. T + o stay away from this kind of condition
a substitute center point is picked as a CH after each cycle of working and criticalness
will be stabilized. LEACH settlement has below fundamental operations:
• Framework building stage
• Data correspondence stage
• Building stage: In the building stage neighbour junctions form a group consistently
and a CH is chosen randomly from that group of junctions for each cluster. In this
stage a number in between 0 and 1 is picked arbitrarily, while building groups and
the very same is separated and a limit, t(s). The junction is called as a CH in the
ongoing cycle, if picked esteem < t(s); something other than what’s expected, the
node stays as a member node. The limit t(s) is enrolled by utilizing condition [5–7].

4 Literature Survey

Nayak et al. in this study, WSNs have been utilized as a part of numerous zones like
health care, agriculture, defense, military, disaster hit areas and so on [8].
Sharma et al. this paper proposes another methodology i.e. manufactured artificial
bee colony is an swarm based totally optimization technique for energy efficient routing
algorithm and the compressive sensing is likewise used to growth the energy rate or
overall performance [9].
Singh et al. this paper proposes a new procedures i.e. artificial bee colony is an
swarm fundamentally based optimization procedure for energy efficient routing algo-
rithm and the compressive sensing is likewise used to increase the energy rate or
overall performance [10].
Dayanand et al. in this study, another hybrid algorithm is proposed which fuses
each allotted and centralized algorithms for determination of the cluster head
(CH) [11].
Baroudi et al. on this work, they propose a realistic system, suggested as wirelessly
energy - charged WSN (WINCH), for battery upkeep; it includes energizing. This
structure coordinates a routing process in which the CHs are chosen ideally [12].
Sharma et al. in this study, they have considered traffic heterogeneity, and analyzed
its impact on well known hierarchical clustering based routing algorithm in the area.
Also, they’ve got proposed a stepped forward CH selection mechanism beneath the
traffic heterogeneous scenario [13].
16 S. Malhotra et al.

5 Proposed Work

The formation of clusters in WSNs is a proficient planning toward the arrangement of

nodes in the sensor n/w effectively. LEACH will permit efficient stability which is
ordinarily used clustering protocol in which CHs and their appended starting nodes are
irregularly changed. On the other hand, LEACH entails all starting nodes to passing
their information to the related CHs at once which influence energy of starting nodes
due to the tremendous fee for lengthy distance transmissions. Consequently, source
nodes which are at from the CH deplete their power rapidly than different nodes. To
determine the constraint of energy, they planned the method which utilized multiple
hop for inter-nodes conversation the usage of minimum transmission energy
(MTE) algorithm in which starting nodes ahead their data to the CHs through midway
nodes inner every cluster. Every starting node inside the cluster forwards. Its message
to the connecting node while in transit to the CH so as to decrease the energy of
transmission. In the present approach, the MTE algorithm used to produce a cluster
with straight direction among nodes right down to their CH till the data reached to
destination. This route is designed the use of Dijkstra’s straight route routing algorithm
and nodes deliver their observed information to the CH with propagation for multiple
hop. Each non-CH node needs to communicate their data to its near successor inside
the route to arrive at his CH. Correspondence is the aim of the critical exhaustion of
battery’s energy, because of reality that SN (Sensor Nodes) consumes a lot of its
vitality in transmission and gathering of data. The MTE algorithm used to generate a
cluster with smallest direction between nodes all the way down to their CH till the
packet arrived at to BS. This route is designed the use of Dijkstra’s shortest route dispel
(routing) algorithm and nodes deliver their suspected information to the CH with multi-
hop propagation. Every non-CH junction have to spread its packet to its proximity
inheritor in the course to attain his CH. disclosure is the principle motive of the sizeable
depletion of battery’s strength, due to the reality that junction node waste a large
quantity of its energy in information communication and receipt.
Unlike communique, data processing uses smaller quantity energy. For this pur-
pose, every node accepts data packet from its inheritor. Inside the manner to perform
the data blend and condenses the packet earlier than sending it to the next node in line
till it arrives at the CH. When a CH gets statistics from all other junction nodes, it plays
numerous crucial signal handling skills on the data to clump and reduce it. In this
phase, the junctions gather and transmit discovered data to the CH. The CH sent the
obtained data straightly in the direction of BS. We improved forward the above
drawback with our proposed method and enhance the energy utilization of nodes to
augment the time being of the network (Fig. 3).
Proposed Algorithm
Step:1 Start
Step:2 Initialize the network
Step:3 Place the sensor junctions randomly in the network
Step:4 Divide the whole network into 4 grids of similar size
Another random document with
no related content on Scribd:
have been previously done, the shorter length is no disadvantage.
For fine work the cap-iron of this plane may be set as close as one
thirty-second of an inch to the cutting edge of the plane-iron. The
plane-iron should be set correspondingly shallow.

Fig. 51.

23. The Jointer.—This plane is used for straightening long and

uneven stock. It is most commonly used for
preparing the parts for glue joints. Fig. 52.
 Fig. 52.

Its advantage lies in its length, often two feet or more, which
prevents the blade from cutting in the hollow places until all of the
high places have been leveled. A short plane would simply follow the
irregularities, smoothing but not straightening. The plane-iron of the
jointer should be ground straight across.
Fore-planes are short jointers, next in size to the jack-planes, and
are used for such work as straightening the edges of doors,
windows, etc., when fitting them.
24. The Block-Plane.—The block-plane is about six inches long.
Fig. 53. It is made especially for cutting
across the end of the wood. In addition to the adjusting nut, which is
in a different position but serves the same purpose as in the jack-
plane, and the lateral adjusting lever, there is a lever for adjusting the
size of the opening at the mouth of this plane.
 Fig. 53.

The block-plane differs from the planes just described in that it has
no cap-iron, none being needed in end-planing. The plane iron is put
in place with the bevel side up instead of down as in the other
planes.
The block-plane is not a necessity where a vise can be used for
holding the piece to be planed. A smooth-plane or jack-plane may, if
the plane-iron be set very shallow, do the work just as well. The
block-plane is used mostly by carpenters in fitting together pieces
which cannot be taken to the vise. Here the smallness of the plane
and the fact that but one hand is needed to operate it are of very
great advantage.
25. The Wooden Plane.—The old-fashioned wooden planes are
still preferred by some woodworkers. The
iron bodied planes have displaced them because of the ease with
which they can be adjusted rather than because they produce any
better results. Wooden planes are subject to warpage and as the
bottoms become uneven thru wear, it is necessary to straighten and
level them occasionally. The plane-iron and cap-iron of the wooden
plane are fastened in the throat of the plane by means of a wooden
wedge. This wedge is driven in place with the hammer. Fig. 54
shows the manner of holding the plane while setting the irons and
wedge. If the plane-iron does not project enough, the iron is lightly
tapped as indicated. If too much projects, the stock is tapped as in
Fig. 55. This figure also illustrates the manner of removing the
wedge, two or three blows being sufficient to release it so that it can
be withdrawn with the hand. In setting the plane-iron, should either
corner project more than the other, tap the side of the iron.

Fig. 54. Fig. 55.

 Fig. 56.

Fig. 56 shows the manner of holding the smooth plane in releasing

the wedge, as well as when the cutting edge projects too much.
26. Planing First Surface True.—A true surface is one which is
straight as to its length and width
and which has its surface at the four corners in the same plane.
Select for this first surface, which we shall call the face side, the
better of the two broad surfaces. Knots, sap, wind, shakes, etc.,
should there be any, must be taken into account when passing
judgment. Often the two sides are so nearly alike that there is little
reason for choice.
Where several parts are to be fitted together, the faces are turned
in; in this case, the best surfaces should not be selected for faces.
Chapter VII, section 75.
 Fig. 57. Fig. 58.

Before beginning to plane hold the piece toward the light, close
one eye and sight as in Fig. 57. If the surface is not warped or in
wind, the back arris ab will appear directly behind the front arris cd.
Also sight the arrises for straightness, Fig. 58, being careful to hold
so as to get the full benefit of the light. Again, test from arris to arris,
Fig. 59. The try-square may be used either side up, but the beam
must not be held against either edge. It is not for squareness but for
straightness that this test is made.

Fig. 59.

Notice the direction of the grain and place the piece so as not to
plane against it. In Fig. 60 plane from A toward B or the surface will
be roughened instead of smoothed. When the stock is rough, the
direction of the grain cannot be told readily. A few strokes of the
plane will give the desired information. As most stock is to be planed
to size, it is well to test with the rule before beginning to plane, so as
to know just how much margin has been allowed. If you find you
cannot true this first surface without getting the piece within one-
sixteenth of an inch of the thickness required, ask your instructor to
show you where the trouble lies.

Fig. 60.

These tests ought to give the worker a pretty fair idea of what and
how much he dare plane, so that when he begins he may work
intelligently. As few shavings as possible, and those thin ones, with
the proper result attained, show forethought and care. Nowhere can
good, common sense be used to better advantage than in learning to
plane.
When planes are not in use they should be laid on their sides, or
otherwise placed so that the cutting edge shall not touch anything.
For roughing off and straightening broad surfaces, the jack-plane
should be used, and this followed by the smooth-plane.
When using the plane, stand with the right side to the bench; avoid
a stooping position. Fig. 61. The plane should rest flat upon the
wood from start to finish. Press heavily upon the knob in starting and
upon the handle in finishing the stroke. Unless care is taken to hold
the plane level in starting and stopping, the result will be as indicated
in Fig. 62 A.
 Fig. 61. Fig. 62.

Take as long a shaving as the nature of the work will permit. In

planing long boards or where it is desired to lower one particular
place only, it becomes necessary to stop the stroke before the end of
the board is reached. That no mark shall show at the place where
the plane-iron is lifted, it is necessary to feather the shaving. This is
done by holding the toe of the plane upon the board and raising the
heel as the stroke proceeds, beginning just before the stopping point
is reached. If the cut is to commence other than at the end of the
piece, lower the heel after having started the forward stroke with the
toe upon the board.
It is customary to raise the heel of the plane slightly on the
backward stroke that the edge may not be dulled.
When the surface has been planed so that it fulfills the tests by
sighting described above, an additional test may be given it. Should
the board be of any considerable width—three or more inches—the
following test will prove sufficient: Place a straight-edge lengthwise,
then crosswise the surface planed and along each of its two
diagonals. If no light can be seen between the piece and the straight-
edge in any of these four tests, the surface may be considered level
or true. Fig. 63.

Fig. 63.

Fig. 64.
 A second test, one which will answer for narrow as well as broad
surfaces, differs from the above only in the manner of determining
whether the surface is in wind or not. Two sticks, called winding
sticks, are prepared by planing their two opposite edges straight and
parallel to each other. These sticks are placed across the surface to
be tested, close to the ends, and a sight taken over their top edges.
If the surface is in wind the edges cannot be made to sight so that
one edge will appear directly back of the other, Fig. 64; one end of
the back stick will appear high, at the same time the other one will
appear low with reference to the edge of the fore stick. The back
corner is high only as compared with the fore corner. The wind may
be taken out of the surface just as well by planing the fore corner
which is diagonally opposite. Usually, equal amounts should be
planed from the surface at each of these corners. If, however, the
board is thicker at one corner than the other, it is best to take the
whole amount at the thicker corner.
27. Face Side, Face Edge.—The first surface and the first edge
planed serve a special purpose and
are given special names. The first surface is called the face side,
and the first edge, the face edge; both may be referred to as the
faces. These faces are sometimes known by other names such as
working face and joint edge, marked face and marked edge, etc., but
their meaning is the same.
 Fig. 65.

That these faces may be known, they are marked with pencil with
what are called face marks. There are various ways of making face
marks. Unless otherwise instructed, the marks may be made as in
Fig. 65; for the face side, a light slanting line about one inch long
extending to the edge which is to become the face edge; for the face
edge, two light lines across the edge. The marks on both face side
and face edge should be placed about the middle of the piece and
close together.
These two surfaces are the only ones marked. From one or the
other of these, measurements and tests are made. In squaring up
stock, for illustration (which means to reduce a piece of rough lumber
to definite length, width and thickness so that it shall have smooth,
flat sides at right angles to each other) the gage block is held against
one or the other of these faces only, and the beam of the try-square
when testing for squareness is placed against one or the other of
these faces only.
28. Planing First Edge Square with Face Side.—Make a
preliminary test
with the eye before beginning to plane. Sight the arrises of the edge
to see where it needs straightening. Examine the end to see which
arris is high. Also look to see which way the grain runs. Avoid
imperfections in the wood as far as possible in choosing this edge.
 It is the part of wisdom to examine the plane-iron to see that the
surface planing has not caused the cutting edge to project unevenly.
A plane, set out of true, is likely to cause hours of extra work; it
defeats every effort that may be made to hold the plane properly.
Strive to get shavings the full length of the piece, especially on the
last few strokes.
The smooth-plane is little if ever used for edge planing on account
of its short length. In using the jack-plane in which the edge is
slightly rounded, thus making a shaving thicker in the middle than at
the edges, avoid tilting the plane to make it cut on one side rather
than the other. Move the whole plane over to the high side so that
the middle of the cutting edge shall be directly over the high place.
Keep the sides of the plane parallel with the edge so as to get the full
benefit of the length of the plane.
The two tests which this first edge must fulfill are: First, that it shall
be straight; second, that it shall be square with the face side. Fig. 6,
Chapter I, shows the method of testing for squareness. As in planing
the face side, try to accomplish the desired result with as few
shavings as possible.
The caution about planing the first surface, where a definite size is
to be attained, applies equally to planing the first edge.
When the edge has been properly trued, put on the face marks
suitable for the face edge.
29. Finishing the Second Edge.—A line gaged from the face
edge indicates the proper
stopping place in planing the second edge. This line, if lightly made,
should be half planed off.
As the line is parallel with the face edge, no straight edge test is
necessary. The try-square test for squareness, the beam being held
against the face side, must be frequently applied when approaching
the gage line.
Where the amount of waste stock to be planed is about an eighth
of an inch, the plane-iron may be set a little deeper than average.
When near the line, however, it must be set quite shallow. If the
waste stock measures more than three sixteenths of an inch, the rip-
saw should be used, sawing parallel to the gage line and about one-
eighth of an inch away from it.
 30. Finishing the Second Side.—Lines gaged from the face side
on the two edges show the
amount to be planed.
The test for this side is made by placing the straight-edge across
the piece from arris to arris as the planing proceeds, to see that the
middle shall be neither high nor low when the gage lines have been
reached. No other test is necessary; a little thought will show the
reason.
Never attempt to work without lines. If by mistake you plane out
your line, take the piece to your instructor at once, unless you have
been otherwise directed, that he may tell you what to do.
31. Planing the First End Square.—See that the cutting edge is
very sharp and that the plane-
iron is set perfectly true and very shallow. Examine one of the ends
of the piece by placing the beam of the try-square against the face
side then against face edge to locate the high places. Fig. 6.

Fig. 66.

In free end planing, the cutting edge must not be allowed to reach
the farther corner or the corner will be broken off. Plane only part
way across the end, stopping the cutting edge half an inch or more
from the far edge. Fig. 66. After a few strokes in this direction,
reverse the position and plane in the opposite direction, stopping the
cutting edge half an inch or more of the first edge.
Keep testing the end as the planing proceeds that you may know
what you are doing. Remove no more material than is necessary to
square the end, and lay on the rule occasionally that you may not
endanger the correct length in your efforts to square this end.
32. Finishing the Second End.—Knife lines squared entirely
around the piece, at a given
distance from the end first squared, limit the amount of the planing
that can be done on this end. If the waste stock is over one-eighth of
an inch the saw should be used to remove all but a thirty-second of
an inch before beginning to plane. Watch the lines. If you are
uncertain as to their accuracy, test this end as you did the first one.
33. End Planing with the Shooting Board.—Fig. 67 illustrates a
way in which the ends
of narrow pieces may be easily squared. The plane is pressed to the
shooting board with the right hand. The left hand holds the piece
against the stop and to the plane.

Fig. 67.
 The face edge of the piece should be held against the stop; the
wood must not be allowed to project beyond the stop. If it does, the
corners, being unsupported, will be broken away as in free planing
when the cutting edge is accidentally shoved entirely across the
piece.

Fig. 68.

The bench hook makes an admirable shooting board. Fig. 68.

34. Rules for Planing to Dimensions.
1. True and smooth a broad surface; put on a face mark. This
becomes the face side.
2. Joint (straighten and square) one edge from the face side; put
on a face mark. This becomes the face edge.
 3. Gage to required width from the face edge, and joint to the gage
line.
4. Gage to required thickness on both edges from the face side;
plane to the gage lines.
5. Square one end from the face side and face edge.
6. Lay off with knife and square the required length from the
squared end; saw to the knife line.

Fig. 69. Fig. 70.

 Fig. 71.

35. Planing a Chamfer.—Fig. 69 illustrates a good way to lay out

a chamfer. A notch in the back end of the
gage-stick holds the pencil in position. Holding pencil in this way
draw lines on face and edge indicating width of the chamfer. Fig. 70
illustrates the manner of block planing a chamfer, the piece being
held on the benchhook. Where the piece can be placed in the vise,
Fig. 71 illustrates the method of planing a chamfer with one of the
larger planes. First, plane the chamfers which are parallel to the
grain; then the ends. If the plane-iron is sharp and set shallow, it can
be run entirely across without danger of splitting the corners.
 Fig. 72.

Hold the plane parallel to the edge in planing with the grain. Swing
it to an angle of about forty-five degrees in end chamfering, but move
it parallel with the edge, and not with the length of the plane.
The eye will detect inaccuracies in planing. If further test is
desired, Fig. 72 illustrates one.
 CHAPTER IV.
Boring Tools—Boring.

36. Brace or Bitstock.—Fig. 73 illustrates a common form of

brace. This tool is used for holding the
various kinds of bits which are used in boring, reaming, etc.
The ratchet brace consists of essentially the same parts but in
addition has an attachment which permits of the crank’s acting in
one direction or the other only. It is a necessity where the crank
cannot make an entire revolution, and is very convenient for boring
in hard wood, or for turning large screws.

Fig. 73. Fig. 74.

 To insert a bit, hold the brace firmly with the left hand, revolve the
crank until the jaws are opened far enough to allow the bit tang to
pass entirely within so that the ends of the jaws shall grip the round
part—the shank of the bit. Still firmly holding the brace, revolve the
crank in the opposite direction until the bit is firmly held. Fig. 74.
37. Center Bit.—The old fashioned center bit, Fig. 75, is still used
by carpenters for certain kinds of work. It has, for
the most part, given way to the more modern auger bit.

Fig. 75.

38. The Auger Bit.—The auger bit, Fig. 76, is used for all ordinary
boring in wood. The action of an auger bit is
readily understood by referring to Fig. 76. The spur draws the bit into
the wood. The two nibs cut the fibers, after which the lips remove the
waste, later to be passed along the twist to the surface.

Fig. 76.

Auger bits are usually supplied in sets of thirteen, in sizes varying

from one-fourth of an inch to one inch, by sixteenths.
The size of hole that an auger bit will bore can be told by looking
at the number on the tang or shank. If a single number, it is the
numerator of a fraction whose denominator is sixteen, the fraction
referring to the diameter of the hole which the bit will bore.