A Two-way Route Repair Scheme Based on Hop-count

DOI

10.2991/meic-15.2015.167How to use a DOI?

Keywords

mobile Ad-hoc networks; hops differences; two-way; route repair; routing maintenance

Abstract

Considering the limitations of one-way route repair in Mobile Ad Hoc Networks, this paper proposes a novel two-way route repair scheme based on hop-count. This scheme takes the hop differences between the backward and forward node near the broken link as judging rules which decide the direction to repair and thereby shortens the distances of routing maintenance effectively. The simulation results show that the scheme has a better performance in end-to-end packet delay and control overhead than the previous schemes.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xuewen Wu
AU  - Xiaokai Zhu
AU  - Fei Kong
PY  - 2015/04
DA  - 2015/04
TI  - A Two-way Route Repair Scheme Based on Hop-count
BT  - Proceedings of the 2015 International Conference on Mechatronics, Electronic, Industrial and Control Engineering
PB  - Atlantis Press
SP  - 733
EP  - 736
SN  - 2352-5401
UR  - https://doi.org/10.2991/meic-15.2015.167
DO  - 10.2991/meic-15.2015.167
ID  - Wu2015/04
ER  -