中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/51630
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 80990/80990 (100%)
造访人次 : 41662197      在线人数 : 1991
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51630


    题名: G-STAR: Geometric STAteless Routing for 3-D wireless sensor networks
    作者: Sun,MT;Sakai,K;Hamilton,BR;Ku,WS;Ma,XL
    贡献者: 資訊工程學系
    日期: 2011
    上传时间: 2012-03-27 18:57:57 (UTC+8)
    出版者: 國立中央大學
    摘要: 3-D aerial and underwater sensor networks have found various applications in natural habitat monitoring, weather/earthquake forecast, terrorist intrusion detection, and homeland security. The resource-constrained and dynamic nature of such networks has made the stateless routing protocol with only local information a preferable choice. However, most of the existing routing protocols require sensor nodes to either proactively maintain the state information or flood the network from time to time. The existing stateless geometric routing protocols either fail to work in 3-D environments or have tendency to produce lengthy paths. In this paper, we propose a novel routing protocol, namely Geometric STAteless Routing (G-STAR) for 3-D networks. The main idea of G-STAR is to distributively build a location-based tree and find a path dynamically. G-STAR not only generalizes the notion of geographic routing from two modes to one mode, but also guarantees packet delivery even when the location information of some nodes is either inaccurate or simply unavailable regardless of the uses of virtual coordinates. In addition, we develop a light-weight path pruning algorithm, namely Branch Pruning (BP), that can be combined with G-STAR to enhance the routing performance with very little overhead. The extensive simulation results by ns-2 have shown that the proposed routing protocols perform significantly better than the existing 3-D geometric routing protocols in terms of delivery rate with competitive hop stretch. We conclude that the proposed protocols serve as a strong candidate for future high-dimensional sensor networks. (C) 2010 Elsevier B.V. All rights reserved.
    關聯: AD HOC NETWORKS
    显示于类别:[資訊工程學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML555检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明