|
|
 |
| |
|
|
|
A New Adaptive Broadcast Scheduling Algorithm in MANETs Using Good Neighbor Node Detection Approach |
|
|
|
PP: 157-164 |
|
|
|
doi:10.18576/amis/13S116
|
|
|
|
Author(s) |
|
|
|
C. Aparna,
C. Nelson Kennedy Babu,
|
|
|
|
Abstract |
|
|
| MANET is a collection of wireless mobile sensor networks that randomly discover nodes in distributed manner. The unique properties of MANET are self-configuring and fast deployment and without central controller network which makes them them suitable for communication. Energy efficiency is the most important issue in adhoc networks due to power constraints. In MANET, node may be infrastructure or infrastructure less network, so each device can move independently and act as a host as well as router, while most of the wireless network design is concentrated only on routing protocol and its security issues. In general, MANET discussed the major impacts of bad neighbor nodes and observed routing problem, affecting performance of adhoc routing. Our proposed work, describes vulnerability of both internal and external attacks using two on-demand adaptive broadcast scheduling strategies using GNDA, identifying good neighbor nodes, in addition to adding extra parameters i.e signal strength, flow capacity and relative position of the node. In this proposed work we optimize the routing issues of AODV,GNDA,DSDV,DSR compared with their pause time, different number of connecting nodes and its available path. ns-2 simulator used in this proposed work shows that GNDA is better than other routing protocol.
|
|
|
|
|
|
|
|
