• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
An Huiyao, Lu Xicheng, Peng Wei, Gong Zhenghu. A Cluster-Based Multipath Dynamic Source Routing in MANET[J]. Journal of Computer Research and Development, 2006, 43(3): 381-388.
Citation: An Huiyao, Lu Xicheng, Peng Wei, Gong Zhenghu. A Cluster-Based Multipath Dynamic Source Routing in MANET[J]. Journal of Computer Research and Development, 2006, 43(3): 381-388.

A Cluster-Based Multipath Dynamic Source Routing in MANET

More Information
  • Published Date: March 14, 2006
  • Numerous studies have shown the difficulty for a routing protocol to scale to large mobile ad hoc networks. A scheme called a cluster-based multipath dynamic source routing (CMDSR) in MANET is proposed, which is designed to be adaptive according to network dynamics. It uses the hierarchy to perform route discovery and distributes traffic among diverse multiple paths. The CMDSR is based on a 2-level hierarchical scheme: the 1-cell cluster and 2-server cluster. The main idea of the proposition is to transfer the route discovery procedure to the 1-server level to prevent the network flooding due to the DSR route discovery. Thus, route discovery does not require flooding mechanism and the overhead is minimized, thus improving the network scalability. Furthermore, the CMDSR solves reliability problem by selectively choosing more reliable paths and by providing end-to-end QoS soft guarantees. By implementing the algorithm in the OPNET environment, the results show that the CMDSR can balance the load of the network and deals with the frequent change of the network topology effectively, thus improving the reliability and robustness of the network efficiently.
  • Related Articles

    [1]Jiang Luyu, Ouyang Dantong, Zhang Qi, Tai Ran, Zhang Liming. Incremental Information Interaction-Based Algorithm for Enumerating MUSes[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202440326
    [2]Bai Tian, Xiao Mingyu. Computational Complexity of Feedback Set and Subset Feedback Set Problems: A Survey[J]. Journal of Computer Research and Development, 2025, 62(1): 104-118. DOI: 10.7544/issn1000-1239.202330693
    [3]Ouyang Dantong, Jia Fengyu, Liu Siguang, Zhang Liming. An Algorithm Based on Extension Rule For Solving #SAT Using Complementary Degree[J]. Journal of Computer Research and Development, 2016, 53(7): 1596-1604. DOI: 10.7544/issn1000-1239.2016.20150032
    [4]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [5]Qiu Jiangtao, Tang Changjie, Zeng Tao, Liu Yintian. Strategy of Revising Rules for Association Text Classification[J]. Journal of Computer Research and Development, 2009, 46(4): 683-688.
    [6]Zhong Yong, Qin Xiaolin, and Bao Lei. An Association Rule Mining Algorithm of Multidimensional Sets[J]. Journal of Computer Research and Development, 2006, 43(12): 2117-2123.
    [7]Xiong Zhongmin, Hao Zhongxiao. An Approach to Termination Decision for a Rule Set Based on Activation Path and Conditional Formula[J]. Journal of Computer Research and Development, 2006, 43(5): 901-907.
    [8]Hao Zhongxiao, Xiong Zhongmin. An Efficient Algorithm for Computing an Irreducible Rule Set in Active Database[J]. Journal of Computer Research and Development, 2006, 43(2): 281-287.
    [9]Hao Zhongxiao, Ren Chao, Zhao Lingqiang. Termination Analysis of Active Rule Based on Dependency Set[J]. Journal of Computer Research and Development, 2005, 42(12): 2199-2205.
    [10]Tian Daxin, Liu Yanheng, Li Yongli, Tang Yi. A Fast Matching Algorithm and Conflict Detection for Packet Filter Rules[J]. Journal of Computer Research and Development, 2005, 42(7): 1128-1135.

Catalog

    Article views (715) PDF downloads (507) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return