Detecting Good Neighbor Nodes and Finding Reliable Routing Path Based on AODV Protocol

  • Bamane S
  • Singh R
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Wireless operations allow services, such as long-range communications, that are impossible or impractical to implement with the use of wires. It is supported by well-liked technique known as Adhoc Protocol [1]. The term is commonly used in the telecommunications industry to refer to telecommunications systems e.g. radio transmitters and receivers, remote controls etc. which use some form of energy e.g. radio waves, acoustic energy, etc. to transfer information without the use of wires. [1] Information is transferred in this manner over both short and long distances.In this, routes may be detached due to lively movement of nodes. So route assortment and topology grouping is not easy and demanding issue. This type of networks is more vulnerable to both internal and external attacks due to presence of wicked neighbour nodes[1][2s. Paper see the sights new method using AODV protocol to find out good neighbour node and finding reliable path according to their signal strength, flow capacity relative position of node in network.

Cite

CITATION STYLE

APA

Bamane, S., & Singh, R. (2014). Detecting Good Neighbor Nodes and Finding Reliable Routing Path Based on AODV Protocol. IOSR Journal of Computer Engineering, 16(1), 12–19. https://doi.org/10.9790/0661-16111219

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