Artificial Intelligence Ai Recent Trends and Applications S Kanimozhi Suguna Online Ebook Texxtbook Full Chapter PDF

Artificial Intelligence (AI): Recent
Trends and Applications S. Kanimozhi

Suguna
Visit to download the full and correct content document:
https://ebookmeta.com/product/artificial-intelligence-ai-recent-trends-and-applications
-s-kanimozhi-suguna/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Applications of Artificial Intelligence in Business and

Finance: Modern Trends 1st Edition
https://ebookmeta.com/product/applications-of-artificial-
intelligence-in-business-and-finance-modern-trends-1st-edition/
Swarm Intelligence Trends and Applications: Trends and

Applications 1st Edition Wellington Pinheiro Dos Santos
(Editor)
https://ebookmeta.com/product/swarm-intelligence-trends-and-
applications-trends-and-applications-1st-edition-wellington-
pinheiro-dos-santos-editor/
Recent Trends in Operator Theory and Applications 1st

Edition Fernanda Botelho
https://ebookmeta.com/product/recent-trends-in-operator-theory-
and-applications-1st-edition-fernanda-botelho/
Wireless Communication with Artificial Intelligence:

Emerging Trends and Applications (Wireless
Communications and Networking Technologies) 1st Edition
Anuj Singal (Editor)
https://ebookmeta.com/product/wireless-communication-with-
artificial-intelligence-emerging-trends-and-applications-
wireless-communications-and-networking-technologies-1st-edition-
Artificial Intelligence: Fundamentals and Applications
1st Edition Cherry Bhargava
https://ebookmeta.com/product/artificial-intelligence-
fundamentals-and-applications-1st-edition-cherry-bhargava/
Advances and Trends in Artificial Intelligence. Theory

and Practices in Artificial Intelligence: 35th
International Conference on Industrial Engineering,
IEA/AIE 2022 Hamido Fujita
https://ebookmeta.com/product/advances-and-trends-in-artificial-
intelligence-theory-and-practices-in-artificial-
intelligence-35th-international-conference-on-industrial-
engineering-iea-aie-2022-hamido-fujita/
Medical Informatics and Bioimaging Using Artificial

Intelligence Challenges Issues Innovations and Recent
Developments Aboul Ella Hassanien
https://ebookmeta.com/product/medical-informatics-and-bioimaging-
using-artificial-intelligence-challenges-issues-innovations-and-
recent-developments-aboul-ella-hassanien/
Artificial Intelligence and Industrial Applications:

Algorithms, Techniques, and Engineering Applications
1st Edition Tawfik Masrour
https://ebookmeta.com/product/artificial-intelligence-and-
industrial-applications-algorithms-techniques-and-engineering-
applications-1st-edition-tawfik-masrour/
Artificial Intelligence Theory and Applications 973

Studies in Computational Intelligence 973 Endre Pap
(Editor)
https://ebookmeta.com/product/artificial-intelligence-theory-and-
applications-973-studies-in-computational-intelligence-973-endre-
pap-editor/
Artificial Intelligence (AI)
Artificial Intelligence (AI): Elementary to Advanced Practices
Series Editors: Vijender Kumar Solanki, Zhongyu (Joan) Lu, and Valentina E Balas
In the emerging smart city technology and industries, the role of artificial intelligence is getting
more prominent. This AI book series will aim to cover the latest AI work, which will help the naïve
user to get support to solve existing problems and for the experienced AI practitioners, it will assist
to shedding light for new avenues in the AI domains. The series will cover the recent work car-
ried out in AI and its associated domains, it will cover Logics, Pattern Recognition, NLP, Expert
Systems, Machine Learning, Block-Chain, and Big Data. The work domain of AI is quite deep, so
it will be covering the latest trends which are evolving with the concepts of AI and it will be help-
ing those new to the fiield, practitioners, students, as well as researchers to gain some new insights.
Cyber Defense Mechanisms
Security, Privacy, and Challenges
Gautam Kumar, Dinesh Kumar Saini, and Nguyen Ha Huy Cuong
Artificial Intelligence Trends for Data Analytics Using Machine Learning and Deep
Learning Approaches
K. Gayathri Devi, Mamata Rath and Nguyen Thi Dieu Linh
Transforming Management Using Artificial Intelligence Techniques
Vikas Garg and Rashmi Agrawal
AI and Deep Learning in Biometric Security
Trends, Potential, and Challenges
Gaurav Jaswal, Vivek Kanhangad, and Raghavendra Ramachandra
Enabling Technologies for Next Generation Wireless Communications
Edited by Mohammed Usman, Mohd Wajid, and Mohd Dilshad Ansari
Recent Trends and Applications
Edited by S. Kanimozhi Suguna, M. Dhivya, and Sara Paiva
For more information on this series, please visit: https://www.routledge.com/Artificial-
Intelligence-AI-Elementa ry-to-Advanced-Practices/book-series/CRCAIEAP
Recent Trends and Applications
Edited by
S. Kanimozhi Suguna, M. Dhivya, and Sara Paiva
First edition published 2021
by CRC Press
6000 Broken Sound Parkway NW, Suite 300, Boca Raton, FL 33487-2742
and by CRC Press

2 Park Square, Milton Park, Abingdon, Oxon, OX14 4RN
© 2021 Taylor & Francis Group, LLC
CRC Press is an imprint of Taylor & Francis Group, LLC
The right of S. Kanimozhi Suguna, M. Dhivya, and Sara Paiva to be identified as the authors of the editorial
material, and of the authors for their individual chapters, has been asserted in accordance with sections 77 and
78 of the Copyright, Designs and Patents Act 1988.
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 publish-
ers 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, transmit-
ted, 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, access www.copyright.com or con-
tact the Copyright Clearance Center, Inc. (CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400. For
works that are not available on CCC please contact mpkbookspermissions@tandf.co.uk
Trademark notice: Product or corporate names may be trademarks or registered trademarks and are used only
for identification and explanation without intent to infringe.
Library of Congress Cataloging‑in‑Publication Data
Names: Suguna, S. Kanimozhi, editor.

Title: Artificial intelligence (AI) : recent trends and applications /
edited by S. Kanimozhi Suguna, M. Dhivya, and Sara Paiva.
Description: First edition. | Boca Raton : CRC Press, 2021. | Series:
Artificial intelligence (ai): elementary to advanced practices |
Includes bibliographical references and index.
Identifiers: LCCN 2020048919 (print) | LCCN 2020048920 (ebook) | ISBN
9780367431365 (hardback) | ISBN 9781003005629 (ebook)
Subjects: LCSH: Artificial intelligence.
Classification: LCC Q335 .A8584 2021 (print) | LCC Q335 (ebook) | DDC
006.3--dc23
LC record available at https://lccn.loc.gov/2020048919
LC ebook record available at https://lccn.loc.gov/2020048920
ISBN: 978-0-367-43136-5 (hbk)

ISBN: 978-0-367-75969-8 (pbk)
ISBN: 978-1-003-00562-9 (ebk)
Typeset in Times
by Deanta Global Publishing Services, Chennai, India
Contents
Preface......................................................................................................................vii
Acknowledgements....................................................................................................ix
Editor biographies......................................................................................................xi
List of Contributors................................................................................................. xiii
Chapter 1 Advances in Large-Scale Systems Simulation Modelling

Using Multi-agent Architectures Optimized with Artificial
Intelligence Techniques for Improved Concurrency-Supported
Scheduling Mechanisms with Application to Wireless
Systems Simulation............................................................................... 1
P.M. Papazoglou and Dimitrios Alexios Karras
Chapter 2 Let’s Find Out: Why Do Users React Differently to

Applications Infused with AI Algorithms?......................................... 59
Jayden Khakurel, Indu Manimaran, and Jari Porras
Chapter 3 AI vs. Machine Learning vs. Deep Learning .................................... 73

R. Lalitha
Chapter 4 AI and Big Data: Ethical Reasoning and Responsibility.................... 83

Sweta Saraff
Chapter 5 Online Liquid Level Estimation in Dynamic Environments

Using Artificial Neural Network......................................................... 93
Thulasi M. Santhi and S. Sathiya
Chapter 6 Computer Vision Concepts and Applications................................... 111

Bettina O’Brien and V. Uma
Chapter 7 Generative Adversarial Network: Concepts, Variants, and

Applications....................................................................................... 131
K. Rakesh and V. Uma
v
vi Contents
Chapter 8 Detection and Classification of Power Quality Disturbances in

Smart Grids Using Artificial Intelligence Methods.......................... 149
Gökay Bayrak and Alper Yılmaz
Chapter 9 Robust Design of Artificial Neural Network Methodology to

Solve the Inverse Kinematics of a Manipulator of 6 DOF................ 171
Ma. del Rosario Martínez-Blanco,
Teodoro Ibarra-Pérez, Fernando Olivera-Domingo,
and José Manuel Ortiz-Rodríguez
Chapter 10 Generative Adversarial Network and Its Applications...................... 211

A. Vijayalakshmi and Deepa V. Jose
Chapter 11 Applications of Artificial Intelligence in Environmental Science.... 225

Praveen Kumar Gupta, Apoorva Saxena, Brahmanand
Dattaprakash, Ryna Shireen Sheriff,
Surabhi Hitendra Chaudhari, Varun Ullanat,
V. Chayapathy
Chapter 12 A Genetic Algorithm-based Artificial Intelligence Solution for

Optimizing E-Commerce Logistics Vehicle Routing....................... 241
Suresh Nanda Kumar and Ramasamy Panneerselvam
Chapter 13 Application of Machine Learning for Fault Detection and

Energy Efficiency Improvement in HVAC Application.................... 263
Umashankar Subramaniam, Sai Charan Bharadwaj, Nabanita
Dutta, and M. Venkateshkumar
Chapter 14 Smart City Using Artificial Intelligence Enabled by IoT.................. 279

P. Srividya and Sindhu Rajendran
Chapter 15 AI Emerging Communication and Computing................................. 293

N. Girija and T. Bhuvaneswari
Index.......................................................................................................................307
Preface
Artificial Intelligence (AI): Recent Trends and Applications covers AI technologies
and highlights the prospects of AI to problems in real-time day-to-day applications.
In short, AI is for everyone, everywhere, and in everything.
Artificial intelligence has embarked its niche in all fields of engineering and the
dissemination is seemingly important in interdisciplinary research. This book serves
as a background for covering the basic principles of AI; it elaborates the concepts of
artificial intelligence to counterfeit human intelligence, which requires learning and
reasoning.
The book encompasses both the theoretical aspects and recent trends of AI incor-
porated with deep learning strategies towards Smart city, Smart Grid, image process-
ing and computer vision, robotics, instrumentation and automation, etc. The readers
will benefit from the exhaustive range of applications in all fields of engineering
presented in this book.
vii
Acknowledgements
We would like to recognize CRC Press for providing us with the opportunity and
the professionalism shown by teams along the process. Namely, we would like to
thank Ms. Erin Harris and Keith Emmanual Arnold for all the support and leadership
during the course of publishing this book.
A word of appreciation and recognition to all the authors who have contributed
to this book. Also, a special recognition and our gratitude to all the reviewers who
made an extraordinary effort to enhance the quality of the final chapters of this
book.
Kanimozhi Suguna S has a great privilege to thank the Vice Chancellor,
Dean – School of Computing and other fellow colleagues of SASTRA Deemed
University, Thanjavur, for their assistance in and encouragement in throughout the
progress of the publication. She would like to extend her gratitude to her husband,
Shyam Sundar M, son Dharun Krishna S, and parents Gunavathi K and Subramanian
G. She would also like to thank her brother Arun Prasad S and all his family mem-
bers for their continuous support.
Dhivya wishes to thank Dr. Mohan Manghnani, Chairman, New Horizon Edu
cational Institutions and Dr. Manjunatha, Principal, New Horizon College of
Engineering, for their whole-hearted cooperation and great encouragement in all
endeavours. She also wishes to thank her parents for their continuous support and
motivation.
With great respect and honour, Sara Paiva would like to thank the Instituto
Politécnico de Viana do Castelo, Portugal and all her colleagues. Special thanks
go to her husband Rogério Paiva, children Diana and Leonardo Paiva, and also her
parents for all their support.
Obviously, a big word of appreciation goes to our families, our main source of
inspiration and strength, namely, in these difficult times we have lived in the last
year. Dedicated to The Almighty – The Supreme Power That Drives Us.
Dr. S. Kanimozhi Suguna

Dr. M. Dhivya
Dr. Sara Paiva
ix
Editor biographies
S. Kanimozhi Suguna received her B.Sc., M.C.A., M.Phil., and Ph.D., in 2005,
2008, 2009, and 2015, respectively. She has seven years of teaching experience and
is working as Assistant Professor in the Department of CSE, School of Computing,
SASTRA University, Thanjavur, India since 2017. Her research interests include
image processing, data mining, web mining, and wireless sensor networks. She
is an editorial member in IGI: Global and Editorial Advisory Board in various
International Conferences. She is a member of IEEE and CSI. She has published 4
book chapters, 12 international journals, and 5 conference presentations.
M. Dhivya received her B.E., M.E., and Ph.D. degree in Electrical Engineering in
2006, 2008, and 2013, respectively. At present, she is working with New Horizon
College of Engineering, Bangalore. She has worked as Associate Professor in the
Department of Electronics and Communication Engineering at Dr. N.G.P. Institute
of Technology. She has received a grant of Rs. 4,00,000 from Texas Instruments
for organizing four-day faculty empowerment programme on “Analog, Power,
Embedded Systems and Wireless (IoT).” She has guided 30 postgraduate scholars
in several disciplines: Applied Electronics, Electric Drives and Embedded Control,
Power Electronics and Drives and Control, and Instrumentation. Her research inter-
ests are wireless sensor networks, embedded systems, real-time systems, optimiza-
tion techniques, and machine learning.
Sara Paiva is Associate Professor at the Polytechnic Institute of Viana do Castelo.

She received her Ph.D. in Informatics Engineering from University of Vigo. She is
also a postdoctoral researcher at the University of Oviedo since January 2018; her
field of research is advanced driving assistants and urban mobility. Paiva coordi-
nates ARC4DigiT, the Applied Research Center for Digital Transformation (http://
arc4digit.ipvc.pt), created in January 2018. Her main line of research is urban mobil-
ity solutions. She has edited five books for Springer and IGI and other six are ongo-
ing. She has contributed more than 40 publications to several international journals,
conferences, and books. She is a frequent reviewer of journals and international con-
ferences and supervises several final projects at Bachelor’s and Master’s levels in her
main line of work.
xi
Contributors
Alper Yılmaz Indu Manimaran
Department of Electrical and Electronics Deaprtment of Computer Science
Bursa Technical University California State University
Turkey Long Beach, California
Bettina O’Brien Jari Porras

Department of Computer Science Department of Software Engineering
Pondicherry University LUT University
India Lappeenranta, Finland
Bhuvaneswari T. Jayden Khakurel

Department of CS&A Department of Child Psychiatry
Queen Mary’s College University of Turku
Chennai, India Turku, Finland
Dimitrios Alexios Karras
José Manuel Ortiz-Rodríguez
General Department
Laboratorio de Innovación y
National and Kapodistrian University of
DesarrolloTecnológicoenInteligencia
Athens
Artificial
Evia, Greece
Universidad Autónoma de Zacatecas
and
Zacatecas, México
Computer Engineering Department
Epoka University
Tirana, Albania Lalitha, R.
Department of Computer Science and
Fernando Olivera-Domingo Engineering
UnidadProfesionalInterdisciplinaria de Rajalakshmi Institute of Technology
Ingeniería Campus Zacatecas Chennai, India
InstitutoPolitécnicoNacional
Zacatecas, México Ma.del Rosario Martínez-Blanco
Laboratorio de Innovación y
Girija Narasimhan DesarrolloTecnológicoenInteligencia
Department of Information Technology Artificial
Higher College of Technology Universidad Autónoma de Zacatecas
Muscat, Oman Zacatecas, México
Gökay Bayrak Nabanita Dutta

Department of Electrical and Department of Energy and Power
Electronics Electronics
Bursa Technical University VIT University
Turkey Vellore, India
xiii
xiv Contributors
Papazoglou, P. M. Teodoro Ibarra-Pérez

General Department Laboratorio de Innovación y
National and Kapodistrian University of DesarrolloTecnológicoenInteligencia
Athens Artificial
Evia, Greece Universidad Autónoma de Zacatecas
Zacatecas, México
Rakesh K.
Department of Computer Science Thulasi M. Santhi
Pondicherry University Deaparment of Instrumentation and
India Control Engineering
Dr. B R Ambedkar National Institute of
Sai Charan Bharadwaj Technology
Department of Energy and Power
Jalandhar, India
Electronics
VIT University
Vellore, India Udendhran Mudalyar
Department of Computer Science and
Sathiya S. Engineering
Department of Instrumentation and Bharathidasan University
Control Engineering Tiruchirappalli, India
Dr. B R Ambedkar National Institute of
Technology Uma V.
Jalandhar, India Department of Computer Science
Pondicherry University
Sindhu Rajendran India
Department of Electronics and
Communication Uma Shankar Subramaniam
R. V. College of Engineering Renewable Energy Lab
Bangalore, India Prince Sultan University Riyadh
Saudi Arabia
Srividya P.
Department of Electronics and
Communication Venkateshkumar M.
R. V. College of Engineering Department of EEE
Bangalore, India Amrita Vishwa Vidyapeetham
University
Sweta Saraff Chennai, India
Department of Behavioral Sciences
Amity Institute of Psychology and Vijayalakshmi A.
Allied Sciences Department of Computer Science
Amity University Kolkata Christ(Deemed to be University)
India Bangalore, India
1 Advances in Large-Scale
Systems Simulation
Modelling Using Multi-
Agent Architectures
Optimized with
Artificial Intelligence
Techniques for
Improved Concurrency-
Supported Scheduling
Mechanisms with
Application to Wireless
Systems Simulation
P.M. Papazoglou and Dimitrios Alexios Karras
CONTENTS
1.1 Literature Review..............................................................................................3
1.1.1 Simulation Methodologies Applied in Wireless Communication
Systems (WCS)......................................................................................3
1.1.1.1 Simulation of WCS................................................................. 3
1.1.1.2 Discrete Event Simulation....................................................... 4
1.1.1.3 Event Scheduling....................................................................7
1.1.2 Channel Assignment in WCS.............................................................. 10
1.1.3 Multi-Agent Systems in WCS.............................................................. 12
1
2 Artificial Intelligence (AI)
1.1.3.1 Agent and Multi-Agent Systems........................................... 12

1.1.3.2 Multi-Agent Systems in WCS............................................... 13
1.1.4 The Concept of Cellular Network........................................................ 14
1.1.5 Simulation Languages (SLs)................................................................ 15
1.2 The Proposed Simulation Model..................................................................... 16
1.2.1 Network Structure............................................................................... 16
1.2.1.1 Operational Parameters........................................................ 17
1.2.2 Modelled Network Services and Channel Allocation......................... 17
1.2.2.1 Network Services.................................................................. 17
1.2.2.2 Channel Allocation............................................................... 18
1.2.2.3 Traffic Generation................................................................. 19
1.2.3 The Multi-Agent/Multilayered Model.................................................20
1.2.4 Theoretical Analysis of Agents Adapted to Modelled Network
Services................................................................................................ 22
1.2.4.1 Network Agent Definition..................................................... 22
1.2.4.2 Architecture of the Intelligent Network Agents................... 23
1.2.4.3 Network Agent Interface.......................................................25
1.2.4.4 Network Agents Which Maintain State................................ 27
1.2.4.5 Network Agent Utility Functions.......................................... 27
1.2.4.6 Multi-Agent Encounters........................................................28
1.2.5 Event Interleaving as Scheduling Technique Based on Real-
Time Scheduling Theory..................................................................... 29
1.2.5.1 Real-Time Scheduling Algorithms for Implementing
Synchronized Processes or Events........................................ 29
1.2.5.2 Process Life Span in a Real-Time Scheduling Set-Up......... 30
1.2.5.3 Scheduling Concurrent Events in WCS................................ 30
1.2.5.4 Response Time Analysis....................................................... 31
1.2.5.5 Pre-emptive Stationary Priority Scheduling (PSPS)............34
1.2.6 Supported DCA Variations..................................................................34
1.2.6.1 The Conventional Unbalanced Variation (Classical DCA)...34
1.2.6.2 The Conventional Balanced Variation (Min Cell Congestion)..35
1.2.6.3 The Conventional Best CNR Variation................................ 35
1.2.6.4 The Conventional Round Blocking Variation....................... 36
1.2.6.5 The Proposed Novel Artificial Intelligence Based
Balanced and Best CNR DCA Variation for
Concurrent Channel Assignment.......................................... 37
1.2.7 Implementation Architectures............................................................. 38
1.2.7.1 Conventional Model.............................................................. 38
1.2.7.2 Concurrent Models............................................................... 38
1.3 Simulation Model Evaluation.......................................................................... 41
1.3.1 Network Behaviour.............................................................................. 41
1.3.2 Monte Carlo Simulation Method......................................................... 42
1.3.3 Simulation Model Behaviour............................................................... 42
1.3.4 Results Accuracy................................................................................. 42
1.3.5 Reference Analysis Model Employing One Cell Only........................ 43
Large-Scale Multi-Agent Systems Simulation 3
1.4 Experimental Results....................................................................................... 45

1.4.1 Indicative Results Based on Five Days of Network Operation............ 45
1.4.2 Model Behaviour Based on Architectural Variations......................... 45
1.4.3 Scheduling Mechanism Comparison................................................... 45
1.4.4 Response Time Analysis Results......................................................... 45
1.5 Conclusions and Future Work.......................................................................... 53
References................................................................................................................. 53
1.1 LITERATURE REVIEW
1.1.1 Simulation Methodologies Applied in Wireless
Communication Systems (WCS)
1.1.1.1 Simulation of WCS
A real wireless network’s efficiency and behaviour can be tested using simulation
systems without the need for field experiments and prototype creation. The simula-
tion solutions give the opportunity to grow to a desired wireless network channel
allocation schemes, network architectures, etc. The simulation software development
approach becomes a very critical issue influencing the resulting network model and
efficiency, due to the complexity of real wireless networks. A big challenge for wire-
less network simulation is the discovery of a way to tackle the actual actions of the
network and not just speed up execution time using parallel machines. The simula-
tion model and environment structure affect the performance of simulated wireless
networks, and for this reason the design and development of such systems is studied
thoroughly. Modern simulation tools provide network engineers with the opportu-
nity to develop and test wireless communication systems at low cost very quickly.
There are three major simulation techniques (Chaturvedi, A., et al. 2001): discrete
event simulation (DES), system dynamics, and multi-agents. The most widely known
simulation tools are based on the DES concept and use various model architectures
to implement. A more accurate and reliable simulation environment can be developed
with the help of efficient model architectures (Chaturvedi, A., et al. 2001; Liu, W.,
et al. 1996; Zeng, X., et al. 1998; Bajaj, L., et al. 1999; Kelly, O.E., et al. 2000; Liu, et al.
2001; Boukerche, A., et al. 2001; Bononi, L. and D’Angelo, G., 2003) to speed up
execution times. Rapid development of parallel systems with multiple processors has
contributed to more effective simulation execution. On the other hand, the program-
ming technology, and especially the multithreading systems, provides an alternative
approach to simulation model implementation. Inside the simulation model, the actual
network activities must be realistically modelled. In the case of cellular networks,
such operations are the essential network functions such as new call entry, realloca-
tion (handoff) (Krishna, S., et al. 2016), device movement, and call termination. The
simulation model will include sub-models for three types of basic components:
• Facilities by network
• Network operating parameters (e.g. number of cells, base station locations,
allocation channel schemes, etc.)
• Mathematical network models (e.g. propagation models, statistical distribu-

tions, signal computations, etc.)
The sequential simulation is a very time-consuming method due to the high complex-
ity of the models used (Liu, W., et al. 1996) and thus the parallelization is a critical
issue particularly for wireless networks of large scale (Liu, W., et al. 1996; Zeng, X.,
et al. 1998; Bajaj, L., et al. 1999; Kelly, O.E., et al. 1999; Liu, et al. 2001; Boukerche,
A., et al. 2001; Bononi, L. and D’Angelo, G. 2003). The key goal of parallel simula-
tion is the minimization of the execution time (Zeng, X., et al. 1998; Bajaj, L., et al.
1999). In the process of parallelization, sets of network entities have to be mapped to
multiple processors to achieve load balance (Zeng, X., et al. 1998). Multiple-processor
load distribution is a key issue (Liu, W., et al. 1996; Zeng, X., et al. 1998; Bajaj, L., et
al. 1999). Several features, procedures, and entities, such as geographical area (Kelly,
O.E., et al. 1999; Boukerche, A., et al. 2001), radio channels (Kelly, O.E., et al. 1999;
Boukerche, A., et al. 2001), interference calculations (Kelly, O.E., et al. 1999), mobile
hosts (MH) (Boukerche, A., et al. 2001), and network cells (Boukerche, A., et al.
2001) can be parallelized in parallel implementations. There are important problems
that need to be tackled effectively in order to achieve optimum parallelization, such as
synchronization of processors (Zeng, X., et al. 1998; Bajaj, L., et al. 1999; Boukerche,
A., et al. 2001), load balancing control (Liu, W., et al. 1996; Zeng, X., et al. 1998), and
cycle mapping to processors (Liu, W., et al. 1996; Zeng, X., et al. 1998). The above-
mentioned studies have resulted in two basic points for further investigation:
• How to achieve full parallelization for sophisticated computer systems

• How to model the current network environment and behaviour more effec-
tively using advanced programming principles
Advanced computer and programming technologies must be used to build an effec-

tive simulation model, tailored to the actual network (Papazoglou et al. 2008–2016).
1.1.1.2 Discrete Event Simulation

1.1.1.2.1 The Main Concepts of Discrete Event Simulation
DES (Subramania, S., 2001; Tolk, A. 2012; Barr, R., 2004; Goh, R.S.M. and Thng, I.,
L-J, 2003; Reddy, D., et al. 2006; Schriber, T.J., and Brunner, D.T., 1997; Misra, J., 1986;
Tropper, C., 2002; Balakrishnan, V., et al 1997; Jefferson, D.R., and Barnes, P.D., 2017)
represents the most well-known methodology of simulation, in particular for commu-
nication systems. According to the principle of DES, events occur within the simula-
tion time at discrete points in time. Simulation time progresses based on sequence of
events. These events express the basic actions within the physical network, such as new
call arrival. Each event is created with an exclusive time stamp which is later involved
when running the event. A scheduler defines the processing of events over simulation
time (Mehta et al. 2010; Siow, R., et al. 2004; Chung, K., et al. 1993; Whitaker, P., 2001;
Naoumov, V., and Gross, T., 2003) that picks out events with a minimum time stamp
associated with maximum priority. Therefore, a priority queue is the foundation of the
entire scheduling process. Characterized DES systems can be sequential or parallel.
Sequential DES systems are the most common in science community. In such systems,
in a three-step cycle, the scheduling mechanism can be analyzed:
• Dequeue: an incident of minimum time stamp is deleted from the queue

• Run: diagnosis of dequeued case
• Enqueue: entrance into the queue of a newly created event
ns-2, ns-3 (Fall, K., and Varadhan, K., 2015), widely accepted by the scientific com-
munity (Kurkowski, S., et al 2005), use this scheduling mechanism for event execu-
tion. In ns-2, ns-3 (Fall, K., and Varadhan, K., 2015), the scheduler selects the next
earliest incident, executes it until ending it up, and returns to run the next event of
highest priority or with least time stamp among the outstanding events. In ns-2, ns-3
(Fall, K., and Varadhan, K., 2015), only one operation can be executed at any given
time, and so it is a single-threaded simulator. If two or more events are scheduled to
take place (to execute) at the “same time,” their execution is performed in a first come
first scheduled scheme – first dispatched, based on the time stamp of each incidence
and thus, the simulation model’s adaptability to the actual network behaviour, includ-
ing all relevant network physical activities, is strongly based on the scheduling algo-
rithm. On the other hand, parallel implementation of DES systems was introduced in
the literature primarily to achieve speed up of execution. Due to the fact that the main
goal is load distribution and speed-up execution, the parallel DES systems do not
modify the principle of the event scheduling found in sequential DES. The system per-
formance is thus a critical point in terms of execution time (Liu, W., et al 1996; Zeng,
X., et al 1998; Bajaj, L., et al 1999; Kelly, O.E, et al 1999; Liu, et al. 2001; Boukerche,
A., et al 2001; Bononi, L. and D’Angelo, G., 2003). Parallel efficiency plays a major
role in the performance of the entire system (Liu, W., et al. 1996; Zeng, X., et al. 1998;
Kelly, O.E, et al. 1999; Boukerche, A., et al. 2001) and therefore synchronization of
multiple processors is important (Liu, W., et al. 1996; Zeng, X., et al. 1998).
1.1.1.2.2 Simulation Time Definition

The time can be defined in different ways with respect to the real time and simula-
tion time. There are three known definitions of time (Fujimoto, R.M. 2000):
• Physical time length

• Simulator period
• Official clock time
Physical time is the time in the physical (real) system; simulation time is the mod-
elled physical time in the simulation system; and wall-clock time is the simulation
program’s runtime.
The definition of simulation time is given in Fujimoto (2000) as follows:
«Simulation time is defined as a totally ordered set of values in which each value
represents an instant of time in the modelled physical system. Furthermore,
for any two simulation time values T1 representing physical time P1, and
T2 representing P2, if T1 < T2, then P1 occurs before P2, and (T2 − T1) is
equal to (P2 −P1) K for some constant K. If T1 < T2 then T1 is said to occur
before T2 and if T1>T2, then, obviously T1 happened after T2.»
1.1.1.2.3 Efficient Usage of Computer Technology for

Supporting Parallel DES Systems
The availability of computer technology and tools among academic and research
institutes led to the development of advanced simulation systems that effectively
confront the complexity and time of execution. Scientific community and industry
have a great interest in that field. In the case of speeding up the simulation execution
time, INTEL (Liu, W., et al. 1996) and DARPA (Zeng, X., et al. 1998; Bajaj, L., et
al 1999) supported several projects in educational institutions such as UCLA, but
according to Fujimoto et al. (2003), the effective simulation of large-scale networks
is still an unresolved problem. In general, parallel computing can be categorized
according to system features and capabilities (e.g. architecture). Multiprocessing,
computer cluster, parallel supercomputer, and distributed computing are the parallel
computing-based categories. In parallel implementation of DES systems, two dif-
ferent strong technologies were used: clusters and multiple processor machines. A
cluster usually consists of two or more workstations connected via a local network
(Baker M., et al 2000). It is possible to view this group of loosely coupled computers
as one single computer. The most common cluster types are high-availability clus-
ters and high-performance clusters. High-availability clusters are used to improve
a cluster’s availability of the services it offers. High-performance clusters are used
mainly by splitting a computational function into more than one processing unit
to provide improved performance. One of the most common cluster projects is the
Beowulf project used in over 50 educational institutes and research centres. The
parallel computing system forms a computer of multiple processors. The process
to solve a problem in this scheme can be divided into smaller tasks performed by
different processors. There are several critical issues in parallel computing such as
synchronization and parallel overhead which affect the performance of the whole
system. Many strategies for execution time minimization were applied based on the
model’s thorough decrease (Liu, W., et al. 1996). If the parallelization is sufficiently
effective, the reduction of details of the model is not necessary. Also, in a paral-
lel system with N = P (N = partitions of the layout, P = number of processors), there
must be efficient synchronization between processors. Effective parallelization can
be accomplished by eliminating global variables and unnecessary model synchro-
nizations, effective partitioning (locality of exploitation and balance of loads), etc.
A range of workstation processors with a total of 16 processors is used in simula-
tion experiments of (Liu, W., et al. 1996) and (Zeng, X., et al. 1998). The use of 16
processors for over 200 network nodes provided major acceleration. The partitioning
scheme plays a major role in the resulting speedup according to Zeng et al. (1998).
In Kelly et al. (1999), interference calculations are parallelized and sub-geographic
points and sub-matrix zones for path losses are mapped as entities in one processor
(Kelly, O.E., et al. 1999). Multiple channel zones are mapped to multiple processors
according to Kelly et al. (1999), and significant speedup is achieved using up to eight
processors. For the effective simulation of wireless and mobile networks, a cluster
of workstations is used (Boukerche, A., et al. 2001). Quite impressive speedup is
accomplished using up to 16 processors based on Mobile Host partitioning. For par-
allel DES, a networked cluster of PCs use a set of physical execution units (Bononi,
L. and D’Angelo, G., 2003).
1.1.1.3 Event Scheduling
1.1.1.3.1 The Importance of Event Scheduling
Events, being the main entities of a DES system, express the physical activities of
a real-world wireless network. With respect to the aforementioned network facili-
ties, each service could be considered an incidence for a particular mobile user
(MU). During simulation time, an incidence generator creates events as, for instance,
new call arrivals in the system. Such an event is marked with a time stamp (within
simulation time) that specifies the starting execution point in time. A critical entity
within the simulation system, namely, the scheduler, is executing by selecting the
next earliest event, based on its associated time stamp, running it until ending it up,
and returning to execute the next event expressed by the next least time stamp. The
scheduling system is a standard tool within the actual wireless network for the event
service incidence sequence control. When an operation is not executed, the pending
operation set (PES) (Goh, R.S.M. and Thng, I., L-J, 2003; Tan, K.L., and Thng, L.-J.,
2000; Siangsukone, T., et al. 2003) is the set of all non-simulated and processed
tasks generated during simulation time. Consequently, PES corresponds to a priority
queue controlling the stream of events simulation based on the contemporary mini-
mum time stamp, that is the task of highest priority (Goh, R.S.M. and Thng, I., L-J,
2003). The selected scheduling method imposes how the actual network activities
that occurred can be reflected in the simulation model in a realistic way. Therefore,
scheduling could be viewed as a generalized mapping method within the simulation
time of the DES algorithm for the real network events-activities execution.
1.1.1.3.2 The Current Standard Event Scheduling

Mechanism: Calendar Queue (CQ)
The major application of priority queuing is the realization of the PES sets within
the DES simulation systems (Blackstone, J.H., et al 1981; Henriksen, J.O., 1977;
Kingston, J. H., 1984; McCormack, W.M. and Sargent, R.G., 1981). The CQ concept
was first introduced by Brown (1988), has been analyzed in Siangsukone et al. (2003),
and even nowadays is established as the most popular scheduling scheme among
the implemented DES systems such as ns-2, ns-3 (Berkeley, USA) (Fall, K., and
Varadhan, K., 2015), Ptolemy II (Berkeley, USA) (Whitaker P. 2001), Jist (Cornell
University, USA) (http://jist.ece.cornell.edu/javadoc/index.html?jist /runtime/Schedu
ler.Calendar.html). Numerous other variations of the CQ aiming at increasing per-
formance of the queuing system, as for instance by optimally resizing the queue,
have been proposed in the literature such as DSplay (Siow, R. et al. 2004), MList
(Goh, R.S.M. and Thng, I., L-J, 2003), Markov hold model (Chung, K., et al. 1993),
and SNOOPY CQ (Tan, K.L., and Thng, L.-J., 2000). The CQ concept is derived
from the common desktop calendar of one-page entry every day. Each incident is
scheduled on the relevant calendar page. Each event’s schedule timing defines its
priority. If an event on the calendar is enqueued, then this event is scheduled for
future running. The earliest event within the calendar is dequeued by searching it
within the relevant page of the current date and removing it from that page (Brown,
R. 1988).
A CQ scheme is considered to consist of an array of lists. Each such list queue
contains future incidences. According to the CQ principle, a large queue of N events
is partitioned to M shorter queues called Buckets. Each bucket is associated with a
specific time range corresponding to future events executions. Any incidence bound
to an occurrence time t(e) is associated with the mth bucket in year y (y = 0, 1, 2, …)
if and only if
(
ë )
t (e) Î é ( yM + m ) d , ( yM + m + 1) d ù
û
(1.1)
In order to find the associated relevant bucket number m(e) where an incidence e will
occur at time t(e), the following type is involved:
ê t ( e) ú
m (e) = ê ú mod M (1.2)
ë d û
Consider that N = 10, δ = 1, M = 8, and t(e) = 3.52 (Figure 1.1) for a new incidence e.
Using Equation 1.2, the relevant bucket number for the incidence e is m(e) = 3.
An analytical study of the CQ scheme can be found in Erickson et al. (1994).
1.1.1.3.3 Application of CQ in Sequential DES

Figure 1.2 demonstrates a complete CQ operation in a sequential system of DES. The
CQ initially includes six events (step 0) that are to be executed at a later time unit.
The event e1 (NC – New Call), with time stamp 3.62, will be dequeued first as it has
the highest priority among the queue buckets, having acquired the minimum time
stamp. A novel incidence with time stamp 9.98 is enqueued in step (3), and in step (4)
the event e2 (RC – reallocation of a call) is dequeued. The entire CQ function follows
the Dequeue-Run-Enqueue protocol. In any step of the entire operation, this rule can
be evaluated (e.g. Dequeue{step(9)}-Run{step(10)}- Enqueue{step(11)}).
FIGURE 1.1 Illustration of a CQ implementation with eight buckets.

FIGURE 1.2 Sample of a Sequential DES operation (events/facilities: NC – new call arrival,
RC – call reallocation/handoff, MC – movement of user running a call, FC – terminated call).
The generator of the incidences creates events with corresponding time signs. The
dequeued incidences are running either in rising priority order or in increasing time
stamp order (Figure 1.3). The final processes running is sequential oversimulation
time except for events of nearly identical time stamps.
1.1.1.3.4 Application of CQ in Parallel DES

Where a key goal is to speed simulation execution, parallel models and implementa-
tions are used.
Speeding up can be performed in a parallel DES system if the work load of the
total processing is spread over individual processors. Figure 1.4 shows a scenario
with a cellular network that is divided into four clusters. Each cluster contains seven
uniquely frequently used cells. A separate processor is assigned to the processing
load for simulation of all possible MU resources in each cluster.
In parallel DES, the implementation of just one central CQ is an incorrect selec-
tion since, given the multiple processor availability, the time stamps of the enqueued
events compel the entire system to be sequential. This is because all activities in any
cell must be carried out in a particular order based on their associative time stamps.
FIGURE 1.3 Event running following the dequeuing order of the processing unit (events/
facilities: NC – new call arrival, RC – call reallocation/handoff, MC – movement of user run-
ning a call, FC – terminated call).
The events belonging to various clusters can be executed in parallel according to

Figure 1.5. All the events are running serially within each processor and its associ-
ated cluster. Many more processors are required to obtain true competition. Parallel
sets of sequential events can run in parallel within this scheme. Therefore, only
selected rivalry can be accommodated within this framework, and only for services
that belong to different network partitions.
1.1.2 Channel Assignment in WCS

A cellular system’s capability may be defined in terms of the number of channels
available, or the number of users that the network can support at the same time. The
total number of channels made available to a system depends on each channel’s allot-
ted spectrum and bandwidth. The frequency spectrum available is limited and the
number of MUs is increasing day by day, therefore the channels have to be reused
as much as possible to increase the system capacity. One of the basic resource man-
agement issues in a mobile communication system is allocating channels to cells or
mobile phones. A channel allocation scheme has the function of allocating channels
to cells or MUs in a way that minimizes:
(A) the probability of discontinuing incoming calls;

(B) the probability of dropped calls, and
(C) the probability of any call carrier-to-interference ratio falling below the
prespecified value (Papazoglou et al. 2008–2016).
FIGURE 1.4 Excerpt of spatial partitioning/parallelization.
Many channel allocation schemes were widely invested in literature with a goal
of maximizing reuse of frequency. Channel allocation schemes are classified into
three strategies: fixed channel allocation (FCA) (Zhang, M. and Yum, T.S., 1989;
Lai, W.K. and Coghill, G.C., 1996; MacDonald, V.H., 1979; Elnoubi, S.M., et al
1982; Xu, Z. and Mirchandani, P.B., 1982); dynamic channel allocation (DCA)
(Zhang, M. and Yum, T.S., 1989; Cimini L.J. and Foschini, G.J., 1992; Cox, D.C.
and Reudink, D.O., 1973; Del Re, E, Fantacci, R, and Giambene, G. 1996; Kahwa,
TJ, and Geor-gans, ND. 1978; Papazoglou, PM, and Karras, DA. 2016; Papazoglou,
PM, Karras, DA, and Papademetriou, RC. 2008a; Papazoglou, PM, Kar-ras, DA,
and Papademetriou, RC. 2008b; Papazoglou, PM, Karras, DA, and Papademetriou,
RC. 2009; Papazoglou, PM, Karras, DA, and Papademetriou, RC. 2011; Papazoglou,
PM, Karras, DA, and Papademetriou, RC. 2016; Sivarajan, KN, McEliece, RJ, and
Ketchum, JW. 1990; Subramania Sharma, T, and Thazhuthaveetil, MJ. 2001) and
HCA (Hybrid Channel Allocation).
FIGURE 1.5 Excerpt of different CQs based on network spatial partitioning (events/facili-
ties: NC – new call arrival, RC – call reallocation/handoff, MC – movement of user running
a call, FC – terminated call).
In FCA, every cell is permanently assigned a set of channels based on a pre-

estimated traffic intensity. No permanent allocation of channels to cells occurs
in DCA. Rather, all the channels available are open to all the cells, and the
channels are allocated in a dynamic manner on a call-by-call basis. The FCA
scheme is simple, but does not adapt to changing traffic and user delivery condi-
tions. In addition, frequency planning in a microcellular environment becomes
more difficult because it is based on accurate knowledge of traffic and interfer-
ence conditions. DCA overcomes these shortcomings however; under heavy load
conditions, FCA outperforms most known DCA schemes. HCA combines the
features of both the FCA and DCA techniques to overcome the drawbacks of
FCA and DCA.
1.1.3 Multi-Agent Systems in WCS

1.1.3.1 Agent and Multi-Agent Systems
An agent is considered to be a computational machine that autonomously interacts
with its environment and works for the reason for which it was programmed (Maes,
P., 1995), (Papazoglou et al. 2008–2016). Agents may be approached as organizations
committed to a specific task and smaller than a standard application (Smith, D.C.,
et al. 1994). An agent also perceives the conditions of the world, behaves according
to these conditions, interprets perceptions, and addresses issues (Hayes-Roth, B.,
1995). Mobile agents are used in a distributed environment such as the internet and
offer flexible networks customized to MU needs, and use the available bandwidth
effectively. There are certain basic attributes which distinguish agents from other
programs. Such qualities of greatest significance are as follows:
• Adaptability that reflects a learning and development potential centred

on growing experience. This attribute is, in other words, about the shift
of agent according to external or internal events (Splunter, S., et al. 2003;
Russell, S., and Norvig, P., 2002).
• Independence in the acts needed to achieve predefined goals. Growing
agent has the power over its own behaviour according to this characteristic
(Huhns, M., and Singh, M., Eds. 1998; Norman, T., and Long, D., 1995;
Ekdahl, B., 2001).
• Partnering with other stakeholders to reach mutual goals.
• Interactivity with surroundings.
According to Jennings (2000), a multi-agent system (MAS) has a number of agents

that interact with each other through communication. These agents function in an
environment and have different areas of environmental control. Many areas of influ-
ence can be coincided within the environment. In modern problems, the modelling
of all system aspects requires a number of agents, and so the MASs emerged. MASs
can be described as a loosely connected network of problem-solver entities (Sycara,
K., 1998) working together with the shared aim of solving the whole problem beyond
each individual entity’s solving capabilities. Agent technology has been used in the
management of telecommunications networks in many instances (Hayzelden, A.,
and Bigham, J., 1999; Bodanese, E.L, 2000; Iraqi, Y. and Boutaba, R., 2000; Jiang,
Y., and Jiang, J., 2008). In these cases, the architecture is straightforward. Modelling
of cellular systems and particularly the methodology of simulation have not been
presented in terms of MAS so far. Their simulation is based primarily on sequential
or parallel models (for faster execution) but not on models of the agents. According to
Wooldridge (2004), negotiation approaches are based on other components, such as
negotiation sets (possible agents’ proposals), protocols (definition of legal proposals),
tactics selection (usual private), etc.
Growing agent has its own view of the environment and also personal objec-
tive and resource claim in a competitive or collaborative environment. Negotiation
between the agents is a required re-requirement for achieving the goal and satisfy-
ing the specified con-stresses. Negotiations may be challenged as competitive or
cooperative (Zhang, X., et al. 2001). The negotiators are self-interested in successful
deals to achieve their own objectives. The negotiators are working together in joint
discussions to find a compromise for a shared target.
1.1.3.2 Multi-Agent Systems in WCS

For the issue of resource distribution, the MAS technology has been used in many
studies (Papazoglou et al. 2008–2016). Different network elements, such as Base
Stations (BSs), cells, etc. were modelled as agents within the established models. An
overview of communication systems agent technology is presented in Hayzelden and
Bigham (1999). This overview is focused on software agents used for the manage-
ment of communications. More specifically, agents can be used to deal with some
important issues, such as complexity of the network, mobility of the MU, and network
management. A MAS for the control of resources in multimedia wireless mobile
networks is provided in Iraqi and Boutaba (2000). The call dropping likelihood is
small based on the proposed MAS (Iraqi, Y. and Boutaba, R., 2000), although the
wireless network makes a high average usage of the bandwidth. According to Iraqi
and Boutaba (2000), the final decision to accept a call is based on neighbouring cells
participating. Therefore, every cell or BS has an agent working. A cooperative agree-
ment in a MAS is defined in Jiang and Jiang (2008) to help real-time load balancing
of a mobile cellular network. Within the current MAS, agents are used (a) for market
representation of different service providers and (b) for network operators handling
the radio capital of different network regions. According to Jiang and Jiang (2008),
the coordination of agents is done by messages, and negotiations are focused on the
final agreements. Negotiation is an intelligent control strategy in the above study to
dynamically change the shape and size of the cells and to manage the traffic load
over the network.
To suggest a distributed channel allocation scheme using intelligent software
agents, a detailed simulation model for wireless cellular networks was developed
by Bodanese (2000). In the above analysis, smart collaborative software agents
offer BSs autonomy, enhance network robustness, enable network resource negotia-
tion, and improve resource allocation. To this end, several aspects of infrastructure
and operation of the cellular network have been modelled. According to Bodanese
(2000), the basic features implemented in the model are call set-up, handoffs based
on signal strength and defined threshold, forced call termination emulation (due
to insufficient signal), Mobile Station self-location based on signal strength from
nearest BSs, Mobile Stations with arbitrary trajectories, cell boundaries, number of
Mobile Stations per unit. Four specific aspects of the configuration and function of
the entire network were modelled in Bodanese (2000). Those aspects include (a) the
network model defining the network layout (cell structure, BSs, MSs), (b) the mobile
station (signal calculations, call generation inter-arrival time, call length), (b1) call
server (SNR measurements), (b2) handoff, (b3) call dropping, (b4) call termination,
(b5) filter (sending packets from the radio link to the server), (b6) trajectory track-
ing, which is responsible for Mobile Station movement (random cyclical, driving on
a highway, etc.), (c) BS which includes SNR measurements, handoff (monitoring the
received voice packets), etc., (d) MTSO (Mobile Telephone Switching Office) which
offers services such as HLR (Home Location Register), VLR (Visitor Location
Register), etc., (d1) keeps track of each active MS. All the implemented network
models in Bodanese (2000) do not support multimedia real-time services. A novel
modelling methodology for supporting wireless network services is also described
in the current report, based on MAS technology.
1.1.4 The Concept of Cellular Network

The cellular principle divides the geographic area covered into a series of smaller
service areas called cells. That cell is fitted with a BS and a number of mobile ter-
minals (e.g. mobile phones, palms, laptops, etc.). The BS is fitted with reception and
radio transmission equipment. The mobile terminal inside a cell communicates with
the cell-related BS via wireless links. A number of BSs are linked via microwave
links or dedicated leased lines to the Base Station Controller (BSC). The BSC pro-
vides logic for the management of the base stations’ radio resources under its control.
As a MU moves from cell to cell, it is also responsible for transferring an ongoing
call from one base station to another. A mobile terminal must first obtain a channel
from the BS in order to establish a communication with a BS. A channel consists of
a pair of signal transmission frequencies between the BS and MU.
1.1.5 Simulation Languages (SLs)

The great interest in simulation applications led to the development of specialized
Simulation Languages (SLs) that offered the possibility of a developed model being
simulated quickly. The biggest advantage of the SLs is the significant reduction in
time for programming the model. This advantage, contrasting with the program-
ming time, helps the developer to give more time for model analysis and develop-
ment. Modern SLs provide design guidance over production and study. The SLs most
known offer several useful features:
• Are process or event oriented

• Mechanism simulating time flow
• Generation of random numbers and various distributions
• Fit for debugging devices
On the other hand, SLs have several drawbacks:
• High procurement and maintenance costs

• Time cost for the initial language learning
• High resource requirements in contrast with conventional programming
languages (computer power, memory)
In order to pick every SL correctly, multiple variables need to be taken into account.
Those characteristics include:
• SL-accessibility as a (free) commercial or academic resource

• SL technical features such as (a) how the SL encounters incidents, activi-
ties, and processes, (b) problem-solving usability, (c) data collection and
analysis capabilities, (d) model extension support, (e) random number and
sample generation, (f) debugging procedures
• The programming effort required
• Computer time
• Specifications for software resources
• The mobile model
Most approaches to simulation models and applications have allowed us using gen-
eral-purpose languages, general SLs, and packages for special-purpose simulations.
Languages of general use have the following principal characteristics:
• Bottom cost
• Are available
• No supplementary training is required
• Every model starts from the ground up
• Hard to check
• Reusability of code is minimal
• The business process period is a long one
General SLs deliver uniform modelling features, shorter development cycle, and
simple verification. These languages have higher costs, restricted portability, and
require more instruction.
Languages such as Simula (Nierstrasz, O., 1989), GPSS (Karian, Z.A., and
Dudewicz, E.J., 1998), SimScript (Russell, E.C., 1999), Parsec (Subramania, S.,
2001; Zeng, X., et al. 1998; Takai, M., 1999; Reddy, D., et al. 2006; Abar, S., et al.
2017), modsim (West, J. and Mullarney, A., 1998), slam (Miller, J.O., et al. 1988),
GlomoSim (Zeng, X., et al. 1998), and other special purposes of high-flexibility
simulation devices. Other software tools such as MATLAB have plenty of scientific
libraries and capabilities for the creation of portable script code but suffer from low-
performance execution. A large-scale simulation model includes a scalable network
environment with advanced features such as portability, internetworking, and high
network activity adaptability.
The invention and development of new languages for simulation introduces
important drawbacks:
• The new languages are specific to the domain and rarely adapted by the
scientific community.
• The respective libraries require designers to adapt their applications to spe-
cific needs.
• Designers can’t achieve high simulation kernel adaptability in their
applications.
Java language is the most appropriate to develop scalable, portable, and high-perfor-
mance network applications, and is adopted by the majority of the scientific com-
munity. On the other hand, Java supports multiple threads that mean manipulation of
the concurrent tasks. This functionality is very critical for supporting network events
at the same time.
1.2 THE PROPOSED SIMULATION MODEL

1.2.1 Network Structure
The cellular network consists of N cells and each of the cells includes a BS in the
centre position (Figure 1.6).
Each cell is divided into a mesh of spots where users may exist from the start of
the call or because of handoff situations.
FIGURE 1.6 Structure of cellular network model.
The basic parameter for mesh building is the fineness, which means the distance
between the spots.
1.2.1.1 Operational Parameters
A set of parameters determine the conditions of network operation, such as signal
propagation, signal rates, and MU behaviour. The parameter basics are: CNR (car-
rier-to-noise ratio) on cell edge (dB), CNIR (carrier-to-noise plus interference ratio)
threshold (dB), average call arrival rate (calls/hour, lambda), average call hold time
(seconds), simulation time, cell channels, path loss factor (alpha), standard shadow-
ing deviation (sigma), cell mesh fineness, etc.
1.2.2 Modelled Network Services and Channel Allocation

1.2.2.1 Network Services
1.2.2.1.1 New Call Arrival (NC)
The number or MUs is increasing, the calls by each MU are restricted, and so the
call arrivals can be considered as random and independent. In the simulation system,
the new calls result from a random or a Poisson distribution with regard to a pre-
defined regular pattern.
1.2.2.1.2 Call Termination (FC)

For each new MU, the call length is based on an exponential function. The call keep-
ing time for later review is applied to current simulation time. The related protocol
checks the phased call time for linked MUs.
1.2.2.1.3 Reallocation Management-Handoff (RC)

The computations are based on the intensity of the signal and how it affects adjacent
cells from other related MUs. If the CNIR threshold is not reached by a MU signal,
the procedure may attempt to find another suitable source. First, the algorithm calcu-
lates the strength of the signal between MU and BS and then calculates any interfer-
ence from connected MUs in later time. If an approved channel is identified, then the
new MU is allocated, otherwise the call will be dropped.
1.2.2.1.4 MU Movement (MC)

The algorithm locates the MUs which are related and adjusts their current positions.
A movement based on the Gaussian distribution is generated by the MU. This distri-
bution is also used in simulation models similar to that found in literature (Dixit et
al. 2001). The formula of Gaussian distribution probability density function is
1
e( )
2
- x - m / 2s 2
f ( x) = (1.3)
s 2p
where σ is the standard deviation and μ is the baseline expected value. The Gaussian
distribution applied has mean value 0 and standard deviation 1. Consequently, the
probability density function is
1 - x2 / 2
f ( x) = e (1.4)
2p
In the MU movement procedure, firstly a Gaussian number is generated, e.g. x1 and
the corresponding f(x1) whenx1 Î éë -0.5, 0.5ùû . If another Gaussian number, e.g. x2,
where x2 ³ f ( x1 ) , a MU move is generated. The new position of any MU is maxi-
mum two cells distance from the initiated cell.
1.2.2.2 Channel Allocation
1.2.2.2.1 Channel Allocation Criteria
Any channel allocation procedure is successful only if the following criteria are met:
• Channel availability
• Carrier strength (between MU and BS)
• CNR (signal purity)
• Signal to noise plus interference ratio CNIR (interference from other con-
nected MUs)
1.2.2.2.2 Channel Allocation Procedure and Calculation

After a new call arrival, several actions take place in turn:
(a) Check if the maximum MU capacity in the cell neighbour has been reached.
(b) Calculate a random MU position in the mesh.
(c) Place the new MU according to the cell’s BS position and mesh spot.
(d) Calculate the signal strength between BS and new MU in the call-initiated
cell.
Firstly, the shadow attenuation (Molisch, A., 2012; Lee, W.C.Y., 1995) is derived.
Next
s ×n
sh = 10 10 (1.5)
where σ is the shadowing standard deviation and n is the associated number from the
normal distribution. The distance attenuation dw can be derived from the shadow
attenuation and distance between MU and BS. Through MU and BS, the CNR could
be computed (Molisch, A., 2012; Lee, W.C.Y., 1995):
cnedge
cn = 10 10 × dw (1.6)
where cnedge is the CNR on cell edge (dB).
(e) Calculate interference among the new MU and other MUs that use the same
channel.
(f) Check if the CNIR ratio is acceptable according to a predefined threshold.
(g) If CNIR is acceptable, establish the new call and update UR, otherwise use
any alternative selected DCA variation.
1.2.2.3 Traffic Generation
When a new call arrival occurs with regard to Poisson distribution, a random number
x is generated from Poisson distribution and the corresponding P(x) is calculated as
follows:
e-l × l x
P( x ) = (1.7)
x!
where λ represents the new call arrival rate. This rate is analogous to the time of the
day. A fixed set of simulation time steps represents a whole day. Each day is divided
into five zones according to traffic conditions. Table 1.1 illustrates the five zones with
corresponding λ parameter. Zone 1 represents the hours 12–9 a.m. (λ = 1) and zone
3 the hours 1–4 p.m. (λ = 5).
TABLE 1.1
Daily Zones
Zone Percentage
Zone (Approximately) λ Description
1 34% 1 Least busy zone
2 21% 4
3 12% 5 Most busy zone
4 17% 3
5 17% 2
1.2.3 The Multi-Agent/Multilayered Model

The basic events like new call delivery, user movement, call status control etc. will
arise concurrently in a real-world cellular network. As soon as a new user attempts
to be connected to the network through a call, another call could be terminated
at the matching time, another user is moved or reassigned to a new channel, etc.
Hence, these things need to be simultaneously modelled. The main idea is that each
basic event is independent of each other, acting independently, interacting with the
environment, and being able to be implemented as an agent. The entire structure is
divided into three layers in the proposed architecture (Figure 1.7).
FIGURE 1.7 The proposed layered agent architecture.

FIGURE 1.8 Three agent sets for three individual MUs.
The fundamental layer (layer 1) embodies the structure of the cellular network,
where the basic events (new call, call rearrangement, user movement, call termina-
tion) take place. Layer 2 is made up of four agents that implement the synchronized
events and describe the behaviour of the network. The control agent (main agent) that
exists in the third layer activates the system with corresponding event agents. The set
of four agents is recurring for every individual MU (Figure 1.8).
The main agent includes a clock logic which is responsible for the layer 2 agents’
activation and ensures that the additional procedures are triggered in the correct
order. The agents communicate for the activation status through layers 2 and 3 and
exchange information (messages) etc. Event agents are independent entities that react
with the appropriate environment and are coordinated by the control agent. The cel-
lular network environment includes parameters such as information about the signal
power, user characteristics, network status, etc. Every agent is implemented as a Java
thread and is defined in relation to layered architecture by state, actions, and position.
Agents in layer 2 are concurrently executed according to signals from the control
node. The simulation time changes only when the layer 2 agents have completed the
concurrent acts. Layer 1 uses shared data objects that are protected from the event
agents in order to simultaneously access (read or write). Each event agent keeps the
control agent informed about the status of its execution. The control agent is active,
while the time for simulation is not over and so the rest of the agents. This agent has
a sequential step-value clock (e.g. 1,2,3, etc.). A corresponding action is turned on
in each value. All the acts (agents and supplementary procedures) are carried out as
threads. The requisite supplementary activities (preparation tasks) are triggered in
the first phase of the clock, while the other agents and procedures are disabled. In
the second step of the clock, event agents are turned on while other procedures are
disabled. Control agent prevents simultaneous activation within simulation time of
the event agents, initial and final simulation procedures.
1.2.4 Theoretical Analysis of Agents Adapted

to Modelled Network Services
1.2.4.1 Network Agent Definition

According to Wooldridge and Jennings (1995), “An agent is a computer device
located in any setting that is capable of autonomous action in this environment to
meet its design goals.”
An agent communicates with its environment, obtains input information from
it, and carries out a reasonable appropriate behaviour that affects this environment
(Figure 1.9).
NC and RC agents (NCA, RCA) interconnect with the cellular network (envi-
ronment), obtain input information (blocking the probability-network performance,
decreasing RCA probability), and perform certain actions (giving priority to new
calls or handovers for different MUs) affecting network efficiency (Figure 1.10).
FIGURE 1.9 Agent definition.
FIGURE 1.10 Network agent definition.

The agents’ main features can be concisely outlined as follows:
• Responsiveness. An agent perceives its environment and reacts to fulfil

the design goals. NCA perceives network efficiency and (a) prioritizes new
calls and (b) negotiates the best deal with RCA to achieve its design goal
of reducing blocking risk (network performance optimization). RCA works
similarly but with probability dropping.
• Pro-activeness. Takes the initiative to demonstrate the goal-oriented
behaviour to achieve the design goals. To get performance benefits for the
network, network agents send messages to other MU agents (NCA to RCA
and vice versa) in order.
• Socio-power. Interaction with other MU agents to attain the concept goals.
NCA works with RCA to reach design goals.
1.2.4.2 Architecture of the Intelligent Network Agents

Let’s assume that the conceivable discrete states of the network setting can be des-
ignated by the set E as
E = {e, e¢,¼} (1.8)
Moreover, let’s assume that the probable discrete states of the wireless network set-
ting up can be defined by the set E as
E = {LL, LH , HL, HH} (1.9)
where the memberships of E signify the network performance, L signifies low level,
and H the high level. The pairs are linked to blocking and dropping probability,
respectively.
On the other hand, it is adopted that each agent has a set of possible interactions
with this set-up. These interactions change the environmental status and are deter-
mined by the set
Ac = {a k 0 , a k1,¼} (1.10)
In the case of network set-up, the matching actions are determined by the set
Ac = {INPNC , INPRC , DePNC , DePRC , DN NC , DN RC } (1.11)
where INP is the action “Increase Priority,” DeP represents the action “Decrease
Priority,” and, finally, DN is the action “Do Nothing.”
The external network set-up changes its state with regard to the above-mentioned
activities. A sequence of actions results in a sequence of environmental state changes.
Thus, a run r of an agent within the environment can be defined as
a0 a1 a2 a3 a u-1
r : e0 ® e1 ® e2 ® e3 ® ® eu (1.12)
A run r for the cellular network might develop
INPNC , DN RC DN NC , DN RC DN NC , INPRC DN NC , DN RC a u-1

r : HL ® LL ® LH ® LL ® ××× ® eu (1.13)
Let, also, consider the following sets:
R: Set of possible finite sequences (over E and Ac)

R AC: Subset of R that ends with an action
RE: Subset of R that ends with an environment state
A state transformer function has been made known by Fagin et al. (1995) in order to
depict the effect of an agent activity on the network set-up:
t : R Ac ® g ( E ) (1.14)
The previously mentioned function associates a run to a set of probable environmen-

tal states. Assuming that no successor state exists to r, τ(r) is developed as
t (r ) = Æ (1.15)
The entire environment is defined (states, transformer function) as
Env = E, e0 ,t (1.16)
where Ε is the state set, eo is the initial state, and τ is the transformer function. For
modelling agents, it is adopted that an agent characterizes a function for mapping
runs to activities and thus:
Ag : R E ® Ac (1.17)
In other words, an agent decides about actions (to select an appropriate action to
perform) based on the past events of the system. For expressing the entire system
(agents, environment), a suitable set is developed:
R ( Ag, Env ) (1.18)
Finally, the sequence (e 0 ,a 0 , e1,a1, e 2 ,… )expresses a run of an agent Ag (in the net-
work set-up) Env = E, e0 ,t , if:
a 0 = Ag ( e0 ) (1.19)
A run of agent NCA or RCA is expressed for instance by the sequence

( HL < INPNC >, LL < DN >, LH <,…), if IPNC = Ag ( HL )
and for u > 0,
eu Î t ( e0 , a 0 ,..., a u -1 ) (1.20)
a u = Ag ( e0 , a 0 ,..., eu ) (1.21)
In the case of network set-up and for u > 0
eu Î t ( HL < INPNC , DN RC >,¼, a u -1 ) (1.22)
a u = Ag ( HL < INPNC , DN RC >,¼, eu ) (1.23)
where Ag corresponds to NCA or RCA.
1.2.4.3 Network Agent Interface

As mentioned above, an agent perceives environment and acts on it. These two dis-
tinct actions are expressed by two functions separately (Figure 1.11).
Correspondingly, NCA and RCA, perceive network set-up and react on it. These
two distinct actions for NCA and RCA are expressed by two functions, respectively
(Figure 1.12).
FIGURE 1.11 Agents interface.
FIGURE 1.12 Network agents interface.

The “perceive” function maps environment states to observations and “activity”

maps sequences of perceptions to actions.
As a concrete example of the above framework, let x express the statement “met-
ric M1 is adequate” and let y represent the statement “metric M2 is adequate.” Thus,
the set E contains four combinations of x and y. This set can be expressed as follows:
E= {{x , y} ,{x , y} ,{x, y} ,{x, y}} (1.24)
with
e1 = { x , y } , e2 = { x , y} , e3 = { x, y } , e4 = { x, y} (1.25)
Network behaviour is evaluated through two basic statistical metrics which are the
blocking and dropping likelihoods. Thus, (1.24) and (1.25) will be expressed in terms
of the above metrics as follows:
E= {{B, D},{B, D},{B, D},{B, D}} (1.26)
with
e1 = {B, D} , e2 = {B, D} , e3 = {B, D} , e4 = {B, D} (1.27)
where B represents the statement “Blocking possibility is adequate” and D repre-

sents the statement “Dropping possibility is adequate.” Now, the set E contains four
mixtures of B and D.
With regard to (1.24) and (1.25), the “perceive” function of the agent, will have
two observations in its range, P1 and P2 that indicate if the metric M1 is acceptable
or not. The behaviour of the “perceive” function can be described as follows:
ì p1 if e = e1 or e = e2 ü
see(e) = í ý (1.28)
î p2 if e = e3 or e = e4 þ
According to (1.26) and (1.27), the “perceive function” of the NCA will have two
observations in its range P1 and P2 that indicate if the blocking possibility is accept-
able or not. The behaviour of the “perceive” function can be outlined as follows:
ì P1 if e = e1 or e = e2 bad ü
see(e) = í ý (1.29)
î P2 if e = e3 or e = e4 good þ
Identically for RCA, the perceive function see(e) is formulated as follows:
ì P1 if e = e1 or e = e3 bad ü
see(e) = í ý (1.30)
î P2 if e = e2 or e = e4 good þ
With two given environmental states e Î E and e¢ Î E , then e~e’ can be written only
if see(e) = see(e’). An agent has perfect perception if the different environment states
are equal to distinct observations. In such case
~= E (1.31)
In contrast with (1.15), when the perception of an agent does not exist,
~ =1 (1.32)
1.2.4.4 Network Agents Which Maintain State

In many cases, an agent maintains state. In such a case, there are two additional
objects within the internal structure (Figure 1.13). In the proposed MA model, each
of the two basic agents (NCA, RCA) can be in one of the following states: (a) active
(in cooperation), (b) active (in competition), (c) inactive (Figure 1.14).
The agent (internal) state is updated by the “next” function. This function can be
expressed as next(i0,see(e)) and the corresponding action is action(next(i0,see(e))),
where i0 is the internal initial state.
1.2.4.5 Network Agent Utility Functions

A different utility function can be assigned to each agent (NCA, RCA) in order
to “measure” how good the corresponding outcome is (blocking/dropping). This
FIGURE 1.13 Agent with state.
FIGURE 1.14 Network agent with state.

function assigns a real number to each outcome, indicating how good the outcome
is for the selected agent. In other words, this utility function defines the preference
ordering over all the outcomes.
Let ω and ω’ be two possible outcomes in Ω set (where Ω = {ω1,ω2,…}), with
utility functions that give
ui (w ) ³ ui (w¢ ) (1.33)
Based on (1.16), agent i prefers better the ω outcome.
1.2.4.6 Multi-Agent Encounters
In a large-scale environment with more than one agent, except the environment
itself, the agent encounters also have to be modelled. Assume that there are two pos-
sible actions by two agents such as “C”, which means “Cooperate”, and “D”, which
means “Defect” and let the action set Ac = {C,D}. Based on the above, the environ-
ment behaviour can be modelled with the function
t : Aci ´ Ac j ® W (1.34)
where Aci and Acj represent the two agents i and j, respectively.
As an example, let the environment function
t ( D, D ) = w1, t ( D, C ) = w2 , t ( C , D ) = w3 , t ( C , C ) = w4 (1.35)
The two possible actions for NCA and RCA are the Cooperation (CR) and Competition
(CT) and so the action set becomes Ac = {CP, CT}. Now the expression (1.35) is as follows:
t ( CT , CT ) = w1,t ( CT , CR ) = w2 ,t ( CR, CT ) = w3 ,t ( CR, CR ) = w4 (1.36)
According to (1.35), each action is mapped to a different outcome.

Using utility functions for the ω in (1.35), let
ui (w1 ) = 1 ui (w2 ) = 1 ui (w3 ) = 4 ui (w4 ) = 4

(1.37)
u j (w1 ) = 1 u j (w2 ) = 4 u j (w3 ) = 1 u j (w4 ) = 4
The corresponding utility functions (NCA, RCA) in (1.18a) are
uNC (w1 ) = 1 uNC (w2 ) = 1 uNC (w3 ) = 4 uNC (w4 ) = 4

(1.38)
uRC (w1 ) = 1 uRC (w2 ) = 4 uRC (w3 ) = 1 uRC (w4 ) = 4
From (1.35) and (1.37), the outcomes for every action combination of the two agents
i,j can be expressed as follows:
ui ( D, D) = 1 ui ( D, C ) = 1 ui (C , D) = 4 ui (C , C ) = 4
(1.39)
u j ( D, D ) = 1 u j ( D, C ) = 4 u j (C , D) = 1 u j (C , C ) = 4
Combining now (1.36) and (1.38) for NCA and RCA, the outcomes can be expressed
as follows:
uNC (CT , CT ) = 1 uNC (CT , CR) = 1 uNC (CR, CT ) = 4 uNC (CR, CR) = 4
(1.40)
uRC ( CT , CT ) = 1 uRC (CT , CR) = 4 uRC (CR, CT ) = 1 uRC (CR, CR) = 4
The only possible agent actions for the given outcomes can be rewritten (see (1.39)):
C , C ³i C , D >i D, C ³i D, D (1.41)
In the same way, the possible NCA, RCA actions based on (1.20a) are
CR, CR ³ NC CR, CT > NC CT , CR ³ NC CT , CT (1.42)
It is obvious from (1.39), (1.40), and (1.41) which action will be selected from each
agent, and thus each agent knows exactly what to do.
1.2.5 Event Interleaving as Scheduling Technique

Based on Real-Time Scheduling Theory
1.2.5.1 Real-Time Scheduling Algorithms for Implementing
Synchronized Processes or Events
Real-time scheduling is the most commonly recognized method for handling and
running simultaneous tasks where response time is a critical problem. The principle
of real time scheduling can be used to establish an alternative scheduling of events
compared to the state-of-the-art scheduling mechanism (CQ) used in DES systems
to accommodate concurrent events.
Real-time (RTS) systems are commonly used in a range of vital applications,
including robotics, avionics, telecommunications, process control, etc. In several
embedded systems, RTSs are also used. The common aspect of the above programs
is the tight deadlines for production tests. In other words, the timing of the results is
critical and in some cases even harmful. According to Burns and Wellings (2001),
“Real-time systems are those whose correctness depends not only on the rationality
of the computational results, but also on their precise timing.” According to Nahas
(2014), the interaction of the real-time control system with the environment requires
different components, such as sensors that read the external environment state. The
software architectures are common RTS implementation. Based on Nahas (2014)
and Locke (1992), these architectures can be classified into (a) cyclic executives, (b)
event-activated simultaneous task systems, (c) message-passing systems, and (d) cli-
ent–server systems. A specialized scheduler is required in concurrent task systems
(Nahas, M., 2014) in order to take scheduling decisions as the notion of a task is
retained in real time. The real-time scheduling theory is one way of predicting the
timing behaviour of complex multitasking software. Several developments have been
made since the initial formulation of the scheduling theory, such as rate monotonic
analysis in Liu and Layland (1973) and deadline monotonic analysis in Audsley et
al. (1992). These two improvements were incorporated into the scheduling theory
of fixed priorities (Audsley, et al. 1995). Some very important characteristics of the
RTSs found in Buttazzo (2011) are (a) repetitive contact with the environment, (b)
multiple actions concurrently transitioning rapidly to events and requiring a high
degree of competition, (c) competition for shared resources, (d) actions caused exter-
nally by events (within the system) or after time development, (e) must be stable in
overload, and (f) must be maintainable and of scalable open architecture.
1.2.5.2 Process Life Span in a Real-Time Scheduling Set-Up

The process life span in an RTS can be investigated by utilizing the single-queue
methodology combined with the pre-emption scheme.
An RTS consists of three basic components (Fidge, C.J., 2002): (a) a collection
containing the computational processes to be performed (typically subroutines with
a private control thread), (b) a run-time scheduler (e.g. dispatcher) specifying the
process execution sequence, and (c) a collection of common resources to be accessed.
Figure 1.15 demonstrates the standard life span of a job execution through a queue
from event to termination.
The processes that are facilitated by the system can be characterized by the time
features of arrival as (a) periodic (non-changing static arrival intervals) (Buttazzo,
G.C, 2011), (b) aperiodic (random arrivals) (Sprunt, B. 1990), and (c) infrequent (they
have only a non-changing minimum inter-arrival time) (Sprunt, B. 1990).
1.2.5.3 Scheduling Concurrent Events in WCS

In a wireless set-up, where events occur synchronously, the performance of the net-
work depends not only on the rationality of the computational results, but, also on
the correctness of the time sequence in which the results are encountered, implying
that the logical sequence of the various network procedures is also related to efficient
bandwidth management. Network operations such as new call entry, reallocation
(handoff), call termination, and so on can be regarded as tasks the network needs
to perform. A major role for the success of the resulting network is the scheduling
mechanism that manages the process under service. That is, this framework deter-
mines how, in terms of network performance metrics, the network can precisely
express the synchronized processes (incidents) in the most efficient way. The prog-
ress and actions of the event service may be seen by applying the response time
analysis as a first step. The sequential execution of an event is due to the existence of
one processor in conventional computers. The most common simulation tools, such
FIGURE 1.15 Task lifecycle.

Another random document with
no related content on Scribd:
got to go down the wind like a dead leaf afore them, because I soon saw
that under her mild words, Susan weren't going to be shook."
"She wouldn't be. There's no strength like the strength of a woman who
gets her only chance. She knows, poor dear, 'tis Palk or nothing."
"I told 'em to get out of my sight for a pair of cold-blooded, foxy devils
—yes, in my anger I said that—and so they have; and soon, no doubt,
they'll be gone for good and all. And that's the middle and both ends of it;
and the worst and wickedest day's work ever I heard tell about."
"You've dropped below your usual high standards, if I may say so,"
answered Melinda. "Little blame to you that you should feel vexed, I'm
sure; but 'tis more the shock than the reality I believe. I feel the shock
likewise, though outside the parties and only a friend to all. 'Tis so unlike
anything as you might have expected, that it throws you off your balance.
Yet, when you come to turn it over, Joe, you can't help seeing there's rhyme
and reason in it."
"You say that! For a woman to fly from the safety and security of her
father's home—and such a father—to a man who don't even know what
work he's going to do when he leaves me. And a wretch that's proved as
deep as the sea. Can't you read his game? He knows that Susan be my only
one, and bound to have all some day—or he thinks he knows it. That's at the
bottom of this. He looks on and says to himself, 'All will be hers; then all
will be mine.'"
"Don't you say that. Keep a fair balance. Remember you held a very
high opinion of Palk not two months agone, when he showed by his acts to
his dead sister's child that he was a high-minded man."
"I'll thank you to keep my side of this, please," he answered. "I don't
much like the line you're taking, Melinda. Just ax yourself this: would any
man, young or old, look at Susan as a possible help-mate and think to marry
her, if he warn't counting on the jam that would go with the powder? She's
my child, and I'm not one to bemoan my fortune as to that, but a woman's a
woman, and was the male ever born who could look at Susan as a woman?
You know very well there never was."
"You couldn't; but men ain't all so nice as you about looks. And you
can't deny that apart from being a bit homely, Susan——"
"Stop!" he said. "I believe you knew about this all the time and be here
as a messenger of peace! And if I thought that——"
"Don't think nothing of the sort, there's a good man. I'd so soon have
expected the sun to go backward as hear any such thing. But 'tis done on
your own showing, and you must be so wise as usual about it and not let the
natural astonishment upset your character. It's got to be, seemingly. So start
from there and see how life looks."
Melinda indeed was also thinking how life looked. Her mind ran on and
she had already reached a point to which Mr. Stockman's bruised spirit was
yet to bring him. She prepared to go away.
"I won't stop no more now. You'll have a lot to think over in your mind
about the future. Thank goodness you be well again—and never looked
better I'm sure. What's their plans?"
"Damn their plans—how about my plans?"
"You'll come to your plans gradual. And don't think 'tis the end of the
world. You never know. When things turn inside out like this, we be often
surprised to find there's a lot to be said for changes after all."
"'Tis mortal easy to be wise about other folk's troubles," he said.
Then Mrs. Honeysett departed and felt Joe's moody eyes upon her back
as she went slowly and thoughtfully away. Soosie-Toosie's eyes were also
upon her; but that she did not know.
CHAPTER XXX
THE NEST
Joe Stockman, like a stricken animal, hid himself from his fellow men
at this season; yet it was not curious that he should conceal his tribulation
from fellow men, because he knew that sympathy must be denied. To run
about among the people, grumbling because his daughter had found a
husband, was a course that Joe's humour told him would win no
commiseration. He was much more likely to be congratulated on an
unexpected piece of good luck. Even Melinda, with every kindly feeling for
him, proved not able to show regret; and if she could not, none might be
looked for elsewhere. But he made it evident to those chiefly involved that
he little liked the match; he declined to see any redeeming features and
went so far as to say that the countryside would be shocked with Susan for
leaving her father under such circumstances. To his surprise he could not
shake her as at first he had hoped to do. She was meek, and solicitous for
his every wish as usual; she failed not to anticipate each desire of his mind;
she knew, by long practice, how to read his eyes without a word; but upon
this one supreme matter she showed amazing determination.
She did not speak of it; neither did Thomas, and when his master, who
had failed for the moment to get a new horseman worthy of Falcon Farm,
invited Palk to stop another month, he agreed to do so. But Thomas
grumbled to Maynard when they were alone, and at the same time heard
something from Lawrence that interested him.
They were hoeing the turnips together and the elder spoke.
"There's no common decency about the man in my opinion," he said.

"Goodjer take him! He's like a sulky boy and pretends that facts ban't facts,
while every day of the week shows they are. And patience is very well, but
it don't make you any younger. Here I've pleased him by promising to stop
another month, and when I did that, I had a right to think it would break
down his temper and stop the silly rummage he talks about a thankless child
and so on. You know how he goes on—chittering at me and Susan, but
never to us—just letting out as if he was talking to the fire, or the warming-
pan on the wall—of course for us to hear."
"He's took it very hard no doubt. Of course it's a shatterer. He didn't

know his luck; and when you suddenly see your luck, for the first time just
afore it's going to be taken away from you, it makes you a bit wild,"
explained Lawrence.
"Let him be wild with himself then, and cuss himself—not us. Look at it
—I meet his convenience and go on so mild as Moses, working harder than
ever, and all I get be sighs and head-shakings; and you always see his lips
saying 'sarpent' to himself every time you catch his eye. It's properly
ondacent, because there's duties staring the man in the face and he's trying
his damnedest to wriggle out of 'em!"
"What duties?"
"Why, his daughter's wedding, I should think! Surely it's up to him,

whatever he feels against it, to give the woman a fatherly send off. Not that
I care a cuss, and should be the better pleased if he wasn't there glumping
and glowering and letting all men see he hated the job; but Susan be made
of womanly feeling, and she reckons he did ought to come to the church
and give her away, all nice and suent, same as other parents do. And after
that there ought to be a rally of neighbours and some pretty eating and
drinking, and good wishes and an old shoe for luck when us goes off to the
station man and wife. And why the hell not?"
"I dare say it will work out like that. You must allow for the shock,
Tom. He'd got to rely on you and your future wife like his right and left
hand; and to have the pair of you snatched away together—— He's a man
with a power of looking forward and, of course, he can see, in a way you
can't, what he'll feel like when you both vanish off the scene."
"You be always his side."
"No, no—not in this matter, anyway. I know very well what you feel
like, and nobody wishes you joy better than me. You've got a grand wife,
and I've always thought a lot of you myself as you know. But 'tis just the
great good fortune that's fallen to you makes it so much the worse for him.
He knows what he's losing, and you can't expect him to be pleased. He'll
calm down in a week or two."
"Let the man do the same then and take another. There's a very fine
woman waiting for him."
"There is; and he'll take her no doubt; but there again, he knows that
you can't have anything for nothing."
"He had his daughter for nothing."
"Yes, and got used to it; but he won't have Melinda Honeysett for
nothing. A daughter like Susan gives all and expects no return; a wife like
Mrs. Honeysett will want a run for her money. And Joe knows mighty well
it will have to be give and take in future."
"Quite right too."
"There's another thing hanging over master. It won't seem much

compared with you going. But I'm off before very long myself."
"By gor! You going too!"
"In the fall I reckon."
"When he hears that, he'll throw the house out of windows!"
"Not him. I'm nobody."
"If it's all the same to you, I'd be glad if you didn't break this to
Stockman till our job's a thought forwarder," said Thomas. "He can only
stand a certain amount. You was more to him than me really. This will very
like turn him against human nature in general, and if he gets desperate, he
may disgrace himself."
"I shan't speak just yet."

"We was much hoping—Soosie and me—that he'd go bald-headed for
Melinda before this—if only to hit back. Because, if he done that, he might
cut my future wife out of his will you see. And, in his present spirit of mind,
I believe it would comfort him a lot to do so—and tell me he had."
"No, no—he wouldn't lower himself like that. And as for Mrs.
Honeysett, I reckon he's to work in that quarter. He can't strike all of a
sudden, of course, because the people would say he'd only done it for his
own convenience; but he'll be about her before long I expect. He's been
saying in a good few places that he must marry now."
"He named her name at Green Hayes to my certain knowledge," said

Thomas, "and Mrs. Bamsey heard him do so; and she told Arthur Chaffe,
the carpenter; and he told his head man; and he told me. And he said more.
He said that Arthur Chaffe had marked that Joe had lost a lot of his old
bounce and weren't by no means so charming as he used to be."
"There's no doubt this job has upset him a lot."
"Then where's his religion? He did ought to remember he can't go

sailing on and have everything his own way all his life, no more than
anybody else."
They hoed together shoulder to shoulder, then reached the end of their
rows and turned again.
"There's a religious side no doubt," admitted Maynard. "And we never

feel more religious, if we're religious-minded at all, than after a stroke of
good fortune; and never less so than after a stroke of bad. And I'm telling
you what I know there, because I've been called to go into such things
pretty close. There's nothing harder than to break away from what you was
taught as a child. 'Tis amazing how a thing gets rooted into a young mind,
and how difficult it may be for the man's sense to sweep it away come he
grows up."
Mr. Palk, however, was not concerned with such questions.

"I don't want to break away from nothing," he said. "I only want for
Stockman to treat me and his daughter in a right spirit. And what I say is, if
his religion and church-going, not to name his common sense, can't lead
him right, it's a very poor advertisement for his boasted wisdom."
"So it would be; but he'll come round and do right, only give him time,"
answered Lawrence.
"And what's in your mind?" asked Thomas presently, as he stood up to

rest his back. "Have you got another billet in sight?"
"No. I much want to get abroad. It's always been a wish with me to see a
foreign country."
"A very fine idea. I'd so soon do the same as not; but I heard a chap say
that you find the land pretty near all under machinery if you go foreign.
And I shouldn't care to quit hosses at my time of life."
"There's your wife to think on. She'd never like to put the sea between
her and her father."
"As to that," answered Palk, "it's going to be largely up to him. If he

carries on like what he's doing now, he'll have to pay for it; because the
woman's only a human woman and she haven't deserved this conduct. Why,
God's light! if she'd stole his money-box and set the house on fire he
couldn't take it no worse!"
These things were heard by another pair of ears in the evening of that
day, for then Maynard saw Dinah again. But much passed between the
lovers before they reached the subject of Susan and Thomas. Maynard had
been deeply interested to hear of Dinah's sudden departure, of which she
had told him nothing, and he had puzzled ever since learning the fact
mentioned by Melinda Honeysett. For he did not guess her purpose, or her
destination, and the fact that she had gone away only served to explain her
need for money. She let him know, however, before they met, and that
without any word; for during her absence, there came a picture postcard to
Lawrence—a coloured picture of Barnstaple parish church; and that told
him everything.
He trusted her, but knew her forthright ways and felt very anxious to see
her again. The date and place for their next meeting had been fixed between
them at their last conversation, and as he had heard that Dinah was returned,
he knew that she would keep the appointment. He brooded for hours upon
her action and inclined to a shadow of regret that she should have taken it,
yet the fact did not astonish him, looking back at their last meeting; for had
Dinah asked permission to go, he would not have suffered it in his mood at
the time. That she knew; and yet she had gone. He recognised the immense
significance of her action and the time seemed interminable until the dusk
of that day, when he was free. The night came mild and grey with a soft
mist. Their meeting place was a gate in a lane one mile from Green Hayes
among the woods ascending to Buckland. There it had been planned they
should join each other for the last time before one, or both, disappeared
from the Vale.
Maynard felt a curious sense of smallness as he went to the tryst. He

seemed to be going to meet somebody stronger, more resolute, more
steadfast of spirit than himself. Surely Dinah had done the things that would
have better become him to do. And yet he could not blame himself there,
for it would have been impossible for him to set foot in the town where, no
doubt, his wife still lived. He had wearied himself with futile questions,
impossible to answer until Dinah should meet him, and there was nothing
left but intense love and worship for her in Maynard's mind when they did
meet. If she had any sort of good news, so much the better; but if she had
none, he yet had good news for her. He had banished the last doubt during
her absence and now told himself that not moral sensibility, but moral
cowardice had ever caused him to doubt. He had probed the equivocal thing
in him and believed that its causes were deep down in some worthless
instinct, independent of reason. She should at least find him as clear and
determined as herself at last. He had decided for Australia, and the question
of their separate or simultaneous disappearance was also decided. She had
to hear to-night that they could not leave England together for her credit's
sake. The details of their actions were also defined. He had planned a
course that would, he hoped, suit Dinah well enough, though as yet he knew
not whether any word of hers might modify it.
She was waiting for him and came into his arms with joy. She guessed
that her postcard had revealed her adventure and began by begging for
forgiveness. This he granted, but bade her talk first.
"It's made me long to go out in the world," she said. "Just this taste. I've
never seemed to understand there was anything beyond Ashburton and
Lower Town; but now I've gone afield and seen miles and miles of England,
and I've met people that never heard of the Vale. Say you ban't cross again,
my dear heart. You know very well why I went. It rose up on me like a
flame of fire—to make sure. I told 'em at Green Hayes I had some business
up the country and they think I went to be married—Jane's idea that was.
She's positive sure I'm married, though I've told her in plain words I'm not.
Of course they be curious, but I couldn't tell a lie about it. So I said
'business.'"
"Never mind them. I won't swear I'd have said 'no' if you'd asked me,
Dinah—not if I'd thought twice. It was a natural, needful point, and you
grasped it quicker than I did, and no doubt made up your mind while I was
maundering on about the law. I saw all that after I got your card. But I
couldn't have gone myself."
"It was my work and I've done it; and I wish more had come of it. But
nothing has. I took a room in a little inn near the station and tramped about
and found her shop in the best part of the town. A big place with fine
windows—a dairy and creamery and refreshment room. Just 'Courtier' over
the windows, in big, gold letters, and a few maidens inside and—tea. I
marked her, of course, the minute I saw her. She's in the shop herself—
rather grand, but not above lending a hand when they're busy. She's up in
the world. They knew about her at the inn where I stopped, and told me the
story. They said her husband went mad on the honeymoon and disappeared
off the earth. I went to the shop three times and had my tea there, and the
second time there was a man at the counter talking to her. But he didn't look
much of it. So there it is. She's going on with her life just as you thought,
and making money; and what the people see, I saw, and what they don't see,
or know, is no matter. But she was quite pleased with herself—a cheerful
woman to the eye. You can tell that much.
"She's worn well I should think. She's a pretty woman; but she's hard
and her voice is hard. She wouldn't have no mercy on people under her. She
drove her maidens in the shop and was down on 'em if they talked much to
customers. At my inn she was spoke very well of and thought a bit of a
wonder. You was forgot. They said it was thought you killed yourself. And
now that the seven years are up, some fancied she might marry again, but
others didn't think she ever would, being too independent. A man or two
they mentioned; but the opinion I heard most was that she never wanted to
change. I couldn't ax too much about her, of course."
So Dinah told her tale.
"I wish it had been different," she went on. "I hoped all sorts of things—
that I'd find her married again, or gone, or, perhaps dead. But there she is,
so large as life, and I shouldn't think she'd ever marry for love, but she
might for money, or for getting a bit more power. I didn't feel to hate her in
the least, or anything like that. I felt sorry for her in a way, knowing what
she'd missed, and I thought, if it had been different, what a big man you
might be by now. But you'll be bigger some day along with me. And so we
know where we are, Lawrence."
He asked various questions, which she answered, and he observed how

absolutely indifferent Dinah found herself before the facts. She evidently
recognised no relationship whatever between the husband and wife. From
the adventures at Barnstaple she returned to the present, and he let her talk
on, waiting to speak himself till she had finished.
She had been away nine days and returned to find Jane fallen out with
Jerry Withycombe. Mr. Bamsey had recognised her on her return and called
her by name and made her sit beside him for a long time. But the next
morning he had forgotten her again. Faith Bamsey had also thought Dinah
must have disappeared to be married, but believed her when she vowed it
was not so. John Bamsey was away for the time, doing bailiff's work up the
river above Dartmeet.
Then he told her of his determination and greatly rejoiced her, save in
one particular.
"We don't go together," he said, "and the details will very soon clear
themselves; but there must be no shadow on your memory, here or
anywhere, when you're gone. I give Joe notice presently and go to
Australia, to get the home ready. You find work and, for a bit, keep that
work. Then you leave it for London, or a big town, where ships sail from,
and your passage is took and you come along. That leaves them guessing
here, and none can ever say a word against you. But so sure as we go
together, then Stockman tells everybody that I'm a married man, and the
harm's done."
"You do puzzle me!" she answered. "You can't get this bee out of your
bonnet, Lawrence—such a clever chap as you, too. What in fortune's name
does it matter what Cousin Joe says about you, or what the people believe
about me? I know you're not married, and when I wed you I shall be your
one and lawful wife. Who else is there—now foster-father be gone? That
was the only creature on earth I could hurt, and he's past hurting, poor old
dear. I like your plan all through but there. I'm going when you go, and half
the joy of my life would be lost if I didn't sail along with you in the ship.
That I do bargain for. Oh, I wish it was to-morrow we were running away!"
"I hate to run."
"I love it—yes, I do, now. I wish to God I wasn't going to lose sight of
you again. But it won't be for long."
They spoke of the details and he pointed out that her plan must increase
the difficulties somewhat, yet she would take no denial.
"What's all this fuss for? False pride," she said. "You've got to think for
me the way I want you to think, not the way you want to think. If we know
we're right, why should we fret if all the rest of the world thought different?
I'm hungry and thirsty to go and be in a new world with you. I want you and
I want a new world. And you will be my new world for that matter."
"I know that."

"Together then. 'Twould spoil all any other way. 'Twould be small any
other way. 'Twould be cringing to the Vale."
He laughed.
"I can't keep you here in the rain all night. The next thing is our post
office—from now on."
"Promise about my going with you."
"That means thinking over all the plans again."
"Think them over again then; and I'll help. And I've found the post
office. List!"
They kept silence for half a minute, but Dinah had only heard a night-
bird.
"'Tis here!" she said, "twenty yards down the lane. I found it in the
spring—a wrennys' nest hid under the ivy on the bank. No better place. 'Tis
empty now and snug as need be."
He accompanied her to the spot, lit matches and examined the proposed
post office. It was safe enough, for the snug, domed nest lay completely
hidden under a shower of ivy, and Dinah had only discovered it by seeing
the little birds pop in when they were building.
Lawrence doubted; it seemed a frail receptacle for vital news; but it was
dry and as safe as possible.
"I'd thought to put a tobacco tin under a stone somewhere," he said, "but
perhaps this couldn't be beat."
He took careful note of it and marked the exact spot as well as he could
in the dark. A sapling grew in the hedge opposite and he took his knife and
blazed the bark behind, where only he, or Dinah, would find the cut.
"There'll be a letter for you in a few days," she said, "for I know I've
forgot a thousand things; and when your new plans be finished, you'll write
'em for me."
"We must go slow and steady," he answered. "I've got to give Joe
warning presently, and I don't mean to be out of work longer than I can
help. When we know what we're going to do to the day, then I'll speak; and
he won't like it none too well. He's terrible under the weather about Susan."
He told her the Falcon Farm news, with details which she had not heard.
"I'm sorry for Cousin Joe, but mighty glad for Susan, and I'm coming up
one day to supper to congratulate her—why not?"
"It will be something just to look at you across the table," he said, "but
we'd best speak little to each other."
Dinah grew listless as the moment for leave-taking came. Her mood
was shadowed.
"I know it's right and wise to keep apart now," she told him. "And I
know we can never have none of the old faces round us when we're
married, and none of the little pleasures that go with old friends. But I am
sorry. It's small, but I am sorry."
"So am I, for your sake," he answered. "And it's not small. It's natural.
This is the only home you know, and the only folks you know are in it. And
most are kindly and good. It only looks small against the bigger thing of
being together for evermore. The time won't be long. 'Twill slip away
quicker than you'll like I guess. And there's plenty of new friends waiting
for us down under."
"It's cruel of life," she cried. "It's hard and cruel of life to make love like
ours so difficult. Open air, daylight creatures, like us, to be called to plot
and scheme and hide against the frozen silliness of the world. Just the
things I hate most. And now we must trust the house a little bird have made
with things that we'd both be proud to shout from the church steeple!"
"I know every bit what you're feeling. I feel it too—I hate it more than
you do—knowing what you are. It will soon be over."
"I'll come up and look at you anyhow," said Dinah. "That won't shock
the people; and I dare say, now that Susan knows what it is to love a man—
but don't you fear. I won't kiss you even with my eyes, Lawrence."
"Susan wouldn't see nothing for that matter," he said. "Love be a dour
pastime for her and Palk as things are. They be like us in a way—frightened
to look at each other under that roof."
"But firm," she said. "Cousin Joe ain't going to choke Susan off it?"
"Not him. She'll take Thomas, so sure as you take me."
Dinah was cheerful again before he left her.
"When we'm married, I'll always be wanting to kiss you afore the
people," she said, "just for the joy of doing it openly."
Then they parted, to meet no more in secret until they should never part
again.
He half regretted her determination to sail with him, as he tramped

home; yet he felt in no mind to argue the point. In his present spirit, sharing
her indignation that his fellow men would thrust him away from Dinah for
ever if they could, he cared little more than she for what their world might
say and think when they had vanished from it for a larger.
CHAPTER XXXI
JOE'S SUNDAY
Melinda stood at her door and spoke to her neighbour, Mr. Harry Ford,
the gardener. He was a red-whiskered man of fifty, and he and Mrs.
Honeysett viewed life somewhat similarly.
"You bad creature," she said, "working in your garden o' Sunday!"
This was the sort of remark on which Harry never wasted speech. He
went on with his digging.
"I wish the second early potatoes were coming up so well at the Court
as they are here in my little patch," he remarked. "But they haven't got the
nice bit o' sand in the soil as we have."
He rested a moment.
"How's Jerry going on?" he asked. "Have it come right?"
"No, I'm sorry to say; and yet not sorry neither. She's keeping all this up
because he vexed her Easter Monday. They was at Ashburton revel together
and she says he took a drop too much and very near ran the trap over Holne
Bridge and broke her neck coming home. And he says no such thing. But
the real trouble is about the blessed shop Jane wants to start at Ashburton
after marriage. She's for a tobacco shop, and Jerry wants for it to be green-
grocer's, where he can do his part. My own belief is that Jane Bamsey's
getting tired of Jerry. If the wedding had gone through when it was
ordained, all might have been well; but owing to Ben Bamsey's illness and
sad downfall after, 'twas put off. I never much liked her I may tell you, no
more didn't my father."
"He must have been a bit of a wonder—a very clever man they say."
"He was a clever man."
"Did he believe in the ghost in my house, Mrs. Honeysett?"
"He did not—no more than you do."
He paused and looked at her. Melinda appeared more than usually

attractive. She was in her Sunday gown—a black one, for she still mourned
her parent; but she had brightened it with some mauve satin bows, and she
wore her best shoes with steel buckles.
"There is a ghost in the house, however," declared the gardener.

"Never!"
"Yes—the ghost of a thought in my mind," he explained.
"Ideas do grow."
"If they stick, then they grow. Now I'll ax you a question, and you've no
call to answer it if you don't want. You might say 'twas a hole in my
manners to ax, perhaps."
"I'm sure you wouldn't make a hole in your manners, Mr. Ford."
"I hope not. 'Tis this, then. What might the late Mr. Withycombe have
thought of Farmer Stockman up the hill?"
Melinda parried the question.
"Well, you never can say exactly what one man thinks of another,
because time and chance changes the opinion. A man will vex you to-day
and please you next week. Sometimes what he does and says is contrary to
your opinions, and then again, he may do or say something that brings him
back to you."
"He liked him and didn't like him—off and on? But he'd made up his
mind in a general way about his character?"
"I suppose he had."
"I know he had."
"How should you know?"
"Because I was at the trouble to find out."
"Fancy!"
"Yes. I sounded a man here and there. I went to Chaffe, the carpenter."
"Arthur Chaffe knew father very well and respected him, though he
didn't hold with his opinions about religion."
"Religion I never touch—too kicklish a subject. But I spoke to Chaffe,

and being friendly disposed to me—and why not?—he said a thing I might
be allowed to name to you in confidence."
"Certainly," said Melinda, "if it's nothing against my father."
"Far from it. And I hope you'll take it as 'tis meant."
"I always take everything like that."
"That's right then. Well, Chaffe, knowing me for a pretty quiet man and
a hater of gossip, told me the late fox-hunter saw very clear you'd go to Joe
Stockman after he was took——"
"How could he?"
"Well, I don't know how he could. But he did. And though too tender to
whisper it in your ear, he told Chaffe that he was sorry!"
"Good Lord, you surprise me!"
"No business of mine, you'll say. And yet I felt somehow that if your
father—such a man as him—felt sorry, there was a reason why for he
should. And I won't deny but I told Chaffe he ought to mention it to you. He
wouldn't, because he said the thing was too far gone."
"What's gone too far?"
"You know best. But people have ears and Stockman's got a tongue."
Mrs. Honeysett showed annoyance, while Harry returned to his

potatoes.
"You're telling me what I know, however," she said.
He purposely misunderstood.
"You knew your good father didn't care for Mr. Stockman at bottom?"
"I know he's talking."
"The only thing that matters to know is your own mind, not what's in
other people's, or in his."
At this moment a black-coated figure appeared on the high road and,

much to Mr. Ford's regret, turned up the lane to the cottages.
"Talk of——!" he said.
It was Mr. Stockman.
"He's coming here and—and—I hoped something weren't going to

happen for the minute," confessed Melinda; "but now I reckon it may be."
"Well, if you're in doubt, nobody else is," said Mr. Ford striking boldly.
"Farmer's sounding his victory far and near—not a very witty thing to do
when an old man's after a young woman."
Melinda ignored the compliment and viewed the approaching figure

with impassive features.
"He's cut the ground from under his own feet as to his age," she
answered, "for if you cry out you're old before your time, of course people
must believe you."
Mr. Ford could not answer for Stockman was within earshot.
He showed a holiday humour, but reproved Harry.
"Working o' Sunday!" he said.
"There's all sorts o' work, master," replied the gardener. "I dare say now
that the better the day the better the deed holds of your job so well as mine."
"You're a sharp one! And how's Melinda?"

"Very well," she said. "You wasn't to church this morning."
"I was not. I meant coming down the hill again this afternoon, to drink a
dish of tea with you, if you please; and though twice up and down the hill
be naught to me, yet I shirked it."
They went in together.
"Where's Jerry?" he asked.
"Mooning down to Green Hayes on the chance of getting things right."
"Good. He'll fetch her round; though I doubt she's worth it."
"So do I."
"However, I'm not here, as you'll guess, about your brother. The time
has come, Melinda."
"You've let 'em name the day then—Susan and Thomas?"
"No such thing; but they'll be naming it themselves pretty soon. They'll
be away in a month or two I expect. And I want for the house to be swept
and garnished then. I want a lot done. I've suffered a great deal of
undeserved trouble in that quarter, and there's wicked words being said
about my treatment of my child. The people have short memories."
"There's wicked words being said about a lot of things. It's been said,
for instance, up and down the Vale, that you've told a score you be going to
marry me, Joe. That's a proper wicked thing, I should think."
He was much concerned.
"Good God! What a nest of echoes we live in! But there it is. When a
thing's in the air—whether 'tis fern seed, or a bit of scandal, or a solemn
truth, it will settle and stick and grow till the result appears. No doubt the
general sense of the folk, knowing how I've felt to you for years, made up
this story and reckoned it was one of they things that Providence let out
before the event. Marriages be made in Heaven they say, Melinda."
"But they ain't blazed abroad on earth, I believe, afore both parties
choose to mention it."
"Most certainly not; but if you move in the public eye, people will be
talking."
"Yes, they will, if they be started talking. I met Ann Slocombe to Lower
Town three days agone and she congratulated me on my engagement to
you."
"Who the devil's Ann Slocombe?"
"She's a woman very much like other women. And I told her it was stuff
and nonsense, and far ways from anything that had happened, or was going
to happen."
"No need to have said that, I hope. 'Tis the curious case of——"
"'Tis the curious case of talking before you know," said Melinda tartly.
"What would you have thought if I'd told people you'd gone down to
Brixham, to offer yourself to a woman there?"
"God's my judge I——"
Mr. Stockman broke off.
"This is very ill-convenient, Melinda, and quite out of tune with me and
the day, and what's in my mind. If I've spoke of you with great affection to
one or two tried friends—friends now no more—then I can only ax you to
overlook their freedom of speech. I've been in a very awkward position for
a long time, and made of justice as you are, you must see it. For look how
things fell out. First, just as I was coming to the great deed and going to ax
you to be mistress of Falcon Farm, there happened your dear father's
grievous illness and his death. Well, I couldn't jump at you with my heart in
my hand, while you was crying your eyes out and feeling your fearful loss.
And then, just as the clouds were lifting and the way clear, what happened?
My misguided girl takes this false step. And that cut two ways. First there
was the disaster itself, and then, in a flash, I saw that if I came to you on top

Artificial Intelligence Ai Recent Trends and Applications S Kanimozhi Suguna Online Ebook Texxtbook Full Chapter PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Artificial Intelligence Ai Recent Trends and Applications S Kanimozhi Suguna Online Ebook Texxtbook Full Chapter PDF

Uploaded by

Copyright:

Available Formats

Artificial Intelligence (AI): Recent

Trends and Applications S. Kanimozhi

Applications of Artificial Intelligence in Business and

Swarm Intelligence Trends and Applications: Trends and

Recent Trends in Operator Theory and Applications 1st

Wireless Communication with Artificial Intelligence:

Advances and Trends in Artificial Intelligence. Theory

Medical Informatics and Bioimaging Using Artificial

Artificial Intelligence and Industrial Applications:

Artificial Intelligence Theory and Applications 973

and by CRC Press

© 2021 Taylor & Francis Group, LLC

CRC Press is an imprint of Taylor & Francis Group, LLC

Library of Congress Cataloging‑in‑Publication Data

Names: Suguna, S. Kanimozhi, editor.

ISBN: 978-0-367-43136-5 (hbk)

Chapter 1 Advances in Large-Scale Systems Simulation Modelling

Chapter 2 Let’s Find Out: Why Do Users React Differently to

Chapter 3 AI vs. Machine Learning vs. Deep Learning .................................... 73

Chapter 4 AI and Big Data: Ethical Reasoning and Responsibility.................... 83

Chapter 5 Online Liquid Level Estimation in Dynamic Environments

Chapter 6 Computer Vision Concepts and Applications................................... 111

Chapter 7 Generative Adversarial Network: Concepts, Variants, and

Chapter 8 Detection and Classification of Power Quality Disturbances in

Chapter 9 Robust Design of Artificial Neural Network Methodology to

Chapter 10 Generative Adversarial Network and Its Applications...................... 211

Chapter 11 Applications of Artificial Intelligence in Environmental Science.... 225

Chapter 12 A Genetic Algorithm-based Artificial Intelligence Solution for

Chapter 13 Application of Machine Learning for Fault Detection and

Chapter 14 Smart City Using Artificial Intelligence Enabled by IoT.................. 279

Chapter 15 AI Emerging Communication and Computing................................. 293

Dr. S. Kanimozhi Suguna

Sara Paiva is Associate Professor at the Polytechnic Institute of Viana do Castelo.

Bettina O’Brien Jari Porras

Bhuvaneswari T. Jayden Khakurel

Gökay Bayrak Nabanita Dutta

Papazoglou, P. M. Teodoro Ibarra-Pérez

1.1.3.1 Agent and Multi-Agent Systems........................................... 12

1.4 Experimental Results....................................................................................... 45

• Mathematical network models (e.g. propagation models, statistical distribu-

• How to achieve full parallelization for sophisticated computer systems

Advanced computer and programming technologies must be used to build an effec-

1.1.1.2 Discrete Event Simulation

• Dequeue: an incident of minimum time stamp is deleted from the queue

1.1.1.2.2 Simulation Time Definition

• Physical time length

1.1.1.2.3 Efficient Usage of Computer Technology for

1.1.1.3.2 The Current Standard Event Scheduling

1.1.1.3.3 Application of CQ in Sequential DES

FIGURE 1.1 Illustration of a CQ implementation with eight buckets.

1.1.1.3.4 Application of CQ in Parallel DES

The events belonging to various clusters can be executed in parallel according to

1.1.2 Channel Assignment in WCS

(A) the probability of discontinuing incoming calls;

FIGURE 1.4 Excerpt of spatial partitioning/parallelization.

In FCA, every cell is permanently assigned a set of channels based on a pre-

1.1.3 Multi-Agent Systems in WCS

• Adaptability that reflects a learning and development potential centred

According to Jennings (2000), a multi-agent system (MAS) has a number of agents

1.1.3.2 Multi-Agent Systems in WCS

1.1.4 The Concept of Cellular Network

1.1.5 Simulation Languages (SLs)

• Are process or event oriented

1.1.1.2 Discrete Event Simulation

1.1.1.2.2 Simulation Time Definition

1.1.1.2.3 Efficient Usage of Computer Technology for

1.1.1.3.2 The Current Standard Event Scheduling

1.1.1.3.3 Application of CQ in Sequential DES

1.1.1.3.4 Application of CQ in Parallel DES

1.1.2 Channel Assignment in WCS

1.1.3 Multi-Agent Systems in WCS

1.1.4 The Concept of Cellular Network

1.1.5 Simulation Languages (SLs)

1.2 THE PROPOSED SIMULATION MODEL

1.2.2 Modelled Network Services and Channel Allocation

1.2.2.1.2 Call Termination (FC)

1.2.2.1.3 Reallocation Management-Handoff (RC)

1.2.2.1.4 MU Movement (MC)

1.2.2.2.2 Channel Allocation Procedure and Calculation

1.2.3 The Multi-Agent/Multilayered Model

1.2.4 Theoretical Analysis of Agents Adapted

1.2.4.1 Network Agent Definition

1.2.4.2 Architecture of the Intelligent Network Agents

1.2.4.3 Network Agent Interface

1.2.4.4 Network Agents Which Maintain State

1.2.4.5 Network Agent Utility Functions

1.2.5 Event Interleaving as Scheduling Technique

1.2.5.2 Process Life Span in a Real-Time Scheduling Set-Up

1.2.5.3 Scheduling Concurrent Events in WCS