- 期刊
- OpenAccess
An Efficient Cluster-Based Routing Algorithm in Ad Hoc Networks with Unidirectional Links
並列摘要
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.
延伸閱讀
- 劉書煒（2001）。Analysis of Node Density_Based Hybrid Clustering Routing in Ad-Hoc Networks〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611292887
- Mansouri, A., & Bouhlel, M. S. (2019). Trust in Ad Hoc Networks: A New Model Based on Clustering Algorithm. International Journal of Network Security, 21(3), 483-493. https://doi.org/10.6633/IJNS.201905_21(3).15
- Yang, C. C., & Chang, Y. C. (2008). A Stability-Based Clustering Technique and Routing Protocol for Mobile Ad Hoc Networks. Journal of Information Science and Engineering, 24(2), 469-481. https://doi.org/10.6688/JISE.2008.24.2.10
- 林和昌（2004）。An Adaptive Routing Algorithm for Heterogeneous Networks Considering Cost and Utility〔碩士論文，中原大學〕。華藝線上圖書館。https://doi.org/10.6840/cycu200400530
- Lee, T. T. (2002). An Energy-efficient Clustering Algorithm for Wireless Ad Hoc Networks. 宜蘭技術學報, (9), 65-73. https://doi.org/10.6179/nit.eec.2002.09.18