English  |  正體中文  |  简体中文  |  Items with full text/Total items : 21921/27947 (78%)
Visitors : 4208401      Online Users : 607
RC Version 6.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://140.128.103.80:8080/handle/310901/22630


    Title: Adaptive and intelligent path discovery on-demand for wireless networks using service composition
    Authors: Lin, C.-L.a , Hou, T.-W.a , Chiang, T.-C.ab , Tai, C.-F.a
    Contributors: Department of Information Management, Tunghai University
    Keywords: Ad hoc networks;Multicast protocol;Pervasive computing;Route setup;Route-composition discovery
    Date: 2009
    Issue Date: 2013-05-21T09:12:47Z (UTC)
    Abstract: Route setup and discovery require low communication overhead in portable computing and wireless environments. We propose an adaptive and intelligent route discovery on-demand approach that introduces a service composition concept. Since service composition along a network is like a path in a multicast tree, path discovery can be regarded as service composition. Hence, a route-composition is proposed to combine existing services (paths) into candidate complex services (paths) called on-demand route compositions. The proposed route setup mechanism has the following characteristics: (1) on-demand route setup to avoid periodical multicast overhead for member discovery; (2) a directed service graph to represent a transparent route-composition; (3) candidate routes are found adaptively and intelligently; (4) the best route among candidate routes is determined by the max-flow and min-cut algorithm. The simulation shows that for a newly joining multicast receiver, the proposed method can avoid periodical multicast-related control overhead for member discovery, and improve the throughput for multicast communication from 29% to 74% as compared with the nearest neighbor algorithm. ? 2008 Elsevier Ltd. All rights reserved.
    Relation: Expert Systems with Applications
    Volume 36, Issue 4, May 2009, Pages 8667-8675
    Appears in Collections:[資訊管理學系所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML540View/Open


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


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback