This document discusses a trust assessment approach for ad-hoc networks using fuzzy trust assessment (FTA). It proposes using FTA to evaluate the trust values of nodes based on factors like replay attacks and dropped packets. This allows identification of malicious nodes. When a source node wants to send data to a destination, it broadcasts a route request (RQ) packet. Intermediate nodes calculate trust values and forward the RQ along paths with higher trust values. Once the destination receives an RQ, it sends a route reply (RP) packet back along the reverse path. FTA keeps track of trust information to identify the most reliable path between source and destination, avoiding malicious nodes.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
AGPM: An Authenticated Secure Group Communication Protocol for MANETsIDES Editor
Secure group communication is a challenging task
with respect to MANET’s, authentication of mobile nodes,
group key establishment and rekeying for secure
information exchange and QoS in data transfer. In this
paper we authenticate the mobile nodes through transitive
signature scheme in the routing phase of AODV protocol.
For a secure group communication we establish a
collaborative group key with the members participating in
the route path to the destination. The nodes are dynamic in
nature, in which any new node can join in the group or
leave the group. Instead of performing individual Rekeying
operations, it is performed at a particular time interval.
Performance of the group communication is compared with
the existing protocols. The analysis is made with respect to
the throughput, rekeying time, delay, overhead and
communication cost. The simulation result shows that our
protocol enjoys greater advantage over other protocols in
the literature.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 Nodes Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.
Enhancement and performance evaluation of a multicast routing mechanism in zi...Raja' Masa'deh
this presentation presents description of a paper "Enhancement and Performance Evaluation of a Multicast Routing Mechanism in ZigBee Cluster-tree Wireless Sensor Network".
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
A SURVEY ON TRUST BASED SECURE ROUTING IN MANET cscpconf
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 survey on trust based secure routing in manetcsandit
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.
AGPM: An Authenticated Secure Group Communication Protocol for MANETsIDES Editor
Secure group communication is a challenging task
with respect to MANET’s, authentication of mobile nodes,
group key establishment and rekeying for secure
information exchange and QoS in data transfer. In this
paper we authenticate the mobile nodes through transitive
signature scheme in the routing phase of AODV protocol.
For a secure group communication we establish a
collaborative group key with the members participating in
the route path to the destination. The nodes are dynamic in
nature, in which any new node can join in the group or
leave the group. Instead of performing individual Rekeying
operations, it is performed at a particular time interval.
Performance of the group communication is compared with
the existing protocols. The analysis is made with respect to
the throughput, rekeying time, delay, overhead and
communication cost. The simulation result shows that our
protocol enjoys greater advantage over other protocols in
the literature.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 Nodes Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.
Enhancement and performance evaluation of a multicast routing mechanism in zi...Raja' Masa'deh
this presentation presents description of a paper "Enhancement and Performance Evaluation of a Multicast Routing Mechanism in ZigBee Cluster-tree Wireless Sensor Network".
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
A SURVEY ON TRUST BASED SECURE ROUTING IN MANET cscpconf
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 survey on trust based secure routing in manetcsandit
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.
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.
Interference Minimization Protocol in Heterogeneous Wireless Sensor Network f...IJERA Editor
High-quality data transmission is the primary objective of WSN for achieving quality of service.
Heterogeneous wireless sensor networks (HTWSN) can be used to deploy in sensitive and unmanned areas
to monitor the objects. HTWSN is high configured network used to capture high-quality images and videos
of targeted objects. During the data transmission in HTWSN, we identified that, the formation of
interference with in the network due to link capacity overhead. Due to that, the quality data transmission is
not possible through the network. In this research paper, we described the deployment of HTWSN network
and identifying the primary sources for interference and introducing the proposed Interference
Minimization Protocol (IMP). The IM protocol has achieved better quality of service by minimizing the
interference in HTWSN.
A adaptive neighbor analysis approach to detect cooperative selfish node in m...Jyoti Parashar
A mobile network is a dynamic reconfigurable network with heavy traffic over the network. As the network is available widely, there are more chances of inclusion of external nodes that behave as the attack node. One of the problems in mobile network is the cooperative selfish node attack. In which more than one node cooperatively perform the attack. In such attack, the malicious nodes communicate effectively between them but as they get the packet from some other node, they do not forward the packets. The presented work is about the table driven cross check performed over each node to identify the trustfulness of a node.
Disruption Tolerant Network Coding scenarios often rises from mobile wireless networks where due to limited transmission power, fast node mobility,sparse node density, and frequent equipment failures, there is often no contemporaneous path from the source to destination nodes. Before going to the depth of DTN, it is recommended to review traditional non-coding routing schemes for broadcast and unicast applications in DTNs, and the basic operations of Random Linear Coding (RLC).
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.
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.
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkIJMER
A wireless sensor network is a collection of nodes organized into a cooperative network.
Each node consists of processing capability, may contain multiple types of memory, have a RF
transceiver, have a power source, and accommodate various sensors and actuators. The nodes
communicate wirelessly and often self-organize after being deployed in an ad hoc fashion.
Routing protocols for wireless sensor networks are responsible for maintaining the routes in the
network and have to ensure reliable multi-hop communication .The performance of the network is
greatly influenced by the routing techniques. Routing is to find out the path to route the sensed data to
the base station. In this paper the features of WSNs are introduced and routing protocols are reviewed
for Wireless Sensor Network.
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.
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.
Similar to TRUST ASSESSMENT THROUGH FTA APPROACH IN AD-HOC NETWORK (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.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
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.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
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.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
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.
2. 296 Computer Science & Information Technology (CS & IT)
mobile nodes is particularly challenging which may solve for many routing issues. In this paper a
modified approach for optimising the routing protocol through assessing the trust level between
nodes is introduced. Different scenarios are identified and are combined simulated to determine if
anode is action maliciously or not.
2. EARLIER WORK FOR TRUST ENHANCED ROUTE FOR AD-HOC NETWORKS
In the DSR protocol, DSR routing model faces some security problems, those are given below:
a) Through the non jam-packed route, RQ packets reach the destination very soon rather than the
jam packed route. So jam-packed route can be avoided. But there is a problem that is a shorter
path may present within the jam-packed route which may not be utilised.
b) The one hop neighbour sends RQ packets to the destination end , just after receiving 1st
RQ.As
a result most of the packets from the other nodes(far from destination node) are discarded.
c) A node, after receiving RQ packet, checks it and drops it if it is previously processed. As a
result a malicious node forwards that RQ very quickly, then the other RQ packets from the
other nodes, are dropped.
d) Sometimes malicious node hampers good traffic operation in an ad-hoc network by disturbing
route error information, routing table, routing state etc.
In order to solve these above mentioned problems and to establish a robust secure reliable path
from source to destination without falsification of route and information packet we are going to
introduce Trust Enhancement Route scheme for ad-hoc network.
Trust value: Reliability, of a node with respected to its neighbour node can be represented by a
parameter, called trust value of a node in a network. An initial Trust value is assigned for
neighbour node which is encountered for the 1st
time. Initialisation of assignment of the initial
trust value of the neighbour nodes including malicious nodes can be done by the trust values of
known neighbour nodes. Actually a Trust value depends upon the experience of given node.
Up gradation of trust value: The Trust value for a neighbour node will be upgraded, when a node
gets the RP packet from this neighbour node. So there should be a function to upgrade the Trust
value:
T(next)=K[T(previous)-Ex]+Ex.
Where, T(next)=New upgraded Trust value. T(previous)=previous Trust value, Ex = value of
experience, K = constant
There are two sub modules under this module:
• Administrator module which is use to accumulate Trust information of the known nodes.
It acts as a interface between DSR protocol and previous modules.
• Router module selects the most reliable path having lowest number of malicious nodes,
depending upon the Intimacy of a node with its neighbour nodes.
•
De gradation of trust value: If the RP packet is not received, the Trust value for this neighbour
node has to be de graded.
3. Computer Science & Information Technology (CS & IT) 297
Establishment of the co-relation of the neighbour nodes:
If the trust value of the neighbour node is greater than a threshold value then that node is a known
node for the source node, otherwise it is an unknown node for the source node. This threshold
value can be represented by a numerical value i.e., 0.5.
This known node is classified into two categories i) Completely known and ii) Moderately
known.
Table 1. Co-relation table
Relation with source Trust value Transaction type
Completely known
node
Tc: 0.75<T<=1 Plenty of reception RP and transmission RQ of
packets
Moderately known
node
Tm: 0.5<=T<0.75 Few transaction
Unknown node /
Malicious node
Tu: 0<=T<0.5 No transaction
When Trust value of a known node is greater than 0.5 and less than 0.75 then this is a moderately
known node. That means the transaction between the source node and this neighbour node is
performed moderately. And when Trust value of a known node is greater than 0.75 and less than
1 then this is a completely known node. That means lots of transaction are performed between
source and this neighbour node.
2.1. For reliable transaction
First of all we should recognise the malicious node which is responsible to falsify the path
detection and the information, to secure the transaction we can follow the above mentioned co-
relation table. During source to destination data transmission we should include the important
field that is Trust field at the header part of the framed packet along with the payload.
For one –way propagation there is a timer, Td =2*R/s+K.
Where R = maximum range for sending data.
s = speed of data which is transmitted.
K = constant.
After every RQ packet reception by a neighbour node, the Trust field of the data is updated by
using a formula
Trust field (new) =Trust field (previous) + Txy (when x node receives the broadcasted data of
node y).
Similarly when the destination node receives the packet which is sent by the source and reaches at
the destination through a reliable, shorted route, another trust field should be introduced at the
header of RP packet, which will be transmitted to the source. For forward direction Trust field is
denoted by Tf and for the reverse direction Trust field is denoted by Tr.
4. 298 Computer Science & Information Technology (CS & IT)
2.2. Total transaction
Fig. 1 : A Network
In a DSR network we consider source S sends data to the destination end D.In this Fig.1 S sends
RQ packet to all the neighbours. A communication between S and C is shown here. In
transmission path the packets routed through S, G, D and C and in reverse path it is routed
through C, B, A and S. Nodes with Tf field along with the header to discover a secure path to
destination. After selection of the secure, shortest path, let S sends packet through the path S, G,
D and C to the destination end. Each and every intermediate node upgrades its Trust field by
involving Trust values of the node from where it receives the packet. From source to destination
RQ packet transmission the total Trust value has to be:
Tf(total) = T(AS)+T(BA)+T(CB)+T(DC).
After reception of the data packet from the source end, D sends an acknowledgement through a
reliable path, therefore like an S node; D node also checks the Trust values of neighbour nodes
within its path to source. So for RP packets the total reverse direction Trust value has to be:
Tr(total) = T(CD)+T(BC)+T(AB)+T(SA).
So for total transaction (From source to destination and destination to source), the total trust value
can be calculated as
T=[{Tf(total)+Tr(total)}/2]*Si=[{T(AS)+T(BA)+T(CB)+T(DC)+
T(CD)+T(BC)+T(AB)+T(SA)}/2]*Si.
X
Where, Si=1/xi / ∑1/xi, for ith
possible path
i=1
Therefore from the above expression of T all nodes have mutual Trust information within the
path from source to destination.
3. PERFORMANCE ANALYSIS IN OUR PREVIOUS WORK
We have used network simulator 2, a simulator for mobile Ad-hoc network to evaluate the
effectiveness of the proposed scheme. The simulator is done with 25 nodes moving with speeds 1,
5, 10, 15, 20 m/s in a 400x400 sq.m. area. The pause time is 10 ms between the movements of the
nodes. The transmission range of the each node is 100 m. We assume that there are 0-40%
malicious nodes in the network.
To analyze the Performance of the proposed scheme we use the following metrics:
5. Computer Science & Information Technology (CS & IT)
Routing Overhead: It is define as the number of RQ packets transferred taken to find a secure
path from source to destination, in the presence of malicious nodes.
Throughput: It is the ratio of the number of data packets re
number of packets sent by the source node.
The performance of the proposed scheme is compared with standard DSR protocol by varying the
number of malicious nodes and node moving speed. For performance analysi
parameters-
i) Routing overhead, ii) dropping
Fig. 2: Comparative graph of Throughput of T
In fig 2 the achieved throughput is
Fig. 3: Comparative graph of Routing overhead of T
The next observing parameter
standard DSR.
Computer Science & Information Technology (CS & IT)
It is define as the number of RQ packets transferred taken to find a secure
path from source to destination, in the presence of malicious nodes.
It is the ratio of the number of data packets received by the destination node to the
number of packets sent by the source node.
The performance of the proposed scheme is compared with standard DSR protocol by varying the
number of malicious nodes and node moving speed. For performance analysis we have used three
dropping of malicious nodes, iii) Throughput.
Comparative graph of Throughput of T-DSR and DSR with respect to number of malicious node
the achieved throughput is clearly greater than the standard DSR.
Fig. 3: Comparative graph of Routing overhead of T-DSR and DSR with respect to number of malicious
nodes
The next observing parameter is Routing Overhead, which is clearly high compared to the
299
It is define as the number of RQ packets transferred taken to find a secure
ceived by the destination node to the
The performance of the proposed scheme is compared with standard DSR protocol by varying the
have used three
DSR and DSR with respect to number of malicious nodes
DSR and DSR with respect to number of malicious
compared to the
6. 300 Computer Science & Information Technology (CS & IT)
Fig. 4: Comparative graph of dropping malicious node of T
Fig. 4 shows the dropping of malicious node
case of Trust Enhancement scheme compared to standard DSR.
4. OVERVIEW OF THE FTA
Trust Level in an ad-hoc network serves the reliability of nodes during data packets transmission
from source to destination through a most reliable path.
fuzzy logic to evaluate trust value of the nodes, and at the same time this a
recognise the malicious nodes in the network.
The input parameters of FTA are a) number of replay attacks, b) forwarded packets
destination, c) number of untruthful routing message, d
In the undiscovered route if P (source) wants to send information packets to the Q (destination
end), path discovery should be done on
its neighbouring nodes, those are responsible to find out the trust
Here we consider the minimum trust level of k
To choose most reliable path from P to Q,
after sending a RQ, P node can g
routing protocol, the nodes which are not included in a selected path will not participate in
routing table. Destination IP
information next hop should be included in FTA table.
When P starts to send a message to Q it starts to initiate a valid path between them by sending a
signal RQ to its neighbours. the RQ consists of P’s IP address, its sequence no., its current trust
value, hop count and life span .To with when the sequence no. is unknown the sequence no. flag
must be set to some initial value and the hop coun
node the hop-count of RQ packet is increased by 1, and the hopping information
initialisation of the valid path between P and Q is updated. In the same way the trust
current node is compared with the previous one and updates
of originator RQ packet. In this way in each c
greater than the previous one the RQ
In order to establish a reverse path each intermediate node records the address of neighbours from
which they receive packets. Once
Computer Science & Information Technology (CS & IT)
ative graph of dropping malicious node of T-DSR and DSR
shows the dropping of malicious nodes over total drops. The amount of dropping is less in
case of Trust Enhancement scheme compared to standard DSR.
FTA
hoc network serves the reliability of nodes during data packets transmission
from source to destination through a most reliable path. So we propose an algorithm based on
fuzzy logic to evaluate trust value of the nodes, and at the same time this algorithm is used to
recognise the malicious nodes in the network.
The input parameters of FTA are a) number of replay attacks, b) forwarded packets
of untruthful routing message, d) number of dropped packets.
(source) wants to send information packets to the Q (destination
ath discovery should be done on demand. First of all P sends RQ (route request signal) to
its neighbouring nodes, those are responsible to find out the trust values of their next hop nodes.
Here we consider the minimum trust level of kth
node in nth
route, is Tnk where k ϵ (1,….n).
To choose most reliable path from P to Q, FTA uses the trust values of nodes. In this protocol,
after sending a RQ, P node can get more than one RP .Because of the source initiated on
routing protocol, the nodes which are not included in a selected path will not participate in
routing table. Destination IP address, sequence no. flag, trust level, and hop count and
n next hop should be included in FTA table.
When P starts to send a message to Q it starts to initiate a valid path between them by sending a
signal RQ to its neighbours. the RQ consists of P’s IP address, its sequence no., its current trust
unt and life span .To with when the sequence no. is unknown the sequence no. flag
must be set to some initial value and the hop count may be considered as 0.At the
count of RQ packet is increased by 1, and the hopping information
of the valid path between P and Q is updated. In the same way the trust
current node is compared with the previous one and updates the trust parameter in the trust field
of originator RQ packet. In this way in each comparison whenever the present trust level is
greater than the previous one the RQ packet is updated and hence moves towards a valid path.
In order to establish a reverse path each intermediate node records the address of neighbours from
packets. Once RQ reaches the destination Q, a RP packet is generated and
of dropping is less in
hoc network serves the reliability of nodes during data packets transmission
So we propose an algorithm based on
lgorithm is used to
The input parameters of FTA are a) number of replay attacks, b) forwarded packets to the wrong
of dropped packets.
(source) wants to send information packets to the Q (destination
First of all P sends RQ (route request signal) to
values of their next hop nodes.
(1,….n).
nodes. In this protocol,
et more than one RP .Because of the source initiated on-demand
routing protocol, the nodes which are not included in a selected path will not participate in
sequence no. flag, trust level, and hop count and
When P starts to send a message to Q it starts to initiate a valid path between them by sending a
signal RQ to its neighbours. the RQ consists of P’s IP address, its sequence no., its current trust
unt and life span .To with when the sequence no. is unknown the sequence no. flag
t may be considered as 0.At the intermediate
count of RQ packet is increased by 1, and the hopping information towards the
of the valid path between P and Q is updated. In the same way the trust level at the
the trust parameter in the trust field
omparison whenever the present trust level is
towards a valid path.
In order to establish a reverse path each intermediate node records the address of neighbours from
RQ reaches the destination Q, a RP packet is generated and
7. Computer Science & Information Technology (CS & IT)
travels though the reverse path.
count value by 1since RP is moving through a reverse path, when RP reaches the source, the hop
count indicates the double distance between the P and Q. The source sequence number in RP is
compared with destination sequence number and compared at
current trust value. The minimum value represents the trust level of the route. FTA now picks the
route with highest trust level as the most reliable path between P and
5. PERFORMANCE ANALYSIS
We have started our analysis with the same network as in our earlier paper. We have used
OPNER modeller V11.5 for the simulation.
within AODV routing protocol is considered. The simulation process consists of no. of scenarios
producing practical configuration. Every scenario runs in 5 different c
none of the above 25 nodes acts maliciously or 10 or 15 of them are acting maliciously and so on.
We also have considered the malicious nodes drop packets within the simulation time. In our case
each malicious nodes are dropping packets in between 50 and
simulation is done within the span of 300 seconds. We also have said the condition that for the
60 seconds the nodes move randomly with a speed 10 meter /sec, after that in
seconds they come back to their
We choose our scenarios such that station _1 sends traffic to station _25.To study of the effects of
the malicious node three performance matrix will be measured for their above mentioned
scenarios namely Throughput (T),
performance of different approaches we define overall performance index defined as,
OPI=WT*T+WD*D+WDl*Dl where Dl represents round trip delay and W’s represents
corresponding weights.
The distribution of the weights can defer from one
and video based application the weight for packet loss should have the highest value. In our case
to study the ADHOC network we choose W
Computer Science & Information Technology (CS & IT)
travels though the reverse path. Whenever an intermediate node receives RP it increases the hop
count value by 1since RP is moving through a reverse path, when RP reaches the source, the hop
count indicates the double distance between the P and Q. The source sequence number in RP is
red with destination sequence number and compared at each node in order to conclude
current trust value. The minimum value represents the trust level of the route. FTA now picks the
as the most reliable path between P and Q.
NALYSIS OF TRUST LEVEL USING FTA
We have started our analysis with the same network as in our earlier paper. We have used
simulation. One wireless LAN with 25 nodes with speed 11
is considered. The simulation process consists of no. of scenarios
producing practical configuration. Every scenario runs in 5 different configurations. For example
none of the above 25 nodes acts maliciously or 10 or 15 of them are acting maliciously and so on.
We also have considered the malicious nodes drop packets within the simulation time. In our case
each malicious nodes are dropping packets in between 50 and 100 seconds where as the total
simulation is done within the span of 300 seconds. We also have said the condition that for the
seconds the nodes move randomly with a speed 10 meter /sec, after that in duration
seconds they come back to their initial position.
Fig. 5: Experimental Scenario
We choose our scenarios such that station _1 sends traffic to station _25.To study of the effects of
the malicious node three performance matrix will be measured for their above mentioned
(T), Routing overhead (R) and Drop of packet (D).To compare the
performance of different approaches we define overall performance index defined as,
*Dl where Dl represents round trip delay and W’s represents
the weights can defer from one application to other, as an example for voice
and video based application the weight for packet loss should have the highest value. In our case
to study the ADHOC network we choose WT= Wd=25 and WDl=50.
301
Whenever an intermediate node receives RP it increases the hop
count value by 1since RP is moving through a reverse path, when RP reaches the source, the hop-
count indicates the double distance between the P and Q. The source sequence number in RP is
each node in order to conclude the
current trust value. The minimum value represents the trust level of the route. FTA now picks the
We have started our analysis with the same network as in our earlier paper. We have used
One wireless LAN with 25 nodes with speed 11Mbps
is considered. The simulation process consists of no. of scenarios
onfigurations. For example,
none of the above 25 nodes acts maliciously or 10 or 15 of them are acting maliciously and so on.
We also have considered the malicious nodes drop packets within the simulation time. In our case
100 seconds where as the total
simulation is done within the span of 300 seconds. We also have said the condition that for the 1st
duration of 20
We choose our scenarios such that station _1 sends traffic to station _25.To study of the effects of
the malicious node three performance matrix will be measured for their above mentioned
(D).To compare the
performance of different approaches we define overall performance index defined as,
*Dl where Dl represents round trip delay and W’s represents
application to other, as an example for voice
and video based application the weight for packet loss should have the highest value. In our case
8. 302 Computer Science & Information Technology (CS & IT)
6. RESULTS AND ANALYSIS
The variation of the Throughput, Routing overheads and Drop of packets are
individually .in all the cases the performances are improved with FTA approach. In figure 5 it can
be seen that T is improved by around 30% .Whereas the route over head is improved only 8
because the network consists of 25 nodes. If the no. of node r
improved up to 20-25%.The packet loss is maximum when all node starts to behave maliciously
but it remain almost same in comparison with DSR and T
comparison between TDSR and FTA to establish the
Table 2.
Fig. 6: Comparative graph of Throughput
In this figure throughput is better for FTA. The throughput of DSR decreases so fast than other
two protocols.
Fig. 7: Comparative graph of Routing Overhead of DSR,
Parameters
Drop of packets
OPI
Computer Science & Information Technology (CS & IT)
NALYSIS
The variation of the Throughput, Routing overheads and Drop of packets are
individually .in all the cases the performances are improved with FTA approach. In figure 5 it can
be seen that T is improved by around 30% .Whereas the route over head is improved only 8
because the network consists of 25 nodes. If the no. of node reduced down to 5,
25%.The packet loss is maximum when all node starts to behave maliciously
but it remain almost same in comparison with DSR and T-DSR. The following table makes a
comparison between TDSR and FTA to establish the improvement of our proposed scheme.
Table 2. Comparative table of TDSR and FTA
Fig. 6: Comparative graph of Throughput of DSR, T-DSR and FTA with respect to number of malicious
nodes
throughput is better for FTA. The throughput of DSR decreases so fast than other
Fig. 7: Comparative graph of Routing Overhead of DSR, T-DSR and FTA with respect to number of
malicious nodes
Parameters TDSR
(in percentage)
FTA
(in percentage)
Drop of packets 51 50
45.54 59.66
The variation of the Throughput, Routing overheads and Drop of packets are analysing
individually .in all the cases the performances are improved with FTA approach. In figure 5 it can
be seen that T is improved by around 30% .Whereas the route over head is improved only 8-10 %
educed down to 5, R may be
25%.The packet loss is maximum when all node starts to behave maliciously
DSR. The following table makes a
improvement of our proposed scheme.
FTA with respect to number of malicious
throughput is better for FTA. The throughput of DSR decreases so fast than other
spect to number of
(in percentage)
9. Computer Science & Information Technology (CS & IT)
In the fig. 7 the routing overhead of FTA is much more than TDSR and DSR. The Routing
overhead is close to 70 above for FTA in our experiment.
Fig. 8: Comparative graph of dropping malicious nodes of DSR, T
In the Fig. 8 the drop of the packets are much more less for the case of FTA.
7. CONCLUSION AND FUTURE
In this paper we have highlighted the significance of Trust Enhancement of the mobile ad
network; we also analyze the different types of security issues to the network. The proposed
scheme can be used to improve the reliability and the performance to a
we are using fuzzy logic concept for Trust Enhancement to solve the problem of
infrastructure in MANET. Significant
scheme which will motivate us for some further improved performance analysis of Ad
network. Further investigations in this regard can be carried out
provide load balancing using alternate ro
REFERENCES
[1] A.Neogi and A. Banerjee. “Trust Improvement among the nodes in a Wireless Ad
International Journal of Advanced
3, May2012.
[2] Alia Fourati, Khaldoun Al Agha and
Networks” Int. J. Electronic Business, 2007
[3] Jeremy J. Blum, Member, IEEE, and Azim
Protocol for Robust and Scalable Intervehicle Communications”
Transportation Systems, vol. 8, no. 1, March 2007.
[4] Huaizhi Li and Mukesh Singha,
Society February 2007.
[5] C.Shiva Ram Murthy and B.S.Manoj, “ ad hoc wireless network: Architecture and Protocol” Prentice
Hall,2004.
[6] D.Johnson, D.Maltz, Y.Hu and J.Jetcheva, The DSR protocol for mobile ad hoc network, Internet
Engineering Task Force, Mar.2001.
[7] Richard Dawkins. The selfish Gene. Oxford University Press,1980 edition.1976.
[8] S.Murthy,” Routing Protocol threat analy
http:/www.ietf.org/internetdrafts/draft
[9] Ernesto Jimenez Caballero, “Vulnerabilities of Intrusion Detection System in Mobile Ad hoc
network- The routing problems”, Tkk t
Computer Science & Information Technology (CS & IT)
the routing overhead of FTA is much more than TDSR and DSR. The Routing
overhead is close to 70 above for FTA in our experiment.
Fig. 8: Comparative graph of dropping malicious nodes of DSR, T-DSR and FTA
the drop of the packets are much more less for the case of FTA.
UTURE WORK
In this paper we have highlighted the significance of Trust Enhancement of the mobile ad
we also analyze the different types of security issues to the network. The proposed
scheme can be used to improve the reliability and the performance to an Ad-hoc network. Here
we are using fuzzy logic concept for Trust Enhancement to solve the problem of
structure in MANET. Significant improvement is been observed after applying the proposed
scheme which will motivate us for some further improved performance analysis of Ad
network. Further investigations in this regard can be carried out to prevent node congestion and to
provide load balancing using alternate routes discovered by the proposed protocol.
A. Banerjee. “Trust Improvement among the nodes in a Wireless Ad-
International Journal of Advanced Research in Computer Engineering & Technology Volume 1, Issue
Alia Fourati, Khaldoun Al Agha and Hella Kaffel Ben Ayed “Secure and Fair Auctions over Ad
Int. J. Electronic Business, 2007.
Jeremy J. Blum, Member, IEEE, and Azim Eskandarian, Member, IEEE, “A Reliable Link
Protocol for Robust and Scalable Intervehicle Communications” IEEE Transactions On Intelligent
Transportation Systems, vol. 8, no. 1, March 2007.
Mukesh Singha, “Trust Management in Distributed Systems” IEEE Computer
and B.S.Manoj, “ ad hoc wireless network: Architecture and Protocol” Prentice
Y.Hu and J.Jetcheva, The DSR protocol for mobile ad hoc network, Internet
ineering Task Force, Mar.2001. http://www.ietf.org/internetdrafts/draft-ietf.
Richard Dawkins. The selfish Gene. Oxford University Press,1980 edition.1976.
S.Murthy,” Routing Protocol threat analysis” Internet Engineering Task Force, Mar.2002.
http:/www.ietf.org/internetdrafts/draft-ietf.
Ernesto Jimenez Caballero, “Vulnerabilities of Intrusion Detection System in Mobile Ad hoc
The routing problems”, Tkk t-110.5290 seminar on Network security 2006.
303
the routing overhead of FTA is much more than TDSR and DSR. The Routing
DSR and FTA
In this paper we have highlighted the significance of Trust Enhancement of the mobile ad-hoc
we also analyze the different types of security issues to the network. The proposed
hoc network. Here
we are using fuzzy logic concept for Trust Enhancement to solve the problem of lack of
improvement is been observed after applying the proposed
scheme which will motivate us for some further improved performance analysis of Ad-hoc
to prevent node congestion and to
-hoc Network”
Volume 1, Issue
Hella Kaffel Ben Ayed “Secure and Fair Auctions over Ad Hoc
A Reliable Link-Layer
IEEE Transactions On Intelligent
IEEE Computer
and B.S.Manoj, “ ad hoc wireless network: Architecture and Protocol” Prentice
Y.Hu and J.Jetcheva, The DSR protocol for mobile ad hoc network, Internet
sis” Internet Engineering Task Force, Mar.2002.
Ernesto Jimenez Caballero, “Vulnerabilities of Intrusion Detection System in Mobile Ad hoc
10. 304 Computer Science & Information Technology (CS & IT)
[10] Y.C.Hu, A.Perring and D.B.Johnson,” Packet Leashes: A Defence against Wormhole attacks in
wireless Ad hoc network”, Proc. 22nd
annual joint conference . IEEE computer and communication
society (Infocom 03) Sanfransisco,CA, April’2003.
[11] Sonja Buchegger and Jean-Yves Le Boudec ,” Performance analysis of CONFIDANT Protocol”,
Proceedings of the 3rd
ACM International symposium on mobile Ad hoc networking and
computing’02.
[12] John Keane, “ trust Based DSR in Mobile Ad hoc networks, Trinity College Dublin,2002.
[13] Kevin Fall and Kannan Vardhan, The ns nam manual, www.isi.edu/nsnam/ns/doc/index.html.
[14] Sergio Marti,T.J.Giuli, Kevin Lai and Mary Baker,” Mitigating routing misbehaviour in Mobile ad-
hoc networks”. In Proceedings of MOBICOM 2000. Pages 255-256. 2000.
[15] H.Hallani and S.A.Shahrestani “Trust assessment in wireless Ad-hoc network”978-1-4244-
2829,IEEE 2008.
[16] H.Hallani and S.A.Shahrestani, “Wireless Ad-hoc network : employing behaviour history to combat
malicious nodes”, In Proc. International Conf on Signal Processing and Telecommunication
Systems(ICSPCS’07), Gold Coast , Australia, December, 2007, pp.1-6.
AUTHORS
Ananya Banerjee
She is associated with ECE department in Dr Sudhir Chandra Sur Degree Engineering
College (WBUT) from 2010. She has started her carrier as a lecturer in Academy of
Technology (WBUT) and then Institute of Engineering and Management (WBUT). In
total 4.7 years experienced, Mrs. Banerjee has passed her M.Tech from Institute of
Radio Physics and Electronics and M.Sc. in Electronic Science from University College
of science and technology, Calcutta University. Having interest in Communication
network, she has published one inter national journal paper on “Trust Improvement
among the nodes in a Wireless Ad-hoc Network” International Journal of Advanced
Research in Computer Engineering & Technology Vol. 1, Issue 3, May2012.
Sutanu Ghosh
Presently he is working as Assistant Professor in Electronics and Communication
Engineering Department of Dr Sudhir Chandra Sur Degree Engineering College,
Kolkata. After the completion of M.tech. Degree in Mobile Computing and
Communication Engineering from Jadavpur University (2009), he is actively engaged in
teaching since 2009. His current research interests are in the areas of Network
Architecture and protocols, Integration Architecture of WLAN and 3G Networks,Voice
Over IP network and Wireless Ad-hoc Networks. Mr. Ghosh is a Member of IAENG
and IACSIT. He has published many research contributions in prestigious peer Reviewed
journals.
Anirban Neogi
He is currently working as the HOD of ECE department of Dr. Sudhir Chandra Sur
Degree Engineering College.She has started her carrier as a lecturer in Bengal Institute of
Technology (Under Techno India Group). He has total experience of over 10 years in
teaching. As a part of his research activity he got 6 international journal publications and
few conference papers in the field of Nanoscience and as well as in Ad-hoc
network. He did his M.Tech from Institute of Radio Physics and Electronics and M.Sc. in
Electronic Science from university college of science and technology, Calcutta
university.