中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/107024
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81578671      Online Users : 2628
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: https://ir.lib.ncu.edu.tw/handle/987654321/107024


    Title: Minimum local disk cover sets for broadcasting in heterogeneous multihop wireless networks
    Authors: 孫敏德;CHEN, GUANING;YI, CHIH-WEI;SUN, MIN-TE;LIU, FANG-CHU;LAN, WEI-CHI
    Contributors: 資訊電機學院資訊工程學系
    Keywords: Algorithms;Broadcasting;Disks;Equivalence;Messages;Networks;Protocol (computers);Relay
    Date: 2012-08-01
    Issue Date: 2026-04-23 13:53:29 (UTC+8)
    Publisher: World Scientific Publishing Co. Pte Ltd;World Scientific Publishing Company
    Abstract: 摘要: The concept of forwarding sets is widely adopted in many broadcast protocols for wireless multihop networks to alleviate the broadcast storm problem. In these protocols, after receiving a broadcast message, each node that is requested to relay the message instructs a subset of its 1-hop neighbors, a.k.a. the forwarding set, to further relay it. In this paper, we propose to use the Minimum Local Disk Cover Set (MLDCS) as the forwarding set in heterogeneous multihop wireless networks, where nodes may have different transmission ranges.We show that the minimum local disk cover set of a node in heterogeneous networks is equivalent to its skyline set, and then we propose a divide-and-conquer algorithm with the optimal time complexity to compute the skyline set locally and statelessly. Moreover, unlike other forwarding heuristics, the proposed algorithm requires only 1-hop neighbor information. This helps to reduce the forwarding set formation latency and thus will be more suitable for environments with a frequently changed network topology, such as vehicular ad hoc networks.
    出版者: World Scientific Publishing Company
    出版日期: 2012-08
    出處: International journal of foundations of computer science, 2012-08, Vol.23 (5), p.1147-1172
    版權: 2012, World Scientific Publishing Company
    識別號: ISSN: 0129-0541
    識別號: EISSN: 1793-6373
    識別號: DOI: 10.1142/S0129054112500165
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML13View/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 ©   - 隱私權政策聲明