Title page for etd-0321115-092500


[Back to Results | New Search]

URN etd-0321115-092500
Author Chi-shing You
Author's Email Address No Public.
Statistics This thesis had been viewed 5350 times. Download 371 times.
Department Electrical Engineering
Year 2014
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title A Routing Protocol with Repair Mechanism Based on 2-hop Clustering Structure in Mobile Ad Hoc Networks
Date of Defense 2015-03-25
Page Count 68
Keyword
  • Mobile Ad Hoc Network (MANET)
  • routing protocol
  • cluster head
  • gateway
  • link expiration time (LET)
  • Abstract 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.
    Advisory Committee
  • Tsang-Ling Sheu - chair
  • Ting-Wei Hou - co-chair
  • Zi-Tsan Chou - co-chair
  • Tsung-Chuan Huang - advisor
  • Files
  • etd-0321115-092500.pdf
  • Indicate in-campus at 0 year and off-campus access at 1 year.
    Date of Submission 2015-04-30

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys