International Journal of Computer Engineering & Technology (IJCET)

Volume 7, Issue 3, May-June 2016, pp. 0106, Article ID: IJCET_07_03_001

Available online at
http://www.iaeme.com/IJCET/issues.asp?JType=IJCET&VType=7&IType=3
Journal Impact Factor (2016): 9.3590 (Calculated by GISI) www.jifactor.com
ISSN Print: 0976-6367 and ISSN Online: 09766375
IAEME Publication

SURVEY ON MOBILE AD HOC NETWORK

Indu Sarmal
CSE, GNDU RC Gurdaspur, India
Amardeep Singh
CSE, GNDU RC Gurdaspur, India
Sharanjit Singh
CSE, GNDU RC Gurdaspur, India
ABSTRACT
Mobile Ad hoc Network is basically a crew of mobile traffic nodes, which
figure an effectual dynamic topology and built a resource mannered network.
Mobile Ad hoc Networks are exceptional cases of ad hoc networks that, but it
is lacking infrastructure, communicating entities pass with various
accelerations. For that reason, this impedes or delay lays the foundation of
well built end-to-end communication paths. So Mobile Ad-hoc Network having
efficient data transfer. In this manner, MANETs have out of the common
network concerns and security challenges to get the advanced connectivity,
immune communications, and reputation executives systems which have an
impact on the trust in cooperation and settlement between mobile networking
units. In this survey paper we confer about the security attributes, attacks, and
challenges of MANETs.So, it is important to have a better and good formation
algorithm to connect all the nodes to each other. There must be less time, low
delay time, more battery life, more speeds of packets.
Key words: MANETs, security threats, Recovery, routing protocols, cluster,
and wireless sensor network.
Cite this Article: Indu Sarmal, Amardeep Singh and Sharanjit Singh,Survey
on Mobile Ad Hoc Network, International Journal of Computer Engineering
and Technology, 7(3), 2016, pp. 0106.
http://www.iaeme.com/IJCET/issues.asp?JType=IJCET&VType=7&IType=3

1. INTRODUCTION
Mobile ad hoc network is a category of wireless network system in which mobile
anchor or hosts with various numbers of wireless (mobile) network interface and
structure a short-term and non-permanent network, in the absence of any stable
infrastructure or centralized controlling. MANET can be speedily do setup as
required, but security is a main Crucial concern as liken the wire-oriented or wireless

http://www.iaeme.com/IJCET/index.asp

editor@iaeme.com

Indu Sarmal, Amardeep Singh and Sharanjit Singh

correlatives. In MANET two different nodes can be in communication straightly as

long as they are within the walls of the field of radio communication range of every
one other. For all that, in MANET there is no steady infrastructure, i.e. base station
(self organized)[9]. Thats why; every node has to make a move as a router, so this
fact makes MANET a management with increased flexibility. In such warlike
framework , the information swap in the middle of two communication groups may
consist of extremely sensitive data that should be assure when it is sent via in between
nodes. Mobile ad hoc network have been presented with an extreme deal of
observation in the latest years. This is typically the reason of their probably
application vary between military type of applications and non-military applications.
Because of the point-to-point protection system, it provides some state of safety for
the data, worthwhile details, i.e correlation and locality of the communication essence
and these are simply being estimated from traffic and details inspection . Weboriented anonymity manner, for the occasion may be proffer the scope of thrashing
the information. So, this web-oriented ways of communication make an unidentified
bond connection between the dissimilar end nodes. Because of the Non-availability of
permanent infrastructure the topology of the mobile ad hoc networking system
becomes complex sometimes. In this survey paper, we come up with an informal
protected distributed Road establishment protocol for unspecified communication and
non-wired network. [1]In MANET the origin (source) node start off a path making
action via relaying a path revelation message with confirmed trust essential
specifications to all of nearby nodes. And then in between nodes fulfilling these trust
essential requirements and then their identification key or ID and session key into the
path discovering message and dispatch duplicates of that message to the appoint
neighbor nodes till the message attain to its target node. Firstly all the information is
encrypted (convert into code) before computing to the message and after that only
nominated intermediate nodes can be allowed to decode that encrypted message.
[2]When the destination node receive the message then that receiver node can
straighten out the all information about all in between nodes and then enclose this
information and redirect it back across a same backward path in the distribution
information tree back to the initial node. Across the backward path each and every in
between node detach the one coded layer from the message and the moved the
message forward to the predecessor node Until such time the message get to the initial
(source) node. Alike to various wireless sensor networks , mobile ad hoc network are
adaptable to both-active and passive attacks. first of all, passive attack mainly
implicate eavesdropping of various data , but on the other hand, active attack
adaptable of actions like replications, or modifications and also removal of
interchanged data existed. In precise, theses attacks in this wireless network can germ
traffic crowding , and can also transfer the wrong one, and prevent the systems service
work correctly or also can take down the whole system . An active attack basically
adaptable an attackers straight arbitrament with the data and control the information
which is transferred based upon the communication channel. Active attacker might
destructively involve in the whole routing system protocol by replaying the data,
editing it or removing the routing path protocol. For sample, in replay attack the
striker adversely re-transmit a valid routing packet that was sent before, while in the
editing attack, the whole routing information or data is destructively edited and then it
is send. Active attack on routing path basically in tented to lead to the virus containing
updates on the routing table and then data packet being transfer to the target wrong
destination. And then it may be it lead to the construction of the path loops and that
network its traffic crowded. A further, active attack is divides into-External attacks

http://www.iaeme.com/IJCET/index.asp

editor@iaeme.com

Survey on Mobile Ad Hoc Network

and internal attacks. External attacks are origin by nodes that does not that is a
particular group of the mobile ad hoc networks and Internal attacks are implemented
by undetermined (compromised) nodes belonging to mobile ad hoc network and then
they are more hard to save against than the external attacks. A passive attack can take
place when an attacker un-intrusively extract on a communication system in between
the more than one nodes without any distortion in the communication channel. A
passive attacker doesnt impede the operation of the communication system.
Alternatively, the priority of this attack is to find out some important information or
data which is concern to the control message which is sent over the system. This
attack seems not harmful but still it can pose a warning to the security and privacy of
the whole communication network. Traffic survey can simply reveal nodes address
and also reveal the commitment between the all nodes. And then he can detect the
whole conclusion that the node cavort the important role in this network and may be
later mount an active attack in the opposite that node, which cause to a big destruct of
the network.

2. BACKGROUND
The activity of clustering assign with network channel which is sub-categories into
interconnected subsystem categories and also named as sub cluster. The major action
of Cluster is to elect Cluster Head in good way to implement task . The cluster is a
gathering of more than one node and then specify one node as a CH from the
assessable settle of node assessable in that cluster. A Clustering expand the potential
of network and diminish the routing overhead which convoy more reliable and
effective routing in MANET. Every clustering algorithm includes of two mechanisms,
cluster formation and cluster maintenance. First of all In cluster formation, cluster
heads are collectively near the other nodes to make the hierarchical network and in
Cluster continuity , the health of cluster nodes sustain by check nodes from malicious
attacks. Draining nodes minimize life of the network which will leads to the effect the
network performance. Hierarchical network helps to communication between cluster
nodes and cluster head. Cluster Head of one network exchange information and
communicate with other Cluster Head of other Cluster to make it system very safe as
well as full attacker proof . Traditional clustering algorithms advocate CH election
exclusively establish upon node location information/data and consist various
frequent broadcasting of control packets, when network topology remains same.
Various numbers of algorithms are adaptable to amplify and create new Cluster as
well as preference of Cluster Head. Various algorithms are Lowest ID in which is
highest degree Clustering algorithm. LEACH which is Low Energy Adaptive
Clustering Hierarchy and These all algorithms have run on the basis to their
constraints. Every algorithms have their own different properties.

3. LIERATURE SURVEY
First one is the Lowest ID (LID) This one probe for lowest and aged ID from recent
cluster. The node own lowest ID has appoint as a Cluster Head (CH).It is identifier
deploy clustering algorithm. It will firstly elect peculiar id to assigned node or the
nodes which are in same cluster. The research tender by[3] Hao Wu, et.al. bring
Type-based clustering algorithm (TCA) which shows both Lowest ID and
Weighted Clustering Algorithm. They provide peculiar ID to each node. They Suspect
that node should be enlightened with their its location coordinates and a persue unique
IP address in the network. With that peculiar ID and IP address it will proclaim the
information/data packet to other node in that cluster. For assemblage of lowest ID, it

http://www.iaeme.com/IJCET/index.asp

editor@iaeme.com

Indu Sarmal, Amardeep Singh and Sharanjit Singh

will leads cluster, and in that cluster looking for very lowest node containing lowest
ID. That node will be testify as a Cluster Head for that only network. If node fits in to
multiple or various numbers of the cluster then it will suffice as a gateway in between
that two clusters. The one Cluster Head (CH) has to perform for longer time as no
other Cluster Head selected for a longer way. The nodes swing to relocate in a intense
action as a group. They occupy the stability factor S as the criterion to generate the
Cluster head selection activity of process. On the other hand [4]A Damianos Gavalas,
et.al.explains that Lowest ID (LID) algorithm process in a very simple pattern . They
elaborate a distributed algorithm for scalable and very good clustering in
MANETs(mobile ad hoc network). The new algorithm which is named as LowestID with the Adaptive ID Reassignment or LIDAR. It capable for the maintenance
process of algorithm very fast, straight to point simple and very low cost effective. It
is shows manufactured for balanced computational load and potential of power
consumption near all non-stable nodes. All these guidelines they found by identifying
and electing all of the possible and node as a Cluster Head which is denoted by CH .
This will maximize the life of battery of that cluster head and potential of energy
consumption distributed uncommonly throughout the network node. It almost reduce
the problem of bottleneck which was present in it . then there is [5]A Jerzy
Dolowaski, et.al. who make a new proposed algorithm and edited clustering algorithm
which is named as Lowest Node ID (LNID). This new algorithm has a hierarchical
structure that can sustain a safe topology of MANET. The situation of machine is
semi-stable situation and having capability to modify situation throughout work. So
result of that if power drainage appears it will give its restrict to another node and halt
from mislay data. It sustained MAC address as a ID of that node. Node which is
having lowest MAC address will become the Cluster Head for that certain network.
Thereby, optimizes the network execution. On the other hand there is a highest
Degree clustering algorithm is connectivity origin upon clustering algorithm. The
grade of a node is computed origin on its distance from varants. This algorithm
choose that node which having highest degree. The degree of node is processed on the
origin of number of nodes of group connected or linked with that node. As extra
number of confined nodes is connected to the cluster node, the grade of cluster head
enlarged. The node having highest degree becomes the Cluster Head of that Cluster.
[6]In Mohini Kumrawat, et.al.The nodes which are in transferring range of one single
node they are getting ID from one of the node. ID sending node is linked with highest
number of node and participating in interchanging information with all cluster nodes.
The node having highest number of neighbors choose as the Cluster Head and other
neighbors are just remains member of Cluster Head and no longer play a part in
election process. If it uninterrupted connected with highest number of other nodes
then that node will be chosen as a Cluster head form that Cluster Head. Nodes which
is from cluster are 2-hop apart and cluster heads are straightly chained to each other.
In this, they order less number of clusters. So basically this algorithm minimize the
number of clusters by group strength pattern, which is collection of nodes operating
with same speed and direction. This opinion also gives stability to network. But there
is a disadvantage of this technique is it have very minimum throughput. [7]In Ratish
Agrawal, et.al. express in word that the algorithm of unvarying clustering algorithm in
that node which is having grade of degree as i number and that degree is highest in
same cluster then it will taken as a Cluster Head for same network. The node with the
extreme number of uncovered in-range adjoining It will process on Energy analogous
fairness factor Fi it will validate the energy of Cluster Head. Fi use the occurring
before information that how many times it acts as a Cluster head for that same

http://www.iaeme.com/IJCET/index.asp

editor@iaeme.com

Survey on Mobile Ad Hoc Network

Cluster. Third one is the[10] LEACH in this , at a one single time two nodes active
and interface with each other. CH will be chosen by mounting rounds. In each and
every round containing two stages one is called set-up stage and other is called steady
stage. Time distinctions are based upon frame. It is self-organized protocol l so
Random allotment of cluster head had occur in LEACH. It is crowded network of
containing sensor nodes of grouped into clusters. To minimize energy dissipation,
protocol must be long lasting to node collapse , scalable in leads to maximize the
system life and fault tolerant potential . The energy load corresponding with being a
cluster-head is evenly spread among the nodes. The cluster-head node have
knowledge about all the cluster members, it can generate a TDMA scheme that
explains each node totally exact when to transfer its data But there is a disadvantage
of LEACH that, it dont give straight forward information about area of sensor nodes
and the total number of cluster heads in the communication network. Each and every
Cluster-Head straightly interface with BS no matter what is the situation of the
distance between CH and BS. It will use lot of its energy potential if the distance is
far. [8]Chunyao FU et.al. they raise previous version of the LEACH algorithm into
LEACH protocol with two new level cluster head (LEACH-TLCH). This Cluster
Head evolution is exact same as traditional method. In this activity of data group of
collection and transmission, the energy used by data transferring is more greater than
that of data fusion. If the recent energy of a cluster head is lower or the distance to
base station is much away , then the cluster head will be terminated instantaneously
because of a very heavy energy loading . They choose up the any one number from all
nodes in Cluster, detects the energy if it goes low the threshold value it will halt
receiving data. Then second head is the cause for receiving and fusing the particular
data. Primary head will unwaged now. LEACH Protocol is the only protocol of
hierarchical Routings which express the concept of data fusion.

4. COMPARISION
First one is the lowest Id algorithm in which lowest ID containing node is chosen as
CH . This ago. Is easy to understand and it is conducted on the origin of unique id. It
also has some disadvantages like power drainage, bottleneck issue. Second one is the
highest degree algorithm which is work on the phenomenon that the node which
grouped with the highest number of nodes names as CH. Its advantages are rate of
transmission is high. A disadvantage is that when there is a single CH then the load of
the transmission in increased and there is no re choosing of CH is there so it cause the
overheads. Third one is the leach in this there is the random selection of the CH and it
is selected by performing various numbers of rounds. Its advantages is that it choose
on the basis of degree but it also have disadvantage that it is time consuming and
more energy is utilized.

5. CONCLUSION
There are various cluster formation algorithms like highest degree algorithm, lower
ID algorithm and also leach algorithm. all have their own advantage and disadvantage
. Lowest ID is disposed to power drainage because of the serving. Highest Degree
Cluster head chosen on the origin of higher numbers of node connected to node. But
when node maximize in the network then the load of that node improved
simultaneously. It will improve network overheads. But In LEACH case , But it is
chosen on the basis of the degree and this is time consuming because it will take more
time to interface data as only two nodes in process so the packet delivery process to
the end node will be lower.

http://www.iaeme.com/IJCET/index.asp

editor@iaeme.com

Indu Sarmal, Amardeep Singh and Sharanjit Singh

REFERENCES
[1]

[2]

[3]
[4]

[5]

[6]

[7]

[8]

[9]

[10]

V.Preetha, Dr.K.Chitra. Clustering and cluster head Selection Technique in

mobile Ad-hoc network. International journal of Innovative research in computer
and communication engineering Vol. 2,Issue 7; july 2014
Sayani Chandra, Ispita Saha, Poojarini Mitra, Bidyutmata Saha,Sinthai Roy. A
Brief Overview of Clustering Schemes Applied on Mobile Ad-hoc Networks.
International Journal of Advanced Research in Computer Science and Software
Engineering, Vol.5,Issues 2;Feb 2015
Hao Wu and Zangdui Lajos Hanzo. A Cluster-Head selection and update
algorithm for Ad-hoc Networks. 978 -1-4244-5637-6/10/$26.00@ 2010
Damianos Gavalas, Grammati Pantziou, Charalampos Konstantopoulos, Basilis
Mamalis. Lowest-ID with Adaptive ID Reassignment: A Novel Mobile Ad-hoc
Network Clustering Algorithm.
Jerzy Dolowaski, Jaroslow Michalak. A Modified Lowest ID Algorithm For
practical
wireless
clustered
Network.
http://www.researchgate.net/publication/280065537
Mohini Kumrawat, Manoj Dhawan. Survey on Clustering Algorithms of Wireless
Sensor Network. International Journal of Computer Science and Information
Technologies, Vol. 6 (3) ;2015, 2046
Ratish Agrawal, Dr. Mahesh Motwani. Survey of clustering algorithms for
MANET. International Journal on Computer Science and Engineering
Vol.1(2);2009, 98-104
Chunyao FU, Zhifang JIANG, Wei WEI2and Ang WEI. An Energy Balanced
Algorithm of LEACH Protocol in WSN. IJCSI International Journal of Computer
Science Issues, Vol. 10, Issues 1, No 1; Jan 2013 Cheriton, D., Gritter, M.:
TRIAD: A New Next-Generation InternetArchitecture. Stanford University,
Stanford, CA [Online]. http://www-dsg.stanford.ledu/triad/triad.ps.gz (2000)
V. Dinesh Kumar, Dr. S. Radhakrishnan. Intrusion Detection in MANET using
Self Organizing Map (SOM). International Conference on Recent Trends in
Information Technology; 2014
Priya Maidamwar, Nekita Chavhan. Research on Quantitative Analysis of
LEACH with Wormhole attack in Wireless Sensor Network. International Journal
of Advanced Computer Research Volume-3 Number-1 Issue-8 ;March-2013

http://www.iaeme.com/IJCET/index.asp

editor@iaeme.com