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

被引:0
作者
Lin, Cheng-Liang [1 ]
Hou, Ting-Wei [1 ]
Chiang, Tzu-Chiang [1 ,2 ]
Tai, Cheng-Feng [1 ]
机构
[1] Natl Cheng Kung Univ, Dept Engn Sci, Tainan 70101, Taiwan
[2] Hsing Kuo Univ Management, Dept Informat Management, Tainan, Taiwan
关键词
Route-composition discovery; Multicast protocol; Route setup; Ad hoc networks; Pervasive computing; MULTICAST; ALGORITHM; COST;
D O I
10.1016/j.eswa.2008.10.046
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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. (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码:8667 / 8675
页数:9
相关论文
共 25 条
[1]   Distributed multicast tree generation with dynamic group membership [J].
Adelstein, F ;
Richard, GG ;
Schwiebert, L .
COMPUTER COMMUNICATIONS, 2003, 26 (10) :1105-1128
[2]  
[Anonymous], P 5 INT WORKSH COMP
[3]  
Bai RD, 2006, IEEE T MOBILE COMPUT, V5, P1403, DOI 10.1109/TMC.2006.150
[4]   Performance and resource cost comparisons for the CBT and PIM multicast routing protocols [J].
Billhartz, T ;
Cain, JB ;
FarreyGoudreau, E ;
Fieg, D ;
Batsell, SG .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1997, 15 (03) :304-315
[5]   SOM: spiral-fat-tree-based on-demand multicast protocol in a wireless ad-hoc network [J].
Chen, YS ;
Chen, TS ;
Huang, CJ .
COMPUTER COMMUNICATIONS, 2002, 25 (17) :1684-1695
[6]   Multicast over wireless mobile ad hoc networks: Present and future directions [J].
Cordeiro, CD ;
Gossain, H ;
Agrawal, DP .
IEEE NETWORK, 2003, 17 (01) :52-59
[7]  
DAVIS L, 2006, 5 INT C DISC COMP SE
[8]   Semantics-based dynamic service composition [J].
Fujii, K ;
Suda, T .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (12) :2361-2372
[9]  
GARG N, 1993, P 25 ANN ACM S THEOR
[10]   Adaptive core selection and migration method for multicast routing in mobile ad hoc networks [J].
Gupta, SKS ;
Srimani, PK .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (01) :27-38