Aj25210213

Anzar Ahmad, Prof.R Gowri, Prof SC Gupta / International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.210-213
Clustering and A CHG Approach in MANET
Anzar Ahmad*, Prof.R Gowri**,Prof SC Gupta
*(Department of Electronics and Communication, Graphic Era University,Dehradun)
** (Department of Electronics & Communication, IIT Roorkee,India)

ABSTRACT
like other wireless technologies such as points or base stations. This means that unless mobile
cellular networks, MANET face more difficult users of wireless technologies have the possibility to
problems concerning management functions, access a static network, they will not be able to
routing and scalability . As the number of nodes support their mobile devices services. Mobile ad hoc
increases complexity of MANET increases in networks (MANET) propose a solution to these kinds
various issues.As a solution to these complications, of problems. MANET are autonomous systems
clustering schemes are proposed for MANET in consisting of mobile hosts that are connected by
order to organize the network topology in a multi-hop wireless links[32,29]. The main idea of a
ierarchical manner. Many clustering techniques MANET is that a network can be established without
have been developed. Clustering is a method the need for any centralized administration or fixed
which aggregates nodes into groups . These infrastructure. MANET present many challenges to
groups are contained by the network and they are the research community because of dynamic
known as clusters. By Increasing network topologies. In addition, link bandwidth and mobile
capacity and reducing the routing overhead nodes transmission power are scarce . Also
through clustering brings more efficiency and Scalability is of particular interest to ad hoc network
effectiveness to scalability in relation to node designers and users and is an issue with critical
numbers and the necessity for high mobility. The influence on capability and capacity. The scalability
manager node, in clustering has responsibility for issue of MANET is addressed through a hierarchical
many functions such as cluster maintenance, approach that partition the network into clusters. A
routing table updates, and the discovery of new cluster is basically a subset of nodes of the network
routes within the network. The other node that satisfies a certain property . Clusters are
named as gateway node communicate to the other analogous to cells in a cellular network. In this way
cluster . the network becomes more manageable[32].
In this paper we remove the election and Infrastructure based cellular and mobile networks are
selection of cluster head (CH) and gateway node still limited by the need of infrastructure such like
and given a new approach in which cluster head base station, allocation of frequencies .to fulfill the
and gateway will be replaced by a single node demand of users various approaches are given such
which is known as cluster head gateway (CHG) . as frequency reuse concepts, clustering technique,
All the responsibilities of cluster head (CH) and sectoring technique, and assignment of conflict free
gateway will be perform by the Cluster head channels. Deciding the cluster size on behalf of co
gateway(CHG) . Also we introduces the channel interference ratio [1.3,4, 5], is one of the
prediction table in such a way that if CHG node technique to reduce the interference and providing
moves or expire due to some reason or accidental the optimized solution. This infrastructure based
then which node will act as the CHG. By having Adhoc networks are typically composed of equal
this approach we reduce overheads, energy and nodes that communicate over wireless links without
increase reliability of the network by maintaining any central control. Although military tactical
the prediction table we can decide which node will communication is still considered the primary
work as CHG in future. application for adhoc networks, commercial interest
in this type of networks continues to grow [1,2.32].
Keywords -MANET, Clustering,CHG, Overheads Adhoc wireless networks inherit the traditional
,.Energy problem of wireless and mobile communication, such
as band width optimization, power control and
I. INTRODUCTION transmission quality
Future information technology will be
mainly based on wireless technology. Now a days, II. RELATED WORK
wireless technologies are becoming quite common in Clustering has been found to be an effective
our daily lives. They have been gaining popularity means of resource management for MANETs
with the use of portable devices like laptop regarding network performance, routing protocol
computers, personal digital assistants, and mobile design, Quality of Service (QoS) and network
phones. order to use these devices some type of fixed modeling .Routing can be classified in MANET as
infrastructure is normally required such as access proactive and reactive. In proactive routing routers

210 | P a g e

attempts continuously the routes within the network. base routing [9] aThe headings and subheadings,
In reactive protocol invoke the route determination starting with "1. Introduction", appear in upper and
procedure only on demand. Cluster based routing lower case letters and should be set in bold and
[9][10] is a convenient way for routing in MANET. aligned flush left. All headings from the Introduction
In MANET nodes are very close to each other to Acknowledgements are numbered sequentially
normally one hop or two hop distance, each cluster using 1, 2, 3, etc. Subheadings are numbered 1.1, 1.2,
has one or more gateway node to connect to other etc. If a subsection must be further divided, the
cluster in the network[1].. Clustering presents several numbers 1.1.1, 1.1.2, etc.
advantages for the medium access layer and the
network layer in MANET [2]. The implementation of III. CHG APPROACH
clustering schemes allow a better performance of the
6
protocols for the Medium Access Control (MAC) 5
CHG Cluster
layer by improving the spatial reuse, throughput, Subnet
Cluster
scalability and power consumption. On the other 4 11
hand, clustering helps improve routing at the network 10
layer by reducing the size of the routing tables and by
decreasing transmission overhead due to the update 7
2 9
of routing tables after topological changes occur 12
[1][22][23]. Clustering helps aggregate topology
information since the number of nodes of a cluster is 3 8
1
smaller than the number of nodes of the entire
network[9][13][14]. Therefore, each node only needs
to store a fraction of the total network routing cluster
14
information [3][9]. Cluster Node
13
In most clustering techniques nodes are
CHG Node
selected to play different roles according to a certain
criteria. In general, three types of nodes are defined:
Ordinary nodes are simply members of a cluster Fig. 1 CHG approach
,other node is are called gateways node because they
are able to listen to transmissions from another node In our approach CHG has the following
which is in a different cluster[1] [21][31][30]. In responsibilities
most clustering techniques nodes are selected to play To maintain the routing table of all CHG. As
different roles according to a certain criteria. In in our case for the CHG 9 has to maintain the routing
general, three types of nodes are defined:one table for other CHGs
Ordinary nodes are members of a cluster which do
not have neighbours belonging to a different cluster TABLE I
[1].Other Gateway nodes are nodes in a non- ROUTING TABLE FOR OTHER CHGS .
clusterhead state located at the periphery of a cluster. CHG Via Distance Member
These types of nodes are called gateways because list
they are able to listen to transmissions from and third 4 8-7-4 2 5,6,10
clusterheads .Most clustering approaches for mobile 7 8-7 1 11,12
ad hoc networks select a subset of nodes in order to
9 8-9 1 13,14
form a network backbone that supports control
functions. A set of the selected nodes are called
clusterhead(CH) and each node in the network is
associated with one. Clusterheads are connected with TABLE 2
one another directly or through gateway nodes[1]. CHG DOMAIN MEMER
The union of gateway nodes and clusterheads form a LIST
connected backbone. This connected backbone helps Member node Via Distance in hop
simplify functions such as channel access,bandwidth 1 8-13 1
allocation, routing power control and virtual-circuit
2 8-14 1
support [18].another node which is in a different
cluster [8]. To accomplish this, a gateway node must
have at least one neighbour that is a member of To maintain the prediction table: at the time
another cluster [26]. of joining the cluster for a node CHG will demand
Cluster based routing [7] is a convenient that how much time you will stay here this is not
way for routing in MANET . In MANET nodes are mandatory but recommended to node to send the
very close to each other normally one hop or two hop information, as mobility is unpredictable
distance, each cluster has one or more gateway node
to connect to other cluster in the network. Back bone

211 | P a g e

TABLE 3 Cluster Head In Mobile Adhoc Network”
PREDICTION TABLE "International Conference on Computer
Member Prediction Time Networks and Security" World Academic
time(PT) in counter(CT) of Science Engineering and
minute Technology(WASET) Journal in Singapore
1 -- 10 December 2011 ICCNS 2010 .
2 12 5 [3] Pin-Chuan Liu, Da-You Chen and Chin-Lin
Hu,” Analysing The TCP Performance On
n 10 0
Mobile Ad-Hoc Networks”,International
Conference 2011.
 How many number of nodes are present in [4] R.S.Shaji ,R.S.Rajesh ,F.Rajeshand
the cluster active or passive may be given Ramakrishnan, “A Novel Routing And
as Service Migration Scheme For
(i). One who is leaving the network will Communication Among Heterogeneous
send a dead signal to the CHG. Devices in Pervasive Environment”,
(ii). At the time when any CHG is demanding to “International Conference On Computer
connect the host & it is unable to reach. Then node Communication And Electrical
not reachable signal is given to the CHG & CHG will Technology”, March 2011.
delete the entry of that node and sendt the [5] Miguel A.Wister,Pablo Pancardo and Dante
routing table to other CHGs. Avias-Torres,”Performance Evaluation Of
 When itself is expiring AODV and DYMO as a Plattform for
Rescue Task Applications in
(i) When the time of itself is expiring MANETS”,“International Conference On
ask the prediction table for the Advanced Information Networking And
node which is longer to stay, and Applications”2011.
sends the routing table and [6] Meysam Alikhany and Mohdi Abadi , “A
prediction table to that node and Dynamic Clustering Based Approach For
that cell will broadcast the new Anomaly Detection in AODV Based
entry to other CHGs and its node. MANETS” , “International Symposium On
 Within the cluster Computer Networks and Distributed
(i) Each node should maintain the table of Systems”,2011.
sibling node (SN). So that they can [7] [7] HiuLi, Xiaoguang Zhang,Ying Liu ,
direct communicates with each other to “Energy Efficient Routing Based on Ant
reduce the load of cluster head. Colony Algorithm In Mine Equipment
Monitoring”,
IV. CONCLUSION [8] M.Q.Rafiq, M.Chauhan, S.Kumar, S.Husain
Clustering is a very good concept in Mobile “Mathematical simulation of Cochannel
Adhoc Network for larger network .In the give Interference Ratio for the Omni Directional
approach by CHG approach ,we have reduce the Antenna in Mobile Computing” NCAICT,
overheads, energy consumption and increase network CSI Allahabad chapter, India,15 -16
reliability by reducing election and selection of March,2008.
cluster head and gateway. CHG terminal has to [9] M.Q.Rafiq, S.R Chauduri, S.Kumar,
perform extra work of cluster head as well as S.Husain “Deciding the Cluster Size on
gateway and maintaining the prediction table will Behalf of Co- channel Interference Ratio
reduce battery, efficiency and CHG itsels as a for the Omni Directional Antenna in Mobile
bottleneck and hence danger of loosing the Computing”ISTE day conference New Delhi
particular cluster of the network.So keeping Chapter 31st May & 1st June,08.
multicluster CHG may be consider in a single [10] P.Krishna, M.Chatterjee, N.H Vaidya,&
cluster as a future work D.K Pardhan,” A Cluster based Approach
for routing in adhoc networks”, Proceeding
REFERENCES of 2nd USENIX Symposium on Mobile and
[1] Ismail Ghazi ShayebA et al.Survey of Location Independent Computing.P.1 1995
Clustering Schemes for Mobile Ad-Hoc [11] David B. Johnson and David A.Maltz,
Network (MANET) American Journal of “Dynamic source routing in adhoc wireless
Scientific Research ISSN 1450-223X Issue networks”. In MobileComputing , edited by
20(2011), pp.135-151 © EuroJournals Tomasz Imielinski and Hank Korth, chapter
Publishing, Inc. 2011 5, pages 153-181. Kluwer Academic
http://www.eurojournals.com/ajsr.htm Publishers.
[2] Anzar Ahamd et al. “A Cluster Head [12] David B. Johnson and David A. Maltz,
Gateway Approach For Deciding The “Protocols for adap tive wireless and mobile

212 | P a g e

computing”. In IEEE Personal Networks”,Trusted Internet Workshop
Communications , 3(1), February 1996. (TIW05) held along with 12th International
[13] Stephen Kent and Randall Atkinson, Conference on High Performance
“Security Architecture for the Internet Computing (HiPC2005), 18-21 Dec. 2005,
Protocol”, Internet draft, draft-ietf-ipsec- India.
arch-sec-07.txt, July 1998. [26] S.S.Kulkarni, G.R.Dattatreya, H.Martinez
[14] Vincent D. Park and M. Scott Corson, “A and R.Soto “Adaptive Control of
performance comparison of the Temporally- Heterogeneous Ad Hoc Networks”, Wireless
Ordered Routing Algorithm and Ideal Link- Communications and Mobile Computing,
state routing”. In Proceedings of IEEE Vol-4, 963-975, August 2004.
Symposium on Computers and [27] Ram Ramanathan and Jason Redi, “A Brief
Communication ’98 , June 1998. Overview of Ad Hoc Networks – Challenges
[15] I. Er and W. Seah, “Mobility-based d-hop and Directions”, IEEE Communications
clustering algorithm for mobile ad hoc Magazine 50th Anniversary
networks,” in Wireless Communications and Commemorative Issue, 20-22, May 2002.
Networking Conference, 2004. WCNC. [28] X. Hong, M. Gerla, G. Pei, and C.-C.
2004 IEEE, vol. 4, 2004, pp. 2359–2364. Chiang, “A group mobility model for ad hoc
[16] B.Das, E. Sivakumar,V Bhargavan,”Routing wireless networks,” in MSWiM ’99:
in backbone network using a virtual Proceedings of the 2nd ACM international
backbone”, Proceeding of 6th International workshop on Modeling, analysis and
Conference on computer communication simulation of wireless and mobile systems.
and network (IC3N’97),1997 New York, NY, USA: ACM Press, 1999,pp.
[17] B.Das,V Bhargavan,”Routing in adhoc 53–60.
network using a spine”, IEEE [29] C. Bettstetter, “The cluster density of a
International Conference on computer & distributed clustering algorithm in ad hoc
communication network (ICC’97),1997. networks,” in Communications, 2004 IEEE
[18] J. Wu and J. Cao, “Connected k-hop International Conference on, vol. 7, 2004,
clustering in ad hoc networks,” in ICPP ’05: pp. 4336–4340.
Proceedings of the 2005 International [30] C. Prehofer and C. Bettstetter, “Self-
Conference on Parallel Processing organization in communication networks:
(ICPP’05). Washington, DC, USA: IEEE principles and design paradigms,” IEEE
Computer Society,2005, pp. 373–380. Communications Magazine, vol. 43, no. 7,
[19] Dharma Prakash Agrawal and Qing- An pp. 78–85, 2005.
Zeng,” Introduction to Wireless and Mobile [31] ] B. An and S. Papavassiliou, “A mobility-
System” University of Cincinnati. based clustering approach to support
[20] Mobile Ad -hoc Networks (MANET). URL: mobility management and multicast routing
http://www.ietf.org/html.charters/manet- in mobile ad-hoc wireless networks,” Int. J.
charter.html. (1998-11-29). Netw. Manag., vol. 11, no. 6, pp. 387–
[21] L. Wang and S. Olariu, “Cluster 395,2001.
maintenance in mobile ad-hoc [32} E. Perkins, “Ad Hoc On Demand Distance
networks,”Cluster Computing, vol. 8, no. 2- Vector (AODV)
3, pp. 111–118, 2005.
[22] T. C. Hou and T. J. Tsai, “An access-based
clustering protocol for multihop wireless ad
hoc networks,” IEEE JSAC, vol. 19, no. 7,
pp.1201–1210, 2001.
[23] I. Er and W. Seah, “Mobility-based d-hop
clustering algorithm for mobile ad hoc
networks,” in Wireless Communications and
Networking Conference, 2004. WCNC.
2004 IEEE, vol. 4, 2004, pp. 2359–2364.
[24] J. Wu and J. Cao, “Connected k-hop
clustering in ad hoc networks,” in ICPP ’05:
Proceedings of the 2005 International
Conference on Parallel Processing
(ICPP’05). Washington, DC, USA: IEEE
Computer Society,2005, pp. 373–380.
[25] V.Vetri Selvi and Ranjani
Parthasarathi,“Trace Based Mobility Model
to Support Quality of Service in Ad Hoc

213 | P a g e

Aj25210213

More Related Content

What's hot (18)

Viewers also liked (20)

Similar to Aj25210213 (20)

Aj25210213