International Conference On Information Communication And Embedded System (ICICES 2016)
Balanced Clustering In Mobile Ad Hoc Networks
Using Route Cluster
Bhanu Rekha.S#1 Muthukumarasamy.S #2
M.E.(CSE) student Assistant Professor
S.A. Engineering College S.A. Engineering College
Chennai Chennai
sbrekha92@gmail.com muthukumarasmy@saec.ac.in
Abstract—MANETS are a kind of Wireless ad hoc network that
usually has a routable networking environment on top of a Link
Layer ad hoc network. MANETs consist of a peer-to-peer, self-
forming, self-healing network. This, in turn, increases the
importance of bandwidth efficiency while maintaining tight
requirements on energy consumption delay and jitter.
Coordinated channel access protocols are in general not as well
suited for non-uniform load distributions as uncoordinated
channel access protocols due to the lack of on-demand dynamic
channel allocation mechanisms that exist in infrastructure based
coordinated protocols. In this paper, we present a Balanced
Clustering in Mobile Ad Hoc Networks Using Extended and
Weekly Connected Dominated Sets that are applicable to cluster
based MANETs to address this problem. We present protocols
that utilize these mechanisms to improve performance in terms of
throughput, energy consumption and inter-packet delay
variation Balanced cluster group creation and delay and packet
are overcome by proposed algorithm also network lifetime is
prolonged by sustaining the energy level of nodes by Extended
and Weakly Connected Dominating Sets. Balanced clustering
prevents data collisions. Previously single hop communication
was possible but with the help of proposed algorithm two-hop
communication is also made possible. Therefore the link becomes
asynchronous so that which enables multiple transactions at a
time, multiple transmissions is possible with limited number of
clusters called balanced clustering.
Keywords—MANETs, route cluster, extended and weakly
connected dominating sets, energy level, cluster head.
I. INTRODUCTION
Cooperative communication is the basis for all types mobile
networks as the network and nodes present are mobile. Group
communication is the main factor in MANETs as many applications
use this concept. Due to the increase in the number of users, there is a
huge demand in the applications that is supported in this network
type. This is the reason for the increase in the bandwidth of
MANETs.
MANET is made up of mobile hosts which use the wireless
communication devices. Because of the show way of the remote
correspondence all the versatile hosts gets the transmission. Say if
any 2 hosts are out of the transmission ranges in the adhoc system,
the other versatile hosts forward the messages and fabricate the
978-1-5090-2552-7
K.Thanigaivelu#3
Assistant Professor
S.A. Engineering College
Chennai
thanigaivelukotiswaran@gmail.com
association again among the portable hosts in that transmission
territory.
Multicasting has the property of sending a solitary bundle to
different receipients. Spatial reuse has all that much aided in the data
transfer capacity effectiveness and the enery level of battery fueled
hubs. Vitality obliged operation is the place every one of the hubs in
the ad hoc system take a shot at the batteries. The network is
designed in such a way to optimize the energy consumption of the
mobile nodes. If the source and destination nodes are not in range and
lost the association between them then the communication is rebuilt
with the other nodes and creates a optimum path of communication
with the connected nodes. This referred to as multi-hop
communication.
In multi-hop communication all the nodes act as both router and
as a host simultaneously. Multi-hop communication works with the
help of proposed algorithm named as EWCDS.
Multi-hop communication works on the concept of Route
Clustering. Route cluster node can receive data from any number of
sensor nodes. If a node is present in two different cluster groups then
it will not be elected as a cluster node. On the other hand, the node
which is between two hop communications will be elected as cluster
head and cluster member respectively.
Hence the number of cluster members and cluster groups can be
reduced. This creates the environment for balanced clustering and
leads to reduction in packet loss. This proposed algorithm helps in
handling non-uniform load distribution. Synchronous communication
means a single hop communication which is handled by Cluster Head
communication. Two hop communication leads to asynchronous
communication which helps in managing non uniform load
distribution along with efficient use of battery and prolonged network
life time.
II. RELATED WORK
Here, provided with reviews on CDS and WCDS in literature
form along with area based algorithms in ad hoc networks. MCDS for
ad hoc networks is also proposed in this paper. To achieve constant
approximation ratio, developed a scheme with performance ratio and
message complexity of the number of nodes in the network.
A. Area –Based Algorithms
In the vocabulary of ad hoc networks, area is also called as zones.
A zone-based Hierarchical Link State( HLS) routing protocol was
proposed. Absence of cluster head because of non-overlapping zones.
It composed of local node and global zone levels.
 International Conference On Information Communication And Embedded System (ICICES 2016)

B. Area Algorithm for WCDS Formation number of nodes which have same characterisitcs and also belong to
The zonal algorithm is a localized algorithm. If the size control single area. This group of single nodes forms the network. There are
parameter x is smaller then the size of WCDS is larger. Whereas if x many clusters form one base station. In such scenarios LEACH
becomes larger then the algorithm produces a smaller WCDS. Hence protocl os used and the result will be clusters with similar
it not a localized algorithm always and can lead to larger message characteristics and then the network is formed
overhead. Though the AWF algorithm is localized, the WCDS
produced are not very attractive .The main motto of this paper is to
propose a message efficient localized algorithm which can result in
smaller WCDS.

III. SYSTEM ARCHITECTURE

The architecture of this project is simple and small which
comprises of ad hoc network, a route cluster and a battery indication.
This architecture has a CH to CH communication with virtual
channel and battery level indicators.
Cluster nodes are created depending on the two-hop distance. For
advertising the messages broadcasting technique is used. Hence,
after the message is broadcasted it checks for the strongest RSS. The
nodes with strongest RSS is selected to be the CH. After the
formation of cluster head the cluster members are formed. The non-
member nodes use the REQ message to become the member nodes.
RREQ and RREP will be explained in detailed in this paper. TDMA
technique of scheduling is used here.
The nodes which do not participate in the transmission are turned
off in order to save energy. This helps in prolonging the lifetime of Fig. 3.2: Cluster Categorization
the network as well as he battery life can be saved. B. Cluster Head (CH) Election
Now the proposed algorithm is executed and two-hop
Now the clusters are created and each node decides whether to
communication is activated. The energy representation are shown in
become a cluster head.The self selected cluster heads now broadcast
the architecture.
the message using the non-persistent CSMA protocol.All the
messages contain the header ID. LEACH and CSMA are the main
protocols used in this paper through which communication among
clusters happen.In this stage the cluster members are formed but the
information about the other members and their ID is unknown.
Which simply means that the type of cluster is not recognised.

Fig. 3.3: Cluster Head (CH) Election

Fig. 3.1: System Architecture
A. Cluster Categorization
Cluster formation is simply the process of grouing the nodes in to
a single group which is named as clsuter.The cluster can have n
C. Route Exploration
Route discovery is the process of selecting the route for the
destination.RREQ and RREP is used to select the route. In this
method RREQ sets the broadcast of the message which is called as
route request.

978-1-5090-2552-7
 International Conference On Information Communication And Embedded System (ICICES 2016)

Once the destination is distinguished, the destination sends the
unicast RREP to locate the base DS and CDS in the same way. This
is for the most part used to recognize the best way.
This can be declared as most ideal if NP6 Dtime(nO(log log ) and
the processors are adhereing to the polynomial-time calculation.
Now, lets demonstrate the generally accepted methods for
overwhelming sets which can prove the above mentioned properties.
If any two contiguous nodes in the system have low extended
dominators with a separation of 0(logn), this is called as low
extended property (Lets consider S- ruling set, dominator of vertex u
-any V2 S, if and only if the separtion between u and v is at most
one.) similarly let consider the time limits to be ideal, and the low
extended property which is the neighbour hus have their dominators
with a sepration of 0(logn) in the system. (Lets consider S-
commanding set, dominator of vertex u- any v2 S, if and only if the
separation between u and v is at most 1)

V. PERFORMANCE EVALUATION
To compare and study, considering ns-2 simulations of all the
protocols. The system model is discussed below. Green color lines
represent the existing system and the red color line represents the
proposed system.

Fig. 3.4: Route Exploration

IV. EXTENDED AND WEAKLY CONNECTED DOMINATING

SETS
In connected dominating set, every node in the adhoc system is
encompassed by a dominating neighbor or by a few two-hop
dominated neighbors.
This works on the concept of cooperative communication where
independent copies are transmitted. Dominating sets(DS) are utilized
broadly as a part of adhoc systems. A set can be declared as a
dominating set if all the nodes are in the system or neighbor of a node
in the set. At this point where a DS is associated to the set is called as
CDS.
The idea of finding the base DS and CDS is NP-complete.The
idea of extended dominating set was proposed on the idea of
Cooperative Communication(CC). CC makes Milti Input Multi
Output framework(MIMO). CC can be of major advantage on these 2
variables.

1. The less power utilization in multi hopping

2. The spatial diversity offered by the antenna of separate mobile

nodes.

Independent copies of packet are created in a CC transmitter that

provides diveristy and reduces the effect of fading.
Henceforth, in this idea k number of duplicates can be transmitted
to the receiveer outside the transmission range whithout expanding
the transmit power. In CC model, Ds is called as augmented
overwhelming set(EDS).
On the off chance that, for every hub in the network,is present in
the set, it is a neighbor in the set, and it has k two-hop neighbor in the
set. In the Fig.1(b),{u,v,x} shapes an EWCDS for k=2 since x can
retreive complete parcel when u or v is the source, while u nor v is
the source when x is the source.
With the vicinity of routing issues in adhoc systems, from the Graph. 5.1: Energy Remaining
polylogarithmic-time appropriated calculations for 2 reasons.
At the point when given a system and to locate the associated
commanding sets, whose size is considered as 0(log) times ideal and
it is the extreme level in the data system.

978-1-5090-2552-7
 International Conference On Information Communication And Embedded System (ICICES 2016)

efficient. Cooperative communication is achieved using

EWCDSwhich not only manages various load under various
conditions but also tremendously maintains the battery level of nodes.
This two-hop communication is made possible by route cluster that
has the capability to collect the information from various nodes. This
in turn results in Asynchronous type of communication. The term
weakly indicates that the channel will be established immediately at
start of transmission and terminates when it passes the data on to the
next nearby hop so therefore the channel need not have to established
until the data reaches its destination. By implementing this algorithm
both battery power and non-uniform loads can be efficiently
managed.

REFERENCES

[1] B. Karaoglu et al (2011) Analytical performanceof soft

clustering protocols,Ad Hoc Netw., , : .
[2] K.W.Chin et al (2003) Wireless medium access control
(MAC) and physical layer(PHY) specifications for high
rate wireless personal area networks(WPAN), IEEE Draft
Standard, Draft P802.15.3/D16, : .
[3] (2006) Wireless Medium Access Control (MAC) and
Phys. Layer (PHY) Specificationsfor Low-Rate Wireless
Personal Area Networks (WPANs),IEEE Standard
802.15.4-2006, : .
[4] B.Tavli et al (2004) -TRACE: MULTI-HOP TIME
Graph. 5.2: Delay RESERVATIONUSING ADAPTIVE CONTROL FOR
ENERGY EFFICIENCY, IEEE J. Sel.Areas Commun.,
vol. 22, no. 5, pp. 942–953, : .
[5] M. Kappes et al (2006) AN EXPERIMENTAL
PERFORMANCE ANALYSIS OF {MAC}MULTICAST
in 802.11b networks for VOIP traffic, Comput.
Commun.,vol. 29, no. 8, pp. 938–948, :.
[6] B. Leiner et al (1987) .,ISSUES IN PACKET RADIO
NETWORK DESIGN, Proc. IEEE, vol. 75, no. 1, pp. 6–
20, : .
[7] I.Cidon et al (1988) DISTRIBUTED ASSIGNMENT
ALGORITHMS FORMULTI-HOP PACKET-RADIO
NETWORKs, in Proc. 7th Annu. Joint Conf.IEEE
Comput. Commun. Soc, : .
[8] L. Gao et al (2008) A GAME APPROACH FOR MULTI-
CHANNEL ALLOCATIONIN MULTI-HOP
WIRELESS NETWORKS, in Proc. 9th ACM Int.
Symp.Mobile Ad Hoc Netw. Comput., : .
[9] M. Felegyhazi et al (2007) NON
COOPERATIVEMULTI-RADIO CHANNEL
ALLOCATION IN WIRELESSNETWORKS, in Proc.
IEEE 26th Conf. Comput. Commun.,, : .
Graph. 5.3: Packet Delivery Factor [10] R. Ramaswami et al (1989) DISTRIBUTED
SCHEDULING OF BROADCASTSIN A RADIO
NETWORK, in Proc. 8th Annu. Joint Conf. IEEE
VI. CONCLUSION Comput.Commun. Soc.. Technol.: Emerging
The problem of handling non-uniform loads is achieved and Converging,,: .
since the data are transmitted through Cluster Head the transmission [11] B. Das, R. Sivakumar, V. Bhargavan (1997) Routing in
becomes highly secure and instead of creating many clusters, it is
ad-hoc networks using a spine, in: Proceedings of the
possible to balance the network with available number of cluster
groups. EWCDS is implemented to make the transmission more

978-1-5090-2552-7
 International Conference On Information Communication And Embedded System (ICICES 2016)

Sixth International Conference on Computers and

Communications Networks, : .
[12] L. Wang, S. Olariu (2004) A TWO-ZONE HYBRID
ROUTING PROTOCOL FOR MOBILE AD HOC
NETWORKS, IEEE Trans. Parallel Distributed Syst, : .
[13] M. Agarwal, J. H. Cho, L. Gao, and J.Wu (n.d.) ENERGY
EFFICIENT BROADCAST IN WIRELESS AD HOC
NETWORKS WITH HITCH-HIKING. In Proc. of
INFOCOM, :.
[14] Y.P.Chen and L.Liestmen (2002) APPROXIMATING
MINIMUM SIZE WEAKLY-CONNECTED
DOMINATING SETS FOR CLUSTERING MOBILE
AD HOC NETWORKS, :.

BHANU REKHA.S is a M.E student in

Department of Computer Science and
Engineering at S.A. Engineering College,
affiliated to Anna University. She received her
B.E. in Computer Science and Engineering in
P.B.College of Engineering, affiliated to Anna
University in 2014. Her area of interests
includes Wireless Communication, Computer
Networks and Distributed Systems.

MUTHUKUMARASAMY.S is a PhD
scholar in Department of Computer Science
and Engineering at Anna University. He
received his M.E. degree in 2011 at Sri
Krishna Engineering college and B.E. degree
in 2005 at E.G.S Pillay Engineering College.
His area of interest includes Mobile Computin,
Wireless Sensor Networks,Information
Security.

THANIGAIVELU.K is a Professor in
Department of ECE at S.A.Engineering
College. He completed his PhD in
Information Communication and
Engineering at Anna University and
completed M.Tech in Laser & Optical
Engineering in 1999 at Anna University
and B,.tech in Electronics in 1995 at
Madras University. His areas of interests
include Antennas, Wireless Sensor
Networks, Network Security, Grid
Computing

978-1-5090-2552-7