Using dominating sets with 2-Hop neighborhood information to improve the ad-hoc on-demand distance vector routing

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mobile Ad-Hoc network is a wireless network whose nodes in the network must coordinate among them to determine connectivity and routing. Many improvements were done to Ad-Hoc on-demand distance vector routing by using dominating sets to decrease the network load and flooding. But further with the increase of nodes at higher terrain dimensions the performance of Ad-Hoc on-demand distance vector routing decreases. To overcome this problem, we apply dominating sets with two-hop neighborhood information to Ad-Hoc on-demand distance vector routing protocol using GloMoSim-2.03 simulator, where route to the destination can be identified using the two-hop information at the dominating nodes where the packet to destination is present. Our results show the performance of dominating sets with two-hop neighborhood information which have improved the broadcast latency, packet delivery, and load on network. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bathini, E., & Lee, R. (2011). Using dominating sets with 2-Hop neighborhood information to improve the ad-hoc on-demand distance vector routing. In Studies in Computational Intelligence (Vol. 365, pp. 1–9). https://doi.org/10.1007/978-3-642-21375-5_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free