Clustering and Routing Algorithms for

Wireless Sensor Networks Energy

Efficiency Approaches 1st Edition
Pratyay Kuila
Visit to download the full and correct content document:
https://textbookfull.com/product/clustering-and-routing-algorithms-for-wireless-sensor-
networks-energy-efficiency-approaches-1st-edition-pratyay-kuila/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Mobile Wireless and Sensor Networks A Clustering

Algorithm for Energy Efficiency and Safety 1st Edition
Amine Dahane (Author)

https://textbookfull.com/product/mobile-wireless-and-sensor-
networks-a-clustering-algorithm-for-energy-efficiency-and-
safety-1st-edition-amine-dahane-author/

Energy-efficient wireless sensor networks 1st Edition

Vidushi Sharma

https://textbookfull.com/product/energy-efficient-wireless-
sensor-networks-1st-edition-vidushi-sharma/

Algorithms for Sensor Systems 15th International

Symposium on Algorithms and Experiments for Wireless
Sensor Networks ALGOSENSORS 2019 Munich Germany
September 12 13 2019 Revised Selected Papers Falko
Dressler
https://textbookfull.com/product/algorithms-for-sensor-
systems-15th-international-symposium-on-algorithms-and-
experiments-for-wireless-sensor-networks-algosensors-2019-munich-
germany-september-12-13-2019-revised-selected-papers-falko/

Algorithms for Sensor Systems 16th International

Symposium on Algorithms and Experiments for Wireless
Sensor Networks ALGOSENSORS 2020 Pisa Italy September 9
10 2020 Revised Selected Papers Cristina M. Pinotti
https://textbookfull.com/product/algorithms-for-sensor-
systems-16th-international-symposium-on-algorithms-and-
experiments-for-wireless-sensor-networks-algosensors-2020-pisa-
Randomly Deployed Wireless Sensor Networks 1st Edition
Xi Chen

https://textbookfull.com/product/randomly-deployed-wireless-
sensor-networks-1st-edition-xi-chen/

Security in Wireless Sensor Networks 1st Edition George

S. Oreku

https://textbookfull.com/product/security-in-wireless-sensor-
networks-1st-edition-george-s-oreku/

Wireless Sensor Networks: Deployment Strategies for

Outdoor Monitoring 1st Edition Fadi Al-Turjman

https://textbookfull.com/product/wireless-sensor-networks-
deployment-strategies-for-outdoor-monitoring-1st-edition-fadi-al-
turjman/

Deploying Wireless Sensor Networks. Theory and Practice

1st Edition Mustapha Reda Senouci

https://textbookfull.com/product/deploying-wireless-sensor-
networks-theory-and-practice-1st-edition-mustapha-reda-senouci/

Congestion Control for 6LoWPAN Wireless Sensor

Networks: Toward the Internet of Things Hayder Al-
Kashoash

https://textbookfull.com/product/congestion-control-for-6lowpan-
wireless-sensor-networks-toward-the-internet-of-things-hayder-al-
kashoash/
 CLUSTERING
AND ROUTING
ALGORITHMS
FOR WIRELESS
SENSOR
NETWORKS
Energy Efficient
Approaches
 CLUSTERING
AND ROUTING
ALGORITHMS
FOR WIRELESS
SENSOR
NETWORKS
Energy Efficient
Approaches

Pratyay Kuila
Prasanta K. Jana
CRC Press
Taylor & Francis Group
6000 Broken Sound Parkway NW, Suite 300
Boca Raton, FL 33487-2742

© 2018 by Taylor & Francis Group, LLC

CRC Press is an imprint of Taylor & Francis Group, an Informa business

No claim to original U.S. Government works

Printed on acid-free paper

Version Date: 20170823

International Standard Book Number-13: 978-1-4987-5382-1 (Hardback)

This book contains information obtained from authentic and highly regarded sources. Reasonable
efforts have been made to publish reliable data and information, but the author and publisher cannot
assume responsibility for the validity of all materials or the consequences of their use. The authors and
publishers have attempted to trace the copyright holders of all material reproduced in this publication
and apologize to copyright holders if permission to publish in this form has not been obtained. If any
copyright material has not been acknowledged please write and let us know so we may rectify in any
future reprint.

Except as permitted under U.S. Copyright Law, no part of this book may be reprinted, reproduced,
transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or
hereafter invented, including photocopying, microfilming, and recording, or in any information
storage or retrieval system, without written permission from the publishers.

For permission to photocopy or use material electronically from this work, please access
www.copyright.com (http://www.copyright.com/) or contact the Copyright Clearance Center, Inc.
(CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization
that provides licenses and registration for a variety of users. For organizations that have been granted
a photocopy license by the CCC, a separate system of payment has been arranged.

Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and
are used only for identification and explanation without intent to infringe.
Visit the Taylor & Francis Web site at
http://www.taylorandfrancis.com
and the CRC Press Web site at
http://www.crcpress.com
Dedicated to my parents.
Pratyay Kuila

Dedicated to my wife, Mrs.Tanusree Jana,

and my daughter, Ms.Purbasha Jana.
Prasanta K. Jana
Contents

Preface xiii

Who Can Use This Book xv

About the Authors xvii

Acknowledgments xix

Organization of the Book xxi

List of Tables xxiii

List of Figures xxv

List of Algorithms xxix

1 Introduction 3

1.1 Background of wireless sensor networks . . . . . . . . . . . . . . 3

1.2 Structure of sensor nodes . . . . . . . . . . . . . . . . . . . . . . . 4
1.3 WSN architecture . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.4 WSNs vs. ad-hoc networks . . . . . . . . . . . . . . . . . . . . . . 8
1.5 Challenges in WSNs . . . . . . . . . . . . . . . . . . . . . . . . . 9
1.6 System models . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
1.6.1 Network model . . . . . . . . . . . . . . . . . . . . . . . . 10
1.6.2 Energy model . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.6.3 Fault model . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.7 Clustering and routing algorithms . . . . . . . . . . . . . . . . . . 13
1.7.1 Challenges in WSN clustering . . . . . . . . . . . . . . . . 14
1.7.2 Challenges in WSN routing . . . . . . . . . . . . . . . . . 15

2 WSN Applications 19

2.1 Forest fire detection . . . . . . . . . . . . . . . . . . . . . . . . . 19

2.2 Flood detection . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
2.3 Tsunami detection . . . . . . . . . . . . . . . . . . . . . . . . . . 20
2.4 Home applications . . . . . . . . . . . . . . . . . . . . . . . . . . 20

vii
viii Contents

2.5 Agricultural applications . . . . . . . . . . . . . . . . . . . . . . . 21

2.6 Traffic tracking . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
2.7 Military applications . . . . . . . . . . . . . . . . . . . . . . . . . 23
2.8 Industrial applications . . . . . . . . . . . . . . . . . . . . . . . . 23
2.9 Sensors in education . . . . . . . . . . . . . . . . . . . . . . . . . 23
2.10 Health care . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.11 Underground coal mining . . . . . . . . . . . . . . . . . . . . . . 25
2.12 WSNs and IoT . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25

3 A Survey 27

3.1 Approximation algorithms . . . . . . . . . . . . . . . . . . . . . . 27

3.2 Centralized algorithms . . . . . . . . . . . . . . . . . . . . . . . . 28
3.3 Metaheuristic algorithms . . . . . . . . . . . . . . . . . . . . . . . 29
3.3.1 Genetic algorithm-based routing by Bari et al. . . . . . . . . 29
3.3.2 GAR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
3.3.3 GA based hierarchical clustering by Sajid et al. . . . . . . . 31
3.3.4 Energy aware evolutionary routing protocol (EAERP) . . . 31
3.4 Distributed algorithms . . . . . . . . . . . . . . . . . . . . . . . . 34
3.4.1 Flooding . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
3.4.2 Gossiping . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
3.4.3 Sensor Protocol for Information via Negotiation(SPIN) . . . 35
3.4.4 Directed Diffusion (DD) . . . . . . . . . . . . . . . . . . . 36
3.4.5 Low-energy adaptive clustering hierarchy (LEACH) . . . . 38
3.4.6 Efficient Routing-LEACH (ER-LEACH) . . . . . . . . . . 39
3.4.7 Adaptive and energy efficient clustering (AEEC) . . . . . . 39
3.4.8 Power-efficient gathering in sensor information systems (PE-
GASIS) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
3.4.9 Hybrid energy efficient distributed clustering (HEED) . . . 40
3.4.10 TEEN and APTEEN . . . . . . . . . . . . . . . . . . . . . 40
3.4.11 DEEC: Distributed energy efficient clustering . . . . . . . . 40
3.4.12 DEBR: Distributed energy balance routing . . . . . . . . . 41
3.4.13 Exponential and Sine Cost Function based Routing . . . . . 41
3.5 Mobile sink routing (MSR) . . . . . . . . . . . . . . . . . . . . . 42

4 Approximation Algorithms for Clustering 45

4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
4.2 System model and problem formulation . . . . . . . . . . . . . . . 46
4.3 Terminologies . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
4.4 Load balanced clustering algorithms . . . . . . . . . . . . . . . . . 49
4.4.1 Algorithm for equal load . . . . . . . . . . . . . . . . . . . 49
4.4.2 An illustration . . . . . . . . . . . . . . . . . . . . . . . . 51
4.4.3 Approximation algorithms for unequal load . . . . . . . . . 54
4.4.4 Performances based on load balancing . . . . . . . . . . . . 56
 Contents ix

4.4.5 Execution time . . . . . . . . . . . . . . . . . . . . . . . . 57

4.4.6 Heap based approximation algorithm . . . . . . . . . . . . 58
4.5 Chapter summary . . . . . . . . . . . . . . . . . . . . . . . . . . . 60

5 Centralized Algorithms 63

5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
5.2 Load balancing algorithms . . . . . . . . . . . . . . . . . . . . . . 63
5.3 Energy efficient algorithm . . . . . . . . . . . . . . . . . . . . . . 67
5.4 Chapter Summary . . . . . . . . . . . . . . . . . . . . . . . . . . 71

6 Metaheuristic Approaches 73

6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
6.2 System model and terminologies . . . . . . . . . . . . . . . . . . . 75
6.3 Genetic algorithms for clustering . . . . . . . . . . . . . . . . . . 76
6.3.1 An overview of genetic algorithm . . . . . . . . . . . . . . 76
6.3.2 GA based clustering . . . . . . . . . . . . . . . . . . . . . 77
6.3.2.1 Problem formulation . . . . . . . . . . . . . . . . 77
6.3.2.2 Chromosome representation . . . . . . . . . . . . 78
6.3.2.3 Initial population . . . . . . . . . . . . . . . . . 79
6.3.2.4 Fitness function . . . . . . . . . . . . . . . . . . 80
6.3.2.5 Selection . . . . . . . . . . . . . . . . . . . . . . 80
6.3.2.6 Crossover . . . . . . . . . . . . . . . . . . . . . 81
6.3.2.7 Mutation . . . . . . . . . . . . . . . . . . . . . . 81
6.4 Differential evolution for clustering and routing . . . . . . . . . . . 84
6.4.1 An overview of differential evolution . . . . . . . . . . . . 84
6.4.2 DE based clustering . . . . . . . . . . . . . . . . . . . . . 86
6.4.2.1 Problem formulation . . . . . . . . . . . . . . . . 86
6.4.2.2 Initialization of the population vector . . . . . . . 87
6.4.2.3 Derivation of fitness function . . . . . . . . . . . 88
6.4.2.4 Mutation . . . . . . . . . . . . . . . . . . . . . . 91
6.4.2.5 Crossover . . . . . . . . . . . . . . . . . . . . . 92
6.4.2.6 Local improvement . . . . . . . . . . . . . . . . 92
6.4.2.7 Selection . . . . . . . . . . . . . . . . . . . . . . 94
6.5 Particle swarm optimization based algorithms . . . . . . . . . . . . 96
6.5.1 An overview of particle swarm optimization . . . . . . . . . 97
6.5.2 PSO based routing . . . . . . . . . . . . . . . . . . . . . . 99
6.5.2.1 LP Formulation for Routing Problem . . . . . . . 99
6.5.2.2 Routing algorithm . . . . . . . . . . . . . . . . . 99
6.5.3 PSO Based Clustering . . . . . . . . . . . . . . . . . . . . 103
6.5.3.1 NLP Formulation for clustering problem: . . . . . 103
6.5.3.2 Clustering algorithm . . . . . . . . . . . . . . . . 104
6.6 Chapter summary . . . . . . . . . . . . . . . . . . . . . . . . . . . 115
x Contents

7 Distributed Algorithms 117

7.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117

7.2 Network model and terminologies . . . . . . . . . . . . . . . . . . 119
7.3 Distributed cost based algorithm . . . . . . . . . . . . . . . . . . . 120
7.3.1 Clustering algorithms . . . . . . . . . . . . . . . . . . . . . 121
7.3.1.1 Selection of CHs . . . . . . . . . . . . . . . . . . 121
7.3.1.2 Cluster setup . . . . . . . . . . . . . . . . . . . . 122
7.3.2 Routing algorithm . . . . . . . . . . . . . . . . . . . . . . 125
7.4 Distributed energy efficient algorithm . . . . . . . . . . . . . . . . 127
7.4.1 Clustering algorithms . . . . . . . . . . . . . . . . . . . . . 128
7.4.1.1 Selection of CHs . . . . . . . . . . . . . . . . . . 128
7.4.1.2 Cluster setup . . . . . . . . . . . . . . . . . . . . 129
7.4.2 Routing algorithms . . . . . . . . . . . . . . . . . . . . . . 130
7.5 Chapter summary . . . . . . . . . . . . . . . . . . . . . . . . . . . 136

8 Fault Tolerant Algorithms 139

8.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139

8.2 Fault tolerant algorithms . . . . . . . . . . . . . . . . . . . . . . . 140
8.2.1 Clustering algorithm . . . . . . . . . . . . . . . . . . . . . 140
8.2.1.1 Bootstrapping . . . . . . . . . . . . . . . . . . . 141
8.2.1.2 Distributed clustering algorithm . . . . . . . . . . 142
8.2.1.3 Fault tolerance . . . . . . . . . . . . . . . . . . . 145
8.2.2 Routing algorithm . . . . . . . . . . . . . . . . . . . . . . 147
8.2.2.1 Bootstrapping . . . . . . . . . . . . . . . . . . . 147
8.2.2.2 Distributed routing . . . . . . . . . . . . . . . . . 147
8.3 Chapter summary . . . . . . . . . . . . . . . . . . . . . . . . . . . 154

9 Unequal Clustering and Mobile Sink-Based Routing Algorithms 157

9.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157

9.2 Unequal clustering algorithms . . . . . . . . . . . . . . . . . . . . 157
9.2.1 Energy-efficient unequal clustering (EEUC) . . . . . . . . . 157
9.2.2 Multi-hop routing protocol with unequal clustering (MR-
PUC) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159
9.2.3 Grid based fault tolerant clustering and routing algorithms . 160
9.2.4 Unequal multi-hop balanced immune clustering protocol . . 160
9.3 Mobile sink routing (MSR) schemes . . . . . . . . . . . . . . . . . 161
9.3.1 Clustering and routing algorithms . . . . . . . . . . . . . . 162
9.3.1.1 MobiCluster . . . . . . . . . . . . . . . . . . . . 162
9.3.1.2 Cluster based routing . . . . . . . . . . . . . . . 168
9.4 Chapter summary . . . . . . . . . . . . . . . . . . . . . . . . . . . 174
 Contents xi

Bibliography 175

Index 191
Preface

The rapid advances in wireless communication and networking, coupled with minia-
turization and sensing technology, have made wireless sensor network (WSN) a pow-
erful technology. Over the past few years, the world has witnessed potential appli-
cations of WSNs in environment monitoring, surveillance systems, military, health
care, disaster warning systems, and home applications. However, in such applica-
tions, the major concern is how to judiciously use the energy of the sensor nodes.
This is because the sensor nodes have a limited power source. Moreover, in many
applications such as battlefields, forests, etc., WSNs are deployed in harsh environ-
ments with limited access to human beings. Therefore, it is almost impossible to
replace the sensor nodes or replenish their battery when their energy gets completely
exhausted. Therefore, efficient usage of energy of the sensors has been the prime
focus in the applications of WSNs. Various issues have been studied for reducing en-
ergy consumption of the sensor nodes to extend the lifetime of WSNs. Among them,
energy-efficient clustering and routing are the two most important topics and have
been studied extensively.
The purpose of this book is to provide a comprehensive and systematic introduc-
tion to WSNs, their applications, and various effective solutions towards clustering
and routing problems in WSNs. The book is written with suitable numerical and
figurative illustrative examples and the pseudo code of the algorithms, with their
performance evaluation and analysis. Distinguishing it from other books, this book
focuses on a survey and details of many energy-efficient clustering and routing algo-
rithms with a great emphasis on the evolutionary approaches that are not considered
in other books.

xiii
Who Can Use This Book

Graduate students, the researchers, and the developers interested in the field of wire-
less networks are the main target readers. Specifically, this book will be highly ben-
eficial to all the researchers who wish to pursue research in the algorithm design for
clustering and routing algorithms in the field of wireless sensor networks. The book
will help learners easily understand the basics of wireless sensor networks, and en-
ergy saving schemes for clustering and routing algorithms. They will know how to
develop algorithms, and how to apply evolutionary algorithms in solving problems
in other areas, too. If used in an academic setting, the material in this book is suitable
for a one-semester graduate level course. Although the book is self-contained, a few
chapters require some rudimentary knowledge of advanced data structures, advanced
algorithm design, soft computing approaches, and distributed algorithms.

xv
About the Authors

Pratyay Kuila received his B.Tech. degree in 2008 and

M.Tech. degree in 2011, both in Computer Science and Engi-
neering, from West Bengal University of Technology, Kolkata.
He has received his Ph.D. degree in 2014 from the Indian Insti-
tute of Technology (ISM), Dhanbad. He was an assistant pro-
fessor in the School of Computer Engineering, KIIT University,
Bhubaneswar, India. Currently, he is an assistant professor in
the Department of Computer Science & Engineering, National
Institute of Technology, Sikkim, India. He has acted as a referee in many reputable
International Journals, including Ad Hoc Networks, Telecommunication Systems,
etc. He has contributed 19 research papers in the field of wireless sensor networks.
His main research interest is to develop energy efficient clustering and routing al-
gorithms for wireless sensor networks.

Prasanta K. Jana received his M.Tech. degree in Computer Sci-

ence from the University of Calcutta in 1988, and his Ph.D. from
Jadavpur University in 2000. Currently he is a professor in the
department of Computer Science and Engineering, Indian Insti-
tute of Technology (ISM), Dhanbad, India. He has about 26 years
of teaching and research experience in the field of wireless sen-
sor networks, parallel and distributed computing, algorithm design, and data clus-
tering. He has contributed 160 research publications, co-authored four books, two
book chapters and edited two books. He has also mentored seven Ph.Ds. In recog-
nition of his outstanding research contributions, he was appointed senior member of
IEEE (The Institute of Electrical and Electronics Engineers, USA) in 2010 and re-
ceived a Canara Bank Research Publication Award in 2015. He is on the editorial
board of two international journals and acted as referee in many reputable inter-
national journals. Dr. Jana has acted as the general chair of the International Con-
ference Recent Advances in Information Technology (RAIT)-2012, Co-chair of the
National Conference Recent Advances in Information Technology (RAIT)-2009 and
Convener of the workshop WPDC-2008. He has also served as advisory committee
and programme committee member of several international conferences. His current
research interests include wireless sensor networks, cloud computing, big data, and
machine learning. He visited the University of Aizu, Japan, in 2003, Las Vegas, USA
in 2008, Imperial College of London, UK in 2011, University of Macau, in 2012, and
Hong Kong in 2015, for academic purposes.

xvii
Acknowledgments

This book is the result of research carried out for Ph.D thesis work by Dr. Pratyay
Kuila under the supervision of Prof. Prasanta K. Jana, Indian Institute of Technology
(ISM), Dhanbad. The authors are pleased to thank many individuals, without whose
contributions this book would not have been possible.
First and foremost, we must acknowledge and thank The Almighty Lord for giv-
ing us enough strength, encouragement, wisdom, and support. We would like to ex-
press our sincere gratitude to Prof. D. C. Panigrahi, the director of the Indian Institute
of Technology (ISM), Dhanbad, and Prof. R. Venugopal, the dean (Research & De-
velopment) of the Indian Institute of Technology (ISM) for their moral support and
for providing us all the necessary facilities.We are thankful to all the faculty and staff
members of our department for their help and support. We would also like to ac-
knowledge all the research scholars who have helped in coding and implementation
of the algorithms presented in this book. We specially acknowledge the contribu-
tions of Dr. Md. Azharuddin, Dr. Suneet K. Gupta, and Shri Amar Kaswan for the
completion of this book.
We sincerely thank all the reviewers, regional editors, and chief editors of the
journals who provided helpful comments and suggestions that significantly improved
the quality and organization of the research articles presented in this book. These ed-
itors include Dr. Swagatam Das of Swarm and Evolutionary Computation (Elsevier),
Dr. Ajith Abraham of Applied Soft Computing (Elsevier), Dr. Mario Köppen of Engi-
neering Applications of Artificial Intelligence (Elsevier), and Dr. M. Malek of Com-
puters & Electrical Engineering (Elsevier). We pay our sincere thanks to Mrs. Astha
Sharma, senior acquisitions editor and Shikha Garg, editorial assistant, CRC Press-
Taylor & Francis Group, Taylor & Francis India Pvt. Ltd., for their cooperation, help,
and support.
We are indebted to our family members, without whose love and support this
work could not have been completed. We are also indebted to our parents, for ev-
erything that they have given us and sacrificed during the preparation of this book.
They have stood by us in everything we have done by providing constant support,
encouragement, and belief in us to complete this journey.

Pratyay Kuila and Prasanta K. Jana

xix
Organization of the Book

The first chapter presents a brief introduction to WSNs, along with the major con-
straints, need, and benefits of clustering and routing algorithms. Then we provide a
brief survey of several existing energy-efficient clustering and routing algorithms for
WSNs in the second chapter. In the third chapter, major applications of the WSNs are
described. In the next five subsequent chapters, we present energy-saving clustering
and routing algorithms, which are divided into five basic categories, i.e., central-
ized algorithms, evolutionary approaches, distributed algorithms, fault-tolerant algo-
rithms and algorithms for hot-spot or energy-hole problems. For the centralized ap-
proaches, we use greedy methods, approximation algorithms, and several advanced
data structures. For the evolutionary-based approaches, we present various clustering
and routing algorithms using genetic algorithm (GA), differential evolution (DE) and
particle swarm optimization (PSO). The distributed algorithms are presented with a
cost-based approach. Some clustering and routing algorithms are also presented to
solve fault-tolerant and the hot-spot or energy-hole problems in wireless sensor net-
works. For the ease of understanding, all the algorithms are described with illustra-
tive examples. The analysis of the experimental parts of the algorithms are nicely
described with suitable diagrams. They are also supported by lemmas and theorems
with their proofs.

xxi
List of Tables

4.1 Sensor nodes with the list of possible gateways . . . . . . . . . . . 51

4.2 Sorted list of sensor nodes with possible gateways . . . . . . . . . 52
4.3 Assignment of successive sensor nodes to the CHs . . . . . . . . . 53

5.1 Distance (meter) between sensor nodes to gateways . . . . . . . . 65

6.1 Sensor nodes with the list of possible gateways . . . . . . . . . . . 79

6.2 Sensor nodes with the list of possible gateways from figure (6.10) . 88
6.3 Sensor nodes assignment from vector encoding . . . . . . . . . . 89
6.4 Gateways and their possible next hops . . . . . . . . . . . . . . . 101
6.5 Next-hop relay node selection from the randomly generated particle 101
6.6 Sensor nodes with the list of possible gateways . . . . . . . . . . . 106
6.7 Sensor nodes assignment from particle representation . . . . . . . 107
6.8 PSO Parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
6.9 Mean network life time and standard deviation in WSN#1(60 gate-
ways) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
6.10 Mean network life time and standard deviation in WSN#2(90 gate-
ways) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111

xxiii
List of Figures

1.1 Basic components of a sensor node . . . . . . . . . . . . . . . . . 4

1.2 Sensor nodes produced by Crossbow: a) Mica2 and b) TelosB . . . 5
1.3 Flat wireless sensor network architecture: a) single-hop communi-
cation and b) multi-hop communication between sensor nodes and
sink . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.4 A cluster-based wireless sensor network architecture with single-
hop communication between CHs and base station. Small dashed
arrows show the communication between sensor nodes and their
corresponding CHs, and large arrows for the same between CHs
and CHs or CHs and base station. . . . . . . . . . . . . . . . . . . 7
1.5 A cluster-based wireless sensor network architecture with multi-
hop communication between CHs and base station . . . . . . . . . 8

2.1 WSNs for forest fire detection . . . . . . . . . . . . . . . . . . . . 20

2.2 Use of WSNs in agriculture by the WaterSense project . . . . . . . 21
2.3 WSNs in tunnels . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
2.4 Sensor nodes for health-care applications . . . . . . . . . . . . . . 24

3.1 Sub-graph network of WSN and the corresponding chromosome

representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
3.2 The implosion problem. Node A starts by flooding its data to all of
its neighbors, B and C. D gets eventually two identical copies of
data, which is not necessary the same . . . . . . . . . . . . . . . . 33
3.3 The overlap problem. Two sensor nodes C and D cover an overlap-
ping geographic region and B gets the same copy of the data from
these sensors. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
3.4 SPIN protocol. Node A starts by advertising its data to node B (a).
Node B responds by sending a request to node A (b). After receiving
the requested data (c), node B then sends out advertisements to its
neighbors (d), who in turn send requests back to B (e-f). . . . . . . 36
3.5 Directed diffusion. (a) Interest propagation, (b) initial gradients
setup, and (c) data delivery along reinforcement. . . . . . . . . . . 37

4.1 Comparison of load balancing for (a) unequal load and (b) equal
load of the sensor nodes using 35 gateways . . . . . . . . . . . . . 56

xxv
xxvi List of Figures

4.2 Comparison of execution time using (a) 15 gateways and (b) 30

gateways . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57

5.1 (a) Min-heap with restricted nodes and (b) min-heap node format . 65
5.2 The min-heap (a) after assigning s1 to g3 (b) after assigning s3 to g1
and (c) after assigning all the sensor nodes to their corresponding
gateway . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
5.3 Comparison in terms of (a) active gateways and (b) consumed en-
ergy (J) of the network . . . . . . . . . . . . . . . . . . . . . . . 70
5.4 Comparison of PBCA, by changing the parameter value. (a) active
gateways and (b) active Sensor Nodes . . . . . . . . . . . . . . . 71

6.1 Flowchart of genetic algorithm . . . . . . . . . . . . . . . . . . . 77

6.2 Chromosome representation . . . . . . . . . . . . . . . . . . . . . 78
6.3 Generated chromosome from Table 6.1. . . . . . . . . . . . . . . 80
6.4 Crossover Operation . . . . . . . . . . . . . . . . . . . . . . . . . 81
6.5 Chromosome representation (a) Before mutation, (b) After muta-
tion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
6.6 Comparison in terms of load balancing for (a) equal and (b) unequal
load of the sensor nodes for 30 gateways . . . . . . . . . . . . . . 83
6.7 Convergence rate of the algorithms for (a) unequal load of the sen-
sor nodes and (b) equal load of the sensor nodes . . . . . . . . . . 84
6.8 Flowchart of Differential Evolution . . . . . . . . . . . . . . . . . 85
6.9 Flowchart of the DE based clustering algorithm . . . . . . . . . . 86
6.10 A Wireless sensor network with gateways . . . . . . . . . . . . . 87
6.11 Final Assignment . . . . . . . . . . . . . . . . . . . . . . . . . . 89
6.12 Crossover operation . . . . . . . . . . . . . . . . . . . . . . . . . 92
6.13 A WSN of (a) before and (b) after local improvement . . . . . . . 93
6.14 Comparison in terms of lifetime for (a) 15 and (b) 30 gateways . . 94
6.15 Difference between FGD (First gateway die) and LGD (Last gate-
way die) in rounds for (a) WSN#1 and (b) WSN#2 . . . . . . . . . 95
6.16 Comparison in terms of (a) dead sensor nodes and (b) energy con-
sumption of the network . . . . . . . . . . . . . . . . . . . . . . . 96
6.17 Flowchart of the PSO (for minimization function) . . . . . . . . . 98
6.18 (a) Sub graph network of a WSN and (b) routing path . . . . . . . 100
6.19 A WSN with gateways (a) before clustering and (b) after clustering 105
6.20 Comparison in terms of network life in rounds for 90 gateways in
(a) WSN#1 and (b) WSN#2 . . . . . . . . . . . . . . . . . . . . . 110
6.21 Comparison in terms of inactive sensor nodes in (a) WSN#1 and
(b) WSN#2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112
6.22 Comparison in terms of energy consumption in (a) WSN#1 and (b)
WSN#2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
6.23 Comparison in terms of total number of hops for (a) WSN#1 and
(b) WSN#2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
 List of Figures xxvii

6.24 Comparison in terms of total distance covered in a round for (a)

WSN#1 and (b) WSN#2 . . . . . . . . . . . . . . . . . . . . . . . 114

7.1 A WSN model with normal sensor nodes as CHs . . . . . . . . . . 117

7.2 Timing in our Protocol . . . . . . . . . . . . . . . . . . . . . . . 120
7.3 The superframe structure of the IEEE 802.15.4 beacon-enabled
mode . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
7.4 Comparison between LEACH, DEBR and CBCRA in terms of (a)
active sensor nodes and (b)energy consumption (J) for 150 sensor
nodes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
7.5 Cluster size calculation . . . . . . . . . . . . . . . . . . . . . . . 128
7.6 Selection of relay node for data transmission . . . . . . . . . . . . 130
7.7 Relay node between source S and base station B . . . . . . . . . . 132
7.8 Comparison between LEACH, DEECR and CBCRA in terms of
number of selected CHs for (a) 100 and (b) 200 sensor nodes . . . 134
7.9 Comparison in terms of active sensor nodes for (a) 100 and (b) 400
sensor nodes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
7.10 Comparison in terms of energy consumption for (a) 100 and (b) 400
sensor nodes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135

8.1 Network setup . . . . . . . . . . . . . . . . . . . . . . . . . . . . 142

8.2 Comparison in terms of (a) number of dead CHs and (b) average
energy consumption per packet . . . . . . . . . . . . . . . . . . . 146
8.3 Routing paths from the sensor nodes in 1st round for 150 sensor
nodes in WSN#1 . . . . . . . . . . . . . . . . . . . . . . . . . . . 151
8.4 Routing paths from the sensor nodes in 1st round for 150 sensor
nodes in WSN#2 . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
8.5 Comparison of average energy (J) consumption per packet in (a)
WSN#1 and (b) WSN#2 . . . . . . . . . . . . . . . . . . . . . . . 152
8.6 Comparison in terms of number of live sensor nodes in (a) WSN#1
and (b) WSN#2 . . . . . . . . . . . . . . . . . . . . . . . . . . . 153

9.1 Network with static base station placed at the geometric center of
the field . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158
9.2 Mobile data collection in a WSN with mobile sink . . . . . . . . . 161
9.3 Physical layout of MobiCluster . . . . . . . . . . . . . . . . . . . 163
9.4 Clustering phase in MobiCluster . . . . . . . . . . . . . . . . . . 164
9.5 Derived topology of MobiCluster . . . . . . . . . . . . . . . . . . 166
9.6 An illustration of WSN for mobile sink with obstacles . . . . . . . 168
9.7 Partitioning of clusters . . . . . . . . . . . . . . . . . . . . . . . . 169
9.8 Grid-graph of target area . . . . . . . . . . . . . . . . . . . . . . 172
9.9 Spanning graph of target area . . . . . . . . . . . . . . . . . . . . 173
9.10 Obtained OA-MST . . . . . . . . . . . . . . . . . . . . . . . . . 174
Another random document with
no related content on Scribd:
“She is from Havana,” said a Frenchman, who was at hand, working.
“The Raven, Captain Sudlip.”
“Captain Sudlip!” came from several of the boys.
“Was his full name Jason Sudlip?” questioned Professor Strong, with
equal interest.
“Yes. Then you knew him?”
“We did. But we didn’t know he was captain of a schooner like this.”
“It was a new command for him. At the last moment the regular
captain of the Raven was taken sick and Captain Sudlip took his
place. Poor fellow, it was a fatal trip for him.”
“Is Captain Sudlip dead?” questioned Darry.
“Not dead, but horribly burnt. They have taken him to the hospital at
Roseau, on the island of Dominica, but the doctors say he cannot
live.”
The Frenchman resumed his work, and the craft containing our
friends moved off down the coast. For some minutes nobody spoke.
Then Darry heaved a long sigh.
“It’s horrible!” he murmured. “Horrible! Captain Sudlip wasn’t our
friend, but I pity him.”
“And so do I pity him,” put in Sam. “I trust his case isn’t as bad as
reported.”
This was all that was said, but nobody forgot the matter until a long
time after. It may be as well to state here that the captain was in a
very bad way and that he died inside of the week.
It was utterly impossible to think of going ashore at St. Pierre, and
fearful of another eruption which might cost them their lives,
Professor Strong procured passage on a little ferry steamer which
had formerly run regularly between the fallen city and Fort de
France.
Turning southward again made the hearts of Mark and Frank sink
like lead within their bosoms. Their thoughts were constantly on their
parents.
“I can’t give my father up—I simply can’t!” said Frank to his chum, in
a choking voice. “It’s too awful to think of!”
“I feel exactly the same, Frank,” answered the older youth. “But what
more can we do?”
“I am going to make more inquiries when we reach Fort de France.”
“Oh, I shall do that, too.”
On the way down the coast they fell in with many vessels, all going
to St. Pierre to give aid to those who, alas, were beyond human
needs. These craft moved along silently, nobody feeling in the humor
to even discuss the situation.
As soon as they landed at the capital city they started for the post-
office, to learn if anything in the shape of a letter had been left for
one or another of the party. They found the streets crowded with
people of all nationalities and for the first time learned how Fort de
France had received a shower of dust and stones, and how
everybody had been terrorized and business brought to a standstill.
“It’s a fearful state of affairs,” said Sam. “They won’t recover from this
for years.”
“St. Pierre will never recover, Samuel,” returned the professor. “The
eruption has——”
Professor Strong stopped short, for a cry from Mark had interrupted
him. The youth was pointing up a street to their left.
“See! see! There is a crowd of negroes and they are beating a white
man! If somebody don’t help the white fellow they will kill him!”
They started forward, and were soon on the edge of the crowd which
numbered fully a dozen colored men. In the very midst was the white
man Mark had mentioned. His hat was off, his collar and tie loose,
his shirt torn, and he was fighting desperately. One cheek was
bleeding from a long cut and his left arm hung limply at his side.
“It is Dan Markel!” ejaculated Darry. “Dan Markel, the fellow who
once swindled Hockley!”
The crowd around the man was yelling fiercely and striking at every
available opportunity. Dan Markel was yelling in return, but nobody
appeared to listen to him.
“We must do something, or he’ll surely be killed,” said Frank.
By this time Professor Strong was close to the crowd. “Stop!” he
called out, in French. “Stop! What does this mean?”
“He is a rascal!” said one native, wrathfully. “He is not fit to live!”
“He robbed the dead,” said another. “We saw him doing it—up at the
Ladarosa plantation.”
“Let me go!” screamed Markel, in English. “It’s all a mistake.”
By this time the crowd was growing larger, and the shouting
continued, until to make out what one individual was saying was
impossible. Those nearest to Markel continued to strike at the man
from Baltimore, until he went down from a blow on the head, and
several in the crowd fell on top of him.
It was at this critical moment that several gens-d’armes appeared.
They were doing police duty in that neighborhood, and at once set to
work to restore peace. But it was not without great difficulty that they
succeeded in quieting the negroes, who insisted upon it that Dan
Markel be arrested.
“He is a looter—a robber of the dead,” said one of the natives. And
then he explained that he was an assistant foreman on the Ladarosa
plantation not far from St. Pierre. The master of the plantation had
been killed, along with several others of the household, while the
negroes had fled to a rocky cave for safety. On returning to the
house two days after the first eruption they had found Dan Markel
there and in the act of stealing the silverware and jewelry. Markel
had escaped them but they remembered his face well.
The man from Baltimore tried to deny this story, saying he had
reached Fort de France from La Guayra that morning, but on being
searched some jewelry which the negroes identified was found in his
pockets. He was at once marched off to the local jail, there to await
trial, the natives following the gens-d’armes to see that the prisoner
did not get away.
“It will go hard with Markel,” said Darry. “Robbery under such
circumstances becomes a double crime.”
“In some countries such looters would be hung,” answered Professor
Strong. “You may depend upon it that Markel will get the full penalty
of the law.”
“This will please Hockley,” came from Sam. “He was always sorry
the rascal got away. I wonder if Hockley is still up at the hotel?” he
continued.
“I shouldn’t be surprised if he got out of Fort de France when that
shower of dust and stones came,” returned Mark. “He was scared to
death as it was.”
A short while later found them at the post-office asking for letters.
Owing to the general disorder it was half an hour before any mail
was handed out.
The first communication proved to be from Hockley, and was
addressed to Professor Strong. It was short, and had evidently been
written while the youth was in an excited frame of mind. It ran as
follows:
“Dear Professor: It looks now as if this island was
doomed and I don’t propose to be burnt up or be drowned.
There is a steamer sailing from here to Port-of-Spain,
Trinidad, and other ports in South America, and I have
secured passage. If I stop off at Port-of-Spain you can
look for me at the hotel at which we stopped before, and if
I go further I will leave word in a letter at the post-office.
Have cabled my father to send necessary money.”
“I knew Hockley wouldn’t stay,” said Darry. “I’ll wager he was almost
paralyzed with terror.” And he was right. Hockley had acted so
thoroughly scared that he had made himself the laughing stock of all,
both at the hotel and on board the steamer on which he had secured
passage. It was to be some time before they would see their tall
traveling companion again.
 CHAPTER XXXIII
A HAPPY MEETING—CONCLUSION

The letter from Hockley read, they waited patiently until some mail
matter which had just come in should be sorted out. This took the
best part of an hour—a wait which to Mark and Frank seemed an
age.
But at last the little window was opened once more and the crowd
surged forward. Professor Strong was well to the front and presently
they saw him turn from the window with half a dozen
communications held aloft.
“Letters!” cried Frank. “Oh, if only they bring good news!”
The professor was soon beside them. There were letters for all, but
just then the interest was concentrated on a communication
addressed to Mark and another addressed to Frank. Both bore the
postmark of Kingstown, St. Vincent.
“My father’s handwriting!” cried Mark, in a trembling voice.
“And this is in my father’s hand!” came from Frank, falteringly. His
hand shook so he could not open the envelope. “Yo—you read it,
professor.”
Professor Strong did so. The communication had been written the
day before and ran in this wise:
“My dear son Frank:
“I am writing this in the hope that you are safe despite the
fearful volcano eruptions which have taken place in this
quarter of the globe. I know you were bound for St. Pierre,
but I have learned that by the goodness of an all-wise
Providence the Vendee escaped the eruption that
destroyed St. Pierre and all the shipping in that harbor.
 “Mr. Robertson and myself have had a narrow escape
from death, and we do not yet know if we are entirely safe,
for the volcano on this island is now as active as that on
Martinique. We were within four miles of Mont Pelee when
the eruption of May 8th occurred. We escaped by what
was little short of a miracle, and were lucky enough to get
on a trading vessel bound for this port. I had my lower
limbs and feet considerably burnt, and Mr. Robertson
suffered from burns on his feet and on his left arm. But
none of the burns are serious, and we are resting here
quite comfortably. If we were well enough we would set
out in search of you, but as it is neither of us can do any
walking at present.
“I am sending this letter in duplicate to half a dozen ports
in this territory, and Mr. Robertson is sending similar letters
addressed to Mark. As soon as you receive a letter let me
hear from you, as both of us are anxious for news. And
also send word home if you are safe. Address me at the
Windsor Hotel, Kingstown, Island of St. Vincent.”
“Oh, how glad I am that they are safe!” murmured Frank, and then
he looked at Mark, who had been reading his own letter. There were
tears in the eyes of both and that look meant more than any words of
mine can tell.
“I must go to Kingstown at once,” said Mark. “I can’t be satisfied until
I see for myself just how they are faring.”
“And I will go with you,” answered Frank. “Perhaps the burns are
worse than we imagine. I know father. He wouldn’t want to worry
me.”
The matter was talked over by all, and in the end Professor Strong
agreed to see about passage to St. Vincent. Darry and Sam wanted
to keep with Frank and Mark, and the whole party sailed southward
the next morning at sunrise.
The run to St. Vincent, past the Island of St. Lucia, which, strange to
say, had entirely escaped the eruptions on both sides of it, was
made without anything unusual occurring. While still some miles
north of the island for which they were bound they could see the
smoke of La Soufriere and through the marine glasses took note of
some of the terrible damage done.
“It is very fortunate that no large city was located near this volcano,”
said Professor Strong. “No living thing could have escaped such an
outburst as has taken place here.”
When the vessel reached Kingstown harbor the boys could scarcely
wait to get ashore. They learned that the Windsor Hotel was in a
suburb, and hired a carriage to take them to the hostelry.
“There is father now!” cried Frank, as they entered the beautiful
grounds, and he pointed to a figure reclining in an invalid chair on
the veranda.
“And my father is there, too!” exclaimed Mark.
In another moment they were out of the carriage and rushing up the
veranda steps. As they came closer both Mr. Newton and Mr.
Robertson sat up to greet them.
“My boy!” cried Mr. Newton, and flung his arms around Frank. “My
own boy!”
“Mark!” came from Mr. Robertson, and his face broke out into a
warm smile of welcome. “We were just talking about you and
wondering if we would get a letter.”
“You don’t know how glad I am to see you, even like this, father,”
answered Mark. “We were afraid you had been burnt up.”
“Yes, and we went on a regular search for both of you,” broke in
Frank.
“And they came pretty close to losing their own lives in that search,”
came from the professor, as he shook hands.
“Then you went ashore—” began Mr. Newton, in wonder.
“Yes, we went volcano exploring,” said Darry.
“And we climbed Mont Pelee,” finished Sam. “I don’t believe we’ll
ever want to do it again.”
“No,” finished Mark. “Once was enough. Now we are all safe away
from it, I never want to see the island of Martinique again.”
And the others agreed with him.
Let me add a few words more, and then we will bring to a close this
tale of sight-seeing and adventures in the West Indies.
What Mr. Newton and Mr. Robertson had written in their letters
concerning their injuries was true. Although painful, none of the
burns were serious, and they were both doing as well as could be
expected. In a few days each was able to walk a little, and inside of a
month both were practically as well as ever.
For the time being all business in Martinique, and a good part of that
in St. Vincent, came to a standstill, and this being so nothing could
be done regarding the dyewood scheme the two gentlemen had had
in mind. Consequently the pair returned to the United States at the
first available opportunity.
“Take good care of yourselves in the future, boys,” said Mr.
Robertson, on leaving.
“And let the active volcanoes alone,” added Mr. Newton.
And all of the party agreed to heed the advice.
During the time spent in St. Vincent the boys made one trip
northward toward La Soufriere. But though they inspected the great
volcano from a distance they took good care to keep out of the zone
of fire.
“It’s a fearful spot,” said Mark. “Worse even than around Mont Pelee.
It’s a regular Inferno on earth,” and the others said the same.
At last came the day for the young explorers to leave St. Vincent.
Anxious to learn what had become of Hockley, who had not
answered a letter sent to Trinidad by him, Professor Strong engaged
passage on a vessel bound for Port-of-Spain.
“Hurrah, we are off at last!” cried Darry, as they set sail. “Good-bye to
the West Indies.”
“After all, the trip through the islands wasn’t so bad,” said Sam. “We
saw lots of interesting things.”
“I guess we shall see even more interesting things in the future,”
came from Mark.
“Of course, our sight-seeing isn’t half over yet,” added Frank. He was
right, and what the immediate future held in store for our young
friends will be told in the next volume of this “Pan-American Series.”
In that book we shall meet all our boys and the professor once more,
and learn of many things as interesting, curious, or exciting as those
related in these pages.
But for the present we will leave them, and also these ill-fated
islands of the Lesser Antilles, the fate of which even to-day seems
uncertain. Our friends made a happy group as they steamed rapidly
southward, and here let us say good-bye.
THE END
 TRANSCRIBER’S NOTES:
Obvious typographical errors have been corrected.
Inconsistencies in hyphenation have been
standardized.
Archaic or variant spelling has been retained.
New original cover art included with this eBook is
granted to the public domain.
*** END OF THE PROJECT GUTENBERG EBOOK THE YOUNG
VOLCANO EXPLORERS ***

Updated editions will replace the previous one—the old editions

will be renamed.

Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright
in these works, so the Foundation (and you!) can copy and
distribute it in the United States without permission and without
paying copyright royalties. Special rules, set forth in the General
Terms of Use part of this license, apply to copying and
distributing Project Gutenberg™ electronic works to protect the
PROJECT GUTENBERG™ concept and trademark. Project
Gutenberg is a registered trademark, and may not be used if
you charge for an eBook, except by following the terms of the
trademark license, including paying royalties for use of the
Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is
very easy. You may use this eBook for nearly any purpose such
as creation of derivative works, reports, performances and
research. Project Gutenberg eBooks may be modified and
printed and given away—you may do practically ANYTHING in
the United States with eBooks not protected by U.S. copyright
law. Redistribution is subject to the trademark license, especially
commercial redistribution.

START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
 PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg™ mission of promoting the

free distribution of electronic works, by using or distributing this
work (or any other work associated in any way with the phrase
“Project Gutenberg”), you agree to comply with all the terms of
the Full Project Gutenberg™ License available with this file or
online at www.gutenberg.org/license.

Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand,
agree to and accept all the terms of this license and intellectual
property (trademark/copyright) agreement. If you do not agree to
abide by all the terms of this agreement, you must cease using
and return or destroy all copies of Project Gutenberg™
electronic works in your possession. If you paid a fee for
obtaining a copy of or access to a Project Gutenberg™
electronic work and you do not agree to be bound by the terms
of this agreement, you may obtain a refund from the person or
entity to whom you paid the fee as set forth in paragraph 1.E.8.

1.B. “Project Gutenberg” is a registered trademark. It may only

be used on or associated in any way with an electronic work by
people who agree to be bound by the terms of this agreement.
There are a few things that you can do with most Project
Gutenberg™ electronic works even without complying with the
full terms of this agreement. See paragraph 1.C below. There
are a lot of things you can do with Project Gutenberg™
electronic works if you follow the terms of this agreement and
help preserve free future access to Project Gutenberg™
electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright
law in the United States and you are located in the United
States, we do not claim a right to prevent you from copying,
distributing, performing, displaying or creating derivative works
based on the work as long as all references to Project
Gutenberg are removed. Of course, we hope that you will
support the Project Gutenberg™ mission of promoting free
access to electronic works by freely sharing Project
Gutenberg™ works in compliance with the terms of this
agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms
of this agreement by keeping this work in the same format with
its attached full Project Gutenberg™ License when you share it
without charge with others.

1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.

1.E. Unless you have removed all references to Project

Gutenberg:

1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project
Gutenberg™ work (any work on which the phrase “Project
Gutenberg” appears, or with which the phrase “Project
Gutenberg” is associated) is accessed, displayed, performed,
viewed, copied or distributed:

This eBook is for the use of anyone anywhere in the United

States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it
away or re-use it under the terms of the Project Gutenberg
License included with this eBook or online at
www.gutenberg.org. If you are not located in the United
States, you will have to check the laws of the country where
you are located before using this eBook.

1.E.2. If an individual Project Gutenberg™ electronic work is

derived from texts not protected by U.S. copyright law (does not
contain a notice indicating that it is posted with permission of the
copyright holder), the work can be copied and distributed to
anyone in the United States without paying any fees or charges.
If you are redistributing or providing access to a work with the
phrase “Project Gutenberg” associated with or appearing on the
work, you must comply either with the requirements of
paragraphs 1.E.1 through 1.E.7 or obtain permission for the use
of the work and the Project Gutenberg™ trademark as set forth
in paragraphs 1.E.8 or 1.E.9.

1.E.3. If an individual Project Gutenberg™ electronic work is

posted with the permission of the copyright holder, your use and
distribution must comply with both paragraphs 1.E.1 through
1.E.7 and any additional terms imposed by the copyright holder.
Additional terms will be linked to the Project Gutenberg™
License for all works posted with the permission of the copyright
holder found at the beginning of this work.

1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files
containing a part of this work or any other work associated with
Project Gutenberg™.
 1.E.5. Do not copy, display, perform, distribute or redistribute
this electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1
with active links or immediate access to the full terms of the
Project Gutenberg™ License.

1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must, at
no additional cost, fee or expense to the user, provide a copy, a
means of exporting a copy, or a means of obtaining a copy upon
request, of the work in its original “Plain Vanilla ASCII” or other
form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™
works unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or

providing access to or distributing Project Gutenberg™
electronic works provided that:

• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
 about donations to the Project Gutenberg Literary Archive
Foundation.”

• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.

• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.

• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project

Gutenberg™ electronic work or group of works on different
terms than are set forth in this agreement, you must obtain
permission in writing from the Project Gutenberg Literary
Archive Foundation, the manager of the Project Gutenberg™
trademark. Contact the Foundation as set forth in Section 3
below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on,
transcribe and proofread works not protected by U.S. copyright
law in creating the Project Gutenberg™ collection. Despite
these efforts, Project Gutenberg™ electronic works, and the
medium on which they may be stored, may contain “Defects,”
such as, but not limited to, incomplete, inaccurate or corrupt
data, transcription errors, a copyright or other intellectual
property infringement, a defective or damaged disk or other
medium, a computer virus, or computer codes that damage or
cannot be read by your equipment.

1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES -

Except for the “Right of Replacement or Refund” described in
paragraph 1.F.3, the Project Gutenberg Literary Archive
Foundation, the owner of the Project Gutenberg™ trademark,
and any other party distributing a Project Gutenberg™ electronic
work under this agreement, disclaim all liability to you for
damages, costs and expenses, including legal fees. YOU
AGREE THAT YOU HAVE NO REMEDIES FOR NEGLIGENCE,
STRICT LIABILITY, BREACH OF WARRANTY OR BREACH
OF CONTRACT EXCEPT THOSE PROVIDED IN PARAGRAPH
1.F.3. YOU AGREE THAT THE FOUNDATION, THE
TRADEMARK OWNER, AND ANY DISTRIBUTOR UNDER
THIS AGREEMENT WILL NOT BE LIABLE TO YOU FOR
ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL, PUNITIVE
OR INCIDENTAL DAMAGES EVEN IF YOU GIVE NOTICE OF
THE POSSIBILITY OF SUCH DAMAGE.

1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If

you discover a defect in this electronic work within 90 days of
receiving it, you can receive a refund of the money (if any) you
paid for it by sending a written explanation to the person you
received the work from. If you received the work on a physical
medium, you must return the medium with your written
explanation. The person or entity that provided you with the
defective work may elect to provide a replacement copy in lieu
of a refund. If you received the work electronically, the person or
entity providing it to you may choose to give you a second
opportunity to receive the work electronically in lieu of a refund.
If the second copy is also defective, you may demand a refund
in writing without further opportunities to fix the problem.

1.F.4. Except for the limited right of replacement or refund set

forth in paragraph 1.F.3, this work is provided to you ‘AS-IS’,
WITH NO OTHER WARRANTIES OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR
ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of
damages. If any disclaimer or limitation set forth in this
agreement violates the law of the state applicable to this
agreement, the agreement shall be interpreted to make the
maximum disclaimer or limitation permitted by the applicable
state law. The invalidity or unenforceability of any provision of
this agreement shall not void the remaining provisions.

1.F.6. INDEMNITY - You agree to indemnify and hold the

Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and
distribution of Project Gutenberg™ electronic works, harmless
from all liability, costs and expenses, including legal fees, that
arise directly or indirectly from any of the following which you do
or cause to occur: (a) distribution of this or any Project
Gutenberg™ work, (b) alteration, modification, or additions or
deletions to any Project Gutenberg™ work, and (c) any Defect
you cause.

Section 2. Information about the Mission of

Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new
computers. It exists because of the efforts of hundreds of
volunteers and donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project
Gutenberg™’s goals and ensuring that the Project Gutenberg™
collection will remain freely available for generations to come. In
2001, the Project Gutenberg Literary Archive Foundation was
created to provide a secure and permanent future for Project
Gutenberg™ and future generations. To learn more about the
Project Gutenberg Literary Archive Foundation and how your
efforts and donations can help, see Sections 3 and 4 and the
Foundation information page at www.gutenberg.org.

Section 3. Information about the Project

Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-
profit 501(c)(3) educational corporation organized under the
laws of the state of Mississippi and granted tax exempt status by
the Internal Revenue Service. The Foundation’s EIN or federal
tax identification number is 64-6221541. Contributions to the
Project Gutenberg Literary Archive Foundation are tax
deductible to the full extent permitted by U.S. federal laws and
your state’s laws.

The Foundation’s business office is located at 809 North 1500

West, Salt Lake City, UT 84116, (801) 596-1887. Email contact
links and up to date contact information can be found at the
Foundation’s website and official page at
www.gutenberg.org/contact

Section 4. Information about Donations to

the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission
of increasing the number of public domain and licensed works
that can be freely distributed in machine-readable form
accessible by the widest array of equipment including outdated
equipment. Many small donations ($1 to $5,000) are particularly
important to maintaining tax exempt status with the IRS.

The Foundation is committed to complying with the laws

regulating charities and charitable donations in all 50 states of
the United States. Compliance requirements are not uniform
and it takes a considerable effort, much paperwork and many
fees to meet and keep up with these requirements. We do not
solicit donations in locations where we have not received written
confirmation of compliance. To SEND DONATIONS or
determine the status of compliance for any particular state visit
www.gutenberg.org/donate.

While we cannot and do not solicit contributions from states

where we have not met the solicitation requirements, we know
of no prohibition against accepting unsolicited donations from
donors in such states who approach us with offers to donate.

International donations are gratefully accepted, but we cannot

make any statements concerning tax treatment of donations
received from outside the United States. U.S. laws alone swamp
our small staff.

Please check the Project Gutenberg web pages for current

donation methods and addresses. Donations are accepted in a
number of other ways including checks, online payments and
credit card donations. To donate, please visit:
www.gutenberg.org/donate.

Section 5. General Information About Project

Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could
be freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose
network of volunteer support.

Project Gutenberg™ eBooks are often created from several

printed editions, all of which are confirmed as not protected by
copyright in the U.S. unless a copyright notice is included. Thus,
we do not necessarily keep eBooks in compliance with any
particular paper edition.

Most people start at our website which has the main PG search
facility: www.gutenberg.org.

This website includes information about Project Gutenberg™,

including how to make donations to the Project Gutenberg
Literary Archive Foundation, how to help produce our new
eBooks, and how to subscribe to our email newsletter to hear
about new eBooks.