Efficient multicast tree algorithm for ad hoc networks

Author

Penttinen, Aleksi

Author_Institution

Networking Lab., Helsinki Univ. of Technol., Espoo, Finland

fYear

2004

fDate

25-27 Oct. 2004

Firstpage

519

Lastpage

521

Abstract

We propose an efficient heuristic algorithm for multicast tree construction in ad hoc networks. The objective is to connect a source node to a set of destination nodes with a sequence of transmissions so that the number of transmissions is minimized. The algorithm utilizes shortest path information, which can be obtained from unicast routing tables for fully distributed implementation. In addition to multicast routing, the algorithm is applicable to stateless multicast forwarding for small multicast groups.

Keywords

ad hoc networks; multicast communication; telecommunication network routing; trees (mathematics); ad hoc networks; destination nodes; fully distributed implementation; heuristic algorithm; multicast routing; multicast tree algorithm; multicast tree construction; shortest path information; small multicast groups; source node; stateless multicast forwarding; transmission sequence; unicast routing tables; Ad hoc networks; Broadcasting; Heuristic algorithms; Laboratories; Multicast algorithms; Multicast protocols; Multimedia communication; Routing; Streaming media; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

Mobile Ad-hoc and Sensor Systems, 2004 IEEE International Conference on

Print_ISBN

0-7803-8815-1

Type

conf

DOI

10.1109/MAHSS.2004.1392194

Filename

1392194