DocumentCode :
1666886
Title :
Approximating optimal multicast trees in wireless multihop networks
Author :
Ruiz, Pedro M. ; Gomez-Skarmeta, Antonio F.
Author_Institution :
Dept. of Inf. & Commun. Eng., Murcia Univ., Spain
fYear :
2005
Firstpage :
686
Lastpage :
691
Abstract :
We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely studied in fixed networks. However, we show in this paper that in multi-hop wireless mesh networks, a Steiner tree is no longer offering the lowest bandwidth consumption. So, we re-formulate the problem in terms of minimizing the number of transmissions. We show that the new problem is also NP-complete and propose heuristics to approximate such trees. Our simulations results show that the proposed heuristics offer a lower cost than Steiner trees over a variety of scenarios.
Keywords :
multicast communication; optimisation; radio networks; NP-complete problem; Steiner tree problem; multihop wireless mesh networks; optimal multicast trees; wireless multihop networks; Ad hoc networks; Broadcasting; Costs; Distributed computing; Intelligent networks; Multicast algorithms; Multicast protocols; Routing protocols; Spread spectrum communication; Wireless mesh networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on
ISSN :
1530-1346
Print_ISBN :
0-7695-2373-0
Type :
conf
DOI :
10.1109/ISCC.2005.34
Filename :
1493799
Link To Document :
بازگشت