English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51317/86412 (59%)
Visitors : 8179323      Online Users : 63
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/92988


    Title: Energy Efficient Geographic Routing Algorithms in Wireless Sensor Network
    Authors: Chen, Tseng-Yi;Wei, Hsin-Wen;Lee, Che-Rung;Huang, Fu-Nan;Hsu, Tsan-sheng;Shih, Wei-Kuan
    Contributors: 淡江大學電機工程學系
    Keywords: Geographic routing;Energy-efficient;Wireless sensor network;SINR;Interference power
    Date: 2013-05-01
    Issue Date: 2013-11-01 17:24:46 (UTC+8)
    Publisher: Singapore: World Scientific Publishing Co. Pte. Ltd.
    Abstract: Over the past decade, energy efficiency has consistently been a critical research topic in the field of wireless sensor networks. In wireless networks, signal interference often leads to power waste in a sensor node. Several SINR-based routing algorithms designed for energy efficiency or interference avoidance had been proposed. However, they are either too complex to be useful in practices or may slow in routing computation speed. In this paper, two energy efficient geographic routing algorithms (EEGRA) for wireless sensor network are proposed to address the power consumption issue while considering the routing computation speed. The first algorithm take the value of 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 adopt four geographic routing algorithms: GOAFR+, Face Routing, GPSR, and RandHT, in 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 experimental result shows that the EEGRA algorithms reduce energy consumption by 30–50% comparing to geographic routing methods. 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.
    Relation: Journal of Interconnection Networks 14(1), 1350001(23pages)
    DOI: 10.1142/S0219265913500011
    Appears in Collections:[電機工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML167View/Open
    index.html0KbHTML107View/Open
    index.html0KbHTML36View/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