scispace - formally typeset
Proceedings ArticleDOI

An enhanced AODV for mobile ad hoc network

Hong-Peng Wang, +1 more
- Vol. 2, pp 1135-1140
Reads0
Chats0
TLDR
An enhanced AODV protocol is presented, a scheme to make mobile nodes more aware of the local connectivity to its neighbors in the network, and the new scheme extends the original HELLO message in A ODV but with lower overhead.
Abstract
The need for an efficient routing protocol in mobile ad hoc network is widely proclaimed. This paper presents an enhanced AODV protocol, a scheme to make mobile nodes more aware of the local connectivity to its neighbors in the network. The new scheme extends the original HELLO message in AODV but with lower overhead. At the same time it can prevent the potential unidirectional links in the network to some extent. The simulation results show that the new proposed scheme can reduce the route load and has a better performance than AODV in the network with potential unidirectional links.

read more

Citations
More filters
Proceedings ArticleDOI

N-Drop: congestion control strategy under epidemic routing in DTN

TL;DR: Using simulations based on a random waypoint model, the simulation results proved the improvement of the congestion control strategy, called N-Drop, introduced in delay-Tolerant Networks.
Proceedings ArticleDOI

A Novel Congestion Control Strategy in Delay Tolerant Networks

TL;DR: A novel congestion control strategy called average forwarding number based on epidemic routing(AFNER) has been proposed based on Epidemic routing protocols and the results show the improvement of AFNER congestion control strategies.
Proceedings ArticleDOI

Method for Saving Energy in Zigbee Network

TL;DR: An energy-aware routing mechanism EA-AODV is presented to maximize the use of the limited energy and prolong the lifetime of ZigBee network and the simulation results show that the method is feasible for saving energy and could improve the performance of Zigbee network.
Proceedings ArticleDOI

Enhanced Local Repair AODV (ELRAODV)

TL;DR: Enhanced Local Repair AODV (ELRAODV) makes mobile nodes more aware of the local connectivity by extending original HELLO to NHELLO message in A ODV as proposed in [3] to repair a route by sending a unicast request instead to broadcast in original AODVs.
Proceedings ArticleDOI

Performance of AODV routing protocol in Mobile Ad Hoc Network

TL;DR: This paper focuses on Ad Hoc On Demand Distance Vector (AODV) routing protocol and simulation experiments have been carried out using OMNeT++ network simulator to study the routing protocol performance in the heterogeneous MANET architecture.
References
More filters

Ad hoc On-Demand Distance Vector (AODV) Routing

TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Proceedings ArticleDOI

Ad-hoc on-demand distance vector routing

TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.

Dynamic Source Routing in Ad Hoc Wireless Networks.

TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.