Minimum Exposed Path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET)

Khurana, S.; Gupta, Nidhi; Aneja, Nagender

doi:10.1109/icn.2007.57

Cited by 7 publications

(9 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [41], a node determines a sequence of virtual positions to avoid certain area and the routing algorithm forwards packets along a path that is closest to the virtual path. In [19], Khurana et al addressed a similar problem to route around misbehaving nodes in ad hoc networks to minimize the impact of attacks.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Blocking Option in Routing Protocols

Gouda

2009

2009 28th IEEE International Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

Routing protocols are designed under the assumption that each node in a network should be able to reach (i. e. send or forward packets to) every other node in the network. Unfortunately, adopting this assumption in a routing protocol does allow adversary nodes to launch spam or DoS attacks against the other nodes in the network. In this paper, we introduce the "blocking option" in routing protocols; this option allows a node u to block a specified set of nodes {v,..,w} and prevent each of them from reaching node u. It turns out that if node u blocks a large number of nodes, then u may end up blocking other nodes as well. We refer to these unintentionally blocked nodes as blind to u nodes. Clearly, a node u cannot communicate with its blind nodes in a regular manner. Thus, we extend the routing protocol to allow each node u to communicate with its blind nodes via some special node, called the joint node. To perform its intended function, the joint node needs to be neither blocked by any node nor blind to any node in the network. We give an algorithm for identifying the node that is best suited to be the joint node in a network. Finally, we show, through extensive simulation, that the average number of blind nodes is close to zero when the average number of blocked nodes is small (< 20) and that the probability of a joint node being blind is quite small, on the order of 10 −3 . The path length of using a joint node for communication between a node u and any one of its blind nodes v is around 1.5 the shortest path between u and v.

show abstract

Section: Related Workmentioning

confidence: 99%

“…There have been many studies of non-shortest path routing to achieve various goals such as security [6], [9], [19], [21], [40]- [42], reliability [7], [10], [11], [16], [27], [33], [37] and load balancing [8], [12].…”

Section: Related Workmentioning

confidence: 99%

The Blocking Option in Routing Protocols

Gouda

2009

2009 28th IEEE International Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

show abstract

“…For packet forwarding in the network the nodes will depend on each other because of their limited number in the transmission range. As a result, embedding solutions in routing protocols to handle attacks poses a challenge to the researchers [1]. Basically the routing threats due to attacks in MANETS are mainly because of malicious nodes [2] and selfish nodes [3].…”

Section: Introductionmentioning

confidence: 99%

“…Most of these protocols [4, 5, 6, 7, 8, 9, 10, 11 and1] are based on existing ad hoc routing protocols like AODV [12], DSDV [13] and DSR [14], redesigned to handle attacks. The second approach [15,16,17] separates the detection of malicious nodes from routing [1].…”

Section: Introductionmentioning

confidence: 99%

TODV: Performance Analysis of a Time on Demand Distance Vector Protocol for MANETS

Mamatha¹,

Sharma²

2011

IJCA

View full text Add to dashboard Cite

In MANET (Mobile Adhoc Network) the physical connectivity of the network keeps on changing dynamically. Because of the several MANET constraints such as limited bandwidth, mobility, battery power etc; it becomes very important to design a protocol that suits the requirements for MANETS. In this paper, we suggest a protocol mechanism which is loosely based on a reactive protocol AODV (Ad Hoc On demand Distance Vector Protocol). The proposed protocol uses the time concept based on first come first served basis for path choosing process, hence the name Time On Demand Distance Vector Protocol (TODV). The protocol design presented here suits the MANETS dynamic topology perfectly in finding the best path or route for data communication. The simulation study reveals that the proposed protocol outperforms than existing AODV, in terms of throughput and end-to-end delay.

show abstract

“…The authors also do not discuss how to use their system in the current Internet. Khuruna et al [16] use a similar technique in ad hoc networking to find paths that are farthest from the adversarial nodes. This technique suffers similar limitations to Zlatokrilov's, while also incurring a slow convergence time.…”

Section: Alternative Approaches and Re-lated Workmentioning

confidence: 99%

Securing data through avoidance routing

Kline¹,

Reiher²

2009

Proceedings of the 2009 Workshop on New Security Paradigms Workshop

View full text Add to dashboard Cite

As threats on the Internet become increasingly sophisticated, we now recognize the value in controlling the routing of data in a manner that ensures security. However, few technical means for achieving this goal exist. In this paper we propose and design a system that allows users to specify regions of the Internet they wish their data to avoid. Using our system, data will either arrive at the destination along a path that avoids the specified regions, or no avoiding path exists. Beyond the design, we discuss the deployment, performance and security issues of this system, along with alternative approaches that could be used.

show abstract

Minimum Exposed Path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET)

Cited by 7 publications

References 20 publications

The Blocking Option in Routing Protocols

The Blocking Option in Routing Protocols

TODV: Performance Analysis of a Time on Demand Distance Vector Protocol for MANETS

Securing data through avoidance routing

Contact Info

Product

Resources

About