Opportunistic Routing for Multi-Flow in Wireless Mesh Networks

HE Shi-ming; ZHANG Da-fang; XIE Kun; ZHANG Ji; QIAO Hong

doi:10.3969/j.issn.0372-2112.2014.05.027

您当前的位置：

首页 >

文章列表页 >

Opportunistic Routing for Multi-Flow in Wireless Mesh Networks

更新时间：2025-07-16

- Opportunistic Routing for Multi-Flow in Wireless Mesh Networks
- Acta Electronica Sinica Vol. 42, Issue 5, Pages: 1004-1008(2014)
- 作者机构：
  
  湖南大学信息科学与工程学院,湖南,长沙,410082
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2014.05.027
  CLC： TP393
- Published：2014
- 稿件说明：
移动端阅览
HE Shi-ming, ZHANG Da-fang, XIE Kun, et al. Opportunistic Routing for Multi-Flow in Wireless Mesh Networks[J]. Acta Electronica Sinica, 2014, 42(5): 1004-1008.
DOI：

HE Shi-ming, ZHANG Da-fang, XIE Kun, et al. Opportunistic Routing for Multi-Flow in Wireless Mesh Networks[J]. Acta Electronica Sinica, 2014, 42(5): 1004-1008. DOI： 10.3969/j.issn.0372-2112.2014.05.027.

摘要

现有机会路由选择未考虑数据流的分布，可能使候选节点空闲或过载，导致网络吞吐量提升有限.本文将多并发流的机会路由描述成一个凸优化问题，基于对偶和子梯度方法，提出分布式联合候选节点选择和速率分配的多流机会路由算法(Opportunistic Routing for Multi-Flow，ORMF).该算法迭代进行流速率分配，并在速率分配过程中完成候选节点选择.实验结果表明，与基于期望传输次数和期望任意传输次数指标的机会路由相比，ORMF平均可提高33.4%和27.9%的汇聚吞吐量.

Abstract

Opportunistic routing (OR) does not take account of the traffic load

therefore

some nodes may be overloaded while the others may be idle

leading to network performance decline.The OR for multi-flow is described as a convex optimization problem.By primal-dual and sub-gradient methods

a distributed joint candidate nodes selection and rate allocation opportunistic routing for multi-flow algorithm (ORMF) is proposed.ORMF allocates the flow rate iteratively which decides the candidate node.The simulation results show that the throughputs of ORMF are 33.4% and 27.9%

higher than those of OR with expected transmission number and expected anycast transmission metrics

respectively.

关键词

Keywords

references

Views

1528

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Multicast Opportunistic Routing in Wireless Mesh Network

Social Context-Aware Routing Algorithms in Opportunistic Networks

Energy-Efficient Reliable Opportunistic Routing Applying Random Network Coding for Wireless Sensor Network

Related Author

FONT

HE Qian

LI Xiao-hui

FAN Xiu-mei

Verdana

FONT face

QIN Zhen-quan

HONG Pei-lin

Related Institution

北京理工大学计算机科学技术学院

河南省图书馆数字资源部

北京理工大学软件学院

Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University

Department of Electronic Engineering and Information Science,University of Science and Technology of China

⁰