淡江大學機構典藏:Item 987654321/73322
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62822/95882 (66%)
Visitors : 4028362      Online Users : 564
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/73322


    Title: A Hole Avoiding Routing Protocol with Relative Neighborhood Graph for Wireless Sensor Network
    Authors: Wang, Ying-Hong;Huang,Kuo-Feng;Lee, Liang-Yi;Quek, Kai-Guan
    Contributors: 淡江大學資訊工程學系
    Keywords: hole avoiding routing;hole detection;relative neighborhood graph;wireless sensor network
    Date: 2009-12
    Issue Date: 2011-10-24 11:45:34 (UTC+8)
    Publisher: Taipei : Institute of electrical and electronics engineers (IEEE)
    Abstract: In wireless sensor networks, ¿holes¿ are hardly to know its location and avoid either because of various actual geographical environments. A hole can be dynamically formed due to unbalanced deployment, failure or power exhaustion of sensors, animus interference, or physical barriers such as buildings or mountains. Hence, we hope to propose the RNG Hole Avoiding Routing protocol, RNGHAR which can model ¿holes¿ existed in wireless sensor network and event packets can avoid meeting a ¿hole¿ in advance instead of bypassing a hole when it meets the hole. This paper proposes a novel algorithm RNGHAR which uses RNG (relative neighborhood graph) modeling holes then we can collect hole information in order to construct in advance hole avoiding routing path. Hence event packets will be guided to overcome the hole and move along the shortest path from source node to the sink node. Simulation studies show that my proposed method achieves good performance in terms of average hop count, packet delivery success rate and power consumption in comparison with the existing protocols.
    Relation: Proceedings of the 2009 joint conferences on pervasive computing, pp.239-246
    DOI: 10.1109/JCPC.2009.5420184
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Proceeding

    Files in This Item:

    File Description SizeFormat
    A Hole Avoiding Routing Protocol with Relative Neighborhood Graph for.pdf全文檔7389KbAdobe PDF254View/Open
    index.html0KbHTML267View/Open

    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