A Routing Protocol with Repair Mechanism Based on 2-hop Clustering Structure in Mobile Ad Hoc Networks

• Main Authors: Chi-shing You, 游啟興
• Other Authors: Tsung-Chuan Huang
• Format: Others
• Language: zh-TW
• Published: 2015
• Online Access: http://ndltd.ncl.edu.tw/handle/44096570462853286699

碩士 === 國立中山大學 === 電機工程學系研究所 === 103 === In mobile ad hoc networks (MANETs), effective routing is a critical issue. Many routing protocols have been proposed to build a hierarchical structure for supporting the scalability of large MANET in the past years, for example, cluster-based routing protocols. Cluster heads in cluster-based routing protocols manage member nodes in their range and transmit the packets, so they will die out from overloading. In terms of scalability, the hierarchical structure is better than the flat structure in a larger network. In this paper, we propose a routing protocol based on 2-hop non-overlapping clusters called RP2CS to alleviate the loading of cluster heads. Here the source sends packets to the destination directly if the destination is the neighbor of the source; otherwise the source sends the route request packet (RREQ) to trigger the routing process. Instead of adopting the nodes that forwards the RREQ as the route between the source and the destination, the destination broadcasts the route reply packet (RREP) via the nodes within the clusters which the RREQ has passed to find the source. The route constructed by our method can avoid the cluster heads being always in the transmission route and collapsing due to overloading. The work adopts source routing to transmit data packets, but the source only fills the gateway list in data packet’s header. The route is selected with the higher link expiration time (LET), which represents the stability of link. In the route maintenance, the broken link is repaired by the view of clusters, so it can restore the path widely. The method we proposed here distributed the overhead to member nodes and it has greater effect on route repair. Simulation results demonstrate that our proposed protocol has better performance in average packet delivery ratio and less overhead than other cluster-based routing protocols.