RW-MC：基于随机游走的自适应矩阵填充算法

王新恒; 王倩云; 王佳杰; 赵国锋; 靳文强

doi:10.11959/j.issn.1000-436x.2017186

您当前的位置：

首页 >

文章列表页 >

RW-MC：基于随机游走的自适应矩阵填充算法

学术论文 | 更新时间：2024-06-05

- RW-MC：基于随机游走的自适应矩阵填充算法
- RW-MC:self-adaptive random walk based matrix completion algorithm
- 通信学报 2017年38卷第9期页码：95-105
- 作者机构：
  
  重庆邮电大学通信学院，重庆 400065
- 作者简介：
  
  [ "王新恒（1988-），男，山东枣庄人，重庆邮电大学博士生，主要研究方向为网络测量、SDN、NFV以及无线通信。" ]
  [ "王倩云（1992-），女，四川渠县人，重庆邮电大学硕士生，主要研究方向为无线局域网节能、网络测量。" ]
  [ "王佳杰（1992-），男，河北唐山人，重庆邮电大学硕士生，主要研究方向为网络测量、无线通信。" ]
  [ "赵国锋（1972-），男，陕西西安人，博士，重庆邮电大学教授，主要研究方向为未来网络、SDN、NFV、网络安全等。" ]
  [ "靳文强（1993-），男，内蒙古乌兰察布人，重庆邮电大学硕士生，主要研究方向为未来网络、SDN、NFV以及无线通信。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61402065);国家重点基础研究发展计划（“973”计划）基金资助项目(2012CB315803);国家重点基础研究发展计划(“973”计划)基金资助项目(2012CB315806)
- DOI：10.11959/j.issn.1000-436x.2017186
  中图分类号： TP319
- 网络出版日期：2017-09，
  
  纸质出版日期：2017-09-25
- 稿件说明：
移动端阅览
王新恒, 王倩云, 王佳杰, 等. RW-MC：基于随机游走的自适应矩阵填充算法[J]. 通信学报, 2017,38(9):95-105.

Xin-heng WANG, Qian-yun WANG, Jia-jie WANG, et al. RW-MC:self-adaptive random walk based matrix completion algorithm[J]. Journal on communications, 2017, 38(9): 95-105.
王新恒, 王倩云, 王佳杰, 等. RW-MC：基于随机游走的自适应矩阵填充算法[J]. 通信学报, 2017,38(9):95-105. DOI： 10.11959/j.issn.1000-436x.2017186.

Xin-heng WANG, Qian-yun WANG, Jia-jie WANG, et al. RW-MC:self-adaptive random walk based matrix completion algorithm[J]. Journal on communications, 2017, 38(9): 95-105. DOI： 10.11959/j.issn.1000-436x.2017186.

摘要

为了对软件定义无线网络系统中虚拟接入点（VAP）状态信息进行实时测量，根据实际网络中虚拟接入点性能的数据特征，提出一种基于随机游走的自适应矩阵填充算法（RW-MC）。首先，基于离散度和覆盖度的采样模型确定初始样本点；然后，利用随机游走模型对之前时隙的采样点序列建模分析，确定新时隙的测量点；最后，比较相邻窗口的恢复矩阵中重叠部分的误差率与标准误差，实现测量点的动态自适应。实验表明，该测量方法能够在低采样率、低误差的情况下实现对全网VAP实时感知。

Abstract

Concerning the continually perceiving performance of virtual access points (VAP) was urgent in software-defined wireless network (SDWN)

with the features of VAPs’ measurement data (VMD)

a self-adaptive matrix completion algorithm based on random walk was proposed

named RW-MC.Firstly

the discrete ratio and covering ratio of VMD account for a sample determination model was used to claim initial samples.Secondly

random walk model was implemented for generating sampling data points in the next iteration.Finally

a self-adaptive sampling redress model concerning the differences between the current error rates and normalize error rates of neighboring completion matrices.The experiments show that the approach can collect the real-time sensory data

meanwhile

maintain a relatively low error rate for a small sampling rate.

关键词

Keywords

references

RIGGIO R , MARINA M K , SCHULZ-ZANDER J , et al . Programming abstractions for software-defined wireless networks [J ] . IEEE Transactions on Network and Service Management , 2015 , 12 ( 2 ): 146 - 162 .

NGUYEN T T , BONNET C , HARRI J . SDN-based distributed mobility management for 5G networks [C ] // Wireless Communications and Networking Conference (WCNC) . 2016 : 1 - 7 .

AKYILDIZ I F , NIE S , LIN S C , et al . 5G roadmap:10 key enabling technologies [J ] . Computer Networks , 2016 , 106 : 17 - 48 .

SCHULZ-ZANDER J , MAYER C , CIOBOTARU B , et al . OpenSDWN:programmatic control over home and enterprise WiFi [C ] // Proceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research . 2015 :16.

TANAKA T , ABE K , AUST S , et al . Automatic and cooperative sleep control strategies for power-saving in radio-on-demand WLANs [C ] // Green Technologies Conference . 2013 : 293 - 300 .

LIU Z , LIU Y , GONG Z , et al . A mutil-rate access point selection policy in IEEE 802.11 WLANs [C ] // 2011 International Conference on Multimedia Technology (ICMT) . 2011 : 63 - 67 .

MO Y , CAI Y , WANG B . A novel indoor localization method based on virtual AP estimation [C ] // IEEE International Conference on Communications . 2012 : 5508 - 5512 .

HAN Z , LI H , YIN W . Compressive sensing for wireless networks [M ] . Cambridge University Press , 2013 .

QI X , WANG Y , WANG Y , et al . Compressive sensing over strongly connected digraph and its application in traffic monitoring [C ] // IEEE INFOCOM 2014 - IEEE Conference on Computer Communications . 2014 : 446 - 453 .

MALBOUBI M , WANG L , CHUAH C N , et al . Intelligent SDN based traffic (de) aggregation and measurement paradigm (iSTAMP) [C ] // IEEE INFOCOM 2014-IEEE Conference on Computer Communications . 2014 : 934 - 942 .

KESHAVAN R H , OH S , MONTANARI A . Matrix completion from a few entries [C ] // 2009 IEEE International Symposium on Information Theory . 2009 : 324 - 328 .

MALBOUBI M , GONG Y , XIONG W , et al . Software defined network inference with passive/active evolutionary-optimal probing (SNIPER) [C ] // International Conference on Computer Communication and Networks . 2015 : 1 - 8 .

XIE K , WANG L , WANG X , et al . Sequential and adaptive sampling for matrix completion in network monitoring systems [C ] // 2015 IEEE Conference on Computer Communications (INFOCOM) . 2015 : 2443 - 2451 .

HE J , SUN G , ZHANG Y , et al . Data recovery in wireless sensor networks with joint matrix completion and sparsity constraints [J ] . IEEE Communications Letters , 2015 , 19 ( 12 ): 2230 - 2233 .

CHENG J , YE Q , JIANG H , et al . STCDG:an efficient data gathering algorithm based on matrix completion for wireless sensor networks [J ] . IEEE Transactions on Wireless Communications , 2013 , 12 ( 2 ): 850 - 861 .

XIE K , WANG L , WANG X , et al . Learning from the past:intelligent on-line weather monitoring based on matrix completion [C ] // 2014 IEEE 34th International Conference Distributed Computing Systems (ICDCS) . 2014 : 176 - 185 .

RECHT B , FAZEL M , PARRILO P A . Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization [J ] . SIAM Review , 2010 , 52 ( 3 ): 471 - 501 .

FENG W , JING C , LI L . Recommender system based on random walk with topic model [C ] // International Conference on Advanced Computing . 2016 .

SHI R , GOSWAMI M , GAO J , et al . Is random walk truly memoryless- traffic analysis and source location privacy under random walks [J ] . Proceedings - IEEE INFOCOM , 2013 , 12 ( 11 ): 3021 - 3029 .

CANDÈS E J , TAO T . The power of convex relaxation:near-optimal matrix completion [J ] . IEEE Transactions on Information Theory , 2010 , 56 ( 5 ): 2053 - 2080 .

浏览量

1087

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于随机游走的社区发现方法综述

基于软件定义无线网络的云业务上行调度方案