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 language | English |
|---|---|
| Pages (from-to) | 8667-8675 |
| Number of pages | 9 |
| Journal | Expert Systems With Applications |
| Volume | 36 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2009 May 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Engineering(all)
- Computer Science Applications
- Artificial Intelligence
Cite this
}
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 journal › Article
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 -