The full text of this article

 

Opportunistic routing for multiple multicast flows in wireless mesh networks
by Shi-Ming He; Da-Fang Zhang; Kun Xie; Ji Zhang; Hong Qiao
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 7, No. 1, 2014

 

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.

Online publication date: Tue, 14-Jan-2014

 

is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

 
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

 
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

 

    Username:        Password:         

Forgotten your password?


 
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

 
If you still need assistance, please email subs@inderscience.com