Adaptive and intelligent path discovery on-demand for wireless networks using service composition

Cheng Liang Lin, Ting-Wei Hou, Tzu Chiang Chiang, Cheng Feng Tai

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)8667-8675
Number of pages9
JournalExpert Systems With Applications
Volume36
Issue number4
DOIs
Publication statusPublished - 2009 May 1

Fingerprint

Wireless networks
Chemical analysis
Communication
Joining
Throughput

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Cite this

Lin, Cheng Liang ; Hou, Ting-Wei ; Chiang, Tzu Chiang ; Tai, Cheng Feng. / Adaptive and intelligent path discovery on-demand for wireless networks using service composition. In: Expert Systems With Applications. 2009 ; Vol. 36, No. 4. pp. 8667-8675.
@article{b84ac260c1254642b9eeebcfc348f7df,
title = "Adaptive and intelligent path discovery on-demand for wireless networks using service composition",
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.",
author = "Lin, {Cheng Liang} and Ting-Wei Hou and Chiang, {Tzu Chiang} and Tai, {Cheng Feng}",
year = "2009",
month = "5",
day = "1",
doi = "10.1016/j.eswa.2008.10.046",
language = "English",
volume = "36",
pages = "8667--8675",
journal = "Expert Systems with Applications",
issn = "0957-4174",
publisher = "Elsevier Limited",
number = "4",

}

Adaptive and intelligent path discovery on-demand for wireless networks using service composition. / Lin, Cheng Liang; Hou, Ting-Wei; Chiang, Tzu Chiang; Tai, Cheng Feng.

In: Expert Systems With Applications, Vol. 36, No. 4, 01.05.2009, p. 8667-8675.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Adaptive and intelligent path discovery on-demand for wireless networks using service composition

AU - Lin, Cheng Liang

AU - Hou, Ting-Wei

AU - Chiang, Tzu Chiang

AU - Tai, Cheng Feng

PY - 2009/5/1

Y1 - 2009/5/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=60249085508&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=60249085508&partnerID=8YFLogxK

U2 - 10.1016/j.eswa.2008.10.046

DO - 10.1016/j.eswa.2008.10.046

M3 - Article

VL - 36

SP - 8667

EP - 8675

JO - Expert Systems with Applications

JF - Expert Systems with Applications

SN - 0957-4174

IS - 4

ER -