A Fault-Tolerance Cluster Head Based Routing Protocol for Ad Hoc Networks

The hierarchical routing protocols have been proposed to deal with the path search in wireless multi hop networks in various research works. Most existing designs of ad hoc network routing protocols are based on the assumption of non-adversarial environment, that every node in the network is cooperative and well behaved. However, such assumption usually does not hold in realistic environments. The performance of current routing protocols degrades significantly when misbehaving nodes exist in the network. In this paper we introduce an efficient and effective hierarchical algorithm for MANET, which is called fault-tolerance cluster head based (FTCH) routing protocol. FTCH is proposed to provide a certain packet delivery fraction guarantee and low routing overhead in the presence of faulty nodes. The FTCH routing protocol is evaluated through both analysis and simulations compared with max-min multi-hop routing protocol (MMMH), AODV and DSR. The results show that FTCH greatly improves the ad hoc routing performance in the presence of misbehaving nodes.

[1]  Klara Nahrstedt,et al.  Fault tolerant routing in mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[2]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[3]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[5]  Ivan Marsic,et al.  Hierarchical routing overhead in mobile ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[6]  Vincent Park,et al.  Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification , 2001 .

[7]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[8]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[9]  R. Rajaraman,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002 .

[10]  Kong Ling. Pang.  Cluster head based routing algorithms and performance study for ad hoc wireless networks , 2006 .

[11]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[12]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[13]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 2001, TNET.

[14]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[15]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.