Delay guaranteed bandwidth-efficient multicast routing in wireless multi-hop networks

Abstract

Recently, static wireless multi-hop networks such as wireless mesh networks(WMN), wireless sensor networks have been risen due to their simplicity to deploy and cheap install cost. Multicast service in those networks has an advantage for sending data to multiple destinations by one broadcasting cost. This advantage is called wireless multicast advantage and many papers have solved the multicast routing problem with the advantage. Also, there are two key measures to evaluate performance of a multicast tree algorithm or protocol, end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in QoS manner and it affects total throughput in wireless networks. Delay is same as hop count or path length from source to each destination and that is directly related to the packet success ratio. In wireless networks, each node use air medium for transmitting data, so bandwidth consumption problem is just same as the number of transmissions. If there are many transmitting nodes in network, there would have a lot of collisions and queues caused by congestions. In this paper, we optimize two metrics by guaranteed delay scheme. We will provide IP formulation for minimization of the number of transmissions with guaranteed hop count and preprocessing to solve that problem. Also, we extend this scheme not just with guaranteed minimum hop count, but 1 or more guaranteed delay bound to compromise two key metrics. We will explain the proposed heuristic algorithm for that and show the performance and result in the later part of this paper.