Results 261 to 270 of about 3,065 (300)

Hybrid on Demand Multipath Distance Vector Routing Protocol

2015 International Conference on Developments of E-Systems Engineering (DeSE), 2015
In this paper we propose an extension to well known multipath reactive routing protocol Ad hoc On Demand Multipath Distance Vector (AOMDV). The resulting protocol is called as Hybrid on Demand Multipath Distance Vector (HOMDV). The proposed scheme improves AOMDV by using hello packets to learn neighbors up to two hops in addition to maintaining local ...
K. B. Senthil Kumar, R. Tarun, A. K. Sowparnika, P. M. Sasi   +3 more
openaire   +1 more source

Multiple-route ad hoc on-demand distance vector (MRAODV) routing protocol

18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004
Summary form only given. Several routing protocols, e.g. DSR(dynamic source routing protocol) and AODV(ad-hoc ondemand distance vector routing protocol), have been proposed for routing data packets in ad hoc networks. These are ondemand routing protocols. Only when a node requires to transmit data packets, it searches a route to a destination node.
H. Higaki, S. Umeshima
openaire   +1 more source

Distance-vector routing protocols for networks with unidirectional link

Proceedings International Conference on Parallel Processing Workshops, 2002
We first introduce a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting "from" information, and the other one for generating and propagating ...
G. Chen, F.C.M. Lau, null Peng Du, null Li Xie   +3 more
openaire   +1 more source

Formal verification of standards for distance vector routing protocols

Journal of the ACM, 2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp real-time bound on RIP stability, and preservation of loop-freedom in AODV, a distance vector protocol for wireless networks.
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gunter   +2 more
openaire   +1 more source

Reliable Ad-hoc On-demand Distance Vector Routing Protocol

International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006
Mobile Ad hoc Networks’ (MANETs) properties present major vulnerabilities in security. The threats considered in MANETS are due to maliciousness that intentionally disrupt the network by using variety of attacks and due to selfishness of node which do not perform certain operations due to a wish to save power.
S. Khurana, N. Gupta, N. Aneja
openaire   +1 more source

Dynamic Reverse Route in Ad Hoc on Demand Distance Vector Routing Protocol

2010 6th International Conference on Wireless and Mobile Communications, 2010
A Mobile Ad hoc Network (MANET) is a heterogeneous network; a collection of mobile wireless devices with different characteristics communicating in a random network topology. Much research over-simplifies by assuming that all nodes are homogeneous, i.e., possess identical transmission power, reception quality and signal to noise ratio, which is not ...
Megat F. Zuhairi, David A. Harle
openaire   +1 more source

A fast convergence mechanism for distance-vector routing protocol

2009 ISECS International Colloquium on Computing, Communication, Control, and Management, 2009
In order to solve the problem of routing protocols using the Distributed Bellman-Ford (DBF) algorithm converge very slowly to the correct routes when link costs increase, and in the case when a set of link failures results in a network partition, we present a new fast converge distance vector routing algorithm CF-DVRP that uses suppression-failure ...
Bin Wang, Yun-fei Guo, Jia Zhou, Li-an Guan   +3 more
openaire   +1 more source

TLDV: Tree-Like Locator Distance Vector routing protocol for MANETs

2010 International Conference on Educational and Information Technology, 2010
Most routing protocols in MANETs don't scale well in networks with large numbers of nodes where the scalability of the routing protocols plays a vital role. And it is well known that these routing protocols usually use node locator (e.g. IP address) as pure identifier.
null Haiquan Wang, null Le Mi, null Chunhe Xia, null Liangshuang Lv, null Meng Chen   +4 more
openaire   +1 more source

Authenticated Routing for Ad-Hoc On-Demand Distance Vector Routing Protocol

2011
Mobile ad hoc network (MANET) is a collection of mobile hosts without any existing infrastructure or centralized access point such as a base station. MANET is an emerging research area because of their self configuration and self maintenance capabilities.
Preeti Sachan, Pabitra Mohan Khilar
openaire   +1 more source

An efficient Ad Hoc On-Demand Distance Vector routing protocol

2010 International Conference on Educational and Network Technology, 2010
In this paper, we propose a method to improve fault tolerance and load balancing in Ad hoc On-Demand Distance Vector (AODV) routing protocol. This is desirable because in ad hoc settings, mobility may cause routes to break frequently and hence alternative paths are needed. The original AODV only maintains one path for a source-destination pair.
null Feng Xian, null Jianzhi Wang
openaire   +1 more source