Towards optimising routing overhead in wireless multi–hop networks. (2015)

• Record Type: Journal Article
• Authors: Javaid, N.; Bibi, A.; Mohammad, S.N.; Khan, Z.A.; Alrajeh, N.
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 19:Number 1/2(2015)
• Page Start: 4
• Page End: 18
• Publication Date: 2015
• Subjects: optimisation -- routing overhead -- wireless multi–hop networks -- wireless networks -- AODV -- ad–hoc on–demand distance vector -- DSR -- dynamic source routing -- DYMO -- dynamic MANET on–demand -- mobile ah hoc networks -- MANETs -- energy consumption -- time consumption -- expanding ring search -- ERS -- route discovery -- route maintenance -- modelling -- waiting time -- bandwidth reduction -- link breakage -- repair strategies -- local link repair -- LLR -- packet salvaging; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

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).