Towards optimising routing overhead in wireless multi-hop networks Online publication date: Tue, 19-May-2015
by N. Javaid; A. Bibi; S.N. Mohammad; Z.A. Khan; N. Alrajeh
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 19, No. 1/2, 2015
Abstract: In this paper, we select three most widely used reactive protocols; ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR) and dynamic MANET on-demand (DYMO), and model their energy and time consumption costs of expanding ring search (ERS) algorithm in wireless multi-hop networks (WMhNs). A novel contribution of this work is tuning the route discovery and route maintenance parameters of the chosen protocols to minimise routing overhead. For analytical comparison, we simulate default and enhanced versions of these protocols using NS-2. From modelling and analytical comparison, we deduce that adjusting time-to-live (TTL) values in search sets of ERS algorithm with respective waiting time is more useful for reducing bandwidth and locating time in chosen protocols. Moreover, for reliable transmission and efficient performance, reactive protocols need immediate detection of link breakage along with quick repairement strategies for re-establishment of routes such as local link repair (LLR) and packet salvaging (PS).
Online publication date: Tue, 19-May-2015
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com