![Editors and Contributors
About the Editors
Dr.PradeepKumarSinghiscurrentlyworkingasaProfessorandHead,Department
of Computer Science, KIET Group of Institutions, Delhi-NCR Campus, Ghaziabad,
India. He is Associate Editor of the IJISMD [IJISMD is indexed by Scopus and Web
of Science], IJAEC, IGI Global USA, SPY, Wiley IJISC from Romania. He is recently
appointed as Section Editor, Discover IoT, Springer Journal. He has published nearly
120 research papers. He has received three sponsored research projects grant worth
Rs. 25 lakhs. He has edited a total 16 books from Springer and Elsevier and also
edited several special issues for SCI and SCIE Journals from Elsevier and IGI Global.
He has Google Scholar citations 1551, H-index 20, and i-10 index 50.
Prof. Sławomir T. Wierzchoń received M.Sc. and Ph.D. degrees in Computer
Science from Technical University of Warsaw, Poland. He holds Habilitation (D.Sc.)
in Uncertainty Management from Polish Academy of Sciences. In 2003, he received
the title of Professor from the President of Poland. Currently, he is Full Professor
at the Institute of Computer Science of Polish Academy of Sciences. His research
interests include computational intelligence, uncertainty management, information
retrieval, machine learning, and data mining. He is Author/Co-author of over 100
peer-reviewed papers in international journals and international conferences. He
published, as Author/Co-author, 11 monographs from the field of machine learning.
In the period 2000–2013, he co-organized 13 international conferences on intel-
ligent information systems. Co-authored proceedings from these conferences was
published by Springer. He co-edited two volumes of proceedings of the international
conference on computer information systems and industrial management, and he has
served as Guest Co-editor of three special issues of Information and Control journal.
Currently, he is Member of the editorial board for some international journals, as well
as Member of many program committees for international conferences. He cooper-
ated with medical centers in the area of statistical data analysis and knowledge
discovery in databases.
xv](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-19-320.jpg)
![xvi Editors and Contributors
Dr.SudeepTanwar isworkingasafullprofessorattheNirmaUniversity,India.Heis
also a Visiting Professor with Jan Wyzykowski University, Poland, and the University
of Pitesti, Romania. He received B.Tech in 2002 from Kurukshetra University, India,
M.Tech (Honor’s) in 2009 from Guru Gobind Singh Indraprastha University, Delhi,
India and Ph.D. in 2016 with specialization in Wireless Sensor Network. He has
authored 04 books and edited 20 books, more than 270 technical articles, including
top cited journals and conferences, such as IEEE TNSE, IEEE TVT, IEEE TII, IEEE
TGCN, IEEE TCSC, IEEE IoTJ, IEEE NETWORKS, ICC, IWCMC, GLOBECOM,
CITS, and INFOCOM. He initiated the research field of blockchain technology adop-
tion in various verticals, in 2017. His H-index is 52. His research interests include
blockchain technology, wireless sensor networks, fog computing, smart grid, and the
IoT. He is a member of the Technical Committee on Tactile Internet of IEEE Commu-
nication Society. He has been awarded the Best Research Paper Awards from IEEE
IWCMC-2021, IEEE ICCCA-2021, IEEE GLOBECOM 2018, IEEE ICC 2019, and
Springer ICRIC-2019. He has won Dr KW Wong Annual Best Paper Prize for 2021
sponsored by Elsevier (publishers of JISA). He has served many international confer-
ences as a member of the Organizing Committee, such as the Publication Chair
for FTNCT-2020, ICCIC 2020, and WiMob2019, and a General Chair for IC4S
2019, 2020, ICCSDF 2020, FTNCT 2021. He is also serving the editorial boards of
COMCOM-Elsevier, IJCS-Wiley, Cyber Security and Applications- Elsevier, Fron-
tiers of blockchain, and SPY, Wiley. He is also leading the ST Research Laboratory,
where group members are working on the latest cutting-edge technologies.
Dr. Joel J. P. C. Rodrigues [S’01, M’06, SM’06, F’20] is Professor at the Federal
University of Piauí, Brazil; Senior Researcher at the Instituto de Telecomunicações,
Portugal; and Collaborator of the Post-Graduation Program on Teleinformatics Engi-
neering at the Federal University of Ceará (UFC), Brazil. He is Leader of the Next
Generation Networks and Applications (NetGNA) research group (CNPq), IEEE
Distinguished Lecturer [2018–2021], Member Representative of the IEEE Commu-
nications Society on the IEEE Biometrics Council [2011– ], and President of the
scientific council at ParkUrbis—Covilhã Science and Technology Park [2015– ].
He was Director for Conference Development—IEEE ComSoc Board of Gover-
nors [2018–2019], Technical Activities Committee Chair of the IEEE ComSoc Latin
America Region Board [2018–2019], Past-Chair of the IEEE ComSoc Technical
Committee on eHealth, Past-Chair of the IEEE ComSoc Technical Committee on
Communications Software, Steering Committee Member of the IEEE Life Sciences
Technical Community and Publications Co-Chair [2014–2017]. He is Editor-in-chief
of the International Journal on E-Health and Medical Communications and Editorial
Board Member of several high-reputed journals. He has been General Chair and TPC
Chair of many international conferences, including IEEE ICC, IEEE GLOBECOM,
IEEE HEALTHCOM, and IEEE LatinCom. He has authored or coauthored over 850
papers in refereed international journals and conferences, 3 books, 2 patents, and
1 ITU-T recommendation. He had been awarded several Outstanding Leadership
and Outstanding Service Awards by IEEE Communications Society and several best](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-20-320.jpg)
![4 A. K. Srivastava et al.
Keywords WSN · Rendezvous points · Static sink · Mobile sink · MILP · Genetic
algorithm · Protocol · Cluster · Holes · Routing
1 Introduction
Wireless sensor networks (WSNs) have a dense and large quantity of sensing nodes.
These nodes are placed randomly over an area of significance. These nodes sense
the data from the area of concern and communicate the same to sink for processing.
These sensing nodes are organized to observe the indoor and outdoor surroundings,
industry and procedure mechanization under water activity monitoring, healthcare
system, etc. They have the application in tracing cattle/other creatures, vehicles,
etc. [1]. Sensor nodes deployed in various application areas have limited memory,
computational power, and battery backup [2]. There is no defined topology of such
network and frequently changing environment, very less amount of battery, and
limited storage capability of the nodes. It is essential that each node in the network
has the knowledge about the routing path to the sink which is energy efficient. Since
random placement of the nodes restrains coders from presuming routing table data
at the sensor nodes, numerous methods have been suggested to create dynamic path
up to sink.
If the topology changes slowly, a proactive routing approach can be effective
where topology detection is done on the periodically using broadcast of a beacon
signal from the sink to the complete network [3].
Along with creating routing paths which are energy efficient, two more procedures
are used in practice for realizing energy efficiency: mobility of sink [4, 5] and duty
cycling of the nodes [6].
2 Challenges with WSN
• Fault-tolerant Communication: Since deployment of sensor nodes in any field
is random, there is a fair chance of faulty sensor nodes or nodes which die down
on or before observation. This may cause communication link to get broken [7].
• Low Latency: The events do take place rapidly in the WSN. The designed WSN
needs to record and report events quickly.
• Scalability: The system under observation is supposed to be scalable meaning
that additional nodes can be deployed in order to increase the observation area.
• Transmission Media: Faulty nodes can cause the broken links for communica-
tion.
• Coverage Problems: The quality of service in WSN is solely dependent on
coverage of sensor nodes. In case of less coverage sensing, the quality of sensor
nodes gets affected.](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-35-320.jpg)
![Enhancement of Energy Efficiency in Wireless … 5
• Sensor Holes: Also referred to as routing hole in which the nodes are either not
preset or unable to participate in routing.
It is assumed that a WSN comprises similar stationary sensor nodes. The sink is
either static or mobile, and it can be located at distinct positions in the WSN. Those
nodes which are closer to the sink in the case of static sink dissipate their battery
level faster than the nodes which are farther. This happens because of the frequent
load of data relay on nodes closer to the sink. To overcome this issue, mobile sinks
were introduced, where the sink travels along a defined path in the field. It has been
noticed that in majority of the situations sink mobility aids in creating a balanced
load of routing and energy depletion of the nodes [8, 9].
It is however sure that mobility of sink improves balancing of load in the nodes,
and it is a very important question if this improves the energy efficiency of such
networks. To address this query, it is required to create a methodology for efficiency
of energy.
One of the approaches for making comparison between various sink mobility
schemes is to have a match in the total energy consumption of WSN nodes for a
defined complete work (load) done by a WSN. This paper focuses at finding energy
dissipation on average per node Ebar, Ebar =
Ni = 1eiN, N represents the total no.
of WSN nodes, and ei is the dissipation energy of ith node while in the observation
period.
Energy used by various nodes in the static sink is different for different nodes.
Nodes closer to the static sink have to repeatedly do the work of relaying information
to the sink because of which these nodes deplete their energy faster as compared to
the other nodes. Because of this, maximum energy depletion is investigated for each
node as Emax = Maxi = 1, 2, …, N ei.
For the purpose of load balancing, placement of static sink is usually done at the
central point of WSN. If plenty of nodes in the vicinity of a static sink die because
they have depleted their energy backups, the sink may get detached from remaining
nodes in the network. Hence, Emax is one the possible parameters that indicates the
lifespan of WSN [10, 11].
The energy consumption in uneven manner may cause the problem known as
energy hole. This might split the N/w data transmission to the sink node will be
blocked [3]. In underwater wireless sensor networks, designated gateways (DGs)
collect data of sensor nodes in real time. But, underwater wireless sensor networks
too suffer from energy hole phenomenon [4].
In the previous researches, researchers have focused on either the lifespan of a
WSN or the avg energy loss per node (be it Emax or Ebar) [4, 7, 12]. In this paper, the
sink is assumed to be mobile in nature. This paper finds various schemes of energy
optimization in WSN with mobile sink.](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-36-320.jpg)
![6 A. K. Srivastava et al.
3 Data Collection Approaches
Various methods for data collection have been proposed by researchers. Table 1
summarizes the approaches in nutshell.
Khan et al. [13] evaluated various protocols in both of these aspects highlighting
that in which of the situation different information is yielded. In majority of the
cases, duty cycling effects of the nodes are taken into consideration for analysis and
comparison (Fig. 1).
In [13], effect of duty cycling of stationery sensor nodes and movement path of
mobile sink with energy consumption was investigated. Energy efficacy of WSN
model with static and mobile sink was compared with respect to Ebar and Emax. Sink
mobility is not the only criterion which improves energy parameters Ebar and Emax.
Mobile sink can drastically improve the energy parameters by reducing the data relay
load on the nodes and congestion control.
Table 1 Data collection approaches in WSN
Approaches for data collection in WSN
Discovery Data transfer Routing Motion control
Mobility independent
a. Scheduled rendezvous
b. On-demand
c. Asynchronous
Joint discovery and data
transfer
Flat Trajectory (either static or
dynamic)
Knowledge based Proxy based Speed
Hybrid
Fig. 1 Data gathering in
WSN](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-37-320.jpg)
![Enhancement of Energy Efficiency in Wireless … 7
Fig. 2 Scenario of WSN
with various node types
To deal with the energy hole problem and optimization of lifetime in static telluric
Wireless Sensor Networks and underwater Wireless Sensor Networks (Fig. 2)
Zhu et al. [14], Shu et al. [15], Bhattacharjee and Bandyopadhyay [16] have
proposed the work toward optimization of lifetime. Node positions are assumed to
be fixed in these papers. It is unavoidable to limit the uneven energy dissipation and
problem of energy hole. Sink nodes’ mobility can resolve this issue. When the sink
travels toward the positions where nodes are concentrated highly or other positions of
importance, energy dissipation of nodes can be balanced and residual energy inclines
toward 0.
Kumar et al. [17] proposed range-constrained clustering (RCC) technique. In
RCC, the nodes in the target area are distributed into many clusters. TSP method
is utilized to find the movement path of sink optimally. It travels to all centers of
clusters.
Gatzianas and Georgiadis [18], Luo and Hubaux [19], Yun et al. [20], Basagni
et al. [21], Zhao and Yang [22] papers explored the maximization of lifetime of
WSNs. These papers considered network lifetime optimization models with one or
many mobile sinks. These also tried to obtain optimal pattern.
Gatzianas and Georgiadis [18], Luo and Hubaux [19], Yun et al. [20] assumed the
movement of sink node be discrete. The sink node move involves many anchors and
rest time. The authors have created a model for N/w lifetime optimization assuming
some energy dissipation constraints, flow balance constraint, and communication
power constraint.
Basagni et al. [21] explored a linear program (LP). Its solution gives an assured
upper bound on possible lifetime considering multiple sinks. The centralized and
distributed heuristic were introduced to find a solution of the LP which finds the
N/W lifetime which is very close to the optimum.
Zhao and Yang [22] proposed energy consumption constraint and flow balance
constraint and researched into optimization of lifetime beneath two diverse situations.
These were fixed rest time and varying rest time. Some methods focused on instituting](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-38-320.jpg)
![8 A. K. Srivastava et al.
and models to solve the lifespan of WSN with an assumption of known movement
paths of sinks, but majority of the algorithms assumed only one sink node. Data
assembling latency is substantial. In [23] Lifetime maximization of WSN with sink
mobility the travel path selection and Optimization of lifetime were taken into consid-
eration. The modified reduced clustering method, k-means clustering method, and
nearest neighbor interpolation method were used to find the travel paths and obtain
the near to optimal solution for the shortest path. In this, N/w lifetime optimiza-
tion model with predefined travel path was established. Sub-gradient and geometric
algorithm was used to solve the problem of lifetime optimization and obtain the
data communication system. Sink nodes collect the data by traversing the defined
optimal travel path. All sensor nodes communicate data based on the data transmis-
sion method. The simulation results in [23] clearly show that MLMS can improve
lifetime of WSN, create a balancing among energy dissipation of nodes, and ease data
collection time. MLMS has observed improvement over Ratio_w, TPGF, GRND, and
RCC but high time complexity.
Mobile sink usually traverses each node and collects the desired data [24, 25]
(known as single-hop communication) or goes to only a few positions, and nodes
communicate collected data to the mobile sink [11, 26–30]. Data gathering task is
faster in the multi-hop communication. Another area of concern arrives in Multi Hop
Communication is the increase in energy dissipation majorly for forwarding of data.
A solution proposed to address this is to transfer the data to some intermediate
sensor nodes which store the data for communicating to mobile sink as and when
the mobile sink comes in their range or when the request arrives to them to send
the data [31–39]. Majority of these approaches create a balance between delay in
data collection and overhead in energy dissipation. Konstantopoulos et al. [31] have
addressed the issue of energy holes because of intermediate data relaying nodes or
cluster heads. Chen et al. [40] presented a geographic converge cast-based approach
basically targeting the reconstruction of path during sink mobility.
Mamalis [41] proposed formation of many virtual circles and lines on which
cluster heads are placed properly. Mobile sink approach reduces the energy usage of
nodes at the cost of data collection time. In general, the mobile sink tour time upper
limit is set as prerequisite for the timely collection of data. Use of multiple sink can
also speed up the data collection work [21, 39, 42].
Almi’ani et al. [43] and Ekici et al. [44] proposed the hybrid approach, wherein
the combination of multi-hop communication with the use of a mobile sink traverses
to limited positions (called caching points—CPs). This builds direct or indirect
clustering which is hierarchical in nature.
Almi’ani et al. [43] proposed the minimization of number of hops that forwards
the data from sensor nodes to their nearest caching points. This method proposed a
k-means node-clustering method wherein the grouping of the network in the almost
equal size clusters (in terms of Sensor nodes) followed by designing a Mobile Sink
trip to take one Cluster Point from every cluster, Iterating the same to cover optimum
no of clusters with the limitation of maximum length of Mobile sink trip.](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-39-320.jpg)
![Enhancement of Energy Efficiency in Wireless … 9
Mamalis [41] showed experimental setup that claimed to perform better than
[44], and it was producing the optimum results. Almi’ani et al. [45, 46] presented an
optimization of path for collection of data while working with the multiple sinks.
[41] proposed solution majorly based on “residual energy” of the sink nodes rather
than distance and number of hops in [43]. Mamalis [41] also show the stable energy
and efficient conduct presented by hierarchical clustering structures to improve life-
time of the WSN. It used node-clustering algorithm and the multi-hop clustering
algorithm of [47] as its base (main criterion for formation of cluster here is the
residual energy of every sensor node). It detects clusters which are balanced in terms
of energy and guarantees ideal performance in terms of avg energy dissipation and
lifetime of network. Mamalis [41] modified this method to satisfy the requirement
of distance-restricted mobile sink trip. It also developed a data collection protocol
which was based on TSP approximation path that fulfills the distance constraint. The
energy holes are created around the cluster heads falling in the TSP path; Mamalis
[41] used a method mix up of re-clustering phase and with alternating among various
original positions of mobile sink.
Papadimitriou and Georgiadis [48] formulated the problem of maximization of
network lifetime into a min–max problem in a circle considering uniform distribution
of sensor nodes. Gandham et al. [49] proposed multiple mobile sinks with predefined
route to gather sensing data for a particular region. It proposed an integer linear
program model to find the position of the K mobile sinks in one round.
Wang et al. [50] proposed optimization of sink movement along with the rest time.
It proposed the linear programming solution to the problem with an assumption of
workload of a node being evenly distributed among the horizontal and vertical links.
Luo et al. [4] proposed 2-stage scheduling: (1) The mobile sink traverses the
potential locations one by one and stays there at each for a small time. (2) The sink
collects the buffered data of all nodes and builds the stay time profile at the potential
point.
Basagni et al. [11] worked on two constraints: first, the max length at every
movement of mobile sink and min stay time at each stay point. Movement length
of mobile sink from one stay point to the other is bounded to ensure loss of data
gathering. The paper then presented a simple and distributed heuristic considering
problem in the mixed ILP.
Sugihara and Gupta [51, 52] proposed the problem to be considered as TSP, and
solutionsuggestedtheupdationof tour timingat eachedge. This aims at collectingthe
maximum data by one-hop data gathering mechanism. This also aimed at reducing
the energy dissipation in relay.
Xing et al. [35] suggested an approach of data gathering which is rendezvous
point based, organized mobility of sink, caching of data, and limiting the tour length
of the mobile sink. An approximation algorithm was designed here for minimizing
the sum of energy dissipation of all participating sensor nodes. It was assumed here
that prior to the transmission of data it is combined in one packet.
Guney et al. [53] proposed design of sink trajectory as an optimization problem.
It aims at identifying the location of sink optimally and communication path among](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-40-320.jpg)
![10 A. K. Srivastava et al.
sinks and sensor nodes. The authors formulated this as an ILP and created many
heuristics for the same.
Liang et al. [54, 55] unified the tour length of the mobile sink in the problem
of maximization of network lifetime and suggested heuristics. Liang and Luo [56]
have presented their work of considering multiple mobile sinks instead on 1 in their
previous work. Gatzianas and Georgiadis [18] proposed the formulation of designing
optimal route for a mobile sink as a LP problem and proposed a distributed solution
employing Lagrangian duality principle and the sub-gradient scheme. Convergence
rate of the algorithm was the basic factor in finding the run time of this distributed
scheme.
Yun and Xia [57] proposed the scheme in which the sensor node does not have to
transmit the data immediately after sensing it. It buffers the data until the sink reaches
to the favorable location with respect to the given sensor node. It eases out the load
at the sensor node, and network lifetime can be increased by this. They designed
this problem as a mixed ILP given the restricted delay limit. They also proposed
flow-based framework.
Xu et al. [58] aimed at discovery of a route for mobile sink to maximize the
network lifetime. It has the constraints like (i) stay places of mobile sinks for data
collectionarefixed.Thesinkisallowedtostayatpotentiallocations.Thisinformation
is considered to be available as a priori. (ii) Delay on data communication is in some
tolerant range. Storage space of each sensor node is limited. To avoid the loss of data
because of storage overflow, there should be tolerant data communication delay and
it should be fixed up.
With aim of establishing relation between lifetime of network and tolerable delay
in delivery of data, a controllable parameter h “the bound on no. of hops from node
to sink” was used. The selection of h played a vital role in realizing the trade-off
between lifetime of network and data delivery delay; i.e., keeping h small, number
of stay points and mobile sink route will be long. And delay in data delivery will be
more.
Xu et al. [58] researched on achieving the trade-off between lifetime of WSN and
data delivery permissible delay while mobile sink being employed for data collection.
It mainly focused on designing of optimal tour path for mobile sink and formulated a
protocol for transferring the sensed data to mobile sink. The research article proposed
a method which minimizes the number of hops. Since this problem is NP-hard, the
researchers have proposed a new framework that optimizes the trajectory.
4 Classification of WSN
WSNs can be classified depending on type of sensor used in the network. Sensor
type is dependent on features like unit cost, sensing range, and communication
range. Homogeneous WSNs comprise similar type of sensors, whereas heteroge-
neous WSNs comprise many types of sensors. Coverage requirements of the area are
also a criterion for categorization. It can be equal around the sensor area, or fraction](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-41-320.jpg)
![Enhancement of Energy Efficiency in Wireless … 11
of it may be of high criticality than the other ones and better sensing observation.
Sensors may either be active or sleeping. A sleeping sensor is free from sensing,
transferring, and receiving data during the sleep phase. Energy dissipation during
this time is minimal. Active sensor does sensing, transferring, and receiving of data
and spends substantial energy during this work.
5 Designing of Wireless Sensor Network
Designing of wireless sensor network comprises major decisions like:
1. Number of sensors for deployment to satisfy the cost and coverage requirements.
This should also take care of fault tolerance in case of failing sensor nodes during
the observation period. Energy dissipation of sensor nodes should also be taken
into consideration while designing as transmission requires substantial energy
and it increases with the distance of transmission.
2. Activity scheduling of sensor nodes is the second parameter that should be
thought of while designing the WSN. Keeping some of the sensor nodes active
at some point of time while keeping others at rest improves the complete lifetime
of WSN. While designing, we should ensure that active sensors are enough in
numbers to ensure that WSN is fully functional.
3. Another major issue while designing of sensor network involves the “sink neigh-
borhood problem” [11], “energy hole problem” [59, 60], or “the crowded center
effect” [61]. A sensor node in the vicinity of the sink dissipates their battery
faster as they work as accumulators for other node’s sensed data. This problem
can be resolved by moving sink node which enables may sensor nodes to work
as accumulators for a set of sensor nodes, and responsibility of accumulation
does not lie only on limited nodes.
4. The last design issue is to find the path of data flow from sensor node to sink
node. A path from sensor to sink can be found easily with the prior computation,
but considering the limitation of the WSN of possible failure of some sensor
nodes creates the requirement of find sensor to sink node data flow path at run
time with some computation.
Many papers have been written by various researches for the designing of WSN
with maximization of lifetime, but most of them have taken only a subset of designing
criteria written above. Because of the above, any proposed design WSN can be termed
as suboptimal.
Keskin et al. [62] have given a mathematical model considering mixed integer
linear programming (MILP) model is the only research which has focused on all of
the above-mentioned designing criteria.
Hamida and Chelius [37] proposed the analysis of the existing data propagation
protocols in mobile sinks. It focuses on the categorical decisions about movement
of sinks. Majority of the papers utilized the mathematical model that deals with the](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-42-320.jpg)
![12 A. K. Srivastava et al.
optimization of WSN performance criterion, e.g., lifetime of WSN, energy dissipa-
tion in totality, complete cost incurred for known data, and total cost for given data
circulation protocols.
6 Data Flow Through Optimal Path
Data is believed to move from nodes to the sinks via the smallest route in several
papers, e.g., [63], in which authors assumed a mobile sink moving inside the network
to gather the collected data from the sensing nodes in a single-hop fashion. This
paper has sought the minimal distance route which traverses each sensing node’s
transmission range. The problem of finding minimal distance route is visualized as
a variant of TSP.
The solution as presented in [63] is further extended for finding shortest path
considering multiple mobile sink in [64]. Objective function in this paper is set to
minimize the longest sink trip. At the same time, there is a constraint that each of the
sensing node falls within the vicinity of sink traveling. It is also tried to fall in the
vicinity of exactly one sink only such that data is sent in single-hop approach to the
sink. The problem is modeled as MILP. These two papers [63] and [64] follow the
optimization models, but they have little impact on the lifetime and load balancing
metric. These researches propose the optimization methodology but fail to address
the network lifetime, delay in travel of data, and balancing act across the nodes.
Wang et al. [50] follow different approaches from [63] and [27] where the authors
propose a LP model for improving the lifespan of the network. The mobile sink is
supposed to rest at some rendezvous points. The lifetime of the network is supposed
to be the total of rest time at rendezvous points. The optimal solution of the linear
programming model suggests the rendezvous points. In this paper, the sink route is
not defined as the order of the visiting rendezvous points is undefined.
Basagni et al. [11] presented the sink route as well as the extension of work in
[50]. The result of the [11] is the discovery of rendezvous points and mobile sinks
schedule of vising these points. Basagni et al. [21] have extended this work further
to incorporate multiple mobile sinks. The authors considered a sink configuration
by randomization of the sinks along predefined set of rendezvous points. Further
lifetime of the network is considered to be the accumulation of rest time of sinks.
As the objective, lifetime of the network is maximized and however the energy
dissipation of the sensors should be initial level of power. In [54] sink is treated as the
energy restricted device which moves in the region mechanically using some fuel.
Keskin et al. [65] considered sink movement time as a part of network lifetime. The
authors alsotookintoaccount thetimetakenfor datacollection. Theauthors proposed
the efficient heuristics as the solution of proposed model (MILP). Srivastava and
Gupta [66, 67] proposed the genetic algorithm-based approaches for path planning
of mobile sink. In the proposed work, to design the fitness function, three parameters
have been used.](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-43-320.jpg)
![Enhancement of Energy Efficiency in Wireless … 13
Fig. 3 Path of mobile sink
using random tour
• Length of the tour of the MS
• Load of rendezvous points (RP); i.e., the RP receives the data from how many
sensor nodes
• Number of nodes which forwards the data to RP using multi-hop.
The paper proposed fitness function represented as:
Minimize F = w1xT cos t + w2x {n − NW1 H} + w3x Di f
where
– w1, w2, w3 represent the weights and w1 + w2 + w3 = 1.
– Tcost represents the cost of the tour.
– NW1H represents the numbers of nodes with 1 hop from RPs.
– Dif represents the difference between maximum and minimum values of
LoadRP(i).
Figures 3 and 4 depict the comparison of random path and GA-based path of
mobile sink.
7 Optimal Data Flow
In spite of assuming routing of data path apriori, data flow path for every sensing
node to sink can be determined optimally. Gandham et al. [49] divided the entire time
into the equal periods. In each of the durations, data routes and sinks are stationery.](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-44-320.jpg)
![14 A. K. Srivastava et al.
Fig. 4 Path of mobile sink
using genetic algorithm
The authors proposed two different models for minimization of energy dissipation of
each sensor node and cumulative energy dissipation of sensing nodes [68]. Offered
2 more heuristics along with the one in [49]. The first one assumed sinks’ location
at the place where neighboring nodes have maximum backup left. The other one
assumed sinks’ location at the place such that the difference among the minimum
and maximum backups of the sensor nodes is minimized. Alsalih et al. [69] proposed
similar approach to that of [68]; however, author proposed the periodic optimization
of minimal backup. The paper is studied as single-period model and needs to be
run separately for each period. This paper provides approximate solution rather than
optimal one. Luo and Hubaux [70] consider a network field circular in nature and
proposed the minimization of maximum load of sensing nodes using the MILP
model. It is also assumed that the movement path of the sink is also circular in
nature. Gandham et al. [49], Azad and Chockalingam [68], Alsalih et al. [69], Luo
and Hubaux [70] restrict data flow in an optimal fashion, but they did not produce
any approach for maximization of network lifetime directly.
Papadimitriou and Georgiadis [48] proposed a nonlinear programming model to
maximize lifetime of WSN. It is defined as the cumulative rest time of moving sink
at rendezvous points. Gatzianas and Georgiadis [18] revisited the model in [48] and
developed a distributed algorithm. Distribution technique was proposed in [64].
Yun and Xia [57] used the [76] and [18] as base. Authors proposed the buffering
of data by sensing nodes till the favorable time with respect to network lifetime.
Above models are found appropriate for applications which are delay tolerant.
Yun et al. [20] proposed the algorithm for the solution of queue-oriented delay-
tolerant model as given in [57]. Behdani et al. [71] proposed another algorithm for
the same model as in [22] which was computationally efficient. Luo and Hubaux [19]](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-45-320.jpg)
![Enhancement of Energy Efficiency in Wireless … 15
introduced MILP model with multiple mobile sink for maximization of the lifetime
of WSN. It was defined as the period lengths sum. Period here is considered as time
with sink configuration given. With change in the sink location, the period changes.
Above-mentioned approaches did not touch all four major aspects of WSN. Above
approaches assumed a prior defined sensor position. They did not consider activity
schedules. Around 50% of the papers employed shortest path data propagation as a
predefined data propagation method.
Only [62] has attempted to find the optimal WSN design with all four WSN
design issues. G. 4.0. [72] presented the effect of the incorporation with comparison
of lifespan of WSN gained by a combined model with the articles mentioned in earlier
papers. The MILP model turns out to be unsolvable for genuinely real networks as
size is huge.
8 Conclusion
Numerous researches are performed for WSN using mobile sink. Most of the research
activities focused energy conservation in background while proposing approaches
for clustering, data flow paths, trajectory design, etc. In the WSN with mobile sink,
trajectoryofsinknodeplaysavitalrole.DesigningoftrajectoryisaNP-hardproblem.
With the use of nature-inspired techniques, e.g., particle swarm optimization (PSO),
genetic algorithm (GA), etc., can be used for generating nearly optimal path for
mobile sink.
References
1. Raghavendra, C. S., Sivalingam, K. M., Znati, T. (2004). Wireless sensor networks. Kluwer
Academic Publishers.
2. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., Cayirci, E. (2002). A survey on sensor
networks. IEEE Communications Magazine., 40, 102–114.
3. Nezhad, A. A., Makrakis, D., Miri, A. (2007). Anonymous topology discovery for multihop
wireless sensor networks. In Proceedings of 3rd ACM Workshop on QoS and Security for
Wireless and Mobile Networks, Q2SWinet ‘07, Chania, Crete Island, Greece (pp. 78–85).
4. Luo, J., Panchard, J., Piorkowski, M., Grossglauser, M., Hubaux, J.-P. (2006). Mobiroute:
Routing towards a mobile sink for improving lifetime in sensor networks. In Proceedings
of IEEE International Conference on Distributed Computing in Sensor Networks (DCOSS),
pp. 480–497 (2006)
5. Ye, F., Luo, H., Cheng, J., Lu, S., Zhang, L. (2002). A two-tier data dissemination model for
large-scale wireless sensor networks. In Proceedings of 8th Annual international Conference on
Mobile Computing and Networking, MobiCom ‘02, Atlanta, Georgia, USA, September 23–28,
2002 (pp. 148–159).
6. Wang, L., Xiao, Y. (2006). A survey of energy-efficient scheduling mechanisms in sensor
networks. Mobile Network Applications, 11, 723–740.
7. Sankar, A., Liu, Z. (2004). Maximum lifetime routing in wireless ad-hoc networks. In
Proceedings of 23rd IEEE INFOCOM (pp. 1089–1097).](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-46-320.jpg)
![24 S. Chauhan and R. M. Belokar
6. No. of unauthorized connections causing physical and revenue leakages.
7. Low technical and financial management capacities.
8. Customer inconvenience: By imposing financial restrictions on water bills and
limiting personal water usage for residents, which in many cases is below the
level required for the practice of safe hygiene [3].
2 Need
Water being an essential commodity, many cities cannot even get 100 l per capita
per day. With such water scarcity, it is not easy to provide 24 h water to the residents
in PAN city, where most of the major cities in India are populous. Therefore, the
idea was conceived with the plan that Chandigarh will implement a 24 × 7 water
supply project for the whole city with a population above 1 Million. The definition
of a 24 × 7 water supply would mean that every consumer gets water 24 h a day, all
seven days with required pressure. This level of service has become common now
in several of the world’s cities; however, no Indian city provides its citizens with a
round-the-clock water supply. Most of the cities in India receive water for a couple
of hours during the day and evening hours.
3 Objectives
1. To study accurate metering of water and its impact.
2. To study how to avoid leakages and curb non-revenue water (NRW).
3. To assess the behavioural change of residents with continuous water supply.
4. To study optimum usage of surface water @150 LPCD (litre per capita per day)
as per CPHEEO manual.
5. To study elimination of tube wells for groundwater sustainability for future
generations.
4 Methodology to Meet the Desired Goal of Achieving
Continuous Water Supply
1. Hydraulic Modelling
2. Integration of DMA with SCADA
3. Calibration of Distribution network
4. Revision of Tariff System
5. NRW Reduction Measures
6. Reuse of treated water
7. IoT-based System for continuous supply.](https://image.slidesharecdn.com/21946484-250602012911-9665f9b9/85/Proceedings-Of-Third-International-Conference-On-Computing-Communications-And-Cybersecurity-Ic4s-2021-Pradeep-Kumar-Singh-54-320.jpg)
Proceedings Of Third International Conference On Computing Communications And Cybersecurity Ic4s 2021 Pradeep Kumar Singh
- 1. Proceedings Of Third International Conference On Computing Communications And Cybersecurity Ic4s 2021 Pradeep Kumar Singh download https://ebookbell.com/product/proceedings-of-third-international- conference-on-computing-communications-and-cybersecurity- ic4s-2021-pradeep-kumar-singh-43892968 Explore and download more ebooks at ebookbell.com
- 2. Here are some recommended products that we believe you will be interested in. You can click the link to download. Proceedings Of Third International Conference On Communication Computing And Electronics Systems V Bindhu https://ebookbell.com/product/proceedings-of-third-international- conference-on-communication-computing-and-electronics-systems-v- bindhu-59900998 Proceedings Of The Third International Conference On Microelectronics Computing And Communication Systems Mccs 2018 1st Ed Vijay Nath https://ebookbell.com/product/proceedings-of-the-third-international- conference-on-microelectronics-computing-and-communication-systems- mccs-2018-1st-ed-vijay-nath-10493990 Proceedings Of Third International Conference On Sustainable Computing Ramesh Chandra Poonia https://ebookbell.com/product/proceedings-of-third-international- conference-on-sustainable-computing-ramesh-chandra-poonia-37598178 Proceedings Of Third International Conference On Intelligent Computing Information And Control Systems 1st Edition A Pasumpon Pandian https://ebookbell.com/product/proceedings-of-third-international- conference-on-intelligent-computing-information-and-control- systems-1st-edition-a-pasumpon-pandian-59900996
- 3. Proceedings Of The Third International Conference On Computing Mathematics And Statistics Icms2017 Transcending Boundaries Embracing Multidisciplinary Diversities 1st Ed Liewkee Kor https://ebookbell.com/product/proceedings-of-the-third-international- conference-on-computing-mathematics-and-statistics- icms2017-transcending-boundaries-embracing-multidisciplinary- diversities-1st-ed-liewkee-kor-10494046 Proceedings Of The Third International Conference On Soft Computing For Problem Solving Socpros 2013 Volume 2 1st Edition Millie Pant https://ebookbell.com/product/proceedings-of-the-third-international- conference-on-soft-computing-for-problem-solving- socpros-2013-volume-2-1st-edition-millie-pant-4666276 Proceedings Of The Third International Conference On Soft Computing For Problem Solving Socpros 2013 Volume 1 1st Edition Millie Pant https://ebookbell.com/product/proceedings-of-the-third-international- conference-on-soft-computing-for-problem-solving- socpros-2013-volume-1-1st-edition-millie-pant-4666278 Smart Intelligent Computing And Applications Proceedings Of The Third International Conference On Smart Computing And Informatics Volume 1 1st Ed 2020 Suresh Chandra Satapathy https://ebookbell.com/product/smart-intelligent-computing-and- applications-proceedings-of-the-third-international-conference-on- smart-computing-and-informatics-volume-1-1st-ed-2020-suresh-chandra- satapathy-10805570 Smart Intelligent Computing And Applications Proceedings Of The Third International Conference On Smart Computing And Informatics Volume 2 1st Ed 2020 Suresh Chandra Satapathy https://ebookbell.com/product/smart-intelligent-computing-and- applications-proceedings-of-the-third-international-conference-on- smart-computing-and-informatics-volume-2-1st-ed-2020-suresh-chandra- satapathy-10806516
- 5. Lecture Notes in Networks and Systems 421 Pradeep Kumar Singh · SławomirT.Wierzchoń · SudeepTanwar · Joel J. P. C. Rodrigues · Maria Ganzha Editors Proceedings ofThird International Conference on Computing, Communications, and Cyber-Security IC4S 2021
- 6. Lecture Notes in Networks and Systems Volume 421 Series Editor Janusz Kacprzyk, Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland Advisory Editors Fernando Gomide, Department of Computer Engineering and Automation—DCA, School of Electrical and Computer Engineering—FEEC, University of Campinas— UNICAMP, São Paulo, Brazil Okyay Kaynak, Department of Electrical and Electronic Engineering, Bogazici University, Istanbul, Turkey Derong Liu, Department of Electrical and Computer Engineering, University of Illinois at Chicago, Chicago, USA Institute of Automation, Chinese Academy of Sciences, Beijing, China Witold Pedrycz, Department of Electrical and Computer Engineering, University of Alberta, Alberta, Canada Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland Marios M. Polycarpou, Department of Electrical and Computer Engineering, KIOS Research Center for Intelligent Systems and Networks, University of Cyprus, Nicosia, Cyprus Imre J. Rudas, Óbuda University, Budapest, Hungary Jun Wang, Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
- 7. The series “Lecture Notes in Networks and Systems” publishes the latest developments in Networks and Systems—quickly, informally and with high quality. Original research reported in proceedings and post-proceedings represents the core of LNNS. Volumes published in LNNS embrace all aspects and subfields of, as well as new challenges in, Networks and Systems. The series contains proceedings and edited volumes in systems and networks, spanning the areas of Cyber-Physical Systems, Autonomous Systems, Sensor Networks, Control Systems, Energy Systems, Automotive Systems, Biological Systems, Vehicular Networking and Connected Vehicles, Aerospace Systems, Automation, Manufacturing, Smart Grids, Nonlinear Systems, Power Systems, Robotics, Social Systems, Economic Systems and other. Of particular value to both the contributors and the readership are the short publication timeframe and the world-wide distribution and exposure which enable both a wide and rapid dissemination of research output. The series covers the theory, applications, and perspectives on the state of the art and future developments relevant to systems and networks, decision making, control, complex processes and related areas, as embedded in the fields of interdisciplinary and applied sciences, engineering, computer science, physics, economics, social, and life sciences, as well as the paradigms and methodologies behind them. Indexed by SCOPUS, INSPEC, WTI Frankfurt eG, zbMATH, SCImago. All books published in the series are submitted for consideration in Web of Science. For proposals from Asia please contact Aninda Bose (aninda.bose@springer.com). More information about this series at https://link.springer.com/bookseries/15179
- 8. Pradeep Kumar Singh · Sławomir T. Wierzchoń · Sudeep Tanwar · Joel J. P. C. Rodrigues · Maria Ganzha Editors Proceedings of Third International Conference on Computing, Communications, and Cyber-Security IC4S 2021
- 9. Editors Pradeep Kumar Singh Department of Computer Science KIET Group of Institutions Ghaziabad, Delhi, India Sudeep Tanwar Department of Computer Science and Engineering Nirma University Ahmedabad, India Maria Ganzha Faculty of Mathematics and Informatics Warsaw University of Technology Warsaw, Poland Sławomir T. Wierzchoń Institute of Computer Science Polish Academy of Sciences Warsaw, Poland Joel J. P. C. Rodrigues Federal University of Piauí Teresina, Brazil Instituto de Telecomunicações Covilha, Portugal ISSN 2367-3370 ISSN 2367-3389 (electronic) Lecture Notes in Networks and Systems ISBN 978-981-19-1141-5 ISBN 978-981-19-1142-2 (eBook) https://doi.org/10.1007/978-981-19-1142-2 © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2023 This work is subject to copyright. All rights are solely and exclusively licensed by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors, and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd. The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721, Singapore
- 10. Preface The 3rd International Conference on Computing, Communications, and Cyber- Security (IC4S-2021) held on October 30–31, 2021, at Krishna Engineering College (KEC), Ghaziabad, India. The conference covered the majority of the research papers from five technical tracks; it includes (i) Communication and Networks Technolo- gies, (ii) Advanced Computing Technologies, (iii) Data Analytics and Intelligent Learning, (iv) Latest Electrical and Electronics Trend, and (v) Security and Privacy Issues. The main idea of the conference is to provide a common platform for the scientists, researchers, policy makers to discuss the novel ideas based on architec- tures, algorithms, surveys, policies, design, communication challenges, open issues, and future research aspects. The conference was hosted by the Department of Electronics and Communi- cation Engineering of Krishna Engineering College (KEC), Ghaziabad, India. The inaugural speech along with the welcome address was given by the director and joint director of KEC, Ghaziabad, followed by the address of general chair of the conference. The first keynote talk was delivered by Dr. Vandana Bassco, Depart- ment of Electrical and Electronics Engineering, University of Mauritius, Mauritius. The vote of thanks during the inaugural address was given by Dr. A. N. Mishra, Dean (SA) and HoD (ECE), KEC, Ghaziabad, and Local Organizing Chair of IC4S- 2021. Two more keynotes were also delivered by Dr. Noor Zaman Jhanjhi, Director Center for Smart Society, School of Computer Science and Engineering, Faculty of Innovation and Technology, Taylor’s University, Malaysia, and by Dr. Anand Paul, Kyungpook National University, South Korea. The conference was organized with the academic support of the Knowledge University, Erbil, Iraq; Southern Federal University, Russia; and WSG University in Bydgoszcz, Poland, along with IAC, India. Many experts from these institutions helped during the conference during call for papers, review, in preparation of program schedule, during technical sessions, and for other technical support activities. We are highly thankful to our valuable authors for their contribution and presen- tations. The organizing team is thankful to the Technical Program Committee for their immense support during the review process. We express our sincere thanks to the organizing team for hosting the two-day event and conducting two-day sessions v
- 11. vi Preface very diligently. The IC4S-2021 team is thankful to all session chairs, who chaired the various technical sessions and provided wonderful suggestions to the authors. The session chairs have shared their technical expertise and enlightened the delegates of the conference during the paper presentation sessions. We express our sincere gratitude to our publication partner, Springer, LNNS Series, for believing in us. Ghaziabad, India Warsaw, Poland Ahmedabad, India Teresina, Brazil Warsaw, Poland October 2021 Pradeep Kumar Singh Sławomir T. Wierzchoń Sudeep Tanwar Joel J. P. C. Rodrigues Maria Ganzha
- 12. Contents Communication and Network Technologies Enhancement of Energy Efficiency in Wireless Sensor Network with Mobile Sink: A Survey . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Akhilesh Kumar Srivastava, Suneet Kumar Gupta, and Rijwan Khan Conversion of Intermittent Water Supply to Continuous Water Supply of Chandigarh: A Case Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 Sanjeev Chauhan and R. M. Belokar A Novel Compression Method for Transmitting Multimedia Data in Wireless Multimedia Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 Richa Tiwari and Rajesh Kumar Live Temperature Monitoring: IoT-Based Automatic Sanitizer Dispenser and Temperature Detection Machine . . . . . . . . . . . . . . . . . . . . . . 49 Rudresh V. Kurhe, Anirban Sur, and Sharnil Pandiya A Comparative Study of Security Issues and Attacks on Underwater Sensor Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 Samiksha Kumari, Karan Kumar Singh, Parma Nand, Gouri Sankar Mishra, and Rani Astya Discrete Event Driven Routing in SHIP Network using CupCarbon Simulation Tool . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75 Himanshu Duseja, Ashok Kumar, Rahul Johari, and Deo Prakash Vidyarthi Multiband Dual-Layer Microstrip Patch Antenna for 5G Wireless Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 Vineet Vishnoi, Pramod Singh, Ishan Budhiraja, and Praveen Kumar Malik vii
- 13. viii Contents Distance-based Energy-Efficient Clustering Approach for Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 Bhawnesh Kumar, Naveen Kumar, Harendra Singh Negi, and Rakesh Kumar Saini Emerging Communication Technologies for Industrial Internet of Things: Industry 5.0 Perspective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Nagesh Kumar, Bhisham Sharma, and Sushil Narang Explainable Artificial Intelligence (XAI): Connecting Artificial Decision-Making and Human Trust in Autonomous Vehicles . . . . . . . . . . . 123 A. V. Shreyas Madhav and Amit Kumar Tyagi Advanced Computing Technologies An Empirical Study of Design Techniques of Chatbot, a Review . . . . . . . . 139 Akanksha Yadav and Namrata Dhanda An Approach for Cloud Security Using TPA- and Role-Based Hybrid Concept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 Pooja Singh, Manish Kumar Mukhija, and Satish Kumar Alaria Decision Tree Algorithm for Diagnosis and Severity Analysis of COVID-19 at Outpatient Clinic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 Ritika Rathore, Piyush Kumar, and Rushina Singhi CSBRCA: Cloud Security Breaches and Its Root Cause Analysis . . . . . . . 179 Vivek Kumar Prasad, Vipul Chudasama, Akshay Mewada, Madhuri Bhavsar, and Asheesh Shah A Mobile-Based Patient Surgical Appointment System Using Fuzzy Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193 Femi Emmanuel Ayo, Sanjay Misra, Joseph Bamidele Awotunde, Ranjan Kumar Behera, Jonathan Oluranti, and Ravin Ahuja Implementation of Green Technology in Cloud Computing . . . . . . . . . . . . 209 Soha Bhatia, Anushka Shrivastava, Radhika Nigam, and Punit Gupta Concurrency Control in Distributed Database Systems: An In-Depth Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 223 Husen Saifibhai Nalawala, Jaymin Shah, Smita Agrawal, and Parita Oza House Pricing Prediction Based on Composite Facility Score Using Machine Learning Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235 Santosh Kumar and Mohammad Haider Syed Malicious Website Detection Based on URL Classification: A Comparative Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 249 Swati Maurya and Anurag Jain
- 14. Contents ix Attribute Selection, Sampling, and Classifier Methods to Address Class Imbalance Issues on Data Set Having Ratio Less Than Five . . . . . . 261 Aarchit Joshi, Kushal Kanwar, and Pankaj Vaidya Timely Prediction of Diabetes by Means of Machine Learning Practices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277 Rajan Prasad Tripathi, Punit Gupta, and Mayank Kumar Goyal Data Analytics and Intelligent Learning Detection of Brain Tumor Using K-Means Clustering . . . . . . . . . . . . . . . . . 291 Ravendra Singh and Bharat Bhushan Agarwal On Efficient and Secure Multi-access Edge Computing for Internet of Things . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Akshita, Yashwant Singh, and Zakir Ahmad Sheikh Execution Survey and State of the Art of Different ML-Based Ensemble Classifiers Approach Contextual Analysis of Spam Remark Location . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311 Biswajit Mondal and Subir Gupta Real-Time Eyesight Power Prediction Using Deep Learning Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325 Amit Saraswat, Abhijeet Negi, Kushagara Mittal, Brij Bhushan Sharma, and Nimish Kappal An Unsupervised Machine Learning Approach to Prediction of Price for Taxi Rides . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341 Ankit Kumar, Kunal Jani, Abhishek Kumar Jishu, Visaj Nirav Shah, Kushagra Pathak, and Manish Khare Facial Landmark Features-Based Face Misclassification Detection System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 349 Aditya Bakshi and Sunanda Gupta Predictive Model for Agriculture Using Markov Model . . . . . . . . . . . . . . . 361 Punit Gupta, Sumit Bharadwaj, Arjun Singh, and Dinesh Kumar Saini A Comparative Analysis of Edge Detection Using Soft Computing Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377 Ankush Verma, Namrata Dhanda, and Vibhash Yadav A Comprehensive Study of Pose Estimation in Human Fall Detection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 395 Shikha Rastogi and Jaspreet Singh
- 15. x Contents Study and Develop a Convolutional Neural Network for MNIST Handwritten Digit Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 407 Disha Jayswal, Brijeshkumar Y. Panchal, Bansari Patel, Nidhi Acharya, Rikin Nayak, and Parth Goel Unravel the Outlier Detection for Indian Ayurvedic Plant Organ Image Dataset . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 417 Meera Kansara and Ajay Parikh A Review on Service Delivery in Tourism and Hospitality Industry Through Artificial Intelligence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 427 Yashwant Singh Rawal, Harvinder Soni, Rakesh Dani, and Purnendu Bagchi MegaMart Sales Prediction Using Machine Learning Techniques . . . . . . 437 Gopal Gupta, Kanchan Lata Gupta, and Gaurav Kansal Collaborative Filtering-Based Music Recommendation in View of Negative Feedback System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 447 Jai Prakash Verma, Pronaya Bhattacharya, Aarav Singh Rathor, Jaymin Shah, and Sudeep Tanwar Internet of Things-Based e-Health Care: Key Challenges and Recommended Solutions for Future . . . . . . . . . . . . . . . . . . . . . . . . . . . . 461 Gadiparthy Harika Sai, Khushboo Tripathi, and Amit Kumar Tyagi Deep Learning and Machine Intelligence for Operational Management of Strategic Planning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 475 Anupam Kumar Sharma, Prashant Singh, Prashant Vats, and Dhyanendra Jain Machine Learning-Enabled Estimation System Using Fuzzy Cognitive Mapping: A Review . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 487 Ashutosh Sharma and Alexey Tselykh Latest Electrical and Electronics Trends Energy Efficiency in IoT-Based Smart Healthcare . . . . . . . . . . . . . . . . . . . . 503 Pallavi Sangra, Bharti Rana, and Yashwant Singh T-Shaped MIMO Microstrip Patch Antenna for C-Band Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 517 Piyush Kumar Eye Disease Detection Using Transfer Learning on VGG16 . . . . . . . . . . . . 527 Aditi Arora, Shivam Gupta, Shivani Singh, and Jaya Dubey Text-Based Automatic Personality Recognition: Recent Developments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 537 Sumiya Mushtaq and Neerendra Kumar
- 16. Contents xi Use of a Precious Commodity—‘Time’ for Building Skills by Teachers for Online Teaching During Pandemic by Using Decision Tree and SVM Algorithm of Machine Learning . . . . . . . . . . . . . . 551 Bharti Khemani, Jewel Sabhani, and Mala Goplani Road Lane Line Detection Based on ROI Using Hough Transform Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 567 Mohammad Haider Syed and Santosh Kumar Dimensionality Reduction-Based Discriminatory Classification of Human Activity Recognition Using Machine Learning . . . . . . . . . . . . . . 581 Manoj Kumar, Pratiksha Gautam, and Vijay Bhaskar Semwal SPECIAL SESSION ON RECENT ADVANCES IN COMPUTATIONAL INTELLIGENCE & TECHNOLOGYS (SS_10_RACIT) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 595 Ram Kumar Yadav, Subhrendu Guha Neogi, and Vijay Bhaskar Semwal Cryptanalysis on “ESEAP: ECC-Based Secure and Efficient Mutual Authentication Protocol Using Smart Card” . . . . . . . . . . . . . . . . . . 609 Mohammad Abdussami, Ruhul Amin, and Satyanarayana Vollala Modeling, Simulation, and Comparative Analysis of Flyback Inverter Using Different Techniques of PWM Generation . . . . . . . . . . . . . 619 Mangala R. Dhotre, Prashant V. Thakre, and V. M. Deshmukh Industrial Rod Size Diameter and Size Detection . . . . . . . . . . . . . . . . . . . . . 635 Swathi Gowroju, N. Santhosh Ramchander, B. Amrita, and S. Harshith Sentiment Analysis of Twitter Data Using Clustering and Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 651 Santanu Modak and Abhoy Chand Mondal Security and Privacy Issues Image Distortion Analysis in Stego Images Using LSB . . . . . . . . . . . . . . . . 667 Shubh Gaur, Swati Chaturvedi, Shiavnsh Gupta, Jay Mittal, Rohit Tanwar, and Mrinal Goswami Towards a Secured IoT Communication: A Blockchain Implementation Through APIs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 681 Rajat Verma, Namrata Dhanda, and Vishal Nagar Application of Truffle Suite in a Blockchain Environment . . . . . . . . . . . . . 693 Rajat Verma, Namrata Dhanda, and Vishal Nagar Assessment of Compliance of GDPR in IT Industry and Fintech . . . . . . . 703 Pankaj Pathak, Parashu Ram Pal, Rajesh Kumar Maurya, Rishabh, Mayur Rahul, and Vikash Yadav
- 17. xii Contents Digitally Signed Document Chain (DSDC) Blockchain . . . . . . . . . . . . . . . . 715 Udai Bhan Trivedi and Santosh Sharma Algorithms of AI in Deciding Optimum Mix Design of Concrete: Review . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 729 Rajat Verma, Uzair Khan, Binod Kumar Singh, and Rizwan A. Khan A Review of Integration of Data Warehousing and WWW in the Last Decade . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 743 Priyanka Bhutani, Anju Saha, and Anjana Gosain WeScribe: An Intelligent Meeting Transcriber and Analyzer Application . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 755 Mohammad Aftab Alam Khan, Maryam AlAyat, Jumana AlGhamdi, Shahad Mohammed AlOtaibi, Maha AlZahrani, Malak AlQahtani, Atta-ur-Rahman, Mona Altassan, and Farmanullah Jan Customer Churn Prediction in Banking Industry Using Power Bi . . . . . . 767 Awe M. Oluwatoyin, Sanjay Misra, John Wejin, Abhavya Gautam, Ranjan Kumar Behera, and Ravin Ahuja Issues in Credit Card Transactional Data Stream: A Rational Review . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 775 Rinku, Sushil Kumar Narang, and Neha Kishore Artificial Intelligence-Based Smart Packet Filter . . . . . . . . . . . . . . . . . . . . . 791 Mohit Dayal, Ameya Chawla, Manju Khari, and Aparna N. Mahajan Preserving Privacy in Internet of Things (IoT)-Based Devices . . . . . . . . . . 803 Dheeraj Sharma and Amit Kumar Tyagi A Sentiment Analysis-Based Recommender Framework for Massive Open Online Courses Toward Education 4.0 . . . . . . . . . . . . . . 817 Akhil Bhatia, Anansha Asthana, Pronaya Bhattacharya, Sudeep Tanwar, Arunendra Singh, and Gulshan Sharma Lung Cancer Detection Using Textural Feature Extraction and Hybrid Classification Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 829 Jasbir Kaur and Meenu Gupta Overview of Security Approaches Using Metamorphic Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 847 Lokesh Negi and Lalit Negi A Bibliometric Analysis to Unveil the Impact of Digital Object Identifiers (DOI) on Bibliometric Indicators . . . . . . . . . . . . . . . . . . . . . . . . . 859 Parul Khurana, Geetha Ganesan, Gulshan Kumar, and Kiran Sharma Cyber Attack Modeling Recent Approaches: A Review . . . . . . . . . . . . . . . . 871 Neha and Anubha Maurya
- 18. Contents xiii A Secure DBA Management System: A Comprehensive Study . . . . . . . . . 883 Khushboo Jain, Umesh Jangid, Princy Kansara, Smita Agrawal, and Parita Oza Education 4.0: Hesitant Fuzzy SWARA Assessment Approach for Intelligent Selection of Research Opportunities . . . . . . . . . . . . . . . . . . . 895 Pooja Khanna, Pragya, Ritika Gauba, and Sachin Kumar Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 909
- 19. Editors and Contributors About the Editors Dr.PradeepKumarSinghiscurrentlyworkingasaProfessorandHead,Department of Computer Science, KIET Group of Institutions, Delhi-NCR Campus, Ghaziabad, India. He is Associate Editor of the IJISMD [IJISMD is indexed by Scopus and Web of Science], IJAEC, IGI Global USA, SPY, Wiley IJISC from Romania. He is recently appointed as Section Editor, Discover IoT, Springer Journal. He has published nearly 120 research papers. He has received three sponsored research projects grant worth Rs. 25 lakhs. He has edited a total 16 books from Springer and Elsevier and also edited several special issues for SCI and SCIE Journals from Elsevier and IGI Global. He has Google Scholar citations 1551, H-index 20, and i-10 index 50. Prof. Sławomir T. Wierzchoń received M.Sc. and Ph.D. degrees in Computer Science from Technical University of Warsaw, Poland. He holds Habilitation (D.Sc.) in Uncertainty Management from Polish Academy of Sciences. In 2003, he received the title of Professor from the President of Poland. Currently, he is Full Professor at the Institute of Computer Science of Polish Academy of Sciences. His research interests include computational intelligence, uncertainty management, information retrieval, machine learning, and data mining. He is Author/Co-author of over 100 peer-reviewed papers in international journals and international conferences. He published, as Author/Co-author, 11 monographs from the field of machine learning. In the period 2000–2013, he co-organized 13 international conferences on intel- ligent information systems. Co-authored proceedings from these conferences was published by Springer. He co-edited two volumes of proceedings of the international conference on computer information systems and industrial management, and he has served as Guest Co-editor of three special issues of Information and Control journal. Currently, he is Member of the editorial board for some international journals, as well as Member of many program committees for international conferences. He cooper- ated with medical centers in the area of statistical data analysis and knowledge discovery in databases. xv
- 20. xvi Editors and Contributors Dr.SudeepTanwar isworkingasafullprofessorattheNirmaUniversity,India.Heis also a Visiting Professor with Jan Wyzykowski University, Poland, and the University of Pitesti, Romania. He received B.Tech in 2002 from Kurukshetra University, India, M.Tech (Honor’s) in 2009 from Guru Gobind Singh Indraprastha University, Delhi, India and Ph.D. in 2016 with specialization in Wireless Sensor Network. He has authored 04 books and edited 20 books, more than 270 technical articles, including top cited journals and conferences, such as IEEE TNSE, IEEE TVT, IEEE TII, IEEE TGCN, IEEE TCSC, IEEE IoTJ, IEEE NETWORKS, ICC, IWCMC, GLOBECOM, CITS, and INFOCOM. He initiated the research field of blockchain technology adop- tion in various verticals, in 2017. His H-index is 52. His research interests include blockchain technology, wireless sensor networks, fog computing, smart grid, and the IoT. He is a member of the Technical Committee on Tactile Internet of IEEE Commu- nication Society. He has been awarded the Best Research Paper Awards from IEEE IWCMC-2021, IEEE ICCCA-2021, IEEE GLOBECOM 2018, IEEE ICC 2019, and Springer ICRIC-2019. He has won Dr KW Wong Annual Best Paper Prize for 2021 sponsored by Elsevier (publishers of JISA). He has served many international confer- ences as a member of the Organizing Committee, such as the Publication Chair for FTNCT-2020, ICCIC 2020, and WiMob2019, and a General Chair for IC4S 2019, 2020, ICCSDF 2020, FTNCT 2021. He is also serving the editorial boards of COMCOM-Elsevier, IJCS-Wiley, Cyber Security and Applications- Elsevier, Fron- tiers of blockchain, and SPY, Wiley. He is also leading the ST Research Laboratory, where group members are working on the latest cutting-edge technologies. Dr. Joel J. P. C. Rodrigues [S’01, M’06, SM’06, F’20] is Professor at the Federal University of Piauí, Brazil; Senior Researcher at the Instituto de Telecomunicações, Portugal; and Collaborator of the Post-Graduation Program on Teleinformatics Engi- neering at the Federal University of Ceará (UFC), Brazil. He is Leader of the Next Generation Networks and Applications (NetGNA) research group (CNPq), IEEE Distinguished Lecturer [2018–2021], Member Representative of the IEEE Commu- nications Society on the IEEE Biometrics Council [2011– ], and President of the scientific council at ParkUrbis—Covilhã Science and Technology Park [2015– ]. He was Director for Conference Development—IEEE ComSoc Board of Gover- nors [2018–2019], Technical Activities Committee Chair of the IEEE ComSoc Latin America Region Board [2018–2019], Past-Chair of the IEEE ComSoc Technical Committee on eHealth, Past-Chair of the IEEE ComSoc Technical Committee on Communications Software, Steering Committee Member of the IEEE Life Sciences Technical Community and Publications Co-Chair [2014–2017]. He is Editor-in-chief of the International Journal on E-Health and Medical Communications and Editorial Board Member of several high-reputed journals. He has been General Chair and TPC Chair of many international conferences, including IEEE ICC, IEEE GLOBECOM, IEEE HEALTHCOM, and IEEE LatinCom. He has authored or coauthored over 850 papers in refereed international journals and conferences, 3 books, 2 patents, and 1 ITU-T recommendation. He had been awarded several Outstanding Leadership and Outstanding Service Awards by IEEE Communications Society and several best
- 21. Editors and Contributors xvii papers awards. He is Member of the Internet Society, Senior Member ACM, and Fellow of IEEE. Dr. Maria Ganzha is Associate Professor in the Faculty of Mathematics and Infor- mation Science. She has MS and Ph.D. degrees in Mathematics from the Moscow State University, Russia, and a Doctor of Science degree (in Computer Science) from the Polish Academy of Sciences. She has published more than 200 research papers, is on editorial boards of 6 journals and a book series, and was invited to program committees of more than 150 conferences. She is also Principal Investigator, of the SRIPAS team, in the INTER-IoT project. Here, her team is responsible for use of semantic technologies in the context of interoperability of IoT platforms. She has 1594 Google Scholar citations, h-index 19, and i-10 index 58 in her account. Her area of interest includes computational intelligence, distributed systems, agent-based computing, and semantic data processing. Contributors Mohammad Abdussami DSPM IIIT Naya Raipur, Raipur, India Nidhi Acharya Department of Computer Engineering, Faculty of Technology and Engineering (FTE), Devang Patel Institute of Advance Technology and Research (DEPSTAR), Charotar University of Science and Technology (CHARUSAT), Changa, India Bharat Bhushan Agarwal Department of Computer Science and Engineering, IFTM University, Moradabad, India Smita Agrawal Computer Science and Engineering Department, Institute of Tech- nology, Nirma University, Ahmedabad, India Ravin Ahuja Delhi Skill and Entrepreneurship University, New Delhi, India Akshita Department of Computer Science and Information Technology, Central University of Jammu, Bagla Suchani, J&K, India Satish Kumar Alaria Department of Electronics & Communication, AIET, Jaipur, India Maryam AlAyat Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia Jumana AlGhamdi Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia
- 22. xviii Editors and Contributors Shahad Mohammed AlOtaibi Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia Malak AlQahtani Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia Mona Altassan Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia Maha AlZahrani Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia Ruhul Amin DSPM IIIT Naya Raipur, Raipur, India B. Amrita Department of CSE, G. Narayanamma Institute of Technology and Science, Hyderabad, India Aditi Arora ABES Engineering College, Ghaziabad, Uttar Pradesh, India Anansha Asthana Indian Institute of Technology, Jodhpur, Rajasthan, India Rani Astya Department of Computer Science and Engineering, Sharda University, Greater Noida, India Atta-ur-Rahman Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia Joseph Bamidele Awotunde Department of Computer Science, University of Ilorin, Ilorin, Nigeria Femi Emmanuel Ayo Department of Computer Science, McPherson University, Seriki-Sotayo, Abeokuta, Nigeria Purnendu Bagchi Amity University, Kolkata, India Aditya Bakshi Department of Computer Science and Engineering, Shri Mata Vaishno Devi University, Katra, Jammu & Kashmir, India Ranjan Kumar Behera Birla Institute of Technology, Mesra, India R. M. Belokar Department of Production and Industrial Engineering, Punjab Engineering College (PEC), Chandigarh, India Sumit Bharadwaj Amity University, Noida, India Akhil Bhatia Indian Institute of Technology, Jodhpur, Rajasthan, India Soha Bhatia Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur, Rajasthan, India
- 23. Editors and Contributors xix Pronaya Bhattacharya Department of Computer Science and Engineering, Insti- tute of Technology, Nirma University, Ahmedabad, Gujarat, India Madhuri Bhavsar Institute of Technology, Nirma University, Ahmedabad, India Priyanka Bhutani University School of Information and Communication Tech- nology, Guru Gobind Singh Indraprastha University, Dwarka, Delhi, India Ishan Budhiraja Bennett University, Greater Noida, Uttar Pradesh, India Swati Chaturvedi School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India Sanjeev Chauhan Department of Production and Industrial Engineering, Punjab Engineering College (PEC), Chandigarh, India Ameya Chawla Guru Tegh Bahadur Institute of Technology, Guru Gobind Singh Indraprastha University, New Delhi, India Vipul Chudasama Institute of Technology, Nirma University, Ahmedabad, India Rakesh Dani Graphic Era Deemed to be University, Dehradun, India Mohit Dayal Dr Akhilesh Das Gupta Institute of Technology and Management, New Delhi, India V. M. Deshmukh Kavayitri Bahinabai Chaudhari North Maharashtra University, Jalgaon, Maharashtra, India Namrata Dhanda Department of Computer Science and Engineering, ASET, Amity University, Lucknow, Uttar Pradesh, India; Amity School of Engineering and Technology, AUUP, Lucknow, India Mangala R. Dhotre SSBT’s College of Engineering and Technology, Bambhori, Jalgaon, India Jaya Dubey ABES Engineering College, Ghaziabad, Uttar Pradesh, India Himanshu Duseja SWINGER: Security, Wireless, IoT Network Group of Engi- neering and Research, University School of Information, Communication and Tech- nology (USICT), Guru Gobind Singh Indraprastha University, Dwarka, Delhi, India Geetha Ganesan Advanced Computing Research Society, Chennai, India Ritika Gauba Zenith Ph.D. Training and Consultancy, Jaipur, India Shubh Gaur School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India Abhavya Gautam Guild Insurance Group, Brandon, Canada Pratiksha Gautam Amity University Gwalior, Gwalior, Madhya Pradesh, India
- 24. xx Editors and Contributors Parth Goel Department of Computer Science and Engineering, Faculty of Tech- nology and Engineering (FTE), Devang Patel Institute of Advance Technology and Research (DEPSTAR), Charotar University of Science and Technology (CHARUSAT), Changa, India Mala Goplani HVPS Ramniranjan Jhunjhunwala College Arts, Science, and Commerce, Mumbai, India Anjana Gosain UniversitySchoolofInformationandCommunicationTechnology, Guru Gobind Singh Indraprastha University, Dwarka, Delhi, India Mrinal Goswami School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India Swathi Gowroju Department of CSE, Sreyas Institute of Engineering and Tech- nology, Hyderabad, India Mayank Kumar Goyal Department of Computer Science & Engineering, School of Engineering & Technology, Sharda University, Greater Noida, India Gopal Gupta ABES Engineering College, Ghaziabad, Uttar Pradesh, India Kanchan Lata Gupta Institute of Engineering and Technology, Lucknow, India Meenu Gupta Chandigarh University, Mohali, Punjab, India Punit Gupta Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur, Rajasthan, India Shiavnsh Gupta School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India Shivam Gupta ABES Engineering College, Ghaziabad, Uttar Pradesh, India Subir Gupta Department of Computer Science and Engineering, Dr. B. C. Roy Engineering College, Durgapur, West Bengal, India Sunanda Gupta Department of Computer Science and Engineering, Shri Mata Vaishno Devi University, Katra, Jammu & Kashmir, India Suneet Kumar Gupta Benett University, Gautam Buddha Nagar, India S. Harshith Department of CSE, Sreyas Institute of Engineering and Technology, Hyderabad, India Anurag Jain Guru Gobind Singh Indraprastha University, New Delhi, New Delhi, India Dhyanendra Jain Dr. Akhilesh Das Gupta Institute of Technology and Manage- ment, Guru Gobind Singh Indraprastha University, New Delhi, India Khushboo Jain CSE Department, Institute of Technology, Nirma University, Ahmedabad, India
- 25. Editors and Contributors xxi Farmanullah Jan Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia Umesh Jangid CSE Department, Institute of Technology, Nirma University, Ahmedabad, India Kunal Jani Santa Clara University, Santa Clara, CA, USA Disha Jayswal Department of Computer Science and Engineering, Faculty of Technology and Engineering (FTE), Devang Patel Institute of Advance Tech- nology and Research (DEPSTAR), Charotar University of Science and Technology (CHARUSAT), Changa, India Abhishek Kumar Jishu DAIICT, Gandhinagar, India Rahul Johari SWINGER: Security, Wireless, IoT Network Group of Engineering and Research, University School of Information, Communication and Technology (USICT), Guru Gobind Singh Indraprastha University, Dwarka, Delhi, India Aarchit Joshi Shoolini University, Bajhol, HP, India Gaurav Kansal ABES Engineering College, Ghaziabad, Uttar Pradesh, India Meera Kansara Gujarat Vidyapith, Ahmedabad, India Princy Kansara CSE Department, Institute of Technology, Nirma University, Ahmedabad, India Kushal Kanwar Shoolini University, Bajhol, HP, India Nimish Kappal Shoolini University, Bhajol, Solan, Himachal Prasdesh, India Jasbir Kaur Chandigarh University, Mohali, Punjab, India Mohammad Aftab Alam Khan Department of Computer Engineering, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia Rijwan Khan ABES Institute of Technology, Ghaziabad, India Rizwan A. Khan Department of Civil Engineering, Z.H College of Engineering and Technology, Aligarh Muslim University, Aligarh, India Uzair Khan Department of Civil Engineering, ABES Engineering College, Ghazi- abad, Uttar Pradesh, India Pooja Khanna Amity University, Lucknow Campus, India; MVPG College, Lucknow, India Manish Khare DAIICT, Gandhinagar, India Manju Khari Jawaharlal Nehru University, New Delhi, India Bharti Khemani A. P. Shah Institute of Technology, Thane, Mumbai, India
- 26. xxii Editors and Contributors Parul Khurana School of Computer Applications, Lovely Professional University, Phagwara, Punjab, India Neha Kishore Chitkara University School of Engineering and Technology, Chitkara University, Solan, Himachal Pradesh, India Ankit Kumar DAIICT, Gandhinagar, India Ashok Kumar SWINGER: Security, Wireless, IoT Network Group of Engineering and Research, University School of Information, Communication and Technology (USICT), Guru Gobind Singh Indraprastha University, Dwarka, Delhi, India Bhawnesh Kumar Graphic Era Deemed to be University, Dehradun, India Gulshan Kumar School of Computer Science and Engineering, Lovely Profes- sional University, Phagwara, Punjab, India Manoj Kumar Amity University Gwalior, Gwalior, Madhya Pradesh, India Nagesh Kumar School of Engineering and Technology, Chitkara University, Chitkara University, Kallujhanda, Himachal Pradesh, India Naveen Kumar Graphic Era Deemed to be University, Dehradun, India Neerendra Kumar Department of Computer Science and Information Technology, Central University of Jammu, Samba, Jammu and Kashmir, India Piyush Kumar Discipline of Electrical, Electronic and Computer Engineering, School of Engineering, Howard College Campus, University of KwaZulu-Natal, Durban, South Africa; Department of Computer Science and Engineering, ASET, Amity University, Noida, India Rajesh Kumar North Eastern Regional Institute of Science and Technology, Nirjuli, Arunachal Pradesh, India Sachin Kumar Amity University, Lucknow Campus, India; MVPG College, Lucknow, India Santosh Kumar Department of Computer Science and Engineering, ABES Engi- neering College, Ghaziabad, Uttar Pradesh, India Samiksha Kumari Department of Computer Science and Engineering, Sharda University, Greater Noida, India Rudresh V. Kurhe Symbiosis Institute of Technology, Symbiosis International (Deemed University), Lavale, Pune, Maharashtra, India A. V. Shreyas Madhav School of Computer Science and Engineering, Vellore Institute of Technology, Chennai, Tamil Nadu, India Aparna N. Mahajan Maharaja Agrasen University, Solan, Himachal Pradesh, India
- 27. Editors and Contributors xxiii Praveen Kumar Malik Lovely Professional University, Jalandhar, Punjab, India Anubha Maurya Department of Computer Science and Engineering, National Institute of Technology Patna, Patna, Bihar, India Rajesh Kumar Maurya ABES Engineering College, Ghaziabad, Uttar Pradesh, India Swati Maurya GuruGobindSinghIndraprasthaUniversity,NewDelhi,NewDelhi, India Akshay Mewada Institute of Technology, Nirma University, Ahmedabad, India Gouri Sankar Mishra Department of Computer Science and Engineering, Sharda University, Greater Noida, India Sanjay Misra Department of Computer Science and Communication, Østfold University College, Halden, Norway Jay Mittal School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India Kushagara Mittal Shoolini University, Bhajol, Solan, Himachal Prasdesh, India Santanu Modak Department of Computer Science, The University of Burdwan, Burdwan, India Abhoy Chand Mondal Department of Computer Science, The University of Burdwan, Burdwan, India Biswajit Mondal Department of Computer Science and Engineering, Dr. B. C. Roy Engineering College, Durgapur, West Bengal, India Manish Kumar Mukhija Department of Computer Science & Engineering, AIET, Jaipur, India Sumiya Mushtaq Department of Computer Science and Information Technology, Central University of Jammu, Samba, Jammu and Kashmir, India Vishal Nagar Department of Computer Science and Engineering, Pranveer Singh Institute of Technology, Kanpur, Uttar Pradesh, India Husen Saifibhai Nalawala ComputerScienceandEngineeringDepartment,Nirma University, Ahmedabad, India Parma Nand Department of Computer Science and Engineering, Sharda Univer- sity, Greater Noida, India Sushil Narang School of Engineering and Technology, Chitkara University, Chitkara University, Kallujhanda, Himachal Pradesh, India Sushil Kumar Narang Chitkara University School of Engineering and Tech- nology, Chitkara University, Solan, Himachal Pradesh, India
- 28. xxiv Editors and Contributors Rikin Nayak V. T. Patel Department of Electronics and Communication Engi- neering, CHARUSAT Space Research and Technology Center, Charotar University of Science and Technology, (CHARUSAT), Changa, India Abhijeet Negi Shoolini University, Bhajol, Solan, Himachal Prasdesh, India Harendra Singh Negi Graphic Era Deemed to be University, Dehradun, India Lalit Negi IT Department, Netaji Subhas University of Technology, Delhi, India Lokesh Negi CSE Department, Netaji Subhas University of Technology, Delhi, India Neha Department of Computer Science and Engineering, National Institute of Technology Patna, Patna, Bihar, India Subhrendu Guha Neogi Amity University Gwalior, Gwalior, India Radhika Nigam Department of Information Technology Engineering, Manipal University Jaipur, Jaipur, Rajasthan, India Jonathan Oluranti Center of ICT/ICE, CUCRID, Covenant University, Ota, Nigeria Awe M. Oluwatoyin Center of ICT/ICE, CUCRID, Covenant University, Ota, Nigeria Parita Oza Computer Science and Engineering Department, Institute of Tech- nology, Nirma University, Ahmedabad, India Parashu Ram Pal SAGE University, Bhopal, Madhya Pradesh, India Brijeshkumar Y. Panchal Department of Computer Science and Engineering, Faculty of Technology and Engineering (FTE), Devang Patel Institute of Advance Technology and Research (DEPSTAR), Charotar University of Science and Tech- nology (CHARUSAT), Changa, India Sharnil Pandiya Symbiosis Institute of Technology, Symbiosis International (Deemed University), Lavale, Pune, Maharashtra, India Ajay Parikh Gujarat Vidyapith, Ahmedabad, India Bansari Patel Department of Computer Science and Engineering, Faculty of Technology and Engineering (FTE), Devang Patel Institute of Advance Tech- nology and Research (DEPSTAR), Charotar University of Science and Technology (CHARUSAT), Changa, India Kushagra Pathak DAIICT, Gandhinagar, India Pankaj Pathak SymbiosisInstituteofDigitalandTelecomManagementSymbiosis International (Deemed University), Pune, India Pragya Amity University, Lucknow Campus, India; MVPG College, Lucknow, India
- 29. Editors and Contributors xxv Vivek Kumar Prasad Institute of Technology, Nirma University, Ahmedabad, India Mayur Rahul Department of Computer Application, CSJM University, Kanpur, India Bharti Rana Department of Computer Science and Information Technology, Central University of Jammu, Samba, Jammu and Kashmir, India Shikha Rastogi GD Goenka University, Sohna, Gurugram, Haryana, India; Bharati Vidyapeeth’s College of Engineering, New Delhi, India Aarav Singh Rathor Department of Computer Science and Engineering, Institute of Technology, Nirma University, Ahmedabad, Gujarat, India Ritika Rathore Amity Business School, Amity University, Noida, India Yashwant Singh Rawal Amity University Rajasthan, Jaipur, India Rinku Chitkara University School of Computer Applications, Chitkara University, Solan, Himachal Pradesh, India Rishabh Galgotias College of Engineering and Technology, Greater Noida, India Jewel Sabhani HVPS Ramniranjan Jhunjhunwala College Arts, Science, and Commerce, Mumbai, India Anju Saha University School of Information and Communication Technology, Guru Gobind Singh Indraprastha University, Dwarka, Delhi, India Gadiparthy Harika Sai School of Computer Science and Engineering, Vellore Institute of Technology, Chennai, Tamil Nadu, India Dinesh Kumar Saini Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur, India; DIT University, Dehradun, India Rakesh Kumar Saini DIT University, Dehradun, India Pallavi Sangra Department of Computer Science and Information Technology, Central University of Jammu, Samba, Jammu and Kashmir, India N. Santhosh Ramchander Department of CSE, Sreyas Institute of Engineering and Technology, Hyderabad, India Amit Saraswat Shoolini University, Bhajol, Solan, Himachal Prasdesh, India Vijay Bhaskar Semwal NIT Bhopal, Bhopal, Madhya Pradesh, India; MANIT Bhopal, Bhopal, India Asheesh Shah Mewar University, Chittorgarh, Rajasthan, India Jaymin Shah Department of Computer Science and Engineering, Institute of Technology, Nirma University, Ahmedabad, Gujarat, India
- 30. xxvi Editors and Contributors Visaj Nirav Shah DAIICT, Gandhinagar, India Anupam Kumar Sharma Dr. Akhilesh Das Gupta Institute of Technology and Management, Guru Gobind Singh Indraprastha University, New Delhi, India Ashutosh Sharma Institute of Computer Technology and Information Security, Southern Federal University, Taganrog, Russia Bhisham Sharma School of Engineering and Technology, Chitkara University, Chitkara University, Kallujhanda, Himachal Pradesh, India Brij Bhushan Sharma Shoolini University, Bhajol, Solan, Himachal Prasdesh, India Dheeraj Sharma School of Electronics Engineering, Vellore Institute of Tech- nology, Chennai, India Gulshan Sharma Durban University of Technology, Durban, South Africa Kiran Sharma School of Engineering and Technology, BML Munjal University, Gurugram, Haryana, India Santosh Sharma PSIT College of Higher Education, Kanpur, India Zakir Ahmad Sheikh Department of Computer Science and Information Tech- nology, Central University of Jammu, Bagla Suchani, J&K, India Anushka Shrivastava Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur, Rajasthan, India Arjun Singh Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur, India Arunendra Singh Pranveer Singh Institute of Technology, Kanpur, Uttar Pradesh, India Binod Kumar Singh Structural Engineering, School of Planning and Architecture, Delhi, India Jaspreet Singh GD Goenka University, Sohna, Gurugram, Haryana, India Karan Kumar Singh Department of Computer Science and Engineering, Sharda University, Greater Noida, India Pooja Singh Department of Computer Science & Engineering, AIET, Jaipur, India Pramod Singh Meerut Institute of Engineering and Technology, Meerut, Uttar Pradesh, India Prashant Singh Dr. Akhilesh Das Gupta Institute of Technology and Management, Guru Gobind Singh Indraprastha University, New Delhi, India Ravendra Singh Department of Computer Science and Engineering, IFTM Univer- sity, Moradabad, India
- 31. Editors and Contributors xxvii Shivani Singh ABES Engineering College, Ghaziabad, Uttar Pradesh, India Yashwant Singh Department of Computer Science and Information Technology, Central University of Jammu, Bagla Suchani, Samba, Jammu and Kashmir, India Rushina Singhi Amity Business School, Amity University, Noida, India Harvinder Soni Taxila Business School, Jaipur, India Akhilesh Kumar Srivastava ABES Engineering College, Ghaziabad, India Anirban Sur Symbiosis Institute of Technology, Symbiosis International (Deemed University), Lavale, Pune, Maharashtra, India Mohammad Haider Syed College of Computing and Informatics, Saudi Elec- tronic University, Riyadh, Saudi Arabia Rohit Tanwar School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India Sudeep Tanwar Department of Computer Science and Engineering, Institute of Technology, Nirma University, Ahmedabad, Gujarat, India Prashant V. Thakre Kavayitri Bahinabai Chaudhari North Maharashtra Univer- sity, Jalgaon, Maharashtra, India Richa Tiwari Krishna Engineering College, Ghaziabad, UP, India Khushboo Tripathi Department of Computer Science and Engineering, Amity University Haryana, Gurgaon, India Rajan Prasad Tripathi Amity University, Tashkent, Uzbekistan Udai Bhan Trivedi Pranveer Singh Institute of Technology, Kanpur, India Alexey Tselykh Institute of Computer Technology and Information Security, Southern Federal University, Taganrog, Russia Amit Kumar Tyagi School of Computer Science and Engineering, Centre for Advanced Data Science, Vellore Institute of Technology, Chennai, Tamil Nadu, India Pankaj Vaidya Shoolini University, Bajhol, HP, India Prashant Vats Dr. Akhilesh Das Gupta Institute of Technology and Management, Guru Gobind Singh Indraprastha University, New Delhi, India Ankush Verma Amity Institute of Information Technology, AUUP, Lucknow, India Jai Prakash Verma Department of Computer Science and Engineering, Institute of Technology, Nirma University, Ahmedabad, Gujarat, India Rajat Verma Department of Computer Science and Engineering, Amity University Uttar Pradesh, Lucknow, India;
- 32. xxviii Editors and Contributors Department of Civil Engineering, ABES Engineering College, Ghaziabad, Uttar Pradesh, India Deo Prakash Vidyarthi School of Computer and System Sciences, Parallel and Distributed System Lab, JNU, New Delhi, India Vineet Vishnoi Meerut Institute of Engineering and Technology, Meerut, Uttar Pradesh, India Satyanarayana Vollala DSPM IIIT Naya Raipur, Raipur, India John Wejin Center of ICT/ICE, CUCRID, Covenant University, Ota, Nigeria Akanksha Yadav Department of CSE, ASET, Amity University, Lucknow, Uttar Pradesh, India Ram Kumar Yadav Amity University Gwalior, Gwalior, India Vibhash Yadav Rajkiya Engineering College, Banda, India Vikash Yadav Department of Technical Education, Kanpur, Uttar Pradesh, India
- 33. Communication and Network Technologies
- 34. Enhancement of Energy Efficiency in Wireless Sensor Network with Mobile Sink: A Survey Akhilesh Kumar Srivastava, Suneet Kumar Gupta, and Rijwan Khan Abstract The energy consumed by any activity taking place in WSN should be controlled such that limited energy in terms of battery backup remains focus throughout. In the case of dying nodes, battery discharge may cause the network to get disconnected. WSN design issues, e.g., location of sensor nodes, scheduling activities, routes of data flow, mobile sink route, should be dealt with keeping energy limitation in mind. The sensor nodes sense the data from the area of concern and communicate the same to the sink for processing. Sensor nodes deployed in various application areas have limited memory, computational power, and battery backup. There is no defined topology of such network and frequently changing environment, very less amount of battery, and limited storage capability of the nodes. It is essen- tial that each node in the network has knowledge about the routing path to the sink which is energy efficient. Since random placement of the nodes restrains coders from presuming routing table data at the sensor nodes, numerous methods have been suggested to create a dynamic path up to sink. Numerous researches are performed for WSN using the mobile sink. Most of the research activities focused on energy conservation in the background while proposing approaches for clustering, data flow paths, trajectory design, etc. In the WSN with a mobile sink, the trajectory of the sink node plays a vital role. Designing of trajectory is an NP-hard problem. With the use of nature-inspired techniques, e.g., particle swarm optimization (PSO), genetic algo- rithm (GA), etc., can be used for generating a nearly optimal paths for the mobile sink. In this current article, the authors make attempt to present the summary of various strategies for energy-efficient data collection methodology and energy-efficient path planning of mobile sink in wireless sensor networks. A. K. Srivastava (B) ABES Engineering College, Ghaziabad, India e-mail: joinakhilesh@yahoo.com S. K. Gupta Benett University, Gautam Buddha Nagar, India R. Khan ABES Institute of Technology, Ghaziabad, India © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2023 P. K. Singh et al. (eds.), Proceedings of Third International Conference on Computing, Communications, and Cyber-Security, Lecture Notes in Networks and Systems 421, https://doi.org/10.1007/978-981-19-1142-2_1 3
- 35. 4 A. K. Srivastava et al. Keywords WSN · Rendezvous points · Static sink · Mobile sink · MILP · Genetic algorithm · Protocol · Cluster · Holes · Routing 1 Introduction Wireless sensor networks (WSNs) have a dense and large quantity of sensing nodes. These nodes are placed randomly over an area of significance. These nodes sense the data from the area of concern and communicate the same to sink for processing. These sensing nodes are organized to observe the indoor and outdoor surroundings, industry and procedure mechanization under water activity monitoring, healthcare system, etc. They have the application in tracing cattle/other creatures, vehicles, etc. [1]. Sensor nodes deployed in various application areas have limited memory, computational power, and battery backup [2]. There is no defined topology of such network and frequently changing environment, very less amount of battery, and limited storage capability of the nodes. It is essential that each node in the network has the knowledge about the routing path to the sink which is energy efficient. Since random placement of the nodes restrains coders from presuming routing table data at the sensor nodes, numerous methods have been suggested to create dynamic path up to sink. If the topology changes slowly, a proactive routing approach can be effective where topology detection is done on the periodically using broadcast of a beacon signal from the sink to the complete network [3]. Along with creating routing paths which are energy efficient, two more procedures are used in practice for realizing energy efficiency: mobility of sink [4, 5] and duty cycling of the nodes [6]. 2 Challenges with WSN • Fault-tolerant Communication: Since deployment of sensor nodes in any field is random, there is a fair chance of faulty sensor nodes or nodes which die down on or before observation. This may cause communication link to get broken [7]. • Low Latency: The events do take place rapidly in the WSN. The designed WSN needs to record and report events quickly. • Scalability: The system under observation is supposed to be scalable meaning that additional nodes can be deployed in order to increase the observation area. • Transmission Media: Faulty nodes can cause the broken links for communica- tion. • Coverage Problems: The quality of service in WSN is solely dependent on coverage of sensor nodes. In case of less coverage sensing, the quality of sensor nodes gets affected.
- 36. Enhancement of Energy Efficiency in Wireless … 5 • Sensor Holes: Also referred to as routing hole in which the nodes are either not preset or unable to participate in routing. It is assumed that a WSN comprises similar stationary sensor nodes. The sink is either static or mobile, and it can be located at distinct positions in the WSN. Those nodes which are closer to the sink in the case of static sink dissipate their battery level faster than the nodes which are farther. This happens because of the frequent load of data relay on nodes closer to the sink. To overcome this issue, mobile sinks were introduced, where the sink travels along a defined path in the field. It has been noticed that in majority of the situations sink mobility aids in creating a balanced load of routing and energy depletion of the nodes [8, 9]. It is however sure that mobility of sink improves balancing of load in the nodes, and it is a very important question if this improves the energy efficiency of such networks. To address this query, it is required to create a methodology for efficiency of energy. One of the approaches for making comparison between various sink mobility schemes is to have a match in the total energy consumption of WSN nodes for a defined complete work (load) done by a WSN. This paper focuses at finding energy dissipation on average per node Ebar, Ebar = Ni = 1eiN, N represents the total no. of WSN nodes, and ei is the dissipation energy of ith node while in the observation period. Energy used by various nodes in the static sink is different for different nodes. Nodes closer to the static sink have to repeatedly do the work of relaying information to the sink because of which these nodes deplete their energy faster as compared to the other nodes. Because of this, maximum energy depletion is investigated for each node as Emax = Maxi = 1, 2, …, N ei. For the purpose of load balancing, placement of static sink is usually done at the central point of WSN. If plenty of nodes in the vicinity of a static sink die because they have depleted their energy backups, the sink may get detached from remaining nodes in the network. Hence, Emax is one the possible parameters that indicates the lifespan of WSN [10, 11]. The energy consumption in uneven manner may cause the problem known as energy hole. This might split the N/w data transmission to the sink node will be blocked [3]. In underwater wireless sensor networks, designated gateways (DGs) collect data of sensor nodes in real time. But, underwater wireless sensor networks too suffer from energy hole phenomenon [4]. In the previous researches, researchers have focused on either the lifespan of a WSN or the avg energy loss per node (be it Emax or Ebar) [4, 7, 12]. In this paper, the sink is assumed to be mobile in nature. This paper finds various schemes of energy optimization in WSN with mobile sink.
- 37. 6 A. K. Srivastava et al. 3 Data Collection Approaches Various methods for data collection have been proposed by researchers. Table 1 summarizes the approaches in nutshell. Khan et al. [13] evaluated various protocols in both of these aspects highlighting that in which of the situation different information is yielded. In majority of the cases, duty cycling effects of the nodes are taken into consideration for analysis and comparison (Fig. 1). In [13], effect of duty cycling of stationery sensor nodes and movement path of mobile sink with energy consumption was investigated. Energy efficacy of WSN model with static and mobile sink was compared with respect to Ebar and Emax. Sink mobility is not the only criterion which improves energy parameters Ebar and Emax. Mobile sink can drastically improve the energy parameters by reducing the data relay load on the nodes and congestion control. Table 1 Data collection approaches in WSN Approaches for data collection in WSN Discovery Data transfer Routing Motion control Mobility independent a. Scheduled rendezvous b. On-demand c. Asynchronous Joint discovery and data transfer Flat Trajectory (either static or dynamic) Knowledge based Proxy based Speed Hybrid Fig. 1 Data gathering in WSN
- 38. Enhancement of Energy Efficiency in Wireless … 7 Fig. 2 Scenario of WSN with various node types To deal with the energy hole problem and optimization of lifetime in static telluric Wireless Sensor Networks and underwater Wireless Sensor Networks (Fig. 2) Zhu et al. [14], Shu et al. [15], Bhattacharjee and Bandyopadhyay [16] have proposed the work toward optimization of lifetime. Node positions are assumed to be fixed in these papers. It is unavoidable to limit the uneven energy dissipation and problem of energy hole. Sink nodes’ mobility can resolve this issue. When the sink travels toward the positions where nodes are concentrated highly or other positions of importance, energy dissipation of nodes can be balanced and residual energy inclines toward 0. Kumar et al. [17] proposed range-constrained clustering (RCC) technique. In RCC, the nodes in the target area are distributed into many clusters. TSP method is utilized to find the movement path of sink optimally. It travels to all centers of clusters. Gatzianas and Georgiadis [18], Luo and Hubaux [19], Yun et al. [20], Basagni et al. [21], Zhao and Yang [22] papers explored the maximization of lifetime of WSNs. These papers considered network lifetime optimization models with one or many mobile sinks. These also tried to obtain optimal pattern. Gatzianas and Georgiadis [18], Luo and Hubaux [19], Yun et al. [20] assumed the movement of sink node be discrete. The sink node move involves many anchors and rest time. The authors have created a model for N/w lifetime optimization assuming some energy dissipation constraints, flow balance constraint, and communication power constraint. Basagni et al. [21] explored a linear program (LP). Its solution gives an assured upper bound on possible lifetime considering multiple sinks. The centralized and distributed heuristic were introduced to find a solution of the LP which finds the N/W lifetime which is very close to the optimum. Zhao and Yang [22] proposed energy consumption constraint and flow balance constraint and researched into optimization of lifetime beneath two diverse situations. These were fixed rest time and varying rest time. Some methods focused on instituting
- 39. 8 A. K. Srivastava et al. and models to solve the lifespan of WSN with an assumption of known movement paths of sinks, but majority of the algorithms assumed only one sink node. Data assembling latency is substantial. In [23] Lifetime maximization of WSN with sink mobility the travel path selection and Optimization of lifetime were taken into consid- eration. The modified reduced clustering method, k-means clustering method, and nearest neighbor interpolation method were used to find the travel paths and obtain the near to optimal solution for the shortest path. In this, N/w lifetime optimiza- tion model with predefined travel path was established. Sub-gradient and geometric algorithm was used to solve the problem of lifetime optimization and obtain the data communication system. Sink nodes collect the data by traversing the defined optimal travel path. All sensor nodes communicate data based on the data transmis- sion method. The simulation results in [23] clearly show that MLMS can improve lifetime of WSN, create a balancing among energy dissipation of nodes, and ease data collection time. MLMS has observed improvement over Ratio_w, TPGF, GRND, and RCC but high time complexity. Mobile sink usually traverses each node and collects the desired data [24, 25] (known as single-hop communication) or goes to only a few positions, and nodes communicate collected data to the mobile sink [11, 26–30]. Data gathering task is faster in the multi-hop communication. Another area of concern arrives in Multi Hop Communication is the increase in energy dissipation majorly for forwarding of data. A solution proposed to address this is to transfer the data to some intermediate sensor nodes which store the data for communicating to mobile sink as and when the mobile sink comes in their range or when the request arrives to them to send the data [31–39]. Majority of these approaches create a balance between delay in data collection and overhead in energy dissipation. Konstantopoulos et al. [31] have addressed the issue of energy holes because of intermediate data relaying nodes or cluster heads. Chen et al. [40] presented a geographic converge cast-based approach basically targeting the reconstruction of path during sink mobility. Mamalis [41] proposed formation of many virtual circles and lines on which cluster heads are placed properly. Mobile sink approach reduces the energy usage of nodes at the cost of data collection time. In general, the mobile sink tour time upper limit is set as prerequisite for the timely collection of data. Use of multiple sink can also speed up the data collection work [21, 39, 42]. Almi’ani et al. [43] and Ekici et al. [44] proposed the hybrid approach, wherein the combination of multi-hop communication with the use of a mobile sink traverses to limited positions (called caching points—CPs). This builds direct or indirect clustering which is hierarchical in nature. Almi’ani et al. [43] proposed the minimization of number of hops that forwards the data from sensor nodes to their nearest caching points. This method proposed a k-means node-clustering method wherein the grouping of the network in the almost equal size clusters (in terms of Sensor nodes) followed by designing a Mobile Sink trip to take one Cluster Point from every cluster, Iterating the same to cover optimum no of clusters with the limitation of maximum length of Mobile sink trip.
- 40. Enhancement of Energy Efficiency in Wireless … 9 Mamalis [41] showed experimental setup that claimed to perform better than [44], and it was producing the optimum results. Almi’ani et al. [45, 46] presented an optimization of path for collection of data while working with the multiple sinks. [41] proposed solution majorly based on “residual energy” of the sink nodes rather than distance and number of hops in [43]. Mamalis [41] also show the stable energy and efficient conduct presented by hierarchical clustering structures to improve life- time of the WSN. It used node-clustering algorithm and the multi-hop clustering algorithm of [47] as its base (main criterion for formation of cluster here is the residual energy of every sensor node). It detects clusters which are balanced in terms of energy and guarantees ideal performance in terms of avg energy dissipation and lifetime of network. Mamalis [41] modified this method to satisfy the requirement of distance-restricted mobile sink trip. It also developed a data collection protocol which was based on TSP approximation path that fulfills the distance constraint. The energy holes are created around the cluster heads falling in the TSP path; Mamalis [41] used a method mix up of re-clustering phase and with alternating among various original positions of mobile sink. Papadimitriou and Georgiadis [48] formulated the problem of maximization of network lifetime into a min–max problem in a circle considering uniform distribution of sensor nodes. Gandham et al. [49] proposed multiple mobile sinks with predefined route to gather sensing data for a particular region. It proposed an integer linear program model to find the position of the K mobile sinks in one round. Wang et al. [50] proposed optimization of sink movement along with the rest time. It proposed the linear programming solution to the problem with an assumption of workload of a node being evenly distributed among the horizontal and vertical links. Luo et al. [4] proposed 2-stage scheduling: (1) The mobile sink traverses the potential locations one by one and stays there at each for a small time. (2) The sink collects the buffered data of all nodes and builds the stay time profile at the potential point. Basagni et al. [11] worked on two constraints: first, the max length at every movement of mobile sink and min stay time at each stay point. Movement length of mobile sink from one stay point to the other is bounded to ensure loss of data gathering. The paper then presented a simple and distributed heuristic considering problem in the mixed ILP. Sugihara and Gupta [51, 52] proposed the problem to be considered as TSP, and solutionsuggestedtheupdationof tour timingat eachedge. This aims at collectingthe maximum data by one-hop data gathering mechanism. This also aimed at reducing the energy dissipation in relay. Xing et al. [35] suggested an approach of data gathering which is rendezvous point based, organized mobility of sink, caching of data, and limiting the tour length of the mobile sink. An approximation algorithm was designed here for minimizing the sum of energy dissipation of all participating sensor nodes. It was assumed here that prior to the transmission of data it is combined in one packet. Guney et al. [53] proposed design of sink trajectory as an optimization problem. It aims at identifying the location of sink optimally and communication path among
- 41. 10 A. K. Srivastava et al. sinks and sensor nodes. The authors formulated this as an ILP and created many heuristics for the same. Liang et al. [54, 55] unified the tour length of the mobile sink in the problem of maximization of network lifetime and suggested heuristics. Liang and Luo [56] have presented their work of considering multiple mobile sinks instead on 1 in their previous work. Gatzianas and Georgiadis [18] proposed the formulation of designing optimal route for a mobile sink as a LP problem and proposed a distributed solution employing Lagrangian duality principle and the sub-gradient scheme. Convergence rate of the algorithm was the basic factor in finding the run time of this distributed scheme. Yun and Xia [57] proposed the scheme in which the sensor node does not have to transmit the data immediately after sensing it. It buffers the data until the sink reaches to the favorable location with respect to the given sensor node. It eases out the load at the sensor node, and network lifetime can be increased by this. They designed this problem as a mixed ILP given the restricted delay limit. They also proposed flow-based framework. Xu et al. [58] aimed at discovery of a route for mobile sink to maximize the network lifetime. It has the constraints like (i) stay places of mobile sinks for data collectionarefixed.Thesinkisallowedtostayatpotentiallocations.Thisinformation is considered to be available as a priori. (ii) Delay on data communication is in some tolerant range. Storage space of each sensor node is limited. To avoid the loss of data because of storage overflow, there should be tolerant data communication delay and it should be fixed up. With aim of establishing relation between lifetime of network and tolerable delay in delivery of data, a controllable parameter h “the bound on no. of hops from node to sink” was used. The selection of h played a vital role in realizing the trade-off between lifetime of network and data delivery delay; i.e., keeping h small, number of stay points and mobile sink route will be long. And delay in data delivery will be more. Xu et al. [58] researched on achieving the trade-off between lifetime of WSN and data delivery permissible delay while mobile sink being employed for data collection. It mainly focused on designing of optimal tour path for mobile sink and formulated a protocol for transferring the sensed data to mobile sink. The research article proposed a method which minimizes the number of hops. Since this problem is NP-hard, the researchers have proposed a new framework that optimizes the trajectory. 4 Classification of WSN WSNs can be classified depending on type of sensor used in the network. Sensor type is dependent on features like unit cost, sensing range, and communication range. Homogeneous WSNs comprise similar type of sensors, whereas heteroge- neous WSNs comprise many types of sensors. Coverage requirements of the area are also a criterion for categorization. It can be equal around the sensor area, or fraction
- 42. Enhancement of Energy Efficiency in Wireless … 11 of it may be of high criticality than the other ones and better sensing observation. Sensors may either be active or sleeping. A sleeping sensor is free from sensing, transferring, and receiving data during the sleep phase. Energy dissipation during this time is minimal. Active sensor does sensing, transferring, and receiving of data and spends substantial energy during this work. 5 Designing of Wireless Sensor Network Designing of wireless sensor network comprises major decisions like: 1. Number of sensors for deployment to satisfy the cost and coverage requirements. This should also take care of fault tolerance in case of failing sensor nodes during the observation period. Energy dissipation of sensor nodes should also be taken into consideration while designing as transmission requires substantial energy and it increases with the distance of transmission. 2. Activity scheduling of sensor nodes is the second parameter that should be thought of while designing the WSN. Keeping some of the sensor nodes active at some point of time while keeping others at rest improves the complete lifetime of WSN. While designing, we should ensure that active sensors are enough in numbers to ensure that WSN is fully functional. 3. Another major issue while designing of sensor network involves the “sink neigh- borhood problem” [11], “energy hole problem” [59, 60], or “the crowded center effect” [61]. A sensor node in the vicinity of the sink dissipates their battery faster as they work as accumulators for other node’s sensed data. This problem can be resolved by moving sink node which enables may sensor nodes to work as accumulators for a set of sensor nodes, and responsibility of accumulation does not lie only on limited nodes. 4. The last design issue is to find the path of data flow from sensor node to sink node. A path from sensor to sink can be found easily with the prior computation, but considering the limitation of the WSN of possible failure of some sensor nodes creates the requirement of find sensor to sink node data flow path at run time with some computation. Many papers have been written by various researches for the designing of WSN with maximization of lifetime, but most of them have taken only a subset of designing criteria written above. Because of the above, any proposed design WSN can be termed as suboptimal. Keskin et al. [62] have given a mathematical model considering mixed integer linear programming (MILP) model is the only research which has focused on all of the above-mentioned designing criteria. Hamida and Chelius [37] proposed the analysis of the existing data propagation protocols in mobile sinks. It focuses on the categorical decisions about movement of sinks. Majority of the papers utilized the mathematical model that deals with the
- 43. 12 A. K. Srivastava et al. optimization of WSN performance criterion, e.g., lifetime of WSN, energy dissipa- tion in totality, complete cost incurred for known data, and total cost for given data circulation protocols. 6 Data Flow Through Optimal Path Data is believed to move from nodes to the sinks via the smallest route in several papers, e.g., [63], in which authors assumed a mobile sink moving inside the network to gather the collected data from the sensing nodes in a single-hop fashion. This paper has sought the minimal distance route which traverses each sensing node’s transmission range. The problem of finding minimal distance route is visualized as a variant of TSP. The solution as presented in [63] is further extended for finding shortest path considering multiple mobile sink in [64]. Objective function in this paper is set to minimize the longest sink trip. At the same time, there is a constraint that each of the sensing node falls within the vicinity of sink traveling. It is also tried to fall in the vicinity of exactly one sink only such that data is sent in single-hop approach to the sink. The problem is modeled as MILP. These two papers [63] and [64] follow the optimization models, but they have little impact on the lifetime and load balancing metric. These researches propose the optimization methodology but fail to address the network lifetime, delay in travel of data, and balancing act across the nodes. Wang et al. [50] follow different approaches from [63] and [27] where the authors propose a LP model for improving the lifespan of the network. The mobile sink is supposed to rest at some rendezvous points. The lifetime of the network is supposed to be the total of rest time at rendezvous points. The optimal solution of the linear programming model suggests the rendezvous points. In this paper, the sink route is not defined as the order of the visiting rendezvous points is undefined. Basagni et al. [11] presented the sink route as well as the extension of work in [50]. The result of the [11] is the discovery of rendezvous points and mobile sinks schedule of vising these points. Basagni et al. [21] have extended this work further to incorporate multiple mobile sinks. The authors considered a sink configuration by randomization of the sinks along predefined set of rendezvous points. Further lifetime of the network is considered to be the accumulation of rest time of sinks. As the objective, lifetime of the network is maximized and however the energy dissipation of the sensors should be initial level of power. In [54] sink is treated as the energy restricted device which moves in the region mechanically using some fuel. Keskin et al. [65] considered sink movement time as a part of network lifetime. The authors alsotookintoaccount thetimetakenfor datacollection. Theauthors proposed the efficient heuristics as the solution of proposed model (MILP). Srivastava and Gupta [66, 67] proposed the genetic algorithm-based approaches for path planning of mobile sink. In the proposed work, to design the fitness function, three parameters have been used.
- 44. Enhancement of Energy Efficiency in Wireless … 13 Fig. 3 Path of mobile sink using random tour • Length of the tour of the MS • Load of rendezvous points (RP); i.e., the RP receives the data from how many sensor nodes • Number of nodes which forwards the data to RP using multi-hop. The paper proposed fitness function represented as: Minimize F = w1xT cos t + w2x {n − NW1 H} + w3x Di f where – w1, w2, w3 represent the weights and w1 + w2 + w3 = 1. – Tcost represents the cost of the tour. – NW1H represents the numbers of nodes with 1 hop from RPs. – Dif represents the difference between maximum and minimum values of LoadRP(i). Figures 3 and 4 depict the comparison of random path and GA-based path of mobile sink. 7 Optimal Data Flow In spite of assuming routing of data path apriori, data flow path for every sensing node to sink can be determined optimally. Gandham et al. [49] divided the entire time into the equal periods. In each of the durations, data routes and sinks are stationery.
- 45. 14 A. K. Srivastava et al. Fig. 4 Path of mobile sink using genetic algorithm The authors proposed two different models for minimization of energy dissipation of each sensor node and cumulative energy dissipation of sensing nodes [68]. Offered 2 more heuristics along with the one in [49]. The first one assumed sinks’ location at the place where neighboring nodes have maximum backup left. The other one assumed sinks’ location at the place such that the difference among the minimum and maximum backups of the sensor nodes is minimized. Alsalih et al. [69] proposed similar approach to that of [68]; however, author proposed the periodic optimization of minimal backup. The paper is studied as single-period model and needs to be run separately for each period. This paper provides approximate solution rather than optimal one. Luo and Hubaux [70] consider a network field circular in nature and proposed the minimization of maximum load of sensing nodes using the MILP model. It is also assumed that the movement path of the sink is also circular in nature. Gandham et al. [49], Azad and Chockalingam [68], Alsalih et al. [69], Luo and Hubaux [70] restrict data flow in an optimal fashion, but they did not produce any approach for maximization of network lifetime directly. Papadimitriou and Georgiadis [48] proposed a nonlinear programming model to maximize lifetime of WSN. It is defined as the cumulative rest time of moving sink at rendezvous points. Gatzianas and Georgiadis [18] revisited the model in [48] and developed a distributed algorithm. Distribution technique was proposed in [64]. Yun and Xia [57] used the [76] and [18] as base. Authors proposed the buffering of data by sensing nodes till the favorable time with respect to network lifetime. Above models are found appropriate for applications which are delay tolerant. Yun et al. [20] proposed the algorithm for the solution of queue-oriented delay- tolerant model as given in [57]. Behdani et al. [71] proposed another algorithm for the same model as in [22] which was computationally efficient. Luo and Hubaux [19]
- 46. Enhancement of Energy Efficiency in Wireless … 15 introduced MILP model with multiple mobile sink for maximization of the lifetime of WSN. It was defined as the period lengths sum. Period here is considered as time with sink configuration given. With change in the sink location, the period changes. Above-mentioned approaches did not touch all four major aspects of WSN. Above approaches assumed a prior defined sensor position. They did not consider activity schedules. Around 50% of the papers employed shortest path data propagation as a predefined data propagation method. Only [62] has attempted to find the optimal WSN design with all four WSN design issues. G. 4.0. [72] presented the effect of the incorporation with comparison of lifespan of WSN gained by a combined model with the articles mentioned in earlier papers. The MILP model turns out to be unsolvable for genuinely real networks as size is huge. 8 Conclusion Numerous researches are performed for WSN using mobile sink. Most of the research activities focused energy conservation in background while proposing approaches for clustering, data flow paths, trajectory design, etc. In the WSN with mobile sink, trajectoryofsinknodeplaysavitalrole.DesigningoftrajectoryisaNP-hardproblem. With the use of nature-inspired techniques, e.g., particle swarm optimization (PSO), genetic algorithm (GA), etc., can be used for generating nearly optimal path for mobile sink. References 1. Raghavendra, C. S., Sivalingam, K. M., Znati, T. (2004). Wireless sensor networks. Kluwer Academic Publishers. 2. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., Cayirci, E. (2002). A survey on sensor networks. IEEE Communications Magazine., 40, 102–114. 3. Nezhad, A. A., Makrakis, D., Miri, A. (2007). Anonymous topology discovery for multihop wireless sensor networks. In Proceedings of 3rd ACM Workshop on QoS and Security for Wireless and Mobile Networks, Q2SWinet ‘07, Chania, Crete Island, Greece (pp. 78–85). 4. Luo, J., Panchard, J., Piorkowski, M., Grossglauser, M., Hubaux, J.-P. (2006). Mobiroute: Routing towards a mobile sink for improving lifetime in sensor networks. In Proceedings of IEEE International Conference on Distributed Computing in Sensor Networks (DCOSS), pp. 480–497 (2006) 5. Ye, F., Luo, H., Cheng, J., Lu, S., Zhang, L. (2002). A two-tier data dissemination model for large-scale wireless sensor networks. In Proceedings of 8th Annual international Conference on Mobile Computing and Networking, MobiCom ‘02, Atlanta, Georgia, USA, September 23–28, 2002 (pp. 148–159). 6. Wang, L., Xiao, Y. (2006). A survey of energy-efficient scheduling mechanisms in sensor networks. Mobile Network Applications, 11, 723–740. 7. Sankar, A., Liu, Z. (2004). Maximum lifetime routing in wireless ad-hoc networks. In Proceedings of 23rd IEEE INFOCOM (pp. 1089–1097).
- 47. 16 A. K. Srivastava et al. 8. Giannakos, A., Karagiorgos, G., Stavrakakis, I. (2009). A message-optimal sink mobility model for wireless sensor networks. In Proceeding of 8th International Conference on, Networks (pp. 287–291). 9. Luo, J., Hubaux, J. P. (2005). Joint mobility and routing for lifetime elongation in wireless sensor networks. In Proceedings of 24th IEEE INFOCOM, Miami, USA (pp. 1735–1746). 10. Wu, Y., Zhang, L., Wu, Y., Niu, Z. (2006). Interest dissemination with directional antennas for wireless sensor networks with mobile sinks. In Proceedings of the 4th international Conference on Embedded Networked Sensor Systems, SenSys ‘06, Boulder, Colorado, USA (pp. 99–111). 11. Basagni, S., Carosi, A., Melachrinoudis, E., Petrioli, C., Wang, Z. M. (2008). Controlled sink mobility for prolonging wireless sensor networks lifetime. Journal of Wireless Networks., 14, 831–858. 12. Kinalis, A., Nikoletseas, S. (2007). Scalable data collection protocols for wireless sensor networks with multiple mobile sinks. In Proceedings of the 40th Annual Simulation Symposium Annual Simulation Symposium (pp. 60–72). IEEE Computer Society. 13. Khan, M. I., Gansterer, W. N., Haring, G., Static vs. mobile sink: The influence of basic parameters on energy efficiency in wireless sensor networks. 14. Zhu, Y.-H., Shen, D.-D., Wu, W.-D., Shen, Z.-W., Tang, Y.-P. (2009). Dynamic routing algorithms optimizing lifetime of wireless sensor networks. Acta Electronica Sinica, 37(5), 1041–1045. 15. Shu, L., Zhang, Y., Zhou, Z., Hauswirth, M., Yu, Z., Hynes, G. (2008). Transmitting and gathering streaming data in wireless multimedia sensor networks within expected network lifetime. Mobile Networks and Applications, 13(3–4), 306–322. 16. Bhattacharjee, S., Bandyopadhyay, S. (2013). Lifetime maximizing dynamic energy efficient routing protocol for multi hop wireless networks. Simulation Modelling Practice and Theory, 32, 15–29. 17. Kumar, A. K., Sivalingam, K. M., Kumar, A. (2013). On reducing delay in mobile data collection based wireless sensor networks. Wireless Networks, 19(3), 285–299. 18. Gatzianas, M., Georgiadis, L. (2008). A distributed algorithm for maximum lifetime routing in sensor networks with mobile sink. IEEE Transactions on Wireless Communications, 7(3), 984–994. 19. Luo, J., Hubaux, J. P. (2010). Joint sink mobility and routing to maximize the lifetime of wireless sensor networks: The case of constrained mobility. IEEE/ACM Transactions on Networking, 18(3), 871–884. 20. Yun, Y. S., Xia, Y., Behdani, B., Smith, J. C. (2013). Distributed algorithm for lifetime maximizationinadelay-tolerantwirelesssensornetworkwithamobilesink.IEEETransactions on Mobile Computing, 12(10), 1920–1930. 21. Basagni, S., Carosi, A., Petrioli, C., Phillips, C. A. (2011). Coordinated and controlled mobility of multiple sinks for maximizing the lifetime of wireless sensor networks. Wireless Networks, 17(3), 759–778. 22. Zhao, M., Yang, Y. (2012). Optimization-based distributed algorithms for mobile data gathering in wireless sensor networks. IEEE Transactions on Mobile Computing, 11(10), 1464–1477. 23. Maximizing Lifetime of Wireless Sensor Networks with Mobile Sink Nodes 24. Shah, R., Roy, S., Jain, S., Brunette, W. (2003). Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1(2–3), 215–233. 25. Sugihara, R., Gupta, R. (2010). Optimal speed control of mobile node for data collection in sensor networks. IEEE Transactions on Mobile Computing (TMC), 9(1), 127–139. 26. Ammari, H., Das, S. (2008). Promoting heterogeneity, mobility, and energy—aware Voronoi diagram in wireless sensor networks. IEEE TPDS, 19(7), 995–1008. 27. Valle, C.A., da Cunha, A.S., Mateus, G.R., Aioffi, W.M. (2009). Optimization and simulation in wireless sensor networks with multiple mobile sinks, Unpublished manuscript. 28. Demirbas, M., Soysal, O., Tosun, A. (2007). Data Salmon: A greedy mobile Basesta- tion protocol for efficient data collection in WSNs. In Proceedings of DCOSS’07 Conference (pp. 267–280).
- 48. Enhancement of Energy Efficiency in Wireless … 17 29. Vincze, Z., Vass, D., Vida, R., Vidacs, A., Telcs, A. (2007). Adaptive sink mobility in event-driven densely deployed wireless sensor networks. Ad Hoc Sensor Wireless Networks (AHSWN), 3(2–3), 255–284. 30. Friedmann, L., Boukhatem, L. (2007). Efficient multi-sink relocation in wireless sensor network. In Proceedings of the 3rd International Conference on Networking and Services (p. 90). 31. Konstantopoulos, C., Mamalis, B., Pantziou, G., Thanasias, V. (2012). Watershed-based clustering for energy efficient data gathering in wireless sensor networks with mobile collector. In Proceedings of the Euro-Par Conference, LNCS 7484 (pp.754–766). 32. Konstantopoulos, C., Pantziou, G., Gavalas, D., Mpitziopoulos, A., Mamalis, B. (2012). A Rendezvous-based approach for energy-efficient sensory data collection from mobile sinks. IEEE TPDS, 23(5), 809–817. 33. Tirta, Y., Li, Z., Lu, Y. H., Bagchi, S. (2004). Efficient collection of sensor data in remote fields using mobile collectors. In Proceedings of IEEE ICCCN Conference (pp. 515–520). 34. Ma, M., Yang, Y. (2007). SenCar: An energy-efficient data gathering mechanism for large- scale multihop sensor networks. IEEE TPDS, 18(10), 1476–1488. 35. Xing, G., Wang, T., Jia, W., Li, M. (2008). Rendezvous design algorithms for wireless sensor networks with a mobile base station. In Proceedings of ACM MobiHoc Conference (pp. 231–239). 36. Rao, J., Biswas, S. (2010). Network-assisted sink navigation for distributed data gathering: Stability and delay-energy trade-offs. Computer Communications, 33, 160–175. 37. Hamida, E., Chelius, G. (2008). Strategies for data dissemination to mobile sinks in wireless sensor networks. Wireless Communications, 15(6), 31–37. 38. Rahman, M.S., Naznin, M. (2013). Shortening the tour-length of a mobile data collector in the WSN by the method of linear shortcut. In Web technologies and applications (pp. 674–685). Springer Berlin Heidelberg. 39. Gao, S., Zhang, H., Das, S. K. (2011). Efficient data collection in wireless sensor networks with path-constrained mobile sinks. IEEE Transactions on Mobile Computing, 10(4), 592–608. 40. Chen, T. S., Tsai, H. W., Chang, Y. H., Chen, T. C. (2013). Geographic converge cast using mobile sink in wireless sensor networks. Computer Communications, 36, 445–458. 41. Mamalis, B. G., Prolonging Network Lifetime in Wireless Sensor Networks with Path- Constrained Mobile Sink 42. Chatzigiannakis, I., Kinalis, A., Nikoletseas, S., Rolim, J. (2007). Fast and energy efficient sensor data collection by multiple mobile sinks. In Proceedings of MOBIWAC’07 Conference (pp. 25–32). 43. Almi’ani, K., Viglas, A., Libman, L. (2010). Energy-efficient data gathering with tour length- constrainedmobileelementsinwirelesssensornetworks.InProceedingsofthe35thConference on Local Computer Networks (pp. 582–589). 44. Ekici, E., Gu, Y., Bozdag, D. (2006). Mobility-based communication in WSNs. IEEE Communications Magazine, 44, 56–62. 45. Almi’ani, K., Viglas, A., Libman, L. (2010). Mobile element path planning for time constrained data gathering in wireless sensor networks. In Proceedings of the International Conference on Advanced Information Networking and Applications (AINA) (pp. 843–850). 46. Almi’ani, K., Viglas, A., Libman, L. (2014). Tour and path planning methods for efficient data gathering using mobile elements. International Journal of Ad hoc and Ubiquitous Computing, to appear. 47. Bao, X., Liu, L., Zhang, S., Bao, F. (2010) An energy balanced multihop adaptive clustering protocol for wireless sensor networks. In Proceedings of the 2nd IEEE ICSPS Conference (vol. 3, pp. 47–51). 48. Papadimitriou, I., Georgiadis, L. (2005). Maximum lifetime routing to mobile sink in wireless sensor networks. In Proceedings of the 13th IEEE SoftCom (pp. 1–5). 49. Gandham, S.R., Dawande, M., Prakask, R., Venkatesan, S. (2003). Energy efficient schemes for wireless sensor networks with multiple mobile base stations. In Proceedings of Globecom’03. IEEE.
- 49. 18 A. K. Srivastava et al. 50. Wang, Z. M., Basagni, S., Melachrinoudis, E., Petrioli, C. (2005). Exploiting sink mobility for maximizing sensor networks lifetime. In Proceedings of HICSS. IEEE. 51. Sugihara, R., Gupta, R. K. (2008). Improving the data latency in sensor networks with controlled mobility. In Proceedings of DCOSS’080. IEEE. 52. Sugihara, R., Gupta, R. K. (2009). Optimizing energy-latency trade-off in sensor networks with controlled mobility. In Proceedings of INFOCOM’09. IEEE. 53. Guney, E., Aras, N., Altinel, I. L., Ersoy, C. (2010). Efficient integer programming formu- lations for optimum sink location and routing in heterogeneous wireless sensor networks. Computer Networks. 54. Liang, W., Luo, J., Xu, X. (2010). Prolonging network lifetime via a controlled mobile sink in wireless sensor networks. In Proceedings of Globecom’10. IEEE. 55. Liang, W., Luo, J., Xu, X. (2011) Network lifetime maximization for time sensitive data gath- ering in wireless sensor networks with a mobile sink. Journal of Wireless Communications Mobile Computing. 56. Liang, W., Luo, J. (2011). Network lifetime maximization in sensor networks with multiple mobile sinks. In Proceedings of LCN’11. IEEE. 57. Yun, Y., Xia, Y. (2010). Maximizing the lifetime of wireless sensor networks with mobile sink in delay-tolerant applications. IEEE Transactions on Mobile Computing, 9(9), 1308–1318. 58. Xu, Z., Liang, W., Xu, Y., Network Lifetime Maximization in Delay-Tolerant Sensor Networks with a Mobile Sink 59. Li, J., Mohapatra, P. (2007). Analytical modeling and mitigation techniques for the energy hole problem in sensor networks. Pervasive and Mobile Computing, 3(3), 233–254. 60. Wu, X., Chen, G., Das, S. K. (2008). Avoiding energy holes in wireless sensor networks with nonuniform node distribution. IEEE Transactions on Parallel and Distributed Systems, 19(5), 710–720. 61. Popa, L., Rostamizadeh, A., Karp, R., Papadimitriou, C., Stoica, I. (2007). Balancing traffic load in wireless networks with curveball routing. In Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Vol. 9–14, pp. 170–179). 62. Keskin, M. E., Altınel, I. K., Aras, N., Ersoy, C. (2013). Optimal deployment, scheduling and routing for maximizing the lifetime of a wireless sensor network with multiple mobile sinks, Technical Report FBEIE- 02/2013-02. Boğaziçi University, Istanbul. 63. Nesamony, S., Vairamuthu, M. K., Orlowska, M., Sadiq, S. (2006). On optimal route computation of mobile sink in a wireless sensor network. The University Of Queensland. 64. Madan, R., Lall, S. (2006). Distributed algorithms for maximum lifetime routing in wireless sensor networks. IEEE Transactions on Wireless Communications, 5(8), 2185–2193. 65. Keskin, M. E., Altınel, I. K., Aras, N., Ersoy, C. (2011). Lifetime maximization in wireless sensor networks using a mobile sink with nonzero traveling time. The Computer Journal, 54(12), 1987–1999. 66. Srivastava, A. K., Gupta, S. K. (2020). EEPMS energy efficient path planning for mobile sink in wireless sensor networks: A genetic algorithm based approach. In Advances in Computational Intelligence and Communication Technology-2020 (pp. 101–108). 67. Srivastava, A. K., Gupta, S. K. (2019). EERP: Energy-efficient relay node placement for k-connected wireless sensor networks using genetic algorithm. In Y. C. Hu, S. Tiwari, K. Mishra, M. Trivedi (Eds.), Ambient communications and computer systems. advances in intelligent systems and computing (Vol. 904). Springer. https://doi.org/10.1007/978-981-13- 5934-7_1 68. Azad, A., Chockalingam, A. (2006). Mobile base stations placement and energy aware routing in wireless sensor networks. In Wireless Communications and Networking Conference, WCNC 2006 (Vol. 1, pp. 264–269). IEEE. 69. Alsalih, W., Akl, S., Hassanein, H. (2007). Placement of multiple mobile base stations in wireless sensor networks. In 2007 IEEE International Symposium on Signal Processing and Information Technology (pp. 229–233). Springer. 70. Luo, J., Hubaux, J.-P. (2005). Joint mobility and routing for lifetime elongation in wireless sensor networks. In INFOCOM 2005, 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE (vol. 3, pp. 1735–1746). IEEE.
- 50. Enhancement of Energy Efficiency in Wireless … 19 71. Behdani, B., Yun, Y. S., Cole Smith, J., Xia, Y. (2012). Decomposition algorithms for maxi- mizing the lifetime of wireless sensor networks with mobile sinks. Computers Operations Research, 39(5), 1054–1061. 72. G. 4.0. (2010). Gurobi Optimizer 4.0, High-End Libraries for Math Programming. http://www. gurobi.com/
- 51. Conversion of Intermittent Water Supply to Continuous Water Supply of Chandigarh: A Case Study Sanjeev Chauhan and R. M. Belokar Abstract In India, where water is supplied to residents on an intermittent basis due to limited sources, implementing a continuous water supply scheme in an Indian city seems quite an arduous affair. To manage limited water resources to pump for 24 h without adding new water sources makes the project more quandary to work further. Achieving the milestone of continuous water supply in India would be a challenge worth taking and worth benefiting from. The case study prepared here provides insights regarding the importance and impact of the proposed methods and models here, based on the data received from government agencies working in this field. The goal is to prepare the outcomes of converting intermittent water supply of a city into regular water supply for the whole of Chandigarh city and not just a part of it. With the help of data collected from site visits, experimental analysis, and pilot experiments done on small scales, a case study has been prepared of how achieving continuous water supply can be made possible for a pan city with a population of more than 1 million. Keywords Internet of things · Water treatment · District metering area · Non-revenue water · Life cycle cost · Hydraulic modelling 1 Introduction 1.1 Area, Population, and Its Present Water Source Scenario Area: 114 km2 . Population: 1.16 Million (Figure for 2021 as per data received from government offices provided to U.N. World Urbanization prospects). S. Chauhan (B) · R. M. Belokar Department of Production and Industrial Engineering, Punjab Engineering College (PEC), Chandigarh 160012, India e-mail: chausanju2002@gmail.com © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2023 P. K. Singh et al. (eds.), Proceedings of Third International Conference on Computing, Communications, and Cyber-Security, Lecture Notes in Networks and Systems 421, https://doi.org/10.1007/978-981-19-1142-2_2 21
- 52. 22 S. Chauhan and R. M. Belokar Bhakra Main Canal (BMC), situated 26 km from Chandigarh, is the primary source of potable water for Chandigarh. Water is continuously being pumped from Kajauli to Sector 39 to fulfil the water demand of Chandigarh. The pumped water is received at Sector 39, where the water treatment plant (WTP) is situated. There are currently two WTPs of 45 MGD and 25 MGD in Sector 39 and 1 WTP of 5 MGD capacity in Sector 12. There are three seasonal streams-choe within our project area, namely N-Choe, Patiala Ki Rao Choe, and Sukhna Choe. There is no river located inside the Chandi- garh area. However, the nearest river to the city is the river Ghaggar. Three man-made surface water bodies are recorded in Sukhna Lake, Dhanas Lake, and New Lake of sector 42. Presently used method for water treatment (Fig. 1). Table 1 is depicting the service level benchmarks as per MoUD and the existing service level in Chandigarh (Data as collected from the government departments). Step 1 Step 2 Step 3 Step 4 Step 5 Chlorine Contact Tank Step 6 Rapid Sand Filter SedimentaƟon Flash Mixer Alum Dosing Inflow Fig. 1 Flowchart for the current method of water treatment used
- 53. Conversion of Intermittent Water Supply to Continuous Water Supply … 23 Table 1 Service level benchmarks for water supply in Chandigarh S. No. Key performance indicators (KPI) Service Level benchmark as per MoUD Existing service level in Chandigarh 1 Coverage of water supply 100% 100.0% 2 Per capital supply of water 150 LPCD 227 LPCD 3 Continuity of supply 24 h 4–5 h in morning 4–5 h in evening 4 Extent of metering of water connections 100% 100% 5 Extent of non-revenue water 20% 35% 6 Quality of water 100% Adequate and good 7 Efficiency in the collection of water-related charges 80% 92.25% 67.49 72.5 Spring Level 0.0 0.0 (kg/cm2) (Th GPH) To WW / DistribuƟon PARAMETERS Pressure Tx. 67.49 ON OFF 0.00 20.83 0.00 Discharge m Depth Sensor 0.0 0.8 0.0 Time Spring Level 72.50 67.49 67.49 OFF ON OFF System ALARMS Over Load SPP Auto Trip Remote/Local Trip status Phase Reversal Power Intruder Alarm Normal Normal Normal Normal Normal Remote R-Y Phase Voltage (v) Y-B B-R 408.97 415.20 409.84 Motor Currents (A) IR IY IB 0.0 0.0 0.0 49.08 0.0 0.0 17860.59 1.0 Freq. (Hz) PF Power (KW) KWH Run hrs. Fig. 2 Automation of water generation scheme A figure representing the automation of the water generation scheme is shown in Fig. 2, with parameters and various alarms associated with it. 1.2 Disadvantages of Intermittent Water Supply Over Continuous Water Supply Intermittent supply gives rise to the following deficiencies in the service and its management: 1. Severe risks to health, resulting from ingress of contaminated groundwater to the distribution system 2. High non-revenue water (NRW). 3. Lack of resources for system augmentation and remodelling. 4. Operational techniques used to control supply and demand are outdated. 5. Lack of control on the supply-side—no leak control, no data, plans, and SOPs.
- 54. 24 S. Chauhan and R. M. Belokar 6. No. of unauthorized connections causing physical and revenue leakages. 7. Low technical and financial management capacities. 8. Customer inconvenience: By imposing financial restrictions on water bills and limiting personal water usage for residents, which in many cases is below the level required for the practice of safe hygiene [3]. 2 Need Water being an essential commodity, many cities cannot even get 100 l per capita per day. With such water scarcity, it is not easy to provide 24 h water to the residents in PAN city, where most of the major cities in India are populous. Therefore, the idea was conceived with the plan that Chandigarh will implement a 24 × 7 water supply project for the whole city with a population above 1 Million. The definition of a 24 × 7 water supply would mean that every consumer gets water 24 h a day, all seven days with required pressure. This level of service has become common now in several of the world’s cities; however, no Indian city provides its citizens with a round-the-clock water supply. Most of the cities in India receive water for a couple of hours during the day and evening hours. 3 Objectives 1. To study accurate metering of water and its impact. 2. To study how to avoid leakages and curb non-revenue water (NRW). 3. To assess the behavioural change of residents with continuous water supply. 4. To study optimum usage of surface water @150 LPCD (litre per capita per day) as per CPHEEO manual. 5. To study elimination of tube wells for groundwater sustainability for future generations. 4 Methodology to Meet the Desired Goal of Achieving Continuous Water Supply 1. Hydraulic Modelling 2. Integration of DMA with SCADA 3. Calibration of Distribution network 4. Revision of Tariff System 5. NRW Reduction Measures 6. Reuse of treated water 7. IoT-based System for continuous supply.
- 55. Another Random Document on Scribd Without Any Related Topics
- 57. THE BOY ELECTRICIAN Practical Plans for Electrical Toys and Apparatus, with an Explanation of the Principles of Every-Day Electricity By ALFRED P. MORGAN Author of “Wireless Telegraphy Construction for Amateurs” and “Wireless Telegraphy and Telephony” 300 illustrations and working drawings by the author Net, $2.00 Postpaid, $2.25 This is the age of electricity. The most fascinating of all books for a boy must, therefore, be one dealing with the mystery of this ancient force and modern wonder. The best qualified of experts to instruct boys has in a book far superior to any other of its kind told not only how to MAKE all kinds of motors, telegraphs, telephones, batteries, etc., but how these appliances are used in the great industrial world. “Of all books recently published on practical electricity for the youthful electricians, it is doubtful if there is even one among them that is more suited to this field. This work is recommended to every one interested in electricity and the making of electrical appliances.”—Popular Electricity and Modern Mechanics. “This is an admirably complete and explicit handbook for boys who fall under the spell of experimenting and ‘tinkering’ with electrical
- 58. apparatus. Simple explanations of the principles involved make the operation readily understandable.”—Boston Transcript. “Any boy who studies this book, and applies himself to the making and operating of the simple apparatus therein depicted, will be usefully and happily employed. He will, furthermore, be developing into a useful citizen. For this reason we recommend it as an excellent gift for all boys with energy, application, and ambition.”— Electrical Record, N. Y. City. “A book to delight the hearts of ten thousand—perhaps fifty thousand-American boys who are interested in wireless telegraphy and that sort of thing. Any boy who has even a slight interest in things electrical, will kindle with enthusiasm at sight of this book.”— Chicago News. For sale by all booksellers or sent postpaid on receipt of price by the publishers LOTHROP, LEE SHEPARD CO., BOSTON
- 60. THE BOOK OF ATHLETICS Edited by PAUL WITHINGTON With many reproductions of photographs, and with diagrams 8vo Net, $1.50 Postpaid, $1.70 Nearly thirty college stars and champions, men like Dr. Kraenzlein, Thorpe, Ketcham, “Sammy” White, “Eddie” Hart, Ralph Craig, “Hurry Up” Yost, Jay Camp, Homer, Jackson, F. D. Huntingdon, R. Norris Williams, “Eddie” Mahan, and many more tell the best there is to tell about every form of athletic contest of consequence. In charge of the whole work is Paul Withington, of Harvard, famous as football player, oarsman, wrestler and swimmer. “Here is a book that will serve a purpose and satisfy a need. Every important phase of sport in school and college is discussed within its covers by men who have achieved eminent success in their line. Methods of training, styles of play, and directions for attaining success are expounded in a clear, forceful, attractive manner.”— Harvard Monthly. “The book is made up under the direction of the best qualified editor to be found, Paul Withington, who is one of America’s greatest amateur athletes, and who has the intellectual ability and high character requisite for presenting such a book properly. The emphasis placed upon clean living, fair play and moderation in all things makes this book as desirable educationally as it is in every other way.”—Outdoor Life.
- 61. “That Mr. Withington’s book will be popular we do not doubt. For it contains a series of expert treatises on all important branches of outdoor sports. A very readable, practical, well-illustrated book.”— Boston Herald. For sale by all booksellers or sent postpaid on receipt of price by the publishers LOTHROP, LEE SHEPARD CO., BOSTON
- 63. U. S. SERVICE SERIES By Francis Rolt-Wheeler Illustrated from photographs taken in work for U. S. Government Large 12mo Cloth $1.35 each, net “There are no better books for boys than Francis Rolt-Wheeler’s ‘U. S. Service Series.’”—Chicago Record-Herald. THE BOY WITH THE U. S. SURVEY This story describes the thrilling adventures of members of the U. S. Geological Survey, graphically woven into a stirring narrative that both pleases and instructs. The author enjoys an intimate acquaintance with the chiefs of the various bureaus in Washing, ton, and is able to obtain at first hand the material for his books. “There is abundant charm and vigor in the narrative which ii sure to please the boy readers and will do much toward stimulating their patriotism by making them alive to the needs of conservation of the vast resources of their country.”—Chicago News. THE BOY WITH THE U. S. FORESTERS The life of a typical boy is followed in all its adventurous detail—the mighty representative of our country’s government, though young in years—a youthful monarch in a vast domain of forest. Replete with information, alive with adventure, and inciting patriotism at every step, this handsome book is one to be instantly appreciated.
- 64. “It is a fascinating romance of real life in our country, and will prove a great pleasure and inspiration to the boys who read it.”—The Continent, Chicago. THE BOY WITH THE U. S. CENSUS Through the experiences of a bright American boy, the author shows how the necessary information is gathered. The securing of this often involves hardship and peril, requiring journeys by dog-team in the frozen North and by launch in the alligator-filled Everglades of Florida, while the enumerator whose work lies among the dangerous criminal classes of the greater cities must take his life in his own hands. “Every young man should read this story from cover to cover, thereby getting a clear conception of conditions as they exist to-day, for such knowledge will have a clean, invigorating and healthy Influence on the young growing and thinking mind.”—Boston Globe. For sale by all booksellers or sent postpaid on receipt of price by the publishers LOTHROP, LEE SHEPARD CO., BOSTON
- 66. U. S. SERVICE SERIES By FRANCIS ROLT-WHEELER Many illustrations from photographs taken in work for U.S. Government Large 12mo Cloth Net $1.35 per volume “There are no better books for boys than Francis Rolt-Wheeler’s ‘U.S. Service Series.’”—Chicago Record-Herald. THE BOY WITH THE U. S. FISHERIES With a bright, active American youth as a hero, is told the story of the Fisheries, which in their actual importance dwarf every other human industry. The book does not lack thrilling scenes. The far Aleutian Islands have witnessed more desperate sea-fighting than has occurred elsewhere since the days of the Spanish buccaneers, and pirate craft, which the U. S, Fisheries must watch, rifle in hand, are prowling in the Behring Sea to-day. The fish-farms of the United States are as interesting as they are immense in their scope. “One of the best books for boys of all ages, so attractively written and illustrated as to fascinate the reader into staying up until all hours to finish ...”—Philadelphia Despatch. THE BOY WITH THE U. S. INDIANS This book tells all about the Indian as he really was and is; the Menominee in his birch-bark canoe; the Iroquois in his wigwam in
- 67. the forest; the Sioux of the plains upon his war-pony; the Apache, cruel and unyielding as his arid desert; the Pueblo Indians, with remains of ancient Spanish civilization lurking in the fastnesses of their massed communal dwellings; the Tlingit of the Pacific Coast, with his totem-poles. With a typical bright American youth as a central figure, a good idea of a great field of national activity is given, and made thrilling in its human side by the heroism demanded by the little-known adventures of those who do the work of “Uncle Sam.” “An exceedingly Interesting Indian story, because it is true, and not merely a dramatic and picturesque incident of Indian life.”—N. Y. Times. “It tells the Indian’s story in a way that will fascinate the Youngster.”—Rochester Herald. For sale by all booksellers or sent postpaid on receipt of price by the publishers LOTHROP, LEE SHEPARD CO., BOSTON
- 69. U. S. SERVICE SERIES By FRANCIS ROLT-WHEELER Many Illustrations from photographs taken in work for U. S. Government Large 12mo Cloth Net, $1.35 each “There are no better books for boys than Francis Rolt-Wheeler’s ‘U. S. Service Series.’”—Chicago Record-Herald. THE BOY WITH THE U. S. EXPLORERS The hero saves the farm in Kansas, which his father is not able to keep up, through a visit to Washington which results in making the place a kind of temporary experiment station. Wonderful facts of plant and animal life are brought out, and the boy wins a trip around the world with his friend, the agent. This involves many adventures, while exploring the Chinese country for the Bureau of Agriculture. “Boys will be delighted with this story, which is one that inspires the readers with the ideals of industry, thrift and uprightness of conduct.”—Argus-Leader, Portland, Me. The billows surge and thunder through this book, heroism and the gallant facing of peril are wrought into its very fabric, and the Coast Guard has endorsed its accuracy. The stories of the rescue of the engineer trapped on a burning ship, and the pluck of the men who
- 70. built the Smith’s Point Lighthouse are told so vividly that it is hard to keep from cheering aloud. “This is an ideal book for boys because it is natural, inspiring, and of unfailing interest from cover to cover.”—Marine Journal. THE BOY WITH THE U. S. MAIL How much do you know of the working of the vast and wonderful Post Office Department? The officials of this department have, as in the case of all other Departments covered in this series, extended their courtesy to Dr. Rolt-Wheeler to enable him to tell us about one of the most interesting forms of Uncle Sam’s care for us. “Stamp collecting, carrier pigeons, aeroplanes, detectives, hold-ups, tales of the Overland trail and the Pony Express, Indians, Buffalo Bill —what boy would not be delighted with a book in which all these fascinating things are to be found?”—Universalist Leader. For sale by all booksellers or sent postpaid on receipt of price by the publishers LOTHROP, LEE SHEPARD CO., BOSTON
- 72. PHILLIPS EXETER SERIES By A. T. DUDLEY Cloth, 12mo Illustrated by Charles Copeland Price, net $1.25 each FOLLOWING THE BALL Here is an up-to-date story presenting American boarding-school life and modern athletics. Football is an important feature, but it is a story of character formation in which athletics play an important part. “Mingled with the story of football is another and higher endeavor, giving the book the best of moral tone.”—Chicago Record-Herald. MAKING THE NINE The life presented is that of a real school, interesting, diversified, and full of striking incidents, while the characters are true and consistent types of American boyhood and youth. The athletics are technically correct, abounding in helpful suggestions, and the moral tone is high and set by action rather than preaching. “The story is healthful, for, while it exalts athletics, it does not overlook the fact that studious habits and noble character are
- 73. imperative needs for those who would win success in life.”—Herald and Presbyter, Cincinnati. IN THE LINE Tells how a stalwart young student won his position as guard, and at the same time made equally marked progress in the formation of character. Plenty of jolly companions contribute a strong, humorous element, and the book has every essential of a favorite. “The book gives boys an interesting story, much football information, and many lessons in true manliness.”—Watchman, Boston. WITH MASK AND MITT While baseball plays an important part in this story, it is not the only element of attraction. While appealing to the natural normal tastes of boys for fun and interest in the national game, the book, without preaching, lays emphasis on the building up of character. “No normal boy who is interested in our great national game can fail to find interest and profit, too, in this lively boarding school story.”— Interior, Chicago. For sale by all booksellers or sent postpaid on receipt of price by the publishers LOTHROP, LEE SHEPARD CO., BOSTON
- 75. PHILLIPS EXETER SERIES By A. T. DUDLEY Cloth 12mo Illustrated Price, net $1.25 each THE GREAT YEAR Three fine, manly comrades, respectively captains of the football, baseball, and track and field athletic teams, make a compact to support each other so that they may achieve a “great year” of triple victory over their traditional rival, “Hillbury.” THE YALE CUP The “Cup” is an annual prize given by a club of Yale alumni to the member of the Senior class of each of several preparatory schools who best combines proficiency in athletics with good standing in his studies. A FULL-BACK AFLOAT At the close of his first year in college Dick Melvin is induced to earn a passage to Europe by helping on a cattle steamer. The work is not so bad, but Dick finds ample use for the vigor, self control, and quick wit in emergency which he has gained from football. THE PECKS IN CAMP The Pecks are twin brothers so resembling each other that it was almost impossible to tell them apart, a fact which the roguish lads
- 76. made the most of in a typical summer camp for boys. THE HALF-MILER This is the story of a young man of positive character facing the stern problem of earning his way in a big school. The hero is not an imaginary compound of superlatives, but a plain person of flesh and blood, aglow with the hopeful idealism of youth, who succeeds and is not spoiled by success. He can run, and he does run—through the story. “It is a good, wholesome, and true-to-life story, with plenty of happenings such as normal boys enjoy reading about.”—Brooklyn Daily Times. For sale by all booksellers or sent postpaid on receipt of price by the publishers LOTHROP, LEE SHEPARD CO., BOSTON
- 77. “INDIAN” STORIES WITH HISTORICAL BASES by D. LANGE 12mo Cloth Illustrated Price per volume, $1.25 net ON THE TRAIL OF THE SIOUX THE SILVER ISLAND OF THE CHIPPEWA LOST IN THE FUR COUNTRY IN THE GREAT WILD NORTH THE LURE OF THE BLACK HILLS THE LURE OF THE MISSISSIPPI LOTHROP, LEE SHEPARD CO., BOSTON *** END OF THIS PROJECT GUTENBERG EBOOK THE LURE OF THE MISSISSIPPI ***
- 79. *** END OF THE PROJECT GUTENBERG EBOOK THE LURE OF THE MISSISSIPPI *** Updated editions will replace the previous one—the old editions will be renamed. Creating the works from print editions not protected by U.S. copyright law means that no one owns a United States copyright in these works, so the Foundation (and you!) can copy and distribute it in the United States without permission and without paying copyright royalties. Special rules, set forth in the General Terms of Use part of this license, apply to copying and distributing Project Gutenberg™ electronic works to protect the PROJECT GUTENBERG™ concept and trademark. Project Gutenberg is a registered trademark, and may not be used if you charge for an eBook, except by following the terms of the trademark license, including paying royalties for use of the Project Gutenberg trademark. If you do not charge anything for copies of this eBook, complying with the trademark license is very easy. You may use this eBook for nearly any purpose such as creation of derivative works, reports, performances and research. Project Gutenberg eBooks may be modified and printed and given away—you may do practically ANYTHING in the United States with eBooks not protected by U.S. copyright law. Redistribution is subject to the trademark license, especially commercial redistribution. START: FULL LICENSE
- 80. THE FULL PROJECT GUTENBERG LICENSE
- 81. PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK To protect the Project Gutenberg™ mission of promoting the free distribution of electronic works, by using or distributing this work (or any other work associated in any way with the phrase “Project Gutenberg”), you agree to comply with all the terms of the Full Project Gutenberg™ License available with this file or online at www.gutenberg.org/license. Section 1. General Terms of Use and Redistributing Project Gutenberg™ electronic works 1.A. By reading or using any part of this Project Gutenberg™ electronic work, you indicate that you have read, understand, agree to and accept all the terms of this license and intellectual property (trademark/copyright) agreement. If you do not agree to abide by all the terms of this agreement, you must cease using and return or destroy all copies of Project Gutenberg™ electronic works in your possession. If you paid a fee for obtaining a copy of or access to a Project Gutenberg™ electronic work and you do not agree to be bound by the terms of this agreement, you may obtain a refund from the person or entity to whom you paid the fee as set forth in paragraph 1.E.8. 1.B. “Project Gutenberg” is a registered trademark. It may only be used on or associated in any way with an electronic work by people who agree to be bound by the terms of this agreement. There are a few things that you can do with most Project Gutenberg™ electronic works even without complying with the full terms of this agreement. See paragraph 1.C below. There are a lot of things you can do with Project Gutenberg™ electronic works if you follow the terms of this agreement and help preserve free future access to Project Gutenberg™ electronic works. See paragraph 1.E below.
- 82. 1.C. The Project Gutenberg Literary Archive Foundation (“the Foundation” or PGLAF), owns a compilation copyright in the collection of Project Gutenberg™ electronic works. Nearly all the individual works in the collection are in the public domain in the United States. If an individual work is unprotected by copyright law in the United States and you are located in the United States, we do not claim a right to prevent you from copying, distributing, performing, displaying or creating derivative works based on the work as long as all references to Project Gutenberg are removed. Of course, we hope that you will support the Project Gutenberg™ mission of promoting free access to electronic works by freely sharing Project Gutenberg™ works in compliance with the terms of this agreement for keeping the Project Gutenberg™ name associated with the work. You can easily comply with the terms of this agreement by keeping this work in the same format with its attached full Project Gutenberg™ License when you share it without charge with others. 1.D. The copyright laws of the place where you are located also govern what you can do with this work. Copyright laws in most countries are in a constant state of change. If you are outside the United States, check the laws of your country in addition to the terms of this agreement before downloading, copying, displaying, performing, distributing or creating derivative works based on this work or any other Project Gutenberg™ work. The Foundation makes no representations concerning the copyright status of any work in any country other than the United States. 1.E. Unless you have removed all references to Project Gutenberg: 1.E.1. The following sentence, with active links to, or other immediate access to, the full Project Gutenberg™ License must appear prominently whenever any copy of a Project Gutenberg™ work (any work on which the phrase “Project
- 83. Gutenberg” appears, or with which the phrase “Project Gutenberg” is associated) is accessed, displayed, performed, viewed, copied or distributed: This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re- use it under the terms of the Project Gutenberg License included with this eBook or online at www.gutenberg.org. If you are not located in the United States, you will have to check the laws of the country where you are located before using this eBook. 1.E.2. If an individual Project Gutenberg™ electronic work is derived from texts not protected by U.S. copyright law (does not contain a notice indicating that it is posted with permission of the copyright holder), the work can be copied and distributed to anyone in the United States without paying any fees or charges. If you are redistributing or providing access to a work with the phrase “Project Gutenberg” associated with or appearing on the work, you must comply either with the requirements of paragraphs 1.E.1 through 1.E.7 or obtain permission for the use of the work and the Project Gutenberg™ trademark as set forth in paragraphs 1.E.8 or 1.E.9. 1.E.3. If an individual Project Gutenberg™ electronic work is posted with the permission of the copyright holder, your use and distribution must comply with both paragraphs 1.E.1 through 1.E.7 and any additional terms imposed by the copyright holder. Additional terms will be linked to the Project Gutenberg™ License for all works posted with the permission of the copyright holder found at the beginning of this work.
- 84. 1.E.4. Do not unlink or detach or remove the full Project Gutenberg™ License terms from this work, or any files containing a part of this work or any other work associated with Project Gutenberg™. 1.E.5. Do not copy, display, perform, distribute or redistribute this electronic work, or any part of this electronic work, without prominently displaying the sentence set forth in paragraph 1.E.1 with active links or immediate access to the full terms of the Project Gutenberg™ License. 1.E.6. You may convert to and distribute this work in any binary, compressed, marked up, nonproprietary or proprietary form, including any word processing or hypertext form. However, if you provide access to or distribute copies of a Project Gutenberg™ work in a format other than “Plain Vanilla ASCII” or other format used in the official version posted on the official Project Gutenberg™ website (www.gutenberg.org), you must, at no additional cost, fee or expense to the user, provide a copy, a means of exporting a copy, or a means of obtaining a copy upon request, of the work in its original “Plain Vanilla ASCII” or other form. Any alternate format must include the full Project Gutenberg™ License as specified in paragraph 1.E.1. 1.E.7. Do not charge a fee for access to, viewing, displaying, performing, copying or distributing any Project Gutenberg™ works unless you comply with paragraph 1.E.8 or 1.E.9. 1.E.8. You may charge a reasonable fee for copies of or providing access to or distributing Project Gutenberg™ electronic works provided that: • You pay a royalty fee of 20% of the gross profits you derive from the use of Project Gutenberg™ works calculated using the method you already use to calculate your applicable taxes. The fee is owed to the owner of the Project Gutenberg™ trademark,
- 85. but he has agreed to donate royalties under this paragraph to the Project Gutenberg Literary Archive Foundation. Royalty payments must be paid within 60 days following each date on which you prepare (or are legally required to prepare) your periodic tax returns. Royalty payments should be clearly marked as such and sent to the Project Gutenberg Literary Archive Foundation at the address specified in Section 4, “Information about donations to the Project Gutenberg Literary Archive Foundation.” • You provide a full refund of any money paid by a user who notifies you in writing (or by e-mail) within 30 days of receipt that s/he does not agree to the terms of the full Project Gutenberg™ License. You must require such a user to return or destroy all copies of the works possessed in a physical medium and discontinue all use of and all access to other copies of Project Gutenberg™ works. • You provide, in accordance with paragraph 1.F.3, a full refund of any money paid for a work or a replacement copy, if a defect in the electronic work is discovered and reported to you within 90 days of receipt of the work. • You comply with all other terms of this agreement for free distribution of Project Gutenberg™ works. 1.E.9. If you wish to charge a fee or distribute a Project Gutenberg™ electronic work or group of works on different terms than are set forth in this agreement, you must obtain permission in writing from the Project Gutenberg Literary Archive Foundation, the manager of the Project Gutenberg™ trademark. Contact the Foundation as set forth in Section 3 below. 1.F.
- 86. Welcome to our website – the perfect destination for book lovers and knowledge seekers. We believe that every book holds a new world, offering opportunities for learning, discovery, and personal growth. That’s why we are dedicated to bringing you a diverse collection of books, ranging from classic literature and specialized publications to self-development guides and children's books. More than just a book-buying platform, we strive to be a bridge connecting you with timeless cultural and intellectual values. With an elegant, user-friendly interface and a smart search system, you can quickly find the books that best suit your interests. Additionally, our special promotions and home delivery services help you save time and fully enjoy the joy of reading. Join us on a journey of knowledge exploration, passion nurturing, and personal growth every day! ebookbell.com