کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
387525 | 660902 | 2009 | 11 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks](/preview/png/387525.png)
Finding a near-optimal routing solution for multicast requests is a challenge for supporting different multicast applications including video and group communications over wireless ad hoc networks. A heuristic partitioning algorithm for solving the multicast routing problem with separate paths in ad hoc networks is presented. We consider scheduling a set of multicast requests which may have a source node with multiple destinations respectively through a wireless network. Our heuristic method for partitioning arbitrary routing requests is both effective in finding a near-optimal solution, and efficient to solve large multicast requests. Our simulation shows that the average overall latency reduces up to 38%. We also find that the handling scales up well from 8 nodes to 64 nodes.
Journal: Expert Systems with Applications - Volume 36, Issue 1, January 2009, Pages 959–969