English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62568/95224 (66%)
造訪人次 : 2533739      線上人數 : 186
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/78536

    題名: EEGRA: Energy Efficient Geographic Routing Algorithms for Wireless Sensor Network
    作者: Chen, Tseng-yi;Wei, Hsin-wen;Lee, Che-rung;Hsu, Tsan-sheng;Shih, Wei-kuan
    貢獻者: 淡江大學資訊管理學系
    關鍵詞: Geographic routing;Energy-efficiency;Wireless sensor network;SINR;Distributed routing algorithm
    日期: 2012-12-13
    上傳時間: 2012-10-11 11:53:19 (UTC+8)
    摘要: Energy efficiency is critical in wireless sensor networks (WSN) for system reliability and deployment cost. The power consumption of the communication in multi-hop WSN is primarily decided by three factors: routing distance, signal
    interference, and computation cost of routing. Several routing algorithms designed for energy efficiency or interference avoidance had been proposed. However, they are either too complex to be useful in practices or specialized for certain
    WSN architectures. In this paper, we propose two energy efficient geographic routing algorithms (EEGRA) for wireless sensor networks, which are based on existing geographic routing algorithms and take all three factors into account.
    The first algorithm combines the interference into the routing cost function, and uses it in the routing decision. The second algorithm transforms the problem into a constrained
    optimization problem, and solves it by searching the optimal discretized interference level. We integrate four geographic routing algorithms: GOAFR+, Face Routing, GPSR, and RandHT, to both EEGRA algorithms and compare them with three other routing methods in terms of power consumption and computation cost for the grid and irregular sensor topologies. The results of our experiments show both algorithms conserve sensor’s routing energy 30% ~ 50% comparing to general geographic routing algorithms. In addition, the time complexity of EEGRA algorithms is similar to the geographic greedy routing methods, which is much faster than the optimal SINR-based algorithm.
    關聯: 2012 International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN), 11p.
    顯示於類別:[資訊管理學系暨研究所] 會議論文


    檔案 描述 大小格式瀏覽次數
    [2012 ISPAN]EEGRA.pdf698KbAdobe PDF627檢視/開啟



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