Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks
| Autor: | Cheng-Feng Tai, Tzu-Chiang Chiang, Ting-Wei Hou |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
Dynamic Source Routing
Computer science Wireless ad hoc network Distributed computing Wireless Routing Protocol Distance Vector Multicast Routing Protocol Scheduling (computing) Artificial Intelligence Multicast address Destination-Sequenced Distance Vector routing Xcast Pragmatic General Multicast Vehicular ad hoc network Protocol Independent Multicast Adaptive quality of service multi-hop routing Multicast Wireless network business.industry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS General Engineering Mobile ad hoc network Ad hoc wireless distribution service Computer Science Applications Source-specific multicast Optimized Link State Routing Protocol Link-state routing protocol Geocast business Computer network |
| Zdroj: | Expert Systems with Applications. 36:959-969 |
| ISSN: | 0957-4174 |
| DOI: | 10.1016/j.eswa.2007.10.035 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect