0% found this document useful (0 votes)
47 views10 pages

Dynamic Clustering Approach Based On Wireless Sensor Networks Genetic Algorithm For Iot Applications

Uploaded by

manvithagowda34
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
47 views10 pages

Dynamic Clustering Approach Based On Wireless Sensor Networks Genetic Algorithm For Iot Applications

Uploaded by

manvithagowda34
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Wireless Networks

https://doi.org/10.1007/s11276-019-02083-7 (0123456789().,-volV)(0123456789().
,- volV)

Dynamic clustering approach based on wireless sensor networks


genetic algorithm for IoT applications
Shalli Rani1 • Syed Hassan Ahmed2 • Ravi Rastogi3

 Springer Science+Business Media, LLC, part of Springer Nature 2019

Abstract
Energy is vital parameter for communication in Internet of Things (IoT) applications via Wireless Sensor Networks
(WSN). Genetic algorithms with dynamic clustering approach are supposed to be very effective technique in conserving
energy during the process of network planning and designing for IoT. Dynamic clustering recognizes the cluster head (CH)
with higher energy for the data transmission in the network. In this paper, various applications, like smart transportation,
smart grid, and smart cities, are discussed to establish that implementation of dynamic clustering computing-based IoT can
support real-world applications in an efficient way. In the proposed approach, the dynamic clustering-based methodology
and frame relay nodes (RN) are improved to elect the most preferred sensor node (SN) amidst the nodes in cluster. For this
purpose, a Genetic Analysis approach is used. The simulations demonstrate that the proposed technique overcomes the
dynamic clustering relay node (DCRN) clustering algorithm in terms of slot utilization, throughput and standard deviation
in data transmission.

Keywords Genetic algorithm  IoT  WSN  DCRN  Smart cities  Smart grid

1 Introduction version instead of the existing procedure of the internet.


The count of objects consuming internet facilities is
Among the constant developments in technology a developing each day and connecting all of them by wireless
prospective invention, IoT is a forthcoming road which is or wire will set as an influential base of evidence at our
escalating as a universal worldwide computing system finger commands. The notion of empowering communi-
where billions of devices will be linked to the Internet [1]. cation among smart devices and machines is an innovative
IoT is constantly growing and is a latest exploration area technology; however, the IoT enabled technologies are not
where openings are countless. Due to its countless imagi- rather original for people [2]. IoT is the term and the
nations, it is placed into an updated and incorporated method of joining data, acquired from diverse types of
objects to any assumed platform on the online network
organization [3]. The IoT delivers novel contestants and
& Shalli Rani heritage wireless operators with additional opportunity for
[email protected]
transporting connectivity to their clients as shown in Fig. 1.
Syed Hassan Ahmed There are numerous conceivable upcoming presenta-
[email protected]
tions that can be of excessive benefit. Following are some
Ravi Rastogi of the applications of IoT:-
[email protected]
1
(a) Intelligent transportation system (ITS): Traffic due to
Department of CSE, Chitkara University Institute of
Engineering and Technology, Chitkara University, Rajpura,
vehicles is a significant issue of a society. Therefore,
Punjab 140401, India all associated difficulties with it must be correctly
2
Department of CS, Georgia Southern University, Statesboro,
given attention. ITS has an essential feature for a
GA 30460, USA system which could reform the transportation cases
3 based on the traffic material retrieved through objects
Department of Computing and Information Technology,
University of Bisha, Bisha, Saudi Arabia by deployment of IoT technologies [4]. For such

123
Wireless Networks

Fig. 1 Network planning for


IoT applications

innovating schemes, an understanding of a novel (e) Smart agriculture: Soil nutrition, Humidity, Temper-
methods for automatic monitoring of vehicles and ature, etc. can be observed and can help in the
other transportation parameters is very important. improvement of the green housing experiences by
For its deployment, there is a requirement of IoT automatic adjustment of various parameters to
framework with enabling technologies rather than exploit production. Precise fertilization and watering
general image processing techniques [5]. will support in refining the water conserving and
(b) Smart environment: Forecasting of natural catastro- quality composting respectively [7].
phes such as fire, floods, air pollution, land-sliding, For large-scale WSNs, the clustering is a key routing
earthquakes, volcanoes, etc. is possible by the use of method which effectively broadens the network’s lifetime.
inventive technologies of IoT. Environment moni- In this paper, a reactive routing algorithm and neuron
toring systems will be available to predict the certain structure with transmission principle on the basis of
parameters of the disasters which will be helpful in dynamic clustering is proposed. Cluster head is efficiently
determining the danger beforehand. elected in the occurrence region on the basis of residual
(c) Smart home: IoT can deliver DIY (Do-It-Yourself) energy after the amplification of the event.
explanations for Smart Home Automation by which The cluster head transmits the collected data back to the
remotely controlled appliances will be available as end nodes along with the network backbone information.
per people’s requirements. Careful monitoring of Two types of accumulation methods are devised to increase
efficacy meters, water and energy usage will aid in the efficiency of data collection. In a designed method, data
conserving resources and sensing unforeseen over- should be periodically transmitted by nodes outside the
filling, water leakages, etc. region if fluctuation is faced by the cluster head. By this
(d) Smart hospitals: Doctors and other supporting staff cluster head can track the varying speed of the incident due
will be capable of monitoring the blood rate, to fluctuation raised in action-threshold. At last the results
temperature, heart rate and other patient’s health received from simulation verify that the DCRR algorithm
conditions outside or inside the buildings of the boost ups the life duration of network and changes are
hospital on the time of admission using smart adaptable as well as this algorithm has more significant
malleable wearable embedded devices with RFID merits under the middle and low load. Numerous fields and
tags that make hospital smart and well-furnished [6]. applications such as general engineering, disaster and
hazards management, biomedical health and habitat

123
Wireless Networks

monitoring, forest fire detection, animal tracking, com- Routing [21], Power Efficient And Adaptive Clustering
mercial applications, seismic detection, homes applica- Hierarchy (PEACH) [22], Optimal Energy Aware Clus-
tions, underwater applications etc. [8] are developed for tering [21], Genetic algorithm for IoT [23], Hybrid based
WSNs. According to article [9] WSNs are considered as Energy- Efficient Distributed Clustering (HEED) [24],
the rapid growing technology along with a most leading Power Aware Dynamic Clustering Protocol (PADCP)
IoT technologies [10]. The motes known as sensor or [21, 25].
sensing nodes are substantial entities characterized by: (1) Arboleda et al. [26] reflected some key approaches and
a battery with defined energy; (2) a processor with gave comparability analysis among the various clustering
restricted processing proficiency; (3) and a transceiver [11]. protocols. In this paper, authors analyzed cluster structure,
The sensor nodes can be disposed in supervising areas to LEACH-based protocols, cluster types and its advantages
collect diversified types of information (e.g., wind, along with reactive routing WSNs algorithms. The com-
humidity, light, temperature) and then transfer the assem- parative analysis of these protocols’ characteristics and
bled information to the sink using routing mechanism via their uses in different applications were defined.
multi-hop or single hop communication [12]. The access Kumarawadu et al. [27] identified the feasible clustering
points or sensor nodes relay that gathered information to WSNs algorithms with CH election norms and cluster
the users. However, when WSNs are deployed in distant formation parameters. The authors also surveyed the
areas; it is arduous to replace drained batteries [13], which challenges and issues related to neighborhood information,
lead to extend WSN lifetime durability crucially. The biologically inspired, probabilistic that depends on the
transceiver is the source of higher energy consumption that identity-based clustering algorithms classification.
used in sensor nodes, and many papers or articles also Jiang et al. [28] introduced clustering schemes and
discussed it in literature [14]. For minimal consumption of classification methods in WSN to examine three
energy and the usage of transceiver in an attractive manner, notable merits such as easy maintenance, fewer overheads,
strategies are in development. Clustering is grouping of and more scalability thorough eight clustering attributes.
sensors in numerous clusters in which individual cluster The authors also figured out various algorithms in clus-
have a respective cluster-head including various cluster tering such as PEGASIS, HEED, LEACH etc. and com-
members. In dynamic clustering, a sensor node having high parison of these algorithms was done with numerous
energy becomes the cluster head which makes the wireless attributes.
network more stable. Contribution of the papers is outlined Authors in [29] presented a study on a simple clustering
as below: routing protocol classification to attain energy efficiency
from the perspectives of data routing in WSNs. Along with
• A literature survey of the existing integration of WSN
some future research directions, pre-established and on-
with IoT is carried out.
demand classes of nine clustering algorithms were sum-
• Comparative Protocols of WSN are analyzed.
marized by authors in this research paper.
• Usage and importance of Genetic Algorithms for Data
In [30] authors discussed the operations, advantages,
Transmission is realized and new algorithm is proposed
and demerits of each clustering protocol algorithm briefly.
for IoT applications based on routing in WSN.
In terms of energy utilization and network’s lifespan,
• The proposed approach is validated in terms of
authors surveyed the seven algorithms such as APTEEN,
throughput and standard deviation.
TEEN, LEACH and EEUC etc.
Rest of the paper is organized as: Sect. 2 throws light on In [31] authors have proposed a survey to summarize
the work done in the recent past by the researchers which is nine leading clustering algorithms with their challenges
followed by the proposed algorithm in Sect. 3. Results and such as EECS, HEED, LEACH, TL-LEACH, EEUC etc.
Discussions are done in the Sect. 4. Lastly, paper is con- The comparative analysis of these algorithms was done on
cluded in Sect. 5. the behalf of merits such as hop distance, cluster size, CH
distribution uniformity, cluster formation approach, resid-
ual energy and delay.
2 Related work To stabilize energy utilization among CHs, a distributed
energy-effective unequal (DEU) cluster routing protocol
There are many clustering algorithms and mechanisms presented in [32]. The DEU clustering protocol integrated
used in literature such as Hierarchical Clustering [15], the uneven clustering and multi-hop routing methods along
Distributed Clustering Algorithm (DCA) [16], Spanning with to select highly energy efficient nodes in the network
Tree (or BFS Tree) [17], on-Demand Clustering Routing to save energy. CHs considered factors like optimal hop
[18], Degree or Lowest Identifier Heuristics [19], Cognitive count of candidate nodes, intra-cluster, residual energy and
Routing Protocol for IoT [20], Energy Efficient Clustering

123
Wireless Networks

inter-cluster communication and transmission cost to elect 3 Proposed algorithm


RNs.
The above approaches have worked on the parameters of Recent work or research in IoT classified in terms of
energy, delay, network stability etc. i.e. quality of metrics platform, network, devices and layers. For WSNs inte-
(QoS) for WSN. They have not considered the network grated with IoT, we focused on design and network plan-
throughput, scalability and reliability for transmitting the ning with the use of dynamic clustering approach based
data which is required for IoT applications. genetic algorithm (GA). An IoT application performs well
Certainly, literature exists in abundance for WSN soft- and seamlessly with well-designed IoT network architec-
ware platforms related to the various domains of IoT ture. Without it, IoT devices do not provide useful infor-
applications. In [33] an architectural reference model mation and services to the end users. A novel architecture
(ARM) is specified within the project named IoT-A. The with some predictable techniques such as grouping, secu-
key concepts and functional groups of truly existing IoT rity and privacy, network and connection management is
platforms and scenarios are defined in [33] and have dis- introduced in this research. Many other technologies as
cussed about developing a domain and a functional model. WSN, near field communications (NFC), machine-to-ma-
For example, authors [34, 35] went through interoperability chine (M2M), personal area networks (PAN) such as Wi-
in IoT based scenarios with the use of designed guidelines Fi, cellular, Bluetooth etc. and body area networks (BAN)
of IoT based ARM and by defining acceptable IoT web- are also included in the IoT era.
enabled technologies.
In the above approaches of IoT, authors have not con- 3.1 Challenges and prospect of IoT
sidered the scalability, fault tolerance and load balancing.
The proposed approach has shown the network throughput As IoT nodes should be united, extensive and flawless so it
and slot utilization over 800 data transmissions which can needs set up of high scale services formation within agreed
be increased as per the network area. Moreover, it is con- standards to gives high impacts to the services related to
sidering standard deviation in the data transmission to different applications or scenarios and user requirements.
validate it for the IoT. Although IoT application development is a continuous
As interoperability is an important facet, undeniably process, still there are plentiful issues such as cost, power,
heterogeneity or cross-section is also one of the main computing, low latency, self-organization, dispersed intel-
threats to be directed in IoT environments. To virtualize the ligence and systems technology which need to be solved.
real-world entities, IoT ARM-based platform is introduced
(a) Challenges of IoT
in this research. Data collected by the latent sensors or
actions performed by underlying actuators exposed entities Though IoT brings many new connections and oppor-
in a conceptual manner. A case is defined, in which Parking tunities to end users as well as to the industry insights to
lots and holding space is monitored by sensors. Scalability various application areas, still it lacks in efficient archi-
is another issue that becomes the important aspect of IoT tecture and technology set of standards that connects the
based platforms and scenario is also proposed. In [36] this real and virtual world in an allied framework [38]. Some of
approach works within the VITAL project. According to the key challenges are listed as following.
smart city scenario, authors have [37] considered an
(1) Architecture challenge: Emerging of various sensors
approach to define the main challenges namely; homoge-
(e.g. physical, chemical, biometric and camera
nization, resources management, and services exposure
sensors), smart interlinked devices and intense far-
arise by these resources. Authors are working on the inte-
reaching technologies involved in IoT applications
gration of WSN and IoT protocols [38, 39] which is raising
depend on various fields and their architecture or
challenge for the already existing protocols. Despite these
scenario. Moreover, the communications between
facts, the proposed approach presented in only as a design
these interconnected devices are in a wireless, ad hoc
concept. However, it does not give the working of each
and in an automatic manner. It makes the architec-
component of architecture, their implementation and
ture services more decentralized, mobile and
deployed nature. The work proposed in the paper has
complicated.
elaborated the results retrieved after the implementation of
(2) Technical challenge: Although different application
the proposed algorithm.
areas need different scenarios and architectures,
therefore, different technologies are to be developed,
related to the services that make the IoT complex. In
this way, heterogeneous becomes one of the major
challenges in smart IoT environments.

123
Wireless Networks

(3) Hardware challenge: IoT equips smart systems with completely new offspring, the genes at crossover sites are
smart devices. To exploit the communication need to exchanged. For example:
between the devices, speedy deployment and ser- These operations determine an efficient solution of
vices of IoT applications are required. For this exploration of all-around search space and focus to cover to
reason, researchers focus on hardware design like a the global space (Fig. 2). A fitness function is used to
wireless trackable system which is cost-effective, measure the quality of solution. The system flow chart is
low size and highly functional. shown in Fig. 3.
GA is generally used to achieve high-quality solutions for
search. To optimize the problems with historical data and 3.2 Fitness of heredity
to address the search for better performance is mostly
accomplished by the efficient GAs as these algorithms are The fitness of heredity is introduced to reduce consumption
based on genetics and natural selection. The term natural of energy along with this, the network existence is also
selection means completion of tasks by those species who expanded. In this section, some of the fitness related
can adapt to changes occurring in an environment for parameters are described.
surviving in next generation and to reproduce the new (1) Direct distance (DD) to base station (BS): The term
species. These algorithms pretend ‘‘survival of the fittest’’ DD to BS is defined as the aggregation of the overall
as each generation consists of a population of individuals area or gap from sensing nodes to the BS (Eq. 1).
and each individual depicts a search space point along with This gap or distance is defined as follows (Eq. 1):
attainable manner of integer/floats/string/bits/character, Xm
similar to the chromosome. DD ¼ dis ð1Þ
The GAs preserved the population of n individuals in i¼1
addition to their fitness scores, means who has the ability to
whereas d = distance, i = ith node and s = base sta-
compete; a fitness score is given to that individual. Those
tion sth node. dis is the distance among two nodes,
who have better scores, mate and generate better descen-
node i and node s respectively. To make nodes as
dant by bringing together chromosomes of parents. They
energy efficient in larger networks, the distance
are selected to reproduce more as compared to other indi-
should be minimized to avoid wastage of energy of
viduals. As the size of a population is static and some of the
nodes.
individuals die, so a room has to be formed for the new
(2) Cluster distance (C): The total area covered by nodes
generation for replacement of the old ones with new arri-
to the cluster head and the area covered from the
vals when all mating opportunities are expanded. When a
head or top to BS node is defined as the term cluster
least fit dies, it is assumed that superior solutions will be
distance (Eq. 2). The C is defined as following with
succeeded as each new generation has better genes.
member of K collection of nodes (Eq. 2).
Better genes are more efficient than the average genes
besides having partial solutions as compared to the solu- X
k
C¼ dih þ dhs ð2Þ
tions of former generations. The population is said to i¼1
converge when there is no considerable difference origi-
nated by off-springs comparable to previous populations. d = distance, i = node i and h = head of cluster. C is
Therefore, the GA is also said to converge as a set of defined as the distance and gap covered from i to the
solutions for the problem. h, Hence dhs defined as the distance between these
two nodes.
(b) Operators of Genetic Algorithms (3) Cluster distance—standard deviation (SD): The
The following operators are involved in algorithm for cluster distances deviations should be small for
new generation of off-springs after the creation of primary consistently placed and structural distribution of
generation:– sensor nodes. But for node allocations at random and
(1) Selection operator: In this, the one who has finer in non-uniformly areas, distances must not be same.
fitness scores, are selected to transmit their heredity to the The computation of cluster gaps, SD (Eqs. 3 and 4),
succeeding generations. Preferences are given to the fittest along with l deviation done as follows:
off-spring. Ph
dcluster
(2) Crossover operator: This gives the idea of mating l ¼ i¼1 ð3Þ
h
between individuals based on crossover sites and selection
operator which are chosen randomly. Thus to create a

123
Wireless Networks

Fig. 2 Mutation process

Fig. 3 Proposed system


flowchart

vffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
u h X
k
uX
SD ¼ t ðl  dclusteri Þ2 ð4Þ E¼ ETjh þ k þ ER þ Eths ð5Þ
j¼1
i¼1

The first term of Eq. 5 depicts the absorbed energy to


(4) Transfer energy (E): Transfer energy E; define as the
transfer messages from K nodes to head. The term
consumed energy to pass the entire message from the
second shows the energy carried by the head node of
cluster head node to the BS node. With amount of K
cluster to receive number of K messages from the
member cluster nodes, transfer energy is described as
cluster representative nodes. Finally, the third one
follow (Eq. 5)

123
Wireless Networks

term presents the transmission energy absorbed LEACH DCRN Proposed Scheme
24
through BS node to the cluster head point.
22
(5) Number of transmissions (T): For each stage for
20
transferring data, BS assigns the number of trans-
18
missions T and the value of transmissions should be
16

Number of Slots
adapted in accordance to the presented energy levels
14
and network conditions. In this way the values of T is
12
not determined and the GA outcome will be used for
10
longest time duration.
8
(6) Fitness function: All the introductory fitness param-
6
eters and aspects of genes fitness function F is
4
defined below as (Eq. 6):
X 2
F¼ wi  fi;8 fi eðC; DD; E; SD; TÞ ð6Þ 0
i 0 100 200 300 400 500 600 700 800
Number of Transmissions
The primary fitness aspects can be ascribed the
erratic impact, wi. The best fit chromosome is Fig. 4 Slot utilization comparison
assessed after every generation.
LEACH DCRN Proposed Scheme
3.5

%age of Packets Transmied to the CH


3
4 Results and discussion
2.5

In our simulation system, 100 nodes of a network are 2


systematically dispersed in a region of 100 9 100 m2.
Simulations are carried out in MATLAB. Let t0 denotes the 1.5

transmission time to begin. The transmission said to be 1


successful as long as there is no other transmission begins
during (t0 - 1, t0 ? 1). Setting s = 2 (since the interval 0.5

length is 2) and k = 0 in our Poisson formula1 we have 0


P0 = e2G (Eq. 7):- 0 100 200 300 400 500 600 700 800
Number of Transmissions
S ¼ Ge2G ð7Þ
Fig. 5 Comparison of packets transmission to cluster head
Setting ds=dG ¼ 0, we say S is maximum when G = 0.5,
and on that time period S = 1/2e. LEACH DCRN Proposed Scheme
It is evident from the Fig. 3 that the best-case utilization 1400
Number of Packets Transmied to the BS

of DCRN –GA(Curve in green)is best as compared to


1200
Previous methods i.e. LEACH And DCRN.
Comparison results in terms of a number of packets 1000
received to cluster head and a base station are shown in
graphs (Figs. 4, 5 and 6). Figure 4 shows that in DCRN- 800

GA protocols’ cluster head receives 3*104 packets from


600
nodes as equating to DCRN packets to cluster head are
2*104. In basic LEACH packets to cluster head decreased 400
to 1*104. It is noticed that DCRN-GA protocol executes
much better than DCRN and LEACH protocols. Packets 200
received at the base station are 1400 in case of DCRN-GA
0
and 1000 packets are received at a base station in case of
0 100 200 300 400 500 600 700 800
DCRN while only 800 packets are received in case of leach Number of Transmissions
protocol as shown in Fig. 5. Therefore, it is observed that
Dynamic clustering routing using Genetic algorithm is best Fig. 6 Comparison of packets transmission to base station
for Network planning and design in Wireless Sensor Net-
works for IoT applications.

123
Wireless Networks

Proposed Scheme DCRN LEACH Besides, the whole assessment process of framework could
enhance with the expansion of System C-based simulations
100%
where a huge size of population and generations are
90%
%age of Standard Deviaon

employed.
80%
70%
60%
50% References
40%
30% 1. Rafiullah, K., & Sarmad, U. K., Rifaqat, Z., & Shahid, K. (2012).
20% Future internet: The internet of things architecture, possible
10%
applications and key challenges. In Proceedings of frontiers of
information technology (FIT), 2012, pp. 257–260.
0%
2. Guicheng, S., & Bingwu, L. (2011). The visions, technologies,
Slot Ulizaon Packets to Cluster Packets to Base
Head Staon applications and security issues of internet of things. E-Business
Parameters to analyze the SD and E -Government (ICEE), 2011, pp. 1–4.
3. Ling-yuan, Z. (2012). A security framework for internet of things
Fig. 7 Comparison of standard deviation on the basis of slot based on 4G communication. In Computer science and network
utilization, packets to CH and packets to BS technology (ICCSNT), 2012, pp. 1715–1718.
4. Cao, Y., Li, W., & Zhang, J. (2011). Real-time traffic information
collecting and monitoring system based on the Internet of Things.
Figure 7 shows the standard deviation (SD) in terms of In Pervasive computing and applications (ICPCA), 2011, 6th
slot utilization, transmission of data packets to the BS and international conference, pp. 45–49.
transmission of data packets to the cluster head. SD of 5. Xiao, L., & Wang, Z. (2011). Internet of Things: A new appli-
cation for intelligent traffic monitoring system. Journal of Net-
DCRN is higher in slot utilization and packets transmission works, 6(6), 887.
to the BS which is not suitable for IoT applications. Sensor 6. Fuhrer, P., & Guinard, D. (2006). Building a smart hospital using
nodes should be equally capable of utilizing the data RFID technologies: Use cases and implementation. Fribourg:
transmission channels. However, comparison shows that Department of Informatics-University of Fribourg.
7. TongKe, F. (2013). Smart agriculture based on cloud computing
newly proposed algorithm works efficiently and its SD is and IoT. Journal of Convergence Information Technology (JCIT),
less as compare to both traditional approaches except in 8(2).
data transmission to the CH. Data transmitted to the CHs is 8. Wu, H., Chen, X., Xiao, Y., & Xu, M. (2012). An acoa-afsa
sent to the BS only, therefore SD should not be high in later fusion routing algorithm for underwater wireless sensor network.
International Journal of Distributed Sensor Networks, 8(5),
case. In IoT applications data is transmitted through the 4110–4118.
huge amount of heterogenous devices where each device 9. Ilyas, M., & Mahgoub, I. (2012). Handbook of sensor networks:
should be able to use the channel in efficient manner. High Compact wireless and wired sensing systems. Boca Raton, FL:
SD affects the channel utilization in adverse manner while CRC Press LCC.
10. Jianbin, X., Ting, Z., Yan, Y., Wenhua, W., & Songbai, L.
transmitting data to the BS. This case makes the proposed (2013). Cooperation-based ant-colony algorithm in wsn. Journal
scheme more suitable to the IoT applications. of Networks, 8(4).
11. Mekkaoui, K., & Rahmoun, A. (2011). Short-hops versus long-
hops—energy efficiency analysis in wireless sensor networks. In
CIIA 2011: Proceedings of the third international conference on
5 Conclusion computer science and its applications (CIIA11), University of
Saida, Algeria, pp. 13–15.
In this work, to optimize the performance metric of WSNs, 12. Akyildiz, I. F., & Vuran, M. C. (2010). Wireless sensor networks.
a generic Dynamic clustering routing approach based on (Vol. 4). Hoboken: Wiley. https://doi.org/10.1002/
9780470515181
GA is proposed which aid the escalation of both theoretical 13. Chakraborty, A., Mitra, S. K., & Naskar, M. K. (2011). A genetic
analyses as well as the models based on simulations for IoT algorithm inspired routing protocol for wireless sensor networks.
applications. On the basis of Fitness function performance International Journal of Computational Intelligence Theory and
metrics, high availability and efficiency have been Practice, 6(1).
14. Odey, A. J., & Li, D. (2012). Low power transceiver design
improved in the framework and the results received are parameters for wireless sensor networks. Wireless Sensor Net-
compared via inexhaustive simulations. It is observed that work, 4(10), 243–249.
DCRN-GA is a far better approach as compared to previ- 15. Mahmood, D., Javaid, N., Mahmood, S., Qureshi, S., Memon, A.
ously used approaches and will be a new revolution in IoT M., & Zaman, T. (2013). MODLEACH: A variant of LEACH for
WSNs, pp. 123–128.
applications in the term of network planning. In the further 16. Angel Latha Mary, S., Sivaganesan, D., & Vinothkumar, R.
work, to make each metric strictly at the same scale is still (2015). An empirical research of dynamic clustering algorithms.
a challenge on the basis of optimization of weighted sum. ARPN Journal of Engineering and Applied Sciences, 10(9),
33–35.

123
Wireless Networks

17. Ma, W., Cao, Y., Wei, W., Hei, X., & Ma, J. (2015). Energy- 33. Bassi, A., Bauer, M., Fiedler, M., Kramp Van Kranenburg, T.,
efficient collaborative communication for optimization cluster et al. (Eds.). (2013). Enabling things to talk: Designing IoT
heads selection based on genetic algorithms in wireless sensor solutions with the IoT architectural reference model. Berlin/
networks. International Journal of Distributed Sensor Networks, Heidelberg: Springer.
2015, 396121. 34. Krco, S., Pokric, B., & Carrez, F. (2014). Designing IoT archi-
18. Baranidharan, B., & Santhi, B. (2015). GEACH: Genetic algo- tecture(s): A European perspective. In Proceedings of the 2014
rithms based energy efficient clustering hierarchy in wireless IEEE World Forum on Internet of Things (WF-IoT), Seoul,
sensor networks. Hindawi Publishing Corporation Journal of Korea, pp. 6–8 March 2014.
Sensors, 2015,715740. 35. Kiljander, J., D’elia, A., Morandi, F., Hyttinen, P., et al. (2014).
19. Eiben, A. E., & Smith, J. E. (2003). Introduction to evolutionary Semantic interoperability architecture for pervasive computing
computing., Natural Computing Series Berlin: Springer. and internet of things. IEEE Access, 2, 856–873.
20. Al-Turjman, F. (2019). Cognitive routing protocol for disaster- 36. Petrolo, R., Loscri, V., & Mitton, N. (2014). Towards a cloud of
inspired internet of things. Future Generation Computer Systems, things smart city. IEEE COMSOC MMTC E Lett, 9, 44–47.
92, 1103–1115. 37. Vögler, M., Schleicher, J. M., Inzinger, C., Dustdar, S., & Ranjan,
21. Huyuh, T. T., Dinh-Due, A., & Tran, C. H. (2013). Balancing R. (2016). Migrating smart city applications to the cloud. IEEE
latency and energy efficiency in wireless sensor networks: A Cloud Computing, 3, 72–79.
comparative study. In IEEE international conference on com- 38. Kuo, Y. W., Li, C. L., Jhang, J. H., & Lin, S. (2018). Design of a
puting, management and telecommunication, pp. 181–186. wireless sensor network-based IoT platform for wide area and
22. Akojwar, S. G., & Patrikar, R. M. (2008). Improving life time of heterogeneous applications. IEEE Sensors Journal, 18(12),
wireless sensor networks using neural network based classifica- 5187–5197.
tion technique with cooperative routing. International Journal of 39. Kim, J. W., Yi, J. H., & Seo, C. (2018). Distributed quality of
Communications, 2(1), 75–86. service routing protocol for multimedia traffic in WiMedia net-
23. Deng, X., Jiang, P., Peng, X., & Mi, C. (2019). An intelligent works. Wireless Networks, 24(8), 2835–2849.
outlier detection method with one class support tucker machine
and genetic algorithm toward big sensor data in Internet of
Things. IEEE Transactions on Industrial Electronics, 66(6), Shalli Rani is Associate Profes-
4672–4683. sor in CSE with Chitkara
24. Deepak, G., & Malay Ranjan, T. (2012). Routing protocols in University [Rajpura (Punjab)],
wireless sensor networks: A survey. In IEEE international con- India. She has 14? years
ference on advanced computing and communication technolo- teaching experience. She
gies, pp. 474–480. received MCA degree from
25. Suraj, S., & Sanjay Kumar, J. (2011) A survey on secure hier- Maharishi Dyanand University,
archical routing protocols in wireless sensor networks. In ICCCS, Rohtak in 2004 and the M.Tech.
11 February 12–14, pp. 146–151. degree in Computer Science
26. Arboleda, L. M. C., & Nasser, N. (2006). Comparison of clus- from Janardan Rai Nagar
tering algorithms and protocols for wireless sensor networks. In Vidyapeeth University, Udaipur
Proceedings of IEEE CCECE/CCGEI, Ottawa, ON, Canada, in 2007 and Ph.D. degree in
7–10 May 2006, pp. 1787–1792. Computer Applications from
27. Kumarawadu, P., Dechene, D. J., Luccini, M., & Sauer, A. Punjab Technical University,
(2008). Algorithms for node clustering in wireless sensor net- Jalandhar in 2017. Her main
works: A survey. In Proceedings of 4th international conference area of interest and research are Wireless Sensor Networks, Under-
on information and automation for sustainability, Colombo, Sri water Sensor networks and Internet of Things. She has published/
Lanka, 12–14 December 2008, pp. 295–300. accepted/presented more than 25 papers in international jour-
28. Jiang, C., Yuan, D., & Zhao, Y. (2009). Towards clustering nals/conferences. She has worked on Big Data, Underwater Acoustic
algorithms in wireless sensor networks—a survey. In Proceed- Sensors and IoT to show the importance of WSN in IoT applications.
ings of IEEE wireless communications and networking confer- She received a young scientist award in February 2014 from Punjab
ence, Budapest, Hungary, 5–8 April 2009, pp. 1–6. Science Congress, in the same field.
29. Maimour, M., Zeghilet, H., & Lepage, F. (2010). Cluster-based
routing protocols for energy-efficiency in wireless sensor net- Syed Hassan Ahmed (SM’18) is
works. Sustainable Wireless Sensor Networks, INTECH, an Assistant Professor in the
167–188. Department of Computer Sci-
30. Lotf, J. J., Hosseinzadeh, M., & Alguliev, R. M. (2010). Hier- ence at Georgia Southern
archical routing in wireless sensor networks: A survey. In Pro- University, Statesboro, USA.
ceedings of 2010 2nd international conference on computer He is also leading Wireless
engineering and technology, Chengdu, China, 16–18 April 2010, Internet and Networking Sys-
pp. 650–654. tems (WINS) lab. Previously, he
31. Boyinbode, O., Le, H., & Mbogho, A. (2010). A survey on was a Post-Doctoral Fellow in
clustering algorithms for wireless sensor networks. In Proceed- the Department of Electrical and
ings of 2010 13th international conference on network-based Computer Engineering, Univer-
information systems, Takayama, Japan, 14–16 September, 2010, sity of Central Florida, Orlando,
pp. 358–364. USA. He completed his Bache-
32. Zhang, C., Liu, F., & Wu, N. (2014). A distributed energy-effi- lors in Computer Science from
cient unequal clustering routing protocol for wireless sensor Kohat University of Science &
networks. International Journal of Computational Information Technology (KUST), Pakistan and Master combined Ph.D. Degree
Systems, 10(6), 2369–2376. from School of Computer Science and Engineering (SCSE), Kyung-
pook National University (KNU), Republic of Korea (South Korea).

123
Wireless Networks

In summer 2015, he was also a visiting researcher at the Georgia University of Information Technology, Waknaghat, Solan, Himachal
Tech, Atlanta, USA. Overall, he has authored/co-authored over 170 Pradesh, India for almost 4 years. He has also taught and worked as
international publications including Journal articles, Conference department coordinator in Sharda University, Greater Noida, Uttar
Proceedings, Book Chapters, and 03 books. In 2016, his work on Pradesh, India for 4 years and Galgotias University, Greater Noida,
robust content retrieval in future vehicular networks lead him to win Uttar Pradesh, India for more than 2 years. At present, he is working
the Qualcomm Innovation Award at KNU, Korea. Dr. Hassan’s in University of Bisha, Bisha, Saudi Arabia. Research interests are in
research interests include Sensor and Ad hoc Networks, Cyber- the fields of Interconnection Networks, Stable Matching problems,
Physical Systems, Vehicular Communications, and Future Internet. Data Mining and Intelligence in systems, Internet of Things, Cloud
He is currently the Member of Board of Governors and IEEE VTS Computing.
liaison to IEEE Young Professionals society. From the year 2018, he
is also an ACM Distinguished Speaker.
Publisher’s Note Springer Nature remains neutral with regard to
jurisdictional claims in published maps and institutional affiliations.
Ravi Rastogi received his Ph.D.
degree in Computer Science and
Engineering in December 2011
from Uttarakhand Technical
University, Dehradun, Uttarak-
hand, India, M.S. in Computer
Science degree in September
2005 from Fairleigh Dickinson
University, Teaneck, New Jer-
sey, USA, Bachelor of Science
degree in 1999 from Ch. Charan
Singh University, Meerut, Uttar
Pradesh, India. He has worked
as database developer, in
Microsoft, Seattle, USA and
ING Philadelphia, USA. He has also taught and worked in Jaypee

123

You might also like