Opportunistic Routing in Presence of Selfish Nodes for MANET
Our Price
₹3,500.00
10000 in stock
Support
Ready to Ship
Description
Wireless networks are computer networks that are not connected by cables of any kind. The use of wireless network enables enterprises to avoid the costly process of introducing cables into buildings or as a connection between different equipment locations. Wireless networks are susceptible to many attacks. The MANET network has number of nodes with mobility features. Routing is a fundamental operation in mobile ad hoc network. The routing protocols select the appropriate path from source to destination to forward the packet. Many routing protocols are used for providing efficient data transmission in MANET. In traditional routing protocols for MANET, each node uses the best neighbor for forwarding packet to destination. Few nodes participating in the network may behave selfishly; these nodes drop packets and do not offer service to other nodes. Selfish nodes drop packets for conserving own battery and processing power, or these nodes are interested to disturb the communication. To increase the efficiency, the proposed system uses an efficient routing technique called by-passing routing for preventing from the selfish nodes. In this the selfish nodes are find out by knowing the neighbor nodes while performing transmission. After finding the selfish node, the proposed BPR protocol will find another route for transmission. The simulation results show increase in the performance of the network in terms of delay, throughput and packet delivery ratio.
Tags: 2015, Domain > Network Projects