Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19]

@

Journal of Information Science and Engineering, Vol. 24 No. 5, pp. 1409-1428 (September 2008)

An Efficient Cluster-Based Routing Algorithm in Ad Hoc Networks with Unidirectional Links*

Yi-Yu Su, Shiow-Fen Hwang and Chyi-Ren Dow
Department of Information Engineering and Information Science
Feng Chia University
Taichung, 407 Taiwan

Mobile ad hoc networks are dynamically organized by a collection of wireless mobile nodes. The mobile nodes in ad hoc networks can move arbitrarily thus the topology of network changes dynamically. Due to the properties of communication medium in wireless networks, unidirectional links may exist between mobile nodes thus results in the difficulty of link utilization and routing. In this paper, we take the advantages of multi-hop acknowledgement and employ the clustering technique to design an efficient hybrid routing protocol in ad hoc networks with unidirectional links. Simulation results demonstrate the stability and efficiency of the proposed protocol.

Keywords: mobile ad hoc networks, unidirectional link, routing, clustering, efficient, hybrid

Full Text () Retrieve PDF document (200809_08.pdf)

Received November 21, 2006; revised July 3, 2007; accepted October 9, 2007.
Communicated by Ten-Hwang Lai.