中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/51556
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 41661546      Online Users : 1826
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.lib.ncu.edu.tw/handle/987654321/51556


    Title: Interference-Aware, Fully-Distributed Virtual Backbone Construction and its Application in Multi-Hop Wireless Networks
    Authors: Huang,SCH;Sun,MT;Liang,QL;Wan,PJ;Jia,XH
    Contributors: 資訊工程學系
    Keywords: CONNECTED DOMINATING SETS;AD-HOC NETWORKS;ALGORITHMS
    Date: 2010
    Issue Date: 2012-03-27 18:56:10 (UTC+8)
    Publisher: 國立中央大學
    Abstract: In multi-hop wireless networks, the use of virtual backbone can greatly simplify routing, broadcasting, as well as energy/bandwidth saving. However, constructing a virtual backbone is costly and time-consuming because of the inevitable transmission interference during the process of the construction. In the literature, most of virtual backbone construction algorithms did not take the interference issue into consideration. To the best of our knowledge, our proposed algorithm is the first fully-distributed, interference-aware virtual backbone construction algorithm that has a proven bound on the construction latency. Besides, our proposed algorithm can be applied to the leader election problem, and such application results in a fully-distributed and interference-aware leader election algorithm of time complexity O(n log n) (where n is the number of nodes). This new leader election algorithm is practical in wireless networks because interference has already been dealt with; is also results in the fastest interference-aware leader election algorithm to the best of our knowledge.
    Relation: IEEE TRANSACTIONS ON COMMUNICATIONS
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML349View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 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 ©   - 隱私權政策聲明