Abstract
To support truly peer-to-peer applications in ad hoc wireless networks, a judicious and efficient ad hoc routing protocol is needed. Much research has been done on designing ad hoc routing protocols and some well known protocols are also being implemented in practical situations. However, one major drawback in existing state-of-the-art protocols, such as the AODV (ad hoc on demand distance vector) routing protocol, is that the time-varying nature of the wireless channels among the mobile terminals is ignored, let alone exploited. In this paper, by using a previously proposed adaptive channel coding and modulation scheme which allows a mobile terminal to dynamically adjust the data throughput via changing the amount of error protection incorporated, we devise a new ad hoc routing algorithm that dynamically changes the routes according to the channel conditions. Extensive simulation results indicate that our proposed protocol is more efficient in that shorter delays and higher rates are achieved.
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 callDisclaimer: 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.
