International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882

Volume 4, Issue 3, March 2015

Survey on Malicious Node Detection and Reliable

Data Fusion in MANET
Sindhuja.K UG Scholar, Dept. of IT, IFET College of Engineering, Villupuram, India
NasrinBanu.A UG Scholar, Dept. of IT, IFET College of Engineering, Villupuram, India
Elavarasi.K Assistant Professor, Dept. of IT, IFET College of Engineering, Villupuram, India

ABSTRACT
One of the research issues in Wireless Sensor Networks
(WSNs) is how to efficiently organize sensors to cover
an area. A byzantine attack in wireless SEnsor Networks
with Mobile Access (SENMA) points is deliberated. One
effective method to fight with Byzantine attacks is the qout-of-m scheme. Byzantine sensors that reduce the
detection error exponent are achieved using a WaterFilling procedure. To show that for a fixed proportion
of malicious sensors, the detection precision of the
simplified q-out-of-m scheme increases almost
exponentially as the network size increases. A
distributed scheme is designed to attain, preserve, and
update trust records associated with the behaviours of
nodes forwarding packets and the activities of making
recommendations about other nodes. It has been
assumed that the local sensors detection acts, namely
either the local sensors Signal-to-Noise Ratios (SNRs)
or their probabilities of detection and false alarm.
KEYWORDS- SENMA, Water-filling,
scheme, Signal-to-Noise Ratio.

I.

the attacker to extract information from sensor

transmissions. As a result, the adversary can hire a wide
range of strategies including deploying its own sensors
aimed at blocking the transmission of honest sensors or,
in a more refined way, transmitting optimally designed
signals to confuse the fusion center [6].
For the Byzantine sensors, we adopt an approach
that awards the intruder with more power than usually
allowed in practice, which leads to a conservative
assessment of security risk but gains in systematic
tractability. This statement obviously is difficult to
satisfy in practice; it would require that the attacker has a
separate network that allows Byzantine sensors to
cooperate among themselves.

q-out-of-m

INTRODUCTION

Wireless sensor networks have established use

in a variety of different claims including military, health
and environmental monitoring [1] [2]. Many of these
applications require secure and trusted communications,
and have attracted important attentions from the research
municipal [3]. However, integrating security into these
wireless sensors network is inspiring due to the limited
memory, processing capability, and restricted energy
supply. These constraints motivated the creation of a
new architecture known as sensor networks with mobile
access (SENMA) [4] [5]. The compromised sensors are
referred to as Byzantine and they can be reprogrammed
by the intruder to attack the fusion center by transmitting
fabricated observations. Wireless sensor networks are
vulnerable to Byzantine attacks, where the adversary has
full control over some of the authenticated nodes and can
perform arbitrary behavior to disrupt the system.
Moreover, the wireless transmission medium is
more exposed to interfering, which makes it likely for

Fig. 1: Malicious node detection in routing path

For both the case where the total number of
sensors is well-known and the wireless channels are
lossless, and the case where the number of sensors is
random and the wireless channels have non-negligible
error rates, the exact system level probability of
detection is derived analytically. Some calculation
methods are also proposed to attain an exact estimate of
the probability of detection, while at the same time to
reduce the computation load significantly. To obtain a
better system level detection performance, the local
sensor level decision threshold is determined such that it
maximizes the system level deflection coefficient.
However, in large wireless sensor networks and under
complex target signal models, the local sensor

www.ijsret.org

202

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 3, March 2015

performance metrics may not be known or may be very

difficult to estimate.

II.

LITERATURE SURVEY

In this paper, we consider reliable data fusion in

wireless sensor networks with mobile access points
(SENMA) [7] under both static and dynamic Byzantine
attacks, in which the malicious nodes report false
evidence with a fixed or time-varying possibility,
respectively. In SENMA, the mobile access point (MA)
traverses the network and collects the sensing
information from the individual sensor nodes. The
adversary has full control over some of the authenticated
nodes and can perform arbitrary behaviour to disrupt the
system [8]. Furthermore, if the sensing reports represents
a hard-decision (yes or no), it has been shown that
using the OR rule to find the final sensing decision leads
to a very high false alarm probability. The approach is to
moderate the Byzantine attacks using the q-out-of-m
scheme, for which the final decision is based on q
sensing reports out of m, polled nodes. This makes the qout-of-m scheme a potential applicant for large scale
sensor networks. Further the examined performance of
this approach is under both static and dynamic attacking
strategies [9]. The q-out-of-m rule is popular in
distributed detection and can achieve a good trade-off
between the miss detection probability and the false
alarm rate.
A realistic approach is to minimize the worst miss
detection probability, which guarantees that the miss
detection probability will not exceed that advertised the
worst case, no matter which distribution is used by the
Byzantine sensors. The Byzantine model assumed in this
paper was originally proposed by Lamport, Shostak and
Pease [10] and further developed by Dolev [11] and later
in the information theoretic context by Pfitzmann and
Waidner [12].It can, however, severely degrade the
presentation of the network, and the attacking
distributions that achieve this goal are hypothesisreversed: when the true state of the nature is, infected
sensors deliver data according to the distribution that
actually pertains to hypothesis, and vice versa. The
practical consequence is a saturation effect: increasing
the number of per-sensor observations beyond a certain
amount does not provide any significant improvement
[6]. For a large WSN consists of densely deployed lowcost and low-power sensors, in our previous work the
proposed approach for counting rule that uses the total
number of detections (1s) transmitted from local
sensors as the fusion statistic [13] [14]. It is assumed that
either the total number of sensors in the Region of

Interest (ROI) or its expected value is very large, so that

performance evaluation based on the Central Limit
Theorem (CLT) can be carried out. However, the
assumption of a large number of sensors is not always
true. Another assumption was that the ROI is very large.
The system level detection performance and its
approximations are derived. The problem of designing
the local sensor level threshold is investigated [15].
In distributed detection, due to power and
bandwidth constraints, each sensor, instead of sending
its raw data, sends quantized data (local decision) to a
central observer or Fusion Center (FC). The FC
combines these local decisions based on a fusion rule to
come up with a global decision. To address the scenario
of unknown local sensor performance metrics, it
employs the total number of detections (also referred to
as the count statistic) as a decision statistic at the FC
[16]. The fusion rule based on the count statistic leads to
a decision rule where the sensor decisions are weighed
equally, even though the SNR at each sensor may be
different. In general, obtaining the optimal local decision
rules has been shown to be a very difficult problem
under the conditional independence assumption, it has
been shown that the use of identical local decision rules
is optimal under asymptotic conditions.
Due to their distributed nature, ad hoc networks
are vulnerable to various attacks. One strategy to
improve security of ad hoc networks is to develop
mechanisms that allow a node to evaluate
trustworthiness of other nodes. Such mechanisms not
only help in malicious node detection, but also improve
network performance because honest nodes can avoid
working with less trustworthy nodes. The focus is to
develop a framework that defines trust metrics using
information theory and develops trust models of trust
propagation in ad hoc networks [17]. The proposed
theoretical models are then applied to improve the
performance of ad hoc routing schemes and to perform
malicious node detection. The trust evaluation has been
extensively performed for a wide range of applications,
including public key authentication, electronic
commerce, peer-to-peer networks, and ad hoc and sensor
networks.
The algorithm is distributed and asynchronous:
every node needs to communicate with only those nodes
that are within its communication range. The algorithm
is based on the iterative computation of a fictitious
electrical potential of the nodes. The convergence rate
of the underlying iterative scheme is independent of the
size and structure of the network. We demonstrate the

www.ijsret.org

203

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 3, March 2015

effectiveness of the proposed algorithm through

simulations and a real hardware implementation [18].
We solve the k-coverage sensor deployment problem to
achieve multi-level coverage of an area I. We consider
two sub-problems: k-coverage placement and distributed
dispatch problems. The placement problem asks how to
determine the minimum number of sensors required and
their locations in I to guarantee that I is k-covered and
the network is connected; the dispatch problem asks how
to schedule mobile sensors to move to the designated
locations according to the result computed by the
placement strategy such that the energy consumption
due to movement is minimized [19].
Our solutions to the placement problem
consider both the binary and probabilistic sensing
models, and allow an arbitrary relationship between the
communication distance and sensing distance of sensors.
We first consider the problem of finding the optimal
fusion rule under the constraint of fixed local sensor
thresholds and fixed Byzantine strategy [20]. Next, we
consider the problem of joint optimization of the fusion
rule and local sensor thresholds for a fixed Byzantine
strategy. Then we extend these results to the scenario
where both the FC and the Byzantine attacker act in a
strategic manner to optimize their own utilities.

III.

CONCLUSION

Nowadays, Wireless sensor networks have

received signicant consideration and it is limited by the
processing capability and power supply of the sensor
nodes, integrating the security. It provides a distributed
detection techniques to identify the malicious node and
reliable data fusion in the network. It is found that:
without pre-detection, the system has the worst act under
the static attack where the malicious sensors always send
false evidence; when pre-detection is enforced, the
system delivers much lower false alarm rates under both
static and dynamic attacks, while satisfying the imposed
miss detection constraint. The nodes which are
participating in the paths are been authenticate before it
enters the routing phase so malicious node which may
create link failure are been avoided. And we use the
alternate paths to be used in case of link failure occurs
and it avoids reroute discovery to be done.

IV.

FUTURE WORK

It may try to improve the results of the whole system

and reduce the complexity of the model. Optimizing the
parameters present in the algorithm reduces the training

time. More reduction techniques may be referred to get

valuable features in future.

REFERENCE
[1] Bharathidasas and V. Anand, Sensor networks: An
overview, Technical report, Dept. of Computer Science,
University of California at Davis, 2002.
[2] Chong and S. Kumar, Sensor networks: evolution,
opportunities, and challenges, Proceedings of the IEEE,
vol. 91, no. 8, pp. 1247 2056, aug. 2003.
[3] Karlof, N. Sastry, and D. Wagner, Tinysec: a link
layer security architecture for wireless sensor networks,
in Proceedings of the 2nd international conference on
Embedded networked sensor systems, ser. SenSys 04.
New York, NY, USA: ACM, 2004, pp. 162175.
[Online].
Available:
http://doi.acm.org/10.1145/1031495.1031515
[4] L. Tong, Q. Zhao, and S. Adireddy, Sensor
networks with mobile agents, in Military
Communications Conference, MILCOM 2003, IEEE,
vol. 1, oct. 2003, pp. 688 693.
[5] S. Marano, V. Matta, and L. Tong, Distributed
detection in the presence of byzantine attack in large
wireless sensor networks, in Military Communications
Conference, MILCOM 2006, IEEE, oct. 2006, pp. 14.
[6] S. Marano, V. Matta, and L. Tong, Distributed
Detection in the Presence of Byzantine Attacks, IEEE
Trans. Signal Processing, vol. 57, no. 1, pp. 16-29, Jan.
2009.
[7] G. Mergen, Z. Qing, and L. Tong, Sensor Networks
with Mobile Access: Energy and Capacity
Considerations, IEEE Trans. Comm., vol. 54, no. 11,
pp. 2033-2044, Nov. 2006.
[8] B. Awerbuch, R. Curtmola, H. D., N.-R. C., and R.
H., Mitigating byzantine attacks in ad hoc wireless
networks, Technical report version 1, mar. 2004.
[9] M. Abdelhakim, L. Lightfoot, and T. Li, Reliable
Data Fusion in Wireless Sensor Networks under
Byzantine Attacks, Proc. IEEE Military Comm. Conf.,
Nov. 2011.
[10] L. Lamport, R. Shostak, and M. Pease, The
Byzantine generals problem, ACM Trans. Program.
Languages Syst., vol. 4, pp. 382401, Jul. 1982.
[11] D. Dolev, The Byzantine generals strike again, J.
Algorithms, vol. 3, no. 1, pp. 1430, 1982.
[12] B. Pfitzmann and M.Waidner, Information
Theoretic Pseudo signatures and Byzantine Agreement
for t>= n/3 1996, IBM Research Report, Tech. Rep.
RZ2882.
[13] R. Niu, P. K. Varshney, and Q. Cheng, Distributed
detection in a large wireless sensor network, Int. J. Inf.
Fusion, vol. 7, no. 4, pp. 380394, Dec. 2006.

www.ijsret.org

204

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 3, March 2015

[14] R. Niu and P. K. Varshney, Distributed detection

and fusion in a large wireless sensor network of random
size, EURASIP J. WirelessCommun. Netw., vol. 2005,
no. 4, pp. 462472, Sep. 2005.
[15] R. Niu and P. Varshney, Performance Analysis of
Distributed Detection in a Random Sensor Field, IEEE
Trans. Signal Processing, vol. 56, no. 1, pp. 339-349,
Jan. 2008.
[16] Aditya Vempaty*, Student Member, IEEE, Priyadip
Ray, Member, IEEE, Pramod K. Varshney, Fellow,
IEEE False Discovery Rate Based Distributed
Detection in the Presence of Byzantines
[17] Y.L. Sun, W. Yu, Z. Han, and K. Liu, Information
Theoretic Framework of Trust Modeling and Evaluation
for Ad Hoc Networks, IEEE J. Selected Areas in
Comm., vol. 24, no. 2, pp. 305- 317, Feb. 2006.
[18] Prabir Barooah, Harsha vardhan Chenji,
RaduStoleru, and TamasKalmar-Nagy, Cut Detection
in Wireless Sensor Networks, IEEE transactions on
parallel and distributed systems, vol. 23, no. X xxx 2012.
[19] Y.-C. Wang and Y.-C. Tseng, Distributed
Deployment Schemes for Mobile Wireless Sensor
Networks to Ensure Multilevel Coverage.
[20] Bhavya Kailkhura, Swastik Brahma, Yunghsiang S.
Han, Pramod K. Varshney, Optimal Distributed
Detection In The Presence Of Byzantine.

Mrs.K.ELAVARASI received the

M.E. (Computer Science & Engineering) degree from
IFET College of Engineering, Affiliated to Anna
University, Villupuram and she completed UG degree
from Idhaya Engineering College for women, Chinna
Salem. She is an Assistant Professor with the
Department of Information Technology, IFET College
of Engineering, and Affiliated to Anna University. Her
research interests are including Big Data, Data
Structures & Algorithms, and Mobile Computing. Email:
elavarasi07@gmail.com

AUTHORS BIOGRAPHY

Ms.K.SINDHUJA, Currently pursuing

B.Tech, Information Technology at IFET College of
Engineering, Villupuram, India. Her area of interests
includes Core Java, Mobile Computing and ASP.Net. Email: Sindhu.gowth@gmail.com

Ms.A.NASRIN BANU, Currently

pursuing B.Tech, Information Technology at IFET
College of Engineering, Villupuram,India. Her area of
interests includes OOPS concepts, Cryptography and
Cloud Computing. E-mail: nasren.anu@gmail.com

www.ijsret.org

205