Security-Efficient Routing For Highly Dynamic MANETS
S. Sharon Ranjini1, G. Shine Let2
1S. Sharon Ranjini, PG Scholar, Electronics and Communication Engineering, Karunya University, Coimbatore, India.
2G. Shine Let, Assistant Professor, Electronics and Communication Engineering, Karunya University, Coimbatore, India.
Manuscript received on March 02, 2013. | Revised Manuscript received on April 13, 2013. | Manuscript published on April 30, 2013. | PP: 747-753 | Volume-2, Issue-4, April 2013. | Retrieval Number: D1598042413/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The Goal of Position-based Opportunistic Routing (POR) is to solve the problem of delivering data packets for highly dynamic mobile adhoc networks in a timely manner. The protocol (POR) takes the property of Geographic routing. Here, the data packets are sent out from the source node and some of the neighbor nodes will be the forwarding candidates, if the best forwarder did not forward the packet in a particular period of time; the forwarding candidates will forward the packets. By using Virtual Destination-based Void Handling (VDVH) Scheme, the communication hole is avoided. In the existing system, the geographic routing property is used, the problem of delivering data packets for highly Dynamic mobile adhoc networks is solved. But there is a limitation that the nodes that is selected as the best forwarder is not checked whether it is secured or not. To overcome this problem a Security-efficient routing is proposed in which the nodes which have the higher trust value is considered as the best forwarder. The Selfish and normal nodes is differentiated by using the RREQ algorithm. The Selfish nodes do not forward the request. It will check the trust value, whether it is friend or stranger or acquaintances. In this approach, From the RREQ algorithm, Xrf, Xra, Xrs are the threshold values set for friends, acquaintances and strangers, as per the requirements of the application software. Random waypoint model is chosen as the movement.
Keywords: Mobile Adhoc Networks, RREQ algorithm, Random waypoint model, Routing.