Multiflows in multihop wireless networks

Multiflows in multihop wireless networks

ID:39972414

大小:692.61 KB

页数:10页

时间:2019-07-16

Multiflows in multihop wireless networks_第1页
Multiflows in multihop wireless networks_第2页
Multiflows in multihop wireless networks_第3页
Multiflows in multihop wireless networks_第4页
Multiflows in multihop wireless networks_第5页
资源描述:

《Multiflows in multihop wireless networks》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、MultiflowsinMultihopWirelessNetworks[ExtendedAbstract]∗Peng-JunWanDepartmentofComputerScienceIllinoisInstituteofTechnologyChicago,IL60616wan@cs.iit.eduABSTRACTsingle-radiosingle-channelmultihopwirelessnetworkNisspecified,initsmostgeneralformat,byatriple(D,G,b),Thispaperstudiesmaximummu

2、lticommodityflowandwhereDisadirectedgraphrepresentingthecommunica-maximumconcurrentflowinmultihopwirelessnetworkstiontopologyofN,Gisanundirectedgraphrepresentingsubjecttobothbandwidthandinterferenceconstraints.Thetheconflictgraphofthe(communication)linksinD,andbisexistingproofoftheNP-ha

3、rdnessofbothproblemsistoothebandwidthfunctionofthelinksinD.AsetoflinksinDcontrivedtobeapplicabletomeaningfulmultihopwirelessaresaidtobeconflict-freeiftheyarenotadjacentpairwisenetworks.Inaddition,allknownconstant-approximationinG.ConsideramultihopwirelessnetworkN=(D,G,b)algorithmsforb

4、othproblemsrestrictedtovariousnetworkwithD=(V,A).WeuseItodenotethecollectionofsetsclassesaresuper-exponentialinrunningtime.Someofthemofconflict-freelinksinD.A(fractional)linkscheduleinNaresimplyincorrect.Inthispaper,wefirstprovidearig-isasetorousproofoftheNP-hardnessofbothproblemseveni

5、nverysimplesettings.Then,weshowthatbothproblemsS={(Ij,λj):1≤j≤k}restrictedtoabroadfamilyofmultihopwirelessnetworkswithIj∈I,andλj∈R+foreach1≤j≤k.Thevalueadmitpolynomial-timeapproximationscheme(PTAS).Af-Pkterthat,wedevelopaunifiedframeworkforthedesignandj=1λjisreferredtoasthelength(orla

6、tency)ofS,andanalysisofpolynomialapproximationalgorithmsforboth

7、S

8、iscalledthesizeofS.AnylinkscheduleSinNoflengthproblems.Followingsuchframework,weobtainpolyno-AatmostonedeterminesalinkcapacityfunctioncS∈R+ofmialconstant-approximationalgorithmsforbothproblemsDgivenbyrestrictedtoabroad

9、networkfamily.TheapproximationXratiosofthesealgorithmsarealsobetterthanthoseknowncS(e)=b(e)λj

10、Ij∩{e}

11、intheliterature.1≤j≤kforeache∈A.SupposethatwearegivenwithasetofCategoriesandSubjectDescriptorscommoditiesinD.ForanylinkscheduleSinNoflengthatmostone,themaximummultiflowofthesecommoditi

12、esC.2.1[Comp

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。