AIRCC PUBLISHING CORPORATION
SELF-PRUNING BASED PROBABILISTIC APPROACH TO MINIMIZE REDUNDANCY OVERHEAD FOR PERFORMANCE IMPROVEMENT IN MANET
Gyanendra Kumar Pallai1, Meenakshi Sankaran2 and Amiya Kumar Rath3
1Department of Computer Science & Engineering, SOA Deemed-to-be University, Bhubaneswar, India,
2VIT Business School, VIT Bhopal University, Bhopal, India
3Department of Computer Science & Engineering, Veer Surendra Sai University of Technology, Burla. Deputed as adviser to National Assessment & Accreditation Council, Bengaluru, India
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
Broadcasting, Flooding, Self-pruning, Neighbour Coverage, Forwarding Probability, Connectivity Metric.