Thesis Report-ENERGY EFFICIENT CLUSTERING ALGORITHM BASED ON MAXIMUM LIKELIHOOD ESTIMATION IN WIRELESS SENSOR NETWORK

Thesis Report
CHAPTER-1
INTRODUCTION
1.1 OVERVIEW
Due to the increasing development of microelectromechanical system (MEMS), system on chip

(SOC), and embedded technology, the wireless sensor network has sprung up. Wireless sensor
network consists of numerous nodes integrated with micro sensors, microprocessors, and micro
communication modules constructed in self-organizing way. It is widely used in perceiving the
environmental temperature, pressure, and relative humidity, because of its low cost, huge
amount, and intensive distribution.
In practical applications, wireless sensor networks are generally deployed in severe
environments, which not only require the detective capability of the nodes, but also require the
system to work effectively for a long time. Since the nodes of WSN are very tiny, they will lead
to a series of restrictions, such as limited computing power, transmission distance, limited
amount of data, and limited node energy. The most prominent one of these problems is energy
restriction. Due to the characteristic of tiny size, large number of nodes, and poor environment
for deployment, it is almost impossible to replace battery manually. On the other hand, solar and
other new sources of energy are inappropriate to large-scale applications for considering
technology and cost. Therefore, in order to avoid reduction on the functionality of WSN,
applying efficient routing algorithm is one of the most important methods to save system power
and extend network lifetime.
Currently, the study of routing protocols for WSN topology control could be divided into three
main issues: the plane routing protocol, the hierarchical routing protocol [7], and the location-
based information routing protocol. In the plane routing protocol, all nodes have equal status.
Their network structure is simple, robust, and easy to realize. However, its drawbacks are
obvious, such as the lack of management node which makes it hard to optimize network
resources and slow response to network dynamic changes. Thus, this kind of protocol is not
suitable for the large-scale wireless sensor network. In the location-based information routing
protocol, nodes need to reserve their neighbor's locating information. The hierarchical routing
ECE DEPARTMENT, NITTTR, CHANDIGARH Page 1

Thesis Report
protocol divides nodes into different clusters, each of which consists of cluster head and cluster
members. The cluster members gather information and form a simple many-to-one
communication which does not need redundant routing information, and data are fused at the
cluster head. That means this protocol can reduce energy consumption and has good
expansibility.
WSN is an emerging field which combines the computation and communication and sensing into
a single device. WSN is also having an ability to adapt dynamic changes of the environment. The
major research area of the WSN includes the Data Fusion, Routing algorithm, distributed signal
processing and security in WSN.
1.2 EVALUATION METRICES FOR WSN SYSTEM
The WSN systems can be evaluated on the basis of different perimeters. These perimeters
include:
a. Network lifetime
b. Cost
c. Temporal accuracy
d. Ease of deployment
e. Response time
f. Security
A. Network lifetime: Each node in the network must be designed to manage the local supply of
energy to maximize the lifetime of the network.
B. Cost: The overall cost of the deployment is always demanded in order to maximize the use
of WSN for the monitoring of daily events.
C. Temporal accuracy: The WSN nodes must be able to cross co relate the samples in time, so
that exact measure should be forwarded to the end user.
D. Coverage: The coverage of the WSN nodes is beneficial when the nodes are distributed in all
the area to be monitored.
E. Response time: Response time should be fast whenever the WSN setup is for alarm oriented
application scenarios such as Fire Detection.

Thesis Report
F. Security: One of the important measure of the WSN network is security when the WSN is
installed for security oriented applications, the security becomes important.
G. Scalability: There should be no change in the performance whenever in future the new nodes
are added to the network.
A node can be evaluated on its individual perimeters. On the basis of these characteristics, a node
can be assigned different roles e.g. Leaf node, Cluster head node, Associate node etc. Basic
components of the node are:
a. Power source
b. Transceiver
c. Microcontroller
d. External memory
e. ADC and sensors
The perimeters of a node can be given as follows:
a) Flexibility: The node architecture must be flexible and adaptive. A node must be able to
adapt wide range of applications.
b) Robustness: In order to support lifetime requirements, each node must be as much as

robust. As a node is always demanded to work for years, it should be able to tolerate
individual failures.
c) Security: A node at individual level must be able to handle and perform encryption and
authenticating operations.
d) Communication: Key evaluation metric of the node is its communication. The

communication range of the node should be high which can ultimately enhance the
performance.
e) Computation: The CPU of the node must be able to fast decode and compute they arrived
data to increase the communication between the nodes at fast rate.
f) Size and Cost: The physical size and cost have a great impact on ease and cost of
deployment. Physical size of the node also impacts the overall deployment of the node.

Thesis Report
1.3 CLUSTERING
Clustering is the process of grouping of similar type nodes into clusters and then selecting a
Cluster-Head (CH) among the cluster. Members grouped in cluster are used to communicate with
their cluster head directly and through multi-hop routing. After communicating with the clusters,
the Cluster head (CH) than forward the calculated data to the Sink through other CHs .There are
mainly three phase during the High-Level approach of clustering algorithms that include of:
a) Formation of cluster phase ,

b) Selecting cluster heads or construction phase.
c) Phase of maintenance.
There are two type of clustering Algorithm used in Wireless Sensor Network. Distributed
Clustering (LEACH, PEGASIS, TEEN, HEED etc.) and Centralized Clustering (LEACH-C,
PEACH etc) Algorithm. Also, sometime Hybrid methods are used.
The thesis work proposed to design of a proper load balancing of all cluster head and an energy
efficient clustering algorithm for Wireless Sensor Network by Refining the Cluster head voting
and selection with extreme probability technique (Maximum Likelihood Estimation).
1.4 WIRELESS SENSOR NETWORK
Lately, remote interchanges and gadgets propels have empowered the low-power and little size
sensor hubs advancement. In a geographic zone, sending of countless sensor hubs comprised a
(WSN). There is a wide application and scope of Wireless sensor systems including combat zone
observation, shrewd home situations, creature's territory investigation and vehicle following.
There are three essential units in every sensor hub of a WSN; a detecting unit, a handling unit
and a correspondence unit. The different phenomenon like light, temperature, sound and
movement can be detected around it areas in the detecting unit [1]; then prepared by handling
unit and the detected information are packetized. At last the packetized information is send to a
base station by transmission unit. (also called sink hub conceivably by means of multihop
directing).
Among issues of many system plan, for example, steering conventions and information total in
which sensor vitality utilization and information transmission postponement is decreased,

Thesis Report
exceedingly imperative at the sensor hubs is the bundle booking since conveyance of information
parcels of various sorts is guaranteed by it on their need bases and decency with a base
dormancy. For example, for constant applications, the information detected has higher need than
for non-real time applications detected information. In spite of the fact that broad research for the
rest wake planning times of sensor hubs has been led [7], in writing their exist just couple of
studies on the bundle booking of sensor hubs [9] in which the accessible information parcels
preparing is planned at a sensor hub and the vitality utilizations is additionally diminished. In
fact, most Wireless Sensor Network (WSN) working frameworks existing uses First Come First
Serve (FCFS) [6] schedulers keeping in mind the end goal to prepare the information bundles of
their time landing and, in this way, an applicable base station (BS) requires the conveyance of
parcel of time.
1.5 POTENTIAL APPLICATIONS
WSN applications have been made by architects for different ranges including social insurance,
utilities, and remote checking. In human services, the likelihood of less intrusive patient
checking and medicinal services is made by remote gadgets. Many utilities of low-cost technique
are also offered by remote sensors, for example, streetlights and water municipals, the power
lattice, and for framework wellbeing information gathering for vitality use diminishment and
better dealing with the assets. An extensive variety of uses are secured by remote checking where
wired frameworks are supplemented with the remote frameworks with the wiring costs
diminishment and estimation utilizations of new sort are permitted. Uses of the remote observing
include:
• Environmental checking of air, water, and soil

• Structural checking for structures and extensions
• Industrial machine observing
• Process observing
• Asset following

Thesis Report
1.6 WSN SYSTEM ARCHITECTURE
Fig.1.3. WSN System Architecture Combines Wired and Wireless [52]
A few focal points are offered by remote innovation for the individuals who can construct wired
and remote frameworks and for the application, the best innovation preferences are taken.
1.7 WSN NETWORK TOPOLOGIES
The system topologies of one of the three sorts are regularly composed by WSN hubs. Every hub
in a star topology is associated specifically to a passage. Every hub in a bunch tree system is
associated with a hub higher in the tree and afterward to the portal, and from the most minimal
hub the information is directed on the tree to the door. At long last, expanded unwavering quality
is offered by the work systems highlight hubs in which different hubs are associated in the
framework and pass information is gone through the accessible most dependable way. Switch
alluded to this work interface.

Thesis Report
Fig. 1.4. Common WSN Network Topologies [53]
1.8 WSN NODE COMPONENTS
A few specialized segments are contained in a WSN hub including the battery, radio,
microcontroller etc. At the point when WSN radio innovation is utilized, critical exchange off
sought to be made. The utilization of higher radio information rates and more successive radio
devours more power in battery control frameworks. Frequently battery life necessity is three
years, so today numerous WSN frameworks are ZigBee based attributable to its low-control
utilization.
Battery is the second innovation thought for WSN frameworks. Notwithstanding long life
necessities, the size and weight is considered essentially of batteries and additionally worldwide
guidelines for delivery batteries and battery accessibility. The minimal effort and wide
accessibility of carbon zinc and soluble batteries settle on them a typical decision.
For the battery life expansion, a WSN hub awakens occasionally and transmitting information by
radio fueling and afterward vitality protection controlling it back off. Productively transmission
of a flag must be in WSN radio innovation and the framework is permitted to backpedal to lay
down with the utilization of insignificant power. This implies the included processor ought to

Thesis Report
ready to wake control up, and effectively coming back to rest mode. For WSNs, the microchip
patterns incorporate power utilization decrease while processor speed increment or upkeep.
Fig. 1.5. WSN Sensor Node Components [54]
1.9 SUMMARY
Clustering is a process of grouping a set of objects in such a manner that object in same or
similar group with each other than to other groups. The objects in same groups are termed as
cluster. Though there are several cons of existing Clustering Schemes however Clustering enable
significant resources allocation and also helps in better designing.

Thesis Report
CHATER-2
LITERATURE SURVEY
2.1 INTRODUCTION
Literature Reviewing is the process of finding scholarly paper. A literature review is the vast
information and knowledge stored data which has been established on particular topic taken from
several researchers and scholars. The main purpose of the literature review is to find how the
knowledge and ideas integrated on individual topic and also to find their merits and demerits of
study?
Literature review is the record of survey taken of scholar articles, survey of books and also other
sources which are convenient to issued subject, research area, brief description of the topic etc.
The goal of the literature review is the solution providing an overview of effective literature
published on given topic.
2.2 LITERATURE REVIEW

Nidal Nasar et al. [1] have suggested a Dynamic Multilevel Priority (DMP) parcel scheduling
plan. In the proposed plot, there are need lines of three levels in the WSN zone-based topology
of every hub, aside from the ones at the virtual chain of importance last level. The information
parcels are appropriated in different lines and in most noteworthy need line is the place constant
bundles are put. On a specific edge based other two lines of their assessed preparing time, the
non-constant bundles are put. Two lines are there in leaf hubs for ongoing and non-constant
information parcels since no information is gotten from alternate hubs and in this manner, end-
to-end defer is lessened. DMP bundle planning proposed conspire execution is assessed through
reenactments for ongoing and non-continuous information. The aftereffects of the reproduction
delineates the DMP parcel planning plan beating customary plans as in normal information
holding up time and end-to-end delay.
Gabriele Robert et al. [2] have discussed a asynchronous and distributed data clustering
algorithm implementation of the C-means which will allow the agents in a sensor network to

Thesis Report
partition themselves based on the observations (sensor data, positions, etc.) available at each
node. The method identifies some set of values that represent the observations. Therefore the
clusters formed are not mutually exclusive; each can belong to any cluster with different
intensity. The proposed method improves memory requirements, communication bandwidth and
algorithmic complexity.
Guihua Zhong et al. [3] have discussed K-mean clustering algorithm, on the basis of LEACH
research is done on a low energy consumption techniques. Using K-mean algorithm all sensor
nodes of WSN is divided into k cluster which will not change during the whole network life
cycle until and unless the energy level of the cluster head is lowered to some threshold level.
Transmission of data between cluster heads to sink node is a mixed model.ie, single hop for the
cluster which are near to sink node and multihop for the cluster which are far from the sink node.
The experiment shows that the proposed method is an effective clustering protocol and has long
life cycle and receives extra data.
Hui Xia et al. [4] have suggested an Energy Efficient Unequal Clustering with a Connected
Graph Theory for Wireless Sensor Network balancing the load between multiple cluster heads.
The proposed algorithm also save inter-cluster energy consumption during routing. The objective
was to optimize and innovates new algorithm in two aspects, first the election of cluster head and
secondly clusters routing. A voting based along with transmission power was taken into
consideration for cluster head election. Then the theory of connected graph was introduced for
inter-cluster data transmission during routing. The simulation results of the new algorithm
proved that, the energy consumption among sensor nodes is stabilized, link quality is improved
and influence of energy-hole problem is relieved. Moreover reliability and efficiency of data
transmission is also achieved along with significant prolonging of the network lifetime.
Yilin Mo et al. [5] have discussed that the WSN concedes at the base of tree topology with
combination focus. Each time, choosing a sensors subset for perceptions transmission to the
combination focus will attributable to a vitality spending impediment. A stochastic sensor
determination calculation is suggested that chooses arbitrarily sensors subset as indicated by
certain likelihood appropriation, which is composed perfectly for the minimization of the

Thesis Report
asymptotic expected estimation mistake covariance network. The issue of the ideal stochastic
sensor determination is casual leading into a curved enhancement issue and along these lines
proficiently comprehended.
Darshana S. Bhagwat et al. [6] have examines that in smaller scale producing innovation, it is
difficult to build up the minimal effort, low-control, multi-utilitarian sensor hubs for a remote
correspondence. The most basic issue in remote correspondence system is the system lifetime
increment by devouring constrained power in the system outlining. The issue of the improvement
in the remote sensor organize lifetime is managed by changing the transmission or detecting
scope of the sensor hubs with different procedures of sensor position. The system lifetime is
exceptionally subject to the game plan of the hubs that impacts the WSN vitality utilization. An
effective technique is sink migration which is utilized for the system lifetime augmentation
utilizing the DSR convention in which more battery vitality is maintained a strategic distance
from for a particular sensor hubs gathering.
Zhuxiu Yuan et al. [7] have suggested a rest booking calculation, specifically EC-CKN (Energy
Consumed consistently Connected K-Neighborhood) calculation, to delay the system lifetime.
The calculation EC-CKN in which the remaining vitality data of the hub is taken as the
parameter for choosing whether a hub is dynamic or rest, and accomplishing the k-associated
neighborhoods issue, likewise guaranteeing the k wakeful neighbor hubs having more leftover
vitality than other neighbor hubs at the present age. In light of the calculation EC-CKN, the state
move likelihood is acquired at the n'th age, and top and bottom bound of the system lifetime by
Markov chain and Markov choice chain.
Yu Gu et al. [8] have discussed that the sink portability for the system lifetime dragging out in
remote sensor systems (WSNs) bringing about the data delay by moving the sink ought to be
limited. In this paper, a brought together system is worked for joint sink versatility, steering,
delay, and so on examination. The arrangements are summed up and a polynomial-time ideal
calculation is proposed for the issue beginning. Moreover, unique directions impacts of the sink
are examined and essential bits of knowledge are accommodated portability plans outlining in
certifiable versatile WNNs.

Thesis Report
Wenzhong Guo et al. [9] have discussed a self-adjusted assignment planning system for WSNs.
In the first place, a multi-operator based engineering for WSNs and developing dynamic
partnership scientific model for the issue of errand designation is developed. At that point a
viable discrete molecule swarm improvement (PSO) calculation for the dynamic cooperation
(DPSO-DA) with a very much outlined molecule position code and wellness capacity is
proposed. In this calculation, the calculation's capacity of worldwide hunt and populace assorted
qualities is enhanced productively with the utilization of a change administrator.
Peng Guo et al. [10] have discussed that, basic occasion observing is engaged in remote sensor
systems (WSNs), where there is a requirement for transmitting just few bundles more often than
not. At the point when a basic occasion happens, an alert message ought to be communicating to
the whole system as quickly as time permits. For system lifetime drawing out, utilizing some rest
booking techniques in WSNs, noteworthy bring about communicating delay, particularly in vast
scale WSNs. In this paper, a novel rest booking technique is proposed for the defer decrease of
alert telecom in WSNs from any sensor hub. In particular, the two decided movement ways are
intended for the alert message transmission, and level-by-level counterbalance based wake-up
example as per the ways, separately. At the point when a basic occasion happens, rapidly
transmitting the alert along one of the activity ways to a middle hub, and after that the inside hub
quickly communicate along another way without impact. Hence, the huge two commitments are
that the free communicating deferral of the hubs thickness and its vitality utilization is ultralow.
Yaxiong Zhao et al. [11] have reported, a novel rest booking strategy Virtual Backbone
Scheduling (VBS). For wireless sensing networks plans VBS has excess sensor hubs. VBS
shapes numerous covered spines working on the other hand for the system lifetime drawing out.
In VBS, spine sensor hubs forward the activity, and whatever is left of the sensor hubs kill their
radios to spare vitality. The numerous spines pivot ensures that all sensor hubs vitality utilization
is adjusted, which uses vitality completely and a more drawn out system lifetime is accomplished
when contrasted with the current methods. The VBS booking issue is figured as the Maximum
Lifetime Backbone Scheduling (MLBS) issue. Since the MLBS issue is NP-hard, proposing the
guess calculations in view of the Schedule Transition Graph (STG) and Virtual Scheduling
Graph (VSG). An Iterative Local Replacement (ILR) plan is displayed as a disseminated usage.

Thesis Report
Soumyadip Sengupta et al. [12] have suggested on the web, multiobjective streamlining (MO)
calculation which proficiently plan the remote sensor organize (WSN) hubs and for most
extreme lifetime accomplishment. Rather than conventional framework or uniform scope
managing, the primary concentrate is on the separated or probabilistic scope where detecting of
various levels are required by various areas. A superior tradeoff is achieved with the assistance
of MO calculation among vitality utilization, lifetime, and scope. This planning is displayed as a
combinatorial, multiobjective, and obliged enhancement issue with vitality and no coverage as
the two goals. The fundamental developmental multiobjective analyzer utilized is known as
decay based multiobjective transformative calculation (MOEA/D) and it is an idea of fluffy
Pareto predominance coordinated change. The subsequent calculation execution, which is called
MOEA/DFD, is contrasted and the execution of the first MOEA/D, which is another
exceptionally surely understood MO calculation called non-commanded sorting hereditary
calculation (NSGA-II), and an IBM streamlining programming bundle called CPLEX.
Emanuele Toscano et al. [13] have suggested a Multichannel Super frame Scheduling (MSS)
calculation, a novel procedure which stays away from guide crashes by booking super frames
over various radio channels, while every one of the groups availability upkeep. The paper depicts
the MSS calculation and locations the favorable circumstances it gives over the time-division
super frame booking. The schedulability space is enhanced by giving a quantitative estimation as
appeared in the explanatory outcomes.
Baljeet Malhotra et al. [14] have discussed that the total converge cast booking issue is
considered in remote sensor systems. As it is watched that a two stage approach is particularly
embraced by existing plans, a tree development is first and, a planning stage is second. Taking
after a comparative approach, the two new upgrades are proposed, one to each of the two stages.
Beginning with another lower bound on the calendar length, we make utilization of it in the tree
development step. The arrangements comprised in the tree development venture for examples of
bipartite chart semi-coordinating. The booking step is a weight-based need plot which obeys
reliance (tree) and obstruction limitations.

Thesis Report
Shuguang Xiong et al. [15] have discussed the heap adjusting issue, and demonstrates it is NP-
Complete when all is said in done system diagrams. For accomplishing the heap adjusting, the
two productive planning calculations are proposed and broke down. Besides, outlining an errand
planning convention which depends on the proposed calculations. This paper is the first which
handles numerous errand planning for low-obligation cycled sensor systems.
Hongseok Yoo et al. [16] have suggested two novel dynamic duty cycle planning plans (called
DSR and DSP) for the lessening of rest inactivity in which adjusted vitality utilization is
accomplished in remote sensor systems (WSNs) among sensor hubs with the ability of vitality
reaping. The DSR, enable every sensor hub to modify its obligation cycle as indicated by the
leftover vitality current sum. Since the leftover vitality hubs in vitality gathering WSNs after
some time because of their collecting opportunity can build, the forthcoming estimation
increment in their remaining vitality is valuable for objective accomplish.
M. Emre Keshkin et al. [17] have suggested a numerical model in which the choices of WSN
configuration are coordinated on action plans, sensor places, information courses, the portable
sink direction and afterward the two heuristic techniques are available for the model
arrangement. The heuristics exactness and proficiency is exhibited on a few haphazardly issue
examples created on the broad numerical trials bases.
Chunsheng Zhu et al. [18] have discussed two perceptions for WSNs novel communitarian area
based rest booking (CLSS) plans coordinates with MCC. In view of the versatile client’s areas,
powerfully CLSS decide the sleeping or wakeful status of every sensor hub for the lessening in
the coordinated WNS vitality utilization. Especially, CLSS1 concentrates on boosting the vitality
utilization sparing of the incorporated WSN vitality utilization while CLSS2 considers the
coordinated WSN heartiness and adaptability. Recreation and hypothetical outcomes
demonstrate both CLSS1 and CLSS2 for WSNs incorporates with MCC can drag out the WSN
lifetime while the portable clients information solicitations is being fulfilling.
Prerana Shrivastava et al. [19] have discussed on two noteworthy viewpoints. One is the
development of information social event tree and the other is the vitality effective booking. Here

Thesis Report
they have proposed a planning system which makes utilization of TDMA and calendars the
exercises of a subset of sensors into various gatherings with progressive schedule openings
consequently lessening the state move and thus the vitality utilization. The proposed planning
calculation has been reenacted in NS-2.32 and the execution has been assessed on the different
execution measurements of Wireless Sensor Networks. The reenactment result demonstrates that
our proposed booking system enhances the execution measurements like Delivery Ratio and
Energy when contrasted with the customary strategy for planning.
Felix Dobslaw et al. [20] have discussed SchedEx, a nonspecific heuristic planning calculation
augmentation which ensures a client characterized end-to-end dependability. SchedEx produces
aggressive timetables to the current approach, and it does that reliably more than a request of
greatness quicker. The harsher the end-to-end unwavering quality request of the system, the
better SchedEx performs contrasted with the Incrementer. They additionally demonstrate that
SchedEx has an all the more equitably disseminated change effect on the booking calculations,
while the Incrementer favors plans made by certain planning calculations.
Chih-Cheng Hsu et al. [21] have discussed designing of a lifetime-amplification steering in

remote sensor systems which represents an incredible test fundamentally because of
untrustworthy remote connections and constrained power supply. As of late, two characteristic
favorable circumstances of pioneering steering, i.e., way assorted qualities and the change of
transmission unwavering quality, are misused to build up a lifetime-developed artful directing
for remote sensor systems. In addition, offbeat rest wake booking is a viable system to lessen
vitality utilization by properly orchestrating sensor hubs to rest. Reproduction comes about
demonstrate that ASSORT successfully accomplishes organize lifetime augmentation contrasted
and other steering plans.
Jianping He et al. [22] have suggested multiperiod planning to amplify add up to network utility
by considering vitality imperatives and intermittent detecting necessities. This NUM issue
presents testing blended whole number programming, and it is hard to fathom by utilizing a
concentrated approach under entire data. Along these lines, they initially rearrange the
multiperiod issue to a proportionate single-period issue, and afterward additionally lessen it to an

Thesis Report
immaculate number programming issue, which can be tackled effortlessly centralized.

Concerning the cases without a unified organizer among all sensors, the paper proposed a normal
accord based conveyed calculation (ACDA) to distributive plan the work methods of all sensors
utilizing just neighborhood data. They demonstrate that ACDA merges exponentially quickly
and achieves worldwide ideal the length of the vitality utilization of running the calculation is
unimportant. The proposed dispersed arrangement is additionally strong against parcel drop, hub
disappointments, and the progressions of correspondence topology. Broad reproduction comes
about have additionally demonstrated the viability of the proposed circulated calculations.
Alvin C. Valera et al. [23] have suggested the different wakeup scheduling plans, with
concentrate on their appropriateness for EPWSNs. A characterization plan is proposed to
describe existing wakeup booking plans, with three primary classifications, to be specific,
nonconcurrent, synchronous, and half and half. Each wakeup booking plan is displayed and
talked about under the proper class. The paper closes with open research issues.
Chensheng Zhu et al. [24] have a brief discussed on the rest booking of geographic directing in
obligation cycled wireless network sensors with versatile sensor. It also gives a suggestion on the
basis of GCKN which stands for geographic remove k neighboring for rest calculation planning.
Firstly there is a representation of calculation on the basis of GCKN for GCKNF where F stands
for first way secondly on all ways. Then after there is a hypothetical examination of the
discussed outcomes the result after examination shows that proposed sensor can complete
quickly and in shorter distance as compare to WSNs utilizations.
Yang G. Kim et al. [25] have suggested that efficient booking winds up plainly fundamental if
different channels and schedule vacancies are used. Ideal planning of numerous diverts and
availabilities in multihop systems is a NP-finish issue. They apply metaheuristic ways to deal
with take care of the planning issue on account of the way that the worldwide arrangement as
well as close ideal arrangements can fulfill an offered end-to-end defer bound. They embrace
reproduced tempering (SA) and molecule swarm advancement (PSO) to plan the assets.
Distinctive measures and ceasing conditions are investigated to approve the plausibility of

Thesis Report
booking by means of SA and PSO, and to think about the execution of the two metaheuristics in
fulfilling the coveted end-to-end delay.
Santar Pal Singh et al. [26] have reported that keeping this in mind, that performance of sensor
is depend upon routing protocol the author have carried out an extensive survey on WSN routing
protocols. Routing protocol in WSN is classified into 3 categories 1) flat 2) based on cluster 3)
based on location routing on the basis on structure of networks. Due to certain advantages,
clustering is flattering as an active stem in routing technology. In this paper, authors have been
reported a comprehensive survey on cluster based routing protocols in WSNs.
M. Chatterjee et al. [27] have suggested a clustering algorithm based on weight by associating
each sensor with some weight. To calculate the weight of each sensor the sensors basic
characteristics of nodes are taken in to consideration, the basis properties are power transmission,
mobility etc. From these nodes Cluster heads with minimum weights among their neighbors are
selected. The proposed Weight Clustering Algorithm uses single-hop routing.
Younis, O. Fahmy et al. [28] have suggested that in Hybrid Energy Efficient Distributed
Network formation of cluster head in a sensor depends upon sensor remnant energy. Sensor has
the double tendency to become clusterhead which are not approached by cluster heads. In the
radius of multiple cluster heads sensors select the CH that has AMRP. Similar to Low Energy
Adaptive Clustering Hierarchy where each sensor communicates with cluster head for the
purpose of collecting data from multi hops cluster communicate with each other in an intra-
structure.
Cheng-Fa Li et al. [29] have discussed EEUC which stands for energy efficient unequal
clustering method for collecting information in WSN. A un-equal-clustering technique and multi
hop routing is used for the organization purpose of networks. EEUC is used where inter-cluster
data transmission is done by the cluster head selecting a relay node with more remnant energy.
Md Azharuddin et al. [30] has concluded that there is a suggestion on PSO based clustering and
routing techniques in wireless networks. Here energy consumptions and sensor nodes of

Thesis Report
gateways are in under observation of technique of clustering on the other hand routing
techniques are constructing tradeoff between energy efficiency and balancing. For given
techniques there is an integrated efficient codding scheme and functions are given by author.
Qi-Ye Zhang et al [31] have suggested a clustering routing protocol CRT2FLACO for wireless
sensor network on the basis of type-2 fuzzy logic and ant colony optimization (ACO), First to
handle uncertainty and balancing of the network load and T2MFLS is built in the cluster set-up
phase. The three important factors— the distance of the base station (BS) to a node, the residual
energy of the node and the number of neighbor nodes assumed as input and node probability as
cluster head and fro output we assume competition radius. This formation of chain helps to
decrease the consumption of transmission during the steady-state phase. Then after with a link
cluster head sends data to its leader that is a cluster head transmitting packets to BS.
Zhixin Liu et al [32] have discussed a novel joint optimization for the protection of cluster head.
In this paper to realize variable separation and computing distribution a dual decomposition
method is considered. Simulated result shows that proposed algorithm used to converge optimal
power allocation and transmission rate.
Ramegowda K et al [33] have discussed on clustering function, its merits, demerits, applications
and several classifications. With the help of this work we can verify the capability of WSNs and
it technique of clustering. The main objective of clustering technique is to design and manage
WSNs effectively and significantly.
Daisuke Takaishi et al [34] have suggested a novel mobile sink data gathering and routing
technique through network clustering algorithm based on modified expectation-maximization
technique. There are number of cluster which can minimize the energy consumption is derived in
the given algorithm. Verification of the result of introduced technique is done through numerical
results.
Kanika Uday et al [35] have discussed the application of Maximum Likelihood Estimation
(ML) algorithm for the cluster head selection with an unequal clustering protocol. In wireless

Thesis Report
sensor network it is generally found that each of the sensor node has their own limitation of
power source which is generally not rechargeable. Therefore, an energy efficient clustering,
routing and transmission scheduling has been always a priority that reduces the energy hole
problem and increase the network lifetime.
Morteza M. Zanjireh et al [36]. Have suggestion that WSNs has the wide range of applications
and then he obtain effective concern over past decade due to its rapid advancement in technology
and adaptive nature. To clarify authors make a survey on wide range having centralized and
distributed clustering and techniques used in WSNs.
Sumit Kumar et al. [37] have discussed that there is a wide application range of wireless sensor
networks (WSN) such as traffic analysis, environmental monitoring, etc. and there future civilian
and military application increasing importance. But the challenging task is the MAC layer
protocol designing for wireless sensor network owing to battery power and bandwidth
limitations. So, at MAC layer level both the problems are solved by using Time Division
Multiple Access Protocol. Thus, for wireless sensor networks, TDMA protocol with various
scheduling method having different objective are proposed. In this paper, the crucial sensor
network properties are outlined for the TDMA protocols designing and then, the proposed
TDMA protocols for sensor networks are described.
Daisuke Takaish et al. [38] have suggested a mobile sink routing and data gathering techniques
for collecting large data. There is an investigation on the problems rises during the collection of
large data. The investigation shows the necessity of energy efficiency in collection of large data.
There is an increase in number of additional challenges but also reduce the energy consumption
of sensor nodes. For the solution of such problems a new clustering method on the basis of
modified expectation- maximization technique is proposed.
Hiu Chan et al. [39] have suggested a new routing algorithm that optimize the energy
efficiency. The new algorithm saves energy by reducing the number and total transmissions
distance. The author suggested that energy efficiency is affected by scaling, i.e. different network
sizes, and by different routing algorithms. Single hop is good for small scale networks and for

Thesis Report
medium and large scale networks; multiple hop transmission is more suitable. It was also
suggested that routing with energy efficient distance path is better than the shortest distance to
the next hop algorithm. Through simulations result it was found that the proposed routing
algorithm performs better in medium and large scale wireless sensor networks.
Lusheng Hai et al. [40] have suggested a new clustering protocol called FSC (fan-shaped
clustering) from the partition of large data into F-shaped cluster. At the same time different
energy scheme like locality of re-clustering, hotspot solution, efficient cluster head selection and
relay selection is also proposed. The proposed FSC Clustering protocol localized the re-
clustering process that reduces signaling cost and then simple and robust routing strategy was
applied. Central area cluster head (CH) selection was introduced to enable good performance.
The analysis demonstrated that the proposed FSC (fan-shaped clustering) is energy efficient.
Cheng-Xu et al. [41] have proposed on the basis of received signal strength indicator a node
self-localization technique is introduced. Here we consider ACLA and APIT methods. In this
paper we integrated new algorithm by optimizing co-efficient of the weighted centroid. APIT is
used for non-idealized problem just to select r choose triangle for localization. The simulated
result shows that improved algorithm has less localized error as compare to RSSI algorithm.
Kristalina et al. [42] have discussed the description of proposed algorithm i.e. centroid
algorithm. There is an improvement of algorithm and this improved algorithm is termed as
improved connectivity based centroid. Simulated result shows that proposed algorithm gives
better performance in improvement of error position.
Chen et al. [43] have discussed and suggested a suggestion for wireless sensor networks i.e. DV-
Hop localization technique. In this paper second and third step is improved of given technique
which helps in integrating precision in localization. In second steps hop sizes for every anchor is
received by normal nodes then after calculation of average hop sizes are calculate and in step
third to calculate location of nodes we use 2-D hyperbolic function rather than multilateration.

Thesis Report
Pan et al. [44] have reported the description of DV-hop and discussion on demerits of the
proposed algorithm. Finally the proposed new algorithm is described. The algorithm is improved
by doing improvement in minimum number of hops, by improving the average distance, and by
improving the calculation of unknown coordinates. While comparison we make a result which
shows that proposed improved algorithm is better than original one in terms of accuracy and
precision.
Nguyen et al. [45] have suggested a distributed range-free localization technique based on hop
counts. In the proposed technique anchor node are assumed as reference point to give binary
classifications for each known nodes. Dijkstra algorithm is used to calculate the shortest path
from anchor nodes to other normal nodes. The author did Monte Carlo simulation for evaluation
of the proposed algorithm. The simulation result showed proposed algorithm outperformed the
DV and DHI methods.
Kumar et al. [46] have suggested and introduces an advanced DV-Hop localization technique.
The paper first discussed about DV-Hop and then about improved DV-Hop algorithm. To
determine distance of unknown nodes hop size of anchor node are used by given technique. Then
after there is a reduction in the inherent error in an estimated distance. Least square method is
used to integrate the localization of accuracy weighted. At last by using extraneous information
we determine the location of unknown nodes. Simulated result demonstrated that proposed
algorithm is superior to DV-Hop.
Sangwoo et al. [47] have suggested and discussed on the shape of the smallest path of two
anchor node of individual node and then after there is an estimation of the shortest distance of
anchors node. As the outcomes from the discussed approach accuracy in estimating distance is
increases and has better performances.
Gajbhiye et al. [48] have concluded with a representation in the characteristics of the
environment where we deploy sensor networks. This node deployment is depending upon the
application of networks. Main criteria in both cases are coverage of area. In this paper there is
also a description of routing protocol of WSNs.

Thesis Report
Niculesu et al. [49] have proposed a DV-Hop technique on the basis of metric hop count. This
given algorithm is splitter into 3 parts. Where every receiving node maintains the less amount of
hop count to every anchor node which is the first step of the proposed algorithm. In second step
there is a calculation of anchor node to entire network. We can obtain the distance of anchor
nodes by receiving first hop count. At last there is a computation of location by tri-literation.
Boonsongsrikul et al. [50] have discussed and concluded a survey of energy efficient
consumption approaches in WSN. Active research of efficient energy consumption is divided
into data aggregation, tree construction and energy harvesting in wireless sensor networks. This
paper also provides comparison, possibilities and challenges of effective energy consumption
approaches in a variety of applications by wireless sensor networks.
2.3 INFERENCES FROM LITERATURE SURVEY

1. Cluster size and taxonomy are same which does not depend on the sink position.
2. Cluster head are defined by voting scheme only, which was solely depended on the
density of nodes.
3. Routing process was random that mainly depended on the nodes distance.
4. Cluster head is optimized but ignores the data transfer capacity of nodes.
5. Therefore, the investigation in this thesis will be oriented toward the design of a proper
load balancing of all cluster head.
2.4 PROBLEM DEFINITION

1. Improving the energy hole problem by unbalanced cluster.
2. Reducing the static dependency for making the cluster head, this was solely depended on
the density of nodes.
3. Refining the Cluster head voting with extreme probability technique (Maximum
Likelihood Estimation).

Thesis Report
2.5 PROPOSED WORK OBJECTIVES
The main aim of this thesis work is to develop energy efficient clustering algorithm for WSN in
order to obtain the following objectives:
1. To improve the network lifetime.
2. To improve the load balancing of multiple cluster head (unbalanced cluster) thus reducing
energy hole problem.
2.6 DESIGN METHODOLOGY
The proposed method uses the Maximum Likelihood Estimation Algorithm along with the
existing voting Scheme. The simple flowchart for the Maximum Likelihood Estimation is
shown in Fig. 2. During the voting Scheme the cluster head is formed if there is no controversial
among the nodes based on maximum votes gained otherwise Maximum Likelihood Estimation
is used to resolve the situation based on given condition of maximizing the allowed attributes
which can be centrality, Residual Energy or etc. This paper proposed the centrality of node as a
criterion for CH selection. The proposed algorithm includes the following steps:
1. The proposed work begun with the understanding of the clustering and previous work
done on clustering algorithm and protocols by doing extensive literature survey.
2. The proposed Algorithm is developed for Clustering of sensor nodes with improved load
balancing and energy reduction with different number of rounds.

Thesis Report
Start
Deploy the WSN Nodes
MakSelect the cluster head
Select Initialize cluster head by degree
Initialize cluster head by degree
Use voting Scheme
Decision Problem
No
Yes
Predict by Maximum Likelihood
Make cluster and cluster head
Analyze Parameter
End
Fig.2.7 Proposed Methodology Flowchart

Thesis Report
2.7 EXPECTED OUTCOME

Amount of cluster will increases the number of cluster heads in WSNs. By using long-distance
transmission cluster heads transmitted the aggregated data to sink whereas small number clusters
leads to cluster having large radius and large energy is consumed by individual cluster during
inter-cluster transmission from Cluster Members (CMs) to Cluster Heads (CHs). Distribution of
cluster heads should be uniform.
In this thesis work, centrality based unequal clusters which are able to change energy losses by
load is used. The cluster head reduces the energy losses by dynamic selecting the cluster and
inter change according to its energy and distance. Thereby it is expected that this algorithm will
increase network lifetime and improve the load balancing.
Table 2.7 WSN Clustering Algorithms
S/L Clustering Types

No Algorithms
a PDCM- Pegasis Double Cluster Head
PEGASIS- Power Efficient Gathering in Sensor
1 Grid Schemes b
Information System
c GAAG- Group- average and average- link clustering
a PSO-C- Particle Swarm Optimization-Centralized

PSO-Based b MST-PSO- Minimum Spanning Tree-PSO
2
Scheme PSO-Clustering- Particle Swarm Optimization
c
clustering
a LEACH- Low Energy Adaptive Clustering Hierarchy

Hierarchical b EECS- Energy Efficient Clustering Scheme
3
Scheme c HEED- Hybrid Energy Efficient Distributed
d EEUC- Energy Efficient Unequal Clustering Scheme
a LCA- Linked Cluster Algorithm

Heuristic b H-Connectivity- Highest-Connectivity
4
Scheme c LCA-2- Linked Cluster algorithm-2
d Max-Min D Cluster- Max-Min ‘d’ Distance Clustering

Thesis Report
CHAPTER 3
MAXIMUM LIKELIHOOD ESTIMATION
3.1 INTRODUCTION
The principle of maximum likelihood is relatively straightforward. For example if we take
before we begin with a sample X = (X1,...,Xn) of random variables chosen according to one of a
family of probabilities Pθ. In addition, f(x|θ), x = (x1,...,xn) will be used to denote the density
function for the data when θ is the true state of nature.
Then, the principle of maximum likelihood yields a choice of the estimator θˆ as the value for
the parameter that makes the observed data most probable.
Definition: The likelihood function is the density function regarded as a function of θ.
L(θ|x) = f(x|θ), θ ∈ Θ. (3.1)
The maximum likelihood estimator (MLE),
θˆ(x) = argmaxL(θ|x). (3.2)
θ
It is known that especially for large samples, the maximum likelihood estimators have many
desirable properties. However, especially for high dimensional data, the likelihood can have
many local maxima. Thus, finding the global maximum can be a major computational challenge.
This class of estimators has an important property. If θˆ(x) is a maximum likelihood estimate for
θ, then g(θˆ(x)) is a maximum likelihood estimate for g(θ). For example, if θ is a parameter for
the variance and θˆ is the maximum likelihood estimator, then square root θ is the maximum
likelihood estimator for the standard deviation. This flexibility in likelihood estimator, then θ
estimation criterion seen here is not available in the case of unbiased estimators.
Typically, maximizing the score function, lnL(θ|x), the logarithm of the likelihood, will be
easier. Having the parameter values be the variable of interest is somewhat unusual, so it is
better to look at several examples of the likelihood function.
Examples
a) (Bernoulli trials). If the experiment consists of n Bernoulli trial with success probability p,
then

Thesis Report
L(p|x) = px1(1 − p)(1−x1) ···pxn(1 − p)(1−xn) = p(x1+···+xn)(1 − p)n−(x1+···+xn). (3.3)
(3.4)
This equals zero when p = ¯ x.
b) (Normal data). Maximum likelihood estimation can be applied to a vector valued parameter.
For a simple random sample of n normal random variables, we can use the properties of the
exponential function to simplify the likelihood function.
L .(3.5)
The score function
. (3.6)
(3.7)
Because the second partial derivative with respect to µ is negative,
µˆ(x) = ¯ x (3.8)
is the maximum likelihood estimator. For the derivative of the score function with respect to the
parameter σ2,
. (3.9)
Recalling that µˆ(x) = ¯ x, we obtain
. (3.10)
Note that the maximum likelihood estimator is a biased estimator.

Thesis Report
c) (Lincoln-Peterson method of mark and recapture). Let’s recall the variables in mark and
recapture:
• t be the number captured and tagged,

• k be the number in the second capture,
• r the the number in the second capture that are tagged, and let
• N be the total population.
Here t and k is set by the experimental design; r is an observation that may vary. The total
population N is unknown. The likelihood function for N is the hypergeometric distribution.
(3.11)
We would like to maximize the likelihood given the number of recaptured individual’s r.
Because the domain for N is the nonnegative integers, we cannot use calculus. However, we can
look at the ratio of the likelihood values for successive value of the total population.
(3.12)
0.2 0.3 0.4 0.5 0.6 0.7 0.2 0.3 0.4 0.5 0.6 0.7
p p

Thesis Report
0.2 0.3 0.4 0.5 0.6 0.7 0.2 0.3 0.4 0.5 0.6 0.7
p p
Fig.3.1 Likelihood function (top row) and its logarithm, the score function, (bottom row) for
Bernoulli trials. The left column is based on 20 trials having 8 and 11 successes. The right
column is based on 40 trials having 16 and 22 successes. Notice that the maximum likelihood is
approximately 10−6 for 20 trials and 10−12 for 40. In addition, note that the peaks are narrower
for 40 trials rather than 20. We shall later be able to associate this property to the variance of the
maximum likelihood estimator.
N is more likely that N −1 precisely when this ratio is larger than one. The computation below
will show that this ratio is greater than 1 for small values of N and less than one for large values.
Thus, there is a place in the middle which has the maximum. We expand the binomial
coefficients in the expression for L(N|r) and simplify.
(3.13)
.
Thus, the ratio
(3.14)

Thesis Report
exceeds 1if and only if
(3.15)
Writing [x] for the integer part of x, we see that L(N|r) > L(N −1|r) for N < [tk/r] and L(N|r) ≤
L(N −1|r) for N ≥ [tk/r]. This give the maximum likelihood estimator
. (3.16)
Thus, the maximum likelihood estimator is, in this case, obtained from the method of moment’s
estimator by rounding down to the next integer.
Let look at the example of mark and capture from the previous topic. There N = 2000, the
number of fish in the population, is unknown to us. We tag t = 200 fish in the first capture event,
and obtain k = 400 fish in the second capture.
> N<-2000
> t<-200
> fish<-c(rep(1,t),rep(0,N-t))
> k<-400
> r<-sum(sample(fish,k))
>r
[1] 42
In this simulated example, it is found r = 42 recaptured fish. For the likelihood function, we
look at a range of values for N that is symmetric about 2000. Here, Nˆ = [200 · 400/42] = 1904.
> N<-c(1800:2200)
> L<-dhyper(r,t,N-t,k)
> plot(N,L,type="l",ylab="L(N|42)")
d) (Linear regression). Our data are n observations with one explanatory variable and one
response variable. The model is that
(3.17)

Thesis Report
Likelihood Function for Mark and Recapture
1800 1900 2000 2100 2200
Fig. 3.2 Likelihood function L(N|42) for mark and recapture with t = 200 tagged fish, k = 400 in
the second capture with r = 42 having tags and thus recapture. Note that the maximum
likelihood estimator for the total fish population is Nˆ = 1904.
where there are independent mean 0 normal random variables. The (unknown) variance is σ2.
Thus, the joint density for them is:
(3.18)
Since , the likelihood function
. (3.19)
The score function
. (3.20)
Consequently, maximizing the likelihood function for the parameters α and β is equivalent to
minimizing

Thesis Report
. (3.21)
Thus, the principle of maximum likelihood is equivalent to the least squares criterion for
ordinary linear regression. The maximum likelihood estimators α and β give the regression line
yˆi = αˆ + βxˆ i. (3.22)

Exercise 7. Show that the maximum likelihood estimator for σ2 is
. (3.23)
Frequently, software will report the unbiased estimator. For ordinary least square procedures,
this is
. (3.24)
For the measurements on the lengths in centimeters of the femur and humerus for the five
specimens of Archaeopteryx, we have the following R output for linear regression.
> femur<-c(38,56,59,64,74)
> humerus<-c(41,63,70,72,84)
> summary(lm(humerus˜femur))
Call: lm(formula = humerus ˜

femur)
Residuals:
1 2 3 4 5
-0.8226 -0.3668 3.0425 -0.9420 -0.9110
Coefficients:
Estimate Std. Error t value Pr(>|t|) (Intercept) -
3.65959 4.45896 -0.821 0.471944 femur 1.19690 0.07509
15.941 0.000537 ***
---

Thesis Report
Signif. codes: 0 *** 0.001 ** 0.01 * 0.05 . 0.1 1
Residual standard error: 1.982 on 3 degrees of freedom

Multiple R-squared: 0.9883,Adjusted R-squared: 0.9844
F-statistic: 254.1 on 1 and 3 DF, p-value: 0.0005368
The residual standard error of 1.982 centimeters is obtained by squaring the 5 residuals,
dividing by 3 = 5−2 and taking a square root.
Example 8 (weighted least squares). If we know the relative size of the variances of the i, then
we have the model
(3.25)
where the i are, again, independent mean 0 normal random variable with unknown variance σ2.
In this case,
(3.26)
are independent normal random variables, mean 0 and (unknown) variance σ2. the likelihood
function
L (3.27)
where w(x) = 1/γ(x)2. In other words, the weights are inversely proportional to the variances.
The log-likelihood is
. (3.28)
The thesis work is focused on improving the reduction in the cluster head energy losses by
dynamically selecting the cluster and inters changes according to its energy and distance. For the
simulation of the algorithm the region for the network is assumed as 500 x 500 m2. 200 sensors
are randomly dispersed into 500 x 500 m2. There is a generation of location of 20 distinct nodes
and saved during each experiments. On each location set, a 100 independent experiment was

Thesis Report
performed and outcomes are obtained showing improvement in the network lifetime and
stability. The following parameters were analyzed after the simulation results:
1. Number of Cluster generated.

2. Clusters distribution in round
3. Network lifetime with nodes and
4. Network lifetime with Rmax.
3.2 ALGORITHM
The vertices within a graph play an important role to identify the indicators of centrality in graph
theory and network analysis. Identification of person in social networks, key infrastructure nodes
in inter are the application of given concept. The idea of centrality concept is integrated very first
in social networks analyses that are why therefore terms used to measure centrality reflect
their sociological origin. There is no confusion with node influence metrics.
3.3 TYPES OF CENTRALITY

i. Degree Centrality
ii Closeness Centrality
iii Betweenness Centrality
iv. Eigenvector Centrality
v. Katz Centrality
vi. PageRank Centrality and
vii. Precolation Centrality
3.4 DEGREE CENTRALITY
Degree centrality is termed as the number of connections occurrence over a node. The degree can
be estimated as far as the impending danger of a node for discovering whatever is moving
through the network, (for example, an infection, or some data). On account of a directed network
(where ties have heading), two different types of degree of centrality measure is characterized.
At the point when binds are related to some positive perspectives, for example, companionship

Thesis Report
or coordinated effort, in-degree is regularly translated as a type of ubiquity, and out-degree as

gregariousness (instinctively or temperamentally seeking the company of others nodes).
For a given graph U =(S, P) with |S| stands for vertices and |E| stands for Edges.
The degree centrality of a vertex is given as:
ZA (s) = deg(s) (3.4.1)
For all the nodes in a graph of a dense adjacency matrix representation
ᶱ (s2) is taken for calculating the degree of centrality
ᶱ (P) is taken for edge in a sparse matrix representation.
The understanding of degree of centrality on a node level can be used to the whole graph,
Let (S*) be the node with highest degree centrality in U.
Let H= (J, T) be the |T| node connected graph which maximizes the following quantity
| |
K=∑ Z b∗ −Z y (3.4.2)
Correspondingly, the degree centralization of the graph G is as follows:
|!|
∑"#$ ∗
C G = %
(3.4.3)
When the graph H contains one central node to which all the other nodes are connected, the
value of K is maximized, and in this case it is given by:
K = (m-1). ((m-1)-1) = m2 -3m+2 (3.4.4)
3.5 LIKELIHOOD ALGORITHM
Step1: Wr = posterior distribution of c(i) given h(i) and parameter &

EM algorithm Repeat until convergence
Sep 2: For each r
Wr (c (r) ) = f (c (r) | h (r) ; ') (3.5.1)

Thesis Report
) - . , 1 ;3
H = arg max ∑ r ∑ (c ) Wr (c (r))log (3.5.2)
4 1
This algorithm will converge, since l ((l)) ≤ since l ((l+1))
3.6 SUMMARY
There are many clustering algorithm to form cluster head such as C-Mean, K-Mean etc. In K-
Mean it is very difficult to predict the K-value and it does not work well with non-globular
clusters. C-Mean is effective but the resulting membership values do not always correspond well
to the degree of belonging of the data and it is inaccurate in noisy environment. The Maximum
Likelihood method is general and can be applied to model with any probability distribution.

Thesis Report
CHAPTER 4
RESULTS AND ANALYSIS
The simulation of the algorithm was performed on the network region of as assumed 500 x 500
m2. Around 200 sensors are randomly dispersed into the network region and twenty different
node location set were evaluated and consumed for each experiment. The experiment was
performed for an average of 100 independent rounds on each location set and the result was
obtained showing improvement in the network lifetime and stability. In this thesis work the
proposed Voting Technique is compared with the existing UCCGRA.
Fig.4.1.1. Simulation of Proposed method

Thesis Report
Fig.4.1.2. Round Trip Time (rtt) histogram
Fig.4.1.3 Queue Length

Thesis Report
Fig.4.1.4. Simulation of Voting existing
Fig.4.1.5.Round Trip Time (rtt) histogram

Thesis Report
4.1 NUMBER OF CLUSTER GENERATED

Given graph and table show first scenario of analysis of the proposed approach. In this graph,
comparison of existing voting based method of unequal cluster and proposed likely hood based
on centrality is made. The number of nodes and cluster varies because of the proposed approach
which depends on centrality of cluster head but existing approach depend on relative distance of
sink. In proposed method cluster head select by iterative method with likelihood method.
Table 4.1 Number of cluster with radius
R max(Metres) UCCGRA[4] Proposed
10 76 90
20 63 74
30 40 44
40 30 40
50 25 35
60 22 28
100
90
80
NO of clusters
70
60
50
UCCGRA
40
30 Proposed
20
10
0
10 20 30 40 50 60
R max(meters)
Fig.4.1. Comparison of number of cluster with radius increment

Thesis Report
4.2 DISTRIBUTION OF THE NUMBER OF CLUSTERS IN ROUND

Fig.4.2.and table 4.2 shows second scenario of analysis of proposed approach. In these graph
comparison of existing voting base method of unequal cluster and proposed likely hood based on
centrality is done. In proposed method more cluster heads with high number of nodes are
generated, which depict proposed approach more stable than the existing because of iterative
method of likely hood and pattern change of clusters compare to existing method.
Table 4.2 Distribution of the number of clusters in round
NO of cluster UCCRA[4] Proposed

9 7 10
10 17 19
11 29 32
12 27 29
13 15 20
14 8 12
35
30
25
20
Rounds
15 UCCRA
Proposed
10
0
9 10 11 12 13 14
No of Clusters
Fig. 4.2. Comparison of number of cluster with number of rounds

Thesis Report
4.3 IMPACT OF C ON NETWORK LIFETIME

Fig. 4.3 and table 4.3 show third scenario of analysis of proposed approach. This
scenario gives the biasing base analysis with the existing method
Table 4.3. Impact of C on Network Lifetime
The value of c UCCGRA[4] Proposed

0.1 1450 1550
0.2 1570 1600
0.3 1540 1590
0.4 1470 1500
0.5 1420 1450
0.6 1364 1400
0.7 1345 1375
0.8 1300 1300
0.9 1228 1250
1800
1600
Rounds of the first node dies
1400
1200
1000
800 UCCGRA
600 Proposed
400
200
0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
the value of c
Fig.4.3 Comparison of Impact of C on Network Lifetime

Thesis Report
4.4 NETWORK LIFETIME WITH DIFFERENT NUMBER OF NODES

Fig.4.4 and table 4.4 show fourth scenario of analysis of the proposed approach. In this
experiment comparison is made when the first node dies while increasing the round which
changes the parameters of the cluster. The proposed method shows higher number of round
required until the first node dies in the network region that exists. The proposed approach shows
higher stability because of the dynamic changes in the cluster head selection due to the
Maximum Likelihood Estimation approach.
Table 4.4 Network lifetime with different number of nodes
No. of Nodes UCCGRA[4] Proposed
100 1345 1500
150 1565 1770
200 1652 1830
250 1728 1980
300 1938 2190
2500
Rounds of the first node dies
2000
1500
UCCGRA[4]
1000
Proposed
500
0
100 150 200 250 300
No. of Nodes
Fig. 4.4 Comparison of Network lifetime with different number of nodes

Thesis Report
4.5 NETWORK LIFETIME WITH DIFFERENT RMAX

Fig. 4.5 and table 4.5 show the fifth scenario of analysis of the proposed approach. The graph
compares the existing voting based method of unequal clustering and the proposed likely hood
based on centrality. In the proposed approach the cluster head is selected through iterative
process with maximum likelihood method thus load sharing is maximized for which the node
dies after a long period of time i.e. higher round than the existing approach. There is reduction in
the energy consumption of each node thus network lifetime is increased with respect to the
distance of the cluster from the sink.
Table 4.5 Network lifetime with different Rmax
Rmax(meters) UCCGRA[4] Proposed

10 532 550
20 553 575
30 832 900
40 1027 1250
50 1380 1700
60 1565 1775
70 1497 1700
80 1475 1675
90 1450 1650
2000
1800
Rounds of the first node
1600
1400
1200
dies
1000 UCCGRA[4]
800
Proposed
600
400
200
0
10 20 30 40 50 60 70 80 90
No. of Nodes
Fig. 4.5 Comparison of Network lifetime with different Rmax

Thesis Report
4.6 SUMMARY
The Maximum Likelihood Centrality based unequal clusters which are able to change energy
losses by load is used. The effect of this algorithm was that the cluster head reduces the energy
losses by dynamic selecting the cluster and inter change according to its energy and distance.
Thereby increasing the stability of network.

Thesis Report
CHAPTER 5
CONCLUSIONS AND FUTURE SCOPE
5.1 CONCLUSION
Energy efficiency is very important for the sensor network’s effectiveness since recharging and
replacing of their batteries is not approachable and sometime impossible in harsh places. During
the recent period over a decade, energy efficient algorithm for the WSN has become an
interesting challenge for study. A large number of studies have been conducted and proposed for
energy efficient algorithms for WSNs. Communication among the nodes is the main factor of
energy consumption for WSNs. To conserve the energy consumption sensor are clustered into
smaller groups, thereby increasing the network lifetimes, especially when we consider that
neighboring sensors might sense similar events. Therefore each Cluster Heads (CHs)’energy will
decrease fast and may die earlier than the other nodes. Therefor a proper scale and a proper
number of clusters is required for clustering effectiveness, otherwise the network will die quickly
and it cannot benefit from clustering advantages. In a sensor network a large number of clusters
will leads to a large number of Cluster heads (CHs) consequently, a large number of Cluster
Heads (CHs) have to transmit the aggregated data to the sink using long-distance transmission.
On the other hand, a small number of clusters lead to clusters with big diameters, and in each
cluster a large amount of energy is consumed during inter-cluster transmission from Cluster
Members (CMs) to Cluster Heads (CHs). Therefore, Distribution of the Cluster Heads (CHs)
uniformly throughout the sensor network is of a priority for clustering effectiveness.
In this thesis work, centrality based unequal clusters which are able to change energy losses by
load is used. The cluster head reduces the energy losses by dynamic selecting the cluster and
inter change according to its energy and distance. Thereby stability of network increase by 15-
20%.

Thesis Report
5.2 FUTURE SCOPE
The thesis work was done for an energy efficient and improving the energy consumption of the
sensor network through Voting with Maximum Likelihood Estimation Clustering mechanism.
Solution for the energy consumption was optimized by load sharing with degree centrality of the
Cluster Heads (CH) selection process with unequal clustering. Network load sharing was
achieved. The future scope for the thesis work will be to determine a proper and the optimal
solution for the parameters according to the network scale.

Thesis Report
PUBLICATIONS
[1] Uday Kumar Rai, Kanika Sharma, “Maximum Likelihood Estimation based
Clustering Algorithm on Wireless Sensor Network- A Review”, International
Conference on Energy, Communication, Data Analysis & Soft Computing, By IEEE
Madras session, SKR Engineering College, No. 2, pp. 452-457, August 2017.
[2] Uday Kumar Rai, Kanika Sharma, “Energy Efficient Clustering Algorithm Based on
Maximum Likelihood Estimation on Wireless Sensor Network”, IETE International
Conference on Science, Technology & Management, International Journal of Electronics,
Electrical and Computational System, Vol. 6, No. 9, pp. 679-685, September 2017.
APPENDIX A

Thesis Report
OMNeT++
What Is OMNeT++?
OMNET++ is a simulated framework and an object oriented distinct event
network. This can be used in various problem domains as it contains generic
architecture.
OMNeT++ is used for the following problem domains:
i. Modeling of wired and WSNs.

ii. Modeling of queueing networks.
iii. Protocol modeling

iv. Validating hardware architectures
v. Modeling of multiprocessors and other distributed hardware systems
vi. Evaluating the performance aspects of the complex software systems
OMNeT++ is a simulated frame work having discrete event networks and is object oriented
algorithm. OMNET is a platform that provides infrastructure and tools for writing simulation.
The architecture component for simulation model is one of the fundamental ingredients of this
infrastructure. Component of modules which we can use again and again is used for assembling
different models [51].
To connect different modules to each other by using Gates, to form a compound modules we
combine number of modules and it has an unlimited depth. Communication of module can be
process by using messages and where individual message carry arbitrary data structures these
message passed from one module to another by gates or connections. This module can be used to
customize the behaviors of module and to parameterize the model’s topology. Module having
lowest level is termed as simple module and they are programmed in C++.
To run various user interfaces we used to do the simulation of OMNET++. OMNET++ is

generally used for educational and research purpose.

Thesis Report
To run user interface OMNET++ simulation will be used most useful user interface are graphical
user interface and animated user interface for the purpose of demonstration and debugging. The
simulator, UI and other tools are used to verify or tested on the most common operating system
such as Linux, Windows etc.
It can support parallel distribution simulation by using various mechanisms for communication
purpose. These parallel simulating algorithms are easily use and expanded as per use very easily,
these models does not need any special instrument to run parallely. The new version of OMNET
++ is OMNEST.
3.6.1 OMNet IDE

The OMNeT++ simulation Integrated Environment in the Eclipse platform. The purpose of
addition of functionality in OMNeT++ is creation and configuration, execution of performance,
for analyses purpose of simulated data, Development of SVN/GIT and other open-source [51].
3.6.2 THE WORKBENCH

The main window eclipse contains several viewers and editors collected into perspective that
define how they positioned or sized. Eclipse is a very simple and flexible system. In this we are
able to hide, resize and also able to show several editors and navigators. These helps to permit
customization of IDE but it make it difficult for description. OMNET++ IDE gives a ‘simulation
perspective’ to work with simulation which is connected to NED or MSG files. For switch to the
simulation perspective, select Window | Open Perspective | Simulation [51].

Thesis Report
Fig. A.1 Selecting Simulation Perspective in Eclipse
The interface elements in an eclipse are able to move freely due to which we can manufacture
our workbench as per need.[51]
Fig. A.2. Layout of the OMNeT++ IDE (default)

Thesis Report
Top left part of the screen demonstrates projects and their contents. Inside there are various files
like .ned, .ini and other files inside. There are many views docked at bottom of window.
Screenshot Open README.txt file is demonstrated in figure A.3 (b). Eclipse automatically
launches the editor associated with that file when user double click on a file.
View properties contain all information about particular object which is selected in editor area.
Where eclipse counter problems the problem review reference code lines. There are various
OMNET++ views which can be used while development. We can open any View by selecting
Window | Show View from the menu [51].
3.6.3 WORKSPACES
It is a location where our project is used to locate. In starting stage of running procedure
OMNET++IDE gives open sample directory as a workspace due to which we are able to do
experiments rapidly. Once the execution is done of working it is recommended to manufacture
own workspace by selecting File | Switch Workspace | Other. WE should be aware of the
OMNET++IDE as it restarts with individual switch in work space. We can also browse
workspace in project Explorer, Navigator etc.
3.6.4 THE SIMULATION PERSPECTIVE

The main purpose of OMNET IDE ++ is to define the simulation perspective in such a manner
that it geared towards simulated design. SP is a set of reliable selected views which is arranged in
such manner that it can create INI, NED and MSG files very easily. If we are regularly using
NED or INI it used to suggest selection of this perspective. For development or debugging there
are various optimizations of different tasks in C++ [51].
3.6.5 CONFIGURING OMNeT++ PREFERENCES

The preferences menu in the IDE provides the preference option in main window. These settings
are same for all the projects and all are shareable. It also provides the location by itself after
installation. For document generation PATH variable is already set. The license configuration
show that the preferred license type. This license is shown in the NED documentation.
To find the files and folders easily Browse button is used. It provides the complete path for the
executable file no need to extend the PATH variable. [51]

Thesis Report
Fig. A.3. Configuring OMNeT++ preferences
3.6.6 CREATING OMNET++ PROJECTS
In this IDE, all files are presented in the projects so firstly selects the proper project then assign
this project in the OMNet++ project. The easier way to create the project is by using this wizard
Select the options File|New|OMNeT++ Project... from the menu, specify a project name, and

Thesis Report
click on the Finish button. If user don’t want any simple module then deselect the C++ option it
disables all the related function of the C++ [51]
Fig. A.4. Creating a new OMNeT++ project
3.6.7 PROJECT REFERENCES

Aspect of the project can be configured in the menu Project Properties Dialog. This option is
present in the Project| Properties menu and it is also access by right clicking the project explorer
and then properties from the context menu. The main concept in eclipse is referenced to the other
project. If someone wants to update the reference list then click on the Project references page. In
this IDE circular reference system is not allowed [51].

Thesis Report
Fig .A.5. Setting project dependencies
OMNet++ IDE contains all types of NED and code of C++, it also helps to build artifacts in a
particular project [51].
Use the queuenet and queueinglib for project references. They provides some
references in the form of modules that are inbuilt shared library and contains
code in it. Queuenet holds the simulations process which is built by using this
code [51].
3.6.8 GETTING HELP

Th OMNet++ provides access to the help system which supports online help by the Help option
from the menu. In Eclipse this IDE is built on the top position, if you have no knowledge of
eclipse author advised firstly you have to read the User Guide before starting using the
OMNet++.

Thesis Report
REFERENCES
[1] Nasser, Nidal, Lutful Karim and Tarik Taleb, “Dynamic Multilevel Priority Packet
Scheduling Scheme for Wireless Sensor Network”, IEEE Transactions on Wireless
Communications, Vol. 12, No. 4, pp. 1448-1459, April 2013.
[2] Gabriele Oliva, Roberto Setola, and Christoforos N. Hadjicostis, “Distributed C- Means
Data Clustering Algorithm”, IEEE 55th Conference on Decision and Control, pp. 4396-
4401, Dec. 2016.
[3] Shan Zhong, Guihua Wang, Xiaohui Leng, Xiaona Wang, Lian Xue, and Yue Gu, “A Low
Energy Consumption Clustering Routing Protocol Based on K- Means”, Journal of
Software Engineering and Applications, Vol.5, No. 12, pp. 1013-1015, Dec. 2012.
[4] Xia and Hui, “Energy-Efficient Routing Algorithm Based on Unequal Clustering and
Connected Graph in Wireless Sensor Networks”, International Journal of Wireless
Information Networks, Vol. 23, No. 2, pp. 141-150, June 2016.
[5] Mo and Yilin, “Stochastic Sensor Scheduling for Energy Constrained Estimation in Multi-
hop Wireless Sensor Networks”, IEEE Transactions on Automatic Control, Vol. 56. No.10,
pp. 2489-2495, Aug. 2011.
[6] S. Mini, Siba K. Udgata and Samrat L. Sabat, “Sensor Deployment and Scheduling for
Target Coverage Problem in Wireless Sensor Networks”, IEEE Sensors Journal, Vol. 14,
No. 3, pp. 636-644, March 2014.
[7] Yuan and Zhuxiu, “A Balanced Energy Consumption Sleep Scheduling Algorithm in
Wireless Sensor Networks”, IEEE Proceeding, International Wireless Communications
and Mobile Computing Conference, Aug. 2011.
[8] Gu and Yu, “ESWC: Efficient Scheduling for the Mobile Sink in Wireless Sensor
Networks with Delay Constraint”, IEEE Transactions on Parallel and Distributed
Systems, Vol. 24, No. 7, pp. 1310-1320, July 2013.
[9] Guo and Wenzhong, “Design and Analysis of Self-Adapted Task Scheduling Strategies in
Wireless Sensor Networks”, Sensors (Basel), Vol. 11, No. 7, pp. 6533-6554, 2011.
[10] Guo and Peng, “Sleep Scheduling for Critical Event Monitoring in Wireless Sensor
Networks”, IEEE Transactions on Parallel and Distributed Systems, Vol. 23, No. 2, pp.
345-352, Feb. 2012.

Thesis Report
[11] Zhao and Yaxiong, “On Maximizing the Lifetime of Wireless Sensor Networks using
Virtual Backbone Scheduling”, IEEE Transactions on Parallel and Distributed Systems,
Vol. 23, No. 8, pp. 1528-1535, Aug. 2012.
[12] Sengupta and Soumyadip, “An Evolutionary Multiobjective Sleep-Scheduling Scheme for
Differentiated Coverage in Wireless Sensor Networks”, IEEE Transactions on Systems,
Man, and Cybernetics, Part C (Applications and Reviews), Vol. 42, No. 6, pp. 1093-1102,
Nov. 2012.
[13] Toscano, Emanuele and Lucia Lo Bello, “Multichannel Superframe Scheduling for IEEE
802.15. 4 Industrial Wireless Sensor Networks”, IEEE Transactions on Industrial
Informatics, Vol. 8, No. 2, pp. 337-350, May 2012
[14] Malhotra, Baljeet, Ioanis Nikolaidis, and Mario A. Nascimento, “Aggregation
convergecast Scheduling in Wireless Sensor Networks”, Wireless Networks, The Journal
of Mobile Communication, Computation and Information, Vol. 17, No. 2, pp. 319-335,
2011.
[15] Xiong and Shuguang, “Multiple Task Scheduling for Low-Duty-Cycled Wireless Sensor
Networks”, 30th IEEE International Conference on Computer Communications, pp. 1323-
1331, June 2011.
[16] Yoo, Hongseok, Moonjoo Shim and Dongkyun Kim, “Dynamic Duty-Cycle Scheduling
Schemes for Energy-Harvesting Wireless Sensor Networks”, IEEE Communications
Letters Journal, Vol. 16, No. 2, pp. 202-204, Dec. 2011.
[17] Keskin and M. Emre, “Wireless Sensor Network Lifetime Maximization by Optimal
Sensor Deployment, Activity Scheduling, Data Routing and Sink Mobility”, Elsevier, Ad
Hoc Networks, Vol. 17, pp. 18-36, 2014.
[18] Zhu and Chunsheng, “Collaborative Location-Based Sleep Scheduling for Wireless
Sensor Networks Integrated with Mobile Cloud Computing”, IEEE Transactions on
Computers, Vol. 64, No. 7, pp. 1844-1856, 2015.
[19] Shrivastava, Prerana, and S. B. Pokle, “Energy Efficient Scheduling Strategy for Data
Collection in Wireless Sensor Networks”, Electronic Systems, Signal Processing and
Computing Technologies, 2014 International Conference on IEEE, 2014.

Thesis Report
[20] Dobslaw, Felix, Tingting Zhang, and Mikael Gidlund, “End-to-End Reliability-Aware
Scheduling for Wireless Sensor Networks”, IEEE Transactions on Industrial Informatics,
Vol. 12, No. 2, pp. 758-767, 2016.
[21] Hsu and Chih-Cheng, “Joint Design of Asynchronous Sleep-Wake Scheduling and
Opportunistic Routing in Wireless Sensor Networks”, IEEE Transactions on Computers,
Vol. 63, No. 7, pp. 1840-1846, 2014.
[22] He Jianping, “Multiperiod Scheduling for Wireless Sensor Networks: A Distributed
Consensus Approach”, IEEE Transactions on Signal Processing, Vol. 63, No. 7, pp. 1651-
1663, 2015.
[23] Valera, Alvin C., Wee-Seng Soh, and Hwee-Pink Tan, “Survey on Wakeup Scheduling for
Environmentally-Powered Wireless Sensor Networks”, Elsevier Computer
Communications, Vol. 52, pp. 21-36, 2014.
[24] Zhu and Chunsheng, “Sleep Scheduling for Geographic Routing in Duty-Cycled Mobile
Sensor Networks”, IEEE Transactions on Industrial Electronics, Vol. 61, No. 11, pp.
6346-6355, 2014.
[25] Kim, Yang G. and Myung J. Lee, “Scheduling Multi-Channel and Multi-Timeslot in Time
Constrained Wireless Sensor Networks via Simulated Annealing and Particle Swarm
Optimization”, IEEE Communications Magazine, Vol. 52, No. 1, pp. 122-129, 2014.
[26] Singh, Santar Pal, and S. C. Sharma, “A survey on Cluster Based Routing Protocols in
Wireless Sensor Networks”, Procedia Computer Science, Vol. 45, pp. 687-695, 2015.
[27] M. Chatterjee, S. Das and D. Turgut, “WCA: A Weighted Clustering Algorithm for
Mobile Ad hoc Networks”, Journal of Cluster Computing, Special issue on Mobile Ad hoc
Networking, Vol. 5, pp. 193–204, 2002.
[28] Younis, O. and Fahmy S. “HEED: A Hybrid, Energy-Efficient Distributed Clustering
Approach for Ad Hoc Sensor Networks”, IEEE Transaction on mobile computing, Vol. 3,
No. 4, pp. 366–379. 2004
[29] Cheng-Fa Li, Gui-Hai Chen, Mao Ye and Jie Wu, “An Uneven Cluster Based Routing
Protocol for Wireless Sensor Networks”, Chinese Journal of Computer, Vol. 30, No. 1, pp.
27–36, 2007.

Thesis Report
[30] Md Azharuddin and Prasanta K. Jana, “PSO-based approach for Energy-Efficient and
Energy-Balanced Routing and Clustering in Wireless Sensor Networks”, Springer-Verlag
Berlin Heidelberg 2016, Soft Computing Journal, pp. 1-15, June 2016.
[31] Qi-Ye Zhang, Ze-Ming Sun and Feng Zhang, “A Clustering Routing Protocol for Wireless
Sensor Networks Based on Type-2 Fuzzy Logic and ACO”, IEEE International
Conference on Fuzzy Systems, pp. 1060-1067, July 2014.
[32] Zhixin Liu, Yazhou Yuan, Xinping Guan, and Xinbin Li, “An Approach of Distributed
Joint Optimization for Cluster-based Wireless Sensor Networks”, IEEE/CAA Journal of
Automatica Sinica, Vol. 2, No. 3, pp. 267-273, July 2015.
[33] Ramegowda K. and R. Sumathi, “An Introduction to Basic Concepts of Clustering
Methods in Wireless Sensor Networks”, International Journal of Current Engineering and
Scientific Research, Vol. 2, No. 9, pp. 35-46, 2015.
[34] Daisuke Takaishi, Hiroki Nishiyama, Nei Kato and Ryu Miura, “Toward Energy Efficient
Big Data Gathering in Densely Distributed Sensor Networks”, IEEE Transactions on
Emerging Topics in Computing, Vol. 2, No. 3, pp. 388-397, September 2014.
[35] Uday Kumar Rai and Kanika Sharma, “Maximum Likelihood Estimation based Clustering
Algorithm on Wireless Sensor Network-A Review”, IEEE International Conference on
Energy, Communication, Data Analytics & Soft Computing, By IEEE Madras session, SKR
Engineering College, No. 2, pp. 452-457, August 2017.
[36] Morteza M. Zanjireh and Hadi Larijani, “A Survey on Centralized and Distributed
Clustering Routing Algorithms for WSNs”, IEEE 81st Vehicular Technology Conference,
May 2015.
[37] Kumar, Sumit, and Siddhartha Chauhan, “A survey on Scheduling Algorithms for
Wireless Sensor Networks”, International Journal of Computer Applications, Vol. 2, No.
5, 2011.
[38] Daisuke Takaish, Hiroki Nishiyama, Nei Kato and Ryu Miura, “Toward Energy Efficient
Big Data Gathering in Densely Distributed Sensor Networks”, IEEE Transaction on
Emerging Topics in Computing, April 2014.
[39] Chan Hiu Fai and Rudolph Heiko, “New Energy Efficient Routing Algorithm for Wireless
Sensor Network”, IEEE Region 10 Conference, November 2015.

Thesis Report
[40] Hai Lin, Lusheng Wang, and Ruoshan Kong, “Energy Efficient Clustering Protocol for
Large-Scale Sensor Networks”, IEEE Sensors Journal, Vol. 15, No. 12, pp. 7150-7160,
December 2015.
[41] Feng Cheng-xu and Liu Zhong, “A New Node Self Localization Algorithm based RSSI
for Wireless Sensor Network”, IEEE International Conference on Computational and
Information Sciences, pp. 1616-1619, 2013.
[42] Prima Kristalina, Wirawan and Gamantyo Hendrantoro, “Improved Range–Free
Localization Method for Wireless Sensor Network”, IEEE International Conference on
Electrical Engineering and Informatics, 2011.
[43] Chen, Sezaki and Png Deng So, “An Improved DV- Hop Localization Algorithm for
Wireless Sensor Network”, IEEE International Conference on Industrial Electronics and
Application, pp. 1557-1561, 2008.
[44] Weihua Pan and Xiaodan Liu, “Wireless Sensor Networks based on the DV-Hop
Localization Algorithm”, IEEE International Conference on Computational and
Information Sciences, pp. 1073-1075, 2012.
[45] Chuyen T. Nguyen, Yao-Win and Van Yem Vu, “A Simple Method for Localization in
Wireless Sensor Network”, IEEE International Conference on Communication and
Electronics, pp. 226-231, 2014.
[46] Sharwan Kumar and D. K. Lobiyal, “An Advance DV-Hop Localization Algorithm for
Wireless Sensor Networks”, Springer, An International Journal of Wireless Personal
Communications, Vol. 71, No. 2, pp. 1365-1385, 2013.
[47] Sangwoo Lee, Chansik Park, Min Joo Lee and Subwoo Kim, “Multihop Rang-Free
Localization with Approximate Shortest Path in Anisotropic Wireless Sensor Network”,
IEEE International Conference on Communication, pp. 1-12, 2014.
[48] Pradnya Gajbhiye and Anjali Mahajan, “A Survey of Architecture and Node Deployment
in Wireless Sensor Network”, IEEE Conference on Application of Digital Information and
Web Technology, pp. 426-430, 2008.
[49] Niculesu and D. Nath B, “Ad-hoc Positioning System”, IEEE Global Telecommunication
Conference 2001, Vol. 5, pp. 2926-2931, 2001.
[50] Boonsonsrikul, Kocijancic and Somjet, “Effective Consumption on Wireless Sensor
Networks: Survey and Challenges”, IEEE International Conference, pp. 469-473, 2013.

Thesis Report
[51] https://omnetpp.org/doc/omnetpp/SimulationManual.pdf.
[52] http://www.ni.com/cms/images/devzone/tut/clip image004 200804 10121423.jpg
[53] http://www.ni.com/cms/images/devzone/tut/clip_image006_20080410121423.jpg
[54] http://www.ni.com/cms/images/devzone/tut/axcfsqwp22236.jpg

Thesis Report-ENERGY EFFICIENT CLUSTERING ALGORITHM BASED ON MAXIMUM LIKELIHOOD ESTIMATION IN WIRELESS SENSOR NETWORK

Cargado por

Información del documento

Derechos de autor

Formatos disponibles

Compartir este documento

Compartir o incrustar documentos

Opciones para compartir

¿Le pareció útil este documento?

¿Este contenido es inapropiado?

Copyright:

Formatos disponibles

Thesis Report-ENERGY EFFICIENT CLUSTERING ALGORITHM BASED ON MAXIMUM LIKELIHOOD ESTIMATION IN WIRELESS SENSOR NETWORK

Cargado por

Copyright:

Formatos disponibles

Thesis Report

Due to the increasing development of microelectromechanical system (MEMS), system on chip

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 1

1.2 EVALUATION METRICES FOR WSN SYSTEM

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 2

The perimeters of a node can be given as follows:

b) Robustness: In order to support lifetime requirements, each node must be as much as

d) Communication: Key evaluation metric of the node is its communication. The

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 3

a) Formation of cluster phase ,

1.4 WIRELESS SENSOR NETWORK

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 4

1.5 POTENTIAL APPLICATIONS

• Environmental checking of air, water, and soil

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 5

1.6 WSN SYSTEM ARCHITECTURE

Fig.1.3. WSN System Architecture Combines Wired and Wireless [52]

1.7 WSN NETWORK TOPOLOGIES

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 6

Fig. 1.4. Common WSN Network Topologies [53]

1.8 WSN NODE COMPONENTS

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 7

Fig. 1.5. WSN Sensor Node Components [54]

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 8

2.2 LITERATURE REVIEW

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 9

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 10

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 11

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 12

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 13

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 14

Chih-Cheng Hsu et al. [21] have discussed designing of a lifetime-amplification steering in

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 15

immaculate number programming issue, which can be tackled effortlessly centralized.

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 16

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 17

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 18

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 19

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 20

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 21

2.3 INFERENCES FROM LITERATURE SURVEY

2.4 PROBLEM DEFINITION

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 22

2.5 PROPOSED WORK OBJECTIVES

1. To improve the network lifetime.

2.6 DESIGN METHODOLOGY

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 23

Deploy the WSN Nodes

MakSelect the cluster head

Select Initialize cluster head by degree

Initialize cluster head by degree

Use voting Scheme

Predict by Maximum Likelihood

Make cluster and cluster head

Fig.2.7 Proposed Methodology Flowchart

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 24

2.7 EXPECTED OUTCOME

Table 2.7 WSN Clustering Algorithms

S/L Clustering Types

a PSO-C- Particle Swarm Optimization-Centralized

a LEACH- Low Energy Adaptive Clustering Hierarchy

a LCA- Linked Cluster Algorithm

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 25

ECE DEPARTMENT, NITTTR, CHANDIGARH Page 26

Signif. codes: 0 * 0.001 0.01 * 0.05 . 0.1 1