Effective location-guided tree construction algorithms for small group multicast in MANET
Proceedings - IEEE INFOCOM - Tập 3 - Trang 1180-1189 vol.3
Tóm tắt
Group communication has become increasingly important in mobile ad hoc networks (MANET). Current multicast routing protocols in MANET have a large overhead due to the dynamic network topology. To overcome this problem, there is a recent shift towards stateless multicast in small groups. We introduce a small group multicast scheme, based on packet encapsulation, which uses a novel packet distribution tree construction algorithms for efficient data delivery. The tree is constructed with the goal of minimizing the overall bandwidth cost of the tree. Two construction algorithms, for a location-guided k-ary (LGK) tree and a location-guided Steiner (LGS) tree, utilize the geometric locations of the destination nodes as heuristics to compute the trees. They are accompanied by a hybrid location update mechanism to disseminate location information among a group of nodes. Our simulation results show that LGS tree has lower bandwidth cost than LGK tree when the location information of the nodes is up-to-date, and its cost is similar to that of an optimal Steiner multicast tree. When location information of the nodes is out-dated, LGK tree outperforms LGS tree due to its lower computational complexity.
Từ khóa
#Multicast algorithms #Mobile ad hoc networks #Bandwidth #Steiner trees #Cost function #Mobile communication #Multicast protocols #Routing protocols #Network topology #EncapsulationTài liệu tham khảo
ji, 1998, LAM: Lightweight Adaptive Multicast protocol
10.1109/INFCOM.1999.751466
10.1109/65.819168
lee, 0, On-demand multicast routing protocol, Proceedings of IEEE WCNC'99 New Orleans LA September 1999, 1298
10.1145/313451.313538
lee, 0, A performance comparison study of ad hoc wireless multicast protocols, Proceedings of IEEE Infocom 2000 March 2000
boivie, 2000, Explicit multicast (Xcast) basic specification
10.1109/65.752646
takahashi, 1980, An approximate solution for the steiner problem in graphs, Mathmatica Japonica, 573
cormen, 1989, Introduction to algorithms
10.1007/978-0-585-29603-6_5
10.1002/net.3230220105
wu, 1998, Ad hoc multicast routing protocol utilizing increasing id-numberS (AMRIS) functional specification
10.1109/ICDSC.2001.919008
bommaiah, 1998, AMRoute: Ad hoc multicast routing protocol
2001
ji, 0, Differential destination multicast - A manet multicast routing protocol for small groups, Proc of INFOCOM 2001 Apr 2001, 1192
xue, 0, A location-aided power-aware routing protocol in mobile ad hoc networks, Proc of IEEE Globecom 2001 San Antonio Texas November 2001
10.1145/345910.345953
cohen, 0, A unicast-based approach for steaming multicast, Proc of INFOCOM 2001 Apr 2001
10.1109/INFCOM.2000.832563
10.1109/90.700892
basagni, 0, A distance routing effect algorithm for mobility (DREAM), Proc of ACM/IEEE MobiComm'98 October 1998
ko, 0, Location-aided routing (LAR) in mobile ad hoc networks, Proc of ACM MOBICOM'98 Conf October 1998