DDoS Attacks for Ad Hoc Network Based on Attack Cluster

2012 ◽  
Vol 546-547 ◽  
pp. 1371-1376
Author(s):  
Yao Yan ◽  
Rui Xu
Keyword(s):  
Aggressive Behavior ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Ddos Attacks ◽  
Node Density ◽  
Network Attack ◽  
Dynamic Topology ◽  
Communication Ability ◽  
Hoc Networks ◽  
Definition Of

Show the definition of Ad Hoc network attack cluster, and propose a new method of DDoS attacks for Ad Hoc Networks, which can accurately attack the target node, demonstrate no redundant aggressive behavior compared with the traditional attack and reduce the detection rate of aggressive behavior. Use NS2 simulation platform to build Ad Hoc network simulation scenarios with dynamic topology, and simulate DDoS attacks in this environment; The simulation results show that the new DDoS attack method can effectively reduce the communication ability of the Ad Hoc network, and increasing the attack node density will strengthen the attack effect.

On the Impact of Network Dynamics on a Discovery Protocol for Ad-Hoc Networks

2010 ◽  
pp. 1595-1613
Author(s):  
Fei Liu ◽  
Geert Heijenk
Keyword(s):  
Ad Hoc Networks ◽  
Linear Relation ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Network Dynamics ◽  
Bloom Filters ◽  
Context Information ◽  
Node Density ◽  
Hoc Networks ◽  
The Impact

A very promising approach to discovering services and context information in ad-hoc networks is based on the use of Attenuated Bloom filters. In this paper we analyze the impact of changes in the connectivity of an ad-hoc network on this approach. We evaluate the performance of the discovery protocol while nodes appear, disappear, and move, through analytical and simulative analysis. The analytical results are shown to be accurate when node density is high. We show that an almost linear relation exists between the density of the network and the number of update messages to be exchanged. Further, in case of nodes moving, the number of messages exchanged does not increase with the speed of movement.

Mitigate DoS and DDoS Attack in Mobile Ad Hoc Networks

2011 ◽  
Vol 3 (1) ◽  
pp. 14-36 ◽  
Author(s):  
Antonis Michalas ◽  
Nikos Komninos ◽  
Neeli R. Prasad
Keyword(s):  
Game Theory ◽  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Denial Of Service ◽  
Ddos Attacks ◽  
Dos Attacks ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Cryptographic Puzzles

This paper proposes a technique to defeat Denial of Service (DoS) and Distributed Denial of Service (DDoS) attacks in Ad Hoc Networks. The technique is divided into two main parts and with game theory and cryptographic puzzles. Introduced first is a new client puzzle to prevent DoS attacks in such networks. The second part presents a multiplayer game that takes place between the nodes of an ad hoc network and based on fundamental principles of game theory. By combining computational problems with puzzles, improvement occurs in the efficiency and latency of the communicating nodes and resistance in DoS and DDoS attacks. Experimental results show the effectiveness of the approach for devices with limited resources and for environments like ad hoc networks where nodes must exchange information quickly.

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.

Node Density Based Routing in Ad Hoc Networks

2005 ◽  
Vol 12C (4) ◽  
pp. 535-542
Author(s):  
Sang-Kyung Kim ◽  
Seung-Sik Choi
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Node Density ◽  
Hoc Networks

An Improved Ad Hoc Network Communication Based on Cluster

2013 ◽  
Vol 660 ◽  
pp. 184-189 ◽  
Author(s):  
Yan Zhai ◽  
Xing Wei ◽  
Lei Liu ◽  
Liao Yuan Wu
Keyword(s):  
Ad Hoc Network ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Cluster Head ◽  
Directional Antennas ◽  
Directional Antenna ◽  
Gateway Node ◽  
Adaptive Clustering ◽  
Communication Method ◽  
Hoc Networks

In order to tackle the data transmission bottlenecks of the gateway node in clustering Ad hoc Networks, the paper proposes a communication method. Firstly, DMAC (Distributed and Mobility-Adaptive Clustering) algorithm and Omni-directional antenna is well introduced and discussed. Then the ICMMDA (The Inter-cluster Communication Method based on Directional Antennas) policy building virtual channels between two hops away cluster-head and using directional antenna is brought about. Lastly, the simulation shows that the method can reduce the end-to-end delay between two clusters and improve the network throughput.

scholarly journals METRICS FOR PERFORMANCE EVALUATION OF SAFETY APPLICATIONS IN VEHICULAR AD HOC NETWORKS

Transport ◽  
2008 ◽  
Vol 23 (4) ◽  
pp. 291-298 ◽  
Author(s):  
Saleh Yousefi ◽  
Mahmood Fathy
Keyword(s):  
Performance Evaluation ◽  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Road Traffic ◽  
Real Life ◽  
Message Exchange ◽  
To Come ◽  
Hoc Networks ◽  
Safety Applications

In the recent years, direct message exchange between vehicles in order to improve the safety of road traffic has been attracting lots of interest in both networking and road safety communities. While travelling on a road, vehicles form an ad hoc network called Vehicular Ad hoc NETwork (VANET) and deploy life safety applications. Evaluating the performance of these applications is primordial for realizing VANETs in real life. Current literature lacks efficient ways to evaluate the performance of safety applications and mostly leverages on classical networking metrics like delay, delivery rate etc. In this paper, we consider both networking and safety concerns simultaneously to come up with more efficient methods. In particular, we first point out the significance of fairness and coverage from safety viewpoint. Then, we introduce two new metrics called beaconing rate and effective range aiming at providing more facilities for safety performance evaluation in VANET s research. Furthermore, realizing special characteristics of safety applications while disseminating beacon messages, we study the way that beacon dissemination protocols affect the performance of safety applications. We then conduct extensive simulation study to show the usefulness of the introduced metrics and derive some insights on the feasibility of driver‐assistant safety applications. Our evaluation also shows that sending the aggregated status of neighbouring vehicles in addition to vehicle's own status, and instead, increasing beacon transmission interval may be invoked in order to assist safety applications in providing satisfactory services to drivers.

scholarly journals A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lei You ◽  
Jianbo Li ◽  
Changjiang Wei ◽  
Chenqu Dai ◽  
Jixing Xu ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Network Partitioning ◽  
Heuristic Function ◽  
Hop Count ◽  
Dynamic Topology ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Tolerant

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

A Route Selection Mechanism for Mobility of Node in Mobile Ad Hoc Network

2012 ◽  
Vol 224 ◽  
pp. 520-523
Author(s):  
Hyun Jong Cha ◽  
Jin Mook Kim ◽  
Hwang Bin Ryou
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Base Stations ◽  
Movement Direction ◽  
Wired Networks ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A mobile ad-hoc network is a method of communication between different nodes (mobile devices) without the use of base stations, which are used in wired networks. In a Mobile ad-hoc network, nodes can play the role of a receiver, sender, or a relay. As movement is flexible in Mobile ad-hoc networks and nodes have limited resources, nodes may join the communication or exit it at any time. Therefore, for Mobile ad-hoc networks, routing techniques - selecting communication routes and maintaining them – is considered important in an environment of constantly changing network topology. To overcome this problem, this paper proposes a reliable routing protocol based on MP-AOMDV, which monitors changes in signal strength not only for GPS signals but reception signals as well. Although MP-AOMDV was researched under the assumption of fixed movement direction and speed, this paper proposes a routing technique that works with changing movement direction or speed of nodes.

Sign in / Sign up

Export Citation Format

Share Document