Interference-controlled D2D routing aided by knowledge extraction at cellular infrastructure towards ubiquitous CPS

被引:38
作者
Du, Qinghe [1 ,2 ]
Song, Houbing [3 ]
Xu, Qian [1 ]
Ren, Pinyi [1 ]
Sun, Li [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing, Jiangsu, Peoples R China
[3] W Virginia Univ, Dept Elect & Comp Engn, Montgomery, AL USA
基金
中国国家自然科学基金;
关键词
Device-to-device networks; CPS; IoT; Big data; Multi-hop; Routing; Interference management; Wireless communications;
D O I
10.1007/s00779-015-0872-x
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Device-to-device (D2D) networks underlaying cellular networks are widely recognized as one of the major approaches for ubiquitous information acquisition and exchange, which features the future cyber-physical systems (CPSs). In this paper, we propose the interference-controlled D2D routing designs underlaying cellular networks, i.e. sharing/reusing the cellular spectrum, to support multi-hop D2D transmissions and thus enhancing the flexibility of CPS. The unique feature and challenge for this task include threefolds. First, the huge density of device nodes in future cellular networks yields huge amount of information to process. Second, as device nodes in cellular networks do not maintain the routing table, the route selection via low-complexity knowledge-extraction approach over huge amount of information needs to be performed by the base station (BS). Third, the interference generated by reusing cellular spectrum needs to be thoroughly controlled. To address these issues, we in this work consider two D2D networking scenarios that allow D2D users to share the uplink and downlink spectrum of cellular networks, respectively. Our objective for routing is hop-count minimization such that the delay and power consumptions can be decreased. In particular, we propose a maximum rate towards destination (MR-D) routing algorithm for the scenario sharing uplink spectrum and a MR-D advanced (MR-DA) routing algorithm for the scenario sharing downlink spectrum, respectively. Both algorithms have low computational complexity and thus meaningful for practical systems. Furthermore, our routing designs can avoid the violation of tolerable interferences to cellular users as well as to fulfil the rate requirement of D2D services. Also conducted are abundant simulation evaluations to demonstrate the advantages of our proposed schemes as compared to the baseline schemes including the farthest neighbour routing and closest to destination routing scheme.
引用
收藏
页码:1033 / 1043
页数:11
相关论文
共 14 条
[1]  
[Anonymous], 2014, Rep. 36.843
[2]  
[Anonymous], 2009, LTE The UMTS Long Term Evolution,FROM THEORY TO PRACTICE
[3]  
Cormen T, 2001, INTRO ALGORITHMS, DOI DOI 10.1145/963770.963776
[4]  
Fitzek FHP, 2006, P WIR WORLD RES FOR, V17, P1
[5]  
Han J., 2012, Data Mining, P393, DOI [DOI 10.1016/C2009-0-61819-5, DOI 10.1016/B978-0-12-381479-1.00009-5, 10.1016/B978-0-12-381479-1.00009-5]
[6]  
Janis Pekka, 2009, International Journal of Communications, Networks and System Sciences, V2, P169, DOI 10.4236/ijcns.2009.23019
[7]   Spectrum Sharing Scheme Between Cellular Users and Ad-hoc Device-to-Device Users [J].
Kaufman, Brett ;
Lilleberg, Jorma ;
Aazhang, Behnaam .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (03) :1038-1049
[8]  
Koskela T., 2010, IEEE WIRELESS COMMUN, P1, DOI DOI 10.1109/WCNC.20
[9]   Reliability Improvement Using Receive Mode Selection in the Device-to-Device Uplink Period Underlaying Cellular Networks [J].
Min, Hyunkee ;
Seo, Woohyun ;
Lee, Jemin ;
Park, Sungsoo ;
Hong, Daesik .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2011, 10 (02) :413-418
[10]  
Tanenbaum Andrew S, 2003, COMPUTER NETWORKS