Abstract
SummaryWireless ad hoc networks have a wide variety of applications in the present world. Creating routes between the nodes and with low energy consumption is a major challenge in wireless ad hoc networks. In this paper, we have proposed FRAME routing for ad hoc networks, which consider the entire network based on hierarchal Bayesian model. It works on game theory–based Chow‐Liu algorithm for establishing routes from source to destination considering the best neighbors in the path. FRAME routing is further analyzed with SMAC and conventional MAC in various scenarios. They are also compared with conventional MAC in AODV routing in terms of energy consumption, delay, throughput, PDR, and goodput. The entire simulations are carried out using NS2 and SMAC in FRAME routing that give better performance compared with conventional MAC in FRAME, AODV routing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
