Passive Adhoc Identity For Sybil Attack Detection Using NDD Algorithm

International Conference on Computing and Intelligence Systems
Pages: 1185 1190
Volume: 04, Special Issue: March 2015

ISSN: 2278-2397
Passive Adhoc Identity for Sybil Attack

Detection Using NDD Algorithm
]
A. Muruganandam1, R. Anitha2
1
Research Scholar, Department of Computer Science, BharathiarUniversity,Coimbatore, Tamilnadu, India.

2
Department of MCA, Muthayammal Engineering College, Rasipuram, Nammakkal, TamilNadu, India.
Email: murugandbc1976@gmail.com,aniraniraj@rediffmail.com
Abstract-Ad hoc routing protocols are used to find a

path end-to-end through the cooperative network. This
research focuses on the Sybil Attack Detection of
Wireless Sensor Networks. Sybil Attack may act
indifferent ways such as threading, voting system, fair
resource allocation, etc. In the Sybil attack a single node
presents multiple fake identities to other nodes in the
network. Sybil attacks pose a great threat to
decentralized systems like peer-to-peer networks and
geographic routing protocols. In our proposed method,
we used Passive Ad Hoc Identity Method and Key
Distribution by using Neighbor Discover Distance
Algorithm.We can take throughput, delivery ratio,
delay time and energy efficient parameters to
differentiate the results and to improve the overall
performance of secure data transmission on Wireless
Sensor Network.
Keywords-Sybil Attacks, Road Side Unit, Neighbor
Discover Distance Algorithm, Ad-hoc On-Demand
Dist anceVector.
I.
INTRODUCTION
The Mobile Ad hoc Networks (MANETs) have

promising functionalities including mobile safety,
traffic congestion avoidance, and location based
services. But privacy is an important issue in
MANETs .As the wireless communication channel is
a shared medium, exchanging messages without any
security protection over the air can easily leak the
information. In this paper, we focus on safety driving
application, where each vehicle periodically
broadcasts messages including its current position,
direction and velocity, as well as road information.
Pseudonym based schemes have been proposed to
preserve the location privacy of mobile. However,
those schemes require the mobile to store a large
number of pseudonyms and certifications, and do not
support some important secure functionality such as
authentication and integrity.Here the centralized key
management system has some disadvantages. For
instance, the system maintenance is not flexible.
Another issue regarding the centralized key
management is that many existing schemes assume a
tamper-proof device being installed in each vehicle.
The tamper-proof device normally costs several
thousand dollars. The framework to be developed in
this paper does not require the expensive tamperproof device.I
n this manuscript, we used and developed a secure
distributed key management framework. In our
International Journal of Computing Algorithm (IJCOA)
framework, the Road Side Units (RSU)are

responsible for secure group private keys distribution
in a localized manner.
When a vehicle approaches an RSU, it gets the
group private key from the RSU dynamically. All the
mobile vehicles which get the group private key from
the same RSU forms a group. A new issue induced by
the distributed key management framework is that
compromised RSUs may misbehave in the key
distribution procedure. In the Wireless Sensor
Network there are many characteristic such as: power
consumption constraints for nodes using batteries
or energy harvesting, ability to cope with node
failures (resilience), mobility of nodes, heterogeneity
of nodes, scalability to large scale of deployment,
ability to withstand harsh environmental conditions
and cross-layer design[6]. In future this network will
act in the following ways: Self organizing
capabilities, short range broadcast communication
and multi hop routing, dense deployment and
cooperative effort of sensor nodes, frequently
changing topology due to finding and node failures,
limitations of memory, energy transmit and
computing power.
A. Scope of the research
Security protocols are distributed by the key
management framework, which are capable of
detecting the compromised RSUs and their collusion
with the malicious vehicle if any.Computation
overhead is another critical issue in MANETs. Since
the group signature is expensive, the computational
overhead of each vehicle will become intolerable
when the density of mobile is high the authors
propose a promising protocol which lets mobile
vehicle verifies the message. In the existing system in
order to guarantee an efficient cooperation of mobile
vehicle to verify at least twenty-five messages within
300ms which is still a heavy computation burden for
the On-Board Unit (OBU) installed in to a vehicle. In
this paper, we recommend a more efficient and
practical
(CMAP)
Cooperative
Message
Authentication Protocol[9] with an assumption that
each safety message carries the location information
of the sender vehicle, which can be generated by a
Global Positioning System (GPS Device).
1185

Pages: 1185 1190
II.
SYBIL ATTACK
In order to detect the Sybil attacks communicate
in different forms in which the network is
attacked[4].
a.
b.
c.
DirectVs Indirect Communications.

Fabricated Vs Stolen Identities.
Simultaneous Vs Non-Simultaneous.
Sybil Nodes communicate directly withlegitimate

nodes, but a legitimate node is not able to
communicate directly with Sybil node, but
communicates through malicious nodes.In the
fabricated identities, attacker creates arbitrary
newidentities.In the Stolen Identities, attacker assigns
legitimate
identitiestoSybil
nodes.Inthe
simultaneouscommunication,process is carried with
the participation of identities at once, but the non
simultaneous,
large
numbers
of
identities
communicate over a period of time. There are several
SybilattackProtocols such as distributed storage,
routing, data aggregation, voting, fair resource
allocation and misbehavior detection.

ISSN: 2278-2397
3) Data Aggregation
Some sensor network protocols aggregate the
reading of sensors in order to conserve energy
ratherthan returning individual readings. By Sybil
attack,one malicious node may be able to alter the
reading.
Figure 3. Data Aggregation
4) Voting
In Wireless Sensor Network, most of the
decisions are made by voting. Since the Sybil node
has many identities, a single node has a chance of
voting many times, thus destructing the process.
B. Sybil attack protocols

In a Sybil attack, a malicious node can generate
and control a large number of identities on a single
physical device. This gives the illusion to the network
in different legitimate nodes. It can affect the
following important protocols [8].
1) Distributed Storage
Attack on replication and fragmentation,
mechanism. Data will be stored Sybil Identities [10].
Figure 4. Stuff the Ballot Box
Black Mail Attack
5) Fair Resource Allocation

Sybil attack can be used in fair resourceallocation
which will allow a malicious node to obtain unfair
share of resources.
Figure 1. Distributed Storage
2) Routing
In multipath or disparity routing in, seemingly
disjoint paths could in fact go through a single
malicious node presenting Sybil identities.
Figure 5. Fair Resource Allocation
6) Misbehavior Detection
Sybil nodes can be used to spread the blame in a
misbehavior detection network.
C. Problem Statement
Figure 2. Routing
Many distractions caused in the routing system.

The problems caused by the Sybil attack are
1186

Pages: 1185 1190
threading, voting system, fair resource allocation,
data aggregation and misbehavior detection.
D. Existing System
Messages are passed from sender to destination
(receiver) without any security. Sybil attacks pose a
serious threat to such networks. A Sybil attacker can
either create more than one identity on a single
physical device in order to launch a coordinated
attack on the network or can switch identities in order
to weaken the detection process, thereby promoting
lack of accountability in the network. Message header
holds source node information which sends the
message to receiver. Hackers can easily change that
header information and send to destination. Thereis
much loss of data and not a secure process on the
network.
1) Disadvantages
In the destination process the information from
hackers or malicious user gives wrong message.
There is no server to detect the hackers.
E. Proposed System
In this proposed system, hackers cannot act as
source, because one centralized server is maintaining
to check authentication of source. Hence it blocks
unauthorized users or hackers. We have to provide a
key based data transmission and Id based network.
Our proposed system is using the Neighbor Discover
DistanceAlgorithm(NDDA) to transfer the data in
source to destination without any damage or loss as
well as each node to have the neighbors node
address. Depends on the address the data will be
transmitted into correct destination. If they have any
packet loss or some collisionsin network,
immediately it will inform the server to stop the data
transmission and it maintains the source node
information and header information. In our proposed
method to use secure and avoid the attacking system
on the network,it checks the users using those details
whether they are attackers or normal user.
1) Advantage
To improve the network performance, we have to
reduce the packet delay and detect the attacker. The
data are sent through destination without any loss.
The data are delivered or transmitted quickly from
source to destination.
III.
IMPLEMENTATION
Byusing
Neighbors
Discover
Distance
Algorithms(NDDA), the implementation of Sybil
attack detection is done.
Step 1: Each node hasto know the neighbors node
address.
Step 2: If neighbors node is centralized server
nodes then stored data or else keepsearching for the
centralized node.

ISSN: 2278-2397
Step 3: The server nodes will have all the source

data, as well as destination address.
Step 4: Each node has the individual keys.
Depending on the keys the centralized server is to
identify the destination address.
Step 5: NDD algorithm has a centralized server
method and it is used to prevent the data from any
attackers.
Step 6: The destination node will easilycheck
whether the data is correct or not.
Step 7: If any attackers damage the data then the
data is again sent to the destination on centralized
server.
F. Pseudo code:
In this actual research, work has been proposed as
Neighbour Discover Distance Algorithm as shown
below.
procNDD_schedule { }
{
state_ = IDLE;
sendAddr_ = -1;
recvAddr_ = -1;
state_ = streaming;
if (lastRxFrag_ != ch->uid()) {
lastRxFrag_ = ch->uid();
rxMsgDone(p);
}
else { Packet::free(p);
ifyncFlag_)
checkToSend();
} if (cf->duration > 0) {
updateNav(cf->duration);
if (state_ == IDLE || state_ == CR_SENSE)
sleep();
} state_ = IDLE;
nodeId =
amac_MAX_NUM_NEIGHBORS;
schedId =
amac_MAX_NUM_SCHEDULES;
for (i = 0; i<amac_MAX_NUM_NEIGHBORS; i++)
{
if (neighbList_[i].state > 0 &&
neighbList_[i].nodeId == sf->srcAddr)
{nodeId = i;
schedId = neighbList_[i].schedId;
}}
Packet *p = Packet::alloc();
ch->uid() = 0;
ch->ptype() = PT_amac;
ch->size() = SIZEOF_amac_CTRLPKT;
ch->iface() = UNKN_IFACE.value();
ch->direction() = hdr_cmn::DOWN;
ch->error() = 0; /*
bzero(cf, MAC_HDR_LEN);
cf->length = SIZEOF_dtcar_CTRLPKT;
cf->type = ACK_PKT;
cf->srcAddr = index_;
cf->dstAddr = recvAddr_;
cf->duration = duration - durCtrlPkt_;
1187

Pages: 1185 1190
if (chkRadio()) {
transmit(p);
return 1;
}
else
return 0;
}

ISSN: 2278-2397
circular sensing area. Topology is performed by these

sender, receiver and intermediate.
I. Node Creating
Source
1
Source 2
Using of 20 nodes as samples for a particular

distance. Each node knows its location and it is
related to the sink. The access point has to receive
transmit packets then send acknowledgement to the
transmitter.
Source
3
J. Neighbors Discover Distance (NDD)
In these algorithm used in our Manet, each and

every nodes knows the neighbor address. Depending
on the address you can easily transfer the data to
destination without any attack or packet loss.
3
1
Base
Station
K. Sybil Attack
The attacker uses different identities at the same
time. A single attacker could pretend nodes to report
the existence of a false bottleneck in traffic.
MANETs are mainly related to illegally gathering
sensitive information about mobile nodes. To relate
between a source and its destination, affect on data
during transmission time in network.
Data
Transmissio
n
Data
Transferred
Attackers
Key Gen
Destination
L. Random Key Distributor

Figure 6. Flow of data from Source to Destination
In the above Figure 6,consist of three cases are

discussed.
Case1: The data is sent from source to destination
without any anomalies via base station.
Case2: The data is sent from source to destination
without any anomalies via data transmission.
Case 3: The data transmission is interrupted
andmanipulated before it reaches the destination. In
our proposal the prevention method is introduced to
stop the anomaly cases such as case 3 from occurring.
IV.
Methodology
In this actual research work
methodologies are used.
different
G. Wireless Network Configures Setting

Wireless Mobile Ad hoc Networks create a
number of nodes. The packets are sent and
receivedbetween the source and destination. It is
based upon the scheme of packets delivered for ACK
packet drop on the nodes. In this network we are
crossing many intermediates to reach the source and
destination. Data processing is transmitted through
the neighbor nodes.
H. Topology Design
Designing of several nodes at a particular distance
without using any cables. The packet data are
transmitted from sender to receiver. In this topology
network design, the base station acts as a center of the
Random key distribute relate to every node on the

network. If they have key access to the data from the
source node, it will have more security and efficient
data transmission.
M. Passive Ad Hoc Identifier
A Passive Ad hoc Identity for Sybil Attack
Detection (PAISAD), a single node can detect Sybil
attacks by recording the identities, namely the MAC
or IP addresses of other nodes.While transmitting on
the network,it uses a neighbor nodes list to watch
collision or dropping on network.
V.
SIMULATION TOOL
N. Network Simulator 2
After setting up the platform, software named ns2
was set up on it which was used for all the analysis
and simulation work apart from other tools used. NS2
is the de facto standard for network simulation. Its
behavior is highly trusted within the networking
community. NS2 is an object oriented simulator,
written in C++, with an OTcl interpreter as a
frontend. Most of the simulation scripts are created in
Tcl. If the components have to be developed for ns2,
then both Tcl and C++ have to be used. Ns2 uses two
languages because any network simulator, in general,
has two different kinds of things it needs to do. The
detailed simulations of protocols require a systems
programming language which can efficiently
manipulate bytes, packet headers, and implement
algorithms that run over large data sets. On the other
hand, a large part of network research involves
1188

Pages: 1185 1190

ISSN: 2278-2397
slightly varying parameters or configurations, or

quickly exploring a number of scenarios.
TABLE 5.1 SIMULATION P ARAMETER
Parameter
Channel/WirelessChannel
TwoRayGround
Phy/WirelessPhy
Mac/802_11
Queue/DropTail/PriQueue
LL
Antenna/OmniAntenna
50
71
AODV
1200
1200
10.0
O. Simulation Result
Description
channel type
radio-propagation model
network interface type
MAC type
interface queue type
link layer type
antenna model
max packet in ifq
number of mobilenodes
routing protocol
X
dimension
of
topography
Y
dimension
of
topography
time of simulation end
Fig 2. Sybil Attack upto 4.00 Min. [Red Color]

C.Trace Graph
Graph is an essential part of displaying a result, so
we plot a graph to show a various result comparison
with packets, throughput, delivery ratio, network
delay, energy efficient and etc.
Fig 1.No Sybil Attack upto 3.20 Min.

Fig 3.Repeated Sybil Attack upto 4.50 [ Red Color]
VI.
CONCLUSION
In this article, we discussed various existing
methods for the detection of Sybil attacks which has
been analyzed and a new Neighbor Discover Distance
Algorithm is proposed for detection of Sybil attack in
wireless sensor network. Using this algorithm we can
stop the Sybil node attacks. In future work we can
propose a new Sybil attack or defense mechanisms.
Effective scheme for validation of simulation
parameters used is recommended to use of various
other protocols and algorithm.
REFERENCES
Fig 2. Sybil Attack upto 4.00 Min. [Red Color]
[1]
Chen, Geng Yang and Shengshou Chen. A Security Routing

Mechanism against Sybil Attack for Wireless Sensor
1189

Pages: 1185 1190
Networks.International Conference on Communications and
Mobile Computing, 2010.
[2] Douceur, J.R., The Sybil attack, In First International
Workshop on Peer-to Peer Systems (IPTPS02), Mar. 2002.
[3] Karlof, C. and Wagner Secure routing in wireless sensor
networks: attacks and countermeasures Adhoc Networks,
2003, 1(2-3): pp 293-315.
[4] Kuo-FengSsu, Wei-Tong Wang, Wen-Chung Chang,
Detecting Sybil attacks in Wireless Sensor Networks using
neighboring information, Computer Networks 53 (2009)
30423056.
[5] Madden, S. M. J. Franklin, J. M. Hellerstein, and W. Hong.
TAG: a tiny aggregation service for ad hoc sensor networks.
In Symposium on Operating Systems Design and
Implementation, Nov. 2002.
[6] Newsome J., E. Shi, and D. Song, The Sybil Attack in
Sensor Network: Analysis & Defenses, The Third
International Symposium on Information Processing in
Sensor Networks (IPSN04), Berkeley, California, USA:
ACN Press, 2004, pp.185-191.
[7] Pramo A.V, Md. Abdul Azeem, M. OM PRAKASH
Detecting the Sybil Attack in Wireless Sensor Network,
International Journal of Computers & Technology, ISSN:
2277-3061 Volume 3, No. 1, Aug, 2012.
[8] QiuHui-Min. Principle of Sybil attack and the defense,
Network and Computer Security, Vol. 10, pp.63-65, October
2005.
[9] Shaohe L, Xiaodong, W.F., Xin, Z., and Xingming.
Z.,Detecting the Sybil Attack Cooperatively in Wireless
Sensor Networks, in International Conference on
Computational Intelligence and Security, CIS 08. Vol.1
2008, pp. 442 - 446.
[10] Sharmila S., G Umamaheswari, Detection of Sybil Attack
in Mobile Wireless Sensor Networks, [IJESAT]
International Journal of Engineering Science & Advanced
Technology, Volume-2, Issue-2, pp. 256 262.
[11] Wang, J. Yang, G. Sun, Y. et al., Sybil attack detection
based on RSSI for wireless sensor network, WiCom07:
International Conference on Wireless Communications,
Networking and Mobile Computing, September 2007, pp.
2684-2687, 21-25.

ISSN: 2278-2397
International and National Conferences and has

published research articles in leading Journals. She is
an active researcher and is usually associated with
reputed Academic Forums and Associations of
research interest.
AUTHORSPROFILES
Mr. A. MURUGANANDAM, is an
Assistant Professor cum Head,
Department of Computer Science,
Don Bosco College, Dharmapuri,
Tamilnadu, India. He is a
Research Scholar in the field of
Wireless Sensor Networks at Bharathiyar University,
Coimbatore, Tamilnadu, (India).Hisresearch is
focused on Data hiding method for preventive and
selective jamming attacks in Wireless Sensor
Network
Dr. R. ANITHA is currently
working as Professor & Director
in the Department of Master of
Computer
Applications,
uthayammal
Engineering
College, Rasipuram, Tamilnadu,
India. She has aobtained her
MCA Degree from Bharathidasan University,
Tiruchirappalli, and Ph.D. from Periyar University,
Salem. She has vast experience in teaching as well as
research. She has presented papers at several
1190

Passive Adhoc Identity For Sybil Attack Detection Using NDD Algorithm

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Passive Adhoc Identity For Sybil Attack Detection Using NDD Algorithm

Hochgeladen von

Copyright:

Verfügbare Formate

International Conference on Computing and Intelligence Systems

Pages: 1185 1190

Volume: 04, Special Issue: March 2015