Good Neighbour Node Detection Technique in Manets Using QOS GNDA
MOBILE Ad hoc Networks (MANETs) are wireless networks which are characterized by dynamic topologies and have no fixed infrastructure. Each node in a MANET is a computer that may be required to act as both a host and a router and may be required to forward packets between nodes which cannot directly communicate with one another. Generally in ad hoc networks each and every node acts as a router and forwards packets to the destination. Due to mobility of nodes there is possibility of some nodes being bad neighbors. When a neighbor node turns out to be a bad neighbor, it could lead to loss of data packets, degradation in performance of node mobility, degradation of performance of routing protocol, difficulty in maintaining routes and degraded performance of the network. These potentially cause delay in transmitting the data and may result in congestion in the network. Good Neighborhood Node Detection Algorithms (GNDA) helps us find the best route for the destination. However, they are not able to minimize delay in case of route failure. The dynamically changing nature of nodes makes it difficult to maintain a consistent route. Nodes in the network dynamically set up paths among themselves to transmit packets temporarily. In Adhoc networks, nodes typically cooperate with each other, by forwarding packets for nodes which are not in the communication range of the source node. Nodes may be affected by dynamically changing topology, limited bandwidth, hidden terminals, transmission errors and battery constraints. As such detection of a good neighbor node is a necessity. In order to achieve this in this paper a new routing protocol called Quality of Service Good Neighborhood Node Detection Algorithms (QOS-GNDA) is proposed. This protocol finds a good neighbor node using parameters like Transmission range, Power of node, Signal strength, Capacity of node for packet forwarding and Relative position of node.
MANETs, Adhoc routing, AODV, Signal strength, Flow capacity, Relative position.
 Perkins Charles E., and Elizabeth M. Royer. "Ad-hoc ondemandDistance Vector Routing." Second IEEE Workshop on Mobile Computing Systems and Applications,Pp. 90-100. IEEE1999.
 Singh Umang, B. V. R. Reddy, and M. N. Hoda . "GNDA: Detecting Good Neighbor Nodes in Adhoc Routing Protocol." Second International Conference on Emerging Applications of Information Technology (EAIT), Pp. 235-238. IEEE 2011.
 T. Rajamohan Reddy, N. Sobharani. "Selective On-demand Protocol for Finding Reliable Nodes to form Stable Paths in ADHOC Networks."International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Pp-21-24, vol-1, no. 5, 2012
 Khatibi Sina, and Ruhollah Rohani. "Quorum-based Neighbor Discovery in Self-organized Cognitive MANET." 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), Pp. 2239-2243. IEEE 2010.
 Biradar Rajashekhar and Sunilkumar Manvi. "Channel Condition and Mobility Based Choice of Neighbor Node for Routing in MANET." International Conference on Advances in Computer Engineering (ACE), Pp. 74-78, IEEE, 2010.
 Wang Gang, Shining Wu, Guodong Wang, Beixing Deng, and Xing Li. "Experimental Study on Neighbor Selection Policy for Phoenix Network Coordinate System." International Conference on ultra modern telecommunication, pp. 1-5. IEEE, 2009.
 Huang Yangcheng, Saleem Bhatti, and Soren-Aksel Sorensen. "Adaptive Neighbor Detection for Mobile Ad Hoc Networks." UCL department of Computer science,RN7:17.
 Sanchez Juan A., Pedro M. Ruiz, and Ivan Stojmenovic. "GMR: Geographic Multicast Routing for Wireless Sensor Networks." 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, vol. 1, Pp. 20-29. IEEE 2006.
 Moussa A. C., F. M. Kamel, D. Noureddine, and K. Maamar. "Integration of Dynamic Current Bandwidth Capacity Calculation for Existing AODV." International Conference on Information Technology and e-Services (ICITeS), Pp. 1-7, IEEE 2012.