liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Yuan, Di
Alternative names
Publications (10 of 129) Show all publications
Tatino, C., Malanchini, I., Pappas, N. & Yuan, D. (2018). Maximum Throughput Scheduling for Multi-connectivity in Millimeter-Wave Networks. In: 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt): International Workshop on Resource Allocation, Cooperation and Competition in Wireless Networks (RAWNET). Paper presented at 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), Shanghai, China, May 7-11, 2018. IEEE
Open this publication in new window or tab >>Maximum Throughput Scheduling for Multi-connectivity in Millimeter-Wave Networks
2018 (English)In: 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt): International Workshop on Resource Allocation, Cooperation and Competition in Wireless Networks (RAWNET), IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

Multi-connectivity is emerging as promising solution to provide reliable communications and seamless connectivity at the millimeter-wave frequency range. Due to the obstacles that cause frequent interruptions at such high frequency range, connectivity to multiple cells can drastically increase the network performance in terms of throughput and reliability by coordi- nation among the network elements. In this paper, we propose an algorithm for the link scheduling optimization that maximizes the network throughput for multi-connectivity in millimeter-wave cellular networks. The considered approach exploits a centralized architecture, fast link switching, proactive context preparation and data forwarding between millimeter-wave access points and the users. The proposed algorithm is able to numerically approach the global optimum and to quantify the potential gain of multi-connectivity in millimeter-wave cellular networks. 

Place, publisher, year, edition, pages
IEEE, 2018
National Category
Communication Systems Telecommunications
Identifiers
urn:nbn:se:liu:diva-146211 (URN)10.23919/WIOPT.2018.8362891 (DOI)000434872700066 ()9783903176003 (ISBN)9781538646212 (ISBN)
Conference
16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), Shanghai, China, May 7-11, 2018
Funder
ELLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsEU, Horizon 2020, 643002
Note

Funding agencies: European Unions Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant [643002]; CENIIT

Available from: 2018-04-02 Created: 2018-04-02 Last updated: 2018-09-28
He, Q., Yuan, D. & Ephremides, A. (2018). Optimal Link Scheduling for Age Minimization in Wireless Systems. IEEE Transactions on Information Theory, 64(7), 5381-5394
Open this publication in new window or tab >>Optimal Link Scheduling for Age Minimization in Wireless Systems
2018 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 64, no 7, p. 5381-5394Article in journal (Refereed) Published
Abstract [en]

Information age is a recently introduced metric to represent the freshness of information in communication systems. We investigate age minimization in a wireless network and propose a novel approach of optimizing the scheduling strategy to deliver all messages as fresh as possible. Specifically, we consider a set of links that share a common channel. The transmitter at each link contains a given number of packets with time stamps from an information source that generated them. We address the link transmission scheduling problem with the objective of minimizing the overall age. This minimum age scheduling problem (MASP) is different from minimizing the time or the delay for delivering the packets in question. We model the MASP mathematically and prove it is NP-hard in general. We also identify tractable cases as well as optimality conditions. An integer linear programming formulation is provided for performance benchmarking. Moreover, a steepest age descent algorithm with better scalability is developed. Numerical study shows that, by employing the optimal schedule, the overall age is significantly reduced in comparison to other scheduling strategies.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2018
Keywords
Information age; link scheduling; optimization; wireless networks
National Category
Communication Systems
Identifiers
urn:nbn:se:liu:diva-149703 (URN)10.1109/TIT.2017.2746751 (DOI)000435979500038 ()
Note

Funding Agencies|EC Marie Curie Actions Projects MESH-WISE [324515]; Career LTE [329313]; National Science Foundation [CCF-0728966, CCF-1420651]; ONR [N000141410107]

Available from: 2018-07-24 Created: 2018-07-24 Last updated: 2018-08-14
Pappas, N., Jeon, J., Yuan, D., Traganitis, A. & Ephremides, A. (2018). Wireless Network-Level Partial Relay Cooperation: A Stable Throughput Analysis. Journal of Communications and Networks, 20(1), 93-101
Open this publication in new window or tab >>Wireless Network-Level Partial Relay Cooperation: A Stable Throughput Analysis
Show others...
2018 (English)In: Journal of Communications and Networks, ISSN 1229-2370, E-ISSN 1976-5541, Vol. 20, no 1, p. 93-101Article in journal (Refereed) Published
Abstract [en]

In this work, we study the benefit of partial relay cooperation. We consider a two-node system consisting of one source and one relay node transmitting information to a common destination. The source and the relay have external traffic and in addition, the relay is equipped with a flow controller to regulate the incoming traffic from the source node. The cooperation is performed at the network level. A collision channel with erasures is considered. We provide an exact characterization of the stability region of the system and we also prove that the system with partial cooperation is always better or at least equal to the system without the flow controller. 

Keywords
Network level cooperation, partial cooperation, queueing, random access, relay, stability region.
National Category
Communication Systems Telecommunications
Identifiers
urn:nbn:se:liu:diva-145635 (URN)10.1109/JCN.2018.000009 (DOI)000428149300009 ()
Funder
ELLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsEU, Horizon 2020, 645705EU, FP7, Seventh Framework Programme, 612361EU, Horizon 2020, 642743
Note

Funding agencies: People Programme (Marie Curie Actions) of the European Unions Seventh Framework Programme FP7/under REA [[612361]-SOrBet]; EU project DECADE [H2020-MSCA-2014-RISE: 645705]; European Union [642743]; MURI [W911NF-08-1-0238]; NSF [CCF1420651]; ONR [N00014141

Available from: 2018-03-10 Created: 2018-03-10 Last updated: 2018-04-11Bibliographically approved
He, Q., Yuan, D. & Ephremides, A. (2017). Maximum Link Activation with Cooperative Transmission and Interference Cancellation in Wireless Networks. Paper presented at 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), September 2-5, Washington DC, DC, USA. IEEE Transactions on Mobile Computing, 16(2), 408-421
Open this publication in new window or tab >>Maximum Link Activation with Cooperative Transmission and Interference Cancellation in Wireless Networks
2017 (English)In: IEEE Transactions on Mobile Computing, ISSN 1536-1233, E-ISSN 1558-0660, Vol. 16, no 2, p. 408-421Article in journal (Refereed) Published
Abstract [en]

We address the maximum link activation problem in wireless networks with new features, namely when the transmitters can perform cooperative transmission, and the receivers are able to perform successive interference cancellation. In this new problem setting, which transmitters should transmit and to whom, as well as the optimal cancellation patterns at the receivers, are strongly intertwined. We present contributions along three lines. First, we provide a thorough tractability analysis, proving the NP-hardness as well as identifying tractable cases. Second, for benchmarking purposes, we deploy integer linear programming for achieving global optimum using off-theshelf optimization methods. Third, to overcome the scalability issue of integer programming, we design a sub-optimal but efficient optimization algorithm for the problem in its general form, by embedding maximum-weighted bipartite matching into local search. Numerical results are presented for performance evaluation, to validate the benefit of cooperative transmission and interference cancellation for maximum link activation and to demonstrate the effectiveness of the proposed algorithm.

Place, publisher, year, edition, pages
IEEE, 2017
National Category
Communication Systems Telecommunications
Identifiers
urn:nbn:se:liu:diva-112447 (URN)10.1109/TMC.2016.2546906 (DOI)000393808500009 ()
Conference
2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), September 2-5, Washington DC, DC, USA
Note

Funding agencies: Swedish Research Council; EU FP7 Marie Curie [324515, 329313]; National Science Foundation [CCF-0728966, CCF-1420651]; ONR [N000141410107]

Available from: 2014-11-27 Created: 2014-11-27 Last updated: 2018-08-14Bibliographically approved
Chen, B., Chen, Z., Pappas, N., Yuan, D. & Zhang, J. (2017). Modeling and Analysis of MPTCP Proxy-based LTE-WLAN Path Aggregation. In: IEEE Global Communications Conference (GLOBECOM) 2017: . Paper presented at IEEE Global Communications Conference (GLOBECOM), Singapore, December 4-8, 2017. IEEE Communications Society
Open this publication in new window or tab >>Modeling and Analysis of MPTCP Proxy-based LTE-WLAN Path Aggregation
Show others...
2017 (English)In: IEEE Global Communications Conference (GLOBECOM) 2017, IEEE Communications Society, 2017Conference paper, Published paper (Refereed)
Abstract [en]

Long Term Evolution (LTE)-Wireless Local Area Network (WLAN) Path Aggregation (LWPA) based on Multi- path Transmission Control Protocol (MPTCP) has been under standardization procedure as a promising and cost-efficient solution to boost Downlink (DL) data rate and handle the rapidly increasing data traffic. This paper aims at providing tractable analysis for the DL performance evaluation of large-scale LWPA networks with the help of tools from stochastic geometry. We consider a simple yet practical model to determine under which conditions a native WLAN Access Point (AP) will work under LWPA mode to help increasing the received data rate. Using stochastic spatial models for the distribution of WLAN APs and LTE Base Stations (BSs), we analyze the density of active LWPA- mode WiFi APs in the considered network model, which further leads to closed-form expressions on the DL data rate and area spectral efficiency (ASE) improvement. Our numerical results illustrate the impact of different network parameters on the performance of LWPA networks, which can be useful for further performance optimization. 

Place, publisher, year, edition, pages
IEEE Communications Society, 2017
Series
IEEE Global Communications Conference, ISSN 2334-0983
Keywords
LTE, WiFi, Path Aggregation, MPTCP, Stochastic Geometry
National Category
Communication Systems Telecommunications
Identifiers
urn:nbn:se:liu:diva-140159 (URN)10.1109/GLOCOM.2017.8254058 (DOI)000428054300138 ()
Conference
IEEE Global Communications Conference (GLOBECOM), Singapore, December 4-8, 2017
Projects
DECADE (Deploying High Capacity Dense Small Cell Heterogeneous Networks)
Funder
EU, Horizon 2020
Note

Funding agencies: This work was supported in part by the Swedish Foundation for Strategic Research (SSF), the Swedish Research Council (VR), ELLIIT, the joint research project DECADE (Deploying High Capacity Dense Small Cell Heterogeneous Networks), within the Research and Innovation Staff Exchange (RISE) scheme of the European Horizon 2020 Framework Program, under contract number 645705.

Available from: 2017-09-01 Created: 2017-09-01 Last updated: 2018-04-26Bibliographically approved
Sun, W., Yuan, D., Ström, E. G. & Brännström, F. (2016). Cluster-Based Radio Resource Management for D2D-Supported Safety-Critical V2X Communications. IEEE Transactions on Wireless Communications, 15(4), 2756-2769
Open this publication in new window or tab >>Cluster-Based Radio Resource Management for D2D-Supported Safety-Critical V2X Communications
2016 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 15, no 4, p. 2756-2769Article in journal (Refereed) Published
Abstract [en]

Deploying direct device-to-device (D2D) links is a promising technology for vehicle-to-X (V2X) applications. However, intracell interference, along with stringent requirements on latency and reliability, are challenging issues. In this paper, we study the radio resource management problem for D2D-based safety-critical V2X communications. We first transform the V2X requirements into the constraints that are computable using slowly varying channel state information only. Secondly, we formulate an optimization problem, taking into account the requirements of both vehicular users (V-UEs) and cellular users (C-UEs), where resource sharing can take place not only between a V-UE and a C-UE but also among different V-UEs. The NP-hardness of the problem is rigorously proved. Moreover, a heuristic algorithm, called Cluster-based Resource block sharing and pOWer allocatioN (CROWN), is proposed to solve this problem. Finally, simulation results indicate promising performance of the CROWN scheme.

Place, publisher, year, edition, pages
IEEE Press, 2016
Keywords
D2D communication; radio resource management; V2X communication
National Category
Civil Engineering
Identifiers
urn:nbn:se:liu:diva-127781 (URN)10.1109/TWC.2015.2509978 (DOI)000374240500024 ()
Note

Funding Agencies|Swedish Research Council [2011-5824]; EU [ICT-317669]; European FP7 Marie Curie IOF Grant [329313]

Available from: 2016-05-12 Created: 2016-05-12 Last updated: 2017-11-30
Li, Y., Pappas, N., Angelakis, V., Pioro, M. & Yuan, D. (2016). On the Resilient Network Design of Free Space Optical Wireless Network for Cellular Backhauling. In: Murat Uysal, Carlo Capsoni, Zabih Ghassemlooy, Anthony Boucouvalas, Eszter Udvary (Ed.), Optical Wireless Communications: (pp. 485-510). Springer
Open this publication in new window or tab >>On the Resilient Network Design of Free Space Optical Wireless Network for Cellular Backhauling
Show others...
2016 (English)In: Optical Wireless Communications / [ed] Murat Uysal, Carlo Capsoni, Zabih Ghassemlooy, Anthony Boucouvalas, Eszter Udvary, Springer, 2016, p. 485-510Chapter in book (Refereed)
Abstract [en]

With the densification of nodes in cellular networks, free space optics (FSO) connections are becoming an appealing low cost and high rate alternative to copper and fiber backhaul solutions for wireless communication systems. To en- sure a reliable cellular backhaul, provisions for redundant, disjoint paths between the nodes must be made in the design phase. This chapter aims at finding a cost- effective solution to upgrade the cellular backhaul with pre-deployed optical fibers using FSO links and mirror components. A novel integer linear programming model to approach optimal FSO backhaul design, guaranteeing K-disjoint paths connecting each node pair is presented. Next, a column generation method to a path-oriented mathematical formulation is developed. Applying the method in a sequential man- ner enables high computational scalability. Realistic scenarios are used to demon- strate the proposed approaches which efficiently provide optimal or near-optimal solutions, and thereby allow for accurately dealing with the trade-off between cost and reliability. 

Place, publisher, year, edition, pages
Springer, 2016
National Category
Communication Systems Telecommunications
Identifiers
urn:nbn:se:liu:diva-143277 (URN)10.1007/978-3-319-30201-0_22 (DOI)978-3-319-30201-0 (ISBN)
Projects
EU Marie Curie Actions project SOrBet (FP7-PEOPLE- 2013-IAPP: 612361)COST Action IC1101 OPTICWISE (Optical Wireless Communications – An Emerging Technology)European FP7 Marie Curie IOF project 329313
Available from: 2017-11-29 Created: 2017-11-29 Last updated: 2017-12-06Bibliographically approved
Li, Y., Pioro, M., Yuan, D. & Su, J. (2016). Optimizing link rate assignment and transmission scheduling in WMN through compatible set generation. Telecommunications Systems, 61(2), 325-335
Open this publication in new window or tab >>Optimizing link rate assignment and transmission scheduling in WMN through compatible set generation
2016 (English)In: Telecommunications Systems, ISSN 1018-4864, E-ISSN 1572-9451, Vol. 61, no 2, p. 325-335Article in journal (Refereed) Published
Abstract [en]

Radio links in wireless mesh networks (WMN) can select one of several modulation and coding schemes (MCS). A MCS assignment influences links data rates and their mutual interference, and therefore should be optimized. We consider joint optimization of link rate assignment and transmission scheduling in order to maximize the minimal flow in a WMN. One of the main difficulties stems from the requirement that each link has to use only one selected MCS for all its transmissions. This requirement leads to a complicated exact branch-and-price method, which is quite time-consuming for networks of practical size. Thus, we propose an original heuristic based on simulated annealing that utilizes specific characteristics of the problem. The method provides a balance between sub-optimality of the obtained solutions and the running time. The presented method is the main purpose and novelty of the paper. An extensive numerical study illustrates the effectiveness of the proposed approach.

Place, publisher, year, edition, pages
SPRINGER, 2016
Keywords
Static link rate assignment; Branch-and-price; Simulated annealing
National Category
Civil Engineering
Identifiers
urn:nbn:se:liu:diva-125822 (URN)10.1007/s11235-015-0004-y (DOI)000370168500010 ()
Note

Funding Agencies|EC Marie Curie Actions project MESH-WISE [FP7-PEOPLE-2012-IAPP-324515]; Excellence Center at Linkoping-Lund in Information Technology (ELLIIT); National Science Centre (Poland) [2011/01/B/ST7/02967]; Chinese Scholarship Council; European FP7 Marie Curie IOF grant [329313]

Available from: 2016-03-08 Created: 2016-03-04 Last updated: 2017-11-30
Zhao, Y., Larsson, T., Yuan, D., Rönnberg, E. & Lei, L. (2016). Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation. Optimization and Engineering, 17(4), 695-725
Open this publication in new window or tab >>Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation
Show others...
2016 (English)In: Optimization and Engineering, ISSN 1389-4420, E-ISSN 1573-2924, Vol. 17, no 4, p. 695-725Article in journal (Refereed) Published
Abstract [en]

We study resource allocation in cellular systems and consider the problem of finding a power efficient scheduling in an uplink single carrier frequency division multiple access system. Due to the discrete nature of this problem and its computational difficulty, particularly in a real-time setting, the use of suboptimal algorithms is common practice. We aim at an effective way of gauging the performance of suboptimal algorithms by finding tight bounds on the global optimum. Toward this end, we first provide a basic integer linear programming formulation. Then we propose a significantly stronger column-oriented formulation and a corresponding column generation method, as well as an enhanced column generation scheme. The latter extends the first scheme through the inclusion of a stabilization technique, an approximate column generation principle, and a tailored heuristic that is embedded in the column generation scheme to find high-quality though not necessarily global optimal solutions. The computational evaluation demonstrates that compared with a poor performance by the integer linear programming formulation, the column generation method can produce near-optimal schedules that enable a sharp bounding interval. The enhanced column generation method significantly sharpens the bounding interval. Hence the column generation approach serves well for the purpose of benchmarking results for large-scale instances.

Place, publisher, year, edition, pages
Springer-Verlag New York, 2016
Keywords
Localized SC-FDMA, Stabilized column generation, Power minimization, Integer linear programming, Uplink scheduling, Matheuristic
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-127355 (URN)10.1007/s11081-015-9304-z (DOI)000387857500004 ()
Note

Funding agencies: Research School in Interdisciplinary Mathematics at Linkoping University; Excellence Center at Linkoping - Lund in Information Technology, Centrum for Industriell Informationsteknologi, Linkoping University, EC FP7 Marie Curie Project [318992]; Chinese Sc

Available from: 2016-04-22 Created: 2016-04-22 Last updated: 2018-06-25Bibliographically approved
Huang, S., Ephremides, A. & Yuan, D. (2015). A Non-uniform Bandwidth Allocation Scheme for Efficient Cognitive Spectrum Access. In: 2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC): . Paper presented at IEEE International Conference on Communications (ICC) (pp. 7725-7730). IEEE
Open this publication in new window or tab >>A Non-uniform Bandwidth Allocation Scheme for Efficient Cognitive Spectrum Access
2015 (English)In: 2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), IEEE , 2015, p. 7725-7730Conference paper, Published paper (Refereed)
Abstract [en]

In cognitive communication, dynamic sensing and opportunistic accessing enable secondary users to recognize and utilize the white spaces of the licensed bandwidth. Most present efforts focus on designing smarter channel sensing and access algorithms for secondary users to optimize the overall throughput and bandwidth utilization efficiency, without interfering with primary users communication. However, the transmission of the primary users are basically random and unpredictable, which usually makes the cognitive process complex and ineffective. In this paper, a non-uniform bandwidth allocation scheme is proposed, in order to regularize primary users bandwidth occupancy, which can in turn improve the sensing efficiency and throughput of the secondary users. The performance benefits are demonstrated analytically and verified by numerical simulations. In comparison to the conventional uniform bandwidth allocation scheme, the non-uniform scheme shows a higher sensing efficiency and spectrum utilization due to less bandwidth loss and lower sensing cost.

Place, publisher, year, edition, pages
IEEE, 2015
Series
IEEE International Conference on Communications, ISSN 1550-3607
Keywords
Cognitive communication; non-uniform bandwidth allocation; sensing efficiency
National Category
Civil Engineering
Identifiers
urn:nbn:se:liu:diva-127297 (URN)10.1109/ICC.2015.7249562 (DOI)000371708107158 ()978-1-4673-6432-4 (ISBN)
Conference
IEEE International Conference on Communications (ICC)
Available from: 2016-04-20 Created: 2016-04-19 Last updated: 2016-04-20
Organisations

Search in DiVA

Show all publications