全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2014 

多并发流无线网状网中的机会路由算法

DOI: 10.3969/j.issn.0372-2112.2014.05.027, PP. 1004-1008

Keywords: 无线网状网,多并发流,机会路由

Full-Text   Cite this paper   Add to My Lib

Abstract:

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

References

[1]  CHACHULSKI S,JENNINGS M,KATTI S,et al.Trading structure for randomness in wireless opportunistic routing[J].Computer Communication Review,2007,37(4):169-180.
[2]  王晓东,霍广城,孙海燕,等.移动自组网中基于部分网络编码的机会主义路由[J].电子学报,2010,38(8):1736-1740. WANG Xiao-dong,HUO Guang-cheng,SUN Hai-yan,et al.An opportunistic routing for MANET based on partial network coding[J].Acta Electronica Sinica,2010,38(8):1736-1740.(in Chinese)
[3]  LAUFERR,KLEINROCK L,DOBOIS-FERRERE H.Multirate anypath routing in wireless mesh networks[A].Jim Kurose U.IEEE INFOCOM 2009 - The 28th Conference on Computer Communications[C].Piscataway,NJ:IEEE Press,2009.37-45.
[4]  DOBOIS-FERRERE H,GROSSGLAUER M,VETTERLI M.Valuable detours:least-cost opportunistic routing[J].IEEE/ACM Transactions on Networking,2011,19(2):333-346.
[5]  COUTOD D,AGUAYO D,BICKET J,et al.A high-throughput path metric for multi-hop wireless routing[J].Wireless Networks,2005,11(4):419-434. [LL]
[6]  FANGX,YANG D,XUE G.Consort:node-constrained opportunistic routing in wireless mesh networks[A].Lionel M Ni.2011 Proceedings IEEE INFOCOM[C].Piscataway,NJ:IEEE Press,2011.1907-1915.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133