scholarly journals Trust Computation using Belief Model in Mobile Ad Hoc Network Avoiding Ballot Stuffing and Bad Mouthing

2020 ◽  
Vol 9 (4) ◽  
pp. 1057-1066
Keyword(s):  
Trust Management ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Packet Dropping ◽  
Packet Delivery ◽  
Computational Overhead ◽  
Shafer Theory ◽  
Belief Model

Trusted path in MANET ensures packet delivery and reduces the packet dropping which results in a saving of bandwidth and energy of the mobile node. Trust path finding mechanism has been proposed in the literature based on direct and indirect observations and applying Bayesian theory, Dempster-Shafer theory involving probability logic. In this paper, we studied trust computation problem in MANET with predefined fixed movement and random movement (frMANET) to compute trust to get over bad mouthing and ballot stuffing. Our scheme(frMANET scheme) is based on subjective logic based belief model involving uncertainty in behavior. We use consensus for parallel paths and discounting for transitive paths. We use public key based digital signature to deal with nonrepudiation. This identifies the node if denying that it is bad mouthing or ballot stuffing. Unlike trust management in a conventional scheme that computes trust based on packet dropping and forwarding, we have added a parameter - state of the node indicating priority work and unable to participate notification. We include service rating as well considering file sharing and file downloading as service rating parameter. We have evaluated University case study of a course offered by a professor in university to the enrolled and not enrolled students. The simulation results show an increase in packet delivery ratio with marginal overhead in average message transmission. The scheme helps in avoiding unnecessary fluctuations in trust values of trustworthy nodes and also ensures less computational overhead. This research is helpful when communication is frequent and failure of delivery of message is not tolerable in MANET and nodes need to be rated for goodness.

scholarly journals Research of Route Discovery using Proficient Route Encounter Algorithm in MANET

2019 ◽  
Vol 8 (2S11) ◽  
pp. 480-485
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Research Work ◽  
Energy Resource ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Packet Delivery ◽  
Computational Overhead ◽  
Time Period

The objective of the research work is proposed an efficient node to node route discovery in Mobile AD HOC network based on neighboring nodes resent route discovery. MANET is always depends on selected and constant path with extended time period subsequently, and the flexibility of the battery power will be condensed in searching end nodes which roots numerous path failure. In most of the scenario path failure origins consistent route discovery which is normally reduces the efficiency and it will increase the dependency in computational overhead of the nodes in the mobile routing environment .In order to overcome such failure in MANET it is proposed to implementing route discovery methodologiesand it will be done through neighboring nodes with its resent history log which is an efficient factor to reduce delay between nodes and improve consistency comparing with existing system. DSR were experimentally implemented and compared to find the end to end delay, throughput and packet delivery ratio between nodes. The proposed work is focused towards effective node discovery through Proficient Route Encounter (PRE) algorithm which minimize the delay and energy resource of the path finding node, time taken to reach its requested node and maximize packet delivery ratio and its energy efficiency.

scholarly journals Comparative study of energy efficient MAC protocol with channel aware packet Scheduling in MANET

2018 ◽  
Vol 7 (1.9) ◽  
pp. 16
Author(s):  
T Dheepak ◽  
S Neduncheliyan
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Packet Scheduling ◽  
Mac Protocol ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Link Failure ◽  
Failure State ◽  
Utility Factor ◽  
Mobile Ad Hoc

Mobile Ad Hoc Network is the centralized communication system which is used for transferring information through a secured mode from one end to another end. However, there is an energy loss that has been noticed in MANET. In this work, an efficient energy based Link Failure State Neighbor Detection Effective Efficient Protocol (LFSNDEEP) is to enhance the energy efficiency of the mobile node, and optimal transmission ratio computes Data, Audio, and Video packets. The proposed research on LFSNDEEP protocol is compared to Effective Efficient Neighbor Detection Protocol (EENDP) and which assigns the channel utilization. In this technique, the hello packet exchanges transmit based height and wavelength of the transmitter with particular distance. The computation of channel utility factor is the best method at link failure without data loss. The vitality utilization mathematical model is illustrated to show the nodes of least consumption by the broad recreation of utilization. The results observed from the proposed scheme shows that the energy level is minimized regarding the packet that loss is improved efficiently. In further, there are two results which can be gained in comparing with EENDP; firstly, packet delivery ratio and throughput get increased. And secondly, the end to end delay is decreased.

scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

scholarly journals Prediction Algorithm for Mobile Ad Hoc Network Connection Breaks

2020 ◽  
Vol 12 (6) ◽  
pp. 49-63
Author(s):  
Yasir Mohammed ◽  
Maha Abdelhaq ◽  
Raed Alsaqour
Keyword(s):  
Ad Hoc Network ◽  
Link Prediction ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Node ◽  
Prediction Algorithm ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Ad Hoc

A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.

The New Mechanism to Detect and Prevent BlackHole Attacks on AODV-Based MANET

2013 ◽  
Vol 684 ◽  
pp. 547-550
Author(s):  
Sery Vuth Tan ◽  
Minh Yuk Choi ◽  
Kee Cheon Kim
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Malicious Node ◽  
Packet Delivery ◽  
Aodv Protocol ◽  
Blackhole Attack ◽  
Mobile Ad Hoc

Mobile Ad-hoc Network (MANET) is a dynamic wireless network without any infrastructures. The network is weak and vulnerable to many types of attacks. One of these attacks is BlackHole. In this attack, a malicious node advertises itself as having a high sequence number and a shortest path to a specific node to absorb packets. The effect of BlackHole attack on ad-hoc network using AODV as a routing protocol will be examined in this research. We also propose a new mechanism, called DPBA-AODV, to detect and prevent BlackHole attacks on AODV protocol. Simulation result, by using NS2, depicts the efficiency of our proposed mechanism in packet delivery ratio under the presence of BlackHole nodes.

scholarly journals The Improved Overhearing Backup AODV Protocol in MANET

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
Author(s):  
Elham Zamani ◽  
Mohammadreza Soltanaghaei
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Energy Resources ◽  
Delivery Ratio ◽  
Limited Bandwidth ◽  
Packet Delivery ◽  
Wormhole Attacks ◽  
Aodv Protocol ◽  
Mobile Ad Hoc

Mobile ad hoc network (MANET) is one of the most widely used networks, which has attracted attentions, having features such as limited energy resources, limited bandwidth, and security weaknesses due to lack of a central infrastructure. Safe and suitable routing is one of the research aspects of MANET. In this paper, a proposed method, called M-AODV, which is a type of overhearing backup protocol, based on AODV, is presented. The simulation results of this protocol, applied by NS2 simulator, showed the improvement of packet delivery rate and reduction of overhead and delay. Moreover, to assess the security of the proposed protocol, we simulated M-AODV and AODV protocols under black hole and wormhole attacks, using no security solution. The results showed that M-AODV had been improved in terms of packet delivery ratio, and the delay had been reduced as well, but the amount of overhead had been increased.

scholarly journals Packet Delivery Ratio and Overhead Reduction for À-GPS Mobile Ad-Hoc Networks

2020 ◽  
Vol 9 (3) ◽  
pp. 743-747
Keyword(s):  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Significant Issue ◽  
Packet Delivery ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Now a day’s mobile ad-hoc network (MANET) is engaged by numerous scientists and endeavoring to be conveyed by and by. To accomplish this objective, these two components are a significant issue that we need to consider. The first is "overhead". As it were, messages that is not important to be sent when setting up a system association between versatile hubs. The following issue is the parcel sending rate from source to the goal hub that sufficiently high to ensure a successful system association. This paper is concentrating on improving the exhibition of the Location-Aided Routing Protocol (LAR) regarding overhead decrease by adjusting the calculation of the MANET course disclosure process. The consequence of the reproduction shows that the proposed convention can decrease overhead definitely, growing system lifetime and increment parcel sending rate while contrasting and other traditional conventions.

A Survey of Efficient Trust Management Schemes in Mobile Ad-Hoc Network

2019 ◽  
Vol 15 (2) ◽  
pp. 35-54
Author(s):  
J. Kaur ◽  
S. Kaur
Keyword(s):  
Key Management ◽  
Trust Management ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Base Station ◽  
Destination Node ◽  
Delivery Ratio ◽  
Detection Accuracy ◽  
Neighboring Node ◽  
Mobile Ad Hoc

Mobile Ad Hoc Networks (MANETs) are comprised of an arrangement of self-sorting mobile hosts furnished with wireless interaction devices gathered in groups without the need of any settled framework as well as centralized organization to maintain a system over radio connections. Every mobile node can react as a host and also, the router freely utilizes the wireless medium inside the correspondence range to deal with the interaction between huge quantities of individual mobile nodes by framing a correspondence system and trading the information among them without using any described group of the base station. A trust-based model in MANET estimates and sets up trust relationship among objectives. Trust-based routing is utilized to keep away data from different attackers like a wormhole, DOS, black-hole, selfish attack and so forth. Trust can be executed in different steps like reputation, subjective rationale and from the supposition of the neighboring node. A trust estimation approach not just watches the behavior of neighbor nodes, additionally it screens the transmission of the information packet in the identification of the route for exact estimation of trust value. A survey is carried out to find some of the limitations behind the existing works which has been done by the researchers to implement various approaches thus to build the trust management framework. Through the survey, it is observed that existing works focused only on the authenticated transmission of the message, how it transmits packets to the destination node securely using a trust-based scheme. And also, it is observed that the routing approach only focused on the key management issues. Certain limitation observed in the implemented approaches of existing work loses the reliability of framework. Thus, to withstand these issues it is necessary to establish a reliable security framework that protects the information exchanged among the users in a network while detecting various misbehaving attacks among the users. Confidentiality, as well as the integrity of information, can be secured by combining context-aware access control with trust management. The performance parameters should be evaluated with the previous works packet delivery ratio, packet drop, detection accuracy, number of false positives, and overhead.

Sign in / Sign up

Export Citation Format

Share Document