{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T09:23:06Z","timestamp":1771060986837,"version":"3.50.1"},"reference-count":44,"publisher":"MDPI AG","issue":"13","license":[{"start":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T00:00:00Z","timestamp":1562112000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002560","name":"Soonchunhyang University","doi-asserted-by":"publisher","award":["the Soonchunhyang University Research Fund"],"award-info":[{"award-number":["the Soonchunhyang University Research Fund"]}],"id":[{"id":"10.13039\/501100002560","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China 333","award":["2016YFB0200902"],"award-info":[{"award-number":["2016YFB0200902"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Mobile cellular communications are experiencing an exponential growth in traffic load on Long Term Evolution (LTE) eNode B (eNB) components. Such load can be significantly contained by directly sharing content among nearby users through device-to-device (D2D) communications, so that repeated downloads of the same data can be avoided as much as possible. Accordingly, for the purpose of improving the efficiency of content sharing and decreasing the load on the eNB, it is important to maximize the number of simultaneous D2D transmissions. Specially, maximizing the number of D2D links can not only improve spectrum and energy efficiency but can also reduce transmission delay. However, enabling maximum D2D links in a cellular network poses two major challenges. First, the interference between the D2D and cellular communications could critically affect their performance. Second, the minimum quality of service (QoS) requirement of cellular and D2D communication must be guaranteed. Therefore, a selection of active links is critical to gain the maximum number of D2D links. This can be formulated as a classical integer linear programming problem (link scheduling) that is known to be NP-hard. This paper proposes to obtain a set of network features via deep learning for solving this challenging problem. The idea is to optimize the D2D link schedule problem with a deep neural network (DNN). This makes a significant time reduction for delay-sensitive operations, since the computational overhead is mainly spent in the training process of the model. The simulation performed on a randomly generated link schedule problem showed that our algorithm is capable of finding satisfactory D2D link scheduling solutions by reducing computation time up to 90% without significantly affecting their accuracy.<\/jats:p>","DOI":"10.3390\/s19132941","type":"journal-article","created":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T11:13:18Z","timestamp":1562238798000},"page":"2941","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Deep Learning Approach for Maximum Activity Links in D2D Communications"],"prefix":"10.3390","volume":"19","author":[{"given":"Bocheng","family":"Yu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xi\u2019an Jiaotong University, Xi\u2019an 710049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingjun","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi\u2019an Jiaotong University, Xi\u2019an 710049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Palmieri","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Salerno, 84084 Fisciano (SA), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erwan","family":"Creignou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi\u2019an Jiaotong University, Xi\u2019an 710049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilsun","family":"You","sequence":"additional","affiliation":[{"name":"Department of Information Security Engineering, Soonchunhyang University, Asan-si 31538, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,7,3]]},"reference":[{"key":"ref_1","unstructured":"GSMA (2018, April 12). The Mobile Economy 2018 (white paper). Available online: https:\/\/www.gsma.com\/mobileeconomy\/."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1109\/COMST.2014.2319555","article-title":"A survey on device-to-device communication in cellular networks","volume":"16","author":"Asadi","year":"2014","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MCOM.2014.6807945","article-title":"An overview of 3GPP device-to-device proximity services","volume":"52","author":"Lin","year":"2014","journal-title":"IEEE Commun. Mag."},{"key":"ref_4","first-page":"41","article-title":"Security of 5G-Mobile Backhaul Networks: A Survey","volume":"9","author":"Choudhary","year":"2018","journal-title":"J. Wirel. Mob. Netw. Ubiquitous Comput. Dependable Appl."},{"key":"ref_5","first-page":"1","article-title":"Device Identification and Personal Data Attestation in Networks","volume":"9","author":"Gritti","year":"2018","journal-title":"J. Wirel. Mob. Netw. Ubiquitous Comput. Dependable Appl."},{"key":"ref_6","first-page":"1","article-title":"A survey on driverless vehicles: from their diffusion to security features","volume":"8","author":"Arena","year":"2018","journal-title":"J. Internet Serv. Inf. Secur."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Lei, M., Zhang, X., Ding, H., and Yu, B. (2018). Fairness-Aware Resource Allocation in Multi-Hop Wireless Powered Communication Networks with User Cooperation. Sensors, 6.","DOI":"10.3390\/s18061890"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Liu, L., Cao, X., Shen, W., Cheng, Y., and Cai, L. (2016, January 10\u201314). Dafee: A decomposed approach for energy efficient networking in multi-radio multi-channel wireless networks. Proceedings of the 35th Annual IEEE International Conference on Computer Communications, San Francisco, CA, USA.","DOI":"10.1109\/INFOCOM.2016.7524423"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.dcan.2016.11.004","article-title":"Energy efficiency based joint cell selection and power allocation scheme for HetNets","volume":"2","author":"Mensah","year":"2016","journal-title":"Digital Commun. Networks"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Oswald, Y.A., and Wattenhofer, R. (2007, January 9\u201314). Complexity in geometric SINR. Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Montr\u00e9al, QC, Canada.","DOI":"10.1145\/1288107.1288122"},{"key":"ref_11","unstructured":"Moscibroda, T., Wattenhofer, R., and Weber, Y. (2019, January 06). Protocol Design Beyond Graph-Based Models. Available online: http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.87.4443&rep=rep1&type=pdf#page=43."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Maheshwari, R., Jain, S., and Das, S.R. (2008, January 5\u20137). A measurement study of interference modeling and scheduling in low-power wireless networks. Proceedings of the 6th ACM Conference on Embedded Network Sensor Systems, Raleigh, NC, USA.","DOI":"10.1145\/1460412.1460427"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/TVT.2011.2176520","article-title":"Maximal scheduling in wireless ad hoc networks with hypergraph interference models","volume":"61","author":"Li","year":"2012","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Wang, W., Wang, Y., Li, X.Y., Song, W.Z., and Frieder, O. (2006, January 23\u201329). Efficient interference-aware TDMA link scheduling for static wireless networks. Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, Los Angeles, CA, USA.","DOI":"10.1145\/1161089.1161119"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1007\/s10878-015-9908-4","article-title":"An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models","volume":"32","author":"Wang","year":"2016","journal-title":"J. Comb. Optim."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2295","DOI":"10.1109\/JPROC.2017.2761740","article-title":"Efficient processing of deep neural networks: A tutorial and survey","volume":"105","author":"Sze","year":"2017","journal-title":"Proc. IEEE"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1109\/LGRS.2018.2889789","article-title":"Discriminative Transfer Joint Matching for Domain Adaptation in Hyperspectral Image Classification","volume":"16","author":"Peng","year":"2019","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/TGRS.2018.2865102","article-title":"Self-Paced Joint Sparse Representation for the Classification of Hyperspectral Images","volume":"57","author":"Peng","year":"2019","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Zhang, S., Wu, R., Xu, K., Wang, J., and Sun, W. (2019). R-CNN-Based Ship Detection from High Resolution Remote Sensing Imagery. Remote Sens., 11.","DOI":"10.3390\/rs11060631"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2595","DOI":"10.1109\/COMST.2018.2846401","article-title":"Deep learning for intelligent wireless networks: A comprehensive survey","volume":"20","author":"Mao","year":"2018","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"ref_21","unstructured":"Zhang, C., Patras, P., and Haddadi, H. (2019, July 03). Deep Learning in Mobile and Wireless Networking: A Survey. Available online: https:\/\/ieeexplore.ieee.org\/abstract\/document\/8666641."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Halld\u00f3rsson, M.M., Wattenhofer, R., and Welzl, E. (2009, January 19\u201325). Capacity of arbitrary wireless networks. Proceedings of the IEEE International Conference on Computer, Rio de Janeiro, Brazil.","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"ref_23","unstructured":"Xu, X., Tang, S., and Wan, P. (2018, January 20\u201322). Maximum weighted independent set of links under physical interference model. Proceedings of the International Conference on Wireless Algorithms, Systems, and Applications, Tianjin, China."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Pei, G., and Vullikanti, A. (2012, January 11\u201314). Low-complexity scheduling for wireless networks. Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing, Hilton Head, SC, USA.","DOI":"10.1145\/2248371.2248380"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/TNET.2015.2417861","article-title":"Distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling with Fading Channels","volume":"24","author":"Joo","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Yuan, H., Jia, X., Wang, J., and Wang, Z. (2017, January 1\u20134). Maximum-weighted subset of communication requests schedulable without spectral splitting. Proceedings of the IEEE Conference on Computer Communications, Atlanta, GA, USA.","DOI":"10.1109\/INFOCOM.2017.8056982"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"806520","DOI":"10.1155\/2015\/806520","article-title":"Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR","volume":"11","author":"Deng","year":"2015","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"10166","DOI":"10.1109\/TVT.2018.2864091","article-title":"Asynchronous Distributed Greedy Link Scheduling in Multihop Wireless Networks","volume":"67","author":"Chackochan","year":"2018","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/ACCESS.2014.2325029","article-title":"Big data deep learning: challenges and perspectives","volume":"2","author":"Chen","year":"2014","journal-title":"IEEE Access"},{"key":"ref_30","first-page":"54","article-title":"Applying Big Data Processing and Machine Learning Methods for Mobile Internet of Things Security Monitoring","volume":"8","author":"Kotenko","year":"2018","journal-title":"J. Internet Serv. Inf. Secur."},{"key":"ref_31","first-page":"718","article-title":"A Novel Distributed Q-Learning Based Resource Reservation Framework for Facilitating D2D Content Access Requests in LTE-A Networks","volume":"15","author":"Kumar","year":"2018","journal-title":"IEEE Trans. Netw. Sci. Eng"},{"key":"ref_32","unstructured":"Liu, L., Yin, B., Zhang, S., Cao, X., and Cheng, Y. (2018). Deep Learning Meets Wireless Network Optimization: Identify Critical Links. IEEE Trans. Netw. Sci. Eng."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Khan, M., Alam, M., Moullec, Y., and Yaacoub, E. (2017). Throughput-Aware Cooperative Reinforcement Learning for Adaptive Resource Allocation in Device-to-Device Communication. Future Internet, 9.","DOI":"10.3390\/fi9040072"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1109\/JSAC.2019.2904352","article-title":"Spatial Deep Learning for Wireless Scheduling","volume":"37","author":"Cui","year":"2019","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Ye, H., and Li, G.Y. (2018, January 20\u201324). Deep Reinforcement Learning for Resource Allocation in V2V Communications. Proceedings of the IEEE International Conference on Communications (ICC), Kansas City, MO, USA.","DOI":"10.1109\/ICC.2018.8422586"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-016-9847-8","article-title":"On handling indicator constraints in mixed integer programming","volume":"65","author":"Belotti","year":"2016","journal-title":"Comput. Optim. Appl."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","article-title":"A branch and bound method for the multiconstraint zero-one knapsack problem","volume":"30","author":"Shih","year":"1979","journal-title":"J. Oper. Res. Soc."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02243880","article-title":"Dynamic programming algorithms for the zero-one knapsack problem","volume":"25","author":"Toth","year":"1980","journal-title":"Computing"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/inte.20.5.61","article-title":"Cutting big M down to size","volume":"20","author":"Camm","year":"1990","journal-title":"Interfaces"},{"key":"ref_40","first-page":"18","article-title":"Practical guidelines for solving difficult mixed integer linear programs","volume":"18","author":"Klotz","year":"2013","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.procs.2016.07.416","article-title":"Design index for deep neural networks","volume":"88","author":"Date","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_42","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","article-title":"Deep learning","volume":"521","author":"LeCun","year":"2015","journal-title":"Nature"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1162\/neco.2006.18.7.1527","article-title":"A fast learning algorithm for deep belief nets","volume":"18","author":"Hinton","year":"2006","journal-title":"Neural Comput."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/13\/2941\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:02:22Z","timestamp":1760187742000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/13\/2941"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,3]]},"references-count":44,"journal-issue":{"issue":"13","published-online":{"date-parts":[[2019,7]]}},"alternative-id":["s19132941"],"URL":"https:\/\/doi.org\/10.3390\/s19132941","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,3]]}}}