A mobile ad hoc network is a wireless network in which no infrastructure is available. MANET is a selfconfiguring
network. Due to dynamic nature of MANET it is very challenging work to employ a secure route. The intermediate nodes cooperate with each other as there is no such base station or access point.The routing protocols play important role in transferring data. Cryptographic mechanisms are used in
routing protocols to secure data packets while transmitted in the network. But cryptographic techniques incur a high computational cost and can’t identify the nodes with malicious intention. So, employing cryptographic techniques in MANET are quite impractical as MANETs have limited resource and
vulnerable to several security attacks. Trust mechanism is used as an alternative to cryptographic technique. Trust mechanism secures data forwarding by isolating nodes with malicious intention using trust value on the nodes. In this paper we survey different trust based protocols of MANET and compare their
performances.
A Novel Energy Efficient and Administrator Based Secured Routing in MANETIJNSA Journal
The lack of static infrastructure causes several issues in mobile Ad Hoc network , such as energy utilization, node authentication and secure routing. In this paper we propose a new scheme for energy efficient secure routing of data packets in MANET. This approach will reduce the computational overhead to make it more energy efficient than existing schemes. As there is no stationary infrastructure,each node in MANET acts a router that forwards data packets to other nodes. Therefore selection of effective, suitable, adaptive and robust routing scheme is of utmost importance. We have reduced the amount of network activity for each node required to route a data packet. This leads to lesser wastage of energy and increases security.Our simulation results will show how this is energy efficient and
secure. Finally we have discussed how this scheme prevents various attacks which may jeopardize any wireless network.
Impact of black hole attack on aodv routing protocolZac Darcy
A
m
obile
a
d
-
hoc
n
etwork (MANET)
is a
collection
of wireless mobile nodes
that dynamically self
-
organize
to form an
arbitrary and temporary network.
The mobile nodes can communicate wit
h each other
without
any fixed infrastructure.
MANET
can be set
up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation.
The various severe security threats are
increasing
on the
MANET
. One of these secur
ity threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On
-
Demand Distance Vector (AODV) protocol. Th
e simulation is carried on
NS
-
2 and t
he simulation
results are analyzed
on
various network performance
metric
s such as packet delivery ratio, normalized
routing overhead
and
average end
-
to
-
end delay
Review of Flooding Attack Detection in AODV Protocol for Mobile Ad-hoc Networkijsrd.com
Ad Hoc Networks are extremely vulnerable to attacks due to their dynamically changing topology, absence of conventional security infrastructures, vulnerability of nodes and channels and open medium of communication. Denial of Service (DoS) and Distributed DoS (DDoS) attacks are two of the most harmful threats to the network functionality. The Prevention methods like authentication and cryptography techniques alone are not able to provide the security to these types of networks. Therefore, efficient intrusion detection must be deployed to facilitate the identification and isolation of attacks. Major attacks on Mobile Ad hoc networks are flooding, selective forwarding, sinkhole, wormhole etc. We have presented various intrusion detection techniques in MANET. Then we have proposed a method to detect flooding attack in MANET.
Secure Routing using Detection Method in Wireless Ad Hoc networkijsrd.com
An Ad Hoc network is the collection of multiple nodes which can work together and they can send data over multiple hopes without any infrastructure like base station and antenna. Each node acts as a system and router. Many of the routing protocols of Ad Hoc network are designed based on the assumption that every node forwards every packet but practically many of them act as selfish nodes, they use network and its service but don't cooperate with other nodes so as to save resources for themselves. This paper discusses the types of availability attack, malicious activity of selfish node, a Survey of techniques used to detect selfishness attack and some approach to detect selfishness attack.
Analysis of Blackhole Attack in AODV and DSR IJECEIAES
Mobile Ad-Hoc Networks (MANETs) are supreme ruler and demoralization wireless scheme. MANETs are infrastructure less i.e. their structure is not fixed, and the nodes be able to move about and can leave the network whenever they want. The nodes are to perform as more over router and host. In MANETs, the node can be in contact with every node as their configuration is not fixed and the nodes starts transmitting the packets to each other for the establishment of the connection. To hitch the link, the nodes make use of some routing protocols like Ad-Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and DestinationSequenced Distance Vector (DSDV). Security in MANET is the key matter meant for the fundamental utility of network. There are many attacks caused in MANET. Blackhole attack is one that occurs in MANET. A Black hole attack is an attack where the node, which is malicious advertise itself as having the optimal route to the destination and drops all the packets instead of forwarding further t o the destination. Here, we have shown the blackhole attack in AODV and DSR. Through simulation we evaluate the performance of the two above protocols under blackhole attack.
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...cscpconf
In this paper, we have taken out the concern of security on a Medium Access Control layer
implementing Assured Neighbor based Security Protocol to provide the authentication,
confidentiality and taking in consideration High speed transmission by providing security in
parallel manner in both Routing and Link Layer of Mobile Ad hoc Networks. We basically
divide the protocol into two different segments as the first portion concentrates, based on
Routing layer information; we implement the scheme for the detection and isolation of the
malicious nodes. The trust counter for each node is maintained which actively increased and
decreased considering the trust value for the packet forwarding. The threshold level is defined differencing the malicious and non malicious nodes. If the value of the node in trust counter lacks below the threshold value then the node is considered as malicious. The second part focus on providing the security in the link layer, the security is provided using CTR (Counter) approach for authentication and encryption. Hence simulating the results in NS-2, we come to conclude that the proposed protocol can attain high packet delivery over various intruders while attaining low delays and overheads.
Placate packet dropping attack using secure routing protocol and incentive ba...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A Novel Energy Efficient and Administrator Based Secured Routing in MANETIJNSA Journal
The lack of static infrastructure causes several issues in mobile Ad Hoc network , such as energy utilization, node authentication and secure routing. In this paper we propose a new scheme for energy efficient secure routing of data packets in MANET. This approach will reduce the computational overhead to make it more energy efficient than existing schemes. As there is no stationary infrastructure,each node in MANET acts a router that forwards data packets to other nodes. Therefore selection of effective, suitable, adaptive and robust routing scheme is of utmost importance. We have reduced the amount of network activity for each node required to route a data packet. This leads to lesser wastage of energy and increases security.Our simulation results will show how this is energy efficient and
secure. Finally we have discussed how this scheme prevents various attacks which may jeopardize any wireless network.
Impact of black hole attack on aodv routing protocolZac Darcy
A
m
obile
a
d
-
hoc
n
etwork (MANET)
is a
collection
of wireless mobile nodes
that dynamically self
-
organize
to form an
arbitrary and temporary network.
The mobile nodes can communicate wit
h each other
without
any fixed infrastructure.
MANET
can be set
up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation.
The various severe security threats are
increasing
on the
MANET
. One of these secur
ity threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On
-
Demand Distance Vector (AODV) protocol. Th
e simulation is carried on
NS
-
2 and t
he simulation
results are analyzed
on
various network performance
metric
s such as packet delivery ratio, normalized
routing overhead
and
average end
-
to
-
end delay
Review of Flooding Attack Detection in AODV Protocol for Mobile Ad-hoc Networkijsrd.com
Ad Hoc Networks are extremely vulnerable to attacks due to their dynamically changing topology, absence of conventional security infrastructures, vulnerability of nodes and channels and open medium of communication. Denial of Service (DoS) and Distributed DoS (DDoS) attacks are two of the most harmful threats to the network functionality. The Prevention methods like authentication and cryptography techniques alone are not able to provide the security to these types of networks. Therefore, efficient intrusion detection must be deployed to facilitate the identification and isolation of attacks. Major attacks on Mobile Ad hoc networks are flooding, selective forwarding, sinkhole, wormhole etc. We have presented various intrusion detection techniques in MANET. Then we have proposed a method to detect flooding attack in MANET.
Secure Routing using Detection Method in Wireless Ad Hoc networkijsrd.com
An Ad Hoc network is the collection of multiple nodes which can work together and they can send data over multiple hopes without any infrastructure like base station and antenna. Each node acts as a system and router. Many of the routing protocols of Ad Hoc network are designed based on the assumption that every node forwards every packet but practically many of them act as selfish nodes, they use network and its service but don't cooperate with other nodes so as to save resources for themselves. This paper discusses the types of availability attack, malicious activity of selfish node, a Survey of techniques used to detect selfishness attack and some approach to detect selfishness attack.
Analysis of Blackhole Attack in AODV and DSR IJECEIAES
Mobile Ad-Hoc Networks (MANETs) are supreme ruler and demoralization wireless scheme. MANETs are infrastructure less i.e. their structure is not fixed, and the nodes be able to move about and can leave the network whenever they want. The nodes are to perform as more over router and host. In MANETs, the node can be in contact with every node as their configuration is not fixed and the nodes starts transmitting the packets to each other for the establishment of the connection. To hitch the link, the nodes make use of some routing protocols like Ad-Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and DestinationSequenced Distance Vector (DSDV). Security in MANET is the key matter meant for the fundamental utility of network. There are many attacks caused in MANET. Blackhole attack is one that occurs in MANET. A Black hole attack is an attack where the node, which is malicious advertise itself as having the optimal route to the destination and drops all the packets instead of forwarding further t o the destination. Here, we have shown the blackhole attack in AODV and DSR. Through simulation we evaluate the performance of the two above protocols under blackhole attack.
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...cscpconf
In this paper, we have taken out the concern of security on a Medium Access Control layer
implementing Assured Neighbor based Security Protocol to provide the authentication,
confidentiality and taking in consideration High speed transmission by providing security in
parallel manner in both Routing and Link Layer of Mobile Ad hoc Networks. We basically
divide the protocol into two different segments as the first portion concentrates, based on
Routing layer information; we implement the scheme for the detection and isolation of the
malicious nodes. The trust counter for each node is maintained which actively increased and
decreased considering the trust value for the packet forwarding. The threshold level is defined differencing the malicious and non malicious nodes. If the value of the node in trust counter lacks below the threshold value then the node is considered as malicious. The second part focus on providing the security in the link layer, the security is provided using CTR (Counter) approach for authentication and encryption. Hence simulating the results in NS-2, we come to conclude that the proposed protocol can attain high packet delivery over various intruders while attaining low delays and overheads.
Placate packet dropping attack using secure routing protocol and incentive ba...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Performance evaluation of various types of nodes in manet with dsr routing pr...eSAT Journals
Abstract Day by day, wireless communication popularity growing fast, it has led wireless communication data rates higher and made its prices cheaper, that’s why wireless communication is growing so fast. The latest technological demands now a day’s arising from laptops, wireless devices such as wireless local area networks (LANs) etc. In this paper we compared different types of node in MANET like static nodes, dynamic nodes and dynamic nodes with trajectory by using Dynamic routing protocol (DSR) and compared the performance of these nodes by using OPNET simulator 14.5. The performance is evaluated under different parameters like Data Dropped (Retry Threshold Exceeded), Load, Media access delay and Network Load by using FTP load. Keywords: MANET, Peak Value, Protocol, Trajectory.
Security Enhancement using Trust Management in MANETsIJTET Journal
Abstract— The distinctive options of mobile ad hoc networks (MANETs), victimization recent advances in unsure reasoning originated from AI community, we tend to projected a unified trust management schemes Mobile Ad-hoc networks area unit self-organizing and self re-configuring multi hop wireless networks wherever, the structure of the network changes dynamically the safety of the OLSR protocol is rib by a selected variety of attack known as ‗Black Hole‘ attack. During this attack a malicious node advertises itself as having the shortest path to the destination node. To combat with region attack, it\'s projected to attend and check the replies from all the neighboring nodes to search out a secure route with protection to our data, however this approach suffers from high delay. Associate in Nursing approach is projected to combat the region attack by victimization Trust management schemes with neighbors WHO claim to possess a route to destination. during this project we tend to area unit victimization NS2.34 software system for our projected model testing. and that we got the simplest result against the safety attack.
Mobile Ad Hoc Network (MANET) is one kind of new wireless network
structures which is also known as infrastructure less network. Unlike devices in traditional
wireless LAN solution, all nodes are movable and the topology of the network is changing
dynamically in an Ad Hoc Network, which brings great challenges to the security of Mobile
Ad Hoc Networks. MANET is particularly vulnerable to various types of security attacks
due to its fundamental characteristics e.g. the lack of centralized monitoring, dynamic
network topology, open medium, autonomous terminal and management. As a result,
attackers can take advantage of flaws in routing protocols to carry out various attacks. The
black hole attack is one of such security issue in MANET. It could disturb the routing
protocol and bring about huge damage to the network’s topology. In this attack, a malicious
node gives false information of having shortest route to the destination node so as to get all
data packets and drops it. In this paper, we propose an algorithm which mitigates the
impact of black hole attack in AODV routing.
Prevention of Malicious Nodes and Attacks in Manets Using Trust worthy MethodIJTET Journal
In Manet the first demand is co-operative communication among nodes. The malicious nodes might cause security issues like grey hole and cooperative attacks. To resolve these attack issue planning Dynamic supply routing mechanism, that is referred as cooperative bait detection theme (CBDS) that integrate the advantage of each proactive and reactive defence design is used. In region attacks, a node transmits a malicious broadcast informing that it's the shortest path to the destination, with the goal of intercepting messages. During this case, a malicious node (so-called region node) will attract all packets by victimisation solid Route Reply (RREP) packet to incorrectly claim that “fake” shortest route to the destination then discard these packets while not forwarding them to the destination. In grey hole attacks, the malicious node isn't abs initio recognized in and of itself since it turns malicious solely at a later time, preventing a trust-based security resolution from detective work its presence within the network. It then by selection discards/forwards the info packets once packets undergo it. During this we have a tendency to focus is on detective work grey hole/collaborative region attacks employing a dynamic supply routing (DSR)-based routing technique.
Survey on dynamic source routing, attacks and counter measures in wireless se...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Secure routing and data transmission in mobileIJCNCJournal
In this paper, we present an identity (ID) based protocol that secures AODV and TCP so that it can be used
in dynamic and attack prone environments of mobile ad hoc networks. The proposed protocol protects
AODV using Sequential Aggregate Signatures (SAS) based on RSA. It also generates a session key for each
pair of source-destination nodes of a MANET for securing the end-to-end transmitted data. Here each node
has an ID which is evaluated from its public key and the messages that are sent are authenticated with a
signature/ MAC. The proposed scheme does not allow a node to change its ID throughout the network
lifetime. Thus it makes the network secure against attacks that target AODV and TCP in MANET. We
present performance analysis to validate our claim.
Discovering adaptive wireless sensor network using β synchronizereSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Discovering adaptive wireless sensor network using eSAT Journals
Abstract When we consider the standard Bellman-Ford algorithm, it uses static values of link cost function and distance function. These static values are stored in sink node so that the sink node requires memory to keep data safe. Therefore the space, message and time complexity of a network and node increases. To overcome this we discover Fast Time Dependent Shortest Path algorithm with message and used in network with β synchronizer. The FTSP algorithm uses dynamic values of link cost function and distance function and to store these values we are using vector compression method so that there is no need to store the data into the sink node. Because of this the message, time and space complexity of node will be decreases. Keywords- Duty cycle, Time dependent, β synchronizer
A Study on Hardware and Software Link Quality Metrics for Wireless Multimedia...Eswar Publications
Due to the lack of accurate evaluation of the transmission characteristics of the wireless communication links, routing algorithms in wireless sensor networks may result in poor network performance. In order to avoid sending packets over the unstable link, routing protocol has to rely on noble metrics to choose better routing path. Better estimation of link reliability between neighboring nodes could permit the selection of a more reliable route. Since the routing metrics play an important role as they have a direct impact on the efficiency and robustness of routing protocols. Different routing metrics will provide different performances to routing protocols when used to compute weight of paths. This paper presents a study on various hardware and software link quality metrics that
help network protocol designers can choose an efficient Link Quality Estimator to develop reliable routing techniques for WMSNs. Additionally a classification tree of different routing metrics is presented which helps in understanding the strengths and weaknesses of these LQ metrics, thus enabling the designer of the routing protocol to make an informed choice.
Effective Identification of Packet Droppers and Modifiers in Wireless Sensor ...IJMTST Journal
In Wireless sensor network, sensor nodes are used to monitor physical or environmental condition. Sensor
networks are often deployed in an unattended and hostile environment to perform the monitoring and data
collection tasks. When it is deployed in such an environment, it lacks physical protection and subjected to
node compromise. After compromising one or multiple sensor nodes, an adversary may launch various
attacks to disrupt the in-network communication. Among these attacks, two common ones are dropping
packets and modifying packet. In this paper, we propose a simple yet effective scheme to identify
misbehaving forwarders that drop or modify packets. Node Categorization algorithm and Global Ranking
algorithm are
BLACKLIST MANAGEMENT USING A VERIFICATION REPORT TO IMPROVE THE ENERGY EFFICI...ijwmn
Recently, the applications scope of Wireless Sensor Networks (WSNs) has been broadened. WSN communication security is important because sensor nodes are vulnerable to various security attacks when deployed in an open environment. An adversary could exploit this vulnerability to inject false reports into the network. En-route filtering techniques have been researched to block false reports. The CFFS scheme
filters the false report by collaboratively validating the report by clustering the nodes. However, CFFS is not considered effective against repetitive attacks. Repeated attacks have a significant impact on network lifetime. In this paper, we propose a method to detect repetitive attacks with cluster-based false data
filtering and to identify the compromised nodes and quickly block them. The proposed scheme uses fuzzy logic to determine the distribution of additional keys according to the network conditions, thereby improving energy efficiency.
TRUST ASSESSMENT THROUGH FTA APPROACH IN AD-HOC NETWORKcscpconf
An Ad-hoc network consists of communicating nodes to establish improvised communicationwith environment without any fixed infrastructure. Nodes in Ad-hoc network (MANET) do not
rely on a central infrastructure management but relay packets sent by other nodes. Mobile adhoc network can work properly only if the participating nodes collaborate with routing. Therefore it is required that the nodes co-operate for the intensity of operator network. Because of the high mobility of the nodes in the network, detection of misbehaviour of any node is a complex problem. Nodes have to share the routing information in order for each to find the
route to the destination. This conceptual paper is based on the relationship among the nodes which makes them to co-operate in an ad-hoc network .This require nodes to Trust each other. Thus we can say Trust is a important concept in secure routing mechanism among the nodes. In this paper we present a unique Trust based method in which each node broadcast a RQ packet if
it is received from different neighbours. The secure, efficient and reliable route towards the destination is calculated as a weighted average of the Trust value of the nodes in the route, with respect to it’s behaviour observed by the neighbour nodes and the number of nodes in the route.
A Survey of Techniques Used To Detect Selfish Nodes in MANETijsrd.com
An mobile Ad Hoc network is a collection of mobile nodes. They do not have any existing infrastructure and they do not have any centralized administrator. So the MANET is self-creating, self-organizing and self-administrative wireless network. In MANET each node acts as router. In practice some of the nodes may act as the selfish nodes. These nodes use the network and its services but they do not cooperate with other nodes. Such selfish nodes do not consume any energy such as CPU power, battery and bandwidth for retransmitting the data of other nodes. They will preserve the resources for their own use. In this paper we have provide the comparative study of different type of methods to increase the selfish node detection and the network throughput
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Performance evaluation of various types of nodes in manet with dsr routing pr...eSAT Journals
Abstract Day by day, wireless communication popularity growing fast, it has led wireless communication data rates higher and made its prices cheaper, that’s why wireless communication is growing so fast. The latest technological demands now a day’s arising from laptops, wireless devices such as wireless local area networks (LANs) etc. In this paper we compared different types of node in MANET like static nodes, dynamic nodes and dynamic nodes with trajectory by using Dynamic routing protocol (DSR) and compared the performance of these nodes by using OPNET simulator 14.5. The performance is evaluated under different parameters like Data Dropped (Retry Threshold Exceeded), Load, Media access delay and Network Load by using FTP load. Keywords: MANET, Peak Value, Protocol, Trajectory.
Security Enhancement using Trust Management in MANETsIJTET Journal
Abstract— The distinctive options of mobile ad hoc networks (MANETs), victimization recent advances in unsure reasoning originated from AI community, we tend to projected a unified trust management schemes Mobile Ad-hoc networks area unit self-organizing and self re-configuring multi hop wireless networks wherever, the structure of the network changes dynamically the safety of the OLSR protocol is rib by a selected variety of attack known as ‗Black Hole‘ attack. During this attack a malicious node advertises itself as having the shortest path to the destination node. To combat with region attack, it\'s projected to attend and check the replies from all the neighboring nodes to search out a secure route with protection to our data, however this approach suffers from high delay. Associate in Nursing approach is projected to combat the region attack by victimization Trust management schemes with neighbors WHO claim to possess a route to destination. during this project we tend to area unit victimization NS2.34 software system for our projected model testing. and that we got the simplest result against the safety attack.
Mobile Ad Hoc Network (MANET) is one kind of new wireless network
structures which is also known as infrastructure less network. Unlike devices in traditional
wireless LAN solution, all nodes are movable and the topology of the network is changing
dynamically in an Ad Hoc Network, which brings great challenges to the security of Mobile
Ad Hoc Networks. MANET is particularly vulnerable to various types of security attacks
due to its fundamental characteristics e.g. the lack of centralized monitoring, dynamic
network topology, open medium, autonomous terminal and management. As a result,
attackers can take advantage of flaws in routing protocols to carry out various attacks. The
black hole attack is one of such security issue in MANET. It could disturb the routing
protocol and bring about huge damage to the network’s topology. In this attack, a malicious
node gives false information of having shortest route to the destination node so as to get all
data packets and drops it. In this paper, we propose an algorithm which mitigates the
impact of black hole attack in AODV routing.
Prevention of Malicious Nodes and Attacks in Manets Using Trust worthy MethodIJTET Journal
In Manet the first demand is co-operative communication among nodes. The malicious nodes might cause security issues like grey hole and cooperative attacks. To resolve these attack issue planning Dynamic supply routing mechanism, that is referred as cooperative bait detection theme (CBDS) that integrate the advantage of each proactive and reactive defence design is used. In region attacks, a node transmits a malicious broadcast informing that it's the shortest path to the destination, with the goal of intercepting messages. During this case, a malicious node (so-called region node) will attract all packets by victimisation solid Route Reply (RREP) packet to incorrectly claim that “fake” shortest route to the destination then discard these packets while not forwarding them to the destination. In grey hole attacks, the malicious node isn't abs initio recognized in and of itself since it turns malicious solely at a later time, preventing a trust-based security resolution from detective work its presence within the network. It then by selection discards/forwards the info packets once packets undergo it. During this we have a tendency to focus is on detective work grey hole/collaborative region attacks employing a dynamic supply routing (DSR)-based routing technique.
Survey on dynamic source routing, attacks and counter measures in wireless se...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Secure routing and data transmission in mobileIJCNCJournal
In this paper, we present an identity (ID) based protocol that secures AODV and TCP so that it can be used
in dynamic and attack prone environments of mobile ad hoc networks. The proposed protocol protects
AODV using Sequential Aggregate Signatures (SAS) based on RSA. It also generates a session key for each
pair of source-destination nodes of a MANET for securing the end-to-end transmitted data. Here each node
has an ID which is evaluated from its public key and the messages that are sent are authenticated with a
signature/ MAC. The proposed scheme does not allow a node to change its ID throughout the network
lifetime. Thus it makes the network secure against attacks that target AODV and TCP in MANET. We
present performance analysis to validate our claim.
Discovering adaptive wireless sensor network using β synchronizereSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Discovering adaptive wireless sensor network using eSAT Journals
Abstract When we consider the standard Bellman-Ford algorithm, it uses static values of link cost function and distance function. These static values are stored in sink node so that the sink node requires memory to keep data safe. Therefore the space, message and time complexity of a network and node increases. To overcome this we discover Fast Time Dependent Shortest Path algorithm with message and used in network with β synchronizer. The FTSP algorithm uses dynamic values of link cost function and distance function and to store these values we are using vector compression method so that there is no need to store the data into the sink node. Because of this the message, time and space complexity of node will be decreases. Keywords- Duty cycle, Time dependent, β synchronizer
A Study on Hardware and Software Link Quality Metrics for Wireless Multimedia...Eswar Publications
Due to the lack of accurate evaluation of the transmission characteristics of the wireless communication links, routing algorithms in wireless sensor networks may result in poor network performance. In order to avoid sending packets over the unstable link, routing protocol has to rely on noble metrics to choose better routing path. Better estimation of link reliability between neighboring nodes could permit the selection of a more reliable route. Since the routing metrics play an important role as they have a direct impact on the efficiency and robustness of routing protocols. Different routing metrics will provide different performances to routing protocols when used to compute weight of paths. This paper presents a study on various hardware and software link quality metrics that
help network protocol designers can choose an efficient Link Quality Estimator to develop reliable routing techniques for WMSNs. Additionally a classification tree of different routing metrics is presented which helps in understanding the strengths and weaknesses of these LQ metrics, thus enabling the designer of the routing protocol to make an informed choice.
Effective Identification of Packet Droppers and Modifiers in Wireless Sensor ...IJMTST Journal
In Wireless sensor network, sensor nodes are used to monitor physical or environmental condition. Sensor
networks are often deployed in an unattended and hostile environment to perform the monitoring and data
collection tasks. When it is deployed in such an environment, it lacks physical protection and subjected to
node compromise. After compromising one or multiple sensor nodes, an adversary may launch various
attacks to disrupt the in-network communication. Among these attacks, two common ones are dropping
packets and modifying packet. In this paper, we propose a simple yet effective scheme to identify
misbehaving forwarders that drop or modify packets. Node Categorization algorithm and Global Ranking
algorithm are
BLACKLIST MANAGEMENT USING A VERIFICATION REPORT TO IMPROVE THE ENERGY EFFICI...ijwmn
Recently, the applications scope of Wireless Sensor Networks (WSNs) has been broadened. WSN communication security is important because sensor nodes are vulnerable to various security attacks when deployed in an open environment. An adversary could exploit this vulnerability to inject false reports into the network. En-route filtering techniques have been researched to block false reports. The CFFS scheme
filters the false report by collaboratively validating the report by clustering the nodes. However, CFFS is not considered effective against repetitive attacks. Repeated attacks have a significant impact on network lifetime. In this paper, we propose a method to detect repetitive attacks with cluster-based false data
filtering and to identify the compromised nodes and quickly block them. The proposed scheme uses fuzzy logic to determine the distribution of additional keys according to the network conditions, thereby improving energy efficiency.
TRUST ASSESSMENT THROUGH FTA APPROACH IN AD-HOC NETWORKcscpconf
An Ad-hoc network consists of communicating nodes to establish improvised communicationwith environment without any fixed infrastructure. Nodes in Ad-hoc network (MANET) do not
rely on a central infrastructure management but relay packets sent by other nodes. Mobile adhoc network can work properly only if the participating nodes collaborate with routing. Therefore it is required that the nodes co-operate for the intensity of operator network. Because of the high mobility of the nodes in the network, detection of misbehaviour of any node is a complex problem. Nodes have to share the routing information in order for each to find the
route to the destination. This conceptual paper is based on the relationship among the nodes which makes them to co-operate in an ad-hoc network .This require nodes to Trust each other. Thus we can say Trust is a important concept in secure routing mechanism among the nodes. In this paper we present a unique Trust based method in which each node broadcast a RQ packet if
it is received from different neighbours. The secure, efficient and reliable route towards the destination is calculated as a weighted average of the Trust value of the nodes in the route, with respect to it’s behaviour observed by the neighbour nodes and the number of nodes in the route.
A Survey of Techniques Used To Detect Selfish Nodes in MANETijsrd.com
An mobile Ad Hoc network is a collection of mobile nodes. They do not have any existing infrastructure and they do not have any centralized administrator. So the MANET is self-creating, self-organizing and self-administrative wireless network. In MANET each node acts as router. In practice some of the nodes may act as the selfish nodes. These nodes use the network and its services but they do not cooperate with other nodes. Such selfish nodes do not consume any energy such as CPU power, battery and bandwidth for retransmitting the data of other nodes. They will preserve the resources for their own use. In this paper we have provide the comparative study of different type of methods to increase the selfish node detection and the network throughput
Secure dynamic source routing protocol for defending black hole attacks in mo...nooriasukmaningtyas
Wireless Ad Hoc Network is a dynamically organized network on emergency
situations, in which a group of wireless devices send data among themselves
without requiring any base stations for forwarding data. Here the nodes itself
perform the functions of routing. This important characteristic of mobile ad
hoc networks allows the hassle free set up of the network for
communications in different crisis such as battlefield and natural disaster
zones. Multi hop communication in MANET is achieved by the cooperation
of nodes in forwarding data packets. This feature of MANET is largely
exploited to launch a security attack called black hole attack. A light weight
solution called SEC-DSR is proposed to defend the network from black hole
attack and enables communication among nodes even in the presence of
attackers. In this scheme, by analyzing only the control packets used for
routing in the network, the compromised nodes launching the attack are
identified. From the collective judgment by the participating nodes in the
routing path, a secure route free of black hole nodes is selected for
communication by the host. Simulation results validate and ensure the
effectiveness of the proposed solution tested on an ad hoc network with
compromised black hole nodes.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
MANET (Mobile Ad-hoc Network) is hot spot for research due to its various advantages and
disadvantages. Providing safe communication between mobile nodes, recognization the position of
nodes, reducing overhead, handling misbehavior and location updates are such a difficult issues in
ad-hoc network, so providing trust schemes is an important in this network. MANET provides some
basic functions like routing, communication, network management and packet forwarding etc over
self organized network. Because MANET has not a fixed topology, in which mobile nodes comes and
leaves the network within a random period of time. It effects energy, bandwidth and memory
computations of network. Providing trust in MANET is such a crucial task because it doesn’t having
centralized infrastructure. In this paper, we survey the different trust model schemes of MANET with
their unique features, merits and demerits & findings.
Performance Observation of Proactive and Reactive Routing Protocols with Incr...Computer Science Journals
Mobile Ad-hoc network (MANET) is type of wireless network in which group of mobile nodes co-operate to forward the data packets to their neighbours without using centralized authority or any physical medium like cables or base station.
TRIDNT: THE TRUST-BASED ROUTING PROTOCOL WITH CONTROLLED DEGREE OF NODE SELFI...IJNSA Journal
In Mobile ad-hoc network, nodes must cooperate to achieve the routing purposes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. In this paper, we propose a Two node-disjoint Routes protocol for Isolating Dropper Node in MANET (TRIDNT) to deal with misbehaviour in MANET. TRIDNT allows some degree of selfishness to give an incentive to the selfish nodes to declare itself to its neighbours, which reduce the misbehaving nodes searching time. In TRIDNT two node-disjoint routes between the source and destination are selected based on their trust values. We use both DLL-ACK and end-to-end TCP-ACK to monitor the behaviour of routing path nodes: if a malicious behaviour is detected then the path searching tool starts to identify the malicious nodes and isolate them. Finally by using a mathematical analysis we find that our proposed protocol reduces the searching time of malicious nodes comparing to the route expected life time, and avoids the isolated misbehaving node from sharing in all future routes, which improve the overall network throughput.
Mobile ad hoc network (MANET) is an autonomous system of mobile nodes. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These cause extra challenges on security. In this paper, evaluation of prominent on-demand routing protocol i.e. AODV,MAODV,RAODV has been done by varying the network size. An effort has been carried out to do the performance evaluation of these protocols using random way point model. The simulator used is NS 2.34. The performance of either protocol has been studied by using a self created network scenario with respect to pause time.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
Mitigating Various Attacks in Mobile Ad-hoc Networks Using Trust Based ApproachIJLT EMAS
A Mobile ad hoc network (MANET) is self-organizing,
decentralized and infrastructure-less wireless network. The
successful transmission of the data packet depends on the
complete cooperation of each node in the network. These types of
network don’t have permanent base station, so each node in the
network acts as a router. Due to openness, decentralized, selforganizing
nature of MANET, it is vulnerable to various attacks.
So security is the main concern in MANET.
In this project, we have considered 2 attacks; Vampire
attack and DDoS attacks. Vampire attack drains the energy of
the nodes. DDoS attack exhausts the resources available to a
network, such that the node cannot provide any services. Here,
we discuss methods 2 methods as a solution to our problem; one
is to prevent the attack from happening and other to detect and
recover from the attacks.
Review on Detection & Prevention Methods for Black Hole Attack on AODV based ...IJERD Editor
Dynamic nature of Mobile Ad-hoc networks (MANET) challenges the quality of service (QoS)
because route failure probability is increased in MANET due to the mobility of nodes. Lack of fixed
infrastructure, wireless shared medium and dynamic topology makes MANET prone to different types of
attacks. Ad-hoc On-Demand Distance Vector (AODV) routing protocol in MANETs which is vulnerable to a
variety of security threats in ad-hoc networks. Black hole attack is an attack that drop considerable number of
packet by performing packet forwarding misbehaviour and violate the security to cause Denial-of-Service
(DoS) in Mobile Ad-hoc networks (MANET). In this paper we investigate different mechanism to detect and
prevent black hole attack in AODV protocol. We also discuss about advantages and disadvantages of the
methods.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
misrouting attack in wireless sensor networks under replication attack. agent based security schemes in Security schemes for wireless sensor networks. International journal paper on wireless sensor networks.
Ensure Security and Scalable Performance in Multiple Relay NetworksEditor IJCATR
A relay network is a broad class of network topology commonly used in networks, where the source and destination are
interconnected by means of a some nodes. In such a network the source and destination cannot transmit to each other directly because
the distance between the source and destination is greater than the transmission range of both of them, hence the demand for
intermediate node(s) to relay. The problem of detecting malicious relay nodes in single source, multi-relay networks has been studied
in the literature for different relaying schemes. Relay nodes in apply network coding while those in and follow the decode-and-forward
protocol. The authors consider a peer-to-peer (P2P) network in which peers receive and forward a linear combination of the exogenous
data packets. To check out the integrity of the received packets, a key signature vector is generated at the source node and broadcasted
to all nodes where it is used to check the integrity of the received packets. In and several information theoretic algorithms for
mitigating falsified data injection effects are proposed. The network modeling used in these works is composed of a single source,
multiple intermediate nodes which utilize network coding. We consider a multiple access relay network where multiple sources send
independent data to a single destination through multiple relays, which may interject falsified data into the network. To detect the
malevolent relays and dispose (efface) data from them, trace bits are embedded in the information data at each source node.
AODV Improvement by Modification at Source Node and Securing It from Black Ho...IJERA Editor
MANETS suffer from constraints in power, storage and computational resources ,as a result, they are more
vulnerable to various communications security related attacks. therefore we attempt to focus on analyzing and
improving the security of routing protocol for MANETS viz. the Ad hoc On Demand Distance Vector
(AODV)routing protocol. We propose modifications to the AODV we propose an algorithm to counter the
Black hole attack on the routing protocols in MANETs. All the routes has unique sequence number and the
malicious node has the highest Destination Sequence number and it is the first RREP to arrive. So the
comparison is made only to the first entry in the table without checking other entries in the table
Similar to A SURVEY ON TRUST BASED SECURE ROUTING IN MANET (20)
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR cscpconf
The progressive development of Synthetic Aperture Radar (SAR) systems diversify the exploitation of the generated images by these systems in different applications of geoscience. Detection and monitoring surface deformations, procreated by various phenomena had benefited from this evolution and had been realized by interferometry (InSAR) and differential interferometry (DInSAR) techniques. Nevertheless, spatial and temporal decorrelations of the interferometric couples used, limit strongly the precision of analysis results by these techniques. In this context, we propose, in this work, a methodological approach of surface deformation detection and analysis by differential interferograms to show the limits of this technique according to noise quality and level. The detectability model is generated from the deformation signatures, by simulating a linear fault merged to the images couples of ERS1 / ERS2 sensors acquired in a region of the Algerian south.
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATIONcscpconf
A novel based a trajectory-guided, concatenating approach for synthesizing high-quality image real sample renders video is proposed . The lips reading automated is seeking for modeled the closest real image sample sequence preserve in the library under the data video to the HMM predicted trajectory. The object trajectory is modeled obtained by projecting the face patterns into an KDA feature space is estimated. The approach for speaker's face identification by using synthesise the identity surface of a subject face from a small sample of patterns which sparsely each the view sphere. An KDA algorithm use to the Lip-reading image is discrimination, after that work consisted of in the low dimensional for the fundamental lip features vector is reduced by using the 2D-DCT.The mouth of the set area dimensionality is ordered by a normally reduction base on the PCA to obtain the Eigen lips approach, their proposed approach by[33]. The subjective performance results of the cost function under the automatic lips reading modeled , which wasn’t illustrate the superior performance of the
method.
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...cscpconf
Universities offer software engineering capstone course to simulate a real world-working environment in which students can work in a team for a fixed period to deliver a quality product. The objective of the paper is to report on our experience in moving from Waterfall process to Agile process in conducting the software engineering capstone project. We present the capstone course designs for both Waterfall driven and Agile driven methodologies that highlight the structure, deliverables and assessment plans.To evaluate the improvement, we conducted a survey for two different sections taught by two different instructors to evaluate students’ experience in moving from traditional Waterfall model to Agile like process. Twentyeight students filled the survey. The survey consisted of eight multiple-choice questions and an open-ended question to collect feedback from students. The survey results show that students were able to attain hands one experience, which simulate a real world-working environment. The results also show that the Agile approach helped students to have overall better design and avoid mistakes they have made in the initial design completed in of the first phase of the capstone project. In addition, they were able to decide on their team capabilities, training needs and thus learn the required technologies earlier which is reflected on the final product quality
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIEScscpconf
Using social media in education provides learners with an informal way for communication. Informal communication tends to remove barriers and hence promotes student engagement. This paper presents our experience in using three different social media technologies in teaching software project management course. We conducted different surveys at the end of every semester to evaluate students’ satisfaction and engagement. Results show that using social media enhances students’ engagement and satisfaction. However, familiarity with the tool is an important factor for student satisfaction.
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICcscpconf
In real world computing environment with using a computer to answer questions has been a human dream since the beginning of the digital era, Question-answering systems are referred to as intelligent systems, that can be used to provide responses for the questions being asked by the user based on certain facts or rules stored in the knowledge base it can generate answers of questions asked in natural , and the first main idea of fuzzy logic was to working on the problem of computer understanding of natural language, so this survey paper provides an overview on what Question-Answering is and its system architecture and the possible relationship and
different with fuzzy logic, as well as the previous related research with respect to approaches that were followed. At the end, the survey provides an analytical discussion of the proposed QA models, along or combined with fuzzy logic and their main contributions and limitations.
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS cscpconf
Human beings generate different speech waveforms while speaking the same word at different times. Also, different human beings have different accents and generate significantly varying speech waveforms for the same word. There is a need to measure the distances between various words which facilitate preparation of pronunciation dictionaries. A new algorithm called Dynamic Phone Warping (DPW) is presented in this paper. It uses dynamic programming technique for global alignment and shortest distance measurements. The DPW algorithm can be used to enhance the pronunciation dictionaries of the well-known languages like English or to build pronunciation dictionaries to the less known sparse languages. The precision measurement experiments show 88.9% accuracy.
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS cscpconf
In education, the use of electronic (E) examination systems is not a novel idea, as Eexamination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments.
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICcscpconf
African Buffalo Optimization (ABO) is one of the most recent swarms intelligence based metaheuristics. ABO algorithm is inspired by the buffalo’s behavior and lifestyle. Unfortunately, the standard ABO algorithm is proposed only for continuous optimization problems. In this paper, the authors propose two discrete binary ABO algorithms to deal with binary optimization problems. In the first version (called SBABO) they use the sigmoid function and probability model to generate binary solutions. In the second version (called LBABO) they use some logical operator to operate the binary solutions. Computational results on two knapsack problems (KP and MKP) instances show the effectiveness of the proposed algorithm and their ability to achieve good and promising solutions.
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINcscpconf
In recent years, many malware writers have relied on Dynamic Domain Name Services (DDNS) to maintain their Command and Control (C&C) network infrastructure to ensure a persistence presence on a compromised host. Amongst the various DDNS techniques, Domain Generation Algorithm (DGA) is often perceived as the most difficult to detect using traditional methods. This paper presents an approach for detecting DGA using frequency analysis of the character distribution and the weighted scores of the domain names. The approach’s feasibility is demonstrated using a range of legitimate domains and a number of malicious algorithmicallygenerated domain names. Findings from this study show that domain names made up of English characters “a-z” achieving a weighted score of < 45 are often associated with DGA. When a weighted score of < 45 is applied to the Alexa one million list of domain names, only 15% of the domain names were treated as non-human generated.
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...cscpconf
The amount of piracy in the streaming digital content in general and the music industry in specific is posing a real challenge to digital content owners. This paper presents a DRM solution to monetizing, tracking and controlling online streaming content cross platforms for IP enabled devices. The paper benefits from the current advances in Blockchain and cryptocurrencies. Specifically, the paper presents a Global Music Asset Assurance (GoMAA) digital currency and presents the iMediaStreams Blockchain to enable the secure dissemination and tracking of the streamed content. The proposed solution provides the data owner the ability to control the flow of information even after it has been released by creating a secure, selfinstalled, cross platform reader located on the digital content file header. The proposed system provides the content owners’ options to manage their digital information (audio, video, speech, etc.), including the tracking of the most consumed segments, once it is release. The system benefits from token distribution between the content owner (Music Bands), the content distributer (Online Radio Stations) and the content consumer(Fans) on the system blockchain.
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMcscpconf
This paper discusses the importance of verb suffix mapping in Discourse translation system. In
discourse translation, the crucial step is Anaphora resolution and generation. In Anaphora
resolution, cohesion links like pronouns are identified between portions of text. These binders
make the text cohesive by referring to nouns appearing in the previous sentences or nouns
appearing in sentences after them. In Machine Translation systems, to convert the source
language sentences into meaningful target language sentences the verb suffixes should be
changed as per the cohesion links identified. This step of translation process is emphasized in
the present paper. Specifically, the discussion is on how the verbs change according to the
subjects and anaphors. To explain the concept, English is used as the source language (SL) and
an Indian language Telugu is used as Target language (TL)
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
AUTOMATED PENETRATION TESTING: AN OVERVIEWcscpconf
The using of information technology resources is rapidly increasing in organizations,
businesses, and even governments, that led to arise various attacks, and vulnerabilities in the
field. All resources make it a must to do frequently a penetration test (PT) for the environment
and see what can the attacker gain and what is the current environment's vulnerabilities. This
paper reviews some of the automated penetration testing techniques and presents its
enhancement over the traditional manual approaches. To the best of our knowledge, it is the
first research that takes into consideration the concept of penetration testing and the standards
in the area.This research tackles the comparison between the manual and automated
penetration testing, the main tools used in penetration testing. Additionally, compares between
some methodologies used to build an automated penetration testing platform.
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKcscpconf
Since the mid of 1990s, functional connectivity study using fMRI (fcMRI) has drawn increasing
attention of neuroscientists and computer scientists, since it opens a new window to explore
functional network of human brain with relatively high resolution. BOLD technique provides
almost accurate state of brain. Past researches prove that neuro diseases damage the brain
network interaction, protein- protein interaction and gene-gene interaction. A number of
neurological research paper also analyse the relationship among damaged part. By
computational method especially machine learning technique we can show such classifications.
In this paper we used OASIS fMRI dataset affected with Alzheimer’s disease and normal
patient’s dataset. After proper processing the fMRI data we use the processed data to form
classifier models using SVM (Support Vector Machine), KNN (K- nearest neighbour) & Naïve
Bayes. We also compare the accuracy of our proposed method with existing methods. In future,
we will other combinations of methods for better accuracy.
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...cscpconf
In order to treat and analyze real datasets, fuzzy association rules have been proposed. Several
algorithms have been introduced to extract these rules. However, these algorithms suffer from
the problems of utility, redundancy and large number of extracted fuzzy association rules. The
expert will then be confronted with this huge amount of fuzzy association rules. The task of
validation becomes fastidious. In order to solve these problems, we propose a new validation
method. Our method is based on three steps. (i) We extract a generic base of non redundant
fuzzy association rules by applying EFAR-PN algorithm based on fuzzy formal concept analysis.
(ii) we categorize extracted rules into groups and (iii) we evaluate the relevance of these rules
using structural equation model.
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAcscpconf
In many applications of data mining, class imbalance is noticed when examples in one class are
overrepresented. Traditional classifiers result in poor accuracy of the minority class due to the
class imbalance. Further, the presence of within class imbalance where classes are composed of
multiple sub-concepts with different number of examples also affect the performance of
classifier. In this paper, we propose an oversampling technique that handles between class and
within class imbalance simultaneously and also takes into consideration the generalization
ability in data space. The proposed method is based on two steps- performing Model Based
Clustering with respect to classes to identify the sub-concepts; and then computing the
separating hyperplane based on equal posterior probability between the classes. The proposed
method is tested on 10 publicly available data sets and the result shows that the proposed
method is statistically superior to other existing oversampling methods.
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHcscpconf
Data collection is an essential, but manpower intensive procedure in ecological research. An
algorithm was developed by the author which incorporated two important computer vision
techniques to automate data cataloging for butterfly measurements. Optical Character
Recognition is used for character recognition and Contour Detection is used for imageprocessing.
Proper pre-processing is first done on the images to improve accuracy. Although
there are limitations to Tesseract’s detection of certain fonts, overall, it can successfully identify
words of basic fonts. Contour detection is an advanced technique that can be utilized to
measure an image. Shapes and mathematical calculations are crucial in determining the precise
location of the points on which to draw the body and forewing lines of the butterfly. Overall,
92% accuracy were achieved by the program for the set of butterflies measured.
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...cscpconf
Smart cities utilize Internet of Things (IoT) devices and sensors to enhance the quality of the city
services including energy, transportation, health, and much more. They generate massive
volumes of structured and unstructured data on a daily basis. Also, social networks, such as
Twitter, Facebook, and Google+, are becoming a new source of real-time information in smart
cities. Social network users are acting as social sensors. These datasets so large and complex
are difficult to manage with conventional data management tools and methods. To become
valuable, this massive amount of data, known as 'big data,' needs to be processed and
comprehended to hold the promise of supporting a broad range of urban and smart cities
functions, including among others transportation, water, and energy consumption, pollution
surveillance, and smart city governance. In this work, we investigate how social media analytics
help to analyze smart city data collected from various social media sources, such as Twitter and
Facebook, to detect various events taking place in a smart city and identify the importance of
events and concerns of citizens regarding some events. A case scenario analyses the opinions of
users concerning the traffic in three largest cities in the UAE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGEcscpconf
The anonymity of social networks makes it attractive for hate speech to mask their criminal
activities online posing a challenge to the world and in particular Ethiopia. With this everincreasing
volume of social media data, hate speech identification becomes a challenge in
aggravating conflict between citizens of nations. The high rate of production, has become
difficult to collect, store and analyze such big data using traditional detection methods. This
paper proposed the application of apache spark in hate speech detection to reduce the
challenges. Authors developed an apache spark based model to classify Amharic Facebook
posts and comments into hate and not hate. Authors employed Random forest and Naïve Bayes
for learning and Word2Vec and TF-IDF for feature selection. Tested by 10-fold crossvalidation,
the model based on word2vec embedding performed best with 79.83%accuracy. The
proposed method achieve a promising result with unique feature of spark for big data.
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTcscpconf
This article presents Part of Speech tagging for Nepali text using General Regression Neural
Network (GRNN). The corpus is divided into two parts viz. training and testing. The network is
trained and validated on both training and testing data. It is observed that 96.13% words are
correctly being tagged on training set whereas 74.38% words are tagged correctly on testing
data set using GRNN. The result is compared with the traditional Viterbi algorithm based on
Hidden Markov Model. Viterbi algorithm yields 97.2% and 40% classification accuracies on
training and testing data sets respectively. GRNN based POS Tagger is more consistent than the
traditional Viterbi decoding technique.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
2. 244 Computer Science & Information Technology (CS & IT)
because of high computational cost and it can’t identify the attacker nodes. This mechanism only
secures the routing information from tampering but can’t secure nodes that participate in routing.
So the trust mechanism is adopted in routing protocols to secure nodes as well as the data
transmission. Different trust based routing protocols are proposed to provide security in MANET
by securing nodes in routing path.
2. TRUST MECHANISM
Trust mechanism is introduced in the protocols to provide security in MANET. Trust is a value
that is calculated on the basis of nodes action when needed. Trust is introduced to prevent from
various attacks like wormhole, black-hole, Dos, selfish attack etc. Trust can be implemented in
various ways such as by reputation, subjective logic, from opinion of nodes etc as there are no
particular definitions of trust. According to (Marc Branchaud, Scott Flinn) trust has following
properties:
• Context Dependence: In some specific context trust relationships are applicable.
• Function of uncertainty: Trust depends on the uncertainty of nodes action. It gives the
probability of action performed by a node.
• Quantitative value: Trust can be assigned any type of numeric values discrete or
continuous.
• Asymmetric Relationship: Trust relationship is asymmetric in nature. If node A trusts B
and node B trust C that does not mean that A trusts C.
4. RELATED WORK
4.1. Trusted AODV [2]
In this scheme, AODV protocol is modified implementing node trust and route trust. Two new
control packets are added to AODV protocol i.e. trust request packet(TREQ) and trust reply
packet(TREP) and routing table is modified by adding one new field: route trust. The RREP
packet of AODV is also modified by extending two new fields: neighbour list and route trust.
4.1.1. Calculation of Node Trust
All the nodes maintain neighbour table to keep information of frequently changing node and node
trust value. Node trust value is evaluated using neighbour’s collective opinion. The node trust
value (NTV) of a node i is calculated by the following formulae:
NTV=[NNT(1)+NNT(2)+NNT(3)+…….+NNT(n)]/n
where NNT is the neighbour node trust value about the i node and n is the no of neighbour in the
neighbour list.
4.1.2. Calculation of Route Trust
Every node calculates route trust for each route in the routing table at some regular interval.
Destination node in each entry in the routing table generates R_ACK packet and send back in
reverse path. The nodes that receive R_ACK calculate the route trust value using the value in the
no_of_packets_received field of R_ACK packet and the value of no_of_packets_sent field in the
routing table. Route trust value is calculated by the following formulae: Route trust= (no of
3. Computer Science & Information Technology (CS & IT) 245
packets send by source - no of packets received by destination) The route with route trust value 0
is the perfect one. If the route trust value is equal to the no of packets sent the route is rejected.
4.1.3. Route Discovery
In route discovery phase when a node has packets to send it broadcasts RREQ packets. When all
RREQ reaches to the destination, it sends RREP packets. After receiving the RREP packets,
source node selects three RREP packets that have high route trust value. Then the source node
generates the TREQ packets and sends it to all neighbours in the neighbour list of that RREP
packet. After receiving the TREQ packet, all neighbours replies with TREP packet to the source
node. Then the source node calculates the node trust of the nodes. Next, the source node arrange
the RREP packets in the ascending order based on node trust value and selects the first RREP
packet and hence that path is selected for communication.
4.2. Cooperation of Nodes: Fairness in Dynamic Ad-hoc Networks [3]
The main idea of CONFIDANT protocol is to identify non-cooperative nodes. A node selects a
route based on trust relationships which is built up from experienced routing and packet
forwarding behavior of other nodes. Each node monitors the behavior of all neighbor nodes.
When any misbehaving node is found, alarm messages are sent to all other nodes in the network.
As a result, all nodes in the network will be able to avoid that misbehaving node while selecting a
route. The components of CONFIDANT protocol works as follows:-
4.2.1. The Monitor
This component watches the behavior of nodes during the routing procedure. If any node
misbehaves, then the monitor module detects that misbehaving node and immediately calls
reputation system.
4.2.2. The Trust Manager
The trust manager handles ALARM messages. When any misbehaving node is found ALARM
messages are sent to all other nodes to inform about that node. The trust manager maintain alarm
table and trust table for checking the trustworthiness of alarm. The rating function assigns greater
weights for own experience and smaller for other nodes opinion about that detected node. The
rating of a node is updated when sufficient proof of the nodes maliciousness is found. If the rating
falls below threshold value path manager module is called.
4.2.3. The Reputation System
The reputation system maintains the rating of nodes in a table which has 2 field node id and their
ratings. The ratings are done according to the type of nodes behavior detected. The rating of a
node is updated when sufficient proof of the nodes maliciousness is found. If the rating falls
below threshold value path manager module is called.
4.2.4. The Path Manager
The path manager manages the routing path according to ratings of the nodes. The path
containing malicious nodes are deleted by this module. If any route request comes from malicious
node path manager takes appropriate action like ignore request or don’t reply etc.
4. 246 Computer Science & Information Technology (CS & IT)
4.3. Friendship Based AODV (FrAODV) [4]
In Friendship based AODV is based on AODV, there are two evaluation algorithms to evaluate
forward and reverse path between source and destination. In this scheme, it is assumed that each
node has identity can’t be forged by any other malicious node and no of malicious node is less
than the no of good nodes. In this proposed scheme every node has a list of friends with
friendship values. The range of friendship values is 0 to 100. More the friendship values means
more trustable. The two algorithms for establishing path are described as follows:
4.3.1. RvEvaluate Algorithm
This algorithm sets up reverse path from destination to source. After broadcasting RREQ packet
the two things can happen: -
Case-1: The receiving node can be destination node itself. If so it checks the friendship value of
the node from which it receives the RREQ packet, as every node maintains a friendship list along
with friendship value of the neighbor nodes. If the node is not a friend the node rejects the RREQ
packet. Otherwise it calculates the friendship value of the route to originator from destination and
then compares the current routes friendship value with the existing route’s friendship values. The
reverse route’s friendship value (RvFwRte) is the sum of friendship values of all nodes in that
path and it is calculated as follows:
Where PrFrHpi is friendship value of that node from which the current node receives RREQ
packet and h is the no. of hops between source and destination. . If the friendship value of the new
route is less than the existing route the new route is rejected otherwise it is registered as a friendly
route.
Case-2: If the receiving node is intermediate one, it first checks the friendship value of the node
from which it receives the RREQ packet and next neighbor node. If one of these two nodes is not
in friend list, the intermediate node rejects the RREQ packet. Otherwise it calculates the
friendship value of the route to originator from destination using the previously mentioned
formulae and compares it with the existing route’s friendship value. If the friendship value of the
new route is less than the existing route the new route is rejected otherwise the reverse path is
established from current node to the previous node.
4.3.2. FwEvaluate Algorithm
This algorithm sets up the forward path i.e. from source to destination during RREP forwarding.
There are following two cases when any node receives that packet:
Case-1: If the node receiving the RREP packet is sender node itself, it checks the friendship list
and the friendship value of the node from which it receives the RREP packet i.e. the next node. If
the next node is not a friend, rejects the RREQ packet. Otherwise it calculates the friendship
value of forward route to destination and then compares it with the existing route’s friendship
value. If the friendship value of the new route is less than the existing route the new route is
rejected otherwise it is registered as a friendly forward route. If there is not any existing route the
new route is included as a friendly route. The forward path’s friendship value is formulated as:
5. Computer Science & Information Technology (CS & IT) 247
Where FwFrHpi is friendship value of that node from which the current node receives RREP
packet and h is the no hops between source and destination.
Case-2: If the node is an intermediate node then it checks the friendship value of the node from
which it receives the RREP packet and previous node. If one of these nodes is not friend, rejects
the RREP packet. Otherwise it calculates the friendship value of the route to destination in the
same way and compares it with the existing forward route’s friendship value. If the friendship
value of the new route is less than the existing route the new route is rejected otherwise the
forward path is established from current node to the next node.
In this way after establishing friendly path from source to destination the sender sends data packet
along that path.
4.4. Secure Routing Using Trust (SRT) [5]
In this paper, a secure routing using trust level is proposed. This scheme is based on node
transition probability (NTP) and AODV. This scheme develops a new algorithm to secure NTP
protocol. A trust rate (Trate) is calculated as a parameter. When a node has data packet to send, it
first floods control frame (beacon) in search of secure and reliable route. After broadcasting the
first beacon trust rate is evaluated as:
Where r = no of beacons received by a node, t = no of beacons send by a node.
This Trate value divides the nodes of the network into 3 categories: ally list (level2), associate
list(level1), acquaintance list(level0).
Ally list: The nodes of the ally list send highly secured information.
Associate list: The nodes of this list send medium secured information.
Acquaintance list: The nodes of this list send the information that do not require any security.
An additional field “level” is there in neighbor table. When a node has data to send it just checks
its neighbor table, if the destination is available it just sends data packets. If not, it searches for a
node which has route to destination in its same level. If no suitable node is not found it goes to
next lower level and so on. If any node in the same level is not found trust is compromised by
choosing a neighbor in the next lower level using the following formulae:
Trust compromise= n (associate) + 2*n (acquaintance)
Where n (associate) is the no of nodes in associate list and n (acquaintance) is the no of nodes in
acquaintance list. When all the nodes including destination node are in the same level with the
source node trust compromise will be very low because trust rate is very high as it is better to
forward control packets in the same level than to forward the packets to the another level. In this
way after finding secure route the data packets are sent to the destination.
4.5. Trusted AOMDV [6]
AOMDV is a multipath routing protocol. In the paper, a trust mechanism is employed with soft
encryption methodology in AOMDV protocol. This Trusted AOMDV protocol has the following
steps:
6. 248 Computer Science & Information Technology (CS & IT)
4.5.1. Degree Of Secrecy for Path /Message
Degree of secrecy of a path implies how much degree of security level required for a path to
transfer packets. The path trust value (Tp) is the minimum trust value among all nodes along the
path p depending upon the path trust value there are three classifications: - If Tp ≥ 8 implies class
A paths. All the class A paths have degree of secrecy≥8. Tp ≥ 5 implies class B paths. All the class
B paths have degree of secrecy≥ 5. Tp ≥ 3 implies class C paths. All the class C paths have degree
of secrecy≥ 3. This classification is also applied for data packets. Class A data only is transferred
to class A category path. It is same for other categories.
4.5.2. Message Encryption
The message is divided into three parts and then encrypted using soft-encryption methodology to
secure the message. It is encrypted in the following way:
a’=aXORc b’=bXORc c’=aXORbXORc
4.5.3. Message Routing
Before routing the encrypted messages a secure trusted path is established using the following
trust mechanisms:-
The trust mechanism of this scheme depends on the monitoring of packets and node’s behavior. It
is assumed here that when a node sends packets it will monitor its neighbor node to which it
sends its packet and determines node’s trust value depending on its behavior. If the neighbor node
sends the packets correctly node’s trust will increase, otherwise it is decreased. The trust value of
a node (Tn) is calculated as: Tn = Wd * Td + Wr * Tr where Wd is the weight assigned to direct trust
Td, Wr is the weight assigned to recommendation trust Tr. Again Direct trust is calculated as: Td=
Td +c. Ts, if no. of successful packet transmission time is high and Td= Td - c .Tf, if the no. of
packet transmission failed time is high. Where Ts is the aggregate successful transfer time, Tf is
the aggregate failure transfer time and c is the predefined constant value. Ts is incremented by 1
for every successful transfer of packet, otherwise Tf is incremented by 1. The trust table values
determined through hello message transmission. When a node receives hello message it first
check trust table contained in hello packet and find some common nodes it has. If any node
common node is found that wants to participate in forwarding packets the trust recommendation
(Tr) is calculated by the formulae:-
Where implies source A’s trust on intermediate node X and implies X’s
trust on destination D and n is the no. of hop. In the routing process, source broadcasts RREQ
packet. When an intermediate node receives the first RREQ packet it checks the path list and hop
count and updates its reverse route table and sets up reverse path. When duplicate request packet
arrives at node it checks the hop count of that packet, if it has lesser hop count than the previous
one, record of the previously received packet is replaced by the new one in the reverse route
table. After receiving request packet destination node generates reply packet (RREP) and sends
back to the sender. When an intermediate node receives RREP packet, it compares the trust value
in RREP packet with the node’s trust value from which it receives the RREP packet. If the node’s
trust value is less than the one in RREP packet, the trust value in RREP packet is replaced by that
node’s trust value. In this way, finally when RREP packet reaches to the source node, it gets the
trust value from the RREP packet and set it as a trust value of that path. After receiving all the
RREP packets and the path trust values, it sorts the paths based on the trust values. Then it breaks
7. Computer Science & Information Technology (CS & IT) 249
the message in three parts and encrypts it in the previously mentioned way and starts sending it to
the appropriate path according to the data degree of secrecy. After route discovery, if the
appropriate path is not found, routing process will be restarted.
4.6. Friend Based Ad Hoc Routing Using Challenges to Establish Security [7]
This algorithm achieves security in ad hoc network by sending challenges and sharing friend lists.
In this scheme, there are different list of nodes: Question mark List, Unauthenticated List, Friend
List. The rating of friends ranges from 0 to 10.
This algorithm has four steps: challenging neighbor, friends rating, sharing friends and route
through friends. FACES is a hybrid protocol as the routing of data is on demand where as
challenging and sharing occurs periodically. When the network is initialized, the nodes are not
familiar with each other. So after initializing the network the nodes challenge each other to find
the friend nodes. The challenging mechanism works as – suppose node A challenges its neighbor
B. A first performs share Friend list with B by sending FREQ packet to B. After receiving FREQ
packet from A, B replies by sending its all three list to A. After getting replies A picks one node
(let C) from B’s list to which it can reach by own. Then send a challenge packet to C directly and
through node B. When C receives challenge packet it replies node A and node B in turns replies
to node A. then node A compares these two results if it matches node A add B in its friend list
otherwise in question mark list.
Friends are rated in this scheme using three parameters: Data rating (DR), friend rating (FR), net
rating (NR). Initially the nodes only have friend List, nodes of which perform a successful
challenge. The sharing of friend list takes place periodically. Let node B sends its friend list to
node A during the friend sharing stage, then node A picks those nodes that are not in its own list
from friend list of B and includes those nodes in its own list and the rating of those nodes, which
is obtained from B set as FR of those nodes. The data rating (DR) of those nodes is set to zero.
Then the net rating (NR) of node is calculated as:
where w1 and w2 are the weight that is network dependent.
If the friend of B is already in the list of A i.e. if the nodes A and B have common nodes (let C)
then A obtains rating of C from B and calculate obtain rating as:
OR= (net rating of B in list of A * net rating of C in list of B)/ 10
FR of node C is obtained by adding all OR from various neighbor nodes and divides the value by
the sum of ratings of those various nodes. The data rating is calculated on the basis of data
transfer by a node. DR is calculated as: DR=10*(1-e-λx
), where x is no of forwarded data packets
and λ is a factor by which data packets are related to rating. The routing of data takes place when
any node has data to end. It broadcasts route request message including no of data it wants to
send. After receiving route reply messages, it finds the best route depending on the net rating
value of nodes, to the destination from its friend list.
8. 250 Computer Science & Information Technology (CS & IT)
4.7. Trust Based Security Protocol Routing [8]
In this protocol a trust mechanism is employed in DSR protocol. An extra data structure is
maintained by every node that is Neighbor’s Trust Counter Table (NTT) which is used to keep
track of no. of sent packets by a node using a forward counter (FC) and also stores the trust
counter(TC) corresponding to node. Initially a node can completely trust its neighbor or fully
distrust its neighbor as the nodes don’t have any information about its neighbor nodes reliability.
When any node needs to send data it broadcasts RREQ packets. Each time a node (let nk) receives
packet from another node (let ni), node nk increments the FC of ni as: FCni=FCni+1; i=1, 2….
Then this new FCni value is stored in NTT of node nk. After receiving all RREQ packets,
destination node makes a MAC on the no of packets it received (Prec) using the shared key
between the sender and destination. Then the destination node attaches that MAC and also the
accumulated path from the RREQ after digitally signed it, in the RREP packet and sends back in
the reverse path to the destination. The intermediate nodes of that path determines Success ratio
as: - SCni=FCni/Prec, where Prec is the no of packets received at destination. This SCni is
appended in RREP packet. The intermediate nodes in reverse path check the validity of the RREP
packet by verifying digital signature of destination. If it is valid, the intermediate node signs the
packet and forwards it to the next, otherwise the packet is dropped. When source node finally gets
the reply it first verifies the first node id in RREP packet. If it is its neighbor, then all other
intermediate nodes’ digital signature is verified. If the verifications of all the nodes are successful
then the trust counter is incremented for all the nodes as: Tci = Tci + δ1, if the verification is
failed the trust counter value is decremented by 1: Tci = Tci - δ1.where δ1 is the small fractional
value. The source node also checks the success ratio of all other nodes and compares it with the
minimum threshold value (SRmin), if the SRni of a node is less than the SRmin the trust counter
is decremented by another step value δ2 again, otherwise it is incremented. Another comparison
is made by comparing trust counter with a minimum threshold. If trust counter is less than the
trust threshold value the node is marked as malicious. This mechanism is applied to all the other
routes and a route with no or least malicious node is selected. In this way, a trusted and
authenticated route is found for secure routing.
4.8. Trust Based DSR [9]
This protocol is proposed to improve the security of the existing DSR protocol. The trust based
secure route is established in this scheme. In DSR the shortest route is selected which may not be
secure. There are some malicious nodes in the network that replies to the route request packet
with shorter hop count (black hole) so that the source will select that path, and routing process is
disrupted. The following components are used in this newly proposed protocol: Initialiser,
Upgrader, Administrator, Monitor, and Router. In this scheme, there is a separate administrator to
maintain the trust values of all other nodes. An acknowledgement module is there which is used
to keep track of all received acknowledgements and trust values of nodes are adjusted. Every
node has trust value which depends on its interaction with its neighbor. Trust unit of this scheme
comprises of three modules: - Initialiser module assigns low trust values to the unknown nodes in
initial stage. If the route contains some known and unknown nodes, then it assigns trust of those
known nodes as the initial trust value of the unknown nodes. Upgrader module upgrades the trust
value of a node based on experiences of that node in a particular situation. When a node receives
any reply from its neighbor the trust value of neighbor node is updated. If any reply is not
received by a node the trust value of the neighbor node is decreased. Trust value is evaluated as:
T= tanh[(∆ +W) *Te] where T is the updated trust, Te is existing trust, W is a weight i.e. 1 for
acknowledgements and 0.5 for data packets forwarded and received, ∆ is +1 for positive and 0 for
negative experiences. Positive experience means acknowledgement is received within the time
frame and otherwise it is considered as the negative experience. Administrator module keeps the
trust information of all the known nodes and also has some methods to query this trust
9. Computer Science & Information Technology (CS & IT) 251
information. The monitor module monitors the received acknowledgments to adjust trust values
of nodes. The router module selects the route to forward packets based on nodes trust values.
Monitor module uses two routing strategy: In the first routing strategy, the route is rated based on
the average value of all nodes along that path. The route which gets highest rating is selected for
routing. In the second routing strategy, the average of all nodes trust value is divided by no of
nodes to get shorter path. The route which gets high value is selected.
Figure 4. Components of TDSR
5. COMPARISON OF DIFFERENT TRUST BASED ROUTING PROTOCOLS
Protocol Advantage Disadvantage
1. Trusted Ad Hoc on
Demand Distance
Vector (TAODV)
1)TAODV can detect malicious
node and selfish node in network
2)It is more secure and having
better performance than AODV
3)It can prevent modification,
fabrication attacks
1)It has no authentication
mechanism of nodes and messages
2)It can’t prevent worm-hole and
impersonation attack
2. Cooperation Of
Nodes: Fairness In
Dynamic Ad-Hoc
Networks
(CONFIDANT)
CONFIDANT protocol
effectively detect selfish nodes
and PM wormhole nodes that
drop packets
1) It can’t prevent various attacks
such as modification impersonation
fabrication Sybil attack by malicious
nodes
2) An attacker is able to send false
alarm messages and can do false
claim that a node is misbehaving.
3.Friendship Based Ad
Hoc On Demand
Distance Vector
(FrAODV)
This protocol gives better
performance in terms of QoS
services like packet delivery
fraction, normalized routing load.
The end to end delay is not included
in performance measurement metric.
The delay is more here because two
evaluation algorithms are used to
establish path.
4.SecureRouting Using
Trust(SRT):
In terms of mobile mobility it
gives better throughput, packet
delivery ratio, average path
length, average routing load.
The performance decreases in the
presence of attacks except black
hole. The trust is calculated on the
basis of control packets only.
5. Trusted AOMDV Performance is measured in terms
of route selection time, trust
compromise with
TDSR,AOMDV etc
This protocol measures the
performance in fixed mobility
environment that actually not
applicable in MANET.
INITIALISER UP GRADER
MONITOR ADMINISTRATO ROUTER
STANDARD DSR PROTOCOL
10. 252 Computer Science & Information Technology (CS & IT)
6.Friend Based Ad Hoc
Routing Using
Challenges To
Establish Security
(FACES)
Challenge packet helps to detect
flooding, grey-hole, spoofing,
modification, dropping of control
packets. As well as it gives better
performance in the presence of
malicious nodes.
In this protocol control overhead is
increased due to periodic flooding of
challenge packet and periodic
sharing of friend list.
7. Trust Based
Security
Protocol(TMSP)
This protocol maintains
confidentiality and authenticates
the nodes based on digital
signature. It detects the nodes
which are misbehaving.
This protocol can’t detect
authenticated malicious node. In this
protocol after finding route then the
trust of the nodes along the path is
calculated which increases control
overhead. Because calculating the
trust after finding path is inefficient
as the path may be rejected due to
presence of malicious nodes.
8. Trust Based DSR It gives better throughput with
general DSR.
This protocol doesn’t consider
delay, packet forward ratio,
communication overhead matrices in
performance analysis.
6. CONCLUSION AND FUTURE WORK
MANETs are vulnerable to different types of attacks due to its infra-structure less network.
Different trust based approaches are proposed to prevent such types of attacks and to improve
Quality of Services (QoS). These trust based approaches try to give a secure node in routing path
by implementing trust mechanism in the existing routing protocols. In this paper, firstly we have
given a brief idea on several types of attacks that MANET suffers and trust mechanism. Then we
review currently existing trust based protocols and finally we have carried out a comparative
study on these protocols on the basis of their merits and demerits.
In the above mentioned CONFIDANT protocol the attacker can send false alarm messages to
isolate a good node by claiming it as a bad node. The attacks like wormhole, impersonation, Sybil
attack etc still exists in some of the protocol such as trusted AODV, CONFIDANT. As in
CONFIDANT protocol the reputation of a node is increased when it forwards he packet so the
malicious node that create wormhole get high reputation value.
Most of the protocols like TDSR, SRT etc. consider some performance matrices like packet
deliver ratio(no of successful packets/no of packets forwarded), average end to end delay to
forward packets to the destination and get back reply, communication overhead, route selection
time, throughput etc. to measure the performance. These protocols only focus on the
improvement of the performance through trust mechanisms but don’t focus on the security flaws
launched by malicious nodes on the network. Some protocols such as FrAODV, FACES increases
communication overhead due to excessive calculation for route finding and periodic flooding of
control packets.
After going through this comparison, we have seen that there are still many scope of work
towards the development of a new trust mechanism by considering QoS as well as minimizing the
several attacks. A newly developed trust mechanism we can apply in various environments like in
hybrid environments. We can also develop some rules in the protocol on the basis of which the
actions are taken to detect the nodes that are authenticated but perform malicious behaviour
without dropping packets and also authenticate the nodes to prevent attacks. So we can work on
these disadvantages through implementing a new trust based protocol.
11. Computer Science & Information Technology (CS & IT) 253
REFERENCES
[1] G. Aggelou (2004) Mobile Ad Hoc Networks, Mcgraw-Hill.
[2] A. M. Pushpa, (2009) “Trust Based Secure Routing In Aodv Routing Protocol”, International
Conference On Internet Multimedia Services Architecture And Applications (Imsaa), Usa: Ieee Press,
1-6.
[3] S. Buchegger, J. L. Boudec, (2002) “Performance Analysis Of Confidant Protocol”, Mobihoc’02, Epfl
Lausanne, Switzerland, Pp226-236.
[4] Essia, T., Razak, A., Khokhar, R.S., Samian, N.: Trust-Based Routing Mechanism In Manet: Design
And Implementation. Springer, 18 June 2011.
[5] Edua Elizabeth, N., Radha, S., Priyadarshini, S., Jayasree, S., Naga Swathi, K.:Srt- Secure Routing
Using Trust Levels In Manets. European Journal Of Scientific Research, Issn 1450-216x Vol. 75,
No. 3 (2012), Pp. 409-422
[6] Huang, J., Woungang, I., Chao, H., Obidant, M., Chi, T., Dhurandher, S.K.: Multi-Path Trust –Based
Secure Aomdv Routing In Ad Hoc Networks. Ieee 2011
[7] Dhurandher, S.K., Obidant, M.S., Verma, K., Gupta, P., Dhuradar, P.:Faces: Friendhip-Based Ad Hoc
Routing Using Challenges To Establish Security In Manets Systems. Ieee System Journal, Vol.5, No.
2, June 2011
[8] Sharma, S., Mishra, R., Kaur, I.: New Trust Based Security Approach For Ad-Hoc Networks
.Ieee(2010)
[9] Bhalaji, N., Mukherjee, D., Banerjee, N., Shanmugam, A.:Direct Trust Estimated On Demand
Protocol For Secured Routing In Mobile Ad-Hoc Networks. International Journal Of Computer
Science & Security, Vol. 1, Issue (5)
AUTHORS
Mousumi Sardar has received her B.Tech degree in Information Technology in the year
2011 from College of Engineering & Management, Kolaghat, India. She is now perusing
her M.Tech. degree in Information Technology from West Bengal University of
Technology Kolkata, India.
Koushik Majumder has received his B.Tech and M.Tech degrees in Computer Science and
Engineering and Information Technology in the year 2003 and 2005 respectively from
University of Calcutta, Kolkata, India. He obtained his PhD degree in the field of Mobile Ad
Hoc Networking in 2012 from Jadavpur University, Kolkata, India. Before coming to the
teaching profession he has worked in reputed international software organizations like Tata
Consultancy Services and Cognizant Technology Solutions. He is presently working as an
Assistant Professor in the Dept. of Computer Science & Engineering in West Bengal
University of Technology, Kolkata, India He has published several papers in International
and National level journals and conferences. He is a Senior Member, IEEE.