INTRODUCTION

1.1 Background

As the coming era is shifting towards wireless connectivity of devices to an

exponential level, complex and advanced network deployments of cellular
technology has taken over the telecom industry. As a result of this, wireless
connectivity in our daily life has become not just a mandatory requirement but also
the main breach on which global connectivity of networks will be dependent. The
invention that was only used for voice networks is now essential for data network
which results as a need of higher data rate. Operators round the globe are switched to
increase bandwidth. Still it has become a great issue to provide coverage to indoor
environment from outdoor base stations [1]. As according to recent studies,
approximately about 65% or morexof the phonexcalls and roughly about 90%xof the
data services takexplace in indoor environments. Complains for poor connectivity are
increasing as the received signal is strength from outdoor base station weakens and
decreases in performance due to the vast penetration loss through the walls and other
energy generating stuffs [1].

As there is increase in the use of mobile phones and computers there is also increase
in problems of balancing load of dense network. To overcome this problem the
heterogeneous networks are deployed. Heterogenous is a combination of devices
creating link with different with operating systems. A network where both cellular
and wireless network combines. Heterogeneous Network where combination of
different networks such as macrocells, femtocells and picocells. These cells are used
for wide range of network for example a tower is far from office or home building
and to ensure that coverage of network is fully coming without any interference and
capacity issue. In Hetnet they extend the range of network [2]. The heterogeneous
network using many techniques and algorithm for it working.

Figure 1 Heterogeneous Network

We are using the Relay based and K-mean clustering techniques to overcome the
problem of dense and seamless availability of network. The motivation behind this
postulation is to examine K-mean and Relay based clustering algorithm in terms of
better network capacity provision and execution to figure out which one is the better.

1.2 Problem Statements

The motivation behind this survey report is to lead an examination of K-mean

execution in contrast with that of Relay base cluster algorithm from the client
prespective. An examination will be directed to build up which of the two is better
method for seamless availability of network with maximum capacity and minimum
interference possible.

To handle the problem many solutions have already been given including deploy of
extra macrocell, distributed antennas , hot spots, in-building solution , picocells, and
multi-hop relays etc, but still these solutions were unable to meet the need as they
were extremely expensive and can’t promise the high quality coverage [2].

1.3 Aims and Objectives

The aim and objective of the project is to find efficient clustering technique to
improve the capacity of dense heterogeneous networks and to overcome the
interference problem through clustering algorithm and to figure out which one is
better algorithm among the selected clustering algorithms that gives out improved
results.

1.4 Scope of Project

Our goal for this examination is a superior comprehension and investigation to

increase the capacity and the decrease the interference of the dense heterogeneous
network. Our examination will be based on a few execution tests between a Relay
Based and a K-mean algorithm that proves that capacity of the network will be
increased with minimized interference.

LITERATURE REVIEW

Background:

AS the technology is growing rapidly and the world is leading towards

modern era of 21 century there is a huge change in all forms of technology. The
technology which starts with the 1G which was introduced in early 1980’s is an
analog technology and just use for voice call only. 1G has speed up to 2.4 Kbps.
 Then the technology booms and upgraded to 2G from 1G which took place in
1991’s. The 2G technology presented call and text service with facilities like SMS,
picture, and MMS.50 Kbps or 1Mbps is the maximum speed of 2G.sss

The third generation technology 3G then introduced in 1998’s and usexof

data network, videoxcalling and mobile internet is launched and has 2Mbps as max
speed.

Then fourth generation technology 4G (the Current Standard) comes into

place and was released in 2008. It is 10 times faster than the 3G and has speed up to
1Gbps. It support all format like 3G but also video conferencing, 3D TV, gaming
services, and other stuffs that demand faster speeds.

Now the technology is invading the global world and population is increasing
day by day and internet is now becomes the source of every aspect of life the
increase in population and density will rises the concerns like interference, delay is
increase, spectrum is insufficient, power and energy problems of inefficiency.

The problems leads to upgrade the technology as introduced with the name
5G. Still, 5G is a not employed yet but it assures expressively quicker data rates,
higher dense connection, much minor latency, and many other enhancements.

5G Network will be a joint network of small cells and macro cells

collectively forming a heterogeneous environment with high data rate, lowered
latency, increased capacity, improved quality of service, higher density with
managed interference. The network is comprised of low power small cells and high
power macro cells base stations, efficiently providing coverage to indoor and outdoor
environment [3].

The advent of 5G technology demands not only better speed, lowered delay and
increased capacity of bandwidth. Enabling the users will experience high data rates
with reduced interference, and also the assurance of availability of network.

Therefore, there is much work been done to improve in the cellular structure of
wireless networks to reduce the delay and interference along with the increased
capacity of network. It is evident from the extensive researches carried out regarding
5G HetNets that future networks will be more kind of hybrid networks where 4G
LTE and 5G will be implemented in coordinated manner. Thus it requires new
techniques and algorithms, to be implemented for better managing up with new
challenges in the field of technology.

As the coming age will be of internet of things IOT, the usage of smart applications
will be increased and require smart monitoring and management which eventually
will demand high bandwidth.

HETNET has great importance concerning service availability and efficiency, as

accurately evaluated hand offs can result in less chances of interference to occur
between devices.

CLUSTERING:

Clustering is the technique in which a number of nodes can be grouped in a cluster. To

manage any cluster there are certain rules that has to be followed, which includes that:

1. There is a cluster head CH in every cluster responsible for decision making that how
the nodes will be associated in that particular cluster.
2. All other nodes in a cluster are considered as cluster members CM.
3. CMs at the edges of the cluster experiences weak signals that causes issues of data
rate at the nodes at edges of cluster.
4. With clustering there are ways with which the overall capacity of network can be
increased and more number of nodes can be accommodated in network.
5. Among many clustering techniques K means and relay based clustering are the two
techniques that are discussed and compared in terms of capacity and data rate in
the proposed work.
 Figure 2 Clusters

OBJECTIVES OF CLUSTERING:

There are variousxobjectives that can be achieved through theximplementation of

clustering technique out of majorxobjectives include Load balancing,xReduced
delay, Interference management, Scalabilityxand many others depending on reason
the clusteringxis been opted to be performed. Thus,xthrough clustering the
management of network will becomexsimpler also the scalability of network can
bexincreased, like all other clusters the structurexof cluster in the network as
everyxother cluster that will be formed as a result ofxexpansion to network will have
a cluster head CH asxcontrolling node and CM as the serving nodexat the end users.
ADVANTAGES OF CLUSTERING:
The most dominantxbenefits that can be achieved by applying clusteringxtechnique
in HETNETs are:

1. Load balancing
2. Coverage andxcapacity improvement
3. Interference management

K-means clustering

K-meansxalgorithm is an iterativexalgorithm. It tries toxsplit-up the dataset into k-

predefined distinctxclusters in which there are groups and each data point of the
clusterxbelongs to only one group. K-meansxtries to makexthe data pointsxof inter-
cluster asxsimilar as possiblexwhile also keepingxor maintaining the clusters
asxdissimilar as possible. The less dissimilarityxwithin clusters, then the dataxpoints
within the same clusters will be morexhomogeneous or similar.
 Figure 3 Hetnet using k means
Clustering

Algorithm
K-meansxalgorithm is one of the straightforwardxunsupervised
learningxalgorithms. This algorithmxis used to solve thexwell-known clustering
problem. Through certainxnumber of clusters (suppose k clusters), it classifiesxthe
given data set. The majorxgoal is toxdefine k centroids, for each clusterxone
centroid. Different locationsxcausexdifferent results, so these centroidsxshould
bexplaced in a deceptivexway. Placing themxasxmuchxas possible far away
fromxeach other is axbetter choice. The upcomingxstep isxto take each
pointxbelonging to a givenxdata set andxassociate it to the nearestxcentroid. When
noxpoints left pending, thexfirst step isxcompleted and an earlyxgroup agexisxdone.
At this stagexwe need toxre-calculate kxnew centroidsxas barycentre’sxof the
clustersxresulting from thexpreceding step. After thesexk new centroids,
betweenxthe same data setxpointsxand the nearestxnew centroid, a newxbinding has
to bexdone. A loop generates. As a resultxof thexloop, the kxcentroids changextheir
locationxstep by stepxuntil no more changesxare done. We can say,xcentroids
doxnot move anyxmore.

Thisxalgorithm consists of thexfollowing stepsxwhich are as follows:

i. The k pointsxarexplaced into thexspace represented byxthe objects that

arexbeing clustered. Thesexpoints representxinitial groupxcentroids.
ii. Each object is assignedxto the group that has the closest centroid.
iii. After assigning allxthe objects, the positions of the K centroids are
recalculated.
 Figure 4 K-means Flowchart

iv. Until the centroidsxno longer move, Steps 2 and 3 are repeated.
Thisxproduces a separationxof the objects into groupxfrom which itxcan be
minimizedxand calculated.

Advantages
i. Clustering accuracyxis improved by K-means analysis, and ensures
information aboutxa specific problem domain is available. Accuracy
of the clusters isximproved through modification of the k-means
algorithm based on this information.
ii. K-means clustering techniquexis efficient and fast in terms of its
computational cost asxcompared to using other clustering
methods.
iii. K-means is easy toximplement and identify unknown groups of
data from complexxdata sets.
iv. As compared toxhierarchical algorithms, clusters produced by k-
means are tighter, especiallyxwith globular clusters.
v. This algorithm canxeasily adjust to the changes. If there is
anyxproblem, adjusting the cluster segmentxwill allow changes to
easily occur on the algorithm.
 Relay-base clustering

This algorithm works on BSAS selection scheme. It requires two predefined parameters. The
two parameters are:

 q: The number of maximum permitted clusters.

 Θ: The differing threshold.
The distance between x and previously established clusters C is calculated in order to
observe the least distance d among x and the cluster. For assigning a new cluster, if the
total amount of clusters is less than q and the least distance found to be outsize than Θ.
Only then x is assigned as a new cluster. In other scenario x will join the nearby cluster [5].
Rather than distance, the proximity between the cluster formed and a node the path loss
will be used. Concentrating on the path-loss from the previously established ones, the main
idea is to assign each node either to a newly created or an existing. Every node 𝑢𝑖 which
creates a new cluster will be linked to the base station and as far as the newly joined node
is concerned it will have a relay connection via already linked node. For node i, final result
will be discussed, first on finding the least path loss value S.

𝒔𝒊 = 𝐚𝐫𝐠 𝒎𝒊𝒏𝒂𝒍𝒍 𝒄𝒉𝝐𝑪 {𝑳𝒖𝒊,𝒄𝒉 }

Against Θ, the values of Si will be compared. The node 𝑢𝑖 will be allocated as a cluster head
in newly created cluster if the value is greater. Until the quantity of clusters does not
surpass q, for a connection between 𝑢𝑖 and the BS, resource allocation will seek in this
scenario. The other scenario is when the value of Si is minimum or equivalent to Θ, then
nodes will try to join the cluster that achieve 𝑳𝒖𝒊,𝒄𝒉 =< Θ clusters having less path loss will
come first. For every cluster head 𝑐ℎ𝑗 a node 𝑢𝑖 is attempting to connect.

Figure 5 Hetnet using Relay Based Clustering

2.5.1 Algorithm
1. Input: U={u1,u2,…uN};

R={r1,r2,r3,..,rM}

2. Initialization: C={ }, AU= { };

BU←U;
q=M; //the maximum no. of clusters (equal to total RBs)

Θ=value;

// Assign first node u1 as a cluster-head

3. IsConnectedßResource_Allocation (u1,BS);

4. IF IsConnected=true,

5. C←C+u1;

6. AU←AU+u1;

7. BU←U- C;

8. End

9. For every ui from i=2 to |N|

10. Cß sort (C,ui); //ch1 will have the min path loss to ui,eq(7)

11. IF L(ui, ch1) > Θ AND (|C|< q),

12. IsConnectedßResource_Allocation(u1,BS);

13. IF IsConnected=True;

14. CßC+ui;

15. AUßAU+ui;

16. BUß U- C;
17. End IF

18. Else

19. For jß1 to |C|

20. IF L(chj,ui)> Θ,
21. Exit for loop(8);
22. Else

23. IsConnectedßResource_Allocation(bi , chj)

24. IF IsConnected=True,
25. AUßAU+bi;
26. BUß BU – bi;

27. Exit for loop(19)

28. End IF
29. End IF-Else
30. End For(19)
31. End IF-Else
32. End For(9)
33. Return AU, BU;
Table 1 Summary of notations
 2.5 DESIGN AND METHODOLOGY

2.5.1 HetNet challenges

In communication network HetNet is used to full fill the user requirements. There are
different types of cells and access technologies in HetNet. Fish model is used in the
project.

Figure 6 Research Model

First we studied about HetNet and its challenges like interference, capacity, etc. As
LTE is being widely applied, crowded events such as concerts, conferences, and
matches could get congested with massive numbers of LTE users. This congestion in
a limited area will cause the Base Station (BS) to be overloaded and thus it will not
be able to serve all users successfully [6]. We studied different techniques and
algorithms to overcome these challenges. For these issues clustering technique is
used in different research papers. Providing a way to create small cells called clusters
inside an LTE macro cell without the need of additional infrastructure [6]. Our main
objective was increasing capacity and decreasing interference. For these issues, two
clustering algorithms are used in our project algorithms K-means and relay base. K
means clustering in LTE is used to increase capacity of the network [7]. Simulations
are performed by using Matlab. Algorithms are compared on the basis of
simulations.
 IMPLMENTATION

Overview

Our Project revolves around No. of Users, Maximum capacity in terms of Users
Served and minimizes interference.
We know that when Capacity increases automatically interference minimize. They
both are reciprocal to each other.

Maximize the capacity

We are maximizing the capacity by increasing the clusters. Assume that if we have
one cluster and we 50 users which we are going entertained them at a time. But, in
this cluster only 10 users served at a time and other 40 users are dropped. In this type
of situation noise power is more that’s why this happened. In terms of minimize the
noise power by increasing cluster to handle more users served. When we take 2
clusters than 20 users are served and 30 users are dropped in this way we are
increasing the no. of clusters when all the users are served and capacity increases
when all users are served. Noise power also minimizes. Interference automatically
minimizes. We have to do only one thing in this project if we increase capacity then
we have not minimizes the interference. The interference automatically minimizes. If
we minimize the interference then capacity automatically increases.

Figure 7 Capacity Maximizing

Equation Modeling:

In this simulation over heterogeneous Network we are using 2 formulae’s. First we

are using Signal-to-noise (SNR) to calculate the noise power. Researchers and
Scientists mostly use this formula to calculate noise power. Lesser the noise power
greater will be the SNR because when less value divides then answer is greater. Here
is the formula of SNR.

𝑆𝐼𝐺𝑁𝐴𝐿 𝑃𝑂𝑊𝐸𝑅
𝑆𝑁𝑅 =
𝑁𝑂𝐼𝑆𝐸 𝑃𝑂𝑊𝐸𝑅

In this formula signal power divided by noise power. Signal power is which we
wanted for example important data. Noise Power is that data which we not wanted
because we want noise power as much as low. We are doing noise cancelation to
provide full connection and no interference.

Figure 8 Signal Noise Ratio

Second formula is for Capacity in this formula SNR is use which we find from our
first formula which is signal power divided by noise power. In this formula higher
the data rate sent higher will be the capacity.

𝑐𝑎𝑝𝑎𝑐𝑖𝑡𝑦 = 𝐵𝑙𝑜𝑔2 (1 + 𝑆𝑁𝑅)

Shannon Capacity Theorem

Long before wireless communication became such a part of our daily lives
researchers had actually established fundamental limits on the rate which we can
communicate over wireless channels the sort of foundational theorem in this area is
something that’s known as the Shannon capacity theorem so the Shannon capacity
theorem for a particular wireless link sets an upper bound on how fast I can transmit
information over that link and there is no way to exceed this. This is a theoretical
upper bound I can get close to it and one of the interesting thing that’s been going on
for the past couple decades is we are come closer to Shannon.

Parameters use in Simulation

Figure 9 Parameters
In this Figure 8 we are using following parameters in Hetnet and comparing two
Algorithms K-Means and Relay Based on basis of user served (capacity). How many
user have been served and data rate for e.g. data has sent to its destination or not
without any interference.

Only number of users and clusters are changed in this parameters and other
parameters are mostly same depend on the conditions. In this simulations the
deployment of users are random. Both these conditions are depending upon
environmental conditions. After results we will find out which Algorithm is better.
Frequency remain same because it’s a resource and resource always remain same.

Both these Algorithms are depending upon the environmental condition. If

environmental condition is better there is no sign of rain then k means is better than
Relay based. If environmental condition is not better and difficult to communicate
then relay based is better than k means.
 RESULTS AND DISCUSSIONS

Results of our Simulations

We are analysing our results by putting different no of users to see that what effects
on the results and all other parameter will remain same.

Figure 10 Parameter of result 1

In this Figure 9 we put 10 users, 5 clusters, 1 iteration, 20 Frequency, 10 radius, 5

Transmit power and band width is 180. So after putting these parameters we get our
results which we analyses.
2.1.1 Simulation Result

Figure 11 Result No 1
In Figur 10, Hetnet using K means graph shows that there are 5 clusters and all 5
clusters accommodate there users which are the nearest to the cluster. User served by
those cluster which one is the nearest one and if BTS is full with users and no other
user will accommodate in this user it will drop by cluster. In 2nd graph Hetnet Using
Relay Based you see that most of the users are dispersed from their clusters now in
this graph a relay is deployed between BTS and user so that it will accommodate it.

In graph cluster vs. number of served users shows that from cluster one both
algorithms are accommodate their respective users and increasing fast till all users
served but at cluster 3 both of them are showing continuous horizontal straight line
which means all the users are served.

Simulation No.2

Figure 12 Parameters Of Result 2

In this Figure 11 we increase the number of users and then we checked our results
that how much effects on both graphs. Now users are 20 and 3 clusters and other
parameters are same.
 Figure 13 Result No 2

In this graph users are accommodate at initial point when cluster is one at this
point relay based is better than k means. So, when clusters increasing then k means is
better than relay based at the end.
Simulation No. 3

Figure 14 Parameters of Result 3

In this Figure 14 we also increase the number of users so we check the difference of
result on both Algorithms in terms of user served and data rate. Now users are 30 and other
parameters are same.

Figure 15 Result No 3
Both the Algorithms are on the same point from cluster 1 but at cluster 2 k-means is far better
than relay based till at the end. In datarate graph, k-means is better than relay. It’s all depend
on environmental condition.

Simulation 4

In this we are checking by putting 50 users and then we

check what changes in our simulations.

Figure 16 Parameter No 4

Figure 17 Result No 4
At cluster 2 Relay based find the users which are willing to served and k-means find the users
at cluster 3 but at the end both served same no. of users and at the same cluster. With the
increasing no. of users relay based is useful than k-means. Whereas in data rate relay based is
also better than k-means.

Simulation 5
In this parameter now no. of users are 100 and we
see our result more clearly and analyze it.

Figure 18 Parameter of Result 5

Figure 19 Result No 5

As we see that relay based consumed less users as compared to k-means but after increasing
clusters relay based accommodate more users than k-means and at the end relay based is
better. In data rate k-means is better than relay based. It’s all depend on environmental
conditions. K-means is better in data sent to the user.

Discussion on Results of K-means and Relay based Graph:

After applying the relevant parameters to execute simulations we have seen that in all graphs
shown above, sometimes relay based is better than k means and sometimes k means is better
than relay based its all depend on environmental conditions. In Figure 11 Both graphs show
that k-means and relay is served same No. of Users and also same data rate. In Figure 13 k-
means is better than relay in terms of both graphs (Served No. of Users and Data rate).
Whereas some other Figure 17 and Figure 19 show that relay based is better than k means
because relay based is useful even when the node positions and environmental conditions are
not favorable due to random deployment of HetNet, in this condition relay based send data to
the relevant nodes without any problem because in user and BTS there is relay base deployed
which sends data to the user, where k-means is better when environmental condition is good
and no chance of rain. Data rate is better in relay based than k-means. This change occurs due
to increase in the no. of users. When we set 10 no. of users there is no such difference but as
we increase the no. of users and put 100 users then according to results that give better data
rate with reduced interference thus, relay proves to be better than K Means according to the
given results.

Thus, increased capacity is achieved in dense network with reduced interference and
improved data rate by applying Relay based clustering technique.

TOOLS / APPLICATION
MATLAB: For designing,xsimulating and verification of clustering technique.
Communication and 5Gxtoolkit of MATLAB will be used.

FUTURE WORK
In future, after having successful simulation results on MATLAB it can be deployed on real
test bed to study its real time effects and further can be implemented on 5G HetNets. The
compatibility of thexproposed algorithm/protocol has to be analyzed.
CONCLUSION
In this research we showed that if the capacity is increased in dense network then it can be
managed and efficiently minimize interference with appropriate clustering technique is
implemented efficiently on network, which will make the HetNet capable enough to adapt to
changes dynamically along with changing environment of dense heterogeneous networks
without increasing the complexity of the network. The research work conducted is simulation
based but if turns out to be successful it can be implemented on real HetNet environments.

Thus, if proper clustering technique is applied then inclusion of small cells is effective
solution to increase the capacity of network at highest possible data rate with lowest possible
transmit power and less penetration losses in any network.