Open Access Open Access  Restricted Access Subscription Access

A Reachable and Fault Tolerant Scheme for Broadcast in Ad-Hoc Wireless Networks

Fan Wu,
Hsiao-Hui Li,
Yao-Tien Wang,
Ming-Lun Tsai,

Abstract


In ad hoc wireless network, nodes can communicate with each other through broadcasting. Nevertheless, such an ad hoc wireless network has many unstable factors causing the transmission being unreliable. Thus, the broadcasting algorithm needs fault tolerant capability to solve the possible failure of broadcasting process. In this paper, we propose self-pruning-with-fault-tolerant (SPFT) algorithm to achieve fault tolerance and reachable capability. By using the self-pruning approach, SPFT algorithm can reduce the redundant transmissions. In addition, SPFT algorithm selects the stable links in transmission to provide the better success ratio of transmission as well as uses the comparison mechanism to deal with the failure transmissions. By this way, fault tolerance degree can be increased. According to the experimental results, our algorithm has the fault-tolerant capability and offers the benefit of efficiency and reliability for broadcasting in ad hoc wireless network.

Keywords


Self-pruning; Fault tolerance; Broadcasting storm; Minimum connected dominated set; Ad hoc network

Citation Format:
Fan Wu, Hsiao-Hui Li, Yao-Tien Wang, Ming-Lun Tsai, "A Reachable and Fault Tolerant Scheme for Broadcast in Ad-Hoc Wireless Networks," Journal of Internet Technology, vol. 14, no. 1 , pp. 71-80, Jan. 2013.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.





Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314  E-mail: jit.editorial@gmail.com