Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Architecture and evaluation of an unplanned 802.11b mesh network
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A Scheme for Probabilistically Reliable Multicast Routing in Wireless Mesh Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
A QoS Multicast Routing Algorithm for Wireless Mesh Networks
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01
On multicast routing in wireless mesh networks
Computer Communications
Reducing Multicast Redundancy and Latency in Wireless Mesh Networks
ETCS '09 Proceedings of the 2009 First International Workshop on Education Technology and Computer Science - Volume 01
A QoS aware multicast algorithm for wireless mesh networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient Multicast Algorithms for Multichannel Wireless Mesh Networks
IEEE Transactions on Parallel and Distributed Systems
Pervasive and Mobile Computing
GLBM: A new QoS aware multicast scheme for wireless mesh networks
Journal of Systems and Software
Efficient multicasting for multi-channel multi-interface wireless mesh networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A hybrid QoS multicast framework-based protocol for wireless mesh networks
Computer Communications
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
Journal of Network and Computer Applications
Load-aware multicast routing metrics in multi-radio multi-channel wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Network and Computer Applications
On-demand multicast routing protocol with efficient route discovery
Journal of Network and Computer Applications
The capacity of wireless networks
IEEE Transactions on Information Theory
Computers & Mathematics with Applications
Computers and Electrical Engineering
Hi-index | 0.09 |
The construction of multicast tree within given constraints, such as delay and capacity, is becoming a major problem in many wireless networks, especially wireless mesh networks (WMN). Due to the limited capacity of the wireless node, a multicast call may be dropped if there is no multicast tree formed within the given constraints. In this paper, we propose a new multicast tree construction algorithm which has maximum traffic flow and minimum delay under capacity constraints. The problem of multicast is formulated as a Linear Programming (LP) problem with associated constraints. A cost function (CF) is defined to choose the less loaded route among the available ones. A Minimum Delay Maximum Flow Multicast (MDMF) algorithm is proposed to solve this problem using CF and associated constraints. The performance of the proposed algorithm and CF is evaluated and compared with well-known algorithms with respect to packet delivery fraction, latency, and network throughput. The results obtained show that the proposed algorithm has a lesser number of transmissions for a given CF. Moreover, the proposed algorithm has high throughput, packet delivery fraction and less latency compared to other well-known algorithms in this category.