English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51962/87093 (60%)
Visitors : 8510696      Online Users : 78
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/97774

    Title: A Path Recovery Routing Protocol Based on Clustering Coefficient in Ad Hoc Networks
    Authors: YAO, Chenhan;TSAI, Yihjia;HUANG, Wenfa
    Contributors: 淡江大學資訊工程學系
    Keywords: Ad Hoc Networks;Routing Protocol;Local Recovery;Clustering Coefficient;Complex Network
    Date: 2012-01
    Issue Date: 2014-04-21 14:42:56 (UTC+8)
    Publisher: Bethel: Binary Information Press
    Abstract: In ad hoc network, nodes communicate with each other through wireless multi-hop links. When a node wants to send data to another node, it uses some routing algorithm to find the path before data delivery. In on-demand routing protocol, the source asks its neighbors to find the route leading to the destination. Route discovery is typically performed via flooding, which consumes a lot of control packets. Due to node mobility, the network topology change frequently and cause the route broken. In this paper, we propose a local path recovery routing protocol based on clustering coefficient (LPRCC) which can reduce the route discovery times when route failure occur. The clustering coefficient is one of properties in complex network. Simulation results show our protocol can decrease the number of control packets and increase route delivery ratio.
    Relation: Journal of Computational Information Systems 8(2), pp.469-476
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback