A new adaptive broadcast scheduling Algorithm in manets using good Neighbor node detection approach

Abstract

MANET nodes are distinguished by their minimum transmission power, dispensation, mobility, and resources of memory. The wireless mobile nodes enter and leave the network dynamically due to the limited range of transmission, the path of minimum hop and minimum normalized residual energy used. Each device in a mobile adhoc network must transmit traffic and heavy traffic creates congestion that can lead to loss of the packet, reducing the energy of network and high overhead. During the packet transfer, the link interruption occurs due to the dynamic topology network, so QoS can be reduced and routing overhead also increased. Therefore, a new adaptive broadcast scheduling algorithm to increase the QoS and detecting good neighbors in a MANET is required. Internal and external attacks called malicious node, happened in the network affects the integrity, confidentiality or using a network resource without its prior permission. There are many malicious node detection methods to identify abnormal activity. The investigation shows a low accuracy of the network, packet loss, and maximum delay time to established networks. On the other hand, the process of node identification and deployment will become expensive both in terms of time and cost. Based on the above issues, the focus will be on a good neighbor node detection approach, since this is a more efficient, lightweight and easily scalable detection method in MANET newline