English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51254/86278 (59%)
Visitors : 8003612      Online Users : 68
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/37666


    Title: Grouping strategy for solving hidden node problem in IEEE 802.15.4 LR-WPAN
    Other Titles: 解決IEEE 802.15.4 LR-WPAN隱藏點問題之群組策略
    Authors: Huang, Lien-ching;Sheu, Shiann-tsong;Shih, Yun-yen;Cheng, Yen-chieh
    Contributors: 淡江大學資訊工程學系;淡江大學電機工程學系
    Date: 2005-07-10
    Issue Date: 2010-01-11 13:54:52 (UTC+8)
    Abstract: The medium access control (MAC) protocol defined in IEEE 802.15.4 standard is able to achieve low-power transmissions in low-rate and short-distance wireless personal area networks (WPANs). The modified CSMA/CA protocol used to minimize power consumption does not have the hidden-node protection mechanism, such as RST/CTS mechanism, for the sake of reducing the control overheads. Referring to previous research results, which proved that the probability of any two nodes in infrastructure network unheard each other is about 41%, the hidden-node problem (HNP) could result in inefficient data transmission in WPAN and quick power consumption. In this paper, we propose a simple and efficient grouping strategy to solve the IEEE 802.15.4 HNP without needing extra control overheads in data transmissions. The proposed strategy groups nodes according to their hidden-node relationships and then separates the periodic transmission period into several non-overlapping sub-periods, one for each group. The WPAN coordinator is responsible for detecting the hidden-node situation and performing the grouping procedure if necessary. In this paper, we also prove that the maximal number of groups in a WPAN is five. Simulation results demonstrate that the proposed strategy is able to improve the standard transmission efficiency and to conserve energy by eliminating the unnecessary collisions.
    Relation: Wireless Internet, 2005. Proceedings. First International Conference on, pp.26-32
    Appears in Collections:[資訊工程學系暨研究所] 會議論文
    [電機工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    Grouping strategy for solving hidden node problem in IEEE 802.15.4 LR-WPAN.pdf353KbAdobe PDF516View/Open
    index.html0KbHTML220View/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