scholarly journals Detection and Prevention of Drop Attack in WANET Using Robust Scheme Method

2021 ◽  
Author(s):  
Vinoth kumar P ◽  
Venkatesh K
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Network Routing ◽  
Wireless Ad Hoc Network ◽  
Drop Attack ◽  
Network Protection ◽  
High Speeds ◽  
Digital Signature Algorithm ◽  
Hoc Networks

Abstract Performance and protection are the main important factors of Wireless Ad-hoc Network. Network protection includes the protection, stability and parameters of WANET. This helps to avoid significant service disruptions and increases network productivity by making the network more efficient. Since wireless ad hoc networks lack concentrate network management, these methods are vulnerable to data attack. In selected intruder finding tests, the neighboring locations are not trusted to send messages below. It is important to expose the invalid node, which pulls the capture mode and separates it from the network by pushing its routing mechanism. In this paper, we introduce the Resistant Drop Attack (RDA) method to provide effective protection against data loss. An RDA network protocol is recommended to detect weak nodes in the network during a fixed-speed attack. The RDA protocol can be embedded with present Wireless Ad-hoc Network routing systems such as AODV and DSR. Using the Digital Signature Algorithm (DSA) improves the reliability of the route by blocking links at high speeds and verifying the nodes.

Cross-Layered Secure and QoS Aware Design of VOIP over Wireless Ad-Hoc Networks

2013 ◽  
Vol 9 (4) ◽  
pp. 23-45 ◽  
Author(s):  
Shahin Vakilinia ◽  
Mohammadhossein Alvandi ◽  
Mohammadreza Khalili Shoja ◽  
Iman Vakilinia
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Denial Of Service ◽  
Cross Layer ◽  
Wireless Ad Hoc Network ◽  
Cross Layer Design ◽  
Hoc Networks

In this paper, Cross-layer design has been used to provide quality of service (QoS) and security at the same time for VOIP over the wireless ad-hoc network. In this paper the authors extend their previous work (i.e. Multi-path Multi-Channel Protocol Design for Secure QoS-Aware VOIP in Wireless Ad-Hoc Networks) by adding transport and application layers considerations. The goal of this paper is to support QoS and security of VOIP simultaneously. Simulation results shows that the proposed cross-layered protocol stack design significantly improve QoS parameters of the VOIP calls under the jamming or Denial-of-service attacks.

scholarly journals ECC Based Defense Scheme for Selective Drop Attack in Wireless Ad Hoc Network

2021 ◽  
Vol 10 (5) ◽  
pp. 123-131
Author(s):  
Sangeetha V ◽  
Dr. G. Umamaheswari
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Malicious Nodes ◽  
Economic Productivity ◽  
Drop Attack ◽  
Digital Signature Algorithm ◽  
And Performance ◽  
Hoc Networks ◽  
The Many ◽  
Packet Drop

Performance and security are two critical functions of wireless ad-hoc networks (WANETs). Network security ensures the integrity, availability, and performance of WANETs. It helps to prevent critical service interruptions and increases economic productivity by keeping networks functioning properly. Since there is no centralized network management in WANETs, these networks are susceptible to packet drop attacks. In selective drop attack, the neighbouring nodes are not loyal in forwarding the messages to the next node. It is critical to identify the illegitimate node, which overloads the host node and isolating them from the network is also a complicated task. Resistive to selective drop attack (RSDA) scheme is proposed to provide effective security against selective drop attack. A lightweight RSDA protocol is proposed for detecting malicious nodes in the network under a particular drop attack. The RSDA protocol can be integrated with the many existing routing protocols for WANETs such as AODV and DSR. It accomplishes reliability in routing by disabling the link with the highest weight and authenticate the nodes using the elliptic curve digital signature algorithm. In the proposed methodology, the packet drop rate, throughput and end to end delay are analysed.

scholarly journals Low-Computational Extended Orthogonal Matched Filter Structure for Multiuser Detection

Telecom ◽  
2020 ◽  
Vol 1 (1) ◽  
pp. 32-47
Author(s):  
Kento Takabayashi ◽  
Shuhei Harada ◽  
Takumi Kobayashi ◽  
Katsumi Sakakibara ◽  
Ryuji Kohno
Keyword(s):  
Computational Complexity ◽  
Multiuser Detection ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Matched Filter ◽  
Wireless Ad Hoc Network ◽  
Bit Error Ratio ◽  
Hoc Networks ◽  
Code Division Multiple

This research provides a novel extended orthogonal matched filter (EOMF) structure that supports multiuser detection. In addition, this structure is designed to suppress increases in computational complexity and circuit scale. In coming years, the number of Internet of Things (IoT) applications that use wireless ad hoc networks is expected to increase. To realize a highly reliable wireless ad hoc network, it is essential to introduce a method for cancelling the interference from other users. This research adopts a method based on code division multiple access (CDMA). However, a CDMA-based method has difficulty with deteriorating performance due to the near-far problem and the increase in the amount of interference as the number of users increases. Another problem is that the spreading sequence of each user is unknown in a wireless ad hoc network. The EOMF effectively removes interference while solving the above problems by combining an OMF and an adaptive array antenna. In this research, an EOMF structure with multiuser detection and lower computational complexity than the conventional EOMF is proposed. By the derived formulas and numerical examples, the proposed structure reduces the computational complexity by approximately 75% compared to the conventional EOMF and obtains sufficient bit error ratio (BER) performance.

The Research of Ad Hoc Network Routing Protocols

2014 ◽  
Vol 926-930 ◽  
pp. 2626-2629
Author(s):  
Qi Sun
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Routing ◽  
Network Size ◽  
Node Number ◽  
Topology Changes ◽  
Dynamic Source ◽  
Hoc Networks

Wireless Ad Hoc network routing algorithm is one of the core technologies of wireless Ad Hoc networks. Ad Hoc network is dynamic topology on characteristic, mainly reflected on the network node number and node movement, which lead to network topology changes, in order to study the Ad Hoc network size and topology changes influence on packet delivery, time delay and routing control, through experiment it is concluded that, the dynamic source routing protocol is an ideal choice.

ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS

2010 ◽  
Vol 02 (01) ◽  
pp. 107-124 ◽  
Author(s):  
CHIH-WEI YI ◽  
PENG-JUN WAN ◽  
CHAO-MIN SU ◽  
KUO-WEI LIN ◽  
SCOTT C.-H. HUANG
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Unit Area ◽  
Wireless Ad Hoc Network ◽  
Key Predistribution ◽  
Key Predistribution Schemes ◽  
Hoc Networks ◽  
Maximum Transmission

In this paper, we study the connectivity of wireless ad hoc networks that are composed of unreliable nodes and links by investigating the distribution of the number of isolated nodes. We assume that a wireless ad hoc network consists of n nodes distributed independently and uniformly in a unit-area disk or square. All nodes have the same maximum transmission radius rn, and two nodes have a link if their distance is at most rn. Nodes are active independently with probability 0 < p1 ≤ 1, and links are up independently with probability 0 < p2 ≤ 1. Nodes are said isolated if they do not have any links to active nodes. We show that if [Formula: see text] for some constant ξ, then the total number of isolated nodes (or isolated active nodes, respectively) is asymptotically Poisson with mean e-ξ (or p1e-ξ, respectively). In addition, in the secure wireless networks that adopt m-composite key predistribution schemes, a node is said isolated if it does not have a secure link. Let p denote the probability of the event that two neighbor nodes have a secure link. If all nodes have the same maximum transmission radius [Formula: see text], the total number of isolated nodes is asymptotically Poisson with mean e-ξ.

scholarly journals Effective Analysis of Different Parameters in Ad hoc Network for Different Protocols

2012 ◽  
pp. 234-237
Author(s):  
Kumar Manoj ◽  
S. C. Sharma ◽  
Chandra s
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Routing ◽  
Ad Hoc Routing ◽  
On Demand ◽  
Dynamic Source ◽  
Hoc Networks

A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralized administration, in which all nodes potentially contribute to the routing process. A user can move anytime in an ad hoc scenario and, as a result, such a network needs to have routing protocols which can adopt dynamically changing topology. To accomplish this, a number of ad hoc routing protocols have been proposed and implemented, which include Dynamic Source Routing (DSR), ad hoc on-demand distance vector (AODV) routing, and temporally ordered routing algorithm (TORA). In this paper, we analyze the performance differentials to compare the above-mentioned commonly used ad hoc network routing protocols. We report the simulation results of four different scenarios for wireless ad hoc networks having thirty nodes. The performances of proposed networks are evaluated in terms of number of hops per route, re transmission attempts, traffic sent, traffic received and throughput with the help of OPNET simulator. Channel speed 11Mbps and simulation time 20 minutes were taken. For this above simulation environment, TORA shows better performance over the two on-demand protocols, that is, DSR and AODV

Study of Ad hoc Networks with Reference to MANET, VANET, FANET

2017 ◽  
Vol 7 (7) ◽  
pp. 390 ◽  
Author(s):  
Bodhy Krishna .S
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Network ◽  
Wireless Ad Hoc Network ◽  
Mobile Ad Hoc ◽  
Autonomous Nodes ◽  
Hoc Networks ◽  
Network Administration

A wireless ad hoc network is a decentralized type of wireless network. It is a type of temporary computer-to-computer connection. It is a spontaneous network which includes mobile ad-hoc networks (MANET), vehicular ad-hoc networks (VANET) and Flying ad-hoc networks (FANET). A MANET is a network that has many free or autonomous nodes often composed of mobile devices that can operate without strict top-down network administration [1]. A VANET is a sub form of MANET. It is a technology that uses vehicles as nodes in a network to create a mobile network. FANET is an ad-hoc network of flying nodes. They can fly independently or can be operated distantly. This paper discusses the characteristics of these three ad-hoc networks.

scholarly journals Enhancing Reactive Ad Hoc Routing Protocols with Trust

2022 ◽  
Vol 14 (1) ◽  
pp. 28
Author(s):  
Yelena Trofimova ◽  
Pavel Tvrdík
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Ad Hoc Routing ◽  
Trust Mechanism ◽  
Packet Delivery ◽  
Hoc Networks

In wireless ad hoc networks, security and communication challenges are frequently addressed by deploying a trust mechanism. A number of approaches for evaluating trust of ad hoc network nodes have been proposed, including the one that uses neural networks. We proposed to use packet delivery ratios as input to the neural network. In this article, we present a new method, called TARA (Trust-Aware Reactive Ad Hoc routing), to incorporate node trusts into reactive ad hoc routing protocols. The novelty of the TARA method is that it does not require changes to the routing protocol itself. Instead, it influences the routing choice from outside by delaying the route request messages of untrusted nodes. The performance of the method was evaluated on the use case of sensor nodes sending data to a sink node. The experiments showed that the method improves the packet delivery ratio in the network by about 70%. Performance analysis of the TARA method provided recommendations for its application in a particular ad hoc network.

Sign in / Sign up

Export Citation Format

Share Document