Abstract
Abstract
Routing in ad hoc networks is challenging as nodes are mobile and links are continuously created and broken. Current on-demand ad hoc routing algorithms start route discovery after path break, incurring high cost to detect the disconnection and to establish a new route. Specifically, when a path is liable to break, the source is warned about the likelihood of disconnection. The source then starts path discovery avoiding disconnection entirely. A path is likely to break when link availability decreases. Since routing is nondeterministic polynomial (NP) hard, this work proposes an improved ad hoc on-demand multipath distance vector (AOMDV) based on link availability, neighboring node’s queuing delay, node mobility, and bit error rate. The optimal path is selected using BAT meta-heuristic optimization. Simulation shows improved performance compared to AOMDV.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Signal Processing
Reference55 articles.
1. KS Chung, JE Lee, Design and Development of m-Learning Service Based on 3G Cellular Phones. JIPS 8(3), 521 (2012)
2. H Luo, ML Shyu, Quality of service provision in mobile multimedia-a survey. Human-centric Computing and Information Sciences 1(1), 1–15 (2011)
3. JKY Ng, Ubiquitous healthcare: healthcare systems and applications enabled by mobile and wireless technologies. Journal of Convergence 3(2), 31–36 (2012)
4. Gawande, A. (2013). Performance analysis of DSR protocol under sinkhole attack in MANETs. International Journal, 1(4).
5. R Sumathi, MG Srinivas, A survey of QoS based routing protocols for wireless sensor networks. J Inf Process Syst 8(4), 589–602 (2012)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献