Opportunistic routing for multiple multicast flows in wireless mesh networks

Authors:
Shi-Ming He;Da-Fang Zhang;Kun Xie;Ji Zhang;Hong Qiao
Affiliations:
College of Information Science and Engineering, Hunan University, Changsha, China;College of Information Science and Engineering, Hunan University, Changsha, China;College of Information Science and Engineering, Hunan University, Changsha, China;College of Information Science and Engineering, Hunan University, Changsha, China;College of Information Science and Engineering, Hunan University, Changsha, China
Venue:
International Journal of Wireless and Mobile Computing
Year:
2014

Citing 6
Cited 0

A high-throughput path metric for multi-hop wireless routing

Proceedings of the 9th 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
Dice: a game theoretic framework for wireless multipath network coding

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
AODV-based multipath routing protocol with preferential path selection probabilities

International Journal of Wireless and Mobile Computing
A routing-profitable MAC protocol for Mobile Ad Hoc Networks

International Journal of Wireless and Mobile Computing
QoS routing protocols for mobile ad hoc networks: a survey

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Opportunistic routing OR involves multiple candidate forwarders to relay packets by taking advantage of the broadcast nature and multi-user diversity of the wireless medium. OR combats lossy wireless transmissions in comparison with traditional routing TR in which only one pre-selected next-hop node is involved to forward packets. At present, the OR does not take account of the traffic load, therefore some nodes may be overloaded while the others may not, leading to network performance decline. The OR for multiple multicast flows is described as a convex optimisation problem. In order to solve the problem, by combining primal-dual and sub-gradient methods, a fully distributed joint candidate forwarder selection Opportunities Routing for Multiple Multicast Flows algorithm ORMMcF is proposed. ORMMcF allocates the flow rate iteratively and the rate allocation decides the candidate forwarder selection of opportunistic routing. The simulation results show that ORMMcF algorithm improves 46.2%, 29.2% of the aggregative throughput than ETX and EAX, respectively.