TY - JOUR
T1 - Path selection algorithms for fault tolerance in wireless mesh networks
AU - Papapostolou, Apostolia
AU - Friderikos, Vasilis
AU - Yahiya, Tara A.
AU - Chaouchi, Hakima
PY - 2013/4/1
Y1 - 2013/4/1
N2 - Recently Wireless Mesh Networks (WMNs) have emerged as a key technology for providing high-bandwidth networking among peer nodes over a specific coverage area. Features such as low cost, ease of deployment, self-configuration and self-healing make them one of the most promising global telecommunication systems. Despite their advantages, however, several research challenges remain in all protocol layers. In this paper, we address the main challenging issues related to the routing aspects in a WMN. Routing in such networks is performed through multi-hop paths where intermediate nodes cooperatively make forwarding decisions based on their knowledge regarding the network topology. However, in an unideal dynamic environment due to frequent or rare node failures/misbehavior, traditional ad-hoc routing protocols suffer from high routing overhead or energy consumption. Motivated by this, we propose several path selection algorithms which adapt to such topology dynamics. The main objective of these routing schemes is to provide fault tolerance without sacrificing the energy and computational complexity efficiency. Numerical investigations, based on extensive simulations, validate the effectiveness of our proposals even when faulty nodes subsist in the environment.
AB - Recently Wireless Mesh Networks (WMNs) have emerged as a key technology for providing high-bandwidth networking among peer nodes over a specific coverage area. Features such as low cost, ease of deployment, self-configuration and self-healing make them one of the most promising global telecommunication systems. Despite their advantages, however, several research challenges remain in all protocol layers. In this paper, we address the main challenging issues related to the routing aspects in a WMN. Routing in such networks is performed through multi-hop paths where intermediate nodes cooperatively make forwarding decisions based on their knowledge regarding the network topology. However, in an unideal dynamic environment due to frequent or rare node failures/misbehavior, traditional ad-hoc routing protocols suffer from high routing overhead or energy consumption. Motivated by this, we propose several path selection algorithms which adapt to such topology dynamics. The main objective of these routing schemes is to provide fault tolerance without sacrificing the energy and computational complexity efficiency. Numerical investigations, based on extensive simulations, validate the effectiveness of our proposals even when faulty nodes subsist in the environment.
U2 - 10.1007/s11235-011-9497-1
DO - 10.1007/s11235-011-9497-1
M3 - Article
SN - 1018-4864
VL - 52
SP - 1831
EP - 1844
JO - TELECOMMUNICATION SYSTEMS
JF - TELECOMMUNICATION SYSTEMS
IS - 4
ER -