Abstract

Due to mobility of nodes in ad hoc networks, the most challenging issue is to design and to make sound analysis of a routing protocol that determines its robustness to deliver packets in low routing packet overhead. In this paper, we thoroughly analyzed the Adaptive Monitor Based Routing (AMBR) protocol by varying different parameters that affect a routing protocol to measure its performance. Analysis shows that it requires less routing control overhead comparing with other prevalent routing protocols. An improved analytical model is also presented in this paper. All these analyses firmly prove that AMBR is a sound and robust protocol in terms of flooding, routing overhead and hence, enhances reliability

Highlights

  • An ad hoc network is a class of wireless systems that consists of independent mobile nodes communicating with each other over wireless links, without any static infrastructure such as base stations [1]

  • In order to analyze the performance of the proposed Adaptive Monitor Based Routing (AMBR) protocol, we run the simulation under the NS-2 testbed with a Carnegie Mellon University (CMU) wireless extension

  • From the graph it can be understood that the routing packet overhead of AODV, DSDV and AMBR increases as network size increases but increasing rate in the case of AODV and DSDV is much higher than the AMBR

Read more

Summary

INTRODUCTION

An ad hoc network is a class of wireless systems that consists of independent mobile nodes communicating with each other over wireless links, without any static infrastructure such as base stations [1]. Changing topology and lack of centralized control make the design of an adaptive distributed routing protocol challenging [1]. Due to the limited spectrum, user’s mobility and power constraints, routing remains a challenge, in wireless communication systems such as ad hoc networks. Several other challenges complicate routing, including scalability, routing efficiency, adaptation to wireless networks of various densities, and distribution [3]. AMBR discovers and maintains routes in hierarchical and distributed fashion and locally repairs the broken link.

RELATED WORK
AMBR ROUTING PROTOCOL
D MM M M
ANALYTICAL MODEL
Packet Routing Probabilities
AMBR Probabilities
Simulation Environment
Results and Analysis
CONCLUSION

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.