- 期刊
- OpenAccess
Optimized Minimum Spanning Tree for Secure Routing in MANET
並列摘要
Secure group communication transfers message from one member to another confidentially. Key management for secure communication in wireless networks is primitive based on cryptographic techniques. Intercluster routing was used to improve wireless networks security. In the new scheme, Minimum Spanning Tree (MST) and GBest-BAT algorithm are computed to identify Cluster Heads (CH) with a concept of backup nodes being introduced for effective key management. This study proposes MST formation for inter-cluster routing and it is optimized with GBEST- BAT algorithm.
延伸閱讀
- 蔡宏偉（2014）。Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue〔碩士論文，國立臺北商業大學〕。華藝線上圖書館。https://doi.org/10.6818/NTUB.2014.00007
- Charles, A., & Bensraj, R. (2015). Mobility and Bandwidth Aware QoS Routing Protocol for MANET. Research Journal of Applied Sciences, Engineering and Technology, 11(1), 48-55. https://www.airitilibrary.com/Article/Detail?DocID=20407467-201509-201601200030-201601200030-48-55
- Tseng, C. C. (2022). Generating Spanning-tree Sequences of a Fan Graph and Ranking/Unranking Algorithms [master's thesis, National Taipei University of Business]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0064-2712202217120206
- 李裕民（2007）。A Search Mechanism of Building a Minimum Cost Spanning Tree on Peer-to-Peer Network〔碩士論文，淡江大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0002-2007200720135500
- 牟哲人（1995）。Distributed Algorithms for Minimum Spanning Rooted Tree on a Bridged Local Area Network〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611353738